{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s969540611", "group_id": "codeNet:p00002", "input_text": "#include<stdio.h>\n#include<math.h>\n\nint main() {\n\tint a, b;\n\twhile (scanf(\"%d %d\", &a, &b)) {\n\t\tif (!(a + b))printf(\"1\\n\");\n\t\tprintf(\"%d\\n\",(int)log10(a+b) + 1);\n\t}\n\treturn 0;\n}\n", "language": "C", "metadata": {"date": 1520054825, "filename_ext": "c", "original_language": "C", "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/C/s969540611.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s969540611", "user_id": "u043039307"}, "prompt_components": {"gold_output": "2\n3\n4\n", "input_to_evaluate": "#include<stdio.h>\n#include<math.h>\n\nint main() {\n\tint a, b;\n\twhile (scanf(\"%d %d\", &a, &b)) {\n\t\tif (!(a + b))printf(\"1\\n\");\n\t\tprintf(\"%d\\n\",(int)log10(a+b) + 1);\n\t}\n\treturn 0;\n}\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": 178, "cpu_time_ms": 1990, "memory_kb": 2044}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s658032569", "group_id": "codeNet:p00003", "input_text": "#include<stdio.h>\nint check(int a,int b,int c){\n\treturn (a*a==b*b+c*c||b*b==a*a+c*c||c*c==b*b+a*a)?1:0;\n}\nint main(){\n\tint x,y,a,b,c;\n\tscanf(\"%d\",&x);\n\tint *ans;\n\tans=(int*)malloc(sizeof(int)*x);\n\tfor(y=0;y<x;x++){\n\t\tscanf(\"%d %d %d\",&a,&b,&c);\n\t\tif(1==check(a,b,c))ans[y]=1;\n\t\telse ans[y]=0;\n\t}\n\tfor(y=0;y<x;x++){\n\t\tif(y)printf(\"YES\\n\");\n\t\telse printf(\"NO\\n\");\n\t}\n\treturn 0;\n}", "language": "C", "metadata": {"date": 1338150366, "filename_ext": "c", "original_language": "C", "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/C/s658032569.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s658032569", "user_id": "u884495090"}, "prompt_components": {"gold_output": "YES\nNO\nNO\n", "input_to_evaluate": "#include<stdio.h>\nint check(int a,int b,int c){\n\treturn (a*a==b*b+c*c||b*b==a*a+c*c||c*c==b*b+a*a)?1:0;\n}\nint main(){\n\tint x,y,a,b,c;\n\tscanf(\"%d\",&x);\n\tint *ans;\n\tans=(int*)malloc(sizeof(int)*x);\n\tfor(y=0;y<x;x++){\n\t\tscanf(\"%d %d %d\",&a,&b,&c);\n\t\tif(1==check(a,b,c))ans[y]=1;\n\t\telse ans[y]=0;\n\t}\n\tfor(y=0;y<x;x++){\n\t\tif(y)printf(\"YES\\n\");\n\t\telse printf(\"NO\\n\");\n\t}\n\treturn 0;\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": 377, "cpu_time_ms": 9980, "memory_kb": 408}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s985204164", "group_id": "codeNet:p00005", "input_text": "#include <stdio.h>\n\nint main(void) {\n\tlong a,b;\n\twhile(EOF!=scanf(\"%d %d\",&a,&b)){\n\t\tlong i,j;\n\t\tlong mini=a,big=b;\n\t\tif(a>b){\n\t\t    mini=b;\n\t\t    big=a;\n\t\t}\n\t\tfor(i=mini;a%i!=0 || b%i!=0;i--);\n\t\tfor(j=big;j%a!=0 || j%b!=0;j=j+big);\n\t\tprintf(\"%d %d\\n\",i,j);\n\t}\n\treturn 0;\n}", "language": "C", "metadata": {"date": 1495766116, "filename_ext": "c", "original_language": "C", "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/C/s985204164.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s985204164", "user_id": "u090833659"}, "prompt_components": {"gold_output": "2 24\n10000000 150000000\n", "input_to_evaluate": "#include <stdio.h>\n\nint main(void) {\n\tlong a,b;\n\twhile(EOF!=scanf(\"%d %d\",&a,&b)){\n\t\tlong i,j;\n\t\tlong mini=a,big=b;\n\t\tif(a>b){\n\t\t    mini=b;\n\t\t    big=a;\n\t\t}\n\t\tfor(i=mini;a%i!=0 || b%i!=0;i--);\n\t\tfor(j=big;j%a!=0 || j%b!=0;j=j+big);\n\t\tprintf(\"%d %d\\n\",i,j);\n\t}\n\treturn 0;\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": 273, "cpu_time_ms": 20000, "memory_kb": 588}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s680975798", "group_id": "codeNet:p00005", "input_text": "#include <stdio.h>\n#define max(a,b) ((a)<(b) ? (a):(b))\nint main(void)\n{\n\tint a,b,i,j;\n\n\twhile(scanf(\"%d %d\",&a,&b) != EOF){\n\t\t\t\t\t\tif((a % 2 == 0)&&(b % 2 == 0)){\n\t\t\t\t\t\t\t\t\t\tfor(i = 1;i <= max(a,b);i++){\n\t\t\t\t\t\t\t\t\t\t\t\t\t\tif(((a/2) % i == 0)&&((b/2) % i == 0)){\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tj = i;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t      }\n\t\t\t\t\t\t\t\t\t\t\t\t\t     }\n\t\t\t\t\t\t\t\t\t\tprintf(\"%d %d\\n\",2*j,a/2/j*b);\n\t\t\t\t\t\t\t\t\t      }else{\n\t\t\t\t\t\t\t\t\t\t\tfor(i = 1;i <= max(a,b);i++){\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tif((a % i == 0)&&(b % i == 0)){\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tj = i;\n\t\t\t\t\t\t\t\t\t\t\t\t\t   \t\t\t\t      \t      }\n\t\t\t\t\t\t\t\t\t       \t\t\t\t\t   }\n\t\t\t\t\t\t\t\t\t\t\tprintf(\"%d %d\\n\",j,a/j*b);\n\t\t\t\t\t  \t\t\t\t           }\n\t\t\t\t\t  }\n\treturn 0;\n}", "language": "C", "metadata": {"date": 1359899216, "filename_ext": "c", "original_language": "C", "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/C/s680975798.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s680975798", "user_id": "u514537648"}, "prompt_components": {"gold_output": "2 24\n10000000 150000000\n", "input_to_evaluate": "#include <stdio.h>\n#define max(a,b) ((a)<(b) ? (a):(b))\nint main(void)\n{\n\tint a,b,i,j;\n\n\twhile(scanf(\"%d %d\",&a,&b) != EOF){\n\t\t\t\t\t\tif((a % 2 == 0)&&(b % 2 == 0)){\n\t\t\t\t\t\t\t\t\t\tfor(i = 1;i <= max(a,b);i++){\n\t\t\t\t\t\t\t\t\t\t\t\t\t\tif(((a/2) % i == 0)&&((b/2) % i == 0)){\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tj = i;\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t      }\n\t\t\t\t\t\t\t\t\t\t\t\t\t     }\n\t\t\t\t\t\t\t\t\t\tprintf(\"%d %d\\n\",2*j,a/2/j*b);\n\t\t\t\t\t\t\t\t\t      }else{\n\t\t\t\t\t\t\t\t\t\t\tfor(i = 1;i <= max(a,b);i++){\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tif((a % i == 0)&&(b % i == 0)){\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tj = i;\n\t\t\t\t\t\t\t\t\t\t\t\t\t   \t\t\t\t      \t      }\n\t\t\t\t\t\t\t\t\t       \t\t\t\t\t   }\n\t\t\t\t\t\t\t\t\t\t\tprintf(\"%d %d\\n\",j,a/j*b);\n\t\t\t\t\t  \t\t\t\t           }\n\t\t\t\t\t  }\n\treturn 0;\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": 648, "cpu_time_ms": 1770, "memory_kb": 596}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s451094520", "group_id": "codeNet:p00008", "input_text": "#include <stdio.h>\n\nint main()\n{\n\tint n;\n\twhile(scanf(\"%d\", &n)) {\n\t\tint a, b, c, d, ans=0;\n\t\tfor(a=0;a<=9;a++) {\n\t\t\tfor(b=0;b<=9;b++) {\n\t\t\t\tfor(c=0;c<=9;c++) {\n\t\t\t\t\tfor(d=0;d<=9;d++) {\n\t\t\t\t\t\tif(a+b+c+d==n) ans++;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\tprintf(\"%d\\n\", ans);\n\t}\t\t\t\n\treturn 0;\n}\n\n\n", "language": "C", "metadata": {"date": 1531113865, "filename_ext": "c", "original_language": "C", "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/C/s451094520.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s451094520", "user_id": "u180225791"}, "prompt_components": {"gold_output": "4\n4\n", "input_to_evaluate": "#include <stdio.h>\n\nint main()\n{\n\tint n;\n\twhile(scanf(\"%d\", &n)) {\n\t\tint a, b, c, d, ans=0;\n\t\tfor(a=0;a<=9;a++) {\n\t\t\tfor(b=0;b<=9;b++) {\n\t\t\t\tfor(c=0;c<=9;c++) {\n\t\t\t\t\tfor(d=0;d<=9;d++) {\n\t\t\t\t\t\tif(a+b+c+d==n) ans++;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\tprintf(\"%d\\n\", ans);\n\t}\t\t\t\n\treturn 0;\n}\n\n\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": 279, "cpu_time_ms": 1980, "memory_kb": 2036}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s226134485", "group_id": "codeNet:p00009", "input_text": "#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\n\nint is_prime(int);\n\nint main()\n{\n\tint input_count;\n\tint prime_count;\n\tint input;\n\tint for_cnt;\n\tint output[30];\n\t\n\t\n\tinput_count = 0;\n\t\n\twhile(scanf(\"%d\", &input) != EOF && input_count < 30)\n\t{\n\t\tprime_count = 0;\n\t\t\n\t\tif(input >= 2)\n\t\t{\n\t\t\tprime_count++;\n\t\t}\n\t\tfor_cnt = 3;\n\t\twhile(for_cnt <= input)\n\t\t{\n\t\t\tif(is_prime(for_cnt))\n\t\t\t{\n\t\t\t\tprime_count++;\n\t\t\t}\n\t\t\tfor_cnt += 2;\n\t\t}\n\t\toutput[input_count] = prime_count;\n\t\tinput_count++;\n\t}\n\t\n\tfor(for_cnt = 0; for_cnt < input_count; for_cnt++)\n\t{\n\t\tprintf(\"%d\\n\", output[for_cnt]);\n\t}\n\n\t\n    return 0;\n}\n\nint is_prime(int test_num)\n{\n\tint divisor;\n\t\n\tif(test_num == 1)\n\t{\n\t\treturn 0;\n\t}\n\telse if(test_num == 2 || test_num == 3 || test_num == 5 || test_num == 7)\n\t{\n\t\treturn 1;\n\t}\n\telse if((test_num % 2) == 0)\n\t{\n\t\treturn 0;\n\t}\n\n\tfor(divisor = 3 ; divisor <= (sqrt(test_num) + 1); divisor += 2)\n\t{\n\t\tif(test_num % divisor == 0)\n\t\t{\n\t\t\treturn 0;\n\t\t}\n\t}\n\t\n\treturn 1;\n}", "language": "C", "metadata": {"date": 1476231848, "filename_ext": "c", "original_language": "C", "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/C/s226134485.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s226134485", "user_id": "u178215473"}, "prompt_components": {"gold_output": "4\n2\n5\n", "input_to_evaluate": "#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\n\nint is_prime(int);\n\nint main()\n{\n\tint input_count;\n\tint prime_count;\n\tint input;\n\tint for_cnt;\n\tint output[30];\n\t\n\t\n\tinput_count = 0;\n\t\n\twhile(scanf(\"%d\", &input) != EOF && input_count < 30)\n\t{\n\t\tprime_count = 0;\n\t\t\n\t\tif(input >= 2)\n\t\t{\n\t\t\tprime_count++;\n\t\t}\n\t\tfor_cnt = 3;\n\t\twhile(for_cnt <= input)\n\t\t{\n\t\t\tif(is_prime(for_cnt))\n\t\t\t{\n\t\t\t\tprime_count++;\n\t\t\t}\n\t\t\tfor_cnt += 2;\n\t\t}\n\t\toutput[input_count] = prime_count;\n\t\tinput_count++;\n\t}\n\t\n\tfor(for_cnt = 0; for_cnt < input_count; for_cnt++)\n\t{\n\t\tprintf(\"%d\\n\", output[for_cnt]);\n\t}\n\n\t\n    return 0;\n}\n\nint is_prime(int test_num)\n{\n\tint divisor;\n\t\n\tif(test_num == 1)\n\t{\n\t\treturn 0;\n\t}\n\telse if(test_num == 2 || test_num == 3 || test_num == 5 || test_num == 7)\n\t{\n\t\treturn 1;\n\t}\n\telse if((test_num % 2) == 0)\n\t{\n\t\treturn 0;\n\t}\n\n\tfor(divisor = 3 ; divisor <= (sqrt(test_num) + 1); divisor += 2)\n\t{\n\t\tif(test_num % divisor == 0)\n\t\t{\n\t\t\treturn 0;\n\t\t}\n\t}\n\t\n\treturn 1;\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": 970, "cpu_time_ms": 1870, "memory_kb": 596}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s241763563", "group_id": "codeNet:p00009", "input_text": "#include<stdio.h>\nint main()\n{\n\tint s,i,j;\n\tint bbb,ccc;\n\twhile((scanf(\"%d\",&s))!=EOF)\n\t{\n\t\tbbb=0;\n\t\tfor(i=2;i<=s;i++)\n\t\t{\n\t\t\tccc=0;\n\t\t\tfor(j=1;j<=i;j++)\n\t\t\t{\n\t\t\t\tif(i%j==0)\n\t\t\t\t{\n\t\t\t\t\tccc++;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif(ccc==2)\n\t\t\t{\n\t\t\t\tbbb++;\n\t\t\t}\n\t\t}\n\t\tprintf(\"%d\\n\",bbb);\n\t}\n\treturn 0;\n}", "language": "C", "metadata": {"date": 1481621005, "filename_ext": "c", "original_language": "C", "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/C/s241763563.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s241763563", "user_id": "u935300669"}, "prompt_components": {"gold_output": "4\n2\n5\n", "input_to_evaluate": "#include<stdio.h>\nint main()\n{\n\tint s,i,j;\n\tint bbb,ccc;\n\twhile((scanf(\"%d\",&s))!=EOF)\n\t{\n\t\tbbb=0;\n\t\tfor(i=2;i<=s;i++)\n\t\t{\n\t\t\tccc=0;\n\t\t\tfor(j=1;j<=i;j++)\n\t\t\t{\n\t\t\t\tif(i%j==0)\n\t\t\t\t{\n\t\t\t\t\tccc++;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif(ccc==2)\n\t\t\t{\n\t\t\t\tbbb++;\n\t\t\t}\n\t\t}\n\t\tprintf(\"%d\\n\",bbb);\n\t}\n\treturn 0;\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": 279, "cpu_time_ms": 20000, "memory_kb": 588}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s716288142", "group_id": "codeNet:p00009", "input_text": "//#include \"stdafx.h\"\n#include <stdio.h>\n#include <math.h>\n\nint main()\n{\n    int n,i,p=0,j,judge=0,a[200000];\n\twhile(scanf(\"%d\",&n)!=EOF)\n\t{\n\t\tif (n==1)\n\t\t\tp=0;\n\t\telse{\n\t\t\tp=1;//i=2,p++\n\t\t\ta[1]=2;\n\t\tfor (i=2;i<=n;i++)\n\t\t{\n\t\t\tjudge=0;\n\t\t\tfor (j=1;j<=p;j++)\n\t\t\t{\n\t\t\t\tif (i%a[j]==0){\n\t\t\t\t\tjudge=1;\n\t\t\t\t\tbreak;}\n\t\t\t\tif (j>=4){\n\t\t\t\tif (7*a[j]>i)\n\t\t\t\t\tbreak;}\n\t\t\t}\n\t\t\tif (judge==0){\n\t\t\t\tp++;\n\t\t\t\ta[p]=i;\n\t\t\t}\n\t\t}\n\t\t}\n\t\tprintf(\"%d\\n\",p);\n\t}\n\treturn 0;\n}", "language": "C", "metadata": {"date": 1484106746, "filename_ext": "c", "original_language": "C", "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/C/s716288142.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s716288142", "user_id": "u862581875"}, "prompt_components": {"gold_output": "4\n2\n5\n", "input_to_evaluate": "//#include \"stdafx.h\"\n#include <stdio.h>\n#include <math.h>\n\nint main()\n{\n    int n,i,p=0,j,judge=0,a[200000];\n\twhile(scanf(\"%d\",&n)!=EOF)\n\t{\n\t\tif (n==1)\n\t\t\tp=0;\n\t\telse{\n\t\t\tp=1;//i=2,p++\n\t\t\ta[1]=2;\n\t\tfor (i=2;i<=n;i++)\n\t\t{\n\t\t\tjudge=0;\n\t\t\tfor (j=1;j<=p;j++)\n\t\t\t{\n\t\t\t\tif (i%a[j]==0){\n\t\t\t\t\tjudge=1;\n\t\t\t\t\tbreak;}\n\t\t\t\tif (j>=4){\n\t\t\t\tif (7*a[j]>i)\n\t\t\t\t\tbreak;}\n\t\t\t}\n\t\t\tif (judge==0){\n\t\t\t\tp++;\n\t\t\t\ta[p]=i;\n\t\t\t}\n\t\t}\n\t\t}\n\t\tprintf(\"%d\\n\",p);\n\t}\n\treturn 0;\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": 446, "cpu_time_ms": 20000, "memory_kb": 900}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s722276718", "group_id": "codeNet:p00009", "input_text": "#include <stdio.h>\nmain(){\n  int n,i,j,a[1000000],k;\n  while(scanf(\"%d\",&n) !=EOF){\n    int c=0;\n    for(i=2;i<=n;i++){\n      a[i]=1;\n    }\n    for(i=2;i*i<=n;i++){\n      if(a[i]==1){\n\tk=2;\n\tj=i*2;\n\twhile(j<=n){\n\t  a[j]=0;\n\t  k++;\n\t  j=i*k;\n\t}\n      }\n    }\n    for(i=2;i<=n;i++){\n      if(a[i]==1) c++;\n    }\n    printf(\"%d\\n\",c);\n  }\n  return 0; \n}", "language": "C", "metadata": {"date": 1274343840, "filename_ext": "c", "original_language": "C", "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/C/s722276718.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s722276718", "user_id": "u915493477"}, "prompt_components": {"gold_output": "4\n2\n5\n", "input_to_evaluate": "#include <stdio.h>\nmain(){\n  int n,i,j,a[1000000],k;\n  while(scanf(\"%d\",&n) !=EOF){\n    int c=0;\n    for(i=2;i<=n;i++){\n      a[i]=1;\n    }\n    for(i=2;i*i<=n;i++){\n      if(a[i]==1){\n\tk=2;\n\tj=i*2;\n\twhile(j<=n){\n\t  a[j]=0;\n\t  k++;\n\t  j=i*k;\n\t}\n      }\n    }\n    for(i=2;i<=n;i++){\n      if(a[i]==1) c++;\n    }\n    printf(\"%d\\n\",c);\n  }\n  return 0; \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": 350, "cpu_time_ms": 90, "memory_kb": 4316}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s724833153", "group_id": "codeNet:p00009", "input_text": "#include<math.h>\nmain(){\n  int i,j,k,n,r;\n  while(scanf(\"%d\",&n)!=-1){\n    if(n<2)\n      k=0;\n    else{\n      k=1;\n      for(j=3;j<=n;j+=2){\n\tr=(int)sqrt(j)+1;\n\tfor(i=3;i<r;i+=2)\n\t  if(j%i==0){\n\t    r=0;\n\t    break;\n\t  }\n\tif(r)\n\t  k++;\n      }\n    }\n    printf(\"%d\\n\",k);\n  }\n  return 0;\n}", "language": "C", "metadata": {"date": 1301078395, "filename_ext": "c", "original_language": "C", "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/C/s724833153.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s724833153", "user_id": "u361407785"}, "prompt_components": {"gold_output": "4\n2\n5\n", "input_to_evaluate": "#include<math.h>\nmain(){\n  int i,j,k,n,r;\n  while(scanf(\"%d\",&n)!=-1){\n    if(n<2)\n      k=0;\n    else{\n      k=1;\n      for(j=3;j<=n;j+=2){\n\tr=(int)sqrt(j)+1;\n\tfor(i=3;i<r;i+=2)\n\t  if(j%i==0){\n\t    r=0;\n\t    break;\n\t  }\n\tif(r)\n\t  k++;\n      }\n    }\n    printf(\"%d\\n\",k);\n  }\n  return 0;\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": 289, "cpu_time_ms": 1750, "memory_kb": 408}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s388719475", "group_id": "codeNet:p00009", "input_text": "#include <stdio.h>\n#include <stdlib.h>\n#define FALSE 0\n#define TRUE 1\n\nint main (int argc, char* argv[])\n{\n  int i, p, k, count, n;\n  char flag[1000000];\n  \n  while (scanf(\"%d\", &n) != EOF) {\n    count = 1;\n    for (i=0; i<=n; i++) {\n      flag[i] = TRUE;\n    }\n    for (i=0; i<=n; i++) {\n      if (flag[i]) {\n\tp = i + i + 3;\n\tfor (k=i+p; k<=n; k+=p) {\n\t  flag[k] = FALSE;\n\t}\n\tif (p <= n) {\n\t  count++;\n\t}\n      }\n    }\n    printf(\"%d\\n\", count);\n  }\n  \n  return 0;\n}", "language": "C", "metadata": {"date": 1335737987, "filename_ext": "c", "original_language": "C", "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/C/s388719475.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s388719475", "user_id": "u590538929"}, "prompt_components": {"gold_output": "4\n2\n5\n", "input_to_evaluate": "#include <stdio.h>\n#include <stdlib.h>\n#define FALSE 0\n#define TRUE 1\n\nint main (int argc, char* argv[])\n{\n  int i, p, k, count, n;\n  char flag[1000000];\n  \n  while (scanf(\"%d\", &n) != EOF) {\n    count = 1;\n    for (i=0; i<=n; i++) {\n      flag[i] = TRUE;\n    }\n    for (i=0; i<=n; i++) {\n      if (flag[i]) {\n\tp = i + i + 3;\n\tfor (k=i+p; k<=n; k+=p) {\n\t  flag[k] = FALSE;\n\t}\n\tif (p <= n) {\n\t  count++;\n\t}\n      }\n    }\n    printf(\"%d\\n\", count);\n  }\n  \n  return 0;\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": 467, "cpu_time_ms": 110, "memory_kb": 1380}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s815343612", "group_id": "codeNet:p00010", "input_text": "#include <stdio.h>\n#include <math.h>\n\nint main()\n{\n  int setcount;\n  float x1, y1, x2, y2, x3, y3;\n  float nx1, ny1, nx2, ny2;\n  float nr1, nr2;\n  float xp, yp, r;\n  int tx, ty, tr, rem;\n  int i;\n\n  scanf(\"%d\", &setcount);\n  for(i=0; i<setcount; i++){\n    scanf(\"%f %f %f %f %f %f\", &x1, &y1, &x2, &y2, &x3, &y3);\n    nx1=x2-x1; ny1=y2-y1;\n    nx2=x3-x1; ny2=y3-y1;\n    nr1=nx1^2+ny1^2; nr2=nx2^2+ny2^2;\n    nr1*=0.5f; nr2*=0.5f;\n\n\n    xp=nr1+x1; yp=nr2+y1;\n    r=(float)sqrt((double)(nr1^2+nr2^2));\n    tx=xp*10000; ty=yp*10000; tr=r*10000;\n    if((rem=tx%10)<5) tx-=rem;\n    else tx+=10-rem;\n    if((rem=ty%10)<5) ty-=rem;\n    else ty+=10-rem;\n    if((rem=tr%10)<5) tr-=rem;\n    else tr+=10-rem;\n    xp=(float)tx*0.0001f; yp=(float)ty*0.0001f; r=(float)tr*0.0001f;\n\n    printf(\"%.3f %.3f %.3f\\n\", xp, yp, r);\n  }\n\n  return 0;\n}", "language": "C", "metadata": {"date": 1306815341, "filename_ext": "c", "original_language": "C", "problem_description_relpath": "problem_descriptions/p00010.html", "problem_id": "p00010", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p00010/input.txt", "sample_output_relpath": "derived/input_output/data/p00010/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p00010/C/s815343612.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Compile Error", "submission_id": "s815343612", "user_id": "u641440787"}, "prompt_components": {"gold_output": "1.000 1.000 1.414\n", "input_to_evaluate": "#include <stdio.h>\n#include <math.h>\n\nint main()\n{\n  int setcount;\n  float x1, y1, x2, y2, x3, y3;\n  float nx1, ny1, nx2, ny2;\n  float nr1, nr2;\n  float xp, yp, r;\n  int tx, ty, tr, rem;\n  int i;\n\n  scanf(\"%d\", &setcount);\n  for(i=0; i<setcount; i++){\n    scanf(\"%f %f %f %f %f %f\", &x1, &y1, &x2, &y2, &x3, &y3);\n    nx1=x2-x1; ny1=y2-y1;\n    nx2=x3-x1; ny2=y3-y1;\n    nr1=nx1^2+ny1^2; nr2=nx2^2+ny2^2;\n    nr1*=0.5f; nr2*=0.5f;\n\n\n    xp=nr1+x1; yp=nr2+y1;\n    r=(float)sqrt((double)(nr1^2+nr2^2));\n    tx=xp*10000; ty=yp*10000; tr=r*10000;\n    if((rem=tx%10)<5) tx-=rem;\n    else tx+=10-rem;\n    if((rem=ty%10)<5) ty-=rem;\n    else ty+=10-rem;\n    if((rem=tr%10)<5) tr-=rem;\n    else tr+=10-rem;\n    xp=(float)tx*0.0001f; yp=(float)ty*0.0001f; r=(float)tr*0.0001f;\n\n    printf(\"%.3f %.3f %.3f\\n\", xp, yp, r);\n  }\n\n  return 0;\n}", "problem_context": "MathJax.Hub.Config({ tex2jax: { inlineMath: [[\"$\",\"$\"], [\"\\\\(\",\"\\\\)\"]], processEscapes: true }});\n\nCircumscribed Circle of A Triangle.\n\nWrite a program which prints the central coordinate $(p_x, p_y)$ and the radius $r$ of a circumscribed circle of a triangle which is constructed by three points $(x_1, y_1)$, $(x_2, y_2)$ and $(x_3, y_3)$ on the plane surface.\n\nInput\n\nInput consists of several datasets. In the first line, the number of datasets $n$ is given. Each dataset consists of:\n\n$x_1$ $y_1$ $x_2$ $y_2$ $x_3$ $y_3$\n\nin a line. All the input are real numbers.\n\nOutput\n\nFor each dataset, print $p_x$, $p_y$ and $r$ separated by a space in a line. Print the solution to three places of decimals. Round off the solution to three decimal places.\n\nConstraints\n\n$-100 \\leq x_1, y_1, x_2, y_2, x_3, y_3 \\leq 100$\n\n$ n \\leq 20$\n\nSample Input\n\n1\n0.0 0.0 2.0 0.0 2.0 2.0\n\nOutput for the Sample Input\n\n1.000 1.000 1.414", "sample_input": "1\n0.0 0.0 2.0 0.0 2.0 2.0\n"}, "reference_outputs": ["1.000 1.000 1.414\n"], "source_document_id": "p00010", "source_text": "MathJax.Hub.Config({ tex2jax: { inlineMath: [[\"$\",\"$\"], [\"\\\\(\",\"\\\\)\"]], processEscapes: true }});\n\nCircumscribed Circle of A Triangle.\n\nWrite a program which prints the central coordinate $(p_x, p_y)$ and the radius $r$ of a circumscribed circle of a triangle which is constructed by three points $(x_1, y_1)$, $(x_2, y_2)$ and $(x_3, y_3)$ on the plane surface.\n\nInput\n\nInput consists of several datasets. In the first line, the number of datasets $n$ is given. Each dataset consists of:\n\n$x_1$ $y_1$ $x_2$ $y_2$ $x_3$ $y_3$\n\nin a line. All the input are real numbers.\n\nOutput\n\nFor each dataset, print $p_x$, $p_y$ and $r$ separated by a space in a line. Print the solution to three places of decimals. Round off the solution to three decimal places.\n\nConstraints\n\n$-100 \\leq x_1, y_1, x_2, y_2, x_3, y_3 \\leq 100$\n\n$ n \\leq 20$\n\nSample Input\n\n1\n0.0 0.0 2.0 0.0 2.0 2.0\n\nOutput for the Sample Input\n\n1.000 1.000 1.414", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 829, "cpu_time_ms": 80, "memory_kb": 924}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s875670026", "group_id": "codeNet:p00019", "input_text": "#include<stdio.h>\nmain(){long long n,i;scanf(\"%d\",&n);for(i=n;--n;)i*=n;printf(\"%d\\n\",i);}", "language": "C", "metadata": {"date": 1260021042, "filename_ext": "c", "original_language": "C", "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/C/s875670026.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s875670026", "user_id": "u835866094"}, "prompt_components": {"gold_output": "120\n", "input_to_evaluate": "#include<stdio.h>\nmain(){long long n,i;scanf(\"%d\",&n);for(i=n;--n;)i*=n;printf(\"%d\\n\",i);}", "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": 90, "cpu_time_ms": 9990, "memory_kb": 360}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s716777445", "group_id": "codeNet:p00022", "input_text": "#include<stdio.h>\n#include<string.h>\n#include<stdlib.h>\n\n\nint main(void)\n{\n  int n,*a,i,j,k,tmp,max;\n  while(1){\n    scanf(\"%d\",&n);\n    if(n==0)\n      break;\n    a=malloc(sizeof(int)*n);\n    for(i=0;i<n;i++)\n      scanf(\"%d\",&a[i]);\n\n    //for(i=0;i<n;i++)\n    // printf(\"%d\\n\",a[i]);\n\n    max=-9999;\n    tmp=0;\n    for(i=0;i<n;i++){\n      for(j=1;j<=n-i;j++){\n\tfor(k=i;k<i+j;k++)\n\t  tmp+=a[k];\n\t//printf(\"tmp=%d\\n\",tmp);\n\tif(tmp>max)\n\t  max=tmp;\n\ttmp=0;\n      }\n    }\n    printf(\"%d\\n\",max);\n  }\n\n  return 0;\n}", "language": "C", "metadata": {"date": 1397141812, "filename_ext": "c", "original_language": "C", "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/C/s716777445.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s716777445", "user_id": "u786794829"}, "prompt_components": {"gold_output": "19\n14\n1001\n", "input_to_evaluate": "#include<stdio.h>\n#include<string.h>\n#include<stdlib.h>\n\n\nint main(void)\n{\n  int n,*a,i,j,k,tmp,max;\n  while(1){\n    scanf(\"%d\",&n);\n    if(n==0)\n      break;\n    a=malloc(sizeof(int)*n);\n    for(i=0;i<n;i++)\n      scanf(\"%d\",&a[i]);\n\n    //for(i=0;i<n;i++)\n    // printf(\"%d\\n\",a[i]);\n\n    max=-9999;\n    tmp=0;\n    for(i=0;i<n;i++){\n      for(j=1;j<=n-i;j++){\n\tfor(k=i;k<i+j;k++)\n\t  tmp+=a[k];\n\t//printf(\"tmp=%d\\n\",tmp);\n\tif(tmp>max)\n\t  max=tmp;\n\ttmp=0;\n      }\n    }\n    printf(\"%d\\n\",max);\n  }\n\n  return 0;\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": 512, "cpu_time_ms": 1920, "memory_kb": 616}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s847638855", "group_id": "codeNet:p00053", "input_text": "#include <stdio.h>\n \nint main() {\n\tint prime[10000];\n\tint i,j,k,n;\n\tprime[0]=prime[1]=2;\n\n\n\tfor(i=2;j<10000;i++){\n\t\tfor(k=0;k<j;k++){\n\t\t\tif(i%prime[k]==0)break;\n\t\t}\n\t\tif(k>=j){\n\t\t\tprime[j]=i;\n\t\t\tj++;\n\t\t}\n\t}\n\t\n\tfor(i=1;i<10000;i++){\n\t\tprime[i]+=prime[i-1];\t\n\t}\n\t\n\twhile(1){\n\t\tscanf(\"%d\", &n);\n\t\tif(n==0) break;\n\t\tprintf(\"%d\\n\", prime[n-1]);\n\t}\n\treturn 0;\n}\n", "language": "C", "metadata": {"date": 1559717050, "filename_ext": "c", "original_language": "C", "problem_description_relpath": "problem_descriptions/p00053.html", "problem_id": "p00053", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p00053/input.txt", "sample_output_relpath": "derived/input_output/data/p00053/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p00053/C/s847638855.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s847638855", "user_id": "u771565914"}, "prompt_components": {"gold_output": "5\n100\n", "input_to_evaluate": "#include <stdio.h>\n \nint main() {\n\tint prime[10000];\n\tint i,j,k,n;\n\tprime[0]=prime[1]=2;\n\n\n\tfor(i=2;j<10000;i++){\n\t\tfor(k=0;k<j;k++){\n\t\t\tif(i%prime[k]==0)break;\n\t\t}\n\t\tif(k>=j){\n\t\t\tprime[j]=i;\n\t\t\tj++;\n\t\t}\n\t}\n\t\n\tfor(i=1;i<10000;i++){\n\t\tprime[i]+=prime[i-1];\t\n\t}\n\t\n\twhile(1){\n\t\tscanf(\"%d\", &n);\n\t\tif(n==0) break;\n\t\tprintf(\"%d\\n\", prime[n-1]);\n\t}\n\treturn 0;\n}\n", "problem_context": "素数の和\n\np(i) を小さい方から i 番目の素数とします。例えば、7 は、2, 3, 5, 7 と小さい方から 4 番目の素数なので、p(4) = 7 です。\n\nn が与えられたとき、i = 1 から n までの p(i) の和 s\n\ns = p(1) + p(2) + .... + p(n)\n\nを出力するプログラムを作成してください。例えば、n = 9 のとき、s = 2 + 3 + 5 + 7 + 11 + 13 + 17 + 19 + 23 = 100 となります。\n\nInput\n\n複数のデータセットが与えられます。各データセットに整数 n (n ≤ 10000) が与えられます。n が 0 のとき入力の最後とします。データセットの数は 50 を超えません。\n\nOutput\n\n各データセットの n に対して、s を１行に出力して下さい。\n\nSample Input\n\n2\n9\n0\n\nOutput for the Sample Input\n\n5\n100", "sample_input": "2\n9\n0\n"}, "reference_outputs": ["5\n100\n"], "source_document_id": "p00053", "source_text": "素数の和\n\np(i) を小さい方から i 番目の素数とします。例えば、7 は、2, 3, 5, 7 と小さい方から 4 番目の素数なので、p(4) = 7 です。\n\nn が与えられたとき、i = 1 から n までの p(i) の和 s\n\ns = p(1) + p(2) + .... + p(n)\n\nを出力するプログラムを作成してください。例えば、n = 9 のとき、s = 2 + 3 + 5 + 7 + 11 + 13 + 17 + 19 + 23 = 100 となります。\n\nInput\n\n複数のデータセットが与えられます。各データセットに整数 n (n ≤ 10000) が与えられます。n が 0 のとき入力の最後とします。データセットの数は 50 を超えません。\n\nOutput\n\n各データセットの n に対して、s を１行に出力して下さい。\n\nSample Input\n\n2\n9\n0\n\nOutput for the Sample Input\n\n5\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": 356, "cpu_time_ms": 110, "memory_kb": 2100}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s795754062", "group_id": "codeNet:p00070", "input_text": "// AOJ Volume 0 Problem 0070\n\n#include <stdio.h>\n#include <string.h>\n\nint no;\nint n, s;\n\nvoid combination(int num[], int depth, int sum)\n{\n\tint i;\n\t\n\t\n\tif (depth == 1){\n\t\t\tif (num[s - sum] == 0){\n\t\t\t\tno++;\n\t\t\t}\n\t\treturn;\n\t}\n\t\n\tif (s < sum){\n\t\treturn;\n\t}\n\t\n\tfor (i = 0; i <= 9; i++){\n\t\tif (num[i] == 0){\n\tif (sum + i * depth > s){\n\t\treturn;\n\t}\n\t\t\tnum[i] = 1;\n\t\t\tcombination(num, depth - 1, sum + i * depth);\n\t\t\tnum[i] = 0;\n\t\t\t\n\t\t}\n\t}\n}\n\nint main(void)\n{\n\tint num[10];\n\t\n\twhile (scanf(\"%d%d\", &n, &s) != EOF){\n\t\tno = 0;\n\t\tmemset(num, 0, sizeof(num));\n\t\tcombination(num, n, 0);\n\t\t\n\t\tprintf(\"%d\\n\", no);\n\t}\n\t\n\treturn (0);\n}", "language": "C", "metadata": {"date": 1303650422, "filename_ext": "c", "original_language": "C", "problem_description_relpath": "problem_descriptions/p00070.html", "problem_id": "p00070", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p00070/input.txt", "sample_output_relpath": "derived/input_output/data/p00070/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p00070/C/s795754062.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s795754062", "user_id": "u648926140"}, "prompt_components": {"gold_output": "8\n0\n", "input_to_evaluate": "// AOJ Volume 0 Problem 0070\n\n#include <stdio.h>\n#include <string.h>\n\nint no;\nint n, s;\n\nvoid combination(int num[], int depth, int sum)\n{\n\tint i;\n\t\n\t\n\tif (depth == 1){\n\t\t\tif (num[s - sum] == 0){\n\t\t\t\tno++;\n\t\t\t}\n\t\treturn;\n\t}\n\t\n\tif (s < sum){\n\t\treturn;\n\t}\n\t\n\tfor (i = 0; i <= 9; i++){\n\t\tif (num[i] == 0){\n\tif (sum + i * depth > s){\n\t\treturn;\n\t}\n\t\t\tnum[i] = 1;\n\t\t\tcombination(num, depth - 1, sum + i * depth);\n\t\t\tnum[i] = 0;\n\t\t\t\n\t\t}\n\t}\n}\n\nint main(void)\n{\n\tint num[10];\n\t\n\twhile (scanf(\"%d%d\", &n, &s) != EOF){\n\t\tno = 0;\n\t\tmemset(num, 0, sizeof(num));\n\t\tcombination(num, n, 0);\n\t\t\n\t\tprintf(\"%d\\n\", no);\n\t}\n\t\n\treturn (0);\n}", "problem_context": "Combination of Number Sequences\n\n0 から 9 までの整数を使った n 個の数の並び k1, k2, ..., kn を考えます。正の整数 n と s を読み込んで、\n\nk1 + 2 × k2 + 3 × k3 + ... + n × kn = s\n\nとなっているような n 個の数の並びが何通りあるかを出力するプログラムを作成してください。ただし、1 つの「n 個の数の並び」には同じ数が 2 回以上現われないものとします。\n\nInput\n\n入力は複数のデータセットからなります。各データセットとして、n (1 ≤ n ≤ 10) と s (0 ≤ s ≤ 10,000)が空白区切りで１行に与えられます。\n\nデータセットの数は 100 を超えません。\n\nOutput\n\nデータセットごとに、n 個の整数の和が s になる組み合わせの個数を１行に出力します。\n\nSample Input\n\n3 10\n3 1\n\nOutput for the Sample Input\n\n8\n0", "sample_input": "3 10\n3 1\n"}, "reference_outputs": ["8\n0\n"], "source_document_id": "p00070", "source_text": "Combination of Number Sequences\n\n0 から 9 までの整数を使った n 個の数の並び k1, k2, ..., kn を考えます。正の整数 n と s を読み込んで、\n\nk1 + 2 × k2 + 3 × k3 + ... + n × kn = s\n\nとなっているような n 個の数の並びが何通りあるかを出力するプログラムを作成してください。ただし、1 つの「n 個の数の並び」には同じ数が 2 回以上現われないものとします。\n\nInput\n\n入力は複数のデータセットからなります。各データセットとして、n (1 ≤ n ≤ 10) と s (0 ≤ s ≤ 10,000)が空白区切りで１行に与えられます。\n\nデータセットの数は 100 を超えません。\n\nOutput\n\nデータセットごとに、n 個の整数の和が s になる組み合わせの個数を１行に出力します。\n\nSample Input\n\n3 10\n3 1\n\nOutput for the Sample Input\n\n8\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": 619, "cpu_time_ms": 2190, "memory_kb": 408}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s750106302", "group_id": "codeNet:p00070", "input_text": "// AOJ Volume 0 Problem 0070\n\n#include <stdio.h>\n#include <string.h>\n\nint no;\nint n, s;\nint num[10];\n\n\nvoid combination_even(int depth, int sum)\n{\n\tint i;\n\t\n\tif (s < sum){\n\t\treturn;\n\t}\n\n\tif (depth == 2){\n\t\tif ((s - sum) % 2 == 0 && (s - sum) / 2 <=9  && num[(s - sum) / 2] == 0){\n\t\t\tno++;\n\t\t}\n\t\treturn;\n\t}\n\t\n\t\n\tfor (i = 9; i >= 0; i--){\n\t\tif (num[i] == 0){\n            if (sum + i * depth <= s){\n            \tnum[i] = 1;\n\t\t\t    combination_even(depth - 2, sum + i * depth);\n\t\t\t    num[i] = 0;\n            }\n\t\t}\n\t}\n}\n\n\nvoid combination(int depth, int sum)\n{\n\tint i;\n\t\n\tif (s < sum){\n\t\treturn;\n\t}\n\n\tif (depth == -1){\n\t\tif ((sum % 2) == (s % 2)){\n\t\t\tcombination_even(n / 2 * 2, sum);\n\t\t}\n\t\treturn;\n\t}\n\t\n\t\n\tfor (i = 9; i >= 0; i--){\n\t\tif (num[i] == 0){\n            if (sum + i * depth <= s){\n            \tnum[i] = 1;\n\t\t\t    combination(depth - 2, sum + i * depth);\n\t\t\t    num[i] = 0;\n            }\n\t\t}\n\t}\n}\n\nint main(void)\n{\n\t\n\twhile (scanf(\"%d%d\", &n, &s) != EOF){\n\t\tno = 0;\n\t\tmemset(num, 0, sizeof(num));\n\t\tcombination((n + 1) / 2 * 2 + 1, 0);\n\t\t\n\t\tprintf(\"%d\\n\", no);\n\t}\n\t\n\treturn (0);\n}", "language": "C", "metadata": {"date": 1303732259, "filename_ext": "c", "original_language": "C", "problem_description_relpath": "problem_descriptions/p00070.html", "problem_id": "p00070", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p00070/input.txt", "sample_output_relpath": "derived/input_output/data/p00070/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p00070/C/s750106302.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s750106302", "user_id": "u648926140"}, "prompt_components": {"gold_output": "8\n0\n", "input_to_evaluate": "// AOJ Volume 0 Problem 0070\n\n#include <stdio.h>\n#include <string.h>\n\nint no;\nint n, s;\nint num[10];\n\n\nvoid combination_even(int depth, int sum)\n{\n\tint i;\n\t\n\tif (s < sum){\n\t\treturn;\n\t}\n\n\tif (depth == 2){\n\t\tif ((s - sum) % 2 == 0 && (s - sum) / 2 <=9  && num[(s - sum) / 2] == 0){\n\t\t\tno++;\n\t\t}\n\t\treturn;\n\t}\n\t\n\t\n\tfor (i = 9; i >= 0; i--){\n\t\tif (num[i] == 0){\n            if (sum + i * depth <= s){\n            \tnum[i] = 1;\n\t\t\t    combination_even(depth - 2, sum + i * depth);\n\t\t\t    num[i] = 0;\n            }\n\t\t}\n\t}\n}\n\n\nvoid combination(int depth, int sum)\n{\n\tint i;\n\t\n\tif (s < sum){\n\t\treturn;\n\t}\n\n\tif (depth == -1){\n\t\tif ((sum % 2) == (s % 2)){\n\t\t\tcombination_even(n / 2 * 2, sum);\n\t\t}\n\t\treturn;\n\t}\n\t\n\t\n\tfor (i = 9; i >= 0; i--){\n\t\tif (num[i] == 0){\n            if (sum + i * depth <= s){\n            \tnum[i] = 1;\n\t\t\t    combination(depth - 2, sum + i * depth);\n\t\t\t    num[i] = 0;\n            }\n\t\t}\n\t}\n}\n\nint main(void)\n{\n\t\n\twhile (scanf(\"%d%d\", &n, &s) != EOF){\n\t\tno = 0;\n\t\tmemset(num, 0, sizeof(num));\n\t\tcombination((n + 1) / 2 * 2 + 1, 0);\n\t\t\n\t\tprintf(\"%d\\n\", no);\n\t}\n\t\n\treturn (0);\n}", "problem_context": "Combination of Number Sequences\n\n0 から 9 までの整数を使った n 個の数の並び k1, k2, ..., kn を考えます。正の整数 n と s を読み込んで、\n\nk1 + 2 × k2 + 3 × k3 + ... + n × kn = s\n\nとなっているような n 個の数の並びが何通りあるかを出力するプログラムを作成してください。ただし、1 つの「n 個の数の並び」には同じ数が 2 回以上現われないものとします。\n\nInput\n\n入力は複数のデータセットからなります。各データセットとして、n (1 ≤ n ≤ 10) と s (0 ≤ s ≤ 10,000)が空白区切りで１行に与えられます。\n\nデータセットの数は 100 を超えません。\n\nOutput\n\nデータセットごとに、n 個の整数の和が s になる組み合わせの個数を１行に出力します。\n\nSample Input\n\n3 10\n3 1\n\nOutput for the Sample Input\n\n8\n0", "sample_input": "3 10\n3 1\n"}, "reference_outputs": ["8\n0\n"], "source_document_id": "p00070", "source_text": "Combination of Number Sequences\n\n0 から 9 までの整数を使った n 個の数の並び k1, k2, ..., kn を考えます。正の整数 n と s を読み込んで、\n\nk1 + 2 × k2 + 3 × k3 + ... + n × kn = s\n\nとなっているような n 個の数の並びが何通りあるかを出力するプログラムを作成してください。ただし、1 つの「n 個の数の並び」には同じ数が 2 回以上現われないものとします。\n\nInput\n\n入力は複数のデータセットからなります。各データセットとして、n (1 ≤ n ≤ 10) と s (0 ≤ s ≤ 10,000)が空白区切りで１行に与えられます。\n\nデータセットの数は 100 を超えません。\n\nOutput\n\nデータセットごとに、n 個の整数の和が s になる組み合わせの個数を１行に出力します。\n\nSample Input\n\n3 10\n3 1\n\nOutput for the Sample Input\n\n8\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": 1086, "cpu_time_ms": 2340, "memory_kb": 412}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s540787610", "group_id": "codeNet:p00090", "input_text": "float x[100],y[100],t,u,a,b;n,i,j,k,c,s;main(m){for(;c=i=scanf(\"%d\",&n)*n;printf(\"%d\\n\",m))for(m=1;j=c?scanf(\"%f,%f\",x+c,y+--c):--i;)for(;s=!c&&j--;)for(u=acos(hypot(a=x[j]-x[i],b=y[j]-y[i])/2),t=atan2(b,a);c=0,u<9&&s+3;s-=2)for(k=n;k--;)hypot(x[i]+cos(b)-x[k],y[i]+sin(b=t+s*u)-y[k])<1.1&&++c>m?m=c:0;}", "language": "C", "metadata": {"date": 1364201858, "filename_ext": "c", "original_language": "C", "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/C/s540787610.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s540787610", "user_id": "u479246559"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "float x[100],y[100],t,u,a,b;n,i,j,k,c,s;main(m){for(;c=i=scanf(\"%d\",&n)*n;printf(\"%d\\n\",m))for(m=1;j=c?scanf(\"%f,%f\",x+c,y+--c):--i;)for(;s=!c&&j--;)for(u=acos(hypot(a=x[j]-x[i],b=y[j]-y[i])/2),t=atan2(b,a);c=0,u<9&&s+3;s-=2)for(k=n;k--;)hypot(x[i]+cos(b)-x[k],y[i]+sin(b=t+s*u)-y[k])<1.1&&++c>m?m=c:0;}", "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": 303, "cpu_time_ms": 10, "memory_kb": 772}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s815899547", "group_id": "codeNet:p00103", "input_text": "#include<stdio.h>\n#include<stdlib.h>\n#include<string.h>\nint main()\n{\n\tint *A;\n\tconst char H[4] = \"HIT\";\n\tconst char R[8] = \"HOMERUN\";\n\tconst char O[4] = \"OUT\";\n\twhile(1){\n\t\tint score = 0;\n\t\tint runner = 0;\n\t\tint out = 0;\n\t\tchar s[10];\n\t\tscanf(\"%s\",s);\n\t\tif(strcmp(s,H) == 0)\n\t\t{\n\t\t\trunner++;\n\t\t\tif(runner == 4)\n\t\t\t{\n\t\t\t\tscore++;\n\t\t\t\trunner--;\n\t\t\t}\n\t\t}\n\t\telse if(strcmp(s,R) == 0)\n\t\t{\n\t\t\tscore = score + runner + 1;\n\t\t\trunner = 0;\n\t\t}\n\t\telse if(strcmp(s,O) == 0) out++;\n\t\tif(out == 3) printf(\"%d \",score);\n\t}\n\treturn 0;\n}", "language": "C", "metadata": {"date": 1468764006, "filename_ext": "c", "original_language": "C", "problem_description_relpath": "problem_descriptions/p00103.html", "problem_id": "p00103", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p00103/input.txt", "sample_output_relpath": "derived/input_output/data/p00103/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p00103/C/s815899547.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s815899547", "user_id": "u690799636"}, "prompt_components": {"gold_output": "7\n0\n", "input_to_evaluate": "#include<stdio.h>\n#include<stdlib.h>\n#include<string.h>\nint main()\n{\n\tint *A;\n\tconst char H[4] = \"HIT\";\n\tconst char R[8] = \"HOMERUN\";\n\tconst char O[4] = \"OUT\";\n\twhile(1){\n\t\tint score = 0;\n\t\tint runner = 0;\n\t\tint out = 0;\n\t\tchar s[10];\n\t\tscanf(\"%s\",s);\n\t\tif(strcmp(s,H) == 0)\n\t\t{\n\t\t\trunner++;\n\t\t\tif(runner == 4)\n\t\t\t{\n\t\t\t\tscore++;\n\t\t\t\trunner--;\n\t\t\t}\n\t\t}\n\t\telse if(strcmp(s,R) == 0)\n\t\t{\n\t\t\tscore = score + runner + 1;\n\t\t\trunner = 0;\n\t\t}\n\t\telse if(strcmp(s,O) == 0) out++;\n\t\tif(out == 3) printf(\"%d \",score);\n\t}\n\treturn 0;\n}", "problem_context": "Baseball Simulation\n\nIchiro likes baseball and has decided to write a program which simulates baseball.\n\nThe program reads events in an inning and prints score in that inning. There are only three events as follows:\n\nSingle hit\n\nput a runner on the first base.\n\nthe runner in the first base advances to the second base and the runner in the second base advances to the third base.\n\nthe runner in the third base advances to the home base (and go out of base) and a point is added to the score.\n\nHome run\n\nall the runners on base advance to the home base.\n\npoints are added to the score by an amount equal to the number of the runners plus one.\n\nOut\n\nThe number of outs is increased by 1.\n\nThe runners and the score remain stationary.\n\nThe inning ends with three-out.\n\nIchiro decided to represent these events using \"HIT\", \"HOMERUN\" and \"OUT\", respectively.\n\nWrite a program which reads events in an inning and prints score in that inning. You can assume that the number of events is less than or equal to 100.\n\nInput\n\nThe input consists of several datasets. In the first line, the number of datasets n is given. Each dataset consists of a list of events (strings) in an inning.\n\nOutput\n\nFor each dataset, prints the score in the corresponding inning.\n\nSample Input\n\n2\nHIT\nOUT\nHOMERUN\nHIT\nHIT\nHOMERUN\nHIT\nOUT\nHIT\nHIT\nHIT\nHIT\nOUT\nHIT\nHIT\nOUT\nHIT\nOUT\nOUT\n\nOutput for the Sample Input\n\n7\n0", "sample_input": "2\nHIT\nOUT\nHOMERUN\nHIT\nHIT\nHOMERUN\nHIT\nOUT\nHIT\nHIT\nHIT\nHIT\nOUT\nHIT\nHIT\nOUT\nHIT\nOUT\nOUT\n"}, "reference_outputs": ["7\n0\n"], "source_document_id": "p00103", "source_text": "Baseball Simulation\n\nIchiro likes baseball and has decided to write a program which simulates baseball.\n\nThe program reads events in an inning and prints score in that inning. There are only three events as follows:\n\nSingle hit\n\nput a runner on the first base.\n\nthe runner in the first base advances to the second base and the runner in the second base advances to the third base.\n\nthe runner in the third base advances to the home base (and go out of base) and a point is added to the score.\n\nHome run\n\nall the runners on base advance to the home base.\n\npoints are added to the score by an amount equal to the number of the runners plus one.\n\nOut\n\nThe number of outs is increased by 1.\n\nThe runners and the score remain stationary.\n\nThe inning ends with three-out.\n\nIchiro decided to represent these events using \"HIT\", \"HOMERUN\" and \"OUT\", respectively.\n\nWrite a program which reads events in an inning and prints score in that inning. You can assume that the number of events is less than or equal to 100.\n\nInput\n\nThe input consists of several datasets. In the first line, the number of datasets n is given. Each dataset consists of a list of events (strings) in an inning.\n\nOutput\n\nFor each dataset, prints the score in the corresponding inning.\n\nSample Input\n\n2\nHIT\nOUT\nHOMERUN\nHIT\nHIT\nHOMERUN\nHIT\nOUT\nHIT\nHIT\nHIT\nHIT\nOUT\nHIT\nHIT\nOUT\nHIT\nOUT\nOUT\n\nOutput for the Sample Input\n\n7\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": 520, "cpu_time_ms": 20000, "memory_kb": 524}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s963263183", "group_id": "codeNet:p00103", "input_text": "b,o,s,a;main(){for(;~scanf(\"%*d\\n%s\"+5*!!a,&a);)b=a%3?a&1?++o%3?b:(s=!printf(\"%d\\n\",b>3?s+b-3:s)):b+1:!(s+=b+1);}", "language": "C", "metadata": {"date": 1318245585, "filename_ext": "c", "original_language": "C", "problem_description_relpath": "problem_descriptions/p00103.html", "problem_id": "p00103", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p00103/input.txt", "sample_output_relpath": "derived/input_output/data/p00103/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p00103/C/s963263183.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s963263183", "user_id": "u611853667"}, "prompt_components": {"gold_output": "7\n0\n", "input_to_evaluate": "b,o,s,a;main(){for(;~scanf(\"%*d\\n%s\"+5*!!a,&a);)b=a%3?a&1?++o%3?b:(s=!printf(\"%d\\n\",b>3?s+b-3:s)):b+1:!(s+=b+1);}", "problem_context": "Baseball Simulation\n\nIchiro likes baseball and has decided to write a program which simulates baseball.\n\nThe program reads events in an inning and prints score in that inning. There are only three events as follows:\n\nSingle hit\n\nput a runner on the first base.\n\nthe runner in the first base advances to the second base and the runner in the second base advances to the third base.\n\nthe runner in the third base advances to the home base (and go out of base) and a point is added to the score.\n\nHome run\n\nall the runners on base advance to the home base.\n\npoints are added to the score by an amount equal to the number of the runners plus one.\n\nOut\n\nThe number of outs is increased by 1.\n\nThe runners and the score remain stationary.\n\nThe inning ends with three-out.\n\nIchiro decided to represent these events using \"HIT\", \"HOMERUN\" and \"OUT\", respectively.\n\nWrite a program which reads events in an inning and prints score in that inning. You can assume that the number of events is less than or equal to 100.\n\nInput\n\nThe input consists of several datasets. In the first line, the number of datasets n is given. Each dataset consists of a list of events (strings) in an inning.\n\nOutput\n\nFor each dataset, prints the score in the corresponding inning.\n\nSample Input\n\n2\nHIT\nOUT\nHOMERUN\nHIT\nHIT\nHOMERUN\nHIT\nOUT\nHIT\nHIT\nHIT\nHIT\nOUT\nHIT\nHIT\nOUT\nHIT\nOUT\nOUT\n\nOutput for the Sample Input\n\n7\n0", "sample_input": "2\nHIT\nOUT\nHOMERUN\nHIT\nHIT\nHOMERUN\nHIT\nOUT\nHIT\nHIT\nHIT\nHIT\nOUT\nHIT\nHIT\nOUT\nHIT\nOUT\nOUT\n"}, "reference_outputs": ["7\n0\n"], "source_document_id": "p00103", "source_text": "Baseball Simulation\n\nIchiro likes baseball and has decided to write a program which simulates baseball.\n\nThe program reads events in an inning and prints score in that inning. There are only three events as follows:\n\nSingle hit\n\nput a runner on the first base.\n\nthe runner in the first base advances to the second base and the runner in the second base advances to the third base.\n\nthe runner in the third base advances to the home base (and go out of base) and a point is added to the score.\n\nHome run\n\nall the runners on base advance to the home base.\n\npoints are added to the score by an amount equal to the number of the runners plus one.\n\nOut\n\nThe number of outs is increased by 1.\n\nThe runners and the score remain stationary.\n\nThe inning ends with three-out.\n\nIchiro decided to represent these events using \"HIT\", \"HOMERUN\" and \"OUT\", respectively.\n\nWrite a program which reads events in an inning and prints score in that inning. You can assume that the number of events is less than or equal to 100.\n\nInput\n\nThe input consists of several datasets. In the first line, the number of datasets n is given. Each dataset consists of a list of events (strings) in an inning.\n\nOutput\n\nFor each dataset, prints the score in the corresponding inning.\n\nSample Input\n\n2\nHIT\nOUT\nHOMERUN\nHIT\nHIT\nHOMERUN\nHIT\nOUT\nHIT\nHIT\nHIT\nHIT\nOUT\nHIT\nHIT\nOUT\nHIT\nOUT\nOUT\n\nOutput for the Sample Input\n\n7\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": 113, "cpu_time_ms": 9990, "memory_kb": 368}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s076717809", "group_id": "codeNet:p00169", "input_text": "#include <stdio.h>\n#include <string.h>\n\nint main(void)\n{\n\tchar str[100];\n\tint i, score[2], len;\n\t\n\twhile (1){\n\t\tfgets(str, 100, stdin);\n\t\t\n\t\tif (str[0] == '0'){\n\t\t\tbreak;\n\t\t}\n\t\t\n\t\tscore[0] = 0;\n\t\tscore[1] = 0;\n\t\ti = 0;\n\t\t\n\t\tlen = strlen(str);\n\t\t\n\t\twhile (i < len){\n\t\t\tif (str[i] == '1' && (str[i + 1] >= '0' && str[i + 1] <= '3')){\n\t\t\t\tscore[0] += 10;\n\t\t\t\tscore[1] += 10;\n\t\t\t\ti += 3;\n\t\t\t}\n\t\t\telse if (str[i] == '1'){\n\t\t\t\tscore[0] += 1;\n\t\t\t\tscore[1] += 11;\n\t\t\t\ti += 2;\n\t\t\t}\n\t\t\telse if (str[i] >= '2' && str[i] <= '9'){\n\t\t\t\tscore[0] += (str[i] - '0');\n\t\t\t\tscore[1] += (str[i] - '0');\n\t\t\t\ti += 2;\n\t\t\t}\n\t\t}\n\t\t\n\t\tfor (i = 0; i < 2; i++){\n\t\t\tif (score[i] > 21){\n\t\t\t\tscore[i] = 0;\n\t\t\t}\n\t\t}\n\t\t\n\t\tif (score[0] < score[1]){\n\t\t\tprintf(\"%d\\n\", score[1]);\n\t\t}\n\t\telse {\n\t\t\tprintf(\"%d\\n\", score[0]);\n\t\t}\n\t}\n\t\n\treturn (0);\n}", "language": "C", "metadata": {"date": 1410779593, "filename_ext": "c", "original_language": "C", "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/C/s076717809.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s076717809", "user_id": "u334031393"}, "prompt_components": {"gold_output": "11\n21\n0\n21\n12\n", "input_to_evaluate": "#include <stdio.h>\n#include <string.h>\n\nint main(void)\n{\n\tchar str[100];\n\tint i, score[2], len;\n\t\n\twhile (1){\n\t\tfgets(str, 100, stdin);\n\t\t\n\t\tif (str[0] == '0'){\n\t\t\tbreak;\n\t\t}\n\t\t\n\t\tscore[0] = 0;\n\t\tscore[1] = 0;\n\t\ti = 0;\n\t\t\n\t\tlen = strlen(str);\n\t\t\n\t\twhile (i < len){\n\t\t\tif (str[i] == '1' && (str[i + 1] >= '0' && str[i + 1] <= '3')){\n\t\t\t\tscore[0] += 10;\n\t\t\t\tscore[1] += 10;\n\t\t\t\ti += 3;\n\t\t\t}\n\t\t\telse if (str[i] == '1'){\n\t\t\t\tscore[0] += 1;\n\t\t\t\tscore[1] += 11;\n\t\t\t\ti += 2;\n\t\t\t}\n\t\t\telse if (str[i] >= '2' && str[i] <= '9'){\n\t\t\t\tscore[0] += (str[i] - '0');\n\t\t\t\tscore[1] += (str[i] - '0');\n\t\t\t\ti += 2;\n\t\t\t}\n\t\t}\n\t\t\n\t\tfor (i = 0; i < 2; i++){\n\t\t\tif (score[i] > 21){\n\t\t\t\tscore[i] = 0;\n\t\t\t}\n\t\t}\n\t\t\n\t\tif (score[0] < score[1]){\n\t\t\tprintf(\"%d\\n\", score[1]);\n\t\t}\n\t\telse {\n\t\t\tprintf(\"%d\\n\", score[0]);\n\t\t}\n\t}\n\t\n\treturn (0);\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": 808, "cpu_time_ms": 20000, "memory_kb": 524}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s396604726", "group_id": "codeNet:p00188", "input_text": "#include <stdio.h>\n\nint main(void)\n{\n\tint a[100];\n\tint n;\n\tint i;\n\tint search_no;\n\tint index_min;\n\tint index;\n\tint index_max;\n\tint count;\n\t\n\twhile (1){\n\t\tscanf(\"%d\", &n);\n\t\tif (n == 0){\n\t\t\tbreak;\n\t\t}\n\t\tfor (i = 0; i < n; i++){\n\t\t\tscanf(\"%d\", &a[i]);\n\t\t}\n\t\tscanf(\"%d\", &search_no);\n\t\t\n\t\tindex_min = 0;\n\t\tindex_max = n - 1;\n\t\tindex = (index_min + index_max) / 2;\n\t\t\n\t\tcount = 0;\n\t\twhile(1){\n\t\t\tcount++;\n\t\t\t\n\t\t\tif (a[index] == search_no || index_min >= index_max){\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\t\n\t\t\tif (a[index] < search_no){\n\t\t\t\tindex_min = index;\n\t\t\t}\n\t\t\telse {\n\t\t\t\tindex_max = index - 1;\n\t\t\t}\n\t\t\t\n\t\t\tindex = (index_min + index_max) / 2;\n\t\t}\n\t\t\n\t\tprintf(\"%d\\n\", count);\n\t}\n\t\n\treturn (0);\n}", "language": "C", "metadata": {"date": 1364202530, "filename_ext": "c", "original_language": "C", "problem_description_relpath": "problem_descriptions/p00188.html", "problem_id": "p00188", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p00188/input.txt", "sample_output_relpath": "derived/input_output/data/p00188/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p00188/C/s396604726.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s396604726", "user_id": "u479947501"}, "prompt_components": {"gold_output": "3\n3\n", "input_to_evaluate": "#include <stdio.h>\n\nint main(void)\n{\n\tint a[100];\n\tint n;\n\tint i;\n\tint search_no;\n\tint index_min;\n\tint index;\n\tint index_max;\n\tint count;\n\t\n\twhile (1){\n\t\tscanf(\"%d\", &n);\n\t\tif (n == 0){\n\t\t\tbreak;\n\t\t}\n\t\tfor (i = 0; i < n; i++){\n\t\t\tscanf(\"%d\", &a[i]);\n\t\t}\n\t\tscanf(\"%d\", &search_no);\n\t\t\n\t\tindex_min = 0;\n\t\tindex_max = n - 1;\n\t\tindex = (index_min + index_max) / 2;\n\t\t\n\t\tcount = 0;\n\t\twhile(1){\n\t\t\tcount++;\n\t\t\t\n\t\t\tif (a[index] == search_no || index_min >= index_max){\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\t\n\t\t\tif (a[index] < search_no){\n\t\t\t\tindex_min = index;\n\t\t\t}\n\t\t\telse {\n\t\t\t\tindex_max = index - 1;\n\t\t\t}\n\t\t\t\n\t\t\tindex = (index_min + index_max) / 2;\n\t\t}\n\t\t\n\t\tprintf(\"%d\\n\", count);\n\t}\n\t\n\treturn (0);\n}", "problem_context": "探索\n\n「探索」とは、たくさんの情報の中から望みの情報を得る操作のことです。身近な例では、合格発表の時の「たくさんの受験番号から自分の受験番号を見つける」ことや、電話帳から「会津太郎さんの電話番号を見つける」ときなどがあります。この探索という操作はコンピュータの分野でも広く用いられています。\n\n探索の方法は沢山あります。探索の対象となるデータが、小さい順(または大きい順)に並べられている場合に使うことができる探索の方法を考えます。\n\n小さい順(または大きい順)に並べられているデータ列の中央に位置する値と目的の値との大小関係を用いて、中央に位置する値から前半部分を探索範囲にするか後半部分を探索範囲にするかを決めることで、探索の範囲を絞っていく方法があります。手順は以下のようになります。\n\nデータの列の全体を探索の範囲とします。\n\n探索の範囲の中央に位置する値を調べます。\n\n目的の値と中央に位置する値が一致すれば探索を終了します。\n\n目的の値と中央に位置する値よりも小さければ前半部分を探索の範囲とし、大きければ後半部分を探索の範囲として2.へ戻ります。\n\n以下は上述した探索の方法の例です。この例での目的の値は51です。それぞれのデータには番号\n(index)が振られており、この番号は0から始まっています。\n\nステップ1: 最初は番号0~6全体を探索の範囲とします。\n\nステップ2: 探索の範囲の中央に位置する値を調べます。ただし、「中央に位置する値」とは、(左側の番号+右側の番号)を2で割った番号の位置にある値とします。つまり、この場合、(0 + 6) ÷ 2 を計算し、番号3にある値(36)が中央に位置する値となります。\n\nステップ3:目的の値(51)と中央に位置する値(36)を比較します。\n\nステップ4:ステップ3の結果から、目的の値は中央に位置する値より大きいので、後半部分にあたる番号4 (中央に位置する値の隣)以降を探索の範囲とします。同様の手順で探索の範囲の中央に位置する値を調べ、目的の値が中央に位置する値より小さければ前半部分を探索の範囲とし、大きければ後半部分を探索の範囲として、探索の範囲を小さくしていきます。(ステップ2~ステップ4の繰り返し)目的の値が中央に位置する値と一致するか、探索の範囲がつきてしまった時に探索を終了します。\n\nn 個の数値の配列を入力とし、目的の値と中央に位置する値を比較した回数を出力するプログラムを作成してください。ただし、中央に位置する値の番号を計算したとき、割り切れない場合は、小数点以下を切り捨てた値をその番号とすることとします。\n与えられるデータ列は小さい順に整列されているものとします。\n\nInput\n\n複数のデータセットの並びが入力として与えられます。入力の終わりはゼロひとつの行で示されます。 各データセットは以下の形式で与えられます。\n\nn\na1\na2\n:\nan\nk\n\n1 行目に数値の数 n (1 ≤ n ≤ 100) 、続く n 行に i 個目の数値 ai (1 ≤ ai ≤ 100000, 整数) が与えられます。\n\n続く行に探索する値 k (1 ≤ k ≤ 100000) が与えられます。\n\nOutput\n\nデータセット毎に探索が終わるまでの比較回数を１行に出力します。\n\nSample Input\n\n7\n11\n15\n23\n36\n51\n61\n86\n51\n4\n1\n2\n3\n5\n4\n0\n\nOutput for the Sample Input\n\n3\n3", "sample_input": "7\n11\n15\n23\n36\n51\n61\n86\n51\n4\n1\n2\n3\n5\n4\n0\n"}, "reference_outputs": ["3\n3\n"], "source_document_id": "p00188", "source_text": "探索\n\n「探索」とは、たくさんの情報の中から望みの情報を得る操作のことです。身近な例では、合格発表の時の「たくさんの受験番号から自分の受験番号を見つける」ことや、電話帳から「会津太郎さんの電話番号を見つける」ときなどがあります。この探索という操作はコンピュータの分野でも広く用いられています。\n\n探索の方法は沢山あります。探索の対象となるデータが、小さい順(または大きい順)に並べられている場合に使うことができる探索の方法を考えます。\n\n小さい順(または大きい順)に並べられているデータ列の中央に位置する値と目的の値との大小関係を用いて、中央に位置する値から前半部分を探索範囲にするか後半部分を探索範囲にするかを決めることで、探索の範囲を絞っていく方法があります。手順は以下のようになります。\n\nデータの列の全体を探索の範囲とします。\n\n探索の範囲の中央に位置する値を調べます。\n\n目的の値と中央に位置する値が一致すれば探索を終了します。\n\n目的の値と中央に位置する値よりも小さければ前半部分を探索の範囲とし、大きければ後半部分を探索の範囲として2.へ戻ります。\n\n以下は上述した探索の方法の例です。この例での目的の値は51です。それぞれのデータには番号\n(index)が振られており、この番号は0から始まっています。\n\nステップ1: 最初は番号0~6全体を探索の範囲とします。\n\nステップ2: 探索の範囲の中央に位置する値を調べます。ただし、「中央に位置する値」とは、(左側の番号+右側の番号)を2で割った番号の位置にある値とします。つまり、この場合、(0 + 6) ÷ 2 を計算し、番号3にある値(36)が中央に位置する値となります。\n\nステップ3:目的の値(51)と中央に位置する値(36)を比較します。\n\nステップ4:ステップ3の結果から、目的の値は中央に位置する値より大きいので、後半部分にあたる番号4 (中央に位置する値の隣)以降を探索の範囲とします。同様の手順で探索の範囲の中央に位置する値を調べ、目的の値が中央に位置する値より小さければ前半部分を探索の範囲とし、大きければ後半部分を探索の範囲として、探索の範囲を小さくしていきます。(ステップ2~ステップ4の繰り返し)目的の値が中央に位置する値と一致するか、探索の範囲がつきてしまった時に探索を終了します。\n\nn 個の数値の配列を入力とし、目的の値と中央に位置する値を比較した回数を出力するプログラムを作成してください。ただし、中央に位置する値の番号を計算したとき、割り切れない場合は、小数点以下を切り捨てた値をその番号とすることとします。\n与えられるデータ列は小さい順に整列されているものとします。\n\nInput\n\n複数のデータセットの並びが入力として与えられます。入力の終わりはゼロひとつの行で示されます。 各データセットは以下の形式で与えられます。\n\nn\na1\na2\n:\nan\nk\n\n1 行目に数値の数 n (1 ≤ n ≤ 100) 、続く n 行に i 個目の数値 ai (1 ≤ ai ≤ 100000, 整数) が与えられます。\n\n続く行に探索する値 k (1 ≤ k ≤ 100000) が与えられます。\n\nOutput\n\nデータセット毎に探索が終わるまでの比較回数を１行に出力します。\n\nSample Input\n\n7\n11\n15\n23\n36\n51\n61\n86\n51\n4\n1\n2\n3\n5\n4\n0\n\nOutput for the Sample Input\n\n3\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": 677, "cpu_time_ms": 20000, "memory_kb": 588}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s302836142", "group_id": "codeNet:p00215", "input_text": "#include <stdio.h>\n#include <math.h>\n#include <stdlib.h>\n\nint search(int map[1000][1000],int n,int y,int x,int *hy,int *hx){\n\tint min = 1999, i, j, sy, sx,flag = 0;\n\tfor(i = 0;i < y;i++){\n\t\tfor(j = 0;j < x;j++){\n\t\t\tif(map[i][j] == n)\n\t\t\t\tflag = 1;\n\t\t}\n\t}\n\tif(flag == 1){\n\t\tfor(i = 0;i < y;i++){\n\t\t\tfor(j = 0;j < x;j++){\n\t\t\t\tif(map[i][j] == n && abs(*hy - i) + abs(*hx - j) < min){\n\t\t\t\t\tsy = i - *hy;\n\t\t\t\t\tsx = j - *hx;\n\t\t\t\t\tmin = abs(sy) + abs(sx);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\t*hy = *hy + sy; *hx = *hx + sx;\n\t\treturn min;\n\t}\n\treturn 1999;\n}\nint main(void){\n\tint i, j, map[1000][1000], y, x, by, bx, gy, gx;\n\tint *hy, *hx, flag[5],wc[5],min_w,min_i,count,walk;\n\tchar c;\n\tchar str[5];\n\thy = (int *)malloc(sizeof(int));\n\thx = (int *)malloc(sizeof(int));\n\tscanf(\"%d%d\",&x,&y);\n\twhile(x != 0 || y != 0){\n\t\tfor(i = 0;i < y;i++){\n\t\t\tfor(j = 0;j < x;j++)\n\t\t\t\tmap[i][j] = -1;\n\t\t}\n\t\tfor(i = 0;i < y;i++){\n\t\t\tfor(j = 0;j < x;j++){\n\t\t\t\tc = '\\n';\n\t\t\t\twhile((c = getchar()) == '\\n');\n\t\t\t\tswitch(c){\n\t\t\t\t\tcase '.':\n\t\t\t\t\t\tmap[i][j] = 0;\n\t\t\t\t\t\tbreak;\n\t\t\t\t\tcase 'S':\n\t\t\t\t\t\tmap[i][j] = 6;\n\t\t\t\t\t\tby = i;\n\t\t\t\t\t\tbx = j;\n\t\t\t\t\t\tbreak;\n\t\t\t\t\tcase 'G':\n\t\t\t\t\t\tmap[i][j] = 7;\n\t\t\t\t\t\tgy = i;\n\t\t\t\t\t\tgx = j;\n\t\t\t\t\t\tbreak;\n\t\t\t\t\tdefault:\n\t\t\t\t\t\tmap[i][j] = atoi(&c);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tfor(i = 0;i < 5;i++)\n\t\t\tflag[i] = 0;\n\t\tcount = 0;\n\t\tfor(i = 0;i < y;i++){\n\t\t\tfor(j = 0;j < x;j++){\n\t\t\t\tif(1 <= map[i][j] && map[i][j] <= 5 && flag[map[i][j] - 1] == 0){\n\t\t\t\t\tcount++;\n\t\t\t\t\tflag[map[i][j] - 1] = 1;\n\t\t\t\t\tif(count > 3)\n\t\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif(count > 3)\n\t\t\t\tbreak;\n\t\t}\n\t\tif(count > 3){\n\t\t\tfor(i = 0;i < 5;i++)\n\t\t\t\twc[i] = 0;\n\t\t\tfor(i = 0;i < 5;i++){\n\t\t\t\t*hy = by; *hx = bx; walk = 0;\n\t\t\t\tfor(j = (i + 1) % 5;i != j;j = (j + 1) % 5)\n\t\t\t\t\twalk += search(map,j + 1,y,x,hy,hx);\n\t\t\t\twc[i] = walk + abs(*hy - gy) + abs(*hx - gx);\n\t\t\t}\n\t\t\tmin_w = wc[0];\n\t\t\tmin_i = 1;\n\t\t\tfor(i = 1;i < 5;i++){\n\t\t\t\tif(min_w > wc[i]){\n\t\t\t\t\tmin_w = wc[i];\n\t\t\t\t\tmin_i = i + 1;\n\t\t\t\t}\n\t\t\t}\n\t\t\tprintf(\"%d %d\\n\",min_i,min_w);\n\t\t}\n\t\telse if(x == 0 || y == 0);\n\t\telse\n\t\t\tprintf(\"NA\\n\");\n\t\tfor(i = 0;i < 4;i++)\n\t\t\tstr[i] = 0;\n\t\twhile((str[0] = getchar()) == '\\n' || str[0] == EOF || str[0] == ' ');\n\t\tfor(i = 1;i < 4 && (c = getchar()) != ' ';i++)\n\t\t\tstr[i] = c;\n\t\tx = atoi(str);\t \n\t\tscanf(\"%d\",&y);\n\t}\n\treturn 0;\n}", "language": "C", "metadata": {"date": 1359481432, "filename_ext": "c", "original_language": "C", "problem_description_relpath": "problem_descriptions/p00215.html", "problem_id": "p00215", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p00215/input.txt", "sample_output_relpath": "derived/input_output/data/p00215/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p00215/C/s302836142.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s302836142", "user_id": "u682037079"}, "prompt_components": {"gold_output": "2 10\nNA\n", "input_to_evaluate": "#include <stdio.h>\n#include <math.h>\n#include <stdlib.h>\n\nint search(int map[1000][1000],int n,int y,int x,int *hy,int *hx){\n\tint min = 1999, i, j, sy, sx,flag = 0;\n\tfor(i = 0;i < y;i++){\n\t\tfor(j = 0;j < x;j++){\n\t\t\tif(map[i][j] == n)\n\t\t\t\tflag = 1;\n\t\t}\n\t}\n\tif(flag == 1){\n\t\tfor(i = 0;i < y;i++){\n\t\t\tfor(j = 0;j < x;j++){\n\t\t\t\tif(map[i][j] == n && abs(*hy - i) + abs(*hx - j) < min){\n\t\t\t\t\tsy = i - *hy;\n\t\t\t\t\tsx = j - *hx;\n\t\t\t\t\tmin = abs(sy) + abs(sx);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\t*hy = *hy + sy; *hx = *hx + sx;\n\t\treturn min;\n\t}\n\treturn 1999;\n}\nint main(void){\n\tint i, j, map[1000][1000], y, x, by, bx, gy, gx;\n\tint *hy, *hx, flag[5],wc[5],min_w,min_i,count,walk;\n\tchar c;\n\tchar str[5];\n\thy = (int *)malloc(sizeof(int));\n\thx = (int *)malloc(sizeof(int));\n\tscanf(\"%d%d\",&x,&y);\n\twhile(x != 0 || y != 0){\n\t\tfor(i = 0;i < y;i++){\n\t\t\tfor(j = 0;j < x;j++)\n\t\t\t\tmap[i][j] = -1;\n\t\t}\n\t\tfor(i = 0;i < y;i++){\n\t\t\tfor(j = 0;j < x;j++){\n\t\t\t\tc = '\\n';\n\t\t\t\twhile((c = getchar()) == '\\n');\n\t\t\t\tswitch(c){\n\t\t\t\t\tcase '.':\n\t\t\t\t\t\tmap[i][j] = 0;\n\t\t\t\t\t\tbreak;\n\t\t\t\t\tcase 'S':\n\t\t\t\t\t\tmap[i][j] = 6;\n\t\t\t\t\t\tby = i;\n\t\t\t\t\t\tbx = j;\n\t\t\t\t\t\tbreak;\n\t\t\t\t\tcase 'G':\n\t\t\t\t\t\tmap[i][j] = 7;\n\t\t\t\t\t\tgy = i;\n\t\t\t\t\t\tgx = j;\n\t\t\t\t\t\tbreak;\n\t\t\t\t\tdefault:\n\t\t\t\t\t\tmap[i][j] = atoi(&c);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tfor(i = 0;i < 5;i++)\n\t\t\tflag[i] = 0;\n\t\tcount = 0;\n\t\tfor(i = 0;i < y;i++){\n\t\t\tfor(j = 0;j < x;j++){\n\t\t\t\tif(1 <= map[i][j] && map[i][j] <= 5 && flag[map[i][j] - 1] == 0){\n\t\t\t\t\tcount++;\n\t\t\t\t\tflag[map[i][j] - 1] = 1;\n\t\t\t\t\tif(count > 3)\n\t\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif(count > 3)\n\t\t\t\tbreak;\n\t\t}\n\t\tif(count > 3){\n\t\t\tfor(i = 0;i < 5;i++)\n\t\t\t\twc[i] = 0;\n\t\t\tfor(i = 0;i < 5;i++){\n\t\t\t\t*hy = by; *hx = bx; walk = 0;\n\t\t\t\tfor(j = (i + 1) % 5;i != j;j = (j + 1) % 5)\n\t\t\t\t\twalk += search(map,j + 1,y,x,hy,hx);\n\t\t\t\twc[i] = walk + abs(*hy - gy) + abs(*hx - gx);\n\t\t\t}\n\t\t\tmin_w = wc[0];\n\t\t\tmin_i = 1;\n\t\t\tfor(i = 1;i < 5;i++){\n\t\t\t\tif(min_w > wc[i]){\n\t\t\t\t\tmin_w = wc[i];\n\t\t\t\t\tmin_i = i + 1;\n\t\t\t\t}\n\t\t\t}\n\t\t\tprintf(\"%d %d\\n\",min_i,min_w);\n\t\t}\n\t\telse if(x == 0 || y == 0);\n\t\telse\n\t\t\tprintf(\"NA\\n\");\n\t\tfor(i = 0;i < 4;i++)\n\t\t\tstr[i] = 0;\n\t\twhile((str[0] = getchar()) == '\\n' || str[0] == EOF || str[0] == ' ');\n\t\tfor(i = 1;i < 4 && (c = getchar()) != ' ';i++)\n\t\t\tstr[i] = c;\n\t\tx = atoi(str);\t \n\t\tscanf(\"%d\",&y);\n\t}\n\treturn 0;\n}", "problem_context": "パチモンクリーチャー\n\n某国で大人気のゲーム、パチモンクリーチャーが日本でリメイクされて発売されました。 ゲームが大好きなあなたは、 このゲームを何度もプレイするうちにどうしたら最速でクリアできるのか考えるようになりました。しかし、いくら考えても最速の攻略方法がわからなかったあなたは、どれだけ早くゲームをクリアできるかを求めるプログラムを作成することにしました。\n\nゲームの詳細は以下の通りです。\n\nパチモンクリーチャー(以下、パチクリ)という生物が多く存在する世界がゲームの舞台です。各パチクリは、火属性、氷属性、木属性、土属性、水属性の 5 種類の属性のいずれか１つの属性を持ちます。ゲームの主人公は、ゲーム開始時に好きな属性のパチクリ一匹を冒険のパートナーとして選びます。そのパチクリと共にゴールを目指し、ゴールにいるライバルを倒してパチクリマスターになることがゲームの目的です。\n\nしかし、ライバルを倒すためには全属性のパチクリがいないと勝てないので、途中で全属性のパチクリを捕まえなければなりません。パチクリを捕まえるには属性がカギとなります。火属性のパチクリは氷属性のパチクリを捕まえることができ、同様に、氷属性は木属性、木属性は土属性、土属性は水属性、水属性は火属性を捕まえることができます。属性の関連は以下の図のようになります。\n\n以下の図はゲームが行われるマップの一例を表しています。\n\n主人公はパチクリを一匹もってスタート地点である「S」から出発し、一マスずつ移動しながらゴール地点である「G」を目指します。その途中で、最初に持っているパチクリ以外の 4 つの属性のパチクリを捕まえ、ゴール地点であるマス目に移動するとゲーム終了となります。\n\n主人公は、今いるマス目から、辺を共有する隣のマス目に移動することができ、それを一回の移動と数えます。主人公がパチクリのいるマスに移動した場合、そのパチクリを捕まえられる属性のパチクリを持っていればそのパチクリを捕まえたことになります。そのマスにいるパチクリを捕まえられるかの可否にかかわらず、すべてのマスに何度でも移動することができます。\n\nマップの大きさ(横方向の列数、縦方向の行数)とマップの初期状態を入力とし、初めに選んだパチクリの属性と、それ以外の 4 つの属性のパチクリを捕まえるのにかかる、スタート地点からゴール地点に至る最小移動数を出力するプログラムを作成してください。\n\nInput\n\n複数のデータセットの並びが入力として与えられます。入力の終りはゼロふたつの行で示されます。各データセットは以下の形式で与えられます。\n\nW H\nc11c12...c1W\nc21c22...c2W\n:\ncH1cH2...cHW\n\n1 行目にマップの横方向の列数 W と縦方向の行数 H (2 ≤ W, H ≤ 1000) が与えられます。続く H 行にマップの i 行目の情報が与えられます。入力されるマップには各マスの状態が与えられます。 「S」は主人公のスタート地点を、 「G」はゴール地点を、「1」「2」「3」「4」「5」はそこにいるパチクリの属性を( 1:火属性、 2:氷属性、 3:木属性、 4:土属性、 5:水属性 をそれぞれ表します)、 「.(ピリオド) 」は何もないマスをそれぞれ表します。\n各属性のパチクリの数はそれぞれ 0 以上 1000 以下とします。\n\nデータセットの数は140 を超えません。また、データセットの 80 % について、W, H は100 を超えません。\n\nOutput\n\n入力データセットごとに、最初に選んだパチクリの属性と最小移動数を１行に出力します。なお、どのように初めのパチクリを選んでも、どのような経路で移動してもそれら 4 つの属性のパチクリを捕まえることができない場合は NA と出力してください。 また、最小移動数が同じになるような最初のパチクリの選び方が複数ある場合は、属性の数字が小さいものを出力してください。\n\nSample Input\n\n6 6\nS.1..4\n3..5..\n..4.1.\n4....5\n.2.32.\n5.1..G\n3 2\n...\nS.G\n0 0\n\nOutput for the Sample Input\n\n2 10\nNA", "sample_input": "6 6\nS.1..4\n3..5..\n..4.1.\n4....5\n.2.32.\n5.1..G\n3 2\n...\nS.G\n0 0\n"}, "reference_outputs": ["2 10\nNA\n"], "source_document_id": "p00215", "source_text": "パチモンクリーチャー\n\n某国で大人気のゲーム、パチモンクリーチャーが日本でリメイクされて発売されました。 ゲームが大好きなあなたは、 このゲームを何度もプレイするうちにどうしたら最速でクリアできるのか考えるようになりました。しかし、いくら考えても最速の攻略方法がわからなかったあなたは、どれだけ早くゲームをクリアできるかを求めるプログラムを作成することにしました。\n\nゲームの詳細は以下の通りです。\n\nパチモンクリーチャー(以下、パチクリ)という生物が多く存在する世界がゲームの舞台です。各パチクリは、火属性、氷属性、木属性、土属性、水属性の 5 種類の属性のいずれか１つの属性を持ちます。ゲームの主人公は、ゲーム開始時に好きな属性のパチクリ一匹を冒険のパートナーとして選びます。そのパチクリと共にゴールを目指し、ゴールにいるライバルを倒してパチクリマスターになることがゲームの目的です。\n\nしかし、ライバルを倒すためには全属性のパチクリがいないと勝てないので、途中で全属性のパチクリを捕まえなければなりません。パチクリを捕まえるには属性がカギとなります。火属性のパチクリは氷属性のパチクリを捕まえることができ、同様に、氷属性は木属性、木属性は土属性、土属性は水属性、水属性は火属性を捕まえることができます。属性の関連は以下の図のようになります。\n\n以下の図はゲームが行われるマップの一例を表しています。\n\n主人公はパチクリを一匹もってスタート地点である「S」から出発し、一マスずつ移動しながらゴール地点である「G」を目指します。その途中で、最初に持っているパチクリ以外の 4 つの属性のパチクリを捕まえ、ゴール地点であるマス目に移動するとゲーム終了となります。\n\n主人公は、今いるマス目から、辺を共有する隣のマス目に移動することができ、それを一回の移動と数えます。主人公がパチクリのいるマスに移動した場合、そのパチクリを捕まえられる属性のパチクリを持っていればそのパチクリを捕まえたことになります。そのマスにいるパチクリを捕まえられるかの可否にかかわらず、すべてのマスに何度でも移動することができます。\n\nマップの大きさ(横方向の列数、縦方向の行数)とマップの初期状態を入力とし、初めに選んだパチクリの属性と、それ以外の 4 つの属性のパチクリを捕まえるのにかかる、スタート地点からゴール地点に至る最小移動数を出力するプログラムを作成してください。\n\nInput\n\n複数のデータセットの並びが入力として与えられます。入力の終りはゼロふたつの行で示されます。各データセットは以下の形式で与えられます。\n\nW H\nc11c12...c1W\nc21c22...c2W\n:\ncH1cH2...cHW\n\n1 行目にマップの横方向の列数 W と縦方向の行数 H (2 ≤ W, H ≤ 1000) が与えられます。続く H 行にマップの i 行目の情報が与えられます。入力されるマップには各マスの状態が与えられます。 「S」は主人公のスタート地点を、 「G」はゴール地点を、「1」「2」「3」「4」「5」はそこにいるパチクリの属性を( 1:火属性、 2:氷属性、 3:木属性、 4:土属性、 5:水属性 をそれぞれ表します)、 「.(ピリオド) 」は何もないマスをそれぞれ表します。\n各属性のパチクリの数はそれぞれ 0 以上 1000 以下とします。\n\nデータセットの数は140 を超えません。また、データセットの 80 % について、W, H は100 を超えません。\n\nOutput\n\n入力データセットごとに、最初に選んだパチクリの属性と最小移動数を１行に出力します。なお、どのように初めのパチクリを選んでも、どのような経路で移動してもそれら 4 つの属性のパチクリを捕まえることができない場合は NA と出力してください。 また、最小移動数が同じになるような最初のパチクリの選び方が複数ある場合は、属性の数字が小さいものを出力してください。\n\nSample Input\n\n6 6\nS.1..4\n3..5..\n..4.1.\n4....5\n.2.32.\n5.1..G\n3 2\n...\nS.G\n0 0\n\nOutput for the Sample Input\n\n2 10\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": 2236, "cpu_time_ms": 410, "memory_kb": 4512}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s386568695", "group_id": "codeNet:p00283", "input_text": "#include<stdio.h>\n#define M 100000000\nint main(){\n  int D,n,i,j,k,l,exp,d[101][3];\n  while(scanf(\"%d %d\",&D,&n),D||n){\n    for(i=0;i<n;i++)scanf(\"%d %d %d\",&d[i][0],&d[i][1],&d[i][2]);\n    int dp[101][102]={0};\n    for(i=0;i<D;i++){\n      for(j=0;j<102;j++)dp[i+1][j]=M;\n    }\n    for(i=1;i<=D;i++){\n      for(j=101;j>=0;j--){\n\tfor(k=0;k<n;k++){\n\t  if(j<d[k][2])continue;//exp husoku\n\t  exp=j+d[k][1];\n\t  if(exp>101)exp=101;\n\t  l=i-d[k][0];\n\t  if(l<0)l=0;\n\t  if(dp[i][j]>dp[l][exp]+1)dp[i][j]=dp[l][exp]+1;\n\t}\n      }\n    }\n    /*for(i=0;i<D;i++){\n      for(j=0;j<20;j++)printf(\"%d \",dp[i][j]);printf(\"\\n\");\n      }//*/\n    if(M-dp[D][0])printf(\"%d\\n\",dp[D][0]);\n    else          printf(\"NA\\n\");\n  }\n  return 0;\n}", "language": "C", "metadata": {"date": 1435397978, "filename_ext": "c", "original_language": "C", "problem_description_relpath": "problem_descriptions/p00283.html", "problem_id": "p00283", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p00283/input.txt", "sample_output_relpath": "derived/input_output/data/p00283/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p00283/C/s386568695.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s386568695", "user_id": "u731027244"}, "prompt_components": {"gold_output": "6\n4\nNA\n", "input_to_evaluate": "#include<stdio.h>\n#define M 100000000\nint main(){\n  int D,n,i,j,k,l,exp,d[101][3];\n  while(scanf(\"%d %d\",&D,&n),D||n){\n    for(i=0;i<n;i++)scanf(\"%d %d %d\",&d[i][0],&d[i][1],&d[i][2]);\n    int dp[101][102]={0};\n    for(i=0;i<D;i++){\n      for(j=0;j<102;j++)dp[i+1][j]=M;\n    }\n    for(i=1;i<=D;i++){\n      for(j=101;j>=0;j--){\n\tfor(k=0;k<n;k++){\n\t  if(j<d[k][2])continue;//exp husoku\n\t  exp=j+d[k][1];\n\t  if(exp>101)exp=101;\n\t  l=i-d[k][0];\n\t  if(l<0)l=0;\n\t  if(dp[i][j]>dp[l][exp]+1)dp[i][j]=dp[l][exp]+1;\n\t}\n      }\n    }\n    /*for(i=0;i<D;i++){\n      for(j=0;j<20;j++)printf(\"%d \",dp[i][j]);printf(\"\\n\");\n      }//*/\n    if(M-dp[D][0])printf(\"%d\\n\",dp[D][0]);\n    else          printf(\"NA\\n\");\n  }\n  return 0;\n}", "problem_context": "巨樹の刻み手\n\nあなたは N 種類の道具を使って、目の前の巨樹を切り倒そうとしています。はじめは、樹の耐久力は D、あなたの経験値は 0 ですが、道具 i で１回樹を叩くと樹の耐久力は ai 減り、あなたは ei の経験値を得ます。ただし、道具 i を使うためには、あなたは ri 以上の経験値を持っていなければなりません。樹の耐久力が 0 以下になると樹は倒れます。\n\n樹の耐久力と道具についての情報が与えられたとき、樹を切り倒すには最低何回樹を叩かなければいけないかを求めるプログラムを作成してください。\n\n入力\n\n入力は複数のデータセットからなる。入力の終わりはゼロ２つの行で示される。各データセットは以下の形式で与えられる。\n\nD N\na1 e1 r1\na2 e2 r2\n:\naN eN rN\n\n1 行目に樹の耐久力を表す整数 D (1 ≤ D ≤ 100) と道具の種類の数 N(1 ≤ N ≤ 100) が与えられる。続く N 行に道具 1 から N までの情報が与えられる。ai (0 ≤ ai ≤ 100) と ei (0 ≤ ei ≤ 100) は、道具iを１回使うことで減る樹の耐久力とあなたが得ることのできる経験値をそれぞれ表す。ri (0 ≤ ri ≤ 100) は道具を使うために必要な経験値を表す。ai, ei, ri はすべて整数である。\n\nデータセットの数は 50 を超えない。\n\n出力\n\n樹を切り倒すのに必要な、樹を叩く最小の回数を１行に出力する。ただし、樹を切り倒すことが不可能な場合は NA と出力する。\n\n入出力例\n\n入力例\n\n15 4\n1 1 0\n1 2 2\n5 10 5\n8 1 15\n60 4\n5 2 0\n8 8 2\n3 5 0\n49 0 18\n100 1\n1 1 1\n0 0\n\n出力例\n\n6\n4\nNA", "sample_input": "15 4\n1 1 0\n1 2 2\n5 10 5\n8 1 15\n60 4\n5 2 0\n8 8 2\n3 5 0\n49 0 18\n100 1\n1 1 1\n0 0\n"}, "reference_outputs": ["6\n4\nNA\n"], "source_document_id": "p00283", "source_text": "巨樹の刻み手\n\nあなたは N 種類の道具を使って、目の前の巨樹を切り倒そうとしています。はじめは、樹の耐久力は D、あなたの経験値は 0 ですが、道具 i で１回樹を叩くと樹の耐久力は ai 減り、あなたは ei の経験値を得ます。ただし、道具 i を使うためには、あなたは ri 以上の経験値を持っていなければなりません。樹の耐久力が 0 以下になると樹は倒れます。\n\n樹の耐久力と道具についての情報が与えられたとき、樹を切り倒すには最低何回樹を叩かなければいけないかを求めるプログラムを作成してください。\n\n入力\n\n入力は複数のデータセットからなる。入力の終わりはゼロ２つの行で示される。各データセットは以下の形式で与えられる。\n\nD N\na1 e1 r1\na2 e2 r2\n:\naN eN rN\n\n1 行目に樹の耐久力を表す整数 D (1 ≤ D ≤ 100) と道具の種類の数 N(1 ≤ N ≤ 100) が与えられる。続く N 行に道具 1 から N までの情報が与えられる。ai (0 ≤ ai ≤ 100) と ei (0 ≤ ei ≤ 100) は、道具iを１回使うことで減る樹の耐久力とあなたが得ることのできる経験値をそれぞれ表す。ri (0 ≤ ri ≤ 100) は道具を使うために必要な経験値を表す。ai, ei, ri はすべて整数である。\n\nデータセットの数は 50 を超えない。\n\n出力\n\n樹を切り倒すのに必要な、樹を叩く最小の回数を１行に出力する。ただし、樹を切り倒すことが不可能な場合は NA と出力する。\n\n入出力例\n\n入力例\n\n15 4\n1 1 0\n1 2 2\n5 10 5\n8 1 15\n60 4\n5 2 0\n8 8 2\n3 5 0\n49 0 18\n100 1\n1 1 1\n0 0\n\n出力例\n\n6\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": 714, "cpu_time_ms": 90, "memory_kb": 660}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s209049657", "group_id": "codeNet:p00424", "input_text": "#include <stdio.h>\n\n\nint main()\n{\n\tint n, m, i;\n\tchar change[1000][2], c;\n\n\twhile (1) {\n\t\tscanf(\"%d\", &n);\n\t\tif (n == 0) break;\n\t\tfor (i = 0;i < n;i++) {\n\t\t\tscanf(\"%c %c\", &change[i][0], &change[i][1]);\n\t\t}\n\t\tscanf(\"%d\", &m);\n\t\twhile (m--) {\n\t\t\tscanf(\"%c\", &c);\n\n\t\t\tfor (i = 0;i < n;i++) {\n\t\t\t\tif (c == change[i][0]) {\n\t\t\t\t\tc = change[i][1];\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\tprintf(\"%c\", c);\n\t\t}\n\t\tprintf(\"\\n\");\n\t}\n\n\treturn 0;\n}", "language": "C", "metadata": {"date": 1480228502, "filename_ext": "c", "original_language": "C", "problem_description_relpath": "problem_descriptions/p00424.html", "problem_id": "p00424", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p00424/input.txt", "sample_output_relpath": "derived/input_output/data/p00424/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p00424/C/s209049657.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s209049657", "user_id": "u970782338"}, "prompt_components": {"gold_output": "aBC5144aba\naBC5144aba\n", "input_to_evaluate": "#include <stdio.h>\n\n\nint main()\n{\n\tint n, m, i;\n\tchar change[1000][2], c;\n\n\twhile (1) {\n\t\tscanf(\"%d\", &n);\n\t\tif (n == 0) break;\n\t\tfor (i = 0;i < n;i++) {\n\t\t\tscanf(\"%c %c\", &change[i][0], &change[i][1]);\n\t\t}\n\t\tscanf(\"%d\", &m);\n\t\twhile (m--) {\n\t\t\tscanf(\"%c\", &c);\n\n\t\t\tfor (i = 0;i < n;i++) {\n\t\t\t\tif (c == change[i][0]) {\n\t\t\t\t\tc = change[i][1];\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\tprintf(\"%c\", c);\n\t\t}\n\t\tprintf(\"\\n\");\n\t}\n\n\treturn 0;\n}", "problem_context": "与えられた変換表にもとづき，データを変換するプログラムを作成しなさい．\n\nデータに使われている文字は英字か数字で，英字は大文字と小文字を区別する．変換表に現れる文字の順序に規則性はない．\n\n変換表は空白をはさんで前と後ろの 2 つの文字がある(文字列ではない)．変換方法は，変換表のある行の前の文字がデータに現れたら，そのたびにその文字を後ろの文字に変換し出力する．変換は 1 度だけで，変換した文字がまた変換対象の文字になっても変換しない．変換表に現れない文字は変換せず，そのまま出力する．\n\n入力ファイルには，変換表（最初の n + 1 行）に続き変換するデータ（n + 2 行目以降）が書いてある． 1 行目に変換表の行数 n，続く n 行の各行は，空白をはさんで 2 つの文字，さらに続けて， n + 2 行目に変換するデータの行数 m，続く m 行の各行は 1 文字である． m ≤ 105 とする．出力は，出力例のように途中に空白や改行は入れず 1 行とせよ．\n\n入力例\n\n3\n\nA a\n\n0 5\n\n5 4\n\n10\n\nA\n\nB\n\nC\n\n0\n\n1\n\n4\n\n5\n\na\n\nb\n\nA\n\n　\n\n出力例\n\naBC5144aba\n\n入力\n\n入力は複数のデータセットからなる．n が 0 のとき入力が終了する．データセットの数は 5 を超えない．\n\n出力\n\nデータセットごとに、変換後の文字列を１行に出力する．\n\n入力例\n\n3\nA a\n0 5\n5 4\n10\nA\nB\nC\n0\n1\n4\n5\na\nb\nA\n3\nA a\n0 5\n5 4\n10\nA\nB\nC\n0\n1\n4\n5\na\nb\nA\n0\n\n出力例\n\naBC5144aba\naBC5144aba\n\n各データセットの出力（変換後の文字列）の後に改行を入れること．\n\n上記問題文と自動審判に使われるデータは、情報オリンピック日本委員会が作成し公開している問題文と採点用テストデータです。", "sample_input": "3\nA a\n0 5\n5 4\n10\nA\nB\nC\n0\n1\n4\n5\na\nb\nA\n3\nA a\n0 5\n5 4\n10\nA\nB\nC\n0\n1\n4\n5\na\nb\nA\n0\n"}, "reference_outputs": ["aBC5144aba\naBC5144aba\n"], "source_document_id": "p00424", "source_text": "与えられた変換表にもとづき，データを変換するプログラムを作成しなさい．\n\nデータに使われている文字は英字か数字で，英字は大文字と小文字を区別する．変換表に現れる文字の順序に規則性はない．\n\n変換表は空白をはさんで前と後ろの 2 つの文字がある(文字列ではない)．変換方法は，変換表のある行の前の文字がデータに現れたら，そのたびにその文字を後ろの文字に変換し出力する．変換は 1 度だけで，変換した文字がまた変換対象の文字になっても変換しない．変換表に現れない文字は変換せず，そのまま出力する．\n\n入力ファイルには，変換表（最初の n + 1 行）に続き変換するデータ（n + 2 行目以降）が書いてある． 1 行目に変換表の行数 n，続く n 行の各行は，空白をはさんで 2 つの文字，さらに続けて， n + 2 行目に変換するデータの行数 m，続く m 行の各行は 1 文字である． m ≤ 105 とする．出力は，出力例のように途中に空白や改行は入れず 1 行とせよ．\n\n入力例\n\n3\n\nA a\n\n0 5\n\n5 4\n\n10\n\nA\n\nB\n\nC\n\n0\n\n1\n\n4\n\n5\n\na\n\nb\n\nA\n\n　\n\n出力例\n\naBC5144aba\n\n入力\n\n入力は複数のデータセットからなる．n が 0 のとき入力が終了する．データセットの数は 5 を超えない．\n\n出力\n\nデータセットごとに、変換後の文字列を１行に出力する．\n\n入力例\n\n3\nA a\n0 5\n5 4\n10\nA\nB\nC\n0\n1\n4\n5\na\nb\nA\n3\nA a\n0 5\n5 4\n10\nA\nB\nC\n0\n1\n4\n5\na\nb\nA\n0\n\n出力例\n\naBC5144aba\naBC5144aba\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": 421, "cpu_time_ms": 20000, "memory_kb": 564}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s907083284", "group_id": "codeNet:p00428", "input_text": "#include<stdio.h>\n\nvoid swap(int *a,int *b){\n\tint h;\n\th=*a;\n\t*a=*b;\n\t*b=h;\n}\n\nint main(){\n\tint n,m,i,place[100],c,j,sort[100],p;\n\tscanf(\"%d %d\",&n,&m);\n\twhile(n!=0){\n\t\tfor(j=0;j<m;j++){\n\t\t\tplace[j]=0;\n\t\t\tsort[j]=-1;\n\t\t}\n\t\tfor(i=0;i<n;i++){\n\t\t\tfor(j=0;j<m;j++){\n\t\t\t\tscanf(\"%d\",&c);\n\t\t\t\tplace[j]+=c;\n\t\t\t\tif(sort[j]==-1) sort[j]=j;\n\t\t\t\tfor(c=0;c<m;c++){\n\t\t\t\t\tif(sort[c]==j){\n\t\t\t\t\t\tp=j;\n\t\t\t\t\t\tc=m;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tfor(c=p;c>0;c--){\n\t\t\t\t\tif(place[sort[c]]>place[sort[c-1]]){\n\t\t\t\t\t\tswap(&sort[c],&sort[c-1]);\n\t\t\t\t\t}else{\n\t\t\t\t\t\tc=0;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tfor(i=1;i<m;i++){\n\t\t\tif(place[sort[i]]==place[sort[i-1]]){\n\t\t\t\tif(sort[i]<sort[i-1]){\n\t\t\t\tswap(&sort[i],&sort[i-1]);\n\t\t\t\ti=0;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tprintf(\"%d\",sort[0]+1);\n\t\tfor(i=1;i<m;i++){\n\t\t\tprintf(\" %d\",sort[i]+1);\n\t\t}\n\t\tprintf(\"\\n\");\n\t\tscanf(\"%d %d\",&n,&m);\n\t}\n\treturn 0;\n}", "language": "C", "metadata": {"date": 1479863114, "filename_ext": "c", "original_language": "C", "problem_description_relpath": "problem_descriptions/p00428.html", "problem_id": "p00428", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p00428/input.txt", "sample_output_relpath": "derived/input_output/data/p00428/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p00428/C/s907083284.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s907083284", "user_id": "u039795040"}, "prompt_components": {"gold_output": "1 3 2 5 4 6\n1 3 2 5 4 6\n", "input_to_evaluate": "#include<stdio.h>\n\nvoid swap(int *a,int *b){\n\tint h;\n\th=*a;\n\t*a=*b;\n\t*b=h;\n}\n\nint main(){\n\tint n,m,i,place[100],c,j,sort[100],p;\n\tscanf(\"%d %d\",&n,&m);\n\twhile(n!=0){\n\t\tfor(j=0;j<m;j++){\n\t\t\tplace[j]=0;\n\t\t\tsort[j]=-1;\n\t\t}\n\t\tfor(i=0;i<n;i++){\n\t\t\tfor(j=0;j<m;j++){\n\t\t\t\tscanf(\"%d\",&c);\n\t\t\t\tplace[j]+=c;\n\t\t\t\tif(sort[j]==-1) sort[j]=j;\n\t\t\t\tfor(c=0;c<m;c++){\n\t\t\t\t\tif(sort[c]==j){\n\t\t\t\t\t\tp=j;\n\t\t\t\t\t\tc=m;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tfor(c=p;c>0;c--){\n\t\t\t\t\tif(place[sort[c]]>place[sort[c-1]]){\n\t\t\t\t\t\tswap(&sort[c],&sort[c-1]);\n\t\t\t\t\t}else{\n\t\t\t\t\t\tc=0;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tfor(i=1;i<m;i++){\n\t\t\tif(place[sort[i]]==place[sort[i-1]]){\n\t\t\t\tif(sort[i]<sort[i-1]){\n\t\t\t\tswap(&sort[i],&sort[i-1]);\n\t\t\t\ti=0;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tprintf(\"%d\",sort[0]+1);\n\t\tfor(i=1;i<m;i++){\n\t\t\tprintf(\" %d\",sort[i]+1);\n\t\t}\n\t\tprintf(\"\\n\");\n\t\tscanf(\"%d %d\",&n,&m);\n\t}\n\treturn 0;\n}", "problem_context": "ある学校で修学旅行へ行く計画がある.そのためにアンケート調査を行った.\n生徒は 1 から n までの生徒番号を持ち,旅行候補の場所を 1 から m までの番号で表し,行きたい場所に ○,行きたくない場所に×の印をつけて提出している.\n\nこのとき, 行きたい場所の人数が多い順に,場所の番号を出力するプログラムを作成せよ.人数が同じときは,場所の番号順とする.\n\n入力データ の 1 行目は生徒の人数 n と旅行候補の場所の数 m が空白で区切られ, i + 1 行に生徒 i のアンケート結果を ○ は 1 で×は 0 で表し,空白で区切られた m 個の数字が並んでいる.1 ≤ n ≤ 1000, 1 ≤ m ≤ 100 とする.\n\n入力例１\n\n4 6\n\n1 0 1 0 1 1\n\n1 1 0 1 0 0\n\n1 1 1 0 0 0\n\n1 0 1 0 1 0\n\n　\n\n出力例１\n\n1 3 2 5 4 6\n\n入力\n\n入力は複数のデータセットからなる．n, m がともに 0 のとき入力が終了する．データセットの数は 5 を超えない．\n\n出力\n\nデータセットごとに、場所の番号 を１行に出力する．\n\n入力例\n\n4 6\n1 0 1 0 1 1\n1 1 0 1 0 0\n1 1 1 0 0 0\n1 0 1 0 1 0\n4 6\n1 0 1 0 1 1\n1 1 0 1 0 0\n1 1 1 0 0 0\n1 0 1 0 1 0\n0 0\n\n出力例\n\n1 3 2 5 4 6\n1 3 2 5 4 6\n\n上記問題文と自動審判に使われるデータは、情報オリンピック日本委員会が作成し公開している問題文と採点用テストデータです。", "sample_input": "4 6\n1 0 1 0 1 1\n1 1 0 1 0 0\n1 1 1 0 0 0\n1 0 1 0 1 0\n4 6\n1 0 1 0 1 1\n1 1 0 1 0 0\n1 1 1 0 0 0\n1 0 1 0 1 0\n0 0\n"}, "reference_outputs": ["1 3 2 5 4 6\n1 3 2 5 4 6\n"], "source_document_id": "p00428", "source_text": "ある学校で修学旅行へ行く計画がある.そのためにアンケート調査を行った.\n生徒は 1 から n までの生徒番号を持ち,旅行候補の場所を 1 から m までの番号で表し,行きたい場所に ○,行きたくない場所に×の印をつけて提出している.\n\nこのとき, 行きたい場所の人数が多い順に,場所の番号を出力するプログラムを作成せよ.人数が同じときは,場所の番号順とする.\n\n入力データ の 1 行目は生徒の人数 n と旅行候補の場所の数 m が空白で区切られ, i + 1 行に生徒 i のアンケート結果を ○ は 1 で×は 0 で表し,空白で区切られた m 個の数字が並んでいる.1 ≤ n ≤ 1000, 1 ≤ m ≤ 100 とする.\n\n入力例１\n\n4 6\n\n1 0 1 0 1 1\n\n1 1 0 1 0 0\n\n1 1 1 0 0 0\n\n1 0 1 0 1 0\n\n　\n\n出力例１\n\n1 3 2 5 4 6\n\n入力\n\n入力は複数のデータセットからなる．n, m がともに 0 のとき入力が終了する．データセットの数は 5 を超えない．\n\n出力\n\nデータセットごとに、場所の番号 を１行に出力する．\n\n入力例\n\n4 6\n1 0 1 0 1 1\n1 1 0 1 0 0\n1 1 1 0 0 0\n1 0 1 0 1 0\n4 6\n1 0 1 0 1 1\n1 1 0 1 0 0\n1 1 1 0 0 0\n1 0 1 0 1 0\n0 0\n\n出力例\n\n1 3 2 5 4 6\n1 3 2 5 4 6\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": 825, "cpu_time_ms": 50, "memory_kb": 604}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s593040286", "group_id": "codeNet:p00439", "input_text": "#include<stdio.h>\nint main(void){\n\tint n,k,i,j,ans,sum;\n\tint a[100000];\n\n\twhile(1){\n\t\tscanf(\"%d%d\",&n,&k);\n\t\tif(!n && !k) break;\n\t\tans=sum=0;\n\n\t\tfor(i=0;i<n;i++){\n\t\t\tscanf(\"%d\",&a[i]);\n\t\t}\n\n\t\tfor(i=0;i<n-k;i++){\n\t\t\tfor(j=0;j<k;j++){\n\t\t\t\tsum+=a[i+j];\n\t\t\t}\n\t\t\tif(sum>ans){\n\t\t\t\tans=sum;\n\t\t\t\tsum=0;\n\t\t\t}\n\t\t\telse sum=0;\n\t\t}\n\n\t\tprintf(\"%d\\n\",ans);\n\t}\n\treturn 0;\n}", "language": "C", "metadata": {"date": 1448645583, "filename_ext": "c", "original_language": "C", "problem_description_relpath": "problem_descriptions/p00439.html", "problem_id": "p00439", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p00439/input.txt", "sample_output_relpath": "derived/input_output/data/p00439/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p00439/C/s593040286.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s593040286", "user_id": "u113556167"}, "prompt_components": {"gold_output": "11\n", "input_to_evaluate": "#include<stdio.h>\nint main(void){\n\tint n,k,i,j,ans,sum;\n\tint a[100000];\n\n\twhile(1){\n\t\tscanf(\"%d%d\",&n,&k);\n\t\tif(!n && !k) break;\n\t\tans=sum=0;\n\n\t\tfor(i=0;i<n;i++){\n\t\t\tscanf(\"%d\",&a[i]);\n\t\t}\n\n\t\tfor(i=0;i<n-k;i++){\n\t\t\tfor(j=0;j<k;j++){\n\t\t\t\tsum+=a[i+j];\n\t\t\t}\n\t\t\tif(sum>ans){\n\t\t\t\tans=sum;\n\t\t\t\tsum=0;\n\t\t\t}\n\t\t\telse sum=0;\n\t\t}\n\n\t\tprintf(\"%d\\n\",ans);\n\t}\n\treturn 0;\n}", "problem_context": "最大の和\n\n問題\n\nn 個の整数からなる数列 a1, a2, ..., an と正整数 k (1 ≤ k ≤ n) が与えられる.このとき, 連続して並ぶ k 個の整数の和 Si = ai + ai+1 + ... + ai+k-1 (1 ≤ i ≤ n - k + 1) の最大値を出力するプログラムを作りなさい.\n\n入力\n\n入力は複数のデータセットからなる．各データセットは以下の形式で与えられる．入力は２つのゼロを含む行で終了する．\n\n1 行目には正整数 n (1 ≤ n ≤ 100000) と正整数 k (1 ≤ k ≤ n) がこの順に空白で\n区切られて書かれている.2 行目以降の第 1 + i 行目 (1 ≤ i ≤ n) には, 数列の i 番目の項 ai (-10000 ≤ ai ≤ 10000) が書かれている.\n採点用データのうち, 配点の 60% 分は n ≤ 5000, k ≤ 1000 を満たす.\n\nデータセットの数は 5 を超えない．\n\n出力\n\nデータセットごとにSi の最大値を１行に出力する．\n\n入出力例\n\n入力例\n\n5 3\n2\n5\n-4\n10\n3\n0 0\n\n出力例\n\n11\n\n上記問題文と自動審判に使われるデータは、情報オリンピック日本委員会が作成し公開している問題文と採点用テストデータです。", "sample_input": "5 3\n2\n5\n-4\n10\n3\n0 0\n"}, "reference_outputs": ["11\n"], "source_document_id": "p00439", "source_text": "最大の和\n\n問題\n\nn 個の整数からなる数列 a1, a2, ..., an と正整数 k (1 ≤ k ≤ n) が与えられる.このとき, 連続して並ぶ k 個の整数の和 Si = ai + ai+1 + ... + ai+k-1 (1 ≤ i ≤ n - k + 1) の最大値を出力するプログラムを作りなさい.\n\n入力\n\n入力は複数のデータセットからなる．各データセットは以下の形式で与えられる．入力は２つのゼロを含む行で終了する．\n\n1 行目には正整数 n (1 ≤ n ≤ 100000) と正整数 k (1 ≤ k ≤ n) がこの順に空白で\n区切られて書かれている.2 行目以降の第 1 + i 行目 (1 ≤ i ≤ n) には, 数列の i 番目の項 ai (-10000 ≤ ai ≤ 10000) が書かれている.\n採点用データのうち, 配点の 60% 分は n ≤ 5000, k ≤ 1000 を満たす.\n\nデータセットの数は 5 を超えない．\n\n出力\n\nデータセットごとにSi の最大値を１行に出力する．\n\n入出力例\n\n入力例\n\n5 3\n2\n5\n-4\n10\n3\n0 0\n\n出力例\n\n11\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": 357, "cpu_time_ms": 1630, "memory_kb": 988}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s931577415", "group_id": "codeNet:p00439", "input_text": "#include <stdio.h>\n\nint main(void){\n  int c1,c2;\n  int i,j,n;\n  int ans;\n  int max_index;\n  int num[100000];\n\n  while(1){\n    scanf(\"%d %d\",&c1,&c2);\n    if(c1 == 0 && c2 == 0){\n      break;\n    }\n    ans = 0;\n    max_index = c1 - c2;\n    c1 -=1;\n\n    for(i = 0;i <= c1;i++){\n      scanf(\"%d\",num+i);\n    }\n\n\n    for(i = 0;i <= max_index;i++){\n      for(j = 1;j < c2;j++){\n\tnum[i] += num[i+j];\n      }\n      if(num[i] > ans){\n\tn = i;\n      }\n    }\n    \n    printf(\"%d\\n\",num+n);  \n  }\n  return 0;\n}", "language": "C", "metadata": {"date": 1403516373, "filename_ext": "c", "original_language": "C", "problem_description_relpath": "problem_descriptions/p00439.html", "problem_id": "p00439", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p00439/input.txt", "sample_output_relpath": "derived/input_output/data/p00439/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p00439/C/s931577415.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s931577415", "user_id": "u548867766"}, "prompt_components": {"gold_output": "11\n", "input_to_evaluate": "#include <stdio.h>\n\nint main(void){\n  int c1,c2;\n  int i,j,n;\n  int ans;\n  int max_index;\n  int num[100000];\n\n  while(1){\n    scanf(\"%d %d\",&c1,&c2);\n    if(c1 == 0 && c2 == 0){\n      break;\n    }\n    ans = 0;\n    max_index = c1 - c2;\n    c1 -=1;\n\n    for(i = 0;i <= c1;i++){\n      scanf(\"%d\",num+i);\n    }\n\n\n    for(i = 0;i <= max_index;i++){\n      for(j = 1;j < c2;j++){\n\tnum[i] += num[i+j];\n      }\n      if(num[i] > ans){\n\tn = i;\n      }\n    }\n    \n    printf(\"%d\\n\",num+n);  \n  }\n  return 0;\n}", "problem_context": "最大の和\n\n問題\n\nn 個の整数からなる数列 a1, a2, ..., an と正整数 k (1 ≤ k ≤ n) が与えられる.このとき, 連続して並ぶ k 個の整数の和 Si = ai + ai+1 + ... + ai+k-1 (1 ≤ i ≤ n - k + 1) の最大値を出力するプログラムを作りなさい.\n\n入力\n\n入力は複数のデータセットからなる．各データセットは以下の形式で与えられる．入力は２つのゼロを含む行で終了する．\n\n1 行目には正整数 n (1 ≤ n ≤ 100000) と正整数 k (1 ≤ k ≤ n) がこの順に空白で\n区切られて書かれている.2 行目以降の第 1 + i 行目 (1 ≤ i ≤ n) には, 数列の i 番目の項 ai (-10000 ≤ ai ≤ 10000) が書かれている.\n採点用データのうち, 配点の 60% 分は n ≤ 5000, k ≤ 1000 を満たす.\n\nデータセットの数は 5 を超えない．\n\n出力\n\nデータセットごとにSi の最大値を１行に出力する．\n\n入出力例\n\n入力例\n\n5 3\n2\n5\n-4\n10\n3\n0 0\n\n出力例\n\n11\n\n上記問題文と自動審判に使われるデータは、情報オリンピック日本委員会が作成し公開している問題文と採点用テストデータです。", "sample_input": "5 3\n2\n5\n-4\n10\n3\n0 0\n"}, "reference_outputs": ["11\n"], "source_document_id": "p00439", "source_text": "最大の和\n\n問題\n\nn 個の整数からなる数列 a1, a2, ..., an と正整数 k (1 ≤ k ≤ n) が与えられる.このとき, 連続して並ぶ k 個の整数の和 Si = ai + ai+1 + ... + ai+k-1 (1 ≤ i ≤ n - k + 1) の最大値を出力するプログラムを作りなさい.\n\n入力\n\n入力は複数のデータセットからなる．各データセットは以下の形式で与えられる．入力は２つのゼロを含む行で終了する．\n\n1 行目には正整数 n (1 ≤ n ≤ 100000) と正整数 k (1 ≤ k ≤ n) がこの順に空白で\n区切られて書かれている.2 行目以降の第 1 + i 行目 (1 ≤ i ≤ n) には, 数列の i 番目の項 ai (-10000 ≤ ai ≤ 10000) が書かれている.\n採点用データのうち, 配点の 60% 分は n ≤ 5000, k ≤ 1000 を満たす.\n\nデータセットの数は 5 を超えない．\n\n出力\n\nデータセットごとにSi の最大値を１行に出力する．\n\n入出力例\n\n入力例\n\n5 3\n2\n5\n-4\n10\n3\n0 0\n\n出力例\n\n11\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": 498, "cpu_time_ms": 1340, "memory_kb": 984}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s827849129", "group_id": "codeNet:p00443", "input_text": "#include<stdio.h>\n#include<string.h>\n#define min(a,b) (a<b?a:b)\nstruct x{int p,q,r,b;}B[105];\nint N,i,j,h[105],r,t;\n\nint gcd(int a,int b)\n{\n\tint c;\n\tfor(;b!=0;)\n\t{\n\t\tc=a%b;a=b;b=c;\n\t}\n\treturn a;\n}\n\nint dfs(int p)\n{\n\tint r,b,i,j,ta,tb,ri,rj,t1,t2;\n\tif(p==-1)return 1;\n\tif(h[p]>=0)return h[p];\n\tr=dfs(B[p].r);\n\tb=dfs(B[p].b);\n\tt1=10000000/(r*B[p].p),t2=10000000/(b*B[p].q);\n\ti=j=-1;\n\tri=t1;\n\trj=t2;\n\tfor(i=1;i<=min(t1,t2);i++)\n\t{\n\t\tif((r*i*B[p].p)%(b*B[p].q))continue;\n\t\tj=(r*i*B[p].p)/(b*B[p].q);\n\t\tta=r*i/B[p].q;\n\t\ttb=b*j/B[p].p;\n\t\tif(ta&&tb&&ta==tb)\n\t\t{\n\t\t\tif(ri*r+rj*b>i*r+j*b)\n\t\t\t{\n\t\t\t\tri=i;\n\t\t\t\trj=j;\n\t\t\t}\n\t\t}\n\t}\n\tif(j==-1)ri=rj=(r*b)/gcd(r,b);\n\t//printf(\"%d %d:%d %d:%d %d:%d\\n\",p,r,b,B[p].p,B[p].q,r*ri,b*rj);\n\treturn h[p]=r*ri+b*rj;\n}\n\nint main()\n{\n\tfor(;scanf(\"%d\",&N),N;)\n\t{\n\t\tmemset(h,-1,sizeof(h));\n\t\tfor(i=0;i<N;i++)\n\t\t{\n\t\t\tscanf(\"%d%d%d%d\",&B[i].p,&B[i].q,&B[i].r,&B[i].b);\n\t\t\tt=gcd(B[i].p,B[i].q);\n\t\t\tB[i].p/=t;B[i].q/=t;\n\t\t\tB[i].r--;B[i].b--;\n\t\t}\n\t\tfor(i=r=0;i<N;i++)\n\t\t{\n\t\t\tt=dfs(i);\n\t\t\tr=r>t?r:t;\n\t\t}\n\t\tprintf(\"%d\\n\",r);\n\t}\n\treturn 0;\n}", "language": "C", "metadata": {"date": 1436793088, "filename_ext": "c", "original_language": "C", "problem_description_relpath": "problem_descriptions/p00443.html", "problem_id": "p00443", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p00443/input.txt", "sample_output_relpath": "derived/input_output/data/p00443/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p00443/C/s827849129.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s827849129", "user_id": "u363039534"}, "prompt_components": {"gold_output": "5\n40\n", "input_to_evaluate": "#include<stdio.h>\n#include<string.h>\n#define min(a,b) (a<b?a:b)\nstruct x{int p,q,r,b;}B[105];\nint N,i,j,h[105],r,t;\n\nint gcd(int a,int b)\n{\n\tint c;\n\tfor(;b!=0;)\n\t{\n\t\tc=a%b;a=b;b=c;\n\t}\n\treturn a;\n}\n\nint dfs(int p)\n{\n\tint r,b,i,j,ta,tb,ri,rj,t1,t2;\n\tif(p==-1)return 1;\n\tif(h[p]>=0)return h[p];\n\tr=dfs(B[p].r);\n\tb=dfs(B[p].b);\n\tt1=10000000/(r*B[p].p),t2=10000000/(b*B[p].q);\n\ti=j=-1;\n\tri=t1;\n\trj=t2;\n\tfor(i=1;i<=min(t1,t2);i++)\n\t{\n\t\tif((r*i*B[p].p)%(b*B[p].q))continue;\n\t\tj=(r*i*B[p].p)/(b*B[p].q);\n\t\tta=r*i/B[p].q;\n\t\ttb=b*j/B[p].p;\n\t\tif(ta&&tb&&ta==tb)\n\t\t{\n\t\t\tif(ri*r+rj*b>i*r+j*b)\n\t\t\t{\n\t\t\t\tri=i;\n\t\t\t\trj=j;\n\t\t\t}\n\t\t}\n\t}\n\tif(j==-1)ri=rj=(r*b)/gcd(r,b);\n\t//printf(\"%d %d:%d %d:%d %d:%d\\n\",p,r,b,B[p].p,B[p].q,r*ri,b*rj);\n\treturn h[p]=r*ri+b*rj;\n}\n\nint main()\n{\n\tfor(;scanf(\"%d\",&N),N;)\n\t{\n\t\tmemset(h,-1,sizeof(h));\n\t\tfor(i=0;i<N;i++)\n\t\t{\n\t\t\tscanf(\"%d%d%d%d\",&B[i].p,&B[i].q,&B[i].r,&B[i].b);\n\t\t\tt=gcd(B[i].p,B[i].q);\n\t\t\tB[i].p/=t;B[i].q/=t;\n\t\t\tB[i].r--;B[i].b--;\n\t\t}\n\t\tfor(i=r=0;i<N;i++)\n\t\t{\n\t\t\tt=dfs(i);\n\t\t\tr=r>t?r:t;\n\t\t}\n\t\tprintf(\"%d\\n\",r);\n\t}\n\treturn 0;\n}", "problem_context": "最軽量のモビール\n\n問題\n\nモビールは動く芸術品として広く親しまれている.IOI 日本委員会では,JOI を広報するためにモビールを作成することになった.JOI 広報用モビールは,棒,紐(ひも),錘(おもり)の 3 種類の要素を用いて,次のように構成される.\n\n棒の一方の端は青に,もう一方の端は赤に塗られている.\n\n棒は両端以外の 1 箇所を支点として紐でつるされる.\n\n支点から赤の端までの長さも支点から青の端までの長さも正整数である.\n\n棒の両端には,紐で錘か他の棒をつるす.\n\n錘は紐を用いてどれかの棒の一端につるされる.\n\n錘には何もつるさない.\n\n錘の重さは正整数である.\n\n紐のうち 1 本だけは,片方の端をある棒をつるすためにその棒の支点に結ばれ,\nもう一方の端は他のどの構成要素とも結ばれていない.他の紐は全て次のいず\nれかを満たす.\n\nある棒の端とある棒の支点を結ぶ.\n\nある棒の端とある錘を結ぶ.\n\nただし,どの棒においても,バランスが取れている必要がある.棒と紐の重さは無視できるほど軽いので,棒と紐の重さは全て 0 であるとみなして解答せよ.つまり,それぞれの棒について,\n\n(その棒の赤の端より下につるされている錘の重さの総計)\n× (その棒の支点から赤の端までの長さ)\n= (その棒の青の端より下につるされている錘の重さの総計)\n× (その棒の支点から青の端までの長さ)\n\nであるとき,その棒はバランスが取れているとせよ.\n\nどのような長さの棒をどのように結びモビールを構成するかは既に決まっているのだが,錘の重さがまだ決まっていない.モビールは軽い方がつりやすいため, なるべく軽いモビールを作りたい.前述したようにどの棒もバランスを取りながら, モビールの総重量を最小にするような錘の付け方を求め, そのときのモビールの総重量を出力するプログラムを作れ. プログラムには以下のモビールの構成に関する情報が与えられる.\n\n棒の本数 n\n\n各棒ごとの情報(棒の番号は 1 から n)\n\n支点から赤の端までの長さと支点から青の端までの長さの比\n\n赤の端につるす棒の番号 (錘をつるす場合は 0)\n\n青の端につるす棒の番号 (錘をつるす場合は 0)\n\n入力\n\n入力は複数のデータセットからなる．各データセットは以下の形式で与えられる．入力はゼロ１つを含む行で終了する．\n\n1 行目にはモビールに使われている棒の本数 n が書かれている.続く n 行 (1 ≤ n ≤ 100) には,各々の棒のデータが書かれている.i + 1 行目 (1 ≤ i ≤ n) には,4 つの整数 p, q, r, b が空白を区切りとして書かれており,棒 i において,支点から赤の端までの長さと支点から青の端までの比が p : q であり,赤の端につるされる棒の番号が r であり,青の端につるされる棒の番号が b であることを表している.ただし,棒番号 0 は錘がつるされることを表している.また,どの入力においても,モビールの重量の最小値を w とし,入力中で比を表すのに用いられる正整数の最大値を L とすると,wL < 231 を満たす.\n\nデータセットの数は 15 を超えない．\n\n出力\n\nデータセットごとにモビールの重量を１行に出力する．\n\n入出力例\n\n入力例\n\n1\n6 9 0 0\n4\n3 2 0 4\n1 3 0 0\n4 4 2 1\n2 2 0 0\n0\n\n出力例\n\n5\n40\n\n上記問題文と自動審判に使われるデータは、情報オリンピック日本委員会が作成し公開している問題文と採点用テストデータです。", "sample_input": "1\n6 9 0 0\n4\n3 2 0 4\n1 3 0 0\n4 4 2 1\n2 2 0 0\n0\n"}, "reference_outputs": ["5\n40\n"], "source_document_id": "p00443", "source_text": "最軽量のモビール\n\n問題\n\nモビールは動く芸術品として広く親しまれている.IOI 日本委員会では,JOI を広報するためにモビールを作成することになった.JOI 広報用モビールは,棒,紐(ひも),錘(おもり)の 3 種類の要素を用いて,次のように構成される.\n\n棒の一方の端は青に,もう一方の端は赤に塗られている.\n\n棒は両端以外の 1 箇所を支点として紐でつるされる.\n\n支点から赤の端までの長さも支点から青の端までの長さも正整数である.\n\n棒の両端には,紐で錘か他の棒をつるす.\n\n錘は紐を用いてどれかの棒の一端につるされる.\n\n錘には何もつるさない.\n\n錘の重さは正整数である.\n\n紐のうち 1 本だけは,片方の端をある棒をつるすためにその棒の支点に結ばれ,\nもう一方の端は他のどの構成要素とも結ばれていない.他の紐は全て次のいず\nれかを満たす.\n\nある棒の端とある棒の支点を結ぶ.\n\nある棒の端とある錘を結ぶ.\n\nただし,どの棒においても,バランスが取れている必要がある.棒と紐の重さは無視できるほど軽いので,棒と紐の重さは全て 0 であるとみなして解答せよ.つまり,それぞれの棒について,\n\n(その棒の赤の端より下につるされている錘の重さの総計)\n× (その棒の支点から赤の端までの長さ)\n= (その棒の青の端より下につるされている錘の重さの総計)\n× (その棒の支点から青の端までの長さ)\n\nであるとき,その棒はバランスが取れているとせよ.\n\nどのような長さの棒をどのように結びモビールを構成するかは既に決まっているのだが,錘の重さがまだ決まっていない.モビールは軽い方がつりやすいため, なるべく軽いモビールを作りたい.前述したようにどの棒もバランスを取りながら, モビールの総重量を最小にするような錘の付け方を求め, そのときのモビールの総重量を出力するプログラムを作れ. プログラムには以下のモビールの構成に関する情報が与えられる.\n\n棒の本数 n\n\n各棒ごとの情報(棒の番号は 1 から n)\n\n支点から赤の端までの長さと支点から青の端までの長さの比\n\n赤の端につるす棒の番号 (錘をつるす場合は 0)\n\n青の端につるす棒の番号 (錘をつるす場合は 0)\n\n入力\n\n入力は複数のデータセットからなる．各データセットは以下の形式で与えられる．入力はゼロ１つを含む行で終了する．\n\n1 行目にはモビールに使われている棒の本数 n が書かれている.続く n 行 (1 ≤ n ≤ 100) には,各々の棒のデータが書かれている.i + 1 行目 (1 ≤ i ≤ n) には,4 つの整数 p, q, r, b が空白を区切りとして書かれており,棒 i において,支点から赤の端までの長さと支点から青の端までの比が p : q であり,赤の端につるされる棒の番号が r であり,青の端につるされる棒の番号が b であることを表している.ただし,棒番号 0 は錘がつるされることを表している.また,どの入力においても,モビールの重量の最小値を w とし,入力中で比を表すのに用いられる正整数の最大値を L とすると,wL < 231 を満たす.\n\nデータセットの数は 15 を超えない．\n\n出力\n\nデータセットごとにモビールの重量を１行に出力する．\n\n入出力例\n\n入力例\n\n1\n6 9 0 0\n4\n3 2 0 4\n1 3 0 0\n4 4 2 1\n2 2 0 0\n0\n\n出力例\n\n5\n40\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": 1053, "cpu_time_ms": 19060, "memory_kb": 600}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s976007863", "group_id": "codeNet:p00448", "input_text": "#include<stdio.h>\n#include<stdlib.h>\n#define RMAX 10\n#define CMAX 10000\nint main(void){\n\tint R,C;\n\tchar *Buffer=NULL;\n\tint Osenbei[RMAX][CMAX];\n\tint RSum[RMAX],CSum[CMAX];\n\tint count,count2,GoodSenbei=0;\n\tint BE_R=0;\n\tint Best=0,ans;\n\t\n\t//入力\n\t\n\twhile(1){\n\t\t//行列サイズ入力\n\t\tscanf(\"%d %d%*c\",&R,&C);\n\t\tif(R==0&&C==0){return 0;}//終了判定\n\t\tfor(count=0;count<R;count++){//一行ずつ入力処理\n\t\t\tint InC=0,Charbuff=0;\n\t\t\twhile(Charbuff=getchar()){//一文字ずつ入力\n\t\t\t\tif(Charbuff=='\\n'){break;}\n\t\t\t\telse if(Charbuff=='0'){\n\t\t\t\t\tOsenbei[count][InC]=0;\n\t\t\t\t\tInC++;\n\t\t\t\t}\n\t\t\t\telse if(Charbuff=='1'){\n\t\t\t\t\tOsenbei[count][InC]=1;\n\t\t\t\t\tInC++;\n\t\t\t\t}\n\t\t\t}/*\n\t\t\tfor(InC=0;InC<C;InC++){\n\t\t\t\tRSum[count]+=Osenbei[count][InC];\n\t\t\t\tCSum[InC]+=Osenbei[count][InC];\n\t\t\t}*/\n\t\t\t//for(InC=0;InC<C;InC++){\n\t\t\t//\tprintf(\"%d \",Osenbei[count][InC]);\n\t\t\t//}\n\t\t}\n\t\t//for(count2=-1;count2<C;count2++){\n\t\t//\tprintf(\"%d \",(count2==-1)?'/':CSum[count2]);\n\t\t//}\n\t\t//for(count=0;count<R;count++){\n\t\t//\tprintf(\"\\n%d|\",RSum[count]);\n\t\t//\tfor(count2=0;count2<C;count2++){\n\t\t//\t\tprintf(\"%d \",Osenbei[count][count2]);\n\t\t//\t}\n\t\t//}puts(\"\");\n\t\t//ここで全探索\n\t\tans=0;\n\t\tfor(count=0;count<(1<<R);count++){//全探索 裏返すのは1そうでないのは0\n\t\t\tint Best=0;\n\t\t\tfor(count2=0;count2<C;count2++){\n\t\t\t\tint count3;\n\t\t\t\tint c_sum=0;\n\t\t\t\tfor(count3=0;count3<R;count3++){\n\t\t\t\t\tc_sum+=(count&(1<<count3))?!(Osenbei[count3][count2]):Osenbei[count3][count2];\n\t\t\t\t\t\n\t\t\t\t}\n\t\t\t\t//printf(\"%d,\",c_sum);\n\t\t\t\tBest+=(c_sum>(R>>1))?c_sum:R-c_sum;\n\t\t\t\t\n\t\t\t}\n\t\t\t//printf(\"|%d\",Best);\n\t\t\t//puts(\"\");\n\t\t\tans=(Best>ans)?Best:ans;\n\t\t}\n\t\tprintf(\"%d\\n\",ans);\n\t}\n\treturn 0;\n\n}\n\n//次回　6/4", "language": "C", "metadata": {"date": 1338611534, "filename_ext": "c", "original_language": "C", "problem_description_relpath": "problem_descriptions/p00448.html", "problem_id": "p00448", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p00448/input.txt", "sample_output_relpath": "derived/input_output/data/p00448/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p00448/C/s976007863.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s976007863", "user_id": "u884495090"}, "prompt_components": {"gold_output": "9\n15\n", "input_to_evaluate": "#include<stdio.h>\n#include<stdlib.h>\n#define RMAX 10\n#define CMAX 10000\nint main(void){\n\tint R,C;\n\tchar *Buffer=NULL;\n\tint Osenbei[RMAX][CMAX];\n\tint RSum[RMAX],CSum[CMAX];\n\tint count,count2,GoodSenbei=0;\n\tint BE_R=0;\n\tint Best=0,ans;\n\t\n\t//入力\n\t\n\twhile(1){\n\t\t//行列サイズ入力\n\t\tscanf(\"%d %d%*c\",&R,&C);\n\t\tif(R==0&&C==0){return 0;}//終了判定\n\t\tfor(count=0;count<R;count++){//一行ずつ入力処理\n\t\t\tint InC=0,Charbuff=0;\n\t\t\twhile(Charbuff=getchar()){//一文字ずつ入力\n\t\t\t\tif(Charbuff=='\\n'){break;}\n\t\t\t\telse if(Charbuff=='0'){\n\t\t\t\t\tOsenbei[count][InC]=0;\n\t\t\t\t\tInC++;\n\t\t\t\t}\n\t\t\t\telse if(Charbuff=='1'){\n\t\t\t\t\tOsenbei[count][InC]=1;\n\t\t\t\t\tInC++;\n\t\t\t\t}\n\t\t\t}/*\n\t\t\tfor(InC=0;InC<C;InC++){\n\t\t\t\tRSum[count]+=Osenbei[count][InC];\n\t\t\t\tCSum[InC]+=Osenbei[count][InC];\n\t\t\t}*/\n\t\t\t//for(InC=0;InC<C;InC++){\n\t\t\t//\tprintf(\"%d \",Osenbei[count][InC]);\n\t\t\t//}\n\t\t}\n\t\t//for(count2=-1;count2<C;count2++){\n\t\t//\tprintf(\"%d \",(count2==-1)?'/':CSum[count2]);\n\t\t//}\n\t\t//for(count=0;count<R;count++){\n\t\t//\tprintf(\"\\n%d|\",RSum[count]);\n\t\t//\tfor(count2=0;count2<C;count2++){\n\t\t//\t\tprintf(\"%d \",Osenbei[count][count2]);\n\t\t//\t}\n\t\t//}puts(\"\");\n\t\t//ここで全探索\n\t\tans=0;\n\t\tfor(count=0;count<(1<<R);count++){//全探索 裏返すのは1そうでないのは0\n\t\t\tint Best=0;\n\t\t\tfor(count2=0;count2<C;count2++){\n\t\t\t\tint count3;\n\t\t\t\tint c_sum=0;\n\t\t\t\tfor(count3=0;count3<R;count3++){\n\t\t\t\t\tc_sum+=(count&(1<<count3))?!(Osenbei[count3][count2]):Osenbei[count3][count2];\n\t\t\t\t\t\n\t\t\t\t}\n\t\t\t\t//printf(\"%d,\",c_sum);\n\t\t\t\tBest+=(c_sum>(R>>1))?c_sum:R-c_sum;\n\t\t\t\t\n\t\t\t}\n\t\t\t//printf(\"|%d\",Best);\n\t\t\t//puts(\"\");\n\t\t\tans=(Best>ans)?Best:ans;\n\t\t}\n\t\tprintf(\"%d\\n\",ans);\n\t}\n\treturn 0;\n\n}\n\n//次回　6/4", "problem_context": "おせんべい\n\n問題\n\nIOI製菓では，創業以来の伝統の製法で煎餅（せんべい）を焼いている．この伝統の製法は，炭火で一定時間表側を焼き，表側が焼けると裏返して，炭火で一定時間裏側を焼くというものである．この伝統を守りつつ，煎餅を機械で焼いている．この機械は縦 R (1 ≤ R ≤ 10) 行, 横 C (1 ≤ C ≤ 10000) 列の長方形状に煎餅を並べて焼く．通常は自動運転で，表側が焼けたら一斉に煎餅を裏返し裏側を焼く．\n\nある日，煎餅を焼いていると，煎餅を裏返す直前に地震が起こり何枚かの煎餅が裏返ってしまった．幸いなことに炭火の状態は適切なままであったが，これ以上表側を焼くと創業以来の伝統で定められている焼き時間を超えてしまい，煎餅の表側が焼けすぎて商品として出荷できなくなる．そこで，急いで機械をマニュアル操作に変更し，まだ裏返っていない煎餅だけを裏返そうとした．この機械は，横の行を何行か同時に裏返したり縦の列を何列か同時に裏返したりすることはできるが，残念なことに，煎餅を１枚ごと裏返すことはできない．\n\n裏返すのに時間がかかると，地震で裏返らなかった煎餅の表側が焼けすぎて商品として出荷できなくなるので，横の何行かを同時に１回裏返し，引き続き，縦の何列かを同時に１回裏返して，表側を焼きすぎずに両面を焼くことのできる煎餅，つまり，「出荷できる煎餅」の枚数をなるべく多くすることにした．横の行を１行も裏返さない，あるいは，縦の列を１列も裏返さない場合も考えることにする．出荷できる煎餅の枚数の最大値を出力するプログラムを書きなさい．\n\n地震の直後に，煎餅が次の図のような状態になったとする．黒い丸が表側が焼ける状態を，白い丸が裏側が焼ける状態を表している．\n\n1行目を裏返すと次の図のような状態になる．\n\nさらに， 1列目と5列目を裏返すと次の図のような状態になる．この状態では，出荷できる煎餅は9枚である．\n\nヒント\n\nR の上限 10 は C の上限 10000 に比べて小さいことに注意せよ．\n\n入力\n\n入力は複数のデータセットからなる．各データセットは以下の形式で与えられる．\n\n入力の1行目には2つの整数 R, C (1 ≤ R ≤ 10, 1 ≤ C ≤ 10 000) が空白を区切りとして書かれている．続く R 行は地震直後の煎餅の状態を表す． (i+1) 行目 (1 ≤ i ≤ R) には， C 個の整数 ai,1, ai,2, ……, ai,C が空白を区切りとして書かれており， ai,j は i 行 j 列 の煎餅の状態を表している. ai,j が 1 なら表側が焼けることを， 0 なら裏側が焼けることを表す．\n\nC, R がともに 0 のとき入力の終了を示す.　データセットの数は 5 を超えない．\n\n出力\n\nデータセットごとに，出荷できる煎餅の最大枚数を1行に出力する．\n\n入出力例\n\n入力例\n\n2 5\n0 1 0 1 0\n1 0 0 0 1\n3 6\n1 0 0 0 1 0\n1 1 1 0 1 0\n1 0 1 1 0 1\n0 0\n\n出力例\n\n9\n15\n\n上記問題文と自動審判に使われるデータは、情報オリンピック日本委員会が作成し公開している問題文と採点用テストデータです。", "sample_input": "2 5\n0 1 0 1 0\n1 0 0 0 1\n3 6\n1 0 0 0 1 0\n1 1 1 0 1 0\n1 0 1 1 0 1\n0 0\n"}, "reference_outputs": ["9\n15\n"], "source_document_id": "p00448", "source_text": "おせんべい\n\n問題\n\nIOI製菓では，創業以来の伝統の製法で煎餅（せんべい）を焼いている．この伝統の製法は，炭火で一定時間表側を焼き，表側が焼けると裏返して，炭火で一定時間裏側を焼くというものである．この伝統を守りつつ，煎餅を機械で焼いている．この機械は縦 R (1 ≤ R ≤ 10) 行, 横 C (1 ≤ C ≤ 10000) 列の長方形状に煎餅を並べて焼く．通常は自動運転で，表側が焼けたら一斉に煎餅を裏返し裏側を焼く．\n\nある日，煎餅を焼いていると，煎餅を裏返す直前に地震が起こり何枚かの煎餅が裏返ってしまった．幸いなことに炭火の状態は適切なままであったが，これ以上表側を焼くと創業以来の伝統で定められている焼き時間を超えてしまい，煎餅の表側が焼けすぎて商品として出荷できなくなる．そこで，急いで機械をマニュアル操作に変更し，まだ裏返っていない煎餅だけを裏返そうとした．この機械は，横の行を何行か同時に裏返したり縦の列を何列か同時に裏返したりすることはできるが，残念なことに，煎餅を１枚ごと裏返すことはできない．\n\n裏返すのに時間がかかると，地震で裏返らなかった煎餅の表側が焼けすぎて商品として出荷できなくなるので，横の何行かを同時に１回裏返し，引き続き，縦の何列かを同時に１回裏返して，表側を焼きすぎずに両面を焼くことのできる煎餅，つまり，「出荷できる煎餅」の枚数をなるべく多くすることにした．横の行を１行も裏返さない，あるいは，縦の列を１列も裏返さない場合も考えることにする．出荷できる煎餅の枚数の最大値を出力するプログラムを書きなさい．\n\n地震の直後に，煎餅が次の図のような状態になったとする．黒い丸が表側が焼ける状態を，白い丸が裏側が焼ける状態を表している．\n\n1行目を裏返すと次の図のような状態になる．\n\nさらに， 1列目と5列目を裏返すと次の図のような状態になる．この状態では，出荷できる煎餅は9枚である．\n\nヒント\n\nR の上限 10 は C の上限 10000 に比べて小さいことに注意せよ．\n\n入力\n\n入力は複数のデータセットからなる．各データセットは以下の形式で与えられる．\n\n入力の1行目には2つの整数 R, C (1 ≤ R ≤ 10, 1 ≤ C ≤ 10 000) が空白を区切りとして書かれている．続く R 行は地震直後の煎餅の状態を表す． (i+1) 行目 (1 ≤ i ≤ R) には， C 個の整数 ai,1, ai,2, ……, ai,C が空白を区切りとして書かれており， ai,j は i 行 j 列 の煎餅の状態を表している. ai,j が 1 なら表側が焼けることを， 0 なら裏側が焼けることを表す．\n\nC, R がともに 0 のとき入力の終了を示す.　データセットの数は 5 を超えない．\n\n出力\n\nデータセットごとに，出荷できる煎餅の最大枚数を1行に出力する．\n\n入出力例\n\n入力例\n\n2 5\n0 1 0 1 0\n1 0 0 0 1\n3 6\n1 0 0 0 1 0\n1 1 1 0 1 0\n1 0 1 1 0 1\n0 0\n\n出力例\n\n9\n15\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": 1670, "cpu_time_ms": 280, "memory_kb": 808}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s963984300", "group_id": "codeNet:p00452", "input_text": "#include <stdio.h>\n#include <stdlib.h>\n\nint comp(const void *a,const void *b);\nint searchSup4(int P[],int N,int M);\n\nint main(){\n\n\tint N,M,N0;\t//1<=N<=1000;1<=N<=2E8\n\tint P0[1001];\n\tint P[1001];\n\tint i,j;\n\tint bak;\n\tint score_all;\n\t\n\twhile(1){\n\t\tscanf(\"%d %d\\n\",&N0,&M);\n\t\tif(!N0&&!M)break;\n\t\tfor(i=0;i<N0;i++)scanf(\"%d\\n\",&P0[i]);\n\t\tP0[N0]=0;\n\t\t\n\t\tqsort(P0,N0+1,sizeof(int),comp);\n\t\tP[0]=0;\n\t\tbak=0;\n\t\tN=N0;\n\t\tj=1;\n\t\tfor(i=1;i<=N0;i++){\n\t\t\tif(P0[i]==bak){\n\t\t\t\tN--;\n\t\t\t}else{\n\t\t\t\tbak=P0[i];\n\t\t\t\tP[j]=P0[i];\n\t\t\t\tj++;\n\t\t\t}\n\t\t}\n\t\t\n\n\t\tscore_all=searchSup4(P,N,M);\n\t\tprintf(\"%d\\n\",score_all);\n\t\t\n\t}\n\treturn 0;\n}\n\nint comp(const void *a,const void *b){\n\tint x= *(int *)a;\n\tint y= *(int *)b;\n\treturn x>y?1:(x<y?-1:0);\n}\n\n\nint searchSup4(int P[],int N,int M){\n\n\tint PP[1001*1001/2];\n\tint i,j,NN;\n\n\tNN=0;\n\tfor(i=0;i<=N;i++){\n\t\tfor(j=i;j<=N;j++){\n\t\t\tif(P[i]+P[j]<=M){\n\t\t\t\tPP[NN]=P[i]+P[j];\n\t\t\t\tNN++;\n\t\t\t}\n\t\t}\n\t}\n\n\tqsort(PP,NN,sizeof(int),comp);\n\n\tint ans;\n\t\n\tans=0;\n\tfor(i=0;i<NN;i++){\n\t\tfor(j=i;j<NN;j++){\n\t\t\tif(ans<=PP[i]+PP[j] && PP[i]+PP[j]<=M){\n\t\t\t\tans=PP[i]+PP[j];\n\t\t\t}\n\t\t}\n\t}\n\n\treturn ans;\n\n}", "language": "C", "metadata": {"date": 1385658983, "filename_ext": "c", "original_language": "C", "problem_description_relpath": "problem_descriptions/p00452.html", "problem_id": "p00452", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p00452/input.txt", "sample_output_relpath": "derived/input_output/data/p00452/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p00452/C/s963984300.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s963984300", "user_id": "u233309653"}, "prompt_components": {"gold_output": "48\n20\n", "input_to_evaluate": "#include <stdio.h>\n#include <stdlib.h>\n\nint comp(const void *a,const void *b);\nint searchSup4(int P[],int N,int M);\n\nint main(){\n\n\tint N,M,N0;\t//1<=N<=1000;1<=N<=2E8\n\tint P0[1001];\n\tint P[1001];\n\tint i,j;\n\tint bak;\n\tint score_all;\n\t\n\twhile(1){\n\t\tscanf(\"%d %d\\n\",&N0,&M);\n\t\tif(!N0&&!M)break;\n\t\tfor(i=0;i<N0;i++)scanf(\"%d\\n\",&P0[i]);\n\t\tP0[N0]=0;\n\t\t\n\t\tqsort(P0,N0+1,sizeof(int),comp);\n\t\tP[0]=0;\n\t\tbak=0;\n\t\tN=N0;\n\t\tj=1;\n\t\tfor(i=1;i<=N0;i++){\n\t\t\tif(P0[i]==bak){\n\t\t\t\tN--;\n\t\t\t}else{\n\t\t\t\tbak=P0[i];\n\t\t\t\tP[j]=P0[i];\n\t\t\t\tj++;\n\t\t\t}\n\t\t}\n\t\t\n\n\t\tscore_all=searchSup4(P,N,M);\n\t\tprintf(\"%d\\n\",score_all);\n\t\t\n\t}\n\treturn 0;\n}\n\nint comp(const void *a,const void *b){\n\tint x= *(int *)a;\n\tint y= *(int *)b;\n\treturn x>y?1:(x<y?-1:0);\n}\n\n\nint searchSup4(int P[],int N,int M){\n\n\tint PP[1001*1001/2];\n\tint i,j,NN;\n\n\tNN=0;\n\tfor(i=0;i<=N;i++){\n\t\tfor(j=i;j<=N;j++){\n\t\t\tif(P[i]+P[j]<=M){\n\t\t\t\tPP[NN]=P[i]+P[j];\n\t\t\t\tNN++;\n\t\t\t}\n\t\t}\n\t}\n\n\tqsort(PP,NN,sizeof(int),comp);\n\n\tint ans;\n\t\n\tans=0;\n\tfor(i=0;i<NN;i++){\n\t\tfor(j=i;j<NN;j++){\n\t\t\tif(ans<=PP[i]+PP[j] && PP[i]+PP[j]<=M){\n\t\t\t\tans=PP[i]+PP[j];\n\t\t\t}\n\t\t}\n\t}\n\n\treturn ans;\n\n}", "problem_context": "ダーツ\n\n問題\n\nあなたは以下のルールでダーツゲームをすることになった.\n\nあなたは,矢を的(まと)に向かって 4 本まで投げることができる.必ずしも 4 本全てを投げる必要はなく,1 本も投げなくてもかまわない.的は N 個の部分に区切られていて,各々の部分に点数 P1,..., PN が書か れている.矢が刺さった場所の点数の合計 S があなたの得点の基礎となる.S があらかじめ決められたある点数 M 以下の場合は S がそのままあなたの得点となる.しかし,S が M を超えた場合はあなたの得点は 0 点となる.\n\n的に書かれている点数と M の値が与えられたとき,あなたが得ることのできる点数の最大値を求めるプログラムを作成せよ.\n\n入力\n\n入力は複数のデータセットからなる．各データセットは以下の形式で与えられる．\n\n1 行目には,整数 N (1 ≤ N ≤ 1000) と M (1 ≤ M ≤ 200000000 = 2 × 108)がこの順に空白区切りで書かれている.2 行目以降の第 1 + i 行目 (1 ≤ i ≤ N ) には, Pi (1 ≤ Pi ≤ 100000000 = 108 ) が書かれている.\n\n採点用データのうち, 配点の 20% 分は N ≤ 100 を満たし,配点の 50% 分はN ≤ 300 を満たす.\n\nN, M がともに 0 のとき入力の終了を示す. データセットの数は 10 を超えない．\n\n出力\n\nデータセットごとにあなたが得ることのできる点数の最大値を１行に出力する.\n\n入出力例\n\n入力例\n\n4 50\n3\n14\n15\n9\n3 21\n16\n11\n2\n0 0\n\n出力例\n\n48\n20\n\n1つ目の例では,15 点の部分に 3 本,3 点の部分に 1 本の矢が刺さった場合にあなたの得点は最大になり,その得点は 48 点である.\n\n2つ目の例では,16 点の場所に 1 本,2 点の場所に 2 本の矢が刺さった場合にあなたの得点は最大になり,その得点は 20 点である.\n\n上記問題文と自動審判に使われるデータは、情報オリンピック日本委員会が作成し公開している問題文と採点用テストデータです。", "sample_input": "4 50\n3\n14\n15\n9\n3 21\n16\n11\n2\n0 0\n"}, "reference_outputs": ["48\n20\n"], "source_document_id": "p00452", "source_text": "ダーツ\n\n問題\n\nあなたは以下のルールでダーツゲームをすることになった.\n\nあなたは,矢を的(まと)に向かって 4 本まで投げることができる.必ずしも 4 本全てを投げる必要はなく,1 本も投げなくてもかまわない.的は N 個の部分に区切られていて,各々の部分に点数 P1,..., PN が書か れている.矢が刺さった場所の点数の合計 S があなたの得点の基礎となる.S があらかじめ決められたある点数 M 以下の場合は S がそのままあなたの得点となる.しかし,S が M を超えた場合はあなたの得点は 0 点となる.\n\n的に書かれている点数と M の値が与えられたとき,あなたが得ることのできる点数の最大値を求めるプログラムを作成せよ.\n\n入力\n\n入力は複数のデータセットからなる．各データセットは以下の形式で与えられる．\n\n1 行目には,整数 N (1 ≤ N ≤ 1000) と M (1 ≤ M ≤ 200000000 = 2 × 108)がこの順に空白区切りで書かれている.2 行目以降の第 1 + i 行目 (1 ≤ i ≤ N ) には, Pi (1 ≤ Pi ≤ 100000000 = 108 ) が書かれている.\n\n採点用データのうち, 配点の 20% 分は N ≤ 100 を満たし,配点の 50% 分はN ≤ 300 を満たす.\n\nN, M がともに 0 のとき入力の終了を示す. データセットの数は 10 を超えない．\n\n出力\n\nデータセットごとにあなたが得ることのできる点数の最大値を１行に出力する.\n\n入出力例\n\n入力例\n\n4 50\n3\n14\n15\n9\n3 21\n16\n11\n2\n0 0\n\n出力例\n\n48\n20\n\n1つ目の例では,15 点の部分に 3 本,3 点の部分に 1 本の矢が刺さった場合にあなたの得点は最大になり,その得点は 48 点である.\n\n2つ目の例では,16 点の場所に 1 本,2 点の場所に 2 本の矢が刺さった場合にあなたの得点は最大になり,その得点は 20 点である.\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": 1089, "cpu_time_ms": 20000, "memory_kb": 4004}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s317860872", "group_id": "codeNet:p00481", "input_text": "#include <stdio.h>\n#include <stdlib.h>\n#include <string.h>\nchar m[1002][1002];\nchar r[1002][1002];\nstruct node {\n  unsigned x:10;\n  unsigned y:10;\n  unsigned int l;\n  struct node* n;\n} *qs,*qe;\ntypedef struct node st;\nvoid push(int x,int y,int l)\n{\n  st *p = qe;\n  if(qe == NULL){\n    qe = (st *)(malloc(sizeof(st)));;\n    qs = qe;\n  }else{\n    p->n = (st *)(malloc(sizeof(st)));\n    qe = p->n;\n  }\n  qe->x = x;\n  qe->y = y;\n  qe->l = l;\n  qe->n = NULL;\n  r[y][x] = 1;\n}\nst *pop()\n{\n  st *p = qs;\n  if(qs == NULL) return NULL;\n  qs = qs->n;\n  if(qs == NULL) qe = NULL;\n  return p;\n}\nvoid flush()\n{\n  st *p = qs;\n  while(p != NULL){\n    qs = qs->n;\n    free(p);\n    p = qs;\n  }\n  qe = NULL;\n}\nint search(int* xs,int* ys,int d)\n{\n  st *p;\n  int l,i,x,y;\n  int xd[] = {-1,1,0,0}, yd[] = {0,0,-1,1};\n  memset(r,0,sizeof(r));\n  push(*xs,*ys,0);\n  while((p = pop()) != NULL){\n    for(i=0; i<4; i++) {\n      x = (p->x) + xd[i];\n      y = (p->y) + yd[i];\n      if(m[y][x] == d) {\n\t*xs = x;\n\t*ys = y;\n\tl = (p->l) + 1;\n\tfree(p);\n\treturn l;\n      }\n      if((m[y][x] != -1) && (r[y][x] == 0))\n\tpush(x, y, (p->l)+1);\n    }\n    free(p);\n  }\n}\nint main(){\n  int h,w,n,i,j,xs,ys,t=0;\n  char c[1002];\n  memset(m,-1,sizeof(m));\n  scanf(\"%d%d%d\\n\",&h,&w,&n);\n  for(i=1;i<=h;i++){\n    scanf(\"%s\",c);\n    for(j=1;j<=w;j++){\n      switch(c[j-1]){\n      case 'S':\n\txs = j; ys = i;\n      case '.':\n\tm[i][j] = 0;\n\tbreak;\n      case 'X':\n\tm[i][j] = -1;\n\tbreak;\n      default:\n\tm[i][j] = c[j-1]-'0';\n      }\n    }\n    scanf(\"\\n\");\n  }\n  for(i=1;i<=n;i++){\n    t+=search(&xs,&ys,i);\n    flush();\n  }\n  printf(\"%d\\n\",t);\n  return 0;\n}", "language": "C", "metadata": {"date": 1320134507, "filename_ext": "c", "original_language": "C", "problem_description_relpath": "problem_descriptions/p00481.html", "problem_id": "p00481", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p00481/input.txt", "sample_output_relpath": "derived/input_output/data/p00481/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p00481/C/s317860872.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s317860872", "user_id": "u324171823"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "#include <stdio.h>\n#include <stdlib.h>\n#include <string.h>\nchar m[1002][1002];\nchar r[1002][1002];\nstruct node {\n  unsigned x:10;\n  unsigned y:10;\n  unsigned int l;\n  struct node* n;\n} *qs,*qe;\ntypedef struct node st;\nvoid push(int x,int y,int l)\n{\n  st *p = qe;\n  if(qe == NULL){\n    qe = (st *)(malloc(sizeof(st)));;\n    qs = qe;\n  }else{\n    p->n = (st *)(malloc(sizeof(st)));\n    qe = p->n;\n  }\n  qe->x = x;\n  qe->y = y;\n  qe->l = l;\n  qe->n = NULL;\n  r[y][x] = 1;\n}\nst *pop()\n{\n  st *p = qs;\n  if(qs == NULL) return NULL;\n  qs = qs->n;\n  if(qs == NULL) qe = NULL;\n  return p;\n}\nvoid flush()\n{\n  st *p = qs;\n  while(p != NULL){\n    qs = qs->n;\n    free(p);\n    p = qs;\n  }\n  qe = NULL;\n}\nint search(int* xs,int* ys,int d)\n{\n  st *p;\n  int l,i,x,y;\n  int xd[] = {-1,1,0,0}, yd[] = {0,0,-1,1};\n  memset(r,0,sizeof(r));\n  push(*xs,*ys,0);\n  while((p = pop()) != NULL){\n    for(i=0; i<4; i++) {\n      x = (p->x) + xd[i];\n      y = (p->y) + yd[i];\n      if(m[y][x] == d) {\n\t*xs = x;\n\t*ys = y;\n\tl = (p->l) + 1;\n\tfree(p);\n\treturn l;\n      }\n      if((m[y][x] != -1) && (r[y][x] == 0))\n\tpush(x, y, (p->l)+1);\n    }\n    free(p);\n  }\n}\nint main(){\n  int h,w,n,i,j,xs,ys,t=0;\n  char c[1002];\n  memset(m,-1,sizeof(m));\n  scanf(\"%d%d%d\\n\",&h,&w,&n);\n  for(i=1;i<=h;i++){\n    scanf(\"%s\",c);\n    for(j=1;j<=w;j++){\n      switch(c[j-1]){\n      case 'S':\n\txs = j; ys = i;\n      case '.':\n\tm[i][j] = 0;\n\tbreak;\n      case 'X':\n\tm[i][j] = -1;\n\tbreak;\n      default:\n\tm[i][j] = c[j-1]-'0';\n      }\n    }\n    scanf(\"\\n\");\n  }\n  for(i=1;i<=n;i++){\n    t+=search(&xs,&ys,i);\n    flush();\n  }\n  printf(\"%d\\n\",t);\n  return 0;\n}", "problem_context": "チーズ (Cheese)\n\n問題\n\n今年も JOI 町のチーズ工場がチーズの生産を始め，ねずみが巣から顔を出した．JOI 町は東西南北に区画整理されていて，各区画は巣，チーズ工場，障害物，空き地のいずれかである．ねずみは巣から出発して全てのチーズ工場を訪れチーズを 1 個ずつ食べる．\n\nこの町には，N 個のチーズ工場があり，どの工場も１種類のチーズだけを生産している．チーズの硬さは工場によって異なっており，硬さ 1 から N までのチーズを生産するチーズ工場がちょうど 1 つずつある．\n\nねずみの最初の体力は 1 であり，チーズを 1 個食べるごとに体力が 1 増える．ただし，ねずみは自分の体力よりも硬いチーズを食べることはできない．\n\nねずみは，東西南北に隣り合う区画に 1 分で移動することができるが，障害物の区画には入ることができない．チーズ工場をチーズを食べずに通り過ぎることもできる．すべてのチーズを食べ終えるまでにかかる最短時間を求めるプログラムを書け．ただし，ねずみがチーズを食べるのにかかる時間は無視できる．\n\n入力\n\n入力は H+1 行ある．1 行目には 3 つの整数 H，W，N (1 ≤ H ≤ 1000，1 ≤ W ≤ 1000，1 ≤ N ≤ 9) がこの順に空白で区切られて書かれている．2 行目から H+1 行目までの各行には，'S'，'1', '2', ..., '9'，'X'，'.' からなる W 文字の文字列が書かれており，各々が各区画の状態を表している．北から i 番目，西から j 番目の区画を (i,j) と記述することにすると (1 ≤ i ≤ H, 1 ≤ j ≤ W)，第 i+1 行目の j 番目の文字は，区画 (i,j) が巣である場合は 'S' となり，障害物である場合は 'X' となり，空き地である場合は '.' となり，硬さ 1, 2, ..., 9 のチーズを生産する工場である場合はそれぞれ '1', '2', ..., '9' となる．入力には巣と硬さ 1, 2, ..., N のチーズを生産する工場がそれぞれ 1 つずつある．他のマスは障害物または空き地であることが保証されている．ねずみは全てのチーズを食べられることが保証されている．\n\n出力\n\nすべてのチーズを食べ終えるまでにかかる最短時間（分）を表す整数を 1 行で出力せよ．\n\n入出力例\n\n入力例 1\n\n3 3 1\nS..\n...\n..1\n\n出力例 1\n\n4\n\n入力例 2\n\n4 5 2\n.X..1\n....X\n.XX.S\n.2.X.\n\n出力例 2\n\n12\n\n入力例 3\n\n10 10 9\n.X...X.S.X\n6..5X..X1X\n...XXXX..X\nX..9X...X.\n8.X2X..X3X\n...XX.X4..\nXX....7X..\nX..X..XX..\nX...X.XX..\n..X.......\n\n出力例 3\n\n91\n\n問題文と自動審判に使われるデータは、情報オリンピック日本委員会が作成し公開している問題文と採点用テストデータです。", "sample_input": "3 3 1\nS..\n...\n..1\n"}, "reference_outputs": ["4\n"], "source_document_id": "p00481", "source_text": "チーズ (Cheese)\n\n問題\n\n今年も JOI 町のチーズ工場がチーズの生産を始め，ねずみが巣から顔を出した．JOI 町は東西南北に区画整理されていて，各区画は巣，チーズ工場，障害物，空き地のいずれかである．ねずみは巣から出発して全てのチーズ工場を訪れチーズを 1 個ずつ食べる．\n\nこの町には，N 個のチーズ工場があり，どの工場も１種類のチーズだけを生産している．チーズの硬さは工場によって異なっており，硬さ 1 から N までのチーズを生産するチーズ工場がちょうど 1 つずつある．\n\nねずみの最初の体力は 1 であり，チーズを 1 個食べるごとに体力が 1 増える．ただし，ねずみは自分の体力よりも硬いチーズを食べることはできない．\n\nねずみは，東西南北に隣り合う区画に 1 分で移動することができるが，障害物の区画には入ることができない．チーズ工場をチーズを食べずに通り過ぎることもできる．すべてのチーズを食べ終えるまでにかかる最短時間を求めるプログラムを書け．ただし，ねずみがチーズを食べるのにかかる時間は無視できる．\n\n入力\n\n入力は H+1 行ある．1 行目には 3 つの整数 H，W，N (1 ≤ H ≤ 1000，1 ≤ W ≤ 1000，1 ≤ N ≤ 9) がこの順に空白で区切られて書かれている．2 行目から H+1 行目までの各行には，'S'，'1', '2', ..., '9'，'X'，'.' からなる W 文字の文字列が書かれており，各々が各区画の状態を表している．北から i 番目，西から j 番目の区画を (i,j) と記述することにすると (1 ≤ i ≤ H, 1 ≤ j ≤ W)，第 i+1 行目の j 番目の文字は，区画 (i,j) が巣である場合は 'S' となり，障害物である場合は 'X' となり，空き地である場合は '.' となり，硬さ 1, 2, ..., 9 のチーズを生産する工場である場合はそれぞれ '1', '2', ..., '9' となる．入力には巣と硬さ 1, 2, ..., N のチーズを生産する工場がそれぞれ 1 つずつある．他のマスは障害物または空き地であることが保証されている．ねずみは全てのチーズを食べられることが保証されている．\n\n出力\n\nすべてのチーズを食べ終えるまでにかかる最短時間（分）を表す整数を 1 行で出力せよ．\n\n入出力例\n\n入力例 1\n\n3 3 1\nS..\n...\n..1\n\n出力例 1\n\n4\n\n入力例 2\n\n4 5 2\n.X..1\n....X\n.XX.S\n.2.X.\n\n出力例 2\n\n12\n\n入力例 3\n\n10 10 9\n.X...X.S.X\n6..5X..X1X\n...XXXX..X\nX..9X...X.\n8.X2X..X3X\n...XX.X4..\nXX....7X..\nX..X..XX..\nX...X.XX..\n..X.......\n\n出力例 3\n\n91\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": 1606, "cpu_time_ms": 160, "memory_kb": 2384}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s735633660", "group_id": "codeNet:p00513", "input_text": "#include <stdio.h>\n#include <string.h>\n\nint main (void){\n\n\tint i=0;\n\tint number=0;\n\tint input[100000]={0};\n\tint x=1;\n\tint y=1;\n\tint s=0;\n\tint count=0;\n\tint flag=0;\n\n\tscanf(\"%d\",&number);\n\n\tif (number > 100000){\n\t\treturn 1;\n\t}\n\n\tfor ( i=0; i < number; i++){\n\t\tscanf(\"%d\", &input[i]);\n\t\tif ( input[i] > 2147483647){\n\t\t\treturn 1;\n\t\t}\n\t}\n\n\ti=0;\n\n\twhile(1){\n\t\tflag =1;\n\t\tint x_hold =1;\n\t\tint y_hold=1;\n\t\t\n\t\tfor ( x= x_hold; x <= (input[i]-1)/3; x++){\n\t\t\tfor(y=y_hold; y<=x; y++){\n\t\t\t\tif( (2 * x * y + x + y) == input[i]){\n\t\t\t\t\tflag=0;\n\t\t\t\t\tx_hold = x;\n\t\t\t\t\ty_hold = y;\n\t\t\t\t\tbreak;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\tif( (2 * x * y + x + y) > input[i]){\n\t\t\t\t\tbreak;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\ti++;\n\t\tif(flag == 1){\n\t\t\tcount++;\n\t\t\tflag=0;\n\t\t}\n\n\t\tif(i== number){\n\t\t\tbreak;\n\t\t}\n\t}\n\n\tprintf(\"%d\\n\",count );\n\t\n\t/*\n\t\n\twhile (1){\n\t\ts = 2 * x * y + x + y;\n\t\t//11:4\n\t\t//21:7\n\t\t//31:10\n\t\t//41:13\n\t\t//22:12\n\t\t//32:17\n\t\t//33:\n\t\t\n\n\t\tif (input[i] > s){\n\t\t\tif(x <= y ){\n\t\t\t\tx++;\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\ty++;\n\t\t\tcontinue;\n\t\t}\n\n\t\telse if (input[i] < s ){\n\t\t\tcount++;\n\t\t\ti++;\n\t\t}\n\n\t\telse if (input[i] == s){\n\t\t\ti++;\n\t\t}\n\n\t\tif(i==number){\n\t\t\tbreak;\n\t\t}\n\n\t}\n\t*/\n\n\t\n\t\n\n\treturn 0;\n}", "language": "C", "metadata": {"date": 1457358712, "filename_ext": "c", "original_language": "C", "problem_description_relpath": "problem_descriptions/p00513.html", "problem_id": "p00513", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p00513/input.txt", "sample_output_relpath": "derived/input_output/data/p00513/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p00513/C/s735633660.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s735633660", "user_id": "u936599950"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "#include <stdio.h>\n#include <string.h>\n\nint main (void){\n\n\tint i=0;\n\tint number=0;\n\tint input[100000]={0};\n\tint x=1;\n\tint y=1;\n\tint s=0;\n\tint count=0;\n\tint flag=0;\n\n\tscanf(\"%d\",&number);\n\n\tif (number > 100000){\n\t\treturn 1;\n\t}\n\n\tfor ( i=0; i < number; i++){\n\t\tscanf(\"%d\", &input[i]);\n\t\tif ( input[i] > 2147483647){\n\t\t\treturn 1;\n\t\t}\n\t}\n\n\ti=0;\n\n\twhile(1){\n\t\tflag =1;\n\t\tint x_hold =1;\n\t\tint y_hold=1;\n\t\t\n\t\tfor ( x= x_hold; x <= (input[i]-1)/3; x++){\n\t\t\tfor(y=y_hold; y<=x; y++){\n\t\t\t\tif( (2 * x * y + x + y) == input[i]){\n\t\t\t\t\tflag=0;\n\t\t\t\t\tx_hold = x;\n\t\t\t\t\ty_hold = y;\n\t\t\t\t\tbreak;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\tif( (2 * x * y + x + y) > input[i]){\n\t\t\t\t\tbreak;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\ti++;\n\t\tif(flag == 1){\n\t\t\tcount++;\n\t\t\tflag=0;\n\t\t}\n\n\t\tif(i== number){\n\t\t\tbreak;\n\t\t}\n\t}\n\n\tprintf(\"%d\\n\",count );\n\t\n\t/*\n\t\n\twhile (1){\n\t\ts = 2 * x * y + x + y;\n\t\t//11:4\n\t\t//21:7\n\t\t//31:10\n\t\t//41:13\n\t\t//22:12\n\t\t//32:17\n\t\t//33:\n\t\t\n\n\t\tif (input[i] > s){\n\t\t\tif(x <= y ){\n\t\t\t\tx++;\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\ty++;\n\t\t\tcontinue;\n\t\t}\n\n\t\telse if (input[i] < s ){\n\t\t\tcount++;\n\t\t\ti++;\n\t\t}\n\n\t\telse if (input[i] == s){\n\t\t\ti++;\n\t\t}\n\n\t\tif(i==number){\n\t\t\tbreak;\n\t\t}\n\n\t}\n\t*/\n\n\t\n\t\n\n\treturn 0;\n}", "problem_context": "問題 4\n\n　IOI 不動産ではマンションの賃貸を行なっている．\nこの会社が取り扱うマンションの部屋は 1LDK で，\n下図のように面積が 2xy+x+y になっている．\nただし， x, y は正整数である．\n\n　IOI 不動産のカタログにはマンションの面積が昇順に（狭いものから順番に）書かれているが，この中にいくつか間違い（ありえない面積のもの）が混じっていることがわかった．\n\n　カタログ（入力ファイル）は N+1 行で，最初の行に部屋数が書かれていて，\n続く N 行に，１行に１部屋ずつ面積が昇順に書かれている．\nただし，\n部屋数は 100,000 以下，\n面積は (2の31乗)-1 = 2,147,483,647 以下である．\n５つの入力データのうち３つまでは，\n部屋数 1000 以下，面積 30000 以下である．\n\n　間違っている行数（ありえない部屋の数）を出力しなさい．\n\n　出力ファイルにおいては，\n出力の最後の行にも改行コードを入れること．\n\n入出力例\n\n入力例\n\n10\n4\n7\n9\n10\n12\n13\n16\n17\n19\n20\n\n出力例\n\n2\n\n問題文と自動審判に使われるデータは、情報オリンピック日本委員会が作成し公開している問題文と採点用テストデータです。", "sample_input": "10\n4\n7\n9\n10\n12\n13\n16\n17\n19\n20\n"}, "reference_outputs": ["2\n"], "source_document_id": "p00513", "source_text": "問題 4\n\n　IOI 不動産ではマンションの賃貸を行なっている．\nこの会社が取り扱うマンションの部屋は 1LDK で，\n下図のように面積が 2xy+x+y になっている．\nただし， x, y は正整数である．\n\n　IOI 不動産のカタログにはマンションの面積が昇順に（狭いものから順番に）書かれているが，この中にいくつか間違い（ありえない面積のもの）が混じっていることがわかった．\n\n　カタログ（入力ファイル）は N+1 行で，最初の行に部屋数が書かれていて，\n続く N 行に，１行に１部屋ずつ面積が昇順に書かれている．\nただし，\n部屋数は 100,000 以下，\n面積は (2の31乗)-1 = 2,147,483,647 以下である．\n５つの入力データのうち３つまでは，\n部屋数 1000 以下，面積 30000 以下である．\n\n　間違っている行数（ありえない部屋の数）を出力しなさい．\n\n　出力ファイルにおいては，\n出力の最後の行にも改行コードを入れること．\n\n入出力例\n\n入力例\n\n10\n4\n7\n9\n10\n12\n13\n16\n17\n19\n20\n\n出力例\n\n2\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": 1141, "cpu_time_ms": 20000, "memory_kb": 992}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s458637032", "group_id": "codeNet:p00524", "input_text": "// AOJ \t0601 Sugar Glider\n// 2018.1.16 bal4u\n\n#include <stdio.h>\n#include <stdlib.h>\n#include <string.h>\n\n#define QMAX 350000\ntypedef struct { long long t; int s; } QUE;\nQUE que[QMAX]; int qsize;\n\n#define PARENT(i) ((i)>>1)\n#define LEFT(i)   ((i)<<1)\n#define RIGHT(i)  (((i)<<1)+1)\n\nvoid max_heapify(int i)\n{\n\tint l, r, max;\n\tQUE qt;\n\tl = LEFT(i), r = RIGHT(i);\n\tif (l < qsize && que[l].t > que[i].t) max = l; else max = i;\n\tif (r < qsize && que[r].t > que[max].t) max = r;\n\tif (max != i) {\n\t\tqt = que[i], que[i] = que[max], que[max] = qt;\n\t\tmax_heapify(max);\n\t}\n}\n\nvoid deq()\n{\n\tque[0] = que[--qsize];\n\tmax_heapify(0);\n}\n\nvoid enq(int s, long long t)\n{\n\tint i, max;\n\tQUE qt;\n\n\ti = qsize++;\n\tque[i].s = s, que[i].t = t;\n\twhile (i > 0 && que[max = PARENT(i)].t < que[i].t) {\n\t\tqt = que[i]; que[i] = que[max], que[max] = qt;\n\t\ti = max;\n\t}\n}\n\ntypedef struct { int a, b, t; } T;\nT tbl[300002];\n\nint h[100002];\nint *to[100002], *dt[100002], hi[100002];\nchar used[100002];\n\n//#define getchar_unlocked()  getchar()\nint in()\n{\n\tint n = 0;\n\tint c = getchar_unlocked();\n\tdo n = (n<<3)+(n<<1) + (c & 0xf), c = getchar_unlocked();\n\twhile (c >= '0');\n\treturn n;\n}\n\nlong long dijkstra(int start, int goal, int val)\n{\n\tint i, s, e, c;\n\tlong long d, x;\n\n\tqsize = 0;\n\tenq(start, val);\n\twhile (qsize) {\n\t\ts = que[0].s, d = que[0].t, deq();\n\t\tif (s == goal) return val + h[goal] - d*2;\n\t\tif (used[s]) continue;\n\t\tused[s] = 1;\n\t\tfor (i = 0; i < hi[s]; i++) {\n\t\t\te = to[s][i];\n\t\t\tc = dt[s][i];\n\t\t\tif (used[e] || c > h[s]) continue;\n\t\t\tx = d - c; if (x > h[e]) x = h[e];\n\t\t\tenq(e, x);\n\t\t}\n\t}\n\treturn -1;\n}\n\nint main()\n{\n\tint n, m, x;\n\tint i, k;\n\tT *tp;\n\n\tn = in(), m = in(), x = in();\n\tfor (i = 0; i < n; i++) h[i] = in();\n\tfor (tp = tbl, i = 0; i < m; i++, tp++) {\n\t\ttp->a = in()-1, tp->b = in()-1, tp->t = in();\n\t\thi[tp->a]++, hi[tp->b]++;\n\t}\n\tfor (i = 0; i < n; i++) {\n\t\tto[i] = malloc(hi[i] << 2);\n\t\tdt[i] = malloc(hi[i] << 2);\n\t}\n\tmemset(hi, 0, sizeof(hi));\n\tfor (tp = tbl, i = 0; i < m; i++, tp++) {\n\t\tk = hi[tp->a]++, to[tp->a][k] = tp->b, dt[tp->a][k] = tp->t;\n\t\tk = hi[tp->b]++, to[tp->b][k] = tp->a, dt[tp->b][k] = tp->t;\n\t}\n\tprintf(\"%lld\\n\", dijkstra(0, n-1, x));\n\treturn 0;\n}\n", "language": "C", "metadata": {"date": 1516105682, "filename_ext": "c", "original_language": "C", "problem_description_relpath": "problem_descriptions/p00524.html", "problem_id": "p00524", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p00524/input.txt", "sample_output_relpath": "derived/input_output/data/p00524/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p00524/C/s458637032.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s458637032", "user_id": "u847467233"}, "prompt_components": {"gold_output": "110\n", "input_to_evaluate": "// AOJ \t0601 Sugar Glider\n// 2018.1.16 bal4u\n\n#include <stdio.h>\n#include <stdlib.h>\n#include <string.h>\n\n#define QMAX 350000\ntypedef struct { long long t; int s; } QUE;\nQUE que[QMAX]; int qsize;\n\n#define PARENT(i) ((i)>>1)\n#define LEFT(i)   ((i)<<1)\n#define RIGHT(i)  (((i)<<1)+1)\n\nvoid max_heapify(int i)\n{\n\tint l, r, max;\n\tQUE qt;\n\tl = LEFT(i), r = RIGHT(i);\n\tif (l < qsize && que[l].t > que[i].t) max = l; else max = i;\n\tif (r < qsize && que[r].t > que[max].t) max = r;\n\tif (max != i) {\n\t\tqt = que[i], que[i] = que[max], que[max] = qt;\n\t\tmax_heapify(max);\n\t}\n}\n\nvoid deq()\n{\n\tque[0] = que[--qsize];\n\tmax_heapify(0);\n}\n\nvoid enq(int s, long long t)\n{\n\tint i, max;\n\tQUE qt;\n\n\ti = qsize++;\n\tque[i].s = s, que[i].t = t;\n\twhile (i > 0 && que[max = PARENT(i)].t < que[i].t) {\n\t\tqt = que[i]; que[i] = que[max], que[max] = qt;\n\t\ti = max;\n\t}\n}\n\ntypedef struct { int a, b, t; } T;\nT tbl[300002];\n\nint h[100002];\nint *to[100002], *dt[100002], hi[100002];\nchar used[100002];\n\n//#define getchar_unlocked()  getchar()\nint in()\n{\n\tint n = 0;\n\tint c = getchar_unlocked();\n\tdo n = (n<<3)+(n<<1) + (c & 0xf), c = getchar_unlocked();\n\twhile (c >= '0');\n\treturn n;\n}\n\nlong long dijkstra(int start, int goal, int val)\n{\n\tint i, s, e, c;\n\tlong long d, x;\n\n\tqsize = 0;\n\tenq(start, val);\n\twhile (qsize) {\n\t\ts = que[0].s, d = que[0].t, deq();\n\t\tif (s == goal) return val + h[goal] - d*2;\n\t\tif (used[s]) continue;\n\t\tused[s] = 1;\n\t\tfor (i = 0; i < hi[s]; i++) {\n\t\t\te = to[s][i];\n\t\t\tc = dt[s][i];\n\t\t\tif (used[e] || c > h[s]) continue;\n\t\t\tx = d - c; if (x > h[e]) x = h[e];\n\t\t\tenq(e, x);\n\t\t}\n\t}\n\treturn -1;\n}\n\nint main()\n{\n\tint n, m, x;\n\tint i, k;\n\tT *tp;\n\n\tn = in(), m = in(), x = in();\n\tfor (i = 0; i < n; i++) h[i] = in();\n\tfor (tp = tbl, i = 0; i < m; i++, tp++) {\n\t\ttp->a = in()-1, tp->b = in()-1, tp->t = in();\n\t\thi[tp->a]++, hi[tp->b]++;\n\t}\n\tfor (i = 0; i < n; i++) {\n\t\tto[i] = malloc(hi[i] << 2);\n\t\tdt[i] = malloc(hi[i] << 2);\n\t}\n\tmemset(hi, 0, sizeof(hi));\n\tfor (tp = tbl, i = 0; i < m; i++, tp++) {\n\t\tk = hi[tp->a]++, to[tp->a][k] = tp->b, dt[tp->a][k] = tp->t;\n\t\tk = hi[tp->b]++, to[tp->b][k] = tp->a, dt[tp->b][k] = tp->t;\n\t}\n\tprintf(\"%lld\\n\", dijkstra(0, n-1, x));\n\treturn 0;\n}\n", "problem_context": "MathJax.Hub.Config({ tex2jax: { inlineMath: [[\"$\",\"$\"], [\"\\\\(\",\"\\\\)\"]], processEscapes: true }});\n\nフクロモモンガ(Sugar Glider)\n\nフクロモモンガのJOI 君が住んでいる森にはユーカリの木が $N$ 本生えており，それらの木には1 から $N$ の番号がついている．木 $i$ の高さは $H_i$ メートルである．\n\nJOI 君が相互に直接飛び移ることのできる木の組が $M$ 組あり，各組の木の間を飛び移るためにかかる時間が定まっている．JOI 君が木の間を飛び移っている間は，地面からの高さが1 秒あたり1 メートル下がる．すなわち，JOI 君の現在の地面からの高さが $h$ メートル，木の間を飛び移るためにかかる時間が $t$ 秒であるとき，飛び移った後の地面からの高さは $h - t$ メートルとなる．ただし，$h - t$ が0 よりも小さくなる場合や行き先の木の高さよりも大きくなる場合は飛び移ることができない．\n\nさらに，JOI 君は木の側面を上下に移動することによって，地面からの高さを0 メートルから今いる木の高さの範囲で増減させることができる．JOI 君が地面からの高さを1 メートル増加または減少させるためには1 秒の時間がかかる．\n\nJOI 君は，木1 の高さ$X$ メートルの位置から木$N$ の頂上(高さ$H_N$ メートルの位置) に行こうとしており，そのためにかかる時間の最小値を知りたい．\n\n課題\n\n各木の高さと，JOI 君が直接飛び移ることができる木の組の情報と，最初JOI 君がいる場所の高さが与えられる．木 $N$ の頂上に行くためにかかる時間の最小値を求めるプログラムを作成せよ.\n\n入力\n\n標準入力から以下のデータを読み込め．\n\n1 行目には，整数 $N, M, X$ が空白を区切りとして書かれている．これは，木の本数が $N$ 本，移動できる木の組が $M$ 組あり，最初JOI 君が木1 の高さ $X$ メートルの位置にいることを表す．\n\n続く $N$ 行のうちの $i$ 行目$(1 \\leq i \\leq N)$ には，整数 $H_i$ が書かれている．これは，木 $i$ の高さが $H_i$ メートルであることを表す．\n\n続く$M$ 行のうちの $j$ 行目$(1 \\leq j \\leq M)$ には，整数 $A_j, B_j, T_j$ $(1 \\leq A_j \\leq N, 1 \\leq B_j \\leq N, A_j \\ne B_j)$ が空白を区切りとして書かれている．これは，木 $A_j$ と木 $B_j$ の間を相互に $T_j$ 秒で飛び移ることができることを表している．また，$1 \\leq j < k \\leq M$ ならば，$(A_j, B_j) \\ne (A_k, B_k)$ および$(A_j, B_j) \\ne (B_k, A_k)$ を満たす．\n\n出力\n\n標準出力に，木1 の高さ $X$ メートルの位置から木 $N$ の頂上に行くためにかかる時間の最小値を秒単位で表す整数を1 行で出力せよ．ただし，そのような方法がない場合は代わりに -1 を出力せよ．\n\n制限\n\nすべての入力データは以下の条件を満たす．\n\n$2 \\leq N \\leq 100000$\n\n$1 \\leq M \\leq 300000$\n\n$1 \\leq H_i \\leq 1000000000 (1 \\leq i \\leq N)$\n\n$1 \\leq T_j \\leq 1000000000 (1 \\leq j \\leq M)$\n\n$0 \\leq X \\leq H_1$\n\n入出力例\n\n入力例 1\n\n5 5 0\n50\n100\n25\n30\n10\n1 2 10\n2 5 50\n2 4 20\n4 3 1\n5 4 20\n\n出力例 1\n\n110\n\n例えば，以下のように移動すればよい．\n\n1. 木1 を50 メートル登る．\n\n2. 木1 から木2 に飛び移る．\n\n3. 木2 から木4 に飛び移る．\n\n4. 木4 から木5 に飛び移る．\n\n5. 木5 を10 メートル登る．\n\n入力例 2\n\n2 1 0\n1\n1\n1 2 100\n\n出力例 2\n\n-1\n\nJOI 君は木1 から木2 に飛び移ることができない．\n\n入力例 3\n\n4 3 30\n50\n10\n20\n50\n1 2 10\n2 3 10\n3 4 10\n\n出力例 3\n\n100\n\n問題文と自動審判に使われるデータは、情報オリンピック日本委員会が作成し公開している問題文と採点用テストデータです。", "sample_input": "5 5 0\n50\n100\n25\n30\n10\n1 2 10\n2 5 50\n2 4 20\n4 3 1\n5 4 20\n"}, "reference_outputs": ["110\n"], "source_document_id": "p00524", "source_text": "MathJax.Hub.Config({ tex2jax: { inlineMath: [[\"$\",\"$\"], [\"\\\\(\",\"\\\\)\"]], processEscapes: true }});\n\nフクロモモンガ(Sugar Glider)\n\nフクロモモンガのJOI 君が住んでいる森にはユーカリの木が $N$ 本生えており，それらの木には1 から $N$ の番号がついている．木 $i$ の高さは $H_i$ メートルである．\n\nJOI 君が相互に直接飛び移ることのできる木の組が $M$ 組あり，各組の木の間を飛び移るためにかかる時間が定まっている．JOI 君が木の間を飛び移っている間は，地面からの高さが1 秒あたり1 メートル下がる．すなわち，JOI 君の現在の地面からの高さが $h$ メートル，木の間を飛び移るためにかかる時間が $t$ 秒であるとき，飛び移った後の地面からの高さは $h - t$ メートルとなる．ただし，$h - t$ が0 よりも小さくなる場合や行き先の木の高さよりも大きくなる場合は飛び移ることができない．\n\nさらに，JOI 君は木の側面を上下に移動することによって，地面からの高さを0 メートルから今いる木の高さの範囲で増減させることができる．JOI 君が地面からの高さを1 メートル増加または減少させるためには1 秒の時間がかかる．\n\nJOI 君は，木1 の高さ$X$ メートルの位置から木$N$ の頂上(高さ$H_N$ メートルの位置) に行こうとしており，そのためにかかる時間の最小値を知りたい．\n\n課題\n\n各木の高さと，JOI 君が直接飛び移ることができる木の組の情報と，最初JOI 君がいる場所の高さが与えられる．木 $N$ の頂上に行くためにかかる時間の最小値を求めるプログラムを作成せよ.\n\n入力\n\n標準入力から以下のデータを読み込め．\n\n1 行目には，整数 $N, M, X$ が空白を区切りとして書かれている．これは，木の本数が $N$ 本，移動できる木の組が $M$ 組あり，最初JOI 君が木1 の高さ $X$ メートルの位置にいることを表す．\n\n続く $N$ 行のうちの $i$ 行目$(1 \\leq i \\leq N)$ には，整数 $H_i$ が書かれている．これは，木 $i$ の高さが $H_i$ メートルであることを表す．\n\n続く$M$ 行のうちの $j$ 行目$(1 \\leq j \\leq M)$ には，整数 $A_j, B_j, T_j$ $(1 \\leq A_j \\leq N, 1 \\leq B_j \\leq N, A_j \\ne B_j)$ が空白を区切りとして書かれている．これは，木 $A_j$ と木 $B_j$ の間を相互に $T_j$ 秒で飛び移ることができることを表している．また，$1 \\leq j < k \\leq M$ ならば，$(A_j, B_j) \\ne (A_k, B_k)$ および$(A_j, B_j) \\ne (B_k, A_k)$ を満たす．\n\n出力\n\n標準出力に，木1 の高さ $X$ メートルの位置から木 $N$ の頂上に行くためにかかる時間の最小値を秒単位で表す整数を1 行で出力せよ．ただし，そのような方法がない場合は代わりに -1 を出力せよ．\n\n制限\n\nすべての入力データは以下の条件を満たす．\n\n$2 \\leq N \\leq 100000$\n\n$1 \\leq M \\leq 300000$\n\n$1 \\leq H_i \\leq 1000000000 (1 \\leq i \\leq N)$\n\n$1 \\leq T_j \\leq 1000000000 (1 \\leq j \\leq M)$\n\n$0 \\leq X \\leq H_1$\n\n入出力例\n\n入力例 1\n\n5 5 0\n50\n100\n25\n30\n10\n1 2 10\n2 5 50\n2 4 20\n4 3 1\n5 4 20\n\n出力例 1\n\n110\n\n例えば，以下のように移動すればよい．\n\n1. 木1 を50 メートル登る．\n\n2. 木1 から木2 に飛び移る．\n\n3. 木2 から木4 に飛び移る．\n\n4. 木4 から木5 に飛び移る．\n\n5. 木5 を10 メートル登る．\n\n入力例 2\n\n2 1 0\n1\n1\n1 2 100\n\n出力例 2\n\n-1\n\nJOI 君は木1 から木2 に飛び移ることができない．\n\n入力例 3\n\n4 3 30\n50\n10\n20\n50\n1 2 10\n2 3 10\n3 4 10\n\n出力例 3\n\n100\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": 2166, "cpu_time_ms": 60, "memory_kb": 17372}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s930845242", "group_id": "codeNet:p00594", "input_text": "// AOJ 1008: What Color Is The Universe?\n// 2017.8.19 bal4u@uu\n// 2017.11.9 retry\n\n#include <stdio.h>\n#include <string.h>\n\n#define HASHSIZ 120011\ntypedef struct { int n, c; } HASH;\nHASH hash[HASHSIZ+2], *hashend = hash+HASHSIZ;\n\nint color, cnt;\n\nint lookup(int n)\n{\n\tHASH *p = hash + n % HASHSIZ;\n\twhile (p->n) {\n\t\tif (p->n == n) return ++(p->c);\n\t\tif (++p == hashend) p = hash;\n\t}\n\tp->n = n, p->c = 1;\n\treturn 1;\n}\n\nchar buf[11000000], *p;\nint getint()\n{\n\tint n = 0;\n\twhile (*p >= '0') n = (n<<3) + (n<<1) + (*p++ & 0xf);\n\treturn n;\n}\n\nint main()\n{\n\tint n, n2, i, k;\n\n\twhile (fgets(p=buf, 20, stdin) && *p != '0') {\n\t\tn = getint(), n2 = n >> 1;\n\t\tmemset(hash, 0, sizeof(hash));\n\t\tfgets(p=buf, sizeof(buf), stdin);\n\t\tfor (cnt = 1, i = n; i--; ) {\n\t\t\tk = getint(), p++;\n\t\t\tif (lookup(k) == cnt) cnt++, color = k;\n\t\t}\n\t\tif (--cnt > n2) printf(\"%d\\n\", color);\n\t\telse puts(\"NO COLOR\");\n\t}\n\treturn 0;\n}", "language": "C", "metadata": {"date": 1510222123, "filename_ext": "c", "original_language": "C", "problem_description_relpath": "problem_descriptions/p00594.html", "problem_id": "p00594", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p00594/input.txt", "sample_output_relpath": "derived/input_output/data/p00594/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p00594/C/s930845242.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s930845242", "user_id": "u847467233"}, "prompt_components": {"gold_output": "NO COLOR\n5\n", "input_to_evaluate": "// AOJ 1008: What Color Is The Universe?\n// 2017.8.19 bal4u@uu\n// 2017.11.9 retry\n\n#include <stdio.h>\n#include <string.h>\n\n#define HASHSIZ 120011\ntypedef struct { int n, c; } HASH;\nHASH hash[HASHSIZ+2], *hashend = hash+HASHSIZ;\n\nint color, cnt;\n\nint lookup(int n)\n{\n\tHASH *p = hash + n % HASHSIZ;\n\twhile (p->n) {\n\t\tif (p->n == n) return ++(p->c);\n\t\tif (++p == hashend) p = hash;\n\t}\n\tp->n = n, p->c = 1;\n\treturn 1;\n}\n\nchar buf[11000000], *p;\nint getint()\n{\n\tint n = 0;\n\twhile (*p >= '0') n = (n<<3) + (n<<1) + (*p++ & 0xf);\n\treturn n;\n}\n\nint main()\n{\n\tint n, n2, i, k;\n\n\twhile (fgets(p=buf, 20, stdin) && *p != '0') {\n\t\tn = getint(), n2 = n >> 1;\n\t\tmemset(hash, 0, sizeof(hash));\n\t\tfgets(p=buf, sizeof(buf), stdin);\n\t\tfor (cnt = 1, i = n; i--; ) {\n\t\t\tk = getint(), p++;\n\t\t\tif (lookup(k) == cnt) cnt++, color = k;\n\t\t}\n\t\tif (--cnt > n2) printf(\"%d\\n\", color);\n\t\telse puts(\"NO COLOR\");\n\t}\n\treturn 0;\n}", "problem_context": "What Color Is The Universe?\n\nOn a clear night, a boy, Campanella looked up at the sky, there were many stars which have different colors such as red, yellow, green, blue, purple, etc. He was watching the stars and just lost track of time. Presently, he wondered,\n\n\"There are many stars in the space. What color is the universe if I look up it from outside?\"\n\nUntil he found the answer to this question, he couldn't sleep. After a moment's thought, he proposed a hypothesis,\n\n\"When I observe the stars in the sky, if more than half of the stars have the same color, that is the color of the universe.\"\n\nHe has collected data of stars in the universe after consistently observing them. However, when he try to count the number of star, he was in bed sick with a cold. You decided to help him by developing a program to identify the color of the universe.\n\nYou are given an array A. Let |A| be the number of element in A, and let Nm be the number of m in A. For example, if A = {3, 1, 2, 3, 3, 1, 5, 3}, |A| = 8, N3 = 4, N1 = 2, N5 = 1. Your program have to find m such that:\n\nNm > (|A| / 2 )\n\nIf there is no such m, you also have to report the fact. There is no\nsuch m for the above example, but for a array A = {5, 2, 5, 3, 4, 5, 5}, 5 is the answer.\n\nInput\n\nThere are several test cases. For each test case, in the first line |A| is given. In the next line, there will be |A| integers. The integers are less than 231 and |A| < 1,000,000. The input terminate with a line which contains single 0.\n\nOutput\n\nFor each test case, output m in a line. If there is no answer, output \"NO COLOR\" in a line.\n\nSample Input\n\n8\n3 1 2 3 3 1 5 3\n7\n5 2 5 3 4 5 5\n0\n\nOutput for the Sample Input\n\nNO COLOR\n5", "sample_input": "8\n3 1 2 3 3 1 5 3\n7\n5 2 5 3 4 5 5\n0\n"}, "reference_outputs": ["NO COLOR\n5\n"], "source_document_id": "p00594", "source_text": "What Color Is The Universe?\n\nOn a clear night, a boy, Campanella looked up at the sky, there were many stars which have different colors such as red, yellow, green, blue, purple, etc. He was watching the stars and just lost track of time. Presently, he wondered,\n\n\"There are many stars in the space. What color is the universe if I look up it from outside?\"\n\nUntil he found the answer to this question, he couldn't sleep. After a moment's thought, he proposed a hypothesis,\n\n\"When I observe the stars in the sky, if more than half of the stars have the same color, that is the color of the universe.\"\n\nHe has collected data of stars in the universe after consistently observing them. However, when he try to count the number of star, he was in bed sick with a cold. You decided to help him by developing a program to identify the color of the universe.\n\nYou are given an array A. Let |A| be the number of element in A, and let Nm be the number of m in A. For example, if A = {3, 1, 2, 3, 3, 1, 5, 3}, |A| = 8, N3 = 4, N1 = 2, N5 = 1. Your program have to find m such that:\n\nNm > (|A| / 2 )\n\nIf there is no such m, you also have to report the fact. There is no\nsuch m for the above example, but for a array A = {5, 2, 5, 3, 4, 5, 5}, 5 is the answer.\n\nInput\n\nThere are several test cases. For each test case, in the first line |A| is given. In the next line, there will be |A| integers. The integers are less than 231 and |A| < 1,000,000. The input terminate with a line which contains single 0.\n\nOutput\n\nFor each test case, output m in a line. If there is no answer, output \"NO COLOR\" in a line.\n\nSample Input\n\n8\n3 1 2 3 3 1 5 3\n7\n5 2 5 3 4 5 5\n0\n\nOutput for the Sample Input\n\nNO COLOR\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": 897, "cpu_time_ms": 30, "memory_kb": 8228}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s740683507", "group_id": "codeNet:p00601", "input_text": "x,a[32],r,F=\"%d%d\",w;S(k,b,m){k-x?S(k+1,b,m),++m<r&&S(k+1,b|a[k],m):(r=b-w|m>r?r:m);}main(i,j,y){for(;scanf(F,&x,&y)*x;S(0,0,0),w=!printf(\"%d \\n\",r)){for(r=i=x;i--;)w|=a[i]=1<<i;for(;y--;a[i]|=1<<j,a[j]|=1<<i)scanf(F,&i,&j);}}", "language": "C", "metadata": {"date": 1299682768, "filename_ext": "c", "original_language": "C", "problem_description_relpath": "problem_descriptions/p00601.html", "problem_id": "p00601", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p00601/input.txt", "sample_output_relpath": "derived/input_output/data/p00601/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p00601/C/s740683507.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "WA: Presentation Error", "submission_id": "s740683507", "user_id": "u399107199"}, "prompt_components": {"gold_output": "2\n2\n", "input_to_evaluate": "x,a[32],r,F=\"%d%d\",w;S(k,b,m){k-x?S(k+1,b,m),++m<r&&S(k+1,b|a[k],m):(r=b-w|m>r?r:m);}main(i,j,y){for(;scanf(F,&x,&y)*x;S(0,0,0),w=!printf(\"%d \\n\",r)){for(r=i=x;i--;)w|=a[i]=1<<i;for(;y--;a[i]|=1<<j,a[j]|=1<<i)scanf(F,&i,&j);}}", "problem_context": "Problem G: Dominating Set\n\nWhat you have in your hands is a map of Aizu-Wakamatsu City. The lines on this map represent streets and the dots are street corners. Lion Dor Company is going to build food stores at some street corners where people can go to buy food. It is unnecessary and expensive to build a food store on every corner. Their plan is to build the food stores so that people could get food either right there on the corner where they live, or at the very most, have to walk down only one street to find a corner where there was a food store. Now, all they have to do is figure out where to put the food store.\n\nThe problem can be simplified as follows. Let G = (V, E) be unweighted undirected graph. A dominating set D of G is a subset of V such that every vertex in V - D is adjacent to at least one vertex in D. A minimum dominating set is a dominating set of minimum number of vertices for G. In the example graph given below, the black vertices are the members of the minimum dominating sets.\n\nDesign and implement an algorithm for the minimum domminating set problem.\n\nInput\n\nInput has several test cases. Each test case consists of the number of nodes n and the number of edges m in the first line. In the following m lines, edges are given by a pair of nodes connected by the edge. The graph nodess are named with the numbers 0, 1,..., n - 1 respectively.\n\nThe input terminate with a line containing two 0. The number of test cases is less than 20.\n\nConstrants\n\nn ≤ 30\n\nm ≤ 50\n\nOutput\n\nOutput the size of minimum dominating set for each test case.\n\nSample Input\n\n5 4\n0 1\n0 4\n1 2\n3 4\n5 4\n0 1\n0 4\n1 2\n3 4\n0 0\n\nOutput for the Sample Input\n\n2\n2", "sample_input": "5 4\n0 1\n0 4\n1 2\n3 4\n5 4\n0 1\n0 4\n1 2\n3 4\n0 0\n"}, "reference_outputs": ["2\n2\n"], "source_document_id": "p00601", "source_text": "Problem G: Dominating Set\n\nWhat you have in your hands is a map of Aizu-Wakamatsu City. The lines on this map represent streets and the dots are street corners. Lion Dor Company is going to build food stores at some street corners where people can go to buy food. It is unnecessary and expensive to build a food store on every corner. Their plan is to build the food stores so that people could get food either right there on the corner where they live, or at the very most, have to walk down only one street to find a corner where there was a food store. Now, all they have to do is figure out where to put the food store.\n\nThe problem can be simplified as follows. Let G = (V, E) be unweighted undirected graph. A dominating set D of G is a subset of V such that every vertex in V - D is adjacent to at least one vertex in D. A minimum dominating set is a dominating set of minimum number of vertices for G. In the example graph given below, the black vertices are the members of the minimum dominating sets.\n\nDesign and implement an algorithm for the minimum domminating set problem.\n\nInput\n\nInput has several test cases. Each test case consists of the number of nodes n and the number of edges m in the first line. In the following m lines, edges are given by a pair of nodes connected by the edge. The graph nodess are named with the numbers 0, 1,..., n - 1 respectively.\n\nThe input terminate with a line containing two 0. The number of test cases is less than 20.\n\nConstrants\n\nn ≤ 30\n\nm ≤ 50\n\nOutput\n\nOutput the size of minimum dominating set for each test case.\n\nSample Input\n\n5 4\n0 1\n0 4\n1 2\n3 4\n5 4\n0 1\n0 4\n1 2\n3 4\n0 0\n\nOutput for the Sample Input\n\n2\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": 226, "cpu_time_ms": 430, "memory_kb": 408}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s326452060", "group_id": "codeNet:p00624", "input_text": "#include<stdio.h>\nint MIN(int a,int b){return a<b?a:b;}\nint gy,Y[]={0,1,0,-1};\nint gx,X[]={1,0,-1,0};\nchar d[20][20];\nint f(int sy,int sx,int m){\n  int i,j,ny,nx,t,r,b,min=1000,c[20][20]={0};\n  int x[200],y[200];\n  /*for(i=0;i<10;i++){\n    for(j=0;j<10;j++)printf(\"%c\",d[i][j]);printf(\"\\n\");\n    }//*/\n  c[y[0]=sy][x[t=0]=sx]=m;\n  for(r=1;r-t;t++){\n    for(i=0;i<4;i++){\n      ny=y[t]+Y[i];\n      nx=x[t]+X[i];\n      if(c[ny][nx]||d[ny][nx]=='#'||d[ny][nx]=='w')continue;\n      if(d[ny][nx]=='c'){\n\tfor(j=1;d[ny+j*Y[i]][nx+j*X[i]]=='.';j++);\n\tb=0;\n\tif(d[ny+j*Y[i]][nx+j*X[i]]=='w'){\n\t  d[ny+j*Y[i]][nx+j*X[i]]='.';\n\t  b=1;\n\t}\n\telse if(j==1)continue;\n\telse d[ny+(j-1)*Y[i]][nx+(j-1)*X[i]]='c';\n\td[ny][nx]='.';\n\tmin=MIN(min,f(ny,nx,c[y[t]][x[t]]+1));\n\tif(b)d[ny+j*Y[i]][nx+j*X[i]]='w';\n\telse d[ny+(j-1)*Y[i]][nx+(j-1)*X[i]]='.';\n\td[ny][nx]='c';\n      }\n      else{\n\tc[y[r]=ny][x[r]=nx]=c[y[t]][x[t]]+1;\n\tr++;\n\tif(ny==gy&&nx==gx)return c[ny][nx];\n      }\n    }  \n  }\n  return min;\n}\nint main(){\n  int w,h,i,j,y,x;\n  while(scanf(\"%d %d\",&h,&w),w||h){\n    for(i=0;i<h;i++){\n      for(j=0;j<w;j++){\n\tscanf(\" %c\",&d[i][j]);\n\tif(d[i][j]=='@')d[y=i][x=j]='.';\n\tif(d[i][j]=='E')d[gy=i][gx=j]='.';\n      }\n    }\n    printf(\"%d\\n\",(f(y,x,1)%1000)-1);\n  }\n  return 0;\n}", "language": "C", "metadata": {"date": 1447844874, "filename_ext": "c", "original_language": "C", "problem_description_relpath": "problem_descriptions/p00624.html", "problem_id": "p00624", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p00624/input.txt", "sample_output_relpath": "derived/input_output/data/p00624/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p00624/C/s326452060.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s326452060", "user_id": "u731027244"}, "prompt_components": {"gold_output": "3\n5\n-1\n", "input_to_evaluate": "#include<stdio.h>\nint MIN(int a,int b){return a<b?a:b;}\nint gy,Y[]={0,1,0,-1};\nint gx,X[]={1,0,-1,0};\nchar d[20][20];\nint f(int sy,int sx,int m){\n  int i,j,ny,nx,t,r,b,min=1000,c[20][20]={0};\n  int x[200],y[200];\n  /*for(i=0;i<10;i++){\n    for(j=0;j<10;j++)printf(\"%c\",d[i][j]);printf(\"\\n\");\n    }//*/\n  c[y[0]=sy][x[t=0]=sx]=m;\n  for(r=1;r-t;t++){\n    for(i=0;i<4;i++){\n      ny=y[t]+Y[i];\n      nx=x[t]+X[i];\n      if(c[ny][nx]||d[ny][nx]=='#'||d[ny][nx]=='w')continue;\n      if(d[ny][nx]=='c'){\n\tfor(j=1;d[ny+j*Y[i]][nx+j*X[i]]=='.';j++);\n\tb=0;\n\tif(d[ny+j*Y[i]][nx+j*X[i]]=='w'){\n\t  d[ny+j*Y[i]][nx+j*X[i]]='.';\n\t  b=1;\n\t}\n\telse if(j==1)continue;\n\telse d[ny+(j-1)*Y[i]][nx+(j-1)*X[i]]='c';\n\td[ny][nx]='.';\n\tmin=MIN(min,f(ny,nx,c[y[t]][x[t]]+1));\n\tif(b)d[ny+j*Y[i]][nx+j*X[i]]='w';\n\telse d[ny+(j-1)*Y[i]][nx+(j-1)*X[i]]='.';\n\td[ny][nx]='c';\n      }\n      else{\n\tc[y[r]=ny][x[r]=nx]=c[y[t]][x[t]]+1;\n\tr++;\n\tif(ny==gy&&nx==gx)return c[ny][nx];\n      }\n    }  \n  }\n  return min;\n}\nint main(){\n  int w,h,i,j,y,x;\n  while(scanf(\"%d %d\",&h,&w),w||h){\n    for(i=0;i<h;i++){\n      for(j=0;j<w;j++){\n\tscanf(\" %c\",&d[i][j]);\n\tif(d[i][j]=='@')d[y=i][x=j]='.';\n\tif(d[i][j]=='E')d[gy=i][gx=j]='.';\n      }\n    }\n    printf(\"%d\\n\",(f(y,x,1)%1000)-1);\n  }\n  return 0;\n}", "problem_context": "Problem D: Dr. Nakamura's Lab.\n\nDr.中村は偉大な発明者である, 今日も常人には発想出来ない新たな発明に取り掛かっている. 今発明しているのは新たな防犯システムとコンテナである.\n\n防犯システムの方は上に乗った者を識別して招かれざる客だった場合, 電流を流して気絶させるパネルである. このパネルは踏まないように上を通過しても無駄で, 空中のものに対し放電する. しかし, まだ完成には程遠く, 電流は強すぎて調節が不可能で, 一度放電すると充電しない限り使えない. また, 人と物体の区別ができず, そもそも人自体区別できない等欠点をあげればキリがない.\n\nコンテナの方は謎の力によって常時地面から浮いており, 運ぶのに便利に作ってある. しかし, これも完成には遠く, 一度押すと何かにぶつかるまで止まらない.\n\nDr.中村は一日の作業を終え, 帰宅しようとしたが未完成のパネルを設置したままだということに気づいた. これを取り外すのは防犯上非常に困難に作ってある上に, これを通らなければ帰れないような位置に設置してしまったのでDr.中村は途方に暮れた. しかし, 素晴らしい頭脳を持つDr.中村は解決案をすぐに思いついた. パネルは一度放電させれば通れるようになるため, コンテナを通過させればパネルの上を通れるようになる, そう考えた. 実際, パネルの上にコンテナを通過させると, コンテナは電流によって消滅してしまう一方でパネルは放電し, 通れるようになる.\n\nしかし, 研究室の中は入り組んでおり, うまくコンテナを動かさないとパネルを通過させられない. Dr.中村は助手であるあなたにメールで助けを求めた. あなたの仕事は研究室の情報が与えられた時にDr.中村が出口までたどり着くためのプログラムを作成することである.\n\n研究室は二次元グリッドで与えられ, Dr.中村は一度の移動で上下左右に隣接するセルに移動することが出来る.ただし, 障害物, コンテナ, 放電していないパネルのセルには移動できない.\n\nDr.中村は上下左右に隣接するセルにあるコンテナを押すことができ, コンテナはDr.中村がいる方向と逆の方向に別のコンテナか障害物にぶつかる, あるいは放電されていないパネルの上を通過するまで動く. また, 何かにぶつかり止まった場合, ぶつかる直前のセルで静止する.\n\n出口はコンテナもDr.中村も侵入可能である. コンテナは出口を通っても消滅せず、そのまま通過する.\n\n壁にぶつかって出口をふさぐことはある. この場合は出口に進入できない.\n\nあなたのプログラムが要求されていることは, Dr.中村は最少何回の移動で研究室を脱出できるかを出力することのみである. なぜなら, Dr.中村は素晴らしい頭脳の持ち主なのでそれさえわかれば自分で脱出するからである.\n\nInput\n\n入力は複数のデータセットからなり, 一行目に研究室の縦の長さ H と横の長さ W が与えられる.\n2行目以降では研究室の状態が H × W 個の文字で表わされる. 各文字が表すものは以下のとおりである:\n\n‘#’障害物を表す.\n\n‘@’Dr.中村の初期位置を表す.\n\n‘w’パネルを表す.\n\n‘c’コンテナを表す.\n\n‘.’何も置かれていない空白のセルを表す.\n\n‘E’脱出口を表す.\n\n縦と横の長さがともに 0 のとき入力の終了を表す. これについて処理をする必要はない.\n\n以下のことを仮定してよい.\n\n3 ≤ H, W ≤ 10\n\n研究室の周囲は障害物で囲まれている.\n\nパネルとコンテナの数はそれぞれ 3 を越えない.\n\n研究室にはただ１つの出口がある.\n\nOutput\n\n各データセットについて最少の移動回数を１行に出力せよ. なお、Dr.中村が脱出できない場合、”-1”と出力せよ.\n\nSample Input\n\n5 5\n#####\n##@##\n#wc.#\n#Ew.#\n#####\n5 5\n#####\n##@.#\n#wc.#\n#E#.#\n#####\n3 6\n######\n#@.wE#\n######\n0 0\n\nOutput for the Sample Input\n\n3\n5\n-1", "sample_input": "5 5\n#####\n##@##\n#wc.#\n#Ew.#\n#####\n5 5\n#####\n##@.#\n#wc.#\n#E#.#\n#####\n3 6\n######\n#@.wE#\n######\n0 0\n"}, "reference_outputs": ["3\n5\n-1\n"], "source_document_id": "p00624", "source_text": "Problem D: Dr. Nakamura's Lab.\n\nDr.中村は偉大な発明者である, 今日も常人には発想出来ない新たな発明に取り掛かっている. 今発明しているのは新たな防犯システムとコンテナである.\n\n防犯システムの方は上に乗った者を識別して招かれざる客だった場合, 電流を流して気絶させるパネルである. このパネルは踏まないように上を通過しても無駄で, 空中のものに対し放電する. しかし, まだ完成には程遠く, 電流は強すぎて調節が不可能で, 一度放電すると充電しない限り使えない. また, 人と物体の区別ができず, そもそも人自体区別できない等欠点をあげればキリがない.\n\nコンテナの方は謎の力によって常時地面から浮いており, 運ぶのに便利に作ってある. しかし, これも完成には遠く, 一度押すと何かにぶつかるまで止まらない.\n\nDr.中村は一日の作業を終え, 帰宅しようとしたが未完成のパネルを設置したままだということに気づいた. これを取り外すのは防犯上非常に困難に作ってある上に, これを通らなければ帰れないような位置に設置してしまったのでDr.中村は途方に暮れた. しかし, 素晴らしい頭脳を持つDr.中村は解決案をすぐに思いついた. パネルは一度放電させれば通れるようになるため, コンテナを通過させればパネルの上を通れるようになる, そう考えた. 実際, パネルの上にコンテナを通過させると, コンテナは電流によって消滅してしまう一方でパネルは放電し, 通れるようになる.\n\nしかし, 研究室の中は入り組んでおり, うまくコンテナを動かさないとパネルを通過させられない. Dr.中村は助手であるあなたにメールで助けを求めた. あなたの仕事は研究室の情報が与えられた時にDr.中村が出口までたどり着くためのプログラムを作成することである.\n\n研究室は二次元グリッドで与えられ, Dr.中村は一度の移動で上下左右に隣接するセルに移動することが出来る.ただし, 障害物, コンテナ, 放電していないパネルのセルには移動できない.\n\nDr.中村は上下左右に隣接するセルにあるコンテナを押すことができ, コンテナはDr.中村がいる方向と逆の方向に別のコンテナか障害物にぶつかる, あるいは放電されていないパネルの上を通過するまで動く. また, 何かにぶつかり止まった場合, ぶつかる直前のセルで静止する.\n\n出口はコンテナもDr.中村も侵入可能である. コンテナは出口を通っても消滅せず、そのまま通過する.\n\n壁にぶつかって出口をふさぐことはある. この場合は出口に進入できない.\n\nあなたのプログラムが要求されていることは, Dr.中村は最少何回の移動で研究室を脱出できるかを出力することのみである. なぜなら, Dr.中村は素晴らしい頭脳の持ち主なのでそれさえわかれば自分で脱出するからである.\n\nInput\n\n入力は複数のデータセットからなり, 一行目に研究室の縦の長さ H と横の長さ W が与えられる.\n2行目以降では研究室の状態が H × W 個の文字で表わされる. 各文字が表すものは以下のとおりである:\n\n‘#’障害物を表す.\n\n‘@’Dr.中村の初期位置を表す.\n\n‘w’パネルを表す.\n\n‘c’コンテナを表す.\n\n‘.’何も置かれていない空白のセルを表す.\n\n‘E’脱出口を表す.\n\n縦と横の長さがともに 0 のとき入力の終了を表す. これについて処理をする必要はない.\n\n以下のことを仮定してよい.\n\n3 ≤ H, W ≤ 10\n\n研究室の周囲は障害物で囲まれている.\n\nパネルとコンテナの数はそれぞれ 3 を越えない.\n\n研究室にはただ１つの出口がある.\n\nOutput\n\n各データセットについて最少の移動回数を１行に出力せよ. なお、Dr.中村が脱出できない場合、”-1”と出力せよ.\n\nSample Input\n\n5 5\n#####\n##@##\n#wc.#\n#Ew.#\n#####\n5 5\n#####\n##@.#\n#wc.#\n#E#.#\n#####\n3 6\n######\n#@.wE#\n######\n0 0\n\nOutput for the Sample Input\n\n3\n5\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": 1256, "cpu_time_ms": 780, "memory_kb": 656}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s098764106", "group_id": "codeNet:p00687", "input_text": "#include <stdio.h>\n     \nint main(void){\n    int a, b, t, i, j, k, ans, flg;\n\n\twhile( scanf( \"%d %d %d\", &t, &a, &b ) != EOF ) {\n\t\tans = 0;\n\t\tif( !(t|a|b) ) break;\n\t\tfor( k = 1; k <= t; k++ ) {\n\t\t\tflg = 0;\n\t\t\tfor( i = 0; a*i <= k && flg == 0; i ++ )\n\t\t\t\tfor( j = 0; a*i + b*j <= k && flg == 0; j++ ) {\n\t\t\t\t\tif( a*i + b*j == k ) {\n\t\t\t\t\t\tflg = 1;\n\t\t\t\t\t\t//printf(\"%d = %d * %d + %d * %d\\n\", k, a, i, b, j );\n\t\t\t\t\t\tans ++;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t}\n\t\tprintf(\"%d\\n\",t-ans);\n\t}\n\n    return 0;\n}", "language": "C", "metadata": {"date": 1438696255, "filename_ext": "c", "original_language": "C", "problem_description_relpath": "problem_descriptions/p00687.html", "problem_id": "p00687", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p00687/input.txt", "sample_output_relpath": "derived/input_output/data/p00687/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p00687/C/s098764106.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s098764106", "user_id": "u605325206"}, "prompt_components": {"gold_output": "1\n2\n80\n", "input_to_evaluate": "#include <stdio.h>\n     \nint main(void){\n    int a, b, t, i, j, k, ans, flg;\n\n\twhile( scanf( \"%d %d %d\", &t, &a, &b ) != EOF ) {\n\t\tans = 0;\n\t\tif( !(t|a|b) ) break;\n\t\tfor( k = 1; k <= t; k++ ) {\n\t\t\tflg = 0;\n\t\t\tfor( i = 0; a*i <= k && flg == 0; i ++ )\n\t\t\t\tfor( j = 0; a*i + b*j <= k && flg == 0; j++ ) {\n\t\t\t\t\tif( a*i + b*j == k ) {\n\t\t\t\t\t\tflg = 1;\n\t\t\t\t\t\t//printf(\"%d = %d * %d + %d * %d\\n\", k, a, i, b, j );\n\t\t\t\t\t\tans ++;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t}\n\t\tprintf(\"%d\\n\",t-ans);\n\t}\n\n    return 0;\n}", "problem_context": "Unable Count\n\nI would, if I could,\n\nIf I couldn't how could I?\n\nI couldn't, without I could, could I?\n\nCould you, without you could, could ye?\n\nCould ye? could ye?\n\nCould you, without you could, could ye?\n\nIt is true, as this old rhyme says, that we can only DO what\nwe can DO and we cannot DO what we cannot DO. Changing some of\nDOs with COUNTs, we have another statement that we can only COUNT\nwhat we can DO and we cannot COUNT what we cannot DO, which looks\nrather false. We could count what we could do as well as we could\ncount what we couldn't do. Couldn't we, if we confine ourselves\nto finite issues?\n\nSurely we can count, in principle, both what we can do and\nwhat we cannot do, if the object space is finite. Yet, sometimes\nwe cannot count in practice what we can do or what we cannot do.\nHere, you are challenged, in a set of all positive integers up\nto (and including) a given bound n, to count\nall the integers that cannot be represented by a formula of\nthe form a*i+b*j, where a and\nb are given positive integers and i and j\nare variables ranging over non-negative integers. You are requested\nto report only the result of the count, i.e. how many integers\nare not representable.\nFor example, given n = 7, a = 2, b = 5,\nyou should answer 2, since 1 and 3 cannot be represented in a\nspecified form, and the other five numbers are representable as follows:\n\n2 = 2*1 + 5*0, 4 = 2*2 + 5*0, 5 = 2*0 + 5*1,\n6 = 2*3 + 5*0, 7 = 2*1 + 5*1.\n\nInput\n\nThe input is a sequence of lines. Each line consists of three integers,\nn, a and b, in this order, separated by a\nspace. The integers n, a and b are\nall positive and at most one million, except those in the last\nline. The last line consists of three zeros.\n\nOutput\n\nFor each input line except the last one, your program should\nwrite out a line that contains only the result of the count.\n\nSample Input\n\n10 2 3\n10 2 5\n100 5 25\n0 0 0\n\nOutput for the Sample Input\n\n1\n2\n80", "sample_input": "10 2 3\n10 2 5\n100 5 25\n0 0 0\n"}, "reference_outputs": ["1\n2\n80\n"], "source_document_id": "p00687", "source_text": "Unable Count\n\nI would, if I could,\n\nIf I couldn't how could I?\n\nI couldn't, without I could, could I?\n\nCould you, without you could, could ye?\n\nCould ye? could ye?\n\nCould you, without you could, could ye?\n\nIt is true, as this old rhyme says, that we can only DO what\nwe can DO and we cannot DO what we cannot DO. Changing some of\nDOs with COUNTs, we have another statement that we can only COUNT\nwhat we can DO and we cannot COUNT what we cannot DO, which looks\nrather false. We could count what we could do as well as we could\ncount what we couldn't do. Couldn't we, if we confine ourselves\nto finite issues?\n\nSurely we can count, in principle, both what we can do and\nwhat we cannot do, if the object space is finite. Yet, sometimes\nwe cannot count in practice what we can do or what we cannot do.\nHere, you are challenged, in a set of all positive integers up\nto (and including) a given bound n, to count\nall the integers that cannot be represented by a formula of\nthe form a*i+b*j, where a and\nb are given positive integers and i and j\nare variables ranging over non-negative integers. You are requested\nto report only the result of the count, i.e. how many integers\nare not representable.\nFor example, given n = 7, a = 2, b = 5,\nyou should answer 2, since 1 and 3 cannot be represented in a\nspecified form, and the other five numbers are representable as follows:\n\n2 = 2*1 + 5*0, 4 = 2*2 + 5*0, 5 = 2*0 + 5*1,\n6 = 2*3 + 5*0, 7 = 2*1 + 5*1.\n\nInput\n\nThe input is a sequence of lines. Each line consists of three integers,\nn, a and b, in this order, separated by a\nspace. The integers n, a and b are\nall positive and at most one million, except those in the last\nline. The last line consists of three zeros.\n\nOutput\n\nFor each input line except the last one, your program should\nwrite out a line that contains only the result of the count.\n\nSample Input\n\n10 2 3\n10 2 5\n100 5 25\n0 0 0\n\nOutput for the Sample Input\n\n1\n2\n80", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 479, "cpu_time_ms": 20000, "memory_kb": 588}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s814732831", "group_id": "codeNet:p00687", "input_text": "#include<stdio.h>\nint main(void){\n\tint f[1000001],n,a,b,i,j,t,ans;\n\twhile(1){\n\t\tscanf(\"%d %d %d\",&n,&a,&b);\n\t\tif(n==0&&a==0&&b==0){\n\t\t\tbreak;\n\t\t}\n\t\tfor(i=1;i<=n;i++){\n\t\t\tf[i]=0;\n\t\t}\n\t\tf[0]=1;\n\t\tans=0;\n\t\tfor(i=1;i<=n;i++){\n\t\t\tif(i-a>=0&&f[i-a]==1){\n\t\t\t\tf[i]=1;\n\t\t\t}\n\t\t\tif(i-b>=0&&f[i-b]==1){\n\t\t\t\tf[i]=1;\n\t\t\t}\n\t\t\tif(f[i]!=1){\n\t\t\t\tans++;\n\t\t\t}\n\t\t}\n\t\tprintf(\"%d\\n\",ans);\n\t}\n}", "language": "C", "metadata": {"date": 1445351212, "filename_ext": "c", "original_language": "C", "problem_description_relpath": "problem_descriptions/p00687.html", "problem_id": "p00687", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p00687/input.txt", "sample_output_relpath": "derived/input_output/data/p00687/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p00687/C/s814732831.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s814732831", "user_id": "u003762655"}, "prompt_components": {"gold_output": "1\n2\n80\n", "input_to_evaluate": "#include<stdio.h>\nint main(void){\n\tint f[1000001],n,a,b,i,j,t,ans;\n\twhile(1){\n\t\tscanf(\"%d %d %d\",&n,&a,&b);\n\t\tif(n==0&&a==0&&b==0){\n\t\t\tbreak;\n\t\t}\n\t\tfor(i=1;i<=n;i++){\n\t\t\tf[i]=0;\n\t\t}\n\t\tf[0]=1;\n\t\tans=0;\n\t\tfor(i=1;i<=n;i++){\n\t\t\tif(i-a>=0&&f[i-a]==1){\n\t\t\t\tf[i]=1;\n\t\t\t}\n\t\t\tif(i-b>=0&&f[i-b]==1){\n\t\t\t\tf[i]=1;\n\t\t\t}\n\t\t\tif(f[i]!=1){\n\t\t\t\tans++;\n\t\t\t}\n\t\t}\n\t\tprintf(\"%d\\n\",ans);\n\t}\n}", "problem_context": "Unable Count\n\nI would, if I could,\n\nIf I couldn't how could I?\n\nI couldn't, without I could, could I?\n\nCould you, without you could, could ye?\n\nCould ye? could ye?\n\nCould you, without you could, could ye?\n\nIt is true, as this old rhyme says, that we can only DO what\nwe can DO and we cannot DO what we cannot DO. Changing some of\nDOs with COUNTs, we have another statement that we can only COUNT\nwhat we can DO and we cannot COUNT what we cannot DO, which looks\nrather false. We could count what we could do as well as we could\ncount what we couldn't do. Couldn't we, if we confine ourselves\nto finite issues?\n\nSurely we can count, in principle, both what we can do and\nwhat we cannot do, if the object space is finite. Yet, sometimes\nwe cannot count in practice what we can do or what we cannot do.\nHere, you are challenged, in a set of all positive integers up\nto (and including) a given bound n, to count\nall the integers that cannot be represented by a formula of\nthe form a*i+b*j, where a and\nb are given positive integers and i and j\nare variables ranging over non-negative integers. You are requested\nto report only the result of the count, i.e. how many integers\nare not representable.\nFor example, given n = 7, a = 2, b = 5,\nyou should answer 2, since 1 and 3 cannot be represented in a\nspecified form, and the other five numbers are representable as follows:\n\n2 = 2*1 + 5*0, 4 = 2*2 + 5*0, 5 = 2*0 + 5*1,\n6 = 2*3 + 5*0, 7 = 2*1 + 5*1.\n\nInput\n\nThe input is a sequence of lines. Each line consists of three integers,\nn, a and b, in this order, separated by a\nspace. The integers n, a and b are\nall positive and at most one million, except those in the last\nline. The last line consists of three zeros.\n\nOutput\n\nFor each input line except the last one, your program should\nwrite out a line that contains only the result of the count.\n\nSample Input\n\n10 2 3\n10 2 5\n100 5 25\n0 0 0\n\nOutput for the Sample Input\n\n1\n2\n80", "sample_input": "10 2 3\n10 2 5\n100 5 25\n0 0 0\n"}, "reference_outputs": ["1\n2\n80\n"], "source_document_id": "p00687", "source_text": "Unable Count\n\nI would, if I could,\n\nIf I couldn't how could I?\n\nI couldn't, without I could, could I?\n\nCould you, without you could, could ye?\n\nCould ye? could ye?\n\nCould you, without you could, could ye?\n\nIt is true, as this old rhyme says, that we can only DO what\nwe can DO and we cannot DO what we cannot DO. Changing some of\nDOs with COUNTs, we have another statement that we can only COUNT\nwhat we can DO and we cannot COUNT what we cannot DO, which looks\nrather false. We could count what we could do as well as we could\ncount what we couldn't do. Couldn't we, if we confine ourselves\nto finite issues?\n\nSurely we can count, in principle, both what we can do and\nwhat we cannot do, if the object space is finite. Yet, sometimes\nwe cannot count in practice what we can do or what we cannot do.\nHere, you are challenged, in a set of all positive integers up\nto (and including) a given bound n, to count\nall the integers that cannot be represented by a formula of\nthe form a*i+b*j, where a and\nb are given positive integers and i and j\nare variables ranging over non-negative integers. You are requested\nto report only the result of the count, i.e. how many integers\nare not representable.\nFor example, given n = 7, a = 2, b = 5,\nyou should answer 2, since 1 and 3 cannot be represented in a\nspecified form, and the other five numbers are representable as follows:\n\n2 = 2*1 + 5*0, 4 = 2*2 + 5*0, 5 = 2*0 + 5*1,\n6 = 2*3 + 5*0, 7 = 2*1 + 5*1.\n\nInput\n\nThe input is a sequence of lines. Each line consists of three integers,\nn, a and b, in this order, separated by a\nspace. The integers n, a and b are\nall positive and at most one million, except those in the last\nline. The last line consists of three zeros.\n\nOutput\n\nFor each input line except the last one, your program should\nwrite out a line that contains only the result of the count.\n\nSample Input\n\n10 2 3\n10 2 5\n100 5 25\n0 0 0\n\nOutput for the Sample Input\n\n1\n2\n80", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 10, "memory_kb": 4504}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s770378491", "group_id": "codeNet:p00723", "input_text": "#include<stdio.h>\n#include<string.h>\nint main(void){\n\tint m,div,i,j,k,l,x,cnt[1000],sw,ans;\n\tchar tr[100],rec[80][1000];\n\tscanf(\"%d\",&m);\n\twhile(m!=0){\n\t\tscanf(\"%s\",&tr);\n\t\tdiv=strlen(tr)-1;//div??????????????¨????????¨??????div???????????§??¨?????????????????§????????????\n\t\tif(div==0){//???????????????1?????¨??????????¨?????????????\n\t\t\tprintf(\"1\\n\");\n\t\t}\n\t\telse{//??\\?????§rec[][]?????????????????¨????????????????¨???????????????????\n\t\t\ti=j=0;\n\t\t\twhile(div!=0){//?????¢??????????????????????????¢2?¨????????????????????????¢???\n\t\t\t\tfor(i=0;i<strlen(tr);i++){\n\t\t\t\t\trec[i][j]=tr[i];\n\t\t\t\t}\n\t\t\t\tj++;\n\t\t\t\tl=strlen(tr);\n\t\t\t\tfor(i=0;i<div;i++){\n\t\t\t\t\trec[i][j]=tr[i];\n\t\t\t\t}\n\t\t\t\tfor(i=0;div+i!=strlen(tr);i++){\n\t\t\t\t\trec[div+i][j]=tr[l-1-i];\n\t\t\t\t}\n\t\t\t\tj++;\n\t\t\t\tfor(i=0;i<div;i++){\n\t\t\t\t\trec[i][j]=tr[div-1-i];\n\t\t\t\t}\n\t\t\t\tfor(i=0;div+i!=strlen(tr);i++){\n\t\t\t\t\trec[div+i][j]=tr[div+i];\n\t\t\t\t}\n\t\t\t\tj++;\n\t\t\t\tfor(i=0;i<div;i++){\n\t\t\t\t\trec[i][j]=tr[div-1-i];\n\t\t\t\t}\n\t\t\t\tfor(i=0;div+i!=strlen(tr);i++){\n\t\t\t\t\trec[div+i][j]=tr[l-1-i];\n\t\t\t\t}\n\t\t\t\tj++;\n\t\t\t\ti=0;\n\t\t\t\twhile(1){//???????????????????????????????????¢????????´??????????????\\???????????¨?????????\n\t\t\t\t\trec[i][j]=tr[div+i];\n\t\t\t\t\ti++;\n\t\t\t\t\tif(div+i==strlen(tr)){\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tk=0;\n\t\t\t\twhile(1){\n\t\t\t\t\trec[i][j]=tr[k];\n\t\t\t\t\ti++;\n\t\t\t\t\tk++;\n\t\t\t\t\tif(k==div){\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tj++;\n\t\t\t\ti=0;\n\t\t\t\twhile(1){\n\t\t\t\t\trec[i][j]=tr[div+i];\n\t\t\t\t\ti++;\n\t\t\t\t\tif(div+i==strlen(tr)){\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tk=0;\n\t\t\t\twhile(1){\n\t\t\t\t\trec[i][j]=tr[div-1-k];\n\t\t\t\t\tk++;\n\t\t\t\t\ti++;\n\t\t\t\t\tif(k==div){\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tj++;\n\t\t\t\ti=0;\n\t\t\t\twhile(1){\n\t\t\t\t\trec[i][j]=tr[l-1-i];\n\t\t\t\t\ti++;\n\t\t\t\t\tif(i==l-div){\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tk=0;\n\t\t\t\twhile(1){\n\t\t\t\t\trec[i][j]=tr[k];\n\t\t\t\t\ti++;\n\t\t\t\t\tk++;\n\t\t\t\t\tif(k==div){\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tj++;\n\t\t\t\ti=0;\n\t\t\t\twhile(1){\n\t\t\t\t\trec[i][j]=tr[l-1-i];\n\t\t\t\t\ti++;\n\t\t\t\t\tif(i==l-div){\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tk=0;\n\t\t\t\twhile(1){\n\t\t\t\t\trec[i][j]=tr[div-1-k];\n\t\t\t\t\ti++;\n\t\t\t\t\tk++;\n\t\t\t\t\tif(k==div){\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tj++;\n\t\t\t\tdiv--;\n\t\t\t}\n\t\t\tfor(i=0;i<j;i++){//???????????????\n\t\t\t\tcnt[i]=1;\n\t\t\t}\n\t\t\tans=0;\n\t\t\tfor(i=0;i<j;i++){\n\t\t\t\tif(cnt[i]!=1){//?????????????????´???????£???°??????\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\t\t\t\tfor(x=i+1;x<j;x++){\n\t\t\t\t\tsw=0;\n\t\t\t\t\tfor(k=0;k<l;k++){\n\t\t\t\t\t\tif(rec[k][i]==rec[k][x]){\n\t\t\t\t\t\t\tsw++;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t\tif(sw==l){//rec[][i]??¨rec[][x]????????´????????°???strlen(tr)??????cnt[x]???0????????????\n\t\t\t\t\t\tcnt[x]=0;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\tfor(i=0;i<j;i++){\n\t\t\t\tans+=cnt[i];//cnt[]??????????????¨???????¨?????????°???\n\t\t\t}\n\t\t\tprintf(\"%d\\n\",ans);\n\t\t}\n\t\tm--;\n\t}\n\treturn 0;\n}", "language": "C", "metadata": {"date": 1448044426, "filename_ext": "c", "original_language": "C", "problem_description_relpath": "problem_descriptions/p00723.html", "problem_id": "p00723", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p00723/input.txt", "sample_output_relpath": "derived/input_output/data/p00723/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p00723/C/s770378491.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s770378491", "user_id": "u003762655"}, "prompt_components": {"gold_output": "1\n6\n12\n18\n", "input_to_evaluate": "#include<stdio.h>\n#include<string.h>\nint main(void){\n\tint m,div,i,j,k,l,x,cnt[1000],sw,ans;\n\tchar tr[100],rec[80][1000];\n\tscanf(\"%d\",&m);\n\twhile(m!=0){\n\t\tscanf(\"%s\",&tr);\n\t\tdiv=strlen(tr)-1;//div??????????????¨????????¨??????div???????????§??¨?????????????????§????????????\n\t\tif(div==0){//???????????????1?????¨??????????¨?????????????\n\t\t\tprintf(\"1\\n\");\n\t\t}\n\t\telse{//??\\?????§rec[][]?????????????????¨????????????????¨???????????????????\n\t\t\ti=j=0;\n\t\t\twhile(div!=0){//?????¢??????????????????????????¢2?¨????????????????????????¢???\n\t\t\t\tfor(i=0;i<strlen(tr);i++){\n\t\t\t\t\trec[i][j]=tr[i];\n\t\t\t\t}\n\t\t\t\tj++;\n\t\t\t\tl=strlen(tr);\n\t\t\t\tfor(i=0;i<div;i++){\n\t\t\t\t\trec[i][j]=tr[i];\n\t\t\t\t}\n\t\t\t\tfor(i=0;div+i!=strlen(tr);i++){\n\t\t\t\t\trec[div+i][j]=tr[l-1-i];\n\t\t\t\t}\n\t\t\t\tj++;\n\t\t\t\tfor(i=0;i<div;i++){\n\t\t\t\t\trec[i][j]=tr[div-1-i];\n\t\t\t\t}\n\t\t\t\tfor(i=0;div+i!=strlen(tr);i++){\n\t\t\t\t\trec[div+i][j]=tr[div+i];\n\t\t\t\t}\n\t\t\t\tj++;\n\t\t\t\tfor(i=0;i<div;i++){\n\t\t\t\t\trec[i][j]=tr[div-1-i];\n\t\t\t\t}\n\t\t\t\tfor(i=0;div+i!=strlen(tr);i++){\n\t\t\t\t\trec[div+i][j]=tr[l-1-i];\n\t\t\t\t}\n\t\t\t\tj++;\n\t\t\t\ti=0;\n\t\t\t\twhile(1){//???????????????????????????????????¢????????´??????????????\\???????????¨?????????\n\t\t\t\t\trec[i][j]=tr[div+i];\n\t\t\t\t\ti++;\n\t\t\t\t\tif(div+i==strlen(tr)){\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tk=0;\n\t\t\t\twhile(1){\n\t\t\t\t\trec[i][j]=tr[k];\n\t\t\t\t\ti++;\n\t\t\t\t\tk++;\n\t\t\t\t\tif(k==div){\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tj++;\n\t\t\t\ti=0;\n\t\t\t\twhile(1){\n\t\t\t\t\trec[i][j]=tr[div+i];\n\t\t\t\t\ti++;\n\t\t\t\t\tif(div+i==strlen(tr)){\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tk=0;\n\t\t\t\twhile(1){\n\t\t\t\t\trec[i][j]=tr[div-1-k];\n\t\t\t\t\tk++;\n\t\t\t\t\ti++;\n\t\t\t\t\tif(k==div){\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tj++;\n\t\t\t\ti=0;\n\t\t\t\twhile(1){\n\t\t\t\t\trec[i][j]=tr[l-1-i];\n\t\t\t\t\ti++;\n\t\t\t\t\tif(i==l-div){\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tk=0;\n\t\t\t\twhile(1){\n\t\t\t\t\trec[i][j]=tr[k];\n\t\t\t\t\ti++;\n\t\t\t\t\tk++;\n\t\t\t\t\tif(k==div){\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tj++;\n\t\t\t\ti=0;\n\t\t\t\twhile(1){\n\t\t\t\t\trec[i][j]=tr[l-1-i];\n\t\t\t\t\ti++;\n\t\t\t\t\tif(i==l-div){\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tk=0;\n\t\t\t\twhile(1){\n\t\t\t\t\trec[i][j]=tr[div-1-k];\n\t\t\t\t\ti++;\n\t\t\t\t\tk++;\n\t\t\t\t\tif(k==div){\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tj++;\n\t\t\t\tdiv--;\n\t\t\t}\n\t\t\tfor(i=0;i<j;i++){//???????????????\n\t\t\t\tcnt[i]=1;\n\t\t\t}\n\t\t\tans=0;\n\t\t\tfor(i=0;i<j;i++){\n\t\t\t\tif(cnt[i]!=1){//?????????????????´???????£???°??????\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\t\t\t\tfor(x=i+1;x<j;x++){\n\t\t\t\t\tsw=0;\n\t\t\t\t\tfor(k=0;k<l;k++){\n\t\t\t\t\t\tif(rec[k][i]==rec[k][x]){\n\t\t\t\t\t\t\tsw++;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t\tif(sw==l){//rec[][i]??¨rec[][x]????????´????????°???strlen(tr)??????cnt[x]???0????????????\n\t\t\t\t\t\tcnt[x]=0;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\tfor(i=0;i<j;i++){\n\t\t\t\tans+=cnt[i];//cnt[]??????????????¨???????¨?????????°???\n\t\t\t}\n\t\t\tprintf(\"%d\\n\",ans);\n\t\t}\n\t\tm--;\n\t}\n\treturn 0;\n}", "problem_context": "Problem B: Organize Your Train part II\n\nRJ Freight, a Japanese railroad company for freight operations\nhas recently constructed exchange lines at Hazawa, Yokohama.\nThe layout of the lines is shown in Figure B-1.\n\nFigure B-1: Layout of the exchange lines\n\nA freight train consists of 2 to 72 freight cars. There are 26\ntypes of freight cars, which are denoted by 26 lowercase letters\nfrom \"a\" to \"z\". The cars of the same type are indistinguishable from\neach other, and each car's direction doesn't matter either.\nThus, a string of lowercase letters of length 2 to 72 is sufficient\nto completely express the configuration of a train.\n\nUpon arrival at the exchange lines, a train is divided into two\nsub-trains at an arbitrary position (prior to entering the\nstorage lines). Each of the sub-trains may have its direction\nreversed (using the reversal line). Finally, the two sub-trains\nare connected in either order to form the final configuration.\nNote that the reversal operation is optional for each of the\nsub-trains.\n\nFor example, if the arrival configuration is \"abcd\", the train\nis split into two sub-trains of either 3:1, 2:2 or 1:3 cars.\nFor each of the splitting, possible final configurations are\nas follows (\"+\" indicates final concatenation position):\n\n[3:1]\nabc+d cba+d d+abc d+cba\n[2:2]\nab+cd ab+dc ba+cd ba+dc cd+ab cd+ba dc+ab dc+ba\n[1:3]\na+bcd a+dcb bcd+a dcb+a\n\nExcluding duplicates, 12 distinct configurations are possible.\n\nGiven an arrival configuration, answer\nthe number of distinct configurations which can be\nconstructed using the exchange lines described above.\n\nInput\n\nThe entire input looks like the following.\n\nthe number of datasets = m\n\n1st dataset\n\n2nd dataset\n\n...\n\nm-th dataset\n\nEach dataset represents an arriving train, and is a string of\n2 to 72 lowercase letters in an input line.\n\nOutput\n\nFor each dataset, output the number of possible train configurations\nin a line. No other characters should appear in the output.\n\nSample Input\n\n4\naa\nabba\nabcd\nabcde\n\nOutput for the Sample Input\n\n1\n6\n12\n18", "sample_input": "4\naa\nabba\nabcd\nabcde\n"}, "reference_outputs": ["1\n6\n12\n18\n"], "source_document_id": "p00723", "source_text": "Problem B: Organize Your Train part II\n\nRJ Freight, a Japanese railroad company for freight operations\nhas recently constructed exchange lines at Hazawa, Yokohama.\nThe layout of the lines is shown in Figure B-1.\n\nFigure B-1: Layout of the exchange lines\n\nA freight train consists of 2 to 72 freight cars. There are 26\ntypes of freight cars, which are denoted by 26 lowercase letters\nfrom \"a\" to \"z\". The cars of the same type are indistinguishable from\neach other, and each car's direction doesn't matter either.\nThus, a string of lowercase letters of length 2 to 72 is sufficient\nto completely express the configuration of a train.\n\nUpon arrival at the exchange lines, a train is divided into two\nsub-trains at an arbitrary position (prior to entering the\nstorage lines). Each of the sub-trains may have its direction\nreversed (using the reversal line). Finally, the two sub-trains\nare connected in either order to form the final configuration.\nNote that the reversal operation is optional for each of the\nsub-trains.\n\nFor example, if the arrival configuration is \"abcd\", the train\nis split into two sub-trains of either 3:1, 2:2 or 1:3 cars.\nFor each of the splitting, possible final configurations are\nas follows (\"+\" indicates final concatenation position):\n\n[3:1]\nabc+d cba+d d+abc d+cba\n[2:2]\nab+cd ab+dc ba+cd ba+dc cd+ab cd+ba dc+ab dc+ba\n[1:3]\na+bcd a+dcb bcd+a dcb+a\n\nExcluding duplicates, 12 distinct configurations are possible.\n\nGiven an arrival configuration, answer\nthe number of distinct configurations which can be\nconstructed using the exchange lines described above.\n\nInput\n\nThe entire input looks like the following.\n\nthe number of datasets = m\n\n1st dataset\n\n2nd dataset\n\n...\n\nm-th dataset\n\nEach dataset represents an arriving train, and is a string of\n2 to 72 lowercase letters in an input line.\n\nOutput\n\nFor each dataset, output the number of possible train configurations\nin a line. No other characters should appear in the output.\n\nSample Input\n\n4\naa\nabba\nabcd\nabcde\n\nOutput for the Sample Input\n\n1\n6\n12\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": 2617, "cpu_time_ms": 560, "memory_kb": 676}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s340404636", "group_id": "codeNet:p00723", "input_text": "#include <stdio.h>\n#include <string.h>\n\nint main(void)\n{\n    int n, i;\n    scanf(\"%d\", &n);\n    for(i = 0; i < n; i++){\n        char done[1024][73];\n        char org[73];\n        int num = 0, len, j;\n\n        scanf(\"%s\", org);\n        len = strlen(org);\n\n        for(j = 1; j < len; j++){\n            int k;\n            char first[2][72], second[2][72];\n            for(k = 0; k < j; k++){\n                first[0][k] = first[1][j - 1 - k] = org[k];\n            }\n            first[0][k] = first[1][k] = '\\0';\n            for(k = j; k < len; k++){\n                second[0][k - j] = second[1][len -1 - k] = org[k];\n            }\n            second[0][len - j] = second[1][len - j] = '\\0';\n            //printf(\"first: %s, rev: %s\\n\", first[0], first[1]);\n            //printf(\"second: %s, rev: %s\\n\", second[0], second[1]);\n\n            int l;\n            for(k = 0; k < 2; k++){\n                for(l = 0; l < 2; l++){\n                    int m;\n                    char temp[73];\n                    strcpy(temp, first[k]);\n                    strcat(temp, second[l]);\n                    for(m = 0; m < num; m++)\n                        if(strcmp(temp, done[m]) == 0)\n                            break;\n                    if(m == num){\n                        strcpy(done[num], temp);\n                        num++;\n                    }\n                    strcpy(temp, second[l]);\n                    strcat(temp, first[k]);\n                    for(m = 0; m < num; m++)\n                        if(strcmp(temp, done[m]) == 0)\n                            break;\n                    if(m == num){\n                        strcpy(done[num], temp);\n                        num++;\n                    }\n                }\n            }\n        }\n        //for(j = 0; j < num; j++)\n        //    printf(\"%s\\n\", done[j]);\n\n        printf(\"%d\\n\", num);\n    }\n    return 0;\n}", "language": "C", "metadata": {"date": 1458380583, "filename_ext": "c", "original_language": "C", "problem_description_relpath": "problem_descriptions/p00723.html", "problem_id": "p00723", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p00723/input.txt", "sample_output_relpath": "derived/input_output/data/p00723/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p00723/C/s340404636.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s340404636", "user_id": "u248416507"}, "prompt_components": {"gold_output": "1\n6\n12\n18\n", "input_to_evaluate": "#include <stdio.h>\n#include <string.h>\n\nint main(void)\n{\n    int n, i;\n    scanf(\"%d\", &n);\n    for(i = 0; i < n; i++){\n        char done[1024][73];\n        char org[73];\n        int num = 0, len, j;\n\n        scanf(\"%s\", org);\n        len = strlen(org);\n\n        for(j = 1; j < len; j++){\n            int k;\n            char first[2][72], second[2][72];\n            for(k = 0; k < j; k++){\n                first[0][k] = first[1][j - 1 - k] = org[k];\n            }\n            first[0][k] = first[1][k] = '\\0';\n            for(k = j; k < len; k++){\n                second[0][k - j] = second[1][len -1 - k] = org[k];\n            }\n            second[0][len - j] = second[1][len - j] = '\\0';\n            //printf(\"first: %s, rev: %s\\n\", first[0], first[1]);\n            //printf(\"second: %s, rev: %s\\n\", second[0], second[1]);\n\n            int l;\n            for(k = 0; k < 2; k++){\n                for(l = 0; l < 2; l++){\n                    int m;\n                    char temp[73];\n                    strcpy(temp, first[k]);\n                    strcat(temp, second[l]);\n                    for(m = 0; m < num; m++)\n                        if(strcmp(temp, done[m]) == 0)\n                            break;\n                    if(m == num){\n                        strcpy(done[num], temp);\n                        num++;\n                    }\n                    strcpy(temp, second[l]);\n                    strcat(temp, first[k]);\n                    for(m = 0; m < num; m++)\n                        if(strcmp(temp, done[m]) == 0)\n                            break;\n                    if(m == num){\n                        strcpy(done[num], temp);\n                        num++;\n                    }\n                }\n            }\n        }\n        //for(j = 0; j < num; j++)\n        //    printf(\"%s\\n\", done[j]);\n\n        printf(\"%d\\n\", num);\n    }\n    return 0;\n}", "problem_context": "Problem B: Organize Your Train part II\n\nRJ Freight, a Japanese railroad company for freight operations\nhas recently constructed exchange lines at Hazawa, Yokohama.\nThe layout of the lines is shown in Figure B-1.\n\nFigure B-1: Layout of the exchange lines\n\nA freight train consists of 2 to 72 freight cars. There are 26\ntypes of freight cars, which are denoted by 26 lowercase letters\nfrom \"a\" to \"z\". The cars of the same type are indistinguishable from\neach other, and each car's direction doesn't matter either.\nThus, a string of lowercase letters of length 2 to 72 is sufficient\nto completely express the configuration of a train.\n\nUpon arrival at the exchange lines, a train is divided into two\nsub-trains at an arbitrary position (prior to entering the\nstorage lines). Each of the sub-trains may have its direction\nreversed (using the reversal line). Finally, the two sub-trains\nare connected in either order to form the final configuration.\nNote that the reversal operation is optional for each of the\nsub-trains.\n\nFor example, if the arrival configuration is \"abcd\", the train\nis split into two sub-trains of either 3:1, 2:2 or 1:3 cars.\nFor each of the splitting, possible final configurations are\nas follows (\"+\" indicates final concatenation position):\n\n[3:1]\nabc+d cba+d d+abc d+cba\n[2:2]\nab+cd ab+dc ba+cd ba+dc cd+ab cd+ba dc+ab dc+ba\n[1:3]\na+bcd a+dcb bcd+a dcb+a\n\nExcluding duplicates, 12 distinct configurations are possible.\n\nGiven an arrival configuration, answer\nthe number of distinct configurations which can be\nconstructed using the exchange lines described above.\n\nInput\n\nThe entire input looks like the following.\n\nthe number of datasets = m\n\n1st dataset\n\n2nd dataset\n\n...\n\nm-th dataset\n\nEach dataset represents an arriving train, and is a string of\n2 to 72 lowercase letters in an input line.\n\nOutput\n\nFor each dataset, output the number of possible train configurations\nin a line. No other characters should appear in the output.\n\nSample Input\n\n4\naa\nabba\nabcd\nabcde\n\nOutput for the Sample Input\n\n1\n6\n12\n18", "sample_input": "4\naa\nabba\nabcd\nabcde\n"}, "reference_outputs": ["1\n6\n12\n18\n"], "source_document_id": "p00723", "source_text": "Problem B: Organize Your Train part II\n\nRJ Freight, a Japanese railroad company for freight operations\nhas recently constructed exchange lines at Hazawa, Yokohama.\nThe layout of the lines is shown in Figure B-1.\n\nFigure B-1: Layout of the exchange lines\n\nA freight train consists of 2 to 72 freight cars. There are 26\ntypes of freight cars, which are denoted by 26 lowercase letters\nfrom \"a\" to \"z\". The cars of the same type are indistinguishable from\neach other, and each car's direction doesn't matter either.\nThus, a string of lowercase letters of length 2 to 72 is sufficient\nto completely express the configuration of a train.\n\nUpon arrival at the exchange lines, a train is divided into two\nsub-trains at an arbitrary position (prior to entering the\nstorage lines). Each of the sub-trains may have its direction\nreversed (using the reversal line). Finally, the two sub-trains\nare connected in either order to form the final configuration.\nNote that the reversal operation is optional for each of the\nsub-trains.\n\nFor example, if the arrival configuration is \"abcd\", the train\nis split into two sub-trains of either 3:1, 2:2 or 1:3 cars.\nFor each of the splitting, possible final configurations are\nas follows (\"+\" indicates final concatenation position):\n\n[3:1]\nabc+d cba+d d+abc d+cba\n[2:2]\nab+cd ab+dc ba+cd ba+dc cd+ab cd+ba dc+ab dc+ba\n[1:3]\na+bcd a+dcb bcd+a dcb+a\n\nExcluding duplicates, 12 distinct configurations are possible.\n\nGiven an arrival configuration, answer\nthe number of distinct configurations which can be\nconstructed using the exchange lines described above.\n\nInput\n\nThe entire input looks like the following.\n\nthe number of datasets = m\n\n1st dataset\n\n2nd dataset\n\n...\n\nm-th dataset\n\nEach dataset represents an arriving train, and is a string of\n2 to 72 lowercase letters in an input line.\n\nOutput\n\nFor each dataset, output the number of possible train configurations\nin a line. No other characters should appear in the output.\n\nSample Input\n\n4\naa\nabba\nabcd\nabcde\n\nOutput for the Sample Input\n\n1\n6\n12\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": 1869, "cpu_time_ms": 40, "memory_kb": 664}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s895928937", "group_id": "codeNet:p00735", "input_text": "#include \"stdio.h\"\n\nint nyuu(int );\n\nint sosu(int nyuu){\n\tint i;\n\tint count = 0;\n\t//printf(\"%d\\n\", nyuu);\n\tfor(i = 0; i < 300000;i++){\n\t\tif(i % 7 == 6 || i % 7 == 1){\n\t\t\tif(nyuu % i == 0){\n\t\t\t\tcount++;\n\t\t\t}\n\t\t}\n\t}\n\tif(count == 2){\n\t\treturn nyuu;\n\t}\n\telse {\n\t\treturn 0;\n\t}\n}\n\nint main(int argc, char const *argv[])\n{\n\tint nyuuryoku;\n\tint i,j,k;\n\tint ans;\n\twhile(1){\n\t\tscanf(\"%d\",&nyuuryoku);\n\t\tif(nyuuryoku == 1){\n\t\t\tbreak;\n\t\t}\n\t\tprintf(\"%d:\", nyuuryoku);\n\t\tfor(i = 0;i < 3000000;i++){\n\t\t\tif(i % 7 == 6 || i % 7 == 1){\n\t\t\t\tif(nyuuryoku % i == 0){\n\t\t\t\t\tans = sosu(i);\n\t\t\t\t\t//printf(\"%d\\n\", ans);\n\t\t\t\t\tif(ans != 0){\n\t\t\t\t\t\tprintf(\"%d \", ans);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tprintf(\"\\n\");\n\t}\n\treturn 0;\n}", "language": "C", "metadata": {"date": 1434014729, "filename_ext": "c", "original_language": "C", "problem_description_relpath": "problem_descriptions/p00735.html", "problem_id": "p00735", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p00735/input.txt", "sample_output_relpath": "derived/input_output/data/p00735/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p00735/C/s895928937.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s895928937", "user_id": "u808689778"}, "prompt_components": {"gold_output": "205920: 6 8 13 15 20 22 55 99\n262144: 8\n262200: 6 8 15 20 50 57 69 76 92 190 230 475 575 874 2185\n279936: 6 8 27\n299998: 299998\n", "input_to_evaluate": "#include \"stdio.h\"\n\nint nyuu(int );\n\nint sosu(int nyuu){\n\tint i;\n\tint count = 0;\n\t//printf(\"%d\\n\", nyuu);\n\tfor(i = 0; i < 300000;i++){\n\t\tif(i % 7 == 6 || i % 7 == 1){\n\t\t\tif(nyuu % i == 0){\n\t\t\t\tcount++;\n\t\t\t}\n\t\t}\n\t}\n\tif(count == 2){\n\t\treturn nyuu;\n\t}\n\telse {\n\t\treturn 0;\n\t}\n}\n\nint main(int argc, char const *argv[])\n{\n\tint nyuuryoku;\n\tint i,j,k;\n\tint ans;\n\twhile(1){\n\t\tscanf(\"%d\",&nyuuryoku);\n\t\tif(nyuuryoku == 1){\n\t\t\tbreak;\n\t\t}\n\t\tprintf(\"%d:\", nyuuryoku);\n\t\tfor(i = 0;i < 3000000;i++){\n\t\t\tif(i % 7 == 6 || i % 7 == 1){\n\t\t\t\tif(nyuuryoku % i == 0){\n\t\t\t\t\tans = sosu(i);\n\t\t\t\t\t//printf(\"%d\\n\", ans);\n\t\t\t\t\tif(ans != 0){\n\t\t\t\t\t\tprintf(\"%d \", ans);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tprintf(\"\\n\");\n\t}\n\treturn 0;\n}", "problem_context": "Problem B: Monday-Saturday Prime Factors\n\nChief Judge's log, stardate 48642.5.\nWe have decided to make a problem from elementary number theory.\nThe problem looks like finding all prime factors of a positive integer,\nbut it is not.\n\nA positive integer whose remainder divided by 7 is either 1 or 6 is called\na 7N+{1,6} number.\nBut as it is hard to pronounce,\nwe shall call it a Monday-Saturday number.\n\nFor Monday-Saturday numbers a and b,\nwe say a is a Monday-Saturday divisor of b\nif there exists a Monday-Saturday number x\nsuch that ax = b.\nIt is easy to show that\nfor any Monday-Saturday numbers a and b,\nit holds that a is\na Monday-Saturday divisor of b\nif and only if\na is a divisor of b in the usual sense.\n\nWe call a Monday-Saturday number a Monday-Saturday prime\nif it is greater than 1 and has no Monday-Saturday divisors\nother than itself and 1.\nA Monday-Saturday number which is a prime in the usual sense\nis a Monday-Saturday prime\nbut the converse does not always hold.\nFor example, 27 is a Monday-Saturday prime\nalthough it is not a prime in the usual sense.\nWe call a Monday-Saturday prime\nwhich is a Monday-Saturday divisor of a Monday-Saturday number a\na Monday-Saturday prime factor of a.\nFor example, 27 is one of the Monday-Saturday prime factors of 216,\nsince 27 is a Monday-Saturday prime\nand 216 = 27 × 8 holds.\n\nAny Monday-Saturday number greater than 1\ncan be expressed as a product of one or more Monday-Saturday primes.\nThe expression is not always unique\neven if differences in order are ignored.\nFor example,\n\n216 = 6 × 6 × 6 = 8 × 27\n\nholds.\n\nOur contestants should write a program that outputs\nall Monday-Saturday prime factors\nof each input Monday-Saturday number.\n\nInput\n\nThe input is a sequence of lines each of which contains a single\nMonday-Saturday number.\nEach Monday-Saturday number is greater than 1\nand less than 300000 (three hundred thousand).\nThe end of the input is indicated by a line\ncontaining a single digit 1.\n\nOutput\n\nFor each input Monday-Saturday number,\nit should be printed, followed by a colon `:'\nand the list of its Monday-Saturday prime factors on a single line.\nMonday-Saturday prime factors should be listed in ascending order\nand each should be preceded by a space.\nAll the Monday-Saturday prime factors should be printed only once\neven if they divide the input Monday-Saturday number more than once.\n\nSample Input\n\n205920\n262144\n262200\n279936\n299998\n1\n\nOutput for the Sample Input\n\n205920: 6 8 13 15 20 22 55 99\n262144: 8\n262200: 6 8 15 20 50 57 69 76 92 190 230 475 575 874 2185\n279936: 6 8 27\n299998: 299998", "sample_input": "205920\n262144\n262200\n279936\n299998\n1\n"}, "reference_outputs": ["205920: 6 8 13 15 20 22 55 99\n262144: 8\n262200: 6 8 15 20 50 57 69 76 92 190 230 475 575 874 2185\n279936: 6 8 27\n299998: 299998\n"], "source_document_id": "p00735", "source_text": "Problem B: Monday-Saturday Prime Factors\n\nChief Judge's log, stardate 48642.5.\nWe have decided to make a problem from elementary number theory.\nThe problem looks like finding all prime factors of a positive integer,\nbut it is not.\n\nA positive integer whose remainder divided by 7 is either 1 or 6 is called\na 7N+{1,6} number.\nBut as it is hard to pronounce,\nwe shall call it a Monday-Saturday number.\n\nFor Monday-Saturday numbers a and b,\nwe say a is a Monday-Saturday divisor of b\nif there exists a Monday-Saturday number x\nsuch that ax = b.\nIt is easy to show that\nfor any Monday-Saturday numbers a and b,\nit holds that a is\na Monday-Saturday divisor of b\nif and only if\na is a divisor of b in the usual sense.\n\nWe call a Monday-Saturday number a Monday-Saturday prime\nif it is greater than 1 and has no Monday-Saturday divisors\nother than itself and 1.\nA Monday-Saturday number which is a prime in the usual sense\nis a Monday-Saturday prime\nbut the converse does not always hold.\nFor example, 27 is a Monday-Saturday prime\nalthough it is not a prime in the usual sense.\nWe call a Monday-Saturday prime\nwhich is a Monday-Saturday divisor of a Monday-Saturday number a\na Monday-Saturday prime factor of a.\nFor example, 27 is one of the Monday-Saturday prime factors of 216,\nsince 27 is a Monday-Saturday prime\nand 216 = 27 × 8 holds.\n\nAny Monday-Saturday number greater than 1\ncan be expressed as a product of one or more Monday-Saturday primes.\nThe expression is not always unique\neven if differences in order are ignored.\nFor example,\n\n216 = 6 × 6 × 6 = 8 × 27\n\nholds.\n\nOur contestants should write a program that outputs\nall Monday-Saturday prime factors\nof each input Monday-Saturday number.\n\nInput\n\nThe input is a sequence of lines each of which contains a single\nMonday-Saturday number.\nEach Monday-Saturday number is greater than 1\nand less than 300000 (three hundred thousand).\nThe end of the input is indicated by a line\ncontaining a single digit 1.\n\nOutput\n\nFor each input Monday-Saturday number,\nit should be printed, followed by a colon `:'\nand the list of its Monday-Saturday prime factors on a single line.\nMonday-Saturday prime factors should be listed in ascending order\nand each should be preceded by a space.\nAll the Monday-Saturday prime factors should be printed only once\neven if they divide the input Monday-Saturday number more than once.\n\nSample Input\n\n205920\n262144\n262200\n279936\n299998\n1\n\nOutput for the Sample Input\n\n205920: 6 8 13 15 20 22 55 99\n262144: 8\n262200: 6 8 15 20 50 57 69 76 92 190 230 475 575 874 2185\n279936: 6 8 27\n299998: 299998", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 13150, "memory_kb": 596}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s447834651", "group_id": "codeNet:p00737", "input_text": "//SPFA\n#include <stdio.h>\n#include <string.h>\n#define INF (9*900*4)\n#define rep(i,n) for(i=0;i<(n);i++)\nint dx[]={1,0,-1,0};\nint dy[]={0,1,0,-1};\n\nstruct Node{\n\tint y,x,dir;\n};\n\nvoid _a(struct Node *a){a->y+=dy[a->dir];a->x+=dx[a->dir];}\nvoid _b(struct Node *a){a->dir=(a->dir+1)%4;_a(a);}\nvoid _c(struct Node *a){a->dir=(a->dir+2)%4;_a(a);}\nvoid _d(struct Node *a){a->dir=(a->dir-1+4)%4;_a(a);}\nvoid _e(struct Node *a){}\nvoid (*action[5])(struct Node *)={_a,_b,_c,_d,_e};\n\nint in(int y,int x,int h,int w){\n\treturn 0<=y&&y<h&&0<=x&&x<w;\n}\nint main(){\n\tstruct Node a,b,que[INF];\n\tint head,tail;\n\tint inQ[30][30][4],dst[30][30][4];\n\t\n\tint w,h,s[30][30],c[4];\n\tint i,j,k,ans;\n\twhile(scanf(\"%d%d\",&w,&h)==2&&(w||h)){\n\t\trep(i,h)\n\t\t\trep(j,w)scanf(\"%d\",&s[i][j]);\n\t\trep(i,4)scanf(\"%d\",c+i);\n\t\tmemset(inQ,0,sizeof(inQ));\n\t\trep(i,h)rep(j,w)rep(k,4)dst[i][j][k]=INF;\n\t\ta.y=a.x=a.dir=0;\n\t\thead=tail=0;\n\t\tdst[a.y][a.x][a.dir]=0;\n\t\tque[tail++]=a;\n\t\twhile(head<tail){\n\t\t\ta=que[head++];\n\t\t\tinQ[a.y][a.x][a.dir]=0;\n\t\t\tb=a;\n\t\t\taction[s[b.y][b.x]](&b);\n\t\t\tif(in(b.y,b.x,h,w) && dst[a.y][a.x][a.dir] < dst[b.y][b.x][b.dir]){\n\t\t\t\tdst[b.y][b.x][b.dir] = dst[a.y][a.x][a.dir];\n\t\t\t\tif(inQ[b.y][b.x][b.dir]==0){\n\t\t\t\t\tque[tail++]=b;\n\t\t\t\t\tinQ[b.y][b.x][b.dir]=1;\n\t\t\t\t}\n\t\t\t}\n\t\t\trep(i,4){\n\t\t\t\tb=a;\n\t\t\t\taction[i](&b);\n\t\t\t\tif(in(b.y,b.x,h,w) && dst[a.y][a.x][a.dir]+c[i] < dst[b.y][b.x][b.dir]){\n\t\t\t\t\tdst[b.y][b.x][b.dir] = dst[a.y][a.x][a.dir]+c[i];\n\t\t\t\t\tif(inQ[b.y][b.x][b.dir]==0){\n\t\t\t\t\t\tque[tail++]=b;\n\t\t\t\t\t\tinQ[b.y][b.x][b.dir]=1;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tans=INF;\n\t\trep(i,4){\n\t\t\tif(dst[h-1][w-1][i] < ans)ans = dst[h-1][w-1][i];\n\t\t}\n\t\tprintf(\"%d\\n\",ans);\n\t}\n}", "language": "C", "metadata": {"date": 1343460415, "filename_ext": "c", "original_language": "C", "problem_description_relpath": "problem_descriptions/p00737.html", "problem_id": "p00737", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p00737/input.txt", "sample_output_relpath": "derived/input_output/data/p00737/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p00737/C/s447834651.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s447834651", "user_id": "u393475075"}, "prompt_components": {"gold_output": "1\n11\n6\n", "input_to_evaluate": "//SPFA\n#include <stdio.h>\n#include <string.h>\n#define INF (9*900*4)\n#define rep(i,n) for(i=0;i<(n);i++)\nint dx[]={1,0,-1,0};\nint dy[]={0,1,0,-1};\n\nstruct Node{\n\tint y,x,dir;\n};\n\nvoid _a(struct Node *a){a->y+=dy[a->dir];a->x+=dx[a->dir];}\nvoid _b(struct Node *a){a->dir=(a->dir+1)%4;_a(a);}\nvoid _c(struct Node *a){a->dir=(a->dir+2)%4;_a(a);}\nvoid _d(struct Node *a){a->dir=(a->dir-1+4)%4;_a(a);}\nvoid _e(struct Node *a){}\nvoid (*action[5])(struct Node *)={_a,_b,_c,_d,_e};\n\nint in(int y,int x,int h,int w){\n\treturn 0<=y&&y<h&&0<=x&&x<w;\n}\nint main(){\n\tstruct Node a,b,que[INF];\n\tint head,tail;\n\tint inQ[30][30][4],dst[30][30][4];\n\t\n\tint w,h,s[30][30],c[4];\n\tint i,j,k,ans;\n\twhile(scanf(\"%d%d\",&w,&h)==2&&(w||h)){\n\t\trep(i,h)\n\t\t\trep(j,w)scanf(\"%d\",&s[i][j]);\n\t\trep(i,4)scanf(\"%d\",c+i);\n\t\tmemset(inQ,0,sizeof(inQ));\n\t\trep(i,h)rep(j,w)rep(k,4)dst[i][j][k]=INF;\n\t\ta.y=a.x=a.dir=0;\n\t\thead=tail=0;\n\t\tdst[a.y][a.x][a.dir]=0;\n\t\tque[tail++]=a;\n\t\twhile(head<tail){\n\t\t\ta=que[head++];\n\t\t\tinQ[a.y][a.x][a.dir]=0;\n\t\t\tb=a;\n\t\t\taction[s[b.y][b.x]](&b);\n\t\t\tif(in(b.y,b.x,h,w) && dst[a.y][a.x][a.dir] < dst[b.y][b.x][b.dir]){\n\t\t\t\tdst[b.y][b.x][b.dir] = dst[a.y][a.x][a.dir];\n\t\t\t\tif(inQ[b.y][b.x][b.dir]==0){\n\t\t\t\t\tque[tail++]=b;\n\t\t\t\t\tinQ[b.y][b.x][b.dir]=1;\n\t\t\t\t}\n\t\t\t}\n\t\t\trep(i,4){\n\t\t\t\tb=a;\n\t\t\t\taction[i](&b);\n\t\t\t\tif(in(b.y,b.x,h,w) && dst[a.y][a.x][a.dir]+c[i] < dst[b.y][b.x][b.dir]){\n\t\t\t\t\tdst[b.y][b.x][b.dir] = dst[a.y][a.x][a.dir]+c[i];\n\t\t\t\t\tif(inQ[b.y][b.x][b.dir]==0){\n\t\t\t\t\t\tque[tail++]=b;\n\t\t\t\t\t\tinQ[b.y][b.x][b.dir]=1;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tans=INF;\n\t\trep(i,4){\n\t\t\tif(dst[h-1][w-1][i] < ans)ans = dst[h-1][w-1][i];\n\t\t}\n\t\tprintf(\"%d\\n\",ans);\n\t}\n}", "problem_context": "Problem D: Twirling Robot\n\nLet's play a game using a robot on a rectangular board\ncovered with a square mesh (Figure D-1).\nThe robot is initially set at the start square in the northwest corner\nfacing the east direction.\nThe goal of this game is to lead the robot\nto the goal square in the southeast corner.\n\nFigure D-1: Example of a board\n\nThe robot can execute the following five types of commands.\n\n\"Straight\":\n\nKeep the current direction of the robot, and move forward to the next square.\n\n\"Right\":\n\nTurn right with 90 degrees from the current direction, and move forward to the next square.\n\n\"Back\":\n\nTurn to the reverse direction, and move forward to the next square.\n\n\"Left\":\n\nTurn left with 90 degrees from the current direction, and move forward to the next square.\n\n\"Halt\":\n\nStop at the current square to finish the game.\n\nEach square has one of these commands assigned as shown in Figure D-2.\nThe robot executes the command assigned to the square where it resides,\nunless the player gives another command to be executed instead.\nEach time the player gives an explicit command,\nthe player has to pay the cost that depends on the command type.\n\nFigure D-2: Example of commands assigned to squares\n\nThe robot can visit the same square several times during a game.\nThe player loses the game when the robot goes out of the board\nor it executes a \"Halt\" command before arriving at the goal square.\n\nYour task is to write a program that calculates the minimum cost to lead the robot\nfrom the start square to the goal one.\n\nInput\n\nThe input is a sequence of datasets.\nThe end of the input is indicated by a line containing two zeros separated by a space.\nEach dataset is formatted as follows.\n\nw h\n\ns(1,1) ... s(1,w)\n\ns(2,1) ... s(2,w)\n\n...\n\ns(h,1) ... s(h,w)\n\nc0 c1 c2 c3\n\nThe integers h and w are the numbers of rows and columns of the board,\nrespectively.\nYou may assume 2 ≤ h ≤ 30 and 2 ≤ w ≤ 30.\nEach of the following h lines consists of w numbers delimited by a space.\nThe number s(i, j) represents the command assigned to the square\nin the i-th row and the j-th column as follows.\n\n0: \"Straight\"\n\n1: \"Right\"\n\n2: \"Back\"\n\n3: \"Left\"\n\n4: \"Halt\"\n\nYou can assume that a \"Halt\" command is assigned to the goal square.\nNote that \"Halt\" commands may be assigned to other squares, too.\n\nThe last line of a dataset contains four integers\nc0, c1, c2, and c3, delimited by a space,\nindicating the costs that the player has to pay\nwhen the player gives\n\"Straight\", \"Right\", \"Back\", and \"Left\" commands\nrespectively.\nThe player cannot give \"Halt\" commands.\nYou can assume that all the values of\nc0, c1, c2, and c3\nare between 1 and 9, inclusive.\n\nOutput\n\nFor each dataset, print a line only having a decimal integer indicating the minimum cost\nrequired to lead the robot to the goal.\nNo other characters should be on the output line.\n\nSample Input\n\n8 3\n0 0 0 0 0 0 0 1\n2 3 0 1 4 0 0 1\n3 3 0 0 0 0 0 4\n9 9 1 9\n4 4\n3 3 4 0\n1 2 4 4\n1 1 1 0\n0 2 4 4\n8 7 2 1\n2 8\n2 2\n4 1\n0 4\n1 3\n1 0\n2 1\n0 3\n1 4\n1 9 3 1\n0 0\n\nOutput for the Sample Input\n\n1\n11\n6", "sample_input": "8 3\n0 0 0 0 0 0 0 1\n2 3 0 1 4 0 0 1\n3 3 0 0 0 0 0 4\n9 9 1 9\n4 4\n3 3 4 0\n1 2 4 4\n1 1 1 0\n0 2 4 4\n8 7 2 1\n2 8\n2 2\n4 1\n0 4\n1 3\n1 0\n2 1\n0 3\n1 4\n1 9 3 1\n0 0\n"}, "reference_outputs": ["1\n11\n6\n"], "source_document_id": "p00737", "source_text": "Problem D: Twirling Robot\n\nLet's play a game using a robot on a rectangular board\ncovered with a square mesh (Figure D-1).\nThe robot is initially set at the start square in the northwest corner\nfacing the east direction.\nThe goal of this game is to lead the robot\nto the goal square in the southeast corner.\n\nFigure D-1: Example of a board\n\nThe robot can execute the following five types of commands.\n\n\"Straight\":\n\nKeep the current direction of the robot, and move forward to the next square.\n\n\"Right\":\n\nTurn right with 90 degrees from the current direction, and move forward to the next square.\n\n\"Back\":\n\nTurn to the reverse direction, and move forward to the next square.\n\n\"Left\":\n\nTurn left with 90 degrees from the current direction, and move forward to the next square.\n\n\"Halt\":\n\nStop at the current square to finish the game.\n\nEach square has one of these commands assigned as shown in Figure D-2.\nThe robot executes the command assigned to the square where it resides,\nunless the player gives another command to be executed instead.\nEach time the player gives an explicit command,\nthe player has to pay the cost that depends on the command type.\n\nFigure D-2: Example of commands assigned to squares\n\nThe robot can visit the same square several times during a game.\nThe player loses the game when the robot goes out of the board\nor it executes a \"Halt\" command before arriving at the goal square.\n\nYour task is to write a program that calculates the minimum cost to lead the robot\nfrom the start square to the goal one.\n\nInput\n\nThe input is a sequence of datasets.\nThe end of the input is indicated by a line containing two zeros separated by a space.\nEach dataset is formatted as follows.\n\nw h\n\ns(1,1) ... s(1,w)\n\ns(2,1) ... s(2,w)\n\n...\n\ns(h,1) ... s(h,w)\n\nc0 c1 c2 c3\n\nThe integers h and w are the numbers of rows and columns of the board,\nrespectively.\nYou may assume 2 ≤ h ≤ 30 and 2 ≤ w ≤ 30.\nEach of the following h lines consists of w numbers delimited by a space.\nThe number s(i, j) represents the command assigned to the square\nin the i-th row and the j-th column as follows.\n\n0: \"Straight\"\n\n1: \"Right\"\n\n2: \"Back\"\n\n3: \"Left\"\n\n4: \"Halt\"\n\nYou can assume that a \"Halt\" command is assigned to the goal square.\nNote that \"Halt\" commands may be assigned to other squares, too.\n\nThe last line of a dataset contains four integers\nc0, c1, c2, and c3, delimited by a space,\nindicating the costs that the player has to pay\nwhen the player gives\n\"Straight\", \"Right\", \"Back\", and \"Left\" commands\nrespectively.\nThe player cannot give \"Halt\" commands.\nYou can assume that all the values of\nc0, c1, c2, and c3\nare between 1 and 9, inclusive.\n\nOutput\n\nFor each dataset, print a line only having a decimal integer indicating the minimum cost\nrequired to lead the robot to the goal.\nNo other characters should be on the output line.\n\nSample Input\n\n8 3\n0 0 0 0 0 0 0 1\n2 3 0 1 4 0 0 1\n3 3 0 0 0 0 0 4\n9 9 1 9\n4 4\n3 3 4 0\n1 2 4 4\n1 1 1 0\n0 2 4 4\n8 7 2 1\n2 8\n2 2\n4 1\n0 4\n1 3\n1 0\n2 1\n0 3\n1 4\n1 9 3 1\n0 0\n\nOutput for the Sample Input\n\n1\n11\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": 1634, "cpu_time_ms": 60, "memory_kb": 824}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s055023410", "group_id": "codeNet:p00740", "input_text": "#include <stdio.h>\n#define N_MAX 50\n\nint main(void)\n{\n     int hand[N_MAX], wan, n, i, j;\n\n     while(1){\n\t  scanf(\"%d %d\",&n,&wan);\n\t  if(n+wan==0) return 0;\n\t  \n\t  for(i=0; i<n; i++) hand[i]=0;\n\t  \n\t  i=0;\n\t  while(1){\n\t       if(wan) wan--, hand[i]++;\n\t       else wan+=hand[i], hand[i]=0;\n\n\t       if(!wan){\n\t\t    for(j=0; j<n; j++) if(j!=i && hand[j]) break;\n\t\t    if(j==n) break;\n\t       }\n\n\t       i = (i+1)%n;\n\t  }\n\n\t  printf(\"%d\\n\",i);\n     }\n     \n     return 0;\n}", "language": "C", "metadata": {"date": 1341941825, "filename_ext": "c", "original_language": "C", "problem_description_relpath": "problem_descriptions/p00740.html", "problem_id": "p00740", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p00740/input.txt", "sample_output_relpath": "derived/input_output/data/p00740/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p00740/C/s055023410.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s055023410", "user_id": "u655658530"}, "prompt_components": {"gold_output": "1\n0\n1\n5\n30\n1\n13\n", "input_to_evaluate": "#include <stdio.h>\n#define N_MAX 50\n\nint main(void)\n{\n     int hand[N_MAX], wan, n, i, j;\n\n     while(1){\n\t  scanf(\"%d %d\",&n,&wan);\n\t  if(n+wan==0) return 0;\n\t  \n\t  for(i=0; i<n; i++) hand[i]=0;\n\t  \n\t  i=0;\n\t  while(1){\n\t       if(wan) wan--, hand[i]++;\n\t       else wan+=hand[i], hand[i]=0;\n\n\t       if(!wan){\n\t\t    for(j=0; j<n; j++) if(j!=i && hand[j]) break;\n\t\t    if(j==n) break;\n\t       }\n\n\t       i = (i+1)%n;\n\t  }\n\n\t  printf(\"%d\\n\",i);\n     }\n     \n     return 0;\n}", "problem_context": "Problem A: Next Mayor\n\nOne of the oddest traditions of the town of Gameston may be that even\nthe town mayor of the next term is chosen according to the result of a game.\nWhen the expiration of the term of the mayor approaches, at least\nthree candidates, including the mayor of the time, play a game of\npebbles, and the winner will be the next mayor.\n\nThe rule of the game of pebbles is as follows.\nIn what follows, n is the number of participating candidates.\n\nRequisites\n\nA round table, a bowl, and plenty of pebbles.\n\nStart of the Game\n\nA number of pebbles are put into the bowl;\nthe number is decided by the Administration Commission using\nsome secret stochastic process.\nAll the candidates, numbered from 0 to n-1 sit around the round table,\nin a counterclockwise order. Initially, the bowl is handed to the\nserving mayor at the time, who is numbered 0.\n\nGame Steps\n\nWhen a candidate is handed the bowl and if any pebbles are in it,\none pebble is taken out of the bowl and is\nkept, together with those already at hand, if any.\nIf no pebbles are left in the bowl, the candidate puts\nall the kept pebbles, if any, into the bowl. Then, in either case, the bowl is\nhanded to the next candidate to the right.\n\nThis step is repeated until the winner is decided.\n\nEnd of the Game\n\nWhen a candidate takes the last pebble in the bowl, and no other\ncandidates keep any pebbles, the game ends and that candidate with all\nthe pebbles is the winner.\n\nA math teacher of Gameston High, through his analysis, concluded that this game will always end within a finite number of steps, although the number of required steps can be very large.\n\nInput\n\nThe input is a sequence of datasets. Each dataset is a line\ncontaining two integers n and p separated by a single\nspace. The integer n is the number of the candidates including\nthe current mayor, and the integer p is the total number of the\npebbles initially put in the bowl. You may assume 3 ≤ n ≤ 50\nand 2 ≤ p ≤ 50.\n\nWith the settings given in the input datasets, the game will end within 1000000 (one million) steps.\n\nThe end of the input is indicated by a line\ncontaining two zeros separated by a single space.\n\nOutput\n\nThe output should be composed of lines corresponding to input datasets\nin the same order, each line of which containing the candidate number\nof the winner.\nNo other characters should appear in the output.\n\nSample Input\n\n3 2\n3 3\n3 50\n10 29\n31 32\n50 2\n50 50\n0 0\n\nOutput for the Sample Input\n\n1\n0\n1\n5\n30\n1\n13", "sample_input": "3 2\n3 3\n3 50\n10 29\n31 32\n50 2\n50 50\n0 0\n"}, "reference_outputs": ["1\n0\n1\n5\n30\n1\n13\n"], "source_document_id": "p00740", "source_text": "Problem A: Next Mayor\n\nOne of the oddest traditions of the town of Gameston may be that even\nthe town mayor of the next term is chosen according to the result of a game.\nWhen the expiration of the term of the mayor approaches, at least\nthree candidates, including the mayor of the time, play a game of\npebbles, and the winner will be the next mayor.\n\nThe rule of the game of pebbles is as follows.\nIn what follows, n is the number of participating candidates.\n\nRequisites\n\nA round table, a bowl, and plenty of pebbles.\n\nStart of the Game\n\nA number of pebbles are put into the bowl;\nthe number is decided by the Administration Commission using\nsome secret stochastic process.\nAll the candidates, numbered from 0 to n-1 sit around the round table,\nin a counterclockwise order. Initially, the bowl is handed to the\nserving mayor at the time, who is numbered 0.\n\nGame Steps\n\nWhen a candidate is handed the bowl and if any pebbles are in it,\none pebble is taken out of the bowl and is\nkept, together with those already at hand, if any.\nIf no pebbles are left in the bowl, the candidate puts\nall the kept pebbles, if any, into the bowl. Then, in either case, the bowl is\nhanded to the next candidate to the right.\n\nThis step is repeated until the winner is decided.\n\nEnd of the Game\n\nWhen a candidate takes the last pebble in the bowl, and no other\ncandidates keep any pebbles, the game ends and that candidate with all\nthe pebbles is the winner.\n\nA math teacher of Gameston High, through his analysis, concluded that this game will always end within a finite number of steps, although the number of required steps can be very large.\n\nInput\n\nThe input is a sequence of datasets. Each dataset is a line\ncontaining two integers n and p separated by a single\nspace. The integer n is the number of the candidates including\nthe current mayor, and the integer p is the total number of the\npebbles initially put in the bowl. You may assume 3 ≤ n ≤ 50\nand 2 ≤ p ≤ 50.\n\nWith the settings given in the input datasets, the game will end within 1000000 (one million) steps.\n\nThe end of the input is indicated by a line\ncontaining two zeros separated by a single space.\n\nOutput\n\nThe output should be composed of lines corresponding to input datasets\nin the same order, each line of which containing the candidate number\nof the winner.\nNo other characters should appear in the output.\n\nSample Input\n\n3 2\n3 3\n3 50\n10 29\n31 32\n50 2\n50 50\n0 0\n\nOutput for the Sample Input\n\n1\n0\n1\n5\n30\n1\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": 474, "cpu_time_ms": 70, "memory_kb": 408}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s412391910", "group_id": "codeNet:p00777", "input_text": "#include <stdio.h>\n#include <stdlib.h>\n\n#define MAXN 800\n\n//??????????????¶\n//??¨????????????\n//http://www.cse.kyoto-su.ac.jp/~hiraishi/ICPC/ICPC2014/Domestic/ICPC2014_DomE/ICPC2014_DomE.pdf\n\n//??¶????§???????\ntypedef struct {\n    int ne; //???????????£?????????????????° num_edge\n    int eids[MAXN]; //???????????£????????????????????\\?????? edge_ids\n    int rm; //1?????¨???????????????????????????\n} Node;\n\n//???????§???????\ntypedef struct {\n    int nid1, nid2; //???????????£???????????¶????????\\???????????? node_id\n    int len; //????????????\n    int rm; //1?????¨???????????????????????????\n} Edge;\n\n//??????????????????????????¶??¨???????????\\???????????????\nNode nodes[MAXN]; \nEdge edges[MAXN - 1];\nint N = 0, C1, C2, C3;\n\n//nid????????¶???????????????????????? node_id\nNode* nd(int nid)\n{\n    return &nodes[nid - 1];\n}\n\n//eid????????????????????????????????? edge_id\nEdge* ed(int eid)\n{\n    return &edges[eid - 1];\n}\n\n//???????????°??¨\nvoid DebugPrint()\n{\n    int i, j;\n    for(i = 1; i <= N; i++)\n    {\n        printf(\"\\n%d????????¶\\n????????£?????????????????°: %d\\n\", i, nd(i)->ne);\n        printf(\"????????£??????????????????: \");\n        for(j = 0; j < nd(i)->ne; j++)\n        {\n            printf(\"%d,\",nd(i)->eids[j]);\n        }\n        printf(\"\\nRemoved: %s\\n\\n\", (nd(i)->rm ? \"true\" : \"false\"));\n    }\n    for(i = 1; i <= N - 1; i++)\n    {\n        printf(\"%d?????????\\n????????£???????????¶??????: %d,%d\\n\", i, ed(i)->nid1, ed(i)->nid2);\n        printf(\"????????????: %d\\n\", ed(i)->len);\n        printf(\"Removed: %s\\n\\n\", (ed(i)->rm ? \"true\" : \"false\"));\n    }\n\n    printf(\"C1: %d\\nC2: %d\\nC3: %d\\n\", C1, C2, C3);\n}\n\n//pnid: ??´????????¶???nid pre_nid, cnid: ?????¨?????¶???nid current_nid, d: ????????§????????¢???????¨?\nint Search(int pnid, int cnid, int d)\n{\n    int i, eid, x, maxd = d; //?????§?????¢???????????????????????§????????¢???????¨?\n\n    for(i = 0; i < nd(cnid)->ne; i++)\n    {\n        eid = nd(cnid)->eids[i];\n        if(ed(eid)->rm) continue; //???????????????????????????\n        if(ed(eid)->nid1 == pnid || ed(eid)->nid2 == pnid) continue; //??´????????¶??????????????????\n        x = (ed(eid)->nid1 != cnid ? Search(cnid, ed(eid)->nid1, d + ed(eid)->len) : Search(cnid, ed(eid)->nid2, d + ed(eid)->len)); //???????????????????????°?????\\??????\n        if(x > maxd) maxd = x; //?????????????????§????????§?????¢???????????§????????¨???\n    }\n\n    return maxd; //?????§?????¢?????????\n}\n\n//???????????¨??¢??°\nvoid Init()\n{\n    int i, j;\n\n    C1 = 0;\n    C2 = 0;\n    C3 = 0;\n\n    for(i = 1; i <= MAXN; i++)\n    {\n        nd(i)->ne = 0;\n        for(j = 0; j < MAXN; j++)\n        {\n            nd(i)->eids[j] = 0;\n        }\n        nd(i)->rm = 0;\n    }\n\n    for(i = 1; i <= MAXN - 1; i++)\n    {\n        ed(i)->nid1 = 0;\n        ed(i)->nid2 = 0;\n        ed(i)->rm = 0;\n        ed(i)->len = 0;\n    }\n}\n\nint main()\n{\n    int i, x;\n    int p; //??\\????????¶??????\n    int d; //??\\??????????????????\n\n    while(1)\n    {\n        //??¶?????°?????\\???\n        scanf(\"%d\", &N); \n\n        //0?????\\??????????????¨???????????????????????????\n        if(N == 0) break;\n\n        //???????????????\n        Init();\n\n        //i????????¶????????????\n        //i-1?????????????????????\n        for(i = 2; i <= N; i++)\n        {\n            //i????????¶??????????????£???????????¶???????????????\n            scanf(\"%d\", &p); \n            //i-1???????????????????????£???????????¶???????????????\n            ed(i - 1)->nid1 = p;\n            ed(i - 1)->nid2 = i;\n            //i???,p????????¶??????????????£???????????????????????????????????????????????£?????????????????°????¢???????\n            nd(p)->eids[nd(p)->ne++] = i - 1;\n            nd(i)->eids[nd(i)->ne++] = i - 1;     \n        }\n\n        //i?????????????????????\n        for(i = 1; i <= N - 1; i++)\n        {\n            //i???????????????????????????\n            scanf(\"%d\", &(ed(i)->len));\n        }\n\n        //i????????¶????????????\n        for(i = 1; i <= N; i++)\n        {\n            //??????????????£?????????????????°??????????????¨???\n            if(nd(i)->ne == 1)\n            {\n                //??¶???????????????\n                nd(i)->rm = 1;\n                //??????????????????\n                ed(nd(i)->eids[0])->rm = 1;\n                //??????????????????????????????C1?????????????????????\n                C1 += ed(nd(i)->eids[0])->len;\n            }\n        }\n        //i?????????????????????\n        for(i = 1; i < N - 1; i++)\n        {\n            //??????????????????????????????????????????\n            if(ed(i)->rm) continue;\n\n            //??????????????????????????????????????????C2?????????????????????\n            C2 += ed(i)->len;\n        }\n\n        //i???????????¶???????????????????????§???????????¶?????§????????¢????????????C3?????£??\\\n        for(i = 1; i <= N; i++)\n        {\n            if(nd(i)->rm) continue; //?????????????????¶?????????\n            x = Search(-1, i, 0);\n            if(x > C3) C3 = x;\n        }\n\n        //DebugPrint();\n\n        //(????????????????????§???????????????????????????)+(???????????£????????£?????????????????????????????????????????????)-(????????????????????????????????????)\n        printf(\"%d\\n\", C1 + 3 * C2 - C3); \n    }\n\n    return 0;\n}", "language": "C", "metadata": {"date": 1499180827, "filename_ext": "c", "original_language": "C", "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/C/s412391910.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s412391910", "user_id": "u207046604"}, "prompt_components": {"gold_output": "80\n136\n2\n", "input_to_evaluate": "#include <stdio.h>\n#include <stdlib.h>\n\n#define MAXN 800\n\n//??????????????¶\n//??¨????????????\n//http://www.cse.kyoto-su.ac.jp/~hiraishi/ICPC/ICPC2014/Domestic/ICPC2014_DomE/ICPC2014_DomE.pdf\n\n//??¶????§???????\ntypedef struct {\n    int ne; //???????????£?????????????????° num_edge\n    int eids[MAXN]; //???????????£????????????????????\\?????? edge_ids\n    int rm; //1?????¨???????????????????????????\n} Node;\n\n//???????§???????\ntypedef struct {\n    int nid1, nid2; //???????????£???????????¶????????\\???????????? node_id\n    int len; //????????????\n    int rm; //1?????¨???????????????????????????\n} Edge;\n\n//??????????????????????????¶??¨???????????\\???????????????\nNode nodes[MAXN]; \nEdge edges[MAXN - 1];\nint N = 0, C1, C2, C3;\n\n//nid????????¶???????????????????????? node_id\nNode* nd(int nid)\n{\n    return &nodes[nid - 1];\n}\n\n//eid????????????????????????????????? edge_id\nEdge* ed(int eid)\n{\n    return &edges[eid - 1];\n}\n\n//???????????°??¨\nvoid DebugPrint()\n{\n    int i, j;\n    for(i = 1; i <= N; i++)\n    {\n        printf(\"\\n%d????????¶\\n????????£?????????????????°: %d\\n\", i, nd(i)->ne);\n        printf(\"????????£??????????????????: \");\n        for(j = 0; j < nd(i)->ne; j++)\n        {\n            printf(\"%d,\",nd(i)->eids[j]);\n        }\n        printf(\"\\nRemoved: %s\\n\\n\", (nd(i)->rm ? \"true\" : \"false\"));\n    }\n    for(i = 1; i <= N - 1; i++)\n    {\n        printf(\"%d?????????\\n????????£???????????¶??????: %d,%d\\n\", i, ed(i)->nid1, ed(i)->nid2);\n        printf(\"????????????: %d\\n\", ed(i)->len);\n        printf(\"Removed: %s\\n\\n\", (ed(i)->rm ? \"true\" : \"false\"));\n    }\n\n    printf(\"C1: %d\\nC2: %d\\nC3: %d\\n\", C1, C2, C3);\n}\n\n//pnid: ??´????????¶???nid pre_nid, cnid: ?????¨?????¶???nid current_nid, d: ????????§????????¢???????¨?\nint Search(int pnid, int cnid, int d)\n{\n    int i, eid, x, maxd = d; //?????§?????¢???????????????????????§????????¢???????¨?\n\n    for(i = 0; i < nd(cnid)->ne; i++)\n    {\n        eid = nd(cnid)->eids[i];\n        if(ed(eid)->rm) continue; //???????????????????????????\n        if(ed(eid)->nid1 == pnid || ed(eid)->nid2 == pnid) continue; //??´????????¶??????????????????\n        x = (ed(eid)->nid1 != cnid ? Search(cnid, ed(eid)->nid1, d + ed(eid)->len) : Search(cnid, ed(eid)->nid2, d + ed(eid)->len)); //???????????????????????°?????\\??????\n        if(x > maxd) maxd = x; //?????????????????§????????§?????¢???????????§????????¨???\n    }\n\n    return maxd; //?????§?????¢?????????\n}\n\n//???????????¨??¢??°\nvoid Init()\n{\n    int i, j;\n\n    C1 = 0;\n    C2 = 0;\n    C3 = 0;\n\n    for(i = 1; i <= MAXN; i++)\n    {\n        nd(i)->ne = 0;\n        for(j = 0; j < MAXN; j++)\n        {\n            nd(i)->eids[j] = 0;\n        }\n        nd(i)->rm = 0;\n    }\n\n    for(i = 1; i <= MAXN - 1; i++)\n    {\n        ed(i)->nid1 = 0;\n        ed(i)->nid2 = 0;\n        ed(i)->rm = 0;\n        ed(i)->len = 0;\n    }\n}\n\nint main()\n{\n    int i, x;\n    int p; //??\\????????¶??????\n    int d; //??\\??????????????????\n\n    while(1)\n    {\n        //??¶?????°?????\\???\n        scanf(\"%d\", &N); \n\n        //0?????\\??????????????¨???????????????????????????\n        if(N == 0) break;\n\n        //???????????????\n        Init();\n\n        //i????????¶????????????\n        //i-1?????????????????????\n        for(i = 2; i <= N; i++)\n        {\n            //i????????¶??????????????£???????????¶???????????????\n            scanf(\"%d\", &p); \n            //i-1???????????????????????£???????????¶???????????????\n            ed(i - 1)->nid1 = p;\n            ed(i - 1)->nid2 = i;\n            //i???,p????????¶??????????????£???????????????????????????????????????????????£?????????????????°????¢???????\n            nd(p)->eids[nd(p)->ne++] = i - 1;\n            nd(i)->eids[nd(i)->ne++] = i - 1;     \n        }\n\n        //i?????????????????????\n        for(i = 1; i <= N - 1; i++)\n        {\n            //i???????????????????????????\n            scanf(\"%d\", &(ed(i)->len));\n        }\n\n        //i????????¶????????????\n        for(i = 1; i <= N; i++)\n        {\n            //??????????????£?????????????????°??????????????¨???\n            if(nd(i)->ne == 1)\n            {\n                //??¶???????????????\n                nd(i)->rm = 1;\n                //??????????????????\n                ed(nd(i)->eids[0])->rm = 1;\n                //??????????????????????????????C1?????????????????????\n                C1 += ed(nd(i)->eids[0])->len;\n            }\n        }\n        //i?????????????????????\n        for(i = 1; i < N - 1; i++)\n        {\n            //??????????????????????????????????????????\n            if(ed(i)->rm) continue;\n\n            //??????????????????????????????????????????C2?????????????????????\n            C2 += ed(i)->len;\n        }\n\n        //i???????????¶???????????????????????§???????????¶?????§????????¢????????????C3?????£??\\\n        for(i = 1; i <= N; i++)\n        {\n            if(nd(i)->rm) continue; //?????????????????¶?????????\n            x = Search(-1, i, 0);\n            if(x > C3) C3 = x;\n        }\n\n        //DebugPrint();\n\n        //(????????????????????§???????????????????????????)+(???????????£????????£?????????????????????????????????????????????)-(????????????????????????????????????)\n        printf(\"%d\\n\", C1 + 3 * C2 - C3); \n    }\n\n    return 0;\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": 5271, "cpu_time_ms": 190, "memory_kb": 3176}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s755236823", "group_id": "codeNet:p00998", "input_text": "#include<stdio.h>\n#include<string.h>\n#define min(a,b)(a)<(b)?(a):(b)\n#define  MAX_N (1<<18)\n#define INF 10000001\nint N;\nint num[MAX_N];\nint tree[2*MAX_N-1];\n\nvoid init(int _n)\n{\n\tint i;\n\tfor(N=1;N<=_n;N*=2);\n\tfor(i=0;i<2*N-1;i++)\n\t\ttree[i]=INF;\n}\n\nvoid update(int p,int a)\n{\n\tp+=N-1;\n\ttree[p]=a;\n\twhile(p>0)\n\t{\n\t\tp=(p-1)/2;\n\t\ttree[p]=min(tree[2*p+1],tree[2*p+2]);\n\t}\n}\n\nint query(int a,int b,int k,int l,int r)\n{\n\tif(r<=a||b<=l)\n\t\treturn INF;\n\tif(a<=l&&r<=b)\n\t\treturn tree[k];\n\telse\n\t{\n\t\tint t1=query(a,b,2*k+1,l,(l+r)/2);\n\t\tint t2=query(a,b,2*k+2,(l+r)/2,r);\n\t\treturn min(t1,t2);\n\t}\n}\n\nint main()\n{\n\tint n,i,t,q,x,y,z;\n\tscanf(\"%d%d\",&n,&q);\n\tinit(n);\n\tfor(i=0;i<n;scanf(\"%d\",&t),num[i++]=t);\n\tfor(;q--;)\n\t{\n\t\tscanf(\"%d%d%d\",&x,&y,&z);\n\t\tswitch(x)\n\t\t{\n\t\tcase 0:t=num[z];memmove(num+y+1,num+y,(z-y)*4);num[y]=t;;break;\n\t\tcase 1:for(i=0;i<n;update(i,num[i]),i++);printf(\"%d\\n\",query(y,z+1,0,0,N));break;\n\t\tcase 2:num[y]=z;break;\n\t\t}\n\t}\n\treturn 0;\n}", "language": "C", "metadata": {"date": 1387760381, "filename_ext": "c", "original_language": "C", "problem_description_relpath": "problem_descriptions/p00998.html", "problem_id": "p00998", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p00998/input.txt", "sample_output_relpath": "derived/input_output/data/p00998/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p00998/C/s755236823.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s755236823", "user_id": "u363039534"}, "prompt_components": {"gold_output": "5\n4\n", "input_to_evaluate": "#include<stdio.h>\n#include<string.h>\n#define min(a,b)(a)<(b)?(a):(b)\n#define  MAX_N (1<<18)\n#define INF 10000001\nint N;\nint num[MAX_N];\nint tree[2*MAX_N-1];\n\nvoid init(int _n)\n{\n\tint i;\n\tfor(N=1;N<=_n;N*=2);\n\tfor(i=0;i<2*N-1;i++)\n\t\ttree[i]=INF;\n}\n\nvoid update(int p,int a)\n{\n\tp+=N-1;\n\ttree[p]=a;\n\twhile(p>0)\n\t{\n\t\tp=(p-1)/2;\n\t\ttree[p]=min(tree[2*p+1],tree[2*p+2]);\n\t}\n}\n\nint query(int a,int b,int k,int l,int r)\n{\n\tif(r<=a||b<=l)\n\t\treturn INF;\n\tif(a<=l&&r<=b)\n\t\treturn tree[k];\n\telse\n\t{\n\t\tint t1=query(a,b,2*k+1,l,(l+r)/2);\n\t\tint t2=query(a,b,2*k+2,(l+r)/2,r);\n\t\treturn min(t1,t2);\n\t}\n}\n\nint main()\n{\n\tint n,i,t,q,x,y,z;\n\tscanf(\"%d%d\",&n,&q);\n\tinit(n);\n\tfor(i=0;i<n;scanf(\"%d\",&t),num[i++]=t);\n\tfor(;q--;)\n\t{\n\t\tscanf(\"%d%d%d\",&x,&y,&z);\n\t\tswitch(x)\n\t\t{\n\t\tcase 0:t=num[z];memmove(num+y+1,num+y,(z-y)*4);num[y]=t;;break;\n\t\tcase 1:for(i=0;i<n;update(i,num[i]),i++);printf(\"%d\\n\",query(y,z+1,0,0,N));break;\n\t\tcase 2:num[y]=z;break;\n\t\t}\n\t}\n\treturn 0;\n}", "problem_context": "Problem I : RMQ\n\nn 個の数字a0 ,a1 , ... ,an-1 とq が与えられる。\n\nq 個のクエリーに対して適切な処理を行なって欲しい。\n\nクエリーは以下の3種類の操作が存在する。\n\n値のシフトを行う\n\nl とr のペアが与えられる。(l < r )\nal から ar までの値を Circular Shiftさせる。\n\n0 1 2 3 4 5 6 7 8 9\n\nに対してl=2,r=5というクエリーが与えられたとする。\n\nシフトを行った数字列は\n\n0 1 5 2 3 4 6 7 8 9\n\nとなる。\n\n最小値を求める\n\nl とr のペアが与えられる。(l ≤ r )\n\nal から arまでの値の中で最小の値を求める。\n\n値の更新\n\npos と val のペアが与えられる。\napos の値を val に更新する。\n\nInput\n\n入力は以下のフォーマットで与えられる。\n\nn q\na0\na1\n.\n.\n.\nan-1\nx1 y1 z1\nx2 y2 z2\n.\n.\n.\nxq yq zq\n\nxi = 0 なら、シフトのクエリーを表す。このとき、l = yi , r = zi とする。\n\nxi = 1 なら、最小値を求めるクエリーを表す。このとき、l = yi , r = zi とする。\n\nxi = 2 なら、値を更新するクエリーを表す。このとき、pos = yi , val = zi とする。\n\n入力は以下の制約を満たす\n\n1 ≤ n , q ≤ 200,000\n\n0 ≤ ai ≤ 10,000,000\n\n値を更新するクエリーについて、0 ≤ val ≤ 10,000,000\n\nOutput\n\nクエリーとしてxi = 1 が与えられたときに、答えの値を１行に出力せよ。\n\nSample Input 1\n\n10 3\n0\n1\n2\n3\n4\n5\n6\n7\n8\n9\n1 5 7\n0 2 5\n1 5 7\n\nSample Output 1\n\n5\n4\n\nSample Input 2\n\n10 10\n289383\n930886\n692777\n636915\n747793\n238335\n885386\n760492\n516649\n641421\n2 7 368690\n1 3 6\n0 2 6\n1 1 8\n0 2 9\n2 2 665123\n1 5 9\n0 2 8\n2 7 961393\n1 1 2\n\nSample Output 2\n\n238335\n238335\n238335\n368690", "sample_input": "10 3\n0\n1\n2\n3\n4\n5\n6\n7\n8\n9\n1 5 7\n0 2 5\n1 5 7\n"}, "reference_outputs": ["5\n4\n"], "source_document_id": "p00998", "source_text": "Problem I : RMQ\n\nn 個の数字a0 ,a1 , ... ,an-1 とq が与えられる。\n\nq 個のクエリーに対して適切な処理を行なって欲しい。\n\nクエリーは以下の3種類の操作が存在する。\n\n値のシフトを行う\n\nl とr のペアが与えられる。(l < r )\nal から ar までの値を Circular Shiftさせる。\n\n0 1 2 3 4 5 6 7 8 9\n\nに対してl=2,r=5というクエリーが与えられたとする。\n\nシフトを行った数字列は\n\n0 1 5 2 3 4 6 7 8 9\n\nとなる。\n\n最小値を求める\n\nl とr のペアが与えられる。(l ≤ r )\n\nal から arまでの値の中で最小の値を求める。\n\n値の更新\n\npos と val のペアが与えられる。\napos の値を val に更新する。\n\nInput\n\n入力は以下のフォーマットで与えられる。\n\nn q\na0\na1\n.\n.\n.\nan-1\nx1 y1 z1\nx2 y2 z2\n.\n.\n.\nxq yq zq\n\nxi = 0 なら、シフトのクエリーを表す。このとき、l = yi , r = zi とする。\n\nxi = 1 なら、最小値を求めるクエリーを表す。このとき、l = yi , r = zi とする。\n\nxi = 2 なら、値を更新するクエリーを表す。このとき、pos = yi , val = zi とする。\n\n入力は以下の制約を満たす\n\n1 ≤ n , q ≤ 200,000\n\n0 ≤ ai ≤ 10,000,000\n\n値を更新するクエリーについて、0 ≤ val ≤ 10,000,000\n\nOutput\n\nクエリーとしてxi = 1 が与えられたときに、答えの値を１行に出力せよ。\n\nSample Input 1\n\n10 3\n0\n1\n2\n3\n4\n5\n6\n7\n8\n9\n1 5 7\n0 2 5\n1 5 7\n\nSample Output 1\n\n5\n4\n\nSample Input 2\n\n10 10\n289383\n930886\n692777\n636915\n747793\n238335\n885386\n760492\n516649\n641421\n2 7 368690\n1 3 6\n0 2 6\n1 1 8\n0 2 9\n2 2 665123\n1 5 9\n0 2 8\n2 7 961393\n1 1 2\n\nSample Output 2\n\n238335\n238335\n238335\n368690", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 946, "cpu_time_ms": 9510, "memory_kb": 1004}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s645657673", "group_id": "codeNet:p01009", "input_text": "// AOJ 1519: Room of Time and Spirit\n// 2017.12.3 bal4u@uu\n\n#include <stdio.h>\n#include <string.h>\n\n// <????????????Union Find>\n#define MAX 100003\n\nint power[MAX];\nint par[MAX], ws[MAX];\n\nint find(int x)\n{\n\tint p;\n\tif (par[x] < 0) return x;\n    p = find(par[x]), ws[x] += ws[par[x]];\n    return par[x] = p;\n}\n    \nint weight(int x)\n{\n    find(x); \n    return ws[x];\n}\n    \nint unite(int x, int y, int w)  // x <-(w)- y (x + w = y)\n{\n\tint tmp;\n\n//  w += weight(x), w -= weight(y);\n    w += power[x] + weight(x), w -= power[y] + weight(y);\n    x = find(x), y = find(y);\n    if (x == y) return 0;\n    if (par[y] < par[x]) // ???????????????????????????????????????????????????.\n        tmp = x, x = y, y = tmp, w = -w;\n    \n    par[x] += par[y], par[y] = x;\n    ws[y] = w;\n    return 1;\n}\n    \nint same(int x, int y)\n{\n\treturn find(x) == find(y);\n}\n\n// *ans = x - y. ?????????????????? return 0.\nint diff(int *ans, int x, int y)\n{\n    if (find(x) != find(y)) return 0;\n\t*ans = ws[x] - ws[y];\n\treturn 1;\n}\n// </????????????Union Find>\n\n\nchar buf[40], *p;\nint getint()\n{\n\tint n = 0;\n\twhile (*p >= '0') n = (n<<3) + (n<<1) + (*p++ & 0xf);\n\tp++;\n\treturn n;\n}\n\nint main()\n{\n\tint n, q, a, b, c;\n\n\tfgets(p=buf, 40, stdin);\n\tn = getint(), q = getint();\n\tmemset(par, 0xff, (n+1)*sizeof(int));\n\n\twhile (q--) {\n\t\tfgets(p=buf, 40, stdin);\n\t\tif (*p == 'I') {\n\t\t\tp += 3, a = getint(), b = getint(), c = getint();\n\t\t\tpower[a] += c, power[b] += c;\n\t\t\tunite(a, b, c);\n\t\t} else {\n\t\t\tp += 8, a = getint(), b = getint();\n\t\t\tif (find(a) != find(b)) puts(\"WARNING\");\n\t\t\telse printf(\"%d\\n\", (power[b]+ws[b]) - (power[a]+ws[a]));\n\t\t}\n\t}\n\treturn 0;\n}", "language": "C", "metadata": {"date": 1512301536, "filename_ext": "c", "original_language": "C", "problem_description_relpath": "problem_descriptions/p01009.html", "problem_id": "p01009", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p01009/input.txt", "sample_output_relpath": "derived/input_output/data/p01009/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p01009/C/s645657673.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s645657673", "user_id": "u847467233"}, "prompt_components": {"gold_output": "WARNING\n3\n11\n", "input_to_evaluate": "// AOJ 1519: Room of Time and Spirit\n// 2017.12.3 bal4u@uu\n\n#include <stdio.h>\n#include <string.h>\n\n// <????????????Union Find>\n#define MAX 100003\n\nint power[MAX];\nint par[MAX], ws[MAX];\n\nint find(int x)\n{\n\tint p;\n\tif (par[x] < 0) return x;\n    p = find(par[x]), ws[x] += ws[par[x]];\n    return par[x] = p;\n}\n    \nint weight(int x)\n{\n    find(x); \n    return ws[x];\n}\n    \nint unite(int x, int y, int w)  // x <-(w)- y (x + w = y)\n{\n\tint tmp;\n\n//  w += weight(x), w -= weight(y);\n    w += power[x] + weight(x), w -= power[y] + weight(y);\n    x = find(x), y = find(y);\n    if (x == y) return 0;\n    if (par[y] < par[x]) // ???????????????????????????????????????????????????.\n        tmp = x, x = y, y = tmp, w = -w;\n    \n    par[x] += par[y], par[y] = x;\n    ws[y] = w;\n    return 1;\n}\n    \nint same(int x, int y)\n{\n\treturn find(x) == find(y);\n}\n\n// *ans = x - y. ?????????????????? return 0.\nint diff(int *ans, int x, int y)\n{\n    if (find(x) != find(y)) return 0;\n\t*ans = ws[x] - ws[y];\n\treturn 1;\n}\n// </????????????Union Find>\n\n\nchar buf[40], *p;\nint getint()\n{\n\tint n = 0;\n\twhile (*p >= '0') n = (n<<3) + (n<<1) + (*p++ & 0xf);\n\tp++;\n\treturn n;\n}\n\nint main()\n{\n\tint n, q, a, b, c;\n\n\tfgets(p=buf, 40, stdin);\n\tn = getint(), q = getint();\n\tmemset(par, 0xff, (n+1)*sizeof(int));\n\n\twhile (q--) {\n\t\tfgets(p=buf, 40, stdin);\n\t\tif (*p == 'I') {\n\t\t\tp += 3, a = getint(), b = getint(), c = getint();\n\t\t\tpower[a] += c, power[b] += c;\n\t\t\tunite(a, b, c);\n\t\t} else {\n\t\t\tp += 8, a = getint(), b = getint();\n\t\t\tif (find(a) != find(b)) puts(\"WARNING\");\n\t\t\telse printf(\"%d\\n\", (power[b]+ws[b]) - (power[a]+ws[a]));\n\t\t}\n\t}\n\treturn 0;\n}", "problem_context": "Problem D: Room of Time and Spirit\n\nProblem\n\n　20XX年、とある科学者がバイオテクノロジーによって強力な人造人間を開発してしまった。この人造人間はコンピュータにより、戦闘の達人たちの細胞を組み合わせて作られているため非常に強力である。\n\n　このままでは地球は人造人間に支配されてしまうので、 N 人の戦士たちは人造人間と戦うことにした。しかし今の戦士たちでは到底人造人間に敵わないため、修行をしなければならない。また、N 人の戦士たちはそれぞれ 1 ~ N の番号が付いている。\n\n　この時代、天空都市AIZUには SRLU室と呼ばれる修行のための特殊な部屋が存在した。この部屋での1年は外界の時間の1日と同じであるため、短期間で戦闘力を大幅に上昇することが出来る。同時に部屋に入れる人数の上限は2人である。また、その2人が部屋に入った時、それぞれ戦闘力が上昇する。\n\n　戦士たちは残された時間でどのように部屋に入るか検討するため、あなたに以下のクエリを処理するプログラムの作成を依頼した。\n\n　与えられるクエリは以下の通りである。\n\n　また以下の説明で出てくる A, B はそれぞれ戦士の番号を表す。A と B が等しい事は無い。\n\nIN A B C\n\n　A と B が部屋に入り、それぞれ C だけ戦闘力が上昇する。この時、(部屋に入る直前の B の戦闘力) - (部屋に入る直前の A の戦闘力) = C が成り立つ。また、この時 B の戦闘力は A の戦闘力より高い事が保証される。\n\nCOMPARE A B\n\n　A と B の戦闘力の差 (現在の B の戦闘力) - (現在の A の戦闘力)を出力する。もしその差が特定出来なければ、WARNING と出力せよ。\n\nInput\n\nN Q\nquery1\n.\n.\n.\nqueryQ\n\n最初に戦士の人数 N , クエリの数 Q が与えられる。\n\n次に Q 回だけクエリが与えられる。\n\nConstraints\n\n入力は以下の条件を満たす。\n\n2 ≤ N ≤ 100000\n\n1 ≤ Q ≤ 100000\n\n1 ≤ A, B ≤ N\n\n1 ≤ C ≤ 5000\n\nOutput\n\n上記のように与えられたクエリを順番に処理していき、 COMPAREの入力が与えられた際に出力を行う。\n\nSample Input1\n\n3 5\nCOMPARE 1 2\nIN 1 2 5\nIN 2 3 3\nCOMPARE 2 3\nCOMPARE 1 3\n\nSample Output1\n\nWARNING\n3\n11\n\nSample Input2\n\n4 3\nIN 1 4 10\nIN 2 3 20\nCOMPARE 1 2\n\nSample Output2\n\nWARNING\n\nSample Input3\n\n3 4\nIN 2 1 2\nIN 3 1 2\nCOMPARE 1 3\nCOMPARE 2 3\n\nSample Output3\n\n-2\n2\n\nSample Input4\n\n10 4\nIN 10 8 2328\nIN 8 4 3765\nIN 3 8 574\nCOMPARE 4 8\n\nSample Output4\n\n-3191\n\nSample Input5\n\n3 5\nIN 1 2 5\nIN 1 2 5\nIN 2 3 10\nCOMPARE 1 2\nCOMPARE 2 3\n\nSample Output5\n\n15\n10", "sample_input": "3 5\nCOMPARE 1 2\nIN 1 2 5\nIN 2 3 3\nCOMPARE 2 3\nCOMPARE 1 3\n"}, "reference_outputs": ["WARNING\n3\n11\n"], "source_document_id": "p01009", "source_text": "Problem D: Room of Time and Spirit\n\nProblem\n\n　20XX年、とある科学者がバイオテクノロジーによって強力な人造人間を開発してしまった。この人造人間はコンピュータにより、戦闘の達人たちの細胞を組み合わせて作られているため非常に強力である。\n\n　このままでは地球は人造人間に支配されてしまうので、 N 人の戦士たちは人造人間と戦うことにした。しかし今の戦士たちでは到底人造人間に敵わないため、修行をしなければならない。また、N 人の戦士たちはそれぞれ 1 ~ N の番号が付いている。\n\n　この時代、天空都市AIZUには SRLU室と呼ばれる修行のための特殊な部屋が存在した。この部屋での1年は外界の時間の1日と同じであるため、短期間で戦闘力を大幅に上昇することが出来る。同時に部屋に入れる人数の上限は2人である。また、その2人が部屋に入った時、それぞれ戦闘力が上昇する。\n\n　戦士たちは残された時間でどのように部屋に入るか検討するため、あなたに以下のクエリを処理するプログラムの作成を依頼した。\n\n　与えられるクエリは以下の通りである。\n\n　また以下の説明で出てくる A, B はそれぞれ戦士の番号を表す。A と B が等しい事は無い。\n\nIN A B C\n\n　A と B が部屋に入り、それぞれ C だけ戦闘力が上昇する。この時、(部屋に入る直前の B の戦闘力) - (部屋に入る直前の A の戦闘力) = C が成り立つ。また、この時 B の戦闘力は A の戦闘力より高い事が保証される。\n\nCOMPARE A B\n\n　A と B の戦闘力の差 (現在の B の戦闘力) - (現在の A の戦闘力)を出力する。もしその差が特定出来なければ、WARNING と出力せよ。\n\nInput\n\nN Q\nquery1\n.\n.\n.\nqueryQ\n\n最初に戦士の人数 N , クエリの数 Q が与えられる。\n\n次に Q 回だけクエリが与えられる。\n\nConstraints\n\n入力は以下の条件を満たす。\n\n2 ≤ N ≤ 100000\n\n1 ≤ Q ≤ 100000\n\n1 ≤ A, B ≤ N\n\n1 ≤ C ≤ 5000\n\nOutput\n\n上記のように与えられたクエリを順番に処理していき、 COMPAREの入力が与えられた際に出力を行う。\n\nSample Input1\n\n3 5\nCOMPARE 1 2\nIN 1 2 5\nIN 2 3 3\nCOMPARE 2 3\nCOMPARE 1 3\n\nSample Output1\n\nWARNING\n3\n11\n\nSample Input2\n\n4 3\nIN 1 4 10\nIN 2 3 20\nCOMPARE 1 2\n\nSample Output2\n\nWARNING\n\nSample Input3\n\n3 4\nIN 2 1 2\nIN 3 1 2\nCOMPARE 1 3\nCOMPARE 2 3\n\nSample Output3\n\n-2\n2\n\nSample Input4\n\n10 4\nIN 10 8 2328\nIN 8 4 3765\nIN 3 8 574\nCOMPARE 4 8\n\nSample Output4\n\n-3191\n\nSample Input5\n\n3 5\nIN 1 2 5\nIN 1 2 5\nIN 2 3 10\nCOMPARE 1 2\nCOMPARE 2 3\n\nSample Output5\n\n15\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": 1622, "cpu_time_ms": 10, "memory_kb": 2848}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s206931018", "group_id": "codeNet:p01136", "input_text": "/*\nAizuOnline A2011\nGather the Maps!\n*/\n#include <stdio.h>\n\nint sked[50][30];\nint ok_days[50];\nint flag[50];\nint N;\n\nvoid init()\n{\n  int i,j;\n  for(i=0;i<50;i++)\n    {\n      ok_days[i]=0;\n      flag[i]=0;\n      for(j=0;j<30;j++)\n\tsked[i][j]=0;\n    }\n}\nprint()\n{\n  int i,j;\n\n  for(i=0;i<N;i++)\n    {\n      printf(\"%d \",ok_days[i]);\n      for(j=0;j<ok_days[i];j++)\n\tprintf(\"%d \",sked[i][j]);\n      printf(\"(%d)\",flag[i]);\n      printf(\"\\n\");\n    }\n}\n\nvoid update_meet(int md,int nd)\n{\n  int i;\n\n  for(i=0;i<N;i++)\n    if(flag[i]==md)\n      flag[i]=nd;\n}\n\nvoid can_meet(int d1)\n{\n  int i,j;\n  //printf(\"CM:%d %d \\n\",d,d1);\n\n  for(i=0;i<N;i++)\n    for(j=0;j<ok_days[i];j++)\n      if(sked[i][j] == d1)\n\t{\n\t  if(flag[i] == 0)\n\t    flag[i] = d1;\n\t  else if(flag[i] < d1)\n\t    update_meet(flag[i],d1);\n\t}\n}\n\n\n\n\nint all_meet(int d)\n{\n  int i;\n  for(i=0;i<N;i++)\n    if(flag[i]!=d)\n      return(0);\n  return(1);\n}\nmain()\n{\n  int i,j,d;\n  while(EOF != scanf(\"%d\",&N) && N)\n    {\n      init();\n      for(i=0;i<N;i++)\n\t{\n\t  scanf(\"%d\",&(ok_days[i]));\n\t  for(j=0;j<ok_days[i];j++)\n\t    scanf(\"%d\",&(sked[i][j]));\n\t}\n      if(N==1)\n\t{\n\t  printf(\"%d\\n\",1);\n\t  continue;\n\t}\n      for(d=1;d<=30;d++)\n\t{\n\t  can_meet(d);\n\t  //print();\n\t  if(all_meet(d))\n\t    { // printf(\"ALL MEET\\n\");\n\t      printf(\"%d\\n\",d);\n\t      //fflush(stdout);\n\t      goto NEXT;\n\t    }\n\t}\n      printf(\"%d\\n\",-1);\n    NEXT: ;\n    }\nreturn(0);\n}", "language": "C", "metadata": {"date": 1361197096, "filename_ext": "c", "original_language": "C", "problem_description_relpath": "problem_descriptions/p01136.html", "problem_id": "p01136", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p01136/input.txt", "sample_output_relpath": "derived/input_output/data/p01136/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p01136/C/s206931018.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s206931018", "user_id": "u708993917"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "/*\nAizuOnline A2011\nGather the Maps!\n*/\n#include <stdio.h>\n\nint sked[50][30];\nint ok_days[50];\nint flag[50];\nint N;\n\nvoid init()\n{\n  int i,j;\n  for(i=0;i<50;i++)\n    {\n      ok_days[i]=0;\n      flag[i]=0;\n      for(j=0;j<30;j++)\n\tsked[i][j]=0;\n    }\n}\nprint()\n{\n  int i,j;\n\n  for(i=0;i<N;i++)\n    {\n      printf(\"%d \",ok_days[i]);\n      for(j=0;j<ok_days[i];j++)\n\tprintf(\"%d \",sked[i][j]);\n      printf(\"(%d)\",flag[i]);\n      printf(\"\\n\");\n    }\n}\n\nvoid update_meet(int md,int nd)\n{\n  int i;\n\n  for(i=0;i<N;i++)\n    if(flag[i]==md)\n      flag[i]=nd;\n}\n\nvoid can_meet(int d1)\n{\n  int i,j;\n  //printf(\"CM:%d %d \\n\",d,d1);\n\n  for(i=0;i<N;i++)\n    for(j=0;j<ok_days[i];j++)\n      if(sked[i][j] == d1)\n\t{\n\t  if(flag[i] == 0)\n\t    flag[i] = d1;\n\t  else if(flag[i] < d1)\n\t    update_meet(flag[i],d1);\n\t}\n}\n\n\n\n\nint all_meet(int d)\n{\n  int i;\n  for(i=0;i<N;i++)\n    if(flag[i]!=d)\n      return(0);\n  return(1);\n}\nmain()\n{\n  int i,j,d;\n  while(EOF != scanf(\"%d\",&N) && N)\n    {\n      init();\n      for(i=0;i<N;i++)\n\t{\n\t  scanf(\"%d\",&(ok_days[i]));\n\t  for(j=0;j<ok_days[i];j++)\n\t    scanf(\"%d\",&(sked[i][j]));\n\t}\n      if(N==1)\n\t{\n\t  printf(\"%d\\n\",1);\n\t  continue;\n\t}\n      for(d=1;d<=30;d++)\n\t{\n\t  can_meet(d);\n\t  //print();\n\t  if(all_meet(d))\n\t    { // printf(\"ALL MEET\\n\");\n\t      printf(\"%d\\n\",d);\n\t      //fflush(stdout);\n\t      goto NEXT;\n\t    }\n\t}\n      printf(\"%d\\n\",-1);\n    NEXT: ;\n    }\nreturn(0);\n}", "problem_context": "Problem F: Gather the Maps!\n\nはるか昔、八尾氏が残したとされる伝説の秘宝が八王子のどこかに眠っているという。 その在処を示すとされる宝の地図は、いくつかの断片に分割された状態で、八尾氏の n 人の子孫達によって受け継がれている。\n\n今、八尾氏の子孫達は協力してその秘宝を手に入れようとしていた。 ところが、秘宝の在処を指し示す宝の地図の一部分だけでは秘宝を見つけることができない。 そこで、八尾氏の子孫達は全員で集まって地図を 1 ヶ所に集めようとした。\nところが、いざ実行に移そうとしてもなかなか予定が合わずに集まることができない。 しかしこの秘宝に関する情報は、一族において秘密裏に伝えられてきた貴重な情報である。 漏洩の危険性を考慮すると、公共の通信手段を用いて地図をやりとりすることなど問題外である。\n\nそこで、子孫同士が直接会って地図を手渡すということを繰り返すことで、ある 1 人の子孫のところに地図を集めることにした。\nなお、1 人が 1 日に会える人数に制限はないが、互いにスケジュールが空いていることが必要である。\n\nあなたの仕事は、それぞれの子孫に対するスケジュールの空いている日のリストから、地図を集めるには最低で何日必要かを求めるプログラムを書くことである。\n\nちなみに、八尾氏一族の結束は非常に固い。 最終的に地図全体を手にした子孫が、他の子孫を裏切って秘宝を持ち逃げすれば、一族から制裁を受けることになる。その制裁はきわめて恐ろしいものであるため、実際にその子孫が秘宝を持ち逃げすることは事実上不可能である。\n\nInput\n\n入力は複数のデータセットからなる。\n\nそれぞれのデータセットは複数の行からなる。 その最初の行には、地図の断片を持った者の人数を表す整数 n (1 < n <= 50) が記述されている。 続く n 行には、それぞれの子孫のスケジュールが書かれている。\ni 行目は i 人目の子孫のスケジュールが表しており、いくつかの整数が 1 文字のスペースを区切りとして書かれている。\n最初の整数 fi (0 <= fi <= 30) は、その子孫のスケジュールが空いている日の日数を表す整数である。 続く fi 個の整数は、スケジュールが空いている日付を表す。 これらの日付は互いに異なり、全て 1 以上 30 以下である。\n\n入力の最後に 0 のみを含んだ 1 行がある。\n\nOutput\n\n各データセットに対して、1 つの整数を 1 行に出力せよ。\nもし、30 日以内に地図を集めることができる場合は、地図を集めるのに最低限必要となる日数を、集めることができない場合は -1 を出力せよ。\n\n追記 :\n上記の「地図を集めるのに最低限必要となる日数」は 1 日を起点として最も早く全ての地図が集まる日付を意味する．\n\nSample Input\n\n4\n1 1\n2 2 3\n2 1 2\n3 3 4 5\n0\n\nOutput for the Sample Input\n\n3", "sample_input": "4\n1 1\n2 2 3\n2 1 2\n3 3 4 5\n0\n"}, "reference_outputs": ["3\n"], "source_document_id": "p01136", "source_text": "Problem F: Gather the Maps!\n\nはるか昔、八尾氏が残したとされる伝説の秘宝が八王子のどこかに眠っているという。 その在処を示すとされる宝の地図は、いくつかの断片に分割された状態で、八尾氏の n 人の子孫達によって受け継がれている。\n\n今、八尾氏の子孫達は協力してその秘宝を手に入れようとしていた。 ところが、秘宝の在処を指し示す宝の地図の一部分だけでは秘宝を見つけることができない。 そこで、八尾氏の子孫達は全員で集まって地図を 1 ヶ所に集めようとした。\nところが、いざ実行に移そうとしてもなかなか予定が合わずに集まることができない。 しかしこの秘宝に関する情報は、一族において秘密裏に伝えられてきた貴重な情報である。 漏洩の危険性を考慮すると、公共の通信手段を用いて地図をやりとりすることなど問題外である。\n\nそこで、子孫同士が直接会って地図を手渡すということを繰り返すことで、ある 1 人の子孫のところに地図を集めることにした。\nなお、1 人が 1 日に会える人数に制限はないが、互いにスケジュールが空いていることが必要である。\n\nあなたの仕事は、それぞれの子孫に対するスケジュールの空いている日のリストから、地図を集めるには最低で何日必要かを求めるプログラムを書くことである。\n\nちなみに、八尾氏一族の結束は非常に固い。 最終的に地図全体を手にした子孫が、他の子孫を裏切って秘宝を持ち逃げすれば、一族から制裁を受けることになる。その制裁はきわめて恐ろしいものであるため、実際にその子孫が秘宝を持ち逃げすることは事実上不可能である。\n\nInput\n\n入力は複数のデータセットからなる。\n\nそれぞれのデータセットは複数の行からなる。 その最初の行には、地図の断片を持った者の人数を表す整数 n (1 < n <= 50) が記述されている。 続く n 行には、それぞれの子孫のスケジュールが書かれている。\ni 行目は i 人目の子孫のスケジュールが表しており、いくつかの整数が 1 文字のスペースを区切りとして書かれている。\n最初の整数 fi (0 <= fi <= 30) は、その子孫のスケジュールが空いている日の日数を表す整数である。 続く fi 個の整数は、スケジュールが空いている日付を表す。 これらの日付は互いに異なり、全て 1 以上 30 以下である。\n\n入力の最後に 0 のみを含んだ 1 行がある。\n\nOutput\n\n各データセットに対して、1 つの整数を 1 行に出力せよ。\nもし、30 日以内に地図を集めることができる場合は、地図を集めるのに最低限必要となる日数を、集めることができない場合は -1 を出力せよ。\n\n追記 :\n上記の「地図を集めるのに最低限必要となる日数」は 1 日を起点として最も早く全ての地図が集まる日付を意味する．\n\nSample Input\n\n4\n1 1\n2 2 3\n2 1 2\n3 3 4 5\n0\n\nOutput for the Sample Input\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": 1399, "cpu_time_ms": 40, "memory_kb": 604}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s895153814", "group_id": "codeNet:p01209", "input_text": "#include<stdio.h>\n#include<string.h>\nunsigned long long m,a;\nint main(){\n  int i,j,n,min,d[50]={0};\n  char s[50],c[]={\"0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ\"};\n  while(scanf(\"%d %s\",&n,s),n){\n    j=n;\n    m=0;\n    for(i=0;i<40;i++)d[i]=0;\n    min=1000000000;\n    for(i=2;i<=j;i++){\n      while(j%i==0){\n\tj/=i;\n\td[i]++;\n      }\n    }//printf(\"a\\n\");\n    //for(i=0;i<n;i++)printf(\"%d %d\\n\",i,d[i]);\n    for(i=0;s[i];i++){\n      m*=n;\n      for(j=0;c[j]-s[i];j++);\n      m+=j;\n    }//printf(\"%d\\n\",m);\n    for(i=0;i<=n;i++){\n      if(d[i]==0)continue;\n      a=0;\n      for(j=i;j<=m;j*=i)a+=m/j;\n      a/=d[i];//printf(\"%d %lld\\n\",i,a);\n      if(min>a)min=a;\n    }\n  \n  printf(\"%lld\\n\",a);\n  }\n  return 0;\n}\n      ", "language": "C", "metadata": {"date": 1468237325, "filename_ext": "c", "original_language": "C", "problem_description_relpath": "problem_descriptions/p01209.html", "problem_id": "p01209", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p01209/input.txt", "sample_output_relpath": "derived/input_output/data/p01209/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p01209/C/s895153814.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s895153814", "user_id": "u731027244"}, "prompt_components": {"gold_output": "124\n2\n", "input_to_evaluate": "#include<stdio.h>\n#include<string.h>\nunsigned long long m,a;\nint main(){\n  int i,j,n,min,d[50]={0};\n  char s[50],c[]={\"0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ\"};\n  while(scanf(\"%d %s\",&n,s),n){\n    j=n;\n    m=0;\n    for(i=0;i<40;i++)d[i]=0;\n    min=1000000000;\n    for(i=2;i<=j;i++){\n      while(j%i==0){\n\tj/=i;\n\td[i]++;\n      }\n    }//printf(\"a\\n\");\n    //for(i=0;i<n;i++)printf(\"%d %d\\n\",i,d[i]);\n    for(i=0;s[i];i++){\n      m*=n;\n      for(j=0;c[j]-s[i];j++);\n      m+=j;\n    }//printf(\"%d\\n\",m);\n    for(i=0;i<=n;i++){\n      if(d[i]==0)continue;\n      a=0;\n      for(j=i;j<=m;j*=i)a+=m/j;\n      a/=d[i];//printf(\"%d %lld\\n\",i,a);\n      if(min>a)min=a;\n    }\n  \n  printf(\"%lld\\n\",a);\n  }\n  return 0;\n}\n      ", "problem_context": "Problem C: !\n\nYou are one of ICPC participants and in charge of developing a library for multiprecision numbers\nand radix conversion. You have just finished writing the code, so next you have to test if it\nworks correctly. You decided to write a simple, well-known factorial function for this purpose:\n\nYour task is to write a program that shows the number of trailing zeros when you compute M!\nin base N, given N and M.\n\nInput\n\nThe input contains multiple data sets. Each data set is described by one line in the format\nbelow:\n\nN M\n\nwhere N is a decimal number between 8 and 36 inclusive, and M is given in the string repre-\nsentation in base N. Exactly one white space character appears between them.\n\nThe string representation of M contains up to 12 characters in base N. In case N is greater\nthan 10, capital letters A, B, C, ... may appear in the string representation, and they represent\n10, 11, 12, ..., respectively.\n\nThe input is terminated by a line containing two zeros. You should not process this line.\n\nOutput\n\nFor each data set, output a line containing a decimal integer, which is equal to the number of\ntrailing zeros in the string representation of M! in base N.\n\nSample Input\n\n10 500\n16 A\n0 0\n\nOutput for the Sample Input\n\n124\n2", "sample_input": "10 500\n16 A\n0 0\n"}, "reference_outputs": ["124\n2\n"], "source_document_id": "p01209", "source_text": "Problem C: !\n\nYou are one of ICPC participants and in charge of developing a library for multiprecision numbers\nand radix conversion. You have just finished writing the code, so next you have to test if it\nworks correctly. You decided to write a simple, well-known factorial function for this purpose:\n\nYour task is to write a program that shows the number of trailing zeros when you compute M!\nin base N, given N and M.\n\nInput\n\nThe input contains multiple data sets. Each data set is described by one line in the format\nbelow:\n\nN M\n\nwhere N is a decimal number between 8 and 36 inclusive, and M is given in the string repre-\nsentation in base N. Exactly one white space character appears between them.\n\nThe string representation of M contains up to 12 characters in base N. In case N is greater\nthan 10, capital letters A, B, C, ... may appear in the string representation, and they represent\n10, 11, 12, ..., respectively.\n\nThe input is terminated by a line containing two zeros. You should not process this line.\n\nOutput\n\nFor each data set, output a line containing a decimal integer, which is equal to the number of\ntrailing zeros in the string representation of M! in base N.\n\nSample Input\n\n10 500\n16 A\n0 0\n\nOutput for the Sample Input\n\n124\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": 709, "cpu_time_ms": 10, "memory_kb": 604}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s377692742", "group_id": "codeNet:p01283", "input_text": "o[256],z[257];main(N,S,A,C,s,a,c,r,i){for(;scanf(\"%d\",&N),N;printf(\"%d %d %d\\n\",S,A,C)){\n\tdouble H=999999999,h,n=N;\n\tfor(i=1;i<=N;i++)scanf(\"%d\",z+i);\n\tfor(s=0;s<16;s++)for(a=0;a<16;a++)for(c=0;c<16;c++){\n\t\tfor(r=s,h=0,i=1;i<=N;i++)o[(z[i]+(r=(a*r+c)%256))%256]++;\n\t\tfor(i=0;i<256;i++)if(o[i])h-=o[i]/n*log(o[i]/n),o[i]=0;\n\t\tif(h+1e-9<H)H=h,S=s,A=a,C=c;\n\t}\n}exit(0);}", "language": "C", "metadata": {"date": 1363776185, "filename_ext": "c", "original_language": "C", "problem_description_relpath": "problem_descriptions/p01283.html", "problem_id": "p01283", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p01283/input.txt", "sample_output_relpath": "derived/input_output/data/p01283/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p01283/C/s377692742.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s377692742", "user_id": "u300645821"}, "prompt_components": {"gold_output": "0 1 1\n0 0 0\n8 7 14\n", "input_to_evaluate": "o[256],z[257];main(N,S,A,C,s,a,c,r,i){for(;scanf(\"%d\",&N),N;printf(\"%d %d %d\\n\",S,A,C)){\n\tdouble H=999999999,h,n=N;\n\tfor(i=1;i<=N;i++)scanf(\"%d\",z+i);\n\tfor(s=0;s<16;s++)for(a=0;a<16;a++)for(c=0;c<16;c++){\n\t\tfor(r=s,h=0,i=1;i<=N;i++)o[(z[i]+(r=(a*r+c)%256))%256]++;\n\t\tfor(i=0;i<256;i++)if(o[i])h-=o[i]/n*log(o[i]/n),o[i]=0;\n\t\tif(h+1e-9<H)H=h,S=s,A=a,C=c;\n\t}\n}exit(0);}", "problem_context": "Problem A: Strange String Manipulation\n\nA linear congruential generator produces a series R(⋅) of pseudo-random numbers by the following for-\nmulas:\n\nwhere S, A, C, and M are all parameters. In this problem, 0 ≤ S, A, C ≤ 15 and M = 256.\n\nNow suppose we have some input string I(⋅), where each character in the string is an integer between 0\nand (M - 1). Then, using the pseudo-random number series R(⋅), we obtain another string O(⋅) as the\noutput by the following formula:\n\nYour task is to write a program that shows the parameters S, A, and C such that the information entropy of the output string O(⋅) is minimized. Here, the information entropy H is given by the following formula:\n\nwhere N is the length of the string and #(x) is the number of occurences of the alphabet x.\n\nInput\n\nThe input consists of multiple datasets. Each dataset has the following format:\n\nN\n\nI(1) I(2) ... I(N)\n\nN does not exceed 256.\n\nThe last dataset is followed by a line containing one zero. This line is not a part of any dataset and should not be processed.\n\nOutput\n\nFor each dataset, print in a line the values of the three parameters S, A, and C separated by a single space. If more than one solution gives the same minimum entropy, choose the solution with the smallest S, A, and then C.\n\nSample Input\n\n5\n5 4 3 2 1\n5\n7 7 7 7 7\n10\n186 8 42 24 154 40 10 56 122 72\n0\n\nOutput for the Sample Input\n\n0 1 1\n0 0 0\n8 7 14", "sample_input": "5\n5 4 3 2 1\n5\n7 7 7 7 7\n10\n186 8 42 24 154 40 10 56 122 72\n0\n"}, "reference_outputs": ["0 1 1\n0 0 0\n8 7 14\n"], "source_document_id": "p01283", "source_text": "Problem A: Strange String Manipulation\n\nA linear congruential generator produces a series R(⋅) of pseudo-random numbers by the following for-\nmulas:\n\nwhere S, A, C, and M are all parameters. In this problem, 0 ≤ S, A, C ≤ 15 and M = 256.\n\nNow suppose we have some input string I(⋅), where each character in the string is an integer between 0\nand (M - 1). Then, using the pseudo-random number series R(⋅), we obtain another string O(⋅) as the\noutput by the following formula:\n\nYour task is to write a program that shows the parameters S, A, and C such that the information entropy of the output string O(⋅) is minimized. Here, the information entropy H is given by the following formula:\n\nwhere N is the length of the string and #(x) is the number of occurences of the alphabet x.\n\nInput\n\nThe input consists of multiple datasets. Each dataset has the following format:\n\nN\n\nI(1) I(2) ... I(N)\n\nN does not exceed 256.\n\nThe last dataset is followed by a line containing one zero. This line is not a part of any dataset and should not be processed.\n\nOutput\n\nFor each dataset, print in a line the values of the three parameters S, A, and C separated by a single space. If more than one solution gives the same minimum entropy, choose the solution with the smallest S, A, and then C.\n\nSample Input\n\n5\n5 4 3 2 1\n5\n7 7 7 7 7\n10\n186 8 42 24 154 40 10 56 122 72\n0\n\nOutput for the Sample Input\n\n0 1 1\n0 0 0\n8 7 14", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 367, "cpu_time_ms": 410, "memory_kb": 636}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s617884239", "group_id": "codeNet:p01283", "input_text": "o[256],z[257];main(N,S,A,C,s,a,c,r,i){for(;scanf(\"%d\",&N),N;printf(\"%d %d %d\\n\",S,A,C)){\n\tdouble H,h,n=N;\n\tfor(H=i=1;i<=N;i++)scanf(\"%d\",z+i);\n\tfor(s=0;s<16;s++)for(a=0;a<16;a++)for(c=0;c<16;c++){\n\t\tfor(r=s,h=0,i=1;i<=N;i++)o[(z[i]+(r=(a*r+c)%256))%256]++;\n\t\tfor(i=0;i<256;i++)if(o[i])h-=o[i]/n*log(o[i]/n),o[i]=0;\n\t\tif(h+1e-9<H)H=h,S=s,A=a,C=c;\n\t}\n}exit(0);}", "language": "C", "metadata": {"date": 1363776295, "filename_ext": "c", "original_language": "C", "problem_description_relpath": "problem_descriptions/p01283.html", "problem_id": "p01283", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p01283/input.txt", "sample_output_relpath": "derived/input_output/data/p01283/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p01283/C/s617884239.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s617884239", "user_id": "u300645821"}, "prompt_components": {"gold_output": "0 1 1\n0 0 0\n8 7 14\n", "input_to_evaluate": "o[256],z[257];main(N,S,A,C,s,a,c,r,i){for(;scanf(\"%d\",&N),N;printf(\"%d %d %d\\n\",S,A,C)){\n\tdouble H,h,n=N;\n\tfor(H=i=1;i<=N;i++)scanf(\"%d\",z+i);\n\tfor(s=0;s<16;s++)for(a=0;a<16;a++)for(c=0;c<16;c++){\n\t\tfor(r=s,h=0,i=1;i<=N;i++)o[(z[i]+(r=(a*r+c)%256))%256]++;\n\t\tfor(i=0;i<256;i++)if(o[i])h-=o[i]/n*log(o[i]/n),o[i]=0;\n\t\tif(h+1e-9<H)H=h,S=s,A=a,C=c;\n\t}\n}exit(0);}", "problem_context": "Problem A: Strange String Manipulation\n\nA linear congruential generator produces a series R(⋅) of pseudo-random numbers by the following for-\nmulas:\n\nwhere S, A, C, and M are all parameters. In this problem, 0 ≤ S, A, C ≤ 15 and M = 256.\n\nNow suppose we have some input string I(⋅), where each character in the string is an integer between 0\nand (M - 1). Then, using the pseudo-random number series R(⋅), we obtain another string O(⋅) as the\noutput by the following formula:\n\nYour task is to write a program that shows the parameters S, A, and C such that the information entropy of the output string O(⋅) is minimized. Here, the information entropy H is given by the following formula:\n\nwhere N is the length of the string and #(x) is the number of occurences of the alphabet x.\n\nInput\n\nThe input consists of multiple datasets. Each dataset has the following format:\n\nN\n\nI(1) I(2) ... I(N)\n\nN does not exceed 256.\n\nThe last dataset is followed by a line containing one zero. This line is not a part of any dataset and should not be processed.\n\nOutput\n\nFor each dataset, print in a line the values of the three parameters S, A, and C separated by a single space. If more than one solution gives the same minimum entropy, choose the solution with the smallest S, A, and then C.\n\nSample Input\n\n5\n5 4 3 2 1\n5\n7 7 7 7 7\n10\n186 8 42 24 154 40 10 56 122 72\n0\n\nOutput for the Sample Input\n\n0 1 1\n0 0 0\n8 7 14", "sample_input": "5\n5 4 3 2 1\n5\n7 7 7 7 7\n10\n186 8 42 24 154 40 10 56 122 72\n0\n"}, "reference_outputs": ["0 1 1\n0 0 0\n8 7 14\n"], "source_document_id": "p01283", "source_text": "Problem A: Strange String Manipulation\n\nA linear congruential generator produces a series R(⋅) of pseudo-random numbers by the following for-\nmulas:\n\nwhere S, A, C, and M are all parameters. In this problem, 0 ≤ S, A, C ≤ 15 and M = 256.\n\nNow suppose we have some input string I(⋅), where each character in the string is an integer between 0\nand (M - 1). Then, using the pseudo-random number series R(⋅), we obtain another string O(⋅) as the\noutput by the following formula:\n\nYour task is to write a program that shows the parameters S, A, and C such that the information entropy of the output string O(⋅) is minimized. Here, the information entropy H is given by the following formula:\n\nwhere N is the length of the string and #(x) is the number of occurences of the alphabet x.\n\nInput\n\nThe input consists of multiple datasets. Each dataset has the following format:\n\nN\n\nI(1) I(2) ... I(N)\n\nN does not exceed 256.\n\nThe last dataset is followed by a line containing one zero. This line is not a part of any dataset and should not be processed.\n\nOutput\n\nFor each dataset, print in a line the values of the three parameters S, A, and C separated by a single space. If more than one solution gives the same minimum entropy, choose the solution with the smallest S, A, and then C.\n\nSample Input\n\n5\n5 4 3 2 1\n5\n7 7 7 7 7\n10\n186 8 42 24 154 40 10 56 122 72\n0\n\nOutput for the Sample Input\n\n0 1 1\n0 0 0\n8 7 14", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 420, "memory_kb": 640}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s453445433", "group_id": "codeNet:p01300", "input_text": "#include <stdio.h>\n#include <string.h>\n\nint dp[80001][11];//[i][mod]\nint ans[11];\nint main() {\n\tchar str[80001];\n\twhile (1) {\n\t\tfor (int i = 0; i < 80001; i++) {\n\t\t\tfor (int j = 0; j < 11; j++) {\n\t\t\t\tdp[i][j] = 0;\n\t\t\t}\n\t\t}\n\t\tfor (int i = 0; i < 11; i++) {\n\t\t\tans[i] = 0;\n\t\t}\n\t\tscanf(\"%s\", str);\n\t\tif (strcmp(str, \"0\")==0)break;\n\t\tint length = strlen(str);\n\t\tdp[1][str[0] - '0']++;\n\t\tfor (int i = 2; i <= length; i++) {\n\t\t\tint digit = str[i - 1] - '0';\n\t\t\tfor (int mod = 0; mod <= 10; mod++) {\n\t\t\t\tdp[i][((mod * 10) + digit) % 11] = dp[i - 1][mod];\n\t\t\t}\n\t\t\tif(digit!=0)dp[i][digit]++;\n\t\t\t\n\t\t\tfor (int mod = 0; mod <= 10; mod++) {\n\t\t\t\tans[mod] += dp[i][mod];\n\t\t\t}\n\t\t}\n\t\tprintf(\"%d\\n\", ans[0]);\n\t}\n\treturn 0;\n}\n", "language": "C", "metadata": {"date": 1558184991, "filename_ext": "c", "original_language": "C", "problem_description_relpath": "problem_descriptions/p01300.html", "problem_id": "p01300", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p01300/input.txt", "sample_output_relpath": "derived/input_output/data/p01300/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p01300/C/s453445433.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s453445433", "user_id": "u873105409"}, "prompt_components": {"gold_output": "1\n4\n4\n38\n", "input_to_evaluate": "#include <stdio.h>\n#include <string.h>\n\nint dp[80001][11];//[i][mod]\nint ans[11];\nint main() {\n\tchar str[80001];\n\twhile (1) {\n\t\tfor (int i = 0; i < 80001; i++) {\n\t\t\tfor (int j = 0; j < 11; j++) {\n\t\t\t\tdp[i][j] = 0;\n\t\t\t}\n\t\t}\n\t\tfor (int i = 0; i < 11; i++) {\n\t\t\tans[i] = 0;\n\t\t}\n\t\tscanf(\"%s\", str);\n\t\tif (strcmp(str, \"0\")==0)break;\n\t\tint length = strlen(str);\n\t\tdp[1][str[0] - '0']++;\n\t\tfor (int i = 2; i <= length; i++) {\n\t\t\tint digit = str[i - 1] - '0';\n\t\t\tfor (int mod = 0; mod <= 10; mod++) {\n\t\t\t\tdp[i][((mod * 10) + digit) % 11] = dp[i - 1][mod];\n\t\t\t}\n\t\t\tif(digit!=0)dp[i][digit]++;\n\t\t\t\n\t\t\tfor (int mod = 0; mod <= 10; mod++) {\n\t\t\t\tans[mod] += dp[i][mod];\n\t\t\t}\n\t\t}\n\t\tprintf(\"%d\\n\", ans[0]);\n\t}\n\treturn 0;\n}\n", "problem_context": "Problem H: Eleven Lover\n\nEdward Leven loves multiples of eleven very much. When he sees a number, he always tries\nto find consecutive subsequences (or substrings) forming multiples of eleven. He calls such\nsubsequences as 11-sequences. For example, he can find an 11-sequence 781 in a number 17819.\n\nHe thinks a number which has many 11-sequences is a good number. He would like to find out\na very good number. As the first step, he wants an easy way to count how many 11-sequences\nare there in a given number. Even for him, counting them from a big number is not easy.\nFortunately, one of his friends, you, is a brilliant programmer. He asks you to write a program\nto count the number of 11-sequences. Note that an 11-sequence must be a positive number\nwithout leading zeros.\n\nInput\n\nThe input is a sequence of lines each of which contains a number consisting of less than or equal\nto 80000 digits.\n\nThe end of the input is indicated by a line containing a single zero, which should not be processed.\n\nOutput\n\nFor each input number, output a line containing the number of 11-sequences.\n\nYou can assume the answer fits in a 32-bit signed integer.\n\nSample Input\n\n17819\n1111\n11011\n1234567891011121314151617181920\n0\n\nOutput for the Sample Input\n\n1\n4\n4\n38", "sample_input": "17819\n1111\n11011\n1234567891011121314151617181920\n0\n"}, "reference_outputs": ["1\n4\n4\n38\n"], "source_document_id": "p01300", "source_text": "Problem H: Eleven Lover\n\nEdward Leven loves multiples of eleven very much. When he sees a number, he always tries\nto find consecutive subsequences (or substrings) forming multiples of eleven. He calls such\nsubsequences as 11-sequences. For example, he can find an 11-sequence 781 in a number 17819.\n\nHe thinks a number which has many 11-sequences is a good number. He would like to find out\na very good number. As the first step, he wants an easy way to count how many 11-sequences\nare there in a given number. Even for him, counting them from a big number is not easy.\nFortunately, one of his friends, you, is a brilliant programmer. He asks you to write a program\nto count the number of 11-sequences. Note that an 11-sequence must be a positive number\nwithout leading zeros.\n\nInput\n\nThe input is a sequence of lines each of which contains a number consisting of less than or equal\nto 80000 digits.\n\nThe end of the input is indicated by a line containing a single zero, which should not be processed.\n\nOutput\n\nFor each input number, output a line containing the number of 11-sequences.\n\nYou can assume the answer fits in a 32-bit signed integer.\n\nSample Input\n\n17819\n1111\n11011\n1234567891011121314151617181920\n0\n\nOutput for the Sample Input\n\n1\n4\n4\n38", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 708, "cpu_time_ms": 60, "memory_kb": 5308}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s991689154", "group_id": "codeNet:p01304", "input_text": "#include <stdio.h>\nint disabled_route[16][16];\n\nint main(void){\n\tint dataset;\n\tscanf(\"%d\", &dataset);\n\n\twhile(dataset--){\n\t\tint gx, gy, matatabi;\n\t\tint x1, y1, x2, y2;\n\t\tint foo;\n\t\tfor(x1=0;x1<16;x1++)\n\t\tfor(y1=0;y1<16;y1++)\n\t\tdisabled_route[x1][y1] = 0;\n\n\t\tscanf(\"%d\", &gx);\n\t\tscanf(\"%d\", &gy);\n\t\tscanf(\"%d\", &matatabi);\n\n\t\twhile(matatabi--){\n\t\t\tscanf(\"%d\", &x1);\n\t\t\tscanf(\"%d\", &y1);\n\t\t\tscanf(\"%d\", &x2);\n\t\t\tscanf(\"%d\", &y2);\n\t\t\tif(x1 > x2) {\n\t\t\t\tfoo = x1;\n\t\t\t\tx1 = x2;\n\t\t\t\tx2 = foo;\n\t\t\t}else if(y1 >y2) {\n\t\t\t\tfoo = y1;\n\t\t\t\ty1 = y2;\n\t\t\t\ty2 = foo;\n\t\t\t}\n\t\t\tdisabled_route[x2][y2] += ( x1==x2 ? 1 : 2 );\n\t\t}\n\n\t\tif(foo = count(gx, gy)) printf(\"%d\\n\", foo);\n\t\telse printf(\"Miserable Hokusai!\\n\");\n\t}\n\n\treturn 0;\n}\n\nint count(x, y){\n\tif(x==0 && y==0) return 1;\n\tswitch(disabled_route[x][y]){\n\t  case 3:\n\t\treturn 0;\n\t  case 2:\n\t\treturn y ? count(x, y-1) : 0;\n\t  case 1:\n\t\treturn x ? count(x-1, y) : 0;\n\t  case 0:\n\t\treturn (y ? count(x, y-1) : 0) + (x ? count(x-1, y) : 0);\n\t}\n}\n\n/* note\n1\tvertical\n2\thorizontal\n*/", "language": "C", "metadata": {"date": 1304934383, "filename_ext": "c", "original_language": "C", "problem_description_relpath": "problem_descriptions/p01304.html", "problem_id": "p01304", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p01304/input.txt", "sample_output_relpath": "derived/input_output/data/p01304/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p01304/C/s991689154.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s991689154", "user_id": "u870122576"}, "prompt_components": {"gold_output": "6\nMiserable Hokusai!\n5\n155117520\n", "input_to_evaluate": "#include <stdio.h>\nint disabled_route[16][16];\n\nint main(void){\n\tint dataset;\n\tscanf(\"%d\", &dataset);\n\n\twhile(dataset--){\n\t\tint gx, gy, matatabi;\n\t\tint x1, y1, x2, y2;\n\t\tint foo;\n\t\tfor(x1=0;x1<16;x1++)\n\t\tfor(y1=0;y1<16;y1++)\n\t\tdisabled_route[x1][y1] = 0;\n\n\t\tscanf(\"%d\", &gx);\n\t\tscanf(\"%d\", &gy);\n\t\tscanf(\"%d\", &matatabi);\n\n\t\twhile(matatabi--){\n\t\t\tscanf(\"%d\", &x1);\n\t\t\tscanf(\"%d\", &y1);\n\t\t\tscanf(\"%d\", &x2);\n\t\t\tscanf(\"%d\", &y2);\n\t\t\tif(x1 > x2) {\n\t\t\t\tfoo = x1;\n\t\t\t\tx1 = x2;\n\t\t\t\tx2 = foo;\n\t\t\t}else if(y1 >y2) {\n\t\t\t\tfoo = y1;\n\t\t\t\ty1 = y2;\n\t\t\t\ty2 = foo;\n\t\t\t}\n\t\t\tdisabled_route[x2][y2] += ( x1==x2 ? 1 : 2 );\n\t\t}\n\n\t\tif(foo = count(gx, gy)) printf(\"%d\\n\", foo);\n\t\telse printf(\"Miserable Hokusai!\\n\");\n\t}\n\n\treturn 0;\n}\n\nint count(x, y){\n\tif(x==0 && y==0) return 1;\n\tswitch(disabled_route[x][y]){\n\t  case 3:\n\t\treturn 0;\n\t  case 2:\n\t\treturn y ? count(x, y-1) : 0;\n\t  case 1:\n\t\treturn x ? count(x-1, y) : 0;\n\t  case 0:\n\t\treturn (y ? count(x, y-1) : 0) + (x ? count(x-1, y) : 0);\n\t}\n}\n\n/* note\n1\tvertical\n2\thorizontal\n*/", "problem_context": "Problem B: 平安京ウォーキング\n\n平安京は、道が格子状になっている町として知られている。\n\n平安京に住んでいるねこのホクサイは、パトロールのために毎日自宅から町はずれの秘密の場所まで行かなければならない。しかし、毎日同じ道を通るのは飽きるし、後を付けられる危険もあるので、ホクサイはできるだけ毎日異なる経路を使いたい。その一方で、ホクサイは面倒臭がりなので、目的地から遠ざかるような道は通りたくない。\n\n平安京のあちこちの道にはマタタビが落ちていて、ホクサイはマタタビが落ちている道を通ることができない。そのような道を通るとめろめろになってしまうからである。幸いなことに、交差点にはマタタビは落ちていない。\n\nホクサイは、自宅から秘密の場所までの可能な経路の数を知りたい。ここで、ホクサイの自宅は (0, 0) にあり、秘密の場所は(gx, gy)にある。道は x = i (i は整数), y = j (j は整数) に格子状に敷かれている。\n\nInput\n\n入力の1行目には、秘密の場所の座標 (gx, gy) が与えられる。これらはいずれも1以上15以下の整数で、空白1個で区切られて与えられる。 2行目にはマタタビが落ちている区間の数 p (0 ≤ p ≤ 100) が与えられ、続くp行にはマタタビが落ちている区間が1行に1区間ずつ与えられる。 p個の区間は互いに異なる。 1区間は x1 y1 x2 y2 の形で表され、(x1, y1) と (x2, y2) を端点とする、x軸またはy軸に平行な長さ1の線分である。 x1, x2 は [0, gx] の範囲にあり、y1, y2 は [0, gy] の範囲にある。\n\nOutput\n\n可能な経路の数を出力せよ。可能な経路が1つもない場合は \"Miserable Hokusai!\" と1行に出力せよ。\n\nNotes on Submission\n\n上記形式で複数のデータセットが与えられます。入力データの 1 行目にデータセットの数が与えられます。各データセットに対する出力を上記形式で順番に出力するプログラムを作成して下さい。\n\nSample Input\n\n4\n2 2\n0\n1 1\n2\n0 0 0 1\n0 0 1 0\n4 3\n4\n1 0 0 0\n3 3 4 3\n4 1 4 0\n0 2 0 3\n15 15\n0\n\nOutput for the Sample Input\n\n6\nMiserable Hokusai!\n5\n155117520", "sample_input": "4\n2 2\n0\n1 1\n2\n0 0 0 1\n0 0 1 0\n4 3\n4\n1 0 0 0\n3 3 4 3\n4 1 4 0\n0 2 0 3\n15 15\n0\n"}, "reference_outputs": ["6\nMiserable Hokusai!\n5\n155117520\n"], "source_document_id": "p01304", "source_text": "Problem B: 平安京ウォーキング\n\n平安京は、道が格子状になっている町として知られている。\n\n平安京に住んでいるねこのホクサイは、パトロールのために毎日自宅から町はずれの秘密の場所まで行かなければならない。しかし、毎日同じ道を通るのは飽きるし、後を付けられる危険もあるので、ホクサイはできるだけ毎日異なる経路を使いたい。その一方で、ホクサイは面倒臭がりなので、目的地から遠ざかるような道は通りたくない。\n\n平安京のあちこちの道にはマタタビが落ちていて、ホクサイはマタタビが落ちている道を通ることができない。そのような道を通るとめろめろになってしまうからである。幸いなことに、交差点にはマタタビは落ちていない。\n\nホクサイは、自宅から秘密の場所までの可能な経路の数を知りたい。ここで、ホクサイの自宅は (0, 0) にあり、秘密の場所は(gx, gy)にある。道は x = i (i は整数), y = j (j は整数) に格子状に敷かれている。\n\nInput\n\n入力の1行目には、秘密の場所の座標 (gx, gy) が与えられる。これらはいずれも1以上15以下の整数で、空白1個で区切られて与えられる。 2行目にはマタタビが落ちている区間の数 p (0 ≤ p ≤ 100) が与えられ、続くp行にはマタタビが落ちている区間が1行に1区間ずつ与えられる。 p個の区間は互いに異なる。 1区間は x1 y1 x2 y2 の形で表され、(x1, y1) と (x2, y2) を端点とする、x軸またはy軸に平行な長さ1の線分である。 x1, x2 は [0, gx] の範囲にあり、y1, y2 は [0, gy] の範囲にある。\n\nOutput\n\n可能な経路の数を出力せよ。可能な経路が1つもない場合は \"Miserable Hokusai!\" と1行に出力せよ。\n\nNotes on Submission\n\n上記形式で複数のデータセットが与えられます。入力データの 1 行目にデータセットの数が与えられます。各データセットに対する出力を上記形式で順番に出力するプログラムを作成して下さい。\n\nSample Input\n\n4\n2 2\n0\n1 1\n2\n0 0 0 1\n0 0 1 0\n4 3\n4\n1 0 0 0\n3 3 4 3\n4 1 4 0\n0 2 0 3\n15 15\n0\n\nOutput for the Sample Input\n\n6\nMiserable Hokusai!\n5\n155117520", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1008, "cpu_time_ms": 3710, "memory_kb": 412}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s504221193", "group_id": "codeNet:p01317", "input_text": "#include<stdio.h>\nint MIN(int a,int b){return a<b?a:b;}\nint main(){\n  int n,m,p[1010],d[1010][1010],w[2][310][310];\n  int a,b,c,i,j,k,l,t,M=100000000;\n  char r;\n  while(scanf(\"%d %d\",&n,&m),n+m){\n    for(i=0;i<n*n;i++)w[0][i/n][i%n]=w[1][i/n][i%n]=M;\n    for(i=0;i<1010;i++){\n      for(j=0;j<1010;j++)d[i][j]=M;\n    }\n    for(i=0;i<n;i++)w[0][i][i]=w[1][i][i]=0;\n    while(m--){\n      scanf(\"%d %d %d %c\",&a,&b,&c,&r);\n      t=(r=='L')?0:1;\n      w[t][a-1][b-1]=w[t][b-1][a-1]=c;\n    }\n    for(i=0;i<2;i++){\n      for(j=0;j<n;j++){\n\tfor(k=0;k<n;k++){\n\t  for(l=0;l<n;l++)w[i][k][l]=MIN(w[i][k][l],w[i][k][j]+w[i][j][l]);\n\t}\n      }\n    }\n    /*for(i=0;i<2;i++){\n      for(j=0;j<n;j++){\n\tfor(k=0;k<n;k++)printf(\"%10d \",w[i][j][k]);printf(\"\\n\");\n      }printf(\"\\n\");\n      }//*/\n    scanf(\"%d\",&l);\n    for(i=0;i<l;i++)scanf(\"%d\",&p[i]);\n    for(i=0;i<l;i++)p[i]--;\n    d[p[0]][p[0]]=0;\n    for(i=0;i<l-1;i++){\n      for(j=0;j<n;j++){\n\tif(d[i][j]==M)continue;\n\td[i+1][j]=MIN(d[i+1][j],d[i][j]+w[0][p[i]][p[i+1]]);\n\tfor(k=0;k<n;k++){\n\t  d[i+1][k]=MIN(d[i+1][k],d[i][j]+w[0][p[i]][j]+w[1][j][k]+w[0][k][p[i+1]]);\n\t}\n      }\n    }\n    for(i=0;i<n;i++)d[l-1][0]=MIN(d[l-1][0],d[l-1][i]);\n    printf(\"%d\\n\",d[l-1][0]);\n  }\n  return 0;\n}", "language": "C", "metadata": {"date": 1466594525, "filename_ext": "c", "original_language": "C", "problem_description_relpath": "problem_descriptions/p01317.html", "problem_id": "p01317", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p01317/input.txt", "sample_output_relpath": "derived/input_output/data/p01317/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p01317/C/s504221193.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s504221193", "user_id": "u731027244"}, "prompt_components": {"gold_output": "18\n269\n", "input_to_evaluate": "#include<stdio.h>\nint MIN(int a,int b){return a<b?a:b;}\nint main(){\n  int n,m,p[1010],d[1010][1010],w[2][310][310];\n  int a,b,c,i,j,k,l,t,M=100000000;\n  char r;\n  while(scanf(\"%d %d\",&n,&m),n+m){\n    for(i=0;i<n*n;i++)w[0][i/n][i%n]=w[1][i/n][i%n]=M;\n    for(i=0;i<1010;i++){\n      for(j=0;j<1010;j++)d[i][j]=M;\n    }\n    for(i=0;i<n;i++)w[0][i][i]=w[1][i][i]=0;\n    while(m--){\n      scanf(\"%d %d %d %c\",&a,&b,&c,&r);\n      t=(r=='L')?0:1;\n      w[t][a-1][b-1]=w[t][b-1][a-1]=c;\n    }\n    for(i=0;i<2;i++){\n      for(j=0;j<n;j++){\n\tfor(k=0;k<n;k++){\n\t  for(l=0;l<n;l++)w[i][k][l]=MIN(w[i][k][l],w[i][k][j]+w[i][j][l]);\n\t}\n      }\n    }\n    /*for(i=0;i<2;i++){\n      for(j=0;j<n;j++){\n\tfor(k=0;k<n;k++)printf(\"%10d \",w[i][j][k]);printf(\"\\n\");\n      }printf(\"\\n\");\n      }//*/\n    scanf(\"%d\",&l);\n    for(i=0;i<l;i++)scanf(\"%d\",&p[i]);\n    for(i=0;i<l;i++)p[i]--;\n    d[p[0]][p[0]]=0;\n    for(i=0;i<l-1;i++){\n      for(j=0;j<n;j++){\n\tif(d[i][j]==M)continue;\n\td[i+1][j]=MIN(d[i+1][j],d[i][j]+w[0][p[i]][p[i+1]]);\n\tfor(k=0;k<n;k++){\n\t  d[i+1][k]=MIN(d[i+1][k],d[i][j]+w[0][p[i]][j]+w[1][j][k]+w[0][k][p[i+1]]);\n\t}\n      }\n    }\n    for(i=0;i<n;i++)d[l-1][0]=MIN(d[l-1][0],d[l-1][i]);\n    printf(\"%d\\n\",d[l-1][0]);\n  }\n  return 0;\n}", "problem_context": "Problem D: Mr. Rito Post Office\n\nあなたは離島の郵便局に勤めるプログラマである．あなたの住んでいる地域は，複数の島々からなる．各島には一つ以上の港町がある．それらに加えて他の町や村があるかもしない．ある島から別の島に向かうためには船を使わなければならない．一つの島の中を回るには陸路が使えるが，海路を利用した方が速いこともある．\n\n近年行われた郵便局の民営化をきっかけに，経費削減に向けて郵便配達員の人員整理が全国的に行われた．離島の郵便局もその例外ではなく，結果として郵便配達員は利藤さんただ一人となってしまった．その郵便局が集配を担当する地域は非常に広いため，一人で集配するのは大変な作業である．なので，どのようにすれば効率的に集配を行えるのか，利藤さんがあなたに助けを求めてきた．\n\nあなたの仕事は，利藤さんがたどるべき町や村の集配順序が与えられたときに，最短巡回経路を求めるプログラムを書くことである．\n\n利藤さんは，決して指定された順序以外で集配業務を行うことができない．しかし，ある町や村から別の町や村へ移動する際に，他の町や村を経由して移動することは許可されている．また，利藤さんは島々を巡るための一隻の船を持っている．\n\n例えば，町A，町B，村Cという集配順序が与えられた場合，町Aから町Bへ向かう際にどの町や村を経由してもかまわない．このとき，村Cを経由しても構わないが，集配順序を守るためには，一度町Bに行って集配をおこなってから，改めて村Cを訪れて集配をおこなわなければならない．また，町Aから海路を用いて町Bに向かい，町Bから陸路を用いて村Cに向かった場合，船を町Bに置いたままになる．したがって，次に海路を使いたい場合は町Bに戻る必要がある．\n\n一つの町や村において複数回集配をしなければならない場合もある．たとえば，町A，村B，町C，村Bという集配順序が与えられるかもしれない．このとき，町Aから村Bをたどらずに町Cに向かった場合は，町Cでいきなり集配をおこなうことはできない．最初の村Bでの集配が終わっていないからである．町Cで集配を済ませた後で村Bを訪れて集配しても，一回目の村Bの集配を終わらせたことにはならない．\n\n利藤さんは，はじめに必ずある港町に船とともにいる．利藤さんはベテランであるため，移動時間以外の集配作業にかかる時間は無視してよい．また，最後の町または村での集配業務が完了するまでの時間だけが問題であり，船をもとの位置に戻して郵便局に帰るまでの時間は考慮しなくてよい．\n\nInput\n\n入力は複数のデータセットから構成される．各データセットの形式は次に示すとおりである．\n\nN M\n\nx1 y1 t1 sl1\n\nx2 y2 t2 sl2\n\n...\n\nxM yM tM slM\n\nR\n\nz1 z2 ... zR\n\nデータセットの中の入力項目は，すべて非負の整数である．行中の入力項目の区切りは空白 1 個である．\n\n最初の行は，陸路及び海路網の大きさを規定する．\n\nN (2 ≤ N ≤ 200) は，町または村の数である．\nそれぞれの町または村には，1 から N までの固有の番号を割り当てる．\nM (1 ≤ M ≤ 10000) は，陸路と海路の合計本数である．\n\n2 行目から 1 + M 行目は，陸路または海路の記述である．\nxi と yi (1 ≤ xi, yi ≤ N) は両端の町または村の番号を表す．\nti (1 ≤ ti ≤ 1000) はその陸路または海路の移動時間を表す．\nsli は ‘L’ または ‘S’ のいずれかであり，Lは陸路を，Sは海路をそれぞれ表す．\n\nある2つの町や村を直接結ぶ陸路または海路が2本以上存在することがある． それぞれの陸路または海路は双方向であり，すなわちどちらの向きにも移動できる．\n\nM + 2 行目の R (1 ≤ R ≤\n1000)は，利藤さんが担当する集配先の数を表す． M + 3 行目には，集配先の町や村の番号 zi (1 ≤ zi ≤ N) が集配順に R 個並んでいる．\n\n初期状態では利藤さんと船はともに港町 z1 に存在する． 初期状態から集配先の町や村へは，必ず何らかの方法で移動することができる．\n\n入力の終わりは，空白で区切られた2つの0を含む1行で示される．\n\nOutput\n\n入力の各データセットに対して，与えられた集配順序で利藤さんが町と村を巡回するために必要な最短移動時間を求め，1行に出力せよ．\n\nSample Input\n\n3 3\n1 2 5 L\n1 2 7 S\n2 3 11 S\n3\n1 2 3\n5 5\n1 2 15 L\n2 3 10 L\n4 5 7 L\n1 3 30 S\n3 4 100 S\n5\n1 3 5 4 1\n0 0\n\nOutput for the Sample Input\n\n18\n269", "sample_input": "3 3\n1 2 5 L\n1 2 7 S\n2 3 11 S\n3\n1 2 3\n5 5\n1 2 15 L\n2 3 10 L\n4 5 7 L\n1 3 30 S\n3 4 100 S\n5\n1 3 5 4 1\n0 0\n"}, "reference_outputs": ["18\n269\n"], "source_document_id": "p01317", "source_text": "Problem D: Mr. Rito Post Office\n\nあなたは離島の郵便局に勤めるプログラマである．あなたの住んでいる地域は，複数の島々からなる．各島には一つ以上の港町がある．それらに加えて他の町や村があるかもしない．ある島から別の島に向かうためには船を使わなければならない．一つの島の中を回るには陸路が使えるが，海路を利用した方が速いこともある．\n\n近年行われた郵便局の民営化をきっかけに，経費削減に向けて郵便配達員の人員整理が全国的に行われた．離島の郵便局もその例外ではなく，結果として郵便配達員は利藤さんただ一人となってしまった．その郵便局が集配を担当する地域は非常に広いため，一人で集配するのは大変な作業である．なので，どのようにすれば効率的に集配を行えるのか，利藤さんがあなたに助けを求めてきた．\n\nあなたの仕事は，利藤さんがたどるべき町や村の集配順序が与えられたときに，最短巡回経路を求めるプログラムを書くことである．\n\n利藤さんは，決して指定された順序以外で集配業務を行うことができない．しかし，ある町や村から別の町や村へ移動する際に，他の町や村を経由して移動することは許可されている．また，利藤さんは島々を巡るための一隻の船を持っている．\n\n例えば，町A，町B，村Cという集配順序が与えられた場合，町Aから町Bへ向かう際にどの町や村を経由してもかまわない．このとき，村Cを経由しても構わないが，集配順序を守るためには，一度町Bに行って集配をおこなってから，改めて村Cを訪れて集配をおこなわなければならない．また，町Aから海路を用いて町Bに向かい，町Bから陸路を用いて村Cに向かった場合，船を町Bに置いたままになる．したがって，次に海路を使いたい場合は町Bに戻る必要がある．\n\n一つの町や村において複数回集配をしなければならない場合もある．たとえば，町A，村B，町C，村Bという集配順序が与えられるかもしれない．このとき，町Aから村Bをたどらずに町Cに向かった場合は，町Cでいきなり集配をおこなうことはできない．最初の村Bでの集配が終わっていないからである．町Cで集配を済ませた後で村Bを訪れて集配しても，一回目の村Bの集配を終わらせたことにはならない．\n\n利藤さんは，はじめに必ずある港町に船とともにいる．利藤さんはベテランであるため，移動時間以外の集配作業にかかる時間は無視してよい．また，最後の町または村での集配業務が完了するまでの時間だけが問題であり，船をもとの位置に戻して郵便局に帰るまでの時間は考慮しなくてよい．\n\nInput\n\n入力は複数のデータセットから構成される．各データセットの形式は次に示すとおりである．\n\nN M\n\nx1 y1 t1 sl1\n\nx2 y2 t2 sl2\n\n...\n\nxM yM tM slM\n\nR\n\nz1 z2 ... zR\n\nデータセットの中の入力項目は，すべて非負の整数である．行中の入力項目の区切りは空白 1 個である．\n\n最初の行は，陸路及び海路網の大きさを規定する．\n\nN (2 ≤ N ≤ 200) は，町または村の数である．\nそれぞれの町または村には，1 から N までの固有の番号を割り当てる．\nM (1 ≤ M ≤ 10000) は，陸路と海路の合計本数である．\n\n2 行目から 1 + M 行目は，陸路または海路の記述である．\nxi と yi (1 ≤ xi, yi ≤ N) は両端の町または村の番号を表す．\nti (1 ≤ ti ≤ 1000) はその陸路または海路の移動時間を表す．\nsli は ‘L’ または ‘S’ のいずれかであり，Lは陸路を，Sは海路をそれぞれ表す．\n\nある2つの町や村を直接結ぶ陸路または海路が2本以上存在することがある． それぞれの陸路または海路は双方向であり，すなわちどちらの向きにも移動できる．\n\nM + 2 行目の R (1 ≤ R ≤\n1000)は，利藤さんが担当する集配先の数を表す． M + 3 行目には，集配先の町や村の番号 zi (1 ≤ zi ≤ N) が集配順に R 個並んでいる．\n\n初期状態では利藤さんと船はともに港町 z1 に存在する． 初期状態から集配先の町や村へは，必ず何らかの方法で移動することができる．\n\n入力の終わりは，空白で区切られた2つの0を含む1行で示される．\n\nOutput\n\n入力の各データセットに対して，与えられた集配順序で利藤さんが町と村を巡回するために必要な最短移動時間を求め，1行に出力せよ．\n\nSample Input\n\n3 3\n1 2 5 L\n1 2 7 S\n2 3 11 S\n3\n1 2 3\n5 5\n1 2 15 L\n2 3 10 L\n4 5 7 L\n1 3 30 S\n3 4 100 S\n5\n1 3 5 4 1\n0 0\n\nOutput for the Sample Input\n\n18\n269", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1228, "cpu_time_ms": 250, "memory_kb": 5080}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s327549193", "group_id": "codeNet:p01571", "input_text": "// AOJ 2457 Adhoc Translation\n// 2018.3.6 bal4u\n\n#include <stdio.h>\n#include <stdlib.h>\n#include <string.h>\n\n#define QMAX 10005\ntypedef struct { int t, s; } QUE;\nQUE que[QMAX]; int qsize;\n\n#define PARENT(i) ((i)>>1)\n#define LEFT(i)   ((i)<<1)\n#define RIGHT(i)  (((i)<<1)+1)\n\nvoid min_heapify(int i)\n{\n\tint l, r, min;\n\tQUE qt;\n\n\tl = LEFT(i), r = RIGHT(i);\n\tif (l < qsize && que[l].t < que[i].t) min = l; else min = i;\n\tif (r < qsize && que[r].t < que[min].t) min = r;\n\tif (min != i) {\n\t\tqt = que[i], que[i] = que[min], que[min] = qt;\n\t\tmin_heapify(min);\n\t}\n}\n\nvoid deq()\n{\n\tque[0] = que[--qsize];\n\tmin_heapify(0);\n}\n\nvoid enq(int s, int t)\n{\n\tint i, min;\n\tQUE qt;\n\n\ti = qsize++;\n\tque[i].s = s, que[i].t = t;\n\twhile (i > 0 && que[min = PARENT(i)].t > que[i].t) {\n\t\tqt = que[i], que[i] = que[min], que[min] = qt;\n\t\ti = min;\n\t}\n}\n\n#define INF 0x01010101\n#define MAX 805\ntypedef struct { int to, rev; int cap, cost; } E;\nE *edge[MAX]; int hi[MAX], lim[MAX];\nint V;\t\t\t\t// 頂点数\nint potential[MAX], min_cost[MAX], prevv[MAX], preve[MAX];\n\nvoid check_lim(int a)\n{\n\tif (hi[a] < lim[a]) return;\n\tif (lim[a] == 0) {\n\t\tlim[a] = 4, hi[a] = 0;\n\t\tedge[a] = malloc(sizeof(E) *lim[a]);\n\t} else if (hi[a] == lim[a]) {\n\t\tint k = lim[a];\n\t\tif (k > 256) k = 256;\n\t\tlim[a] += k;\n\t\tedge[a] = realloc(edge[a], sizeof(E) *lim[a]);\n\t}\n}\n\nvoid add_edge(int from, int to, int cap, int cost)\n{\n\tint f, t;\n\tE *ep;\n\n\tcheck_lim(from), check_lim(to);\n\tf = hi[from]++, t = hi[to]++;\n\tep = &edge[from][f], ep->to = to, ep->cap = cap, ep->cost = cost, ep->rev = t; \n\tep = &edge[to][t], ep->to = from, ep->cap = 0, ep->cost = -cost, ep->rev = f;\n}\n\nint minCostFlow(int S, int T, int F)\n{\n\tint i, s, ns, t, nt, ret;\n\tE *ep;\n\n\tret = 0;\n//\tmemset(potential, 0, V << 2);\n  \n    while (F > 0) {\n\t\tmemset(min_cost, INF, V << 2);\n\t\tqsize = 0;\n\t\tenq(S, 0), min_cost[S] = 0;\n  \n\t\twhile (qsize) {\n\t\t\ts = que[0].s, t = que[0].t, deq();\n\t\t\tif (min_cost[s] < t) continue;\n\n\t\t\tfor (i = 0; i < hi[s]; i++) {\n\t\t\t\tep = &edge[s][i], ns = ep->to;\n\t\t\t\tnt = t + ep->cost + potential[s] - potential[ns];\n\t\t\t\tif(ep->cap > 0 && min_cost[ns] > nt) {\n\t\t\t\t\tmin_cost[ns] = nt;\n\t\t\t\t\tprevv[ns] = s, preve[ns] = i;\n\t\t\t\t\tenq(ns, nt);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tif (min_cost[T] == INF) return -1;\n\t\tfor (s = 0; s < V; s++) potential[s] += min_cost[s];\n\n\t\tt = F;\n\t\tfor (s = T; s != S; s = prevv[s]) {\n\t\t\tep = &edge[prevv[s]][preve[s]];\n\t\t\tif (t > ep->cap) t = ep->cap;\n\t\t}\n\t\tF -= t;\n\n\t\tret += t * potential[T];\n\t\tfor (s = T; s != S; s = prevv[s]) {\n\t\t\tep = &edge[prevv[s]][preve[s]];\n\t\t\tep->cap -= t;\n\t\t\tedge[s][ep->rev].cap += t;\n\t\t}\n\t}\n\treturn ret;\n}\n\ntypedef struct { int c, w; char *s; } S;\t// w:len, c:cnt\nS web[50000]; int sz;\nS dic[402];\nchar buf[102][1005];\nchar word[402][25];\nchar dp0[22][22], dp[22][22];\n\nint string_distance(char *s1, int w1, char *s2, int w2)\n{\n\tint  i, j, d, min;\n\n\tmemcpy(dp, dp0, sizeof(dp));\n\tfor (j = 1; j <= w1; j++) for (i = 1; i <= w2; i++) {\n\t\td = (s1[j-1] != s2[i-1]);\n\t\tmin =     dp[j-1][i  ] + 1;\n\t\tif (min > dp[j  ][i-1] + 1) min = dp[j  ][i-1] + 1;\n\t\tif (min > dp[j-1][i-1] + d) min = dp[j-1][i-1] + d;\n\t\tdp[j][i] = min;\n\t}\n\treturn dp[w1][w2];\n}\n\nint cmp(S *a, S *b) { return strcmp(a->s, b->s); }\n\nint uniq(S *a, int n)\n{\n\tint i, j, k;\n\t\n\tfor (i = 0, j = 1; j < n; j++) {\n\t\tk = j; while (j < n && a[i].w == a[j].w && !memcmp(a[i].s, a[j].s, a[i].w)) j++;\n\t\ta[i].c = j-k+1; if (j < n) if (++i != j) a[i] = a[j];\n\t}\n\treturn i+1;\n}\n\nint main()\n{\n\tint N, M, i, j, source, sink;\n\tchar b[20], *p, *q;\n\n\ti = 21; while (i--) dp0[i][0] = i;\n\ti = 21; while (i--) dp0[0][i] = i;\n\n\tfgets(b, 20, stdin), sscanf(b, \"%d%d\", &N, &M);\n\tsz = 0; for (i = 0; i < N; i++) {\n\t\tfgets(p=buf[i], 1002, stdin);\n\t\twhile (1) {\n\t\t\tq = p; while (*p > ' ') p++;\n\t\t\tweb[sz].c = 1, web[sz].s = q, web[sz++].w = p-q;\n\t\t\tif (*p < ' ') { *p = 0; break; }\n\t\t\t*p++ = 0;\n\t\t}\n\t}\n\tqsort(web, sz, sizeof(S), cmp), sz = uniq(web, sz);\n\n\tfor (i = 0; i < M; i++) {\n\t\tfgets(p=word[i], 22, stdin);\n\t\tq = p; while (*p > ' ') p++; *p = 0;\n\t\tdic[i].s = q, dic[i].w = p-q;\n\t}\n\n\tsource = sz + M, sink = source + 1, V = sink + 1;\n\n\tfor (i = 0; i < sz; i++) add_edge(source, i, 1, 0);\n\tfor (i = 0; i < sz; i++) for (j = 0; j < M; j++) {\n\t\tadd_edge(i, sz+j, 1, web[i].c*string_distance(web[i].s, web[i].w, dic[j].s, dic[j].w));\n\t}\n\tfor (j = 0; j < M; j++) add_edge(sz+j, sink, 1, 0);\n\n\tprintf(\"%d\\n\", minCostFlow(source, sink, sz));\n\treturn 0;\n}\n", "language": "C", "metadata": {"date": 1520372898, "filename_ext": "c", "original_language": "C", "problem_description_relpath": "problem_descriptions/p01571.html", "problem_id": "p01571", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p01571/input.txt", "sample_output_relpath": "derived/input_output/data/p01571/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p01571/C/s327549193.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s327549193", "user_id": "u847467233"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "// AOJ 2457 Adhoc Translation\n// 2018.3.6 bal4u\n\n#include <stdio.h>\n#include <stdlib.h>\n#include <string.h>\n\n#define QMAX 10005\ntypedef struct { int t, s; } QUE;\nQUE que[QMAX]; int qsize;\n\n#define PARENT(i) ((i)>>1)\n#define LEFT(i)   ((i)<<1)\n#define RIGHT(i)  (((i)<<1)+1)\n\nvoid min_heapify(int i)\n{\n\tint l, r, min;\n\tQUE qt;\n\n\tl = LEFT(i), r = RIGHT(i);\n\tif (l < qsize && que[l].t < que[i].t) min = l; else min = i;\n\tif (r < qsize && que[r].t < que[min].t) min = r;\n\tif (min != i) {\n\t\tqt = que[i], que[i] = que[min], que[min] = qt;\n\t\tmin_heapify(min);\n\t}\n}\n\nvoid deq()\n{\n\tque[0] = que[--qsize];\n\tmin_heapify(0);\n}\n\nvoid enq(int s, int t)\n{\n\tint i, min;\n\tQUE qt;\n\n\ti = qsize++;\n\tque[i].s = s, que[i].t = t;\n\twhile (i > 0 && que[min = PARENT(i)].t > que[i].t) {\n\t\tqt = que[i], que[i] = que[min], que[min] = qt;\n\t\ti = min;\n\t}\n}\n\n#define INF 0x01010101\n#define MAX 805\ntypedef struct { int to, rev; int cap, cost; } E;\nE *edge[MAX]; int hi[MAX], lim[MAX];\nint V;\t\t\t\t// 頂点数\nint potential[MAX], min_cost[MAX], prevv[MAX], preve[MAX];\n\nvoid check_lim(int a)\n{\n\tif (hi[a] < lim[a]) return;\n\tif (lim[a] == 0) {\n\t\tlim[a] = 4, hi[a] = 0;\n\t\tedge[a] = malloc(sizeof(E) *lim[a]);\n\t} else if (hi[a] == lim[a]) {\n\t\tint k = lim[a];\n\t\tif (k > 256) k = 256;\n\t\tlim[a] += k;\n\t\tedge[a] = realloc(edge[a], sizeof(E) *lim[a]);\n\t}\n}\n\nvoid add_edge(int from, int to, int cap, int cost)\n{\n\tint f, t;\n\tE *ep;\n\n\tcheck_lim(from), check_lim(to);\n\tf = hi[from]++, t = hi[to]++;\n\tep = &edge[from][f], ep->to = to, ep->cap = cap, ep->cost = cost, ep->rev = t; \n\tep = &edge[to][t], ep->to = from, ep->cap = 0, ep->cost = -cost, ep->rev = f;\n}\n\nint minCostFlow(int S, int T, int F)\n{\n\tint i, s, ns, t, nt, ret;\n\tE *ep;\n\n\tret = 0;\n//\tmemset(potential, 0, V << 2);\n  \n    while (F > 0) {\n\t\tmemset(min_cost, INF, V << 2);\n\t\tqsize = 0;\n\t\tenq(S, 0), min_cost[S] = 0;\n  \n\t\twhile (qsize) {\n\t\t\ts = que[0].s, t = que[0].t, deq();\n\t\t\tif (min_cost[s] < t) continue;\n\n\t\t\tfor (i = 0; i < hi[s]; i++) {\n\t\t\t\tep = &edge[s][i], ns = ep->to;\n\t\t\t\tnt = t + ep->cost + potential[s] - potential[ns];\n\t\t\t\tif(ep->cap > 0 && min_cost[ns] > nt) {\n\t\t\t\t\tmin_cost[ns] = nt;\n\t\t\t\t\tprevv[ns] = s, preve[ns] = i;\n\t\t\t\t\tenq(ns, nt);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tif (min_cost[T] == INF) return -1;\n\t\tfor (s = 0; s < V; s++) potential[s] += min_cost[s];\n\n\t\tt = F;\n\t\tfor (s = T; s != S; s = prevv[s]) {\n\t\t\tep = &edge[prevv[s]][preve[s]];\n\t\t\tif (t > ep->cap) t = ep->cap;\n\t\t}\n\t\tF -= t;\n\n\t\tret += t * potential[T];\n\t\tfor (s = T; s != S; s = prevv[s]) {\n\t\t\tep = &edge[prevv[s]][preve[s]];\n\t\t\tep->cap -= t;\n\t\t\tedge[s][ep->rev].cap += t;\n\t\t}\n\t}\n\treturn ret;\n}\n\ntypedef struct { int c, w; char *s; } S;\t// w:len, c:cnt\nS web[50000]; int sz;\nS dic[402];\nchar buf[102][1005];\nchar word[402][25];\nchar dp0[22][22], dp[22][22];\n\nint string_distance(char *s1, int w1, char *s2, int w2)\n{\n\tint  i, j, d, min;\n\n\tmemcpy(dp, dp0, sizeof(dp));\n\tfor (j = 1; j <= w1; j++) for (i = 1; i <= w2; i++) {\n\t\td = (s1[j-1] != s2[i-1]);\n\t\tmin =     dp[j-1][i  ] + 1;\n\t\tif (min > dp[j  ][i-1] + 1) min = dp[j  ][i-1] + 1;\n\t\tif (min > dp[j-1][i-1] + d) min = dp[j-1][i-1] + d;\n\t\tdp[j][i] = min;\n\t}\n\treturn dp[w1][w2];\n}\n\nint cmp(S *a, S *b) { return strcmp(a->s, b->s); }\n\nint uniq(S *a, int n)\n{\n\tint i, j, k;\n\t\n\tfor (i = 0, j = 1; j < n; j++) {\n\t\tk = j; while (j < n && a[i].w == a[j].w && !memcmp(a[i].s, a[j].s, a[i].w)) j++;\n\t\ta[i].c = j-k+1; if (j < n) if (++i != j) a[i] = a[j];\n\t}\n\treturn i+1;\n}\n\nint main()\n{\n\tint N, M, i, j, source, sink;\n\tchar b[20], *p, *q;\n\n\ti = 21; while (i--) dp0[i][0] = i;\n\ti = 21; while (i--) dp0[0][i] = i;\n\n\tfgets(b, 20, stdin), sscanf(b, \"%d%d\", &N, &M);\n\tsz = 0; for (i = 0; i < N; i++) {\n\t\tfgets(p=buf[i], 1002, stdin);\n\t\twhile (1) {\n\t\t\tq = p; while (*p > ' ') p++;\n\t\t\tweb[sz].c = 1, web[sz].s = q, web[sz++].w = p-q;\n\t\t\tif (*p < ' ') { *p = 0; break; }\n\t\t\t*p++ = 0;\n\t\t}\n\t}\n\tqsort(web, sz, sizeof(S), cmp), sz = uniq(web, sz);\n\n\tfor (i = 0; i < M; i++) {\n\t\tfgets(p=word[i], 22, stdin);\n\t\tq = p; while (*p > ' ') p++; *p = 0;\n\t\tdic[i].s = q, dic[i].w = p-q;\n\t}\n\n\tsource = sz + M, sink = source + 1, V = sink + 1;\n\n\tfor (i = 0; i < sz; i++) add_edge(source, i, 1, 0);\n\tfor (i = 0; i < sz; i++) for (j = 0; j < M; j++) {\n\t\tadd_edge(i, sz+j, 1, web[i].c*string_distance(web[i].s, web[i].w, dic[j].s, dic[j].w));\n\t}\n\tfor (j = 0; j < M; j++) add_edge(sz+j, sink, 1, 0);\n\n\tprintf(\"%d\\n\", minCostFlow(source, sink, sz));\n\treturn 0;\n}\n", "problem_context": "Problem A: Adhoc Translation\n\nOne day, during daily web surfing, you encountered a web page which was written in a language you've never seen. The character set of the language was the same as your native language; moreover, the grammar and words seemed almost the same. Excitedly, you started to \"decipher\" the web page. The first approach you tried was to guess the meaning of each word by selecting a similar word from a dictionary of your native language. The closer two words (although from the different languages) are, the more similar meaning they will have.\n\nYou decided to adopt edit distance for the measurement of similarity between two words. The edit distance between two character sequences is defined as the minimum number of insertions, deletions and substitutions required to morph one sequence into the other. For example, the pair of \"point\" and \"spoon\" has the edit distance of 3: the latter can be obtained from the former by deleting 't', substituting 'i' to 'o', and finally inserting 's' at the beginning.\n\nYou wanted to assign a word in your language to each word in the web text so that the entire assignment has the minimum edit distance. The edit distance of an assignment is calculated as the total sum of edit distances between each word in the text and its counterpart in your language. Words appearing more than once in the text should be counted by the number of appearances.\n\nThe translation must be consistent across the entire text; you may not match different words from your dictionary for different occurrences of any word in the text. Similarly, different words in the text should not have the same meaning in your language.\n\nSuppose the web page says \"qwerty asdf zxcv\" and your dictionary contains the words \"qwert\", \"asf\", \"tyui\", \"zxcvb\" and \"ghjk\". In this case, you can match the words in the page as follows, and the edit distance of this translation is 3: \"qwert\" for \"qwerty\", \"asf\" for \"asdf\" and \"zxcvb\" for \"zxcv\".\n\nWrite a program to calculate the minimum possible edit distance among all translations, for given a web page text and a word set in the dictionary.\n\nInput\n\nThe first line of the input contains two integers N and M.\n\nThe following N lines represent the text from the web page you've found. This text contains only lowercase alphabets and white spaces. Then M lines, each containing a word, describe the dictionary to use. Every word consists of lowercase alphabets only, and does not contain more than 20 characters.\n\nIt is guaranteed that 1 ≤ N ≤ 100 and 1 ≤ M ≤ 400. Also it is guaranteed that the dictionary is made up of many enough words, which means the number of words in the dictionary is no less than the kinds of words in the text to translate. The length of each line in the text does not exceed 1000.\n\nOutput\n\nOutput the minimum possible edit distance in a line.\n\nSample Input 1\n\n1 5\nqwerty asdf zxcv\nqwert\nasf\ntyui\nzxcvb\nghjk\n\nOutput for the Sample Input 1\n\n3", "sample_input": "1 5\nqwerty asdf zxcv\nqwert\nasf\ntyui\nzxcvb\nghjk\n"}, "reference_outputs": ["3\n"], "source_document_id": "p01571", "source_text": "Problem A: Adhoc Translation\n\nOne day, during daily web surfing, you encountered a web page which was written in a language you've never seen. The character set of the language was the same as your native language; moreover, the grammar and words seemed almost the same. Excitedly, you started to \"decipher\" the web page. The first approach you tried was to guess the meaning of each word by selecting a similar word from a dictionary of your native language. The closer two words (although from the different languages) are, the more similar meaning they will have.\n\nYou decided to adopt edit distance for the measurement of similarity between two words. The edit distance between two character sequences is defined as the minimum number of insertions, deletions and substitutions required to morph one sequence into the other. For example, the pair of \"point\" and \"spoon\" has the edit distance of 3: the latter can be obtained from the former by deleting 't', substituting 'i' to 'o', and finally inserting 's' at the beginning.\n\nYou wanted to assign a word in your language to each word in the web text so that the entire assignment has the minimum edit distance. The edit distance of an assignment is calculated as the total sum of edit distances between each word in the text and its counterpart in your language. Words appearing more than once in the text should be counted by the number of appearances.\n\nThe translation must be consistent across the entire text; you may not match different words from your dictionary for different occurrences of any word in the text. Similarly, different words in the text should not have the same meaning in your language.\n\nSuppose the web page says \"qwerty asdf zxcv\" and your dictionary contains the words \"qwert\", \"asf\", \"tyui\", \"zxcvb\" and \"ghjk\". In this case, you can match the words in the page as follows, and the edit distance of this translation is 3: \"qwert\" for \"qwerty\", \"asf\" for \"asdf\" and \"zxcvb\" for \"zxcv\".\n\nWrite a program to calculate the minimum possible edit distance among all translations, for given a web page text and a word set in the dictionary.\n\nInput\n\nThe first line of the input contains two integers N and M.\n\nThe following N lines represent the text from the web page you've found. This text contains only lowercase alphabets and white spaces. Then M lines, each containing a word, describe the dictionary to use. Every word consists of lowercase alphabets only, and does not contain more than 20 characters.\n\nIt is guaranteed that 1 ≤ N ≤ 100 and 1 ≤ M ≤ 400. Also it is guaranteed that the dictionary is made up of many enough words, which means the number of words in the dictionary is no less than the kinds of words in the text to translate. The length of each line in the text does not exceed 1000.\n\nOutput\n\nOutput the minimum possible edit distance in a line.\n\nSample Input 1\n\n1 5\nqwerty asdf zxcv\nqwert\nasf\ntyui\nzxcvb\nghjk\n\nOutput for the Sample Input 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": 4359, "cpu_time_ms": 360, "memory_kb": 9104}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s771629433", "group_id": "codeNet:p01851", "input_text": "// AOJ 2751 Baseball\n// 2018.2.2 bal4u\n\n#include <stdio.h>\n\n#define M 1000000007\n#define N 4000000\n\nint fact[N+2], inv[N+2], factinv[N+2];\n\n//#define getchar_unlocked()  getchar()\nint in()\n{\n\tint n = 0;\n\tint c = getchar_unlocked();\n\tdo n = (n<<3)+(n<<1) + (c & 0xf), c = getchar_unlocked();\n\twhile (c >= '0');\n\treturn n;\n}\n\nint comb(int n, int k)\n{\n\tif (n < 0 || k < 0) return 0;\n\treturn (int)((long long)fact[n] * factinv[k] % M * factinv[n-k] % M);\n}\n\nint H(int n, int k)\n{\n\tif (!n && !k) return 1;\n    return comb(n+k-1, k);\n}\n\nint main()\n{\n\tint a, b, c, sx, sy, i;\n\tlong long ans, t;\n\n\tfact[0] = 1; for (i = 1; i <= N; i++)\n\t\tfact[i] = (long long)fact[i-1] * i % M;\n\tinv[1] = 1; for (i = 2; i <= N; i++)\n\t\tinv[i] = M - (M / i) * (long long)inv[M % i] % M;\n\tfactinv[0] = 1; for (i = 1; i <= N; i++)\n\t\tfactinv[i] = (long long)factinv[i-1] * inv[i] % M;\n\n\twhile (1) {\n\t\ta = in(), b = in(), c = in(), sx = in(), sy = in();\n\t\tif ((a|b|c|sx|sy) == 0) break;\n\n\t\tans = 0;\n\t\tfor (i = a; i <= sx; i++) {\n\t\t\tt = H(a, i-a);\n\t\t\tt = t * H(b, sy-sx+i-b) % M;\n\t\t\tt = t * H(a+b+c, sx-i) % M;\n\t\t\tans += t;\n\t\t\tif (ans >= M) ans -= M;\n\t\t}\n\t\tans = ans * comb(a+b+c, a) % M;\n\t\tans = ans * comb(b+c, b) % M;\n\t\tprintf(\"%d\\n\", (int)ans);\n\t}\n    return 0;\n}\n", "language": "C", "metadata": {"date": 1517576607, "filename_ext": "c", "original_language": "C", "problem_description_relpath": "problem_descriptions/p01851.html", "problem_id": "p01851", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p01851/input.txt", "sample_output_relpath": "derived/input_output/data/p01851/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p01851/C/s771629433.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s771629433", "user_id": "u847467233"}, "prompt_components": {"gold_output": "2\n0\n114660\n512095631\n673703234\n166259450\n", "input_to_evaluate": "// AOJ 2751 Baseball\n// 2018.2.2 bal4u\n\n#include <stdio.h>\n\n#define M 1000000007\n#define N 4000000\n\nint fact[N+2], inv[N+2], factinv[N+2];\n\n//#define getchar_unlocked()  getchar()\nint in()\n{\n\tint n = 0;\n\tint c = getchar_unlocked();\n\tdo n = (n<<3)+(n<<1) + (c & 0xf), c = getchar_unlocked();\n\twhile (c >= '0');\n\treturn n;\n}\n\nint comb(int n, int k)\n{\n\tif (n < 0 || k < 0) return 0;\n\treturn (int)((long long)fact[n] * factinv[k] % M * factinv[n-k] % M);\n}\n\nint H(int n, int k)\n{\n\tif (!n && !k) return 1;\n    return comb(n+k-1, k);\n}\n\nint main()\n{\n\tint a, b, c, sx, sy, i;\n\tlong long ans, t;\n\n\tfact[0] = 1; for (i = 1; i <= N; i++)\n\t\tfact[i] = (long long)fact[i-1] * i % M;\n\tinv[1] = 1; for (i = 2; i <= N; i++)\n\t\tinv[i] = M - (M / i) * (long long)inv[M % i] % M;\n\tfactinv[0] = 1; for (i = 1; i <= N; i++)\n\t\tfactinv[i] = (long long)factinv[i-1] * inv[i] % M;\n\n\twhile (1) {\n\t\ta = in(), b = in(), c = in(), sx = in(), sy = in();\n\t\tif ((a|b|c|sx|sy) == 0) break;\n\n\t\tans = 0;\n\t\tfor (i = a; i <= sx; i++) {\n\t\t\tt = H(a, i-a);\n\t\t\tt = t * H(b, sy-sx+i-b) % M;\n\t\t\tt = t * H(a+b+c, sx-i) % M;\n\t\t\tans += t;\n\t\t\tif (ans >= M) ans -= M;\n\t\t}\n\t\tans = ans * comb(a+b+c, a) % M;\n\t\tans = ans * comb(b+c, b) % M;\n\t\tprintf(\"%d\\n\", (int)ans);\n\t}\n    return 0;\n}\n", "problem_context": "MathJax.Hub.Config({ tex2jax: { inlineMath: [[\"$\",\"$\"], [\"\\\\(\",\"\\\\)\"]], processEscapes: true }});\n\n野球観戦\n\n先日，あなたの競技プログラミング仲間であるOさんは野球観戦に出かけた．\n観戦した試合は，チームXとチームYの合計 4 試合の対戦だったが，一方的な展開となり，全試合でチームXが勝利した．\nしかも，4 試合を通じたXの合計得点は 33 点だったのに対し，Yの合計得点はたったの 4 点だった．\n\nあまりに一方的な内容のため，試合内容への興味が薄れてしまったOさんは，試合を観戦している間も競技プログラミングの作問ネタをついつい考えてしまっていた．\nその甲斐もあって，Oさんは以下のような問題を思いついた．\n\n野球チームXとYが対戦し，Xが勝った試合数，Yが勝った試合数，引き分けの試合数がそれぞれ A, B, C 試合だったとする．\nまた，全 A+B+C 試合を通じたX，Yの総得点は，それぞれ SX 点，SY 点だったとする．得点は全て 0 以上の整数である．\nXとYが合計 A+B+C 試合対戦したとき，全試合の結果としてこのような条件を満たす各試合のスコアの並びは何通り有り得るだろうか？\n\nここで，ある試合で勝利する条件は，その試合における得点が，相手チームの得点よりも多いことであり，等しい場合は引き分けとなる．\n\nまた，各試合のスコアの並びを求める際，対戦した全試合の結果を比べた時，XとYの得点の組み合わせが同じでも，その順序が異なれば区別する必要がある．\n例えば，XとYが 2 試合対戦した結果，共に 1 勝ずつし，引き分けが無く，XとYの総得点が共に 1 点ずつだったとする．\nこの場合，各試合におけるX，Yの得点を (Xの得点) - (Yの得点) という表記で表し，合計 2 試合の結果を並べると，以下の 2 通りが与えられた条件を満たす．\n\n1 - 0, 0 - 1\n\n0 - 1, 1 - 0\n\n試合の順序を区別して数えるので，これらは区別される．\n\nあなたにはこの答えを求めるプログラムを作って欲しい．\nただし，求める数はとても大きい数になり得るため，求める数を 1,000,000,007 で割った余りを答えるようにして欲しい．\n\nInput\n\n入力は複数のデータセットからなる．\n各データセットは 1 行からなり，次の形式で表される．\n\nA B C SX SY\n\nここで，A はチームXの勝利数，B はチームYの勝利数，C は引き分けの試合数，SX はチームXの総得点，SY はチームYの総得点を表す．\nA, B, C, SX, SY は全て 0 以上 1,000,000 以下の整数であり，かつ 0 < A+B+C を満たす．\n\n入力の終わりは，5 つのゼロからなる行で示される．\n\nOutput\n\n各データセットについて，与えられた条件を満たす場合の数を 1,000,000,007 で割った余りのみからなる行を 1 行で出力せよ．\n\nSample Input\n\n1 1 0 1 1\n0 0 2 3 2\n4 0 0 33 4\n5 4 2 20 25\n4726 87361 2742 23497 162843\n328324 420923 12782 834286 538297\n0 0 0 0 0\n\nOutput for Sample Input\n\n2\n0\n114660\n512095631\n673703234\n166259450", "sample_input": "1 1 0 1 1\n0 0 2 3 2\n4 0 0 33 4\n5 4 2 20 25\n4726 87361 2742 23497 162843\n328324 420923 12782 834286 538297\n0 0 0 0 0\n"}, "reference_outputs": ["2\n0\n114660\n512095631\n673703234\n166259450\n"], "source_document_id": "p01851", "source_text": "MathJax.Hub.Config({ tex2jax: { inlineMath: [[\"$\",\"$\"], [\"\\\\(\",\"\\\\)\"]], processEscapes: true }});\n\n野球観戦\n\n先日，あなたの競技プログラミング仲間であるOさんは野球観戦に出かけた．\n観戦した試合は，チームXとチームYの合計 4 試合の対戦だったが，一方的な展開となり，全試合でチームXが勝利した．\nしかも，4 試合を通じたXの合計得点は 33 点だったのに対し，Yの合計得点はたったの 4 点だった．\n\nあまりに一方的な内容のため，試合内容への興味が薄れてしまったOさんは，試合を観戦している間も競技プログラミングの作問ネタをついつい考えてしまっていた．\nその甲斐もあって，Oさんは以下のような問題を思いついた．\n\n野球チームXとYが対戦し，Xが勝った試合数，Yが勝った試合数，引き分けの試合数がそれぞれ A, B, C 試合だったとする．\nまた，全 A+B+C 試合を通じたX，Yの総得点は，それぞれ SX 点，SY 点だったとする．得点は全て 0 以上の整数である．\nXとYが合計 A+B+C 試合対戦したとき，全試合の結果としてこのような条件を満たす各試合のスコアの並びは何通り有り得るだろうか？\n\nここで，ある試合で勝利する条件は，その試合における得点が，相手チームの得点よりも多いことであり，等しい場合は引き分けとなる．\n\nまた，各試合のスコアの並びを求める際，対戦した全試合の結果を比べた時，XとYの得点の組み合わせが同じでも，その順序が異なれば区別する必要がある．\n例えば，XとYが 2 試合対戦した結果，共に 1 勝ずつし，引き分けが無く，XとYの総得点が共に 1 点ずつだったとする．\nこの場合，各試合におけるX，Yの得点を (Xの得点) - (Yの得点) という表記で表し，合計 2 試合の結果を並べると，以下の 2 通りが与えられた条件を満たす．\n\n1 - 0, 0 - 1\n\n0 - 1, 1 - 0\n\n試合の順序を区別して数えるので，これらは区別される．\n\nあなたにはこの答えを求めるプログラムを作って欲しい．\nただし，求める数はとても大きい数になり得るため，求める数を 1,000,000,007 で割った余りを答えるようにして欲しい．\n\nInput\n\n入力は複数のデータセットからなる．\n各データセットは 1 行からなり，次の形式で表される．\n\nA B C SX SY\n\nここで，A はチームXの勝利数，B はチームYの勝利数，C は引き分けの試合数，SX はチームXの総得点，SY はチームYの総得点を表す．\nA, B, C, SX, SY は全て 0 以上 1,000,000 以下の整数であり，かつ 0 < A+B+C を満たす．\n\n入力の終わりは，5 つのゼロからなる行で示される．\n\nOutput\n\n各データセットについて，与えられた条件を満たす場合の数を 1,000,000,007 で割った余りのみからなる行を 1 行で出力せよ．\n\nSample Input\n\n1 1 0 1 1\n0 0 2 3 2\n4 0 0 33 4\n5 4 2 20 25\n4726 87361 2742 23497 162843\n328324 420923 12782 834286 538297\n0 0 0 0 0\n\nOutput for Sample Input\n\n2\n0\n114660\n512095631\n673703234\n166259450", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1236, "cpu_time_ms": 220, "memory_kb": 48728}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s806553257", "group_id": "codeNet:p02235", "input_text": "#include<stdio.h>\n#include<string.h>\n#define N 1001\nint main()\n{\n  int n,i,j;\n  char sum[N],num[N];\n  scanf(\"%d\",&n);\n  for(i=0;i<n;i++){\n    scanf(\"%s\",sum);\n    scanf(\"%s\",num);\n    printf(\"%d\\n\",xu(sum,num));\n  }\n  return 0;\n}\n\nint xu(char *S,char *A)\n{\n  int c[N][N],i,j,a,b;\n  a=strlen(S)+1;\n  b=strlen(A)+1;\n  for(i=1;i<a;i++)c[0][i]=0;\n  for(i=0;i<b;i++)c[i][0]=0;\n  \n  for(i=1;i<a;i++){\n    for(j=1;j<b;j++){\n      if(S[i-1]==A[j-1])c[i][j]=c[i-1][j-1]+1;\n      else if(c[i-1][j]>=c[i][j-1])c[i][j]=c[i-1][j];\n      else c[i][j]=c[i][j-1];\n    }\n  }\n  return c[a-1][b-1];\n}\n\n", "language": "C", "metadata": {"date": 1580801344, "filename_ext": "c", "original_language": "C", "problem_description_relpath": "problem_descriptions/p02235.html", "problem_id": "p02235", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02235/input.txt", "sample_output_relpath": "derived/input_output/data/p02235/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02235/C/s806553257.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s806553257", "user_id": "u443776119"}, "prompt_components": {"gold_output": "4\n3\n2\n", "input_to_evaluate": "#include<stdio.h>\n#include<string.h>\n#define N 1001\nint main()\n{\n  int n,i,j;\n  char sum[N],num[N];\n  scanf(\"%d\",&n);\n  for(i=0;i<n;i++){\n    scanf(\"%s\",sum);\n    scanf(\"%s\",num);\n    printf(\"%d\\n\",xu(sum,num));\n  }\n  return 0;\n}\n\nint xu(char *S,char *A)\n{\n  int c[N][N],i,j,a,b;\n  a=strlen(S)+1;\n  b=strlen(A)+1;\n  for(i=1;i<a;i++)c[0][i]=0;\n  for(i=0;i<b;i++)c[i][0]=0;\n  \n  for(i=1;i<a;i++){\n    for(j=1;j<b;j++){\n      if(S[i-1]==A[j-1])c[i][j]=c[i-1][j-1]+1;\n      else if(c[i-1][j]>=c[i][j-1])c[i][j]=c[i-1][j];\n      else c[i][j]=c[i][j-1];\n    }\n  }\n  return c[a-1][b-1];\n}\n\n", "problem_context": "MathJax.Hub.Config({ tex2jax: { inlineMath: [[\"$\",\"$\"], [\"\\\\(\",\"\\\\)\"]], processEscapes: true }});\n\nLongest Common Subsequence\n\nFor given two sequences $X$ and $Y$, a sequence $Z$ is a common subsequence of $X$ and $Y$ if $Z$ is a subsequence of both $X$ and $Y$. For example, if $X = \\{a,b,c,b,d,a,b\\}$ and $Y = \\{b,d,c,a,b,a\\}$, the sequence $\\{b,c,a\\}$ is a common subsequence of both $X$ and $Y$. On the other hand, the sequence $\\{b,c,a\\}$ is not a longest common subsequence (LCS) of $X$ and $Y$, since it has length 3 and the sequence $\\{b,c,b,a\\}$, which is also common to both $X$ and $Y$, has length 4. The sequence $\\{b,c,b,a\\}$ is an LCS of $X$ and $Y$, since there is no common subsequence of length 5 or greater.\n\nWrite a program which finds the length of LCS of given two sequences $X$ and $Y$. The sequence consists of alphabetical characters.\n\nInput\n\nThe input consists of multiple datasets. In the first line, an integer $q$ which is the number of datasets is given. In the following $2 \\times q$ lines, each dataset which consists of the two sequences $X$ and $Y$ are given.\n\nOutput\n\nFor each dataset, print the length of LCS of $X$ and $Y$ in a line.\n\nConstraints\n\n$1 \\leq q \\leq 150$\n\n$1 \\leq$ length of $X$ and $Y$ $\\leq 1,000$\n\n$q \\leq 20$ if the dataset includes a sequence whose length is more than 100\n\nSample Input 1\n\n3\nabcbdab\nbdcaba\nabc\nabc\nabc\nbc\n\nSample Output 1\n\n4\n3\n2\n\nReference\n\nIntroduction to Algorithms, Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein. The MIT Press.", "sample_input": "3\nabcbdab\nbdcaba\nabc\nabc\nabc\nbc\n"}, "reference_outputs": ["4\n3\n2\n"], "source_document_id": "p02235", "source_text": "MathJax.Hub.Config({ tex2jax: { inlineMath: [[\"$\",\"$\"], [\"\\\\(\",\"\\\\)\"]], processEscapes: true }});\n\nLongest Common Subsequence\n\nFor given two sequences $X$ and $Y$, a sequence $Z$ is a common subsequence of $X$ and $Y$ if $Z$ is a subsequence of both $X$ and $Y$. For example, if $X = \\{a,b,c,b,d,a,b\\}$ and $Y = \\{b,d,c,a,b,a\\}$, the sequence $\\{b,c,a\\}$ is a common subsequence of both $X$ and $Y$. On the other hand, the sequence $\\{b,c,a\\}$ is not a longest common subsequence (LCS) of $X$ and $Y$, since it has length 3 and the sequence $\\{b,c,b,a\\}$, which is also common to both $X$ and $Y$, has length 4. The sequence $\\{b,c,b,a\\}$ is an LCS of $X$ and $Y$, since there is no common subsequence of length 5 or greater.\n\nWrite a program which finds the length of LCS of given two sequences $X$ and $Y$. The sequence consists of alphabetical characters.\n\nInput\n\nThe input consists of multiple datasets. In the first line, an integer $q$ which is the number of datasets is given. In the following $2 \\times q$ lines, each dataset which consists of the two sequences $X$ and $Y$ are given.\n\nOutput\n\nFor each dataset, print the length of LCS of $X$ and $Y$ in a line.\n\nConstraints\n\n$1 \\leq q \\leq 150$\n\n$1 \\leq$ length of $X$ and $Y$ $\\leq 1,000$\n\n$q \\leq 20$ if the dataset includes a sequence whose length is more than 100\n\nSample Input 1\n\n3\nabcbdab\nbdcaba\nabc\nabc\nabc\nbc\n\nSample Output 1\n\n4\n3\n2\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": 583, "cpu_time_ms": 30, "memory_kb": 5716}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s515438647", "group_id": "codeNet:p02235", "input_text": "#include<stdio.h>\n#include<string.h>\n\n#define N (1000 + 10)\n#define max(a,b)(a<b?b:a)\n\nint dp[N][N];\nchar a[N],b[N];\n\nint lcs(void)\n{\n  const int a_size=strlen(a)-1;\n  const int b_size=strlen(b)-1;\n\n  int i,j;\n\n  memset(dp,0,sizeof(dp));\n\n  for(i=1;i<a_size+1;++i)\n    {\n      for(j=1;j<b_size+1;++j)\n\t{\n\t  int mx =max(dp[i][j-1],dp[i-1][j]);\n\t  if(a[i-1]==b[j-1])\n\t    {\n\t      mx=max(mx,dp[i-1][j-1]+1);\n\t    }\n\t  dp[i][j]=mx;\n\t}\n    }\n  return dp[a_size][b_size];\n}\n\nint main()\n{\n  int n,i;\n  scanf(\"%d\\n\",&n);\n\n  for(i=0;i<n;i++)\n    {\n      fgets(a,N,stdin);\n      fgets(b,N,stdin);\n      printf(\"%d\\n\",lcs());\n    }\n\n  return 0;\n}\n\n", "language": "C", "metadata": {"date": 1548064769, "filename_ext": "c", "original_language": "C", "problem_description_relpath": "problem_descriptions/p02235.html", "problem_id": "p02235", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02235/input.txt", "sample_output_relpath": "derived/input_output/data/p02235/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02235/C/s515438647.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s515438647", "user_id": "u951545849"}, "prompt_components": {"gold_output": "4\n3\n2\n", "input_to_evaluate": "#include<stdio.h>\n#include<string.h>\n\n#define N (1000 + 10)\n#define max(a,b)(a<b?b:a)\n\nint dp[N][N];\nchar a[N],b[N];\n\nint lcs(void)\n{\n  const int a_size=strlen(a)-1;\n  const int b_size=strlen(b)-1;\n\n  int i,j;\n\n  memset(dp,0,sizeof(dp));\n\n  for(i=1;i<a_size+1;++i)\n    {\n      for(j=1;j<b_size+1;++j)\n\t{\n\t  int mx =max(dp[i][j-1],dp[i-1][j]);\n\t  if(a[i-1]==b[j-1])\n\t    {\n\t      mx=max(mx,dp[i-1][j-1]+1);\n\t    }\n\t  dp[i][j]=mx;\n\t}\n    }\n  return dp[a_size][b_size];\n}\n\nint main()\n{\n  int n,i;\n  scanf(\"%d\\n\",&n);\n\n  for(i=0;i<n;i++)\n    {\n      fgets(a,N,stdin);\n      fgets(b,N,stdin);\n      printf(\"%d\\n\",lcs());\n    }\n\n  return 0;\n}\n\n", "problem_context": "MathJax.Hub.Config({ tex2jax: { inlineMath: [[\"$\",\"$\"], [\"\\\\(\",\"\\\\)\"]], processEscapes: true }});\n\nLongest Common Subsequence\n\nFor given two sequences $X$ and $Y$, a sequence $Z$ is a common subsequence of $X$ and $Y$ if $Z$ is a subsequence of both $X$ and $Y$. For example, if $X = \\{a,b,c,b,d,a,b\\}$ and $Y = \\{b,d,c,a,b,a\\}$, the sequence $\\{b,c,a\\}$ is a common subsequence of both $X$ and $Y$. On the other hand, the sequence $\\{b,c,a\\}$ is not a longest common subsequence (LCS) of $X$ and $Y$, since it has length 3 and the sequence $\\{b,c,b,a\\}$, which is also common to both $X$ and $Y$, has length 4. The sequence $\\{b,c,b,a\\}$ is an LCS of $X$ and $Y$, since there is no common subsequence of length 5 or greater.\n\nWrite a program which finds the length of LCS of given two sequences $X$ and $Y$. The sequence consists of alphabetical characters.\n\nInput\n\nThe input consists of multiple datasets. In the first line, an integer $q$ which is the number of datasets is given. In the following $2 \\times q$ lines, each dataset which consists of the two sequences $X$ and $Y$ are given.\n\nOutput\n\nFor each dataset, print the length of LCS of $X$ and $Y$ in a line.\n\nConstraints\n\n$1 \\leq q \\leq 150$\n\n$1 \\leq$ length of $X$ and $Y$ $\\leq 1,000$\n\n$q \\leq 20$ if the dataset includes a sequence whose length is more than 100\n\nSample Input 1\n\n3\nabcbdab\nbdcaba\nabc\nabc\nabc\nbc\n\nSample Output 1\n\n4\n3\n2\n\nReference\n\nIntroduction to Algorithms, Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein. The MIT Press.", "sample_input": "3\nabcbdab\nbdcaba\nabc\nabc\nabc\nbc\n"}, "reference_outputs": ["4\n3\n2\n"], "source_document_id": "p02235", "source_text": "MathJax.Hub.Config({ tex2jax: { inlineMath: [[\"$\",\"$\"], [\"\\\\(\",\"\\\\)\"]], processEscapes: true }});\n\nLongest Common Subsequence\n\nFor given two sequences $X$ and $Y$, a sequence $Z$ is a common subsequence of $X$ and $Y$ if $Z$ is a subsequence of both $X$ and $Y$. For example, if $X = \\{a,b,c,b,d,a,b\\}$ and $Y = \\{b,d,c,a,b,a\\}$, the sequence $\\{b,c,a\\}$ is a common subsequence of both $X$ and $Y$. On the other hand, the sequence $\\{b,c,a\\}$ is not a longest common subsequence (LCS) of $X$ and $Y$, since it has length 3 and the sequence $\\{b,c,b,a\\}$, which is also common to both $X$ and $Y$, has length 4. The sequence $\\{b,c,b,a\\}$ is an LCS of $X$ and $Y$, since there is no common subsequence of length 5 or greater.\n\nWrite a program which finds the length of LCS of given two sequences $X$ and $Y$. The sequence consists of alphabetical characters.\n\nInput\n\nThe input consists of multiple datasets. In the first line, an integer $q$ which is the number of datasets is given. In the following $2 \\times q$ lines, each dataset which consists of the two sequences $X$ and $Y$ are given.\n\nOutput\n\nFor each dataset, print the length of LCS of $X$ and $Y$ in a line.\n\nConstraints\n\n$1 \\leq q \\leq 150$\n\n$1 \\leq$ length of $X$ and $Y$ $\\leq 1,000$\n\n$q \\leq 20$ if the dataset includes a sequence whose length is more than 100\n\nSample Input 1\n\n3\nabcbdab\nbdcaba\nabc\nabc\nabc\nbc\n\nSample Output 1\n\n4\n3\n2\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": 638, "cpu_time_ms": 40, "memory_kb": 5840}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s135053474", "group_id": "codeNet:p02243", "input_text": "#include <stdio.h>\n#include <stdlib.h>\n#define N 10000\n#define INF 200000\n#define WHITE 0\n#define GRAY 1\n#define BLACK 2\n\nint G[N][N], n;\n\nvoid dijkstra(void) {\n  int *d, *color;\n  int i, u, mincost;\n\n  d = (int*)malloc(sizeof(int) * n);\n  color = (int*)malloc(sizeof(int) * n);\n  for(i = 0; i < n; i++) {\n    d[i] = INF;\n    color[i] = WHITE;\n  }\n  d[0] = 0;\n\n  while(1){\n    mincost = INF;\n    for(i = 0; i < n; i++) {\n      if(color[i] != BLACK && d[i] < mincost){\n        mincost = d[i];\n        u = i;\n      }\n    }\n    if(mincost == INF) break;\n    color[u] = BLACK;\n    for(i = 0; i < n; i++) {\n      if(color[i] != BLACK && G[u][i] != INF && d[u] + G[u][i] < d[i]) {\n        d[i] = d[u] + G[u][i];\n      }\n    }\n  }\n  for(i = 0; i < n; i++) {\n    printf(\"%d %d\\n\", i, d[i]);\n  }\n}\n\nint main(){\n  int i, j, u, v, k, c;\n\n  scanf(\"%d\",&n);\n  for(i = 0; i < n; i++) {\n    for(j = 0; j < n; j++) {\n      G[i][j] = INF;\n    }\n  }\n\n  for(i = 0; i < n; i++) {\n    scanf(\"%d\", &u);\n    scanf(\"%d\", &k);\n    for(j = 0; j < k; j++) {\n      scanf(\"%d\", &v);\n      scanf(\"%d\", &c);\n      G[u][v] = c;\n    }\n  }\n  dijkstra();\n  return 0;\n}", "language": "C", "metadata": {"date": 1501863392, "filename_ext": "c", "original_language": "C", "problem_description_relpath": "problem_descriptions/p02243.html", "problem_id": "p02243", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02243/input.txt", "sample_output_relpath": "derived/input_output/data/p02243/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02243/C/s135053474.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Memory Limit Exceeded", "submission_id": "s135053474", "user_id": "u230060231"}, "prompt_components": {"gold_output": "0 0\n1 2\n2 2\n3 1\n4 3\n", "input_to_evaluate": "#include <stdio.h>\n#include <stdlib.h>\n#define N 10000\n#define INF 200000\n#define WHITE 0\n#define GRAY 1\n#define BLACK 2\n\nint G[N][N], n;\n\nvoid dijkstra(void) {\n  int *d, *color;\n  int i, u, mincost;\n\n  d = (int*)malloc(sizeof(int) * n);\n  color = (int*)malloc(sizeof(int) * n);\n  for(i = 0; i < n; i++) {\n    d[i] = INF;\n    color[i] = WHITE;\n  }\n  d[0] = 0;\n\n  while(1){\n    mincost = INF;\n    for(i = 0; i < n; i++) {\n      if(color[i] != BLACK && d[i] < mincost){\n        mincost = d[i];\n        u = i;\n      }\n    }\n    if(mincost == INF) break;\n    color[u] = BLACK;\n    for(i = 0; i < n; i++) {\n      if(color[i] != BLACK && G[u][i] != INF && d[u] + G[u][i] < d[i]) {\n        d[i] = d[u] + G[u][i];\n      }\n    }\n  }\n  for(i = 0; i < n; i++) {\n    printf(\"%d %d\\n\", i, d[i]);\n  }\n}\n\nint main(){\n  int i, j, u, v, k, c;\n\n  scanf(\"%d\",&n);\n  for(i = 0; i < n; i++) {\n    for(j = 0; j < n; j++) {\n      G[i][j] = INF;\n    }\n  }\n\n  for(i = 0; i < n; i++) {\n    scanf(\"%d\", &u);\n    scanf(\"%d\", &k);\n    for(j = 0; j < k; j++) {\n      scanf(\"%d\", &v);\n      scanf(\"%d\", &c);\n      G[u][v] = c;\n    }\n  }\n  dijkstra();\n  return 0;\n}", "problem_context": "MathJax.Hub.Config({ tex2jax: { inlineMath: [[\"$\",\"$\"], [\"\\\\(\",\"\\\\)\"]], processEscapes: true }});\n\nSingle Source Shortest Path II\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 10,000$\n\n$0 \\leq c_i \\leq 100,000$\n\n$|E| < 500,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": "p02243", "source_text": "MathJax.Hub.Config({ tex2jax: { inlineMath: [[\"$\",\"$\"], [\"\\\\(\",\"\\\\)\"]], processEscapes: true }});\n\nSingle Source Shortest Path II\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 10,000$\n\n$0 \\leq c_i \\leq 100,000$\n\n$|E| < 500,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": 1133, "cpu_time_ms": 590, "memory_kb": 391296}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s109030495", "group_id": "codeNet:p02245", "input_text": "#include <stdio.h>\n#include <stdlib.h>\n \n#define tate 3\n#define yoko 3\n#define Total (tate*yoko)\n\nextern inline void down_0(void);\nextern inline void up_0(void);\nextern inline void right_0(void);\nextern inline void left_0(void);\n\nextern int  serch(int x, int y, int MaxCnt, int pre);\nextern int  check(void);\n\nint cnt,num = 0;\nint val[Total] ={};\n\n\nint main( void )\n{\n    int i = 0;\n    int x,y = 0;\n    \n    for(i=0; i<Total; i++)\n    {\n        scanf(\"%d\",&val[i]);\n        \n        if(val[i] == 0)\n        {\n            num = i;\n        }\n    }\n    \n    x = tate - (num/yoko) -1;\n    y = yoko - (num%yoko) -1;\n    \n    for(i=1; i<20; i++)\n    {\n        if( serch(x,y,i,4) == 1 )\n        {\n            printf(\"%d\\n\",i);\n            break;\n        }\n    }     \n    \n    return 0;\n}\n\nint serch(int x, int y, int MaxCnt, int pre)\n{\n    int result;\n    int i=0;\n    \n    // 最大数で打ち切り\n    if(MaxCnt==0)\n    {\n        return check();\n    }\n    \n    // 上下左右で4回回す\n    for(i=0; i<4; i++)\n    {\n        result = 0;\n        \n        switch(i)\n        {\n            case 0:\n                if( (x > 0) && (pre != 3) )\n                {\n                    down_0();\n                    \n                    result = serch(x-1, y, MaxCnt-1, 0);\n                    \n                    up_0();\n                }\n                break;\n            case 1:\n                if( (y > 0) && (pre != 2) )\n                {\n                    right_0();\n                    \n                    result = serch(x, y-1, MaxCnt-1, 1);\n                    \n                    left_0();\n                }\n                break;\n            case 2:\n                if( (y < yoko) && (pre != 1) )\n                {\n                    left_0();\n                    \n                    result = serch(x, y+1, MaxCnt-1, 2);\n                    \n                    right_0();\n                }\n                break;\n            case 3:\n                if( (x < tate) && (pre != 0) )\n                {\n                    up_0();\n                    \n                    result = serch(x+1, y, MaxCnt-1, 3);\n                    \n                    down_0();\n                }\n                break;\n            default:\n                break;\n        }\n        \n        if(result)\n        {\n            return 1;\n        }\n        \n    }\n\n    return 0;\n}\n\n// TRUE : 完成\n// FALSE : 失敗\nint check()\n{\n    int i=0;\n    \n//    printf(\"%d%d%d%d%d%d%d%d%d\\n\", val[0], val[1], val[2], val[3], val[4], val[5], val[6], val[7], val[8]);\n    \n    for(i=0; i<Total-1; i++)\n    {\n        if(val[i] != (i+1))\n        {\n            return 0;\n        }\n    }\n    return 1;\n}\n\ninline void down_0()\n{\n    val[num] = val[num + yoko];\n    num = num + yoko;\n}\n \ninline void up_0()\n{\n    val[num] = val[num - yoko];\n    num = num - yoko;\n}\n \ninline void right_0()\n{\n    val[num] = val[num +1];\n    num = num + 1;\n}\n \ninline void left_0()\n{\n    val[num] = val[num -1];\n    num = num - 1;\n}\n", "language": "C", "metadata": {"date": 1519148875, "filename_ext": "c", "original_language": "C", "problem_description_relpath": "problem_descriptions/p02245.html", "problem_id": "p02245", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02245/input.txt", "sample_output_relpath": "derived/input_output/data/p02245/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02245/C/s109030495.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s109030495", "user_id": "u695621538"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "#include <stdio.h>\n#include <stdlib.h>\n \n#define tate 3\n#define yoko 3\n#define Total (tate*yoko)\n\nextern inline void down_0(void);\nextern inline void up_0(void);\nextern inline void right_0(void);\nextern inline void left_0(void);\n\nextern int  serch(int x, int y, int MaxCnt, int pre);\nextern int  check(void);\n\nint cnt,num = 0;\nint val[Total] ={};\n\n\nint main( void )\n{\n    int i = 0;\n    int x,y = 0;\n    \n    for(i=0; i<Total; i++)\n    {\n        scanf(\"%d\",&val[i]);\n        \n        if(val[i] == 0)\n        {\n            num = i;\n        }\n    }\n    \n    x = tate - (num/yoko) -1;\n    y = yoko - (num%yoko) -1;\n    \n    for(i=1; i<20; i++)\n    {\n        if( serch(x,y,i,4) == 1 )\n        {\n            printf(\"%d\\n\",i);\n            break;\n        }\n    }     \n    \n    return 0;\n}\n\nint serch(int x, int y, int MaxCnt, int pre)\n{\n    int result;\n    int i=0;\n    \n    // 最大数で打ち切り\n    if(MaxCnt==0)\n    {\n        return check();\n    }\n    \n    // 上下左右で4回回す\n    for(i=0; i<4; i++)\n    {\n        result = 0;\n        \n        switch(i)\n        {\n            case 0:\n                if( (x > 0) && (pre != 3) )\n                {\n                    down_0();\n                    \n                    result = serch(x-1, y, MaxCnt-1, 0);\n                    \n                    up_0();\n                }\n                break;\n            case 1:\n                if( (y > 0) && (pre != 2) )\n                {\n                    right_0();\n                    \n                    result = serch(x, y-1, MaxCnt-1, 1);\n                    \n                    left_0();\n                }\n                break;\n            case 2:\n                if( (y < yoko) && (pre != 1) )\n                {\n                    left_0();\n                    \n                    result = serch(x, y+1, MaxCnt-1, 2);\n                    \n                    right_0();\n                }\n                break;\n            case 3:\n                if( (x < tate) && (pre != 0) )\n                {\n                    up_0();\n                    \n                    result = serch(x+1, y, MaxCnt-1, 3);\n                    \n                    down_0();\n                }\n                break;\n            default:\n                break;\n        }\n        \n        if(result)\n        {\n            return 1;\n        }\n        \n    }\n\n    return 0;\n}\n\n// TRUE : 完成\n// FALSE : 失敗\nint check()\n{\n    int i=0;\n    \n//    printf(\"%d%d%d%d%d%d%d%d%d\\n\", val[0], val[1], val[2], val[3], val[4], val[5], val[6], val[7], val[8]);\n    \n    for(i=0; i<Total-1; i++)\n    {\n        if(val[i] != (i+1))\n        {\n            return 0;\n        }\n    }\n    return 1;\n}\n\ninline void down_0()\n{\n    val[num] = val[num + yoko];\n    num = num + yoko;\n}\n \ninline void up_0()\n{\n    val[num] = val[num - yoko];\n    num = num - yoko;\n}\n \ninline void right_0()\n{\n    val[num] = val[num +1];\n    num = num + 1;\n}\n \ninline void left_0()\n{\n    val[num] = val[num -1];\n    num = num - 1;\n}\n", "problem_context": "MathJax.Hub.Config({ tex2jax: { inlineMath: [[\"$\",\"$\"], [\"\\\\(\",\"\\\\)\"]], processEscapes: true }});\n\n8 Puzzle\n\nThe goal of the 8 puzzle problem is to complete pieces on $3 \\times 3$ cells where one of the cells is empty space.\n\nIn this problem, the space is represented by 0 and pieces are represented by integers from 1 to 8 as shown below.\n\n1 3 0\n4 2 5\n7 8 6\n\nYou can move a piece toward the empty space at one step. Your goal is to make the pieces the following configuration in the shortest move (fewest steps).\n\n1 2 3\n4 5 6\n7 8 0\n\nWrite a program which reads an initial state of the puzzle and prints the fewest steps to solve the puzzle.\n\nInput\n\nThe $3 \\times 3$ integers denoting the pieces or space are given.\n\nOutput\n\nPrint the fewest steps in a line.\n\nConstraints\n\nThere is a solution.\n\nSample Input\n\n1 3 0\n4 2 5\n7 8 6\n\nSample Output\n\n4", "sample_input": "1 3 0\n4 2 5\n7 8 6\n"}, "reference_outputs": ["4\n"], "source_document_id": "p02245", "source_text": "MathJax.Hub.Config({ tex2jax: { inlineMath: [[\"$\",\"$\"], [\"\\\\(\",\"\\\\)\"]], processEscapes: true }});\n\n8 Puzzle\n\nThe goal of the 8 puzzle problem is to complete pieces on $3 \\times 3$ cells where one of the cells is empty space.\n\nIn this problem, the space is represented by 0 and pieces are represented by integers from 1 to 8 as shown below.\n\n1 3 0\n4 2 5\n7 8 6\n\nYou can move a piece toward the empty space at one step. Your goal is to make the pieces the following configuration in the shortest move (fewest steps).\n\n1 2 3\n4 5 6\n7 8 0\n\nWrite a program which reads an initial state of the puzzle and prints the fewest steps to solve the puzzle.\n\nInput\n\nThe $3 \\times 3$ integers denoting the pieces or space are given.\n\nOutput\n\nPrint the fewest steps in a line.\n\nConstraints\n\nThere is a solution.\n\nSample Input\n\n1 3 0\n4 2 5\n7 8 6\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": 2980, "cpu_time_ms": 50, "memory_kb": 2100}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s505096350", "group_id": "codeNet:p02246", "input_text": "#include<stdio.h>\n#include<stdlib.h>\n#include<string.h>\n\n#define N 4\n#define S 16\n\ntypedef struct P{\n  int f[S],space,m;\n}Puzzle;\n\nint dx[4]={0,-1,0,1};\nint dy[4]={1,0,-1,0};\n\nint MDT[S][S];\n\nint limit;\nint path[100];\nPuzzle st;\n\nint get(Puzzle Z){\n  int i,sum=0;\n  for(i=0;i<S;i++){\n    if(Z.f[i] == S) continue;\n    sum+=MDT[i][Z.f[i]-1];\n  }\n  return sum;\n}\n\nint max(int a,int b){\n  if(a<b) return b;\n  else return a;\n}\nint min(int a,int b){\n  if(a<b) return a;\n  else return b;\n}\nvoid swap(int *a,int *b){\n  int t;\n  t=*a;\n  *a=*b;\n  *b=t;\n}\n\nchar dfs(int df,int p){\n  int sx,sy,tx,ty,i;\n  Puzzle tmp;\n\n  if(st.m==0)return 1;\n  if(df+st.m>limit)return 0;\n\n  sx=st.space/N;\n  sy=st.space%N;\n\n  for(i=0;i<4;i++){\n    tx=sx+dx[i];\n    ty=sy+dy[i];\n\n    if(tx<0||tx>=N||ty<0||ty>=N) continue;\n    if(max(p,i)-min(p,i)==2)continue;\n    tmp=st;\n\n    st.m-=MDT[tx*N+ty][st.f[tx*N+ty]-1];\n    st.m+=MDT[sx*N+sy][st.f[tx*N+ty]-1];\n\n    //printf(\"st.m=%d\\n\",st.m);\n\n    swap(&st.f[tx*N+ty],&st.f[sx*N+sy]);\n\n    st.space=tx*N+ty;\n    if(dfs(df+1,i)){\n      path[df]=i;\n      return 1;\n    }\n    st=tmp;\n  }\n  return 0;\n}\n\nint id(Puzzle in){\n  int i;\n  int ans=0;\n\n  in.m=get(in);\n\n  for(limit=in.m;limit<=100;limit++){\n      //  printf(\"aaa\\n\");\n    st=in;\n    if(dfs(0,-100)){\n      ans=0;;\n      for(i=0;i<limit;i++) ans++;\n      return ans;\n    }\n  }\n  return -1;\n}\n\nint main(){\n  int i,j;\n  Puzzle in; \n  for(i=0;i<S;i++) for(j=0;j<S;j++) MDT[i][j]=abs(i/N-j/N)+abs(i%N-j%N);\n  for(i=0;i<S;i++){\n    //printf(\"aaa\\n\");\n    scanf(\"%d\",&in.f[i]);\n    if(in.f[i]==0){\n      in.f[i]=S;\n      in.space=i;\n    }\n  }\n  printf(\"%d\\n\",id(in));\n\n  return 0;\n}\n\n\n\n\n\n\n\n\n\n", "language": "C", "metadata": {"date": 1549301190, "filename_ext": "c", "original_language": "C", "problem_description_relpath": "problem_descriptions/p02246.html", "problem_id": "p02246", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02246/input.txt", "sample_output_relpath": "derived/input_output/data/p02246/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02246/C/s505096350.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s505096350", "user_id": "u494048940"}, "prompt_components": {"gold_output": "8\n", "input_to_evaluate": "#include<stdio.h>\n#include<stdlib.h>\n#include<string.h>\n\n#define N 4\n#define S 16\n\ntypedef struct P{\n  int f[S],space,m;\n}Puzzle;\n\nint dx[4]={0,-1,0,1};\nint dy[4]={1,0,-1,0};\n\nint MDT[S][S];\n\nint limit;\nint path[100];\nPuzzle st;\n\nint get(Puzzle Z){\n  int i,sum=0;\n  for(i=0;i<S;i++){\n    if(Z.f[i] == S) continue;\n    sum+=MDT[i][Z.f[i]-1];\n  }\n  return sum;\n}\n\nint max(int a,int b){\n  if(a<b) return b;\n  else return a;\n}\nint min(int a,int b){\n  if(a<b) return a;\n  else return b;\n}\nvoid swap(int *a,int *b){\n  int t;\n  t=*a;\n  *a=*b;\n  *b=t;\n}\n\nchar dfs(int df,int p){\n  int sx,sy,tx,ty,i;\n  Puzzle tmp;\n\n  if(st.m==0)return 1;\n  if(df+st.m>limit)return 0;\n\n  sx=st.space/N;\n  sy=st.space%N;\n\n  for(i=0;i<4;i++){\n    tx=sx+dx[i];\n    ty=sy+dy[i];\n\n    if(tx<0||tx>=N||ty<0||ty>=N) continue;\n    if(max(p,i)-min(p,i)==2)continue;\n    tmp=st;\n\n    st.m-=MDT[tx*N+ty][st.f[tx*N+ty]-1];\n    st.m+=MDT[sx*N+sy][st.f[tx*N+ty]-1];\n\n    //printf(\"st.m=%d\\n\",st.m);\n\n    swap(&st.f[tx*N+ty],&st.f[sx*N+sy]);\n\n    st.space=tx*N+ty;\n    if(dfs(df+1,i)){\n      path[df]=i;\n      return 1;\n    }\n    st=tmp;\n  }\n  return 0;\n}\n\nint id(Puzzle in){\n  int i;\n  int ans=0;\n\n  in.m=get(in);\n\n  for(limit=in.m;limit<=100;limit++){\n      //  printf(\"aaa\\n\");\n    st=in;\n    if(dfs(0,-100)){\n      ans=0;;\n      for(i=0;i<limit;i++) ans++;\n      return ans;\n    }\n  }\n  return -1;\n}\n\nint main(){\n  int i,j;\n  Puzzle in; \n  for(i=0;i<S;i++) for(j=0;j<S;j++) MDT[i][j]=abs(i/N-j/N)+abs(i%N-j%N);\n  for(i=0;i<S;i++){\n    //printf(\"aaa\\n\");\n    scanf(\"%d\",&in.f[i]);\n    if(in.f[i]==0){\n      in.f[i]=S;\n      in.space=i;\n    }\n  }\n  printf(\"%d\\n\",id(in));\n\n  return 0;\n}\n\n\n\n\n\n\n\n\n\n", "problem_context": "MathJax.Hub.Config({ tex2jax: { inlineMath: [[\"$\",\"$\"], [\"\\\\(\",\"\\\\)\"]], processEscapes: true }});\n\n15 Puzzle\n\nThe goal of the 15 puzzle problem is to complete pieces on $4 \\times 4$ cells where one of the cells is empty space.\n\nIn this problem, the space is represented by 0 and pieces are represented by integers from 1 to 15 as shown below.\n\n1 2 3 4\n6 7 8 0\n5 10 11 12\n9 13 14 15\n\nYou can move a piece toward the empty space at one step. Your goal is to make the pieces the following configuration in the shortest move (fewest steps).\n\n1 2 3 4\n5 6 7 8\n9 10 11 12\n13 14 15 0\n\nWrite a program which reads an initial state of the puzzle and prints the fewest steps to solve the puzzle.\n\nInput\n\nThe $4 \\times 4$ integers denoting the pieces or space are given.\n\nOutput\n\nPrint the fewest steps in a line.\n\nConstraints\n\nThe given puzzle is solvable in at most 45 steps.\n\nSample Input\n\n1 2 3 4\n6 7 8 0\n5 10 11 12\n9 13 14 15\n\nSample Output\n\n8", "sample_input": "1 2 3 4\n6 7 8 0\n5 10 11 12\n9 13 14 15\n"}, "reference_outputs": ["8\n"], "source_document_id": "p02246", "source_text": "MathJax.Hub.Config({ tex2jax: { inlineMath: [[\"$\",\"$\"], [\"\\\\(\",\"\\\\)\"]], processEscapes: true }});\n\n15 Puzzle\n\nThe goal of the 15 puzzle problem is to complete pieces on $4 \\times 4$ cells where one of the cells is empty space.\n\nIn this problem, the space is represented by 0 and pieces are represented by integers from 1 to 15 as shown below.\n\n1 2 3 4\n6 7 8 0\n5 10 11 12\n9 13 14 15\n\nYou can move a piece toward the empty space at one step. Your goal is to make the pieces the following configuration in the shortest move (fewest steps).\n\n1 2 3 4\n5 6 7 8\n9 10 11 12\n13 14 15 0\n\nWrite a program which reads an initial state of the puzzle and prints the fewest steps to solve the puzzle.\n\nInput\n\nThe $4 \\times 4$ integers denoting the pieces or space are given.\n\nOutput\n\nPrint the fewest steps in a line.\n\nConstraints\n\nThe given puzzle is solvable in at most 45 steps.\n\nSample Input\n\n1 2 3 4\n6 7 8 0\n5 10 11 12\n9 13 14 15\n\nSample Output\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": 1657, "cpu_time_ms": 70, "memory_kb": 2104}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s741786702", "group_id": "codeNet:p02248", "input_text": "#include <stdio.h>\n#include <stdlib.h>\n#include <string.h>\n\n#define N_T 1000001\n#define N_P 10001\n#define BASE 64\n\nint* kmpSearch(char*, char*);\nint* initNext(char*);\n\nint myIndex(char);\n\nint main() {\n  char T[N_T];\n  char P[N_P];\n  int* pos;\n\n  int i;\n    \n  while (scanf(\"%s %s\", T, P) != EOF) {\n    pos = kmpSearch(T, P);\n\n    for (i = 1; i <= pos[0]; ++i) {\n      printf(\"%d\\n\", pos[i]);\n    }\n  }\n\n  return 0;\n}\n\nint* kmpSearch(char* T, char* P) {\n  int i, j;\n  int cnt = 0;\n  int M   = strlen(P);\n  int N   = strlen(T);\n  \n  int* next;\n  int* pos;\n\n  if (N < M) {\n    pos    = (int*)malloc(sizeof(int)*1);\n    pos[0] = 0;\n    return pos;\n  } else {\n    pos = (int*)malloc(sizeof(int)*(N-M+2));\n  }\n  \n  next = initNext(P);  \n  for (i = 0, j = 0; i < N; ++i, ++j) {\n    while ((j >= 0) && (T[i] != P[j])){\n      j = next[j];\n    }\n\n    if (j == M - 1) {\n      cnt++;\n      pos[cnt] = i - M + 1;\n\n      do {\n\tj = next[j];\n      }\twhile ((j >= 0) && (T[i] != P[j]));\n    }\n  }\n  pos[0] = cnt;\n  \n  return pos;\n}\n\nint* initNext(char* P){\n  int i, j;\n  int M = strlen(P);\n  int* next = (int*)malloc(sizeof(int)*M);\n\n  next[0] = -1;\n  for (i = 0, j = -1; i < M; ++i, ++j, next[i] = j) {\n    while ((j >= 0) && (P[i] != P[j])) {\n      j = next[j];\n    }\n  }\n  \n  return next;\n}", "language": "C", "metadata": {"date": 1502116673, "filename_ext": "c", "original_language": "C", "problem_description_relpath": "problem_descriptions/p02248.html", "problem_id": "p02248", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02248/input.txt", "sample_output_relpath": "derived/input_output/data/p02248/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02248/C/s741786702.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s741786702", "user_id": "u495168226"}, "prompt_components": {"gold_output": "0\n3\n4\n", "input_to_evaluate": "#include <stdio.h>\n#include <stdlib.h>\n#include <string.h>\n\n#define N_T 1000001\n#define N_P 10001\n#define BASE 64\n\nint* kmpSearch(char*, char*);\nint* initNext(char*);\n\nint myIndex(char);\n\nint main() {\n  char T[N_T];\n  char P[N_P];\n  int* pos;\n\n  int i;\n    \n  while (scanf(\"%s %s\", T, P) != EOF) {\n    pos = kmpSearch(T, P);\n\n    for (i = 1; i <= pos[0]; ++i) {\n      printf(\"%d\\n\", pos[i]);\n    }\n  }\n\n  return 0;\n}\n\nint* kmpSearch(char* T, char* P) {\n  int i, j;\n  int cnt = 0;\n  int M   = strlen(P);\n  int N   = strlen(T);\n  \n  int* next;\n  int* pos;\n\n  if (N < M) {\n    pos    = (int*)malloc(sizeof(int)*1);\n    pos[0] = 0;\n    return pos;\n  } else {\n    pos = (int*)malloc(sizeof(int)*(N-M+2));\n  }\n  \n  next = initNext(P);  \n  for (i = 0, j = 0; i < N; ++i, ++j) {\n    while ((j >= 0) && (T[i] != P[j])){\n      j = next[j];\n    }\n\n    if (j == M - 1) {\n      cnt++;\n      pos[cnt] = i - M + 1;\n\n      do {\n\tj = next[j];\n      }\twhile ((j >= 0) && (T[i] != P[j]));\n    }\n  }\n  pos[0] = cnt;\n  \n  return pos;\n}\n\nint* initNext(char* P){\n  int i, j;\n  int M = strlen(P);\n  int* next = (int*)malloc(sizeof(int)*M);\n\n  next[0] = -1;\n  for (i = 0, j = -1; i < M; ++i, ++j, next[i] = j) {\n    while ((j >= 0) && (P[i] != P[j])) {\n      j = next[j];\n    }\n  }\n  \n  return next;\n}", "problem_context": "String Search\n\nFind places where a string P is found within a text T.\nPrint all indices of T where P found. The indices of T start with 0.\n\nInput\n\nIn the first line, a text T is given. In the second line, a string P is given.\n\nOutput\n\nPrint an index of T where P found in a line. Print the indices in ascending order.\n\nConstraints\n\n1 ≤ length of T ≤ 1000000\n\n1 ≤ length of P ≤ 10000\n\nThe input consists of alphabetical characters and digits\n\nSample Input 1\n\naabaaa\naa\n\nSample Output 1\n\n0\n3\n4\n\nSample Input 2\n\nxyzz\nyz\n\nSample Output 2\n\n1\n\nSample Input 3\n\nabc\nxyz\n\nSample Output 3\n\nThe output should be empty.", "sample_input": "aabaaa\naa\n"}, "reference_outputs": ["0\n3\n4\n"], "source_document_id": "p02248", "source_text": "String Search\n\nFind places where a string P is found within a text T.\nPrint all indices of T where P found. The indices of T start with 0.\n\nInput\n\nIn the first line, a text T is given. In the second line, a string P is given.\n\nOutput\n\nPrint an index of T where P found in a line. Print the indices in ascending order.\n\nConstraints\n\n1 ≤ length of T ≤ 1000000\n\n1 ≤ length of P ≤ 10000\n\nThe input consists of alphabetical characters and digits\n\nSample Input 1\n\naabaaa\naa\n\nSample Output 1\n\n0\n3\n4\n\nSample Input 2\n\nxyzz\nyz\n\nSample Output 2\n\n1\n\nSample Input 3\n\nabc\nxyz\n\nSample Output 3\n\nThe output should be empty.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1276, "cpu_time_ms": 80, "memory_kb": 5468}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s480866313", "group_id": "codeNet:p02255", "input_text": "#include<stdio.h>\n\nint main(){\n  int N,i,j,v;\n  int key;\n  int A[100];\n  scanf(\"%d\",&N);\n  for(i=0;i<N;i++){\n    scanf(\"%d\",&A[i]);\n  }\n  for(i=1;i=N-1;i++){\n    v=A[i];\n    j=i-1;\n    \n    while(j>=0 && A[j]>v){\n      A[j+1]=A[j];\n      j--;\n      A[j+1]=v;\n      \n    }\n    for(j=0;j<N;j++){\n      printf(\"%d\",A[i]);\n      if(j !=N-1)printf(\" \");\n    }\n    printf(\"\\n\");\n  }\n  \n  return 0;\n}", "language": "C", "metadata": {"date": 1460524830, "filename_ext": "c", "original_language": "C", "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/C/s480866313.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s480866313", "user_id": "u121402035"}, "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": "#include<stdio.h>\n\nint main(){\n  int N,i,j,v;\n  int key;\n  int A[100];\n  scanf(\"%d\",&N);\n  for(i=0;i<N;i++){\n    scanf(\"%d\",&A[i]);\n  }\n  for(i=1;i=N-1;i++){\n    v=A[i];\n    j=i-1;\n    \n    while(j>=0 && A[j]>v){\n      A[j+1]=A[j];\n      j--;\n      A[j+1]=v;\n      \n    }\n    for(j=0;j<N;j++){\n      printf(\"%d\",A[i]);\n      if(j !=N-1)printf(\" \");\n    }\n    printf(\"\\n\");\n  }\n  \n  return 0;\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": 393, "cpu_time_ms": 20000, "memory_kb": 596}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s113141275", "group_id": "codeNet:p02257", "input_text": "#include<stdio.h>\n#include<math.h>\n\nint sosudiagnosis(int);\n\nint main()\n{\n  int n; //入力できる個数\n  int s; //数\n  int l=0; //ループの回数\n  int count=0;//素数の数\n\n  scanf(\"%d\",&n);\n  while(l < n){\n    l++;\n    scanf(\"%d\",&s);\n\n    if(sosudiagnosis(s)==1) count++;\n  }\n  printf(\"%d\\n\",count);\n  return 0;\n}\n\nint sosudiagnosis(int s)\n{\n  int i=3;\n  if(s == 2) return 1;\n\n  if(s < 2 || s%2==0) return 0;\n\n  while(i <= sqrt(s)){\n    if(s%i==0) return 0;\n  \n    i = i + 2;\n  }\n  return 1;\n}", "language": "C", "metadata": {"date": 1428895320, "filename_ext": "c", "original_language": "C", "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/C/s113141275.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s113141275", "user_id": "u261573393"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "#include<stdio.h>\n#include<math.h>\n\nint sosudiagnosis(int);\n\nint main()\n{\n  int n; //入力できる個数\n  int s; //数\n  int l=0; //ループの回数\n  int count=0;//素数の数\n\n  scanf(\"%d\",&n);\n  while(l < n){\n    l++;\n    scanf(\"%d\",&s);\n\n    if(sosudiagnosis(s)==1) count++;\n  }\n  printf(\"%d\\n\",count);\n  return 0;\n}\n\nint sosudiagnosis(int s)\n{\n  int i=3;\n  if(s == 2) return 1;\n\n  if(s < 2 || s%2==0) return 0;\n\n  while(i <= sqrt(s)){\n    if(s%i==0) return 0;\n  \n    i = i + 2;\n  }\n  return 1;\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": 506, "cpu_time_ms": 10, "memory_kb": 596}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s708084849", "group_id": "codeNet:p02257", "input_text": "#include<stdio.h>\nint main(void){\nint i,x,sum=0;\nlong int n;\nscanf(\"%d\",&i);\nfor(x=0;x<i;x++){\nscanf(\"%ld\",&n);\nif(1==IsPrime(n)){sum+=1;}\n}\nprintf(\"%d\\n\",sum);\nreturn 0;\n}\n\n\nint IsPrime(long int n){\n    int i;\n\n    if(n < 2)\n        return 0;\n    else if(n == 2)\n        return 1;\n\n    if(n % 2 == 0)\n        return 0;\n\n    for(i = 3; i <= n / i; i += 2)\n         if(n % i == 0)\n            return 0;\n    return 1;\n}", "language": "C", "metadata": {"date": 1446626212, "filename_ext": "c", "original_language": "C", "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/C/s708084849.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s708084849", "user_id": "u485987312"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "#include<stdio.h>\nint main(void){\nint i,x,sum=0;\nlong int n;\nscanf(\"%d\",&i);\nfor(x=0;x<i;x++){\nscanf(\"%ld\",&n);\nif(1==IsPrime(n)){sum+=1;}\n}\nprintf(\"%d\\n\",sum);\nreturn 0;\n}\n\n\nint IsPrime(long int n){\n    int i;\n\n    if(n < 2)\n        return 0;\n    else if(n == 2)\n        return 1;\n\n    if(n % 2 == 0)\n        return 0;\n\n    for(i = 3; i <= n / i; i += 2)\n         if(n % i == 0)\n            return 0;\n    return 1;\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": 417, "cpu_time_ms": 30, "memory_kb": 596}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s066913316", "group_id": "codeNet:p02257", "input_text": "#include <stdio.h>\n\nint PRIMES[100000000] = {0};\n\nvoid make_prime() {\n\tPRIMES[0] = 2;\n\tint i, j;\n\t\n\tfor (i = 3; i < 10000; ++i) {\n\t\tfor (j = 0; PRIMES[j] != 0; ++j) {\n\t\t\tif ((i % PRIMES[j]) == 0) {\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tif (PRIMES[j]) {\n\t\t\tcontinue;\n\t\t} else {\n\t\t\tPRIMES[j] = i;\n\t\t}\n\t}\n\treturn;\n}\n\nint main(void)\n{\n\tint i, j, n, cnt, p;\n\tmake_prime();\n\tscanf(\"%d\", &n);\n\tcnt = 0;\n\tfor (i = 0; i < n; ++i) {\n\t\tscanf(\" %d\", &p);\n\t\tfor (j = 0; PRIMES[j] <= p; ++j) {\n\t\t\tif (PRIMES[j] == p) {\n\t\t\t\t++cnt;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t}\n\t\n\tprintf(\"%d\\n\", cnt);\n\treturn 0;\n}", "language": "C", "metadata": {"date": 1481274053, "filename_ext": "c", "original_language": "C", "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/C/s066913316.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Memory Limit Exceeded", "submission_id": "s066913316", "user_id": "u897660790"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "#include <stdio.h>\n\nint PRIMES[100000000] = {0};\n\nvoid make_prime() {\n\tPRIMES[0] = 2;\n\tint i, j;\n\t\n\tfor (i = 3; i < 10000; ++i) {\n\t\tfor (j = 0; PRIMES[j] != 0; ++j) {\n\t\t\tif ((i % PRIMES[j]) == 0) {\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tif (PRIMES[j]) {\n\t\t\tcontinue;\n\t\t} else {\n\t\t\tPRIMES[j] = i;\n\t\t}\n\t}\n\treturn;\n}\n\nint main(void)\n{\n\tint i, j, n, cnt, p;\n\tmake_prime();\n\tscanf(\"%d\", &n);\n\tcnt = 0;\n\tfor (i = 0; i < n; ++i) {\n\t\tscanf(\" %d\", &p);\n\t\tfor (j = 0; PRIMES[j] <= p; ++j) {\n\t\t\tif (PRIMES[j] == p) {\n\t\t\t\t++cnt;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t}\n\t\n\tprintf(\"%d\\n\", cnt);\n\treturn 0;\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": 559, "cpu_time_ms": 210, "memory_kb": 387628}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s783219256", "group_id": "codeNet:p02257", "input_text": "#include <stdio.h>\n\nint main(void)\n{\n\tint i; //割る\n\tint n; //入力された自然数\n\tint prime[10000];\n\tint j = 0;\n\tint counter = 0; //素数の個数\n\n\tprime[j++] = 2;\n\tprime[j++] = 3;\n\n\tscanf(\"%d\", &n);\n\n\tfor (n = 5; n <= 100000; n += 2) {\n\t\tfor (i = 1; i < j; i++) {\n\t\t\tif (n % prime[i] == 0)\n\t\t\t\tbreak;\n\n\t\t}\n\t\tif (j == i)\n\t\t\tprime[j++] = n;\n\t}\n\n\tfor (i = 0; i < j; i++)\n\t\tcounter++; \n\n\t\tprintf(\"%d\\n\", counter);\n\t\n\treturn(0);\n\n}\n", "language": "C", "metadata": {"date": 1524633362, "filename_ext": "c", "original_language": "C", "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/C/s783219256.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s783219256", "user_id": "u831649807"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "#include <stdio.h>\n\nint main(void)\n{\n\tint i; //割る\n\tint n; //入力された自然数\n\tint prime[10000];\n\tint j = 0;\n\tint counter = 0; //素数の個数\n\n\tprime[j++] = 2;\n\tprime[j++] = 3;\n\n\tscanf(\"%d\", &n);\n\n\tfor (n = 5; n <= 100000; n += 2) {\n\t\tfor (i = 1; i < j; i++) {\n\t\t\tif (n % prime[i] == 0)\n\t\t\t\tbreak;\n\n\t\t}\n\t\tif (j == i)\n\t\t\tprime[j++] = n;\n\t}\n\n\tfor (i = 0; i < j; i++)\n\t\tcounter++; \n\n\t\tprintf(\"%d\\n\", counter);\n\t\n\treturn(0);\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": 438, "cpu_time_ms": 100, "memory_kb": 2024}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s557037222", "group_id": "codeNet:p02257", "input_text": "#include<stdio.h>\n#define N 10000\n\nint main(){\n  int i=0,A[N],count=0,count2=0,n,k;\n  \n  scanf(\"%d\",&n);\n  for(i=0;i<n;i++) scanf(\"%d\",&A[i]);\n  for(i=0;i<n;i++){  \n    for(k=2,count2=0;k<A[i];k++){\n      if(A[i]%k==0){\n\tcount2++;\n\tbreak;}}\n    if(count2==0) count++;\n  }\n  printf(\"%d\\n\",count);\n  return 0;\n}", "language": "C", "metadata": {"date": 1397184245, "filename_ext": "c", "original_language": "C", "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/C/s557037222.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s557037222", "user_id": "u669360983"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "#include<stdio.h>\n#define N 10000\n\nint main(){\n  int i=0,A[N],count=0,count2=0,n,k;\n  \n  scanf(\"%d\",&n);\n  for(i=0;i<n;i++) scanf(\"%d\",&A[i]);\n  for(i=0;i<n;i++){  \n    for(k=2,count2=0;k<A[i];k++){\n      if(A[i]%k==0){\n\tcount2++;\n\tbreak;}}\n    if(count2==0) count++;\n  }\n  printf(\"%d\\n\",count);\n  return 0;\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": 309, "cpu_time_ms": 20000, "memory_kb": 604}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s501382541", "group_id": "codeNet:p02257", "input_text": "#include<stdio.h>\n#include<math.h>\nint main()\n{\n  int l,x,i,j,k=0;\n  \n  scanf(\"%d\",&l);\n\n  for(i=0;i<l;i++)\n    {\n      scanf(\"%d\",&x);\n      \n      for(j=2;j<=sqrt(x);j++)\n\t{\n\t  if(x%j==0){ k++; break;}\n\t}\n      \n    }\n  \n  printf(\"%d\\n\",l-k);\n\n  return 0;\n}\n\n", "language": "C", "metadata": {"date": 1575702316, "filename_ext": "c", "original_language": "C", "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/C/s501382541.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s501382541", "user_id": "u333982009"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "#include<stdio.h>\n#include<math.h>\nint main()\n{\n  int l,x,i,j,k=0;\n  \n  scanf(\"%d\",&l);\n\n  for(i=0;i<l;i++)\n    {\n      scanf(\"%d\",&x);\n      \n      for(j=2;j<=sqrt(x);j++)\n\t{\n\t  if(x%j==0){ k++; break;}\n\t}\n      \n    }\n  \n  printf(\"%d\\n\",l-k);\n\n  return 0;\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": 261, "cpu_time_ms": 20, "memory_kb": 2128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s429395669", "group_id": "codeNet:p02257", "input_text": "#include <stdio.h>\nint main(){\n    int n, i;\n    scanf(\"%d\", &n);\n    int input, primes = 0;\n    for(i = 0; i < n; i++){\n        scanf(\"%d\", &input);\n        if(isPrime(input)) primes++;\n    }\n    printf(\"%d\\n\", primes);\n}\nint isPrime(int test){\n    if (test==2) return 1;\n    for (int i = 2; i <= test/i; i++){\n        if (test%i==0) return 0;\n    }\n    return 1;\n}\n\n", "language": "C", "metadata": {"date": 1560510736, "filename_ext": "c", "original_language": "C", "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/C/s429395669.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s429395669", "user_id": "u220116434"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "#include <stdio.h>\nint main(){\n    int n, i;\n    scanf(\"%d\", &n);\n    int input, primes = 0;\n    for(i = 0; i < n; i++){\n        scanf(\"%d\", &input);\n        if(isPrime(input)) primes++;\n    }\n    printf(\"%d\\n\", primes);\n}\nint isPrime(int test){\n    if (test==2) return 1;\n    for (int i = 2; i <= test/i; i++){\n        if (test%i==0) return 0;\n    }\n    return 1;\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": 368, "cpu_time_ms": 10, "memory_kb": 2040}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s625443623", "group_id": "codeNet:p02257", "input_text": "#include <stdio.h>\n#include <math.h>\n\nint main(){\n  int i,n,j,a,sosuu=0,b=0;\n\n  scanf(\"%d\",&n);\n\n  if(n>=1 && n<=10000){\n\n    for(i=0;i<n;i++){\n      scanf(\"%d\",&a);\n    \n    if(a>=2 && a<=100000000){\n      for(j=2;j<=sqrt(a);j++){\n\t  if(a%j == 0) b = 1;\n\t}\n\n\tif(b == 0){\n\t  sosuu++;\n\t}\n\tb=0;\n    }\n    }\n    printf(\"%d\\n\",sosuu);\n      \n    \n  }\n    return 0;\n\n  }\n\n", "language": "C", "metadata": {"date": 1544083060, "filename_ext": "c", "original_language": "C", "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/C/s625443623.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s625443623", "user_id": "u701335376"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "#include <stdio.h>\n#include <math.h>\n\nint main(){\n  int i,n,j,a,sosuu=0,b=0;\n\n  scanf(\"%d\",&n);\n\n  if(n>=1 && n<=10000){\n\n    for(i=0;i<n;i++){\n      scanf(\"%d\",&a);\n    \n    if(a>=2 && a<=100000000){\n      for(j=2;j<=sqrt(a);j++){\n\t  if(a%j == 0) b = 1;\n\t}\n\n\tif(b == 0){\n\t  sosuu++;\n\t}\n\tb=0;\n    }\n    }\n    printf(\"%d\\n\",sosuu);\n      \n    \n  }\n    return 0;\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": 367, "cpu_time_ms": 350, "memory_kb": 2068}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s327077372", "group_id": "codeNet:p02258", "input_text": "#include <stdio.h>\n#include <limits.h>\n#define N 200001\n#define imax(a,b) (a>b)?a:b\n#define imin(a,b) (a<b)?a:b\n\nint main()\n{\n  int n,r;\n  scanf(\"%d\",&n);\n  int ans=INT_MIN,rmin;\n  \n  int i;\n  for(i=0;i<n;i++){\n    scanf(\"%d\",&r);\n    if(i==0) rmin=r;\n    else{\n      ans=imax(ans,r-rmin);\n      rmin=imin(r,rmin);\n    }\n  }\n  \n  printf(\"%d\\n\",ans);\n  return 0;\n}", "language": "C", "metadata": {"date": 1502873244, "filename_ext": "c", "original_language": "C", "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/C/s327077372.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s327077372", "user_id": "u252365561"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "#include <stdio.h>\n#include <limits.h>\n#define N 200001\n#define imax(a,b) (a>b)?a:b\n#define imin(a,b) (a<b)?a:b\n\nint main()\n{\n  int n,r;\n  scanf(\"%d\",&n);\n  int ans=INT_MIN,rmin;\n  \n  int i;\n  for(i=0;i<n;i++){\n    scanf(\"%d\",&r);\n    if(i==0) rmin=r;\n    else{\n      ans=imax(ans,r-rmin);\n      rmin=imin(r,rmin);\n    }\n  }\n  \n  printf(\"%d\\n\",ans);\n  return 0;\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": 363, "cpu_time_ms": 40, "memory_kb": 596}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s185839125", "group_id": "codeNet:p02258", "input_text": "#include<stdio.h>\n\n#define NUMBER_1 200000\n\nint main()\n{\nint i, j, num;\nint n;\nint max = 1-10*10*10*10*10*10*10*10*10;\nint min = 10*10*10*10*10*10*10*10*10;\nint Rt[NUMBER_1];\n\nscanf(\"%d\", &n);\n\nfor(num=0; num<n; num++){\nscanf(\"%d\", &Rt[num]);\n}\n\nfor(j=1; j<=(n-1); j++){\nfor(i=0; i<=(j-1); i++){\nif(min>=Rt[i]){\nmin = Rt[i];\nif((Rt[j]-min)>max){\nmax = Rt[j]-min;\n}\n}\n}\n}\n\nprintf(\"%d\\n\", max);\n\nreturn 0;\n}", "language": "C", "metadata": {"date": 1508386821, "filename_ext": "c", "original_language": "C", "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/C/s185839125.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s185839125", "user_id": "u589139267"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "#include<stdio.h>\n\n#define NUMBER_1 200000\n\nint main()\n{\nint i, j, num;\nint n;\nint max = 1-10*10*10*10*10*10*10*10*10;\nint min = 10*10*10*10*10*10*10*10*10;\nint Rt[NUMBER_1];\n\nscanf(\"%d\", &n);\n\nfor(num=0; num<n; num++){\nscanf(\"%d\", &Rt[num]);\n}\n\nfor(j=1; j<=(n-1); j++){\nfor(i=0; i<=(j-1); i++){\nif(min>=Rt[i]){\nmin = Rt[i];\nif((Rt[j]-min)>max){\nmax = Rt[j]-min;\n}\n}\n}\n}\n\nprintf(\"%d\\n\", max);\n\nreturn 0;\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": 405, "cpu_time_ms": 10000, "memory_kb": 2476}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s839155031", "group_id": "codeNet:p02258", "input_text": "#include <limits.h>\n#include <stdio.h>\n\nstatic const int MAX_NUM_INPUT = 200000;\n#define MAX(a, b) ((a) > (b) ? (a) : (b))\n#define MIN(a, b) ((a) < (b) ? (a) : (b))\n\nint main()\n{\n    int n, i;\n    int R[MAX_NUM_INPUT];\n    int maxv = INT_MIN;\n    int minv;\n    \n    scanf(\"%d\", &n);\n    \n    for (i = 0; i < n; i++) {\n        scanf(\"%d\", &R[i]);\n    }\n    \n    minv = R[0];\n    \n    for (i = 1; i < n; i++) {\n        maxv = MAX(maxv, R[i] - minv);\n        minv = MIN(minv, R[i]);\n    }\n    \n    printf(\"%d\\n\", maxv);\n    \n    return 0;\n}\n\n", "language": "C", "metadata": {"date": 1527401849, "filename_ext": "c", "original_language": "C", "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/C/s839155031.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s839155031", "user_id": "u981675881"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "#include <limits.h>\n#include <stdio.h>\n\nstatic const int MAX_NUM_INPUT = 200000;\n#define MAX(a, b) ((a) > (b) ? (a) : (b))\n#define MIN(a, b) ((a) < (b) ? (a) : (b))\n\nint main()\n{\n    int n, i;\n    int R[MAX_NUM_INPUT];\n    int maxv = INT_MIN;\n    int minv;\n    \n    scanf(\"%d\", &n);\n    \n    for (i = 0; i < n; i++) {\n        scanf(\"%d\", &R[i]);\n    }\n    \n    minv = R[0];\n    \n    for (i = 1; i < n; i++) {\n        maxv = MAX(maxv, R[i] - minv);\n        minv = MIN(minv, R[i]);\n    }\n    \n    printf(\"%d\\n\", maxv);\n    \n    return 0;\n}\n\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": 539, "cpu_time_ms": 10, "memory_kb": 2636}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s757971789", "group_id": "codeNet:p02258", "input_text": "#include<stdio.h>\nint minnum(int[], int);\n\nint main(){\n  int n, i, j, max, min;\n  int R[200000];\n  scanf(\"%d\",&n);\n  for( i = 0 ; i < n ; i++ ){\n    scanf(\"%d\",&R[i]);\n  }\n\n  min = R[0];\n  max = R[1] - R[0];\n  for( i = 1 ; i < n ; ++i ){\n    if( max < R[i]-min ) max = R[i]- min;\n    if( min > R[i] ) min = R[i];\n  }\n\n  printf(\"%d\\n\",max);\n  return 0;\n}\n\n", "language": "C", "metadata": {"date": 1529325979, "filename_ext": "c", "original_language": "C", "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/C/s757971789.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s757971789", "user_id": "u043112306"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "#include<stdio.h>\nint minnum(int[], int);\n\nint main(){\n  int n, i, j, max, min;\n  int R[200000];\n  scanf(\"%d\",&n);\n  for( i = 0 ; i < n ; i++ ){\n    scanf(\"%d\",&R[i]);\n  }\n\n  min = R[0];\n  max = R[1] - R[0];\n  for( i = 1 ; i < n ; ++i ){\n    if( max < R[i]-min ) max = R[i]- min;\n    if( min > R[i] ) min = R[i];\n  }\n\n  printf(\"%d\\n\",max);\n  return 0;\n}\n\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": 355, "cpu_time_ms": 20, "memory_kb": 2548}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s907794982", "group_id": "codeNet:p02258", "input_text": "#include<stdio.h>\n#include<math.h>\n\n#define N 200000\n\nint main(void){\n  int n;\n  int r[N];\n  int i;\n  int maxv = -1 * 1000000000;\n\n  scanf(\"%d\", &n);\n  for(i = 0; i < n; i++){\n    scanf(\"%d\", &r[i]);\n  }\n\n  int minv = r[0];\n\n  for(i = 1; i <= n - 1; i++){\n    if(maxv < r[i] - minv){\n      maxv = r[i] - minv;\n    }\n    if(minv > r[i]){\n      minv = r[i];\n    }\n  }\n\n  printf(\"%d\\n\", maxv);\n\n}\n\n", "language": "C", "metadata": {"date": 1569606716, "filename_ext": "c", "original_language": "C", "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/C/s907794982.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s907794982", "user_id": "u124579062"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "#include<stdio.h>\n#include<math.h>\n\n#define N 200000\n\nint main(void){\n  int n;\n  int r[N];\n  int i;\n  int maxv = -1 * 1000000000;\n\n  scanf(\"%d\", &n);\n  for(i = 0; i < n; i++){\n    scanf(\"%d\", &r[i]);\n  }\n\n  int minv = r[0];\n\n  for(i = 1; i <= n - 1; i++){\n    if(maxv < r[i] - minv){\n      maxv = r[i] - minv;\n    }\n    if(minv > r[i]){\n      minv = r[i];\n    }\n  }\n\n  printf(\"%d\\n\", maxv);\n\n}\n\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": 395, "cpu_time_ms": 10, "memory_kb": 2620}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s367722779", "group_id": "codeNet:p02258", "input_text": "#include <stdio.h>\n\nint main(){\n    int N, Array[200001], max, minSub;\n    scanf(\"%d\\n\",&N);\n    for (int ix = 0 ; ix < N ; ix++)\n        scanf(\"%d\",&Array[ix]);\n    max = Array[1] - Array[0];\n    minSub = Array[0];\n    for (int jx = 1 ; jx < N ; jx++){\n        if (max < Array[jx] - minSub)\n            max = Array[jx] - minSub;\n        if ( minSub > Array[jx])\n            minSub = Array[jx];\n    }\n  \n  printf(\"%d\\n\",max);\n  return 0;\n}\n", "language": "C", "metadata": {"date": 1532845594, "filename_ext": "c", "original_language": "C", "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/C/s367722779.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s367722779", "user_id": "u222640511"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "#include <stdio.h>\n\nint main(){\n    int N, Array[200001], max, minSub;\n    scanf(\"%d\\n\",&N);\n    for (int ix = 0 ; ix < N ; ix++)\n        scanf(\"%d\",&Array[ix]);\n    max = Array[1] - Array[0];\n    minSub = Array[0];\n    for (int jx = 1 ; jx < N ; jx++){\n        if (max < Array[jx] - minSub)\n            max = Array[jx] - minSub;\n        if ( minSub > Array[jx])\n            minSub = Array[jx];\n    }\n  \n  printf(\"%d\\n\",max);\n  return 0;\n}\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": 440, "cpu_time_ms": 10, "memory_kb": 2644}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s237693527", "group_id": "codeNet:p02263", "input_text": "#include <stdio.h>\n#include <stdlib.h>\nint main()\n{\n\n  int stack[100];\n  char str[100];\n  int top=0,i;\n  int ch;\n  for (i=0;i<100;i++){\n    stack[i]=0;\n  }\n  while (scanf(\"%s\",str)!='\\n'){\n    if (str[0]=='+'){\n      stack[top-2]=stack[top-2]+stack[top-1];\n      top=top-1;\n    }else if(str[0]=='*'){\n      stack[top-2]=stack[top-2]*stack[top-1];\n      top=top-1;\n    }else if(str[0]=='-'){\n      stack[top-2]=stack[top-2]-stack[top-1];\n      top=top-1;\n    }else{\n      stack[top]=atoi(str);\n      top++;\n    }\n  }\n  printf(\"%d\\n\",stack[top-1]);\n  return 0;\n}", "language": "C", "metadata": {"date": 1354543780, "filename_ext": "c", "original_language": "C", "problem_description_relpath": "problem_descriptions/p02263.html", "problem_id": "p02263", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02263/input.txt", "sample_output_relpath": "derived/input_output/data/p02263/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02263/C/s237693527.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s237693527", "user_id": "u871745100"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "#include <stdio.h>\n#include <stdlib.h>\nint main()\n{\n\n  int stack[100];\n  char str[100];\n  int top=0,i;\n  int ch;\n  for (i=0;i<100;i++){\n    stack[i]=0;\n  }\n  while (scanf(\"%s\",str)!='\\n'){\n    if (str[0]=='+'){\n      stack[top-2]=stack[top-2]+stack[top-1];\n      top=top-1;\n    }else if(str[0]=='*'){\n      stack[top-2]=stack[top-2]*stack[top-1];\n      top=top-1;\n    }else if(str[0]=='-'){\n      stack[top-2]=stack[top-2]-stack[top-1];\n      top=top-1;\n    }else{\n      stack[top]=atoi(str);\n      top++;\n    }\n  }\n  printf(\"%d\\n\",stack[top-1]);\n  return 0;\n}", "problem_context": "Reverse Polish notation is a notation where every operator follows all of its operands. For example, an expression (1+2)*(5+4) in the conventional Polish notation can be represented as 1 2 + 5 4 + * in the Reverse Polish notation. One of advantages of the Reverse Polish notation is that it is parenthesis-free.\n\nWrite a program which reads an expression in the Reverse Polish notation and prints the computational result.\n\nAn expression in the Reverse Polish notation is calculated using a stack. To evaluate the expression, the program should read symbols in order. If the symbol is an operand, the corresponding value should be pushed into the stack. On the other hand, if the symbols is an operator, the program should pop two elements from the stack, perform the corresponding operations, then push the result in to the stack. The program should repeat this operations.\n\nInput\n\nAn expression is given in a line. Two consequtive symbols (operand or operator) are separated by a space character.\n\nYou can assume that +, - and * are given as the operator and an operand is a positive integer less than 106\n\nOutput\n\nPrint the computational result in a line.\n\nConstraints\n\n2 ≤ the number of operands in the expression ≤ 100\n\n1 ≤ the number of operators in the expression ≤ 99\n\n-1 × 109 ≤ values in the stack ≤ 109\n\nSample Input 1\n\n1 2 +\n\nSample Output 1\n\n3\n\nSample Input 2\n\n1 2 + 3 4 - *\n\nSample Output 2\n\n-3\n\nNotes\n\nTemplate in C", "sample_input": "1 2 +\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02263", "source_text": "Reverse Polish notation is a notation where every operator follows all of its operands. For example, an expression (1+2)*(5+4) in the conventional Polish notation can be represented as 1 2 + 5 4 + * in the Reverse Polish notation. One of advantages of the Reverse Polish notation is that it is parenthesis-free.\n\nWrite a program which reads an expression in the Reverse Polish notation and prints the computational result.\n\nAn expression in the Reverse Polish notation is calculated using a stack. To evaluate the expression, the program should read symbols in order. If the symbol is an operand, the corresponding value should be pushed into the stack. On the other hand, if the symbols is an operator, the program should pop two elements from the stack, perform the corresponding operations, then push the result in to the stack. The program should repeat this operations.\n\nInput\n\nAn expression is given in a line. Two consequtive symbols (operand or operator) are separated by a space character.\n\nYou can assume that +, - and * are given as the operator and an operand is a positive integer less than 106\n\nOutput\n\nPrint the computational result in a line.\n\nConstraints\n\n2 ≤ the number of operands in the expression ≤ 100\n\n1 ≤ the number of operators in the expression ≤ 99\n\n-1 × 109 ≤ values in the stack ≤ 109\n\nSample Input 1\n\n1 2 +\n\nSample Output 1\n\n3\n\nSample Input 2\n\n1 2 + 3 4 - *\n\nSample Output 2\n\n-3\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": 560, "cpu_time_ms": 490, "memory_kb": 8672}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s631146067", "group_id": "codeNet:p02264", "input_text": "#include <stdio.h>\n#include <string.h>\n#define LEN 100005\ntypedef struct pp{\n\tchar name[10];\n\tint t;\n}P;\n\nP Q[LEN];\nint head,tail,n;\n\nvoid enqueue(P);\nP dequeue();\nint min(int,int);\n\n\nint main(void){\n\tint elaps=0,c;\n\tint i,q;\n\tP u;\n\tscanf(\"%d %d\",&n,&q);\n\t\t\n\tfor(i=1;i<=n;i++){\n\t\tscanf(\"%s\",Q[i].name);\n\t\tscanf(\"%d\",&Q[i].t);\n\t}\n\thead=1,tail=n+1;\n\t\n\twhile(head!=tail){\n\t\tu=dequeue();\n\t\tc=min(q,u.t);\n\t\tu.t -= c;\n\t\telaps += c;\n\t\tif(u.t>0){\n\t\t\tenqueue(u);\n\t\t}else{\n\t\t\tprintf(\"%s %d\\n\",u.name,elaps);\n\t\t}\n\t}\n\t\n\t\n\treturn 0;\n}\n\nvoid enqueue(P x){\n\tQ[tail]=x;\n\ttail=(tail+1)%LEN;\n}\n\nP dequeue(){\n\tP x=Q[head];\n\thead=(head+1)%LEN;\n\treturn x;\n}\nint min(int a,int b){\n\tif(a<b){\n\t\treturn a;\n\t}else{\n\t\treturn b;\n\t}\n}", "language": "C", "metadata": {"date": 1510130741, "filename_ext": "c", "original_language": "C", "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/C/s631146067.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s631146067", "user_id": "u612214537"}, "prompt_components": {"gold_output": "p2 180\np5 400\np1 450\np3 550\np4 800\n", "input_to_evaluate": "#include <stdio.h>\n#include <string.h>\n#define LEN 100005\ntypedef struct pp{\n\tchar name[10];\n\tint t;\n}P;\n\nP Q[LEN];\nint head,tail,n;\n\nvoid enqueue(P);\nP dequeue();\nint min(int,int);\n\n\nint main(void){\n\tint elaps=0,c;\n\tint i,q;\n\tP u;\n\tscanf(\"%d %d\",&n,&q);\n\t\t\n\tfor(i=1;i<=n;i++){\n\t\tscanf(\"%s\",Q[i].name);\n\t\tscanf(\"%d\",&Q[i].t);\n\t}\n\thead=1,tail=n+1;\n\t\n\twhile(head!=tail){\n\t\tu=dequeue();\n\t\tc=min(q,u.t);\n\t\tu.t -= c;\n\t\telaps += c;\n\t\tif(u.t>0){\n\t\t\tenqueue(u);\n\t\t}else{\n\t\t\tprintf(\"%s %d\\n\",u.name,elaps);\n\t\t}\n\t}\n\t\n\t\n\treturn 0;\n}\n\nvoid enqueue(P x){\n\tQ[tail]=x;\n\ttail=(tail+1)%LEN;\n}\n\nP dequeue(){\n\tP x=Q[head];\n\thead=(head+1)%LEN;\n\treturn x;\n}\nint min(int a,int b){\n\tif(a<b){\n\t\treturn a;\n\t}else{\n\t\treturn b;\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": 705, "cpu_time_ms": 10, "memory_kb": 3276}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s443545551", "group_id": "codeNet:p02264", "input_text": "#include<stdio.h>\nchar l[100001][11],*m[100000];\nint t[100001],p[100001];\n\nint main(void){\n  int n, q, count = 0;\n  scanf(\"%d %d\", &n, &q);\n  int i = 0,j = 0,k = 0;\n  for(k=0;k<n;k++)\n    scanf(\"%s %d\", l[k], &t[k]);\n  while(j != n){\n    if (i==n)\n      i = 0;\n    \n    if(t[i] == 0){\n      continue;\n    } else {\n      if (t[i] - q > 0){\n\tt[i] = t[i] - q;\n\tcount += q;\n      }\n      else{\n\tcount += t[i];\n\tt[i] = 0;\n\tm[j] = l[i];\n\tp[j++] = count;\n      }\n\n      i++;\n    }\n    // if (j == n) break;\n  }\n  for(i = 0; i < n; i++){\n    printf(\"%s %d\\n\", m[i], p[i]);\n  }\n  return 0;\n}\n\t", "language": "C", "metadata": {"date": 1394550772, "filename_ext": "c", "original_language": "C", "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/C/s443545551.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s443545551", "user_id": "u063600778"}, "prompt_components": {"gold_output": "p2 180\np5 400\np1 450\np3 550\np4 800\n", "input_to_evaluate": "#include<stdio.h>\nchar l[100001][11],*m[100000];\nint t[100001],p[100001];\n\nint main(void){\n  int n, q, count = 0;\n  scanf(\"%d %d\", &n, &q);\n  int i = 0,j = 0,k = 0;\n  for(k=0;k<n;k++)\n    scanf(\"%s %d\", l[k], &t[k]);\n  while(j != n){\n    if (i==n)\n      i = 0;\n    \n    if(t[i] == 0){\n      continue;\n    } else {\n      if (t[i] - q > 0){\n\tt[i] = t[i] - q;\n\tcount += q;\n      }\n      else{\n\tcount += t[i];\n\tt[i] = 0;\n\tm[j] = l[i];\n\tp[j++] = count;\n      }\n\n      i++;\n    }\n    // if (j == n) break;\n  }\n  for(i = 0; i < n; i++){\n    printf(\"%s %d\\n\", m[i], p[i]);\n  }\n  return 0;\n}\n\t", "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": 584, "cpu_time_ms": 20000, "memory_kb": 564}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s558155132", "group_id": "codeNet:p02264", "input_text": "#include <stdio.h>\n#include <string.h>\n#define MAX 100005\n\ntypedef struct Proc {\n    char name[20];\n    int time;\n} P;\n\nP Q[MAX];\nint head, tail, n;\n\nvoid enqueue(P x)\n{\n    Q[tail] = x;\n    tail = (tail + 1) % MAX;\n}\n\nP dequeue()\n{\n    P x = Q[head];\n    head = (head + 1) % MAX;\n    return x;\n}\n\nint min(int a, int b)\n{\n    return a < b ? a : b;\n}\n\nint main()\n{\n    int elaps = 0, c;\n    int i, q;\n    P u;\n    scanf(\"%d %d\", &n, &q);\n\n    for (i = 1; i < n+1; i++) {\n        scanf(\"%s\", Q[i].name);\n        scanf(\"%d\", &Q[i].time);\n    }\n    head = 1;\n    tail = n + 1;\n\n    while (head != tail) {\n        u = dequeue();\n        c = min(q, u.time);\n        u.time -= c;\n        elaps += c;\n        if (u.time > 0) {\n            enqueue(u);\n        } else {\n            printf(\"%s %d\\n\", u.name, elaps);\n        }\n    }\n\n    return 0;\n}\n", "language": "C", "metadata": {"date": 1579669775, "filename_ext": "c", "original_language": "C", "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/C/s558155132.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s558155132", "user_id": "u436124641"}, "prompt_components": {"gold_output": "p2 180\np5 400\np1 450\np3 550\np4 800\n", "input_to_evaluate": "#include <stdio.h>\n#include <string.h>\n#define MAX 100005\n\ntypedef struct Proc {\n    char name[20];\n    int time;\n} P;\n\nP Q[MAX];\nint head, tail, n;\n\nvoid enqueue(P x)\n{\n    Q[tail] = x;\n    tail = (tail + 1) % MAX;\n}\n\nP dequeue()\n{\n    P x = Q[head];\n    head = (head + 1) % MAX;\n    return x;\n}\n\nint min(int a, int b)\n{\n    return a < b ? a : b;\n}\n\nint main()\n{\n    int elaps = 0, c;\n    int i, q;\n    P u;\n    scanf(\"%d %d\", &n, &q);\n\n    for (i = 1; i < n+1; i++) {\n        scanf(\"%s\", Q[i].name);\n        scanf(\"%d\", &Q[i].time);\n    }\n    head = 1;\n    tail = n + 1;\n\n    while (head != tail) {\n        u = dequeue();\n        c = min(q, u.time);\n        u.time -= c;\n        elaps += c;\n        if (u.time > 0) {\n            enqueue(u);\n        } else {\n            printf(\"%s %d\\n\", u.name, elaps);\n        }\n    }\n\n    return 0;\n}\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": 839, "cpu_time_ms": 10, "memory_kb": 4052}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s657074875", "group_id": "codeNet:p02265", "input_text": "#include<stdio.h>\n#include<stdlib.h>\n#include<string.h>\n\n\n/*-----------構造体定義-----------------*/\ntypedef struct node{\n int num;\n struct node *left;\n struct node *right;\n}node;\n/*--------------------------------------*/\n\n\n/*-----------------要素作成-------------*/\nnode* makenode(int x){\nnode* new;\n\nnew=(node*)malloc(sizeof(node));\nnew->num=x;\nnew->right=NULL;\n\nreturn new;\n}\n/*-------------------------------------*/\n\n\nint main(){\nint n,i,x;\nint y=1;\nchar com[13];\nnode* root;\nnode* p;\nnode** q;\nnode* r;\nroot=NULL;\n\nscanf(\"%d\",&n);\n\nfor(i=0;i<n;i++){\n scanf(\"%s\",&com);\n\n if(com[0]=='i'){\n   scanf(\"%d\",&x);\n   p=makenode(x);\n    if(root!=NULL){\n        root->left=p;\n        p->right=root;\n        root=p;\n    }else{root=p;}\n }else\n if(strcmp(com,\"deleteFirst\")==0){\n   if(root->right==NULL){free(root);root=NULL;}\n   else{root->right->left=NULL;\n        root=root->right;}\n  }else\n  if(strcmp(com,\"deleteLast\")==0){\n   if(root->right==NULL){root=NULL;}\n   else{q=&(root->right);\n    while((*q)!=NULL){\n     if((*q)->right==NULL){(*q)=NULL;}\n     else{q=&((*q)->right);}\n    }\n   }\n  }else\n  \n\nif(strcmp(com,\"delete\")==0){\n   scanf(\"%d\",&x);\n\n/*要素1つの場合*/\nif(root->right==NULL){if(root->num==x)root=NULL;}\n\n/*要素が2以上*/\nelse{\n\n  if(root->num==x){/*先頭*/\n       root->right->left=NULL;\n       root=root->right;}\n\n  else{p=root;\n  \n      while(p!=NULL){\n\n        if(p->num==x){\n\n          if(p->right==NULL){p->left->right=NULL;break;}\n          else{\n\n            p->right->left=p->left;\n            p->left->right=p->right;\n            p->right=NULL;}\n        }\n\n        p=p->right;\n\n\n       }/*while終了*/\n\n\n   }\n}\n}\n}\np=root;\nwhile(p!=NULL){\n\nif(p->right==NULL){printf(\"%d\\n\",p->num);}\nelse{printf(\"%d \",p->num);}\np=p->right;\n\n}\n\n\n\nreturn 0;\n}\n\n\n\n\n", "language": "C", "metadata": {"date": 1516183489, "filename_ext": "c", "original_language": "C", "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/C/s657074875.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s657074875", "user_id": "u723915999"}, "prompt_components": {"gold_output": "6 1 2\n", "input_to_evaluate": "#include<stdio.h>\n#include<stdlib.h>\n#include<string.h>\n\n\n/*-----------構造体定義-----------------*/\ntypedef struct node{\n int num;\n struct node *left;\n struct node *right;\n}node;\n/*--------------------------------------*/\n\n\n/*-----------------要素作成-------------*/\nnode* makenode(int x){\nnode* new;\n\nnew=(node*)malloc(sizeof(node));\nnew->num=x;\nnew->right=NULL;\n\nreturn new;\n}\n/*-------------------------------------*/\n\n\nint main(){\nint n,i,x;\nint y=1;\nchar com[13];\nnode* root;\nnode* p;\nnode** q;\nnode* r;\nroot=NULL;\n\nscanf(\"%d\",&n);\n\nfor(i=0;i<n;i++){\n scanf(\"%s\",&com);\n\n if(com[0]=='i'){\n   scanf(\"%d\",&x);\n   p=makenode(x);\n    if(root!=NULL){\n        root->left=p;\n        p->right=root;\n        root=p;\n    }else{root=p;}\n }else\n if(strcmp(com,\"deleteFirst\")==0){\n   if(root->right==NULL){free(root);root=NULL;}\n   else{root->right->left=NULL;\n        root=root->right;}\n  }else\n  if(strcmp(com,\"deleteLast\")==0){\n   if(root->right==NULL){root=NULL;}\n   else{q=&(root->right);\n    while((*q)!=NULL){\n     if((*q)->right==NULL){(*q)=NULL;}\n     else{q=&((*q)->right);}\n    }\n   }\n  }else\n  \n\nif(strcmp(com,\"delete\")==0){\n   scanf(\"%d\",&x);\n\n/*要素1つの場合*/\nif(root->right==NULL){if(root->num==x)root=NULL;}\n\n/*要素が2以上*/\nelse{\n\n  if(root->num==x){/*先頭*/\n       root->right->left=NULL;\n       root=root->right;}\n\n  else{p=root;\n  \n      while(p!=NULL){\n\n        if(p->num==x){\n\n          if(p->right==NULL){p->left->right=NULL;break;}\n          else{\n\n            p->right->left=p->left;\n            p->left->right=p->right;\n            p->right=NULL;}\n        }\n\n        p=p->right;\n\n\n       }/*while終了*/\n\n\n   }\n}\n}\n}\np=root;\nwhile(p!=NULL){\n\nif(p->right==NULL){printf(\"%d\\n\",p->num);}\nelse{printf(\"%d \",p->num);}\np=p->right;\n\n}\n\n\n\nreturn 0;\n}\n\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": 1790, "cpu_time_ms": 1990, "memory_kb": 32760}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s812273305", "group_id": "codeNet:p02265", "input_text": "#include <stdio.h>\n#include <stdlib.h>\n#include <string.h>\n\nstruct node{\n  int key;\n  struct node *next;\n  struct node *prev;\n};\n\ntypedef struct node * NodePointer;\n\nNodePointer nil;\nvoid insert(int key);\nint delete(int key);\nint deleteFirst();\nint deleteLast();\nvoid init();     /* This fanction is initializing nil. */\n\nmain(){\n  int n, i, keydata;\n  char com[12];\n  NodePointer p;\n  scanf(\"%d\",&n);\n  nil=malloc(sizeof(struct node));\n  init();\n\n  for (i=0;i<n;i++){\n    scanf(\"%s\",com);\n    if(strlen(com)>6){\n      if(com[6]=='F') {\n        deleteFirst();\n      }else{\n        deleteLast();\n      }\n    }else{\n      scanf(\"%d\",&keydata);\n      if(com[0]=='i'){\n        insert(keydata);\n      }else{\n        delete(keydata);\n      }\n    }\n  }\n\n  for(p=nil->next;p!=nil->prev;p=p->next){\n    printf(\"%d \",p->key);\n  }\n  printf(\"%d\\n\",p->key);\n  free(nil);\n  return 0;\n}\n\nvoid insert(int keydata){\n  NodePointer x;\n  x=malloc(sizeof(struct node));\n  x->key=keydata;\n  x->next=nil->next;\n  x->prev=nil;\n  nil->next=x;\n  x->next->prev=x;\n}\n\nint delete(int keydata){\n  NodePointer p;\n  p=nil->next;\n  while(p!=nil&&p->key!=keydata){\n    p=p->next; /* search */\n  }\n  if(p==nil){  /* If not found, this function is forced termination.  */\n    return 0;\n  }else{\n    p->prev->next=p->next;\n    p->next->prev=p->prev;\n    free(p);\n    return 0;\n  }\n}\n\nint deleteFirst(){\n  NodePointer p;\n  p=nil->next;\n  nil->next=p->next;\n  p->next->prev=nil;\n  free(p);\n  return 0;\n}\n\nint deleteLast(){\n  NodePointer p;\n  p=nil->prev;\n  p->prev->next=nil;\n  nil->prev=p->prev;\n  free(p);\n  return 0;\n}\n\nvoid init(){\n  nil->next=nil;\n  nil->prev=nil;\n}", "language": "C", "metadata": {"date": 1336652781, "filename_ext": "c", "original_language": "C", "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/C/s812273305.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s812273305", "user_id": "u231257914"}, "prompt_components": {"gold_output": "6 1 2\n", "input_to_evaluate": "#include <stdio.h>\n#include <stdlib.h>\n#include <string.h>\n\nstruct node{\n  int key;\n  struct node *next;\n  struct node *prev;\n};\n\ntypedef struct node * NodePointer;\n\nNodePointer nil;\nvoid insert(int key);\nint delete(int key);\nint deleteFirst();\nint deleteLast();\nvoid init();     /* This fanction is initializing nil. */\n\nmain(){\n  int n, i, keydata;\n  char com[12];\n  NodePointer p;\n  scanf(\"%d\",&n);\n  nil=malloc(sizeof(struct node));\n  init();\n\n  for (i=0;i<n;i++){\n    scanf(\"%s\",com);\n    if(strlen(com)>6){\n      if(com[6]=='F') {\n        deleteFirst();\n      }else{\n        deleteLast();\n      }\n    }else{\n      scanf(\"%d\",&keydata);\n      if(com[0]=='i'){\n        insert(keydata);\n      }else{\n        delete(keydata);\n      }\n    }\n  }\n\n  for(p=nil->next;p!=nil->prev;p=p->next){\n    printf(\"%d \",p->key);\n  }\n  printf(\"%d\\n\",p->key);\n  free(nil);\n  return 0;\n}\n\nvoid insert(int keydata){\n  NodePointer x;\n  x=malloc(sizeof(struct node));\n  x->key=keydata;\n  x->next=nil->next;\n  x->prev=nil;\n  nil->next=x;\n  x->next->prev=x;\n}\n\nint delete(int keydata){\n  NodePointer p;\n  p=nil->next;\n  while(p!=nil&&p->key!=keydata){\n    p=p->next; /* search */\n  }\n  if(p==nil){  /* If not found, this function is forced termination.  */\n    return 0;\n  }else{\n    p->prev->next=p->next;\n    p->next->prev=p->prev;\n    free(p);\n    return 0;\n  }\n}\n\nint deleteFirst(){\n  NodePointer p;\n  p=nil->next;\n  nil->next=p->next;\n  p->next->prev=nil;\n  free(p);\n  return 0;\n}\n\nint deleteLast(){\n  NodePointer p;\n  p=nil->prev;\n  p->prev->next=nil;\n  nil->prev=p->prev;\n  free(p);\n  return 0;\n}\n\nvoid init(){\n  nil->next=nil;\n  nil->prev=nil;\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": 1632, "cpu_time_ms": 550, "memory_kb": 15000}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s609799440", "group_id": "codeNet:p02265", "input_text": "#include<stdio.h>\n#include<stdlib.h>\n#include<string.h>\n\nstruct node{\nunsigned int key;\n  struct node *next;\n  struct node *prev;\n};\n\ntypedef struct node * NodePointer;\n\nNodePointer nil;\n\nNodePointer listSearch(int key){\n  NodePointer x;\n  x = nil->next;\n  while(x != nil && x->key != key) x = x->next;\n\n  return x;\n}\n\nvoid init(){\n  nil = malloc(sizeof(struct node));\n  nil->next = nil;\n  nil->prev = nil;\n}\n\nvoid printList(){\n  NodePointer cur = nil->next;\n  int isf = 1;\n  while(1){\n    if ( cur == nil ) break;\n    if ( isf == 0)  printf(\" \");\n    printf(\"%d\", cur->key);\n    cur = cur->next;\n    isf = 0;\n  }\n  printf(\"\\n\");\n}\n\nvoid deleteNode(NodePointer t){\n  t->prev->next = t->next;\n  t->next->prev = t->prev;\n}\n\nvoid deleteFirst(){\n  NodePointer t = nil->next;\n  if ( t == nil ) return;\n  deleteNode(t);\n}\n\nvoid deleteLast(){\n  NodePointer t = nil->prev;\n  if(t == nil) return;\n\n  deleteNode(t);\n}\n\nvoid delete(int key){\n  NodePointer t;\n  t = listSearch(key);\n  if(t == nil) return;\n  deleteNode(t);\n}\n\n\nvoid insert(int key){\n  NodePointer x;\n  x = malloc(sizeof(struct node));\n  x->key = key;\n\n  if(nil->next == nil) nil->prev = x;\n  x->next = nil->next;\n  nil->next->prev =x;\n  nil->next = x;\n  x->prev = nil;\n}\n\nint main(){\n  int key, n, i;\n  int size = 0;\n  char com[20];\n  int np = 0, nd = 0;\n  scanf(\"%d\", &n);\n  init();\n  for ( i = 0; i < n; i++ ){\n    scanf(\"%s%d\", com, &key);\n    if ( com[0] == 'i' ) {insert(key); np++; size++;}\n    else if ( com[0] == 'd' ) {\n      if (strlen(com) > 6){\n\tif ( com[6] == 'F' ) deleteFirst();\n\telse if ( com[6] == 'L' ) deleteLast();\n      } else {\n\tdelete(key); nd++; \n      }\n      size--;\n    }\n  }\n\n  printList();\n  return 0;\n}\n\n", "language": "C", "metadata": {"date": 1581478980, "filename_ext": "c", "original_language": "C", "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/C/s609799440.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s609799440", "user_id": "u745982392"}, "prompt_components": {"gold_output": "6 1 2\n", "input_to_evaluate": "#include<stdio.h>\n#include<stdlib.h>\n#include<string.h>\n\nstruct node{\nunsigned int key;\n  struct node *next;\n  struct node *prev;\n};\n\ntypedef struct node * NodePointer;\n\nNodePointer nil;\n\nNodePointer listSearch(int key){\n  NodePointer x;\n  x = nil->next;\n  while(x != nil && x->key != key) x = x->next;\n\n  return x;\n}\n\nvoid init(){\n  nil = malloc(sizeof(struct node));\n  nil->next = nil;\n  nil->prev = nil;\n}\n\nvoid printList(){\n  NodePointer cur = nil->next;\n  int isf = 1;\n  while(1){\n    if ( cur == nil ) break;\n    if ( isf == 0)  printf(\" \");\n    printf(\"%d\", cur->key);\n    cur = cur->next;\n    isf = 0;\n  }\n  printf(\"\\n\");\n}\n\nvoid deleteNode(NodePointer t){\n  t->prev->next = t->next;\n  t->next->prev = t->prev;\n}\n\nvoid deleteFirst(){\n  NodePointer t = nil->next;\n  if ( t == nil ) return;\n  deleteNode(t);\n}\n\nvoid deleteLast(){\n  NodePointer t = nil->prev;\n  if(t == nil) return;\n\n  deleteNode(t);\n}\n\nvoid delete(int key){\n  NodePointer t;\n  t = listSearch(key);\n  if(t == nil) return;\n  deleteNode(t);\n}\n\n\nvoid insert(int key){\n  NodePointer x;\n  x = malloc(sizeof(struct node));\n  x->key = key;\n\n  if(nil->next == nil) nil->prev = x;\n  x->next = nil->next;\n  nil->next->prev =x;\n  nil->next = x;\n  x->prev = nil;\n}\n\nint main(){\n  int key, n, i;\n  int size = 0;\n  char com[20];\n  int np = 0, nd = 0;\n  scanf(\"%d\", &n);\n  init();\n  for ( i = 0; i < n; i++ ){\n    scanf(\"%s%d\", com, &key);\n    if ( com[0] == 'i' ) {insert(key); np++; size++;}\n    else if ( com[0] == 'd' ) {\n      if (strlen(com) > 6){\n\tif ( com[6] == 'F' ) deleteFirst();\n\telse if ( com[6] == 'L' ) deleteLast();\n      } else {\n\tdelete(key); nd++; \n      }\n      size--;\n    }\n  }\n\n  printList();\n  return 0;\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": 1688, "cpu_time_ms": 200, "memory_kb": 36084}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s580248620", "group_id": "codeNet:p02265", "input_text": "#include <stdio.h>\n#include <string.h>\n#include <stdlib.h>\n\nstruct node{\n  unsigned int key;\n  struct node *next;\n  struct node *prev;\n};\n\ntypedef struct node * NodePointer;\n\nNodePointer nil;\n\nNodePointer listSearch(int key){\n  NodePointer cur = nil->next;\n  while (cur != nil && cur->key != key) {\n      cur = cur->next;\n  }\n  return cur;\n}\n\nvoid init(){\n  nil = malloc(sizeof(struct node));\n  nil->next = nil;\n  nil->prev = nil;\n}\n\nvoid printList(){\n  NodePointer cur = nil->next;\n  int isf = 1;\n  while(1){\n    if ( cur == nil ) break;\n    if ( isf == 0)  printf(\" \");\n    printf(\"%d\", cur->key);\n    cur = cur->next;\n    isf = 0;\n  }\n  printf(\"\\n\");\n}\n\nvoid deleteNode(NodePointer t){\n    if ( t == nil) return ;\n    t->prev->next = t->next;\n    t->next->prev = t->prev;\n    free(t);\n}\n\nvoid deleteFirst(){\n  NodePointer t = nil->next;\n  if ( t == nil ) return;\n  deleteNode(t);\n}\n\nvoid deleteLast(){\n  deleteNode(nil->prev);\n}\n\nvoid delete(int key){\n    deleteNode(listSearch(key));\n}\n\n\nvoid insert(int key){\n  NodePointer x;\n  x = malloc(sizeof(struct node));\n  x->key = key;\n\n    x->next = nil->next;\n    nil->next->prev = x;\n    nil->next = x;\n    x->prev = nil;\n}\n\nint main(){\n  int key, n, i;\n  int size = 0;\n  char com[20];\n  int np = 0, nd = 0;\n  scanf(\"%d\", &n);\n  init();\n  for ( i = 0; i < n; i++ ){\n    scanf(\"%s%d\", com, &key);\n    if ( com[0] == 'i' ) {insert(key); np++; size++;}\n    else if ( com[0] == 'd' ) {\n      if (strlen(com) > 6){\n\tif ( com[6] == 'F' ) deleteFirst();\n\telse if ( com[6] == 'L' ) deleteLast();\n      } else {\n\tdelete(key); nd++; \n      }\n      size--;\n    }\n  }\n  printList();\n  return 0;\n}\n\n", "language": "C", "metadata": {"date": 1576135420, "filename_ext": "c", "original_language": "C", "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/C/s580248620.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s580248620", "user_id": "u342747192"}, "prompt_components": {"gold_output": "6 1 2\n", "input_to_evaluate": "#include <stdio.h>\n#include <string.h>\n#include <stdlib.h>\n\nstruct node{\n  unsigned int key;\n  struct node *next;\n  struct node *prev;\n};\n\ntypedef struct node * NodePointer;\n\nNodePointer nil;\n\nNodePointer listSearch(int key){\n  NodePointer cur = nil->next;\n  while (cur != nil && cur->key != key) {\n      cur = cur->next;\n  }\n  return cur;\n}\n\nvoid init(){\n  nil = malloc(sizeof(struct node));\n  nil->next = nil;\n  nil->prev = nil;\n}\n\nvoid printList(){\n  NodePointer cur = nil->next;\n  int isf = 1;\n  while(1){\n    if ( cur == nil ) break;\n    if ( isf == 0)  printf(\" \");\n    printf(\"%d\", cur->key);\n    cur = cur->next;\n    isf = 0;\n  }\n  printf(\"\\n\");\n}\n\nvoid deleteNode(NodePointer t){\n    if ( t == nil) return ;\n    t->prev->next = t->next;\n    t->next->prev = t->prev;\n    free(t);\n}\n\nvoid deleteFirst(){\n  NodePointer t = nil->next;\n  if ( t == nil ) return;\n  deleteNode(t);\n}\n\nvoid deleteLast(){\n  deleteNode(nil->prev);\n}\n\nvoid delete(int key){\n    deleteNode(listSearch(key));\n}\n\n\nvoid insert(int key){\n  NodePointer x;\n  x = malloc(sizeof(struct node));\n  x->key = key;\n\n    x->next = nil->next;\n    nil->next->prev = x;\n    nil->next = x;\n    x->prev = nil;\n}\n\nint main(){\n  int key, n, i;\n  int size = 0;\n  char com[20];\n  int np = 0, nd = 0;\n  scanf(\"%d\", &n);\n  init();\n  for ( i = 0; i < n; i++ ){\n    scanf(\"%s%d\", com, &key);\n    if ( com[0] == 'i' ) {insert(key); np++; size++;}\n    else if ( com[0] == 'd' ) {\n      if (strlen(com) > 6){\n\tif ( com[6] == 'F' ) deleteFirst();\n\telse if ( com[6] == 'L' ) deleteLast();\n      } else {\n\tdelete(key); nd++; \n      }\n      size--;\n    }\n  }\n  printList();\n  return 0;\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": 1635, "cpu_time_ms": 220, "memory_kb": 32960}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s188975399", "group_id": "codeNet:p02265", "input_text": "#include<stdio.h>\n#include<stdlib.h>\n#include<string.h>\n\nstruct node{\n\tint key;\n\tstruct node *next;\n\tstruct node *prev;\n};\n\nstruct node *null;\n\nstruct node *listSearch(int key)\n{\n\tstruct node *cur = null->next;\n\twhile(cur!=null&&cur->key!=key)\n\t{\n\t\tcur =cur->next;\n\t}\n\treturn cur;\n}\n\nvoid init(){\n\t\n\tnull=(struct node*)malloc(sizeof(struct node));\n\tnull->next=null;\n\tnull->prev=null;\n}\n\nvoid printList()\n{\n\tstruct node *cur=null->next;\n\tint isf=0;\n\twhile(cur!=null)\n\t{\n\t\tif(isf++)putchar_unlocked(' ');\n\t\tprintf(\"%d\",cur->key);\n\t\tcur=cur->next;\n\t}\n\tputchar_unlocked('\\n');\n}\n\nvoid deleteNode(struct node *t)\n{\nif(t==null) return;\nt->prev->next=t->next;\nt->next->prev=t->prev;\nfree(t);\n}\nvoid deleteFirst()\n{\n\tdeleteNode(null->next);\n}\nvoid deleteLast()\n{\n\tdeleteNode(null->prev);\n}\nvoid deleteKey(int key)\n{\n\tdeleteNode(listSearch(key));\n}\n\nvoid insert(int key)\n{\n\tstruct node *x=(struct node*)malloc(sizeof(struct node));\n\tx->key=key;\n\tx->next=null->next;\n\tnull->next->prev=x;\n\tnull->next=x;\n\tx->prev=null;\n}\nint main(void)\n{\n\tint key,n,i;\n\tchar com[20];\n\tnull=(struct node*)malloc(sizeof(struct node));\n\tnull->next=null;\n\tnull->prev=null;\n\t\n\tscanf(\"%d\",&n);\n\t\n\tfor(i=0;i<n;i++)\n\t{\n\t\tscanf(\"%s\",com);\n\t\tif(strlen(com)>6)\n\t\t{\n\t\t\tif(com[6]=='F')\n\t\t\t{\n\t\t\t\tdeleteFirst();\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tdeleteLast();\n\t\t\t}\n\t\t}\n\t\telse\n\t\t{\n\t\t\tscanf(\"%d\",&key);\n\t\t\t\n\t\t\tif(com[0]=='d')\n\t\t\t\t{\n\t\t\t\t\tdeleteKey(key);\n\t\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tinsert(key);\n\t\t\t}\n\t\t\t\n\t\t}\n\t}\n\tprintList();\n\treturn 0;\n}\n\n\n\t\n\n", "language": "C", "metadata": {"date": 1573882442, "filename_ext": "c", "original_language": "C", "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/C/s188975399.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s188975399", "user_id": "u020939608"}, "prompt_components": {"gold_output": "6 1 2\n", "input_to_evaluate": "#include<stdio.h>\n#include<stdlib.h>\n#include<string.h>\n\nstruct node{\n\tint key;\n\tstruct node *next;\n\tstruct node *prev;\n};\n\nstruct node *null;\n\nstruct node *listSearch(int key)\n{\n\tstruct node *cur = null->next;\n\twhile(cur!=null&&cur->key!=key)\n\t{\n\t\tcur =cur->next;\n\t}\n\treturn cur;\n}\n\nvoid init(){\n\t\n\tnull=(struct node*)malloc(sizeof(struct node));\n\tnull->next=null;\n\tnull->prev=null;\n}\n\nvoid printList()\n{\n\tstruct node *cur=null->next;\n\tint isf=0;\n\twhile(cur!=null)\n\t{\n\t\tif(isf++)putchar_unlocked(' ');\n\t\tprintf(\"%d\",cur->key);\n\t\tcur=cur->next;\n\t}\n\tputchar_unlocked('\\n');\n}\n\nvoid deleteNode(struct node *t)\n{\nif(t==null) return;\nt->prev->next=t->next;\nt->next->prev=t->prev;\nfree(t);\n}\nvoid deleteFirst()\n{\n\tdeleteNode(null->next);\n}\nvoid deleteLast()\n{\n\tdeleteNode(null->prev);\n}\nvoid deleteKey(int key)\n{\n\tdeleteNode(listSearch(key));\n}\n\nvoid insert(int key)\n{\n\tstruct node *x=(struct node*)malloc(sizeof(struct node));\n\tx->key=key;\n\tx->next=null->next;\n\tnull->next->prev=x;\n\tnull->next=x;\n\tx->prev=null;\n}\nint main(void)\n{\n\tint key,n,i;\n\tchar com[20];\n\tnull=(struct node*)malloc(sizeof(struct node));\n\tnull->next=null;\n\tnull->prev=null;\n\t\n\tscanf(\"%d\",&n);\n\t\n\tfor(i=0;i<n;i++)\n\t{\n\t\tscanf(\"%s\",com);\n\t\tif(strlen(com)>6)\n\t\t{\n\t\t\tif(com[6]=='F')\n\t\t\t{\n\t\t\t\tdeleteFirst();\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tdeleteLast();\n\t\t\t}\n\t\t}\n\t\telse\n\t\t{\n\t\t\tscanf(\"%d\",&key);\n\t\t\t\n\t\t\tif(com[0]=='d')\n\t\t\t\t{\n\t\t\t\t\tdeleteKey(key);\n\t\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tinsert(key);\n\t\t\t}\n\t\t\t\n\t\t}\n\t}\n\tprintList();\n\treturn 0;\n}\n\n\n\t\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": 1480, "cpu_time_ms": 220, "memory_kb": 33036}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s673878731", "group_id": "codeNet:p02268", "input_text": "#include<stdio.h>\n\n//void linearSearch(int);\n\nint main (){ \n\n  int n,q,i,j,count=0;\n  int S[100000];\n  int T[50000];\n\n  scanf(\"%d\",&n);\n  for(i=0;i<n;i++){\n    scanf(\"%d\",&S[i]);\n  }\n  scanf(\"%d\",&q);  \n  for(j=0;j<q;j++){\n    scanf(\"%d\",&T[j]);\n  }\n  for(j=0;j<q;j++){\n    for (i=0;i<n;i++){\n      if(S[i]==T[j]){\n\tcount++;\n\tbreak;\n      }\n    }\n  }\n  \n  printf(\"%d\\n\",count);\n  \n  return 0;\n}", "language": "C", "metadata": {"date": 1462940343, "filename_ext": "c", "original_language": "C", "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/C/s673878731.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s673878731", "user_id": "u454160743"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "#include<stdio.h>\n\n//void linearSearch(int);\n\nint main (){ \n\n  int n,q,i,j,count=0;\n  int S[100000];\n  int T[50000];\n\n  scanf(\"%d\",&n);\n  for(i=0;i<n;i++){\n    scanf(\"%d\",&S[i]);\n  }\n  scanf(\"%d\",&q);  \n  for(j=0;j<q;j++){\n    scanf(\"%d\",&T[j]);\n  }\n  for(j=0;j<q;j++){\n    for (i=0;i<n;i++){\n      if(S[i]==T[j]){\n\tcount++;\n\tbreak;\n      }\n    }\n  }\n  \n  printf(\"%d\\n\",count);\n  \n  return 0;\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": 394, "cpu_time_ms": 1510, "memory_kb": 1184}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s765371589", "group_id": "codeNet:p02268", "input_text": "#include<stdio.h>\n#include<stdlib.h>\n\nint main(){\n  int n,q;\n  int *S,*T,B[1000000];\n  int i,u;\n  int l,m,r;\n  int count=0,flag,key;\n  \n  scanf(\"%d\",&n);\n  S=(int *)malloc(n*sizeof(int));\n  for(i=0;i<n;i++) scanf(\"%d\",&S[i]);\n  scanf(\"%d\",&q);\n  T=(int *)malloc(q*sizeof(int));\n  for(i=0;i<q;i++) scanf(\"%d\",&T[i]);\n\n\n  for(i=0;i<q;i++){\n    key=T[i];\n    l=0;\n    r=n+2;\n    m=(r+l)/2;\n    flag=0;\n\n    for(u=0;u<count;u++){\n      if(B[u]==key){\n\tflag=1;\n\tbreak;\n      }\n    }\n    \n    while(r>l){\n      if(flag==1) break;\n      if(key==S[m]){\n\tB[count++]=key;\n\tbreak;\n      }\n      else if(key<S[m]){\n\tr=m;\n\tm=(r+l)/2;\n      }else if(key>S[m]){\n\tl=m+1;\n\tm=(r+l)/2;\n      }\n    }\n\n  }\n\n  printf(\"%d\\n\",count);\n\n  free(S);\n  free(T);\n  return 0;\n}\n\n", "language": "C", "metadata": {"date": 1545035384, "filename_ext": "c", "original_language": "C", "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/C/s765371589.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s765371589", "user_id": "u893058769"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "#include<stdio.h>\n#include<stdlib.h>\n\nint main(){\n  int n,q;\n  int *S,*T,B[1000000];\n  int i,u;\n  int l,m,r;\n  int count=0,flag,key;\n  \n  scanf(\"%d\",&n);\n  S=(int *)malloc(n*sizeof(int));\n  for(i=0;i<n;i++) scanf(\"%d\",&S[i]);\n  scanf(\"%d\",&q);\n  T=(int *)malloc(q*sizeof(int));\n  for(i=0;i<q;i++) scanf(\"%d\",&T[i]);\n\n\n  for(i=0;i<q;i++){\n    key=T[i];\n    l=0;\n    r=n+2;\n    m=(r+l)/2;\n    flag=0;\n\n    for(u=0;u<count;u++){\n      if(B[u]==key){\n\tflag=1;\n\tbreak;\n      }\n    }\n    \n    while(r>l){\n      if(flag==1) break;\n      if(key==S[m]){\n\tB[count++]=key;\n\tbreak;\n      }\n      else if(key<S[m]){\n\tr=m;\n\tm=(r+l)/2;\n      }else if(key>S[m]){\n\tl=m+1;\n\tm=(r+l)/2;\n      }\n    }\n\n  }\n\n  printf(\"%d\\n\",count);\n\n  free(S);\n  free(T);\n  return 0;\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": 749, "cpu_time_ms": 10, "memory_kb": 2108}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s437328379", "group_id": "codeNet:p02271", "input_text": "#include <stdio.h>\n\nint A[20];\nint solve(int i, int m, int n) {\n  int res;\n  if (m == 0) {\n    return 1;\n  } else if (i >= n) {\n    return 0;\n  } else {\n    res = solve(i + 1, m, n) || solve(i + 1, m - A[i], n);\n    return res;\n  }\n}\n\nint main() {\n  int n, q, m[200], i;\n\n  scanf(\"%d\",&n);\n  for (i = 0; i < n; i++) {\n    scanf(\"%d\",&A[i]);\n  }\n  scanf(\"%d\",&q);\n  for (i = 0; i < q; i++) {\n    scanf(\"%d\",&m[i]);\n  }\n\n  for(i = 0; i < q; i++) {\n    if (solve(0, m[i], n) == 1) {\n      printf(\"yes\\n\");\n    } else {\n      printf(\"no\\n\");\n    }\n  }\n  return 0;\n}\n\n", "language": "C", "metadata": {"date": 1545284743, "filename_ext": "c", "original_language": "C", "problem_description_relpath": "problem_descriptions/p02271.html", "problem_id": "p02271", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02271/input.txt", "sample_output_relpath": "derived/input_output/data/p02271/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02271/C/s437328379.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s437328379", "user_id": "u874359824"}, "prompt_components": {"gold_output": "no\nno\nyes\nyes\nyes\nyes\nno\nno\n", "input_to_evaluate": "#include <stdio.h>\n\nint A[20];\nint solve(int i, int m, int n) {\n  int res;\n  if (m == 0) {\n    return 1;\n  } else if (i >= n) {\n    return 0;\n  } else {\n    res = solve(i + 1, m, n) || solve(i + 1, m - A[i], n);\n    return res;\n  }\n}\n\nint main() {\n  int n, q, m[200], i;\n\n  scanf(\"%d\",&n);\n  for (i = 0; i < n; i++) {\n    scanf(\"%d\",&A[i]);\n  }\n  scanf(\"%d\",&q);\n  for (i = 0; i < q; i++) {\n    scanf(\"%d\",&m[i]);\n  }\n\n  for(i = 0; i < q; i++) {\n    if (solve(0, m[i], n) == 1) {\n      printf(\"yes\\n\");\n    } else {\n      printf(\"no\\n\");\n    }\n  }\n  return 0;\n}\n\n", "problem_context": "Exhaustive Search\n\nWrite a program which reads a sequence A of n elements and an integer M, and outputs \"yes\" if you can make M by adding elements in A, otherwise \"no\". You can use an element only once.\n\nYou are given the sequence A and q questions where each question contains Mi.\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 (Mi) are given.\n\nOutput\n\nFor each question Mi, print yes or no.\n\nConstraints\n\nn ≤ 20\n\nq ≤ 200\n\n1 ≤ elements in A ≤ 2000\n\n1 ≤ Mi ≤ 2000\n\nSample Input 1\n\n5\n1 5 7 10 21\n8\n2 4 17 8 22 21 100 35\n\nSample Output 1\n\nno\nno\nyes\nyes\nyes\nyes\nno\nno\n\nNotes\n\nYou can solve this problem by a Burte Force approach. Suppose solve(p, t) is a function which checkes whether you can make t by selecting elements after p-th element (inclusive). Then you can recursively call the following functions:\n\nsolve(0, M)\n\nsolve(1, M-{sum created from elements before 1st element})\n\nsolve(2, M-{sum created from elements before 2nd element})\n\n...\n\nThe recursive function has two choices: you selected p-th element and not. So, you can check solve(p+1, t-A[p]) and solve(p+1, t) in solve(p, t) to check the all combinations.\n\nFor example, the following figure shows that 8 can be made by A[0] + A[2].", "sample_input": "5\n1 5 7 10 21\n8\n2 4 17 8 22 21 100 35\n"}, "reference_outputs": ["no\nno\nyes\nyes\nyes\nyes\nno\nno\n"], "source_document_id": "p02271", "source_text": "Exhaustive Search\n\nWrite a program which reads a sequence A of n elements and an integer M, and outputs \"yes\" if you can make M by adding elements in A, otherwise \"no\". You can use an element only once.\n\nYou are given the sequence A and q questions where each question contains Mi.\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 (Mi) are given.\n\nOutput\n\nFor each question Mi, print yes or no.\n\nConstraints\n\nn ≤ 20\n\nq ≤ 200\n\n1 ≤ elements in A ≤ 2000\n\n1 ≤ Mi ≤ 2000\n\nSample Input 1\n\n5\n1 5 7 10 21\n8\n2 4 17 8 22 21 100 35\n\nSample Output 1\n\nno\nno\nyes\nyes\nyes\nyes\nno\nno\n\nNotes\n\nYou can solve this problem by a Burte Force approach. Suppose solve(p, t) is a function which checkes whether you can make t by selecting elements after p-th element (inclusive). Then you can recursively call the following functions:\n\nsolve(0, M)\n\nsolve(1, M-{sum created from elements before 1st element})\n\nsolve(2, M-{sum created from elements before 2nd element})\n\n...\n\nThe recursive function has two choices: you selected p-th element and not. So, you can check solve(p+1, t-A[p]) and solve(p+1, t) in solve(p, t) to check the all combinations.\n\nFor example, the following figure shows that 8 can be made by A[0] + A[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": 563, "cpu_time_ms": 440, "memory_kb": 2108}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s230244117", "group_id": "codeNet:p02271", "input_text": "#include <stdio.h>\n\nint solve(int,int,int *,int);\n\nint main()\n{\n  int i,n,A[21],q,m;\n\n  scanf(\"%d\",&n);\n  for(i=1;i<=n;i++){\n    scanf(\"%d\",&A[i]);\n  }\n  scanf(\"%d\",&q);\n  for(i=1;i<=q;i++){\n    scanf(\"%d\",&m);\n  if(solve(1,m,A,n))printf(\"yes\\n\");\n  else printf(\"no\\n\");\n  }\n  return 0;\n}\n\nint solve(int i,int m,int A[],int n)\n{\n  int res;\n\n  if(m == 0)return 1;\n  if(i > n)return 0;\n\n  res = solve(i + 1,m,A,n) || solve(i + 1,m - A[i],A,n);\n  \n  return res;\n}\n\n  \n\n", "language": "C", "metadata": {"date": 1545361995, "filename_ext": "c", "original_language": "C", "problem_description_relpath": "problem_descriptions/p02271.html", "problem_id": "p02271", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02271/input.txt", "sample_output_relpath": "derived/input_output/data/p02271/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02271/C/s230244117.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s230244117", "user_id": "u359802056"}, "prompt_components": {"gold_output": "no\nno\nyes\nyes\nyes\nyes\nno\nno\n", "input_to_evaluate": "#include <stdio.h>\n\nint solve(int,int,int *,int);\n\nint main()\n{\n  int i,n,A[21],q,m;\n\n  scanf(\"%d\",&n);\n  for(i=1;i<=n;i++){\n    scanf(\"%d\",&A[i]);\n  }\n  scanf(\"%d\",&q);\n  for(i=1;i<=q;i++){\n    scanf(\"%d\",&m);\n  if(solve(1,m,A,n))printf(\"yes\\n\");\n  else printf(\"no\\n\");\n  }\n  return 0;\n}\n\nint solve(int i,int m,int A[],int n)\n{\n  int res;\n\n  if(m == 0)return 1;\n  if(i > n)return 0;\n\n  res = solve(i + 1,m,A,n) || solve(i + 1,m - A[i],A,n);\n  \n  return res;\n}\n\n  \n\n", "problem_context": "Exhaustive Search\n\nWrite a program which reads a sequence A of n elements and an integer M, and outputs \"yes\" if you can make M by adding elements in A, otherwise \"no\". You can use an element only once.\n\nYou are given the sequence A and q questions where each question contains Mi.\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 (Mi) are given.\n\nOutput\n\nFor each question Mi, print yes or no.\n\nConstraints\n\nn ≤ 20\n\nq ≤ 200\n\n1 ≤ elements in A ≤ 2000\n\n1 ≤ Mi ≤ 2000\n\nSample Input 1\n\n5\n1 5 7 10 21\n8\n2 4 17 8 22 21 100 35\n\nSample Output 1\n\nno\nno\nyes\nyes\nyes\nyes\nno\nno\n\nNotes\n\nYou can solve this problem by a Burte Force approach. Suppose solve(p, t) is a function which checkes whether you can make t by selecting elements after p-th element (inclusive). Then you can recursively call the following functions:\n\nsolve(0, M)\n\nsolve(1, M-{sum created from elements before 1st element})\n\nsolve(2, M-{sum created from elements before 2nd element})\n\n...\n\nThe recursive function has two choices: you selected p-th element and not. So, you can check solve(p+1, t-A[p]) and solve(p+1, t) in solve(p, t) to check the all combinations.\n\nFor example, the following figure shows that 8 can be made by A[0] + A[2].", "sample_input": "5\n1 5 7 10 21\n8\n2 4 17 8 22 21 100 35\n"}, "reference_outputs": ["no\nno\nyes\nyes\nyes\nyes\nno\nno\n"], "source_document_id": "p02271", "source_text": "Exhaustive Search\n\nWrite a program which reads a sequence A of n elements and an integer M, and outputs \"yes\" if you can make M by adding elements in A, otherwise \"no\". You can use an element only once.\n\nYou are given the sequence A and q questions where each question contains Mi.\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 (Mi) are given.\n\nOutput\n\nFor each question Mi, print yes or no.\n\nConstraints\n\nn ≤ 20\n\nq ≤ 200\n\n1 ≤ elements in A ≤ 2000\n\n1 ≤ Mi ≤ 2000\n\nSample Input 1\n\n5\n1 5 7 10 21\n8\n2 4 17 8 22 21 100 35\n\nSample Output 1\n\nno\nno\nyes\nyes\nyes\nyes\nno\nno\n\nNotes\n\nYou can solve this problem by a Burte Force approach. Suppose solve(p, t) is a function which checkes whether you can make t by selecting elements after p-th element (inclusive). Then you can recursively call the following functions:\n\nsolve(0, M)\n\nsolve(1, M-{sum created from elements before 1st element})\n\nsolve(2, M-{sum created from elements before 2nd element})\n\n...\n\nThe recursive function has two choices: you selected p-th element and not. So, you can check solve(p+1, t-A[p]) and solve(p+1, t) in solve(p, t) to check the all combinations.\n\nFor example, the following figure shows that 8 can be made by A[0] + A[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": 466, "cpu_time_ms": 440, "memory_kb": 2104}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s029260599", "group_id": "codeNet:p02271", "input_text": "#include<stdio.h>\nint n,A[50];\nint sol(int i, int m){\n  if(m==0) return 1;\n  if(i>=n) return 0;\n  int res=sol(i+1,m)||sol(i+1,m-A[i]);\n  return res;\n}\nint main()\n{\n  int q,M,i;\n  scanf(\"%d\",&n);\n  for(i=0;i<n;i++) scanf(\"%d\",&A[i]);\n  scanf(\"%d\",&q);\n  for(i=0;i<q;i++){\n    scanf(\"%d\",&M);\n    if(sol(0,M)) printf(\"yes\\n\");\n    else printf(\"no\\n\");\n  }\n  return 0;\n}", "language": "C", "metadata": {"date": 1495063788, "filename_ext": "c", "original_language": "C", "problem_description_relpath": "problem_descriptions/p02271.html", "problem_id": "p02271", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02271/input.txt", "sample_output_relpath": "derived/input_output/data/p02271/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02271/C/s029260599.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s029260599", "user_id": "u830922391"}, "prompt_components": {"gold_output": "no\nno\nyes\nyes\nyes\nyes\nno\nno\n", "input_to_evaluate": "#include<stdio.h>\nint n,A[50];\nint sol(int i, int m){\n  if(m==0) return 1;\n  if(i>=n) return 0;\n  int res=sol(i+1,m)||sol(i+1,m-A[i]);\n  return res;\n}\nint main()\n{\n  int q,M,i;\n  scanf(\"%d\",&n);\n  for(i=0;i<n;i++) scanf(\"%d\",&A[i]);\n  scanf(\"%d\",&q);\n  for(i=0;i<q;i++){\n    scanf(\"%d\",&M);\n    if(sol(0,M)) printf(\"yes\\n\");\n    else printf(\"no\\n\");\n  }\n  return 0;\n}", "problem_context": "Exhaustive Search\n\nWrite a program which reads a sequence A of n elements and an integer M, and outputs \"yes\" if you can make M by adding elements in A, otherwise \"no\". You can use an element only once.\n\nYou are given the sequence A and q questions where each question contains Mi.\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 (Mi) are given.\n\nOutput\n\nFor each question Mi, print yes or no.\n\nConstraints\n\nn ≤ 20\n\nq ≤ 200\n\n1 ≤ elements in A ≤ 2000\n\n1 ≤ Mi ≤ 2000\n\nSample Input 1\n\n5\n1 5 7 10 21\n8\n2 4 17 8 22 21 100 35\n\nSample Output 1\n\nno\nno\nyes\nyes\nyes\nyes\nno\nno\n\nNotes\n\nYou can solve this problem by a Burte Force approach. Suppose solve(p, t) is a function which checkes whether you can make t by selecting elements after p-th element (inclusive). Then you can recursively call the following functions:\n\nsolve(0, M)\n\nsolve(1, M-{sum created from elements before 1st element})\n\nsolve(2, M-{sum created from elements before 2nd element})\n\n...\n\nThe recursive function has two choices: you selected p-th element and not. So, you can check solve(p+1, t-A[p]) and solve(p+1, t) in solve(p, t) to check the all combinations.\n\nFor example, the following figure shows that 8 can be made by A[0] + A[2].", "sample_input": "5\n1 5 7 10 21\n8\n2 4 17 8 22 21 100 35\n"}, "reference_outputs": ["no\nno\nyes\nyes\nyes\nyes\nno\nno\n"], "source_document_id": "p02271", "source_text": "Exhaustive Search\n\nWrite a program which reads a sequence A of n elements and an integer M, and outputs \"yes\" if you can make M by adding elements in A, otherwise \"no\". You can use an element only once.\n\nYou are given the sequence A and q questions where each question contains Mi.\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 (Mi) are given.\n\nOutput\n\nFor each question Mi, print yes or no.\n\nConstraints\n\nn ≤ 20\n\nq ≤ 200\n\n1 ≤ elements in A ≤ 2000\n\n1 ≤ Mi ≤ 2000\n\nSample Input 1\n\n5\n1 5 7 10 21\n8\n2 4 17 8 22 21 100 35\n\nSample Output 1\n\nno\nno\nyes\nyes\nyes\nyes\nno\nno\n\nNotes\n\nYou can solve this problem by a Burte Force approach. Suppose solve(p, t) is a function which checkes whether you can make t by selecting elements after p-th element (inclusive). Then you can recursively call the following functions:\n\nsolve(0, M)\n\nsolve(1, M-{sum created from elements before 1st element})\n\nsolve(2, M-{sum created from elements before 2nd element})\n\n...\n\nThe recursive function has two choices: you selected p-th element and not. So, you can check solve(p+1, t-A[p]) and solve(p+1, t) in solve(p, t) to check the all combinations.\n\nFor example, the following figure shows that 8 can be made by A[0] + A[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": 367, "cpu_time_ms": 650, "memory_kb": 580}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s601741740", "group_id": "codeNet:p02271", "input_text": "#include <stdio.h>\n\nvoid del_element(int *a,int i,int n, int* temp){\n    int j,k=0;\n    for(j=0;j<n;j++){\n        if(j!=i){\n            temp[k]=a[j];\n            k++;\n        }\n    }\n}\n\nint solve(int *a,int n,int m){\n    if (m == 0) return 1;\n    if (m < 0) return 0;\n    int i;\n    int calc=0;\n    int temp[21];\n\n    for(i=0;i<n;i++){\n        calc=a[i];\n        if(calc==m){\n            return 1;\n        }\n        else{\n            del_element(a,i,n,temp);\n            if(solve(temp,n-1,m-calc)==1){\n                return 1;\n            }\n        }\n    }\n    return 0;\n}\n\nint main(){\n    int n,q,m[201];\n    int A[21];\n    scanf(\"%d\",&n);\n    int i;\n    for(i=0;i<n;i++){\n        scanf(\"%d\",&A[i]);\n    }\n    scanf(\"%d\",&q);\n    for(i=0;i<q;i++){\n        scanf(\"%d\",&m[i]);\n    }\n    for(i=0;i<q;i++){\n        if(solve(A,n,m[i])==1){\n            printf(\"yes\\n\");\n        }\n        else{\n            printf(\"no\\n\");\n        }\n    }\n    return 0;\n}", "language": "C", "metadata": {"date": 1495437763, "filename_ext": "c", "original_language": "C", "problem_description_relpath": "problem_descriptions/p02271.html", "problem_id": "p02271", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02271/input.txt", "sample_output_relpath": "derived/input_output/data/p02271/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02271/C/s601741740.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s601741740", "user_id": "u061571029"}, "prompt_components": {"gold_output": "no\nno\nyes\nyes\nyes\nyes\nno\nno\n", "input_to_evaluate": "#include <stdio.h>\n\nvoid del_element(int *a,int i,int n, int* temp){\n    int j,k=0;\n    for(j=0;j<n;j++){\n        if(j!=i){\n            temp[k]=a[j];\n            k++;\n        }\n    }\n}\n\nint solve(int *a,int n,int m){\n    if (m == 0) return 1;\n    if (m < 0) return 0;\n    int i;\n    int calc=0;\n    int temp[21];\n\n    for(i=0;i<n;i++){\n        calc=a[i];\n        if(calc==m){\n            return 1;\n        }\n        else{\n            del_element(a,i,n,temp);\n            if(solve(temp,n-1,m-calc)==1){\n                return 1;\n            }\n        }\n    }\n    return 0;\n}\n\nint main(){\n    int n,q,m[201];\n    int A[21];\n    scanf(\"%d\",&n);\n    int i;\n    for(i=0;i<n;i++){\n        scanf(\"%d\",&A[i]);\n    }\n    scanf(\"%d\",&q);\n    for(i=0;i<q;i++){\n        scanf(\"%d\",&m[i]);\n    }\n    for(i=0;i<q;i++){\n        if(solve(A,n,m[i])==1){\n            printf(\"yes\\n\");\n        }\n        else{\n            printf(\"no\\n\");\n        }\n    }\n    return 0;\n}", "problem_context": "Exhaustive Search\n\nWrite a program which reads a sequence A of n elements and an integer M, and outputs \"yes\" if you can make M by adding elements in A, otherwise \"no\". You can use an element only once.\n\nYou are given the sequence A and q questions where each question contains Mi.\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 (Mi) are given.\n\nOutput\n\nFor each question Mi, print yes or no.\n\nConstraints\n\nn ≤ 20\n\nq ≤ 200\n\n1 ≤ elements in A ≤ 2000\n\n1 ≤ Mi ≤ 2000\n\nSample Input 1\n\n5\n1 5 7 10 21\n8\n2 4 17 8 22 21 100 35\n\nSample Output 1\n\nno\nno\nyes\nyes\nyes\nyes\nno\nno\n\nNotes\n\nYou can solve this problem by a Burte Force approach. Suppose solve(p, t) is a function which checkes whether you can make t by selecting elements after p-th element (inclusive). Then you can recursively call the following functions:\n\nsolve(0, M)\n\nsolve(1, M-{sum created from elements before 1st element})\n\nsolve(2, M-{sum created from elements before 2nd element})\n\n...\n\nThe recursive function has two choices: you selected p-th element and not. So, you can check solve(p+1, t-A[p]) and solve(p+1, t) in solve(p, t) to check the all combinations.\n\nFor example, the following figure shows that 8 can be made by A[0] + A[2].", "sample_input": "5\n1 5 7 10 21\n8\n2 4 17 8 22 21 100 35\n"}, "reference_outputs": ["no\nno\nyes\nyes\nyes\nyes\nno\nno\n"], "source_document_id": "p02271", "source_text": "Exhaustive Search\n\nWrite a program which reads a sequence A of n elements and an integer M, and outputs \"yes\" if you can make M by adding elements in A, otherwise \"no\". You can use an element only once.\n\nYou are given the sequence A and q questions where each question contains Mi.\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 (Mi) are given.\n\nOutput\n\nFor each question Mi, print yes or no.\n\nConstraints\n\nn ≤ 20\n\nq ≤ 200\n\n1 ≤ elements in A ≤ 2000\n\n1 ≤ Mi ≤ 2000\n\nSample Input 1\n\n5\n1 5 7 10 21\n8\n2 4 17 8 22 21 100 35\n\nSample Output 1\n\nno\nno\nyes\nyes\nyes\nyes\nno\nno\n\nNotes\n\nYou can solve this problem by a Burte Force approach. Suppose solve(p, t) is a function which checkes whether you can make t by selecting elements after p-th element (inclusive). Then you can recursively call the following functions:\n\nsolve(0, M)\n\nsolve(1, M-{sum created from elements before 1st element})\n\nsolve(2, M-{sum created from elements before 2nd element})\n\n...\n\nThe recursive function has two choices: you selected p-th element and not. So, you can check solve(p+1, t-A[p]) and solve(p+1, t) in solve(p, t) to check the all combinations.\n\nFor example, the following figure shows that 8 can be made by A[0] + A[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": 949, "cpu_time_ms": 20000, "memory_kb": 580}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s677254647", "group_id": "codeNet:p02271", "input_text": "#include<stdio.h>\n\nint n, A[50];\n\nint Ex_search (int i, int m);\n\nint main(){\n  int q,M,i;\n\n  scanf(\"%d\",&n);\n  for(i = 0; i < n; i++ )scanf(\"%d\", &A[i]);\n  scanf(\"%d\",&q);\n  for(i = 0; i< q; i++){\n    scanf(\"%d\",&M);\n    if(Ex_search(0,M))printf(\"yes\\n\");\n    else printf(\"no\\n\");\n  }\n\n  return 0;\n}\n\nint Ex_search (int i, int m){\n  if(m==0)return 1;\n  if(i>=n)return 0;\n  int res= Ex_search(i+1,m)||Ex_search(i+1,m-A[i]);\n  return res;\n}\n\n", "language": "C", "metadata": {"date": 1530544905, "filename_ext": "c", "original_language": "C", "problem_description_relpath": "problem_descriptions/p02271.html", "problem_id": "p02271", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02271/input.txt", "sample_output_relpath": "derived/input_output/data/p02271/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02271/C/s677254647.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s677254647", "user_id": "u159204823"}, "prompt_components": {"gold_output": "no\nno\nyes\nyes\nyes\nyes\nno\nno\n", "input_to_evaluate": "#include<stdio.h>\n\nint n, A[50];\n\nint Ex_search (int i, int m);\n\nint main(){\n  int q,M,i;\n\n  scanf(\"%d\",&n);\n  for(i = 0; i < n; i++ )scanf(\"%d\", &A[i]);\n  scanf(\"%d\",&q);\n  for(i = 0; i< q; i++){\n    scanf(\"%d\",&M);\n    if(Ex_search(0,M))printf(\"yes\\n\");\n    else printf(\"no\\n\");\n  }\n\n  return 0;\n}\n\nint Ex_search (int i, int m){\n  if(m==0)return 1;\n  if(i>=n)return 0;\n  int res= Ex_search(i+1,m)||Ex_search(i+1,m-A[i]);\n  return res;\n}\n\n", "problem_context": "Exhaustive Search\n\nWrite a program which reads a sequence A of n elements and an integer M, and outputs \"yes\" if you can make M by adding elements in A, otherwise \"no\". You can use an element only once.\n\nYou are given the sequence A and q questions where each question contains Mi.\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 (Mi) are given.\n\nOutput\n\nFor each question Mi, print yes or no.\n\nConstraints\n\nn ≤ 20\n\nq ≤ 200\n\n1 ≤ elements in A ≤ 2000\n\n1 ≤ Mi ≤ 2000\n\nSample Input 1\n\n5\n1 5 7 10 21\n8\n2 4 17 8 22 21 100 35\n\nSample Output 1\n\nno\nno\nyes\nyes\nyes\nyes\nno\nno\n\nNotes\n\nYou can solve this problem by a Burte Force approach. Suppose solve(p, t) is a function which checkes whether you can make t by selecting elements after p-th element (inclusive). Then you can recursively call the following functions:\n\nsolve(0, M)\n\nsolve(1, M-{sum created from elements before 1st element})\n\nsolve(2, M-{sum created from elements before 2nd element})\n\n...\n\nThe recursive function has two choices: you selected p-th element and not. So, you can check solve(p+1, t-A[p]) and solve(p+1, t) in solve(p, t) to check the all combinations.\n\nFor example, the following figure shows that 8 can be made by A[0] + A[2].", "sample_input": "5\n1 5 7 10 21\n8\n2 4 17 8 22 21 100 35\n"}, "reference_outputs": ["no\nno\nyes\nyes\nyes\nyes\nno\nno\n"], "source_document_id": "p02271", "source_text": "Exhaustive Search\n\nWrite a program which reads a sequence A of n elements and an integer M, and outputs \"yes\" if you can make M by adding elements in A, otherwise \"no\". You can use an element only once.\n\nYou are given the sequence A and q questions where each question contains Mi.\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 (Mi) are given.\n\nOutput\n\nFor each question Mi, print yes or no.\n\nConstraints\n\nn ≤ 20\n\nq ≤ 200\n\n1 ≤ elements in A ≤ 2000\n\n1 ≤ Mi ≤ 2000\n\nSample Input 1\n\n5\n1 5 7 10 21\n8\n2 4 17 8 22 21 100 35\n\nSample Output 1\n\nno\nno\nyes\nyes\nyes\nyes\nno\nno\n\nNotes\n\nYou can solve this problem by a Burte Force approach. Suppose solve(p, t) is a function which checkes whether you can make t by selecting elements after p-th element (inclusive). Then you can recursively call the following functions:\n\nsolve(0, M)\n\nsolve(1, M-{sum created from elements before 1st element})\n\nsolve(2, M-{sum created from elements before 2nd element})\n\n...\n\nThe recursive function has two choices: you selected p-th element and not. So, you can check solve(p+1, t-A[p]) and solve(p+1, t) in solve(p, t) to check the all combinations.\n\nFor example, the following figure shows that 8 can be made by A[0] + A[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": 440, "cpu_time_ms": 500, "memory_kb": 2104}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s960664833", "group_id": "codeNet:p02271", "input_text": "#include <stdio.h>\n\nint A[20];\nint n;\n\nint solve(int p, int t);\nint sort(void *a, void *b);\n\nint main(void) {\n\tint i, q, M, j;\n\t\n\tscanf(\"%d\", &n);\n\tfor (i = 0; i < n; ++i) {\n\t\tscanf(\"%d\", &A[i]);\n\t}\n\t\n\tqsort(A, n, sizeof(A[0]), sort);\n\t\n\tscanf(\"%d\", &q);\n\tfor (i = 0; i < q; ++i) {\n\t\tscanf(\"%d\", &M);\n\t\tfor (j = 0; A[j] > M; ++j);\n\t\tif (solve(j - 1, M)) {\n\t\t\tprintf(\"yes\\n\");\n\t\t} else {\n\t\t\tprintf(\"no\\n\");\n\t\t}\n\t}\n\t\n\treturn 0;\n}\n\nint solve(int p, int t) {\n\tif ((p == n) || (t == 0)) return t == 0;\n\tif ((t >= A[p + 1]) && (solve(p + 1, t - A[p + 1]))) return 1;\n\treturn solve(p + 1, t);\n}\n\nint sort(void *a, void *b) {\n\treturn *(int*)b - *(int*)a;\n}", "language": "C", "metadata": {"date": 1391192302, "filename_ext": "c", "original_language": "C", "problem_description_relpath": "problem_descriptions/p02271.html", "problem_id": "p02271", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02271/input.txt", "sample_output_relpath": "derived/input_output/data/p02271/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02271/C/s960664833.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s960664833", "user_id": "u309428289"}, "prompt_components": {"gold_output": "no\nno\nyes\nyes\nyes\nyes\nno\nno\n", "input_to_evaluate": "#include <stdio.h>\n\nint A[20];\nint n;\n\nint solve(int p, int t);\nint sort(void *a, void *b);\n\nint main(void) {\n\tint i, q, M, j;\n\t\n\tscanf(\"%d\", &n);\n\tfor (i = 0; i < n; ++i) {\n\t\tscanf(\"%d\", &A[i]);\n\t}\n\t\n\tqsort(A, n, sizeof(A[0]), sort);\n\t\n\tscanf(\"%d\", &q);\n\tfor (i = 0; i < q; ++i) {\n\t\tscanf(\"%d\", &M);\n\t\tfor (j = 0; A[j] > M; ++j);\n\t\tif (solve(j - 1, M)) {\n\t\t\tprintf(\"yes\\n\");\n\t\t} else {\n\t\t\tprintf(\"no\\n\");\n\t\t}\n\t}\n\t\n\treturn 0;\n}\n\nint solve(int p, int t) {\n\tif ((p == n) || (t == 0)) return t == 0;\n\tif ((t >= A[p + 1]) && (solve(p + 1, t - A[p + 1]))) return 1;\n\treturn solve(p + 1, t);\n}\n\nint sort(void *a, void *b) {\n\treturn *(int*)b - *(int*)a;\n}", "problem_context": "Exhaustive Search\n\nWrite a program which reads a sequence A of n elements and an integer M, and outputs \"yes\" if you can make M by adding elements in A, otherwise \"no\". You can use an element only once.\n\nYou are given the sequence A and q questions where each question contains Mi.\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 (Mi) are given.\n\nOutput\n\nFor each question Mi, print yes or no.\n\nConstraints\n\nn ≤ 20\n\nq ≤ 200\n\n1 ≤ elements in A ≤ 2000\n\n1 ≤ Mi ≤ 2000\n\nSample Input 1\n\n5\n1 5 7 10 21\n8\n2 4 17 8 22 21 100 35\n\nSample Output 1\n\nno\nno\nyes\nyes\nyes\nyes\nno\nno\n\nNotes\n\nYou can solve this problem by a Burte Force approach. Suppose solve(p, t) is a function which checkes whether you can make t by selecting elements after p-th element (inclusive). Then you can recursively call the following functions:\n\nsolve(0, M)\n\nsolve(1, M-{sum created from elements before 1st element})\n\nsolve(2, M-{sum created from elements before 2nd element})\n\n...\n\nThe recursive function has two choices: you selected p-th element and not. So, you can check solve(p+1, t-A[p]) and solve(p+1, t) in solve(p, t) to check the all combinations.\n\nFor example, the following figure shows that 8 can be made by A[0] + A[2].", "sample_input": "5\n1 5 7 10 21\n8\n2 4 17 8 22 21 100 35\n"}, "reference_outputs": ["no\nno\nyes\nyes\nyes\nyes\nno\nno\n"], "source_document_id": "p02271", "source_text": "Exhaustive Search\n\nWrite a program which reads a sequence A of n elements and an integer M, and outputs \"yes\" if you can make M by adding elements in A, otherwise \"no\". You can use an element only once.\n\nYou are given the sequence A and q questions where each question contains Mi.\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 (Mi) are given.\n\nOutput\n\nFor each question Mi, print yes or no.\n\nConstraints\n\nn ≤ 20\n\nq ≤ 200\n\n1 ≤ elements in A ≤ 2000\n\n1 ≤ Mi ≤ 2000\n\nSample Input 1\n\n5\n1 5 7 10 21\n8\n2 4 17 8 22 21 100 35\n\nSample Output 1\n\nno\nno\nyes\nyes\nyes\nyes\nno\nno\n\nNotes\n\nYou can solve this problem by a Burte Force approach. Suppose solve(p, t) is a function which checkes whether you can make t by selecting elements after p-th element (inclusive). Then you can recursively call the following functions:\n\nsolve(0, M)\n\nsolve(1, M-{sum created from elements before 1st element})\n\nsolve(2, M-{sum created from elements before 2nd element})\n\n...\n\nThe recursive function has two choices: you selected p-th element and not. So, you can check solve(p+1, t-A[p]) and solve(p+1, t) in solve(p, t) to check the all combinations.\n\nFor example, the following figure shows that 8 can be made by A[0] + A[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": 648, "cpu_time_ms": 850, "memory_kb": 584}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s913554849", "group_id": "codeNet:p02271", "input_text": "#include<stdio.h>\n\n#define N 2000\n\nvoid solve(int,int);\n\nint A[N];\nint M[N];\nint n,flag=0;\n\nint main(){\n  int i,q;\n  \n  scanf(\"%d\",&n);\n  for(i=0; i < n; i++){\n    scanf(\"%d\",&A[i]);\n  }\n  \n  scanf(\"%d\",&q);\n  for(i=0; i < q; i++){\n    scanf(\"%d\",&M[i]);\n  }\n\n  for(i=0; i < q; i++){\n    flag = 0;\n    solve(0,M[i]);\n    if(flag == 1){\n      printf(\"yes\\n\");\n    }else{\n      printf(\"no\\n\");\n    }\n  }\n\n  return 0;\n}\n\nvoid solve(int i,int m){\n  if(m == 0){\n    flag = 1;\n  }else if(i < n){\n    solve(i+1,m-A[i]);\n    solve(i+1,m);\n  }\n}", "language": "C", "metadata": {"date": 1400202400, "filename_ext": "c", "original_language": "C", "problem_description_relpath": "problem_descriptions/p02271.html", "problem_id": "p02271", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02271/input.txt", "sample_output_relpath": "derived/input_output/data/p02271/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02271/C/s913554849.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s913554849", "user_id": "u273393776"}, "prompt_components": {"gold_output": "no\nno\nyes\nyes\nyes\nyes\nno\nno\n", "input_to_evaluate": "#include<stdio.h>\n\n#define N 2000\n\nvoid solve(int,int);\n\nint A[N];\nint M[N];\nint n,flag=0;\n\nint main(){\n  int i,q;\n  \n  scanf(\"%d\",&n);\n  for(i=0; i < n; i++){\n    scanf(\"%d\",&A[i]);\n  }\n  \n  scanf(\"%d\",&q);\n  for(i=0; i < q; i++){\n    scanf(\"%d\",&M[i]);\n  }\n\n  for(i=0; i < q; i++){\n    flag = 0;\n    solve(0,M[i]);\n    if(flag == 1){\n      printf(\"yes\\n\");\n    }else{\n      printf(\"no\\n\");\n    }\n  }\n\n  return 0;\n}\n\nvoid solve(int i,int m){\n  if(m == 0){\n    flag = 1;\n  }else if(i < n){\n    solve(i+1,m-A[i]);\n    solve(i+1,m);\n  }\n}", "problem_context": "Exhaustive Search\n\nWrite a program which reads a sequence A of n elements and an integer M, and outputs \"yes\" if you can make M by adding elements in A, otherwise \"no\". You can use an element only once.\n\nYou are given the sequence A and q questions where each question contains Mi.\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 (Mi) are given.\n\nOutput\n\nFor each question Mi, print yes or no.\n\nConstraints\n\nn ≤ 20\n\nq ≤ 200\n\n1 ≤ elements in A ≤ 2000\n\n1 ≤ Mi ≤ 2000\n\nSample Input 1\n\n5\n1 5 7 10 21\n8\n2 4 17 8 22 21 100 35\n\nSample Output 1\n\nno\nno\nyes\nyes\nyes\nyes\nno\nno\n\nNotes\n\nYou can solve this problem by a Burte Force approach. Suppose solve(p, t) is a function which checkes whether you can make t by selecting elements after p-th element (inclusive). Then you can recursively call the following functions:\n\nsolve(0, M)\n\nsolve(1, M-{sum created from elements before 1st element})\n\nsolve(2, M-{sum created from elements before 2nd element})\n\n...\n\nThe recursive function has two choices: you selected p-th element and not. So, you can check solve(p+1, t-A[p]) and solve(p+1, t) in solve(p, t) to check the all combinations.\n\nFor example, the following figure shows that 8 can be made by A[0] + A[2].", "sample_input": "5\n1 5 7 10 21\n8\n2 4 17 8 22 21 100 35\n"}, "reference_outputs": ["no\nno\nyes\nyes\nyes\nyes\nno\nno\n"], "source_document_id": "p02271", "source_text": "Exhaustive Search\n\nWrite a program which reads a sequence A of n elements and an integer M, and outputs \"yes\" if you can make M by adding elements in A, otherwise \"no\". You can use an element only once.\n\nYou are given the sequence A and q questions where each question contains Mi.\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 (Mi) are given.\n\nOutput\n\nFor each question Mi, print yes or no.\n\nConstraints\n\nn ≤ 20\n\nq ≤ 200\n\n1 ≤ elements in A ≤ 2000\n\n1 ≤ Mi ≤ 2000\n\nSample Input 1\n\n5\n1 5 7 10 21\n8\n2 4 17 8 22 21 100 35\n\nSample Output 1\n\nno\nno\nyes\nyes\nyes\nyes\nno\nno\n\nNotes\n\nYou can solve this problem by a Burte Force approach. Suppose solve(p, t) is a function which checkes whether you can make t by selecting elements after p-th element (inclusive). Then you can recursively call the following functions:\n\nsolve(0, M)\n\nsolve(1, M-{sum created from elements before 1st element})\n\nsolve(2, M-{sum created from elements before 2nd element})\n\n...\n\nThe recursive function has two choices: you selected p-th element and not. So, you can check solve(p+1, t-A[p]) and solve(p+1, t) in solve(p, t) to check the all combinations.\n\nFor example, the following figure shows that 8 can be made by A[0] + A[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": 536, "cpu_time_ms": 470, "memory_kb": 584}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s799797431", "group_id": "codeNet:p02271", "input_text": "#include <stdio.h>\n#include <stdlib.h>\n\n#define N 20\nint solve(int,int);\n\nint n;\nint A[N];\n\nint main()\n{\n  int q,i,j = 0;\n  scanf(\"%d\",&n);\n  for(i = 0;i < n;i++)\n    {\n      scanf(\"%d\",&A[i]);\n    }\n  scanf(\"%d\",&q);\n  int M[q];\n  for(i = 0;i < q;i++)\n    {\n      scanf(\"%d\",&M[i]);\n    }\n  for(i = 0;i < q;i++)\n    {\n      if(solve(j,M[i]) == 1)\n\t{\n\t  printf(\"yes\\n\");\n\t}\n      else\n\t{\n\t  printf(\"no\\n\");\n\t}\n    }\n}\n\nint solve(int i,int m)\n{\n  int res;\n  if(m == 0)\n    {\n      return 1;\n    }\n  if(i >= n)\n    {\n      return 0;\n    }\n  res = solve(i + 1,m) || solve(i + 1,m - A[i]);\n  return res;\n}\n\n", "language": "C", "metadata": {"date": 1545024666, "filename_ext": "c", "original_language": "C", "problem_description_relpath": "problem_descriptions/p02271.html", "problem_id": "p02271", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02271/input.txt", "sample_output_relpath": "derived/input_output/data/p02271/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02271/C/s799797431.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s799797431", "user_id": "u261305559"}, "prompt_components": {"gold_output": "no\nno\nyes\nyes\nyes\nyes\nno\nno\n", "input_to_evaluate": "#include <stdio.h>\n#include <stdlib.h>\n\n#define N 20\nint solve(int,int);\n\nint n;\nint A[N];\n\nint main()\n{\n  int q,i,j = 0;\n  scanf(\"%d\",&n);\n  for(i = 0;i < n;i++)\n    {\n      scanf(\"%d\",&A[i]);\n    }\n  scanf(\"%d\",&q);\n  int M[q];\n  for(i = 0;i < q;i++)\n    {\n      scanf(\"%d\",&M[i]);\n    }\n  for(i = 0;i < q;i++)\n    {\n      if(solve(j,M[i]) == 1)\n\t{\n\t  printf(\"yes\\n\");\n\t}\n      else\n\t{\n\t  printf(\"no\\n\");\n\t}\n    }\n}\n\nint solve(int i,int m)\n{\n  int res;\n  if(m == 0)\n    {\n      return 1;\n    }\n  if(i >= n)\n    {\n      return 0;\n    }\n  res = solve(i + 1,m) || solve(i + 1,m - A[i]);\n  return res;\n}\n\n", "problem_context": "Exhaustive Search\n\nWrite a program which reads a sequence A of n elements and an integer M, and outputs \"yes\" if you can make M by adding elements in A, otherwise \"no\". You can use an element only once.\n\nYou are given the sequence A and q questions where each question contains Mi.\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 (Mi) are given.\n\nOutput\n\nFor each question Mi, print yes or no.\n\nConstraints\n\nn ≤ 20\n\nq ≤ 200\n\n1 ≤ elements in A ≤ 2000\n\n1 ≤ Mi ≤ 2000\n\nSample Input 1\n\n5\n1 5 7 10 21\n8\n2 4 17 8 22 21 100 35\n\nSample Output 1\n\nno\nno\nyes\nyes\nyes\nyes\nno\nno\n\nNotes\n\nYou can solve this problem by a Burte Force approach. Suppose solve(p, t) is a function which checkes whether you can make t by selecting elements after p-th element (inclusive). Then you can recursively call the following functions:\n\nsolve(0, M)\n\nsolve(1, M-{sum created from elements before 1st element})\n\nsolve(2, M-{sum created from elements before 2nd element})\n\n...\n\nThe recursive function has two choices: you selected p-th element and not. So, you can check solve(p+1, t-A[p]) and solve(p+1, t) in solve(p, t) to check the all combinations.\n\nFor example, the following figure shows that 8 can be made by A[0] + A[2].", "sample_input": "5\n1 5 7 10 21\n8\n2 4 17 8 22 21 100 35\n"}, "reference_outputs": ["no\nno\nyes\nyes\nyes\nyes\nno\nno\n"], "source_document_id": "p02271", "source_text": "Exhaustive Search\n\nWrite a program which reads a sequence A of n elements and an integer M, and outputs \"yes\" if you can make M by adding elements in A, otherwise \"no\". You can use an element only once.\n\nYou are given the sequence A and q questions where each question contains Mi.\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 (Mi) are given.\n\nOutput\n\nFor each question Mi, print yes or no.\n\nConstraints\n\nn ≤ 20\n\nq ≤ 200\n\n1 ≤ elements in A ≤ 2000\n\n1 ≤ Mi ≤ 2000\n\nSample Input 1\n\n5\n1 5 7 10 21\n8\n2 4 17 8 22 21 100 35\n\nSample Output 1\n\nno\nno\nyes\nyes\nyes\nyes\nno\nno\n\nNotes\n\nYou can solve this problem by a Burte Force approach. Suppose solve(p, t) is a function which checkes whether you can make t by selecting elements after p-th element (inclusive). Then you can recursively call the following functions:\n\nsolve(0, M)\n\nsolve(1, M-{sum created from elements before 1st element})\n\nsolve(2, M-{sum created from elements before 2nd element})\n\n...\n\nThe recursive function has two choices: you selected p-th element and not. So, you can check solve(p+1, t-A[p]) and solve(p+1, t) in solve(p, t) to check the all combinations.\n\nFor example, the following figure shows that 8 can be made by A[0] + A[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": 603, "cpu_time_ms": 430, "memory_kb": 2048}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s124855800", "group_id": "codeNet:p02272", "input_text": "#include <stdio.h>\n#define INFTY 500000 \nint L[INFTY],R[INFTY],A[INFTY],count=0;\n\nvoid merge(int A[],int left,int mid,int right){\n  int n1,n2,i,j,k;\n  n1 = mid - left;\n  n2 = right - mid;\n  for( i = 0 ;i<n1;i++){\n    L[i] = A[left + i];\n      }\n  for (i = 0 ;i<n2;i++){\n    R[i] = A[mid + i];\n      }\n  L[n1] = INFTY;\n  R[n2] = INFTY;\n  i = 0;\n  j = 0;\n  for (k = left ;k< right;k++){\n    if (L[i] <= R[j]){\n      A[k] = L[i];\n      i = i + 1;\n      count++;\n    }\n    else{ \n      A[k] = R[j];\n      j = j + 1;\n      count++;\n    }\n  }\n}\nvoid mergeSort(int A[],int left,int right){\n  int mid;\n  if (left+1 < right){\n    mid = (left + right)/2;\n    mergeSort(A, left, mid);\n    mergeSort(A, mid, right);\n    merge(A, left, mid, right);\n      }\n}\nint main(){\n      int N,i;\n      scanf(\"%d\",&N);\n      for(i=0;i<N;i++){\n\tscanf(\"%d\",&A[i]);\n      }\n      mergeSort(A,0,N);\n\n      for(i=0;i<N;i++){\n\tif(i!=0)printf(\" \");\n\t\n\tprintf(\"%d\",A[i]);\n      }\n      printf(\"\\n\");\n      printf(\"%d\\n\",count);\n        return 0;\n    }\n\n", "language": "C", "metadata": {"date": 1530795506, "filename_ext": "c", "original_language": "C", "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/C/s124855800.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s124855800", "user_id": "u360439655"}, "prompt_components": {"gold_output": "1 2 3 4 5 6 7 8 9 10\n34\n", "input_to_evaluate": "#include <stdio.h>\n#define INFTY 500000 \nint L[INFTY],R[INFTY],A[INFTY],count=0;\n\nvoid merge(int A[],int left,int mid,int right){\n  int n1,n2,i,j,k;\n  n1 = mid - left;\n  n2 = right - mid;\n  for( i = 0 ;i<n1;i++){\n    L[i] = A[left + i];\n      }\n  for (i = 0 ;i<n2;i++){\n    R[i] = A[mid + i];\n      }\n  L[n1] = INFTY;\n  R[n2] = INFTY;\n  i = 0;\n  j = 0;\n  for (k = left ;k< right;k++){\n    if (L[i] <= R[j]){\n      A[k] = L[i];\n      i = i + 1;\n      count++;\n    }\n    else{ \n      A[k] = R[j];\n      j = j + 1;\n      count++;\n    }\n  }\n}\nvoid mergeSort(int A[],int left,int right){\n  int mid;\n  if (left+1 < right){\n    mid = (left + right)/2;\n    mergeSort(A, left, mid);\n    mergeSort(A, mid, right);\n    merge(A, left, mid, right);\n      }\n}\nint main(){\n      int N,i;\n      scanf(\"%d\",&N);\n      for(i=0;i<N;i++){\n\tscanf(\"%d\",&A[i]);\n      }\n      mergeSort(A,0,N);\n\n      for(i=0;i<N;i++){\n\tif(i!=0)printf(\" \");\n\t\n\tprintf(\"%d\",A[i]);\n      }\n      printf(\"\\n\");\n      printf(\"%d\\n\",count);\n        return 0;\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": 1021, "cpu_time_ms": 80, "memory_kb": 5696}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s846042570", "group_id": "codeNet:p02272", "input_text": "#include <stdio.h>\n#define MAX 500000\n#define SENTINEL 2000000000\nint L[MAX/2+2],R[MAX/2+2];\nint count;\nvoid merge(int[],int,int,int,int);\nvoid mergeSort(int[],int,int,int);\nint main(){\n  int A[MAX],n,i;\n  count=0;\n  scanf(\"%d\",&n);\n  for(i=0;i<n;i++)\n    scanf(\"%d\",&A[i]);\n  mergeSort(A,n,0,n);\n  for(i=0;i<n;i++){\n    printf(\"%d\",A[i]);\n    if(i==n-1){\n      printf(\"\\n\");\n      break;\n    }\n    printf(\" \");\n  }\n  printf(\"%d\\n\",count);\n  return 0;\n}\nvoid merge(int A[],int n,int left,int mid,int right){\n  int i,j,k,n1,n2;\n  n1=mid-left;\n  n2=right-mid;\n  for(i=0;i<n1;i++)\n    L[i]=A[left+i];\n  for(j=0;j<n2;j++)\n    R[j]=A[mid+j];\n  L[n1]=SENTINEL;\n  R[n2]=SENTINEL;\n  i=0;\n  j=0;\n  for(k=left;k<right;k++){\n    count++;\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}\nvoid mergeSort(int A[],int n,int left,int right){\n  int mid;\n  if(left+1<right){\n    mid=(left + right)/2;\n   mergeSort(A,n,left,mid);\n    mergeSort(A,n,mid,right);\n    merge(A,n,left,mid,right);\n  }\n}\n\n", "language": "C", "metadata": {"date": 1545671175, "filename_ext": "c", "original_language": "C", "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/C/s846042570.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s846042570", "user_id": "u643545292"}, "prompt_components": {"gold_output": "1 2 3 4 5 6 7 8 9 10\n34\n", "input_to_evaluate": "#include <stdio.h>\n#define MAX 500000\n#define SENTINEL 2000000000\nint L[MAX/2+2],R[MAX/2+2];\nint count;\nvoid merge(int[],int,int,int,int);\nvoid mergeSort(int[],int,int,int);\nint main(){\n  int A[MAX],n,i;\n  count=0;\n  scanf(\"%d\",&n);\n  for(i=0;i<n;i++)\n    scanf(\"%d\",&A[i]);\n  mergeSort(A,n,0,n);\n  for(i=0;i<n;i++){\n    printf(\"%d\",A[i]);\n    if(i==n-1){\n      printf(\"\\n\");\n      break;\n    }\n    printf(\" \");\n  }\n  printf(\"%d\\n\",count);\n  return 0;\n}\nvoid merge(int A[],int n,int left,int mid,int right){\n  int i,j,k,n1,n2;\n  n1=mid-left;\n  n2=right-mid;\n  for(i=0;i<n1;i++)\n    L[i]=A[left+i];\n  for(j=0;j<n2;j++)\n    R[j]=A[mid+j];\n  L[n1]=SENTINEL;\n  R[n2]=SENTINEL;\n  i=0;\n  j=0;\n  for(k=left;k<right;k++){\n    count++;\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}\nvoid mergeSort(int A[],int n,int left,int right){\n  int mid;\n  if(left+1<right){\n    mid=(left + right)/2;\n   mergeSort(A,n,left,mid);\n    mergeSort(A,n,mid,right);\n    merge(A,n,left,mid,right);\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": 1033, "cpu_time_ms": 100, "memory_kb": 5604}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s018402966", "group_id": "codeNet:p02272", "input_text": "#include <stdio.h>\n#define MAX 500000\n#define INFTY 1000000001\n\nint L[MAX/2], R[MAX/2], count = 0;\n\nvoid merge(int *A, int left, int mid, int right) {\n  int i, j, k;\n  int n1 = mid - left;\n  int n2 = right - mid;\n  //L[0...n1], R[0...n2] を生成\n  for (i = 0; i < n1; i++)\n    L[i] = A[left + i];\n  for (i = 0; i < n2; i++)\n    R[i] = A[mid + i];\n  L[n1] = INFTY;\n  R[n2] = INFTY;\n  i = 0;\n  j = 0;\n  for (k = left; k < right; k++) {\n    count++;\n    if (L[i] <= R[j]) {\n      A[k] = L[i];\n      i++;\n    } else {\n      A[k] = R[j];\n      j++;\n    }\n  }\n}\n\nvoid mergeSort(int *A, int left, int right) {\n  if (left+1 < right) {\n    int mid = (left + right)/2;\n    mergeSort(A, left, mid);\n    mergeSort(A, mid, right);\n    merge(A, left, mid, right);\n  }\n}\n\nvoid print_array(int *A, int N) {\n  int i;\n  for(i = 0; i < N - 1; i++) {\n    printf(\"%d \", A[i]);\n  }\n  printf(\"%d\\n\", A[i]);\n}\n\n\nint main() {\n  int A[MAX], n, i;\n  scanf(\"%d\", &n);\n  for (i = 0; i < n; i++) {\n    scanf(\"%d\", &A[i]);\n  }\n  mergeSort(A, 0, n);\n  print_array(A, n);\n  printf(\"%d\\n\", count);\n  return 0;\n}\n\n\n", "language": "C", "metadata": {"date": 1556363131, "filename_ext": "c", "original_language": "C", "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/C/s018402966.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s018402966", "user_id": "u632519491"}, "prompt_components": {"gold_output": "1 2 3 4 5 6 7 8 9 10\n34\n", "input_to_evaluate": "#include <stdio.h>\n#define MAX 500000\n#define INFTY 1000000001\n\nint L[MAX/2], R[MAX/2], count = 0;\n\nvoid merge(int *A, int left, int mid, int right) {\n  int i, j, k;\n  int n1 = mid - left;\n  int n2 = right - mid;\n  //L[0...n1], R[0...n2] を生成\n  for (i = 0; i < n1; i++)\n    L[i] = A[left + i];\n  for (i = 0; i < n2; i++)\n    R[i] = A[mid + i];\n  L[n1] = INFTY;\n  R[n2] = INFTY;\n  i = 0;\n  j = 0;\n  for (k = left; k < right; k++) {\n    count++;\n    if (L[i] <= R[j]) {\n      A[k] = L[i];\n      i++;\n    } else {\n      A[k] = R[j];\n      j++;\n    }\n  }\n}\n\nvoid mergeSort(int *A, int left, int right) {\n  if (left+1 < right) {\n    int mid = (left + right)/2;\n    mergeSort(A, left, mid);\n    mergeSort(A, mid, right);\n    merge(A, left, mid, right);\n  }\n}\n\nvoid print_array(int *A, int N) {\n  int i;\n  for(i = 0; i < N - 1; i++) {\n    printf(\"%d \", A[i]);\n  }\n  printf(\"%d\\n\", A[i]);\n}\n\n\nint main() {\n  int A[MAX], n, i;\n  scanf(\"%d\", &n);\n  for (i = 0; i < n; i++) {\n    scanf(\"%d\", &A[i]);\n  }\n  mergeSort(A, 0, n);\n  print_array(A, n);\n  printf(\"%d\\n\", count);\n  return 0;\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": 1082, "cpu_time_ms": 100, "memory_kb": 5632}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s616785190", "group_id": "codeNet:p02272", "input_text": "#include <stdio.h>\n#include <stdlib.h>\n#define  MAX 500000\n#define INFTY 100000000\nint S[MAX],count=0;\n\nvoid merge(int A[], int left,int mid, int right)\n{\n  int n1,n2,i,j,k;\n  int *L,*R;\n  n1 = mid - left;\n  n2 = right - mid;\n  L = (int *)malloc(sizeof(int)*(n1+1));\n  R = (int *)malloc(sizeof(int)*(n2+1));\n  for(i = 0;i < n1;i++){\n    L[i] = A[left + i];\n  }\n  for(i = 0;i < n2;i++){\n    R[i] = A[mid + i];\n  }\n  L[n1] = INFTY;\n  R[n2] = INFTY;\n  i = 0;\n  j = 0;\n  for(k = left;k < right;k++){\n    if(L[i] <= R[j]){\n      A[k] = L[i];\n      i++;\n      count++;\n    }\n    else{\n      A[k] = R[j];\n      j++;\n      count++;\n    }\n  }\n  free(L);\n  free(R);\n}\n\nvoid mergeSort(int A[], int left, int right)\n{\n  int mid;\n  if(left + 1 < right){\n    mid = (left + right) / 2;\n    mergeSort(A, left, mid);\n    mergeSort(A, mid, right);\n    merge(A, left, mid, right);\n  }\n}\n\nint main()\n{\n  int n,i;\n  scanf(\"%d\",&n);\n  for(i = 0;i < n;i++)\n    scanf(\"%d\",&S[i]);\n  mergeSort(S,0,n);\n  for(i = 0;i < n;i++){\n    printf(\"%d\",S[i]);\n    if(i < n-1) printf(\" \");\n  }\n  printf(\"\\n\");\n  printf(\"%d\\n\",count);\n  return 0;\n}", "language": "C", "metadata": {"date": 1495083735, "filename_ext": "c", "original_language": "C", "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/C/s616785190.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s616785190", "user_id": "u812562904"}, "prompt_components": {"gold_output": "1 2 3 4 5 6 7 8 9 10\n34\n", "input_to_evaluate": "#include <stdio.h>\n#include <stdlib.h>\n#define  MAX 500000\n#define INFTY 100000000\nint S[MAX],count=0;\n\nvoid merge(int A[], int left,int mid, int right)\n{\n  int n1,n2,i,j,k;\n  int *L,*R;\n  n1 = mid - left;\n  n2 = right - mid;\n  L = (int *)malloc(sizeof(int)*(n1+1));\n  R = (int *)malloc(sizeof(int)*(n2+1));\n  for(i = 0;i < n1;i++){\n    L[i] = A[left + i];\n  }\n  for(i = 0;i < n2;i++){\n    R[i] = A[mid + i];\n  }\n  L[n1] = INFTY;\n  R[n2] = INFTY;\n  i = 0;\n  j = 0;\n  for(k = left;k < right;k++){\n    if(L[i] <= R[j]){\n      A[k] = L[i];\n      i++;\n      count++;\n    }\n    else{\n      A[k] = R[j];\n      j++;\n      count++;\n    }\n  }\n  free(L);\n  free(R);\n}\n\nvoid mergeSort(int A[], int left, int right)\n{\n  int mid;\n  if(left + 1 < right){\n    mid = (left + right) / 2;\n    mergeSort(A, left, mid);\n    mergeSort(A, mid, right);\n    merge(A, left, mid, right);\n  }\n}\n\nint main()\n{\n  int n,i;\n  scanf(\"%d\",&n);\n  for(i = 0;i < n;i++)\n    scanf(\"%d\",&S[i]);\n  mergeSort(S,0,n);\n  for(i = 0;i < n;i++){\n    printf(\"%d\",S[i]);\n    if(i < n-1) printf(\" \");\n  }\n  printf(\"\\n\");\n  printf(\"%d\\n\",count);\n  return 0;\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": 1110, "cpu_time_ms": 170, "memory_kb": 4480}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s224716720", "group_id": "codeNet:p02272", "input_text": "#include <stdio.h>\n#define MAX 500000\n#define INFTY 2000000000\n\nint count;\n\nvoid merge(int A[], int left, int mid, int right){\n  int i, j , k, n1, n2;\n  int L[MAX/2+2], R[MAX/2+2];\n \n  n1 = mid - left;\n  n2 = right - mid;\n\n  for(i=0; i<n1; i++){\n    L[i] = A[left+i];\n  }\n  for(i=0; i<n2; i++){\n    R[i] = A[mid+i];\n  }\n\n  L[n1] = INFTY;\n  R[n2] = INFTY;\n  i = 0;\n  j = 0;\n\n  for(k=left; k<right; k++){\n    count++;\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\nvoid mergeSort(int A[], int left,int  right){\n  int mid=0;\n\n  if(left+1 < right){\n    mid = (left + right)/2;\n    mergeSort(A, left, mid);\n    mergeSort(A, mid, right);\n    merge(A, left, mid, right);\n  }\n}\n\nint main(){\n  int i, n;\n  int A[MAX];\n\n  scanf(\"%d\", &n);\n  for(i=0; i<n; i++){\n    scanf(\"%d\", &A[i]);\n  }\n\n  mergeSort(A, 0, n);\n  \n  for(i=0; i<n; i++){\n    printf(\"%d\", A[i]);\n    if(i==n-1) break;\n    printf(\" \");\n  }\n  printf(\"\\n\");\n  printf(\"%d\\n\", count);\n  \n  return 0;\n}", "language": "C", "metadata": {"date": 1495085450, "filename_ext": "c", "original_language": "C", "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/C/s224716720.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s224716720", "user_id": "u013221121"}, "prompt_components": {"gold_output": "1 2 3 4 5 6 7 8 9 10\n34\n", "input_to_evaluate": "#include <stdio.h>\n#define MAX 500000\n#define INFTY 2000000000\n\nint count;\n\nvoid merge(int A[], int left, int mid, int right){\n  int i, j , k, n1, n2;\n  int L[MAX/2+2], R[MAX/2+2];\n \n  n1 = mid - left;\n  n2 = right - mid;\n\n  for(i=0; i<n1; i++){\n    L[i] = A[left+i];\n  }\n  for(i=0; i<n2; i++){\n    R[i] = A[mid+i];\n  }\n\n  L[n1] = INFTY;\n  R[n2] = INFTY;\n  i = 0;\n  j = 0;\n\n  for(k=left; k<right; k++){\n    count++;\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\nvoid mergeSort(int A[], int left,int  right){\n  int mid=0;\n\n  if(left+1 < right){\n    mid = (left + right)/2;\n    mergeSort(A, left, mid);\n    mergeSort(A, mid, right);\n    merge(A, left, mid, right);\n  }\n}\n\nint main(){\n  int i, n;\n  int A[MAX];\n\n  scanf(\"%d\", &n);\n  for(i=0; i<n; i++){\n    scanf(\"%d\", &A[i]);\n  }\n\n  mergeSort(A, 0, n);\n  \n  for(i=0; i<n; i++){\n    printf(\"%d\", A[i]);\n    if(i==n-1) break;\n    printf(\" \");\n  }\n  printf(\"\\n\");\n  printf(\"%d\\n\", count);\n  \n  return 0;\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": 1026, "cpu_time_ms": 160, "memory_kb": 4508}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s237109253", "group_id": "codeNet:p02272", "input_text": "#include<stdio.h>\n#define MAX 500000\nint cou=0;\nvoid mergeSort(int *,int,int);\nvoid merge(int *,int,int,int);\nint main(){\n  int i,n,S[MAX];\n\n  scanf(\"%d\",&n);\n  for(i=0;i<n;i++)scanf(\"%d\",&S[i]);\n\n  mergeSort(S,0,n);\n\n  for(i=0;i<n;i++){\n    printf(\"%d\",S[i]);\n    if(i!=n-1)printf(\" \");\n  }\n  printf(\"\\n%d\\n\",cou);\n  return 0;\n}\n\nvoid mergeSort(int A[],int left,int right){\n  int mid;\n  if(left+1 < right){\n    mid=(left+right)/2;\n    mergeSort(A,left,mid);\n    mergeSort(A,mid,right);\n    merge(A,left,mid,right);\n  }\n}\nvoid merge(int A[],int left,int mid,int right){\n  int n1=mid-left,n2=right-mid;\n  int i,j,L[250000],R[250000],k; \n  for(i=0;i<n1;i++)L[i]=A[left+i];\n  for(i=0;i<n2;i++)R[i]=A[mid+i];\n  L[n1]=R[n2]=20000;\n\n  i=j=0;\n\n  for(k=left;k<right;k++){\n    cou++;\n    if(L[i]<=R[j]){A[k]=L[i];i++;}\n    else {A[k]=R[j];j++;}\n\n  }\n}", "language": "C", "metadata": {"date": 1495087050, "filename_ext": "c", "original_language": "C", "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/C/s237109253.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s237109253", "user_id": "u092702512"}, "prompt_components": {"gold_output": "1 2 3 4 5 6 7 8 9 10\n34\n", "input_to_evaluate": "#include<stdio.h>\n#define MAX 500000\nint cou=0;\nvoid mergeSort(int *,int,int);\nvoid merge(int *,int,int,int);\nint main(){\n  int i,n,S[MAX];\n\n  scanf(\"%d\",&n);\n  for(i=0;i<n;i++)scanf(\"%d\",&S[i]);\n\n  mergeSort(S,0,n);\n\n  for(i=0;i<n;i++){\n    printf(\"%d\",S[i]);\n    if(i!=n-1)printf(\" \");\n  }\n  printf(\"\\n%d\\n\",cou);\n  return 0;\n}\n\nvoid mergeSort(int A[],int left,int right){\n  int mid;\n  if(left+1 < right){\n    mid=(left+right)/2;\n    mergeSort(A,left,mid);\n    mergeSort(A,mid,right);\n    merge(A,left,mid,right);\n  }\n}\nvoid merge(int A[],int left,int mid,int right){\n  int n1=mid-left,n2=right-mid;\n  int i,j,L[250000],R[250000],k; \n  for(i=0;i<n1;i++)L[i]=A[left+i];\n  for(i=0;i<n2;i++)R[i]=A[mid+i];\n  L[n1]=R[n2]=20000;\n\n  i=j=0;\n\n  for(k=left;k<right;k++){\n    cou++;\n    if(L[i]<=R[j]){A[k]=L[i];i++;}\n    else {A[k]=R[j];j++;}\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": 842, "cpu_time_ms": 30, "memory_kb": 1404}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s543564804", "group_id": "codeNet:p02272", "input_text": "#include<stdio.h> //mergesort\n#define N 500000\n#define M 2000000000\n \n \nint L[N/2+2],R[N/2+2];\nint count=0;\n \n \nvoid merge(int A[],int l,int m,int r)\n{\n  int i,j,k;\n  int n1;\n  int n2;\n  \n  n1 = m - l;\n  n2 = r - m;\n\n  for(i=0;i<n1;i++)\n    {\n      L[i] = A[l+i];\n    }\n  for(i=0;i<n2;i++)\n    {\n      R[i]=A[m+i];\n    }\n\n  L[n1] = R[n2]=M;\n  i = j = 0;\n\n  for(k=l;k<r;k++)\n    {\n      count++;\n      if(L[i] <= R[j])\n\t{\n\t  A[k] = L[i];\n\t  i++;\n\t}\n      else\n\t{\n\t  A[k] = R[j];\n\t  j++;\n\t}\n    }\n}\n \n \nvoid mergesort(int A[],int l,int r)\n{\n  int m;\n  if(l+1<r)\n    {\n      m = (l+r)/2;\n      mergesort(A,l,m);\n      mergesort(A,m,r);\n      merge(A,l,m,r);\n    }\n}\n \n \nint main()\n{\n  int i,a,b[N];\n\n  scanf(\"%d\",&a);\n\n  for(i=0;i<a;i++)\n    {\n      scanf(\"%d\",&b[i]);\n    }\n  mergesort(b,0,a);\n  for(i=0;i<a-1;i++)\n    {\n      printf(\"%d \",b[i]);\n    }\n  printf(\"%d\\n\",b[a-1]);\n  printf(\"%d\",count);\n  printf(\"\\n\");\n\n  return 0;\n}", "language": "C", "metadata": {"date": 1502334513, "filename_ext": "c", "original_language": "C", "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/C/s543564804.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s543564804", "user_id": "u794719916"}, "prompt_components": {"gold_output": "1 2 3 4 5 6 7 8 9 10\n34\n", "input_to_evaluate": "#include<stdio.h> //mergesort\n#define N 500000\n#define M 2000000000\n \n \nint L[N/2+2],R[N/2+2];\nint count=0;\n \n \nvoid merge(int A[],int l,int m,int r)\n{\n  int i,j,k;\n  int n1;\n  int n2;\n  \n  n1 = m - l;\n  n2 = r - m;\n\n  for(i=0;i<n1;i++)\n    {\n      L[i] = A[l+i];\n    }\n  for(i=0;i<n2;i++)\n    {\n      R[i]=A[m+i];\n    }\n\n  L[n1] = R[n2]=M;\n  i = j = 0;\n\n  for(k=l;k<r;k++)\n    {\n      count++;\n      if(L[i] <= R[j])\n\t{\n\t  A[k] = L[i];\n\t  i++;\n\t}\n      else\n\t{\n\t  A[k] = R[j];\n\t  j++;\n\t}\n    }\n}\n \n \nvoid mergesort(int A[],int l,int r)\n{\n  int m;\n  if(l+1<r)\n    {\n      m = (l+r)/2;\n      mergesort(A,l,m);\n      mergesort(A,m,r);\n      merge(A,l,m,r);\n    }\n}\n \n \nint main()\n{\n  int i,a,b[N];\n\n  scanf(\"%d\",&a);\n\n  for(i=0;i<a;i++)\n    {\n      scanf(\"%d\",&b[i]);\n    }\n  mergesort(b,0,a);\n  for(i=0;i<a-1;i++)\n    {\n      printf(\"%d \",b[i]);\n    }\n  printf(\"%d\\n\",b[a-1]);\n  printf(\"%d\",count);\n  printf(\"\\n\");\n\n  return 0;\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": 928, "cpu_time_ms": 160, "memory_kb": 4508}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s072846747", "group_id": "codeNet:p02272", "input_text": "#include<stdio.h>\n\n#define Max 500000\n#define Sen 1000000000\n\nint count;\nint l[Max / 2 + 2], r[Max / 2 + 2];\n\nvoid merge(int a[], int n, int left, int mid, int right){\n  int n1, n2, i, j, k;\n  n1 = mid - left;\n  n2 = right - mid;\n\n  for(i = 0 ; i < n1 ; i++) l[i] = a[left + i];\n  for(i = 0 ; i < n2 ; i++) r[i] = a[mid + i];\n  l[n1] = r[n2] = Sen;\n\n  i = 0;\n  j = 0;\n  for(k = left ; k < right ; k++){\n    count++;\n    if(l[i] <= r[j]){\n      a[k] = l[i++];\n    }\n    else{\n      a[k] = r[j++];\n    }\n  }\n}\n\nvoid mergeSort(int a[], int n, int left, int right){\n  if(left + 1 < right){\n    int mid;\n\n    mid = (left + right) / 2;\n    mergeSort(a, n, left, mid);\n    mergeSort(a, n, mid, right);\n    merge(a, n, left, mid, right);\n  }\n}\n\n\nint main(){\n  int a[Max], n, i;\n  count = 0;\n\n  scanf(\"%d\", &n);\n  for(i = 0 ; i < n ; i++) scanf(\"%d\", &a[i]);\n\n  mergeSort(a, n, 0 , n);\n\n  for(i = 0 ; i < n ; i++){\n    if(i) printf(\" \");\n    printf(\"%d\", a[i]);\n  }\n  printf(\"\\n\");\n\n  printf(\"%d\\n\", count);\n\n  return 0;\n}\n", "language": "C", "metadata": {"date": 1530247163, "filename_ext": "c", "original_language": "C", "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/C/s072846747.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s072846747", "user_id": "u158672065"}, "prompt_components": {"gold_output": "1 2 3 4 5 6 7 8 9 10\n34\n", "input_to_evaluate": "#include<stdio.h>\n\n#define Max 500000\n#define Sen 1000000000\n\nint count;\nint l[Max / 2 + 2], r[Max / 2 + 2];\n\nvoid merge(int a[], int n, int left, int mid, int right){\n  int n1, n2, i, j, k;\n  n1 = mid - left;\n  n2 = right - mid;\n\n  for(i = 0 ; i < n1 ; i++) l[i] = a[left + i];\n  for(i = 0 ; i < n2 ; i++) r[i] = a[mid + i];\n  l[n1] = r[n2] = Sen;\n\n  i = 0;\n  j = 0;\n  for(k = left ; k < right ; k++){\n    count++;\n    if(l[i] <= r[j]){\n      a[k] = l[i++];\n    }\n    else{\n      a[k] = r[j++];\n    }\n  }\n}\n\nvoid mergeSort(int a[], int n, int left, int right){\n  if(left + 1 < right){\n    int mid;\n\n    mid = (left + right) / 2;\n    mergeSort(a, n, left, mid);\n    mergeSort(a, n, mid, right);\n    merge(a, n, left, mid, right);\n  }\n}\n\n\nint main(){\n  int a[Max], n, i;\n  count = 0;\n\n  scanf(\"%d\", &n);\n  for(i = 0 ; i < n ; i++) scanf(\"%d\", &a[i]);\n\n  mergeSort(a, n, 0 , n);\n\n  for(i = 0 ; i < n ; i++){\n    if(i) printf(\" \");\n    printf(\"%d\", a[i]);\n  }\n  printf(\"\\n\");\n\n  printf(\"%d\\n\", count);\n\n  return 0;\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": 1014, "cpu_time_ms": 100, "memory_kb": 5596}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s904564138", "group_id": "codeNet:p02272", "input_text": "#include <stdio.h>\n#include <math.h>\n\n\n#define N 500000\n#define SENTINEL 1000000000\n\nint num,L[N/2+2],R[N/2+2];\nint cnt=0;\n\nvoid merge(int [],int,int,int);\nvoid mergeSort(int [],int,int);\n\nint main(){\n    int i,j;\n    int l,m,r;\n    int A[N];\n\n    scanf(\"%d\",&num);\n    for(i=0;i<num;i++){\n        scanf(\"%d\",&A[i]);\n    }\n    l=0;\n\n    mergeSort(A,0,num);\n    for(i=0;i<num;i++){\n        if(i) printf(\" \");\n        printf(\"%d\",A[i]);\n    }\n    printf(\"\\n\");\n    printf(\"%d\\n\",cnt);\n    return 0;\n}\n\nvoid merge(int A[],int l,int m,int r){\n    int n1,n2;\n    int i,j,k;\n\n    n1 = m-l;\n    n2 = r-m;\n\n    for(i=0;i<n1;i++){\n        L[i] = A[l+i];\n    }\n    for(j=0;j<n2;j++){\n        R[j] = A[m+j];\n    }\n    L[n1] = SENTINEL;\n    R[n2] = SENTINEL;\n\n    i=j=0;\n    for(k=l;k<r;k++){\n        cnt++;\n        if(L[i] <= R[j]){\n            A[k] = L[i];\n            i++;\n        }\n        else{\n            A[k] = R[j];\n            j++;\n        }\n    }\n}\n\nvoid mergeSort(int A[],int l,int r){\n    int mid;\n    if(l+1<r){\n        mid = (l+r)/2;\n        mergeSort(A,l,mid);\n        mergeSort(A,mid,r);\n        merge(A,l,mid,r);\n    }\n}\n", "language": "C", "metadata": {"date": 1576758257, "filename_ext": "c", "original_language": "C", "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/C/s904564138.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s904564138", "user_id": "u821907920"}, "prompt_components": {"gold_output": "1 2 3 4 5 6 7 8 9 10\n34\n", "input_to_evaluate": "#include <stdio.h>\n#include <math.h>\n\n\n#define N 500000\n#define SENTINEL 1000000000\n\nint num,L[N/2+2],R[N/2+2];\nint cnt=0;\n\nvoid merge(int [],int,int,int);\nvoid mergeSort(int [],int,int);\n\nint main(){\n    int i,j;\n    int l,m,r;\n    int A[N];\n\n    scanf(\"%d\",&num);\n    for(i=0;i<num;i++){\n        scanf(\"%d\",&A[i]);\n    }\n    l=0;\n\n    mergeSort(A,0,num);\n    for(i=0;i<num;i++){\n        if(i) printf(\" \");\n        printf(\"%d\",A[i]);\n    }\n    printf(\"\\n\");\n    printf(\"%d\\n\",cnt);\n    return 0;\n}\n\nvoid merge(int A[],int l,int m,int r){\n    int n1,n2;\n    int i,j,k;\n\n    n1 = m-l;\n    n2 = r-m;\n\n    for(i=0;i<n1;i++){\n        L[i] = A[l+i];\n    }\n    for(j=0;j<n2;j++){\n        R[j] = A[m+j];\n    }\n    L[n1] = SENTINEL;\n    R[n2] = SENTINEL;\n\n    i=j=0;\n    for(k=l;k<r;k++){\n        cnt++;\n        if(L[i] <= R[j]){\n            A[k] = L[i];\n            i++;\n        }\n        else{\n            A[k] = R[j];\n            j++;\n        }\n    }\n}\n\nvoid mergeSort(int A[],int l,int r){\n    int mid;\n    if(l+1<r){\n        mid = (l+r)/2;\n        mergeSort(A,l,mid);\n        mergeSort(A,mid,r);\n        merge(A,l,mid,r);\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": 1127, "cpu_time_ms": 100, "memory_kb": 5608}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s276936592", "group_id": "codeNet:p02272", "input_text": "#include <stdio.h>\n\nint count = 0;\n\nvoid merge(int a[], int left, int mid, int right) {\n\tint n1 = mid - left;\n\tint n2 = right - mid;\n\tint L[n1], R[n2];\n\tint i, j, k;\n\t\n\tfor (i = 0; i < n1; i++) {\n\t\tL[i] = a[left + i];\n\t}\n\tfor (i = 0; i < n2; i++) {\n\t\tR[i] = a[mid + i];\n\t}\n\tL[n1] = 1000000001; //Inf\n\tR[n2] = 1000000001; //Inf\n\ti = 0;\n\tj = 0;\n\tfor (k = left; k < right; k++) {\n\t\tcount++;\n\t\tif (L[i] <= R[j]) {\n\t\t\ta[k] = L[i];\n\t\t\ti++;\n\t\t}\n\t\telse {\n\t\t\ta[k] = R[j];\n\t\t\tj++;\n\t\t}\n\t}\n}\n\nvoid mergeSort(int a[], int left, int right) {\n\tint mid;\n\n\tif (left + 1 < right) {\n\t\tmid = (left + right) / 2;\n\t\tmergeSort(a, left, mid);\n\t\tmergeSort(a, mid, right);\n\t\tmerge(a, left, mid, right);\n\t}\n}\n\nint main(void) {\n\tint a[500000];\n\tint n, i;\n\n\tscanf(\"%d\", &n);\n\tfor (i = 0; i < n; i++) {\n\t\tscanf(\"%d\", &a[i]);\n\t}\n\t\n\tmergeSort(a, 0, n);\n\n\tfor (i = 0; i < n; i++) {\n\t\tprintf(\"%d\", a[i]);\n\t\tif (i != n - 1) {\n\t\t\tputchar(' ');\n\t\t}\n\t}\n\tputchar('\\n');\n\tprintf(\"%d\\n\", count);\n\n\treturn 0;\n}\n", "language": "C", "metadata": {"date": 1542720404, "filename_ext": "c", "original_language": "C", "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/C/s276936592.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s276936592", "user_id": "u934102130"}, "prompt_components": {"gold_output": "1 2 3 4 5 6 7 8 9 10\n34\n", "input_to_evaluate": "#include <stdio.h>\n\nint count = 0;\n\nvoid merge(int a[], int left, int mid, int right) {\n\tint n1 = mid - left;\n\tint n2 = right - mid;\n\tint L[n1], R[n2];\n\tint i, j, k;\n\t\n\tfor (i = 0; i < n1; i++) {\n\t\tL[i] = a[left + i];\n\t}\n\tfor (i = 0; i < n2; i++) {\n\t\tR[i] = a[mid + i];\n\t}\n\tL[n1] = 1000000001; //Inf\n\tR[n2] = 1000000001; //Inf\n\ti = 0;\n\tj = 0;\n\tfor (k = left; k < right; k++) {\n\t\tcount++;\n\t\tif (L[i] <= R[j]) {\n\t\t\ta[k] = L[i];\n\t\t\ti++;\n\t\t}\n\t\telse {\n\t\t\ta[k] = R[j];\n\t\t\tj++;\n\t\t}\n\t}\n}\n\nvoid mergeSort(int a[], int left, int right) {\n\tint mid;\n\n\tif (left + 1 < right) {\n\t\tmid = (left + right) / 2;\n\t\tmergeSort(a, left, mid);\n\t\tmergeSort(a, mid, right);\n\t\tmerge(a, left, mid, right);\n\t}\n}\n\nint main(void) {\n\tint a[500000];\n\tint n, i;\n\n\tscanf(\"%d\", &n);\n\tfor (i = 0; i < n; i++) {\n\t\tscanf(\"%d\", &a[i]);\n\t}\n\t\n\tmergeSort(a, 0, n);\n\n\tfor (i = 0; i < n; i++) {\n\t\tprintf(\"%d\", a[i]);\n\t\tif (i != n - 1) {\n\t\t\tputchar(' ');\n\t\t}\n\t}\n\tputchar('\\n');\n\tprintf(\"%d\\n\", count);\n\n\treturn 0;\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": 969, "cpu_time_ms": 100, "memory_kb": 5620}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s915024997", "group_id": "codeNet:p02274", "input_text": "#include<stdio.h>\n\nint count=0;\nvoid margesort(int *,int,int);\nvoid marge(int *,int,int,int);\n\nint S[2000000],L[100001],R[100001];\n\nint main(){\n  // FILE* p;\n  int n,i;\n  // p=fopen(\"ALDS1_5_D_in.txt\",\"r\");\n  //fscanf(p,\"%d\",&n);\n  scanf(\"%d\",&n);\n  for(i=0;i<n;i++) //fscanf(p,\"%d\",&S[i]); \n    scanf(\"%d\",&S[i]); \n   margesort(S,0,n);\n   \n   printf(\"%d\\n\",count); \n\n   //fclose(p);   \n\n   return 0;\n}\n\nvoid margesort(int *S,int left,int right){\n  int mid;\n  if(left+1 < right){ \n    mid = (left + right)/2;\n    margesort(S,left,mid);\n    margesort(S,mid,right);\n    marge(S,left,mid,right);\n  }\n}\n\nvoid marge(int *S,int left,int mid,int right){\n  int n1,n2;\n  int i,j=0,k;\n\n  n1 = mid - left;\n  n2 = right - mid;\n\n  for(i=0;i<n1;i++) L[i] = S[left+i];\n  L[n1]=-1;\n  for(i=0;i<n2;i++) R[i] = S[mid+i];\n  R[n2]=-1;\n\n  i=0;\n  for(k=left;k<right;k++){\n  if(L[i] > R[j]){  \n    S[k] = L[i];\n    i++;\n    count += n2 - j;\n  }\n  else{\n    S[k] = R[j];\n    j++;\n  }\n  }\n}", "language": "C", "metadata": {"date": 1431666267, "filename_ext": "c", "original_language": "C", "problem_description_relpath": "problem_descriptions/p02274.html", "problem_id": "p02274", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02274/input.txt", "sample_output_relpath": "derived/input_output/data/p02274/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02274/C/s915024997.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s915024997", "user_id": "u586973217"}, "prompt_components": {"gold_output": "6\n", "input_to_evaluate": "#include<stdio.h>\n\nint count=0;\nvoid margesort(int *,int,int);\nvoid marge(int *,int,int,int);\n\nint S[2000000],L[100001],R[100001];\n\nint main(){\n  // FILE* p;\n  int n,i;\n  // p=fopen(\"ALDS1_5_D_in.txt\",\"r\");\n  //fscanf(p,\"%d\",&n);\n  scanf(\"%d\",&n);\n  for(i=0;i<n;i++) //fscanf(p,\"%d\",&S[i]); \n    scanf(\"%d\",&S[i]); \n   margesort(S,0,n);\n   \n   printf(\"%d\\n\",count); \n\n   //fclose(p);   \n\n   return 0;\n}\n\nvoid margesort(int *S,int left,int right){\n  int mid;\n  if(left+1 < right){ \n    mid = (left + right)/2;\n    margesort(S,left,mid);\n    margesort(S,mid,right);\n    marge(S,left,mid,right);\n  }\n}\n\nvoid marge(int *S,int left,int mid,int right){\n  int n1,n2;\n  int i,j=0,k;\n\n  n1 = mid - left;\n  n2 = right - mid;\n\n  for(i=0;i<n1;i++) L[i] = S[left+i];\n  L[n1]=-1;\n  for(i=0;i<n2;i++) R[i] = S[mid+i];\n  R[n2]=-1;\n\n  i=0;\n  for(k=left;k<right;k++){\n  if(L[i] > R[j]){  \n    S[k] = L[i];\n    i++;\n    count += n2 - j;\n  }\n  else{\n    S[k] = R[j];\n    j++;\n  }\n  }\n}", "problem_context": "MathJax.Hub.Config({ tex2jax: { inlineMath: [[\"$\",\"$\"], [\"\\\\(\",\"\\\\)\"]], processEscapes: true }});\n\nThe Number of Inversions\n\nFor a given sequence $A = \\{a_0, a_1, ... a_{n-1}\\}$, the number of pairs $(i, j)$ where $a_i > a_j$ and $i < j$, is called the number of inversions. The number of inversions is equal to the number of swaps of Bubble Sort defined in the following program:\n\nbubbleSort(A)\ncnt = 0 // the number of inversions\nfor i = 0 to A.length-1\nfor j = A.length-1 downto i+1\nif A[j] < A[j-1]\nswap(A[j], A[j-1])\ncnt++\n\nreturn cnt\n\nFor the given sequence $A$, print the number of inversions of $A$. Note that you should not use the above program, which brings Time Limit Exceeded.\n\nInput\n\nIn the first line, an integer $n$, the number of elements in $A$, is given. In the second line, the elements $a_i$ ($i = 0, 1, .. n-1$) are given separated by space characters.\n\noutput\n\nPrint the number of inversions in a line.\n\nConstraints\n\n$ 1 \\leq n \\leq 200,000$\n\n$ 0 \\leq a_i \\leq 10^9$\n\n$a_i$ are all different\n\nSample Input 1\n\n5\n3 5 2 1 4\n\nSample Output 1\n\n6\n\nSample Input 2\n\n3\n3 1 2\n\nSample Output 2\n\n2", "sample_input": "5\n3 5 2 1 4\n"}, "reference_outputs": ["6\n"], "source_document_id": "p02274", "source_text": "MathJax.Hub.Config({ tex2jax: { inlineMath: [[\"$\",\"$\"], [\"\\\\(\",\"\\\\)\"]], processEscapes: true }});\n\nThe Number of Inversions\n\nFor a given sequence $A = \\{a_0, a_1, ... a_{n-1}\\}$, the number of pairs $(i, j)$ where $a_i > a_j$ and $i < j$, is called the number of inversions. The number of inversions is equal to the number of swaps of Bubble Sort defined in the following program:\n\nbubbleSort(A)\ncnt = 0 // the number of inversions\nfor i = 0 to A.length-1\nfor j = A.length-1 downto i+1\nif A[j] < A[j-1]\nswap(A[j], A[j-1])\ncnt++\n\nreturn cnt\n\nFor the given sequence $A$, print the number of inversions of $A$. Note that you should not use the above program, which brings Time Limit Exceeded.\n\nInput\n\nIn the first line, an integer $n$, the number of elements in $A$, is given. In the second line, the elements $a_i$ ($i = 0, 1, .. n-1$) are given separated by space characters.\n\noutput\n\nPrint the number of inversions in a line.\n\nConstraints\n\n$ 1 \\leq n \\leq 200,000$\n\n$ 0 \\leq a_i \\leq 10^9$\n\n$a_i$ are all different\n\nSample Input 1\n\n5\n3 5 2 1 4\n\nSample Output 1\n\n6\n\nSample Input 2\n\n3\n3 1 2\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": 965, "cpu_time_ms": 10, "memory_kb": 1384}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s756373815", "group_id": "codeNet:p02274", "input_text": "#include <stdio.h>\n#include <stdlib.h>\nlong long merge(int *,int,int,int);\nlong long mergesort(int*,int,int);\nint main(){\n  int A[200000],i,n;\n  scanf(\"%d\",&n);\n  for(i=0;i<n;i++)scanf(\"%d\",&A[i]);\n  long long cnt=mergesort(A,0,n);\n  printf(\"%d\\n\",cnt);\n  return 0;\n}\nlong long merge(int *a,int left,int mid,int right){\n  long long cnt=0;\n  int l,i,k,j,n1=mid-left,n2=right-mid;\n  int *L,*R;\n  L=malloc(sizeof(int)*(n1+2));\n  R=malloc(sizeof(int)*(n2+2));\n  for(i=0;i<n1;i++){\n    L[i]=a[left+i];\n  }\n  for(i=0;i<n2;i++){\n    R[i]=a[mid+i];\n  }\n  L[n1]=2147483647;\n  R[n2]=2147483647;\n  i=0;\n  j=0;\n  for(k=left;k<right;k++){\n    if(L[i]<=R[j])a[k]=L[i++];\n    else{\n      a[k]=R[j++];\n      cnt+=n1-i;\n    }\n  }\n  free(L);\n  free(R);\n  return cnt;\n}\nlong long  mergesort(int *a,int left,int right){\n  int mid;\n  long long v1,v2,v3;\n  if(left+1<right){\n    mid=(left+right)/2;\n    v1=mergesort(a,left,mid);\n    v2=mergesort(a,mid,right);\n    v3=merge(a,left,mid,right);\n    return v1+v2+v3;\n  }\n  else return 0;\n}\n\n\n\n", "language": "C", "metadata": {"date": 1530204368, "filename_ext": "c", "original_language": "C", "problem_description_relpath": "problem_descriptions/p02274.html", "problem_id": "p02274", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02274/input.txt", "sample_output_relpath": "derived/input_output/data/p02274/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02274/C/s756373815.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s756373815", "user_id": "u322648397"}, "prompt_components": {"gold_output": "6\n", "input_to_evaluate": "#include <stdio.h>\n#include <stdlib.h>\nlong long merge(int *,int,int,int);\nlong long mergesort(int*,int,int);\nint main(){\n  int A[200000],i,n;\n  scanf(\"%d\",&n);\n  for(i=0;i<n;i++)scanf(\"%d\",&A[i]);\n  long long cnt=mergesort(A,0,n);\n  printf(\"%d\\n\",cnt);\n  return 0;\n}\nlong long merge(int *a,int left,int mid,int right){\n  long long cnt=0;\n  int l,i,k,j,n1=mid-left,n2=right-mid;\n  int *L,*R;\n  L=malloc(sizeof(int)*(n1+2));\n  R=malloc(sizeof(int)*(n2+2));\n  for(i=0;i<n1;i++){\n    L[i]=a[left+i];\n  }\n  for(i=0;i<n2;i++){\n    R[i]=a[mid+i];\n  }\n  L[n1]=2147483647;\n  R[n2]=2147483647;\n  i=0;\n  j=0;\n  for(k=left;k<right;k++){\n    if(L[i]<=R[j])a[k]=L[i++];\n    else{\n      a[k]=R[j++];\n      cnt+=n1-i;\n    }\n  }\n  free(L);\n  free(R);\n  return cnt;\n}\nlong long  mergesort(int *a,int left,int right){\n  int mid;\n  long long v1,v2,v3;\n  if(left+1<right){\n    mid=(left+right)/2;\n    v1=mergesort(a,left,mid);\n    v2=mergesort(a,mid,right);\n    v3=merge(a,left,mid,right);\n    return v1+v2+v3;\n  }\n  else return 0;\n}\n\n\n\n", "problem_context": "MathJax.Hub.Config({ tex2jax: { inlineMath: [[\"$\",\"$\"], [\"\\\\(\",\"\\\\)\"]], processEscapes: true }});\n\nThe Number of Inversions\n\nFor a given sequence $A = \\{a_0, a_1, ... a_{n-1}\\}$, the number of pairs $(i, j)$ where $a_i > a_j$ and $i < j$, is called the number of inversions. The number of inversions is equal to the number of swaps of Bubble Sort defined in the following program:\n\nbubbleSort(A)\ncnt = 0 // the number of inversions\nfor i = 0 to A.length-1\nfor j = A.length-1 downto i+1\nif A[j] < A[j-1]\nswap(A[j], A[j-1])\ncnt++\n\nreturn cnt\n\nFor the given sequence $A$, print the number of inversions of $A$. Note that you should not use the above program, which brings Time Limit Exceeded.\n\nInput\n\nIn the first line, an integer $n$, the number of elements in $A$, is given. In the second line, the elements $a_i$ ($i = 0, 1, .. n-1$) are given separated by space characters.\n\noutput\n\nPrint the number of inversions in a line.\n\nConstraints\n\n$ 1 \\leq n \\leq 200,000$\n\n$ 0 \\leq a_i \\leq 10^9$\n\n$a_i$ are all different\n\nSample Input 1\n\n5\n3 5 2 1 4\n\nSample Output 1\n\n6\n\nSample Input 2\n\n3\n3 1 2\n\nSample Output 2\n\n2", "sample_input": "5\n3 5 2 1 4\n"}, "reference_outputs": ["6\n"], "source_document_id": "p02274", "source_text": "MathJax.Hub.Config({ tex2jax: { inlineMath: [[\"$\",\"$\"], [\"\\\\(\",\"\\\\)\"]], processEscapes: true }});\n\nThe Number of Inversions\n\nFor a given sequence $A = \\{a_0, a_1, ... a_{n-1}\\}$, the number of pairs $(i, j)$ where $a_i > a_j$ and $i < j$, is called the number of inversions. The number of inversions is equal to the number of swaps of Bubble Sort defined in the following program:\n\nbubbleSort(A)\ncnt = 0 // the number of inversions\nfor i = 0 to A.length-1\nfor j = A.length-1 downto i+1\nif A[j] < A[j-1]\nswap(A[j], A[j-1])\ncnt++\n\nreturn cnt\n\nFor the given sequence $A$, print the number of inversions of $A$. Note that you should not use the above program, which brings Time Limit Exceeded.\n\nInput\n\nIn the first line, an integer $n$, the number of elements in $A$, is given. In the second line, the elements $a_i$ ($i = 0, 1, .. n-1$) are given separated by space characters.\n\noutput\n\nPrint the number of inversions in a line.\n\nConstraints\n\n$ 1 \\leq n \\leq 200,000$\n\n$ 0 \\leq a_i \\leq 10^9$\n\n$a_i$ are all different\n\nSample Input 1\n\n5\n3 5 2 1 4\n\nSample Output 1\n\n6\n\nSample Input 2\n\n3\n3 1 2\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": 1017, "cpu_time_ms": 10, "memory_kb": 2296}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s468820125", "group_id": "codeNet:p02275", "input_text": "#include<stdio.h>                                                                                                   \n#include<stdlib.h>                                                                                                  \nvoid countingsort(int n,int a[],int b[],int k){                                                                     \n  int i,j,c[k+1];                                                                                                   \n  for(i=0;i<=k;i++)c[i]=0;                                                                                          \n  for(j=1;j<=n;j++)c[a[j]]++;                                                                                       \n  for(i=1;i<=k;i++)c[i]=c[i]+c[i-1];                                                                                \n  for(j=n;j>=1;j--){                                                                                                \n    b[c[a[j]]]=a[j];                                                                                                \n    c[a[j]]--;                                                                                                      \n  }                                                                                                                 \n}                                                                                                                   \n                                                                                                                    \nint main(){                                                                                                         \n  int n,*a,i,*b,k=0;                                                                                                \n                                                                                                                    \n  scanf(\"%d\",&n);                                                                                                   \n  a=(int *)malloc(n*sizeof(int));                                                                                   \n  b=(int *)malloc(n*sizeof(int));                                                                                   \n  for(i=1;i<=n;i++){                                                                                                \n    scanf(\"%d\",&a[i]);                                                                                              \n    if(k<a[i])k=a[i];                                                                                               \n  }                                                                                                                 \n  countingsort(n,a,b,k);                                                                                            \n  for(i=1;i<n;i++)printf(\"%d \",b[i]);                                                                               \n  printf(\"%d\\n\",b[n]);                                                                                              \n  return 0;                                                                                                         \n}                                                                                                                   \n                                                                                                                    \n          \n", "language": "C", "metadata": {"date": 1545386483, "filename_ext": "c", "original_language": "C", "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/C/s468820125.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s468820125", "user_id": "u304916835"}, "prompt_components": {"gold_output": "0 1 2 2 3 3 5\n", "input_to_evaluate": "#include<stdio.h>                                                                                                   \n#include<stdlib.h>                                                                                                  \nvoid countingsort(int n,int a[],int b[],int k){                                                                     \n  int i,j,c[k+1];                                                                                                   \n  for(i=0;i<=k;i++)c[i]=0;                                                                                          \n  for(j=1;j<=n;j++)c[a[j]]++;                                                                                       \n  for(i=1;i<=k;i++)c[i]=c[i]+c[i-1];                                                                                \n  for(j=n;j>=1;j--){                                                                                                \n    b[c[a[j]]]=a[j];                                                                                                \n    c[a[j]]--;                                                                                                      \n  }                                                                                                                 \n}                                                                                                                   \n                                                                                                                    \nint main(){                                                                                                         \n  int n,*a,i,*b,k=0;                                                                                                \n                                                                                                                    \n  scanf(\"%d\",&n);                                                                                                   \n  a=(int *)malloc(n*sizeof(int));                                                                                   \n  b=(int *)malloc(n*sizeof(int));                                                                                   \n  for(i=1;i<=n;i++){                                                                                                \n    scanf(\"%d\",&a[i]);                                                                                              \n    if(k<a[i])k=a[i];                                                                                               \n  }                                                                                                                 \n  countingsort(n,a,b,k);                                                                                            \n  for(i=1;i<n;i++)printf(\"%d \",b[i]);                                                                               \n  printf(\"%d\\n\",b[n]);                                                                                              \n  return 0;                                                                                                         \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": 3404, "cpu_time_ms": 230, "memory_kb": 17396}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s614176540", "group_id": "codeNet:p02275", "input_text": "#include<stdio.h>\n#define N 1000\nint i,n,in[2000001],tmp[N],out[2000001];\nint main()\n{\n  scanf(\"%d\",&n);\n  for(i=1;i<n+1;i++){\n    scanf(\"%d\",&in[i]);\n  }\n  for(i=0;i<N;i++) tmp[i]=0;\n  for(i=1;i<n+1;i++)tmp[in[i]]+=1;\n  for(i=0;i<N;i++)  tmp[i]+=tmp[i-1];\n  for(i=n+1;i>0;i--){\n    out[tmp[in[i]]]=in[i];\n    tmp[in[i]]-=1;\n  }\n  for(i=1;i<n;i++){\n    printf(\"%d \",out[i]);\n  }\n  printf(\"%d\\n\",out[i]);\n  return 0;\n}\n\n", "language": "C", "metadata": {"date": 1545693382, "filename_ext": "c", "original_language": "C", "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/C/s614176540.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s614176540", "user_id": "u904241098"}, "prompt_components": {"gold_output": "0 1 2 2 3 3 5\n", "input_to_evaluate": "#include<stdio.h>\n#define N 1000\nint i,n,in[2000001],tmp[N],out[2000001];\nint main()\n{\n  scanf(\"%d\",&n);\n  for(i=1;i<n+1;i++){\n    scanf(\"%d\",&in[i]);\n  }\n  for(i=0;i<N;i++) tmp[i]=0;\n  for(i=1;i<n+1;i++)tmp[in[i]]+=1;\n  for(i=0;i<N;i++)  tmp[i]+=tmp[i-1];\n  for(i=n+1;i>0;i--){\n    out[tmp[in[i]]]=in[i];\n    tmp[in[i]]-=1;\n  }\n  for(i=1;i<n;i++){\n    printf(\"%d \",out[i]);\n  }\n  printf(\"%d\\n\",out[i]);\n  return 0;\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": 419, "cpu_time_ms": 210, "memory_kb": 10468}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s755715983", "group_id": "codeNet:p02275", "input_text": "#include<stdio.h>\n\n#define AMAX 2000000\n#define BCMAX 10000\n\n\nint gn;\n \nvoid countingSort( int A[], int B[], int k )\n{\n\tlong long i,j;\n\tint C[BCMAX+1];\n\n\tfor( i=0; i<=k; i++ ) {\n\t\tC[i]=0;\n\t}\n\tfor( j=1; j<=gn; j++ ) {\n\t\tC[ A[j] ]=C[ A[j] ]+1;\n\t}\n\tfor( i=1; i<=k; i++ ) {\n\t\tC[i]=C[i]+C[ i-1 ];\n\t}\n\tfor( j=gn; 0<j; j-- ) {\n\t\tB[ C[ A[j] ] ]=A[j];\n\t\tC[ A[j] ]=C[ A[j] ]-1;\n\t}\n\n\treturn;\n}\n\nint main( void ) \n{\t\n\tlong long i;\n\tint A[AMAX+1];\n\tint B[BCMAX+1];\n\tint k;\n\t\t\n    scanf( \"%d\", &gn );\n\t\n\tk=0;\n\tfor( i=1; i<=gn; i++ ) {\n\t\tscanf( \"%d\", &A[i] );\n\t\tif( k < A[i] ) {\n\t\t\tk=A[i];\n\t\t}\n\t}\t\n\tcountingSort( A, B, k );\n\tfor( i=1; i<=gn; i++ ) {\n\t\tprintf( \"%d\", B[i] );\n\t\tif( i < gn ) {\n\t\t\tprintf( \" \" );\n\t\t}\n\t}\n\tprintf( \"\\n\" );\n\n    return 0;\n}", "language": "C", "metadata": {"date": 1427976447, "filename_ext": "c", "original_language": "C", "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/C/s755715983.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s755715983", "user_id": "u604774382"}, "prompt_components": {"gold_output": "0 1 2 2 3 3 5\n", "input_to_evaluate": "#include<stdio.h>\n\n#define AMAX 2000000\n#define BCMAX 10000\n\n\nint gn;\n \nvoid countingSort( int A[], int B[], int k )\n{\n\tlong long i,j;\n\tint C[BCMAX+1];\n\n\tfor( i=0; i<=k; i++ ) {\n\t\tC[i]=0;\n\t}\n\tfor( j=1; j<=gn; j++ ) {\n\t\tC[ A[j] ]=C[ A[j] ]+1;\n\t}\n\tfor( i=1; i<=k; i++ ) {\n\t\tC[i]=C[i]+C[ i-1 ];\n\t}\n\tfor( j=gn; 0<j; j-- ) {\n\t\tB[ C[ A[j] ] ]=A[j];\n\t\tC[ A[j] ]=C[ A[j] ]-1;\n\t}\n\n\treturn;\n}\n\nint main( void ) \n{\t\n\tlong long i;\n\tint A[AMAX+1];\n\tint B[BCMAX+1];\n\tint k;\n\t\t\n    scanf( \"%d\", &gn );\n\t\n\tk=0;\n\tfor( i=1; i<=gn; i++ ) {\n\t\tscanf( \"%d\", &A[i] );\n\t\tif( k < A[i] ) {\n\t\t\tk=A[i];\n\t\t}\n\t}\t\n\tcountingSort( A, B, k );\n\tfor( i=1; i<=gn; i++ ) {\n\t\tprintf( \"%d\", B[i] );\n\t\tif( i < gn ) {\n\t\t\tprintf( \" \" );\n\t\t}\n\t}\n\tprintf( \"\\n\" );\n\n    return 0;\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": 734, "cpu_time_ms": 240, "memory_kb": 8412}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s818820249", "group_id": "codeNet:p02275", "input_text": "#include<stdio.h>\n#include<stdlib.h>\n#define MAX 2000001\n#define VMAX 10000\n\nint main(){\n  int *A,*B;\n\n  int C[VMAX+1];\n  int n,i,j;\n  scanf(\"%d\",&n);\n\n  A=malloc(sizeof(int)*n+1);\n  B=malloc(sizeof(int)*n+1);\n\n  for(i=0;i<=VMAX;i++) C[i]=0;\n\n  for(i=0;i<n;i++){\n    scanf(\"%d\",&A[i+1]);\n    C[A[i+1]]++;\n  }\n\n  for(i=1;i<=VMAX;i++) C[i]=C[i]+C[i-1];\n\n  for(j=1;j<=n;j++){\n    B[C[A[j]]]=A[j];\n    C[A[j]]--;\n  }\n\n\n  for(i=1;i<=n;i++){\n    if(i>1)printf(\" \");\n    printf(\"%d\",B[i]);\n  }\n  printf(\"\\n\");\n\n  return 0;\n}", "language": "C", "metadata": {"date": 1464745116, "filename_ext": "c", "original_language": "C", "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/C/s818820249.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s818820249", "user_id": "u430590334"}, "prompt_components": {"gold_output": "0 1 2 2 3 3 5\n", "input_to_evaluate": "#include<stdio.h>\n#include<stdlib.h>\n#define MAX 2000001\n#define VMAX 10000\n\nint main(){\n  int *A,*B;\n\n  int C[VMAX+1];\n  int n,i,j;\n  scanf(\"%d\",&n);\n\n  A=malloc(sizeof(int)*n+1);\n  B=malloc(sizeof(int)*n+1);\n\n  for(i=0;i<=VMAX;i++) C[i]=0;\n\n  for(i=0;i<n;i++){\n    scanf(\"%d\",&A[i+1]);\n    C[A[i+1]]++;\n  }\n\n  for(i=1;i<=VMAX;i++) C[i]=C[i]+C[i-1];\n\n  for(j=1;j<=n;j++){\n    B[C[A[j]]]=A[j];\n    C[A[j]]--;\n  }\n\n\n  for(i=1;i<=n;i++){\n    if(i>1)printf(\" \");\n    printf(\"%d\",B[i]);\n  }\n  printf(\"\\n\");\n\n  return 0;\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": 517, "cpu_time_ms": 400, "memory_kb": 16276}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s206428025", "group_id": "codeNet:p02275", "input_text": "#include<stdio.h>\n#include<stdlib.h>\n\n#define MAX 2000001\n#define VMAX 10000\n\nint main(){\n  unsigned short *A, *B;\n\n  int C[VMAX + 1];\n  int n, i, j;\n  scanf(\"%d\", &n);\n\n  A = malloc(sizeof(short) * n + 1);\n  B = malloc(sizeof(short) * n + 1);\n\n  for( i = 0 ; i <= VMAX ; i++) C[i] = 0;\n\n  for(i = 0 ; i < n ; i++){\n    scanf (\"%hu\", &A[i + 1]);\n    C[A[i + 1]]++;\n  }\n\n  for(i = 1 ; i <= VMAX ; i++) C[i] = C[i] + C[i - 1];\n\n  for(j = 1 ; j <= n ; j++){\n    B[C[A[j]]] = A[j];\n    C[A[j]]--;\n  }\n\n\n  for(i = 1 ; i <= n ; i++){\n    if(i > 1) printf(\" \");\n    printf(\"%d\",B[i]);\n  }\n  printf(\"\\n\");\n\n  return 0;\n}", "language": "C", "metadata": {"date": 1496204499, "filename_ext": "c", "original_language": "C", "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/C/s206428025.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s206428025", "user_id": "u276118843"}, "prompt_components": {"gold_output": "0 1 2 2 3 3 5\n", "input_to_evaluate": "#include<stdio.h>\n#include<stdlib.h>\n\n#define MAX 2000001\n#define VMAX 10000\n\nint main(){\n  unsigned short *A, *B;\n\n  int C[VMAX + 1];\n  int n, i, j;\n  scanf(\"%d\", &n);\n\n  A = malloc(sizeof(short) * n + 1);\n  B = malloc(sizeof(short) * n + 1);\n\n  for( i = 0 ; i <= VMAX ; i++) C[i] = 0;\n\n  for(i = 0 ; i < n ; i++){\n    scanf (\"%hu\", &A[i + 1]);\n    C[A[i + 1]]++;\n  }\n\n  for(i = 1 ; i <= VMAX ; i++) C[i] = C[i] + C[i - 1];\n\n  for(j = 1 ; j <= n ; j++){\n    B[C[A[j]]] = A[j];\n    C[A[j]]--;\n  }\n\n\n  for(i = 1 ; i <= n ; i++){\n    if(i > 1) printf(\" \");\n    printf(\"%d\",B[i]);\n  }\n  printf(\"\\n\");\n\n  return 0;\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": 612, "cpu_time_ms": 400, "memory_kb": 8464}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s602014431", "group_id": "codeNet:p02276", "input_text": "#include <stdio.h>\n#include <stdlib.h>\n#define MAX 100000\n#define VMAX 100000\n\nint main(){\n  unsigned short *A;\n  int n, i, j,x,temp;\n\n  scanf(\"%d\", &n);\n\n  A = malloc(sizeof(short)*n+1);\n\n  for(i=0; i<n; i++){\n      scanf(\"%d\",&A[i]);\n  }\n\n  x=A[n-1];\n  i=-1;\n  for(j=0; j<n-1; j++){\n      if(A[j]<=x){\n          i++;\n          temp=A[j];\n          A[j]=A[i];\n          A[i]=temp;\n      }\n  }\n  temp=A[i+1];\n  A[i+1]=A[n-1];\n  A[n-1]=temp;\n\n  for(j=0; j<n; j++){\n      if(j)printf(\" \");\n      if(j==i+1)printf(\"[\");\n      printf(\"%d\",A[j]);\n      if(j==i+1)printf(\"]\");\n  }\n  printf(\"\\n\");\n\n\n  return 0;\n}\n\n\n", "language": "C", "metadata": {"date": 1545853382, "filename_ext": "c", "original_language": "C", "problem_description_relpath": "problem_descriptions/p02276.html", "problem_id": "p02276", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02276/input.txt", "sample_output_relpath": "derived/input_output/data/p02276/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02276/C/s602014431.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s602014431", "user_id": "u804900954"}, "prompt_components": {"gold_output": "9 5 8 7 4 2 6 [11] 21 13 19 12\n", "input_to_evaluate": "#include <stdio.h>\n#include <stdlib.h>\n#define MAX 100000\n#define VMAX 100000\n\nint main(){\n  unsigned short *A;\n  int n, i, j,x,temp;\n\n  scanf(\"%d\", &n);\n\n  A = malloc(sizeof(short)*n+1);\n\n  for(i=0; i<n; i++){\n      scanf(\"%d\",&A[i]);\n  }\n\n  x=A[n-1];\n  i=-1;\n  for(j=0; j<n-1; j++){\n      if(A[j]<=x){\n          i++;\n          temp=A[j];\n          A[j]=A[i];\n          A[i]=temp;\n      }\n  }\n  temp=A[i+1];\n  A[i+1]=A[n-1];\n  A[n-1]=temp;\n\n  for(j=0; j<n; j++){\n      if(j)printf(\" \");\n      if(j==i+1)printf(\"[\");\n      printf(\"%d\",A[j]);\n      if(j==i+1)printf(\"]\");\n  }\n  printf(\"\\n\");\n\n\n  return 0;\n}\n\n\n", "problem_context": "Partition\n\nQuick sort is based on the Divide-and-conquer approach. In QuickSort(A, p, r), first, a procedure Partition(A, p, r) divides an array A[p..r] into two subarrays A[p..q-1] and A[q+1..r] such that each element of A[p..q-1] is less than or equal to A[q], which is, inturn, less than or equal to each element of A[q+1..r]. It also computes the index q.\n\nIn the conquer processes, the two subarrays A[p..q-1] and A[q+1..r] are sorted by recursive calls of QuickSort(A, p, q-1) and QuickSort(A, q+1, r).\n\nYour task is to read a sequence A and perform the Partition based on the following pseudocode:\n\nPartition(A, p, r)\n1 x = A[r]\n2 i = p-1\n3 for j = p to r-1\n4 do if A[j] <= x\n5 then i = i+1\n6 exchange A[i] and A[j]\n7 exchange A[i+1] and A[r]\n8 return i+1\n\nNote that, in this algorithm, Partition always selects an element A[r] as a pivot element around which to partition the array A[p..r].\n\nInput\n\nThe first line of the input includes an integer n, the number of elements in the sequence A.\n\nIn the second line, Ai (i = 1,2,...,n), elements of the sequence are given separated by space characters.\n\nOutput\n\nPrint the sorted sequence. Two contiguous elements of the sequence should be separated by a space character. The element which is selected as the pivot of the partition should be indicated by [  ].\n\nConstraints\n\n1 ≤ n ≤ 100,000\n\n0 ≤ Ai ≤ 100,000\n\nSample Input 1\n\n12\n13 19 9 5 12 8 7 4 21 2 6 11\n\nSample Output 1\n\n9 5 8 7 4 2 6 [11] 21 13 19 12", "sample_input": "12\n13 19 9 5 12 8 7 4 21 2 6 11\n"}, "reference_outputs": ["9 5 8 7 4 2 6 [11] 21 13 19 12\n"], "source_document_id": "p02276", "source_text": "Partition\n\nQuick sort is based on the Divide-and-conquer approach. In QuickSort(A, p, r), first, a procedure Partition(A, p, r) divides an array A[p..r] into two subarrays A[p..q-1] and A[q+1..r] such that each element of A[p..q-1] is less than or equal to A[q], which is, inturn, less than or equal to each element of A[q+1..r]. It also computes the index q.\n\nIn the conquer processes, the two subarrays A[p..q-1] and A[q+1..r] are sorted by recursive calls of QuickSort(A, p, q-1) and QuickSort(A, q+1, r).\n\nYour task is to read a sequence A and perform the Partition based on the following pseudocode:\n\nPartition(A, p, r)\n1 x = A[r]\n2 i = p-1\n3 for j = p to r-1\n4 do if A[j] <= x\n5 then i = i+1\n6 exchange A[i] and A[j]\n7 exchange A[i+1] and A[r]\n8 return i+1\n\nNote that, in this algorithm, Partition always selects an element A[r] as a pivot element around which to partition the array A[p..r].\n\nInput\n\nThe first line of the input includes an integer n, the number of elements in the sequence A.\n\nIn the second line, Ai (i = 1,2,...,n), elements of the sequence are given separated by space characters.\n\nOutput\n\nPrint the sorted sequence. Two contiguous elements of the sequence should be separated by a space character. The element which is selected as the pivot of the partition should be indicated by [  ].\n\nConstraints\n\n1 ≤ n ≤ 100,000\n\n0 ≤ Ai ≤ 100,000\n\nSample Input 1\n\n12\n13 19 9 5 12 8 7 4 21 2 6 11\n\nSample Output 1\n\n9 5 8 7 4 2 6 [11] 21 13 19 12", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 609, "cpu_time_ms": 10, "memory_kb": 2052}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s703217087", "group_id": "codeNet:p02277", "input_text": "#include <stdio.h>\n#include <stdlib.h>\n\n#define false 0\n#define true 1\n\n#define INFTY 2147483647\n\n\nvoid swapInt( int *n1, int *n2) {\n  \n  int tmp;\n  \n  tmp = *n1;\n  *n1 = *n2;\n  *n2 = tmp;\n  \n}\n\nvoid swapChar( char *c1, char *c2) {\n  \n  char tmp;\n  \n  tmp = *c1;\n  *c1 = *c2;\n  *c2 = tmp;\n  \n}\n\n\nint partition( int *a, char *c, int p, int r) {\n  \n  int x;\n  int i, j;\n  \n  x = a[r];\n  i = p-1;\n  \n  for( j=p; j<r; j++) {\n    if( a[j] <= x ) {\n      i++;\n      swapInt( &a[i], &a[j]);\n      swapChar( &c[i], &c[j]);\n    }\n  }\n  swapInt( &a[i+1], &a[r]);\n  swapChar( &c[i+1], &c[r]);\n  return i+1;\n  \n}\n\n\nquickSort(int*  a, char* c, int p, int r) {\n  \n  int q;\n  \n  if( p < r) {\n    q = partition( a, c, p, r);\n    quickSort( a, c, p, q-1);\n    quickSort( a, c, q+1, r);\n  }\n} \n\n\nvoid merge( int* a, char* c, int left, int mid, int right) {\n  \n  int *l, *r;\n  char *lc, *rc;\n  int n1, n2;\n  \n  int i, j, k;\n  \n  n1 = mid - left;\n  n2 = right - mid;\n  \n  l = (int *)malloc(sizeof(int) *(n1+1));\n  lc = (char *)malloc(sizeof(char) *(n1+1));\n  r = (int *)malloc(sizeof(int) *(n2+1));\n  rc = (char *)malloc(sizeof(char) *(n1+1));\n  \n  for( i=0; i<n1; i++) {\n    l[i] = a[left+i];\n    lc[i] = c[left+i];\n  }\n  for( i=0; i<n2; i++) {\n    r[i] = a[mid+i];\n    rc[i] = c[mid+i];\n  }\n  \n  l[n1] = INFTY;\n  r[n2] = INFTY;\n  \n  i=0;\n  j=0;\n  \n  for( k=left; k<right; k++) {\n    \n    if( l[i] <= r[j]) {\n      a[k] = l[i];\n      c[k] = lc[i];\n      i++;\n    }\n    else {\n      a[k] = r[j];\n      c[k] = rc[j];\n      j++;\n    }\n    \n  }\n  \n  free(l);\n  free(r);\n  free(lc);\n  free(rc);\n  \n}\n\n\nvoid mergeSort( int* a, char* c, int left, int right) {\n  \n  int mid;\n  \n  if( left+1 < right) {\n    mid = ( left + right)/2;\n    mergeSort( a, c, left, mid);\n    mergeSort( a, c, mid, right);\n    merge( a, c, left, mid, right);\n  }\n\n}\n\n\nmain() {\n  \n  int n;\n  int* a, * ma;\n  char* c, * mc;\n  int isStable;\n  \n  int i;\n  \n  scanf(\"%d\", &n);\n  \n  a = (int*)malloc( sizeof( int ) * n );\n  c = (char*)malloc( sizeof( char ) * n );\n  \n  //マージソート用配列\n  ma = (int*) malloc( sizeof( int ) * n );\n  mc = (char*)malloc( sizeof( char ) * n );\n  \n  \n  for( i=0; i<n; i++) {\n    scanf(\" %c %d\", &c[i], &a[i]);\n    mc[i] = c[i];\n    ma[i] = a[i];\n  }\n  \n  quickSort( a, c, 0, n-1);\n  mergeSort( ma, mc, 0, n);\n\n  \n  isStable = true;\n  for( i=0; i<n; i++) {\n    if(c[i] != mc[i]) {\n      isStable = false;\n      break;\n    }\n  }\n  \n  \n  if( isStable == true) {\n    printf(\"Stable\\n\");\n  }else {\n    printf(\"Not stable\\n\");\n  }\n  \n  \n  for( i=0; i<n; i++) {\n    printf(\"%c %d\\n\", c[i], a[i]);\n  }\n  \n  return 0;\n}", "language": "C", "metadata": {"date": 1432867186, "filename_ext": "c", "original_language": "C", "problem_description_relpath": "problem_descriptions/p02277.html", "problem_id": "p02277", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02277/input.txt", "sample_output_relpath": "derived/input_output/data/p02277/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02277/C/s703217087.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s703217087", "user_id": "u782201096"}, "prompt_components": {"gold_output": "Not stable\nD 1\nC 1\nD 2\nH 2\nD 3\nS 3\n", "input_to_evaluate": "#include <stdio.h>\n#include <stdlib.h>\n\n#define false 0\n#define true 1\n\n#define INFTY 2147483647\n\n\nvoid swapInt( int *n1, int *n2) {\n  \n  int tmp;\n  \n  tmp = *n1;\n  *n1 = *n2;\n  *n2 = tmp;\n  \n}\n\nvoid swapChar( char *c1, char *c2) {\n  \n  char tmp;\n  \n  tmp = *c1;\n  *c1 = *c2;\n  *c2 = tmp;\n  \n}\n\n\nint partition( int *a, char *c, int p, int r) {\n  \n  int x;\n  int i, j;\n  \n  x = a[r];\n  i = p-1;\n  \n  for( j=p; j<r; j++) {\n    if( a[j] <= x ) {\n      i++;\n      swapInt( &a[i], &a[j]);\n      swapChar( &c[i], &c[j]);\n    }\n  }\n  swapInt( &a[i+1], &a[r]);\n  swapChar( &c[i+1], &c[r]);\n  return i+1;\n  \n}\n\n\nquickSort(int*  a, char* c, int p, int r) {\n  \n  int q;\n  \n  if( p < r) {\n    q = partition( a, c, p, r);\n    quickSort( a, c, p, q-1);\n    quickSort( a, c, q+1, r);\n  }\n} \n\n\nvoid merge( int* a, char* c, int left, int mid, int right) {\n  \n  int *l, *r;\n  char *lc, *rc;\n  int n1, n2;\n  \n  int i, j, k;\n  \n  n1 = mid - left;\n  n2 = right - mid;\n  \n  l = (int *)malloc(sizeof(int) *(n1+1));\n  lc = (char *)malloc(sizeof(char) *(n1+1));\n  r = (int *)malloc(sizeof(int) *(n2+1));\n  rc = (char *)malloc(sizeof(char) *(n1+1));\n  \n  for( i=0; i<n1; i++) {\n    l[i] = a[left+i];\n    lc[i] = c[left+i];\n  }\n  for( i=0; i<n2; i++) {\n    r[i] = a[mid+i];\n    rc[i] = c[mid+i];\n  }\n  \n  l[n1] = INFTY;\n  r[n2] = INFTY;\n  \n  i=0;\n  j=0;\n  \n  for( k=left; k<right; k++) {\n    \n    if( l[i] <= r[j]) {\n      a[k] = l[i];\n      c[k] = lc[i];\n      i++;\n    }\n    else {\n      a[k] = r[j];\n      c[k] = rc[j];\n      j++;\n    }\n    \n  }\n  \n  free(l);\n  free(r);\n  free(lc);\n  free(rc);\n  \n}\n\n\nvoid mergeSort( int* a, char* c, int left, int right) {\n  \n  int mid;\n  \n  if( left+1 < right) {\n    mid = ( left + right)/2;\n    mergeSort( a, c, left, mid);\n    mergeSort( a, c, mid, right);\n    merge( a, c, left, mid, right);\n  }\n\n}\n\n\nmain() {\n  \n  int n;\n  int* a, * ma;\n  char* c, * mc;\n  int isStable;\n  \n  int i;\n  \n  scanf(\"%d\", &n);\n  \n  a = (int*)malloc( sizeof( int ) * n );\n  c = (char*)malloc( sizeof( char ) * n );\n  \n  //マージソート用配列\n  ma = (int*) malloc( sizeof( int ) * n );\n  mc = (char*)malloc( sizeof( char ) * n );\n  \n  \n  for( i=0; i<n; i++) {\n    scanf(\" %c %d\", &c[i], &a[i]);\n    mc[i] = c[i];\n    ma[i] = a[i];\n  }\n  \n  quickSort( a, c, 0, n-1);\n  mergeSort( ma, mc, 0, n);\n\n  \n  isStable = true;\n  for( i=0; i<n; i++) {\n    if(c[i] != mc[i]) {\n      isStable = false;\n      break;\n    }\n  }\n  \n  \n  if( isStable == true) {\n    printf(\"Stable\\n\");\n  }else {\n    printf(\"Not stable\\n\");\n  }\n  \n  \n  for( i=0; i<n; i++) {\n    printf(\"%c %d\\n\", c[i], a[i]);\n  }\n  \n  return 0;\n}", "problem_context": "Quick Sort\n\nLet's arrange a deck of cards. Your task is to sort totally n cards. A card consists of a part of a suit (S, H, C or D) and an number. Write a program which sorts such cards based on the following pseudocode:\n\nPartition(A, p, r)\n1 x = A[r]\n2 i = p-1\n3 for j = p to r-1\n4 do if A[j] <= x\n5 then i = i+1\n6 exchange A[i] and A[j]\n7 exchange A[i+1] and A[r]\n8 return i+1\n\nQuicksort(A, p, r)\n1 if p < r\n2 then q = Partition(A, p, r)\n3 run Quicksort(A, p, q-1)\n4 run Quicksort(A, q+1, r)\n\nHere, A is an array which represents a deck of cards and comparison operations are performed based on the numbers.\n\nYour program should also 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 lines. Each card is given in a line and represented by a pair of a character and an integer separated by a single space.\n\nOutput\n\nIn the first line, print the stability (\"Stable\" or \"Not stable\") of this output.\n\nIn the following lines, print the arranged cards in the same manner of that of the input.\n\nConstraints\n\n1 ≤ n ≤ 100,000\n\n1 ≤ the number of a card ≤ 109\n\nThere are no identical card in the input\n\nSample Input 1\n\n6\nD 3\nH 2\nD 1\nS 3\nD 2\nC 1\n\nSample Output 1\n\nNot stable\nD 1\nC 1\nD 2\nH 2\nD 3\nS 3\n\nSample Input 2\n\n2\nS 1\nH 1\n\nSample Output 2\n\nStable\nS 1\nH 1", "sample_input": "6\nD 3\nH 2\nD 1\nS 3\nD 2\nC 1\n"}, "reference_outputs": ["Not stable\nD 1\nC 1\nD 2\nH 2\nD 3\nS 3\n"], "source_document_id": "p02277", "source_text": "Quick Sort\n\nLet's arrange a deck of cards. Your task is to sort totally n cards. A card consists of a part of a suit (S, H, C or D) and an number. Write a program which sorts such cards based on the following pseudocode:\n\nPartition(A, p, r)\n1 x = A[r]\n2 i = p-1\n3 for j = p to r-1\n4 do if A[j] <= x\n5 then i = i+1\n6 exchange A[i] and A[j]\n7 exchange A[i+1] and A[r]\n8 return i+1\n\nQuicksort(A, p, r)\n1 if p < r\n2 then q = Partition(A, p, r)\n3 run Quicksort(A, p, q-1)\n4 run Quicksort(A, q+1, r)\n\nHere, A is an array which represents a deck of cards and comparison operations are performed based on the numbers.\n\nYour program should also 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 lines. Each card is given in a line and represented by a pair of a character and an integer separated by a single space.\n\nOutput\n\nIn the first line, print the stability (\"Stable\" or \"Not stable\") of this output.\n\nIn the following lines, print the arranged cards in the same manner of that of the input.\n\nConstraints\n\n1 ≤ n ≤ 100,000\n\n1 ≤ the number of a card ≤ 109\n\nThere are no identical card in the input\n\nSample Input 1\n\n6\nD 3\nH 2\nD 1\nS 3\nD 2\nC 1\n\nSample Output 1\n\nNot stable\nD 1\nC 1\nD 2\nH 2\nD 3\nS 3\n\nSample Input 2\n\n2\nS 1\nH 1\n\nSample Output 2\n\nStable\nS 1\nH 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": 2594, "cpu_time_ms": 50, "memory_kb": 1916}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s076831919", "group_id": "codeNet:p02277", "input_text": "#include <stdio.h>\n#include <stdlib.h>\n \nvoid Quicksort(int, int);\nint Partition(int, int);\n \n  \ntypedef struct{\n  int n;\n  char c;\n  int count;\n}Card;\n  \nCard a[100000];\n  \nint main(void){\n  int n,i,q,f=0;\n  char y;\n  \n  scanf(\"%d%c\",&n,&y);\n  for(i = 1; i < n+1; i++){\n    scanf(\"%c%d%c\",&a[i].c, &a[i].n, &y);\n    a[i].count = i;\n  }\n  \n  Quicksort(1,n);\n  \n  for(i = 0; i < n; i++){\n    if(a[i].n == a[i+1].n && a[i].count > a[i+1].count){\n      f = 1;\n      break;\n    }\n  }\n  \n  if(f == 0){\n    printf(\"Stable\\n\");\n  }else{\n    printf(\"Not stable\\n\");\n  }\n  \n  for(i = 1; i < n+1; i++){\n    printf(\"%c %d\\n\",a[i].c,a[i].n);\n  }\n  return 0;\n}\n  void Quicksort(int p, int r){\n  int q;\n  if(p < r){\n    q = Partition(p,r);\n    Quicksort(p,q-1);\n    Quicksort(q+1,r);\n  }\n}\nint Partition(int p, int r){\n  int i,j;\n  Card x,tmp;\n  \n  x = a[r];\n  i = p - 1;\n  \n  for(j = p; j <= r-1; j++){\n    if(a[j].n <=  x.n){\n      i =  i + 1;\n      tmp = a[i];\n      a[i] = a[j];\n      a[j] = tmp;\n    }\n  }\n  tmp = a[i+1];\n  a[i+1] = a[r];\n  a[r] = tmp;\n  \n  return i+1;\n}", "language": "C", "metadata": {"date": 1501997167, "filename_ext": "c", "original_language": "C", "problem_description_relpath": "problem_descriptions/p02277.html", "problem_id": "p02277", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02277/input.txt", "sample_output_relpath": "derived/input_output/data/p02277/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02277/C/s076831919.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s076831919", "user_id": "u291427249"}, "prompt_components": {"gold_output": "Not stable\nD 1\nC 1\nD 2\nH 2\nD 3\nS 3\n", "input_to_evaluate": "#include <stdio.h>\n#include <stdlib.h>\n \nvoid Quicksort(int, int);\nint Partition(int, int);\n \n  \ntypedef struct{\n  int n;\n  char c;\n  int count;\n}Card;\n  \nCard a[100000];\n  \nint main(void){\n  int n,i,q,f=0;\n  char y;\n  \n  scanf(\"%d%c\",&n,&y);\n  for(i = 1; i < n+1; i++){\n    scanf(\"%c%d%c\",&a[i].c, &a[i].n, &y);\n    a[i].count = i;\n  }\n  \n  Quicksort(1,n);\n  \n  for(i = 0; i < n; i++){\n    if(a[i].n == a[i+1].n && a[i].count > a[i+1].count){\n      f = 1;\n      break;\n    }\n  }\n  \n  if(f == 0){\n    printf(\"Stable\\n\");\n  }else{\n    printf(\"Not stable\\n\");\n  }\n  \n  for(i = 1; i < n+1; i++){\n    printf(\"%c %d\\n\",a[i].c,a[i].n);\n  }\n  return 0;\n}\n  void Quicksort(int p, int r){\n  int q;\n  if(p < r){\n    q = Partition(p,r);\n    Quicksort(p,q-1);\n    Quicksort(q+1,r);\n  }\n}\nint Partition(int p, int r){\n  int i,j;\n  Card x,tmp;\n  \n  x = a[r];\n  i = p - 1;\n  \n  for(j = p; j <= r-1; j++){\n    if(a[j].n <=  x.n){\n      i =  i + 1;\n      tmp = a[i];\n      a[i] = a[j];\n      a[j] = tmp;\n    }\n  }\n  tmp = a[i+1];\n  a[i+1] = a[r];\n  a[r] = tmp;\n  \n  return i+1;\n}", "problem_context": "Quick Sort\n\nLet's arrange a deck of cards. Your task is to sort totally n cards. A card consists of a part of a suit (S, H, C or D) and an number. Write a program which sorts such cards based on the following pseudocode:\n\nPartition(A, p, r)\n1 x = A[r]\n2 i = p-1\n3 for j = p to r-1\n4 do if A[j] <= x\n5 then i = i+1\n6 exchange A[i] and A[j]\n7 exchange A[i+1] and A[r]\n8 return i+1\n\nQuicksort(A, p, r)\n1 if p < r\n2 then q = Partition(A, p, r)\n3 run Quicksort(A, p, q-1)\n4 run Quicksort(A, q+1, r)\n\nHere, A is an array which represents a deck of cards and comparison operations are performed based on the numbers.\n\nYour program should also 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 lines. Each card is given in a line and represented by a pair of a character and an integer separated by a single space.\n\nOutput\n\nIn the first line, print the stability (\"Stable\" or \"Not stable\") of this output.\n\nIn the following lines, print the arranged cards in the same manner of that of the input.\n\nConstraints\n\n1 ≤ n ≤ 100,000\n\n1 ≤ the number of a card ≤ 109\n\nThere are no identical card in the input\n\nSample Input 1\n\n6\nD 3\nH 2\nD 1\nS 3\nD 2\nC 1\n\nSample Output 1\n\nNot stable\nD 1\nC 1\nD 2\nH 2\nD 3\nS 3\n\nSample Input 2\n\n2\nS 1\nH 1\n\nSample Output 2\n\nStable\nS 1\nH 1", "sample_input": "6\nD 3\nH 2\nD 1\nS 3\nD 2\nC 1\n"}, "reference_outputs": ["Not stable\nD 1\nC 1\nD 2\nH 2\nD 3\nS 3\n"], "source_document_id": "p02277", "source_text": "Quick Sort\n\nLet's arrange a deck of cards. Your task is to sort totally n cards. A card consists of a part of a suit (S, H, C or D) and an number. Write a program which sorts such cards based on the following pseudocode:\n\nPartition(A, p, r)\n1 x = A[r]\n2 i = p-1\n3 for j = p to r-1\n4 do if A[j] <= x\n5 then i = i+1\n6 exchange A[i] and A[j]\n7 exchange A[i+1] and A[r]\n8 return i+1\n\nQuicksort(A, p, r)\n1 if p < r\n2 then q = Partition(A, p, r)\n3 run Quicksort(A, p, q-1)\n4 run Quicksort(A, q+1, r)\n\nHere, A is an array which represents a deck of cards and comparison operations are performed based on the numbers.\n\nYour program should also 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 lines. Each card is given in a line and represented by a pair of a character and an integer separated by a single space.\n\nOutput\n\nIn the first line, print the stability (\"Stable\" or \"Not stable\") of this output.\n\nIn the following lines, print the arranged cards in the same manner of that of the input.\n\nConstraints\n\n1 ≤ n ≤ 100,000\n\n1 ≤ the number of a card ≤ 109\n\nThere are no identical card in the input\n\nSample Input 1\n\n6\nD 3\nH 2\nD 1\nS 3\nD 2\nC 1\n\nSample Output 1\n\nNot stable\nD 1\nC 1\nD 2\nH 2\nD 3\nS 3\n\nSample Input 2\n\n2\nS 1\nH 1\n\nSample Output 2\n\nStable\nS 1\nH 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": 1062, "cpu_time_ms": 40, "memory_kb": 1780}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s445189481", "group_id": "codeNet:p02277", "input_text": "#include<stdio.h>\n#define N 100000\n#define M 2000000000\n#define O 0\n#define I 1\n#define W 2\n#define Z 10\n\nstruct Card{\n  char s;\n  int v;\n};\n\nstruct Card L[N],R[N];\n\nvoid merge(struct Card A[],int n,int left,int mid,int right){\n  int i,j,k;\n  int n1=mid-left;\n  int n2=right-mid;\n  for(i=O;i<n1;i++){\n    L[i]=A[left+i];\n  }\n  for(i=O;i<n2;i++){\n    R[i]=A[mid+i];\n  }\n  L[n1].v=R[n2].v=M;\n  i=j=O;\n  for(k=left;k<right;k++){\n    if(L[i].v<=R[j].v){\n      A[k]=L[i++];\n    }\n    else{\n      A[k]=R[j++];\n    }\n  }\n}\n\nvoid m_sort(struct Card A[],int n,int left,int right){\n  int mid;\n  if(left+I<right){\n    mid=(left+right)/W;\n    m_sort(A,n,left,mid);\n    m_sort(A,n,mid,right);\n    merge(A,n,left,mid,right);\n  }\n}\n\nint partition(struct Card A[],int n,int p,int r){\n  int i,j;\n  struct Card t,x;\n  x=A[r];\n  i=p-I;\n  for(j=p;j<r;j++){\n    if(A[j].v<=x.v){\n      i++;\n      t=A[i];\n      A[i]=A[j];\n      A[j]=t;\n    }\n  }\n  t=A[i+I];\n  A[i+I]=A[r];\n  A[r]=t;\n  return i+I;\n}\n\nvoid quickSort(struct Card A[],int n,int p,int r){\n  int q;\n  if(p<r){\n    q=partition(A,n,p,r);\n    quickSort(A,n,p,q-I);\n    quickSort(A,n,q+I,r);\n  }\n}\n\nint main(){\n  int i,n,v;\n  struct Card A[N],B[N];\n  char S[Z];\n  int stable=I;\n\n  scanf(\"%d\",&n);\n  for(i=O;i<n;i++){\n    scanf(\"%s %d\",S,&v);\n    A[i].s=B[i].s=S[O];\n    A[i].v=B[i].v=v;\n  }\n  m_sort(A,n,O,n);\n  quickSort(B,n,O,n-I);\n  for(i=O;i<n;i++){\n    if(A[i].s!=B[i].s){\n      stable=O;\n    }\n  }\n\n  if(stable==I){\n    printf(\"Stable\\n\");\n  }\n  else{\n    printf(\"Not stable\\n\");\n  }\n  for(i=O;i<n;i++){\n    printf(\"%c %d\\n\",B[i].s,B[i].v);\n  }\n  return O;\n}\n\n", "language": "C", "metadata": {"date": 1533755103, "filename_ext": "c", "original_language": "C", "problem_description_relpath": "problem_descriptions/p02277.html", "problem_id": "p02277", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02277/input.txt", "sample_output_relpath": "derived/input_output/data/p02277/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02277/C/s445189481.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s445189481", "user_id": "u733647639"}, "prompt_components": {"gold_output": "Not stable\nD 1\nC 1\nD 2\nH 2\nD 3\nS 3\n", "input_to_evaluate": "#include<stdio.h>\n#define N 100000\n#define M 2000000000\n#define O 0\n#define I 1\n#define W 2\n#define Z 10\n\nstruct Card{\n  char s;\n  int v;\n};\n\nstruct Card L[N],R[N];\n\nvoid merge(struct Card A[],int n,int left,int mid,int right){\n  int i,j,k;\n  int n1=mid-left;\n  int n2=right-mid;\n  for(i=O;i<n1;i++){\n    L[i]=A[left+i];\n  }\n  for(i=O;i<n2;i++){\n    R[i]=A[mid+i];\n  }\n  L[n1].v=R[n2].v=M;\n  i=j=O;\n  for(k=left;k<right;k++){\n    if(L[i].v<=R[j].v){\n      A[k]=L[i++];\n    }\n    else{\n      A[k]=R[j++];\n    }\n  }\n}\n\nvoid m_sort(struct Card A[],int n,int left,int right){\n  int mid;\n  if(left+I<right){\n    mid=(left+right)/W;\n    m_sort(A,n,left,mid);\n    m_sort(A,n,mid,right);\n    merge(A,n,left,mid,right);\n  }\n}\n\nint partition(struct Card A[],int n,int p,int r){\n  int i,j;\n  struct Card t,x;\n  x=A[r];\n  i=p-I;\n  for(j=p;j<r;j++){\n    if(A[j].v<=x.v){\n      i++;\n      t=A[i];\n      A[i]=A[j];\n      A[j]=t;\n    }\n  }\n  t=A[i+I];\n  A[i+I]=A[r];\n  A[r]=t;\n  return i+I;\n}\n\nvoid quickSort(struct Card A[],int n,int p,int r){\n  int q;\n  if(p<r){\n    q=partition(A,n,p,r);\n    quickSort(A,n,p,q-I);\n    quickSort(A,n,q+I,r);\n  }\n}\n\nint main(){\n  int i,n,v;\n  struct Card A[N],B[N];\n  char S[Z];\n  int stable=I;\n\n  scanf(\"%d\",&n);\n  for(i=O;i<n;i++){\n    scanf(\"%s %d\",S,&v);\n    A[i].s=B[i].s=S[O];\n    A[i].v=B[i].v=v;\n  }\n  m_sort(A,n,O,n);\n  quickSort(B,n,O,n-I);\n  for(i=O;i<n;i++){\n    if(A[i].s!=B[i].s){\n      stable=O;\n    }\n  }\n\n  if(stable==I){\n    printf(\"Stable\\n\");\n  }\n  else{\n    printf(\"Not stable\\n\");\n  }\n  for(i=O;i<n;i++){\n    printf(\"%c %d\\n\",B[i].s,B[i].v);\n  }\n  return O;\n}\n\n", "problem_context": "Quick Sort\n\nLet's arrange a deck of cards. Your task is to sort totally n cards. A card consists of a part of a suit (S, H, C or D) and an number. Write a program which sorts such cards based on the following pseudocode:\n\nPartition(A, p, r)\n1 x = A[r]\n2 i = p-1\n3 for j = p to r-1\n4 do if A[j] <= x\n5 then i = i+1\n6 exchange A[i] and A[j]\n7 exchange A[i+1] and A[r]\n8 return i+1\n\nQuicksort(A, p, r)\n1 if p < r\n2 then q = Partition(A, p, r)\n3 run Quicksort(A, p, q-1)\n4 run Quicksort(A, q+1, r)\n\nHere, A is an array which represents a deck of cards and comparison operations are performed based on the numbers.\n\nYour program should also 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 lines. Each card is given in a line and represented by a pair of a character and an integer separated by a single space.\n\nOutput\n\nIn the first line, print the stability (\"Stable\" or \"Not stable\") of this output.\n\nIn the following lines, print the arranged cards in the same manner of that of the input.\n\nConstraints\n\n1 ≤ n ≤ 100,000\n\n1 ≤ the number of a card ≤ 109\n\nThere are no identical card in the input\n\nSample Input 1\n\n6\nD 3\nH 2\nD 1\nS 3\nD 2\nC 1\n\nSample Output 1\n\nNot stable\nD 1\nC 1\nD 2\nH 2\nD 3\nS 3\n\nSample Input 2\n\n2\nS 1\nH 1\n\nSample Output 2\n\nStable\nS 1\nH 1", "sample_input": "6\nD 3\nH 2\nD 1\nS 3\nD 2\nC 1\n"}, "reference_outputs": ["Not stable\nD 1\nC 1\nD 2\nH 2\nD 3\nS 3\n"], "source_document_id": "p02277", "source_text": "Quick Sort\n\nLet's arrange a deck of cards. Your task is to sort totally n cards. A card consists of a part of a suit (S, H, C or D) and an number. Write a program which sorts such cards based on the following pseudocode:\n\nPartition(A, p, r)\n1 x = A[r]\n2 i = p-1\n3 for j = p to r-1\n4 do if A[j] <= x\n5 then i = i+1\n6 exchange A[i] and A[j]\n7 exchange A[i+1] and A[r]\n8 return i+1\n\nQuicksort(A, p, r)\n1 if p < r\n2 then q = Partition(A, p, r)\n3 run Quicksort(A, p, q-1)\n4 run Quicksort(A, q+1, r)\n\nHere, A is an array which represents a deck of cards and comparison operations are performed based on the numbers.\n\nYour program should also 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 lines. Each card is given in a line and represented by a pair of a character and an integer separated by a single space.\n\nOutput\n\nIn the first line, print the stability (\"Stable\" or \"Not stable\") of this output.\n\nIn the following lines, print the arranged cards in the same manner of that of the input.\n\nConstraints\n\n1 ≤ n ≤ 100,000\n\n1 ≤ the number of a card ≤ 109\n\nThere are no identical card in the input\n\nSample Input 1\n\n6\nD 3\nH 2\nD 1\nS 3\nD 2\nC 1\n\nSample Output 1\n\nNot stable\nD 1\nC 1\nD 2\nH 2\nD 3\nS 3\n\nSample Input 2\n\n2\nS 1\nH 1\n\nSample Output 2\n\nStable\nS 1\nH 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": 1601, "cpu_time_ms": 20, "memory_kb": 4080}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s238408536", "group_id": "codeNet:p02277", "input_text": "#include<stdio.h>\n#define MAX 100000\n#define SENTINEL 2000000000\n\nstruct Card{\n  char suit;\n  int value;\n};\n\nstruct Card L[MAX/2+2], R[MAX/2+2];\n\nvoid merge(struct Card A[], int n, int left, int mid, int right){\n  int i, j, k;\n  int n1 = mid - left;\n  int n2 = right - mid;\n  for ( i = 0; i < n1; i++ ) L[i] = A[left + i];\n  for ( i = 0; i < n2; i++ ) R[i] = A[mid + i];\n  L[n1].value = R[n2].value = SENTINEL;\n  i = j = 0;\n  for ( k = left; k < right; k++ ){\n    if ( L[i].value <= R[j].value ){\n      A[k] = L[i++];\n    } else {\n      A[k] = R[j++];\n    }\n  }\n}\n \nvoid mergeSort(struct Card A[], int n, int left, int right ){\n  int mid;\n  if ( left+1 < right ){\n    mid = (left + right)/2;\n    mergeSort(A, n, left, mid);\n    mergeSort(A, n, mid, right);\n    merge(A, n, left, mid, right);\n  }\n}\n\nint partition(struct Card A[], int n, int p, int r){\n  int i, j;\n  struct Card t, x;\n  x = A[r];\n  i = p - 1;\n  for ( j = p; j < r; j++ ){\n    if ( A[j].value <= x.value ){\n      i++;\n      t = A[i]; A[i] = A[j]; A[j] = t;\n    }\n  }\n  t = A[i+1]; A[i+1] = A[r]; A[r] = t;\n  return i+1;\n}\n\nvoid quickSort(struct Card A[], int n, int p, int r){\n  int q;\n  if ( p < r ){\n    q = partition(A, n, p, r);\n    quickSort(A, n, p, q - 1);\n    quickSort(A, n, q + 1, r);\n  }\n}\n\nmain(){\n  int n, i, v;\n  struct Card A[MAX], B[MAX];\n  char S[10];\n  int stable = 1;\n  scanf(\"%d\", &n);\n\n  for ( i = 0; i < n; i++ ) {\n    scanf(\"%s %d\", S, &v);\n    A[i].suit = B[i].suit = S[0];\n    A[i].value = B[i].value = v;\n  }\n\n  mergeSort(A, n, 0, n);\n  quickSort(B, n, 0, n-1);\n\n  for ( i = 0; i < n; i++ ){\n    if ( A[i].suit != B[i].suit ) stable = 0;\n  }\n\n  if ( stable == 1 ) printf(\"Stable\\n\");\n  else printf(\"Not stable\\n\");\n  for ( i = 0; i < n; i++ ) {\n    printf(\"%c %d\\n\", B[i].suit, B[i].value);\n  }\n}\n", "language": "C", "metadata": {"date": 1533446798, "filename_ext": "c", "original_language": "C", "problem_description_relpath": "problem_descriptions/p02277.html", "problem_id": "p02277", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02277/input.txt", "sample_output_relpath": "derived/input_output/data/p02277/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02277/C/s238408536.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s238408536", "user_id": "u842782968"}, "prompt_components": {"gold_output": "Not stable\nD 1\nC 1\nD 2\nH 2\nD 3\nS 3\n", "input_to_evaluate": "#include<stdio.h>\n#define MAX 100000\n#define SENTINEL 2000000000\n\nstruct Card{\n  char suit;\n  int value;\n};\n\nstruct Card L[MAX/2+2], R[MAX/2+2];\n\nvoid merge(struct Card A[], int n, int left, int mid, int right){\n  int i, j, k;\n  int n1 = mid - left;\n  int n2 = right - mid;\n  for ( i = 0; i < n1; i++ ) L[i] = A[left + i];\n  for ( i = 0; i < n2; i++ ) R[i] = A[mid + i];\n  L[n1].value = R[n2].value = SENTINEL;\n  i = j = 0;\n  for ( k = left; k < right; k++ ){\n    if ( L[i].value <= R[j].value ){\n      A[k] = L[i++];\n    } else {\n      A[k] = R[j++];\n    }\n  }\n}\n \nvoid mergeSort(struct Card A[], int n, int left, int right ){\n  int mid;\n  if ( left+1 < right ){\n    mid = (left + right)/2;\n    mergeSort(A, n, left, mid);\n    mergeSort(A, n, mid, right);\n    merge(A, n, left, mid, right);\n  }\n}\n\nint partition(struct Card A[], int n, int p, int r){\n  int i, j;\n  struct Card t, x;\n  x = A[r];\n  i = p - 1;\n  for ( j = p; j < r; j++ ){\n    if ( A[j].value <= x.value ){\n      i++;\n      t = A[i]; A[i] = A[j]; A[j] = t;\n    }\n  }\n  t = A[i+1]; A[i+1] = A[r]; A[r] = t;\n  return i+1;\n}\n\nvoid quickSort(struct Card A[], int n, int p, int r){\n  int q;\n  if ( p < r ){\n    q = partition(A, n, p, r);\n    quickSort(A, n, p, q - 1);\n    quickSort(A, n, q + 1, r);\n  }\n}\n\nmain(){\n  int n, i, v;\n  struct Card A[MAX], B[MAX];\n  char S[10];\n  int stable = 1;\n  scanf(\"%d\", &n);\n\n  for ( i = 0; i < n; i++ ) {\n    scanf(\"%s %d\", S, &v);\n    A[i].suit = B[i].suit = S[0];\n    A[i].value = B[i].value = v;\n  }\n\n  mergeSort(A, n, 0, n);\n  quickSort(B, n, 0, n-1);\n\n  for ( i = 0; i < n; i++ ){\n    if ( A[i].suit != B[i].suit ) stable = 0;\n  }\n\n  if ( stable == 1 ) printf(\"Stable\\n\");\n  else printf(\"Not stable\\n\");\n  for ( i = 0; i < n; i++ ) {\n    printf(\"%c %d\\n\", B[i].suit, B[i].value);\n  }\n}\n", "problem_context": "Quick Sort\n\nLet's arrange a deck of cards. Your task is to sort totally n cards. A card consists of a part of a suit (S, H, C or D) and an number. Write a program which sorts such cards based on the following pseudocode:\n\nPartition(A, p, r)\n1 x = A[r]\n2 i = p-1\n3 for j = p to r-1\n4 do if A[j] <= x\n5 then i = i+1\n6 exchange A[i] and A[j]\n7 exchange A[i+1] and A[r]\n8 return i+1\n\nQuicksort(A, p, r)\n1 if p < r\n2 then q = Partition(A, p, r)\n3 run Quicksort(A, p, q-1)\n4 run Quicksort(A, q+1, r)\n\nHere, A is an array which represents a deck of cards and comparison operations are performed based on the numbers.\n\nYour program should also 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 lines. Each card is given in a line and represented by a pair of a character and an integer separated by a single space.\n\nOutput\n\nIn the first line, print the stability (\"Stable\" or \"Not stable\") of this output.\n\nIn the following lines, print the arranged cards in the same manner of that of the input.\n\nConstraints\n\n1 ≤ n ≤ 100,000\n\n1 ≤ the number of a card ≤ 109\n\nThere are no identical card in the input\n\nSample Input 1\n\n6\nD 3\nH 2\nD 1\nS 3\nD 2\nC 1\n\nSample Output 1\n\nNot stable\nD 1\nC 1\nD 2\nH 2\nD 3\nS 3\n\nSample Input 2\n\n2\nS 1\nH 1\n\nSample Output 2\n\nStable\nS 1\nH 1", "sample_input": "6\nD 3\nH 2\nD 1\nS 3\nD 2\nC 1\n"}, "reference_outputs": ["Not stable\nD 1\nC 1\nD 2\nH 2\nD 3\nS 3\n"], "source_document_id": "p02277", "source_text": "Quick Sort\n\nLet's arrange a deck of cards. Your task is to sort totally n cards. A card consists of a part of a suit (S, H, C or D) and an number. Write a program which sorts such cards based on the following pseudocode:\n\nPartition(A, p, r)\n1 x = A[r]\n2 i = p-1\n3 for j = p to r-1\n4 do if A[j] <= x\n5 then i = i+1\n6 exchange A[i] and A[j]\n7 exchange A[i+1] and A[r]\n8 return i+1\n\nQuicksort(A, p, r)\n1 if p < r\n2 then q = Partition(A, p, r)\n3 run Quicksort(A, p, q-1)\n4 run Quicksort(A, q+1, r)\n\nHere, A is an array which represents a deck of cards and comparison operations are performed based on the numbers.\n\nYour program should also 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 lines. Each card is given in a line and represented by a pair of a character and an integer separated by a single space.\n\nOutput\n\nIn the first line, print the stability (\"Stable\" or \"Not stable\") of this output.\n\nIn the following lines, print the arranged cards in the same manner of that of the input.\n\nConstraints\n\n1 ≤ n ≤ 100,000\n\n1 ≤ the number of a card ≤ 109\n\nThere are no identical card in the input\n\nSample Input 1\n\n6\nD 3\nH 2\nD 1\nS 3\nD 2\nC 1\n\nSample Output 1\n\nNot stable\nD 1\nC 1\nD 2\nH 2\nD 3\nS 3\n\nSample Input 2\n\n2\nS 1\nH 1\n\nSample Output 2\n\nStable\nS 1\nH 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": 1788, "cpu_time_ms": 20, "memory_kb": 4060}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s364572430", "group_id": "codeNet:p02279", "input_text": "#include<stdio.h>\nstruct Node{\n  int a,b,c;\n};\nstruct Node N[10000];\nint depth(int);\nint sibling(int);\nint n;\nint D[10000],S[10000];\nint main(){\n  int i,j,k,l,m,q,r,s;\n  scanf(\"%d\",&n);\n  for(i=0;i<n;i++){\n    N[i].a=-1;\n  }\n  for(i=0;i<n;i++){\n    scanf(\"%d %d %d\",&q,&r,&s);\n    N[q].b=r;\n    N[q].c=s;\n    if(r!=-1){\n      N[r].a=q;\n    }\n    if(s!=-1){\n      N[s].a=q;\n    }\n  }\n  for(i=0;i<n;i++){\n    D[i]=depth(i);\n    S[i]=0;\n  }\n  for(i=0;i<n;i++){\n    if(N[i].b==-1 && N[i].c==-1){\n      S[i]=0;\n      k=N[i].a;\n      l=1;\n      while(1){\n        if(k==-1){\n          break;\n        }\n        if(S[k]<l){\n          S[k]=l;\n        }\n        l++;\n        k=N[k].a;\n      }\n    }\n  }\n  for(i=0;i<n;i++){\n    j=0;\n    printf(\"node %d: \",i);\n    printf(\"parent = %d, \",N[i].a);\n    printf(\"sibling = %d, \",sibling(i));\n    if(N[i].b!=-1 || N[i].c!=-1){\n      j++;\n    }\n    printf(\"degree = %d, \",j);\n    printf(\"depth = %d, \",D[i]);\n    printf(\"height = %d, \",S[i]);\n    if(N[i].a==-1){\n      printf(\"root\\n\");\n    }\n    else if(N[i].b==-1 && N[i].c==-1){\n      printf(\"leaf\\n\");\n    }\n    else{\n      printf(\"internal node\\n\");\n    }\n    }\n    return 0;\n}\n\nint depth(int r){\n  int c=0;\n  while(1){\n    r=N[r].a;\n    if(r==-1){\n      break;\n    }\n    c++;\n  }\n  return c;\n}\n\nint sibling(int s){\n  if(N[s].a==-1){\n    return -1;\n  }\n  if(N[N[s].a].b!=s && N[N[s].a].b!=-1){\n    return N[N[s].a].b;\n  }\n  if(N[N[s].a].c!=s && N[N[s].a].c!=-1){\n    return N[N[s].a].c;\n  }\n  return -1;\n}\n\n", "language": "C", "metadata": {"date": 1531185622, "filename_ext": "c", "original_language": "C", "problem_description_relpath": "problem_descriptions/p02279.html", "problem_id": "p02279", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02279/input.txt", "sample_output_relpath": "derived/input_output/data/p02279/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02279/C/s364572430.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s364572430", "user_id": "u888751817"}, "prompt_components": {"gold_output": "node 0: parent = -1, depth = 0, root, [1, 4, 10]\nnode 1: parent = 0, depth = 1, internal node, [2, 3]\nnode 2: parent = 1, depth = 2, leaf, []\nnode 3: parent = 1, depth = 2, leaf, []\nnode 4: parent = 0, depth = 1, internal node, [5, 6, 7]\nnode 5: parent = 4, depth = 2, leaf, []\nnode 6: parent = 4, depth = 2, leaf, []\nnode 7: parent = 4, depth = 2, internal node, [8, 9]\nnode 8: parent = 7, depth = 3, leaf, []\nnode 9: parent = 7, depth = 3, leaf, []\nnode 10: parent = 0, depth = 1, internal node, [11, 12]\nnode 11: parent = 10, depth = 2, leaf, []\nnode 12: parent = 10, depth = 2, leaf, []\n", "input_to_evaluate": "#include<stdio.h>\nstruct Node{\n  int a,b,c;\n};\nstruct Node N[10000];\nint depth(int);\nint sibling(int);\nint n;\nint D[10000],S[10000];\nint main(){\n  int i,j,k,l,m,q,r,s;\n  scanf(\"%d\",&n);\n  for(i=0;i<n;i++){\n    N[i].a=-1;\n  }\n  for(i=0;i<n;i++){\n    scanf(\"%d %d %d\",&q,&r,&s);\n    N[q].b=r;\n    N[q].c=s;\n    if(r!=-1){\n      N[r].a=q;\n    }\n    if(s!=-1){\n      N[s].a=q;\n    }\n  }\n  for(i=0;i<n;i++){\n    D[i]=depth(i);\n    S[i]=0;\n  }\n  for(i=0;i<n;i++){\n    if(N[i].b==-1 && N[i].c==-1){\n      S[i]=0;\n      k=N[i].a;\n      l=1;\n      while(1){\n        if(k==-1){\n          break;\n        }\n        if(S[k]<l){\n          S[k]=l;\n        }\n        l++;\n        k=N[k].a;\n      }\n    }\n  }\n  for(i=0;i<n;i++){\n    j=0;\n    printf(\"node %d: \",i);\n    printf(\"parent = %d, \",N[i].a);\n    printf(\"sibling = %d, \",sibling(i));\n    if(N[i].b!=-1 || N[i].c!=-1){\n      j++;\n    }\n    printf(\"degree = %d, \",j);\n    printf(\"depth = %d, \",D[i]);\n    printf(\"height = %d, \",S[i]);\n    if(N[i].a==-1){\n      printf(\"root\\n\");\n    }\n    else if(N[i].b==-1 && N[i].c==-1){\n      printf(\"leaf\\n\");\n    }\n    else{\n      printf(\"internal node\\n\");\n    }\n    }\n    return 0;\n}\n\nint depth(int r){\n  int c=0;\n  while(1){\n    r=N[r].a;\n    if(r==-1){\n      break;\n    }\n    c++;\n  }\n  return c;\n}\n\nint sibling(int s){\n  if(N[s].a==-1){\n    return -1;\n  }\n  if(N[N[s].a].b!=s && N[N[s].a].b!=-1){\n    return N[N[s].a].b;\n  }\n  if(N[N[s].a].c!=s && N[N[s].a].c!=-1){\n    return N[N[s].a].c;\n  }\n  return -1;\n}\n\n", "problem_context": "Rooted Trees\n\nA graph G = (V, E) is a data structure where V is a finite set of vertices and E is a binary relation on V represented by a set of edges. Fig. 1 illustrates an example of a graph (or graphs).\n\nFig. 1\n\nA free tree is a connnected, acyclic, undirected graph. A rooted tree is a free tree in which one of the vertices is distinguished from the others. A vertex of a rooted tree is called \"node.\"\n\nYour task is to write a program which reports the following information for each node u of a given rooted tree T:\n\nnode ID of u\n\nparent of u\n\ndepth of u\n\nnode type (root, internal node or leaf)\n\na list of chidlren of u\n\nIf the last edge on the path from the root r of a tree T to a node x is (p, x), then p is the parent of x, and x is a child of p. The root is the only node in T with no parent.\n\nA node with no children is an external node or leaf. A nonleaf node is an internal node\n\nThe number of children of a node x in a rooted tree T is called the degree of x.\n\nThe length of the path from the root r to a node x is the depth of x in T.\n\nHere, the given tree consists of n nodes and evey node has a unique ID from 0 to n-1.\n\nFig. 2 shows an example of rooted trees where ID of each node is indicated by a number in a circle (node). The example corresponds to the first sample input.\n\nFig. 2\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 lines, the information of each node u is given in the following format:\n\nid k c1 c2 ... ck\n\nwhere id is the node ID of u, k is the degree of u, c1 ... ck are node IDs of 1st, ... kth child of u. If the node does not have a child, the k is 0.\n\nOutput\n\nPrint the information of each node in the following format ordered by IDs:\n\nnode id: parent = p, depth = d, type, [c1...ck]\n\np is ID of its parent. If the node does not have a parent, print -1.\n\nd is depth of the node.\n\ntype is a type of nodes represented by a string (root, internal node or leaf). If the root can be considered as a leaf or an internal node, print root.\n\nc1...ck is the list of children as a ordered tree.\n\nPlease follow the format presented in a sample output below.\n\nConstraints\n\n1 ≤ n ≤ 100000\n\nSample Input 1\n\n13\n0 3 1 4 10\n1 2 2 3\n2 0\n3 0\n4 3 5 6 7\n5 0\n6 0\n7 2 8 9\n8 0\n9 0\n10 2 11 12\n11 0\n12 0\n\nSample Output 1\n\nnode 0: parent = -1, depth = 0, root, [1, 4, 10]\nnode 1: parent = 0, depth = 1, internal node, [2, 3]\nnode 2: parent = 1, depth = 2, leaf, []\nnode 3: parent = 1, depth = 2, leaf, []\nnode 4: parent = 0, depth = 1, internal node, [5, 6, 7]\nnode 5: parent = 4, depth = 2, leaf, []\nnode 6: parent = 4, depth = 2, leaf, []\nnode 7: parent = 4, depth = 2, internal node, [8, 9]\nnode 8: parent = 7, depth = 3, leaf, []\nnode 9: parent = 7, depth = 3, leaf, []\nnode 10: parent = 0, depth = 1, internal node, [11, 12]\nnode 11: parent = 10, depth = 2, leaf, []\nnode 12: parent = 10, depth = 2, leaf, []\n\nSample Input 2\n\n4\n1 3 3 2 0\n0 0\n3 0\n2 0\n\nSample Output 2\n\nnode 0: parent = 1, depth = 1, leaf, []\nnode 1: parent = -1, depth = 0, root, [3, 2, 0]\nnode 2: parent = 1, depth = 1, leaf, []\nnode 3: parent = 1, depth = 1, leaf, []\n\nNote\n\nYou can use a left-child, right-sibling representation to implement a tree which has the following data:\n\nthe parent of u\n\nthe leftmost child of u\n\nthe immediate right sibling of u\n\nReference\n\nIntroduction to Algorithms, Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein. The MIT Press.", "sample_input": "13\n0 3 1 4 10\n1 2 2 3\n2 0\n3 0\n4 3 5 6 7\n5 0\n6 0\n7 2 8 9\n8 0\n9 0\n10 2 11 12\n11 0\n12 0\n"}, "reference_outputs": ["node 0: parent = -1, depth = 0, root, [1, 4, 10]\nnode 1: parent = 0, depth = 1, internal node, [2, 3]\nnode 2: parent = 1, depth = 2, leaf, []\nnode 3: parent = 1, depth = 2, leaf, []\nnode 4: parent = 0, depth = 1, internal node, [5, 6, 7]\nnode 5: parent = 4, depth = 2, leaf, []\nnode 6: parent = 4, depth = 2, leaf, []\nnode 7: parent = 4, depth = 2, internal node, [8, 9]\nnode 8: parent = 7, depth = 3, leaf, []\nnode 9: parent = 7, depth = 3, leaf, []\nnode 10: parent = 0, depth = 1, internal node, [11, 12]\nnode 11: parent = 10, depth = 2, leaf, []\nnode 12: parent = 10, depth = 2, leaf, []\n"], "source_document_id": "p02279", "source_text": "Rooted Trees\n\nA graph G = (V, E) is a data structure where V is a finite set of vertices and E is a binary relation on V represented by a set of edges. Fig. 1 illustrates an example of a graph (or graphs).\n\nFig. 1\n\nA free tree is a connnected, acyclic, undirected graph. A rooted tree is a free tree in which one of the vertices is distinguished from the others. A vertex of a rooted tree is called \"node.\"\n\nYour task is to write a program which reports the following information for each node u of a given rooted tree T:\n\nnode ID of u\n\nparent of u\n\ndepth of u\n\nnode type (root, internal node or leaf)\n\na list of chidlren of u\n\nIf the last edge on the path from the root r of a tree T to a node x is (p, x), then p is the parent of x, and x is a child of p. The root is the only node in T with no parent.\n\nA node with no children is an external node or leaf. A nonleaf node is an internal node\n\nThe number of children of a node x in a rooted tree T is called the degree of x.\n\nThe length of the path from the root r to a node x is the depth of x in T.\n\nHere, the given tree consists of n nodes and evey node has a unique ID from 0 to n-1.\n\nFig. 2 shows an example of rooted trees where ID of each node is indicated by a number in a circle (node). The example corresponds to the first sample input.\n\nFig. 2\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 lines, the information of each node u is given in the following format:\n\nid k c1 c2 ... ck\n\nwhere id is the node ID of u, k is the degree of u, c1 ... ck are node IDs of 1st, ... kth child of u. If the node does not have a child, the k is 0.\n\nOutput\n\nPrint the information of each node in the following format ordered by IDs:\n\nnode id: parent = p, depth = d, type, [c1...ck]\n\np is ID of its parent. If the node does not have a parent, print -1.\n\nd is depth of the node.\n\ntype is a type of nodes represented by a string (root, internal node or leaf). If the root can be considered as a leaf or an internal node, print root.\n\nc1...ck is the list of children as a ordered tree.\n\nPlease follow the format presented in a sample output below.\n\nConstraints\n\n1 ≤ n ≤ 100000\n\nSample Input 1\n\n13\n0 3 1 4 10\n1 2 2 3\n2 0\n3 0\n4 3 5 6 7\n5 0\n6 0\n7 2 8 9\n8 0\n9 0\n10 2 11 12\n11 0\n12 0\n\nSample Output 1\n\nnode 0: parent = -1, depth = 0, root, [1, 4, 10]\nnode 1: parent = 0, depth = 1, internal node, [2, 3]\nnode 2: parent = 1, depth = 2, leaf, []\nnode 3: parent = 1, depth = 2, leaf, []\nnode 4: parent = 0, depth = 1, internal node, [5, 6, 7]\nnode 5: parent = 4, depth = 2, leaf, []\nnode 6: parent = 4, depth = 2, leaf, []\nnode 7: parent = 4, depth = 2, internal node, [8, 9]\nnode 8: parent = 7, depth = 3, leaf, []\nnode 9: parent = 7, depth = 3, leaf, []\nnode 10: parent = 0, depth = 1, internal node, [11, 12]\nnode 11: parent = 10, depth = 2, leaf, []\nnode 12: parent = 10, depth = 2, leaf, []\n\nSample Input 2\n\n4\n1 3 3 2 0\n0 0\n3 0\n2 0\n\nSample Output 2\n\nnode 0: parent = 1, depth = 1, leaf, []\nnode 1: parent = -1, depth = 0, root, [3, 2, 0]\nnode 2: parent = 1, depth = 1, leaf, []\nnode 3: parent = 1, depth = 1, leaf, []\n\nNote\n\nYou can use a left-child, right-sibling representation to implement a tree which has the following data:\n\nthe parent of u\n\nthe leftmost child of u\n\nthe immediate right sibling of u\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": 1493, "cpu_time_ms": 3990, "memory_kb": 2104}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s323835167", "group_id": "codeNet:p02279", "input_text": "#include <stdio.h>\n#define MAX 1000\nint main(){\n\n\n  int n,id,k,m,i,j,dat[MAX][MAX];\n\n  //入力 \n  \n  scanf(\"%d\",&n); \n  for (i = 0; i < n; i++){\n    scanf(\"%d\",&i); \n    scanf(\"%d\",&m);\n    for (j = 0;j < m; j++){\n      scanf(\"%d\",&dat[i][j]);\n    }\n  }\n\n\n  //出力\n  for ( i  = 0 ; i < n; i++){\n  \n    printf(\"node %d: \",i);\n  \n    for (j = 0; ;j++){\n      if(i == dat[i-j][j+1] && i > 0){\n\tprintf(\"parent = %d\", i-j);\n      }\n    }\n\n  }\n\n\n\n\n\n  return 0;\n}", "language": "C", "metadata": {"date": 1465446855, "filename_ext": "c", "original_language": "C", "problem_description_relpath": "problem_descriptions/p02279.html", "problem_id": "p02279", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02279/input.txt", "sample_output_relpath": "derived/input_output/data/p02279/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02279/C/s323835167.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s323835167", "user_id": "u760666840"}, "prompt_components": {"gold_output": "node 0: parent = -1, depth = 0, root, [1, 4, 10]\nnode 1: parent = 0, depth = 1, internal node, [2, 3]\nnode 2: parent = 1, depth = 2, leaf, []\nnode 3: parent = 1, depth = 2, leaf, []\nnode 4: parent = 0, depth = 1, internal node, [5, 6, 7]\nnode 5: parent = 4, depth = 2, leaf, []\nnode 6: parent = 4, depth = 2, leaf, []\nnode 7: parent = 4, depth = 2, internal node, [8, 9]\nnode 8: parent = 7, depth = 3, leaf, []\nnode 9: parent = 7, depth = 3, leaf, []\nnode 10: parent = 0, depth = 1, internal node, [11, 12]\nnode 11: parent = 10, depth = 2, leaf, []\nnode 12: parent = 10, depth = 2, leaf, []\n", "input_to_evaluate": "#include <stdio.h>\n#define MAX 1000\nint main(){\n\n\n  int n,id,k,m,i,j,dat[MAX][MAX];\n\n  //入力 \n  \n  scanf(\"%d\",&n); \n  for (i = 0; i < n; i++){\n    scanf(\"%d\",&i); \n    scanf(\"%d\",&m);\n    for (j = 0;j < m; j++){\n      scanf(\"%d\",&dat[i][j]);\n    }\n  }\n\n\n  //出力\n  for ( i  = 0 ; i < n; i++){\n  \n    printf(\"node %d: \",i);\n  \n    for (j = 0; ;j++){\n      if(i == dat[i-j][j+1] && i > 0){\n\tprintf(\"parent = %d\", i-j);\n      }\n    }\n\n  }\n\n\n\n\n\n  return 0;\n}", "problem_context": "Rooted Trees\n\nA graph G = (V, E) is a data structure where V is a finite set of vertices and E is a binary relation on V represented by a set of edges. Fig. 1 illustrates an example of a graph (or graphs).\n\nFig. 1\n\nA free tree is a connnected, acyclic, undirected graph. A rooted tree is a free tree in which one of the vertices is distinguished from the others. A vertex of a rooted tree is called \"node.\"\n\nYour task is to write a program which reports the following information for each node u of a given rooted tree T:\n\nnode ID of u\n\nparent of u\n\ndepth of u\n\nnode type (root, internal node or leaf)\n\na list of chidlren of u\n\nIf the last edge on the path from the root r of a tree T to a node x is (p, x), then p is the parent of x, and x is a child of p. The root is the only node in T with no parent.\n\nA node with no children is an external node or leaf. A nonleaf node is an internal node\n\nThe number of children of a node x in a rooted tree T is called the degree of x.\n\nThe length of the path from the root r to a node x is the depth of x in T.\n\nHere, the given tree consists of n nodes and evey node has a unique ID from 0 to n-1.\n\nFig. 2 shows an example of rooted trees where ID of each node is indicated by a number in a circle (node). The example corresponds to the first sample input.\n\nFig. 2\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 lines, the information of each node u is given in the following format:\n\nid k c1 c2 ... ck\n\nwhere id is the node ID of u, k is the degree of u, c1 ... ck are node IDs of 1st, ... kth child of u. If the node does not have a child, the k is 0.\n\nOutput\n\nPrint the information of each node in the following format ordered by IDs:\n\nnode id: parent = p, depth = d, type, [c1...ck]\n\np is ID of its parent. If the node does not have a parent, print -1.\n\nd is depth of the node.\n\ntype is a type of nodes represented by a string (root, internal node or leaf). If the root can be considered as a leaf or an internal node, print root.\n\nc1...ck is the list of children as a ordered tree.\n\nPlease follow the format presented in a sample output below.\n\nConstraints\n\n1 ≤ n ≤ 100000\n\nSample Input 1\n\n13\n0 3 1 4 10\n1 2 2 3\n2 0\n3 0\n4 3 5 6 7\n5 0\n6 0\n7 2 8 9\n8 0\n9 0\n10 2 11 12\n11 0\n12 0\n\nSample Output 1\n\nnode 0: parent = -1, depth = 0, root, [1, 4, 10]\nnode 1: parent = 0, depth = 1, internal node, [2, 3]\nnode 2: parent = 1, depth = 2, leaf, []\nnode 3: parent = 1, depth = 2, leaf, []\nnode 4: parent = 0, depth = 1, internal node, [5, 6, 7]\nnode 5: parent = 4, depth = 2, leaf, []\nnode 6: parent = 4, depth = 2, leaf, []\nnode 7: parent = 4, depth = 2, internal node, [8, 9]\nnode 8: parent = 7, depth = 3, leaf, []\nnode 9: parent = 7, depth = 3, leaf, []\nnode 10: parent = 0, depth = 1, internal node, [11, 12]\nnode 11: parent = 10, depth = 2, leaf, []\nnode 12: parent = 10, depth = 2, leaf, []\n\nSample Input 2\n\n4\n1 3 3 2 0\n0 0\n3 0\n2 0\n\nSample Output 2\n\nnode 0: parent = 1, depth = 1, leaf, []\nnode 1: parent = -1, depth = 0, root, [3, 2, 0]\nnode 2: parent = 1, depth = 1, leaf, []\nnode 3: parent = 1, depth = 1, leaf, []\n\nNote\n\nYou can use a left-child, right-sibling representation to implement a tree which has the following data:\n\nthe parent of u\n\nthe leftmost child of u\n\nthe immediate right sibling of u\n\nReference\n\nIntroduction to Algorithms, Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein. The MIT Press.", "sample_input": "13\n0 3 1 4 10\n1 2 2 3\n2 0\n3 0\n4 3 5 6 7\n5 0\n6 0\n7 2 8 9\n8 0\n9 0\n10 2 11 12\n11 0\n12 0\n"}, "reference_outputs": ["node 0: parent = -1, depth = 0, root, [1, 4, 10]\nnode 1: parent = 0, depth = 1, internal node, [2, 3]\nnode 2: parent = 1, depth = 2, leaf, []\nnode 3: parent = 1, depth = 2, leaf, []\nnode 4: parent = 0, depth = 1, internal node, [5, 6, 7]\nnode 5: parent = 4, depth = 2, leaf, []\nnode 6: parent = 4, depth = 2, leaf, []\nnode 7: parent = 4, depth = 2, internal node, [8, 9]\nnode 8: parent = 7, depth = 3, leaf, []\nnode 9: parent = 7, depth = 3, leaf, []\nnode 10: parent = 0, depth = 1, internal node, [11, 12]\nnode 11: parent = 10, depth = 2, leaf, []\nnode 12: parent = 10, depth = 2, leaf, []\n"], "source_document_id": "p02279", "source_text": "Rooted Trees\n\nA graph G = (V, E) is a data structure where V is a finite set of vertices and E is a binary relation on V represented by a set of edges. Fig. 1 illustrates an example of a graph (or graphs).\n\nFig. 1\n\nA free tree is a connnected, acyclic, undirected graph. A rooted tree is a free tree in which one of the vertices is distinguished from the others. A vertex of a rooted tree is called \"node.\"\n\nYour task is to write a program which reports the following information for each node u of a given rooted tree T:\n\nnode ID of u\n\nparent of u\n\ndepth of u\n\nnode type (root, internal node or leaf)\n\na list of chidlren of u\n\nIf the last edge on the path from the root r of a tree T to a node x is (p, x), then p is the parent of x, and x is a child of p. The root is the only node in T with no parent.\n\nA node with no children is an external node or leaf. A nonleaf node is an internal node\n\nThe number of children of a node x in a rooted tree T is called the degree of x.\n\nThe length of the path from the root r to a node x is the depth of x in T.\n\nHere, the given tree consists of n nodes and evey node has a unique ID from 0 to n-1.\n\nFig. 2 shows an example of rooted trees where ID of each node is indicated by a number in a circle (node). The example corresponds to the first sample input.\n\nFig. 2\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 lines, the information of each node u is given in the following format:\n\nid k c1 c2 ... ck\n\nwhere id is the node ID of u, k is the degree of u, c1 ... ck are node IDs of 1st, ... kth child of u. If the node does not have a child, the k is 0.\n\nOutput\n\nPrint the information of each node in the following format ordered by IDs:\n\nnode id: parent = p, depth = d, type, [c1...ck]\n\np is ID of its parent. If the node does not have a parent, print -1.\n\nd is depth of the node.\n\ntype is a type of nodes represented by a string (root, internal node or leaf). If the root can be considered as a leaf or an internal node, print root.\n\nc1...ck is the list of children as a ordered tree.\n\nPlease follow the format presented in a sample output below.\n\nConstraints\n\n1 ≤ n ≤ 100000\n\nSample Input 1\n\n13\n0 3 1 4 10\n1 2 2 3\n2 0\n3 0\n4 3 5 6 7\n5 0\n6 0\n7 2 8 9\n8 0\n9 0\n10 2 11 12\n11 0\n12 0\n\nSample Output 1\n\nnode 0: parent = -1, depth = 0, root, [1, 4, 10]\nnode 1: parent = 0, depth = 1, internal node, [2, 3]\nnode 2: parent = 1, depth = 2, leaf, []\nnode 3: parent = 1, depth = 2, leaf, []\nnode 4: parent = 0, depth = 1, internal node, [5, 6, 7]\nnode 5: parent = 4, depth = 2, leaf, []\nnode 6: parent = 4, depth = 2, leaf, []\nnode 7: parent = 4, depth = 2, internal node, [8, 9]\nnode 8: parent = 7, depth = 3, leaf, []\nnode 9: parent = 7, depth = 3, leaf, []\nnode 10: parent = 0, depth = 1, internal node, [11, 12]\nnode 11: parent = 10, depth = 2, leaf, []\nnode 12: parent = 10, depth = 2, leaf, []\n\nSample Input 2\n\n4\n1 3 3 2 0\n0 0\n3 0\n2 0\n\nSample Output 2\n\nnode 0: parent = 1, depth = 1, leaf, []\nnode 1: parent = -1, depth = 0, root, [3, 2, 0]\nnode 2: parent = 1, depth = 1, leaf, []\nnode 3: parent = 1, depth = 1, leaf, []\n\nNote\n\nYou can use a left-child, right-sibling representation to implement a tree which has the following data:\n\nthe parent of u\n\nthe leftmost child of u\n\nthe immediate right sibling of u\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": 459, "cpu_time_ms": 10, "memory_kb": 596}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s845085211", "group_id": "codeNet:p02279", "input_text": "#include<stdio.h>\n\ntypedef struct node{\n\n  int num;\n  int depth;\n  int parent;\n  int br;\n  int child;\n\n}Node;\nNode node[100001];\nvoid nodegene( Node*);\n\n//void putdepth( Node*);\n\nint depth(int);\n\nvoid nodegene( Node* nod){\n\n  nod -> depth = 0;\n  nod -> child = -1;\n  nod -> br = -1;\n  nod -> parent = -1;\n\n}\n\n\nint depth(int k){\n  int dep = 0;\n  for(dep = 0 ; node[k].parent != -1 ; dep++){\n    k = node[k].parent;\n  }\n  return dep;\n\n}\nint main(){\n\n  int i, j, m, n, l, nod, d, degree,br;\n\n  Node c;\n  scanf(\"%d\",&m);\n\n  for( i =0; i < m; i++)nodegene(&node[i]);\n  \n  for( i = 0; i < m; i++){\n\n    scanf(\"%d%d\", &n, &nod);\n\n    for( j = 0; j < nod; j++){\n\n      scanf(\"%d\", &degree);\n\n      if( node[n].child == -1){\n\tnode[n].child = degree;\n\tnode[degree].parent = n; \n      }\n      else if(node[n].child != -1){\n\tl = node[n].child;\n\twhile( node[l].br != -1) l = node[l].br;\n\n\tnode[l].br = degree;\n\tnode[degree].parent = n;\n      }\n    }\n  }\n\n  //  for(i = 0; i < m; i ++)putdepth(&node[i]);\n\n  for( i = 0; i < m; i++){\n\n    printf(\"node %d: parent = %d, depth = %d, \", i, node[i].parent,depth(i));\n\n    if(node[i].child == -1 && node[i].parent != -1)\n      printf(\"leaf, \");\n    else if(node[i].parent == -1)\n      printf(\"root, \" );\n    else if(node[i].child != -1 && node[i].parent != -1)\n      printf(\"internal node, \" );\n\n    printf(\"[\");\n\n    if(node[i].child != -1){\n\n      printf(\"%d\",node[i].child);\n\n      br = node[i].child;\n\n      while(1){\n\tif(node[br].br == -1)\n\t  break;\n\tprintf(\", %d\",node[br].br);\n\tbr = node[br].br;\n      }\n    }\n\n    printf(\"]\\n\");\n  }\n  return 0;\n}", "language": "C", "metadata": {"date": 1466544236, "filename_ext": "c", "original_language": "C", "problem_description_relpath": "problem_descriptions/p02279.html", "problem_id": "p02279", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02279/input.txt", "sample_output_relpath": "derived/input_output/data/p02279/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02279/C/s845085211.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s845085211", "user_id": "u056325284"}, "prompt_components": {"gold_output": "node 0: parent = -1, depth = 0, root, [1, 4, 10]\nnode 1: parent = 0, depth = 1, internal node, [2, 3]\nnode 2: parent = 1, depth = 2, leaf, []\nnode 3: parent = 1, depth = 2, leaf, []\nnode 4: parent = 0, depth = 1, internal node, [5, 6, 7]\nnode 5: parent = 4, depth = 2, leaf, []\nnode 6: parent = 4, depth = 2, leaf, []\nnode 7: parent = 4, depth = 2, internal node, [8, 9]\nnode 8: parent = 7, depth = 3, leaf, []\nnode 9: parent = 7, depth = 3, leaf, []\nnode 10: parent = 0, depth = 1, internal node, [11, 12]\nnode 11: parent = 10, depth = 2, leaf, []\nnode 12: parent = 10, depth = 2, leaf, []\n", "input_to_evaluate": "#include<stdio.h>\n\ntypedef struct node{\n\n  int num;\n  int depth;\n  int parent;\n  int br;\n  int child;\n\n}Node;\nNode node[100001];\nvoid nodegene( Node*);\n\n//void putdepth( Node*);\n\nint depth(int);\n\nvoid nodegene( Node* nod){\n\n  nod -> depth = 0;\n  nod -> child = -1;\n  nod -> br = -1;\n  nod -> parent = -1;\n\n}\n\n\nint depth(int k){\n  int dep = 0;\n  for(dep = 0 ; node[k].parent != -1 ; dep++){\n    k = node[k].parent;\n  }\n  return dep;\n\n}\nint main(){\n\n  int i, j, m, n, l, nod, d, degree,br;\n\n  Node c;\n  scanf(\"%d\",&m);\n\n  for( i =0; i < m; i++)nodegene(&node[i]);\n  \n  for( i = 0; i < m; i++){\n\n    scanf(\"%d%d\", &n, &nod);\n\n    for( j = 0; j < nod; j++){\n\n      scanf(\"%d\", &degree);\n\n      if( node[n].child == -1){\n\tnode[n].child = degree;\n\tnode[degree].parent = n; \n      }\n      else if(node[n].child != -1){\n\tl = node[n].child;\n\twhile( node[l].br != -1) l = node[l].br;\n\n\tnode[l].br = degree;\n\tnode[degree].parent = n;\n      }\n    }\n  }\n\n  //  for(i = 0; i < m; i ++)putdepth(&node[i]);\n\n  for( i = 0; i < m; i++){\n\n    printf(\"node %d: parent = %d, depth = %d, \", i, node[i].parent,depth(i));\n\n    if(node[i].child == -1 && node[i].parent != -1)\n      printf(\"leaf, \");\n    else if(node[i].parent == -1)\n      printf(\"root, \" );\n    else if(node[i].child != -1 && node[i].parent != -1)\n      printf(\"internal node, \" );\n\n    printf(\"[\");\n\n    if(node[i].child != -1){\n\n      printf(\"%d\",node[i].child);\n\n      br = node[i].child;\n\n      while(1){\n\tif(node[br].br == -1)\n\t  break;\n\tprintf(\", %d\",node[br].br);\n\tbr = node[br].br;\n      }\n    }\n\n    printf(\"]\\n\");\n  }\n  return 0;\n}", "problem_context": "Rooted Trees\n\nA graph G = (V, E) is a data structure where V is a finite set of vertices and E is a binary relation on V represented by a set of edges. Fig. 1 illustrates an example of a graph (or graphs).\n\nFig. 1\n\nA free tree is a connnected, acyclic, undirected graph. A rooted tree is a free tree in which one of the vertices is distinguished from the others. A vertex of a rooted tree is called \"node.\"\n\nYour task is to write a program which reports the following information for each node u of a given rooted tree T:\n\nnode ID of u\n\nparent of u\n\ndepth of u\n\nnode type (root, internal node or leaf)\n\na list of chidlren of u\n\nIf the last edge on the path from the root r of a tree T to a node x is (p, x), then p is the parent of x, and x is a child of p. The root is the only node in T with no parent.\n\nA node with no children is an external node or leaf. A nonleaf node is an internal node\n\nThe number of children of a node x in a rooted tree T is called the degree of x.\n\nThe length of the path from the root r to a node x is the depth of x in T.\n\nHere, the given tree consists of n nodes and evey node has a unique ID from 0 to n-1.\n\nFig. 2 shows an example of rooted trees where ID of each node is indicated by a number in a circle (node). The example corresponds to the first sample input.\n\nFig. 2\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 lines, the information of each node u is given in the following format:\n\nid k c1 c2 ... ck\n\nwhere id is the node ID of u, k is the degree of u, c1 ... ck are node IDs of 1st, ... kth child of u. If the node does not have a child, the k is 0.\n\nOutput\n\nPrint the information of each node in the following format ordered by IDs:\n\nnode id: parent = p, depth = d, type, [c1...ck]\n\np is ID of its parent. If the node does not have a parent, print -1.\n\nd is depth of the node.\n\ntype is a type of nodes represented by a string (root, internal node or leaf). If the root can be considered as a leaf or an internal node, print root.\n\nc1...ck is the list of children as a ordered tree.\n\nPlease follow the format presented in a sample output below.\n\nConstraints\n\n1 ≤ n ≤ 100000\n\nSample Input 1\n\n13\n0 3 1 4 10\n1 2 2 3\n2 0\n3 0\n4 3 5 6 7\n5 0\n6 0\n7 2 8 9\n8 0\n9 0\n10 2 11 12\n11 0\n12 0\n\nSample Output 1\n\nnode 0: parent = -1, depth = 0, root, [1, 4, 10]\nnode 1: parent = 0, depth = 1, internal node, [2, 3]\nnode 2: parent = 1, depth = 2, leaf, []\nnode 3: parent = 1, depth = 2, leaf, []\nnode 4: parent = 0, depth = 1, internal node, [5, 6, 7]\nnode 5: parent = 4, depth = 2, leaf, []\nnode 6: parent = 4, depth = 2, leaf, []\nnode 7: parent = 4, depth = 2, internal node, [8, 9]\nnode 8: parent = 7, depth = 3, leaf, []\nnode 9: parent = 7, depth = 3, leaf, []\nnode 10: parent = 0, depth = 1, internal node, [11, 12]\nnode 11: parent = 10, depth = 2, leaf, []\nnode 12: parent = 10, depth = 2, leaf, []\n\nSample Input 2\n\n4\n1 3 3 2 0\n0 0\n3 0\n2 0\n\nSample Output 2\n\nnode 0: parent = 1, depth = 1, leaf, []\nnode 1: parent = -1, depth = 0, root, [3, 2, 0]\nnode 2: parent = 1, depth = 1, leaf, []\nnode 3: parent = 1, depth = 1, leaf, []\n\nNote\n\nYou can use a left-child, right-sibling representation to implement a tree which has the following data:\n\nthe parent of u\n\nthe leftmost child of u\n\nthe immediate right sibling of u\n\nReference\n\nIntroduction to Algorithms, Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein. The MIT Press.", "sample_input": "13\n0 3 1 4 10\n1 2 2 3\n2 0\n3 0\n4 3 5 6 7\n5 0\n6 0\n7 2 8 9\n8 0\n9 0\n10 2 11 12\n11 0\n12 0\n"}, "reference_outputs": ["node 0: parent = -1, depth = 0, root, [1, 4, 10]\nnode 1: parent = 0, depth = 1, internal node, [2, 3]\nnode 2: parent = 1, depth = 2, leaf, []\nnode 3: parent = 1, depth = 2, leaf, []\nnode 4: parent = 0, depth = 1, internal node, [5, 6, 7]\nnode 5: parent = 4, depth = 2, leaf, []\nnode 6: parent = 4, depth = 2, leaf, []\nnode 7: parent = 4, depth = 2, internal node, [8, 9]\nnode 8: parent = 7, depth = 3, leaf, []\nnode 9: parent = 7, depth = 3, leaf, []\nnode 10: parent = 0, depth = 1, internal node, [11, 12]\nnode 11: parent = 10, depth = 2, leaf, []\nnode 12: parent = 10, depth = 2, leaf, []\n"], "source_document_id": "p02279", "source_text": "Rooted Trees\n\nA graph G = (V, E) is a data structure where V is a finite set of vertices and E is a binary relation on V represented by a set of edges. Fig. 1 illustrates an example of a graph (or graphs).\n\nFig. 1\n\nA free tree is a connnected, acyclic, undirected graph. A rooted tree is a free tree in which one of the vertices is distinguished from the others. A vertex of a rooted tree is called \"node.\"\n\nYour task is to write a program which reports the following information for each node u of a given rooted tree T:\n\nnode ID of u\n\nparent of u\n\ndepth of u\n\nnode type (root, internal node or leaf)\n\na list of chidlren of u\n\nIf the last edge on the path from the root r of a tree T to a node x is (p, x), then p is the parent of x, and x is a child of p. The root is the only node in T with no parent.\n\nA node with no children is an external node or leaf. A nonleaf node is an internal node\n\nThe number of children of a node x in a rooted tree T is called the degree of x.\n\nThe length of the path from the root r to a node x is the depth of x in T.\n\nHere, the given tree consists of n nodes and evey node has a unique ID from 0 to n-1.\n\nFig. 2 shows an example of rooted trees where ID of each node is indicated by a number in a circle (node). The example corresponds to the first sample input.\n\nFig. 2\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 lines, the information of each node u is given in the following format:\n\nid k c1 c2 ... ck\n\nwhere id is the node ID of u, k is the degree of u, c1 ... ck are node IDs of 1st, ... kth child of u. If the node does not have a child, the k is 0.\n\nOutput\n\nPrint the information of each node in the following format ordered by IDs:\n\nnode id: parent = p, depth = d, type, [c1...ck]\n\np is ID of its parent. If the node does not have a parent, print -1.\n\nd is depth of the node.\n\ntype is a type of nodes represented by a string (root, internal node or leaf). If the root can be considered as a leaf or an internal node, print root.\n\nc1...ck is the list of children as a ordered tree.\n\nPlease follow the format presented in a sample output below.\n\nConstraints\n\n1 ≤ n ≤ 100000\n\nSample Input 1\n\n13\n0 3 1 4 10\n1 2 2 3\n2 0\n3 0\n4 3 5 6 7\n5 0\n6 0\n7 2 8 9\n8 0\n9 0\n10 2 11 12\n11 0\n12 0\n\nSample Output 1\n\nnode 0: parent = -1, depth = 0, root, [1, 4, 10]\nnode 1: parent = 0, depth = 1, internal node, [2, 3]\nnode 2: parent = 1, depth = 2, leaf, []\nnode 3: parent = 1, depth = 2, leaf, []\nnode 4: parent = 0, depth = 1, internal node, [5, 6, 7]\nnode 5: parent = 4, depth = 2, leaf, []\nnode 6: parent = 4, depth = 2, leaf, []\nnode 7: parent = 4, depth = 2, internal node, [8, 9]\nnode 8: parent = 7, depth = 3, leaf, []\nnode 9: parent = 7, depth = 3, leaf, []\nnode 10: parent = 0, depth = 1, internal node, [11, 12]\nnode 11: parent = 10, depth = 2, leaf, []\nnode 12: parent = 10, depth = 2, leaf, []\n\nSample Input 2\n\n4\n1 3 3 2 0\n0 0\n3 0\n2 0\n\nSample Output 2\n\nnode 0: parent = 1, depth = 1, leaf, []\nnode 1: parent = -1, depth = 0, root, [3, 2, 0]\nnode 2: parent = 1, depth = 1, leaf, []\nnode 3: parent = 1, depth = 1, leaf, []\n\nNote\n\nYou can use a left-child, right-sibling representation to implement a tree which has the following data:\n\nthe parent of u\n\nthe leftmost child of u\n\nthe immediate right sibling of u\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": 1584, "cpu_time_ms": 11360, "memory_kb": 2568}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s822327709", "group_id": "codeNet:p02279", "input_text": "#include<stdio.h>\n#include<stdlib.h>\ntypedef struct{\n  int parent;\n  int left;\n  int right;\n}Node;\n\nint main(){\n  int n,k,id,h,r,depth,p,i,j;\n  Node *T;\n\n  scanf(\"%d\", &n);\n\n  T=malloc(sizeof(Node)*n);\n\n  for(i=0;i<n;i++){\n    T[i].parent=-1;\n    T[i].left=-1;\n    T[i].right=-1;\n  }\n\n  for(i=0;i<n;i++){\n    scanf(\"%d %d\", &id, &k);\n    for(j=0;j<k;j++){\n      scanf(\"%d\",&h);\n      T[h].parent=id;\n\n      if(j==0) T[id].left=h;\n      else if(j>0) T[r].right = h;\n      r=h;\n    }\n  }\n\n  for(j=0;j<n;j++){\n    depth=0;\n    p=T[j].parent;\n\n    while(p!=-1){\n      p=T[p].parent;\n      depth++;\n    }\n\n    if(depth==0){\n      printf(\"node %d: parent = -1, depth = 0, root, [\", j);\n    }\n    \n    else if(T[j].left == -1){\n      printf(\"node %d: parent = %d, depth = %d, leaf, [\", j, T[j].parent, depth);\n    }\n    else{\n      printf(\"node %d: parent = %d, depth = %d, internal node, [\", j, T[j].parent, depth);\n    }\n \n    p = T[j].left;\n    if(p != -1) printf(\"%d\", p);\n \n    while(p != -1){\n      p = T[p].right;\n      if(p != -1) printf(\", %d\", p);\n    }\n    printf(\"]\\n\");\n  }\n \n  return 0;\n}", "language": "C", "metadata": {"date": 1497408478, "filename_ext": "c", "original_language": "C", "problem_description_relpath": "problem_descriptions/p02279.html", "problem_id": "p02279", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02279/input.txt", "sample_output_relpath": "derived/input_output/data/p02279/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02279/C/s822327709.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s822327709", "user_id": "u055553713"}, "prompt_components": {"gold_output": "node 0: parent = -1, depth = 0, root, [1, 4, 10]\nnode 1: parent = 0, depth = 1, internal node, [2, 3]\nnode 2: parent = 1, depth = 2, leaf, []\nnode 3: parent = 1, depth = 2, leaf, []\nnode 4: parent = 0, depth = 1, internal node, [5, 6, 7]\nnode 5: parent = 4, depth = 2, leaf, []\nnode 6: parent = 4, depth = 2, leaf, []\nnode 7: parent = 4, depth = 2, internal node, [8, 9]\nnode 8: parent = 7, depth = 3, leaf, []\nnode 9: parent = 7, depth = 3, leaf, []\nnode 10: parent = 0, depth = 1, internal node, [11, 12]\nnode 11: parent = 10, depth = 2, leaf, []\nnode 12: parent = 10, depth = 2, leaf, []\n", "input_to_evaluate": "#include<stdio.h>\n#include<stdlib.h>\ntypedef struct{\n  int parent;\n  int left;\n  int right;\n}Node;\n\nint main(){\n  int n,k,id,h,r,depth,p,i,j;\n  Node *T;\n\n  scanf(\"%d\", &n);\n\n  T=malloc(sizeof(Node)*n);\n\n  for(i=0;i<n;i++){\n    T[i].parent=-1;\n    T[i].left=-1;\n    T[i].right=-1;\n  }\n\n  for(i=0;i<n;i++){\n    scanf(\"%d %d\", &id, &k);\n    for(j=0;j<k;j++){\n      scanf(\"%d\",&h);\n      T[h].parent=id;\n\n      if(j==0) T[id].left=h;\n      else if(j>0) T[r].right = h;\n      r=h;\n    }\n  }\n\n  for(j=0;j<n;j++){\n    depth=0;\n    p=T[j].parent;\n\n    while(p!=-1){\n      p=T[p].parent;\n      depth++;\n    }\n\n    if(depth==0){\n      printf(\"node %d: parent = -1, depth = 0, root, [\", j);\n    }\n    \n    else if(T[j].left == -1){\n      printf(\"node %d: parent = %d, depth = %d, leaf, [\", j, T[j].parent, depth);\n    }\n    else{\n      printf(\"node %d: parent = %d, depth = %d, internal node, [\", j, T[j].parent, depth);\n    }\n \n    p = T[j].left;\n    if(p != -1) printf(\"%d\", p);\n \n    while(p != -1){\n      p = T[p].right;\n      if(p != -1) printf(\", %d\", p);\n    }\n    printf(\"]\\n\");\n  }\n \n  return 0;\n}", "problem_context": "Rooted Trees\n\nA graph G = (V, E) is a data structure where V is a finite set of vertices and E is a binary relation on V represented by a set of edges. Fig. 1 illustrates an example of a graph (or graphs).\n\nFig. 1\n\nA free tree is a connnected, acyclic, undirected graph. A rooted tree is a free tree in which one of the vertices is distinguished from the others. A vertex of a rooted tree is called \"node.\"\n\nYour task is to write a program which reports the following information for each node u of a given rooted tree T:\n\nnode ID of u\n\nparent of u\n\ndepth of u\n\nnode type (root, internal node or leaf)\n\na list of chidlren of u\n\nIf the last edge on the path from the root r of a tree T to a node x is (p, x), then p is the parent of x, and x is a child of p. The root is the only node in T with no parent.\n\nA node with no children is an external node or leaf. A nonleaf node is an internal node\n\nThe number of children of a node x in a rooted tree T is called the degree of x.\n\nThe length of the path from the root r to a node x is the depth of x in T.\n\nHere, the given tree consists of n nodes and evey node has a unique ID from 0 to n-1.\n\nFig. 2 shows an example of rooted trees where ID of each node is indicated by a number in a circle (node). The example corresponds to the first sample input.\n\nFig. 2\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 lines, the information of each node u is given in the following format:\n\nid k c1 c2 ... ck\n\nwhere id is the node ID of u, k is the degree of u, c1 ... ck are node IDs of 1st, ... kth child of u. If the node does not have a child, the k is 0.\n\nOutput\n\nPrint the information of each node in the following format ordered by IDs:\n\nnode id: parent = p, depth = d, type, [c1...ck]\n\np is ID of its parent. If the node does not have a parent, print -1.\n\nd is depth of the node.\n\ntype is a type of nodes represented by a string (root, internal node or leaf). If the root can be considered as a leaf or an internal node, print root.\n\nc1...ck is the list of children as a ordered tree.\n\nPlease follow the format presented in a sample output below.\n\nConstraints\n\n1 ≤ n ≤ 100000\n\nSample Input 1\n\n13\n0 3 1 4 10\n1 2 2 3\n2 0\n3 0\n4 3 5 6 7\n5 0\n6 0\n7 2 8 9\n8 0\n9 0\n10 2 11 12\n11 0\n12 0\n\nSample Output 1\n\nnode 0: parent = -1, depth = 0, root, [1, 4, 10]\nnode 1: parent = 0, depth = 1, internal node, [2, 3]\nnode 2: parent = 1, depth = 2, leaf, []\nnode 3: parent = 1, depth = 2, leaf, []\nnode 4: parent = 0, depth = 1, internal node, [5, 6, 7]\nnode 5: parent = 4, depth = 2, leaf, []\nnode 6: parent = 4, depth = 2, leaf, []\nnode 7: parent = 4, depth = 2, internal node, [8, 9]\nnode 8: parent = 7, depth = 3, leaf, []\nnode 9: parent = 7, depth = 3, leaf, []\nnode 10: parent = 0, depth = 1, internal node, [11, 12]\nnode 11: parent = 10, depth = 2, leaf, []\nnode 12: parent = 10, depth = 2, leaf, []\n\nSample Input 2\n\n4\n1 3 3 2 0\n0 0\n3 0\n2 0\n\nSample Output 2\n\nnode 0: parent = 1, depth = 1, leaf, []\nnode 1: parent = -1, depth = 0, root, [3, 2, 0]\nnode 2: parent = 1, depth = 1, leaf, []\nnode 3: parent = 1, depth = 1, leaf, []\n\nNote\n\nYou can use a left-child, right-sibling representation to implement a tree which has the following data:\n\nthe parent of u\n\nthe leftmost child of u\n\nthe immediate right sibling of u\n\nReference\n\nIntroduction to Algorithms, Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein. The MIT Press.", "sample_input": "13\n0 3 1 4 10\n1 2 2 3\n2 0\n3 0\n4 3 5 6 7\n5 0\n6 0\n7 2 8 9\n8 0\n9 0\n10 2 11 12\n11 0\n12 0\n"}, "reference_outputs": ["node 0: parent = -1, depth = 0, root, [1, 4, 10]\nnode 1: parent = 0, depth = 1, internal node, [2, 3]\nnode 2: parent = 1, depth = 2, leaf, []\nnode 3: parent = 1, depth = 2, leaf, []\nnode 4: parent = 0, depth = 1, internal node, [5, 6, 7]\nnode 5: parent = 4, depth = 2, leaf, []\nnode 6: parent = 4, depth = 2, leaf, []\nnode 7: parent = 4, depth = 2, internal node, [8, 9]\nnode 8: parent = 7, depth = 3, leaf, []\nnode 9: parent = 7, depth = 3, leaf, []\nnode 10: parent = 0, depth = 1, internal node, [11, 12]\nnode 11: parent = 10, depth = 2, leaf, []\nnode 12: parent = 10, depth = 2, leaf, []\n"], "source_document_id": "p02279", "source_text": "Rooted Trees\n\nA graph G = (V, E) is a data structure where V is a finite set of vertices and E is a binary relation on V represented by a set of edges. Fig. 1 illustrates an example of a graph (or graphs).\n\nFig. 1\n\nA free tree is a connnected, acyclic, undirected graph. A rooted tree is a free tree in which one of the vertices is distinguished from the others. A vertex of a rooted tree is called \"node.\"\n\nYour task is to write a program which reports the following information for each node u of a given rooted tree T:\n\nnode ID of u\n\nparent of u\n\ndepth of u\n\nnode type (root, internal node or leaf)\n\na list of chidlren of u\n\nIf the last edge on the path from the root r of a tree T to a node x is (p, x), then p is the parent of x, and x is a child of p. The root is the only node in T with no parent.\n\nA node with no children is an external node or leaf. A nonleaf node is an internal node\n\nThe number of children of a node x in a rooted tree T is called the degree of x.\n\nThe length of the path from the root r to a node x is the depth of x in T.\n\nHere, the given tree consists of n nodes and evey node has a unique ID from 0 to n-1.\n\nFig. 2 shows an example of rooted trees where ID of each node is indicated by a number in a circle (node). The example corresponds to the first sample input.\n\nFig. 2\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 lines, the information of each node u is given in the following format:\n\nid k c1 c2 ... ck\n\nwhere id is the node ID of u, k is the degree of u, c1 ... ck are node IDs of 1st, ... kth child of u. If the node does not have a child, the k is 0.\n\nOutput\n\nPrint the information of each node in the following format ordered by IDs:\n\nnode id: parent = p, depth = d, type, [c1...ck]\n\np is ID of its parent. If the node does not have a parent, print -1.\n\nd is depth of the node.\n\ntype is a type of nodes represented by a string (root, internal node or leaf). If the root can be considered as a leaf or an internal node, print root.\n\nc1...ck is the list of children as a ordered tree.\n\nPlease follow the format presented in a sample output below.\n\nConstraints\n\n1 ≤ n ≤ 100000\n\nSample Input 1\n\n13\n0 3 1 4 10\n1 2 2 3\n2 0\n3 0\n4 3 5 6 7\n5 0\n6 0\n7 2 8 9\n8 0\n9 0\n10 2 11 12\n11 0\n12 0\n\nSample Output 1\n\nnode 0: parent = -1, depth = 0, root, [1, 4, 10]\nnode 1: parent = 0, depth = 1, internal node, [2, 3]\nnode 2: parent = 1, depth = 2, leaf, []\nnode 3: parent = 1, depth = 2, leaf, []\nnode 4: parent = 0, depth = 1, internal node, [5, 6, 7]\nnode 5: parent = 4, depth = 2, leaf, []\nnode 6: parent = 4, depth = 2, leaf, []\nnode 7: parent = 4, depth = 2, internal node, [8, 9]\nnode 8: parent = 7, depth = 3, leaf, []\nnode 9: parent = 7, depth = 3, leaf, []\nnode 10: parent = 0, depth = 1, internal node, [11, 12]\nnode 11: parent = 10, depth = 2, leaf, []\nnode 12: parent = 10, depth = 2, leaf, []\n\nSample Input 2\n\n4\n1 3 3 2 0\n0 0\n3 0\n2 0\n\nSample Output 2\n\nnode 0: parent = 1, depth = 1, leaf, []\nnode 1: parent = -1, depth = 0, root, [3, 2, 0]\nnode 2: parent = 1, depth = 1, leaf, []\nnode 3: parent = 1, depth = 1, leaf, []\n\nNote\n\nYou can use a left-child, right-sibling representation to implement a tree which has the following data:\n\nthe parent of u\n\nthe leftmost child of u\n\nthe immediate right sibling of u\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": 1095, "cpu_time_ms": 60, "memory_kb": 1788}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s254766150", "group_id": "codeNet:p02279", "input_text": "#include<stdio.h>\n#include<stdlib.h>\n\nint main(){\n  int i,j,n,id,l,s=0,t;\n  int **node,*d,*p,*k;\n  char *r[12];\n  \n  scanf(\"%d\",&n);\n\n  node = (int **)malloc(sizeof(int *) * n);\n  d = (int *)malloc(sizeof(int) * n);\n  p = (int *)malloc(sizeof(int) * n);\n  k = (int *)malloc(sizeof(int) * n);\n  \n  for(i = 0 ; i < n ; i++){\n\n    scanf(\"%d\",&id);\n    scanf(\"%d\",&k[id]);\n    \n    node[id] = (int *)malloc(sizeof(int) * k[id]);\n\n    for(j = 0 ; j < k[id] ; j++){\n      scanf(\"%d\",&node[id][j]);\n    }\n  }\n\n  for(i = 0 ; i < n ; i++){\n    s = 0;\n    if(k[i] > 0){\n      for(j = 0 ; j < n ; j++){\n\t\n\tif(s == 1)break;\n\t\n\tfor(l = 0 ; l < k[j] ; l++){\n\t  if(i == node[j][l]){\n\t    p[i] = j;\n\t    r[i] = \"internal node, \";\n\t    s = 1;\n\t    break;\n\t  }\n\t}\n\t\n\tif(s == 0){\n\t  p[i] = -1;\n\t  r[i] = \"root, \";\n\t}\n      }\n    }\n    \n    else if(k[i] == 0){\n      for(j = 0 ; j < n ; j++){\n\tfor(l = 0 ; l < k[j] ; l++){\n\t  if(i == node[j][l]){\n\t    p[i] = j;\n\t    r[i] = \"leaf, \";\n\t    break;\n\t  }\n\t}\n      }\n    }\n    \n  }\n\n  \n\n  for(i = 0 ; i < n ; i++){\n    s = p[i];\n    d[i] = 0;\n    while(s != -1){\n      d[i]++;\t    \n      t = p[s];\n      s = t;\n    }\n  }\n    \n\n\n  for(i = 0 ; i < n ; i++){\n    printf(\"node %d: \",i);\n    printf(\"parent = %d, \",p[i]);\n    printf(\"depth = %d, \",d[i]);\n    printf(\"%s\",r[i]);\n    \n    printf(\"[\");\n    \n    for(j = 0 ; j < k[i] ; j++){\n      printf(\"%d\",node[i][j]);\n      if(j < k[i] - 1) printf(\", \");\n    }\n    printf(\"]\\n\");\n  }\n\n\n  return 0;\n}\n\n\n\n\t   \n\t   \n \n    ", "language": "C", "metadata": {"date": 1497504282, "filename_ext": "c", "original_language": "C", "problem_description_relpath": "problem_descriptions/p02279.html", "problem_id": "p02279", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02279/input.txt", "sample_output_relpath": "derived/input_output/data/p02279/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02279/C/s254766150.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s254766150", "user_id": "u039577351"}, "prompt_components": {"gold_output": "node 0: parent = -1, depth = 0, root, [1, 4, 10]\nnode 1: parent = 0, depth = 1, internal node, [2, 3]\nnode 2: parent = 1, depth = 2, leaf, []\nnode 3: parent = 1, depth = 2, leaf, []\nnode 4: parent = 0, depth = 1, internal node, [5, 6, 7]\nnode 5: parent = 4, depth = 2, leaf, []\nnode 6: parent = 4, depth = 2, leaf, []\nnode 7: parent = 4, depth = 2, internal node, [8, 9]\nnode 8: parent = 7, depth = 3, leaf, []\nnode 9: parent = 7, depth = 3, leaf, []\nnode 10: parent = 0, depth = 1, internal node, [11, 12]\nnode 11: parent = 10, depth = 2, leaf, []\nnode 12: parent = 10, depth = 2, leaf, []\n", "input_to_evaluate": "#include<stdio.h>\n#include<stdlib.h>\n\nint main(){\n  int i,j,n,id,l,s=0,t;\n  int **node,*d,*p,*k;\n  char *r[12];\n  \n  scanf(\"%d\",&n);\n\n  node = (int **)malloc(sizeof(int *) * n);\n  d = (int *)malloc(sizeof(int) * n);\n  p = (int *)malloc(sizeof(int) * n);\n  k = (int *)malloc(sizeof(int) * n);\n  \n  for(i = 0 ; i < n ; i++){\n\n    scanf(\"%d\",&id);\n    scanf(\"%d\",&k[id]);\n    \n    node[id] = (int *)malloc(sizeof(int) * k[id]);\n\n    for(j = 0 ; j < k[id] ; j++){\n      scanf(\"%d\",&node[id][j]);\n    }\n  }\n\n  for(i = 0 ; i < n ; i++){\n    s = 0;\n    if(k[i] > 0){\n      for(j = 0 ; j < n ; j++){\n\t\n\tif(s == 1)break;\n\t\n\tfor(l = 0 ; l < k[j] ; l++){\n\t  if(i == node[j][l]){\n\t    p[i] = j;\n\t    r[i] = \"internal node, \";\n\t    s = 1;\n\t    break;\n\t  }\n\t}\n\t\n\tif(s == 0){\n\t  p[i] = -1;\n\t  r[i] = \"root, \";\n\t}\n      }\n    }\n    \n    else if(k[i] == 0){\n      for(j = 0 ; j < n ; j++){\n\tfor(l = 0 ; l < k[j] ; l++){\n\t  if(i == node[j][l]){\n\t    p[i] = j;\n\t    r[i] = \"leaf, \";\n\t    break;\n\t  }\n\t}\n      }\n    }\n    \n  }\n\n  \n\n  for(i = 0 ; i < n ; i++){\n    s = p[i];\n    d[i] = 0;\n    while(s != -1){\n      d[i]++;\t    \n      t = p[s];\n      s = t;\n    }\n  }\n    \n\n\n  for(i = 0 ; i < n ; i++){\n    printf(\"node %d: \",i);\n    printf(\"parent = %d, \",p[i]);\n    printf(\"depth = %d, \",d[i]);\n    printf(\"%s\",r[i]);\n    \n    printf(\"[\");\n    \n    for(j = 0 ; j < k[i] ; j++){\n      printf(\"%d\",node[i][j]);\n      if(j < k[i] - 1) printf(\", \");\n    }\n    printf(\"]\\n\");\n  }\n\n\n  return 0;\n}\n\n\n\n\t   \n\t   \n \n    ", "problem_context": "Rooted Trees\n\nA graph G = (V, E) is a data structure where V is a finite set of vertices and E is a binary relation on V represented by a set of edges. Fig. 1 illustrates an example of a graph (or graphs).\n\nFig. 1\n\nA free tree is a connnected, acyclic, undirected graph. A rooted tree is a free tree in which one of the vertices is distinguished from the others. A vertex of a rooted tree is called \"node.\"\n\nYour task is to write a program which reports the following information for each node u of a given rooted tree T:\n\nnode ID of u\n\nparent of u\n\ndepth of u\n\nnode type (root, internal node or leaf)\n\na list of chidlren of u\n\nIf the last edge on the path from the root r of a tree T to a node x is (p, x), then p is the parent of x, and x is a child of p. The root is the only node in T with no parent.\n\nA node with no children is an external node or leaf. A nonleaf node is an internal node\n\nThe number of children of a node x in a rooted tree T is called the degree of x.\n\nThe length of the path from the root r to a node x is the depth of x in T.\n\nHere, the given tree consists of n nodes and evey node has a unique ID from 0 to n-1.\n\nFig. 2 shows an example of rooted trees where ID of each node is indicated by a number in a circle (node). The example corresponds to the first sample input.\n\nFig. 2\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 lines, the information of each node u is given in the following format:\n\nid k c1 c2 ... ck\n\nwhere id is the node ID of u, k is the degree of u, c1 ... ck are node IDs of 1st, ... kth child of u. If the node does not have a child, the k is 0.\n\nOutput\n\nPrint the information of each node in the following format ordered by IDs:\n\nnode id: parent = p, depth = d, type, [c1...ck]\n\np is ID of its parent. If the node does not have a parent, print -1.\n\nd is depth of the node.\n\ntype is a type of nodes represented by a string (root, internal node or leaf). If the root can be considered as a leaf or an internal node, print root.\n\nc1...ck is the list of children as a ordered tree.\n\nPlease follow the format presented in a sample output below.\n\nConstraints\n\n1 ≤ n ≤ 100000\n\nSample Input 1\n\n13\n0 3 1 4 10\n1 2 2 3\n2 0\n3 0\n4 3 5 6 7\n5 0\n6 0\n7 2 8 9\n8 0\n9 0\n10 2 11 12\n11 0\n12 0\n\nSample Output 1\n\nnode 0: parent = -1, depth = 0, root, [1, 4, 10]\nnode 1: parent = 0, depth = 1, internal node, [2, 3]\nnode 2: parent = 1, depth = 2, leaf, []\nnode 3: parent = 1, depth = 2, leaf, []\nnode 4: parent = 0, depth = 1, internal node, [5, 6, 7]\nnode 5: parent = 4, depth = 2, leaf, []\nnode 6: parent = 4, depth = 2, leaf, []\nnode 7: parent = 4, depth = 2, internal node, [8, 9]\nnode 8: parent = 7, depth = 3, leaf, []\nnode 9: parent = 7, depth = 3, leaf, []\nnode 10: parent = 0, depth = 1, internal node, [11, 12]\nnode 11: parent = 10, depth = 2, leaf, []\nnode 12: parent = 10, depth = 2, leaf, []\n\nSample Input 2\n\n4\n1 3 3 2 0\n0 0\n3 0\n2 0\n\nSample Output 2\n\nnode 0: parent = 1, depth = 1, leaf, []\nnode 1: parent = -1, depth = 0, root, [3, 2, 0]\nnode 2: parent = 1, depth = 1, leaf, []\nnode 3: parent = 1, depth = 1, leaf, []\n\nNote\n\nYou can use a left-child, right-sibling representation to implement a tree which has the following data:\n\nthe parent of u\n\nthe leftmost child of u\n\nthe immediate right sibling of u\n\nReference\n\nIntroduction to Algorithms, Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein. The MIT Press.", "sample_input": "13\n0 3 1 4 10\n1 2 2 3\n2 0\n3 0\n4 3 5 6 7\n5 0\n6 0\n7 2 8 9\n8 0\n9 0\n10 2 11 12\n11 0\n12 0\n"}, "reference_outputs": ["node 0: parent = -1, depth = 0, root, [1, 4, 10]\nnode 1: parent = 0, depth = 1, internal node, [2, 3]\nnode 2: parent = 1, depth = 2, leaf, []\nnode 3: parent = 1, depth = 2, leaf, []\nnode 4: parent = 0, depth = 1, internal node, [5, 6, 7]\nnode 5: parent = 4, depth = 2, leaf, []\nnode 6: parent = 4, depth = 2, leaf, []\nnode 7: parent = 4, depth = 2, internal node, [8, 9]\nnode 8: parent = 7, depth = 3, leaf, []\nnode 9: parent = 7, depth = 3, leaf, []\nnode 10: parent = 0, depth = 1, internal node, [11, 12]\nnode 11: parent = 10, depth = 2, leaf, []\nnode 12: parent = 10, depth = 2, leaf, []\n"], "source_document_id": "p02279", "source_text": "Rooted Trees\n\nA graph G = (V, E) is a data structure where V is a finite set of vertices and E is a binary relation on V represented by a set of edges. Fig. 1 illustrates an example of a graph (or graphs).\n\nFig. 1\n\nA free tree is a connnected, acyclic, undirected graph. A rooted tree is a free tree in which one of the vertices is distinguished from the others. A vertex of a rooted tree is called \"node.\"\n\nYour task is to write a program which reports the following information for each node u of a given rooted tree T:\n\nnode ID of u\n\nparent of u\n\ndepth of u\n\nnode type (root, internal node or leaf)\n\na list of chidlren of u\n\nIf the last edge on the path from the root r of a tree T to a node x is (p, x), then p is the parent of x, and x is a child of p. The root is the only node in T with no parent.\n\nA node with no children is an external node or leaf. A nonleaf node is an internal node\n\nThe number of children of a node x in a rooted tree T is called the degree of x.\n\nThe length of the path from the root r to a node x is the depth of x in T.\n\nHere, the given tree consists of n nodes and evey node has a unique ID from 0 to n-1.\n\nFig. 2 shows an example of rooted trees where ID of each node is indicated by a number in a circle (node). The example corresponds to the first sample input.\n\nFig. 2\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 lines, the information of each node u is given in the following format:\n\nid k c1 c2 ... ck\n\nwhere id is the node ID of u, k is the degree of u, c1 ... ck are node IDs of 1st, ... kth child of u. If the node does not have a child, the k is 0.\n\nOutput\n\nPrint the information of each node in the following format ordered by IDs:\n\nnode id: parent = p, depth = d, type, [c1...ck]\n\np is ID of its parent. If the node does not have a parent, print -1.\n\nd is depth of the node.\n\ntype is a type of nodes represented by a string (root, internal node or leaf). If the root can be considered as a leaf or an internal node, print root.\n\nc1...ck is the list of children as a ordered tree.\n\nPlease follow the format presented in a sample output below.\n\nConstraints\n\n1 ≤ n ≤ 100000\n\nSample Input 1\n\n13\n0 3 1 4 10\n1 2 2 3\n2 0\n3 0\n4 3 5 6 7\n5 0\n6 0\n7 2 8 9\n8 0\n9 0\n10 2 11 12\n11 0\n12 0\n\nSample Output 1\n\nnode 0: parent = -1, depth = 0, root, [1, 4, 10]\nnode 1: parent = 0, depth = 1, internal node, [2, 3]\nnode 2: parent = 1, depth = 2, leaf, []\nnode 3: parent = 1, depth = 2, leaf, []\nnode 4: parent = 0, depth = 1, internal node, [5, 6, 7]\nnode 5: parent = 4, depth = 2, leaf, []\nnode 6: parent = 4, depth = 2, leaf, []\nnode 7: parent = 4, depth = 2, internal node, [8, 9]\nnode 8: parent = 7, depth = 3, leaf, []\nnode 9: parent = 7, depth = 3, leaf, []\nnode 10: parent = 0, depth = 1, internal node, [11, 12]\nnode 11: parent = 10, depth = 2, leaf, []\nnode 12: parent = 10, depth = 2, leaf, []\n\nSample Input 2\n\n4\n1 3 3 2 0\n0 0\n3 0\n2 0\n\nSample Output 2\n\nnode 0: parent = 1, depth = 1, leaf, []\nnode 1: parent = -1, depth = 0, root, [3, 2, 0]\nnode 2: parent = 1, depth = 1, leaf, []\nnode 3: parent = 1, depth = 1, leaf, []\n\nNote\n\nYou can use a left-child, right-sibling representation to implement a tree which has the following data:\n\nthe parent of u\n\nthe leftmost child of u\n\nthe immediate right sibling of u\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": 1490, "cpu_time_ms": 20000, "memory_kb": 556}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s500840109", "group_id": "codeNet:p02279", "input_text": "#include<stdio.h>\n#define N 100000\n#define NIL -1\n\ntypedef struct{\n  int parent;\n  int left;\n  int right;\n  int k;\n}Node;\n\nNode node[N];\n\nint depth(int);\n\nint main(){\n  int i, j, id, sub, m, n, child;\n  scanf(\"%d\", &n);\n  for(i = 0;i < n;i++){\n    node[i].left = node[i].parent = NIL;\n  }\n  for(i = 0;i < n;i++){\n    scanf(\"%d%d\", &id, &m);\n    node[id].k = m;\n    sub = id;\n    for(j = 0;j < m;j++){\n      scanf(\"%d\", &child);\n      if(j == 0){\n        node[sub].left = child;\n        node[node[sub].left].parent = id;\n        sub = child;\n      }\n      else{\n        node[sub].right = child;\n        node[node[sub].right].parent = id;\n        sub = child;\n      }\n    }\n  }\n  for(i = 0;i < n;i++){\n    printf(\"node %d: parent = %d, depth = %d, \", i, node[i].pa\\\nrent, depth(i));\n    if(node[i].left != NIL){\n      if(node[i].parent != NIL){\n        printf(\"internal node, [\");\n      }\n      else{\n        printf(\"root, [\");\n      }\n      for(j = 0;j < node[i].k-1;j++){\n        if(j == 0){\n          sub = node[i].left;\n          printf(\"%d, \", node[i].left);\n        }\n        else{\n          printf(\"%d, \", node[sub].right);\n          sub = node[sub].right;\n        }\n      }\n      if(node[i].k == 1){\n        printf(\"%d]\\n\", node[i].left);\n      }\n      else{\n        printf(\"%d]\\n\", node[sub].right);\n      }\n    }\n    else{\n      if(node[i].parent == NIL){\n        printf(\"root, []\\n\");\n      }\n      else{\n        printf(\"leaf, []\\n\");\n      }\n    }\n  }  \n  return 0;\n}\n\nint depth(int id){\n  int dep = 0;\n  while(1){\n    if(node[id].parent == NIL){\n      return dep;\n    }\n    else{\n      dep++;\n      id = node[id].parent;\n    }\n  }\n}", "language": "C", "metadata": {"date": 1402644547, "filename_ext": "c", "original_language": "C", "problem_description_relpath": "problem_descriptions/p02279.html", "problem_id": "p02279", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02279/input.txt", "sample_output_relpath": "derived/input_output/data/p02279/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02279/C/s500840109.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s500840109", "user_id": "u238115721"}, "prompt_components": {"gold_output": "node 0: parent = -1, depth = 0, root, [1, 4, 10]\nnode 1: parent = 0, depth = 1, internal node, [2, 3]\nnode 2: parent = 1, depth = 2, leaf, []\nnode 3: parent = 1, depth = 2, leaf, []\nnode 4: parent = 0, depth = 1, internal node, [5, 6, 7]\nnode 5: parent = 4, depth = 2, leaf, []\nnode 6: parent = 4, depth = 2, leaf, []\nnode 7: parent = 4, depth = 2, internal node, [8, 9]\nnode 8: parent = 7, depth = 3, leaf, []\nnode 9: parent = 7, depth = 3, leaf, []\nnode 10: parent = 0, depth = 1, internal node, [11, 12]\nnode 11: parent = 10, depth = 2, leaf, []\nnode 12: parent = 10, depth = 2, leaf, []\n", "input_to_evaluate": "#include<stdio.h>\n#define N 100000\n#define NIL -1\n\ntypedef struct{\n  int parent;\n  int left;\n  int right;\n  int k;\n}Node;\n\nNode node[N];\n\nint depth(int);\n\nint main(){\n  int i, j, id, sub, m, n, child;\n  scanf(\"%d\", &n);\n  for(i = 0;i < n;i++){\n    node[i].left = node[i].parent = NIL;\n  }\n  for(i = 0;i < n;i++){\n    scanf(\"%d%d\", &id, &m);\n    node[id].k = m;\n    sub = id;\n    for(j = 0;j < m;j++){\n      scanf(\"%d\", &child);\n      if(j == 0){\n        node[sub].left = child;\n        node[node[sub].left].parent = id;\n        sub = child;\n      }\n      else{\n        node[sub].right = child;\n        node[node[sub].right].parent = id;\n        sub = child;\n      }\n    }\n  }\n  for(i = 0;i < n;i++){\n    printf(\"node %d: parent = %d, depth = %d, \", i, node[i].pa\\\nrent, depth(i));\n    if(node[i].left != NIL){\n      if(node[i].parent != NIL){\n        printf(\"internal node, [\");\n      }\n      else{\n        printf(\"root, [\");\n      }\n      for(j = 0;j < node[i].k-1;j++){\n        if(j == 0){\n          sub = node[i].left;\n          printf(\"%d, \", node[i].left);\n        }\n        else{\n          printf(\"%d, \", node[sub].right);\n          sub = node[sub].right;\n        }\n      }\n      if(node[i].k == 1){\n        printf(\"%d]\\n\", node[i].left);\n      }\n      else{\n        printf(\"%d]\\n\", node[sub].right);\n      }\n    }\n    else{\n      if(node[i].parent == NIL){\n        printf(\"root, []\\n\");\n      }\n      else{\n        printf(\"leaf, []\\n\");\n      }\n    }\n  }  \n  return 0;\n}\n\nint depth(int id){\n  int dep = 0;\n  while(1){\n    if(node[id].parent == NIL){\n      return dep;\n    }\n    else{\n      dep++;\n      id = node[id].parent;\n    }\n  }\n}", "problem_context": "Rooted Trees\n\nA graph G = (V, E) is a data structure where V is a finite set of vertices and E is a binary relation on V represented by a set of edges. Fig. 1 illustrates an example of a graph (or graphs).\n\nFig. 1\n\nA free tree is a connnected, acyclic, undirected graph. A rooted tree is a free tree in which one of the vertices is distinguished from the others. A vertex of a rooted tree is called \"node.\"\n\nYour task is to write a program which reports the following information for each node u of a given rooted tree T:\n\nnode ID of u\n\nparent of u\n\ndepth of u\n\nnode type (root, internal node or leaf)\n\na list of chidlren of u\n\nIf the last edge on the path from the root r of a tree T to a node x is (p, x), then p is the parent of x, and x is a child of p. The root is the only node in T with no parent.\n\nA node with no children is an external node or leaf. A nonleaf node is an internal node\n\nThe number of children of a node x in a rooted tree T is called the degree of x.\n\nThe length of the path from the root r to a node x is the depth of x in T.\n\nHere, the given tree consists of n nodes and evey node has a unique ID from 0 to n-1.\n\nFig. 2 shows an example of rooted trees where ID of each node is indicated by a number in a circle (node). The example corresponds to the first sample input.\n\nFig. 2\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 lines, the information of each node u is given in the following format:\n\nid k c1 c2 ... ck\n\nwhere id is the node ID of u, k is the degree of u, c1 ... ck are node IDs of 1st, ... kth child of u. If the node does not have a child, the k is 0.\n\nOutput\n\nPrint the information of each node in the following format ordered by IDs:\n\nnode id: parent = p, depth = d, type, [c1...ck]\n\np is ID of its parent. If the node does not have a parent, print -1.\n\nd is depth of the node.\n\ntype is a type of nodes represented by a string (root, internal node or leaf). If the root can be considered as a leaf or an internal node, print root.\n\nc1...ck is the list of children as a ordered tree.\n\nPlease follow the format presented in a sample output below.\n\nConstraints\n\n1 ≤ n ≤ 100000\n\nSample Input 1\n\n13\n0 3 1 4 10\n1 2 2 3\n2 0\n3 0\n4 3 5 6 7\n5 0\n6 0\n7 2 8 9\n8 0\n9 0\n10 2 11 12\n11 0\n12 0\n\nSample Output 1\n\nnode 0: parent = -1, depth = 0, root, [1, 4, 10]\nnode 1: parent = 0, depth = 1, internal node, [2, 3]\nnode 2: parent = 1, depth = 2, leaf, []\nnode 3: parent = 1, depth = 2, leaf, []\nnode 4: parent = 0, depth = 1, internal node, [5, 6, 7]\nnode 5: parent = 4, depth = 2, leaf, []\nnode 6: parent = 4, depth = 2, leaf, []\nnode 7: parent = 4, depth = 2, internal node, [8, 9]\nnode 8: parent = 7, depth = 3, leaf, []\nnode 9: parent = 7, depth = 3, leaf, []\nnode 10: parent = 0, depth = 1, internal node, [11, 12]\nnode 11: parent = 10, depth = 2, leaf, []\nnode 12: parent = 10, depth = 2, leaf, []\n\nSample Input 2\n\n4\n1 3 3 2 0\n0 0\n3 0\n2 0\n\nSample Output 2\n\nnode 0: parent = 1, depth = 1, leaf, []\nnode 1: parent = -1, depth = 0, root, [3, 2, 0]\nnode 2: parent = 1, depth = 1, leaf, []\nnode 3: parent = 1, depth = 1, leaf, []\n\nNote\n\nYou can use a left-child, right-sibling representation to implement a tree which has the following data:\n\nthe parent of u\n\nthe leftmost child of u\n\nthe immediate right sibling of u\n\nReference\n\nIntroduction to Algorithms, Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein. The MIT Press.", "sample_input": "13\n0 3 1 4 10\n1 2 2 3\n2 0\n3 0\n4 3 5 6 7\n5 0\n6 0\n7 2 8 9\n8 0\n9 0\n10 2 11 12\n11 0\n12 0\n"}, "reference_outputs": ["node 0: parent = -1, depth = 0, root, [1, 4, 10]\nnode 1: parent = 0, depth = 1, internal node, [2, 3]\nnode 2: parent = 1, depth = 2, leaf, []\nnode 3: parent = 1, depth = 2, leaf, []\nnode 4: parent = 0, depth = 1, internal node, [5, 6, 7]\nnode 5: parent = 4, depth = 2, leaf, []\nnode 6: parent = 4, depth = 2, leaf, []\nnode 7: parent = 4, depth = 2, internal node, [8, 9]\nnode 8: parent = 7, depth = 3, leaf, []\nnode 9: parent = 7, depth = 3, leaf, []\nnode 10: parent = 0, depth = 1, internal node, [11, 12]\nnode 11: parent = 10, depth = 2, leaf, []\nnode 12: parent = 10, depth = 2, leaf, []\n"], "source_document_id": "p02279", "source_text": "Rooted Trees\n\nA graph G = (V, E) is a data structure where V is a finite set of vertices and E is a binary relation on V represented by a set of edges. Fig. 1 illustrates an example of a graph (or graphs).\n\nFig. 1\n\nA free tree is a connnected, acyclic, undirected graph. A rooted tree is a free tree in which one of the vertices is distinguished from the others. A vertex of a rooted tree is called \"node.\"\n\nYour task is to write a program which reports the following information for each node u of a given rooted tree T:\n\nnode ID of u\n\nparent of u\n\ndepth of u\n\nnode type (root, internal node or leaf)\n\na list of chidlren of u\n\nIf the last edge on the path from the root r of a tree T to a node x is (p, x), then p is the parent of x, and x is a child of p. The root is the only node in T with no parent.\n\nA node with no children is an external node or leaf. A nonleaf node is an internal node\n\nThe number of children of a node x in a rooted tree T is called the degree of x.\n\nThe length of the path from the root r to a node x is the depth of x in T.\n\nHere, the given tree consists of n nodes and evey node has a unique ID from 0 to n-1.\n\nFig. 2 shows an example of rooted trees where ID of each node is indicated by a number in a circle (node). The example corresponds to the first sample input.\n\nFig. 2\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 lines, the information of each node u is given in the following format:\n\nid k c1 c2 ... ck\n\nwhere id is the node ID of u, k is the degree of u, c1 ... ck are node IDs of 1st, ... kth child of u. If the node does not have a child, the k is 0.\n\nOutput\n\nPrint the information of each node in the following format ordered by IDs:\n\nnode id: parent = p, depth = d, type, [c1...ck]\n\np is ID of its parent. If the node does not have a parent, print -1.\n\nd is depth of the node.\n\ntype is a type of nodes represented by a string (root, internal node or leaf). If the root can be considered as a leaf or an internal node, print root.\n\nc1...ck is the list of children as a ordered tree.\n\nPlease follow the format presented in a sample output below.\n\nConstraints\n\n1 ≤ n ≤ 100000\n\nSample Input 1\n\n13\n0 3 1 4 10\n1 2 2 3\n2 0\n3 0\n4 3 5 6 7\n5 0\n6 0\n7 2 8 9\n8 0\n9 0\n10 2 11 12\n11 0\n12 0\n\nSample Output 1\n\nnode 0: parent = -1, depth = 0, root, [1, 4, 10]\nnode 1: parent = 0, depth = 1, internal node, [2, 3]\nnode 2: parent = 1, depth = 2, leaf, []\nnode 3: parent = 1, depth = 2, leaf, []\nnode 4: parent = 0, depth = 1, internal node, [5, 6, 7]\nnode 5: parent = 4, depth = 2, leaf, []\nnode 6: parent = 4, depth = 2, leaf, []\nnode 7: parent = 4, depth = 2, internal node, [8, 9]\nnode 8: parent = 7, depth = 3, leaf, []\nnode 9: parent = 7, depth = 3, leaf, []\nnode 10: parent = 0, depth = 1, internal node, [11, 12]\nnode 11: parent = 10, depth = 2, leaf, []\nnode 12: parent = 10, depth = 2, leaf, []\n\nSample Input 2\n\n4\n1 3 3 2 0\n0 0\n3 0\n2 0\n\nSample Output 2\n\nnode 0: parent = 1, depth = 1, leaf, []\nnode 1: parent = -1, depth = 0, root, [3, 2, 0]\nnode 2: parent = 1, depth = 1, leaf, []\nnode 3: parent = 1, depth = 1, leaf, []\n\nNote\n\nYou can use a left-child, right-sibling representation to implement a tree which has the following data:\n\nthe parent of u\n\nthe leftmost child of u\n\nthe immediate right sibling of u\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": 1643, "cpu_time_ms": 60, "memory_kb": 2172}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s782871829", "group_id": "codeNet:p02279", "input_text": "#include<stdio.h>\n#define MAX 100005\n#define NIL -1\nstruct Node_struct{int p, l, r;}; /*p: 親(parent), l: 一番左の子(left child), r:右の兄弟(right sibling)*/\ntypedef struct Node_struct Node;\nNode T[MAX];\nint D[MAX];\n\nvoid print(int u){\n int i, c;\n printf(\"node %d: parent = %d, depth = %d, \", u, T[u].p, D[u]);\n\n if(T[u].p == NIL) printf(\"root, \");\n else if(T[u].l == NIL) printf(\"leaf, \");\n else printf(\"internal node, \");\n\n printf(\"[\");\n for (i=0, c = T[u].l; c != NIL; i++, c = T[c].r){\n   if(i) printf(\", \");\n   printf(\"%d\", c);\n }\n printf(\"]\\n\");\n\n}\n\nvoid calcDepth(int u, int p){\n D[u] = p;\n if(T[u].r != NIL) calcDepth(T[u].r,p);\n if(T[u].l != NIL) calcDepth(T[u].l,p+1);\n}\n\nint main(){\n int i, j, k;\n int n;\n int id, sib, child;\n int root = NIL;\n scanf(\"%d\", &n);\n for(i=0; i<n; i++) T[i].p = T[i].l = T[i].r = NIL;\n\n for(i=0; i<n; i++){\n   scanf(\"%d %d\", &id, &k);\n   for(j = 0, sib = NIL; j<k; j++){ //子を入力する (input children)\n     scanf(\"%d\", &child);\n     T[child].p = id;\n     if(j == 0) T[id].l = child; //idの一番左の子 (the most left child of id)\n     else T[sib].r = child; //左の兄弟に繋げる (connect to left sibling)\n     sib = child;//次の子供の左の兄弟 (the left sibling of the next child)\n   }\n }\n\n //根を求める (find the root)\n for(i=0; i<n; i++){\n   if(T[i].p == -1) root = i;\n }\n\n //それぞれのノードの深さを求める (find depth of each node)\n calcDepth(root, 0);\n\n //出力 (output)\n for(i=0; i<n; i++) print(i);\n\n return 0;\n}\n\n", "language": "C", "metadata": {"date": 1547368717, "filename_ext": "c", "original_language": "C", "problem_description_relpath": "problem_descriptions/p02279.html", "problem_id": "p02279", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02279/input.txt", "sample_output_relpath": "derived/input_output/data/p02279/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02279/C/s782871829.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s782871829", "user_id": "u582635824"}, "prompt_components": {"gold_output": "node 0: parent = -1, depth = 0, root, [1, 4, 10]\nnode 1: parent = 0, depth = 1, internal node, [2, 3]\nnode 2: parent = 1, depth = 2, leaf, []\nnode 3: parent = 1, depth = 2, leaf, []\nnode 4: parent = 0, depth = 1, internal node, [5, 6, 7]\nnode 5: parent = 4, depth = 2, leaf, []\nnode 6: parent = 4, depth = 2, leaf, []\nnode 7: parent = 4, depth = 2, internal node, [8, 9]\nnode 8: parent = 7, depth = 3, leaf, []\nnode 9: parent = 7, depth = 3, leaf, []\nnode 10: parent = 0, depth = 1, internal node, [11, 12]\nnode 11: parent = 10, depth = 2, leaf, []\nnode 12: parent = 10, depth = 2, leaf, []\n", "input_to_evaluate": "#include<stdio.h>\n#define MAX 100005\n#define NIL -1\nstruct Node_struct{int p, l, r;}; /*p: 親(parent), l: 一番左の子(left child), r:右の兄弟(right sibling)*/\ntypedef struct Node_struct Node;\nNode T[MAX];\nint D[MAX];\n\nvoid print(int u){\n int i, c;\n printf(\"node %d: parent = %d, depth = %d, \", u, T[u].p, D[u]);\n\n if(T[u].p == NIL) printf(\"root, \");\n else if(T[u].l == NIL) printf(\"leaf, \");\n else printf(\"internal node, \");\n\n printf(\"[\");\n for (i=0, c = T[u].l; c != NIL; i++, c = T[c].r){\n   if(i) printf(\", \");\n   printf(\"%d\", c);\n }\n printf(\"]\\n\");\n\n}\n\nvoid calcDepth(int u, int p){\n D[u] = p;\n if(T[u].r != NIL) calcDepth(T[u].r,p);\n if(T[u].l != NIL) calcDepth(T[u].l,p+1);\n}\n\nint main(){\n int i, j, k;\n int n;\n int id, sib, child;\n int root = NIL;\n scanf(\"%d\", &n);\n for(i=0; i<n; i++) T[i].p = T[i].l = T[i].r = NIL;\n\n for(i=0; i<n; i++){\n   scanf(\"%d %d\", &id, &k);\n   for(j = 0, sib = NIL; j<k; j++){ //子を入力する (input children)\n     scanf(\"%d\", &child);\n     T[child].p = id;\n     if(j == 0) T[id].l = child; //idの一番左の子 (the most left child of id)\n     else T[sib].r = child; //左の兄弟に繋げる (connect to left sibling)\n     sib = child;//次の子供の左の兄弟 (the left sibling of the next child)\n   }\n }\n\n //根を求める (find the root)\n for(i=0; i<n; i++){\n   if(T[i].p == -1) root = i;\n }\n\n //それぞれのノードの深さを求める (find depth of each node)\n calcDepth(root, 0);\n\n //出力 (output)\n for(i=0; i<n; i++) print(i);\n\n return 0;\n}\n\n", "problem_context": "Rooted Trees\n\nA graph G = (V, E) is a data structure where V is a finite set of vertices and E is a binary relation on V represented by a set of edges. Fig. 1 illustrates an example of a graph (or graphs).\n\nFig. 1\n\nA free tree is a connnected, acyclic, undirected graph. A rooted tree is a free tree in which one of the vertices is distinguished from the others. A vertex of a rooted tree is called \"node.\"\n\nYour task is to write a program which reports the following information for each node u of a given rooted tree T:\n\nnode ID of u\n\nparent of u\n\ndepth of u\n\nnode type (root, internal node or leaf)\n\na list of chidlren of u\n\nIf the last edge on the path from the root r of a tree T to a node x is (p, x), then p is the parent of x, and x is a child of p. The root is the only node in T with no parent.\n\nA node with no children is an external node or leaf. A nonleaf node is an internal node\n\nThe number of children of a node x in a rooted tree T is called the degree of x.\n\nThe length of the path from the root r to a node x is the depth of x in T.\n\nHere, the given tree consists of n nodes and evey node has a unique ID from 0 to n-1.\n\nFig. 2 shows an example of rooted trees where ID of each node is indicated by a number in a circle (node). The example corresponds to the first sample input.\n\nFig. 2\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 lines, the information of each node u is given in the following format:\n\nid k c1 c2 ... ck\n\nwhere id is the node ID of u, k is the degree of u, c1 ... ck are node IDs of 1st, ... kth child of u. If the node does not have a child, the k is 0.\n\nOutput\n\nPrint the information of each node in the following format ordered by IDs:\n\nnode id: parent = p, depth = d, type, [c1...ck]\n\np is ID of its parent. If the node does not have a parent, print -1.\n\nd is depth of the node.\n\ntype is a type of nodes represented by a string (root, internal node or leaf). If the root can be considered as a leaf or an internal node, print root.\n\nc1...ck is the list of children as a ordered tree.\n\nPlease follow the format presented in a sample output below.\n\nConstraints\n\n1 ≤ n ≤ 100000\n\nSample Input 1\n\n13\n0 3 1 4 10\n1 2 2 3\n2 0\n3 0\n4 3 5 6 7\n5 0\n6 0\n7 2 8 9\n8 0\n9 0\n10 2 11 12\n11 0\n12 0\n\nSample Output 1\n\nnode 0: parent = -1, depth = 0, root, [1, 4, 10]\nnode 1: parent = 0, depth = 1, internal node, [2, 3]\nnode 2: parent = 1, depth = 2, leaf, []\nnode 3: parent = 1, depth = 2, leaf, []\nnode 4: parent = 0, depth = 1, internal node, [5, 6, 7]\nnode 5: parent = 4, depth = 2, leaf, []\nnode 6: parent = 4, depth = 2, leaf, []\nnode 7: parent = 4, depth = 2, internal node, [8, 9]\nnode 8: parent = 7, depth = 3, leaf, []\nnode 9: parent = 7, depth = 3, leaf, []\nnode 10: parent = 0, depth = 1, internal node, [11, 12]\nnode 11: parent = 10, depth = 2, leaf, []\nnode 12: parent = 10, depth = 2, leaf, []\n\nSample Input 2\n\n4\n1 3 3 2 0\n0 0\n3 0\n2 0\n\nSample Output 2\n\nnode 0: parent = 1, depth = 1, leaf, []\nnode 1: parent = -1, depth = 0, root, [3, 2, 0]\nnode 2: parent = 1, depth = 1, leaf, []\nnode 3: parent = 1, depth = 1, leaf, []\n\nNote\n\nYou can use a left-child, right-sibling representation to implement a tree which has the following data:\n\nthe parent of u\n\nthe leftmost child of u\n\nthe immediate right sibling of u\n\nReference\n\nIntroduction to Algorithms, Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein. The MIT Press.", "sample_input": "13\n0 3 1 4 10\n1 2 2 3\n2 0\n3 0\n4 3 5 6 7\n5 0\n6 0\n7 2 8 9\n8 0\n9 0\n10 2 11 12\n11 0\n12 0\n"}, "reference_outputs": ["node 0: parent = -1, depth = 0, root, [1, 4, 10]\nnode 1: parent = 0, depth = 1, internal node, [2, 3]\nnode 2: parent = 1, depth = 2, leaf, []\nnode 3: parent = 1, depth = 2, leaf, []\nnode 4: parent = 0, depth = 1, internal node, [5, 6, 7]\nnode 5: parent = 4, depth = 2, leaf, []\nnode 6: parent = 4, depth = 2, leaf, []\nnode 7: parent = 4, depth = 2, internal node, [8, 9]\nnode 8: parent = 7, depth = 3, leaf, []\nnode 9: parent = 7, depth = 3, leaf, []\nnode 10: parent = 0, depth = 1, internal node, [11, 12]\nnode 11: parent = 10, depth = 2, leaf, []\nnode 12: parent = 10, depth = 2, leaf, []\n"], "source_document_id": "p02279", "source_text": "Rooted Trees\n\nA graph G = (V, E) is a data structure where V is a finite set of vertices and E is a binary relation on V represented by a set of edges. Fig. 1 illustrates an example of a graph (or graphs).\n\nFig. 1\n\nA free tree is a connnected, acyclic, undirected graph. A rooted tree is a free tree in which one of the vertices is distinguished from the others. A vertex of a rooted tree is called \"node.\"\n\nYour task is to write a program which reports the following information for each node u of a given rooted tree T:\n\nnode ID of u\n\nparent of u\n\ndepth of u\n\nnode type (root, internal node or leaf)\n\na list of chidlren of u\n\nIf the last edge on the path from the root r of a tree T to a node x is (p, x), then p is the parent of x, and x is a child of p. The root is the only node in T with no parent.\n\nA node with no children is an external node or leaf. A nonleaf node is an internal node\n\nThe number of children of a node x in a rooted tree T is called the degree of x.\n\nThe length of the path from the root r to a node x is the depth of x in T.\n\nHere, the given tree consists of n nodes and evey node has a unique ID from 0 to n-1.\n\nFig. 2 shows an example of rooted trees where ID of each node is indicated by a number in a circle (node). The example corresponds to the first sample input.\n\nFig. 2\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 lines, the information of each node u is given in the following format:\n\nid k c1 c2 ... ck\n\nwhere id is the node ID of u, k is the degree of u, c1 ... ck are node IDs of 1st, ... kth child of u. If the node does not have a child, the k is 0.\n\nOutput\n\nPrint the information of each node in the following format ordered by IDs:\n\nnode id: parent = p, depth = d, type, [c1...ck]\n\np is ID of its parent. If the node does not have a parent, print -1.\n\nd is depth of the node.\n\ntype is a type of nodes represented by a string (root, internal node or leaf). If the root can be considered as a leaf or an internal node, print root.\n\nc1...ck is the list of children as a ordered tree.\n\nPlease follow the format presented in a sample output below.\n\nConstraints\n\n1 ≤ n ≤ 100000\n\nSample Input 1\n\n13\n0 3 1 4 10\n1 2 2 3\n2 0\n3 0\n4 3 5 6 7\n5 0\n6 0\n7 2 8 9\n8 0\n9 0\n10 2 11 12\n11 0\n12 0\n\nSample Output 1\n\nnode 0: parent = -1, depth = 0, root, [1, 4, 10]\nnode 1: parent = 0, depth = 1, internal node, [2, 3]\nnode 2: parent = 1, depth = 2, leaf, []\nnode 3: parent = 1, depth = 2, leaf, []\nnode 4: parent = 0, depth = 1, internal node, [5, 6, 7]\nnode 5: parent = 4, depth = 2, leaf, []\nnode 6: parent = 4, depth = 2, leaf, []\nnode 7: parent = 4, depth = 2, internal node, [8, 9]\nnode 8: parent = 7, depth = 3, leaf, []\nnode 9: parent = 7, depth = 3, leaf, []\nnode 10: parent = 0, depth = 1, internal node, [11, 12]\nnode 11: parent = 10, depth = 2, leaf, []\nnode 12: parent = 10, depth = 2, leaf, []\n\nSample Input 2\n\n4\n1 3 3 2 0\n0 0\n3 0\n2 0\n\nSample Output 2\n\nnode 0: parent = 1, depth = 1, leaf, []\nnode 1: parent = -1, depth = 0, root, [3, 2, 0]\nnode 2: parent = 1, depth = 1, leaf, []\nnode 3: parent = 1, depth = 1, leaf, []\n\nNote\n\nYou can use a left-child, right-sibling representation to implement a tree which has the following data:\n\nthe parent of u\n\nthe leftmost child of u\n\nthe immediate right sibling of u\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": 1515, "cpu_time_ms": 30, "memory_kb": 6384}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s155711600", "group_id": "codeNet:p02280", "input_text": "#include<stdio.h>\n\n#define MAX 100000\n#define NIL -1\n\nstruct Type{ \n  int p, l, r;\n};\nstruct Type A[MAX];\n\nint n,D[MAX];\n\nint getDegree(int u){\n  if(A[u].l!=NIL && A[u].r!=NIL) return 2;\n  else if(A[u].l==NIL && A[u].r==NIL) return 0;\n  else return 1;\n}\n \nint getDepth(int u){\n  int d=0;\n  while(A[u].p!=NIL){\n    u=A[u].p;\n    d++;\n  }\n  return d;\n}\n\n\nint getHeight(int u,int count){\n  int height1=0,height2=0;\n  count++;\n  if(A[u].l!=NIL){\n    height1=getHeight(A[u].l,count);\n  }\n  if(A[u].r!=NIL){\n    height2=getHeight(A[u].r,count);\n  }\n  if(A[u].l==NIL && A[u].r==NIL){\n    return count;\n  }\n  if(height1<height2)return height2;\n  else return height1;\n}\n\nint getSibling(int u){\n  int p;\n  if(A[u].p==NIL)return -1;\n  p=A[u].p;\n  if(A[p].l==u)return A[p].r;\n  if(A[p].r==u)return A[p].l;\n}\n\nvoid print(int u){\n  int i;\n  printf(\"node %d: parent = %d, sibling = %d, degree = %d, depth = %d, height = %d, \",u,A[u].p,getSibling(u),getDegree(u),D[u],getHeight(u,-1));\n  if(A[u].p==NIL)printf(\"root\\n\");\n  else if(A[u].l==NIL && A[u].r==NIL) printf(\"leaf\\n\");\n  else if(A[u].l!=NIL || A[u].r!=NIL )printf(\"internal node\\n\");\n}\n\nmain(){\n  int i, j,v,l,r;\n  scanf(\"%d\", &n);\n  for(i=0;i<n;i++) {\n    A[i].p=NIL;\n    A[i].l=NIL;\n    A[i].r=NIL;\n  }\n  for(i=0;i<n;i++){\n    scanf(\"%d %d %d\",&v,&l,&r);\n    A[v].p=l;\n    A[v].r=r;\n    A[l].p=v;\n    A[r].p=v;\n  }\n  for(i=0;i<n;i++){\n    D[i]=getDepth(i);\n  }\n  for(i=0;i<n;i++) print(i);\n  return 0;\n}", "language": "C", "metadata": {"date": 1402627980, "filename_ext": "c", "original_language": "C", "problem_description_relpath": "problem_descriptions/p02280.html", "problem_id": "p02280", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02280/input.txt", "sample_output_relpath": "derived/input_output/data/p02280/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02280/C/s155711600.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s155711600", "user_id": "u630657456"}, "prompt_components": {"gold_output": "node 0: parent = -1, sibling = -1, degree = 2, depth = 0, height = 3, root\nnode 1: parent = 0, sibling = 4, degree = 2, depth = 1, height = 1, internal node\nnode 2: parent = 1, sibling = 3, degree = 0, depth = 2, height = 0, leaf\nnode 3: parent = 1, sibling = 2, degree = 0, depth = 2, height = 0, leaf\nnode 4: parent = 0, sibling = 1, degree = 2, depth = 1, height = 2, internal node\nnode 5: parent = 4, sibling = 8, degree = 2, depth = 2, height = 1, internal node\nnode 6: parent = 5, sibling = 7, degree = 0, depth = 3, height = 0, leaf\nnode 7: parent = 5, sibling = 6, degree = 0, depth = 3, height = 0, leaf\nnode 8: parent = 4, sibling = 5, degree = 0, depth = 2, height = 0, leaf\n", "input_to_evaluate": "#include<stdio.h>\n\n#define MAX 100000\n#define NIL -1\n\nstruct Type{ \n  int p, l, r;\n};\nstruct Type A[MAX];\n\nint n,D[MAX];\n\nint getDegree(int u){\n  if(A[u].l!=NIL && A[u].r!=NIL) return 2;\n  else if(A[u].l==NIL && A[u].r==NIL) return 0;\n  else return 1;\n}\n \nint getDepth(int u){\n  int d=0;\n  while(A[u].p!=NIL){\n    u=A[u].p;\n    d++;\n  }\n  return d;\n}\n\n\nint getHeight(int u,int count){\n  int height1=0,height2=0;\n  count++;\n  if(A[u].l!=NIL){\n    height1=getHeight(A[u].l,count);\n  }\n  if(A[u].r!=NIL){\n    height2=getHeight(A[u].r,count);\n  }\n  if(A[u].l==NIL && A[u].r==NIL){\n    return count;\n  }\n  if(height1<height2)return height2;\n  else return height1;\n}\n\nint getSibling(int u){\n  int p;\n  if(A[u].p==NIL)return -1;\n  p=A[u].p;\n  if(A[p].l==u)return A[p].r;\n  if(A[p].r==u)return A[p].l;\n}\n\nvoid print(int u){\n  int i;\n  printf(\"node %d: parent = %d, sibling = %d, degree = %d, depth = %d, height = %d, \",u,A[u].p,getSibling(u),getDegree(u),D[u],getHeight(u,-1));\n  if(A[u].p==NIL)printf(\"root\\n\");\n  else if(A[u].l==NIL && A[u].r==NIL) printf(\"leaf\\n\");\n  else if(A[u].l!=NIL || A[u].r!=NIL )printf(\"internal node\\n\");\n}\n\nmain(){\n  int i, j,v,l,r;\n  scanf(\"%d\", &n);\n  for(i=0;i<n;i++) {\n    A[i].p=NIL;\n    A[i].l=NIL;\n    A[i].r=NIL;\n  }\n  for(i=0;i<n;i++){\n    scanf(\"%d %d %d\",&v,&l,&r);\n    A[v].p=l;\n    A[v].r=r;\n    A[l].p=v;\n    A[r].p=v;\n  }\n  for(i=0;i<n;i++){\n    D[i]=getDepth(i);\n  }\n  for(i=0;i<n;i++) print(i);\n  return 0;\n}", "problem_context": "Binary Tree\n\nA rooted binary tree is a tree with a root node in which every node has at most two children.\n\nYour task is to write a program which reads a rooted binary tree T and prints the following information for each node u of T:\n\nnode ID of u\n\nparent of u\n\nsibling of u\n\nthe number of children of u\n\ndepth of u\n\nheight of u\n\nnode type (root, internal node or leaf)\n\nIf two nodes have the same parent, they are siblings. Here, if u and v have the same parent, we say u is a sibling of v (vice versa).\n\nThe height of a node in a tree is the number of edges on the longest simple downward path from the node to a leaf.\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 lines, 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\nPrint the information of each node in the following format:\n\nnode id: parent = p, sibling = s, degree = deg, depth = dep, height = h, type\n\np is ID of its parent. If the node does not have a parent, print -1.\n\ns is ID of its sibling. If the node does not have a sibling, print -1.\n\ndeg, dep and h are the number of children, depth and height of the node respectively.\n\ntype is a type of nodes represented by a string (root, internal node or leaf. If the root can be considered as a leaf or an internal node, print root.\n\nPlease follow the format presented in a sample output below.\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\nnode 0: parent = -1, sibling = -1, degree = 2, depth = 0, height = 3, root\nnode 1: parent = 0, sibling = 4, degree = 2, depth = 1, height = 1, internal node\nnode 2: parent = 1, sibling = 3, degree = 0, depth = 2, height = 0, leaf\nnode 3: parent = 1, sibling = 2, degree = 0, depth = 2, height = 0, leaf\nnode 4: parent = 0, sibling = 1, degree = 2, depth = 1, height = 2, internal node\nnode 5: parent = 4, sibling = 8, degree = 2, depth = 2, height = 1, internal node\nnode 6: parent = 5, sibling = 7, degree = 0, depth = 3, height = 0, leaf\nnode 7: parent = 5, sibling = 6, degree = 0, depth = 3, height = 0, leaf\nnode 8: parent = 4, sibling = 5, degree = 0, depth = 2, height = 0, leaf\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": ["node 0: parent = -1, sibling = -1, degree = 2, depth = 0, height = 3, root\nnode 1: parent = 0, sibling = 4, degree = 2, depth = 1, height = 1, internal node\nnode 2: parent = 1, sibling = 3, degree = 0, depth = 2, height = 0, leaf\nnode 3: parent = 1, sibling = 2, degree = 0, depth = 2, height = 0, leaf\nnode 4: parent = 0, sibling = 1, degree = 2, depth = 1, height = 2, internal node\nnode 5: parent = 4, sibling = 8, degree = 2, depth = 2, height = 1, internal node\nnode 6: parent = 5, sibling = 7, degree = 0, depth = 3, height = 0, leaf\nnode 7: parent = 5, sibling = 6, degree = 0, depth = 3, height = 0, leaf\nnode 8: parent = 4, sibling = 5, degree = 0, depth = 2, height = 0, leaf\n"], "source_document_id": "p02280", "source_text": "Binary Tree\n\nA rooted binary tree is a tree with a root node in which every node has at most two children.\n\nYour task is to write a program which reads a rooted binary tree T and prints the following information for each node u of T:\n\nnode ID of u\n\nparent of u\n\nsibling of u\n\nthe number of children of u\n\ndepth of u\n\nheight of u\n\nnode type (root, internal node or leaf)\n\nIf two nodes have the same parent, they are siblings. Here, if u and v have the same parent, we say u is a sibling of v (vice versa).\n\nThe height of a node in a tree is the number of edges on the longest simple downward path from the node to a leaf.\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 lines, 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\nPrint the information of each node in the following format:\n\nnode id: parent = p, sibling = s, degree = deg, depth = dep, height = h, type\n\np is ID of its parent. If the node does not have a parent, print -1.\n\ns is ID of its sibling. If the node does not have a sibling, print -1.\n\ndeg, dep and h are the number of children, depth and height of the node respectively.\n\ntype is a type of nodes represented by a string (root, internal node or leaf. If the root can be considered as a leaf or an internal node, print root.\n\nPlease follow the format presented in a sample output below.\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\nnode 0: parent = -1, sibling = -1, degree = 2, depth = 0, height = 3, root\nnode 1: parent = 0, sibling = 4, degree = 2, depth = 1, height = 1, internal node\nnode 2: parent = 1, sibling = 3, degree = 0, depth = 2, height = 0, leaf\nnode 3: parent = 1, sibling = 2, degree = 0, depth = 2, height = 0, leaf\nnode 4: parent = 0, sibling = 1, degree = 2, depth = 1, height = 2, internal node\nnode 5: parent = 4, sibling = 8, degree = 2, depth = 2, height = 1, internal node\nnode 6: parent = 5, sibling = 7, degree = 0, depth = 3, height = 0, leaf\nnode 7: parent = 5, sibling = 6, degree = 0, depth = 3, height = 0, leaf\nnode 8: parent = 4, sibling = 5, degree = 0, depth = 2, height = 0, leaf\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": 1447, "cpu_time_ms": 20000, "memory_kb": 560}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s081032249", "group_id": "codeNet:p02283", "input_text": "#include <stdio.h>\n#include <stdlib.h>\n\n\n struct Node{\n  int key;\n  struct Node *right,*parent,*left;\n};\n\nvoid insert(int);\nstruct Node inorder(struct Node *);\nstruct Node preorder(struct Node *);\n\nstruct Node *root, *NIL;\n\n\nint main(){\n  int n=0;\n  int i=0;\n  int number=0;\n  char word[6];\n  char space;\n  int print_flag=0;\n  scanf(\"%d\", &n);\n  for(i=0;i<n;i++){\n    scanf(\"%s\",word);\n\n    if(word[0]=='i')\n      {\n\tscanf(\"%d%c\",&number,&space);\n\tinsert(number);\n      }\n\n    else if(word[0]=='p')\n      {\n\tprint_flag=1;\n      }\n    \n    if(print_flag==1){\n      inorder(root);\n      printf(\"\\n\");\n      preorder(root);\n      printf(\"\\n\");\n      print_flag=0;\n    }\n  }\n\n \n\n    return 0;\n}\n\nvoid insert(int number){\n  struct Node *y=NIL;\n  struct Node *x=root;\n  struct Node *z;\n\n  z=(struct Node *)malloc(sizeof(struct Node));\n  z->key=number;\n  z->left=NIL;\n  z->right=NIL;\n\n  while(x!=NIL){\n    y=x;\n    if( z->key < x->key ) x=x->left;\n    else x=x->right;\n  }\n  z->parent=y;\n  if(y==NIL){\n    root=z;\n  }\n  else{\n    if( z->key < y->key){\n      y->left=z;\n    }\n    else{\n      y->right=z;\n    }\n  }\n}\n\nstruct Node inorder(struct Node *a){\n  if(a==NIL)return;\n  inorder(a->left);\n  printf(\" %d\",a->key);\n  inorder(a->right);\n}\n\nstruct Node preorder(struct Node *a){\n  if(a==NIL)return;\n  printf(\" %d\",a->key);\n  preorder(a->left);\n  preorder(a->right);\n}\n\n", "language": "C", "metadata": {"date": 1531202058, "filename_ext": "c", "original_language": "C", "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/C/s081032249.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s081032249", "user_id": "u535936173"}, "prompt_components": {"gold_output": " 1 12 17 20 25 30 88\n 30 12 1 20 17 25 88\n", "input_to_evaluate": "#include <stdio.h>\n#include <stdlib.h>\n\n\n struct Node{\n  int key;\n  struct Node *right,*parent,*left;\n};\n\nvoid insert(int);\nstruct Node inorder(struct Node *);\nstruct Node preorder(struct Node *);\n\nstruct Node *root, *NIL;\n\n\nint main(){\n  int n=0;\n  int i=0;\n  int number=0;\n  char word[6];\n  char space;\n  int print_flag=0;\n  scanf(\"%d\", &n);\n  for(i=0;i<n;i++){\n    scanf(\"%s\",word);\n\n    if(word[0]=='i')\n      {\n\tscanf(\"%d%c\",&number,&space);\n\tinsert(number);\n      }\n\n    else if(word[0]=='p')\n      {\n\tprint_flag=1;\n      }\n    \n    if(print_flag==1){\n      inorder(root);\n      printf(\"\\n\");\n      preorder(root);\n      printf(\"\\n\");\n      print_flag=0;\n    }\n  }\n\n \n\n    return 0;\n}\n\nvoid insert(int number){\n  struct Node *y=NIL;\n  struct Node *x=root;\n  struct Node *z;\n\n  z=(struct Node *)malloc(sizeof(struct Node));\n  z->key=number;\n  z->left=NIL;\n  z->right=NIL;\n\n  while(x!=NIL){\n    y=x;\n    if( z->key < x->key ) x=x->left;\n    else x=x->right;\n  }\n  z->parent=y;\n  if(y==NIL){\n    root=z;\n  }\n  else{\n    if( z->key < y->key){\n      y->left=z;\n    }\n    else{\n      y->right=z;\n    }\n  }\n}\n\nstruct Node inorder(struct Node *a){\n  if(a==NIL)return;\n  inorder(a->left);\n  printf(\" %d\",a->key);\n  inorder(a->right);\n}\n\nstruct Node preorder(struct Node *a){\n  if(a==NIL)return;\n  printf(\" %d\",a->key);\n  preorder(a->left);\n  preorder(a->right);\n}\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": 1362, "cpu_time_ms": 340, "memory_kb": 25180}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s465250252", "group_id": "codeNet:p02283", "input_text": "#include <stdio.h>\n#include <stdlib.h>\n\n#define NIL NULL\n\nstruct node{\n  int key;\n  struct node *right;\n  struct node *left;\n  struct node *parent;\n};\n\ntypedef struct node * Node;\n\nNode root;\n\nvoid insert(int k){\n\n  Node y = NIL;\n  Node x = root;\n  Node z;\n\n  z = malloc(sizeof(struct node));\n\n  z->key = k;\n  z->left = NIL;\n  z->right = NIL;\n\n  while(x != NIL){\n    y = x; \n    if(z->key < x->key){\n      x = x->left;\n    }\n    else{\n      x = x->right;\n    }\n  }\n  z->parent = y;\n \n  if(y == NIL){\n    root = z;\n  }\n  else if(z->key < y->key){\n    y->left = z; \n  }\n  else{\n    y->right = z;\n  }\n}\n\n\nNode treeMinimum(Node x){\n  while(x->left != NIL)\n    x = x->left;\n  }\n\nvoid inorder(Node x){\n  if(x != NIL){\n    inorder(x->left);\n    printf(\" %d\",x->key);\n    inorder(x->right);\n  }\n\n}\nvoid preorder(Node x){\n\n  if(x != NIL){\n    printf(\" %d\",x->key);\n    preorder(x->left);\n    preorder(x->right);\n  }\n}\n\nint main(){\n\n  int n,i,x;\n  char com[20];\n  root = NIL;\n  scanf(\"%d\",&n);\n \nfor ( i = 0; i < n; i++ ){\n    scanf(\"%s\", com);\n   \n    if ( com[0] == 'i' ){\n      scanf(\"%d\", &x);\n      insert(x);\n    } else if ( com[0] == 'p' ){\n      inorder(root);\n      printf(\"\\n\");\n      preorder(root);\n      printf(\"\\n\");\n    }\n }\n return 0;\n}", "language": "C", "metadata": {"date": 1466053949, "filename_ext": "c", "original_language": "C", "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/C/s465250252.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s465250252", "user_id": "u840849126"}, "prompt_components": {"gold_output": " 1 12 17 20 25 30 88\n 30 12 1 20 17 25 88\n", "input_to_evaluate": "#include <stdio.h>\n#include <stdlib.h>\n\n#define NIL NULL\n\nstruct node{\n  int key;\n  struct node *right;\n  struct node *left;\n  struct node *parent;\n};\n\ntypedef struct node * Node;\n\nNode root;\n\nvoid insert(int k){\n\n  Node y = NIL;\n  Node x = root;\n  Node z;\n\n  z = malloc(sizeof(struct node));\n\n  z->key = k;\n  z->left = NIL;\n  z->right = NIL;\n\n  while(x != NIL){\n    y = x; \n    if(z->key < x->key){\n      x = x->left;\n    }\n    else{\n      x = x->right;\n    }\n  }\n  z->parent = y;\n \n  if(y == NIL){\n    root = z;\n  }\n  else if(z->key < y->key){\n    y->left = z; \n  }\n  else{\n    y->right = z;\n  }\n}\n\n\nNode treeMinimum(Node x){\n  while(x->left != NIL)\n    x = x->left;\n  }\n\nvoid inorder(Node x){\n  if(x != NIL){\n    inorder(x->left);\n    printf(\" %d\",x->key);\n    inorder(x->right);\n  }\n\n}\nvoid preorder(Node x){\n\n  if(x != NIL){\n    printf(\" %d\",x->key);\n    preorder(x->left);\n    preorder(x->right);\n  }\n}\n\nint main(){\n\n  int n,i,x;\n  char com[20];\n  root = NIL;\n  scanf(\"%d\",&n);\n \nfor ( i = 0; i < n; i++ ){\n    scanf(\"%s\", com);\n   \n    if ( com[0] == 'i' ){\n      scanf(\"%d\", &x);\n      insert(x);\n    } else if ( com[0] == 'p' ){\n      inorder(root);\n      printf(\"\\n\");\n      preorder(root);\n      printf(\"\\n\");\n    }\n }\n return 0;\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": 1242, "cpu_time_ms": 400, "memory_kb": 24040}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s336201507", "group_id": "codeNet:p02283", "input_text": "#include <stdio.h>\n#include <stdlib.h> \ntypedef struct{\n    int k,l,r;\n}Node;\nvoid insert(int, int);\nvoid inParse(int);\nvoid preParse(int);\nNode T[500001];\nint main(void)\n{\n    char s[8];\n    int m;\n    int num,count=0;\n    int i;\n   \n    scanf(\"%d\", &m);  \n    for(i=0; i<m; i++){\n        scanf(\"%s\", &s);\n        if(s[0]=='i'){ \n          scanf(\"%d\", &num); \n          insert(count, num); \n          count++; \n        }\n        if(s[0]=='p'){\n          if(count>0) inParse(0);\n            printf(\"\\n\");\n            if(count>0) preParse(0);\n            printf(\"\\n\");\n        }\n    }  \n    return 0;  \n}\n   \nvoid inParse(int p){\n    if(T[p].l>=0) inParse( T[p].l);\n    printf(\" %d\", T[p].k);\n    if(T[p].r>=0) inParse( T[p].r);\n}\n   \nvoid preParse(int p){\n    printf(\" %d\", T[p].k);\n    if(T[p].l>=0) preParse(T[p].l);\n    if(T[p].r>=0) preParse(T[p].r);\n}\n   \nvoid insert(int count, int z){\n    int x=0, y;\n    if(count<1) x=-1;\n   \n    T[count].k = z;\n    T[count].l = -1;\n    T[count].r = -1;\n   \n    while(x>=0){\n        y = x; \n        if(z < T[x].k)x = T[x].l; \n        else x = T[x].r; \n    }\n    if(count<1){}\n    else if(z < T[y].k)T[y].l = count; \n    else T[y].r = count; \n}\n", "language": "C", "metadata": {"date": 1527612287, "filename_ext": "c", "original_language": "C", "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/C/s336201507.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s336201507", "user_id": "u970551499"}, "prompt_components": {"gold_output": " 1 12 17 20 25 30 88\n 30 12 1 20 17 25 88\n", "input_to_evaluate": "#include <stdio.h>\n#include <stdlib.h> \ntypedef struct{\n    int k,l,r;\n}Node;\nvoid insert(int, int);\nvoid inParse(int);\nvoid preParse(int);\nNode T[500001];\nint main(void)\n{\n    char s[8];\n    int m;\n    int num,count=0;\n    int i;\n   \n    scanf(\"%d\", &m);  \n    for(i=0; i<m; i++){\n        scanf(\"%s\", &s);\n        if(s[0]=='i'){ \n          scanf(\"%d\", &num); \n          insert(count, num); \n          count++; \n        }\n        if(s[0]=='p'){\n          if(count>0) inParse(0);\n            printf(\"\\n\");\n            if(count>0) preParse(0);\n            printf(\"\\n\");\n        }\n    }  \n    return 0;  \n}\n   \nvoid inParse(int p){\n    if(T[p].l>=0) inParse( T[p].l);\n    printf(\" %d\", T[p].k);\n    if(T[p].r>=0) inParse( T[p].r);\n}\n   \nvoid preParse(int p){\n    printf(\" %d\", T[p].k);\n    if(T[p].l>=0) preParse(T[p].l);\n    if(T[p].r>=0) preParse(T[p].r);\n}\n   \nvoid insert(int count, int z){\n    int x=0, y;\n    if(count<1) x=-1;\n   \n    T[count].k = z;\n    T[count].l = -1;\n    T[count].r = -1;\n   \n    while(x>=0){\n        y = x; \n        if(z < T[x].k)x = T[x].l; \n        else x = T[x].r; \n    }\n    if(count<1){}\n    else if(z < T[y].k)T[y].l = count; \n    else T[y].r = count; \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": 1186, "cpu_time_ms": 210, "memory_kb": 7548}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s343967480", "group_id": "codeNet:p02283", "input_text": "#include<stdio.h>\n#include<stdlib.h>\n\nstruct node{\n  struct node *right;\n  struct node *left;\n  struct node *parent;\n  int key;\n};\ntypedef struct node * Node;\n#define NIL NULL\n\nNode root;\n\n\nvoid insert(int k){\n  Node y = NIL;\n  Node x = root;\n  Node z;\n  z = malloc(sizeof(struct node));\n  z->key = k;\n  z->left = NIL;\n  z->right = NIL;\n\n  while(x!=NIL){\n    y=x;\n    if((z->key)<(x->key)){\n      x = x->left;\n    }else{\n      x = x->right;\n    }\n  }\n\n  z->parent=y;\n\n  if(y==NIL){\n    root=z;\n  }else if((z->key) < (y->key)){\n    y->left=z;\n  }else{\n    y->right=z;\n  }\n}\n\nvoid inorder(Node u){\n  if(u==NIL){\n    return;\n  }\n  inorder(u->left);\n  printf(\" %d\",u->key);\n  inorder(u->right);\n  \n}\nvoid preorder(Node u){\n  if(u==NIL){\n    return;\n  }\n  printf(\" %d\",u->key);\n  preorder(u->left);\n  preorder(u->right);\n}\n\n\nint main(){\n  int n, i, x;\n  char com[20];\n  scanf(\"%d\", &n);\n\n  for ( i = 0; i < n; i++ ){\n    scanf(\"%s\", com);\n    if ( com[0] == 'i' ){\n      scanf(\"%d\", &x);\n      insert(x);\n    } else{\n      inorder(root);\n      printf(\"\\n\");\n      preorder(root);\n      printf(\"\\n\");\n    }\n  }\n\n  return 0;\n}\n\n", "language": "C", "metadata": {"date": 1547366030, "filename_ext": "c", "original_language": "C", "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/C/s343967480.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s343967480", "user_id": "u533575044"}, "prompt_components": {"gold_output": " 1 12 17 20 25 30 88\n 30 12 1 20 17 25 88\n", "input_to_evaluate": "#include<stdio.h>\n#include<stdlib.h>\n\nstruct node{\n  struct node *right;\n  struct node *left;\n  struct node *parent;\n  int key;\n};\ntypedef struct node * Node;\n#define NIL NULL\n\nNode root;\n\n\nvoid insert(int k){\n  Node y = NIL;\n  Node x = root;\n  Node z;\n  z = malloc(sizeof(struct node));\n  z->key = k;\n  z->left = NIL;\n  z->right = NIL;\n\n  while(x!=NIL){\n    y=x;\n    if((z->key)<(x->key)){\n      x = x->left;\n    }else{\n      x = x->right;\n    }\n  }\n\n  z->parent=y;\n\n  if(y==NIL){\n    root=z;\n  }else if((z->key) < (y->key)){\n    y->left=z;\n  }else{\n    y->right=z;\n  }\n}\n\nvoid inorder(Node u){\n  if(u==NIL){\n    return;\n  }\n  inorder(u->left);\n  printf(\" %d\",u->key);\n  inorder(u->right);\n  \n}\nvoid preorder(Node u){\n  if(u==NIL){\n    return;\n  }\n  printf(\" %d\",u->key);\n  preorder(u->left);\n  preorder(u->right);\n}\n\n\nint main(){\n  int n, i, x;\n  char com[20];\n  scanf(\"%d\", &n);\n\n  for ( i = 0; i < n; i++ ){\n    scanf(\"%s\", com);\n    if ( com[0] == 'i' ){\n      scanf(\"%d\", &x);\n      insert(x);\n    } else{\n      inorder(root);\n      printf(\"\\n\");\n      preorder(root);\n      printf(\"\\n\");\n    }\n  }\n\n  return 0;\n}\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": 1121, "cpu_time_ms": 320, "memory_kb": 25128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s430788766", "group_id": "codeNet:p02284", "input_text": "#include<stdio.h>\n#include<stdlib.h>\n\nstruct node{\n  struct node *right;\n  struct node *left;\n  struct node *parent;\n  int key;\n};\ntypedef struct node * Node;\n#define NIL NULL\n\nNode root;\n\nNode treeMinimum(Node x){\n}\nNode treeSearch(Node u, int k){\n  if(u==NIL || k==u->key)return u;\n  if(k<u->key) return treeSearch(u->left,k);\n  else return treeSearch(u->right,k);\n}\nNode treeSuccessor(Node x){\n}\nvoid treeDelete(Node z){\n  Node y; // node to be deleted\n  Node x; // child of y\n}\nvoid insert(int k){\n  Node y = NIL;\n  Node x = root;\n  Node z;\n  z = malloc(sizeof(struct node));\n  z->key = k;\n  z->left = NIL;\n  z->right = NIL;\n\n  while(x!=NIL){\n    y=x;\n    if(z->key<x->key)x=x->left;\n    else x=x->right;\n  }\n  z->parent=y;\n  if(y==NIL) root=z;\n  else if(z->key<y->key) y->left=z;\n  else y->right=z;\n}\nvoid inorder(Node u){\n  if(u!=NIL){\n    inorder(u->left);\n    printf(\" %d\",u->key);\n    inorder(u->right);\n  }\n}\nvoid preorder(Node u){\n  if(u!=NIL){\n    printf(\" %d\",u->key);\n    preorder(u->left);\n    preorder(u->right);\n  }\n}\nint main(){\n  int n, i, x;\n  char com[20];\n  scanf(\"%d\", &n);\n\n  for(i=0;i<n;i++){\n    scanf(\"%s\",com);\n    if(com[0]=='f'){\n      scanf(\"%d\",&x);\n      Node t = treeSearch(root,x);\n      if(t!=NIL)printf(\"yes\\n\");\n      else printf(\"no\\n\");\n\n    } else if(com[0]=='i'){\n      scanf(\"%d\",&x);\n      insert(x);\n    } else if(com[0]=='p'){\n      inorder(root);\n      printf(\"\\n\");\n      preorder(root);\n      printf(\"\\n\");\n    }else if(com[0]=='d'){\n      printf(\"in delete\\n\");\n      scanf(\"%d\",&x);\n      //treeDelete(treeSearch(root,x));\n    }\n  } \n  return 0;\n}", "language": "C", "metadata": {"date": 1403756243, "filename_ext": "c", "original_language": "C", "problem_description_relpath": "problem_descriptions/p02284.html", "problem_id": "p02284", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02284/input.txt", "sample_output_relpath": "derived/input_output/data/p02284/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02284/C/s430788766.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s430788766", "user_id": "u630657456"}, "prompt_components": {"gold_output": "yes\nno\n 1 12 17 20 25 30 88\n 30 12 1 20 17 25 88\n", "input_to_evaluate": "#include<stdio.h>\n#include<stdlib.h>\n\nstruct node{\n  struct node *right;\n  struct node *left;\n  struct node *parent;\n  int key;\n};\ntypedef struct node * Node;\n#define NIL NULL\n\nNode root;\n\nNode treeMinimum(Node x){\n}\nNode treeSearch(Node u, int k){\n  if(u==NIL || k==u->key)return u;\n  if(k<u->key) return treeSearch(u->left,k);\n  else return treeSearch(u->right,k);\n}\nNode treeSuccessor(Node x){\n}\nvoid treeDelete(Node z){\n  Node y; // node to be deleted\n  Node x; // child of y\n}\nvoid insert(int k){\n  Node y = NIL;\n  Node x = root;\n  Node z;\n  z = malloc(sizeof(struct node));\n  z->key = k;\n  z->left = NIL;\n  z->right = NIL;\n\n  while(x!=NIL){\n    y=x;\n    if(z->key<x->key)x=x->left;\n    else x=x->right;\n  }\n  z->parent=y;\n  if(y==NIL) root=z;\n  else if(z->key<y->key) y->left=z;\n  else y->right=z;\n}\nvoid inorder(Node u){\n  if(u!=NIL){\n    inorder(u->left);\n    printf(\" %d\",u->key);\n    inorder(u->right);\n  }\n}\nvoid preorder(Node u){\n  if(u!=NIL){\n    printf(\" %d\",u->key);\n    preorder(u->left);\n    preorder(u->right);\n  }\n}\nint main(){\n  int n, i, x;\n  char com[20];\n  scanf(\"%d\", &n);\n\n  for(i=0;i<n;i++){\n    scanf(\"%s\",com);\n    if(com[0]=='f'){\n      scanf(\"%d\",&x);\n      Node t = treeSearch(root,x);\n      if(t!=NIL)printf(\"yes\\n\");\n      else printf(\"no\\n\");\n\n    } else if(com[0]=='i'){\n      scanf(\"%d\",&x);\n      insert(x);\n    } else if(com[0]=='p'){\n      inorder(root);\n      printf(\"\\n\");\n      preorder(root);\n      printf(\"\\n\");\n    }else if(com[0]=='d'){\n      printf(\"in delete\\n\");\n      scanf(\"%d\",&x);\n      //treeDelete(treeSearch(root,x));\n    }\n  } \n  return 0;\n}", "problem_context": "Binary Search Tree II\n\nWrite a program which performs the following operations to a binary search tree $T$ by adding the find operation to A: Binary Search Tree I.\n\ninsert $k$: Insert a node containing $k$ as key into $T$.\n\nfind $k$: Report whether $T$ has a node containing $k$.\n\nprint: Print the keys of the binary search tree by inorder tree walk and preorder tree walk respectively.\n\nInput\n\nIn the first line, the number of operations $m$ is given. In the following $m$ lines, operations represented by insert $k$, find $k$ or print are given.\n\nOutput\n\nFor each find $k$ operation, print \"yes\" if $T$ has a node containing $k$, \"no\" if not.\n\nIn addition, for 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\n10\ninsert 30\ninsert 88\ninsert 12\ninsert 1\ninsert 20\nfind 12\ninsert 17\ninsert 25\nfind 16\nprint\n\nSample Output 1\n\nyes\nno\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": "10\ninsert 30\ninsert 88\ninsert 12\ninsert 1\ninsert 20\nfind 12\ninsert 17\ninsert 25\nfind 16\nprint\n"}, "reference_outputs": ["yes\nno\n 1 12 17 20 25 30 88\n 30 12 1 20 17 25 88\n"], "source_document_id": "p02284", "source_text": "Binary Search Tree II\n\nWrite a program which performs the following operations to a binary search tree $T$ by adding the find operation to A: Binary Search Tree I.\n\ninsert $k$: Insert a node containing $k$ as key into $T$.\n\nfind $k$: Report whether $T$ has a node containing $k$.\n\nprint: Print the keys of the binary search tree by inorder tree walk and preorder tree walk respectively.\n\nInput\n\nIn the first line, the number of operations $m$ is given. In the following $m$ lines, operations represented by insert $k$, find $k$ or print are given.\n\nOutput\n\nFor each find $k$ operation, print \"yes\" if $T$ has a node containing $k$, \"no\" if not.\n\nIn addition, for 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\n10\ninsert 30\ninsert 88\ninsert 12\ninsert 1\ninsert 20\nfind 12\ninsert 17\ninsert 25\nfind 16\nprint\n\nSample Output 1\n\nyes\nno\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": 1598, "cpu_time_ms": 370, "memory_kb": 19364}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s938098253", "group_id": "codeNet:p02288", "input_text": "  #include<stdio.h>\n\n  #define MAX 2000000\n\n  int H,A[MAX+1];\n\n  void maxHeapify(int i){\n  int l,r,largest,C;\n  l=2*i;\n  r=2*i+1;\n\n  if(l<=H && A[l]>A[i]) largest=l;\n  else largest = i;\n\n  if(r<=H && A[r]>A[largest])largest=r;\n\n  if(largest != i ){\n   C = A[i];\n   A[i] = A[largest];\n   A[largest] = C;\n   maxHeapify(largest);\n  }\n}\n\n  int main(){\n  int i;\n  scanf(\"%d\",&H);\n  for(i=1; i<=H; i++)scanf(\"%d\",&A[i]);\n  for(i=H/2; i>=1; i--)maxHeapify(i);\n  for(i=1; i<=H; i++){\n   printf(\" %d\",A[i]);\n }\n  printf(\"\\n\");\n  return 0;\n}\n\n", "language": "C", "metadata": {"date": 1532058572, "filename_ext": "c", "original_language": "C", "problem_description_relpath": "problem_descriptions/p02288.html", "problem_id": "p02288", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02288/input.txt", "sample_output_relpath": "derived/input_output/data/p02288/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02288/C/s938098253.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s938098253", "user_id": "u596659106"}, "prompt_components": {"gold_output": " 16 14 10 8 7 9 3 2 4 1\n", "input_to_evaluate": "  #include<stdio.h>\n\n  #define MAX 2000000\n\n  int H,A[MAX+1];\n\n  void maxHeapify(int i){\n  int l,r,largest,C;\n  l=2*i;\n  r=2*i+1;\n\n  if(l<=H && A[l]>A[i]) largest=l;\n  else largest = i;\n\n  if(r<=H && A[r]>A[largest])largest=r;\n\n  if(largest != i ){\n   C = A[i];\n   A[i] = A[largest];\n   A[largest] = C;\n   maxHeapify(largest);\n  }\n}\n\n  int main(){\n  int i;\n  scanf(\"%d\",&H);\n  for(i=1; i<=H; i++)scanf(\"%d\",&A[i]);\n  for(i=H/2; i>=1; i--)maxHeapify(i);\n  for(i=1; i<=H; i++){\n   printf(\" %d\",A[i]);\n }\n  printf(\"\\n\");\n  return 0;\n}\n\n", "problem_context": "MathJax.Hub.Config({ tex2jax: { inlineMath: [[\"$\",\"$\"], [\"\\\\(\",\"\\\\)\"]], processEscapes: true }});\n\nMaximum Heap\n\nA binary heap which satisfies max-heap property is called max-heap. In a max-heap, for every node $i$ other than the root, $A[i] \\leq A[parent(i)]$, that is, the value of a node is at most the value of its parent. The largest element in a max-heap is stored at the root, and the subtree rooted at a node contains values no larger than that contained at the node itself.\n\nHere is an example of a max-heap.\n\nWrite a program which reads an array and constructs a max-heap from the array based on the following pseudo code.\n\n$maxHeapify(A, i)$ move the value of $A[i]$ down to leaves to make a sub-tree of node $i$ a max-heap. Here, $H$ is the size of the heap.\n\n1 maxHeapify(A, i)\n2 l = left(i)\n3 r = right(i)\n4 // select the node which has the maximum value\n5 if l ≤ H and A[l] > A[i]\n6 largest = l\n7 else\n8 largest = i\n9 if r ≤ H and A[r] > A[largest]\n10 largest = r\n11\n12 if largest ≠ i　// value of children is larger than that of i\n13 swap A[i] and A[largest]\n14 maxHeapify(A, largest) // call recursively\n\nThe following procedure buildMaxHeap(A) makes $A$ a max-heap by performing maxHeapify in a bottom-up manner.\n\n1 buildMaxHeap(A)\n2 for i = H/2 downto 1\n3 maxHeapify(A, i)\n\nInput\n\nIn the first line, an integer $H$ is given. In the second line, $H$ integers which represent elements in the binary heap are given in order of node id (from $1$ to $H$).\n\nOutput\n\nPrint values of nodes in the max-heap in order of their id (from $1$ to $H$). Print a single space character before each value.\n\nConstraint\n\n$1 \\leq H \\leq 500,000$\n\n$-2,000,000,000 \\leq$ value of a node $\\leq 2,000,000,000$\n\nSample Input 1\n\n10\n4 1 3 2 16 9 10 14 8 7\n\nSample Output 1\n\n16 14 10 8 7 9 3 2 4 1\n\nReference\n\nIntroduction to Algorithms, Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein. The MIT Press.", "sample_input": "10\n4 1 3 2 16 9 10 14 8 7\n"}, "reference_outputs": [" 16 14 10 8 7 9 3 2 4 1\n"], "source_document_id": "p02288", "source_text": "MathJax.Hub.Config({ tex2jax: { inlineMath: [[\"$\",\"$\"], [\"\\\\(\",\"\\\\)\"]], processEscapes: true }});\n\nMaximum Heap\n\nA binary heap which satisfies max-heap property is called max-heap. In a max-heap, for every node $i$ other than the root, $A[i] \\leq A[parent(i)]$, that is, the value of a node is at most the value of its parent. The largest element in a max-heap is stored at the root, and the subtree rooted at a node contains values no larger than that contained at the node itself.\n\nHere is an example of a max-heap.\n\nWrite a program which reads an array and constructs a max-heap from the array based on the following pseudo code.\n\n$maxHeapify(A, i)$ move the value of $A[i]$ down to leaves to make a sub-tree of node $i$ a max-heap. Here, $H$ is the size of the heap.\n\n1 maxHeapify(A, i)\n2 l = left(i)\n3 r = right(i)\n4 // select the node which has the maximum value\n5 if l ≤ H and A[l] > A[i]\n6 largest = l\n7 else\n8 largest = i\n9 if r ≤ H and A[r] > A[largest]\n10 largest = r\n11\n12 if largest ≠ i　// value of children is larger than that of i\n13 swap A[i] and A[largest]\n14 maxHeapify(A, largest) // call recursively\n\nThe following procedure buildMaxHeap(A) makes $A$ a max-heap by performing maxHeapify in a bottom-up manner.\n\n1 buildMaxHeap(A)\n2 for i = H/2 downto 1\n3 maxHeapify(A, i)\n\nInput\n\nIn the first line, an integer $H$ is given. In the second line, $H$ integers which represent elements in the binary heap are given in order of node id (from $1$ to $H$).\n\nOutput\n\nPrint values of nodes in the max-heap in order of their id (from $1$ to $H$). Print a single space character before each value.\n\nConstraint\n\n$1 \\leq H \\leq 500,000$\n\n$-2,000,000,000 \\leq$ value of a node $\\leq 2,000,000,000$\n\nSample Input 1\n\n10\n4 1 3 2 16 9 10 14 8 7\n\nSample Output 1\n\n16 14 10 8 7 9 3 2 4 1\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": 533, "cpu_time_ms": 50, "memory_kb": 3804}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s002723167", "group_id": "codeNet:p02288", "input_text": "#include<stdio.h>\n  \n#define MAX 500000\n  \nint Tree[MAX];  \nint n;\n  \nvoid maxHeapify(int i){\n  int largest ,exchange, l, r;\n  l = getLeft(i);\n  r = getRight(i);\n    \n  if((n+1 >l) && (Tree[l] > Tree[i])) largest = l;\n  \n  else largest = i;\n    \n  if((n+1 > r) && (Tree[r] > Tree[largest])) largest = r;\n  \n  if (largest != i){\n  \n    exchange = Tree[i];\n    Tree[i] = Tree[largest];\n    Tree[largest] = exchange;\n    maxHeapify(largest);\n  \n  } \n}\n  \nvoid buildMaxHeap(){\n  int i;\n  for (i=(n/2); i+1>1; i--){\n    maxHeapify(i);\n     }\n}\n   \nint getLeft(int i){\n  return (2*i);\n}\n  \nint getRight(int i){\n  return (2*i + 1);\n}\nint getParent(int i){\n  return i/2;\n}\n \n  \nint main()\n{\n  int i;\n  scanf(\"%d\",&n);\n  \n  for(i=1; i<=n; i++){\n  \n    scanf(\"%d\",&Tree[i]);\n  \n  }\n  \n  buildMaxHeap();\n  \n  for(i=1; i<=n; i++){\n      \n    printf(\" %d\",Tree[i]);\n  \n  }\n  \n  printf(\"\\n\");\n  \n  return 0;\n}\n\n", "language": "C", "metadata": {"date": 1579581339, "filename_ext": "c", "original_language": "C", "problem_description_relpath": "problem_descriptions/p02288.html", "problem_id": "p02288", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02288/input.txt", "sample_output_relpath": "derived/input_output/data/p02288/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02288/C/s002723167.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s002723167", "user_id": "u926937043"}, "prompt_components": {"gold_output": " 16 14 10 8 7 9 3 2 4 1\n", "input_to_evaluate": "#include<stdio.h>\n  \n#define MAX 500000\n  \nint Tree[MAX];  \nint n;\n  \nvoid maxHeapify(int i){\n  int largest ,exchange, l, r;\n  l = getLeft(i);\n  r = getRight(i);\n    \n  if((n+1 >l) && (Tree[l] > Tree[i])) largest = l;\n  \n  else largest = i;\n    \n  if((n+1 > r) && (Tree[r] > Tree[largest])) largest = r;\n  \n  if (largest != i){\n  \n    exchange = Tree[i];\n    Tree[i] = Tree[largest];\n    Tree[largest] = exchange;\n    maxHeapify(largest);\n  \n  } \n}\n  \nvoid buildMaxHeap(){\n  int i;\n  for (i=(n/2); i+1>1; i--){\n    maxHeapify(i);\n     }\n}\n   \nint getLeft(int i){\n  return (2*i);\n}\n  \nint getRight(int i){\n  return (2*i + 1);\n}\nint getParent(int i){\n  return i/2;\n}\n \n  \nint main()\n{\n  int i;\n  scanf(\"%d\",&n);\n  \n  for(i=1; i<=n; i++){\n  \n    scanf(\"%d\",&Tree[i]);\n  \n  }\n  \n  buildMaxHeap();\n  \n  for(i=1; i<=n; i++){\n      \n    printf(\" %d\",Tree[i]);\n  \n  }\n  \n  printf(\"\\n\");\n  \n  return 0;\n}\n\n", "problem_context": "MathJax.Hub.Config({ tex2jax: { inlineMath: [[\"$\",\"$\"], [\"\\\\(\",\"\\\\)\"]], processEscapes: true }});\n\nMaximum Heap\n\nA binary heap which satisfies max-heap property is called max-heap. In a max-heap, for every node $i$ other than the root, $A[i] \\leq A[parent(i)]$, that is, the value of a node is at most the value of its parent. The largest element in a max-heap is stored at the root, and the subtree rooted at a node contains values no larger than that contained at the node itself.\n\nHere is an example of a max-heap.\n\nWrite a program which reads an array and constructs a max-heap from the array based on the following pseudo code.\n\n$maxHeapify(A, i)$ move the value of $A[i]$ down to leaves to make a sub-tree of node $i$ a max-heap. Here, $H$ is the size of the heap.\n\n1 maxHeapify(A, i)\n2 l = left(i)\n3 r = right(i)\n4 // select the node which has the maximum value\n5 if l ≤ H and A[l] > A[i]\n6 largest = l\n7 else\n8 largest = i\n9 if r ≤ H and A[r] > A[largest]\n10 largest = r\n11\n12 if largest ≠ i　// value of children is larger than that of i\n13 swap A[i] and A[largest]\n14 maxHeapify(A, largest) // call recursively\n\nThe following procedure buildMaxHeap(A) makes $A$ a max-heap by performing maxHeapify in a bottom-up manner.\n\n1 buildMaxHeap(A)\n2 for i = H/2 downto 1\n3 maxHeapify(A, i)\n\nInput\n\nIn the first line, an integer $H$ is given. In the second line, $H$ integers which represent elements in the binary heap are given in order of node id (from $1$ to $H$).\n\nOutput\n\nPrint values of nodes in the max-heap in order of their id (from $1$ to $H$). Print a single space character before each value.\n\nConstraint\n\n$1 \\leq H \\leq 500,000$\n\n$-2,000,000,000 \\leq$ value of a node $\\leq 2,000,000,000$\n\nSample Input 1\n\n10\n4 1 3 2 16 9 10 14 8 7\n\nSample Output 1\n\n16 14 10 8 7 9 3 2 4 1\n\nReference\n\nIntroduction to Algorithms, Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein. The MIT Press.", "sample_input": "10\n4 1 3 2 16 9 10 14 8 7\n"}, "reference_outputs": [" 16 14 10 8 7 9 3 2 4 1\n"], "source_document_id": "p02288", "source_text": "MathJax.Hub.Config({ tex2jax: { inlineMath: [[\"$\",\"$\"], [\"\\\\(\",\"\\\\)\"]], processEscapes: true }});\n\nMaximum Heap\n\nA binary heap which satisfies max-heap property is called max-heap. In a max-heap, for every node $i$ other than the root, $A[i] \\leq A[parent(i)]$, that is, the value of a node is at most the value of its parent. The largest element in a max-heap is stored at the root, and the subtree rooted at a node contains values no larger than that contained at the node itself.\n\nHere is an example of a max-heap.\n\nWrite a program which reads an array and constructs a max-heap from the array based on the following pseudo code.\n\n$maxHeapify(A, i)$ move the value of $A[i]$ down to leaves to make a sub-tree of node $i$ a max-heap. Here, $H$ is the size of the heap.\n\n1 maxHeapify(A, i)\n2 l = left(i)\n3 r = right(i)\n4 // select the node which has the maximum value\n5 if l ≤ H and A[l] > A[i]\n6 largest = l\n7 else\n8 largest = i\n9 if r ≤ H and A[r] > A[largest]\n10 largest = r\n11\n12 if largest ≠ i　// value of children is larger than that of i\n13 swap A[i] and A[largest]\n14 maxHeapify(A, largest) // call recursively\n\nThe following procedure buildMaxHeap(A) makes $A$ a max-heap by performing maxHeapify in a bottom-up manner.\n\n1 buildMaxHeap(A)\n2 for i = H/2 downto 1\n3 maxHeapify(A, i)\n\nInput\n\nIn the first line, an integer $H$ is given. In the second line, $H$ integers which represent elements in the binary heap are given in order of node id (from $1$ to $H$).\n\nOutput\n\nPrint values of nodes in the max-heap in order of their id (from $1$ to $H$). Print a single space character before each value.\n\nConstraint\n\n$1 \\leq H \\leq 500,000$\n\n$-2,000,000,000 \\leq$ value of a node $\\leq 2,000,000,000$\n\nSample Input 1\n\n10\n4 1 3 2 16 9 10 14 8 7\n\nSample Output 1\n\n16 14 10 8 7 9 3 2 4 1\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": 897, "cpu_time_ms": 60, "memory_kb": 3700}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s085474935", "group_id": "codeNet:p02288", "input_text": "#include <stdio.h>\n#define MAX 2000000\n\nvoid swap(int *, int *);\nvoid maxHeapify(int);\n\nint H,A[MAX+1];\n\nvoid swap(int *a, int *b){\n  int temp;\n  temp = *a;\n  *a = *b;\n  *b = temp;\n  return;\n}\n\nvoid maxHeapify(int i){\n  int l, r, largest;\n  l = 2 * i;\n  r = 2 * i + 1;\n\n  if(l <= H && A[l] > A[i]) largest = l;\n  else largest = i;\n  if(r <= H && A[r] > A[largest]) largest = r;\n\n  if(largest != i){\n    swap(&A[i], &A[largest]);\n    maxHeapify(largest);\n  }\n}\n\nint main(){\n  scanf(\"%d\",&H);\n\n  for(int i=1; i<=H; i++) scanf(\"%d\", &A[i]);\n\n  for(int i=H/2; i>=1; i--) maxHeapify(i);\n\n  for(int i=1; i<=H; i++){\n    printf(\" %d\", A[i]);\n  }\n  printf(\"\\n\");\n\n  return 0;\n}\n\n", "language": "C", "metadata": {"date": 1547748597, "filename_ext": "c", "original_language": "C", "problem_description_relpath": "problem_descriptions/p02288.html", "problem_id": "p02288", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02288/input.txt", "sample_output_relpath": "derived/input_output/data/p02288/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02288/C/s085474935.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s085474935", "user_id": "u677060363"}, "prompt_components": {"gold_output": " 16 14 10 8 7 9 3 2 4 1\n", "input_to_evaluate": "#include <stdio.h>\n#define MAX 2000000\n\nvoid swap(int *, int *);\nvoid maxHeapify(int);\n\nint H,A[MAX+1];\n\nvoid swap(int *a, int *b){\n  int temp;\n  temp = *a;\n  *a = *b;\n  *b = temp;\n  return;\n}\n\nvoid maxHeapify(int i){\n  int l, r, largest;\n  l = 2 * i;\n  r = 2 * i + 1;\n\n  if(l <= H && A[l] > A[i]) largest = l;\n  else largest = i;\n  if(r <= H && A[r] > A[largest]) largest = r;\n\n  if(largest != i){\n    swap(&A[i], &A[largest]);\n    maxHeapify(largest);\n  }\n}\n\nint main(){\n  scanf(\"%d\",&H);\n\n  for(int i=1; i<=H; i++) scanf(\"%d\", &A[i]);\n\n  for(int i=H/2; i>=1; i--) maxHeapify(i);\n\n  for(int i=1; i<=H; i++){\n    printf(\" %d\", A[i]);\n  }\n  printf(\"\\n\");\n\n  return 0;\n}\n\n", "problem_context": "MathJax.Hub.Config({ tex2jax: { inlineMath: [[\"$\",\"$\"], [\"\\\\(\",\"\\\\)\"]], processEscapes: true }});\n\nMaximum Heap\n\nA binary heap which satisfies max-heap property is called max-heap. In a max-heap, for every node $i$ other than the root, $A[i] \\leq A[parent(i)]$, that is, the value of a node is at most the value of its parent. The largest element in a max-heap is stored at the root, and the subtree rooted at a node contains values no larger than that contained at the node itself.\n\nHere is an example of a max-heap.\n\nWrite a program which reads an array and constructs a max-heap from the array based on the following pseudo code.\n\n$maxHeapify(A, i)$ move the value of $A[i]$ down to leaves to make a sub-tree of node $i$ a max-heap. Here, $H$ is the size of the heap.\n\n1 maxHeapify(A, i)\n2 l = left(i)\n3 r = right(i)\n4 // select the node which has the maximum value\n5 if l ≤ H and A[l] > A[i]\n6 largest = l\n7 else\n8 largest = i\n9 if r ≤ H and A[r] > A[largest]\n10 largest = r\n11\n12 if largest ≠ i　// value of children is larger than that of i\n13 swap A[i] and A[largest]\n14 maxHeapify(A, largest) // call recursively\n\nThe following procedure buildMaxHeap(A) makes $A$ a max-heap by performing maxHeapify in a bottom-up manner.\n\n1 buildMaxHeap(A)\n2 for i = H/2 downto 1\n3 maxHeapify(A, i)\n\nInput\n\nIn the first line, an integer $H$ is given. In the second line, $H$ integers which represent elements in the binary heap are given in order of node id (from $1$ to $H$).\n\nOutput\n\nPrint values of nodes in the max-heap in order of their id (from $1$ to $H$). Print a single space character before each value.\n\nConstraint\n\n$1 \\leq H \\leq 500,000$\n\n$-2,000,000,000 \\leq$ value of a node $\\leq 2,000,000,000$\n\nSample Input 1\n\n10\n4 1 3 2 16 9 10 14 8 7\n\nSample Output 1\n\n16 14 10 8 7 9 3 2 4 1\n\nReference\n\nIntroduction to Algorithms, Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein. The MIT Press.", "sample_input": "10\n4 1 3 2 16 9 10 14 8 7\n"}, "reference_outputs": [" 16 14 10 8 7 9 3 2 4 1\n"], "source_document_id": "p02288", "source_text": "MathJax.Hub.Config({ tex2jax: { inlineMath: [[\"$\",\"$\"], [\"\\\\(\",\"\\\\)\"]], processEscapes: true }});\n\nMaximum Heap\n\nA binary heap which satisfies max-heap property is called max-heap. In a max-heap, for every node $i$ other than the root, $A[i] \\leq A[parent(i)]$, that is, the value of a node is at most the value of its parent. The largest element in a max-heap is stored at the root, and the subtree rooted at a node contains values no larger than that contained at the node itself.\n\nHere is an example of a max-heap.\n\nWrite a program which reads an array and constructs a max-heap from the array based on the following pseudo code.\n\n$maxHeapify(A, i)$ move the value of $A[i]$ down to leaves to make a sub-tree of node $i$ a max-heap. Here, $H$ is the size of the heap.\n\n1 maxHeapify(A, i)\n2 l = left(i)\n3 r = right(i)\n4 // select the node which has the maximum value\n5 if l ≤ H and A[l] > A[i]\n6 largest = l\n7 else\n8 largest = i\n9 if r ≤ H and A[r] > A[largest]\n10 largest = r\n11\n12 if largest ≠ i　// value of children is larger than that of i\n13 swap A[i] and A[largest]\n14 maxHeapify(A, largest) // call recursively\n\nThe following procedure buildMaxHeap(A) makes $A$ a max-heap by performing maxHeapify in a bottom-up manner.\n\n1 buildMaxHeap(A)\n2 for i = H/2 downto 1\n3 maxHeapify(A, i)\n\nInput\n\nIn the first line, an integer $H$ is given. In the second line, $H$ integers which represent elements in the binary heap are given in order of node id (from $1$ to $H$).\n\nOutput\n\nPrint values of nodes in the max-heap in order of their id (from $1$ to $H$). Print a single space character before each value.\n\nConstraint\n\n$1 \\leq H \\leq 500,000$\n\n$-2,000,000,000 \\leq$ value of a node $\\leq 2,000,000,000$\n\nSample Input 1\n\n10\n4 1 3 2 16 9 10 14 8 7\n\nSample Output 1\n\n16 14 10 8 7 9 3 2 4 1\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": 671, "cpu_time_ms": 60, "memory_kb": 3648}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s700184688", "group_id": "codeNet:p02289", "input_text": "#include <stdio.h>\n#include <stdlib.h>\n#include <string.h>\n#include <math.h>\n#define SWAP(a, b) (a += b, b = a - b, a -= b)\n\nint parent(int i)\n{\n    return (int)(i / 2);\n}\n\nint left(int i)\n{\n    return 2 * i;\n}\n\nint right(int i)\n{\n    return 2 * i + 1;\n}\n\nvoid upHeap(int *H, int i)\n{\n    while (parent(i) >= 1 && H[i] > H[parent(i)])\n    {\n        SWAP(H[i], H[parent(i)]);\n        i = parent(i);\n    }\n}\n\nvoid insert(int *H, int *hsize, int key)\n{\n    *hsize += 1;\n    H[*hsize] = key;\n    upHeap(H, *hsize);\n}\n\nvoid maxHeapify(int *H, int *hsize, int i)\n{\n    int u = i;\n    int l = left(u);\n    int r = right(u);\n    int largest;\n\n    if (l <= *hsize && H[l] > H[u])\n    {\n        largest = l;\n    }\n    else\n    {\n        largest = u;\n    }\n    if (r <= *hsize && H[r] > H[largest])\n    {\n        largest = r;\n    }\n\n    if (largest != u)\n    {\n        SWAP(H[u], H[largest]);\n        maxHeapify(H, hsize, largest);\n    }\n}\n\nint extractMax(int *H, int *hsize)\n{\n    int max = H[1];\n    H[1] = H[*hsize];\n    *hsize -= 1;\n\n    maxHeapify(H, hsize, 1);\n\n    return max;\n}\n\nint main(void)\n{\n    int H[2000001];\n    char command[10];\n    int hsize = 0;\n    int key;\n    int max_value;\n\n    while (1)\n    {\n        scanf(\"%s\", command);\n        if (command[0] == 'e' && command[1] == 'n')\n        {\n            break;\n        }\n        else if (command[0] == 'i')\n        {\n            scanf(\"%d\", &key);\n            insert(H, &hsize, key);\n        }\n        else if (command[0] == 'e')\n        {\n            max_value = extractMax(H, &hsize);\n            printf(\"%d\\n\", max_value);\n        }\n    }\n\n    return 0;\n}\n", "language": "C", "metadata": {"date": 1563770727, "filename_ext": "c", "original_language": "C", "problem_description_relpath": "problem_descriptions/p02289.html", "problem_id": "p02289", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02289/input.txt", "sample_output_relpath": "derived/input_output/data/p02289/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02289/C/s700184688.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s700184688", "user_id": "u787709210"}, "prompt_components": {"gold_output": "8\n10\n11\n2\n", "input_to_evaluate": "#include <stdio.h>\n#include <stdlib.h>\n#include <string.h>\n#include <math.h>\n#define SWAP(a, b) (a += b, b = a - b, a -= b)\n\nint parent(int i)\n{\n    return (int)(i / 2);\n}\n\nint left(int i)\n{\n    return 2 * i;\n}\n\nint right(int i)\n{\n    return 2 * i + 1;\n}\n\nvoid upHeap(int *H, int i)\n{\n    while (parent(i) >= 1 && H[i] > H[parent(i)])\n    {\n        SWAP(H[i], H[parent(i)]);\n        i = parent(i);\n    }\n}\n\nvoid insert(int *H, int *hsize, int key)\n{\n    *hsize += 1;\n    H[*hsize] = key;\n    upHeap(H, *hsize);\n}\n\nvoid maxHeapify(int *H, int *hsize, int i)\n{\n    int u = i;\n    int l = left(u);\n    int r = right(u);\n    int largest;\n\n    if (l <= *hsize && H[l] > H[u])\n    {\n        largest = l;\n    }\n    else\n    {\n        largest = u;\n    }\n    if (r <= *hsize && H[r] > H[largest])\n    {\n        largest = r;\n    }\n\n    if (largest != u)\n    {\n        SWAP(H[u], H[largest]);\n        maxHeapify(H, hsize, largest);\n    }\n}\n\nint extractMax(int *H, int *hsize)\n{\n    int max = H[1];\n    H[1] = H[*hsize];\n    *hsize -= 1;\n\n    maxHeapify(H, hsize, 1);\n\n    return max;\n}\n\nint main(void)\n{\n    int H[2000001];\n    char command[10];\n    int hsize = 0;\n    int key;\n    int max_value;\n\n    while (1)\n    {\n        scanf(\"%s\", command);\n        if (command[0] == 'e' && command[1] == 'n')\n        {\n            break;\n        }\n        else if (command[0] == 'i')\n        {\n            scanf(\"%d\", &key);\n            insert(H, &hsize, key);\n        }\n        else if (command[0] == 'e')\n        {\n            max_value = extractMax(H, &hsize);\n            printf(\"%d\\n\", max_value);\n        }\n    }\n\n    return 0;\n}\n", "problem_context": "MathJax.Hub.Config({ tex2jax: { inlineMath: [[\"$\",\"$\"], [\"\\\\(\",\"\\\\)\"]], processEscapes: true }});\n\nPriority Queue\n\nA priority queue is a data structure which maintains a set $S$ of elements, each of with an associated value (key), and supports the following operations:\n\n$insert(S, k)$: insert an element $k$ into the set $S$\n\n$extractMax(S)$: remove and return the element of $S$ with the largest key\n\nWrite a program which performs the $insert(S, k)$ and $extractMax(S)$ operations to a priority queue $S$.\nThe priority queue manages a set of integers, which are also keys for the priority.\n\nInput\n\nMultiple operations to the priority queue $S$ are given. Each operation is given by \"insert $k$\", \"extract\" or \"end\" in a line. Here, $k$ represents an integer element to be inserted to the priority queue.\n\nThe input ends with \"end\" operation.\n\nOutput\n\nFor each \"extract\" operation, print the element extracted from the priority queue $S$ in a line.\n\nConstraints\n\nThe number of operations $\\leq 2,000,000$\n\n$0 \\leq k \\leq 2,000,000,000$\n\nSample Input 1\n\ninsert 8\ninsert 2\nextract\ninsert 10\nextract\ninsert 11\nextract\nextract\nend\n\nSample Output 1\n\n8\n10\n11\n2", "sample_input": "insert 8\ninsert 2\nextract\ninsert 10\nextract\ninsert 11\nextract\nextract\nend\n"}, "reference_outputs": ["8\n10\n11\n2\n"], "source_document_id": "p02289", "source_text": "MathJax.Hub.Config({ tex2jax: { inlineMath: [[\"$\",\"$\"], [\"\\\\(\",\"\\\\)\"]], processEscapes: true }});\n\nPriority Queue\n\nA priority queue is a data structure which maintains a set $S$ of elements, each of with an associated value (key), and supports the following operations:\n\n$insert(S, k)$: insert an element $k$ into the set $S$\n\n$extractMax(S)$: remove and return the element of $S$ with the largest key\n\nWrite a program which performs the $insert(S, k)$ and $extractMax(S)$ operations to a priority queue $S$.\nThe priority queue manages a set of integers, which are also keys for the priority.\n\nInput\n\nMultiple operations to the priority queue $S$ are given. Each operation is given by \"insert $k$\", \"extract\" or \"end\" in a line. Here, $k$ represents an integer element to be inserted to the priority queue.\n\nThe input ends with \"end\" operation.\n\nOutput\n\nFor each \"extract\" operation, print the element extracted from the priority queue $S$ in a line.\n\nConstraints\n\nThe number of operations $\\leq 2,000,000$\n\n$0 \\leq k \\leq 2,000,000,000$\n\nSample Input 1\n\ninsert 8\ninsert 2\nextract\ninsert 10\nextract\ninsert 11\nextract\nextract\nend\n\nSample Output 1\n\n8\n10\n11\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": 1616, "cpu_time_ms": 300, "memory_kb": 5648}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s594766967", "group_id": "codeNet:p02323", "input_text": "#include <stdio.h>          // printf(), scanf()\n\n#define MAX_V 15\n#define min(a, b) ((a) < (b) ? (a) : (b))\n\nstatic const int INF = 1000000000;\n\nint d[MAX_V][MAX_V];\nint dp[1 << MAX_V][MAX_V];\nint V;\n\nint\nsolve()\n{\n\tint S, u, v;\n\n\tfor (S = 0; S < (1 << V); ++S)\n\t{\n\t\tfor (v = 0; v < V; ++v)\n\t\t\tdp[S][v] = INF;\n\t}\n\n\tdp[(1 << V) - 1][0] = 0;\n\tfor (S = (1 << V) - 2; S >= 0; --S)\n\t{\n\t\tfor (v = 0; v < V; ++v)\n\t\t{\n\t\t\tfor (u = 0; u < V; ++u)\n\t\t\t{\n\t\t\t\tif (!(S >> u & 1))\n\t\t\t\t{\n\t\t\t\t\tint t = dp[S | (1 << u)][u] + d[v][u];\n\t\t\t\t\tdp[S][v] = min(dp[S][v], t);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n\treturn dp[0][0];\n}\n\nint\nmain(int argc, char** argv)\n{\n\tint E;\n\tint s, t, c;\n\tint i, j;\n\n\tscanf(\"%d %d\", &V, &E);\n\tfor (i = 0; i < V; ++i)\n\t{\n\t\tfor (j = 0; j < V; ++j)\n\t\t{\n\t\t\tif (i == j)\n\t\t\t\td[i][j] = 0;\n\t\t\telse\n\t\t\t\td[i][j] = INF;\n\t\t}\n\t}\n\n\tfor (i = 0; i < E; ++i)\n\t{\n\t\tscanf(\"%d %d %d\", &s, &t, &c);\n\t\td[s][t] = c;\n\t}\n\n\n\tint res = solve();\n\tif (res == INF)\n\t\tres = -1;\n\n\tprintf(\"%d\\n\", res);\n\treturn 0;\n}", "language": "C", "metadata": {"date": 1477812601, "filename_ext": "c", "original_language": "C", "problem_description_relpath": "problem_descriptions/p02323.html", "problem_id": "p02323", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02323/input.txt", "sample_output_relpath": "derived/input_output/data/p02323/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02323/C/s594766967.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s594766967", "user_id": "u818887270"}, "prompt_components": {"gold_output": "16\n", "input_to_evaluate": "#include <stdio.h>          // printf(), scanf()\n\n#define MAX_V 15\n#define min(a, b) ((a) < (b) ? (a) : (b))\n\nstatic const int INF = 1000000000;\n\nint d[MAX_V][MAX_V];\nint dp[1 << MAX_V][MAX_V];\nint V;\n\nint\nsolve()\n{\n\tint S, u, v;\n\n\tfor (S = 0; S < (1 << V); ++S)\n\t{\n\t\tfor (v = 0; v < V; ++v)\n\t\t\tdp[S][v] = INF;\n\t}\n\n\tdp[(1 << V) - 1][0] = 0;\n\tfor (S = (1 << V) - 2; S >= 0; --S)\n\t{\n\t\tfor (v = 0; v < V; ++v)\n\t\t{\n\t\t\tfor (u = 0; u < V; ++u)\n\t\t\t{\n\t\t\t\tif (!(S >> u & 1))\n\t\t\t\t{\n\t\t\t\t\tint t = dp[S | (1 << u)][u] + d[v][u];\n\t\t\t\t\tdp[S][v] = min(dp[S][v], t);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n\treturn dp[0][0];\n}\n\nint\nmain(int argc, char** argv)\n{\n\tint E;\n\tint s, t, c;\n\tint i, j;\n\n\tscanf(\"%d %d\", &V, &E);\n\tfor (i = 0; i < V; ++i)\n\t{\n\t\tfor (j = 0; j < V; ++j)\n\t\t{\n\t\t\tif (i == j)\n\t\t\t\td[i][j] = 0;\n\t\t\telse\n\t\t\t\td[i][j] = INF;\n\t\t}\n\t}\n\n\tfor (i = 0; i < E; ++i)\n\t{\n\t\tscanf(\"%d %d %d\", &s, &t, &c);\n\t\td[s][t] = c;\n\t}\n\n\n\tint res = solve();\n\tif (res == INF)\n\t\tres = -1;\n\n\tprintf(\"%d\\n\", res);\n\treturn 0;\n}", "problem_context": "Traveling Salesman Problem\n\nFor a given weighted directed graph G(V, E), find the distance of the shortest route that meets the following criteria:\n\nIt is a closed cycle where it ends at the same point it starts.\n\nIt visits each vertex exactly once.\n\nInput\n\n|V| |E|\ns0 t0 d0\ns1 t1 d1\n:\ns|E|-1 t|E|-1 d|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\nsi and ti represent source and target vertices of i-th edge (directed) and di represents the distance between si and ti (the i-th edge).\n\nOutput\n\nPrint the shortest distance in a line. If there is no solution, print -1.\n\nConstraints\n\n2 ≤ |V| ≤ 15\n\n0 ≤ di ≤ 1,000\n\nThere are no multiedge\n\nSample Input 1\n\n4 6\n0 1 2\n1 2 3\n1 3 9\n2 0 1\n2 3 6\n3 2 4\n\nSample Output 1\n\n16\n\nSample Input 2\n\n3 3\n0 1 1\n1 2 1\n0 2 1\n\nSample Output 2\n\n-1", "sample_input": "4 6\n0 1 2\n1 2 3\n1 3 9\n2 0 1\n2 3 6\n3 2 4\n"}, "reference_outputs": ["16\n"], "source_document_id": "p02323", "source_text": "Traveling Salesman Problem\n\nFor a given weighted directed graph G(V, E), find the distance of the shortest route that meets the following criteria:\n\nIt is a closed cycle where it ends at the same point it starts.\n\nIt visits each vertex exactly once.\n\nInput\n\n|V| |E|\ns0 t0 d0\ns1 t1 d1\n:\ns|E|-1 t|E|-1 d|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\nsi and ti represent source and target vertices of i-th edge (directed) and di represents the distance between si and ti (the i-th edge).\n\nOutput\n\nPrint the shortest distance in a line. If there is no solution, print -1.\n\nConstraints\n\n2 ≤ |V| ≤ 15\n\n0 ≤ di ≤ 1,000\n\nThere are no multiedge\n\nSample Input 1\n\n4 6\n0 1 2\n1 2 3\n1 3 9\n2 0 1\n2 3 6\n3 2 4\n\nSample Output 1\n\n16\n\nSample Input 2\n\n3 3\n0 1 1\n1 2 1\n0 2 1\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": 973, "cpu_time_ms": 20, "memory_kb": 2520}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s599901828", "group_id": "codeNet:p02345", "input_text": "#include <stdio.h>\n#include <stdlib.h>\n\n#define INF 2147483647\n#define RMQ_SIZE 262144  // 2^18\n\nint tree[RMQ_SIZE];\n\nint dfs(int a, int b, int k, int l, int r);\nint find(int first, int second);\nvoid update(int pos, int value);\nint min(int a, int b);\n\n\nint main(void)\n{\n    int n, q, com, x, y, i;\n\n    scanf(\"%d %d\", &n ,&q);\n\n    for (i = 0; i < n; i++) {\n        update(i, INF);\n    }\n\n    for (i = 0; i < q; i++) {\n        scanf(\"%d %d %d\", &com, &x, &y);\n        if (com) {\n            printf(\"%d\\n\", find(x, y+1));\n        } else {\n            update(x, y);\n        }\n    }\n    \n    return 0;\n}\n\n/*\n * a??????b???????????????????????¢?´¢????????????????±????.\n * ?????¨???tree[k]???????????????.\n * tree[k]???l??????r?????§???????°?????????????.\n */\nint dfs(int a,int b,int k,int l,int r)\n{\n    int m;\n    //* a~b??¨l~r??????????????????????????¨????????¨?????????.\n    if (r <= a || b <= l) {\n        return INF;\n    }\n    //* tree[k]?????¬?????????????±?????????\\???a~b?????????????????¨???.\n    if (a <= l && r <= b) {\n        return tree[k];\n    }\n    m = (l+r)/2;\n    return min(dfs(a, b, k*2, l, m), dfs(a, b, k*2+1, m, r));\n}\n\n/*\n * ??????????????????[right,left)??§???????????¨?????¨???\n */\nint find(int right, int left)\n{\n    return dfs(right, left, 1, 0, RMQ_SIZE/2);\n}\n\n/*\n * pos?????????????????????value????????´??????.\n * ??????????????¨??¨?????????????????????.\n */\nvoid update(int pos, int value)\n{\n    pos += RMQ_SIZE/2;\n    tree[pos] = value;\n    /*\n     * ?????????????????§????°?????????´??°????????????.\n     * ???????????????????????????.\n     * ????????´????????´??°???????????????????????£???????????§return??????.\n     */\n    while (pos) {\n        pos = pos/2;\n        tree[pos] = min(tree[pos*2], tree[pos*2+1]);\n    }\n}\n\nint min(int a, int b)\n{\n    return a < b ? a: b;\n}", "language": "C", "metadata": {"date": 1480408954, "filename_ext": "c", "original_language": "C", "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/C/s599901828.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s599901828", "user_id": "u648717067"}, "prompt_components": {"gold_output": "1\n2\n", "input_to_evaluate": "#include <stdio.h>\n#include <stdlib.h>\n\n#define INF 2147483647\n#define RMQ_SIZE 262144  // 2^18\n\nint tree[RMQ_SIZE];\n\nint dfs(int a, int b, int k, int l, int r);\nint find(int first, int second);\nvoid update(int pos, int value);\nint min(int a, int b);\n\n\nint main(void)\n{\n    int n, q, com, x, y, i;\n\n    scanf(\"%d %d\", &n ,&q);\n\n    for (i = 0; i < n; i++) {\n        update(i, INF);\n    }\n\n    for (i = 0; i < q; i++) {\n        scanf(\"%d %d %d\", &com, &x, &y);\n        if (com) {\n            printf(\"%d\\n\", find(x, y+1));\n        } else {\n            update(x, y);\n        }\n    }\n    \n    return 0;\n}\n\n/*\n * a??????b???????????????????????¢?´¢????????????????±????.\n * ?????¨???tree[k]???????????????.\n * tree[k]???l??????r?????§???????°?????????????.\n */\nint dfs(int a,int b,int k,int l,int r)\n{\n    int m;\n    //* a~b??¨l~r??????????????????????????¨????????¨?????????.\n    if (r <= a || b <= l) {\n        return INF;\n    }\n    //* tree[k]?????¬?????????????±?????????\\???a~b?????????????????¨???.\n    if (a <= l && r <= b) {\n        return tree[k];\n    }\n    m = (l+r)/2;\n    return min(dfs(a, b, k*2, l, m), dfs(a, b, k*2+1, m, r));\n}\n\n/*\n * ??????????????????[right,left)??§???????????¨?????¨???\n */\nint find(int right, int left)\n{\n    return dfs(right, left, 1, 0, RMQ_SIZE/2);\n}\n\n/*\n * pos?????????????????????value????????´??????.\n * ??????????????¨??¨?????????????????????.\n */\nvoid update(int pos, int value)\n{\n    pos += RMQ_SIZE/2;\n    tree[pos] = value;\n    /*\n     * ?????????????????§????°?????????´??°????????????.\n     * ???????????????????????????.\n     * ????????´????????´??°???????????????????????£???????????§return??????.\n     */\n    while (pos) {\n        pos = pos/2;\n        tree[pos] = min(tree[pos*2], tree[pos*2+1]);\n    }\n}\n\nint min(int a, int b)\n{\n    return a < b ? a: b;\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": 1832, "cpu_time_ms": 50, "memory_kb": 1412}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s331401913", "group_id": "codeNet:p02361", "input_text": "// AOJ GRL_1_A Shortest Path - Single Source Shortest Path\n// 2018.4.26 bal4u\n\n#include <stdio.h>\n#include <stdlib.h>\n#include <string.h>\n\n#define QMAX 150000\ntypedef struct { int t, s; } QUE;\nQUE que[QMAX]; int qsize;\n\n#define PARENT(i) ((i)>>1)\n#define LEFT(i)   ((i)<<1)\n#define RIGHT(i)  (((i)<<1)+1)\n\nvoid min_heapify(int i)\n{\n\tint l, r, min;\n\tQUE qt;\n\n\tl = LEFT(i), r = RIGHT(i);\n\tif (l < qsize && que[l].t < que[i].t) min = l; else min = i;\n\tif (r < qsize && que[r].t < que[min].t) min = r;\n\tif (min != i) {\n\t\tqt = que[i], que[i] = que[min], que[min] = qt;\n\t\tmin_heapify(min);\n\t}\n}\n\nvoid deq()\n{\n\tque[0] = que[--qsize];\n\tmin_heapify(0);\n}\n\nvoid enq(int s, int t)\n{\n\tint i, min;\n\tQUE qt;\n\n\ti = qsize++;\n\tque[i].s = s, que[i].t = t;\n\twhile (i > 0 && que[min = PARENT(i)].t > que[i].t) {\n\t\tqt = que[i], que[i] = que[min], que[min] = qt;\n\t\ti = min;\n\t}\n}\n\n// バッファを経ずstdinから数値を得る\n//#define getchar_unlocked()  getchar()\nint in()\n{\n\tint n = 0, c = getchar_unlocked();\n\tdo n = 10*n + (c & 0xf), c = getchar_unlocked(); while (c >= '0');\n\treturn n;\n}\n\n#define INF  0x70707070\n#define MAX_V  100002\nint V;  // 頂点数\nint hi[MAX_V], *to[MAX_V], *d[MAX_V];\nint dist[MAX_V];\n\nvoid dijkstra(int start)\n{\n\tint i, s, e, t, nt;\n\n\tmemset(dist, INF, V<<2);\n\tqsize = 0;\n\tdist[start] = 0, enq(start, 0);\n\twhile (qsize) {\n\t\ts = que[0].s, t = que[0].t, deq();\n\t\tif (dist[s] < t) continue;\n\t\tfor (i = 0; i < hi[s]; i++) {\n\t\t\te = to[s][i], nt = t + d[s][i];\n\t\t\tif (dist[e] > nt) dist[e] = nt, enq(e, nt);\n\t\t}\n\t}\n}\n\nint main()\n{\n\tint E, r, i, j, k, s;\n\tint *memo;\n\n\tV = in(), E = in(), r = in();\n\tmemo = malloc(sizeof(int)*3*E);\n\tj = 0; for (i = 0; i < E; i++) {\n\t\tmemo[j++] = s = in(), hi[s]++;\n\t\tmemo[j++] = in(), memo[j++] = in();\n\t}\n\tfor (i = 0; i < V; i++) {\n\t\tif (hi[i]) to[i] = malloc(hi[i]<<2), d[i] = malloc(hi[i]<<2);\n\t}\n\tmemset(hi, 0, V<<2);\n\tj = 0; while (E--) {\n\t\ts = memo[j++];\n\t\tk = hi[s]++, to[s][k] = memo[j++], d[s][k] = memo[j++];\n\t}\n\tdijkstra(r);\n\tfor (i = 0; i < V; i++) {\n\t\tif (dist[i] == INF) puts(\"INF\");\n\t\telse printf(\"%d\\n\", dist[i]);\n\t}\n\treturn 0;\n}\n\n\n", "language": "C", "metadata": {"date": 1524729367, "filename_ext": "c", "original_language": "C", "problem_description_relpath": "problem_descriptions/p02361.html", "problem_id": "p02361", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02361/input.txt", "sample_output_relpath": "derived/input_output/data/p02361/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02361/C/s331401913.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s331401913", "user_id": "u847467233"}, "prompt_components": {"gold_output": "0\n1\n3\n4\n", "input_to_evaluate": "// AOJ GRL_1_A Shortest Path - Single Source Shortest Path\n// 2018.4.26 bal4u\n\n#include <stdio.h>\n#include <stdlib.h>\n#include <string.h>\n\n#define QMAX 150000\ntypedef struct { int t, s; } QUE;\nQUE que[QMAX]; int qsize;\n\n#define PARENT(i) ((i)>>1)\n#define LEFT(i)   ((i)<<1)\n#define RIGHT(i)  (((i)<<1)+1)\n\nvoid min_heapify(int i)\n{\n\tint l, r, min;\n\tQUE qt;\n\n\tl = LEFT(i), r = RIGHT(i);\n\tif (l < qsize && que[l].t < que[i].t) min = l; else min = i;\n\tif (r < qsize && que[r].t < que[min].t) min = r;\n\tif (min != i) {\n\t\tqt = que[i], que[i] = que[min], que[min] = qt;\n\t\tmin_heapify(min);\n\t}\n}\n\nvoid deq()\n{\n\tque[0] = que[--qsize];\n\tmin_heapify(0);\n}\n\nvoid enq(int s, int t)\n{\n\tint i, min;\n\tQUE qt;\n\n\ti = qsize++;\n\tque[i].s = s, que[i].t = t;\n\twhile (i > 0 && que[min = PARENT(i)].t > que[i].t) {\n\t\tqt = que[i], que[i] = que[min], que[min] = qt;\n\t\ti = min;\n\t}\n}\n\n// バッファを経ずstdinから数値を得る\n//#define getchar_unlocked()  getchar()\nint in()\n{\n\tint n = 0, c = getchar_unlocked();\n\tdo n = 10*n + (c & 0xf), c = getchar_unlocked(); while (c >= '0');\n\treturn n;\n}\n\n#define INF  0x70707070\n#define MAX_V  100002\nint V;  // 頂点数\nint hi[MAX_V], *to[MAX_V], *d[MAX_V];\nint dist[MAX_V];\n\nvoid dijkstra(int start)\n{\n\tint i, s, e, t, nt;\n\n\tmemset(dist, INF, V<<2);\n\tqsize = 0;\n\tdist[start] = 0, enq(start, 0);\n\twhile (qsize) {\n\t\ts = que[0].s, t = que[0].t, deq();\n\t\tif (dist[s] < t) continue;\n\t\tfor (i = 0; i < hi[s]; i++) {\n\t\t\te = to[s][i], nt = t + d[s][i];\n\t\t\tif (dist[e] > nt) dist[e] = nt, enq(e, nt);\n\t\t}\n\t}\n}\n\nint main()\n{\n\tint E, r, i, j, k, s;\n\tint *memo;\n\n\tV = in(), E = in(), r = in();\n\tmemo = malloc(sizeof(int)*3*E);\n\tj = 0; for (i = 0; i < E; i++) {\n\t\tmemo[j++] = s = in(), hi[s]++;\n\t\tmemo[j++] = in(), memo[j++] = in();\n\t}\n\tfor (i = 0; i < V; i++) {\n\t\tif (hi[i]) to[i] = malloc(hi[i]<<2), d[i] = malloc(hi[i]<<2);\n\t}\n\tmemset(hi, 0, V<<2);\n\tj = 0; while (E--) {\n\t\ts = memo[j++];\n\t\tk = hi[s]++, to[s][k] = memo[j++], d[s][k] = memo[j++];\n\t}\n\tdijkstra(r);\n\tfor (i = 0; i < V; i++) {\n\t\tif (dist[i] == INF) puts(\"INF\");\n\t\telse printf(\"%d\\n\", dist[i]);\n\t}\n\treturn 0;\n}\n\n\n", "problem_context": "Single Source Shortest Path\n\nFor a given weighted graph G(V, E) and a source r, find the source shortest path to each vertex from the source (SSSP: Single Source Shortest Path).\n\nInput\n\nAn edge-weighted graph G (V, E) and the source r.\n\n|V| |E| r\ns0 t0 d0\ns1 t1 d1\n:\ns|E|-1 t|E|-1 d|E|-1\n\n|V| is the number of vertices and |E| is the number of edges in G. The graph vertices are named with the numbers 0, 1,..., |V|-1 respectively. r is the source of the graph.\n\nsi and ti represent source and target vertices of i-th edge (directed) and di represents the cost of the i-th edge.\n\nOutput\n\nPrint the costs of SSSP in the following format.\n\nc0\nc1\n:\nc|V|-1\n\nThe output consists of |V| lines. Print the cost of the shortest path from the source r to each vertex 0, 1, ... |V|-1 in order. If there is no path from the source to a vertex, print INF.\n\nConstraints\n\n1 ≤ |V| ≤ 100000\n\n0 ≤ di ≤ 10000\n\n0 ≤ |E| ≤ 500000\n\nThere are no parallel edges\n\nThere are no self-loops\n\nSample Input 1\n\n4 5 0\n0 1 1\n0 2 4\n1 2 2\n2 3 1\n1 3 5\n\nSample Output 1\n\n0\n1\n3\n4\n\nSample Input 2\n\n4 6 1\n0 1 1\n0 2 4\n2 0 1\n1 2 2\n3 1 1\n3 2 5\n\nSample Output 2\n\n3\n0\n2\nINF", "sample_input": "4 5 0\n0 1 1\n0 2 4\n1 2 2\n2 3 1\n1 3 5\n"}, "reference_outputs": ["0\n1\n3\n4\n"], "source_document_id": "p02361", "source_text": "Single Source Shortest Path\n\nFor a given weighted graph G(V, E) and a source r, find the source shortest path to each vertex from the source (SSSP: Single Source Shortest Path).\n\nInput\n\nAn edge-weighted graph G (V, E) and the source r.\n\n|V| |E| r\ns0 t0 d0\ns1 t1 d1\n:\ns|E|-1 t|E|-1 d|E|-1\n\n|V| is the number of vertices and |E| is the number of edges in G. The graph vertices are named with the numbers 0, 1,..., |V|-1 respectively. r is the source of the graph.\n\nsi and ti represent source and target vertices of i-th edge (directed) and di represents the cost of the i-th edge.\n\nOutput\n\nPrint the costs of SSSP in the following format.\n\nc0\nc1\n:\nc|V|-1\n\nThe output consists of |V| lines. Print the cost of the shortest path from the source r to each vertex 0, 1, ... |V|-1 in order. If there is no path from the source to a vertex, print INF.\n\nConstraints\n\n1 ≤ |V| ≤ 100000\n\n0 ≤ di ≤ 10000\n\n0 ≤ |E| ≤ 500000\n\nThere are no parallel edges\n\nThere are no self-loops\n\nSample Input 1\n\n4 5 0\n0 1 1\n0 2 4\n1 2 2\n2 3 1\n1 3 5\n\nSample Output 1\n\n0\n1\n3\n4\n\nSample Input 2\n\n4 6 1\n0 1 1\n0 2 4\n2 0 1\n1 2 2\n3 1 1\n3 2 5\n\nSample Output 2\n\n3\n0\n2\nINF", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 2091, "cpu_time_ms": 50, "memory_kb": 17036}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s232936150", "group_id": "codeNet:p02373", "input_text": "#include<stdio.h>\nint T,S[4*200010],N[200010];\nint MIN(int a,int b){return a<b?a:b;}\nint MAX(int a,int b){return a<b?b:a;}\n//????????¢??°?????????MIN???\nint hyoka(int a,int b){return (a<0||b<0)?(a<0?b:a):N[a]<N[b]?a:b;}\n//?????°??¨?????????n?????°???d??§?????????????§????\nvoid sset(int n){\n  int i;\n  for(T=1;T<n;T*=2);\n  for(i=0;i<T;i++)S[T+i]=i<n?i:-1;\n  for(i=T-1;i;i--)S[i]=hyoka(S[i*2],S[i*2+1]);\n}\n//?????°??¨???update??¢??°\n//i???????????°??????n????????´???????§????\nvoid sud(int i,int n){for(N[i+=T]=n;i/=2;)S[i]=hyoka(S[i*2],S[i*2+1]);}\n//?????°??¨???find??¢??°\n//[a,b)????????????????????????sout(a,b,1,0,T);\nint sout(int a,int b,int i,int l,int r){//printf(\"%d %d %d %d %d\\n\",a,b,i,l,r);\n  if(r<=a||b<=l)return -1;\n  if(a<=l&&r<=b)return S[i];\n  return hyoka(sout(a,b,i*2,l,(l+r)/2),sout(a,b,i*2+1,(l+r)/2,r));\n}\nint ta[100010],to[100010],nt[100010],d[100010],r=0,fi[100010],ID[200010];\nvoid ldfs(int s){\n  int i;\n  N[fi[s]=r]=d[s];\n  ID[r++]=s;\n  for(i=ta[s];i+1;i=nt[i]){\n    if(fi[to[i]])continue;\n    d[to[i]]=d[s]+1;\n    ldfs(to[i]);\n    N[r]=d[s];\n    ID[r++]=s;\n  }\n}\nvoid slca(int p){\n  d[p]=1;\n  r=0;\n  ldfs(p);\n  sset(r);\n}\nint alca(int a,int b){return sout(MIN(fi[a],fi[b]),MAX(fi[a],fi[b])+1,1,0,T);}\nint main(){\n  int n,m,i,j,e=0;\n  scanf(\"%d\",&n);\n  for(i=0;i<n;i++)ta[i]=-1;\n  for(i=0;i<n;i++){\n    scanf(\"%d\",&m);\n    while(m--){\n      scanf(\"%d\",&j);\n      nt[e]=ta[i];\n      to[e]=j;\n      ta[i]=e++;\n    }\n  }\n  slca(0);\n  scanf(\"%d\",&n);\n  while(n--){\n    scanf(\"%d %d\",&i,&j);\n    printf(\"%d\\n\",ID[alca(i,j)]);\n  }\n  return 0;\n}", "language": "C", "metadata": {"date": 1476920018, "filename_ext": "c", "original_language": "C", "problem_description_relpath": "problem_descriptions/p02373.html", "problem_id": "p02373", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02373/input.txt", "sample_output_relpath": "derived/input_output/data/p02373/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02373/C/s232936150.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s232936150", "user_id": "u731027244"}, "prompt_components": {"gold_output": "1\n1\n0\n0\n", "input_to_evaluate": "#include<stdio.h>\nint T,S[4*200010],N[200010];\nint MIN(int a,int b){return a<b?a:b;}\nint MAX(int a,int b){return a<b?b:a;}\n//????????¢??°?????????MIN???\nint hyoka(int a,int b){return (a<0||b<0)?(a<0?b:a):N[a]<N[b]?a:b;}\n//?????°??¨?????????n?????°???d??§?????????????§????\nvoid sset(int n){\n  int i;\n  for(T=1;T<n;T*=2);\n  for(i=0;i<T;i++)S[T+i]=i<n?i:-1;\n  for(i=T-1;i;i--)S[i]=hyoka(S[i*2],S[i*2+1]);\n}\n//?????°??¨???update??¢??°\n//i???????????°??????n????????´???????§????\nvoid sud(int i,int n){for(N[i+=T]=n;i/=2;)S[i]=hyoka(S[i*2],S[i*2+1]);}\n//?????°??¨???find??¢??°\n//[a,b)????????????????????????sout(a,b,1,0,T);\nint sout(int a,int b,int i,int l,int r){//printf(\"%d %d %d %d %d\\n\",a,b,i,l,r);\n  if(r<=a||b<=l)return -1;\n  if(a<=l&&r<=b)return S[i];\n  return hyoka(sout(a,b,i*2,l,(l+r)/2),sout(a,b,i*2+1,(l+r)/2,r));\n}\nint ta[100010],to[100010],nt[100010],d[100010],r=0,fi[100010],ID[200010];\nvoid ldfs(int s){\n  int i;\n  N[fi[s]=r]=d[s];\n  ID[r++]=s;\n  for(i=ta[s];i+1;i=nt[i]){\n    if(fi[to[i]])continue;\n    d[to[i]]=d[s]+1;\n    ldfs(to[i]);\n    N[r]=d[s];\n    ID[r++]=s;\n  }\n}\nvoid slca(int p){\n  d[p]=1;\n  r=0;\n  ldfs(p);\n  sset(r);\n}\nint alca(int a,int b){return sout(MIN(fi[a],fi[b]),MAX(fi[a],fi[b])+1,1,0,T);}\nint main(){\n  int n,m,i,j,e=0;\n  scanf(\"%d\",&n);\n  for(i=0;i<n;i++)ta[i]=-1;\n  for(i=0;i<n;i++){\n    scanf(\"%d\",&m);\n    while(m--){\n      scanf(\"%d\",&j);\n      nt[e]=ta[i];\n      to[e]=j;\n      ta[i]=e++;\n    }\n  }\n  slca(0);\n  scanf(\"%d\",&n);\n  while(n--){\n    scanf(\"%d %d\",&i,&j);\n    printf(\"%d\\n\",ID[alca(i,j)]);\n  }\n  return 0;\n}", "problem_context": "LCA: Lowest Common Ancestor\n\nFor a rooted tree, find the lowest common ancestor of two nodes u and v.\n\nThe given tree consists of n nodes and every node has a unique ID from 0 to n-1 where 0 is the root.\n\nInput\n\nn\nk0 c1 c2 ... ck0\nk1 c1 c2 ... ck1\n:\nkn-1 c1 c2 ... ckn-1\nq\nu1 v1\nu2 v2\n:\nuq vq\n\nThe first line of the input includes an integer n, the number of nodes of the tree.\n\nIn the next n lines, the information of node i is given. ki is the number of children of node i, and c1, ... cki are node IDs of 1st, ... kth child of node i.\n\nIn the next line, the number of queryies q is given. In the next q lines, pairs of u and v are given as the queries.\n\nOutput\n\nFor each query, print the LCA of u and v in a line.\n\nConstraints\n\n1 ≤ n ≤ 100000\n\n1 ≤ q ≤ 100000\n\nSample Input 1\n\n8\n3 1 2 3\n2 4 5\n0\n0\n0\n2 6 7\n0\n0\n4\n4 6\n4 7\n4 3\n5 2\n\nSample Output 1\n\n1\n1\n0\n0", "sample_input": "8\n3 1 2 3\n2 4 5\n0\n0\n0\n2 6 7\n0\n0\n4\n4 6\n4 7\n4 3\n5 2\n"}, "reference_outputs": ["1\n1\n0\n0\n"], "source_document_id": "p02373", "source_text": "LCA: Lowest Common Ancestor\n\nFor a rooted tree, find the lowest common ancestor of two nodes u and v.\n\nThe given tree consists of n nodes and every node has a unique ID from 0 to n-1 where 0 is the root.\n\nInput\n\nn\nk0 c1 c2 ... ck0\nk1 c1 c2 ... ck1\n:\nkn-1 c1 c2 ... ckn-1\nq\nu1 v1\nu2 v2\n:\nuq vq\n\nThe first line of the input includes an integer n, the number of nodes of the tree.\n\nIn the next n lines, the information of node i is given. ki is the number of children of node i, and c1, ... cki are node IDs of 1st, ... kth child of node i.\n\nIn the next line, the number of queryies q is given. In the next q lines, pairs of u and v are given as the queries.\n\nOutput\n\nFor each query, print the LCA of u and v in a line.\n\nConstraints\n\n1 ≤ n ≤ 100000\n\n1 ≤ q ≤ 100000\n\nSample Input 1\n\n8\n3 1 2 3\n2 4 5\n0\n0\n0\n2 6 7\n0\n0\n4\n4 6\n4 7\n4 3\n5 2\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": 1580, "cpu_time_ms": 100, "memory_kb": 10360}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s081185320", "group_id": "codeNet:p02396", "input_text": "#include <stdio.h>\n\nint main( void )\n{\n\tint i, x;\n\t\n\tscanf( \"%d\", &x );\n\t\n\tfor( i = 1; x != 0; i++ ){\n\t\tprintf( \"Case %d: %d\\n\", i, x );\n\t}\n\t\n\treturn 0;\n}", "language": "C", "metadata": {"date": 1422704246, "filename_ext": "c", "original_language": "C", "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/C/s081185320.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s081185320", "user_id": "u796834420"}, "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": "#include <stdio.h>\n\nint main( void )\n{\n\tint i, x;\n\t\n\tscanf( \"%d\", &x );\n\t\n\tfor( i = 1; x != 0; i++ ){\n\t\tprintf( \"Case %d: %d\\n\", i, x );\n\t}\n\t\n\treturn 0;\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": 154, "cpu_time_ms": 20000, "memory_kb": 588}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s440076943", "group_id": "codeNet:p02398", "input_text": "#include <stdio.h>\n\nint main()\n{\n    int a, b, c;\n    int i, cnt;\n    scanf(\"%d %d %d\", &a, &b, &c);\n    \n    cnt = 0;\n    for (i=a; i=b; i++) {\n        if(i/c == 0) cnt++;\n    }\n    return 0;\n}\n", "language": "C", "metadata": {"date": 1546372642, "filename_ext": "c", "original_language": "C", "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/C/s440076943.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s440076943", "user_id": "u236075884"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "#include <stdio.h>\n\nint main()\n{\n    int a, b, c;\n    int i, cnt;\n    scanf(\"%d %d %d\", &a, &b, &c);\n    \n    cnt = 0;\n    for (i=a; i=b; i++) {\n        if(i/c == 0) cnt++;\n    }\n    return 0;\n}\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": 195, "cpu_time_ms": 1990, "memory_kb": 2040}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s677397763", "group_id": "codeNet:p02402", "input_text": "#include<stdio.h>\nint main(){\n\tlong long a,b[10001],i,j,x,ans,ans2,ans3=0;\n\tscanf(\"%lld\",&a);\n\tfor(i=0;i<a;i++){\n\t\tscanf(\"%lld\",&b[i]);\n\t\tans3=ans3+b[i];\n\t}\n\tfor(i=0;i<a;i++){\n\t\tfor(j=i;j<a;j++){\n\t\t\tif(b[i]>b[j]){\n\t\t\t\tx=b[i];\n\t\t\t\tb[i]=b[j];\n\t\t\t\tb[j]=x;\n\t\t\t}\n\t\t}\n\t}\n\tans=b[0];\n\tans2=b[a-1];\n\tprintf(\"%lld %lld %lld\\n\",ans,ans2,ans3);\n\treturn 0;\n}\n", "language": "C", "metadata": {"date": 1533713006, "filename_ext": "c", "original_language": "C", "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/C/s677397763.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s677397763", "user_id": "u390505413"}, "prompt_components": {"gold_output": "1 17 37\n", "input_to_evaluate": "#include<stdio.h>\nint main(){\n\tlong long a,b[10001],i,j,x,ans,ans2,ans3=0;\n\tscanf(\"%lld\",&a);\n\tfor(i=0;i<a;i++){\n\t\tscanf(\"%lld\",&b[i]);\n\t\tans3=ans3+b[i];\n\t}\n\tfor(i=0;i<a;i++){\n\t\tfor(j=i;j<a;j++){\n\t\t\tif(b[i]>b[j]){\n\t\t\t\tx=b[i];\n\t\t\t\tb[i]=b[j];\n\t\t\t\tb[j]=x;\n\t\t\t}\n\t\t}\n\t}\n\tans=b[0];\n\tans2=b[a-1];\n\tprintf(\"%lld %lld %lld\\n\",ans,ans2,ans3);\n\treturn 0;\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": 346, "cpu_time_ms": 120, "memory_kb": 2108}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s399243692", "group_id": "codeNet:p02412", "input_text": "#include <stdio.h>\n\nint main()\n{\n   int n[100], x, i, j, k, c, s;\n   c = 0;\n\n   for (i = 0; i++; n==0 && x == 0) {\n      scanf(\"%d %d\", &n[i], &x);\n   }\n\n   for (i = 1; i++; i <= n - 2) {\n      for (j = 2; j++; j <= n - 1) {\n         for (k = 3; k++; k <= n) {\n            s = i + j + k;\n            if (s == x) {\n               c++;\n            }\n         }\n      }\n   }\n\n   printf(\"%d\", c);\n\n   return 0;\n}", "language": "C", "metadata": {"date": 1479865684, "filename_ext": "c", "original_language": "C", "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/C/s399243692.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s399243692", "user_id": "u539480202"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "#include <stdio.h>\n\nint main()\n{\n   int n[100], x, i, j, k, c, s;\n   c = 0;\n\n   for (i = 0; i++; n==0 && x == 0) {\n      scanf(\"%d %d\", &n[i], &x);\n   }\n\n   for (i = 1; i++; i <= n - 2) {\n      for (j = 2; j++; j <= n - 1) {\n         for (k = 3; k++; k <= n) {\n            s = i + j + k;\n            if (s == x) {\n               c++;\n            }\n         }\n      }\n   }\n\n   printf(\"%d\", c);\n\n   return 0;\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": 408, "cpu_time_ms": 20000, "memory_kb": 524}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s148386800", "group_id": "codeNet:p02418", "input_text": "#include<stdio.h>\n#include<string.h>\n\nint main () {\n   char s[100], t[100];\n   int i, j, sn, tn;\n\n   scanf(\"%s\", s);\n   scanf(\"%s\", t);\n\n   sn = strlen(s);\n   tn = strlen(t);\n\n   for (i = 0 ; ;i++) {\n     for (j = 0; j < tn; j++) {\n       if (s[i] != t[j]) {\n         break;\n       }\n     }\n   }\n\n   if(tn == j-1) {\n     printf(\"Yes\\n\");\n   }  else {\n       printf(\"No\\n\");\n      }\n\n   return 0;\n}\n   ", "language": "C", "metadata": {"date": 1480473778, "filename_ext": "c", "original_language": "C", "problem_description_relpath": "problem_descriptions/p02418.html", "problem_id": "p02418", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02418/input.txt", "sample_output_relpath": "derived/input_output/data/p02418/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02418/C/s148386800.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s148386800", "user_id": "u367745940"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "#include<stdio.h>\n#include<string.h>\n\nint main () {\n   char s[100], t[100];\n   int i, j, sn, tn;\n\n   scanf(\"%s\", s);\n   scanf(\"%s\", t);\n\n   sn = strlen(s);\n   tn = strlen(t);\n\n   for (i = 0 ; ;i++) {\n     for (j = 0; j < tn; j++) {\n       if (s[i] != t[j]) {\n         break;\n       }\n     }\n   }\n\n   if(tn == j-1) {\n     printf(\"Yes\\n\");\n   }  else {\n       printf(\"No\\n\");\n      }\n\n   return 0;\n}\n   ", "problem_context": "MathJax.Hub.Config({ tex2jax: { inlineMath: [[\"$\",\"$\"], [\"\\\\(\",\"\\\\)\"]], processEscapes: true }});\n\nRing\n\nWrite a program which finds a pattern $p$ in a ring shaped text $s$.\n\nInput\n\nIn the first line, the text $s$ is given.\n\nIn the second line, the pattern $p$ is given.\n\nOutput\n\nIf $p$ is in $s$, print Yes in a line, otherwise No.\n\nConstraints\n\n$1 \\leq $ length of $p \\leq $ length of $s \\leq 100$\n\n$s$ and $p$ consists of lower-case letters\n\nSample Input 1\n\nvanceknowledgetoad\nadvance\n\nSample Output 1\n\nYes\n\nSample Input 2\n\nvanceknowledgetoad\nadvanced\n\nSample Output 2\n\nNo", "sample_input": "vanceknowledgetoad\nadvance\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p02418", "source_text": "MathJax.Hub.Config({ tex2jax: { inlineMath: [[\"$\",\"$\"], [\"\\\\(\",\"\\\\)\"]], processEscapes: true }});\n\nRing\n\nWrite a program which finds a pattern $p$ in a ring shaped text $s$.\n\nInput\n\nIn the first line, the text $s$ is given.\n\nIn the second line, the pattern $p$ is given.\n\nOutput\n\nIf $p$ is in $s$, print Yes in a line, otherwise No.\n\nConstraints\n\n$1 \\leq $ length of $p \\leq $ length of $s \\leq 100$\n\n$s$ and $p$ consists of lower-case letters\n\nSample Input 1\n\nvanceknowledgetoad\nadvance\n\nSample Output 1\n\nYes\n\nSample Input 2\n\nvanceknowledgetoad\nadvanced\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": 401, "cpu_time_ms": 20000, "memory_kb": 524}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s334119246", "group_id": "codeNet:p02467", "input_text": "#include <stdio.h>\n\n#define PRIME_MAX 1000000\nint getprimes(int list[], int top){\n    int i, j;\n    int index = 0;\n    char tmp[PRIME_MAX];\n\n    for(i=0;i<top;i++) {\n        tmp[i] = 1;\n    }\n   \n    tmp[0] = tmp[1] = 0;\n    for(i=2;i<top;i++) {\n        if(tmp[i] == 1) {\n            /* 素数 */\n            list[index] = i;\n            index ++;\n            for(j=2;j*i<top;j++) {\n                tmp[j*i] = 0;\n            }\n        }\n    }\n\n    list[index] = -1;\n    return index;\n}\n\nint main(void) {\n    int i, c;\n    int n, base;\n    int size;\n    int primes[100000];\n    int div[1000];\n    int d;\n    size = getprimes(primes, PRIME_MAX);\n   \n    while(scanf(\"%d\\n\", &base) == 1) {\n        i = d = 0;\n        n = base;\n        while(n > 1) {\n        \tif((n % primes[i]) == 0) {\n        \t\tdiv[d] = primes[i];\n        \t\tn /= primes[i];\n        \t\td++;\n        \t} else {\n        \t\ti++;\n        \t}\n        \t\n        \tif(i >= size) {\n        \t\tdiv[d] = n;\n        \t\td++;\n        \t\tbreak;\n        \t}\n        }\n        \n        printf(\"%d:\", base);\n        for(i=0;i<d;i++) {\n        \tprintf(\" %d\", div[i]);\n        }\n        printf(\"\\n\");\n    }\n   \n    return 0;\n}", "language": "C", "metadata": {"date": 1399647984, "filename_ext": "c", "original_language": "C", "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/C/s334119246.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s334119246", "user_id": "u703161091"}, "prompt_components": {"gold_output": "12: 2 2 3\n", "input_to_evaluate": "#include <stdio.h>\n\n#define PRIME_MAX 1000000\nint getprimes(int list[], int top){\n    int i, j;\n    int index = 0;\n    char tmp[PRIME_MAX];\n\n    for(i=0;i<top;i++) {\n        tmp[i] = 1;\n    }\n   \n    tmp[0] = tmp[1] = 0;\n    for(i=2;i<top;i++) {\n        if(tmp[i] == 1) {\n            /* 素数 */\n            list[index] = i;\n            index ++;\n            for(j=2;j*i<top;j++) {\n                tmp[j*i] = 0;\n            }\n        }\n    }\n\n    list[index] = -1;\n    return index;\n}\n\nint main(void) {\n    int i, c;\n    int n, base;\n    int size;\n    int primes[100000];\n    int div[1000];\n    int d;\n    size = getprimes(primes, PRIME_MAX);\n   \n    while(scanf(\"%d\\n\", &base) == 1) {\n        i = d = 0;\n        n = base;\n        while(n > 1) {\n        \tif((n % primes[i]) == 0) {\n        \t\tdiv[d] = primes[i];\n        \t\tn /= primes[i];\n        \t\td++;\n        \t} else {\n        \t\ti++;\n        \t}\n        \t\n        \tif(i >= size) {\n        \t\tdiv[d] = n;\n        \t\td++;\n        \t\tbreak;\n        \t}\n        }\n        \n        printf(\"%d:\", base);\n        for(i=0;i<d;i++) {\n        \tprintf(\" %d\", div[i]);\n        }\n        printf(\"\\n\");\n    }\n   \n    return 0;\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": 1162, "cpu_time_ms": 10, "memory_kb": 1892}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s733656837", "group_id": "codeNet:p02534", "input_text": "#include <stdio.h>\n\n#include <string.h>\n\nint main() {\n\n    char acl[20];\n\n    int k;\n\n    scanf(\"%d\", &k);\n\n    \n\n    for(int i = 0; i<k; i++){\n\n        strcat(acl, \"ACL\");\n\n    }\n\n    \n\n    printf(\"%s\", acl);\n\n    return 0;\n\n}", "language": "C", "metadata": {"date": 1601169030, "filename_ext": "c", "original_language": "C (GCC 9.2.1)", "problem_description_relpath": "problem_descriptions/p02534.html", "problem_id": "p02534", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02534/input.txt", "sample_output_relpath": "derived/input_output/data/p02534/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02534/C/s733656837.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s733656837", "user_id": "u727844432"}, "prompt_components": {"gold_output": "ACLACLACL\n", "input_to_evaluate": "#include <stdio.h>\n\n#include <string.h>\n\nint main() {\n\n    char acl[20];\n\n    int k;\n\n    scanf(\"%d\", &k);\n\n    \n\n    for(int i = 0; i<k; i++){\n\n        strcat(acl, \"ACL\");\n\n    }\n\n    \n\n    printf(\"%s\", acl);\n\n    return 0;\n\n}", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou are given an integer K.\nPrint the string obtained by repeating the string ACL K times and concatenating them.\n\nFor example, if K = 3, print ACLACLACL.\n\nConstraints\n\n1 \\leq K \\leq 5\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nK\n\nOutput\n\nPrint the string obtained by repeating the string ACL K times and concatenating them.\n\nSample Input 1\n\n3\n\nSample Output 1\n\nACLACLACL", "sample_input": "3\n"}, "reference_outputs": ["ACLACLACL\n"], "source_document_id": "p02534", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou are given an integer K.\nPrint the string obtained by repeating the string ACL K times and concatenating them.\n\nFor example, if K = 3, print ACLACLACL.\n\nConstraints\n\n1 \\leq K \\leq 5\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nK\n\nOutput\n\nPrint the string obtained by repeating the string ACL K times and concatenating them.\n\nSample Input 1\n\n3\n\nSample Output 1\n\nACLACLACL", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 227, "cpu_time_ms": 107, "memory_kb": 1652}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s517695333", "group_id": "codeNet:p02546", "input_text": "#include<stdio.h>\n#include<string.h>\nint main(void){\n    char name[100];\n    scanf(\"%s\", name);\n    int length = strlen(name) - 1;\n    char l = name[length];\n    if(l != 's'){\n        name[length + 1] = 's';\n        name[length + 2] = '\\0';\n    }\n    else if(l == 's'){\n        name[length] = 'e';\n        name[length + 1] = 's';\n        name[length + 2] = '\\0';\n    }\n    printf(\"%s\", name);\n    return 0;\n}", "language": "C", "metadata": {"date": 1600542695, "filename_ext": "c", "original_language": "C (GCC 9.2.1)", "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/C/s517695333.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s517695333", "user_id": "u131620462"}, "prompt_components": {"gold_output": "apples\n", "input_to_evaluate": "#include<stdio.h>\n#include<string.h>\nint main(void){\n    char name[100];\n    scanf(\"%s\", name);\n    int length = strlen(name) - 1;\n    char l = name[length];\n    if(l != 's'){\n        name[length + 1] = 's';\n        name[length + 2] = '\\0';\n    }\n    else if(l == 's'){\n        name[length] = 'e';\n        name[length + 1] = 's';\n        name[length + 2] = '\\0';\n    }\n    printf(\"%s\", name);\n    return 0;\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": 408, "cpu_time_ms": 132, "memory_kb": 1708}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s876244695", "group_id": "codeNet:p02547", "input_text": "#include <stdio.h>\n\nint main() {\n\tint N,i,D1,count=0,D2,MAX=0;\n\tscanf(\"%d\", &N);\n\tfor (i = 0; i < N; i++) {\n\t\tscanf(\"%d %d\", &D1, &D2);\n\t\tif (D1 == D2) {\n\t\t\tcount = count + 1;\n\t\t\tif (MAX < count) {\n\t\t\t\tMAX = count;\n\t\t\t}\n\t\t}\n\t\telse {\n\t\t\tcount = 0;\n\t\t}\n\t}\n\tif (MAX >= 3) {\n\t\tprintf(\"Yes\");\n\t}\n\telse {\n\t\tprintf(\"No\");\n\t}\n\treturn 0;\n}", "language": "C", "metadata": {"date": 1600643156, "filename_ext": "c", "original_language": "C (GCC 9.2.1)", "problem_description_relpath": "problem_descriptions/p02547.html", "problem_id": "p02547", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02547/input.txt", "sample_output_relpath": "derived/input_output/data/p02547/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02547/C/s876244695.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s876244695", "user_id": "u885844436"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "#include <stdio.h>\n\nint main() {\n\tint N,i,D1,count=0,D2,MAX=0;\n\tscanf(\"%d\", &N);\n\tfor (i = 0; i < N; i++) {\n\t\tscanf(\"%d %d\", &D1, &D2);\n\t\tif (D1 == D2) {\n\t\t\tcount = count + 1;\n\t\t\tif (MAX < count) {\n\t\t\t\tMAX = count;\n\t\t\t}\n\t\t}\n\t\telse {\n\t\t\tcount = 0;\n\t\t}\n\t}\n\tif (MAX >= 3) {\n\t\tprintf(\"Yes\");\n\t}\n\telse {\n\t\tprintf(\"No\");\n\t}\n\treturn 0;\n}", "problem_context": "Score : 200 points\n\nProblem Statement\n\nTak performed the following action N times: rolling two dice.\nThe result of the i-th roll is D_{i,1} and D_{i,2}.\n\nCheck if doublets occurred at least three times in a row.\nSpecifically, check if there exists at lease one i such that D_{i,1}=D_{i,2}, D_{i+1,1}=D_{i+1,2} and D_{i+2,1}=D_{i+2,2} hold.\n\nConstraints\n\n3 \\leq N \\leq 100\n\n1\\leq D_{i,j} \\leq 6\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nD_{1,1} D_{1,2}\n\\vdots\nD_{N,1} D_{N,2}\n\nOutput\n\nPrint Yes if doublets occurred at least three times in a row. Print No otherwise.\n\nSample Input 1\n\n5\n1 2\n6 6\n4 4\n3 3\n3 2\n\nSample Output 1\n\nYes\n\nFrom the second roll to the fourth roll, three doublets occurred in a row.\n\nSample Input 2\n\n5\n1 1\n2 2\n3 4\n5 5\n6 6\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n6\n1 1\n2 2\n3 3\n4 4\n5 5\n6 6\n\nSample Output 3\n\nYes", "sample_input": "5\n1 2\n6 6\n4 4\n3 3\n3 2\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p02547", "source_text": "Score : 200 points\n\nProblem Statement\n\nTak performed the following action N times: rolling two dice.\nThe result of the i-th roll is D_{i,1} and D_{i,2}.\n\nCheck if doublets occurred at least three times in a row.\nSpecifically, check if there exists at lease one i such that D_{i,1}=D_{i,2}, D_{i+1,1}=D_{i+1,2} and D_{i+2,1}=D_{i+2,2} hold.\n\nConstraints\n\n3 \\leq N \\leq 100\n\n1\\leq D_{i,j} \\leq 6\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nD_{1,1} D_{1,2}\n\\vdots\nD_{N,1} D_{N,2}\n\nOutput\n\nPrint Yes if doublets occurred at least three times in a row. Print No otherwise.\n\nSample Input 1\n\n5\n1 2\n6 6\n4 4\n3 3\n3 2\n\nSample Output 1\n\nYes\n\nFrom the second roll to the fourth roll, three doublets occurred in a row.\n\nSample Input 2\n\n5\n1 1\n2 2\n3 4\n5 5\n6 6\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n6\n1 1\n2 2\n3 3\n4 4\n5 5\n6 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": 330, "cpu_time_ms": 6, "memory_kb": 1728}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s212083034", "group_id": "codeNet:p02547", "input_text": "#include <stdio.h>\n#include <string.h>\n\nint main(int argc, const char * argv[]) {\n    // insert code here...\n    int n = 0, i, j, cnt=0, save=0, connect=0;//connect=0初回  ３連続でない 7連続である\n    int s[6][2];\n   \n    scanf(\"%d\",&n);\n    \n    for (i = 0; i < n; i++) {\n        for (j = 0; j < 2; j++) {\n            scanf(\"%d\", &s[i][j]);\n        }\n    }\n    \n    \n//    printf(\"%d\", n);\n//    printf(\"\\n\");\n//    for (i = 0; i < n; i++) {\n//        for (j = 0; j < 2; j++) {\n//            printf(\"%d \", s[i][j]);\n//        }\n//        printf(\"\\n\");\n//    }\n    for(i = 0; i < n; i++){\n        if(s[i][0]==s[i][1]){\n            if(connect==0||connect==7){\n                cnt++;\n            }else{\n                cnt=1;\n            }\n            connect=7;\n        }else{\n           \n            if(save<cnt){\n                save = cnt;\n            }\n        \n            connect=3;\n        }\n    }\n    if(save>cnt){\n        cnt=save;\n    }\n    if(cnt>=3){\n        printf(\"Yes\");\n    }else{\n        printf(\"No\");\n    }\n    return 0;\n}\n", "language": "C", "metadata": {"date": 1600545200, "filename_ext": "c", "original_language": "C (Clang 10.0.0)", "problem_description_relpath": "problem_descriptions/p02547.html", "problem_id": "p02547", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02547/input.txt", "sample_output_relpath": "derived/input_output/data/p02547/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02547/C/s212083034.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s212083034", "user_id": "u170349801"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "#include <stdio.h>\n#include <string.h>\n\nint main(int argc, const char * argv[]) {\n    // insert code here...\n    int n = 0, i, j, cnt=0, save=0, connect=0;//connect=0初回  ３連続でない 7連続である\n    int s[6][2];\n   \n    scanf(\"%d\",&n);\n    \n    for (i = 0; i < n; i++) {\n        for (j = 0; j < 2; j++) {\n            scanf(\"%d\", &s[i][j]);\n        }\n    }\n    \n    \n//    printf(\"%d\", n);\n//    printf(\"\\n\");\n//    for (i = 0; i < n; i++) {\n//        for (j = 0; j < 2; j++) {\n//            printf(\"%d \", s[i][j]);\n//        }\n//        printf(\"\\n\");\n//    }\n    for(i = 0; i < n; i++){\n        if(s[i][0]==s[i][1]){\n            if(connect==0||connect==7){\n                cnt++;\n            }else{\n                cnt=1;\n            }\n            connect=7;\n        }else{\n           \n            if(save<cnt){\n                save = cnt;\n            }\n        \n            connect=3;\n        }\n    }\n    if(save>cnt){\n        cnt=save;\n    }\n    if(cnt>=3){\n        printf(\"Yes\");\n    }else{\n        printf(\"No\");\n    }\n    return 0;\n}\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nTak performed the following action N times: rolling two dice.\nThe result of the i-th roll is D_{i,1} and D_{i,2}.\n\nCheck if doublets occurred at least three times in a row.\nSpecifically, check if there exists at lease one i such that D_{i,1}=D_{i,2}, D_{i+1,1}=D_{i+1,2} and D_{i+2,1}=D_{i+2,2} hold.\n\nConstraints\n\n3 \\leq N \\leq 100\n\n1\\leq D_{i,j} \\leq 6\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nD_{1,1} D_{1,2}\n\\vdots\nD_{N,1} D_{N,2}\n\nOutput\n\nPrint Yes if doublets occurred at least three times in a row. Print No otherwise.\n\nSample Input 1\n\n5\n1 2\n6 6\n4 4\n3 3\n3 2\n\nSample Output 1\n\nYes\n\nFrom the second roll to the fourth roll, three doublets occurred in a row.\n\nSample Input 2\n\n5\n1 1\n2 2\n3 4\n5 5\n6 6\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n6\n1 1\n2 2\n3 3\n4 4\n5 5\n6 6\n\nSample Output 3\n\nYes", "sample_input": "5\n1 2\n6 6\n4 4\n3 3\n3 2\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p02547", "source_text": "Score : 200 points\n\nProblem Statement\n\nTak performed the following action N times: rolling two dice.\nThe result of the i-th roll is D_{i,1} and D_{i,2}.\n\nCheck if doublets occurred at least three times in a row.\nSpecifically, check if there exists at lease one i such that D_{i,1}=D_{i,2}, D_{i+1,1}=D_{i+1,2} and D_{i+2,1}=D_{i+2,2} hold.\n\nConstraints\n\n3 \\leq N \\leq 100\n\n1\\leq D_{i,j} \\leq 6\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nD_{1,1} D_{1,2}\n\\vdots\nD_{N,1} D_{N,2}\n\nOutput\n\nPrint Yes if doublets occurred at least three times in a row. Print No otherwise.\n\nSample Input 1\n\n5\n1 2\n6 6\n4 4\n3 3\n3 2\n\nSample Output 1\n\nYes\n\nFrom the second roll to the fourth roll, three doublets occurred in a row.\n\nSample Input 2\n\n5\n1 1\n2 2\n3 4\n5 5\n6 6\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n6\n1 1\n2 2\n3 3\n4 4\n5 5\n6 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": 1053, "cpu_time_ms": 130, "memory_kb": 2124}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s044908395", "group_id": "codeNet:p02547", "input_text": "#include <stdio.h>\nint main(void){\n    int n;\n    int d[200];\n    int count=0,h=0;\n    \n    scanf(\"%d\",&n);\n    for(int i=0;i<n;i++){\n        scanf(\"%d %d\",&d[i*2],&d[i*2+1]);\n        if(d[i*2]==d[i*2+1]){\n            count++;\n            h=count;\n        }\n        else{\n            count=0;\n        }\n    }\n    \n    if(h>=3)\n        printf(\"Yes\");\n    else\n        printf(\"No\");\n    \n    return 0;\n}\n", "language": "C", "metadata": {"date": 1600543872, "filename_ext": "c", "original_language": "C (GCC 9.2.1)", "problem_description_relpath": "problem_descriptions/p02547.html", "problem_id": "p02547", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02547/input.txt", "sample_output_relpath": "derived/input_output/data/p02547/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02547/C/s044908395.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s044908395", "user_id": "u539981312"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "#include <stdio.h>\nint main(void){\n    int n;\n    int d[200];\n    int count=0,h=0;\n    \n    scanf(\"%d\",&n);\n    for(int i=0;i<n;i++){\n        scanf(\"%d %d\",&d[i*2],&d[i*2+1]);\n        if(d[i*2]==d[i*2+1]){\n            count++;\n            h=count;\n        }\n        else{\n            count=0;\n        }\n    }\n    \n    if(h>=3)\n        printf(\"Yes\");\n    else\n        printf(\"No\");\n    \n    return 0;\n}\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nTak performed the following action N times: rolling two dice.\nThe result of the i-th roll is D_{i,1} and D_{i,2}.\n\nCheck if doublets occurred at least three times in a row.\nSpecifically, check if there exists at lease one i such that D_{i,1}=D_{i,2}, D_{i+1,1}=D_{i+1,2} and D_{i+2,1}=D_{i+2,2} hold.\n\nConstraints\n\n3 \\leq N \\leq 100\n\n1\\leq D_{i,j} \\leq 6\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nD_{1,1} D_{1,2}\n\\vdots\nD_{N,1} D_{N,2}\n\nOutput\n\nPrint Yes if doublets occurred at least three times in a row. Print No otherwise.\n\nSample Input 1\n\n5\n1 2\n6 6\n4 4\n3 3\n3 2\n\nSample Output 1\n\nYes\n\nFrom the second roll to the fourth roll, three doublets occurred in a row.\n\nSample Input 2\n\n5\n1 1\n2 2\n3 4\n5 5\n6 6\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n6\n1 1\n2 2\n3 3\n4 4\n5 5\n6 6\n\nSample Output 3\n\nYes", "sample_input": "5\n1 2\n6 6\n4 4\n3 3\n3 2\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p02547", "source_text": "Score : 200 points\n\nProblem Statement\n\nTak performed the following action N times: rolling two dice.\nThe result of the i-th roll is D_{i,1} and D_{i,2}.\n\nCheck if doublets occurred at least three times in a row.\nSpecifically, check if there exists at lease one i such that D_{i,1}=D_{i,2}, D_{i+1,1}=D_{i+1,2} and D_{i+2,1}=D_{i+2,2} hold.\n\nConstraints\n\n3 \\leq N \\leq 100\n\n1\\leq D_{i,j} \\leq 6\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nD_{1,1} D_{1,2}\n\\vdots\nD_{N,1} D_{N,2}\n\nOutput\n\nPrint Yes if doublets occurred at least three times in a row. Print No otherwise.\n\nSample Input 1\n\n5\n1 2\n6 6\n4 4\n3 3\n3 2\n\nSample Output 1\n\nYes\n\nFrom the second roll to the fourth roll, three doublets occurred in a row.\n\nSample Input 2\n\n5\n1 1\n2 2\n3 4\n5 5\n6 6\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n6\n1 1\n2 2\n3 3\n4 4\n5 5\n6 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": 402, "cpu_time_ms": 5, "memory_kb": 1736}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s626602656", "group_id": "codeNet:p02547", "input_text": "#include <stdio.h>\n\nint main(void) {\n\tint N, DB, DA;\n\tint judge = 0;\n\t//Db Dbefor Da Dafter\n\tscanf(\"%d\", &N);\n\n\tfor (int i = 0; i < N; i++) {\n\t\tscanf(\"%d %d\", &DA, &DB);\n\t\tif (judge!=3) {\n\t\t\tif (DA == DB)\n\t\t\t\tjudge++;\n\t\t\telse\n\t\t\t\tjudge = 0;\n\t\t}\n\t}\n\tif (judge == 3)\n\t\tprintf(\"Yes\");\n\telse\n\t\tprintf(\"No\");\n\treturn 0;\n}", "language": "C", "metadata": {"date": 1600543194, "filename_ext": "c", "original_language": "C (Clang 10.0.0)", "problem_description_relpath": "problem_descriptions/p02547.html", "problem_id": "p02547", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02547/input.txt", "sample_output_relpath": "derived/input_output/data/p02547/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02547/C/s626602656.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s626602656", "user_id": "u049791295"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "#include <stdio.h>\n\nint main(void) {\n\tint N, DB, DA;\n\tint judge = 0;\n\t//Db Dbefor Da Dafter\n\tscanf(\"%d\", &N);\n\n\tfor (int i = 0; i < N; i++) {\n\t\tscanf(\"%d %d\", &DA, &DB);\n\t\tif (judge!=3) {\n\t\t\tif (DA == DB)\n\t\t\t\tjudge++;\n\t\t\telse\n\t\t\t\tjudge = 0;\n\t\t}\n\t}\n\tif (judge == 3)\n\t\tprintf(\"Yes\");\n\telse\n\t\tprintf(\"No\");\n\treturn 0;\n}", "problem_context": "Score : 200 points\n\nProblem Statement\n\nTak performed the following action N times: rolling two dice.\nThe result of the i-th roll is D_{i,1} and D_{i,2}.\n\nCheck if doublets occurred at least three times in a row.\nSpecifically, check if there exists at lease one i such that D_{i,1}=D_{i,2}, D_{i+1,1}=D_{i+1,2} and D_{i+2,1}=D_{i+2,2} hold.\n\nConstraints\n\n3 \\leq N \\leq 100\n\n1\\leq D_{i,j} \\leq 6\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nD_{1,1} D_{1,2}\n\\vdots\nD_{N,1} D_{N,2}\n\nOutput\n\nPrint Yes if doublets occurred at least three times in a row. Print No otherwise.\n\nSample Input 1\n\n5\n1 2\n6 6\n4 4\n3 3\n3 2\n\nSample Output 1\n\nYes\n\nFrom the second roll to the fourth roll, three doublets occurred in a row.\n\nSample Input 2\n\n5\n1 1\n2 2\n3 4\n5 5\n6 6\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n6\n1 1\n2 2\n3 3\n4 4\n5 5\n6 6\n\nSample Output 3\n\nYes", "sample_input": "5\n1 2\n6 6\n4 4\n3 3\n3 2\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p02547", "source_text": "Score : 200 points\n\nProblem Statement\n\nTak performed the following action N times: rolling two dice.\nThe result of the i-th roll is D_{i,1} and D_{i,2}.\n\nCheck if doublets occurred at least three times in a row.\nSpecifically, check if there exists at lease one i such that D_{i,1}=D_{i,2}, D_{i+1,1}=D_{i+1,2} and D_{i+2,1}=D_{i+2,2} hold.\n\nConstraints\n\n3 \\leq N \\leq 100\n\n1\\leq D_{i,j} \\leq 6\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nD_{1,1} D_{1,2}\n\\vdots\nD_{N,1} D_{N,2}\n\nOutput\n\nPrint Yes if doublets occurred at least three times in a row. Print No otherwise.\n\nSample Input 1\n\n5\n1 2\n6 6\n4 4\n3 3\n3 2\n\nSample Output 1\n\nYes\n\nFrom the second roll to the fourth roll, three doublets occurred in a row.\n\nSample Input 2\n\n5\n1 1\n2 2\n3 4\n5 5\n6 6\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n6\n1 1\n2 2\n3 3\n4 4\n5 5\n6 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": 316, "cpu_time_ms": 8, "memory_kb": 2156}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s502064447", "group_id": "codeNet:p02550", "input_text": "#include <stdio.h>\n\nint main()\n{\n\n    long long int n;\n    long long int x;\n    int m;\n    int remember[100000];\n    unsigned long long int remembersum[100000];\n    long long int remembercount[100000];\n    int r=0;\n    int flag =0;//繰り返し\n\n    scanf(\"%lld\", &n);\n    scanf(\"%lld\", &x);\n    scanf(\"%d\", &m);\n\n    unsigned long long int sum = 0;\n    int i;\n    int j;\n    sum = x;\n    for (i = 1; i < n;i++){\n        if(x*x-m>0){\n            x = (x * x )% m;\n            if(x<100000){\n                for (j = 0; j < r;j++){\n                    if(remember[j]==x){\n                        flag = 1;\n                        //printf(\"*find*%lld\\n\", x);\n                        sum += x;\n                        break;\n                        \n                        //同じの発見\n                    }\n                }\n                //同じの発見したら抜ける\n                if(flag==1)\n                    break;\n            }\n        }\n        else if (x * x - m == 0)\n        {\n            break;\n        }\n        else\n            x = x * x;\n\n        sum += x;\n        if(x<100000){\n            remember[r] = x;\n            remembersum[r] = sum;\n            remembercount[r] = i;\n            r++;\n            if(r>=100000)\n                r = 0;\n            //printf(\"*remember*%lld\\n\", x);\n        }\n        \n    }\n    if(flag==1){\n        unsigned long long partsum = sum - remembersum[j];\n        long long int partcount = i - remembercount[j];\n        sum += (((long long int)(n - 1 - i) / partcount)) * partsum;\n        n = (n -1- i) % partcount;\n        x = remember[j];\n        for (i = 0; i < n; i++)\n        {\n            if (x * x - m >= 0)\n            {\n                x = (x * x) % m;\n               \n            }\n            else\n                x = x * x;\n\n            sum += x;\n          \n        }\n    }\n\n    printf(\"%lld\", sum);\n\n    printf(\"\\n\");\n}", "language": "C", "metadata": {"date": 1600547433, "filename_ext": "c", "original_language": "C (Clang 10.0.0)", "problem_description_relpath": "problem_descriptions/p02550.html", "problem_id": "p02550", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02550/input.txt", "sample_output_relpath": "derived/input_output/data/p02550/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02550/C/s502064447.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s502064447", "user_id": "u224085427"}, "prompt_components": {"gold_output": "1369\n", "input_to_evaluate": "#include <stdio.h>\n\nint main()\n{\n\n    long long int n;\n    long long int x;\n    int m;\n    int remember[100000];\n    unsigned long long int remembersum[100000];\n    long long int remembercount[100000];\n    int r=0;\n    int flag =0;//繰り返し\n\n    scanf(\"%lld\", &n);\n    scanf(\"%lld\", &x);\n    scanf(\"%d\", &m);\n\n    unsigned long long int sum = 0;\n    int i;\n    int j;\n    sum = x;\n    for (i = 1; i < n;i++){\n        if(x*x-m>0){\n            x = (x * x )% m;\n            if(x<100000){\n                for (j = 0; j < r;j++){\n                    if(remember[j]==x){\n                        flag = 1;\n                        //printf(\"*find*%lld\\n\", x);\n                        sum += x;\n                        break;\n                        \n                        //同じの発見\n                    }\n                }\n                //同じの発見したら抜ける\n                if(flag==1)\n                    break;\n            }\n        }\n        else if (x * x - m == 0)\n        {\n            break;\n        }\n        else\n            x = x * x;\n\n        sum += x;\n        if(x<100000){\n            remember[r] = x;\n            remembersum[r] = sum;\n            remembercount[r] = i;\n            r++;\n            if(r>=100000)\n                r = 0;\n            //printf(\"*remember*%lld\\n\", x);\n        }\n        \n    }\n    if(flag==1){\n        unsigned long long partsum = sum - remembersum[j];\n        long long int partcount = i - remembercount[j];\n        sum += (((long long int)(n - 1 - i) / partcount)) * partsum;\n        n = (n -1- i) % partcount;\n        x = remember[j];\n        for (i = 0; i < n; i++)\n        {\n            if (x * x - m >= 0)\n            {\n                x = (x * x) % m;\n               \n            }\n            else\n                x = x * x;\n\n            sum += x;\n          \n        }\n    }\n\n    printf(\"%lld\", sum);\n\n    printf(\"\\n\");\n}", "problem_context": "Score : 500 points\n\nProblem Statement\n\nLet us denote by f(x, m) the remainder of the Euclidean division of x by m.\n\nLet A be the sequence that is defined by the initial value A_1=X and the recurrence relation A_{n+1} = f(A_n^2, M).\nFind \\displaystyle{\\sum_{i=1}^N A_i}.\n\nConstraints\n\n1 \\leq N \\leq 10^{10}\n\n0 \\leq X < M \\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 X M\n\nOutput\n\nPrint \\displaystyle{\\sum_{i=1}^N A_i}.\n\nSample Input 1\n\n6 2 1001\n\nSample Output 1\n\n1369\n\nThe sequence A begins 2,4,16,256,471,620,\\ldots Therefore, the answer is 2+4+16+256+471+620=1369.\n\nSample Input 2\n\n1000 2 16\n\nSample Output 2\n\n6\n\nThe sequence A begins 2,4,0,0,\\ldots Therefore, the answer is 6.\n\nSample Input 3\n\n10000000000 10 99959\n\nSample Output 3\n\n492443256176507", "sample_input": "6 2 1001\n"}, "reference_outputs": ["1369\n"], "source_document_id": "p02550", "source_text": "Score : 500 points\n\nProblem Statement\n\nLet us denote by f(x, m) the remainder of the Euclidean division of x by m.\n\nLet A be the sequence that is defined by the initial value A_1=X and the recurrence relation A_{n+1} = f(A_n^2, M).\nFind \\displaystyle{\\sum_{i=1}^N A_i}.\n\nConstraints\n\n1 \\leq N \\leq 10^{10}\n\n0 \\leq X < M \\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 X M\n\nOutput\n\nPrint \\displaystyle{\\sum_{i=1}^N A_i}.\n\nSample Input 1\n\n6 2 1001\n\nSample Output 1\n\n1369\n\nThe sequence A begins 2,4,16,256,471,620,\\ldots Therefore, the answer is 2+4+16+256+471+620=1369.\n\nSample Input 2\n\n1000 2 16\n\nSample Output 2\n\n6\n\nThe sequence A begins 2,4,0,0,\\ldots Therefore, the answer is 6.\n\nSample Input 3\n\n10000000000 10 99959\n\nSample Output 3\n\n492443256176507", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1894, "cpu_time_ms": 2205, "memory_kb": 3836}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s221565606", "group_id": "codeNet:p02553", "input_text": "#include <stdio.h> \n\nint main() {\n  long int a, b, c, d;\n  long int ans1, ans2, ans;\n\n  scanf(\"%ld%ld%ld%ld\", &a, &b, &c, &d);\n\n  long int x1 = a * c;\n  long int x2 = a * d;\n  long int x3 = b * c;\n  long int x4 = b * d;\n\n  if (x1 < x2) {\n    ans1 = x2;\n  } else {\n    ans1 = x1;\n  }\n\n  if (x3 < x4) {\n    ans2 = x4;\n  } else {\n    ans2 = x3;\n  }\n\n  if (ans1 < ans2) {\n    ans = ans2;\n  }  else {\n    ans = ans1;\n  }\n\n  printf(\"%ld\", ans);\n\n  return 0;\n}", "language": "C", "metadata": {"date": 1600025189, "filename_ext": "c", "original_language": "C (GCC 9.2.1)", "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/C/s221565606.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s221565606", "user_id": "u762999623"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "#include <stdio.h> \n\nint main() {\n  long int a, b, c, d;\n  long int ans1, ans2, ans;\n\n  scanf(\"%ld%ld%ld%ld\", &a, &b, &c, &d);\n\n  long int x1 = a * c;\n  long int x2 = a * d;\n  long int x3 = b * c;\n  long int x4 = b * d;\n\n  if (x1 < x2) {\n    ans1 = x2;\n  } else {\n    ans1 = x1;\n  }\n\n  if (x3 < x4) {\n    ans2 = x4;\n  } else {\n    ans2 = x3;\n  }\n\n  if (ans1 < ans2) {\n    ans = ans2;\n  }  else {\n    ans = ans1;\n  }\n\n  printf(\"%ld\", ans);\n\n  return 0;\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": 453, "cpu_time_ms": 5, "memory_kb": 1732}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s503208400", "group_id": "codeNet:p02570", "input_text": "#include<stdio.h>\nint main(){\n  int D, T, S;\n  scanf(\"%d %d %d\\n\", &D, &T, &S);\n  if(D > T * S)\n    printf(\"No\\n\");\n  else\n    printf(\"Yes\\n\");\n}", "language": "C", "metadata": {"date": 1599655655, "filename_ext": "c", "original_language": "C (GCC 9.2.1)", "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/C/s503208400.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s503208400", "user_id": "u838107256"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "#include<stdio.h>\nint main(){\n  int D, T, S;\n  scanf(\"%d %d %d\\n\", &D, &T, &S);\n  if(D > T * S)\n    printf(\"No\\n\");\n  else\n    printf(\"Yes\\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": 145, "cpu_time_ms": 6, "memory_kb": 1660}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s076766112", "group_id": "codeNet:p02570", "input_text": "#include<stdio.h>\n\nint main(){\n    int d,t,s;\n    scanf(\"%d%d%d\",&d,&t,&s);\n\n    if(d<=t*s){\n        printf(\"Yes\\n\");\n    }else{\n        printf(\"No\\n\");\n    }\n    return 0;\n}", "language": "C", "metadata": {"date": 1598727910, "filename_ext": "c", "original_language": "C (GCC 9.2.1)", "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/C/s076766112.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s076766112", "user_id": "u061882112"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "#include<stdio.h>\n\nint main(){\n    int d,t,s;\n    scanf(\"%d%d%d\",&d,&t,&s);\n\n    if(d<=t*s){\n        printf(\"Yes\\n\");\n    }else{\n        printf(\"No\\n\");\n    }\n    return 0;\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": 174, "cpu_time_ms": 9, "memory_kb": 1660}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s889874739", "group_id": "codeNet:p02571", "input_text": "#include <stdio.h>\n#include <string.h>\n\nint main() {\n  char S[1001] = {'\\0'};\n  char T[1001] = {'\\0'};\n\n  int count = 0,min = 1000;\n  int len_S = 0;\n  int len_T = 0;\n\n  gets(S);\n  gets(T);\n  len_S = strlen(S);\n  len_T = strlen(T);\n\n  for(int i=0;i + len_T < len_S;i++){\n    count = 0;\n    for(int j=0;j<len_T;j++){\n      // printf(\"%c:%c\\n\",S[i+j],T[j]);\n      if(S[i+j] != T[j]){\n        count++;\n      }\n    }\n    if(min > count) min = count;\n  }\n  printf(\"%d\\n\",min);\n\n\n  return 0;\n}\n", "language": "C", "metadata": {"date": 1598728824, "filename_ext": "c", "original_language": "C (GCC 9.2.1)", "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/C/s889874739.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s889874739", "user_id": "u754953809"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "#include <stdio.h>\n#include <string.h>\n\nint main() {\n  char S[1001] = {'\\0'};\n  char T[1001] = {'\\0'};\n\n  int count = 0,min = 1000;\n  int len_S = 0;\n  int len_T = 0;\n\n  gets(S);\n  gets(T);\n  len_S = strlen(S);\n  len_T = strlen(T);\n\n  for(int i=0;i + len_T < len_S;i++){\n    count = 0;\n    for(int j=0;j<len_T;j++){\n      // printf(\"%c:%c\\n\",S[i+j],T[j]);\n      if(S[i+j] != T[j]){\n        count++;\n      }\n    }\n    if(min > count) min = count;\n  }\n  printf(\"%d\\n\",min);\n\n\n  return 0;\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": 487, "cpu_time_ms": 6, "memory_kb": 1648}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s436717189", "group_id": "codeNet:p02577", "input_text": "#include <stdio.h>\n#include<string.h>\n#include<math.h>\nint mul(int n, int s)\n{\nif (n==0)\n{\nreturn s;\n}\nelse\n{\ns=s+(n%10);\nn=n/10;\nreturn mul(n,s);\n}\n}\nint main()\n{\n    int a,b,c,d,e,f,g,h,i,j,s=0;\nscanf(\"%d\",&a);\nb=mul(a,s);\nif(b%9==0&&a%9==0)\n{\nprintf(\"Yes\\n\");\n}\nelse\n{\nprintf(\"No\\n\");\n}\nreturn 0;\n}", "language": "C", "metadata": {"date": 1599432916, "filename_ext": "c", "original_language": "C (GCC 9.2.1)", "problem_description_relpath": "problem_descriptions/p02577.html", "problem_id": "p02577", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02577/input.txt", "sample_output_relpath": "derived/input_output/data/p02577/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02577/C/s436717189.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s436717189", "user_id": "u816631826"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "#include <stdio.h>\n#include<string.h>\n#include<math.h>\nint mul(int n, int s)\n{\nif (n==0)\n{\nreturn s;\n}\nelse\n{\ns=s+(n%10);\nn=n/10;\nreturn mul(n,s);\n}\n}\nint main()\n{\n    int a,b,c,d,e,f,g,h,i,j,s=0;\nscanf(\"%d\",&a);\nb=mul(a,s);\nif(b%9==0&&a%9==0)\n{\nprintf(\"Yes\\n\");\n}\nelse\n{\nprintf(\"No\\n\");\n}\nreturn 0;\n}", "problem_context": "Score : 200 points\n\nProblem Statement\n\nAn integer N is a multiple of 9 if and only if the sum of the digits in the decimal representation of N is a multiple of 9.\n\nDetermine whether N is a multiple of 9.\n\nConstraints\n\n0 \\leq N < 10^{200000}\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 is a multiple of 9, print Yes; otherwise, print No.\n\nSample Input 1\n\n123456789\n\nSample Output 1\n\nYes\n\nThe sum of these digits is 1+2+3+4+5+6+7+8+9=45, which is a multiple of 9, so 123456789 is a multiple of 9.\n\nSample Input 2\n\n0\n\nSample Output 2\n\nYes\n\nSample Input 3\n\n31415926535897932384626433832795028841971693993751058209749445923078164062862089986280\n\nSample Output 3\n\nNo", "sample_input": "123456789\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p02577", "source_text": "Score : 200 points\n\nProblem Statement\n\nAn integer N is a multiple of 9 if and only if the sum of the digits in the decimal representation of N is a multiple of 9.\n\nDetermine whether N is a multiple of 9.\n\nConstraints\n\n0 \\leq N < 10^{200000}\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 is a multiple of 9, print Yes; otherwise, print No.\n\nSample Input 1\n\n123456789\n\nSample Output 1\n\nYes\n\nThe sum of these digits is 1+2+3+4+5+6+7+8+9=45, which is a multiple of 9, so 123456789 is a multiple of 9.\n\nSample Input 2\n\n0\n\nSample Output 2\n\nYes\n\nSample Input 3\n\n31415926535897932384626433832795028841971693993751058209749445923078164062862089986280\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": 301, "cpu_time_ms": 5, "memory_kb": 1712}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s150894153", "group_id": "codeNet:p02577", "input_text": "#include <stdio.h>\ntypedef long long ll;\n#define rep(i,n) for(int i=0; i<(int)(n); i++)\n\nint main()\n{\n   int N,sum=0,tmp=0;\n   scanf(\"%d\", &N);\n\nwhile (N>0)\n{\n   sum+=N%10;\n   N=N/10;\n}\nif (0==sum%9)\n{\n printf(\"Yes\");\n}\nelse\n{\n   printf(\"No\");\n\n}\n\n\n   return 0;\n}", "language": "C", "metadata": {"date": 1598987427, "filename_ext": "c", "original_language": "C (GCC 9.2.1)", "problem_description_relpath": "problem_descriptions/p02577.html", "problem_id": "p02577", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02577/input.txt", "sample_output_relpath": "derived/input_output/data/p02577/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02577/C/s150894153.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s150894153", "user_id": "u483065848"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "#include <stdio.h>\ntypedef long long ll;\n#define rep(i,n) for(int i=0; i<(int)(n); i++)\n\nint main()\n{\n   int N,sum=0,tmp=0;\n   scanf(\"%d\", &N);\n\nwhile (N>0)\n{\n   sum+=N%10;\n   N=N/10;\n}\nif (0==sum%9)\n{\n printf(\"Yes\");\n}\nelse\n{\n   printf(\"No\");\n\n}\n\n\n   return 0;\n}", "problem_context": "Score : 200 points\n\nProblem Statement\n\nAn integer N is a multiple of 9 if and only if the sum of the digits in the decimal representation of N is a multiple of 9.\n\nDetermine whether N is a multiple of 9.\n\nConstraints\n\n0 \\leq N < 10^{200000}\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 is a multiple of 9, print Yes; otherwise, print No.\n\nSample Input 1\n\n123456789\n\nSample Output 1\n\nYes\n\nThe sum of these digits is 1+2+3+4+5+6+7+8+9=45, which is a multiple of 9, so 123456789 is a multiple of 9.\n\nSample Input 2\n\n0\n\nSample Output 2\n\nYes\n\nSample Input 3\n\n31415926535897932384626433832795028841971693993751058209749445923078164062862089986280\n\nSample Output 3\n\nNo", "sample_input": "123456789\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p02577", "source_text": "Score : 200 points\n\nProblem Statement\n\nAn integer N is a multiple of 9 if and only if the sum of the digits in the decimal representation of N is a multiple of 9.\n\nDetermine whether N is a multiple of 9.\n\nConstraints\n\n0 \\leq N < 10^{200000}\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 is a multiple of 9, print Yes; otherwise, print No.\n\nSample Input 1\n\n123456789\n\nSample Output 1\n\nYes\n\nThe sum of these digits is 1+2+3+4+5+6+7+8+9=45, which is a multiple of 9, so 123456789 is a multiple of 9.\n\nSample Input 2\n\n0\n\nSample Output 2\n\nYes\n\nSample Input 3\n\n31415926535897932384626433832795028841971693993751058209749445923078164062862089986280\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": 263, "cpu_time_ms": 5, "memory_kb": 1696}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s372417517", "group_id": "codeNet:p02577", "input_text": "#include <stdio.h>\n#include <string.h>\nint main(void){\n    char s;\n    int ans=0;\n    while(scanf(\"%c\", &s)==1){\n        ans+=(int)s-'0';\n        if(ans>=9)ans-=9;\n    }\n    \n    if(ans%9==0)printf(\"Yes\");\n    else printf(\"No\");\n}\n", "language": "C", "metadata": {"date": 1598124742, "filename_ext": "c", "original_language": "C (GCC 9.2.1)", "problem_description_relpath": "problem_descriptions/p02577.html", "problem_id": "p02577", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02577/input.txt", "sample_output_relpath": "derived/input_output/data/p02577/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02577/C/s372417517.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s372417517", "user_id": "u972042735"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "#include <stdio.h>\n#include <string.h>\nint main(void){\n    char s;\n    int ans=0;\n    while(scanf(\"%c\", &s)==1){\n        ans+=(int)s-'0';\n        if(ans>=9)ans-=9;\n    }\n    \n    if(ans%9==0)printf(\"Yes\");\n    else printf(\"No\");\n}\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nAn integer N is a multiple of 9 if and only if the sum of the digits in the decimal representation of N is a multiple of 9.\n\nDetermine whether N is a multiple of 9.\n\nConstraints\n\n0 \\leq N < 10^{200000}\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 is a multiple of 9, print Yes; otherwise, print No.\n\nSample Input 1\n\n123456789\n\nSample Output 1\n\nYes\n\nThe sum of these digits is 1+2+3+4+5+6+7+8+9=45, which is a multiple of 9, so 123456789 is a multiple of 9.\n\nSample Input 2\n\n0\n\nSample Output 2\n\nYes\n\nSample Input 3\n\n31415926535897932384626433832795028841971693993751058209749445923078164062862089986280\n\nSample Output 3\n\nNo", "sample_input": "123456789\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p02577", "source_text": "Score : 200 points\n\nProblem Statement\n\nAn integer N is a multiple of 9 if and only if the sum of the digits in the decimal representation of N is a multiple of 9.\n\nDetermine whether N is a multiple of 9.\n\nConstraints\n\n0 \\leq N < 10^{200000}\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 is a multiple of 9, print Yes; otherwise, print No.\n\nSample Input 1\n\n123456789\n\nSample Output 1\n\nYes\n\nThe sum of these digits is 1+2+3+4+5+6+7+8+9=45, which is a multiple of 9, so 123456789 is a multiple of 9.\n\nSample Input 2\n\n0\n\nSample Output 2\n\nYes\n\nSample Input 3\n\n31415926535897932384626433832795028841971693993751058209749445923078164062862089986280\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": 231, "cpu_time_ms": 20, "memory_kb": 1668}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s430366659", "group_id": "codeNet:p02577", "input_text": "#include<stdio.h>\n#include<string.h>\n#include<math.h>\n#include<limits.h>\n#include<stdbool.h>\n#define e 1000000007\n\ntypedef  long long ll;\n\nint int_cmp(const void *a, const void *b){ \n    const int *ia = (const int *)a;\n    const int *ib = (const int *)b;\n    return *ia  - *ib; \n} \n\n\nll int_cmp1(const void *a, const void *b){ \n    const int *ia = (const int *)a;\n    const int *ib = (const int *)b;\n    return *ia  - *ib; \n} \n\n\nint max(int a,int b){\n\tif(a<b)\n\t\ta=b;\n\treturn a;\t\n}\n\nint min(int a,int b){\n\tif(a>b)\n\t\ta=b;\n\treturn a;\t\n}\n\nint absolu(int n){\n\tif(n<0)\n\t\tn*=-1;\n\t\n\treturn n;\t\n}\n\n\nvoid solve(){\n   char s[10000000000000000000000000];\n\tint i;\n\t\n\tscanf(\"%s\",s);\n\tll ans=0,len=strlen(s);\n\t\n\tfor(i=0 ; i<len ; i++){\n\t\tint val=s[i]-'0';\n\t\tans+=val;\n\t}\n\t\n\t if(ans%9==0)\n\t\tprintf(\"YES\\n\");\n\telse\n\t\tprintf(\"NO\\n\");\t\t\n}\n\n \n\n\n\n\n\nint main(){\n /* int t;\n\tscanf(\"%d\",&t);\n\t\n\twhile(t--)*/\n\t\tsolve();\n\t\n\t\n\t\n\treturn 0;\n}\t\n\t", "language": "C", "metadata": {"date": 1598123819, "filename_ext": "c", "original_language": "C (GCC 9.2.1)", "problem_description_relpath": "problem_descriptions/p02577.html", "problem_id": "p02577", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02577/input.txt", "sample_output_relpath": "derived/input_output/data/p02577/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02577/C/s430366659.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s430366659", "user_id": "u079758994"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "#include<stdio.h>\n#include<string.h>\n#include<math.h>\n#include<limits.h>\n#include<stdbool.h>\n#define e 1000000007\n\ntypedef  long long ll;\n\nint int_cmp(const void *a, const void *b){ \n    const int *ia = (const int *)a;\n    const int *ib = (const int *)b;\n    return *ia  - *ib; \n} \n\n\nll int_cmp1(const void *a, const void *b){ \n    const int *ia = (const int *)a;\n    const int *ib = (const int *)b;\n    return *ia  - *ib; \n} \n\n\nint max(int a,int b){\n\tif(a<b)\n\t\ta=b;\n\treturn a;\t\n}\n\nint min(int a,int b){\n\tif(a>b)\n\t\ta=b;\n\treturn a;\t\n}\n\nint absolu(int n){\n\tif(n<0)\n\t\tn*=-1;\n\t\n\treturn n;\t\n}\n\n\nvoid solve(){\n   char s[10000000000000000000000000];\n\tint i;\n\t\n\tscanf(\"%s\",s);\n\tll ans=0,len=strlen(s);\n\t\n\tfor(i=0 ; i<len ; i++){\n\t\tint val=s[i]-'0';\n\t\tans+=val;\n\t}\n\t\n\t if(ans%9==0)\n\t\tprintf(\"YES\\n\");\n\telse\n\t\tprintf(\"NO\\n\");\t\t\n}\n\n \n\n\n\n\n\nint main(){\n /* int t;\n\tscanf(\"%d\",&t);\n\t\n\twhile(t--)*/\n\t\tsolve();\n\t\n\t\n\t\n\treturn 0;\n}\t\n\t", "problem_context": "Score : 200 points\n\nProblem Statement\n\nAn integer N is a multiple of 9 if and only if the sum of the digits in the decimal representation of N is a multiple of 9.\n\nDetermine whether N is a multiple of 9.\n\nConstraints\n\n0 \\leq N < 10^{200000}\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 is a multiple of 9, print Yes; otherwise, print No.\n\nSample Input 1\n\n123456789\n\nSample Output 1\n\nYes\n\nThe sum of these digits is 1+2+3+4+5+6+7+8+9=45, which is a multiple of 9, so 123456789 is a multiple of 9.\n\nSample Input 2\n\n0\n\nSample Output 2\n\nYes\n\nSample Input 3\n\n31415926535897932384626433832795028841971693993751058209749445923078164062862089986280\n\nSample Output 3\n\nNo", "sample_input": "123456789\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p02577", "source_text": "Score : 200 points\n\nProblem Statement\n\nAn integer N is a multiple of 9 if and only if the sum of the digits in the decimal representation of N is a multiple of 9.\n\nDetermine whether N is a multiple of 9.\n\nConstraints\n\n0 \\leq N < 10^{200000}\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 is a multiple of 9, print Yes; otherwise, print No.\n\nSample Input 1\n\n123456789\n\nSample Output 1\n\nYes\n\nThe sum of these digits is 1+2+3+4+5+6+7+8+9=45, which is a multiple of 9, so 123456789 is a multiple of 9.\n\nSample Input 2\n\n0\n\nSample Output 2\n\nYes\n\nSample Input 3\n\n31415926535897932384626433832795028841971693993751058209749445923078164062862089986280\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": 916, "cpu_time_ms": 176, "memory_kb": 1384}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s114412552", "group_id": "codeNet:p02577", "input_text": "#include<stdio.h>\nint main()\n{\n  char n[200001];\n  scanf(\"%s\",n);\n  int sum=0;\n  for (int i=0;n[i]!='\\0';i++) sum+=n[i]-'0';\n  if (sum%9==0) printf(\"Yes\");\n  else printf(\"No\");\n  return 0;\n}", "language": "C", "metadata": {"date": 1598123670, "filename_ext": "c", "original_language": "C (GCC 9.2.1)", "problem_description_relpath": "problem_descriptions/p02577.html", "problem_id": "p02577", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02577/input.txt", "sample_output_relpath": "derived/input_output/data/p02577/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02577/C/s114412552.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s114412552", "user_id": "u686878489"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "#include<stdio.h>\nint main()\n{\n  char n[200001];\n  scanf(\"%s\",n);\n  int sum=0;\n  for (int i=0;n[i]!='\\0';i++) sum+=n[i]-'0';\n  if (sum%9==0) printf(\"Yes\");\n  else printf(\"No\");\n  return 0;\n}", "problem_context": "Score : 200 points\n\nProblem Statement\n\nAn integer N is a multiple of 9 if and only if the sum of the digits in the decimal representation of N is a multiple of 9.\n\nDetermine whether N is a multiple of 9.\n\nConstraints\n\n0 \\leq N < 10^{200000}\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 is a multiple of 9, print Yes; otherwise, print No.\n\nSample Input 1\n\n123456789\n\nSample Output 1\n\nYes\n\nThe sum of these digits is 1+2+3+4+5+6+7+8+9=45, which is a multiple of 9, so 123456789 is a multiple of 9.\n\nSample Input 2\n\n0\n\nSample Output 2\n\nYes\n\nSample Input 3\n\n31415926535897932384626433832795028841971693993751058209749445923078164062862089986280\n\nSample Output 3\n\nNo", "sample_input": "123456789\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p02577", "source_text": "Score : 200 points\n\nProblem Statement\n\nAn integer N is a multiple of 9 if and only if the sum of the digits in the decimal representation of N is a multiple of 9.\n\nDetermine whether N is a multiple of 9.\n\nConstraints\n\n0 \\leq N < 10^{200000}\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 is a multiple of 9, print Yes; otherwise, print No.\n\nSample Input 1\n\n123456789\n\nSample Output 1\n\nYes\n\nThe sum of these digits is 1+2+3+4+5+6+7+8+9=45, which is a multiple of 9, so 123456789 is a multiple of 9.\n\nSample Input 2\n\n0\n\nSample Output 2\n\nYes\n\nSample Input 3\n\n31415926535897932384626433832795028841971693993751058209749445923078164062862089986280\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": 190, "cpu_time_ms": 4, "memory_kb": 1920}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s791197134", "group_id": "codeNet:p02578", "input_text": "#include <stdio.h>\nint main()\n{\n    long long int N;\n\tlong long int a[1000000000], T, i;\n\tscanf(\"%lld\", &N);\n\tT=0;\n\tfor(i=0;i<N;i++)\n\t{\n\t\tscanf(\"%lld\", &a[i]);\n\t}\n\tfor(i=1;i<N;i++)\n\t{\n\tif(a[i]<a[i-1])\n\t{\n\t\tT+=a[i-1]-a[i];\n\t}\n\t}\n\tprintf(\"%lld\", T);\n\treturn 0;\n}", "language": "C", "metadata": {"date": 1598125880, "filename_ext": "c", "original_language": "C (GCC 9.2.1)", "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/C/s791197134.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s791197134", "user_id": "u394660706"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "#include <stdio.h>\nint main()\n{\n    long long int N;\n\tlong long int a[1000000000], T, i;\n\tscanf(\"%lld\", &N);\n\tT=0;\n\tfor(i=0;i<N;i++)\n\t{\n\t\tscanf(\"%lld\", &a[i]);\n\t}\n\tfor(i=1;i<N;i++)\n\t{\n\tif(a[i]<a[i-1])\n\t{\n\t\tT+=a[i-1]-a[i];\n\t}\n\t}\n\tprintf(\"%lld\", T);\n\treturn 0;\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": 260, "cpu_time_ms": 120, "memory_kb": 1380}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s588934487", "group_id": "codeNet:p02579", "input_text": "#include <stdio.h>\n\nint main()\n{\n\tint i, H, W, C[2], D[2];\n\tchar S[1010][1010] = {};\n\tscanf(\"%d %d\", &H, &W);\n\tscanf(\"%d %d\", &(C[0]), &(C[1]));\n\tscanf(\"%d %d\", &(D[0]), &(D[1]));\n\tfor (i = 5; i < H + 5; i++) scanf(\"%s\", &(S[i][5]));\n\t\n\tshort q[2000001][2];\n\tint j, k, l, dist[1010][1010], head, tail;\n\tfor (i = 5; i < H + 5; i++) {\n\t\tfor (j = 5; j < W + 5; j++) dist[i][j] = 10000;\n\t}\n\tdist[C[0]+4][C[1]+4] = 0;\n\tq[1000000][0] = C[0] + 4;\n\tq[1000000][1] = C[1] + 4;\n\tfor (head = 1000000, tail = 1000001; head < tail; head++) {\n\t\ti = q[head][0];\n\t\tj = q[head][1];\n\t\t\n\t\tif (S[i-1][j] == '.' && dist[i-1][j] > dist[i][j]) {\n\t\t\tdist[i-1][j] = dist[i][j];\n\t\t\tq[head][0] = i - 1;\n\t\t\tq[head--][1] = j;\n\t\t}\n\t\tif (S[i+1][j] == '.' && dist[i+1][j] > dist[i][j]) {\n\t\t\tdist[i+1][j] = dist[i][j];\n\t\t\tq[head][0] = i + 1;\n\t\t\tq[head--][1] = j;\n\t\t}\n\t\tif (S[i][j-1] == '.' && dist[i][j-1] > dist[i][j]) {\n\t\t\tdist[i][j-1] = dist[i][j];\n\t\t\tq[head][0] = i;\n\t\t\tq[head--][1] = j - 1;\n\t\t}\n\t\tif (S[i][j+1] == '.' && dist[i][j+1] > dist[i][j]) {\n\t\t\tdist[i][j+1] = dist[i][j];\n\t\t\tq[head][0] = i;\n\t\t\tq[head--][1] = j + 1;\n\t\t}\n\n\t\tfor (k = i - 2; k <= i + 2; k++) {\n\t\t\tfor (l = j - 2; l <= j + 2; l++) {\n\t\t\t\tif (S[k][l] == '.' && dist[k][l] > dist[i][j] + 1) {\n\t\t\t\t\tdist[k][l] = dist[i][j] + 1;\n\t\t\t\t\tq[tail][0] = k;\n\t\t\t\t\tq[tail++][1] = l;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\t\n\tif (dist[D[0]+4][D[1]+4] < 10000) printf(\"%d\\n\", dist[D[0]+4][D[1]+4]);\n\telse printf(\"-1\\n\");\n\tfflush(stdout);\n\treturn 0;\n}", "language": "C", "metadata": {"date": 1599073118, "filename_ext": "c", "original_language": "C (GCC 9.2.1)", "problem_description_relpath": "problem_descriptions/p02579.html", "problem_id": "p02579", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02579/input.txt", "sample_output_relpath": "derived/input_output/data/p02579/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02579/C/s588934487.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s588934487", "user_id": "u943800443"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "#include <stdio.h>\n\nint main()\n{\n\tint i, H, W, C[2], D[2];\n\tchar S[1010][1010] = {};\n\tscanf(\"%d %d\", &H, &W);\n\tscanf(\"%d %d\", &(C[0]), &(C[1]));\n\tscanf(\"%d %d\", &(D[0]), &(D[1]));\n\tfor (i = 5; i < H + 5; i++) scanf(\"%s\", &(S[i][5]));\n\t\n\tshort q[2000001][2];\n\tint j, k, l, dist[1010][1010], head, tail;\n\tfor (i = 5; i < H + 5; i++) {\n\t\tfor (j = 5; j < W + 5; j++) dist[i][j] = 10000;\n\t}\n\tdist[C[0]+4][C[1]+4] = 0;\n\tq[1000000][0] = C[0] + 4;\n\tq[1000000][1] = C[1] + 4;\n\tfor (head = 1000000, tail = 1000001; head < tail; head++) {\n\t\ti = q[head][0];\n\t\tj = q[head][1];\n\t\t\n\t\tif (S[i-1][j] == '.' && dist[i-1][j] > dist[i][j]) {\n\t\t\tdist[i-1][j] = dist[i][j];\n\t\t\tq[head][0] = i - 1;\n\t\t\tq[head--][1] = j;\n\t\t}\n\t\tif (S[i+1][j] == '.' && dist[i+1][j] > dist[i][j]) {\n\t\t\tdist[i+1][j] = dist[i][j];\n\t\t\tq[head][0] = i + 1;\n\t\t\tq[head--][1] = j;\n\t\t}\n\t\tif (S[i][j-1] == '.' && dist[i][j-1] > dist[i][j]) {\n\t\t\tdist[i][j-1] = dist[i][j];\n\t\t\tq[head][0] = i;\n\t\t\tq[head--][1] = j - 1;\n\t\t}\n\t\tif (S[i][j+1] == '.' && dist[i][j+1] > dist[i][j]) {\n\t\t\tdist[i][j+1] = dist[i][j];\n\t\t\tq[head][0] = i;\n\t\t\tq[head--][1] = j + 1;\n\t\t}\n\n\t\tfor (k = i - 2; k <= i + 2; k++) {\n\t\t\tfor (l = j - 2; l <= j + 2; l++) {\n\t\t\t\tif (S[k][l] == '.' && dist[k][l] > dist[i][j] + 1) {\n\t\t\t\t\tdist[k][l] = dist[i][j] + 1;\n\t\t\t\t\tq[tail][0] = k;\n\t\t\t\t\tq[tail++][1] = l;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\t\n\tif (dist[D[0]+4][D[1]+4] < 10000) printf(\"%d\\n\", dist[D[0]+4][D[1]+4]);\n\telse printf(\"-1\\n\");\n\tfflush(stdout);\n\treturn 0;\n}", "problem_context": "Score : 400 points\n\nProblem Statement\n\nA maze is composed of a grid of H \\times W squares - H vertical, W horizontal.\n\nThe square at the i-th row from the top and the j-th column from the left - (i,j) - is a wall if S_{ij} is # and a road if S_{ij} is ..\n\nThere is a magician in (C_h,C_w). He can do the following two kinds of moves:\n\nMove A: Walk to a road square that is vertically or horizontally adjacent to the square he is currently in.\n\nMove B: Use magic to warp himself to a road square in the 5\\times 5 area centered at the square he is currently in.\n\nIn either case, he cannot go out of the maze.\n\nAt least how many times does he need to use the magic to reach (D_h, D_w)?\n\nConstraints\n\n1 \\leq H,W \\leq 10^3\n\n1 \\leq C_h,D_h \\leq H\n\n1 \\leq C_w,D_w \\leq W\n\nS_{ij} is # or ..\n\nS_{C_h C_w} and S_{D_h D_w} are ..\n\n(C_h,C_w) \\neq (D_h,D_w)\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W\nC_h C_w\nD_h D_w\nS_{11}\\ldots S_{1W}\n\\vdots\nS_{H1}\\ldots S_{HW}\n\nOutput\n\nPrint the minimum number of times the magician needs to use the magic. If he cannot reach (D_h,D_w), print -1 instead.\n\nSample Input 1\n\n4 4\n1 1\n4 4\n..#.\n..#.\n.#..\n.#..\n\nSample Output 1\n\n1\n\nFor example, by walking to (2,2) and then using the magic to travel to (4,4), just one use of magic is enough.\n\nNote that he cannot walk diagonally.\n\nSample Input 2\n\n4 4\n1 4\n4 1\n.##.\n####\n####\n.##.\n\nSample Output 2\n\n-1\n\nHe cannot move from there.\n\nSample Input 3\n\n4 4\n2 2\n3 3\n....\n....\n....\n....\n\nSample Output 3\n\n0\n\nNo use of magic is needed.\n\nSample Input 4\n\n4 5\n1 2\n2 5\n#.###\n####.\n#..##\n#..##\n\nSample Output 4\n\n2", "sample_input": "4 4\n1 1\n4 4\n..#.\n..#.\n.#..\n.#..\n"}, "reference_outputs": ["1\n"], "source_document_id": "p02579", "source_text": "Score : 400 points\n\nProblem Statement\n\nA maze is composed of a grid of H \\times W squares - H vertical, W horizontal.\n\nThe square at the i-th row from the top and the j-th column from the left - (i,j) - is a wall if S_{ij} is # and a road if S_{ij} is ..\n\nThere is a magician in (C_h,C_w). He can do the following two kinds of moves:\n\nMove A: Walk to a road square that is vertically or horizontally adjacent to the square he is currently in.\n\nMove B: Use magic to warp himself to a road square in the 5\\times 5 area centered at the square he is currently in.\n\nIn either case, he cannot go out of the maze.\n\nAt least how many times does he need to use the magic to reach (D_h, D_w)?\n\nConstraints\n\n1 \\leq H,W \\leq 10^3\n\n1 \\leq C_h,D_h \\leq H\n\n1 \\leq C_w,D_w \\leq W\n\nS_{ij} is # or ..\n\nS_{C_h C_w} and S_{D_h D_w} are ..\n\n(C_h,C_w) \\neq (D_h,D_w)\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W\nC_h C_w\nD_h D_w\nS_{11}\\ldots S_{1W}\n\\vdots\nS_{H1}\\ldots S_{HW}\n\nOutput\n\nPrint the minimum number of times the magician needs to use the magic. If he cannot reach (D_h,D_w), print -1 instead.\n\nSample Input 1\n\n4 4\n1 1\n4 4\n..#.\n..#.\n.#..\n.#..\n\nSample Output 1\n\n1\n\nFor example, by walking to (2,2) and then using the magic to travel to (4,4), just one use of magic is enough.\n\nNote that he cannot walk diagonally.\n\nSample Input 2\n\n4 4\n1 4\n4 1\n.##.\n####\n####\n.##.\n\nSample Output 2\n\n-1\n\nHe cannot move from there.\n\nSample Input 3\n\n4 4\n2 2\n3 3\n....\n....\n....\n....\n\nSample Output 3\n\n0\n\nNo use of magic is needed.\n\nSample Input 4\n\n4 5\n1 2\n2 5\n#.###\n####.\n#..##\n#..##\n\nSample Output 4\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": 1454, "cpu_time_ms": 132, "memory_kb": 8568}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s300883026", "group_id": "codeNet:p02582", "input_text": "#include<stdio.h>\nint main(void) {\n  char s[4];\n  int i,r=0,j=0;\n  for(i=1;i<4;i++)scanf(\"%c\",&s[i]);\n  if(s[1]=='R')j=1;r=1;\n  for(i=2;i<4;i++){\n    if(j==1){\n      if(s[i]=='R')r++;\n      else j=0;\n    }\n    else {\n      if(s[i]=='R')r=1;j=1;\n    }\n  }\n  printf(\"%d\",r);\n  return 0;\n}", "language": "C", "metadata": {"date": 1598455393, "filename_ext": "c", "original_language": "C (GCC 9.2.1)", "problem_description_relpath": "problem_descriptions/p02582.html", "problem_id": "p02582", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02582/input.txt", "sample_output_relpath": "derived/input_output/data/p02582/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02582/C/s300883026.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s300883026", "user_id": "u951437531"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "#include<stdio.h>\nint main(void) {\n  char s[4];\n  int i,r=0,j=0;\n  for(i=1;i<4;i++)scanf(\"%c\",&s[i]);\n  if(s[1]=='R')j=1;r=1;\n  for(i=2;i<4;i++){\n    if(j==1){\n      if(s[i]=='R')r++;\n      else j=0;\n    }\n    else {\n      if(s[i]=='R')r=1;j=1;\n    }\n  }\n  printf(\"%d\",r);\n  return 0;\n}", "problem_context": "Score : 100 points\n\nProblem Statement\n\nWe have weather records at AtCoder Town for some consecutive three days. A string of length 3, S, represents the records - if the i-th character is S, it means it was sunny on the i-th day; if that character is R, it means it was rainy on that day.\n\nFind the maximum number of consecutive rainy days in this period.\n\nConstraints\n\n|S| = 3\n\nEach character of S is S or R.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the maximum number of consecutive rainy days in the period.\n\nSample Input 1\n\nRRS\n\nSample Output 1\n\n2\n\nWe had rain on the 1-st and 2-nd days in the period. Here, the maximum number of consecutive rainy days is 2, so we should print 2.\n\nSample Input 2\n\nSSS\n\nSample Output 2\n\n0\n\nIt was sunny throughout the period. We had no rainy days, so we should print 0.\n\nSample Input 3\n\nRSR\n\nSample Output 3\n\n1\n\nWe had rain on the 1-st and 3-rd days - two \"streaks\" of one rainy day, so we should print 1.", "sample_input": "RRS\n"}, "reference_outputs": ["2\n"], "source_document_id": "p02582", "source_text": "Score : 100 points\n\nProblem Statement\n\nWe have weather records at AtCoder Town for some consecutive three days. A string of length 3, S, represents the records - if the i-th character is S, it means it was sunny on the i-th day; if that character is R, it means it was rainy on that day.\n\nFind the maximum number of consecutive rainy days in this period.\n\nConstraints\n\n|S| = 3\n\nEach character of S is S or R.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the maximum number of consecutive rainy days in the period.\n\nSample Input 1\n\nRRS\n\nSample Output 1\n\n2\n\nWe had rain on the 1-st and 2-nd days in the period. Here, the maximum number of consecutive rainy days is 2, so we should print 2.\n\nSample Input 2\n\nSSS\n\nSample Output 2\n\n0\n\nIt was sunny throughout the period. We had no rainy days, so we should print 0.\n\nSample Input 3\n\nRSR\n\nSample Output 3\n\n1\n\nWe had rain on the 1-st and 3-rd days - two \"streaks\" of one rainy day, so we should print 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": 286, "cpu_time_ms": 6, "memory_kb": 1672}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s140293477", "group_id": "codeNet:p02582", "input_text": "#include <stdio.h>\n\nint main(void){\n  char S[32];\n  int i, ans=0,tmp=0;\n  scanf(\"%s\",S);\n  \n  for(i = 0;i<3;i++){ \n    if(S[i-1] == 'R'){\n      if(S[i] == 'R'){\n        tmp++;\n      }\n    }else{\n      if(S[i] == 'R'){\n        tmp=1;\n      }\n    }\n    if(ans<tmp){\n      ans=tmp;\n    }\n  }\n  printf(\"%d\",ans);\n  return 0;\n}", "language": "C", "metadata": {"date": 1597983527, "filename_ext": "c", "original_language": "C (Clang 10.0.0)", "problem_description_relpath": "problem_descriptions/p02582.html", "problem_id": "p02582", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02582/input.txt", "sample_output_relpath": "derived/input_output/data/p02582/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02582/C/s140293477.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s140293477", "user_id": "u967484343"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "#include <stdio.h>\n\nint main(void){\n  char S[32];\n  int i, ans=0,tmp=0;\n  scanf(\"%s\",S);\n  \n  for(i = 0;i<3;i++){ \n    if(S[i-1] == 'R'){\n      if(S[i] == 'R'){\n        tmp++;\n      }\n    }else{\n      if(S[i] == 'R'){\n        tmp=1;\n      }\n    }\n    if(ans<tmp){\n      ans=tmp;\n    }\n  }\n  printf(\"%d\",ans);\n  return 0;\n}", "problem_context": "Score : 100 points\n\nProblem Statement\n\nWe have weather records at AtCoder Town for some consecutive three days. A string of length 3, S, represents the records - if the i-th character is S, it means it was sunny on the i-th day; if that character is R, it means it was rainy on that day.\n\nFind the maximum number of consecutive rainy days in this period.\n\nConstraints\n\n|S| = 3\n\nEach character of S is S or R.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the maximum number of consecutive rainy days in the period.\n\nSample Input 1\n\nRRS\n\nSample Output 1\n\n2\n\nWe had rain on the 1-st and 2-nd days in the period. Here, the maximum number of consecutive rainy days is 2, so we should print 2.\n\nSample Input 2\n\nSSS\n\nSample Output 2\n\n0\n\nIt was sunny throughout the period. We had no rainy days, so we should print 0.\n\nSample Input 3\n\nRSR\n\nSample Output 3\n\n1\n\nWe had rain on the 1-st and 3-rd days - two \"streaks\" of one rainy day, so we should print 1.", "sample_input": "RRS\n"}, "reference_outputs": ["2\n"], "source_document_id": "p02582", "source_text": "Score : 100 points\n\nProblem Statement\n\nWe have weather records at AtCoder Town for some consecutive three days. A string of length 3, S, represents the records - if the i-th character is S, it means it was sunny on the i-th day; if that character is R, it means it was rainy on that day.\n\nFind the maximum number of consecutive rainy days in this period.\n\nConstraints\n\n|S| = 3\n\nEach character of S is S or R.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the maximum number of consecutive rainy days in the period.\n\nSample Input 1\n\nRRS\n\nSample Output 1\n\n2\n\nWe had rain on the 1-st and 2-nd days in the period. Here, the maximum number of consecutive rainy days is 2, so we should print 2.\n\nSample Input 2\n\nSSS\n\nSample Output 2\n\n0\n\nIt was sunny throughout the period. We had no rainy days, so we should print 0.\n\nSample Input 3\n\nRSR\n\nSample Output 3\n\n1\n\nWe had rain on the 1-st and 3-rd days - two \"streaks\" of one rainy day, so we should print 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": 322, "cpu_time_ms": 6, "memory_kb": 2080}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s195933329", "group_id": "codeNet:p02582", "input_text": "#include<stdio.h>\nint main()\n{\n  int i,j=0,k=0;\n  char str[200]={};\n  scanf(\"%s\",str);\n  for(i=0;i<=3;i++){\n    if('S'==str[i]){\n      j=j+1;\n    }\n  }\n  for(i=0;i<=3;i++){\n    if('R'==str[i]){\n      k=k+1;\n    }\n  }\n   if(j==3 || k==3){\n    printf(\"0\");\n      return 0;\n  }\n   if(str[2]=='R'&& j!=2){\n    printf(\"1\");\n  }\n  if(j<k){\n    printf(\"%d\",k);\n  }\n  else{\n    printf(\"%d\",j);\n  }\n  return 0;\n}", "language": "C", "metadata": {"date": 1597849310, "filename_ext": "c", "original_language": "C (GCC 9.2.1)", "problem_description_relpath": "problem_descriptions/p02582.html", "problem_id": "p02582", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02582/input.txt", "sample_output_relpath": "derived/input_output/data/p02582/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02582/C/s195933329.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s195933329", "user_id": "u718314646"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "#include<stdio.h>\nint main()\n{\n  int i,j=0,k=0;\n  char str[200]={};\n  scanf(\"%s\",str);\n  for(i=0;i<=3;i++){\n    if('S'==str[i]){\n      j=j+1;\n    }\n  }\n  for(i=0;i<=3;i++){\n    if('R'==str[i]){\n      k=k+1;\n    }\n  }\n   if(j==3 || k==3){\n    printf(\"0\");\n      return 0;\n  }\n   if(str[2]=='R'&& j!=2){\n    printf(\"1\");\n  }\n  if(j<k){\n    printf(\"%d\",k);\n  }\n  else{\n    printf(\"%d\",j);\n  }\n  return 0;\n}", "problem_context": "Score : 100 points\n\nProblem Statement\n\nWe have weather records at AtCoder Town for some consecutive three days. A string of length 3, S, represents the records - if the i-th character is S, it means it was sunny on the i-th day; if that character is R, it means it was rainy on that day.\n\nFind the maximum number of consecutive rainy days in this period.\n\nConstraints\n\n|S| = 3\n\nEach character of S is S or R.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the maximum number of consecutive rainy days in the period.\n\nSample Input 1\n\nRRS\n\nSample Output 1\n\n2\n\nWe had rain on the 1-st and 2-nd days in the period. Here, the maximum number of consecutive rainy days is 2, so we should print 2.\n\nSample Input 2\n\nSSS\n\nSample Output 2\n\n0\n\nIt was sunny throughout the period. We had no rainy days, so we should print 0.\n\nSample Input 3\n\nRSR\n\nSample Output 3\n\n1\n\nWe had rain on the 1-st and 3-rd days - two \"streaks\" of one rainy day, so we should print 1.", "sample_input": "RRS\n"}, "reference_outputs": ["2\n"], "source_document_id": "p02582", "source_text": "Score : 100 points\n\nProblem Statement\n\nWe have weather records at AtCoder Town for some consecutive three days. A string of length 3, S, represents the records - if the i-th character is S, it means it was sunny on the i-th day; if that character is R, it means it was rainy on that day.\n\nFind the maximum number of consecutive rainy days in this period.\n\nConstraints\n\n|S| = 3\n\nEach character of S is S or R.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the maximum number of consecutive rainy days in the period.\n\nSample Input 1\n\nRRS\n\nSample Output 1\n\n2\n\nWe had rain on the 1-st and 2-nd days in the period. Here, the maximum number of consecutive rainy days is 2, so we should print 2.\n\nSample Input 2\n\nSSS\n\nSample Output 2\n\n0\n\nIt was sunny throughout the period. We had no rainy days, so we should print 0.\n\nSample Input 3\n\nRSR\n\nSample Output 3\n\n1\n\nWe had rain on the 1-st and 3-rd days - two \"streaks\" of one rainy day, so we should print 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": 403, "cpu_time_ms": 4, "memory_kb": 1688}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s346880242", "group_id": "codeNet:p02582", "input_text": "#include<stdio.h>\nint main(void){\n  char S[3];\n  int i,r=0;\n  printf(\"%c\\n\",S);\n  for(i=0;i<4;i++){\n    if(S[i]=='R')r++;\n  }\n  printf(\"%d\",r);\n  return 0;\n}\n", "language": "C", "metadata": {"date": 1597673278, "filename_ext": "c", "original_language": "C (GCC 9.2.1)", "problem_description_relpath": "problem_descriptions/p02582.html", "problem_id": "p02582", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02582/input.txt", "sample_output_relpath": "derived/input_output/data/p02582/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02582/C/s346880242.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s346880242", "user_id": "u951437531"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "#include<stdio.h>\nint main(void){\n  char S[3];\n  int i,r=0;\n  printf(\"%c\\n\",S);\n  for(i=0;i<4;i++){\n    if(S[i]=='R')r++;\n  }\n  printf(\"%d\",r);\n  return 0;\n}\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nWe have weather records at AtCoder Town for some consecutive three days. A string of length 3, S, represents the records - if the i-th character is S, it means it was sunny on the i-th day; if that character is R, it means it was rainy on that day.\n\nFind the maximum number of consecutive rainy days in this period.\n\nConstraints\n\n|S| = 3\n\nEach character of S is S or R.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the maximum number of consecutive rainy days in the period.\n\nSample Input 1\n\nRRS\n\nSample Output 1\n\n2\n\nWe had rain on the 1-st and 2-nd days in the period. Here, the maximum number of consecutive rainy days is 2, so we should print 2.\n\nSample Input 2\n\nSSS\n\nSample Output 2\n\n0\n\nIt was sunny throughout the period. We had no rainy days, so we should print 0.\n\nSample Input 3\n\nRSR\n\nSample Output 3\n\n1\n\nWe had rain on the 1-st and 3-rd days - two \"streaks\" of one rainy day, so we should print 1.", "sample_input": "RRS\n"}, "reference_outputs": ["2\n"], "source_document_id": "p02582", "source_text": "Score : 100 points\n\nProblem Statement\n\nWe have weather records at AtCoder Town for some consecutive three days. A string of length 3, S, represents the records - if the i-th character is S, it means it was sunny on the i-th day; if that character is R, it means it was rainy on that day.\n\nFind the maximum number of consecutive rainy days in this period.\n\nConstraints\n\n|S| = 3\n\nEach character of S is S or R.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the maximum number of consecutive rainy days in the period.\n\nSample Input 1\n\nRRS\n\nSample Output 1\n\n2\n\nWe had rain on the 1-st and 2-nd days in the period. Here, the maximum number of consecutive rainy days is 2, so we should print 2.\n\nSample Input 2\n\nSSS\n\nSample Output 2\n\n0\n\nIt was sunny throughout the period. We had no rainy days, so we should print 0.\n\nSample Input 3\n\nRSR\n\nSample Output 3\n\n1\n\nWe had rain on the 1-st and 3-rd days - two \"streaks\" of one rainy day, so we should print 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": 158, "cpu_time_ms": 7, "memory_kb": 1580}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s637893580", "group_id": "codeNet:p02584", "input_text": "#include<stdio.h>\n#include<stdlib.h>\n#include<math.h>\n\nint main(void)\n{\n    int X,K,D;\n    int n;\n  int t;\n  int min = X + K*D;\n    \n    scanf(\"%d,%d,%d\",&X,&K,&D);\n    for (n = 0; n < K; n++)\n    {\n        t = 0;\n      t = X;\n      t += 2*n*D -K*D;\n        t = abs(t);\n        if (t < min)\n        {\n            min = t;\n        }\n        if (min == 0)\n        {\n            break;\n        }\n        \n    }\n    \n    printf(\"%d\",min);\n    \n\n\n\n    return 0;\n    \n\n\n\n}", "language": "C", "metadata": {"date": 1597525792, "filename_ext": "c", "original_language": "C (GCC 9.2.1)", "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/C/s637893580.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s637893580", "user_id": "u998899864"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "#include<stdio.h>\n#include<stdlib.h>\n#include<math.h>\n\nint main(void)\n{\n    int X,K,D;\n    int n;\n  int t;\n  int min = X + K*D;\n    \n    scanf(\"%d,%d,%d\",&X,&K,&D);\n    for (n = 0; n < K; n++)\n    {\n        t = 0;\n      t = X;\n      t += 2*n*D -K*D;\n        t = abs(t);\n        if (t < min)\n        {\n            min = t;\n        }\n        if (min == 0)\n        {\n            break;\n        }\n        \n    }\n    \n    printf(\"%d\",min);\n    \n\n\n\n    return 0;\n    \n\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": 466, "cpu_time_ms": 1567, "memory_kb": 1720}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s969519631", "group_id": "codeNet:p02584", "input_text": "#include<stdio.h>\n#include<string.h>\n#include<math.h>\n\n#define LLD_ABS(x) (((x) >= 0 ) ? (x) : (-x))\n\nint main()\n{\n    long long int x, k, d, answer, abs_x, req_d_num;\n\n    scanf(\"%lld %lld %lld\", &x, &k, &d);\n\n    abs_x = LLD_ABS(x);\n\n    req_d_num = abs_x/d;\n\n    if (req_d_num >= k)\n    {\n        answer = abs_x - d*k;\n    } else {\n        if (((k - req_d_num)%2) == 1)\n        {\n            answer = (d - (abs_x%d));\n        } else {\n            answer = abs_x%d;\n        }\n    }\n\n    printf(\"%lld\", answer);\n\n    return 0;\n}", "language": "C", "metadata": {"date": 1597521826, "filename_ext": "c", "original_language": "C (GCC 9.2.1)", "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/C/s969519631.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s969519631", "user_id": "u757753683"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "#include<stdio.h>\n#include<string.h>\n#include<math.h>\n\n#define LLD_ABS(x) (((x) >= 0 ) ? (x) : (-x))\n\nint main()\n{\n    long long int x, k, d, answer, abs_x, req_d_num;\n\n    scanf(\"%lld %lld %lld\", &x, &k, &d);\n\n    abs_x = LLD_ABS(x);\n\n    req_d_num = abs_x/d;\n\n    if (req_d_num >= k)\n    {\n        answer = abs_x - d*k;\n    } else {\n        if (((k - req_d_num)%2) == 1)\n        {\n            answer = (d - (abs_x%d));\n        } else {\n            answer = abs_x%d;\n        }\n    }\n\n    printf(\"%lld\", answer);\n\n    return 0;\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": 529, "cpu_time_ms": 8, "memory_kb": 1736}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s720343619", "group_id": "codeNet:p02584", "input_text": "#include<stdio.h>\n#include<stdlib.h>\n#include<math.h>\n#include<string.h>\n//if(strcmp(s[i],\"AC\")==0)\n//if(s[l]=='#')\n/*小文字判定\nif((moji>= 'a') && (moji<='z')){\n    printf(\"a\\n\");\n    return 0;\n  }\n  */\n\nint W_Length(char *str){\n\tint length = 0;\n\twhile(*str++ != '\\0')\n\t\tlength++;\n\treturn length;\n}\n\nvoid swap(int *a, int *b){\n  int temp;\n  temp=*a;\n  *a=*b;\n  *b=temp;\n}\n//swap(&a, &b)\n\ndouble deg(double theta){//deg to theta\nreturn theta*(2*3.14159265359)/360;\n}\n\nint cmp( const void *p, const void *q ) {\n    return *(int*)p - *(int*)q;\n}//ちいさい順\n//qsort(a,n,sizeof(int),cmp);\n//char s[n][11]\n\nint cmp_s(const void * left, const void * right)\n{\n\tchar *left_char = (char *)left;\n  char *right_char = (char *)right;\n  return strcmp(left_char, right_char);\n}\n//qsort(s,n,sizeof(s[0]),cmp_s);\n\n\nint main (void)\n{\n\tlong long int a,k,d,b,c,n,i,x,temp;\n  char s[200005];\n\nscanf(\"%lld %lld %lld\",&x,&k,&d);\n  //printf(\"x=%lld, k=%lld, d=%lld\",x,k,d);\n  if(d<=-1){\n  d=-d;\n  }\n  \n    temp=x/d;\n  if(x>d){\n    if(temp>=k){\n    printf(\"%lld\\n\",x-k*d);\n      return 0;\n    }\n  }\n  \n    k=k-temp;\n  \n  if(k%2==0){\n  printf(\"%lld\\n\",x-d*temp);\n    return 0;\n  }\n  else{\n  printf(\"%lld\\n\",d*(temp+1)-x);\n    //printf(\"k=%lld, temp=%lld, x=%lld\",k,temp,x);\n  }\n\t\nreturn 0;\n}\n", "language": "C", "metadata": {"date": 1597521170, "filename_ext": "c", "original_language": "C (GCC 9.2.1)", "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/C/s720343619.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s720343619", "user_id": "u770369399"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "#include<stdio.h>\n#include<stdlib.h>\n#include<math.h>\n#include<string.h>\n//if(strcmp(s[i],\"AC\")==0)\n//if(s[l]=='#')\n/*小文字判定\nif((moji>= 'a') && (moji<='z')){\n    printf(\"a\\n\");\n    return 0;\n  }\n  */\n\nint W_Length(char *str){\n\tint length = 0;\n\twhile(*str++ != '\\0')\n\t\tlength++;\n\treturn length;\n}\n\nvoid swap(int *a, int *b){\n  int temp;\n  temp=*a;\n  *a=*b;\n  *b=temp;\n}\n//swap(&a, &b)\n\ndouble deg(double theta){//deg to theta\nreturn theta*(2*3.14159265359)/360;\n}\n\nint cmp( const void *p, const void *q ) {\n    return *(int*)p - *(int*)q;\n}//ちいさい順\n//qsort(a,n,sizeof(int),cmp);\n//char s[n][11]\n\nint cmp_s(const void * left, const void * right)\n{\n\tchar *left_char = (char *)left;\n  char *right_char = (char *)right;\n  return strcmp(left_char, right_char);\n}\n//qsort(s,n,sizeof(s[0]),cmp_s);\n\n\nint main (void)\n{\n\tlong long int a,k,d,b,c,n,i,x,temp;\n  char s[200005];\n\nscanf(\"%lld %lld %lld\",&x,&k,&d);\n  //printf(\"x=%lld, k=%lld, d=%lld\",x,k,d);\n  if(d<=-1){\n  d=-d;\n  }\n  \n    temp=x/d;\n  if(x>d){\n    if(temp>=k){\n    printf(\"%lld\\n\",x-k*d);\n      return 0;\n    }\n  }\n  \n    k=k-temp;\n  \n  if(k%2==0){\n  printf(\"%lld\\n\",x-d*temp);\n    return 0;\n  }\n  else{\n  printf(\"%lld\\n\",d*(temp+1)-x);\n    //printf(\"k=%lld, temp=%lld, x=%lld\",k,temp,x);\n  }\n\t\nreturn 0;\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": 1278, "cpu_time_ms": 5, "memory_kb": 1720}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s166493151", "group_id": "codeNet:p02588", "input_text": "#include <stdio.h>\n#include <stdlib.h>\n#include <string.h>\n#include <math.h>\n#define ll long long\n#define rep(i,l,r)for(ll i=(l);i<(r);i++)\n#define repp(i,l,r,k)for(ll i=(l);i<(r);i+=(k))\n#define INF ((1LL<<62)-(1LL<<31))\n#define max(p,q)((p)>(q)?(p):(q))\n#define min(p,q)((p)<(q)?(p):(q))\n#define bit(n,m)(((n)>>(m))&1)\nint upll(const void*a, const void*b){return*(ll*)a<*(ll*)b?-1:*(ll*)a>*(ll*)b?1:0;}\nint downll(const void*a, const void*b){return*(ll*)a<*(ll*)b?1:*(ll*)a>*(ll*)b?-1:0;}\nvoid sortup(ll*a,int n){qsort(a,n,sizeof(ll),upll);}\nvoid sortdown(ll*a,int n){qsort(a,n,sizeof(ll),downll);}\nll pom(ll a,ll n,int m){ll x=1;for(a%=m;n;n/=2)n&1?x=x*a%m:0,a=a*a%m;return x;}\n//#define MOD 998244353\n#define MOD 1000000007\n#define invp(a,p)pom(a,p-2,p)\n\nll a[100][100];\n\nint main(){\n\tint n;\n\tscanf(\"%d\",&n);\n\trep(_,0,n){\n\t\tchar s[20]={};\n\t\tscanf(\"%s\",s);\n\t\tint p=-1;\n\t\tfor(int i=0;i<20;i++)if(s[i]=='.')p=i;\n\t\tll x;\n\t\tsscanf(s,\"%lld\",&x);\n\t\trep(i,0,9)x*=10;\n\t\tif(p==-1){\n\t\t}else{\n\t\t\tll d;\n\t\t\tsscanf(s+p+1,\"%lld\",&d);\n\t\t\tint z=9-strlen(s+p+1);\n\t\t\trep(i,0,z)d*=10;\n\t\t\tx+=d;\n\t\t}\n\t\t//printf(\"%lld\\n\",x);\n\t\tint p2=0,p5=0;\n\t\twhile(x%2==0)x/=2,p2++;\n\t\twhile(x%5==0)x/=5,p5++;\n\t\ta[p2][p5]++;\n\t\t//printf(\"%lld %lld\\n\",p2,p5);\n\t}\n\t\n\tll ans=0;\n\trep(i,0,50)rep(j,0,50)rep(ii,0,50)rep(jj,0,50){\n\t\tif(i+ii>=18&&j+jj>=18){\n\t\t\tans+=a[i][j]*a[ii][jj];\n\t\t\tif(i==ii&&j==jj)ans-=a[i][j];\n\t\t}\n\t}\n\tprintf(\"%lld\\n\",ans/2);\n\t\n}", "language": "C", "metadata": {"date": 1597026813, "filename_ext": "c", "original_language": "C (GCC 9.2.1)", "problem_description_relpath": "problem_descriptions/p02588.html", "problem_id": "p02588", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02588/input.txt", "sample_output_relpath": "derived/input_output/data/p02588/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02588/C/s166493151.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s166493151", "user_id": "u382163500"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "#include <stdio.h>\n#include <stdlib.h>\n#include <string.h>\n#include <math.h>\n#define ll long long\n#define rep(i,l,r)for(ll i=(l);i<(r);i++)\n#define repp(i,l,r,k)for(ll i=(l);i<(r);i+=(k))\n#define INF ((1LL<<62)-(1LL<<31))\n#define max(p,q)((p)>(q)?(p):(q))\n#define min(p,q)((p)<(q)?(p):(q))\n#define bit(n,m)(((n)>>(m))&1)\nint upll(const void*a, const void*b){return*(ll*)a<*(ll*)b?-1:*(ll*)a>*(ll*)b?1:0;}\nint downll(const void*a, const void*b){return*(ll*)a<*(ll*)b?1:*(ll*)a>*(ll*)b?-1:0;}\nvoid sortup(ll*a,int n){qsort(a,n,sizeof(ll),upll);}\nvoid sortdown(ll*a,int n){qsort(a,n,sizeof(ll),downll);}\nll pom(ll a,ll n,int m){ll x=1;for(a%=m;n;n/=2)n&1?x=x*a%m:0,a=a*a%m;return x;}\n//#define MOD 998244353\n#define MOD 1000000007\n#define invp(a,p)pom(a,p-2,p)\n\nll a[100][100];\n\nint main(){\n\tint n;\n\tscanf(\"%d\",&n);\n\trep(_,0,n){\n\t\tchar s[20]={};\n\t\tscanf(\"%s\",s);\n\t\tint p=-1;\n\t\tfor(int i=0;i<20;i++)if(s[i]=='.')p=i;\n\t\tll x;\n\t\tsscanf(s,\"%lld\",&x);\n\t\trep(i,0,9)x*=10;\n\t\tif(p==-1){\n\t\t}else{\n\t\t\tll d;\n\t\t\tsscanf(s+p+1,\"%lld\",&d);\n\t\t\tint z=9-strlen(s+p+1);\n\t\t\trep(i,0,z)d*=10;\n\t\t\tx+=d;\n\t\t}\n\t\t//printf(\"%lld\\n\",x);\n\t\tint p2=0,p5=0;\n\t\twhile(x%2==0)x/=2,p2++;\n\t\twhile(x%5==0)x/=5,p5++;\n\t\ta[p2][p5]++;\n\t\t//printf(\"%lld %lld\\n\",p2,p5);\n\t}\n\t\n\tll ans=0;\n\trep(i,0,50)rep(j,0,50)rep(ii,0,50)rep(jj,0,50){\n\t\tif(i+ii>=18&&j+jj>=18){\n\t\t\tans+=a[i][j]*a[ii][jj];\n\t\t\tif(i==ii&&j==jj)ans-=a[i][j];\n\t\t}\n\t}\n\tprintf(\"%lld\\n\",ans/2);\n\t\n}", "problem_context": "Score : 300 points\n\nProblem Statement\n\nYou are given N real values A_1, A_2, \\ldots, A_N.\nCompute the number of pairs of indices (i, j)\nsuch that i < j and the product A_i \\cdot A_j is integer.\n\nConstraints\n\n2 \\leq N \\leq 200\\,000\n\n0 < A_i < 10^4\n\nA_i is given with at most 9 digits after the decimal.\n\nInput\n\nInput is given from Standard Input in the following format.\n\nN\nA_1\nA_2\n\\vdots\nA_N\n\nOutput\n\nPrint the number of pairs with integer product A_i \\cdot A_j (and i < j).\n\nSample Input 1\n\n5\n7.5\n2.4\n17.000000001\n17\n16.000000000\n\nSample Output 1\n\n3\n\nThere are 3 pairs with integer product:\n\n7.5 \\cdot 2.4 = 18\n\n7.5 \\cdot 16 = 120\n\n17 \\cdot 16 = 272\n\nSample Input 2\n\n11\n0.9\n1\n1\n1.25\n2.30000\n5\n70\n0.000000001\n9999.999999999\n0.999999999\n1.000000001\n\nSample Output 2\n\n8", "sample_input": "5\n7.5\n2.4\n17.000000001\n17\n16.000000000\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02588", "source_text": "Score : 300 points\n\nProblem Statement\n\nYou are given N real values A_1, A_2, \\ldots, A_N.\nCompute the number of pairs of indices (i, j)\nsuch that i < j and the product A_i \\cdot A_j is integer.\n\nConstraints\n\n2 \\leq N \\leq 200\\,000\n\n0 < A_i < 10^4\n\nA_i is given with at most 9 digits after the decimal.\n\nInput\n\nInput is given from Standard Input in the following format.\n\nN\nA_1\nA_2\n\\vdots\nA_N\n\nOutput\n\nPrint the number of pairs with integer product A_i \\cdot A_j (and i < j).\n\nSample Input 1\n\n5\n7.5\n2.4\n17.000000001\n17\n16.000000000\n\nSample Output 1\n\n3\n\nThere are 3 pairs with integer product:\n\n7.5 \\cdot 2.4 = 18\n\n7.5 \\cdot 16 = 120\n\n17 \\cdot 16 = 272\n\nSample Input 2\n\n11\n0.9\n1\n1\n1.25\n2.30000\n5\n70\n0.000000001\n9999.999999999\n0.999999999\n1.000000001\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": 1408, "cpu_time_ms": 89, "memory_kb": 1756}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s805159273", "group_id": "codeNet:p02589", "input_text": "#define M 1<<21\nchar*s,T[M],*r=T;H[M][27],h,U[M],V[M],n,k;main(i){for(;gets(r+1);++n)for(k=0;*++r&=31;)U[r-T]=k|=!!n<<*r;for(;--i+2;)for(k=0,s=r;--s>T;k=H[k][*s]=*s?H[k][*s]?:++h:0)n+=i*__builtin_popcount(U[s-T]&(V[k]|=!s[-1]<<*s));printf(\"%d\",1-n);}", "language": "C", "metadata": {"date": 1597894754, "filename_ext": "c", "original_language": "C (GCC 9.2.1)", "problem_description_relpath": "problem_descriptions/p02589.html", "problem_id": "p02589", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02589/input.txt", "sample_output_relpath": "derived/input_output/data/p02589/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02589/C/s805159273.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s805159273", "user_id": "u032223772"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "#define M 1<<21\nchar*s,T[M],*r=T;H[M][27],h,U[M],V[M],n,k;main(i){for(;gets(r+1);++n)for(k=0;*++r&=31;)U[r-T]=k|=!!n<<*r;for(;--i+2;)for(k=0,s=r;--s>T;k=H[k][*s]=*s?H[k][*s]?:++h:0)n+=i*__builtin_popcount(U[s-T]&(V[k]|=!s[-1]<<*s));printf(\"%d\",1-n);}", "problem_context": "Score : 700 points\n\nProblem Statement\n\nLimak can repeatedly remove one of the first two characters of a string,\nfor example abcxyx \\rightarrow acxyx \\rightarrow cxyx \\rightarrow cyx.\n\nYou are given N different strings S_1, S_2, \\ldots, S_N.\nAmong N \\cdot (N-1) / 2 pairs (S_i, S_j),\nin how many pairs could Limak obtain one string from the other?\n\nConstraints\n\n2 \\leq N \\leq 200\\,000\n\nS_i consists of lowercase English letters a-z.\n\nS_i \\neq S_j\n\n1 \\leq |S_i|\n\n|S_1| + |S_2| + \\ldots + |S_N| \\leq 10^6\n\nInput\n\nInput is given from Standard Input in the following format.\n\nN\nS_1\nS_2\n\\vdots\nS_N\n\nOutput\n\nPrint the number of unordered pairs (S_i, S_j)\nwhere i \\neq j and Limak can obtain one string from the other.\n\nSample Input 1\n\n3\nabcxyx\ncyx\nabc\n\nSample Output 1\n\n1\n\nThe only good pair is (abcxyx, cyx).\n\nSample Input 2\n\n6\nb\na\nabc\nc\nd\nab\n\nSample Output 2\n\n5\n\nThere are five good pairs: (b, abc), (a, abc), (abc, c), (b, ab), (a, ab).", "sample_input": "3\nabcxyx\ncyx\nabc\n"}, "reference_outputs": ["1\n"], "source_document_id": "p02589", "source_text": "Score : 700 points\n\nProblem Statement\n\nLimak can repeatedly remove one of the first two characters of a string,\nfor example abcxyx \\rightarrow acxyx \\rightarrow cxyx \\rightarrow cyx.\n\nYou are given N different strings S_1, S_2, \\ldots, S_N.\nAmong N \\cdot (N-1) / 2 pairs (S_i, S_j),\nin how many pairs could Limak obtain one string from the other?\n\nConstraints\n\n2 \\leq N \\leq 200\\,000\n\nS_i consists of lowercase English letters a-z.\n\nS_i \\neq S_j\n\n1 \\leq |S_i|\n\n|S_1| + |S_2| + \\ldots + |S_N| \\leq 10^6\n\nInput\n\nInput is given from Standard Input in the following format.\n\nN\nS_1\nS_2\n\\vdots\nS_N\n\nOutput\n\nPrint the number of unordered pairs (S_i, S_j)\nwhere i \\neq j and Limak can obtain one string from the other.\n\nSample Input 1\n\n3\nabcxyx\ncyx\nabc\n\nSample Output 1\n\n1\n\nThe only good pair is (abcxyx, cyx).\n\nSample Input 2\n\n6\nb\na\nabc\nc\nd\nab\n\nSample Output 2\n\n5\n\nThere are five good pairs: (b, abc), (a, abc), (abc, c), (b, ab), (a, ab).", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 250, "cpu_time_ms": 134, "memory_kb": 115596}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s652513016", "group_id": "codeNet:p02594", "input_text": "#include <stdio.h>\n\nint main()\n{\n  int n;\n  scanf(\"%d\",&n);\n  if(n>=30)\n    printf(\"Yes\");\n  else\n    printf(\"No\");\n}", "language": "C", "metadata": {"date": 1597476492, "filename_ext": "c", "original_language": "C (GCC 9.2.1)", "problem_description_relpath": "problem_descriptions/p02594.html", "problem_id": "p02594", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02594/input.txt", "sample_output_relpath": "derived/input_output/data/p02594/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02594/C/s652513016.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s652513016", "user_id": "u485527728"}, "prompt_components": {"gold_output": "No\n", "input_to_evaluate": "#include <stdio.h>\n\nint main()\n{\n  int n;\n  scanf(\"%d\",&n);\n  if(n>=30)\n    printf(\"Yes\");\n  else\n    printf(\"No\");\n}", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou will turn on the air conditioner if, and only if, the temperature of the room is 30 degrees Celsius or above.\n\nThe current temperature of the room is X degrees Celsius. Will you turn on the air conditioner?\n\nConstraints\n\n-40 \\leq X \\leq 40\n\nX is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX\n\nOutput\n\nPrint Yes if you will turn on the air conditioner; print No otherwise.\n\nSample Input 1\n\n25\n\nSample Output 1\n\nNo\n\nSample Input 2\n\n30\n\nSample Output 2\n\nYes", "sample_input": "25\n"}, "reference_outputs": ["No\n"], "source_document_id": "p02594", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou will turn on the air conditioner if, and only if, the temperature of the room is 30 degrees Celsius or above.\n\nThe current temperature of the room is X degrees Celsius. Will you turn on the air conditioner?\n\nConstraints\n\n-40 \\leq X \\leq 40\n\nX is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX\n\nOutput\n\nPrint Yes if you will turn on the air conditioner; print No otherwise.\n\nSample Input 1\n\n25\n\nSample Output 1\n\nNo\n\nSample Input 2\n\n30\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": 117, "cpu_time_ms": 8, "memory_kb": 1704}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s085542198", "group_id": "codeNet:p02594", "input_text": "#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int x;scanf(\"%d\",&x);if(x>=30)printf(\"YES\\n\");\n    else\n        printf(\"NO\\n\");\n    return 0;\n}\n", "language": "C", "metadata": {"date": 1596417599, "filename_ext": "c", "original_language": "C (GCC 9.2.1)", "problem_description_relpath": "problem_descriptions/p02594.html", "problem_id": "p02594", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02594/input.txt", "sample_output_relpath": "derived/input_output/data/p02594/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02594/C/s085542198.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s085542198", "user_id": "u451660443"}, "prompt_components": {"gold_output": "No\n", "input_to_evaluate": "#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int x;scanf(\"%d\",&x);if(x>=30)printf(\"YES\\n\");\n    else\n        printf(\"NO\\n\");\n    return 0;\n}\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou will turn on the air conditioner if, and only if, the temperature of the room is 30 degrees Celsius or above.\n\nThe current temperature of the room is X degrees Celsius. Will you turn on the air conditioner?\n\nConstraints\n\n-40 \\leq X \\leq 40\n\nX is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX\n\nOutput\n\nPrint Yes if you will turn on the air conditioner; print No otherwise.\n\nSample Input 1\n\n25\n\nSample Output 1\n\nNo\n\nSample Input 2\n\n30\n\nSample Output 2\n\nYes", "sample_input": "25\n"}, "reference_outputs": ["No\n"], "source_document_id": "p02594", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou will turn on the air conditioner if, and only if, the temperature of the room is 30 degrees Celsius or above.\n\nThe current temperature of the room is X degrees Celsius. Will you turn on the air conditioner?\n\nConstraints\n\n-40 \\leq X \\leq 40\n\nX is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX\n\nOutput\n\nPrint Yes if you will turn on the air conditioner; print No otherwise.\n\nSample Input 1\n\n25\n\nSample Output 1\n\nNo\n\nSample Input 2\n\n30\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": 153, "cpu_time_ms": 6, "memory_kb": 1644}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s564923551", "group_id": "codeNet:p02595", "input_text": "#include<stdio.h>\n#include<math.h>\nint main()\n{\n  double a,b,dis;\n  int num;\n  int X[200000];\n  int Y[200000];\n  int count=0;\n  scanf(\"%d　%lf\",&num,&dis);\n  for (int i=0;i<num;i++)\n  {\n    scanf(\"%d %d\",&X[i],&Y[i]);\n    a=X[i];\n    b=Y[i];\n    if(pow(a,2.0)+pow(b,2.0)<=pow(dis,2.0))\n    {\n      count++;\n    }\n       }\n    printf(\"%d\",count);\n    return 0;\n  }", "language": "C", "metadata": {"date": 1598736392, "filename_ext": "c", "original_language": "C (GCC 9.2.1)", "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/C/s564923551.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s564923551", "user_id": "u599056123"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "#include<stdio.h>\n#include<math.h>\nint main()\n{\n  double a,b,dis;\n  int num;\n  int X[200000];\n  int Y[200000];\n  int count=0;\n  scanf(\"%d　%lf\",&num,&dis);\n  for (int i=0;i<num;i++)\n  {\n    scanf(\"%d %d\",&X[i],&Y[i]);\n    a=X[i];\n    b=Y[i];\n    if(pow(a,2.0)+pow(b,2.0)<=pow(dis,2.0))\n    {\n      count++;\n    }\n       }\n    printf(\"%d\",count);\n    return 0;\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": 364, "cpu_time_ms": 49, "memory_kb": 3276}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s691612938", "group_id": "codeNet:p02595", "input_text": "#include<stdio.h>\n#include<stdlib.h>\n#include<math.h>\nint main()\n{\n\tint n,d,s=0;\n\tscanf(\"%d %d\",&n,&d);\n\twhile(n--) \n\t{\n\t\tlong long int x,y;\n\t\tdouble dis;\n\t\tscanf(\"%lld %lld\",&x,&y);\n\t\tx=x*x;\n\t\ty=y*y;\n\t\tdis=x+y;\n\t\tdis=(double) sqrt(dis);\n\t\tif(dis<d || dis==d){\n\t\t\ts++;\n\t\t\t\n\t\t}\n\t}\n\tprintf(\"%d\\n\",s);\n\treturn 0;\n�}", "language": "C", "metadata": {"date": 1597619460, "filename_ext": "c", "original_language": "C (GCC 9.2.1)", "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/C/s691612938.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s691612938", "user_id": "u849466093"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "#include<stdio.h>\n#include<stdlib.h>\n#include<math.h>\nint main()\n{\n\tint n,d,s=0;\n\tscanf(\"%d %d\",&n,&d);\n\twhile(n--) \n\t{\n\t\tlong long int x,y;\n\t\tdouble dis;\n\t\tscanf(\"%lld %lld\",&x,&y);\n\t\tx=x*x;\n\t\ty=y*y;\n\t\tdis=x+y;\n\t\tdis=(double) sqrt(dis);\n\t\tif(dis<d || dis==d){\n\t\t\ts++;\n\t\t\t\n\t\t}\n\t}\n\tprintf(\"%d\\n\",s);\n\treturn 0;\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": 314, "cpu_time_ms": 51, "memory_kb": 2092}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s246177071", "group_id": "codeNet:p02595", "input_text": "#include<stdio.h>\n#include<math.h>\nint main (void){\nlong long int n,d,i,count;\nlong long int s,z;\nlong long int x[2*10*10*10*10*10];\nlong long int y[2*10*10*10*10*10];\ns=0;\nz=0;\ncount=0;\nscanf(\"%lld %lld\",&n,&d);\nfor(i=0;i<n;i++){\n    scanf(\"%lld %lld\",&x[i],&y[i]); \n    s = pow(x[i],2)+pow(y[i],2);\n    z = sqrt(s);\n    if(d>=z)count++;\n}\nprintf(\"%lld\",count);\nreturn 0;\n}", "language": "C", "metadata": {"date": 1596423782, "filename_ext": "c", "original_language": "C (GCC 9.2.1)", "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/C/s246177071.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s246177071", "user_id": "u572073783"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "#include<stdio.h>\n#include<math.h>\nint main (void){\nlong long int n,d,i,count;\nlong long int s,z;\nlong long int x[2*10*10*10*10*10];\nlong long int y[2*10*10*10*10*10];\ns=0;\nz=0;\ncount=0;\nscanf(\"%lld %lld\",&n,&d);\nfor(i=0;i<n;i++){\n    scanf(\"%lld %lld\",&x[i],&y[i]); \n    s = pow(x[i],2)+pow(y[i],2);\n    z = sqrt(s);\n    if(d>=z)count++;\n}\nprintf(\"%lld\",count);\nreturn 0;\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": 374, "cpu_time_ms": 57, "memory_kb": 5252}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s467003527", "group_id": "codeNet:p02596", "input_text": "#include<stdio.h>\n\nint main(){\n  long long k, count = 1;\n  long long se = 7;\n  scanf(\"%lld\", &k);\n  while(1){\n    if(se % k == 0){\n      printf(\"%lld\\n\" , count);\n      break;\n    }\n    if (k % 2 == 0) {\n      printf(\"-1\\n\");\n      break;\n    }\n    se= se*10 + 7;\n    count++;\n  }\n  return 0;\n}", "language": "C", "metadata": {"date": 1596478894, "filename_ext": "c", "original_language": "C (GCC 9.2.1)", "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/C/s467003527.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s467003527", "user_id": "u645083813"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "#include<stdio.h>\n\nint main(){\n  long long k, count = 1;\n  long long se = 7;\n  scanf(\"%lld\", &k);\n  while(1){\n    if(se % k == 0){\n      printf(\"%lld\\n\" , count);\n      break;\n    }\n    if (k % 2 == 0) {\n      printf(\"-1\\n\");\n      break;\n    }\n    se= se*10 + 7;\n    count++;\n  }\n  return 0;\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": 294, "cpu_time_ms": 2205, "memory_kb": 1728}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s746705172", "group_id": "codeNet:p02596", "input_text": "#include <stdio.h>\n#include <math.h>\n#include <string.h>\ntypedef long long ll;\n#define N 105\n \nll cal(ll n){\n    ll t = n;\n    ll p = 1,q = 1;\n    while(t >= 10){\n        p *= 10;\n        q *= 9;\n        t /= 10;\n    }\n     \n    t = n;\n    ll cnt = 0;\n    while(p){\n        ll num = t/p;t %= p;\n        if(num == 7){\n            cnt += num*q;\n            --cnt;\n            break;\n        }\n        if(num > 7) --num;\n        cnt += num*q;\n        p /= 10;\n        q /= 9;\n    }\n    return n-cnt;\n}\n \nint main()\n{\n    ll n;\n    while(~scanf(\"%lld\",&n)) printf(\"%lld\\n\",cal(n));\n    return 0;\n}", "language": "C", "metadata": {"date": 1596421718, "filename_ext": "c", "original_language": "C (Clang 10.0.0)", "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/C/s746705172.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s746705172", "user_id": "u573732265"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "#include <stdio.h>\n#include <math.h>\n#include <string.h>\ntypedef long long ll;\n#define N 105\n \nll cal(ll n){\n    ll t = n;\n    ll p = 1,q = 1;\n    while(t >= 10){\n        p *= 10;\n        q *= 9;\n        t /= 10;\n    }\n     \n    t = n;\n    ll cnt = 0;\n    while(p){\n        ll num = t/p;t %= p;\n        if(num == 7){\n            cnt += num*q;\n            --cnt;\n            break;\n        }\n        if(num > 7) --num;\n        cnt += num*q;\n        p /= 10;\n        q /= 9;\n    }\n    return n-cnt;\n}\n \nint main()\n{\n    ll n;\n    while(~scanf(\"%lld\",&n)) printf(\"%lld\\n\",cal(n));\n    return 0;\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": 593, "cpu_time_ms": 6, "memory_kb": 2076}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s502947122", "group_id": "codeNet:p02598", "input_text": "#define _CRT_SECURE_NO_WARNINGS\n#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\n#include <string.h>\n#include <stdbool.h>\ntypedef long long LL;\ntypedef long double Lf;\n#define in (void)scanf\n#define Rep(i,a,n)for(int i=(int)(a);i<(int)(n);i++)\n//#define Rep(i,a,n)for(LL i=(LL)(a);i<(LL)(n);i++)\n#define rep(i,n)Rep(i,0,n)\n#define Repp(i,l,r,k)for(int i=(int)(l);i<(int)(r);i+=(int)(k))\n//#define Repp(i,l,r,k)for(LL i=(LL)(l);i<(LL)(r);i+=(LL)(k))\n#define Ma(x,y) ((x)>(y)?(x):(y))\n#define mi(x,y) ((x)<(y)?(x):(y))\n#define MOD 1000000007//998244353,1000000007,1000000009,4999999999999997\nint upi(const void* a, const void* b) { return*(int*)a<*(int*)b ? -1 : *(int*)a> * (int*)b ? 1 : 0; }\nint downi(const void* a, const void* b) { return*(int*)a<*(int*)b ? 1 : *(int*)a> * (int*)b ? -1 : 0; }\nvoid sortupi(int* a, int n) { qsort(a, n, sizeof(int), upi); } //1,2,3,4,...\nvoid sortdowni(int* a, int n) { qsort(a, n, sizeof(int), downi); }\nint upLL(const void* a, const void* b) { return*(LL*)a<*(LL*)b ? -1 : *(LL*)a> * (LL*)b ? 1 : 0; }\nint downLL(const void* a, const void* b) { return*(LL*)a<*(LL*)b ? 1 : *(LL*)a> * (LL*)b ? -1 : 0; }\nvoid sortupLL(LL* a, int n) { qsort(a, n, sizeof(LL), upLL); }\nvoid sortdownLL(LL* a, int n) { qsort(a, n, sizeof(LL), downLL); }\nint cmp_char(const void* a, const void* b) { return *(char*)a - *(char*)b; } // a,b,c,d\nint cmp_str(const void* a, const void* b) { return strcmp(*(const char**)a, *(const char**)b); } // aaa,aab\nLL gcd(LL p, LL q) { while (q) { LL t = p % q; p = q; q = t; }return p; }\nLL modpow(LL a,LL n,int m){LL x=1;for(a%=m;n;n/=2)n&1?x=x*a%m:0,a=a*a%m;return x;}\n#define invmodpow(b,p)modpow(b,p-2,p)// a/b≡a*b^{-1}(mod p)...return b^{-1}(mod p)\ntypedef struct fac { LL n, exp; }F;\nLL fact(LL n,F*a){LL x=n,i,j,c=0;for(i=2;i*i<=x;i++){for(j=1;x%i==0;j++)x/=i;if(j>1){a[c].n=i;a[c++].exp=j-1;}}if(x-1){a[c].n=x;a[c++].exp=1;}return c;}\nLL nibtan(LL* a,LL n,LL x){LL p=0,q=n/2,r=n-1;while(r-p>1){if(x>=a[q])p=q;if(x<=a[q])r=q;q=(p+r)/2;}return a[p]==x?p:r;}\n//snippet\n\n#define N 100009\n\nint n, k, a[N];\n\nLL check(int x) {\n\tLL ret = 0;\n\trep(i, n)ret += (LL)ceill((Lf)a[i] / (Lf)x) - 1;\n\treturn ret;\n}\n\nvoid run(void) {\n\t//saw editorial\n\tin(\"%d%d\", &n, &k);\n\trep(i, n)in(\"%d\", &a[i]);\n\n\tint p = 0, q = MOD / 2, r = MOD, ans = n;\n\twhile (r - p > 1) {\n\t\tif (check(q) <= (LL)k) r = q;\n\t\telse p = q;\n\t\tq = (p + r) / 2;\n\t}\n\tif (check(r) <= k)ans = r;\n\tif (check(q) <= k)ans = q;\n\tif (check(p) <= k)ans = p;\n\tprintf(\"%d\\n\", ans ? ans : 1);\n}\n\nint main(void) {\n\tint test = 1;\n//\tin(\"%d\", &test);\n\twhile (test--) {\n\t\trun();\n\t}\n\treturn 0;\n}", "language": "C", "metadata": {"date": 1599947915, "filename_ext": "c", "original_language": "C (GCC 9.2.1)", "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/C/s502947122.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s502947122", "user_id": "u333114422"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "#define _CRT_SECURE_NO_WARNINGS\n#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\n#include <string.h>\n#include <stdbool.h>\ntypedef long long LL;\ntypedef long double Lf;\n#define in (void)scanf\n#define Rep(i,a,n)for(int i=(int)(a);i<(int)(n);i++)\n//#define Rep(i,a,n)for(LL i=(LL)(a);i<(LL)(n);i++)\n#define rep(i,n)Rep(i,0,n)\n#define Repp(i,l,r,k)for(int i=(int)(l);i<(int)(r);i+=(int)(k))\n//#define Repp(i,l,r,k)for(LL i=(LL)(l);i<(LL)(r);i+=(LL)(k))\n#define Ma(x,y) ((x)>(y)?(x):(y))\n#define mi(x,y) ((x)<(y)?(x):(y))\n#define MOD 1000000007//998244353,1000000007,1000000009,4999999999999997\nint upi(const void* a, const void* b) { return*(int*)a<*(int*)b ? -1 : *(int*)a> * (int*)b ? 1 : 0; }\nint downi(const void* a, const void* b) { return*(int*)a<*(int*)b ? 1 : *(int*)a> * (int*)b ? -1 : 0; }\nvoid sortupi(int* a, int n) { qsort(a, n, sizeof(int), upi); } //1,2,3,4,...\nvoid sortdowni(int* a, int n) { qsort(a, n, sizeof(int), downi); }\nint upLL(const void* a, const void* b) { return*(LL*)a<*(LL*)b ? -1 : *(LL*)a> * (LL*)b ? 1 : 0; }\nint downLL(const void* a, const void* b) { return*(LL*)a<*(LL*)b ? 1 : *(LL*)a> * (LL*)b ? -1 : 0; }\nvoid sortupLL(LL* a, int n) { qsort(a, n, sizeof(LL), upLL); }\nvoid sortdownLL(LL* a, int n) { qsort(a, n, sizeof(LL), downLL); }\nint cmp_char(const void* a, const void* b) { return *(char*)a - *(char*)b; } // a,b,c,d\nint cmp_str(const void* a, const void* b) { return strcmp(*(const char**)a, *(const char**)b); } // aaa,aab\nLL gcd(LL p, LL q) { while (q) { LL t = p % q; p = q; q = t; }return p; }\nLL modpow(LL a,LL n,int m){LL x=1;for(a%=m;n;n/=2)n&1?x=x*a%m:0,a=a*a%m;return x;}\n#define invmodpow(b,p)modpow(b,p-2,p)// a/b≡a*b^{-1}(mod p)...return b^{-1}(mod p)\ntypedef struct fac { LL n, exp; }F;\nLL fact(LL n,F*a){LL x=n,i,j,c=0;for(i=2;i*i<=x;i++){for(j=1;x%i==0;j++)x/=i;if(j>1){a[c].n=i;a[c++].exp=j-1;}}if(x-1){a[c].n=x;a[c++].exp=1;}return c;}\nLL nibtan(LL* a,LL n,LL x){LL p=0,q=n/2,r=n-1;while(r-p>1){if(x>=a[q])p=q;if(x<=a[q])r=q;q=(p+r)/2;}return a[p]==x?p:r;}\n//snippet\n\n#define N 100009\n\nint n, k, a[N];\n\nLL check(int x) {\n\tLL ret = 0;\n\trep(i, n)ret += (LL)ceill((Lf)a[i] / (Lf)x) - 1;\n\treturn ret;\n}\n\nvoid run(void) {\n\t//saw editorial\n\tin(\"%d%d\", &n, &k);\n\trep(i, n)in(\"%d\", &a[i]);\n\n\tint p = 0, q = MOD / 2, r = MOD, ans = n;\n\twhile (r - p > 1) {\n\t\tif (check(q) <= (LL)k) r = q;\n\t\telse p = q;\n\t\tq = (p + r) / 2;\n\t}\n\tif (check(r) <= k)ans = r;\n\tif (check(q) <= k)ans = q;\n\tif (check(p) <= k)ans = p;\n\tprintf(\"%d\\n\", ans ? ans : 1);\n}\n\nint main(void) {\n\tint test = 1;\n//\tin(\"%d\", &test);\n\twhile (test--) {\n\t\trun();\n\t}\n\treturn 0;\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<t<L), it becomes two logs of lengths t and L-t.\n\nFind the shortest possible length of the longest log after at most K cuts, and print it after rounding up to an integer.\n\nConstraints\n\n1 \\leq N \\leq 2 \\times 10^5\n\n0 \\leq K \\leq 10^9\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 \\cdots A_N\n\nOutput\n\nPrint an integer representing the answer.\n\nSample Input 1\n\n2 3\n7 9\n\nSample Output 1\n\n4\n\nFirst, we will cut the log of length 7 at a point whose distance from an end of the log is 3.5, resulting in two logs of length 3.5 each.\n\nNext, we will cut the log of length 9 at a point whose distance from an end of the log is 3, resulting in two logs of length 3 and 6.\n\nLastly, we will cut the log of length 6 at a point whose distance from an end of the log is 3.3, resulting in two logs of length 3.3 and 2.7.\n\nIn this case, the longest length of a log will be 3.5, which is the shortest possible result. After rounding up to an integer, the output should be 4.\n\nSample Input 2\n\n3 0\n3 4 5\n\nSample Output 2\n\n5\n\nSample Input 3\n\n10 10\n158260522 877914575 602436426 24979445 861648772 623690081 433933447 476190629 262703497 211047202\n\nSample Output 3\n\n292638192", "sample_input": "2 3\n7 9\n"}, "reference_outputs": ["4\n"], "source_document_id": "p02598", "source_text": "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<t<L), it becomes two logs of lengths t and L-t.\n\nFind the shortest possible length of the longest log after at most K cuts, and print it after rounding up to an integer.\n\nConstraints\n\n1 \\leq N \\leq 2 \\times 10^5\n\n0 \\leq K \\leq 10^9\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 \\cdots A_N\n\nOutput\n\nPrint an integer representing the answer.\n\nSample Input 1\n\n2 3\n7 9\n\nSample Output 1\n\n4\n\nFirst, we will cut the log of length 7 at a point whose distance from an end of the log is 3.5, resulting in two logs of length 3.5 each.\n\nNext, we will cut the log of length 9 at a point whose distance from an end of the log is 3, resulting in two logs of length 3 and 6.\n\nLastly, we will cut the log of length 6 at a point whose distance from an end of the log is 3.3, resulting in two logs of length 3.3 and 2.7.\n\nIn this case, the longest length of a log will be 3.5, which is the shortest possible result. After rounding up to an integer, the output should be 4.\n\nSample Input 2\n\n3 0\n3 4 5\n\nSample Output 2\n\n5\n\nSample Input 3\n\n10 10\n158260522 877914575 602436426 24979445 861648772 623690081 433933447 476190629 262703497 211047202\n\nSample Output 3\n\n292638192", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 2597, "cpu_time_ms": 182, "memory_kb": 2408}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s258920949", "group_id": "codeNet:p02601", "input_text": "#include<stdio.h>\nint main()\n{\n\tint a,b,c,k;\n\tint flag1=0,flag2=0;\n\tscanf(\"%d%d%d%d\",&a,&b,&c,&k);\n\twhile(a>b&&k>0)\n\t{b=2*b;\n\tk--;\n\tif(a<b){flag1=1;break;}\n\t}\n\twhile(b>c&&k>0)\n\t{c=2*c;\n\tk--;\n\tif(b<c){flag2=1;break;}\n\t}\n\tif(flag1==1&flag2==1)printf(\"Yes\");\n\telse printf(\"No\");\n\treturn 0;\n}", "language": "C", "metadata": {"date": 1595729005, "filename_ext": "c", "original_language": "C (GCC 9.2.1)", "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/C/s258920949.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s258920949", "user_id": "u000690102"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "#include<stdio.h>\nint main()\n{\n\tint a,b,c,k;\n\tint flag1=0,flag2=0;\n\tscanf(\"%d%d%d%d\",&a,&b,&c,&k);\n\twhile(a>b&&k>0)\n\t{b=2*b;\n\tk--;\n\tif(a<b){flag1=1;break;}\n\t}\n\twhile(b>c&&k>0)\n\t{c=2*c;\n\tk--;\n\tif(b<c){flag2=1;break;}\n\t}\n\tif(flag1==1&flag2==1)printf(\"Yes\");\n\telse printf(\"No\");\n\treturn 0;\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": 288, "cpu_time_ms": 6, "memory_kb": 1732}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s683798544", "group_id": "codeNet:p02601", "input_text": "#include <stdio.h>\n\nint main() {\n  int red, blue, green, k;\n  int i=0;\n  \n  scanf(\"%d%d%d%d\", &red, &green, &blue, &k);\n  \n  while(green<=red || blue<=green) {\n    if(green<=red) {\n      green = 2*green;\n      i++;\n    } else if(blue<=green) {\n      blue = 2*blue;\n      i++;\n    }\n  }\n  \n  printf(\"%d\\n\", i);\n  \n  if(i<=k) {\n    printf(\"Yes\");\n  } else if(i>k){\n    printf(\"No\");\n  }\n  \n  return 0;\n}", "language": "C", "metadata": {"date": 1595726970, "filename_ext": "c", "original_language": "C (GCC 9.2.1)", "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/C/s683798544.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s683798544", "user_id": "u839452662"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "#include <stdio.h>\n\nint main() {\n  int red, blue, green, k;\n  int i=0;\n  \n  scanf(\"%d%d%d%d\", &red, &green, &blue, &k);\n  \n  while(green<=red || blue<=green) {\n    if(green<=red) {\n      green = 2*green;\n      i++;\n    } else if(blue<=green) {\n      blue = 2*blue;\n      i++;\n    }\n  }\n  \n  printf(\"%d\\n\", i);\n  \n  if(i<=k) {\n    printf(\"Yes\");\n  } else if(i>k){\n    printf(\"No\");\n  }\n  \n  return 0;\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": 401, "cpu_time_ms": 5, "memory_kb": 1732}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s787405729", "group_id": "codeNet:p02601", "input_text": "#include<stdio.h>\nint main() {\n\tint a, b, c;\n\tint k;\n\tscanf(\"%d %d %d\", &a, &b, &c);\n\tscanf(\"%d\", &k);\n\tfor (int i = 0; i < k; i++) {\n\t\tif (a > b) {\n\t\t\tb *= 2;\n\t\t\tcontinue;\n\t\t}\n\t\tif (b > c) {\n\t\t\tc *= 2;\n\t\t\tcontinue;\n\t\t}\n\t\tif (a < b && b < c) {\n\t\t\tprintf(\"Yes\");\n\t\t\tbreak;\n\t\t}\n\t}\n  \tif(a>b||b>c){\n      printf(\"No\");\n    }\n\treturn 0;\n}", "language": "C", "metadata": {"date": 1595726686, "filename_ext": "c", "original_language": "C (GCC 9.2.1)", "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/C/s787405729.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s787405729", "user_id": "u304563268"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "#include<stdio.h>\nint main() {\n\tint a, b, c;\n\tint k;\n\tscanf(\"%d %d %d\", &a, &b, &c);\n\tscanf(\"%d\", &k);\n\tfor (int i = 0; i < k; i++) {\n\t\tif (a > b) {\n\t\t\tb *= 2;\n\t\t\tcontinue;\n\t\t}\n\t\tif (b > c) {\n\t\t\tc *= 2;\n\t\t\tcontinue;\n\t\t}\n\t\tif (a < b && b < c) {\n\t\t\tprintf(\"Yes\");\n\t\t\tbreak;\n\t\t}\n\t}\n  \tif(a>b||b>c){\n      printf(\"No\");\n    }\n\treturn 0;\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": 334, "cpu_time_ms": 8, "memory_kb": 1724}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s568670002", "group_id": "codeNet:p02606", "input_text": "#include<stdio.h>\n\nint main (void){\n\n    int L,R,d;\n    int min,max;\n    scanf(\"%d %d %d\",&L,&R,&d);\n\n    min=L+d-L%d;\n    max=R-R%d;\n\n    printf(\"%d\",max/d-min/d+1);\n\n\n    return 0 ;\n\n}", "language": "C", "metadata": {"date": 1594516237, "filename_ext": "c", "original_language": "C (GCC 9.2.1)", "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/C/s568670002.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s568670002", "user_id": "u654625936"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "#include<stdio.h>\n\nint main (void){\n\n    int L,R,d;\n    int min,max;\n    scanf(\"%d %d %d\",&L,&R,&d);\n\n    min=L+d-L%d;\n    max=R-R%d;\n\n    printf(\"%d\",max/d-min/d+1);\n\n\n    return 0 ;\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": 186, "cpu_time_ms": 5, "memory_kb": 1732}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s243901941", "group_id": "codeNet:p02607", "input_text": "#include<stdio.h>\nint main(){\n  int n,a[101],sum=0;\n  scanf(\"%d\",&n);\n  for(int i=0;i<n;i++){\n    scanf(\"%d\",&a[i]);\n    if(i%2==0&&a[i]%2==1){\n      sum++;\n    }\n  }\n  printf(\"%d\\n\",sum);\n}", "language": "C", "metadata": {"date": 1594870124, "filename_ext": "c", "original_language": "C (GCC 9.2.1)", "problem_description_relpath": "problem_descriptions/p02607.html", "problem_id": "p02607", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02607/input.txt", "sample_output_relpath": "derived/input_output/data/p02607/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02607/C/s243901941.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s243901941", "user_id": "u838152098"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "#include<stdio.h>\nint main(){\n  int n,a[101],sum=0;\n  scanf(\"%d\",&n);\n  for(int i=0;i<n;i++){\n    scanf(\"%d\",&a[i]);\n    if(i%2==0&&a[i]%2==1){\n      sum++;\n    }\n  }\n  printf(\"%d\\n\",sum);\n}", "problem_context": "Score : 200 points\n\nProblem Statement\n\nWe have N squares assigned the numbers 1,2,3,\\ldots,N. Each square has an integer written on it, and the integer written on Square i is a_i.\n\nHow many squares i satisfy both of the following conditions?\n\nThe assigned number, i, is odd.\n\nThe written integer is odd.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N, a_i \\leq 100\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_1 a_2 \\cdots a_N\n\nOutput\n\nPrint the number of squares that satisfy both of the conditions.\n\nSample Input 1\n\n5\n1 3 4 5 7\n\nSample Output 1\n\n2\n\nTwo squares, Square 1 and 5, satisfy both of the conditions.\n\nFor Square 2 and 4, the assigned numbers are not odd.\n\nFor Square 3, the written integer is not odd.\n\nSample Input 2\n\n15\n13 76 46 15 50 98 93 77 31 43 84 90 6 24 14\n\nSample Output 2\n\n3", "sample_input": "5\n1 3 4 5 7\n"}, "reference_outputs": ["2\n"], "source_document_id": "p02607", "source_text": "Score : 200 points\n\nProblem Statement\n\nWe have N squares assigned the numbers 1,2,3,\\ldots,N. Each square has an integer written on it, and the integer written on Square i is a_i.\n\nHow many squares i satisfy both of the following conditions?\n\nThe assigned number, i, is odd.\n\nThe written integer is odd.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N, a_i \\leq 100\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_1 a_2 \\cdots a_N\n\nOutput\n\nPrint the number of squares that satisfy both of the conditions.\n\nSample Input 1\n\n5\n1 3 4 5 7\n\nSample Output 1\n\n2\n\nTwo squares, Square 1 and 5, satisfy both of the conditions.\n\nFor Square 2 and 4, the assigned numbers are not odd.\n\nFor Square 3, the written integer is not odd.\n\nSample Input 2\n\n15\n13 76 46 15 50 98 93 77 31 43 84 90 6 24 14\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": 190, "cpu_time_ms": 5, "memory_kb": 1736}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s141244834", "group_id": "codeNet:p02607", "input_text": "#include <stdio.h>\n\nint main() {\n    int N,An,count=0;\n    scanf(\"%d\\n\", &N);\n    for(int i=0;i<N;i++){\n        scanf(\"%d\",&An);\n        if(i%2 == 1){\n            if(An%2 == 1){\n                count++;\n            }\n        }\n    }\n    printf(\"%d\", count);\n    return 0;\n}", "language": "C", "metadata": {"date": 1594517014, "filename_ext": "c", "original_language": "C (GCC 9.2.1)", "problem_description_relpath": "problem_descriptions/p02607.html", "problem_id": "p02607", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02607/input.txt", "sample_output_relpath": "derived/input_output/data/p02607/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02607/C/s141244834.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s141244834", "user_id": "u611854890"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "#include <stdio.h>\n\nint main() {\n    int N,An,count=0;\n    scanf(\"%d\\n\", &N);\n    for(int i=0;i<N;i++){\n        scanf(\"%d\",&An);\n        if(i%2 == 1){\n            if(An%2 == 1){\n                count++;\n            }\n        }\n    }\n    printf(\"%d\", count);\n    return 0;\n}", "problem_context": "Score : 200 points\n\nProblem Statement\n\nWe have N squares assigned the numbers 1,2,3,\\ldots,N. Each square has an integer written on it, and the integer written on Square i is a_i.\n\nHow many squares i satisfy both of the following conditions?\n\nThe assigned number, i, is odd.\n\nThe written integer is odd.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N, a_i \\leq 100\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_1 a_2 \\cdots a_N\n\nOutput\n\nPrint the number of squares that satisfy both of the conditions.\n\nSample Input 1\n\n5\n1 3 4 5 7\n\nSample Output 1\n\n2\n\nTwo squares, Square 1 and 5, satisfy both of the conditions.\n\nFor Square 2 and 4, the assigned numbers are not odd.\n\nFor Square 3, the written integer is not odd.\n\nSample Input 2\n\n15\n13 76 46 15 50 98 93 77 31 43 84 90 6 24 14\n\nSample Output 2\n\n3", "sample_input": "5\n1 3 4 5 7\n"}, "reference_outputs": ["2\n"], "source_document_id": "p02607", "source_text": "Score : 200 points\n\nProblem Statement\n\nWe have N squares assigned the numbers 1,2,3,\\ldots,N. Each square has an integer written on it, and the integer written on Square i is a_i.\n\nHow many squares i satisfy both of the following conditions?\n\nThe assigned number, i, is odd.\n\nThe written integer is odd.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N, a_i \\leq 100\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_1 a_2 \\cdots a_N\n\nOutput\n\nPrint the number of squares that satisfy both of the conditions.\n\nSample Input 1\n\n5\n1 3 4 5 7\n\nSample Output 1\n\n2\n\nTwo squares, Square 1 and 5, satisfy both of the conditions.\n\nFor Square 2 and 4, the assigned numbers are not odd.\n\nFor Square 3, the written integer is not odd.\n\nSample Input 2\n\n15\n13 76 46 15 50 98 93 77 31 43 84 90 6 24 14\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": 273, "cpu_time_ms": 7, "memory_kb": 1712}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s465994855", "group_id": "codeNet:p02608", "input_text": "#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int n,x,y,z,i,sum=0;\n    scanf(\"%d\",&n);\n    for(i=1;i<=n;i++)\n    {\n        sum=0;\n    for(x=1;x<=i;x++)\n    {\n        y=1;z=1;\n        if((x+y)*(x+y)>(9*i)/8||(x+z)*(x+z)>(9*i)/8||(y+z)*(y+z)>(9*i)/8)\n                    break;\n        for(y=1;y<=i;y++)\n        {\n            z=1;\n            if((x+y)*(x+y)>(9*i)/8||(x+z)*(x+z)>(9*i)/8||(y+z)*(y+z)>(9*i)/8)\n                    break;\n            for(z=1;z<=i;z++)\n            {\n                if((x+y)*(x+y)>(9*i)/8||(x+z)*(x+z)>(9*i)/8||(y+z)*(y+z)>(9*i)/8)\n                    break;\n                if((x*x+y*y+z*z+x*y+y*z+x*z)==i)\n                    sum++;\n            }\n        }\n    }\n    if(i!=n)\n       printf(\"%d\\n\",sum);\n    else\n        printf(\"%d\",sum);\n    }\n    return 0;\n}\n", "language": "C", "metadata": {"date": 1594520440, "filename_ext": "c", "original_language": "C (GCC 9.2.1)", "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/C/s465994855.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s465994855", "user_id": "u416687643"}, "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": "#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int n,x,y,z,i,sum=0;\n    scanf(\"%d\",&n);\n    for(i=1;i<=n;i++)\n    {\n        sum=0;\n    for(x=1;x<=i;x++)\n    {\n        y=1;z=1;\n        if((x+y)*(x+y)>(9*i)/8||(x+z)*(x+z)>(9*i)/8||(y+z)*(y+z)>(9*i)/8)\n                    break;\n        for(y=1;y<=i;y++)\n        {\n            z=1;\n            if((x+y)*(x+y)>(9*i)/8||(x+z)*(x+z)>(9*i)/8||(y+z)*(y+z)>(9*i)/8)\n                    break;\n            for(z=1;z<=i;z++)\n            {\n                if((x+y)*(x+y)>(9*i)/8||(x+z)*(x+z)>(9*i)/8||(y+z)*(y+z)>(9*i)/8)\n                    break;\n                if((x*x+y*y+z*z+x*y+y*z+x*z)==i)\n                    sum++;\n            }\n        }\n    }\n    if(i!=n)\n       printf(\"%d\\n\",sum);\n    else\n        printf(\"%d\",sum);\n    }\n    return 0;\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": 801, "cpu_time_ms": 2205, "memory_kb": 1732}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s544049174", "group_id": "codeNet:p02608", "input_text": "#include<stdio.h>\n\nint main() {\n\tint n;\n\tint result = 0;\n\n\tscanf(\"%d\", &n);\n\n\tint b, c;\n\tint i_flag, j_flag, k_flag;\n\tfor (int cor = 1; cor <= n; cor++)\n\t{\n\t\tresult = 0;\n\t\tb = 0, c = 0;\n\t\ti_flag = 0, j_flag = 0, k_flag = 0;\n\t\tfor (int i = 1; i_flag == 0; i++)\n\t\t{\n\t\t\tj_flag = 0;\n\t\t\tfor (int j = 1; j_flag == 0; j++)\n\t\t\t{\n\t\t\t\tk_flag = 0;\n\t\t\t\tfor (int k = 1; k_flag == 0; k++)\n\t\t\t\t{\n\t\t\t\t\tint cal = i * i + j * j + k * k + i * j + j * k + k * i;\n\t\t\t\t\tif (cal == cor) {\n\t\t\t\t\t\tif (i == j && j == k) {\n\t\t\t\t\t\t\tresult += 1;\n\t\t\t\t\t\t}\n\t\t\t\t\t\telse if (i == j || i == k || j == k) {\n\t\t\t\t\t\t\tb++;\n\t\t\t\t\t\t\tif (b == 3) {\n\t\t\t\t\t\t\t\tresult += 3;\n\t\t\t\t\t\t\t\tb = 0;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t\telse {\n\t\t\t\t\t\t\tc++;\n\t\t\t\t\t\t\tif (c == 6) {\n\t\t\t\t\t\t\t\tresult += 6;\n\t\t\t\t\t\t\t\tc = 0;\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\telse if (cal > cor) {\n\t\t\t\t\t\tk_flag = 1;\n\t\t\t\t\t\tif (k == 1) {\n\t\t\t\t\t\t\tj_flag = 1;\n\t\t\t\t\t\t\tif (j == 1) {\n\t\t\t\t\t\t\t\ti_flag = 1;\n\t\t\t\t\t\t\t\tprintf(\"%d\\n\", result);\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\t}\n\n\treturn 0;\n}", "language": "C", "metadata": {"date": 1594519303, "filename_ext": "c", "original_language": "C (Clang 10.0.0)", "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/C/s544049174.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s544049174", "user_id": "u994578242"}, "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": "#include<stdio.h>\n\nint main() {\n\tint n;\n\tint result = 0;\n\n\tscanf(\"%d\", &n);\n\n\tint b, c;\n\tint i_flag, j_flag, k_flag;\n\tfor (int cor = 1; cor <= n; cor++)\n\t{\n\t\tresult = 0;\n\t\tb = 0, c = 0;\n\t\ti_flag = 0, j_flag = 0, k_flag = 0;\n\t\tfor (int i = 1; i_flag == 0; i++)\n\t\t{\n\t\t\tj_flag = 0;\n\t\t\tfor (int j = 1; j_flag == 0; j++)\n\t\t\t{\n\t\t\t\tk_flag = 0;\n\t\t\t\tfor (int k = 1; k_flag == 0; k++)\n\t\t\t\t{\n\t\t\t\t\tint cal = i * i + j * j + k * k + i * j + j * k + k * i;\n\t\t\t\t\tif (cal == cor) {\n\t\t\t\t\t\tif (i == j && j == k) {\n\t\t\t\t\t\t\tresult += 1;\n\t\t\t\t\t\t}\n\t\t\t\t\t\telse if (i == j || i == k || j == k) {\n\t\t\t\t\t\t\tb++;\n\t\t\t\t\t\t\tif (b == 3) {\n\t\t\t\t\t\t\t\tresult += 3;\n\t\t\t\t\t\t\t\tb = 0;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t\telse {\n\t\t\t\t\t\t\tc++;\n\t\t\t\t\t\t\tif (c == 6) {\n\t\t\t\t\t\t\t\tresult += 6;\n\t\t\t\t\t\t\t\tc = 0;\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\telse if (cal > cor) {\n\t\t\t\t\t\tk_flag = 1;\n\t\t\t\t\t\tif (k == 1) {\n\t\t\t\t\t\t\tj_flag = 1;\n\t\t\t\t\t\t\tif (j == 1) {\n\t\t\t\t\t\t\t\ti_flag = 1;\n\t\t\t\t\t\t\t\tprintf(\"%d\\n\", result);\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\t}\n\n\treturn 0;\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": 973, "cpu_time_ms": 849, "memory_kb": 2052}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s381561903", "group_id": "codeNet:p02608", "input_text": "#include<stdio.h>\n#include<math.h>\n\nint main(void)\n{\n  int N;\n  scanf(\"%d\", &N);\n\n  int max;\n  int count;\n  for(int i=1;i<=N;i++){\n    count = 0;\n    max = sqrt(N);\n    for(int x=1;x<max;x++){\n      for(int y=1;y<x+1;y++){\n\tfor(int z=1;z<y+1;z++){\n\t  if(pow(x,2.0)+pow(y,2.0)+pow(z,2.0)+x*y+y*z+z*x == i){\n\t    if(x==y && y==z) count++;\n\t    else if(x==y || y==z || z==x) count += 3;\n\t    else count += 6;\n\t  }\n\t}\n      }\n    }\n    printf(\"%d\\n\", count);\n  }\n\n  return 0;\n}\n", "language": "C", "metadata": {"date": 1594517551, "filename_ext": "c", "original_language": "C (GCC 9.2.1)", "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/C/s381561903.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s381561903", "user_id": "u192434500"}, "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": "#include<stdio.h>\n#include<math.h>\n\nint main(void)\n{\n  int N;\n  scanf(\"%d\", &N);\n\n  int max;\n  int count;\n  for(int i=1;i<=N;i++){\n    count = 0;\n    max = sqrt(N);\n    for(int x=1;x<max;x++){\n      for(int y=1;y<x+1;y++){\n\tfor(int z=1;z<y+1;z++){\n\t  if(pow(x,2.0)+pow(y,2.0)+pow(z,2.0)+x*y+y*z+z*x == i){\n\t    if(x==y && y==z) count++;\n\t    else if(x==y || y==z || z==x) count += 3;\n\t    else count += 6;\n\t  }\n\t}\n      }\n    }\n    printf(\"%d\\n\", count);\n  }\n\n  return 0;\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": 474, "cpu_time_ms": 2205, "memory_kb": 2132}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s112948594", "group_id": "codeNet:p02613", "input_text": "#include <stdio.h>\n#include <stdlib.h>\n#include <string.h>\nint main(void){\n    int num, counter_ac = 0, counter_wa = 0, counter_tle = 0, counter_re = 0;\n    char result[10];\n    \n    scanf(\"%d\", &num);\n    \n    int i = 0;\n    while(i < num){\n        scanf(\"%s\", result);\n        if(strcmp(result, \"AC\") == 0){\n            counter_ac++;\n        } else if(strcmp(result, \"WA\") == 0){\n            counter_wa++;\n        } else if(strcmp(result, \"TLE\") == 0){\n            counter_tle++;\n        } else{\n            counter_re++;\n        }\n        i++;\n    }\n    i = 0;\n    \n    printf(\"AC x %d\\n\", counter_ac);\n    printf(\"WA x %d\\n\", counter_wa);\n    printf(\"TLE x %d\\n\", counter_tle);\n    printf(\"RE x %d\\n\", counter_re);\n}\n", "language": "C", "metadata": {"date": 1595598612, "filename_ext": "c", "original_language": "C (GCC 9.2.1)", "problem_description_relpath": "problem_descriptions/p02613.html", "problem_id": "p02613", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02613/input.txt", "sample_output_relpath": "derived/input_output/data/p02613/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02613/C/s112948594.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s112948594", "user_id": "u246940233"}, "prompt_components": {"gold_output": "AC x 3\nWA x 1\nTLE x 2\nRE x 0\n", "input_to_evaluate": "#include <stdio.h>\n#include <stdlib.h>\n#include <string.h>\nint main(void){\n    int num, counter_ac = 0, counter_wa = 0, counter_tle = 0, counter_re = 0;\n    char result[10];\n    \n    scanf(\"%d\", &num);\n    \n    int i = 0;\n    while(i < num){\n        scanf(\"%s\", result);\n        if(strcmp(result, \"AC\") == 0){\n            counter_ac++;\n        } else if(strcmp(result, \"WA\") == 0){\n            counter_wa++;\n        } else if(strcmp(result, \"TLE\") == 0){\n            counter_tle++;\n        } else{\n            counter_re++;\n        }\n        i++;\n    }\n    i = 0;\n    \n    printf(\"AC x %d\\n\", counter_ac);\n    printf(\"WA x %d\\n\", counter_wa);\n    printf(\"TLE x %d\\n\", counter_tle);\n    printf(\"RE x %d\\n\", counter_re);\n}\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nTakahashi is participating in a programming contest called AXC002, and he has just submitted his code to Problem A.\n\nThe problem has N test cases.\n\nFor each test case i (1\\leq i \\leq N), you are given a string S_i representing the verdict for that test case. Find the numbers of test cases for which the verdict is AC, WA, TLE, and RE, respectively.\n\nSee the Output section for the output format.\n\nConstraints\n\n1 \\leq N \\leq 10^5\n\nS_i is AC, WA, TLE, or RE.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS_1\n\\vdots\nS_N\n\nOutput\n\nLet C_0, C_1, C_2, and C_3 be the numbers of test cases for which the verdict is AC, WA, TLE, and RE, respectively. Print the following:\n\nAC x C_0\nWA x C_1\nTLE x C_2\nRE x C_3\n\nSample Input 1\n\n6\nAC\nTLE\nAC\nAC\nWA\nTLE\n\nSample Output 1\n\nAC x 3\nWA x 1\nTLE x 2\nRE x 0\n\nWe have 3, 1, 2, and 0 test case(s) for which the verdict is AC, WA, TLE, and RE, respectively.\n\nSample Input 2\n\n10\nAC\nAC\nAC\nAC\nAC\nAC\nAC\nAC\nAC\nAC\n\nSample Output 2\n\nAC x 10\nWA x 0\nTLE x 0\nRE x 0", "sample_input": "6\nAC\nTLE\nAC\nAC\nWA\nTLE\n"}, "reference_outputs": ["AC x 3\nWA x 1\nTLE x 2\nRE x 0\n"], "source_document_id": "p02613", "source_text": "Score : 200 points\n\nProblem Statement\n\nTakahashi is participating in a programming contest called AXC002, and he has just submitted his code to Problem A.\n\nThe problem has N test cases.\n\nFor each test case i (1\\leq i \\leq N), you are given a string S_i representing the verdict for that test case. Find the numbers of test cases for which the verdict is AC, WA, TLE, and RE, respectively.\n\nSee the Output section for the output format.\n\nConstraints\n\n1 \\leq N \\leq 10^5\n\nS_i is AC, WA, TLE, or RE.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS_1\n\\vdots\nS_N\n\nOutput\n\nLet C_0, C_1, C_2, and C_3 be the numbers of test cases for which the verdict is AC, WA, TLE, and RE, respectively. Print the following:\n\nAC x C_0\nWA x C_1\nTLE x C_2\nRE x C_3\n\nSample Input 1\n\n6\nAC\nTLE\nAC\nAC\nWA\nTLE\n\nSample Output 1\n\nAC x 3\nWA x 1\nTLE x 2\nRE x 0\n\nWe have 3, 1, 2, and 0 test case(s) for which the verdict is AC, WA, TLE, and RE, respectively.\n\nSample Input 2\n\n10\nAC\nAC\nAC\nAC\nAC\nAC\nAC\nAC\nAC\nAC\n\nSample Output 2\n\nAC x 10\nWA x 0\nTLE x 0\nRE x 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": 721, "cpu_time_ms": 16, "memory_kb": 1720}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s711146676", "group_id": "codeNet:p02613", "input_text": "#include <stdio.h>\n#include <string.h>\n\nint main(void)\n{\n    int n;\n    int ac = 0, wa = 0, tle = 0, re = 0;\n    scanf(\"%d\", &n);\n    for (int i = 0; i < n; i++)\n    {\n        char tmp[10];\n        scanf(\"%s\", tmp);\n        if (!strcmp(tmp, \"AC\"))\n        {\n            ac++;\n        }\n        if (!strcmp(tmp, \"WA\"))\n        {\n            wa++;\n        }\n        if (!strcmp(tmp, \"TLE\"))\n        {\n            tle++;\n        }\n        if (!strcmp(tmp, \"RE\"))\n        {\n            re++;\n        }\n    }\n    printf(\"AC x %d\\n\", ac);\n    printf(\"WA x %d\\n\", wa);\n    printf(\"TLE x %d\\n\", tle);\n    printf(\"RE x %d\\n\", re);\n\n    return 0;\n}\n", "language": "C", "metadata": {"date": 1595345317, "filename_ext": "c", "original_language": "C (GCC 9.2.1)", "problem_description_relpath": "problem_descriptions/p02613.html", "problem_id": "p02613", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02613/input.txt", "sample_output_relpath": "derived/input_output/data/p02613/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02613/C/s711146676.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s711146676", "user_id": "u491790817"}, "prompt_components": {"gold_output": "AC x 3\nWA x 1\nTLE x 2\nRE x 0\n", "input_to_evaluate": "#include <stdio.h>\n#include <string.h>\n\nint main(void)\n{\n    int n;\n    int ac = 0, wa = 0, tle = 0, re = 0;\n    scanf(\"%d\", &n);\n    for (int i = 0; i < n; i++)\n    {\n        char tmp[10];\n        scanf(\"%s\", tmp);\n        if (!strcmp(tmp, \"AC\"))\n        {\n            ac++;\n        }\n        if (!strcmp(tmp, \"WA\"))\n        {\n            wa++;\n        }\n        if (!strcmp(tmp, \"TLE\"))\n        {\n            tle++;\n        }\n        if (!strcmp(tmp, \"RE\"))\n        {\n            re++;\n        }\n    }\n    printf(\"AC x %d\\n\", ac);\n    printf(\"WA x %d\\n\", wa);\n    printf(\"TLE x %d\\n\", tle);\n    printf(\"RE x %d\\n\", re);\n\n    return 0;\n}\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nTakahashi is participating in a programming contest called AXC002, and he has just submitted his code to Problem A.\n\nThe problem has N test cases.\n\nFor each test case i (1\\leq i \\leq N), you are given a string S_i representing the verdict for that test case. Find the numbers of test cases for which the verdict is AC, WA, TLE, and RE, respectively.\n\nSee the Output section for the output format.\n\nConstraints\n\n1 \\leq N \\leq 10^5\n\nS_i is AC, WA, TLE, or RE.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS_1\n\\vdots\nS_N\n\nOutput\n\nLet C_0, C_1, C_2, and C_3 be the numbers of test cases for which the verdict is AC, WA, TLE, and RE, respectively. Print the following:\n\nAC x C_0\nWA x C_1\nTLE x C_2\nRE x C_3\n\nSample Input 1\n\n6\nAC\nTLE\nAC\nAC\nWA\nTLE\n\nSample Output 1\n\nAC x 3\nWA x 1\nTLE x 2\nRE x 0\n\nWe have 3, 1, 2, and 0 test case(s) for which the verdict is AC, WA, TLE, and RE, respectively.\n\nSample Input 2\n\n10\nAC\nAC\nAC\nAC\nAC\nAC\nAC\nAC\nAC\nAC\n\nSample Output 2\n\nAC x 10\nWA x 0\nTLE x 0\nRE x 0", "sample_input": "6\nAC\nTLE\nAC\nAC\nWA\nTLE\n"}, "reference_outputs": ["AC x 3\nWA x 1\nTLE x 2\nRE x 0\n"], "source_document_id": "p02613", "source_text": "Score : 200 points\n\nProblem Statement\n\nTakahashi is participating in a programming contest called AXC002, and he has just submitted his code to Problem A.\n\nThe problem has N test cases.\n\nFor each test case i (1\\leq i \\leq N), you are given a string S_i representing the verdict for that test case. Find the numbers of test cases for which the verdict is AC, WA, TLE, and RE, respectively.\n\nSee the Output section for the output format.\n\nConstraints\n\n1 \\leq N \\leq 10^5\n\nS_i is AC, WA, TLE, or RE.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS_1\n\\vdots\nS_N\n\nOutput\n\nLet C_0, C_1, C_2, and C_3 be the numbers of test cases for which the verdict is AC, WA, TLE, and RE, respectively. Print the following:\n\nAC x C_0\nWA x C_1\nTLE x C_2\nRE x C_3\n\nSample Input 1\n\n6\nAC\nTLE\nAC\nAC\nWA\nTLE\n\nSample Output 1\n\nAC x 3\nWA x 1\nTLE x 2\nRE x 0\n\nWe have 3, 1, 2, and 0 test case(s) for which the verdict is AC, WA, TLE, and RE, respectively.\n\nSample Input 2\n\n10\nAC\nAC\nAC\nAC\nAC\nAC\nAC\nAC\nAC\nAC\n\nSample Output 2\n\nAC x 10\nWA x 0\nTLE x 0\nRE x 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": 639, "cpu_time_ms": 17, "memory_kb": 1712}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s379690809", "group_id": "codeNet:p02613", "input_text": "#include <stdio.h>\n#include <string.h>\n\nint main(){\n  char C[3];\n  int AC=0;\n  int WA=0;\n  int TLE=0;\n  int RE=0;\n  int k=0;\n  int N=0;\n  k = scanf(\"%d\", &N);\n  for (int i=0; i<N; i++){\n    k = scanf(\"%s\", C);\n    if (strcmp(C, \"AC\")==0){\n      ++AC;\n    }else if (strcmp(C, \"WA\")==0){\n      ++WA;\n    }else if (strcmp(C, \"TLE\")==0){\n      ++TLE;\n    }else{\n      ++RE;\n    }\n\n  }\n\n  printf(\"AC x %d\\nWA x %d\\nTLE x %d\\nRE x %d\\n\", AC, WA, TLE, RE);\n\n  return 0;\n}\n", "language": "C", "metadata": {"date": 1594828384, "filename_ext": "c", "original_language": "C (GCC 9.2.1)", "problem_description_relpath": "problem_descriptions/p02613.html", "problem_id": "p02613", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02613/input.txt", "sample_output_relpath": "derived/input_output/data/p02613/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02613/C/s379690809.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s379690809", "user_id": "u833275031"}, "prompt_components": {"gold_output": "AC x 3\nWA x 1\nTLE x 2\nRE x 0\n", "input_to_evaluate": "#include <stdio.h>\n#include <string.h>\n\nint main(){\n  char C[3];\n  int AC=0;\n  int WA=0;\n  int TLE=0;\n  int RE=0;\n  int k=0;\n  int N=0;\n  k = scanf(\"%d\", &N);\n  for (int i=0; i<N; i++){\n    k = scanf(\"%s\", C);\n    if (strcmp(C, \"AC\")==0){\n      ++AC;\n    }else if (strcmp(C, \"WA\")==0){\n      ++WA;\n    }else if (strcmp(C, \"TLE\")==0){\n      ++TLE;\n    }else{\n      ++RE;\n    }\n\n  }\n\n  printf(\"AC x %d\\nWA x %d\\nTLE x %d\\nRE x %d\\n\", AC, WA, TLE, RE);\n\n  return 0;\n}\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nTakahashi is participating in a programming contest called AXC002, and he has just submitted his code to Problem A.\n\nThe problem has N test cases.\n\nFor each test case i (1\\leq i \\leq N), you are given a string S_i representing the verdict for that test case. Find the numbers of test cases for which the verdict is AC, WA, TLE, and RE, respectively.\n\nSee the Output section for the output format.\n\nConstraints\n\n1 \\leq N \\leq 10^5\n\nS_i is AC, WA, TLE, or RE.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS_1\n\\vdots\nS_N\n\nOutput\n\nLet C_0, C_1, C_2, and C_3 be the numbers of test cases for which the verdict is AC, WA, TLE, and RE, respectively. Print the following:\n\nAC x C_0\nWA x C_1\nTLE x C_2\nRE x C_3\n\nSample Input 1\n\n6\nAC\nTLE\nAC\nAC\nWA\nTLE\n\nSample Output 1\n\nAC x 3\nWA x 1\nTLE x 2\nRE x 0\n\nWe have 3, 1, 2, and 0 test case(s) for which the verdict is AC, WA, TLE, and RE, respectively.\n\nSample Input 2\n\n10\nAC\nAC\nAC\nAC\nAC\nAC\nAC\nAC\nAC\nAC\n\nSample Output 2\n\nAC x 10\nWA x 0\nTLE x 0\nRE x 0", "sample_input": "6\nAC\nTLE\nAC\nAC\nWA\nTLE\n"}, "reference_outputs": ["AC x 3\nWA x 1\nTLE x 2\nRE x 0\n"], "source_document_id": "p02613", "source_text": "Score : 200 points\n\nProblem Statement\n\nTakahashi is participating in a programming contest called AXC002, and he has just submitted his code to Problem A.\n\nThe problem has N test cases.\n\nFor each test case i (1\\leq i \\leq N), you are given a string S_i representing the verdict for that test case. Find the numbers of test cases for which the verdict is AC, WA, TLE, and RE, respectively.\n\nSee the Output section for the output format.\n\nConstraints\n\n1 \\leq N \\leq 10^5\n\nS_i is AC, WA, TLE, or RE.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS_1\n\\vdots\nS_N\n\nOutput\n\nLet C_0, C_1, C_2, and C_3 be the numbers of test cases for which the verdict is AC, WA, TLE, and RE, respectively. Print the following:\n\nAC x C_0\nWA x C_1\nTLE x C_2\nRE x C_3\n\nSample Input 1\n\n6\nAC\nTLE\nAC\nAC\nWA\nTLE\n\nSample Output 1\n\nAC x 3\nWA x 1\nTLE x 2\nRE x 0\n\nWe have 3, 1, 2, and 0 test case(s) for which the verdict is AC, WA, TLE, and RE, respectively.\n\nSample Input 2\n\n10\nAC\nAC\nAC\nAC\nAC\nAC\nAC\nAC\nAC\nAC\n\nSample Output 2\n\nAC x 10\nWA x 0\nTLE x 0\nRE x 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": 465, "cpu_time_ms": 18, "memory_kb": 1704}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s031453259", "group_id": "codeNet:p02613", "input_text": "#include <stdio.h>\n#include <stdlib.h>\n\nint main(void)\n{\n\tint i,n,C0,C1,C2,C3;\n\tchar str[100];\n\n\tC0 = C1 = C2 = C3 = 0;\n\t\n\tscanf(\"%d\",&n);\n\n\tfor(i=0;i<n;i++){\n\t\tscanf(\"%s\",str);\n\n\t\tif(str == \"AC\"){\n\t\t\tC0++;\n\t\t}\n\t\telse if(str ==\"WA\"){\n\t\t\tC1++;\n\t\t}\n\t\telse if(str ==\"TLE\"){\n\t\t\tC2++;\n\t\t}\n\t\telse if(str ==\"RE\"){\n\t\t\tC3++;\n\t\t}\n\t}\n\n\tprintf(\"AC * %d\\nWA * %d\\nTLE * %d\\nRE * %d\\n\",C0,C1,C2,C3);\n\n\treturn 0;\n}\n", "language": "C", "metadata": {"date": 1594694602, "filename_ext": "c", "original_language": "C (GCC 9.2.1)", "problem_description_relpath": "problem_descriptions/p02613.html", "problem_id": "p02613", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02613/input.txt", "sample_output_relpath": "derived/input_output/data/p02613/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02613/C/s031453259.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s031453259", "user_id": "u184701281"}, "prompt_components": {"gold_output": "AC x 3\nWA x 1\nTLE x 2\nRE x 0\n", "input_to_evaluate": "#include <stdio.h>\n#include <stdlib.h>\n\nint main(void)\n{\n\tint i,n,C0,C1,C2,C3;\n\tchar str[100];\n\n\tC0 = C1 = C2 = C3 = 0;\n\t\n\tscanf(\"%d\",&n);\n\n\tfor(i=0;i<n;i++){\n\t\tscanf(\"%s\",str);\n\n\t\tif(str == \"AC\"){\n\t\t\tC0++;\n\t\t}\n\t\telse if(str ==\"WA\"){\n\t\t\tC1++;\n\t\t}\n\t\telse if(str ==\"TLE\"){\n\t\t\tC2++;\n\t\t}\n\t\telse if(str ==\"RE\"){\n\t\t\tC3++;\n\t\t}\n\t}\n\n\tprintf(\"AC * %d\\nWA * %d\\nTLE * %d\\nRE * %d\\n\",C0,C1,C2,C3);\n\n\treturn 0;\n}\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nTakahashi is participating in a programming contest called AXC002, and he has just submitted his code to Problem A.\n\nThe problem has N test cases.\n\nFor each test case i (1\\leq i \\leq N), you are given a string S_i representing the verdict for that test case. Find the numbers of test cases for which the verdict is AC, WA, TLE, and RE, respectively.\n\nSee the Output section for the output format.\n\nConstraints\n\n1 \\leq N \\leq 10^5\n\nS_i is AC, WA, TLE, or RE.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS_1\n\\vdots\nS_N\n\nOutput\n\nLet C_0, C_1, C_2, and C_3 be the numbers of test cases for which the verdict is AC, WA, TLE, and RE, respectively. Print the following:\n\nAC x C_0\nWA x C_1\nTLE x C_2\nRE x C_3\n\nSample Input 1\n\n6\nAC\nTLE\nAC\nAC\nWA\nTLE\n\nSample Output 1\n\nAC x 3\nWA x 1\nTLE x 2\nRE x 0\n\nWe have 3, 1, 2, and 0 test case(s) for which the verdict is AC, WA, TLE, and RE, respectively.\n\nSample Input 2\n\n10\nAC\nAC\nAC\nAC\nAC\nAC\nAC\nAC\nAC\nAC\n\nSample Output 2\n\nAC x 10\nWA x 0\nTLE x 0\nRE x 0", "sample_input": "6\nAC\nTLE\nAC\nAC\nWA\nTLE\n"}, "reference_outputs": ["AC x 3\nWA x 1\nTLE x 2\nRE x 0\n"], "source_document_id": "p02613", "source_text": "Score : 200 points\n\nProblem Statement\n\nTakahashi is participating in a programming contest called AXC002, and he has just submitted his code to Problem A.\n\nThe problem has N test cases.\n\nFor each test case i (1\\leq i \\leq N), you are given a string S_i representing the verdict for that test case. Find the numbers of test cases for which the verdict is AC, WA, TLE, and RE, respectively.\n\nSee the Output section for the output format.\n\nConstraints\n\n1 \\leq N \\leq 10^5\n\nS_i is AC, WA, TLE, or RE.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS_1\n\\vdots\nS_N\n\nOutput\n\nLet C_0, C_1, C_2, and C_3 be the numbers of test cases for which the verdict is AC, WA, TLE, and RE, respectively. Print the following:\n\nAC x C_0\nWA x C_1\nTLE x C_2\nRE x C_3\n\nSample Input 1\n\n6\nAC\nTLE\nAC\nAC\nWA\nTLE\n\nSample Output 1\n\nAC x 3\nWA x 1\nTLE x 2\nRE x 0\n\nWe have 3, 1, 2, and 0 test case(s) for which the verdict is AC, WA, TLE, and RE, respectively.\n\nSample Input 2\n\n10\nAC\nAC\nAC\nAC\nAC\nAC\nAC\nAC\nAC\nAC\n\nSample Output 2\n\nAC x 10\nWA x 0\nTLE x 0\nRE x 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": 400, "cpu_time_ms": 19, "memory_kb": 1700}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s530043321", "group_id": "codeNet:p02613", "input_text": "#include <stdio.h>\n#include <string.h>\n\nint main(void) {\n    int n;\n    int ac=0,wa=0,tle=0,re=0;\n    char s[3];\n        scanf(\"%d\", &n);\n        for(int i=0;i<n;i++){\n          scanf(\"%s\", s);\n          if(!strcmp(s,\"AC\"))\n            ac += 1;\n          if(!strcmp(s,\"WA\"))\n            wa += 1;\n          if(!strcmp(s,\"TLE\"))\n            tle += 1;\n          if(!strcmp(s,\"RE\"))\n            re += 1;\n        }\n        printf(\"AC x %d\\nWA x %d\\nTLE x %d\\nRE x %d\\n\",ac,wa,tle,re);\n\n        return 0;\n}\n", "language": "C", "metadata": {"date": 1594676824, "filename_ext": "c", "original_language": "C (GCC 9.2.1)", "problem_description_relpath": "problem_descriptions/p02613.html", "problem_id": "p02613", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02613/input.txt", "sample_output_relpath": "derived/input_output/data/p02613/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02613/C/s530043321.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s530043321", "user_id": "u488213454"}, "prompt_components": {"gold_output": "AC x 3\nWA x 1\nTLE x 2\nRE x 0\n", "input_to_evaluate": "#include <stdio.h>\n#include <string.h>\n\nint main(void) {\n    int n;\n    int ac=0,wa=0,tle=0,re=0;\n    char s[3];\n        scanf(\"%d\", &n);\n        for(int i=0;i<n;i++){\n          scanf(\"%s\", s);\n          if(!strcmp(s,\"AC\"))\n            ac += 1;\n          if(!strcmp(s,\"WA\"))\n            wa += 1;\n          if(!strcmp(s,\"TLE\"))\n            tle += 1;\n          if(!strcmp(s,\"RE\"))\n            re += 1;\n        }\n        printf(\"AC x %d\\nWA x %d\\nTLE x %d\\nRE x %d\\n\",ac,wa,tle,re);\n\n        return 0;\n}\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nTakahashi is participating in a programming contest called AXC002, and he has just submitted his code to Problem A.\n\nThe problem has N test cases.\n\nFor each test case i (1\\leq i \\leq N), you are given a string S_i representing the verdict for that test case. Find the numbers of test cases for which the verdict is AC, WA, TLE, and RE, respectively.\n\nSee the Output section for the output format.\n\nConstraints\n\n1 \\leq N \\leq 10^5\n\nS_i is AC, WA, TLE, or RE.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS_1\n\\vdots\nS_N\n\nOutput\n\nLet C_0, C_1, C_2, and C_3 be the numbers of test cases for which the verdict is AC, WA, TLE, and RE, respectively. Print the following:\n\nAC x C_0\nWA x C_1\nTLE x C_2\nRE x C_3\n\nSample Input 1\n\n6\nAC\nTLE\nAC\nAC\nWA\nTLE\n\nSample Output 1\n\nAC x 3\nWA x 1\nTLE x 2\nRE x 0\n\nWe have 3, 1, 2, and 0 test case(s) for which the verdict is AC, WA, TLE, and RE, respectively.\n\nSample Input 2\n\n10\nAC\nAC\nAC\nAC\nAC\nAC\nAC\nAC\nAC\nAC\n\nSample Output 2\n\nAC x 10\nWA x 0\nTLE x 0\nRE x 0", "sample_input": "6\nAC\nTLE\nAC\nAC\nWA\nTLE\n"}, "reference_outputs": ["AC x 3\nWA x 1\nTLE x 2\nRE x 0\n"], "source_document_id": "p02613", "source_text": "Score : 200 points\n\nProblem Statement\n\nTakahashi is participating in a programming contest called AXC002, and he has just submitted his code to Problem A.\n\nThe problem has N test cases.\n\nFor each test case i (1\\leq i \\leq N), you are given a string S_i representing the verdict for that test case. Find the numbers of test cases for which the verdict is AC, WA, TLE, and RE, respectively.\n\nSee the Output section for the output format.\n\nConstraints\n\n1 \\leq N \\leq 10^5\n\nS_i is AC, WA, TLE, or RE.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS_1\n\\vdots\nS_N\n\nOutput\n\nLet C_0, C_1, C_2, and C_3 be the numbers of test cases for which the verdict is AC, WA, TLE, and RE, respectively. Print the following:\n\nAC x C_0\nWA x C_1\nTLE x C_2\nRE x C_3\n\nSample Input 1\n\n6\nAC\nTLE\nAC\nAC\nWA\nTLE\n\nSample Output 1\n\nAC x 3\nWA x 1\nTLE x 2\nRE x 0\n\nWe have 3, 1, 2, and 0 test case(s) for which the verdict is AC, WA, TLE, and RE, respectively.\n\nSample Input 2\n\n10\nAC\nAC\nAC\nAC\nAC\nAC\nAC\nAC\nAC\nAC\n\nSample Output 2\n\nAC x 10\nWA x 0\nTLE x 0\nRE x 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": 501, "cpu_time_ms": 20, "memory_kb": 1700}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s911539024", "group_id": "codeNet:p02616", "input_text": "#include<stdio.h>\n#include<stdlib.h>\n#include<math.h>\n#include<string.h>\n#include<stdbool.h>\n#include<assert.h>\n#include<ctype.h>\ntypedef long long ll;\ntypedef long double ld;\n#define rep(i,l,r)for(ll i=(l);i<(r);i++)\n#define repp(i,l,r,k)for(ll i=(l);i<(r);i+=(k))\n#define rrep(i,l,r)for(ll i=(l);i>=(r);i--)\n#define INF (1LL<<60)\n#define MOD1 1000000007\n#define MOD2 998244353\n#define MAX_N (1 << 20)\n#define YES printf(\"Yes\\n\")\n#define NO printf(\"No\\n\")\n#define PN printf(\"\\n\")\n#define charsize 100005 //10^5+5\n#define PI 3.141592653589793238\n\nvoid swap(ll *a, ll *b){ll c;c=*b;*b=*a;*a= c;}\nvoid cin(ll *n){ scanf(\"%lld\",&(*n)); }\nll max2(ll a,ll b){return a>=b?a:b;}\nll min2(ll a,ll b){return a>=b?b:a;}\nll min3(ll a, ll b, ll c){return (a<=b && a<=c) ? a : b<=c ? b : c;}\nll max3(ll a, ll b, ll c){return (a>=b && a>=c) ? a : b>=c ? b : c;}\nll minn(ll n, ll a[]){ll b=INF;rep(i,0,n) b=min2(b,a[i]);return b;}\nll maxn(ll n, ll a[]){ll b=-INF;rep(i,0,n) b=max2(b,a[i]);return b;}\nll POW(ll a, ll b){ll c=1;rep(i,0,b) c*=a;return c;}\ndouble POW_d(double a, double b){double c=1;rep(i,0,b) c*=a;return c;}\nll gcd(ll a,ll b){return b?gcd(b,a%b):a;}\nll lcm(ll a,ll b){return a/gcd(a,b)*b;}\nll mod_MOD1(ll n){n+= n<0?((-n)/MOD1+1)*MOD1:0; return n%=MOD1;}\nll mod_p(ll n ,ll p){n+= n<0?((-n)/p+1)*p:0; return n%=p;}\nll change_into_num(char s[] , ll len, ll p){ return !p ? 0 : POW(10,p-1)*(s[len-p]-'0') + change_into_num(s,len,p-1); }\nll digits(ll a, ll b){return a/b?1+digits(a/b,b):1;}\nll base(ll n, ll a, ll i){return i==1?n%a:base(n/a,a,i-1);}\n\nvoid lr_lower( int *l, int *r, ll am, ll val , int type ){ (type<3) ? ( am < val ?  ( *l = (*l+*r)/2 ) : ( *r= (*l+*r)/2 ) ) : ( am <= val ? ( *l = (*l+*r)/2 ) : ( *r= (*l+*r)/2 ) ); }\nvoid lr_upper( int *l, int *r, ll am, ll val , int type ){ (type<3) ? ( am <= val ?  ( *l = (*l+*r)/2 ) : ( *r= (*l+*r)/2 ) ) : ( am < val ? ( *l = (*l+*r)/2 ) : ( *r= (*l+*r)/2 ) ); }\nint cmp_lower( ll a, ll b, int type ){ return (type==1) ? ( a==b ? 1 : 0 ) : (type==2) ? ( a>=b ? 1 : 0 ) : ( a>b ? 1 : 0 ) ; }\nint cmp_upper( ll a, ll b, int type ){ return (type==1) ? ( a==b ? 1 : 0 ) : (type==2) ? ( a<=b ? 1 : 0 ) : ( a<b ? 1 : 0 ) ; }\n// return smallest p  which meets  a[p]==val :1  >=:2   >:3\nll lower_bound( ll a[], int l, int r, ll val , int type ){  while(r-l>1) lr_lower(&l,&r,a[ (l+r)/2 ],val,type);  return cmp_lower(a[l],val,type) ? l : cmp_lower(a[r],val,type) ? r : -1;  }\n// return biggest p  which meets   a[p]==val :1  <=:2   <:3\nll upper_bound( ll a[], int l, int r, ll val , int type ){  while(r-l>1) lr_upper(&l,&r,a[ (l+r)/2 ],val,type); return cmp_upper(a[r],val,type) ? r : cmp_upper(a[l],val,type) ? l : -1; }\n// count i  which meets ai==x\nll count(ll a[], int l, int r, ll x){  int p = lower_bound(a,l,r,x,1);  return p==-1 ? 0 : upper_bound(a,p,r,x,1)-p+1; }\n\nll *factors[2] , fac_cnt=0 , is_factor_prepared=0;\nll factor_pre(){  rep(i,0,1){ if(is_factor_prepared++) return 0; }  ll tmp=(1e6)/2+1, fac_tmp[tmp];  rep(i,0,tmp){fac_tmp[i]=i?2*i+1:2;}  rep(i,1,tmp){if(fac_tmp[i]){  repp(j,3,tmp/(2*i+1)+1,2 ){  if( j*(2*i+1)<tmp ) fac_tmp[ (j*(2*i+1)-1)/2 ]=0;  }  }else continue;}  rep(i,0,tmp){if(fac_tmp[i]){  rep(j,0,2){ factors[j] = realloc( factors[j] , sizeof(ll)*( fac_cnt +1 ) );  factors[j][j?fac_cnt++:fac_cnt]=j?0:fac_tmp[i];  }  } }  return 0;  }\nll factor(ll n, ll new_common_plus){ factor_pre();  rep(i,0,fac_cnt){ ll cnt=0; rep(j,0,1){ while( ( cnt+= n %factors[0][i]==0 ? 1 : 0 )  && (n/=factors[0][i]) %factors[0][i]==0 ) continue; } factors[1][i]= new_common_plus==1 ? cnt :  new_common_plus==2 ? max2(factors[1][i],cnt) : factors[1][i]+cnt ;  if( factors[0][i]> n ) break; } return n; }\nll judge_prime(ll n){ factor_pre(); rep(i,0,fac_cnt){ if(n<factors[0][i]*factors[0][i] || n==factors[0][i]) break; else if(n%factors[0][i]==0) n/=n; }  return n==1?0:1; }\n\nll *mf_arr,*inv_arr,*finv_arr,is_minv_made=0,is_mf_made=0;\nll makeinv(ll n , ll mod){  rep(i,0,1){if(is_minv_made++) return 0;}  inv_arr = realloc(inv_arr, sizeof(ll)*2 );  finv_arr = realloc(finv_arr, sizeof(ll)*2 );  inv_arr[1]=1;finv_arr[0]=finv_arr[1]=1;  rep(i,2,n+1){  inv_arr = realloc(inv_arr, sizeof(ll)*(i+1) );  finv_arr = realloc(finv_arr, sizeof(ll)*(i+1) );  inv_arr[i]= mod - inv_arr[mod%i] * (mod / i) % mod;  finv_arr[i] = finv_arr[i - 1] * inv_arr[i] % mod;  }  return 0; }\nll make_mf(ll n, ll mod){  rep(i,0,1){ if(is_mf_made++) return 0; }  mf_arr = realloc(mf_arr, sizeof(ll)*2 );  ll x=1;  mf_arr[0]=mf_arr[1]=x;  rep(i,2,n+1){   x=x*i%mod;  mf_arr = realloc(mf_arr, sizeof(ll)*(i+1) );  mf_arr[i]=x; }  return 0;  }\nll m_inv(ll x, ll mod, ll is_fac ){ makeinv(2*1e6+10,mod);  return is_fac?finv_arr[x]:inv_arr[x]; }\nll m_f(ll x, ll mod){  make_mf(2*1e6+10,mod);  return mf_arr[x];  }\n// ll mod_nck(ll n, ll k, ll mod){ return m_f[n]*finv_arr[k]%mod*finv_arr[n-k]%mod; }\nll m_p(ll r,ll n,ll mod){  ll t=1,s=r;  while(n>0){ t = (n&1) ? t*s%mod : t;  s=s*s%mod; n>>=1; }  return r?t:0;  }\nll m_mul2(ll a, ll b, ll mod){ return a*b%mod; }\nll m_mul3(ll a, ll b, ll c, ll mod){ return m_mul2(a*b%mod,c,mod); }\nll m_mul4(ll a, ll b, ll c, ll d, ll mod){ return m_mul3(a*b%mod,c,d,mod); }\nll m_mul5(ll a, ll b, ll c, ll d, ll e, ll mod){ return m_mul4(a*b%mod,c,d,e,mod); }\n\nint upll(const void*a, const void*b){return*(ll*)a<*(ll*)b?-1:*(ll*)a>*(ll*)b?1:0;}\nint downll(const void*a, const void*b){return*(ll*)a<*(ll*)b?1:*(ll*)a>*(ll*)b?-1:0;}\nint cmp_string( const void * a , const void * b ) {  return strcmp( (char *)a , (char *)b ); }  // qsort((void*)s,n,sizeof(s[0]),int_sort );\nint cmp_char(const void * a, const void * b) { return *(char *)a - *(char *)b;}\nvoid sortup(ll*a,int n){qsort(a,n,sizeof(ll),upll);}\nvoid sortdown(ll*a,int n){qsort(a,n,sizeof(ll),downll);}\nvoid sort_string(int n,int size,char s[][size]){ qsort( (void*)s , n , sizeof(s[0]) , cmp_string ); }\nvoid sort_char(char *s){ qsort( (void *)s , strlen(s) , sizeof(char) , cmp_char ); }\nll unique_string(ll n ,ll size, char s[][size]){ ll ans=1; rep(i,1,n) if( strcmp(s[i],s[i-1]) ) ans++; return ans; }\nll unique_num(ll n , ll a[]){ ll ans=1; rep(i,1,n) if( a[i]!=a[i-1] ) ans++; return ans; }\n\ntypedef struct{ ll a , b;}fr;\nint cmp1( const void *p, const void *q ) { return ((fr*)p) ->a - ((fr*)q)->a;}\nint cmp2( const void *p, const void *q ) { return ((fr*)q) ->a - ((fr*)p)->a;}\nvoid strsortup(fr*a,int n){qsort(a,n,sizeof(fr),cmp1);}\nvoid strsortdown(fr*a,int n){qsort(a,n,sizeof(fr),cmp2);}\n\n\n\n\n// char s[1151154];\nint main(void){\n    // fgets(s,sizeof(s),stdin); \n    ll n,k;\n    ll ans=0;\n    cin(&n);\n    cin(&k);\n    // scanf(\"%s\",s);\n    ll a[n],z=0,mi=0;\n    rep(i,0,n){\n        cin(&a[i]);\n        if(!a[i]) z++;\n        if(a[i]<0) mi++; \n    }\n    if(z>n-k){\n        printf(\"0\\n\"); return 0;\n    }\n\n    sortup(a,n);\n    // printf(\"%lld\\n\",z+mi);\n    if(z+mi==n){\n        if(mi%2){\n            ans=1;\n            rrep(i,n-1,n-k){\n                ans=mod_MOD1(ans*a[i]);\n            }\n        }else{\n            ans=1;\n            rrep(i,n-1,n-k){\n                ans=mod_MOD1(ans*a[i]);\n            }\n        }\n        printf(\"%lld\\n\",mod_MOD1(ans));\n        return 0;\n    }\n    if(n==k){\n        ans=1;\n        rep(i,0,n){\n            ans=mod_MOD1(ans*a[i]);\n        }\n        printf(\"%lld\\n\",ans); return 0;\n    }\n\n    if(k%2){\n        ll tmp=a[n-1],cnt=1;\n        rrep(i,n-2,n-k){\n            if(a[i]<=0) break;\n            tmp=mod_MOD1(tmp*a[i]);\n            tmp=mod_MOD1(tmp*a[i-1]);\n            cnt+=2; i--;\n        }\n        if(cnt<k){\n            rep(i,0,k-cnt){\n                tmp=mod_MOD1(tmp*a[i]);\n            }\n        }\n        ans=tmp;\n        ll d=0,p=0,sa=0;\n        rrep(i,0+(k-cnt),mi){\n            if(a[i+1]>0) break;\n            tmp*=m_inv(a[n-1-i],MOD1,0); tmp%=MOD1;\n            tmp*=m_inv(a[n-2-i],MOD1,0); tmp%=MOD1;\n            tmp*= mod_MOD1( a[i]*a[i+1] );  tmp%=MOD1;\n            d+=a[n-1-i]*a[n-2-i];\n            p+=a[i]*a[i+1];\n            if( sa<p-d ){\n                ans=tmp;\n                sa=p-d;\n            }\n            i--;\n        }\n        printf(\"%lld\\n\",mod_MOD1(ans));\n        return 0;\n    }\n\n    ll tmp=1,cnt=0;\n    rrep(i,n-1,n-k){\n        if(a[i-1]<=0) break;\n        tmp=mod_MOD1(tmp*a[i]);\n        tmp=mod_MOD1(tmp*a[i-1]);\n    // printf(\"%lld %lld\\n\",a[i],a[i-1]);\n        cnt+=2; i--;\n    }\n    // printf(\"%lld\\n\",tmp);\n    if(cnt<k){\n        rep(i,0,k-cnt){\n            tmp=mod_MOD1(tmp*a[i]);\n        }\n    }    \n    ans=tmp;\n    ll d=0,p=0,sa=0;\n    repp(i,0+(k-cnt),mi,2){\n        if(a[i+1]>0) break;\n        tmp*=m_inv(a[n-1-i],MOD1,0); tmp%=MOD1;\n        tmp*=m_inv(a[n-2-i],MOD1,0); tmp%=MOD1;\n        tmp*= mod_MOD1( a[i]*a[i+1] );  tmp%=MOD1;\n        d+=a[n-1-i]*a[n-2-i];\n        p+=a[i]*a[i+1];\n        if( sa<p-d ){\n            ans=tmp;\n            sa=p-d;\n        }\n        // printf(\"%lld\\n\",tmp);\n    }\n\n    printf(\"%lld\\n\",ans);\n    return 0;\n}\n", "language": "C", "metadata": {"date": 1593980883, "filename_ext": "c", "original_language": "C (GCC 9.2.1)", "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/C/s911539024.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s911539024", "user_id": "u004279520"}, "prompt_components": {"gold_output": "12\n", "input_to_evaluate": "#include<stdio.h>\n#include<stdlib.h>\n#include<math.h>\n#include<string.h>\n#include<stdbool.h>\n#include<assert.h>\n#include<ctype.h>\ntypedef long long ll;\ntypedef long double ld;\n#define rep(i,l,r)for(ll i=(l);i<(r);i++)\n#define repp(i,l,r,k)for(ll i=(l);i<(r);i+=(k))\n#define rrep(i,l,r)for(ll i=(l);i>=(r);i--)\n#define INF (1LL<<60)\n#define MOD1 1000000007\n#define MOD2 998244353\n#define MAX_N (1 << 20)\n#define YES printf(\"Yes\\n\")\n#define NO printf(\"No\\n\")\n#define PN printf(\"\\n\")\n#define charsize 100005 //10^5+5\n#define PI 3.141592653589793238\n\nvoid swap(ll *a, ll *b){ll c;c=*b;*b=*a;*a= c;}\nvoid cin(ll *n){ scanf(\"%lld\",&(*n)); }\nll max2(ll a,ll b){return a>=b?a:b;}\nll min2(ll a,ll b){return a>=b?b:a;}\nll min3(ll a, ll b, ll c){return (a<=b && a<=c) ? a : b<=c ? b : c;}\nll max3(ll a, ll b, ll c){return (a>=b && a>=c) ? a : b>=c ? b : c;}\nll minn(ll n, ll a[]){ll b=INF;rep(i,0,n) b=min2(b,a[i]);return b;}\nll maxn(ll n, ll a[]){ll b=-INF;rep(i,0,n) b=max2(b,a[i]);return b;}\nll POW(ll a, ll b){ll c=1;rep(i,0,b) c*=a;return c;}\ndouble POW_d(double a, double b){double c=1;rep(i,0,b) c*=a;return c;}\nll gcd(ll a,ll b){return b?gcd(b,a%b):a;}\nll lcm(ll a,ll b){return a/gcd(a,b)*b;}\nll mod_MOD1(ll n){n+= n<0?((-n)/MOD1+1)*MOD1:0; return n%=MOD1;}\nll mod_p(ll n ,ll p){n+= n<0?((-n)/p+1)*p:0; return n%=p;}\nll change_into_num(char s[] , ll len, ll p){ return !p ? 0 : POW(10,p-1)*(s[len-p]-'0') + change_into_num(s,len,p-1); }\nll digits(ll a, ll b){return a/b?1+digits(a/b,b):1;}\nll base(ll n, ll a, ll i){return i==1?n%a:base(n/a,a,i-1);}\n\nvoid lr_lower( int *l, int *r, ll am, ll val , int type ){ (type<3) ? ( am < val ?  ( *l = (*l+*r)/2 ) : ( *r= (*l+*r)/2 ) ) : ( am <= val ? ( *l = (*l+*r)/2 ) : ( *r= (*l+*r)/2 ) ); }\nvoid lr_upper( int *l, int *r, ll am, ll val , int type ){ (type<3) ? ( am <= val ?  ( *l = (*l+*r)/2 ) : ( *r= (*l+*r)/2 ) ) : ( am < val ? ( *l = (*l+*r)/2 ) : ( *r= (*l+*r)/2 ) ); }\nint cmp_lower( ll a, ll b, int type ){ return (type==1) ? ( a==b ? 1 : 0 ) : (type==2) ? ( a>=b ? 1 : 0 ) : ( a>b ? 1 : 0 ) ; }\nint cmp_upper( ll a, ll b, int type ){ return (type==1) ? ( a==b ? 1 : 0 ) : (type==2) ? ( a<=b ? 1 : 0 ) : ( a<b ? 1 : 0 ) ; }\n// return smallest p  which meets  a[p]==val :1  >=:2   >:3\nll lower_bound( ll a[], int l, int r, ll val , int type ){  while(r-l>1) lr_lower(&l,&r,a[ (l+r)/2 ],val,type);  return cmp_lower(a[l],val,type) ? l : cmp_lower(a[r],val,type) ? r : -1;  }\n// return biggest p  which meets   a[p]==val :1  <=:2   <:3\nll upper_bound( ll a[], int l, int r, ll val , int type ){  while(r-l>1) lr_upper(&l,&r,a[ (l+r)/2 ],val,type); return cmp_upper(a[r],val,type) ? r : cmp_upper(a[l],val,type) ? l : -1; }\n// count i  which meets ai==x\nll count(ll a[], int l, int r, ll x){  int p = lower_bound(a,l,r,x,1);  return p==-1 ? 0 : upper_bound(a,p,r,x,1)-p+1; }\n\nll *factors[2] , fac_cnt=0 , is_factor_prepared=0;\nll factor_pre(){  rep(i,0,1){ if(is_factor_prepared++) return 0; }  ll tmp=(1e6)/2+1, fac_tmp[tmp];  rep(i,0,tmp){fac_tmp[i]=i?2*i+1:2;}  rep(i,1,tmp){if(fac_tmp[i]){  repp(j,3,tmp/(2*i+1)+1,2 ){  if( j*(2*i+1)<tmp ) fac_tmp[ (j*(2*i+1)-1)/2 ]=0;  }  }else continue;}  rep(i,0,tmp){if(fac_tmp[i]){  rep(j,0,2){ factors[j] = realloc( factors[j] , sizeof(ll)*( fac_cnt +1 ) );  factors[j][j?fac_cnt++:fac_cnt]=j?0:fac_tmp[i];  }  } }  return 0;  }\nll factor(ll n, ll new_common_plus){ factor_pre();  rep(i,0,fac_cnt){ ll cnt=0; rep(j,0,1){ while( ( cnt+= n %factors[0][i]==0 ? 1 : 0 )  && (n/=factors[0][i]) %factors[0][i]==0 ) continue; } factors[1][i]= new_common_plus==1 ? cnt :  new_common_plus==2 ? max2(factors[1][i],cnt) : factors[1][i]+cnt ;  if( factors[0][i]> n ) break; } return n; }\nll judge_prime(ll n){ factor_pre(); rep(i,0,fac_cnt){ if(n<factors[0][i]*factors[0][i] || n==factors[0][i]) break; else if(n%factors[0][i]==0) n/=n; }  return n==1?0:1; }\n\nll *mf_arr,*inv_arr,*finv_arr,is_minv_made=0,is_mf_made=0;\nll makeinv(ll n , ll mod){  rep(i,0,1){if(is_minv_made++) return 0;}  inv_arr = realloc(inv_arr, sizeof(ll)*2 );  finv_arr = realloc(finv_arr, sizeof(ll)*2 );  inv_arr[1]=1;finv_arr[0]=finv_arr[1]=1;  rep(i,2,n+1){  inv_arr = realloc(inv_arr, sizeof(ll)*(i+1) );  finv_arr = realloc(finv_arr, sizeof(ll)*(i+1) );  inv_arr[i]= mod - inv_arr[mod%i] * (mod / i) % mod;  finv_arr[i] = finv_arr[i - 1] * inv_arr[i] % mod;  }  return 0; }\nll make_mf(ll n, ll mod){  rep(i,0,1){ if(is_mf_made++) return 0; }  mf_arr = realloc(mf_arr, sizeof(ll)*2 );  ll x=1;  mf_arr[0]=mf_arr[1]=x;  rep(i,2,n+1){   x=x*i%mod;  mf_arr = realloc(mf_arr, sizeof(ll)*(i+1) );  mf_arr[i]=x; }  return 0;  }\nll m_inv(ll x, ll mod, ll is_fac ){ makeinv(2*1e6+10,mod);  return is_fac?finv_arr[x]:inv_arr[x]; }\nll m_f(ll x, ll mod){  make_mf(2*1e6+10,mod);  return mf_arr[x];  }\n// ll mod_nck(ll n, ll k, ll mod){ return m_f[n]*finv_arr[k]%mod*finv_arr[n-k]%mod; }\nll m_p(ll r,ll n,ll mod){  ll t=1,s=r;  while(n>0){ t = (n&1) ? t*s%mod : t;  s=s*s%mod; n>>=1; }  return r?t:0;  }\nll m_mul2(ll a, ll b, ll mod){ return a*b%mod; }\nll m_mul3(ll a, ll b, ll c, ll mod){ return m_mul2(a*b%mod,c,mod); }\nll m_mul4(ll a, ll b, ll c, ll d, ll mod){ return m_mul3(a*b%mod,c,d,mod); }\nll m_mul5(ll a, ll b, ll c, ll d, ll e, ll mod){ return m_mul4(a*b%mod,c,d,e,mod); }\n\nint upll(const void*a, const void*b){return*(ll*)a<*(ll*)b?-1:*(ll*)a>*(ll*)b?1:0;}\nint downll(const void*a, const void*b){return*(ll*)a<*(ll*)b?1:*(ll*)a>*(ll*)b?-1:0;}\nint cmp_string( const void * a , const void * b ) {  return strcmp( (char *)a , (char *)b ); }  // qsort((void*)s,n,sizeof(s[0]),int_sort );\nint cmp_char(const void * a, const void * b) { return *(char *)a - *(char *)b;}\nvoid sortup(ll*a,int n){qsort(a,n,sizeof(ll),upll);}\nvoid sortdown(ll*a,int n){qsort(a,n,sizeof(ll),downll);}\nvoid sort_string(int n,int size,char s[][size]){ qsort( (void*)s , n , sizeof(s[0]) , cmp_string ); }\nvoid sort_char(char *s){ qsort( (void *)s , strlen(s) , sizeof(char) , cmp_char ); }\nll unique_string(ll n ,ll size, char s[][size]){ ll ans=1; rep(i,1,n) if( strcmp(s[i],s[i-1]) ) ans++; return ans; }\nll unique_num(ll n , ll a[]){ ll ans=1; rep(i,1,n) if( a[i]!=a[i-1] ) ans++; return ans; }\n\ntypedef struct{ ll a , b;}fr;\nint cmp1( const void *p, const void *q ) { return ((fr*)p) ->a - ((fr*)q)->a;}\nint cmp2( const void *p, const void *q ) { return ((fr*)q) ->a - ((fr*)p)->a;}\nvoid strsortup(fr*a,int n){qsort(a,n,sizeof(fr),cmp1);}\nvoid strsortdown(fr*a,int n){qsort(a,n,sizeof(fr),cmp2);}\n\n\n\n\n// char s[1151154];\nint main(void){\n    // fgets(s,sizeof(s),stdin); \n    ll n,k;\n    ll ans=0;\n    cin(&n);\n    cin(&k);\n    // scanf(\"%s\",s);\n    ll a[n],z=0,mi=0;\n    rep(i,0,n){\n        cin(&a[i]);\n        if(!a[i]) z++;\n        if(a[i]<0) mi++; \n    }\n    if(z>n-k){\n        printf(\"0\\n\"); return 0;\n    }\n\n    sortup(a,n);\n    // printf(\"%lld\\n\",z+mi);\n    if(z+mi==n){\n        if(mi%2){\n            ans=1;\n            rrep(i,n-1,n-k){\n                ans=mod_MOD1(ans*a[i]);\n            }\n        }else{\n            ans=1;\n            rrep(i,n-1,n-k){\n                ans=mod_MOD1(ans*a[i]);\n            }\n        }\n        printf(\"%lld\\n\",mod_MOD1(ans));\n        return 0;\n    }\n    if(n==k){\n        ans=1;\n        rep(i,0,n){\n            ans=mod_MOD1(ans*a[i]);\n        }\n        printf(\"%lld\\n\",ans); return 0;\n    }\n\n    if(k%2){\n        ll tmp=a[n-1],cnt=1;\n        rrep(i,n-2,n-k){\n            if(a[i]<=0) break;\n            tmp=mod_MOD1(tmp*a[i]);\n            tmp=mod_MOD1(tmp*a[i-1]);\n            cnt+=2; i--;\n        }\n        if(cnt<k){\n            rep(i,0,k-cnt){\n                tmp=mod_MOD1(tmp*a[i]);\n            }\n        }\n        ans=tmp;\n        ll d=0,p=0,sa=0;\n        rrep(i,0+(k-cnt),mi){\n            if(a[i+1]>0) break;\n            tmp*=m_inv(a[n-1-i],MOD1,0); tmp%=MOD1;\n            tmp*=m_inv(a[n-2-i],MOD1,0); tmp%=MOD1;\n            tmp*= mod_MOD1( a[i]*a[i+1] );  tmp%=MOD1;\n            d+=a[n-1-i]*a[n-2-i];\n            p+=a[i]*a[i+1];\n            if( sa<p-d ){\n                ans=tmp;\n                sa=p-d;\n            }\n            i--;\n        }\n        printf(\"%lld\\n\",mod_MOD1(ans));\n        return 0;\n    }\n\n    ll tmp=1,cnt=0;\n    rrep(i,n-1,n-k){\n        if(a[i-1]<=0) break;\n        tmp=mod_MOD1(tmp*a[i]);\n        tmp=mod_MOD1(tmp*a[i-1]);\n    // printf(\"%lld %lld\\n\",a[i],a[i-1]);\n        cnt+=2; i--;\n    }\n    // printf(\"%lld\\n\",tmp);\n    if(cnt<k){\n        rep(i,0,k-cnt){\n            tmp=mod_MOD1(tmp*a[i]);\n        }\n    }    \n    ans=tmp;\n    ll d=0,p=0,sa=0;\n    repp(i,0+(k-cnt),mi,2){\n        if(a[i+1]>0) break;\n        tmp*=m_inv(a[n-1-i],MOD1,0); tmp%=MOD1;\n        tmp*=m_inv(a[n-2-i],MOD1,0); tmp%=MOD1;\n        tmp*= mod_MOD1( a[i]*a[i+1] );  tmp%=MOD1;\n        d+=a[n-1-i]*a[n-2-i];\n        p+=a[i]*a[i+1];\n        if( sa<p-d ){\n            ans=tmp;\n            sa=p-d;\n        }\n        // printf(\"%lld\\n\",tmp);\n    }\n\n    printf(\"%lld\\n\",ans);\n    return 0;\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": 8859, "cpu_time_ms": 397, "memory_kb": 38200}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s400550571", "group_id": "codeNet:p02617", "input_text": "#pragma GCC optimize(\"Ofast\")\n#include<stdio.h>\nint main(void)\n{\n    long n = 0;\n    char c=getchar_unlocked();\n    while(c<='9'&&c>='0') {n=(n<<1)+(n<<3)+c-'0'; c=getchar_unlocked();}\n    long ans = n * (n * (n + 3) + 2);\n    ans /= 6;\n    int u, v, i = 1;\n    ++n;\n    while(++i < n)\n    {\n        u = v = 0;\n        c=getchar_unlocked();\n        while(c<='9'&&c>='0') {u=(u<<1)+(u<<3)+c-'0'; c=getchar_unlocked();}\n        c=getchar_unlocked();\n        while(c<='9'&&c>='0') {v=(v<<1)+(v<<3)+c-'0'; c=getchar_unlocked();}\n        switch(u > v)\n        {\n            case 1: ans -= v * (n - u); break;\n            default: ans -= u * (n - v);\n        }\n    }\n    printf(\"%ld\", ans + 1);\n    return 0;\n}\n", "language": "C", "metadata": {"date": 1594056715, "filename_ext": "c", "original_language": "C (GCC 9.2.1)", "problem_description_relpath": "problem_descriptions/p02617.html", "problem_id": "p02617", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02617/input.txt", "sample_output_relpath": "derived/input_output/data/p02617/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02617/C/s400550571.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s400550571", "user_id": "u004311543"}, "prompt_components": {"gold_output": "7\n", "input_to_evaluate": "#pragma GCC optimize(\"Ofast\")\n#include<stdio.h>\nint main(void)\n{\n    long n = 0;\n    char c=getchar_unlocked();\n    while(c<='9'&&c>='0') {n=(n<<1)+(n<<3)+c-'0'; c=getchar_unlocked();}\n    long ans = n * (n * (n + 3) + 2);\n    ans /= 6;\n    int u, v, i = 1;\n    ++n;\n    while(++i < n)\n    {\n        u = v = 0;\n        c=getchar_unlocked();\n        while(c<='9'&&c>='0') {u=(u<<1)+(u<<3)+c-'0'; c=getchar_unlocked();}\n        c=getchar_unlocked();\n        while(c<='9'&&c>='0') {v=(v<<1)+(v<<3)+c-'0'; c=getchar_unlocked();}\n        switch(u > v)\n        {\n            case 1: ans -= v * (n - u); break;\n            default: ans -= u * (n - v);\n        }\n    }\n    printf(\"%ld\", ans + 1);\n    return 0;\n}\n", "problem_context": "Score : 600 points\n\nProblem Statement\n\nWe have a tree with N vertices and N-1 edges, respectively numbered 1, 2,\\cdots, N and 1, 2, \\cdots, N-1. Edge i connects Vertex u_i and v_i.\n\nFor integers L, R (1 \\leq L \\leq R \\leq N), let us define a function f(L, R) as follows:\n\nLet S be the set of the vertices numbered L through R. f(L, R) represents the number of connected components in the subgraph formed only from the vertex set S and the edges whose endpoints both belong to S.\n\nCompute \\sum_{L=1}^{N} \\sum_{R=L}^{N} f(L, R).\n\nConstraints\n\n1 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq u_i, v_i \\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\nu_1 v_1\nu_2 v_2\n:\nu_{N-1} v_{N-1}\n\nOutput\n\nPrint \\sum_{L=1}^{N} \\sum_{R=L}^{N} f(L, R).\n\nSample Input 1\n\n3\n1 3\n2 3\n\nSample Output 1\n\n7\n\nWe have six possible pairs (L, R) as follows:\n\nFor L = 1, R = 1, S = \\{1\\} and we have 1 connected component.\n\nFor L = 1, R = 2, S = \\{1, 2\\} and we have 2 connected components.\n\nFor L = 1, R = 3, S = \\{1, 2, 3\\} and we have 1 connected component, since S contains both endpoints of each of the edges 1, 2.\n\nFor L = 2, R = 2, S = \\{2\\} and we have 1 connected component.\n\nFor L = 2, R = 3, S = \\{2, 3\\} and we have 1 connected component, since S contains both endpoints of Edge 2.\n\nFor L = 3, R = 3, S = \\{3\\} and we have 1 connected component.\n\nThe sum of these is 7.\n\nSample Input 2\n\n2\n1 2\n\nSample Output 2\n\n3\n\nSample Input 3\n\n10\n5 3\n5 7\n8 9\n1 9\n9 10\n8 4\n7 4\n6 10\n7 2\n\nSample Output 3\n\n113", "sample_input": "3\n1 3\n2 3\n"}, "reference_outputs": ["7\n"], "source_document_id": "p02617", "source_text": "Score : 600 points\n\nProblem Statement\n\nWe have a tree with N vertices and N-1 edges, respectively numbered 1, 2,\\cdots, N and 1, 2, \\cdots, N-1. Edge i connects Vertex u_i and v_i.\n\nFor integers L, R (1 \\leq L \\leq R \\leq N), let us define a function f(L, R) as follows:\n\nLet S be the set of the vertices numbered L through R. f(L, R) represents the number of connected components in the subgraph formed only from the vertex set S and the edges whose endpoints both belong to S.\n\nCompute \\sum_{L=1}^{N} \\sum_{R=L}^{N} f(L, R).\n\nConstraints\n\n1 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq u_i, v_i \\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\nu_1 v_1\nu_2 v_2\n:\nu_{N-1} v_{N-1}\n\nOutput\n\nPrint \\sum_{L=1}^{N} \\sum_{R=L}^{N} f(L, R).\n\nSample Input 1\n\n3\n1 3\n2 3\n\nSample Output 1\n\n7\n\nWe have six possible pairs (L, R) as follows:\n\nFor L = 1, R = 1, S = \\{1\\} and we have 1 connected component.\n\nFor L = 1, R = 2, S = \\{1, 2\\} and we have 2 connected components.\n\nFor L = 1, R = 3, S = \\{1, 2, 3\\} and we have 1 connected component, since S contains both endpoints of each of the edges 1, 2.\n\nFor L = 2, R = 2, S = \\{2\\} and we have 1 connected component.\n\nFor L = 2, R = 3, S = \\{2, 3\\} and we have 1 connected component, since S contains both endpoints of Edge 2.\n\nFor L = 3, R = 3, S = \\{3\\} and we have 1 connected component.\n\nThe sum of these is 7.\n\nSample Input 2\n\n2\n1 2\n\nSample Output 2\n\n3\n\nSample Input 3\n\n10\n5 3\n5 7\n8 9\n1 9\n9 10\n8 4\n7 4\n6 10\n7 2\n\nSample Output 3\n\n113", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 705, "cpu_time_ms": 16, "memory_kb": 1532}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s369074616", "group_id": "codeNet:p02621", "input_text": "#include<stdio.h>\n\nint main(void)\n{\n    int a;\n    scanf(\"%d\", &a);\n\n    int result;\n    result = a + a*a + a*a*a;\n    printf(\"%d\", result);\n\n    return 0;\n}", "language": "C", "metadata": {"date": 1593337502, "filename_ext": "c", "original_language": "C (GCC 9.2.1)", "problem_description_relpath": "problem_descriptions/p02621.html", "problem_id": "p02621", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02621/input.txt", "sample_output_relpath": "derived/input_output/data/p02621/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02621/C/s369074616.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s369074616", "user_id": "u128015095"}, "prompt_components": {"gold_output": "14\n", "input_to_evaluate": "#include<stdio.h>\n\nint main(void)\n{\n    int a;\n    scanf(\"%d\", &a);\n\n    int result;\n    result = a + a*a + a*a*a;\n    printf(\"%d\", result);\n\n    return 0;\n}", "problem_context": "Score : 100 points\n\nProblem Statement\n\nGiven an integer a as input, print the value a + a^2 + a^3.\n\nConstraints\n\n1 \\leq a \\leq 10\n\na is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na\n\nOutput\n\nPrint the value a + a^2 + a^3 as an integer.\n\nSample Input 1\n\n2\n\nSample Output 1\n\n14\n\nWhen a = 2, we have a + a^2 + a^3 = 2 + 2^2 + 2^3 = 2 + 4 + 8 = 14.\n\nPrint the answer as an input. Outputs such as 14.0 will be judged as incorrect.\n\nSample Input 2\n\n10\n\nSample Output 2\n\n1110", "sample_input": "2\n"}, "reference_outputs": ["14\n"], "source_document_id": "p02621", "source_text": "Score : 100 points\n\nProblem Statement\n\nGiven an integer a as input, print the value a + a^2 + a^3.\n\nConstraints\n\n1 \\leq a \\leq 10\n\na is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na\n\nOutput\n\nPrint the value a + a^2 + a^3 as an integer.\n\nSample Input 1\n\n2\n\nSample Output 1\n\n14\n\nWhen a = 2, we have a + a^2 + a^3 = 2 + 2^2 + 2^3 = 2 + 4 + 8 = 14.\n\nPrint the answer as an input. Outputs such as 14.0 will be judged as incorrect.\n\nSample Input 2\n\n10\n\nSample Output 2\n\n1110", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 157, "cpu_time_ms": 5, "memory_kb": 1724}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s643945309", "group_id": "codeNet:p02621", "input_text": "#include <stdio.h>\n\nint main(){\n    int a;\n    scanf(\"%d\",&a);\n    printf(\"%d\",a+a*a+a*a*a);\n    return 0;\n}", "language": "C", "metadata": {"date": 1593306954, "filename_ext": "c", "original_language": "C (GCC 9.2.1)", "problem_description_relpath": "problem_descriptions/p02621.html", "problem_id": "p02621", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02621/input.txt", "sample_output_relpath": "derived/input_output/data/p02621/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02621/C/s643945309.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s643945309", "user_id": "u483450676"}, "prompt_components": {"gold_output": "14\n", "input_to_evaluate": "#include <stdio.h>\n\nint main(){\n    int a;\n    scanf(\"%d\",&a);\n    printf(\"%d\",a+a*a+a*a*a);\n    return 0;\n}", "problem_context": "Score : 100 points\n\nProblem Statement\n\nGiven an integer a as input, print the value a + a^2 + a^3.\n\nConstraints\n\n1 \\leq a \\leq 10\n\na is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na\n\nOutput\n\nPrint the value a + a^2 + a^3 as an integer.\n\nSample Input 1\n\n2\n\nSample Output 1\n\n14\n\nWhen a = 2, we have a + a^2 + a^3 = 2 + 2^2 + 2^3 = 2 + 4 + 8 = 14.\n\nPrint the answer as an input. Outputs such as 14.0 will be judged as incorrect.\n\nSample Input 2\n\n10\n\nSample Output 2\n\n1110", "sample_input": "2\n"}, "reference_outputs": ["14\n"], "source_document_id": "p02621", "source_text": "Score : 100 points\n\nProblem Statement\n\nGiven an integer a as input, print the value a + a^2 + a^3.\n\nConstraints\n\n1 \\leq a \\leq 10\n\na is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na\n\nOutput\n\nPrint the value a + a^2 + a^3 as an integer.\n\nSample Input 1\n\n2\n\nSample Output 1\n\n14\n\nWhen a = 2, we have a + a^2 + a^3 = 2 + 2^2 + 2^3 = 2 + 4 + 8 = 14.\n\nPrint the answer as an input. Outputs such as 14.0 will be judged as incorrect.\n\nSample Input 2\n\n10\n\nSample Output 2\n\n1110", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 108, "cpu_time_ms": 6, "memory_kb": 1736}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s376640693", "group_id": "codeNet:p02622", "input_text": "#include<stdio.h>\nint main(){\n    char a[10001];\n    char b[10001];\n    int i = 0, count = 0, ans = 0;\n    scanf(\"%s\", &*a);\n    scanf(\"%s\", &*b);\n    for(i = 0; i >= 0; i++){\n        if(a[i] == '\\0'){\n            break;\n        }else{\n            count++;\n        }\n    }\n    for(i = 0; i < count; i++){\n        if(a[i] != b[i]){\n            ans++;\n        }\n    }\n    printf(\"%d\\n\", ans);\n    return 0;\n}", "language": "C", "metadata": {"date": 1593317303, "filename_ext": "c", "original_language": "C (GCC 9.2.1)", "problem_description_relpath": "problem_descriptions/p02622.html", "problem_id": "p02622", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02622/input.txt", "sample_output_relpath": "derived/input_output/data/p02622/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02622/C/s376640693.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s376640693", "user_id": "u878493765"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "#include<stdio.h>\nint main(){\n    char a[10001];\n    char b[10001];\n    int i = 0, count = 0, ans = 0;\n    scanf(\"%s\", &*a);\n    scanf(\"%s\", &*b);\n    for(i = 0; i >= 0; i++){\n        if(a[i] == '\\0'){\n            break;\n        }else{\n            count++;\n        }\n    }\n    for(i = 0; i < count; i++){\n        if(a[i] != b[i]){\n            ans++;\n        }\n    }\n    printf(\"%d\\n\", ans);\n    return 0;\n}", "problem_context": "Score : 200 points\n\nProblem Statement\n\nGiven are strings S and T. Consider changing S to T by repeating the operation below. Find the minimum number of operations required to do so.\n\nOperation: Choose one character of S and replace it with a different character.\n\nConstraints\n\nS and T have lengths between 1 and 2\\times 10^5 (inclusive).\n\nS and T consists of lowercase English letters.\n\nS and T have equal lengths.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\nT\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\ncupofcoffee\ncupofhottea\n\nSample Output 1\n\n4\n\nWe can achieve the objective in four operations, such as the following:\n\nFirst, replace the sixth character c with h.\n\nSecond, replace the eighth character f with t.\n\nThird, replace the ninth character f with t.\n\nFourth, replace the eleventh character e with a.\n\nSample Input 2\n\nabcde\nbcdea\n\nSample Output 2\n\n5\n\nSample Input 3\n\napple\napple\n\nSample Output 3\n\n0\n\nNo operations may be needed to achieve the objective.", "sample_input": "cupofcoffee\ncupofhottea\n"}, "reference_outputs": ["4\n"], "source_document_id": "p02622", "source_text": "Score : 200 points\n\nProblem Statement\n\nGiven are strings S and T. Consider changing S to T by repeating the operation below. Find the minimum number of operations required to do so.\n\nOperation: Choose one character of S and replace it with a different character.\n\nConstraints\n\nS and T have lengths between 1 and 2\\times 10^5 (inclusive).\n\nS and T consists of lowercase English letters.\n\nS and T have equal lengths.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\nT\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\ncupofcoffee\ncupofhottea\n\nSample Output 1\n\n4\n\nWe can achieve the objective in four operations, such as the following:\n\nFirst, replace the sixth character c with h.\n\nSecond, replace the eighth character f with t.\n\nThird, replace the ninth character f with t.\n\nFourth, replace the eleventh character e with a.\n\nSample Input 2\n\nabcde\nbcdea\n\nSample Output 2\n\n5\n\nSample Input 3\n\napple\napple\n\nSample Output 3\n\n0\n\nNo operations may be needed to achieve the objective.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 406, "cpu_time_ms": 131, "memory_kb": 1744}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s318730038", "group_id": "codeNet:p02622", "input_text": "#include <stdio.h>\n\nvoid main(){\n    char s[200000], t[200000];\n    int ss,st;\n    ss = scanf(\"%s\", s);\n    st = scanf(\"%s\", t);\n    if (ss== -1 || st == -1){\n        puts(\"0\");\n    }\n    else{\n    \n        int count = 0;\n        int i= 0;\n\n        while (s[i] != '\\0' && i <200000){\n            \n            if (s[i] != t[i]){\n                count++;\n            }\n            i++;\n        }\n        printf(\"%d\", count);\n    }\n}", "language": "C", "metadata": {"date": 1593308749, "filename_ext": "c", "original_language": "C (GCC 9.2.1)", "problem_description_relpath": "problem_descriptions/p02622.html", "problem_id": "p02622", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02622/input.txt", "sample_output_relpath": "derived/input_output/data/p02622/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02622/C/s318730038.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s318730038", "user_id": "u534610124"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "#include <stdio.h>\n\nvoid main(){\n    char s[200000], t[200000];\n    int ss,st;\n    ss = scanf(\"%s\", s);\n    st = scanf(\"%s\", t);\n    if (ss== -1 || st == -1){\n        puts(\"0\");\n    }\n    else{\n    \n        int count = 0;\n        int i= 0;\n\n        while (s[i] != '\\0' && i <200000){\n            \n            if (s[i] != t[i]){\n                count++;\n            }\n            i++;\n        }\n        printf(\"%d\", count);\n    }\n}", "problem_context": "Score : 200 points\n\nProblem Statement\n\nGiven are strings S and T. Consider changing S to T by repeating the operation below. Find the minimum number of operations required to do so.\n\nOperation: Choose one character of S and replace it with a different character.\n\nConstraints\n\nS and T have lengths between 1 and 2\\times 10^5 (inclusive).\n\nS and T consists of lowercase English letters.\n\nS and T have equal lengths.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\nT\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\ncupofcoffee\ncupofhottea\n\nSample Output 1\n\n4\n\nWe can achieve the objective in four operations, such as the following:\n\nFirst, replace the sixth character c with h.\n\nSecond, replace the eighth character f with t.\n\nThird, replace the ninth character f with t.\n\nFourth, replace the eleventh character e with a.\n\nSample Input 2\n\nabcde\nbcdea\n\nSample Output 2\n\n5\n\nSample Input 3\n\napple\napple\n\nSample Output 3\n\n0\n\nNo operations may be needed to achieve the objective.", "sample_input": "cupofcoffee\ncupofhottea\n"}, "reference_outputs": ["4\n"], "source_document_id": "p02622", "source_text": "Score : 200 points\n\nProblem Statement\n\nGiven are strings S and T. Consider changing S to T by repeating the operation below. Find the minimum number of operations required to do so.\n\nOperation: Choose one character of S and replace it with a different character.\n\nConstraints\n\nS and T have lengths between 1 and 2\\times 10^5 (inclusive).\n\nS and T consists of lowercase English letters.\n\nS and T have equal lengths.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\nT\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\ncupofcoffee\ncupofhottea\n\nSample Output 1\n\n4\n\nWe can achieve the objective in four operations, such as the following:\n\nFirst, replace the sixth character c with h.\n\nSecond, replace the eighth character f with t.\n\nThird, replace the ninth character f with t.\n\nFourth, replace the eleventh character e with a.\n\nSample Input 2\n\nabcde\nbcdea\n\nSample Output 2\n\n5\n\nSample Input 3\n\napple\napple\n\nSample Output 3\n\n0\n\nNo operations may be needed to achieve the objective.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 430, "cpu_time_ms": 123, "memory_kb": 2072}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s791906082", "group_id": "codeNet:p02622", "input_text": "#include <stdio.h>\n#include <math.h>\n\nint main(void){\n\n    int count=0;\n    int ans=0;\n    int size=2*pow(10,5);\n    char S[size];\n    char T[size];\n\n    scanf(\"%s\",S);\n    scanf(\"%s\",T);\n\n    for(int i=0;i<size;i++){\n        if(S[i]!='\\0'){\n            count++;\n        }else{\n            break;\n        }\n    }\n\n    for(int i=0;i<count;i++){\n        if(S[i]!=T[i]){\n            ans++;\n        }\n    }\n\n    printf(\"%d\\n\",ans);\n\n    return 0;\n}", "language": "C", "metadata": {"date": 1593307425, "filename_ext": "c", "original_language": "C (Clang 10.0.0)", "problem_description_relpath": "problem_descriptions/p02622.html", "problem_id": "p02622", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02622/input.txt", "sample_output_relpath": "derived/input_output/data/p02622/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02622/C/s791906082.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s791906082", "user_id": "u548487936"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "#include <stdio.h>\n#include <math.h>\n\nint main(void){\n\n    int count=0;\n    int ans=0;\n    int size=2*pow(10,5);\n    char S[size];\n    char T[size];\n\n    scanf(\"%s\",S);\n    scanf(\"%s\",T);\n\n    for(int i=0;i<size;i++){\n        if(S[i]!='\\0'){\n            count++;\n        }else{\n            break;\n        }\n    }\n\n    for(int i=0;i<count;i++){\n        if(S[i]!=T[i]){\n            ans++;\n        }\n    }\n\n    printf(\"%d\\n\",ans);\n\n    return 0;\n}", "problem_context": "Score : 200 points\n\nProblem Statement\n\nGiven are strings S and T. Consider changing S to T by repeating the operation below. Find the minimum number of operations required to do so.\n\nOperation: Choose one character of S and replace it with a different character.\n\nConstraints\n\nS and T have lengths between 1 and 2\\times 10^5 (inclusive).\n\nS and T consists of lowercase English letters.\n\nS and T have equal lengths.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\nT\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\ncupofcoffee\ncupofhottea\n\nSample Output 1\n\n4\n\nWe can achieve the objective in four operations, such as the following:\n\nFirst, replace the sixth character c with h.\n\nSecond, replace the eighth character f with t.\n\nThird, replace the ninth character f with t.\n\nFourth, replace the eleventh character e with a.\n\nSample Input 2\n\nabcde\nbcdea\n\nSample Output 2\n\n5\n\nSample Input 3\n\napple\napple\n\nSample Output 3\n\n0\n\nNo operations may be needed to achieve the objective.", "sample_input": "cupofcoffee\ncupofhottea\n"}, "reference_outputs": ["4\n"], "source_document_id": "p02622", "source_text": "Score : 200 points\n\nProblem Statement\n\nGiven are strings S and T. Consider changing S to T by repeating the operation below. Find the minimum number of operations required to do so.\n\nOperation: Choose one character of S and replace it with a different character.\n\nConstraints\n\nS and T have lengths between 1 and 2\\times 10^5 (inclusive).\n\nS and T consists of lowercase English letters.\n\nS and T have equal lengths.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\nT\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\ncupofcoffee\ncupofhottea\n\nSample Output 1\n\n4\n\nWe can achieve the objective in four operations, such as the following:\n\nFirst, replace the sixth character c with h.\n\nSecond, replace the eighth character f with t.\n\nThird, replace the ninth character f with t.\n\nFourth, replace the eleventh character e with a.\n\nSample Input 2\n\nabcde\nbcdea\n\nSample Output 2\n\n5\n\nSample Input 3\n\napple\napple\n\nSample Output 3\n\n0\n\nNo operations may be needed to achieve the objective.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 444, "cpu_time_ms": 7, "memory_kb": 2536}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s652297643", "group_id": "codeNet:p02627", "input_text": "#include <stdio.h>\n\nint main()\n{\n\tchar s;\n\n\tscanf(\"%c\", &s);\n\n\tif ('A' <= s && s <= 'Z')\n\t\ts = 'A';\n\telse\n\t\ts = 'a';\n\n\tprintf(\"%c\\n\", s);\n\n\treturn 0;\n}", "language": "C", "metadata": {"date": 1592787745, "filename_ext": "c", "original_language": "C (GCC 9.2.1)", "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/C/s652297643.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s652297643", "user_id": "u500731720"}, "prompt_components": {"gold_output": "A\n", "input_to_evaluate": "#include <stdio.h>\n\nint main()\n{\n\tchar s;\n\n\tscanf(\"%c\", &s);\n\n\tif ('A' <= s && s <= 'Z')\n\t\ts = 'A';\n\telse\n\t\ts = 'a';\n\n\tprintf(\"%c\\n\", s);\n\n\treturn 0;\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": 151, "cpu_time_ms": 5, "memory_kb": 1668}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s047443623", "group_id": "codeNet:p02628", "input_text": "#include<stdio.h>\nint main()\n{\n    int N,i,K,sum=0,t,j;\n    scanf(\"%d%d\",&N,&K);\n    int a[N-1];\n    for(i=0; i<N; i++)\n    {\n        scanf(\"%d\",&a[i]);\n    }\n\n    for(i=0; i<N; i=i+1)\n    {\n\n        for(j=i+1; j<N; j++)\n        {\n            if(a[i]>a[j])\n            {\n                t=a[i];\n                a[i]=a[j];\n                a[j]=t;\n            }\n        }\n    }\n    for(i=0; i<K; i++)\n    {\n        sum=sum+a[i];\n    }\n    printf(\"%d\\n\",sum);\n    return 0;\n\n}\n", "language": "C", "metadata": {"date": 1597913817, "filename_ext": "c", "original_language": "C (GCC 9.2.1)", "problem_description_relpath": "problem_descriptions/p02628.html", "problem_id": "p02628", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02628/input.txt", "sample_output_relpath": "derived/input_output/data/p02628/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02628/C/s047443623.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s047443623", "user_id": "u353919145"}, "prompt_components": {"gold_output": "210\n", "input_to_evaluate": "#include<stdio.h>\nint main()\n{\n    int N,i,K,sum=0,t,j;\n    scanf(\"%d%d\",&N,&K);\n    int a[N-1];\n    for(i=0; i<N; i++)\n    {\n        scanf(\"%d\",&a[i]);\n    }\n\n    for(i=0; i<N; i=i+1)\n    {\n\n        for(j=i+1; j<N; j++)\n        {\n            if(a[i]>a[j])\n            {\n                t=a[i];\n                a[i]=a[j];\n                a[j]=t;\n            }\n        }\n    }\n    for(i=0; i<K; i++)\n    {\n        sum=sum+a[i];\n    }\n    printf(\"%d\\n\",sum);\n    return 0;\n\n}\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nA shop sells N kinds of fruits, Fruit 1, \\ldots, N, at prices of p_1, \\ldots, p_N yen per item, respectively. (Yen is the currency of Japan.)\n\nHere, we will choose K kinds of fruits and buy one of each chosen kind. Find the minimum possible total price of those fruits.\n\nConstraints\n\n1 \\leq K \\leq N \\leq 1000\n\n1 \\leq p_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 K\np_1 p_2 \\ldots p_N\n\nOutput\n\nPrint an integer representing the minimum possible total price of fruits.\n\nSample Input 1\n\n5 3\n50 100 80 120 80\n\nSample Output 1\n\n210\n\nThis shop sells Fruit 1, 2, 3, 4, and 5 for 50 yen, 100 yen, 80 yen, 120 yen, and 80 yen, respectively.\n\nThe minimum total price for three kinds of fruits is 50 + 80 + 80 = 210 yen when choosing Fruit 1, 3, and 5.\n\nSample Input 2\n\n1 1\n1000\n\nSample Output 2\n\n1000", "sample_input": "5 3\n50 100 80 120 80\n"}, "reference_outputs": ["210\n"], "source_document_id": "p02628", "source_text": "Score : 200 points\n\nProblem Statement\n\nA shop sells N kinds of fruits, Fruit 1, \\ldots, N, at prices of p_1, \\ldots, p_N yen per item, respectively. (Yen is the currency of Japan.)\n\nHere, we will choose K kinds of fruits and buy one of each chosen kind. Find the minimum possible total price of those fruits.\n\nConstraints\n\n1 \\leq K \\leq N \\leq 1000\n\n1 \\leq p_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 K\np_1 p_2 \\ldots p_N\n\nOutput\n\nPrint an integer representing the minimum possible total price of fruits.\n\nSample Input 1\n\n5 3\n50 100 80 120 80\n\nSample Output 1\n\n210\n\nThis shop sells Fruit 1, 2, 3, 4, and 5 for 50 yen, 100 yen, 80 yen, 120 yen, and 80 yen, respectively.\n\nThe minimum total price for three kinds of fruits is 50 + 80 + 80 = 210 yen when choosing Fruit 1, 3, and 5.\n\nSample Input 2\n\n1 1\n1000\n\nSample Output 2\n\n1000", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 110, "memory_kb": 1700}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s518030090", "group_id": "codeNet:p02628", "input_text": "#include <stdio.h>\n \nint main(void){\n  int p = 0;\n  int pmin[1000] = {0};\n  int n = 1;\n  int k = 1;\n  int i = 0;\n  int j = 0;\n  int sum = 0;\n  \n  for(j = 0; j < k; j++){\n    pmin[j] = 0x7fff;\n  }\n  \n  scanf(\"%d %d\",&n,&k);\n  for(i = 0; i < n; i++){\n    scanf(\"%d\",&p);\n    for(j = 0; j < k; j++){\n      if(pmin[j] > p ){\n      \tpmin[j] = p;\n        break;\n      }\n    }\n  }\n  \n  for(j = 0; j < k; j++){\n    sum += pmin[j];\n  }\n  \n  printf(\"%d\\n\",sum);\n  return 0;\n}", "language": "C", "metadata": {"date": 1597844991, "filename_ext": "c", "original_language": "C (GCC 9.2.1)", "problem_description_relpath": "problem_descriptions/p02628.html", "problem_id": "p02628", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02628/input.txt", "sample_output_relpath": "derived/input_output/data/p02628/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02628/C/s518030090.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s518030090", "user_id": "u871049050"}, "prompt_components": {"gold_output": "210\n", "input_to_evaluate": "#include <stdio.h>\n \nint main(void){\n  int p = 0;\n  int pmin[1000] = {0};\n  int n = 1;\n  int k = 1;\n  int i = 0;\n  int j = 0;\n  int sum = 0;\n  \n  for(j = 0; j < k; j++){\n    pmin[j] = 0x7fff;\n  }\n  \n  scanf(\"%d %d\",&n,&k);\n  for(i = 0; i < n; i++){\n    scanf(\"%d\",&p);\n    for(j = 0; j < k; j++){\n      if(pmin[j] > p ){\n      \tpmin[j] = p;\n        break;\n      }\n    }\n  }\n  \n  for(j = 0; j < k; j++){\n    sum += pmin[j];\n  }\n  \n  printf(\"%d\\n\",sum);\n  return 0;\n}", "problem_context": "Score : 200 points\n\nProblem Statement\n\nA shop sells N kinds of fruits, Fruit 1, \\ldots, N, at prices of p_1, \\ldots, p_N yen per item, respectively. (Yen is the currency of Japan.)\n\nHere, we will choose K kinds of fruits and buy one of each chosen kind. Find the minimum possible total price of those fruits.\n\nConstraints\n\n1 \\leq K \\leq N \\leq 1000\n\n1 \\leq p_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 K\np_1 p_2 \\ldots p_N\n\nOutput\n\nPrint an integer representing the minimum possible total price of fruits.\n\nSample Input 1\n\n5 3\n50 100 80 120 80\n\nSample Output 1\n\n210\n\nThis shop sells Fruit 1, 2, 3, 4, and 5 for 50 yen, 100 yen, 80 yen, 120 yen, and 80 yen, respectively.\n\nThe minimum total price for three kinds of fruits is 50 + 80 + 80 = 210 yen when choosing Fruit 1, 3, and 5.\n\nSample Input 2\n\n1 1\n1000\n\nSample Output 2\n\n1000", "sample_input": "5 3\n50 100 80 120 80\n"}, "reference_outputs": ["210\n"], "source_document_id": "p02628", "source_text": "Score : 200 points\n\nProblem Statement\n\nA shop sells N kinds of fruits, Fruit 1, \\ldots, N, at prices of p_1, \\ldots, p_N yen per item, respectively. (Yen is the currency of Japan.)\n\nHere, we will choose K kinds of fruits and buy one of each chosen kind. Find the minimum possible total price of those fruits.\n\nConstraints\n\n1 \\leq K \\leq N \\leq 1000\n\n1 \\leq p_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 K\np_1 p_2 \\ldots p_N\n\nOutput\n\nPrint an integer representing the minimum possible total price of fruits.\n\nSample Input 1\n\n5 3\n50 100 80 120 80\n\nSample Output 1\n\n210\n\nThis shop sells Fruit 1, 2, 3, 4, and 5 for 50 yen, 100 yen, 80 yen, 120 yen, and 80 yen, respectively.\n\nThe minimum total price for three kinds of fruits is 50 + 80 + 80 = 210 yen when choosing Fruit 1, 3, and 5.\n\nSample Input 2\n\n1 1\n1000\n\nSample Output 2\n\n1000", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 5, "memory_kb": 1736}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s296080337", "group_id": "codeNet:p02629", "input_text": "#include <stdio.h>\n#include <string.h>\n#include <stdbool.h>\n#include <math.h>\n\nint to26gram(long long N) {\n    if( N < 26 ) {\n        printf(\"%c\", 'a' + (int)N );\n        return 0;\n    }\n\n    to26gram( (N / 26) - 1 );\n    printf(\"%c\", 'a' + (int)(N % 26) );\n    return 0;\n}\n\nint main(void) {\n    long long N;\n    bool chk = false;\n\n    scanf(\"%lld\", &N);\n    N--;\n\n    to26gram( N );\n    printf(\"\\n\");\n\n    return 0;\n}\n", "language": "C", "metadata": {"date": 1592792421, "filename_ext": "c", "original_language": "C (GCC 9.2.1)", "problem_description_relpath": "problem_descriptions/p02629.html", "problem_id": "p02629", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02629/input.txt", "sample_output_relpath": "derived/input_output/data/p02629/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02629/C/s296080337.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s296080337", "user_id": "u339658123"}, "prompt_components": {"gold_output": "b\n", "input_to_evaluate": "#include <stdio.h>\n#include <string.h>\n#include <stdbool.h>\n#include <math.h>\n\nint to26gram(long long N) {\n    if( N < 26 ) {\n        printf(\"%c\", 'a' + (int)N );\n        return 0;\n    }\n\n    to26gram( (N / 26) - 1 );\n    printf(\"%c\", 'a' + (int)(N % 26) );\n    return 0;\n}\n\nint main(void) {\n    long long N;\n    bool chk = false;\n\n    scanf(\"%lld\", &N);\n    N--;\n\n    to26gram( N );\n    printf(\"\\n\");\n\n    return 0;\n}\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\n1000000000000001 dogs suddenly appeared under the roof of Roger's house, all of which he decided to keep. The dogs had been numbered 1 through 1000000000000001, but he gave them new names, as follows:\n\nthe dogs numbered 1,2,\\cdots,26 were respectively given the names a, b, ..., z;\n\nthe dogs numbered 27,28,29,\\cdots,701,702 were respectively given the names aa, ab, ac, ..., zy, zz;\n\nthe dogs numbered 703,704,705,\\cdots,18277,18278 were respectively given the names aaa, aab, aac, ..., zzy, zzz;\n\nthe dogs numbered 18279,18280,18281,\\cdots,475253,475254 were respectively given the names aaaa, aaab, aaac, ..., zzzy, zzzz;\n\nthe dogs numbered 475255,475256,\\cdots were respectively given the names aaaaa, aaaab, ...;\n\nand so on.\n\nTo sum it up, the dogs numbered 1, 2, \\cdots were respectively given the following names:\n\na, b, ..., z, aa, ab, ..., az, ba, bb, ..., bz, ..., za, zb, ..., zz, aaa, aab, ..., aaz, aba, abb, ..., abz, ..., zzz, aaaa, ...\n\nNow, Roger asks you:\n\n\"What is the name for the dog numbered N?\"\n\nConstraints\n\nN is an integer.\n\n1 \\leq N \\leq 1000000000000001\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the answer to Roger's question as a string consisting of lowercase English letters.\n\nSample Input 1\n\n2\n\nSample Output 1\n\nb\n\nSample Input 2\n\n27\n\nSample Output 2\n\naa\n\nSample Input 3\n\n123456789\n\nSample Output 3\n\njjddja", "sample_input": "2\n"}, "reference_outputs": ["b\n"], "source_document_id": "p02629", "source_text": "Score : 300 points\n\nProblem Statement\n\n1000000000000001 dogs suddenly appeared under the roof of Roger's house, all of which he decided to keep. The dogs had been numbered 1 through 1000000000000001, but he gave them new names, as follows:\n\nthe dogs numbered 1,2,\\cdots,26 were respectively given the names a, b, ..., z;\n\nthe dogs numbered 27,28,29,\\cdots,701,702 were respectively given the names aa, ab, ac, ..., zy, zz;\n\nthe dogs numbered 703,704,705,\\cdots,18277,18278 were respectively given the names aaa, aab, aac, ..., zzy, zzz;\n\nthe dogs numbered 18279,18280,18281,\\cdots,475253,475254 were respectively given the names aaaa, aaab, aaac, ..., zzzy, zzzz;\n\nthe dogs numbered 475255,475256,\\cdots were respectively given the names aaaaa, aaaab, ...;\n\nand so on.\n\nTo sum it up, the dogs numbered 1, 2, \\cdots were respectively given the following names:\n\na, b, ..., z, aa, ab, ..., az, ba, bb, ..., bz, ..., za, zb, ..., zz, aaa, aab, ..., aaz, aba, abb, ..., abz, ..., zzz, aaaa, ...\n\nNow, Roger asks you:\n\n\"What is the name for the dog numbered N?\"\n\nConstraints\n\nN is an integer.\n\n1 \\leq N \\leq 1000000000000001\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the answer to Roger's question as a string consisting of lowercase English letters.\n\nSample Input 1\n\n2\n\nSample Output 1\n\nb\n\nSample Input 2\n\n27\n\nSample Output 2\n\naa\n\nSample Input 3\n\n123456789\n\nSample Output 3\n\njjddja", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 419, "cpu_time_ms": 3, "memory_kb": 1648}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s306297417", "group_id": "codeNet:p02631", "input_text": "#include <stdio.h>\n#include <stdlib.h>\n#include <string.h>\n#include <math.h>\n\n#define SIZE 100005\n#define PI acosl(-1) //3.14159265358979323846264338327950L \n#define rep(i, N) for (i = 0; i < N; i++) //制御変数iを用いてN回転\n#define array(N, t) (t*)calloc(N, sizeof(t)) //t型N要素の1次元配列を動的確保後0クリア(freeを忘れずに)\n#define zero(a); {int iter; rep(iter, sizeof(a)/sizeof((a)[0])) (a)[iter]=0;} //1次元配列aのゼロ初期化?\n\ntypedef long long ll; typedef long double ld;\ntypedef struct node { int data; struct node *next; } Node;\n\nNode *list[SIZE];\nint queue[SIZE]; int q_head = 0, q_tail = 0;\n\nvoid print_log(); //とりあえず文字を出力してどこまで実行できているか確認(for debug)\nvoid printa_int(int *a, int size); //int型の1次元配列aを出力(for debug)\nvoid printl_int(int size); //リンクリストを出力(for debug)\nint comp(const void *a, const void *b); //昇順並び替えに使う比較関数\nNode* add_node(int i, int data); void free_list(Node* head);\nint queue_empty(); int queue_full();\nvoid enqueue(int data); int dequeue();\nll* factorize(ll N); //Nを素因数分解、得られる配列は素因数,指数,素因数,…となっている(添字はintで指定する必要あり?)\nvoid check_factorization(ll *fact); //素因数分解を表示(for debug)\n\nint main() {\n    int i, j, N;\n    ll num;\n    scanf(\"%d\", &N);\n    ll *a = array(N, ll);\n    rep(i, N) scanf(\"%lld\", a + i);\n    for (i = 0; i < N; i += 2) {\n        num = a[i + 1];\n        for (j = i + 2; j < N; j++) {\n            num = num ^ a[j];\n            a[j] = a[j] ^ a[i] ^ a[i + 1];\n        }\n        printf(\"%lld %lld\", num, num ^ a[i + 1]^a[i]);\n        if (i == N - 2) printf(\"\\n\");\n        else printf(\" \");\n    }\n\n    free(a);\n    return 0;\n}\n\nvoid print_log() {\n    printf(\"=== print log ===\\n\");\n}\nvoid printa_int(int *a, int size) {\n    int i;\n    printf(\"[\");\n    for (i = 0; i < size; i++)\n        printf(\"%d, \", a[i]);\n    printf(\"]\\n\");\n}\nvoid printl_int(int size) {\n    int i;\n    Node *t;\n    rep(i, size) {\n        printf(\"[%d] \", i);\n        for (t = list[i]; t; t = t->next) printf(\"%d, \", t->data);\n        printf(\"\\n\");\n    }\n}\nint comp(const void *a, const void *b) {\n    return *(int*)a - *(int*)b;\n}\nNode* add_node(int i, int data) {\n    if (!list[i]) {\n        list[i] = (Node*)malloc(sizeof(Node*));\n        list[i]->data = data;\n    } else {\n        Node *t;\n        t = list[i];\n        list[i] = (Node*)malloc(sizeof(Node*));\n        list[i]->data = data;\n        list[i]->next = t;\n    }\n    return list[i];\n}\nvoid free_list(Node* head) {\n    Node *prev = NULL, *t = head;\n    while (t) {\n        prev = t;\n        t = t->next;\n        free(prev);\n    }\n}\nint queue_empty() {\n    return q_head == q_tail;\n}\nint queue_full() {\n    return (q_head - 1) % SIZE == q_tail % SIZE;\n}\nvoid enqueue(int data) {\n    if (queue_full()) {\n        printf(\"full!\\n\");\n        return;\n    }\n    queue[q_tail++] = data;\n    q_tail %= SIZE;\n}\nint dequeue() {\n    if (queue_empty()) {\n        printf(\"empty!\\n\");\n        return -444444;\n    }\n    int data = queue[q_head++];\n    q_head %= SIZE;\n    return data;\n}\nll* factorize(ll N) {\n    ll *res = array(((sqrt(N) + 1) * 2), ll);\n    ll i, x = N;\n    int count = 0;\n    for (i = 2; i * i <= N; i++) {\n        ll e = 0;\n        while (x % i == 0) {\n            x /= i;\n            e++;\n        }\n        if (e > 0) {\n            res[count * 2] = i;\n            res[count * 2 + 1] = e;\n            count++;\n        }\n    }\n    if (x > 1) {\n        res[count * 2] = x;\n        res[count * 2 + 1] = 1;\n    }\n    return res;\n}\nvoid check_factorization(ll *fact) {\n    int i = 1;\n    printf(\"%lld^%lld\", fact[0], fact[1]);\n    while (fact[i * 2] > 0) {\n        printf(\" * %lld^%lld\", fact[i * 2], fact[i * 2 + 1]);\n        i++;\n    }\n    printf(\"\\n\");\n}", "language": "C", "metadata": {"date": 1592792100, "filename_ext": "c", "original_language": "C (GCC 9.2.1)", "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/C/s306297417.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s306297417", "user_id": "u020173959"}, "prompt_components": {"gold_output": "26 5 7 22\n", "input_to_evaluate": "#include <stdio.h>\n#include <stdlib.h>\n#include <string.h>\n#include <math.h>\n\n#define SIZE 100005\n#define PI acosl(-1) //3.14159265358979323846264338327950L \n#define rep(i, N) for (i = 0; i < N; i++) //制御変数iを用いてN回転\n#define array(N, t) (t*)calloc(N, sizeof(t)) //t型N要素の1次元配列を動的確保後0クリア(freeを忘れずに)\n#define zero(a); {int iter; rep(iter, sizeof(a)/sizeof((a)[0])) (a)[iter]=0;} //1次元配列aのゼロ初期化?\n\ntypedef long long ll; typedef long double ld;\ntypedef struct node { int data; struct node *next; } Node;\n\nNode *list[SIZE];\nint queue[SIZE]; int q_head = 0, q_tail = 0;\n\nvoid print_log(); //とりあえず文字を出力してどこまで実行できているか確認(for debug)\nvoid printa_int(int *a, int size); //int型の1次元配列aを出力(for debug)\nvoid printl_int(int size); //リンクリストを出力(for debug)\nint comp(const void *a, const void *b); //昇順並び替えに使う比較関数\nNode* add_node(int i, int data); void free_list(Node* head);\nint queue_empty(); int queue_full();\nvoid enqueue(int data); int dequeue();\nll* factorize(ll N); //Nを素因数分解、得られる配列は素因数,指数,素因数,…となっている(添字はintで指定する必要あり?)\nvoid check_factorization(ll *fact); //素因数分解を表示(for debug)\n\nint main() {\n    int i, j, N;\n    ll num;\n    scanf(\"%d\", &N);\n    ll *a = array(N, ll);\n    rep(i, N) scanf(\"%lld\", a + i);\n    for (i = 0; i < N; i += 2) {\n        num = a[i + 1];\n        for (j = i + 2; j < N; j++) {\n            num = num ^ a[j];\n            a[j] = a[j] ^ a[i] ^ a[i + 1];\n        }\n        printf(\"%lld %lld\", num, num ^ a[i + 1]^a[i]);\n        if (i == N - 2) printf(\"\\n\");\n        else printf(\" \");\n    }\n\n    free(a);\n    return 0;\n}\n\nvoid print_log() {\n    printf(\"=== print log ===\\n\");\n}\nvoid printa_int(int *a, int size) {\n    int i;\n    printf(\"[\");\n    for (i = 0; i < size; i++)\n        printf(\"%d, \", a[i]);\n    printf(\"]\\n\");\n}\nvoid printl_int(int size) {\n    int i;\n    Node *t;\n    rep(i, size) {\n        printf(\"[%d] \", i);\n        for (t = list[i]; t; t = t->next) printf(\"%d, \", t->data);\n        printf(\"\\n\");\n    }\n}\nint comp(const void *a, const void *b) {\n    return *(int*)a - *(int*)b;\n}\nNode* add_node(int i, int data) {\n    if (!list[i]) {\n        list[i] = (Node*)malloc(sizeof(Node*));\n        list[i]->data = data;\n    } else {\n        Node *t;\n        t = list[i];\n        list[i] = (Node*)malloc(sizeof(Node*));\n        list[i]->data = data;\n        list[i]->next = t;\n    }\n    return list[i];\n}\nvoid free_list(Node* head) {\n    Node *prev = NULL, *t = head;\n    while (t) {\n        prev = t;\n        t = t->next;\n        free(prev);\n    }\n}\nint queue_empty() {\n    return q_head == q_tail;\n}\nint queue_full() {\n    return (q_head - 1) % SIZE == q_tail % SIZE;\n}\nvoid enqueue(int data) {\n    if (queue_full()) {\n        printf(\"full!\\n\");\n        return;\n    }\n    queue[q_tail++] = data;\n    q_tail %= SIZE;\n}\nint dequeue() {\n    if (queue_empty()) {\n        printf(\"empty!\\n\");\n        return -444444;\n    }\n    int data = queue[q_head++];\n    q_head %= SIZE;\n    return data;\n}\nll* factorize(ll N) {\n    ll *res = array(((sqrt(N) + 1) * 2), ll);\n    ll i, x = N;\n    int count = 0;\n    for (i = 2; i * i <= N; i++) {\n        ll e = 0;\n        while (x % i == 0) {\n            x /= i;\n            e++;\n        }\n        if (e > 0) {\n            res[count * 2] = i;\n            res[count * 2 + 1] = e;\n            count++;\n        }\n    }\n    if (x > 1) {\n        res[count * 2] = x;\n        res[count * 2 + 1] = 1;\n    }\n    return res;\n}\nvoid check_factorization(ll *fact) {\n    int i = 1;\n    printf(\"%lld^%lld\", fact[0], fact[1]);\n    while (fact[i * 2] > 0) {\n        printf(\" * %lld^%lld\", fact[i * 2], fact[i * 2 + 1]);\n        i++;\n    }\n    printf(\"\\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": 3872, "cpu_time_ms": 2205, "memory_kb": 3532}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s173415355", "group_id": "codeNet:p02631", "input_text": "#include<stdio.h>\nint main()\n{\n\tint n;\n\tscanf(\"%d\", &n);\n\tint i;\n\tint a[200005];\n\tfor (i = 0; i < n; i++)\n\t\tscanf(\"%d\", &a[i]);\n\tint x = 0;\n\tfor (i = 0; i < n; i++)\n\t\tx ^= a[i];\n\tfor (i = 0; i < n - 1; i++)\n\t\tprintf(\"%d \", x ^ a[i]);\n\tprintf(\"%d\\n\", x ^ a[n - 1]);\n\treturn 0;\n}", "language": "C", "metadata": {"date": 1592788651, "filename_ext": "c", "original_language": "C (GCC 9.2.1)", "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/C/s173415355.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s173415355", "user_id": "u600300412"}, "prompt_components": {"gold_output": "26 5 7 22\n", "input_to_evaluate": "#include<stdio.h>\nint main()\n{\n\tint n;\n\tscanf(\"%d\", &n);\n\tint i;\n\tint a[200005];\n\tfor (i = 0; i < n; i++)\n\t\tscanf(\"%d\", &a[i]);\n\tint x = 0;\n\tfor (i = 0; i < n; i++)\n\t\tx ^= a[i];\n\tfor (i = 0; i < n - 1; i++)\n\t\tprintf(\"%d \", x ^ a[i]);\n\tprintf(\"%d\\n\", x ^ a[n - 1]);\n\treturn 0;\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": 277, "cpu_time_ms": 50, "memory_kb": 3256}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s597873003", "group_id": "codeNet:p02634", "input_text": "#include <stdio.h>\n\nint arr1[] = {428274490,572927537,0,0,0,382893219,0,0,31713958,8999999};\nint arr2[] = {151559672,387222020,0,0,0,382893219,529254880,437833367,31713958,8999999};\n\nchar ch[20];\nint main(void) {\n    // テストケースハックする良くないコード\n    fread(ch, sizeof(char), 7, stdin);\n    int res = 1;\n    if (ch[1] == ' '){\n        if (ch[4] == '3'){\n            if (ch[6] == '4'){\n                res = 65;\n            } else if (ch[5] == '0'){\n                fread(ch, sizeof(char), 3, stdin);\n                if(ch[2] == '3') {\n                    res = 823951039;\n                }\n            }\n        } else if (ch[2] != ch[4]){\n            res = 3;\n        }\n    } else if (ch[0] < '3'){\n        res = arr1[ch[1]-'0'];\n    }else{\n        res = arr2[ch[1]-'0'];\n        if(ch[2]=='8')res = 632611002;\n    }\n    printf(\"%d\\n\", res);\n    return 0;\n}", "language": "C", "metadata": {"date": 1597219766, "filename_ext": "c", "original_language": "C (GCC 9.2.1)", "problem_description_relpath": "problem_descriptions/p02634.html", "problem_id": "p02634", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02634/input.txt", "sample_output_relpath": "derived/input_output/data/p02634/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02634/C/s597873003.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s597873003", "user_id": "u959888075"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "#include <stdio.h>\n\nint arr1[] = {428274490,572927537,0,0,0,382893219,0,0,31713958,8999999};\nint arr2[] = {151559672,387222020,0,0,0,382893219,529254880,437833367,31713958,8999999};\n\nchar ch[20];\nint main(void) {\n    // テストケースハックする良くないコード\n    fread(ch, sizeof(char), 7, stdin);\n    int res = 1;\n    if (ch[1] == ' '){\n        if (ch[4] == '3'){\n            if (ch[6] == '4'){\n                res = 65;\n            } else if (ch[5] == '0'){\n                fread(ch, sizeof(char), 3, stdin);\n                if(ch[2] == '3') {\n                    res = 823951039;\n                }\n            }\n        } else if (ch[2] != ch[4]){\n            res = 3;\n        }\n    } else if (ch[0] < '3'){\n        res = arr1[ch[1]-'0'];\n    }else{\n        res = arr2[ch[1]-'0'];\n        if(ch[2]=='8')res = 632611002;\n    }\n    printf(\"%d\\n\", res);\n    return 0;\n}", "problem_context": "Score : 600 points\n\nProblem Statement\n\nWe have a grid with A horizontal rows and B vertical columns, with the squares painted white. On this grid, we will repeatedly apply the following operation:\n\nAssume that the grid currently has a horizontal rows and b vertical columns. Choose \"vertical\" or \"horizontal\".\n\nIf we choose \"vertical\", insert one row at the top of the grid, resulting in an (a+1) \\times b grid.\n\nIf we choose \"horizontal\", insert one column at the right end of the grid, resulting in an a \\times (b+1) grid.\n\nThen, paint one of the added squares black, and the other squares white.\n\nAssume the grid eventually has C horizontal rows and D vertical columns. Find the number of ways in which the squares can be painted in the end, modulo 998244353.\n\nConstraints\n\n1 \\leq A \\leq C \\leq 3000\n\n1 \\leq B \\leq D \\leq 3000\n\nA, B, C, and D 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 number of ways in which the squares can be painted in the end, modulo 998244353.\n\nSample Input 1\n\n1 1 2 2\n\nSample Output 1\n\n3\n\nAny two of the three squares other than the bottom-left square can be painted black.\n\nSample Input 2\n\n2 1 3 4\n\nSample Output 2\n\n65\n\nSample Input 3\n\n31 41 59 265\n\nSample Output 3\n\n387222020", "sample_input": "1 1 2 2\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02634", "source_text": "Score : 600 points\n\nProblem Statement\n\nWe have a grid with A horizontal rows and B vertical columns, with the squares painted white. On this grid, we will repeatedly apply the following operation:\n\nAssume that the grid currently has a horizontal rows and b vertical columns. Choose \"vertical\" or \"horizontal\".\n\nIf we choose \"vertical\", insert one row at the top of the grid, resulting in an (a+1) \\times b grid.\n\nIf we choose \"horizontal\", insert one column at the right end of the grid, resulting in an a \\times (b+1) grid.\n\nThen, paint one of the added squares black, and the other squares white.\n\nAssume the grid eventually has C horizontal rows and D vertical columns. Find the number of ways in which the squares can be painted in the end, modulo 998244353.\n\nConstraints\n\n1 \\leq A \\leq C \\leq 3000\n\n1 \\leq B \\leq D \\leq 3000\n\nA, B, C, and D 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 number of ways in which the squares can be painted in the end, modulo 998244353.\n\nSample Input 1\n\n1 1 2 2\n\nSample Output 1\n\n3\n\nAny two of the three squares other than the bottom-left square can be painted black.\n\nSample Input 2\n\n2 1 3 4\n\nSample Output 2\n\n65\n\nSample Input 3\n\n31 41 59 265\n\nSample Output 3\n\n387222020", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 4, "memory_kb": 1564}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s182581449", "group_id": "codeNet:p02639", "input_text": "#include<stdio.h>\n\nint main(){\n   int x[5];\n   for(int i=0;i<5;i++){\n      scanf(\"%d\",&x[i]);\n   }\n   for(int i=0;i<5;i++){\n      if(x[i]==0){\n         printf(\"%d\\n\",i+1);\n      }\n   }\n   return 0;\n}\n      \n", "language": "C", "metadata": {"date": 1595286614, "filename_ext": "c", "original_language": "C (GCC 9.2.1)", "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/C/s182581449.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s182581449", "user_id": "u633470019"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "#include<stdio.h>\n\nint main(){\n   int x[5];\n   for(int i=0;i<5;i++){\n      scanf(\"%d\",&x[i]);\n   }\n   for(int i=0;i<5;i++){\n      if(x[i]==0){\n         printf(\"%d\\n\",i+1);\n      }\n   }\n   return 0;\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": 207, "cpu_time_ms": 5, "memory_kb": 1684}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s468014303", "group_id": "codeNet:p02639", "input_text": "#include<stdio.h>\nint main(void){\nint x[5];\nfor(int i=0;i<5;i++){\nscanf(\"%d\",&x[i]);\nif(x[i]==0){\nprintf(\"%d\",i+1);\n}\n}\nreturn 0;}", "language": "C", "metadata": {"date": 1592360675, "filename_ext": "c", "original_language": "C (Clang 10.0.0)", "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/C/s468014303.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s468014303", "user_id": "u328638582"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "#include<stdio.h>\nint main(void){\nint x[5];\nfor(int i=0;i<5;i++){\nscanf(\"%d\",&x[i]);\nif(x[i]==0){\nprintf(\"%d\",i+1);\n}\n}\nreturn 0;}", "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": 130, "cpu_time_ms": 10, "memory_kb": 2104}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s242636790", "group_id": "codeNet:p02639", "input_text": "#include <stdio.h>\n\nint main(){\n    int i, x;\n    for (i=0; i<5; i++){\n        scanf(\"%d\", &x);\n        if (x == 0){\n            printf(\"%d\\n\", i+1);\n            return 0;\n        }\n    }\n    return 0;\n}", "language": "C", "metadata": {"date": 1592314235, "filename_ext": "c", "original_language": "C (GCC 9.2.1)", "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/C/s242636790.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s242636790", "user_id": "u709079466"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "#include <stdio.h>\n\nint main(){\n    int i, x;\n    for (i=0; i<5; i++){\n        scanf(\"%d\", &x);\n        if (x == 0){\n            printf(\"%d\\n\", i+1);\n            return 0;\n        }\n    }\n    return 0;\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": 203, "cpu_time_ms": 6, "memory_kb": 1728}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s046265686", "group_id": "codeNet:p02639", "input_text": "#include <stdio.h>\n\nint main(void)\n{\n  long long int x[6];\n  scanf(\"%lld %lld %lld %lld %lld\", &x[1], &x[2], &x[3], &x[4], &x[5]);\n  for(long long int i=1;i<=5;i++){\n    if(x[i]==0){\n      printf(\"%lld\\n\", i);\n    }\n  }\n  return 0;\n}\n", "language": "C", "metadata": {"date": 1592183184, "filename_ext": "c", "original_language": "C (GCC 9.2.1)", "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/C/s046265686.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s046265686", "user_id": "u737545415"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "#include <stdio.h>\n\nint main(void)\n{\n  long long int x[6];\n  scanf(\"%lld %lld %lld %lld %lld\", &x[1], &x[2], &x[3], &x[4], &x[5]);\n  for(long long int i=1;i<=5;i++){\n    if(x[i]==0){\n      printf(\"%lld\\n\", i);\n    }\n  }\n  return 0;\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": 234, "cpu_time_ms": 1, "memory_kb": 1708}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s849228112", "group_id": "codeNet:p02640", "input_text": "#include<stdio.h>\n\nint main(void){\n   int x,y;\n\n   scanf(\"%d %d\",&x,&y);\n   if(y%2!=0){\n      printf(\"NO\\n\");\n      return 0;\n   }\n   if(x<=y/2&&x>=(y+3)/4){\n      printf(\"YES\\n\");\n      return 0;\n   }\n   printf(\"NO\\n\");\n   return 0;\n}\n", "language": "C", "metadata": {"date": 1595263775, "filename_ext": "c", "original_language": "C (GCC 9.2.1)", "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/C/s849228112.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s849228112", "user_id": "u511060113"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "#include<stdio.h>\n\nint main(void){\n   int x,y;\n\n   scanf(\"%d %d\",&x,&y);\n   if(y%2!=0){\n      printf(\"NO\\n\");\n      return 0;\n   }\n   if(x<=y/2&&x>=(y+3)/4){\n      printf(\"YES\\n\");\n      return 0;\n   }\n   printf(\"NO\\n\");\n   return 0;\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": 236, "cpu_time_ms": 6, "memory_kb": 1648}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s496711185", "group_id": "codeNet:p02640", "input_text": "#include <stdio.h>\n\nint main(void)\n{\n\tint data1,data2;\n  \tint c;\n  \tint i;\n\tscanf(\"%d%d\",&data1,&data2);\t/* 入力部分 */\n  \t\n  \tfor(i = 0;i < data1;i++){\n    if(data2 == (data1 * 2) + (i * 2)){\n      c = 1;\n    }\n    }\n  if(c == 1){\n\tprintf(\"Yes\");}\n  else printf(\"No\");\n  \n\treturn 0;\n}", "language": "C", "metadata": {"date": 1592184362, "filename_ext": "c", "original_language": "C (GCC 9.2.1)", "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/C/s496711185.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s496711185", "user_id": "u931246341"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "#include <stdio.h>\n\nint main(void)\n{\n\tint data1,data2;\n  \tint c;\n  \tint i;\n\tscanf(\"%d%d\",&data1,&data2);\t/* 入力部分 */\n  \t\n  \tfor(i = 0;i < data1;i++){\n    if(data2 == (data1 * 2) + (i * 2)){\n      c = 1;\n    }\n    }\n  if(c == 1){\n\tprintf(\"Yes\");}\n  else printf(\"No\");\n  \n\treturn 0;\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": 289, "cpu_time_ms": 3, "memory_kb": 1736}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s573865813", "group_id": "codeNet:p02641", "input_text": "#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\n#include <string.h>\n\nint main() {\n    int x, n;\n    int p[100];\n    int i, j;\n    int ans, mans, flag;\n    scanf(\"%d %d\", &x, &n);\n    for (i=0;i<n;i++) scanf(\"%d\", &p[i]);\n    ans=1000;\n    mans=1000;\n    if (n==0) {\n        printf(\"%d\\n\", x);\n        return 0;\n    }\n    for (j=x;j<102;j++) {\n        flag=1;\n        for (i=0;i<n;i++) {\n            if(p[i]==j) flag=0;\n        }\n        if (flag) {\n            ans=j;\n            break;\n        }\n    }\n    for (j=x;j>-101;j--) {\n        flag=1;\n        for (i=0;i<n;i++) {\n            if(p[i]==j) flag=0;\n        }\n        if (flag) {\n            mans=j;\n            break;\n        }\n    }\n    if (abs(x-ans)>abs(x-mans)) {\n        printf(\"%d\\n\", mans);\n    } else if (abs(x-ans)==abs(x-mans)) {\n        printf(\"%d\\n\", mans);\n    } else {\n        printf(\"%d\\n\", ans);\n    }\n    return 0;\n}", "language": "C", "metadata": {"date": 1595297815, "filename_ext": "c", "original_language": "C (GCC 9.2.1)", "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/C/s573865813.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s573865813", "user_id": "u264818289"}, "prompt_components": {"gold_output": "8\n", "input_to_evaluate": "#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\n#include <string.h>\n\nint main() {\n    int x, n;\n    int p[100];\n    int i, j;\n    int ans, mans, flag;\n    scanf(\"%d %d\", &x, &n);\n    for (i=0;i<n;i++) scanf(\"%d\", &p[i]);\n    ans=1000;\n    mans=1000;\n    if (n==0) {\n        printf(\"%d\\n\", x);\n        return 0;\n    }\n    for (j=x;j<102;j++) {\n        flag=1;\n        for (i=0;i<n;i++) {\n            if(p[i]==j) flag=0;\n        }\n        if (flag) {\n            ans=j;\n            break;\n        }\n    }\n    for (j=x;j>-101;j--) {\n        flag=1;\n        for (i=0;i<n;i++) {\n            if(p[i]==j) flag=0;\n        }\n        if (flag) {\n            mans=j;\n            break;\n        }\n    }\n    if (abs(x-ans)>abs(x-mans)) {\n        printf(\"%d\\n\", mans);\n    } else if (abs(x-ans)==abs(x-mans)) {\n        printf(\"%d\\n\", mans);\n    } else {\n        printf(\"%d\\n\", ans);\n    }\n    return 0;\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": 899, "cpu_time_ms": 7, "memory_kb": 1700}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s339050012", "group_id": "codeNet:p02641", "input_text": "\n#pragma warning(disable:4996)\n\n#include <stdio.h>\n#include <stdlib.h>\n#include <string.h>\n#define _USE_MATH_DEFINES\n#include <math.h>\n#include <float.h>\n\n#pragma region 定義\ntypedef long long  ll;\ntypedef unsigned long long  ull;\n\n\n#define _itoa(A,N) sprintf(A, \"%d\", N);\n\nint i_dsort(const void* a, const void* b);\nint i_asort(const void* a, const void* b);\n\nint  _gcd(int a, int b);\nint  _swp(int* a, int* b);\nint _cknum(char* a, int n);\nint _atoi(char* s, int len);\n\nint s_asort(const void* a, const void* b);\nint s_dsort(const void* a, const void* b);\n\n//昇順\nint s_asort(const void* a, const void* b) {\n\treturn(strcmp((char*)a, (char*)b));\n}\nint s_dsort(const void* a, const void* b) {\n\treturn(strcmp((char*)b, (char*)a));\n}\n\nint i_dsort(const void* a, const void* b) {\n\treturn(*(int*)b - *(int*)a);\n}\nint i_asort(const void* a, const void* b) {\n\treturn(*(int*)a - *(int*)b);\n}\n\nint _gcd(int a, int b) {\n\tint r, tmp;\n\tif (a < b) { tmp = a; a = b; b = tmp; }\n\tr = a % b;\n\twhile (r) {\n\t\tif (!r) break;\n\t\ta = b; b = r;\n\t\tr = a % b;\n\t}\n\treturn(b);\n}\n// puts(\"Yes\\n\") puts(\"No\\n\")\n// scanf(\"%d.%d\") 浮動小数点入力を整数２つで得る\n\n\n//#define pai  3.1415926535 \n//#define  _USE_MATH_DEFINES でM_PIが使える\n\n#define deg_rad(X)  (X*(M_PI/180))\n\n\nint _swp(int* a, int* b)\n{\n\tint tmp;\n\ttmp = *b; *b = *a; *a = tmp;\n\treturn 0;\n}\n#define _abs(x) ((x)>0?(x):-(x))\n#define _min(x,y) ((x)<(y)?(x):(y))\n#define _max(x,y) ((x)<(y)?(y):(x))\n\nint _cknum(char* a, int n) {\n\tint i;\n\tchar t = '0';\n\n\tfor (i = 0; i < n; i++) {\n\t\tif (a[i] < '0' || a[i]>'9') return 1;\n\t}\n\treturn 0;\n}\n\n\nint _atoi(char* s, int len) {\n\tchar tmp[20];\n\tmemcpy(tmp, s, len);\n\ttmp[len] = 0x00;\n\treturn (atoi(tmp));\n}\n\n//素因数分解　pf素数が入る　pc 素数の数\nll _pfact(ll a);\nstatic ll pf[100000000];\nstatic ll pc;\n\nll _pfact(ll a) {\n\tlong i, r;\n\tif (a % 2 == 0) {\n\t\tpf[pc] = 2; pc++;\n\t\treturn(_pfact(a / 2));\n\t}\n\tr = sqrt(a);\n\tfor (i = 3; i <= r; i += 2) {\n\t\tif (a % i == 0) {\n\t\t\tpf[pc] = i; pc++;\n\t\t\treturn(_pfact(a / i));\n\t\t}\n\t}\n\tif (a != 1) {\n\t\tpf[pc] = a; pc++;\n\t}\n\treturn 0;\n\n}\n\n\n#pragma endregion\n\n//ABC 163 -B\nstatic int f[101];\nint main(void) {\n\tint i, x, n, p[101];\n\n\tscanf(\"%d %d\", &x, &n);\n\tfor (i = 0; i < n; i++) {\n\t\tscanf(\"%d\", &p[i]);\n\t\tf[p[i]] = 1;\n\t}\n\n\tint min = 1000,ans,t;\n\n\tfor (i = 0; i <= 100; i++) {\n\t\tif (f[i])continue;\n\t\tt=abs(x - i);\n\t\tif (t < min) {\n\t\t\tmin = t; ans = i;\n\t\t}\n\t}\n\t(min == 1000) ? printf(\"101\"):printf(\"%d\\n\",ans);\n\treturn 0;\n}\n", "language": "C", "metadata": {"date": 1592359906, "filename_ext": "c", "original_language": "C (GCC 9.2.1)", "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/C/s339050012.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s339050012", "user_id": "u918599282"}, "prompt_components": {"gold_output": "8\n", "input_to_evaluate": "\n#pragma warning(disable:4996)\n\n#include <stdio.h>\n#include <stdlib.h>\n#include <string.h>\n#define _USE_MATH_DEFINES\n#include <math.h>\n#include <float.h>\n\n#pragma region 定義\ntypedef long long  ll;\ntypedef unsigned long long  ull;\n\n\n#define _itoa(A,N) sprintf(A, \"%d\", N);\n\nint i_dsort(const void* a, const void* b);\nint i_asort(const void* a, const void* b);\n\nint  _gcd(int a, int b);\nint  _swp(int* a, int* b);\nint _cknum(char* a, int n);\nint _atoi(char* s, int len);\n\nint s_asort(const void* a, const void* b);\nint s_dsort(const void* a, const void* b);\n\n//昇順\nint s_asort(const void* a, const void* b) {\n\treturn(strcmp((char*)a, (char*)b));\n}\nint s_dsort(const void* a, const void* b) {\n\treturn(strcmp((char*)b, (char*)a));\n}\n\nint i_dsort(const void* a, const void* b) {\n\treturn(*(int*)b - *(int*)a);\n}\nint i_asort(const void* a, const void* b) {\n\treturn(*(int*)a - *(int*)b);\n}\n\nint _gcd(int a, int b) {\n\tint r, tmp;\n\tif (a < b) { tmp = a; a = b; b = tmp; }\n\tr = a % b;\n\twhile (r) {\n\t\tif (!r) break;\n\t\ta = b; b = r;\n\t\tr = a % b;\n\t}\n\treturn(b);\n}\n// puts(\"Yes\\n\") puts(\"No\\n\")\n// scanf(\"%d.%d\") 浮動小数点入力を整数２つで得る\n\n\n//#define pai  3.1415926535 \n//#define  _USE_MATH_DEFINES でM_PIが使える\n\n#define deg_rad(X)  (X*(M_PI/180))\n\n\nint _swp(int* a, int* b)\n{\n\tint tmp;\n\ttmp = *b; *b = *a; *a = tmp;\n\treturn 0;\n}\n#define _abs(x) ((x)>0?(x):-(x))\n#define _min(x,y) ((x)<(y)?(x):(y))\n#define _max(x,y) ((x)<(y)?(y):(x))\n\nint _cknum(char* a, int n) {\n\tint i;\n\tchar t = '0';\n\n\tfor (i = 0; i < n; i++) {\n\t\tif (a[i] < '0' || a[i]>'9') return 1;\n\t}\n\treturn 0;\n}\n\n\nint _atoi(char* s, int len) {\n\tchar tmp[20];\n\tmemcpy(tmp, s, len);\n\ttmp[len] = 0x00;\n\treturn (atoi(tmp));\n}\n\n//素因数分解　pf素数が入る　pc 素数の数\nll _pfact(ll a);\nstatic ll pf[100000000];\nstatic ll pc;\n\nll _pfact(ll a) {\n\tlong i, r;\n\tif (a % 2 == 0) {\n\t\tpf[pc] = 2; pc++;\n\t\treturn(_pfact(a / 2));\n\t}\n\tr = sqrt(a);\n\tfor (i = 3; i <= r; i += 2) {\n\t\tif (a % i == 0) {\n\t\t\tpf[pc] = i; pc++;\n\t\t\treturn(_pfact(a / i));\n\t\t}\n\t}\n\tif (a != 1) {\n\t\tpf[pc] = a; pc++;\n\t}\n\treturn 0;\n\n}\n\n\n#pragma endregion\n\n//ABC 163 -B\nstatic int f[101];\nint main(void) {\n\tint i, x, n, p[101];\n\n\tscanf(\"%d %d\", &x, &n);\n\tfor (i = 0; i < n; i++) {\n\t\tscanf(\"%d\", &p[i]);\n\t\tf[p[i]] = 1;\n\t}\n\n\tint min = 1000,ans,t;\n\n\tfor (i = 0; i <= 100; i++) {\n\t\tif (f[i])continue;\n\t\tt=abs(x - i);\n\t\tif (t < min) {\n\t\t\tmin = t; ans = i;\n\t\t}\n\t}\n\t(min == 1000) ? printf(\"101\"):printf(\"%d\\n\",ans);\n\treturn 0;\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": 2468, "cpu_time_ms": 5, "memory_kb": 2092}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s889102939", "group_id": "codeNet:p02641", "input_text": "#include <stdio.h>\n#include <stdlib.h>\n#include <string.h>\n#include <math.h>\nint acs(const void *a, const void *b) { \n  return *(int*)a - *(int*)b;\n} /* 1,2,3,4.. */\nint des(const void *a, const void *b) {\n  return *(int*)b - *(int*)a;\n} /* 8,7,6,5.. */\nint cmp_char(const void *a, const void *b) { \n  return *(char*)a - *(char*)b;\n} /* a,b,c,d.. */\nint cmp_str(const void *a, const void *b) {\n  return strcmp(*(const char **)a, *(const char **)b);\n} /* aaa,aab.. */\n#define min(a,b) (a < b ? a : b)\n#define max(a,b) (a > b ? a : b)\n#define rep(i, l, r) for (int i = l; i < r; i++)\n#define MAX 100001\n#define MOD 1000000007\n#define INF 1000000009\ntypedef long long int lli;\n\nint main(void) {\n  int x, n, t;\n  int p[102] = {0};\n  scanf(\"%d %d\", &x, &n);\n  rep(i, 0, n) {\n    scanf(\"%d\", &t);\n    p[t] = 1;\n  }\n\n  int min = INF, ans = INF;\n  rep(i, 0, 102) {\n    if (p[i]) continue;\n    if (abs(i - x) > min) continue;\n    if (abs(i - x) < min) ans = i;\n    else ans = min(i, ans);\n    min = abs(i - x);\n  }\n  printf(\"%d\\n\", ans);\n  return 0;\n}\n", "language": "C", "metadata": {"date": 1592284057, "filename_ext": "c", "original_language": "C (GCC 9.2.1)", "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/C/s889102939.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s889102939", "user_id": "u391667116"}, "prompt_components": {"gold_output": "8\n", "input_to_evaluate": "#include <stdio.h>\n#include <stdlib.h>\n#include <string.h>\n#include <math.h>\nint acs(const void *a, const void *b) { \n  return *(int*)a - *(int*)b;\n} /* 1,2,3,4.. */\nint des(const void *a, const void *b) {\n  return *(int*)b - *(int*)a;\n} /* 8,7,6,5.. */\nint cmp_char(const void *a, const void *b) { \n  return *(char*)a - *(char*)b;\n} /* a,b,c,d.. */\nint cmp_str(const void *a, const void *b) {\n  return strcmp(*(const char **)a, *(const char **)b);\n} /* aaa,aab.. */\n#define min(a,b) (a < b ? a : b)\n#define max(a,b) (a > b ? a : b)\n#define rep(i, l, r) for (int i = l; i < r; i++)\n#define MAX 100001\n#define MOD 1000000007\n#define INF 1000000009\ntypedef long long int lli;\n\nint main(void) {\n  int x, n, t;\n  int p[102] = {0};\n  scanf(\"%d %d\", &x, &n);\n  rep(i, 0, n) {\n    scanf(\"%d\", &t);\n    p[t] = 1;\n  }\n\n  int min = INF, ans = INF;\n  rep(i, 0, 102) {\n    if (p[i]) continue;\n    if (abs(i - x) > min) continue;\n    if (abs(i - x) < min) ans = i;\n    else ans = min(i, ans);\n    min = abs(i - x);\n  }\n  printf(\"%d\\n\", ans);\n  return 0;\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": 1043, "cpu_time_ms": 5, "memory_kb": 1736}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s131296189", "group_id": "codeNet:p02646", "input_text": "#include<stdio.h>\n#include<stdbool.h>\n\nint main(void){\n\n\tint a, b, v, w, t;\n\tbool f = false;\n\n\tscanf(\"%d %d\", &a, &v);\n\tscanf(\"%d %d\", &b, &w);\n\n\tfor(int i = 0; i < t; i++){\n\t\tif(a-b <= v*i - w*i){\n\t\t\tf = true;\n\t\t\tbreak;\n\t\t}\n\t}\n\n\tif(f){\n\t\tprintf(\"YES\");\n\t}\n\n\telse{\n\t\tprintf(\"NO\");\n\t}\n\n\treturn 0;\n}", "language": "C", "metadata": {"date": 1592100732, "filename_ext": "c", "original_language": "C (GCC 9.2.1)", "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/C/s131296189.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s131296189", "user_id": "u133385308"}, "prompt_components": {"gold_output": "YES\n", "input_to_evaluate": "#include<stdio.h>\n#include<stdbool.h>\n\nint main(void){\n\n\tint a, b, v, w, t;\n\tbool f = false;\n\n\tscanf(\"%d %d\", &a, &v);\n\tscanf(\"%d %d\", &b, &w);\n\n\tfor(int i = 0; i < t; i++){\n\t\tif(a-b <= v*i - w*i){\n\t\t\tf = true;\n\t\t\tbreak;\n\t\t}\n\t}\n\n\tif(f){\n\t\tprintf(\"YES\");\n\t}\n\n\telse{\n\t\tprintf(\"NO\");\n\t}\n\n\treturn 0;\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": 297, "cpu_time_ms": 2, "memory_kb": 1732}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s533582962", "group_id": "codeNet:p02646", "input_text": "#include <stdio.h>\n#include <stdlib.h>\n\nint main(void) {\n\tlong int a,v,b,w,t;\n\tscanf(\"%ld%ld\",&a,&v);\n\tscanf(\"%ld%ld\",&b,&w);\n\tscanf(\"%ld\",&t);\n\tif(b-a > 0){\n\t\tif(((b+w*t) - (a+v*t))<= 0){\n\t\t\tprintf(\"YES\");\n\t\t}else{\n\t\t\tprintf(\"NO\");\n\t\t}\n\t}\n\telse if(a-b > 0){\n\t\tif((b-w*t) - (a-v*t) >= 0){\n\t\t\tprintf(\"YES\");\n\t\t}\n\t\telse{\n\t\t\tprintf(\"NO\");\n\t\t\t}\n\t}\n\treturn 0;\n}", "language": "C", "metadata": {"date": 1592100337, "filename_ext": "c", "original_language": "C (GCC 9.2.1)", "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/C/s533582962.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s533582962", "user_id": "u382425831"}, "prompt_components": {"gold_output": "YES\n", "input_to_evaluate": "#include <stdio.h>\n#include <stdlib.h>\n\nint main(void) {\n\tlong int a,v,b,w,t;\n\tscanf(\"%ld%ld\",&a,&v);\n\tscanf(\"%ld%ld\",&b,&w);\n\tscanf(\"%ld\",&t);\n\tif(b-a > 0){\n\t\tif(((b+w*t) - (a+v*t))<= 0){\n\t\t\tprintf(\"YES\");\n\t\t}else{\n\t\t\tprintf(\"NO\");\n\t\t}\n\t}\n\telse if(a-b > 0){\n\t\tif((b-w*t) - (a-v*t) >= 0){\n\t\t\tprintf(\"YES\");\n\t\t}\n\t\telse{\n\t\t\tprintf(\"NO\");\n\t\t\t}\n\t}\n\treturn 0;\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": 356, "cpu_time_ms": 3, "memory_kb": 1708}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s950229168", "group_id": "codeNet:p02646", "input_text": "#include<stdio.h>\nint main()\n{\n  long A,B,V,W,T;\n  scanf(\"%ld %ld %ld %ld %ld\",&A,&V,&B,&W,&T);\n  if((V*T)>=(W*T+(B-A)))\n     printf(\"YES\");\n  else\n     printf(\"NO\");\n   return 0;\n     }", "language": "C", "metadata": {"date": 1592100121, "filename_ext": "c", "original_language": "C (GCC 9.2.1)", "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/C/s950229168.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s950229168", "user_id": "u425479464"}, "prompt_components": {"gold_output": "YES\n", "input_to_evaluate": "#include<stdio.h>\nint main()\n{\n  long A,B,V,W,T;\n  scanf(\"%ld %ld %ld %ld %ld\",&A,&V,&B,&W,&T);\n  if((V*T)>=(W*T+(B-A)))\n     printf(\"YES\");\n  else\n     printf(\"NO\");\n   return 0;\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": 186, "cpu_time_ms": 2, "memory_kb": 1732}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s065222819", "group_id": "codeNet:p02646", "input_text": "#include <stdio.h>\n\nint main(void)\n{\n  int A = 0;\n  int B = 0;\n  int V = 0;\n  int W = 0;\n  int T = 0;\n\n  scanf(\"%d %d\", &A, &V);\n  scanf(\"%d %d\", &B, &W);\n  scanf(\"%d\", &T);\n  \n  if ( (A + V * T) >= (B + V * T) ) {\n    printf(\"YES\");\n  }\n  else {\n    printf(\"NO\");\n  }\n  return 0;\n}", "language": "C", "metadata": {"date": 1592098962, "filename_ext": "c", "original_language": "C (GCC 9.2.1)", "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/C/s065222819.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s065222819", "user_id": "u915452375"}, "prompt_components": {"gold_output": "YES\n", "input_to_evaluate": "#include <stdio.h>\n\nint main(void)\n{\n  int A = 0;\n  int B = 0;\n  int V = 0;\n  int W = 0;\n  int T = 0;\n\n  scanf(\"%d %d\", &A, &V);\n  scanf(\"%d %d\", &B, &W);\n  scanf(\"%d\", &T);\n  \n  if ( (A + V * T) >= (B + V * T) ) {\n    printf(\"YES\");\n  }\n  else {\n    printf(\"NO\");\n  }\n  return 0;\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": 282, "cpu_time_ms": 1, "memory_kb": 1732}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s125898595", "group_id": "codeNet:p02647", "input_text": "#include<stdio.h>\n#include<stdlib.h>\n#include<math.h>\n\nint main() {\n\tint n, k,*a,*b;\n\tscanf(\"%d%d\", &n, &k);\n\ta = (int*)malloc(n * sizeof(int));\n\tb = (int*)malloc(n * sizeof(int));\n\tfor (int i = 0; i < n; i++) {\n\t\tscanf(\"%d\", &a[i]);\n\t}\n\tfor (int i = 0; i < k; i++) {\n\t\tint flag = 1;\n\t\tfor (int j = 0; j < n; j++) {\n\t\t\tint l = fmaxf(0, j - a[j]);\n\t\t\tint r = fminf(n - 1, j + a[j]);\n\t\t\tb[j]++;\n\t\t\tif (r + 1 < n) b[r + 1]--;\n\t\t}\n\t\tfor (int j = 0; j < n - 1; j++) b[j + 1] += b[j];\n\t\tfor (int j = 0; j < n; j++) {\n\t\t\ta[j] = b[j];\n\t\t\tif (a[j] != n) flag = 0;\n\t\t}\n\t\tif (flag==1) break;\n\t}\n\tfor (int i = 0; i < k; i++) scanf(\"%d\", a[i]);\n\n\treturn 0;\n}", "language": "C", "metadata": {"date": 1592155994, "filename_ext": "c", "original_language": "C (Clang 10.0.0)", "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/C/s125898595.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s125898595", "user_id": "u189521276"}, "prompt_components": {"gold_output": "1 2 2 1 2\n", "input_to_evaluate": "#include<stdio.h>\n#include<stdlib.h>\n#include<math.h>\n\nint main() {\n\tint n, k,*a,*b;\n\tscanf(\"%d%d\", &n, &k);\n\ta = (int*)malloc(n * sizeof(int));\n\tb = (int*)malloc(n * sizeof(int));\n\tfor (int i = 0; i < n; i++) {\n\t\tscanf(\"%d\", &a[i]);\n\t}\n\tfor (int i = 0; i < k; i++) {\n\t\tint flag = 1;\n\t\tfor (int j = 0; j < n; j++) {\n\t\t\tint l = fmaxf(0, j - a[j]);\n\t\t\tint r = fminf(n - 1, j + a[j]);\n\t\t\tb[j]++;\n\t\t\tif (r + 1 < n) b[r + 1]--;\n\t\t}\n\t\tfor (int j = 0; j < n - 1; j++) b[j + 1] += b[j];\n\t\tfor (int j = 0; j < n; j++) {\n\t\t\ta[j] = b[j];\n\t\t\tif (a[j] != n) flag = 0;\n\t\t}\n\t\tif (flag==1) break;\n\t}\n\tfor (int i = 0; i < k; i++) scanf(\"%d\", a[i]);\n\n\treturn 0;\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": 645, "cpu_time_ms": 125, "memory_kb": 3592}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s964627675", "group_id": "codeNet:p02657", "input_text": "#include <stdio.h>\n\n#define LENGTH 256\n\nint main() {\n  char input[LENGTH];\n  int a, b, ans;\n  fgets(input, LENGTH, stdin);\n  sscanf(input, \"%d %d\", &a, &b);\n  ans = a * b;\n  printf(\"%d \\n\", ans);\n}\n", "language": "C", "metadata": {"date": 1594486568, "filename_ext": "c", "original_language": "C (GCC 9.2.1)", "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/C/s964627675.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s964627675", "user_id": "u714036972"}, "prompt_components": {"gold_output": "10\n", "input_to_evaluate": "#include <stdio.h>\n\n#define LENGTH 256\n\nint main() {\n  char input[LENGTH];\n  int a, b, ans;\n  fgets(input, LENGTH, stdin);\n  sscanf(input, \"%d %d\", &a, &b);\n  ans = a * b;\n  printf(\"%d \\n\", ans);\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": 198, "cpu_time_ms": 5, "memory_kb": 1756}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s003439634", "group_id": "codeNet:p02657", "input_text": "#include<stdio.h>\n \nint main(void){\nint A, B, ans;\nans = A*B;\nprintf(\"%d\\n\", ans);\nreturn 0;\n}", "language": "C", "metadata": {"date": 1590975899, "filename_ext": "c", "original_language": "C (GCC 9.2.1)", "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/C/s003439634.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s003439634", "user_id": "u254205686"}, "prompt_components": {"gold_output": "10\n", "input_to_evaluate": "#include<stdio.h>\n \nint main(void){\nint A, B, ans;\nans = A*B;\nprintf(\"%d\\n\", ans);\nreturn 0;\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": 94, "cpu_time_ms": 3, "memory_kb": 1596}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s360891354", "group_id": "codeNet:p02660", "input_text": "#include <stdio.h>\n#include <math.h>\n\nint main(){\n    int i, j, k;\n    long N;\n    scanf(\"%ld\", &N);\n    long p[100000];\n    i = 0;\n    p[0] = 2;\n    for (j = 3; j <= N;j++){\n        for (k = 0; k <= i;k++){\n            if(j%p[k]==0){\n                break;\n            }else if(k==i){\n                p[++i] = j;\n            }\n        }\n    }\n    p[i+2] = 0;\n    i = 0;\n    int cnt_p = 0;\n    while(p[i]){\n        cnt_p++;\n        i++;\n    }\n    int fac[cnt_p];\n    for (i = 0; i < cnt_p;i++){\n        fac[i] = 0;\n    }\n        i = 0;\n    while(p[i]){\n        if(N%p[i]==0){\n            N = N / p[i];\n            fac[i]++;\n        }else{\n            i++;\n        }\n    }\n    int cnt = 0;\n    for (i = 0; i < cnt_p;i++){\n        for (j = 0; fac[i] - j > 0;j++){\n            cnt++;\n        }\n    }\n    printf(\"%d\", cnt-1);\n    return 0;\n}", "language": "C", "metadata": {"date": 1590979118, "filename_ext": "c", "original_language": "C (GCC 9.2.1)", "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/C/s360891354.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s360891354", "user_id": "u897135531"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "#include <stdio.h>\n#include <math.h>\n\nint main(){\n    int i, j, k;\n    long N;\n    scanf(\"%ld\", &N);\n    long p[100000];\n    i = 0;\n    p[0] = 2;\n    for (j = 3; j <= N;j++){\n        for (k = 0; k <= i;k++){\n            if(j%p[k]==0){\n                break;\n            }else if(k==i){\n                p[++i] = j;\n            }\n        }\n    }\n    p[i+2] = 0;\n    i = 0;\n    int cnt_p = 0;\n    while(p[i]){\n        cnt_p++;\n        i++;\n    }\n    int fac[cnt_p];\n    for (i = 0; i < cnt_p;i++){\n        fac[i] = 0;\n    }\n        i = 0;\n    while(p[i]){\n        if(N%p[i]==0){\n            N = N / p[i];\n            fac[i]++;\n        }else{\n            i++;\n        }\n    }\n    int cnt = 0;\n    for (i = 0; i < cnt_p;i++){\n        for (j = 0; fac[i] - j > 0;j++){\n            cnt++;\n        }\n    }\n    printf(\"%d\", cnt-1);\n    return 0;\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": 837, "cpu_time_ms": 2205, "memory_kb": 1724}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s211494245", "group_id": "codeNet:p02664", "input_text": "#include<stdio.h>\n#include<string.h>\n\nint main()\n{\n  char t[100000000];\n  int len=0;\n  \n  scanf(\"%s\",t);\n  len=strlen(t);\n  \n  for(int i=0;i<len;i++)\n  {\n    if(t[i]=='?' && t[i-1]=='P'){\n      t[i]='D';\n    }else if(t[i]=='?' && t[i-1]=='D'){\n      t[i]='P';\n    };\n  };\n  printf(\"%s\",t);\n  \n  return 0;\n};\n      \n\n", "language": "C", "metadata": {"date": 1590888204, "filename_ext": "c", "original_language": "C (Clang 10.0.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/C/s211494245.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s211494245", "user_id": "u303274040"}, "prompt_components": {"gold_output": "PDPDPDP\n", "input_to_evaluate": "#include<stdio.h>\n#include<string.h>\n\nint main()\n{\n  char t[100000000];\n  int len=0;\n  \n  scanf(\"%s\",t);\n  len=strlen(t);\n  \n  for(int i=0;i<len;i++)\n  {\n    if(t[i]=='?' && t[i-1]=='P'){\n      t[i]='D';\n    }else if(t[i]=='?' && t[i-1]=='D'){\n      t[i]='P';\n    };\n  };\n  printf(\"%s\",t);\n  \n  return 0;\n};\n      \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": 316, "cpu_time_ms": 7, "memory_kb": 2352}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s144686657", "group_id": "codeNet:p02675", "input_text": "#include<stdio.h>\n \nint main(void){\n   int p;\n   scanf(\"%d\",&p);\n   if(p%10==2||p%10==4||p%10==5||p%10==7||p%10==9){\n      printf(\"hon\");\n   }else if(p%10==0||p%10==1||p%10==6||p%10==8){\n      printf(\"pon\");\n   }else if(p%10==3){\n      printf(\"bon\");\n   }\n \n   return 0;\n}", "language": "C", "metadata": {"date": 1595135162, "filename_ext": "c", "original_language": "C (GCC 9.2.1)", "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/C/s144686657.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s144686657", "user_id": "u874637321"}, "prompt_components": {"gold_output": "pon\n", "input_to_evaluate": "#include<stdio.h>\n \nint main(void){\n   int p;\n   scanf(\"%d\",&p);\n   if(p%10==2||p%10==4||p%10==5||p%10==7||p%10==9){\n      printf(\"hon\");\n   }else if(p%10==0||p%10==1||p%10==6||p%10==8){\n      printf(\"pon\");\n   }else if(p%10==3){\n      printf(\"bon\");\n   }\n \n   return 0;\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": 272, "cpu_time_ms": 4, "memory_kb": 1732}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s020013984", "group_id": "codeNet:p02675", "input_text": "#include <stdio.h>\n\nint main(){\n  int n,i;\n\n  scanf(\"%d\",&n);\n  i = n % 10;\n  //printf(\"%d\",i);\n\n  if(i == 3)\n    printf(\"bon\\n\");\n  else if(i == 0 || i == 1 || i == 6 || i == 8)\n    printf(\"pon\\n\");\n  else\n    printf(\"hon\\n\");\n\n  return 0;\n}", "language": "C", "metadata": {"date": 1590120792, "filename_ext": "c", "original_language": "C (GCC 9.2.1)", "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/C/s020013984.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s020013984", "user_id": "u873151599"}, "prompt_components": {"gold_output": "pon\n", "input_to_evaluate": "#include <stdio.h>\n\nint main(){\n  int n,i;\n\n  scanf(\"%d\",&n);\n  i = n % 10;\n  //printf(\"%d\",i);\n\n  if(i == 3)\n    printf(\"bon\\n\");\n  else if(i == 0 || i == 1 || i == 6 || i == 8)\n    printf(\"pon\\n\");\n  else\n    printf(\"hon\\n\");\n\n  return 0;\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": 242, "cpu_time_ms": 5, "memory_kb": 1608}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s931000670", "group_id": "codeNet:p02675", "input_text": "/*ex3_2\n    takafumi_ueki*/\n#include <stdio.h>\nint main(void){\n    int A;\n    scanf(\"%d\",&A);\n    //Aを１０割った余り、つまり１の位が何かによって条件分岐\n    //”||”は、またはという意味\n        if((A%10 == 2)||(A%10 == 4)||(A%10 == 5)||(A%10 == 7)||(A%10 == 9)){\n        printf(\"hon\\n\");\n    }\n    if((A%10 == 0)||(A%10 == 1)||(A%10 == 6)||(A%10 == 8)){\n        printf(\"pon\\n\");\n    }\n    if(A%10 == 3){\n        printf(\"bon\\n\");\n    }\n    return 0;\n}\n", "language": "C", "metadata": {"date": 1590032544, "filename_ext": "c", "original_language": "C (GCC 9.2.1)", "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/C/s931000670.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s931000670", "user_id": "u375472957"}, "prompt_components": {"gold_output": "pon\n", "input_to_evaluate": "/*ex3_2\n    takafumi_ueki*/\n#include <stdio.h>\nint main(void){\n    int A;\n    scanf(\"%d\",&A);\n    //Aを１０割った余り、つまり１の位が何かによって条件分岐\n    //”||”は、またはという意味\n        if((A%10 == 2)||(A%10 == 4)||(A%10 == 5)||(A%10 == 7)||(A%10 == 9)){\n        printf(\"hon\\n\");\n    }\n    if((A%10 == 0)||(A%10 == 1)||(A%10 == 6)||(A%10 == 8)){\n        printf(\"pon\\n\");\n    }\n    if(A%10 == 3){\n        printf(\"bon\\n\");\n    }\n    return 0;\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": 490, "cpu_time_ms": 1, "memory_kb": 1660}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s576692527", "group_id": "codeNet:p02675", "input_text": "#include<stdio.h>\nint main(void){\n  int N;\n  scanf(\"%d\",&N);\n  int units = N % 10;\n\n  switch (units) {\n    case 2:\n    case 4:\n    case 5:\n    case 7:\n    case 9:\n            puts(\"hon\");\n            break;\n    case 3:\n            puts(\"bon\");\n            break;\n    default:\n            puts(\"pon\");\n            break;\n  }\n  return 0;\n}\n", "language": "C", "metadata": {"date": 1589771696, "filename_ext": "c", "original_language": "C (GCC 9.2.1)", "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/C/s576692527.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s576692527", "user_id": "u228943017"}, "prompt_components": {"gold_output": "pon\n", "input_to_evaluate": "#include<stdio.h>\nint main(void){\n  int N;\n  scanf(\"%d\",&N);\n  int units = N % 10;\n\n  switch (units) {\n    case 2:\n    case 4:\n    case 5:\n    case 7:\n    case 9:\n            puts(\"hon\");\n            break;\n    case 3:\n            puts(\"bon\");\n            break;\n    default:\n            puts(\"pon\");\n            break;\n  }\n  return 0;\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": 338, "cpu_time_ms": 1, "memory_kb": 1616}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s942846209", "group_id": "codeNet:p02675", "input_text": "#include<stdio.h>\n\nint main(){\n  int n;\n  scanf(\"%d\",&n);\n  n%=10;\n  if(n==2||n==4||n==5||n==7||n==9){printf(\"hon\");return 0;}\n  if(n==0||n==1||n==6||n==8){printf(\"pon\");return 0;}\n  if(n==3){printf(\"bon\");return 0;}\n}\n", "language": "C", "metadata": {"date": 1589764082, "filename_ext": "c", "original_language": "C (GCC 9.2.1)", "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/C/s942846209.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s942846209", "user_id": "u280068213"}, "prompt_components": {"gold_output": "pon\n", "input_to_evaluate": "#include<stdio.h>\n\nint main(){\n  int n;\n  scanf(\"%d\",&n);\n  n%=10;\n  if(n==2||n==4||n==5||n==7||n==9){printf(\"hon\");return 0;}\n  if(n==0||n==1||n==6||n==8){printf(\"pon\");return 0;}\n  if(n==3){printf(\"bon\");return 0;}\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": 219, "cpu_time_ms": 1, "memory_kb": 1736}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s500765123", "group_id": "codeNet:p02676", "input_text": "#include<stdio.h>\n#include<stdlib.h>\n#include<string.h>\n#include<math.h>\ntypedef long long ll;\n\nint main()\n{\n\n    int k;\n    scanf(\"%d\",&k);\n    char s[200];\n    scanf(\"%s\",s);\n\n    if(strlen(s)<=k)\n    {\n        printf(\"%s\\n\",s);\n    }\n    else\n    {\n        char ans[200];\n\n        strncpy(ans,s,k);\n        ans[k]=('.');\n        ans[k+1]=('.');\n        ans[k+2]=('.');\n        \n\n        printf(\"%s\\n\",ans);\n    }\n    \n\n\n    return 0;\n}", "language": "C", "metadata": {"date": 1589768363, "filename_ext": "c", "original_language": "C (GCC 9.2.1)", "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/C/s500765123.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s500765123", "user_id": "u727569092"}, "prompt_components": {"gold_output": "nikoand...\n", "input_to_evaluate": "#include<stdio.h>\n#include<stdlib.h>\n#include<string.h>\n#include<math.h>\ntypedef long long ll;\n\nint main()\n{\n\n    int k;\n    scanf(\"%d\",&k);\n    char s[200];\n    scanf(\"%s\",s);\n\n    if(strlen(s)<=k)\n    {\n        printf(\"%s\\n\",s);\n    }\n    else\n    {\n        char ans[200];\n\n        strncpy(ans,s,k);\n        ans[k]=('.');\n        ans[k+1]=('.');\n        ans[k+2]=('.');\n        \n\n        printf(\"%s\\n\",ans);\n    }\n    \n\n\n    return 0;\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": 438, "cpu_time_ms": 6, "memory_kb": 1664}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s071256301", "group_id": "codeNet:p02676", "input_text": "#include<stdio.h>\n#include<string.h>\nint main()\n{\n  int K; char S[110];\n  scanf(\"%d\\n\",&K);\n  for(int i=0;i<110;i++){\n    scanf(\"%c\",&S[i]);\n  }\n  if(strlen(S)<=K){\n    printf(\"%s\",S);\n  }else{\n    for(int i=0;i<K;i++){\n      printf(\"%c\",S[i]);\n    }\n    printf(\"...\");\n  }\n}", "language": "C", "metadata": {"date": 1589764670, "filename_ext": "c", "original_language": "C (GCC 9.2.1)", "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/C/s071256301.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s071256301", "user_id": "u041213561"}, "prompt_components": {"gold_output": "nikoand...\n", "input_to_evaluate": "#include<stdio.h>\n#include<string.h>\nint main()\n{\n  int K; char S[110];\n  scanf(\"%d\\n\",&K);\n  for(int i=0;i<110;i++){\n    scanf(\"%c\",&S[i]);\n  }\n  if(strlen(S)<=K){\n    printf(\"%s\",S);\n  }else{\n    for(int i=0;i<K;i++){\n      printf(\"%c\",S[i]);\n    }\n    printf(\"...\");\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": 275, "cpu_time_ms": 1, "memory_kb": 1728}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s742190725", "group_id": "codeNet:p02676", "input_text": "#include <stdio.h>\n#include <string.h>\nint main(){\n  int K,i,l;\n  scanf(\"%d\",&K);\n  char S[101];\n  scanf(\"%s\",S);\n  for(i=0;i<101;i++){\n    if(S[i]=='\\0'){\n      l=i;\n      break;\n    }\n  }\n  if(K>=l) printf(\"%s\",S);\n  else{\n    for(i=0;i<K;i++) printf(\"%c\",S[i]);\n    printf(\"...\");\n  }\n  return 0;\n}", "language": "C", "metadata": {"date": 1589764639, "filename_ext": "c", "original_language": "C (GCC 9.2.1)", "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/C/s742190725.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s742190725", "user_id": "u395734151"}, "prompt_components": {"gold_output": "nikoand...\n", "input_to_evaluate": "#include <stdio.h>\n#include <string.h>\nint main(){\n  int K,i,l;\n  scanf(\"%d\",&K);\n  char S[101];\n  scanf(\"%s\",S);\n  for(i=0;i<101;i++){\n    if(S[i]=='\\0'){\n      l=i;\n      break;\n    }\n  }\n  if(K>=l) printf(\"%s\",S);\n  else{\n    for(i=0;i<K;i++) printf(\"%c\",S[i]);\n    printf(\"...\");\n  }\n  return 0;\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": 301, "cpu_time_ms": 1, "memory_kb": 1728}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s134378065", "group_id": "codeNet:p02677", "input_text": "#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\n#include <string.h>\n\n\n\nvoid swap (int *x, int *y) {\n  int temp;\n\n  temp = *x;\n  *x = *y;\n  *y = temp;\n\n  return;\n}\n\n\nint gcd(int a, int b){\n  int c;\n\n  while (b > 0){\n    c = a % b;\n    a = b;\n    b = c;\n  }\n\n  return a;\n}\n\n/* クイックソート */\nint dn(const void*a,const void*b){return*(int*)b-*(int*)a;}\n\n\nlong int modpow(long int a,long int n,long int mod){\n  long int ans=1;\n  while(n>0){\n    if(n & 1){\n      ans=ans*a%mod;\n    }\n    a=a*a%mod;\n    n/=2;\n  }\n  return ans;\n}\n\nlong int modinv(long int a,long int mod){\n  return modpow(a,mod-2,mod);\n}\n\nint max(int a,int b){\n  if(a<b){\n    return b;\n  }\n  else{\n    return a;\n  }\n}\n\nint min(int a,int b){\n  if(a<b){\n    return a;\n  }\n  else{\n    return b;\n  }\n}\n\nvoid chmax(int *a,int b){\n  if(*a < b){\n    *a = b;\n  }\n\n  return;\n}\n\nvoid chmin(int *a,int b){\n  if(*a > b){\n    *a =b;\n  }\n\n  return;\n}\n\n/****************************************\\\n| Thank you for viewing my code:)        |\n| Written by RedSpica a.k.a. RanseMirage |\n| Twitter:@asakaakasaka                  | \n\\****************************************/\n\nint main(void){\n  double a,b,h,m;\n  scanf(\"%lf%lf%lf%lf\",&a,&b,&h,&m);\n\n  double pi=3.14159265358979;\n  /*\n\n  時計の中心と文字盤の0を結んだ線を基準線と呼ぶことにします．\n\n  時計の中心と文字盤のh(0<=h<12)を結んだ線と基準線が作る角の大きさx(0<=x<180)は\n  度数法で(30*h)と表すことができます．\n  \n  また，m分(0<=m<60)の時の長針と基準線が作る角の大きさy(0<=y<180)は\n  度数法で(6*m)と表すことができます．\n\n  これらをまとめてh時m分の時の長針と短針が作る角の大きさは\n  abs(30*h-6*m)と表すことができそうです(これが180を超える場合は360から引いてやればいいです)\n\n  が，短針は時間が変わったら30度一気に動くわけではなく，60分かけて30度を動いていくので，それも考慮しなければなりません．\n\n  つまり，30*(m/60)=m/2をxに足してやる必要があります．\n\n  改めて，h時m分の時の長針と短針が作る角の大きさzは\n  abs(30*h+m/2-6*m)と表すことができます．\n\n  ここで余弦定理を用いて求める長さが欲しいわけですが，注意しなければいけないのは\n  sin(z)の引数(渡してあげるzのこと)は度数法ではなく弧度法でないといけません．\n\n  pi==180\\degreeであるのでpi:180==?:zの式を?について解くと\n  ?=z*pi/180であることがわかります．\n\n  以上のことより，答えは\n\n  a*a+b*b-2*a*b*cos(z*pi/180)\n\n  となります．\n  \n  */\n  \n  //0<=h<12にする\n  if(h>=12){\n    h-=12;\n  }\n\n  //hは基準線とそれが作る角度\n  h=30*h+m/2;\n\n  //mは基準線とそれが作る角度\n  m*=6;\n  \n  \n  double z=h-m;\n  \n  //この部分，なんでこんな実装をしているかというと，\n  //abs(h-m)を渡してやったら誤差で消えるケースがあったので\n  //こういう実装をしました．\n  if(z<0){\n    z*=-1;\n  }\n  \n  \n  if(z>180){\n    z=360-z;\n  }\n\n\n  z=z*pi/180;\n  \n  double ans=a*a+b*b-2*a*b*cos(z);\n\n  printf(\"%.16lf\\n\",sqrt(ans));\n\n  return 0;\n}", "language": "C", "metadata": {"date": 1599373817, "filename_ext": "c", "original_language": "C (GCC 9.2.1)", "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/C/s134378065.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s134378065", "user_id": "u835924161"}, "prompt_components": {"gold_output": "5.00000000000000000000\n", "input_to_evaluate": "#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\n#include <string.h>\n\n\n\nvoid swap (int *x, int *y) {\n  int temp;\n\n  temp = *x;\n  *x = *y;\n  *y = temp;\n\n  return;\n}\n\n\nint gcd(int a, int b){\n  int c;\n\n  while (b > 0){\n    c = a % b;\n    a = b;\n    b = c;\n  }\n\n  return a;\n}\n\n/* クイックソート */\nint dn(const void*a,const void*b){return*(int*)b-*(int*)a;}\n\n\nlong int modpow(long int a,long int n,long int mod){\n  long int ans=1;\n  while(n>0){\n    if(n & 1){\n      ans=ans*a%mod;\n    }\n    a=a*a%mod;\n    n/=2;\n  }\n  return ans;\n}\n\nlong int modinv(long int a,long int mod){\n  return modpow(a,mod-2,mod);\n}\n\nint max(int a,int b){\n  if(a<b){\n    return b;\n  }\n  else{\n    return a;\n  }\n}\n\nint min(int a,int b){\n  if(a<b){\n    return a;\n  }\n  else{\n    return b;\n  }\n}\n\nvoid chmax(int *a,int b){\n  if(*a < b){\n    *a = b;\n  }\n\n  return;\n}\n\nvoid chmin(int *a,int b){\n  if(*a > b){\n    *a =b;\n  }\n\n  return;\n}\n\n/****************************************\\\n| Thank you for viewing my code:)        |\n| Written by RedSpica a.k.a. RanseMirage |\n| Twitter:@asakaakasaka                  | \n\\****************************************/\n\nint main(void){\n  double a,b,h,m;\n  scanf(\"%lf%lf%lf%lf\",&a,&b,&h,&m);\n\n  double pi=3.14159265358979;\n  /*\n\n  時計の中心と文字盤の0を結んだ線を基準線と呼ぶことにします．\n\n  時計の中心と文字盤のh(0<=h<12)を結んだ線と基準線が作る角の大きさx(0<=x<180)は\n  度数法で(30*h)と表すことができます．\n  \n  また，m分(0<=m<60)の時の長針と基準線が作る角の大きさy(0<=y<180)は\n  度数法で(6*m)と表すことができます．\n\n  これらをまとめてh時m分の時の長針と短針が作る角の大きさは\n  abs(30*h-6*m)と表すことができそうです(これが180を超える場合は360から引いてやればいいです)\n\n  が，短針は時間が変わったら30度一気に動くわけではなく，60分かけて30度を動いていくので，それも考慮しなければなりません．\n\n  つまり，30*(m/60)=m/2をxに足してやる必要があります．\n\n  改めて，h時m分の時の長針と短針が作る角の大きさzは\n  abs(30*h+m/2-6*m)と表すことができます．\n\n  ここで余弦定理を用いて求める長さが欲しいわけですが，注意しなければいけないのは\n  sin(z)の引数(渡してあげるzのこと)は度数法ではなく弧度法でないといけません．\n\n  pi==180\\degreeであるのでpi:180==?:zの式を?について解くと\n  ?=z*pi/180であることがわかります．\n\n  以上のことより，答えは\n\n  a*a+b*b-2*a*b*cos(z*pi/180)\n\n  となります．\n  \n  */\n  \n  //0<=h<12にする\n  if(h>=12){\n    h-=12;\n  }\n\n  //hは基準線とそれが作る角度\n  h=30*h+m/2;\n\n  //mは基準線とそれが作る角度\n  m*=6;\n  \n  \n  double z=h-m;\n  \n  //この部分，なんでこんな実装をしているかというと，\n  //abs(h-m)を渡してやったら誤差で消えるケースがあったので\n  //こういう実装をしました．\n  if(z<0){\n    z*=-1;\n  }\n  \n  \n  if(z>180){\n    z=360-z;\n  }\n\n\n  z=z*pi/180;\n  \n  double ans=a*a+b*b-2*a*b*cos(z);\n\n  printf(\"%.16lf\\n\",sqrt(ans));\n\n  return 0;\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": 3240, "cpu_time_ms": 3, "memory_kb": 2660}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s687457468", "group_id": "codeNet:p02677", "input_text": "/* ex4_1\n   YSK722 */\n\n#include <math.h>\n#include <stdio.h>\n\nint main(void){\n    double short_hand, long_hand, hour, minute, ans;\n    scanf(\"%lf %lf %lf %lf\", &short_hand, &long_hand, &hour, &minute);\n    /* 余弦定理を用いる\n       cos(-x) = cos(x)より、回転角の大小は考えない */\n    ans = sqrt(\n              pow(short_hand, 2) + pow(long_hand, 2) \\\n              - 2 * short_hand * long_hand * cos(M_PI*(hour/6.0 - minute/30.0))\n          );\n    printf(\"%lf\", ans);\n    return 0;\n}", "language": "C", "metadata": {"date": 1590633338, "filename_ext": "c", "original_language": "C (GCC 9.2.1)", "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/C/s687457468.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s687457468", "user_id": "u802338400"}, "prompt_components": {"gold_output": "5.00000000000000000000\n", "input_to_evaluate": "/* ex4_1\n   YSK722 */\n\n#include <math.h>\n#include <stdio.h>\n\nint main(void){\n    double short_hand, long_hand, hour, minute, ans;\n    scanf(\"%lf %lf %lf %lf\", &short_hand, &long_hand, &hour, &minute);\n    /* 余弦定理を用いる\n       cos(-x) = cos(x)より、回転角の大小は考えない */\n    ans = sqrt(\n              pow(short_hand, 2) + pow(long_hand, 2) \\\n              - 2 * short_hand * long_hand * cos(M_PI*(hour/6.0 - minute/30.0))\n          );\n    printf(\"%lf\", ans);\n    return 0;\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": 505, "cpu_time_ms": 2, "memory_kb": 2608}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s245887445", "group_id": "codeNet:p02677", "input_text": "#include<stdio.h>\n#include<string.h>\n#include<stdlib.h>\n#include<math.h>\nint main(void){\n    double a,b,h,m,ans;\n    scanf(\"%lf%lf%lf%lf\",&a,&b,&h,&m);\n    ans=sqrt((b*b)+(a*a)-2*b*a*cos((h*60-11*m)*3.14159265358979/360));\n    printf(\"%lf\",ans);\n}", "language": "C", "metadata": {"date": 1589770513, "filename_ext": "c", "original_language": "C (GCC 9.2.1)", "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/C/s245887445.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s245887445", "user_id": "u270535768"}, "prompt_components": {"gold_output": "5.00000000000000000000\n", "input_to_evaluate": "#include<stdio.h>\n#include<string.h>\n#include<stdlib.h>\n#include<math.h>\nint main(void){\n    double a,b,h,m,ans;\n    scanf(\"%lf%lf%lf%lf\",&a,&b,&h,&m);\n    ans=sqrt((b*b)+(a*a)-2*b*a*cos((h*60-11*m)*3.14159265358979/360));\n    printf(\"%lf\",ans);\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": 247, "cpu_time_ms": 1, "memory_kb": 2552}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s524933763", "group_id": "codeNet:p02677", "input_text": "#include<stdio.h>\n#include<string.h>\n#include<stdlib.h>\n#include<math.h>\nint main(void){\n    long double a,b,h,m,A,B,C,ans;\n    scanf(\"%Lf%Lf%Lf%Lf\",&a,&b,&h,&m);\n    A=(30.0*h)+(m/2.0);\n    B=360.0-(6*m);\n    C=360-(A+B);\n    ans=(b*b)+(a*a)-2*b*a*cos(C);\n    ans=sqrt(ans);\n    printf(\"%Lf\",ans);\n}\n", "language": "C", "metadata": {"date": 1589769465, "filename_ext": "c", "original_language": "C (GCC 9.2.1)", "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/C/s524933763.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s524933763", "user_id": "u270535768"}, "prompt_components": {"gold_output": "5.00000000000000000000\n", "input_to_evaluate": "#include<stdio.h>\n#include<string.h>\n#include<stdlib.h>\n#include<math.h>\nint main(void){\n    long double a,b,h,m,A,B,C,ans;\n    scanf(\"%Lf%Lf%Lf%Lf\",&a,&b,&h,&m);\n    A=(30.0*h)+(m/2.0);\n    B=360.0-(6*m);\n    C=360-(A+B);\n    ans=(b*b)+(a*a)-2*b*a*cos(C);\n    ans=sqrt(ans);\n    printf(\"%Lf\",ans);\n}\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": 301, "cpu_time_ms": 4, "memory_kb": 2604}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s247290723", "group_id": "codeNet:p02677", "input_text": "#include<stdio.h>\n#include<math.h>\n\n\nint main(void){\n\n    int A,B,H,M;\n    double ACB,ans;\n    scanf(\"%d %d %d %d\", &A, &B, &H, &M);\n\n    ACB = fabsl(M_PI/360*(60*H-11*M));\n\n    if(ACB>=M_PI){\n        ACB = 2*M_PI - ACB;\n    }\n \n    ans = sqrt(A*A+B*B-2*A*B*cos(ACB));\n\n    printf(\"%f\", ans);\n\n    return 0;\n}", "language": "C", "metadata": {"date": 1589769306, "filename_ext": "c", "original_language": "C (GCC 9.2.1)", "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/C/s247290723.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s247290723", "user_id": "u947115160"}, "prompt_components": {"gold_output": "5.00000000000000000000\n", "input_to_evaluate": "#include<stdio.h>\n#include<math.h>\n\n\nint main(void){\n\n    int A,B,H,M;\n    double ACB,ans;\n    scanf(\"%d %d %d %d\", &A, &B, &H, &M);\n\n    ACB = fabsl(M_PI/360*(60*H-11*M));\n\n    if(ACB>=M_PI){\n        ACB = 2*M_PI - ACB;\n    }\n \n    ans = sqrt(A*A+B*B-2*A*B*cos(ACB));\n\n    printf(\"%f\", ans);\n\n    return 0;\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": 309, "cpu_time_ms": 5, "memory_kb": 2604}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s300727558", "group_id": "codeNet:p02677", "input_text": "#include<stdio.h>\n#include<math.h>\nint main(){\nint A,B,H,M;\ndouble Angle,result=0,Cos,re;\n  scanf(\"%d %d %d %d\",&A,&B,&H,&M);\n  Angle=0.5*(60*H - 11*M);\n  Cos=cos(Angle)*(22/7)/180;\n  result=pow(A,2) + pow(B,2) - 2*A*B*Cos;\n  re=sqrt(result);\n  printf(\"%f\",re);\n  return 0;\n}", "language": "C", "metadata": {"date": 1589768921, "filename_ext": "c", "original_language": "C (Clang 10.0.0)", "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/C/s300727558.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s300727558", "user_id": "u774615977"}, "prompt_components": {"gold_output": "5.00000000000000000000\n", "input_to_evaluate": "#include<stdio.h>\n#include<math.h>\nint main(){\nint A,B,H,M;\ndouble Angle,result=0,Cos,re;\n  scanf(\"%d %d %d %d\",&A,&B,&H,&M);\n  Angle=0.5*(60*H - 11*M);\n  Cos=cos(Angle)*(22/7)/180;\n  result=pow(A,2) + pow(B,2) - 2*A*B*Cos;\n  re=sqrt(result);\n  printf(\"%f\",re);\n  return 0;\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": 275, "cpu_time_ms": 2, "memory_kb": 2616}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s054010575", "group_id": "codeNet:p02677", "input_text": "#include <stdio.h>\n#include <math.h>\n\nint main(void)\n{\n  int a,b,h,m;\n  scanf(\"%ld %ld %ld %ld\", &a, &b, &h, &m);\n  double deg,c;\n  deg = fabs(30*h+0.5*m-6*m);\n  if(deg>180){\n    deg = 360-deg;\n  }\n  c=sqrt(a*a+b*b-2*a*b*cos(deg*3.14159265/180));\n  printf(\"%f\\n\", c);\n  return 0;\n}\n", "language": "C", "metadata": {"date": 1589766468, "filename_ext": "c", "original_language": "C (GCC 9.2.1)", "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/C/s054010575.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s054010575", "user_id": "u737545415"}, "prompt_components": {"gold_output": "5.00000000000000000000\n", "input_to_evaluate": "#include <stdio.h>\n#include <math.h>\n\nint main(void)\n{\n  int a,b,h,m;\n  scanf(\"%ld %ld %ld %ld\", &a, &b, &h, &m);\n  double deg,c;\n  deg = fabs(30*h+0.5*m-6*m);\n  if(deg>180){\n    deg = 360-deg;\n  }\n  c=sqrt(a*a+b*b-2*a*b*cos(deg*3.14159265/180));\n  printf(\"%f\\n\", c);\n  return 0;\n}\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": 282, "cpu_time_ms": 101, "memory_kb": 2540}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s509251292", "group_id": "codeNet:p02681", "input_text": "/* A - Registration */\n\n#include <stdio.h>\n#include <string.h>\n\nint main(void){\n  char S[10], T[11], s[11], i;\n  scanf(\"%s\", S);\n  scanf(\"%s\", T);\n  for(i = 0; i < strlen(S); i++){\n    s[i] = T[i];\n  }\n  // s[i] = '\\0';\n  if(strcmp(S, s) == 0){\n    printf(\"Yes\\n\");\n  }else{\n    printf(\"No\\n\");\n  }\n}\n", "language": "C", "metadata": {"date": 1589162614, "filename_ext": "c", "original_language": "C (GCC 9.2.1)", "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/C/s509251292.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s509251292", "user_id": "u588283533"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "/* A - Registration */\n\n#include <stdio.h>\n#include <string.h>\n\nint main(void){\n  char S[10], T[11], s[11], i;\n  scanf(\"%s\", S);\n  scanf(\"%s\", T);\n  for(i = 0; i < strlen(S); i++){\n    s[i] = T[i];\n  }\n  // s[i] = '\\0';\n  if(strcmp(S, s) == 0){\n    printf(\"Yes\\n\");\n  }else{\n    printf(\"No\\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": 301, "cpu_time_ms": 110, "memory_kb": 1636}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s254595511", "group_id": "codeNet:p02681", "input_text": "#include<stdio.h>\n#include<string.h>\n\nint main(){\n  char s[10], t[11];\n  int tn, sn;\n\n  scanf(\"%s\", s);\n  scanf(\"%s\", t);\n  if(strlen(s) != (strlen(t)-1)){\n    printf(\"No\\n\");\n    return 0;\n  }else if(strstr(t, s) == NULL){\n    printf(\"No\\n\");\n    return 0;\n  }else if(s[0] != t[0]){\n    printf(\"No\\n\");\n    return 0;\n  }else{\n    printf(\"Yes\\n\");\n  }\n\n  return 0;\n}\n", "language": "C", "metadata": {"date": 1589162259, "filename_ext": "c", "original_language": "C (GCC 9.2.1)", "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/C/s254595511.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s254595511", "user_id": "u690610484"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "#include<stdio.h>\n#include<string.h>\n\nint main(){\n  char s[10], t[11];\n  int tn, sn;\n\n  scanf(\"%s\", s);\n  scanf(\"%s\", t);\n  if(strlen(s) != (strlen(t)-1)){\n    printf(\"No\\n\");\n    return 0;\n  }else if(strstr(t, s) == NULL){\n    printf(\"No\\n\");\n    return 0;\n  }else if(s[0] != t[0]){\n    printf(\"No\\n\");\n    return 0;\n  }else{\n    printf(\"Yes\\n\");\n  }\n\n  return 0;\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": 367, "cpu_time_ms": 1, "memory_kb": 1644}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s426070251", "group_id": "codeNet:p02681", "input_text": "#include <stdio.h>\n#include <string.h>\n\nint main(void){\n\tchar s[11], t[12], u[11];\n\tint i, x=0;\n\t\n\tscanf(\"%s\", s);\n\tscanf(\"%s\", t);\n\t\n\tfor(i=0; s[i]!=0; i++){\n\t\tif(s[i] != t[i]){\n\t\t\tx=1;\n\t\t\tbreak;\n\t\t}\n\t}\n\t\n\tif(x == 1){\n\t\tprintf(\"No\");\n\t}else{\n\t\tprintf(\"Yes\");\n\t}\n\t\n\treturn 0;\n}", "language": "C", "metadata": {"date": 1589160413, "filename_ext": "c", "original_language": "C (GCC 9.2.1)", "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/C/s426070251.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s426070251", "user_id": "u825624864"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "#include <stdio.h>\n#include <string.h>\n\nint main(void){\n\tchar s[11], t[12], u[11];\n\tint i, x=0;\n\t\n\tscanf(\"%s\", s);\n\tscanf(\"%s\", t);\n\t\n\tfor(i=0; s[i]!=0; i++){\n\t\tif(s[i] != t[i]){\n\t\t\tx=1;\n\t\t\tbreak;\n\t\t}\n\t}\n\t\n\tif(x == 1){\n\t\tprintf(\"No\");\n\t}else{\n\t\tprintf(\"Yes\");\n\t}\n\t\n\treturn 0;\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": 277, "cpu_time_ms": 3, "memory_kb": 1736}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s996076546", "group_id": "codeNet:p02681", "input_text": "#include <stdio.h>\n\nint main(){\n    char S[20]={0};\n    char T[20]={0};\n    scanf(\"%s\", S);\n    scanf(\"%s\", T);\n\n    int flag = 1;\n    int i = 0;\n    while(S[i]){\n        if(S[i]!=T[i]){\n            flag = 0;\n        }\n        i++;\n    }\n    if(T[i]==0){\n        flag = 0;\n    }\n    if(T[i+1]!=0 && i!=9){\n        flag = 0;\n    }\n    if(flag==0){\n        puts(\"No\");\n    }else{\n        puts(\"Yes\");\n    }\n    return 0;\n}", "language": "C", "metadata": {"date": 1589160060, "filename_ext": "c", "original_language": "C (GCC 9.2.1)", "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/C/s996076546.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s996076546", "user_id": "u897135531"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "#include <stdio.h>\n\nint main(){\n    char S[20]={0};\n    char T[20]={0};\n    scanf(\"%s\", S);\n    scanf(\"%s\", T);\n\n    int flag = 1;\n    int i = 0;\n    while(S[i]){\n        if(S[i]!=T[i]){\n            flag = 0;\n        }\n        i++;\n    }\n    if(T[i]==0){\n        flag = 0;\n    }\n    if(T[i+1]!=0 && i!=9){\n        flag = 0;\n    }\n    if(flag==0){\n        puts(\"No\");\n    }else{\n        puts(\"Yes\");\n    }\n    return 0;\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": 420, "cpu_time_ms": 2, "memory_kb": 1644}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s394902951", "group_id": "codeNet:p02681", "input_text": "#include <stdio.h>\n#include <string.h>\n\nint main() {\n    char S[10],T[11];\n    int len_S,len_T;\n    \n    scanf(\"%s\",S);\n    scanf(\"%s\",T);\n    \n    len_S = strlen(S);\n    len_T = strlen(T);\n    if (len_T != len_S + 1 || len_S < 1 || len_S > 10){\n        printf(\"No\\n\");\n    }else{\n        if (strncmp(S,T,len_S) == 0){\n            printf(\"Yes\\n\");\n        }else{\n            printf(\"No\\n\");\n        }\n    }\n    \n    return 0;\n}\n", "language": "C", "metadata": {"date": 1589160047, "filename_ext": "c", "original_language": "C (GCC 9.2.1)", "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/C/s394902951.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s394902951", "user_id": "u379319399"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "#include <stdio.h>\n#include <string.h>\n\nint main() {\n    char S[10],T[11];\n    int len_S,len_T;\n    \n    scanf(\"%s\",S);\n    scanf(\"%s\",T);\n    \n    len_S = strlen(S);\n    len_T = strlen(T);\n    if (len_T != len_S + 1 || len_S < 1 || len_S > 10){\n        printf(\"No\\n\");\n    }else{\n        if (strncmp(S,T,len_S) == 0){\n            printf(\"Yes\\n\");\n        }else{\n            printf(\"No\\n\");\n        }\n    }\n    \n    return 0;\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": 428, "cpu_time_ms": 3, "memory_kb": 1632}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s088424813", "group_id": "codeNet:p02681", "input_text": "#include <stdio.h>\n#include <string.h>\n\nint main(void)\n{\n  char s[10],t[10];\n  scanf(\"%s\", s);\n  scanf(\"%s\", t);\n  t[10] = t[strlen(s)-2];\n  if(strcmp(s,t) == 0){\n    printf(\"Yes\\n\");\n  } else {\n    printf(\"No\\n\");\n  }\n  return 0;\n}\n", "language": "C", "metadata": {"date": 1589159462, "filename_ext": "c", "original_language": "C (GCC 9.2.1)", "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/C/s088424813.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s088424813", "user_id": "u737545415"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "#include <stdio.h>\n#include <string.h>\n\nint main(void)\n{\n  char s[10],t[10];\n  scanf(\"%s\", s);\n  scanf(\"%s\", t);\n  t[10] = t[strlen(s)-2];\n  if(strcmp(s,t) == 0){\n    printf(\"Yes\\n\");\n  } else {\n    printf(\"No\\n\");\n  }\n  return 0;\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": 233, "cpu_time_ms": 239, "memory_kb": 1660}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s994840667", "group_id": "codeNet:p02682", "input_text": "#include<stdio.h>\nint main(void)\n{\n\tint a,b,c,k,x,z,w;\n\tscanf(\"%d %d %d %d\",&a,&b,&c,&k);\n\tx=0; z=0; w=0;\n\tx=k-a;\n\tif(x<=0){\n\t\tprintf(\"%d\\n\",a);\n\t\tprintf(\"%d %d %d\\n\",x,z,w);\n\t}\n\telse{\n\t\tz=x-b;\n\t\tif(z<=0){\n\t\t\tprintf(\"%d\",a);\n\t\t}\n\t\telse{\n\t\t\tw=z-c;\n\t\t\tif(w>=0){\n\t\t\t\tw=a-z;\n\t\t\t}\n\t\t\telse{\n\t\t\t\tw=0;\n\t\t\t}\n\t\t\tprintf(\"%d\",w);\n\t\t}\n\t}\n\treturn 0;\n}", "language": "C", "metadata": {"date": 1593547160, "filename_ext": "c", "original_language": "C (GCC 9.2.1)", "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/C/s994840667.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s994840667", "user_id": "u644911355"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "#include<stdio.h>\nint main(void)\n{\n\tint a,b,c,k,x,z,w;\n\tscanf(\"%d %d %d %d\",&a,&b,&c,&k);\n\tx=0; z=0; w=0;\n\tx=k-a;\n\tif(x<=0){\n\t\tprintf(\"%d\\n\",a);\n\t\tprintf(\"%d %d %d\\n\",x,z,w);\n\t}\n\telse{\n\t\tz=x-b;\n\t\tif(z<=0){\n\t\t\tprintf(\"%d\",a);\n\t\t}\n\t\telse{\n\t\t\tw=z-c;\n\t\t\tif(w>=0){\n\t\t\t\tw=a-z;\n\t\t\t}\n\t\t\telse{\n\t\t\t\tw=0;\n\t\t\t}\n\t\t\tprintf(\"%d\",w);\n\t\t}\n\t}\n\treturn 0;\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": 337, "cpu_time_ms": 5, "memory_kb": 1736}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s019293578", "group_id": "codeNet:p02682", "input_text": "#include<stdio.h>\n#include<string.h>\nint main(){\n  int a,b,c,k;\n  int i,j;\n  \n  scanf(\"%d %d %d %d\",&a,&b,&c,&k);\n  if(a<=k){\n   printf(\"%d\\n\",k);\n  }else if(a+b<=k&&a+b+c<k){\n   printf(\"%d\\n\",a); \n  }else{\n    printf(\"%d\\n\",a+a+b-k);\n  }\n  \n return 0; \n}\n\n", "language": "C", "metadata": {"date": 1592442621, "filename_ext": "c", "original_language": "C (GCC 9.2.1)", "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/C/s019293578.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s019293578", "user_id": "u956872271"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "#include<stdio.h>\n#include<string.h>\nint main(){\n  int a,b,c,k;\n  int i,j;\n  \n  scanf(\"%d %d %d %d\",&a,&b,&c,&k);\n  if(a<=k){\n   printf(\"%d\\n\",k);\n  }else if(a+b<=k&&a+b+c<k){\n   printf(\"%d\\n\",a); \n  }else{\n    printf(\"%d\\n\",a+a+b-k);\n  }\n  \n return 0; \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": 257, "cpu_time_ms": 5, "memory_kb": 1724}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s172804084", "group_id": "codeNet:p02682", "input_text": "#include <stdio.h>\nint main(void){\n    int a,b,c,k,max=0,i;\n    scanf(\"%d%d%d%d\",&a,&b,&c,&k);\n    for(i=0;i<k;i++){\n        if(a>0){\n            max++;\n            a--;\n        }\n        else if(b>0)b--;\n        else{\n            max--;\n            c--;\n        }\n    }\n    printf(\"%d\\n\",max);\n    return 0;\n}", "language": "C", "metadata": {"date": 1592054382, "filename_ext": "c", "original_language": "C (GCC 9.2.1)", "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/C/s172804084.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s172804084", "user_id": "u870890860"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "#include <stdio.h>\nint main(void){\n    int a,b,c,k,max=0,i;\n    scanf(\"%d%d%d%d\",&a,&b,&c,&k);\n    for(i=0;i<k;i++){\n        if(a>0){\n            max++;\n            a--;\n        }\n        else if(b>0)b--;\n        else{\n            max--;\n            c--;\n        }\n    }\n    printf(\"%d\\n\",max);\n    return 0;\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": 310, "cpu_time_ms": 2205, "memory_kb": 1716}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s240716101", "group_id": "codeNet:p02682", "input_text": "#include <stdio.h>\n\nint main(){\n\tint a,b,c,k;\n\tint i, j = 0,  m, sum = 0;;\n\tint box[1000];\n\tscanf(\"%d%d%d%d\", &a, &b, &c, &k);\n\tfor (i = 0; i < 1000; i++)\n\t\tbox[i] = 0;\n\twhile (a > 0) {\n\t\tbox[j] = 1;\n\t\tj++;\n\t\ta--;\n\t}\n\twhile (b > 0) {\n\t\tbox[j] = 0;\n\t\tj++;\n\t\tb--;\n\t}\n\twhile (c > 0) {\n\t\tbox[j] = -1;\n\t\tj++;\n\t\tc--;\n\t}\n\tfor (m = 0; m < k; m++)\n\t\tsum += box[m];\n\tprintf(\"%d\", sum);\n\treturn 0;\n}", "language": "C", "metadata": {"date": 1589161968, "filename_ext": "c", "original_language": "C (Clang 10.0.0)", "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/C/s240716101.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s240716101", "user_id": "u944300923"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "#include <stdio.h>\n\nint main(){\n\tint a,b,c,k;\n\tint i, j = 0,  m, sum = 0;;\n\tint box[1000];\n\tscanf(\"%d%d%d%d\", &a, &b, &c, &k);\n\tfor (i = 0; i < 1000; i++)\n\t\tbox[i] = 0;\n\twhile (a > 0) {\n\t\tbox[j] = 1;\n\t\tj++;\n\t\ta--;\n\t}\n\twhile (b > 0) {\n\t\tbox[j] = 0;\n\t\tj++;\n\t\tb--;\n\t}\n\twhile (c > 0) {\n\t\tbox[j] = -1;\n\t\tj++;\n\t\tc--;\n\t}\n\tfor (m = 0; m < k; m++)\n\t\tsum += box[m];\n\tprintf(\"%d\", sum);\n\treturn 0;\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": 388, "cpu_time_ms": 99, "memory_kb": 2136}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s723811752", "group_id": "codeNet:p02686", "input_text": "#include<stdio.h>\nint R=1,C=1,H[2000010],N[2000010];\n//評価関数（いまはMIN）\nint hyouka(int a,int b){\n  if(C<b)return 1;\n  if(C<a||b==0)return 0;\n  return N[H[a]]>N[H[b]]?1:0;\n}\n//挿入関数\nvoid hin(int a){\n  int i=C++;\n  for(N[H[0]=R]=a;hyouka(0,i/2);i/=2)H[i]=H[i/2];\n  H[i]=R++;\n}\n//取り出す関数\nint hout(){\n  int rt=H[1],i,j=2,k=H[--C];\n  for(i=1;hyouka(i,C);i=j)H[i]=H[j=i*2+1-hyouka(i*2,i*2+1)];\n  H[j/2]=k;\n  return rt;\n}\nint n,i,j,a,b,d[1000010],e[1000010],f[1000010],min;\nint main(){\n  char s[1000010];\n  scanf(\"%d\",&n);\n  for(i=0;i<n;i++){\n    scanf(\"%s\",s);\n    for(j=a=min=0;s[j];j++){\n      if(s[j]=='(')a++;\n      else         a--;\n      if(min>a)min=a;\n    }\n    d[i]=min;\n    e[i]=a;\n  }\n  for(i=0;i<n;i++){\n    if(e[i]>=0){\n      f[R]=e[i];\n      hin(d[i]);\n    }\n  }\n  a=0;\n  while(C-1){\n    i=hout();\n    if(a+N[i]<0)goto END;\n    a+=f[i];\n  }\n  R=C=1;\n  for(i=0;i<n;i++){\n    if(e[i]<0){\n      f[R]=-e[i];\n      hin(d[i]-e[i]);\n    }\n  }\n  b=0;\n  while(C-1){\n    i=hout();\n    if(b+N[i]<0)goto END;\n    b+=f[i];\n  }\n  if(a-b)goto END;\n  printf(\"Yes\\n\");\n  return 0;\n END:;\n  printf(\"No\\n\");\n  return 0;\n}\n\t \n", "language": "C", "metadata": {"date": 1589169281, "filename_ext": "c", "original_language": "C (GCC 9.2.1)", "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/C/s723811752.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s723811752", "user_id": "u121922047"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "#include<stdio.h>\nint R=1,C=1,H[2000010],N[2000010];\n//評価関数（いまはMIN）\nint hyouka(int a,int b){\n  if(C<b)return 1;\n  if(C<a||b==0)return 0;\n  return N[H[a]]>N[H[b]]?1:0;\n}\n//挿入関数\nvoid hin(int a){\n  int i=C++;\n  for(N[H[0]=R]=a;hyouka(0,i/2);i/=2)H[i]=H[i/2];\n  H[i]=R++;\n}\n//取り出す関数\nint hout(){\n  int rt=H[1],i,j=2,k=H[--C];\n  for(i=1;hyouka(i,C);i=j)H[i]=H[j=i*2+1-hyouka(i*2,i*2+1)];\n  H[j/2]=k;\n  return rt;\n}\nint n,i,j,a,b,d[1000010],e[1000010],f[1000010],min;\nint main(){\n  char s[1000010];\n  scanf(\"%d\",&n);\n  for(i=0;i<n;i++){\n    scanf(\"%s\",s);\n    for(j=a=min=0;s[j];j++){\n      if(s[j]=='(')a++;\n      else         a--;\n      if(min>a)min=a;\n    }\n    d[i]=min;\n    e[i]=a;\n  }\n  for(i=0;i<n;i++){\n    if(e[i]>=0){\n      f[R]=e[i];\n      hin(d[i]);\n    }\n  }\n  a=0;\n  while(C-1){\n    i=hout();\n    if(a+N[i]<0)goto END;\n    a+=f[i];\n  }\n  R=C=1;\n  for(i=0;i<n;i++){\n    if(e[i]<0){\n      f[R]=-e[i];\n      hin(d[i]-e[i]);\n    }\n  }\n  b=0;\n  while(C-1){\n    i=hout();\n    if(b+N[i]<0)goto END;\n    b+=f[i];\n  }\n  if(a-b)goto END;\n  printf(\"Yes\\n\");\n  return 0;\n END:;\n  printf(\"No\\n\");\n  return 0;\n}\n\t \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": 1146, "cpu_time_ms": 83, "memory_kb": 15304}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s553192382", "group_id": "codeNet:p02686", "input_text": "#include<stdio.h>\nint a[1000006], b[1000006];\nint h[1000006], ll;\nint comp_h(int x, int y)\n{\n\tif (a[h[x]] > 0 && a[h[y]] <= 0)return -1;\n\tif (a[h[x]] <= 0 && a[h[y]] > 0)return 1;\n\tif (a[h[x]] >= 0)\n\t{\n\t\tif (b[h[x]] < b[h[y]])return 1;\n\t\treturn -1;\n\t}\n\telse\n\t{\n\t\tif (b[h[x]] > b[h[y]])return 1;\n\t\treturn -1;\n\t}\n}\nvoid swap_h(int x, int y)\n{\n\tint f = h[x];\n\th[x] = h[y];\n\th[y] = f;\n\treturn;\n}\nvoid f1(int ne)\n{\n\th[ll] = ne;\n\tint p = ll;\n\tll++;\n\twhile (p > 0)\n\t{\n\t\tif (comp_h((p - 1) / 2, p) > 0)\n\t\t\tswap_h((p - 1) / 2, p);\n\t\tp = (p - 1) / 2;\n\t}\n\treturn;\n}\nint f2()\n{\n\tll--;\n\tswap_h(0, ll);\n\tint p = 0;\n\tfor (;;)\n\t{\n\t\tif (2 * p + 2 < ll)\n\t\t{\n\t\t\tif (comp_h(2 * p + 1, 2 * p + 2) > 0)\n\t\t\t{\n\t\t\t\tif (comp_h(p, 2 * p + 2) > 0)\n\t\t\t\t\tswap_h(p, 2 * p + 2);\n\t\t\t\tp = 2 * p + 2;\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tif (comp_h(p, 2 * p + 1) > 0)\n\t\t\t\t\tswap_h(p, 2 * p + 1);\n\t\t\t\tp = 2 * p + 1;\n\t\t\t}\n\t\t}\n\t\telse if (2 * p + 1 < ll)\n\t\t{\n\t\t\tif (comp_h(p, 2 * p + 1) > 0)\n\t\t\t\tswap_h(p, 2 * p + 1);\n\t\t\tp = 2 * p + 1;\n\t\t}\n\t\telse\n\t\t\tbreak;\n\t}\n\treturn h[ll];\n}\nint main()\n{\n\tint n;\n\tscanf(\"%d\", &n);\n\tint i, j;\n\tchar s[1000006], t[1000006];\n\tint l[1000006];\n\tl[0] = 0;\n\tfor (i = 0; i < n; i++)\n\t{\n\t\tscanf(\"%s\", t);\n\t\tfor (j = 0; t[j] != '\\0'; j++)\n\t\t\ts[l[i] + j] = t[j];\n\t\tl[i + 1] = l[i] + j;\n\t}\n\tfor (i = 0; i < n; i++)\n\t{\n\t\ta[i] = b[i] = 0;\n\t\tfor (j = l[i]; j < l[i + 1]; j++)\n\t\t{\n\t\t\tif (s[j] == '(')\n\t\t\t\ta[i]++;\n\t\t\telse\n\t\t\t\ta[i]--;\n\t\t\tif (b[i] > a[i])\n\t\t\t\tb[i] = a[i];\n\t\t}\n\t}\n\tll = 0;\n\tfor (i = 0; i < n; i++)\n\t\tll += a[i];\n\tif (ll != 0)\n\t{\n\t\tprintf(\"No\\n\");\n\t\treturn 0;\n\t}\n\tll = 0;\n\tfor (i = 0; i < n; i++)\n\t\tif (a[i] >= 0)\n\t\t\tf1(i);\n\tint now = 0;\n\twhile (ll > 0)\n\t{\n\t\tj = f2();\n\t\tif (now + b[j] < 0)\n\t\t{\n\t\t\tprintf(\"No\\n\");\n\t\t\treturn 0;\n\t\t}\n\t\tnow += a[j];\n\t\tif (now < 0)\n\t\t{\n\t\t\tprintf(\"No\\n\");\n\t\t\treturn 0;\n\t\t}\n\t}\n\tll = 0;\n\tfor (i = 0; i < n; i++)\n\t{\n\t\tif (a[i] < 0)\n\t\t{\n\t\t\ta[i] = b[i] = 0;\n\t\t\tfor (j = l[i + 1] - 1; j >= l[i]; j--)\n\t\t\t{\n\t\t\t\tif (s[j] == '(')\n\t\t\t\t\ta[i]--;\n\t\t\t\telse\n\t\t\t\t\ta[i]++;\n\t\t\t\tif (b[i] > a[i])\n\t\t\t\t\tb[i] = a[i];\n\t\t\t}\n\t\t\tf1(i);\n\t\t}\n\t}\n\tint now2 = 0;\n\twhile (ll > 0)\n\t{\n\t\tj = f2();\n\t\tif (now2 + b[j] < 0)\n\t\t{\n\t\t\tprintf(\"No\\n\");\n\t\t\treturn 0;\n\t\t}\n\t\tnow2 += a[j];\n\t\tif (now2 < 0)\n\t\t{\n\t\t\tprintf(\"No\\n\");\n\t\t\treturn 0;\n\t\t}\n\t}\n\tprintf(\"Yes\\n\");\n\treturn 0;\n}", "language": "C", "metadata": {"date": 1589164581, "filename_ext": "c", "original_language": "C (GCC 9.2.1)", "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/C/s553192382.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s553192382", "user_id": "u600300412"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "#include<stdio.h>\nint a[1000006], b[1000006];\nint h[1000006], ll;\nint comp_h(int x, int y)\n{\n\tif (a[h[x]] > 0 && a[h[y]] <= 0)return -1;\n\tif (a[h[x]] <= 0 && a[h[y]] > 0)return 1;\n\tif (a[h[x]] >= 0)\n\t{\n\t\tif (b[h[x]] < b[h[y]])return 1;\n\t\treturn -1;\n\t}\n\telse\n\t{\n\t\tif (b[h[x]] > b[h[y]])return 1;\n\t\treturn -1;\n\t}\n}\nvoid swap_h(int x, int y)\n{\n\tint f = h[x];\n\th[x] = h[y];\n\th[y] = f;\n\treturn;\n}\nvoid f1(int ne)\n{\n\th[ll] = ne;\n\tint p = ll;\n\tll++;\n\twhile (p > 0)\n\t{\n\t\tif (comp_h((p - 1) / 2, p) > 0)\n\t\t\tswap_h((p - 1) / 2, p);\n\t\tp = (p - 1) / 2;\n\t}\n\treturn;\n}\nint f2()\n{\n\tll--;\n\tswap_h(0, ll);\n\tint p = 0;\n\tfor (;;)\n\t{\n\t\tif (2 * p + 2 < ll)\n\t\t{\n\t\t\tif (comp_h(2 * p + 1, 2 * p + 2) > 0)\n\t\t\t{\n\t\t\t\tif (comp_h(p, 2 * p + 2) > 0)\n\t\t\t\t\tswap_h(p, 2 * p + 2);\n\t\t\t\tp = 2 * p + 2;\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tif (comp_h(p, 2 * p + 1) > 0)\n\t\t\t\t\tswap_h(p, 2 * p + 1);\n\t\t\t\tp = 2 * p + 1;\n\t\t\t}\n\t\t}\n\t\telse if (2 * p + 1 < ll)\n\t\t{\n\t\t\tif (comp_h(p, 2 * p + 1) > 0)\n\t\t\t\tswap_h(p, 2 * p + 1);\n\t\t\tp = 2 * p + 1;\n\t\t}\n\t\telse\n\t\t\tbreak;\n\t}\n\treturn h[ll];\n}\nint main()\n{\n\tint n;\n\tscanf(\"%d\", &n);\n\tint i, j;\n\tchar s[1000006], t[1000006];\n\tint l[1000006];\n\tl[0] = 0;\n\tfor (i = 0; i < n; i++)\n\t{\n\t\tscanf(\"%s\", t);\n\t\tfor (j = 0; t[j] != '\\0'; j++)\n\t\t\ts[l[i] + j] = t[j];\n\t\tl[i + 1] = l[i] + j;\n\t}\n\tfor (i = 0; i < n; i++)\n\t{\n\t\ta[i] = b[i] = 0;\n\t\tfor (j = l[i]; j < l[i + 1]; j++)\n\t\t{\n\t\t\tif (s[j] == '(')\n\t\t\t\ta[i]++;\n\t\t\telse\n\t\t\t\ta[i]--;\n\t\t\tif (b[i] > a[i])\n\t\t\t\tb[i] = a[i];\n\t\t}\n\t}\n\tll = 0;\n\tfor (i = 0; i < n; i++)\n\t\tll += a[i];\n\tif (ll != 0)\n\t{\n\t\tprintf(\"No\\n\");\n\t\treturn 0;\n\t}\n\tll = 0;\n\tfor (i = 0; i < n; i++)\n\t\tif (a[i] >= 0)\n\t\t\tf1(i);\n\tint now = 0;\n\twhile (ll > 0)\n\t{\n\t\tj = f2();\n\t\tif (now + b[j] < 0)\n\t\t{\n\t\t\tprintf(\"No\\n\");\n\t\t\treturn 0;\n\t\t}\n\t\tnow += a[j];\n\t\tif (now < 0)\n\t\t{\n\t\t\tprintf(\"No\\n\");\n\t\t\treturn 0;\n\t\t}\n\t}\n\tll = 0;\n\tfor (i = 0; i < n; i++)\n\t{\n\t\tif (a[i] < 0)\n\t\t{\n\t\t\ta[i] = b[i] = 0;\n\t\t\tfor (j = l[i + 1] - 1; j >= l[i]; j--)\n\t\t\t{\n\t\t\t\tif (s[j] == '(')\n\t\t\t\t\ta[i]--;\n\t\t\t\telse\n\t\t\t\t\ta[i]++;\n\t\t\t\tif (b[i] > a[i])\n\t\t\t\t\tb[i] = a[i];\n\t\t\t}\n\t\t\tf1(i);\n\t\t}\n\t}\n\tint now2 = 0;\n\twhile (ll > 0)\n\t{\n\t\tj = f2();\n\t\tif (now2 + b[j] < 0)\n\t\t{\n\t\t\tprintf(\"No\\n\");\n\t\t\treturn 0;\n\t\t}\n\t\tnow2 += a[j];\n\t\tif (now2 < 0)\n\t\t{\n\t\t\tprintf(\"No\\n\");\n\t\t\treturn 0;\n\t\t}\n\t}\n\tprintf(\"Yes\\n\");\n\treturn 0;\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": 2235, "cpu_time_ms": 214, "memory_kb": 16168}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s095798208", "group_id": "codeNet:p02687", "input_text": "#include <stdio.h>\n#include <string.h>\nint main(void){\n  \n  char S[3];\n  scanf(\"%s\",S);\n  if(strcmp(S,\"ABC\") == 0){\n    printf(\"ARC\");\n  }else{\n    printf(\"ABC\");\n  }\n  return 0;\n}", "language": "C", "metadata": {"date": 1589207902, "filename_ext": "c", "original_language": "C (GCC 9.2.1)", "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/C/s095798208.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s095798208", "user_id": "u026229906"}, "prompt_components": {"gold_output": "ARC\n", "input_to_evaluate": "#include <stdio.h>\n#include <string.h>\nint main(void){\n  \n  char S[3];\n  scanf(\"%s\",S);\n  if(strcmp(S,\"ABC\") == 0){\n    printf(\"ARC\");\n  }else{\n    printf(\"ABC\");\n  }\n  return 0;\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": 180, "cpu_time_ms": 2, "memory_kb": 1712}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s358339229", "group_id": "codeNet:p02687", "input_text": "#include<stdio.h>\n#include<string.h>\n \nint main(void)\n{\n    char B[4] = \"ABC\";\n    char R[4] = \"ARC\";\n    char S[3];\n    scanf(\"%s\", S);\n    \n    if (strcmp(S, R) == 0) {\n        printf(\"%s\\n\", B);\n    }\n    else {\n        printf(\"%s\\n\", R);\n    }\n \n    return S;\n}", "language": "C", "metadata": {"date": 1588558189, "filename_ext": "c", "original_language": "C (GCC 9.2.1)", "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/C/s358339229.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s358339229", "user_id": "u457407037"}, "prompt_components": {"gold_output": "ARC\n", "input_to_evaluate": "#include<stdio.h>\n#include<string.h>\n \nint main(void)\n{\n    char B[4] = \"ABC\";\n    char R[4] = \"ARC\";\n    char S[3];\n    scanf(\"%s\", S);\n    \n    if (strcmp(S, R) == 0) {\n        printf(\"%s\\n\", B);\n    }\n    else {\n        printf(\"%s\\n\", R);\n    }\n \n    return S;\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": 265, "cpu_time_ms": 3, "memory_kb": 1620}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s309798583", "group_id": "codeNet:p02687", "input_text": "#include<stdio.h>\n\nint main(){\n\tint n, m, i, j, count=0;\n\tscanf(\"%d %d\", &n, &m);\n\tint h[n], a[m], b[m], counter[n], no[n];\n\tfor(i=0; i<n; i++){\n\t\tscanf(\"%d\", &h[i]);\n\t\tcounter[i]=0;\n\t\tno[i]=0;\n\t}\n\tfor(i=0; i<m; i++){\n\t\tscanf(\"%d %d\", &a[i], &b[i]);\n\t\tno[a[i]-1]=1;\n\t\tno[b[i]-1]=1;\n\t}\n\tfor(i=0; i<m; i++){\n\t\tif(h[a[i]]>h[b[i]]){\n\t\t\tcounter[a[i]-1]=1;\n\t\t\tcounter[b[i]-1]=0;\n\t\t}else if(h[a[i]]<h[b[i]]){\n\t\t\tcounter[b[i]-1]=1;\n\t\t\tcounter[a[i]-1]=0;\n\t\t}\n\t}\n\tfor(i=0; i<n; i++){\n\t\tif(counter[i]==1&&no[i]==0){\n\t\t\tcount++;\n\t\t}\n\t}\n\tprintf(\"%d\", count);\n\n\treturn 0;\n}\n", "language": "C", "metadata": {"date": 1588557191, "filename_ext": "c", "original_language": "C (Clang 10.0.0)", "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/C/s309798583.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s309798583", "user_id": "u607107282"}, "prompt_components": {"gold_output": "ARC\n", "input_to_evaluate": "#include<stdio.h>\n\nint main(){\n\tint n, m, i, j, count=0;\n\tscanf(\"%d %d\", &n, &m);\n\tint h[n], a[m], b[m], counter[n], no[n];\n\tfor(i=0; i<n; i++){\n\t\tscanf(\"%d\", &h[i]);\n\t\tcounter[i]=0;\n\t\tno[i]=0;\n\t}\n\tfor(i=0; i<m; i++){\n\t\tscanf(\"%d %d\", &a[i], &b[i]);\n\t\tno[a[i]-1]=1;\n\t\tno[b[i]-1]=1;\n\t}\n\tfor(i=0; i<m; i++){\n\t\tif(h[a[i]]>h[b[i]]){\n\t\t\tcounter[a[i]-1]=1;\n\t\t\tcounter[b[i]-1]=0;\n\t\t}else if(h[a[i]]<h[b[i]]){\n\t\t\tcounter[b[i]-1]=1;\n\t\t\tcounter[a[i]-1]=0;\n\t\t}\n\t}\n\tfor(i=0; i<n; i++){\n\t\tif(counter[i]==1&&no[i]==0){\n\t\t\tcount++;\n\t\t}\n\t}\n\tprintf(\"%d\", count);\n\n\treturn 0;\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": 560, "cpu_time_ms": 801, "memory_kb": 2304}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s338290794", "group_id": "codeNet:p02687", "input_text": "#include<stdio.h>\nint main()\n{\n    char S[4];\n    scanf(\"%s\",&S);\n    int c=0;\n    for(int i=0;i<3;i++)\n    {\n        if(S[i+1]=='B')\n            c=1;\n    }\n    if(c==1)\n        printf(\"ARC\\n\");\n    else\n        printf(\"ABC\\n\");\n\n    return 0;\n}\n", "language": "C", "metadata": {"date": 1588556405, "filename_ext": "c", "original_language": "C (GCC 9.2.1)", "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/C/s338290794.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s338290794", "user_id": "u661988345"}, "prompt_components": {"gold_output": "ARC\n", "input_to_evaluate": "#include<stdio.h>\nint main()\n{\n    char S[4];\n    scanf(\"%s\",&S);\n    int c=0;\n    for(int i=0;i<3;i++)\n    {\n        if(S[i+1]=='B')\n            c=1;\n    }\n    if(c==1)\n        printf(\"ARC\\n\");\n    else\n        printf(\"ABC\\n\");\n\n    return 0;\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": 246, "cpu_time_ms": 6, "memory_kb": 1588}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s242174477", "group_id": "codeNet:p02687", "input_text": "#include <string.h>\n#include <stdio.h>\n#include <stdlib.h>\n#include<math.h>\n#define ll long long\n\nint main(){\n  char s[4];\n  scanf(\"%s\",s);\n  if(s[1]=='B'){\n    puts(\"ARC\");\n  }\n  if(s[1]=='R'){\n    puts(\"ABC\");\n  }\n  return 0;\n}", "language": "C", "metadata": {"date": 1588555955, "filename_ext": "c", "original_language": "C (GCC 9.2.1)", "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/C/s242174477.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s242174477", "user_id": "u272618329"}, "prompt_components": {"gold_output": "ARC\n", "input_to_evaluate": "#include <string.h>\n#include <stdio.h>\n#include <stdlib.h>\n#include<math.h>\n#define ll long long\n\nint main(){\n  char s[4];\n  scanf(\"%s\",s);\n  if(s[1]=='B'){\n    puts(\"ARC\");\n  }\n  if(s[1]=='R'){\n    puts(\"ABC\");\n  }\n  return 0;\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": 229, "cpu_time_ms": 2, "memory_kb": 1664}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s545084549", "group_id": "codeNet:p02687", "input_text": "#include <stdio.h>\n#include <string.h>\n\nint main(void) \n{\n    char S[4];\n    scanf(\"%s\", S);\n\n    if (strcmp(\"ABC\", S) == 0) {\n        printf(\"ARC\");\n    }\n    else {\n        printf(\"ABC\");\n    }\n\n    return 0;\n}", "language": "C", "metadata": {"date": 1588554619, "filename_ext": "c", "original_language": "C (GCC 9.2.1)", "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/C/s545084549.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s545084549", "user_id": "u339514093"}, "prompt_components": {"gold_output": "ARC\n", "input_to_evaluate": "#include <stdio.h>\n#include <string.h>\n\nint main(void) \n{\n    char S[4];\n    scanf(\"%s\", S);\n\n    if (strcmp(\"ABC\", S) == 0) {\n        printf(\"ARC\");\n    }\n    else {\n        printf(\"ABC\");\n    }\n\n    return 0;\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": 212, "cpu_time_ms": 1, "memory_kb": 1728}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s438471766", "group_id": "codeNet:p02687", "input_text": "#include<stdio.h>\n#include<string.h>\n\nint main() {\n\tchar s[3];\n\tscanf(\"%s\", s);\n\tif(strcmp(s,\"ABC\") == 0) printf(\"ARC\");\n\tif(strcmp(s,\"ARC\") == 0) printf(\"ABC\");\n}", "language": "C", "metadata": {"date": 1588554369, "filename_ext": "c", "original_language": "C (GCC 9.2.1)", "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/C/s438471766.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s438471766", "user_id": "u083593845"}, "prompt_components": {"gold_output": "ARC\n", "input_to_evaluate": "#include<stdio.h>\n#include<string.h>\n\nint main() {\n\tchar s[3];\n\tscanf(\"%s\", s);\n\tif(strcmp(s,\"ABC\") == 0) printf(\"ARC\");\n\tif(strcmp(s,\"ARC\") == 0) printf(\"ABC\");\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": 163, "cpu_time_ms": 2, "memory_kb": 1732}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s946883083", "group_id": "codeNet:p02688", "input_text": "#include <stdio.h>\n\nint main(void){\n\n  int v[100];\n  for(int i=0;i<100;i++){\n    v[i]=0;\n  }\n  int n,k;\n  scanf(\"%d%d\", &n, &k);\n  for(int i=0;i<k;i++){\n    int d;\n    scanf(\"%d\",&d);\n    for(int j=0;j<d;j++){\n      int a;\n      scanf(\"%d\",&a);\n      v[a-1]=1;\n    }\n  }\n\n  int result=0;\n  for(int i=0;i<n;i++){\n    if(v[i]==0){\n      result++;\n    }\n  }\n  printf(\"%d\\n\",result);\n\n  return 0;\n}\n", "language": "C", "metadata": {"date": 1589071804, "filename_ext": "c", "original_language": "C (GCC 9.2.1)", "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/C/s946883083.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s946883083", "user_id": "u844133200"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "#include <stdio.h>\n\nint main(void){\n\n  int v[100];\n  for(int i=0;i<100;i++){\n    v[i]=0;\n  }\n  int n,k;\n  scanf(\"%d%d\", &n, &k);\n  for(int i=0;i<k;i++){\n    int d;\n    scanf(\"%d\",&d);\n    for(int j=0;j<d;j++){\n      int a;\n      scanf(\"%d\",&a);\n      v[a-1]=1;\n    }\n  }\n\n  int result=0;\n  for(int i=0;i<n;i++){\n    if(v[i]==0){\n      result++;\n    }\n  }\n  printf(\"%d\\n\",result);\n\n  return 0;\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": 395, "cpu_time_ms": 2, "memory_kb": 1732}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s568676044", "group_id": "codeNet:p02688", "input_text": "#include <stdio.h>\n\nint main(void){\n\n    int N,K;\n    int i,j,kai;\n    scanf(\"%d %d\",&N,&K);\n\n    int flag[N],l;\n\n    for(l=0;l<N;l++){\n        flag[l]=0;\n    }\n\n    for(i=0;i<K;i++){\n        scanf(\"%d\",&kai);\n        int arr[kai];\n        for(j=0;j<kai;j++){\n            scanf(\"%d\",&arr[j]);\n            flag[arr[j]-1]=1;\n        }\n    }\n    int count=0,m;\n    for(m=0;m<N;m++){\n        if(flag[m]==0){\n            count++;\n        }\n    }\n\n    printf(\"%d\",count);\n    return 0;\n\n}", "language": "C", "metadata": {"date": 1588622953, "filename_ext": "c", "original_language": "C (GCC 9.2.1)", "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/C/s568676044.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s568676044", "user_id": "u861912882"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "#include <stdio.h>\n\nint main(void){\n\n    int N,K;\n    int i,j,kai;\n    scanf(\"%d %d\",&N,&K);\n\n    int flag[N],l;\n\n    for(l=0;l<N;l++){\n        flag[l]=0;\n    }\n\n    for(i=0;i<K;i++){\n        scanf(\"%d\",&kai);\n        int arr[kai];\n        for(j=0;j<kai;j++){\n            scanf(\"%d\",&arr[j]);\n            flag[arr[j]-1]=1;\n        }\n    }\n    int count=0,m;\n    for(m=0;m<N;m++){\n        if(flag[m]==0){\n            count++;\n        }\n    }\n\n    printf(\"%d\",count);\n    return 0;\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": 482, "cpu_time_ms": 2, "memory_kb": 1732}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s997667615", "group_id": "codeNet:p02689", "input_text": "#include <stdio.h>\n\nlong long int Hi[100000], count[100000], ab[100000];\n\nint main()\n{\n    long long int n, m, r1, r2, i, cnt;\n    scanf(\"%lld %lld\", &n, &m);\n    for (i=0; i<n; i++) scanf(\"%lld\", &Hi[i]);\n    for (i=0; i<m; i++) {\n        scanf(\"%lld %lld\", &r1, &r2);\n        ab[r1-1]=1; ab[r2-1]=1;\n        if (Hi[r1-1]>Hi[r2-1]) {\n            count[r1-1]=1;\n            count[r2-1]=0;\n        }\n\n        if (Hi[r2-1]>Hi[r1-1]) {\n            count[r2-1]=1;\n            count[r1-1]=0;\n        }\n    }\n    cnt=0;\n    for (i=0; i<n; i++)\n        if (count[i]==1) cnt++;\n    for (i=0; i<n; i++)\n        if (ab[i]==0) cnt++;\n    printf(\"%lld\\n\", cnt);\n    return 0;\n}\n", "language": "C", "metadata": {"date": 1588582335, "filename_ext": "c", "original_language": "C (GCC 9.2.1)", "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/C/s997667615.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s997667615", "user_id": "u409231490"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "#include <stdio.h>\n\nlong long int Hi[100000], count[100000], ab[100000];\n\nint main()\n{\n    long long int n, m, r1, r2, i, cnt;\n    scanf(\"%lld %lld\", &n, &m);\n    for (i=0; i<n; i++) scanf(\"%lld\", &Hi[i]);\n    for (i=0; i<m; i++) {\n        scanf(\"%lld %lld\", &r1, &r2);\n        ab[r1-1]=1; ab[r2-1]=1;\n        if (Hi[r1-1]>Hi[r2-1]) {\n            count[r1-1]=1;\n            count[r2-1]=0;\n        }\n\n        if (Hi[r2-1]>Hi[r1-1]) {\n            count[r2-1]=1;\n            count[r1-1]=0;\n        }\n    }\n    cnt=0;\n    for (i=0; i<n; i++)\n        if (count[i]==1) cnt++;\n    for (i=0; i<n; i++)\n        if (ab[i]==0) cnt++;\n    printf(\"%lld\\n\", cnt);\n    return 0;\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": 666, "cpu_time_ms": 37, "memory_kb": 4068}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s681991523", "group_id": "codeNet:p02689", "input_text": "#include<stdio.h>\n#include<stdlib.h>\n#include<math.h>\n#include<string.h>\n\n\nint main(){\n\n long long int N,M;\n  scanf(\"%lld %lld\",&N,&M);\n\n/*\n  char A[];\n  scanf(\"%s\",A);\n  */\n\n  \n  long long int H[N+1];\n  int i;\n  for(i=1;i<=N;i++){\n   scanf(\"%lld \",&H[i]);\n   }\n  \n  double T[N+1];\n    for (i=1;i<=N;i++){\n      T[N]=1;\n    }\n  long long int A,B;\n  for(i=1;i<=M;i++){\n   scanf(\"%lld %lld\",&A,&B);\n   if (H[A] < H[B]){\n     if(T[B]!=-1){\n     T[A] = -1;\n     T[B] = 1;\n     }\n     else{\n     T[A] = -1;\n     }\n   }\n   else if (H[A] > H[B]){\n     if(T[A]!=-1){\n     T[B] = -1;\n     T[A] = 1;\n     }\n     else{\n     T[B] = -1;\n     }\n\n   }\n   else{\n     T[A] = -1;\n     T[B] = -1;\n\n   }\n\n\n   }\n\nlong long int counter;\ncounter = 0;\nfor (i=1;i<=N;i++){\n  if(T[i]>=0){\n    counter +=1;\n  }\n}\nprintf(\"%lld\",counter);\n\n\n\n\n\n\n return(0);\n }\n", "language": "C", "metadata": {"date": 1588559903, "filename_ext": "c", "original_language": "C (GCC 9.2.1)", "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/C/s681991523.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s681991523", "user_id": "u713542442"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "#include<stdio.h>\n#include<stdlib.h>\n#include<math.h>\n#include<string.h>\n\n\nint main(){\n\n long long int N,M;\n  scanf(\"%lld %lld\",&N,&M);\n\n/*\n  char A[];\n  scanf(\"%s\",A);\n  */\n\n  \n  long long int H[N+1];\n  int i;\n  for(i=1;i<=N;i++){\n   scanf(\"%lld \",&H[i]);\n   }\n  \n  double T[N+1];\n    for (i=1;i<=N;i++){\n      T[N]=1;\n    }\n  long long int A,B;\n  for(i=1;i<=M;i++){\n   scanf(\"%lld %lld\",&A,&B);\n   if (H[A] < H[B]){\n     if(T[B]!=-1){\n     T[A] = -1;\n     T[B] = 1;\n     }\n     else{\n     T[A] = -1;\n     }\n   }\n   else if (H[A] > H[B]){\n     if(T[A]!=-1){\n     T[B] = -1;\n     T[A] = 1;\n     }\n     else{\n     T[B] = -1;\n     }\n\n   }\n   else{\n     T[A] = -1;\n     T[B] = -1;\n\n   }\n\n\n   }\n\nlong long int counter;\ncounter = 0;\nfor (i=1;i<=N;i++){\n  if(T[i]>=0){\n    counter +=1;\n  }\n}\nprintf(\"%lld\",counter);\n\n\n\n\n\n\n return(0);\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": 831, "cpu_time_ms": 42, "memory_kb": 3288}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s746660250", "group_id": "codeNet:p02689", "input_text": "#define _CRT_SECURE_NO_WARNINGS\n\n#include <stdbool.h>\n#include <stdio.h>\n#include <stdlib.h>\n#include <inttypes.h>\n#include <limits.h>\n#include <ctype.h>\n#include <stdint.h>\n#include <string.h>\n#include <wchar.h>\n#include <math.h>\n\n#define N_MAX (100)\n#define P_MAX (100)\n#define DP_ARRAY_SIZE (N_MAX * P_MAX / 32 + 1)\n\n#define MIN(a, b) ((a) < (b) ? (a) : (b))\n#define MAX(a, b) ((a) > (b) ? (a) : (b))\n#define ABS(a) ((a) < 0 ? -(a) : (a))\n#define ABSS(a, b) ((a) > (b) ? (a) - (b) : (b) - (a))\n#define SWAP(type, a, b) { const type tmp = a; a = b; b = tmp; }\n\nint compare_sz_asc(const void* a, const void* b) {\n    return *((size_t*)a) < *((size_t*)b) ? -1 : 1;\n}\n\nint compare_sz_desc(const void* a, const void* b) {\n    return *((size_t*)a) > * ((size_t*)b) ? -1 : 1;\n}\n\nint compare_i64_asc(const void* a, const void* b) {\n    return *((int64_t*)a) < *((int64_t*)b) ? -1 : 1;\n}\n\nint compare_i64_desc(const void* a, const void* b) {\n    return *((int64_t*)a) > * ((int64_t*)b) ? -1 : 1;\n}\n\nint compare_u64_asc(const void* a, const void* b) {\n    return *((uint64_t*)a) < *((uint64_t*)b) ? -1 : 1;\n}\n\nint compare_u64_desc(const void* a, const void* b) {\n    return *((uint64_t*)a) > * ((uint64_t*)b) ? -1 : 1;\n}\n\nint compare_c_asc(const void* a, const void* b) {\n    return *((char*)a) < *((char*)b) ? -1 : 1;\n}\n\nint compare_c_desc(const void* a, const void* b) {\n    return *((char*)a) > * ((char*)b) ? -1 : 1;\n}\n\nint compare_dp_asc(const void* a, const void* b) {\n    return *((double*)a) < *((double*)b) ? -1 : 1;\n}\n\nstatic uint64_t modinvU64(const uint64_t a, const uint64_t m) {\n    int64_t aa = (int64_t)a;\n    const int64_t mm = (int64_t)m;\n    int64_t b = mm;\n    int64_t u = 1;\n    int64_t v = 0;\n\n    while (b != 0) {\n        const int64_t t = aa / b;\n\n        aa -= t * b;\n        SWAP(uint64_t, aa, b);\n        u -= t * v;\n        SWAP(uint64_t, u, v);\n    }\n\n    u %= mm;\n    if (u < 0) {\n        u += m;\n    }\n\n    return (uint64_t)u;\n}\n\nstatic size_t powSz(const size_t base, const size_t exp) {\n    if (exp == 0) {\n        return 1;\n    }\n\n    if (exp == 1) {\n        return base;\n    }\n\n    if (exp % 2 == 0) {\n        return powSz(base * base, exp / 2);\n    }\n    else {\n        return base * powSz(base, exp - 1);\n    }\n}\n\nstatic uint64_t powU64(const uint64_t base, const uint64_t exp) {\n    if (exp == 0) {\n        return 1;\n    }\n\n    if (exp == 1) {\n        return base;\n    }\n\n    if (exp % 2 == 0) {\n        return powU64(base * base, exp / 2);\n    }\n    else {\n        return base * powU64(base, exp - 1);\n    }\n}\n\nstatic uint64_t powU64WMod(const uint64_t base, const uint64_t exp, const uint64_t m) {\n    if (exp == 0) {\n        return 1;\n    }\n\n    if (exp == 1) {\n        return base % m;\n    }\n\n    if (exp % 2 == 0) {\n        return powU64WMod(base * base % m, exp / 2, m);\n    }\n    else {\n        return base * powU64WMod(base, exp - 1, m) % m;\n    }\n}\n\nstatic size_t combSz(const size_t n, const size_t r) {\n    size_t result = 1;\n\n    for (size_t i = 0; i < r; i++) {\n        result *= n - i;\n        result /= i + 1;\n    }\n\n    return result;\n}\n\nstatic uint64_t combU64(const uint64_t n, const uint64_t r) {\n    uint64_t result = 1;\n\n    for (uint64_t i = 0; i < r; i++) {\n        result *= n - i;\n        result /= i + 1;\n    }\n\n    return result;\n}\n\nstatic uint64_t combU64WMod(const uint64_t n, const uint64_t r, const uint64_t m) {\n    uint64_t result = 1;\n    uint64_t inv = 1;\n\n    for (uint64_t i = 0; i < r; i++) {\n        result = result * (n - i) % m;\n        inv = inv * (i + 1) % m;\n    }\n\n    return result * modinvU64(inv, m) % m;\n}\n\nstatic uint64_t permU64(const uint64_t n) {\n    uint64_t result = 1;\n\n    for (uint64_t v = 2; v <= n; v++) {\n        result *= v;\n    }\n\n    return result;\n}\n\nstatic uint64_t permU64WMod(const uint64_t n, const uint64_t m) {\n    uint64_t result = 1;\n\n    for (uint64_t v = 2; v <= n; v++) {\n        result *= v;\n        result %= m;\n    }\n\n    return result;\n}\n\nstatic size_t gcdZu(size_t m, size_t n) {\n    size_t temp;\n\n    while (m % n != 0) {\n        temp = n;\n        n = m % n;\n        m = temp;\n    }\n\n    return n;\n}\n\nstatic uint64_t gcdU64(uint64_t m, uint64_t n)\n{\n    uint64_t temp;\n\n    while (m % n != 0) {\n        temp = n;\n        n = m % n;\n        m = temp;\n    }\n\n    return n;\n}\n\nstatic uint64_t popcntU64(uint64_t val) {\n    uint64_t cnt = 0;\n\n    while (val != 0) {\n        if ((val & UINT64_C(0x1)) != 0) {\n            cnt++;\n        }\n\n        val >>= UINT64_C(0x1);\n    }\n\n    return cnt;\n}\n\ntypedef struct {\n    uint64_t val;\n}BHeap_Val;\n\n#define BHEAP_VAL_TYPE BHeap_Val\n\n#define BHEAP_INVALID_NODE ((size_t)100000000)\n\ntypedef struct {\n    BHEAP_VAL_TYPE val;\n} BHeap_Node;\n\n\nstruct _BHeap_Ctx {\n    size_t size;\n    int (*compare)(const BHEAP_VAL_TYPE* parent, const BHEAP_VAL_TYPE* node);\n    void(*notifyNodeChange)(const struct _BHeap_Ctx* const ctx, const size_t nodeListSize, const size_t* const nodeList);\n    BHeap_Node* node;\n};\n\ntypedef struct _BHeap_Ctx BHeap_Ctx;\n\nstatic void bHeap_Init(BHeap_Ctx* const ctx, int(*compare)(const BHEAP_VAL_TYPE* parent, const BHEAP_VAL_TYPE* node), void(*notifyNodeChange)(const BHeap_Ctx* const ctx, const size_t nodeListSize, const size_t* const nodeList), BHeap_Node* const nodes) {\n    ctx->size = 0;\n    ctx->compare = compare;\n    ctx->notifyNodeChange = notifyNodeChange;\n    ctx->node = nodes;\n}\n\nstatic void bHeap_Swap(BHeap_Ctx* const ctx, const size_t node0, const size_t node1) {\n    const BHEAP_VAL_TYPE tmp = ctx->node[node0].val;\n    ctx->node[node0].val = ctx->node[node1].val;\n    ctx->node[node1].val = tmp;\n\n    if (ctx->notifyNodeChange != NULL) {\n        const size_t nodeList[2] = { node0,node1 };\n        ctx->notifyNodeChange(ctx, 2, nodeList);\n    }\n}\n\nstatic void bHeap_UpHeap(BHeap_Ctx* const ctx, const size_t nodeIdx) {\n    if (nodeIdx == 0) {\n        return;\n    }\n\n    const size_t parentIdx = (nodeIdx + 1) / 2 - 1;\n\n    const int compareResult = ctx->compare(&(ctx->node[parentIdx].val), &(ctx->node[nodeIdx].val));\n\n    if (0 < compareResult) {\n        bHeap_Swap(ctx, nodeIdx, parentIdx);\n\n        if (parentIdx != 0) {\n            bHeap_UpHeap(ctx, parentIdx);\n        }\n    }\n}\n\nstatic void bHeap_DownHeap(BHeap_Ctx* const ctx, const size_t nodeIdx) {\n    if (ctx->size - 1 <= nodeIdx) {\n        return;\n    }\n\n    const size_t leftIdx = 2 * (nodeIdx + 1) - 1;\n\n    if (leftIdx < ctx->size) {\n        const int leftResult = ctx->compare(&(ctx->node[nodeIdx].val), &(ctx->node[leftIdx].val));\n\n        size_t swapTarget = leftResult < 0 ? BHEAP_INVALID_NODE : leftIdx;\n\n        const size_t rightIdx = leftIdx + 1;\n\n        if (rightIdx < ctx->size) {\n            const int rightResult = ctx->compare(&(ctx->node[nodeIdx].val), &(ctx->node[rightIdx].val));\n\n            if (swapTarget == BHEAP_INVALID_NODE) {\n                if (0 < rightResult) {\n                    swapTarget = rightIdx;\n                }\n            }\n            else {\n                if (0 < rightResult) {\n                    const int rightLeftResult = ctx->compare(&(ctx->node[leftIdx].val), &(ctx->node[rightIdx].val));\n\n                    if (0 < rightLeftResult) {\n                        swapTarget = rightIdx;\n                    }\n                }\n            }\n        }\n\n        if (swapTarget != BHEAP_INVALID_NODE) {\n            bHeap_Swap(ctx, nodeIdx, swapTarget);\n\n            bHeap_DownHeap(ctx, swapTarget);\n        }\n    }\n}\n\nstatic void bHeap_Add(BHeap_Ctx* const ctx, const BHEAP_VAL_TYPE val) {\n    ctx->node[ctx->size].val = val;\n\n    ctx->size++;\n\n    if (ctx->notifyNodeChange != NULL) {\n        const size_t node = ctx->size - 1;\n        ctx->notifyNodeChange(ctx, 1, &node);\n    }\n\n    bHeap_UpHeap(ctx, ctx->size - 1);\n}\n\nstatic void bHeap_RemoveTop(BHeap_Ctx* const ctx) {\n    if (ctx->size == 0) {\n        return;\n    }\n\n    if (ctx->size == 1) {\n        ctx->size--;\n        return;\n    }\n\n    ctx->node[0].val = ctx->node[ctx->size - 1].val;\n\n    if (ctx->notifyNodeChange != NULL) {\n        const size_t node = 0;\n        ctx->notifyNodeChange(ctx, 1, &node);\n    }\n\n    ctx->size--;\n\n    bHeap_DownHeap(ctx, 0);\n}\n\nstatic void bHeap_RemoveNode(BHeap_Ctx* const ctx, const size_t node) {\n    if (node == ctx->size - 1) {\n        ctx->size--;\n    }\n    else {\n        ctx->node[node].val = ctx->node[ctx->size - 1].val;\n\n        ctx->size--;\n\n        if (ctx->notifyNodeChange != NULL) {\n            ctx->notifyNodeChange(ctx, 1, &node);\n        }\n\n        bHeap_DownHeap(ctx, node);\n        bHeap_UpHeap(ctx, node);\n    }\n}\n\nstatic BHEAP_VAL_TYPE* bHeap_GetTopVal(const BHeap_Ctx* const ctx) {\n    return ctx->size == 0 ? NULL : &(ctx->node[0].val);\n}\n\ntypedef struct {\n    uint64_t cnt;\n    size_t* child;\n    size_t numChild;\n    size_t maxNumChild;\n} Tree_Node;\n\n#define TREE_INIT_ALLOC (128)\n\nstatic Tree_Node tree_Node[200000];\n\nstatic void tree_Init(const uint64_t N) {\n    for (uint64_t i = 0; i < N; i++) {\n        tree_Node[i].cnt = 0;\n        tree_Node[i].numChild = 0;\n        tree_Node[i].child = malloc(sizeof(size_t) * TREE_INIT_ALLOC);\n        tree_Node[i].maxNumChild = TREE_INIT_ALLOC;\n    }\n}\n\nstatic void tree_AddChild(const size_t parent, const size_t child) {\n    if (tree_Node[parent].maxNumChild <= tree_Node[parent].numChild) {\n        tree_Node[parent].child = realloc(tree_Node[parent].child, sizeof(size_t) * tree_Node[parent].maxNumChild * 2);\n        tree_Node[parent].maxNumChild *= 2;\n    }\n\n    tree_Node[parent].child[tree_Node[parent].numChild] = child;\n    tree_Node[parent].numChild++;\n}\n\nstatic BHeap_Node BN_Asc[200000];\nstatic BHeap_Node BN_Desc[200000];\n\nstatic int _bHeap_Compare_Asc(const BHEAP_VAL_TYPE* parent, const BHEAP_VAL_TYPE* node) {\n    return parent->val <= node->val ? -1 : 1;\n}\n\nstatic int _bHeap_Compare_Desc(const BHEAP_VAL_TYPE* parent, const BHEAP_VAL_TYPE* node) {\n    return parent->val >= node->val ? -1 : 1;\n}\n\nstatic size_t PBHeap_Asc_Idx[200000];\nstatic size_t PBHeap_Desc_Idx[200000];\n\nstatic void _bHeap_NotifyNodeChange_Asc(const BHeap_Ctx* const ctx, const size_t nodeListSize, const size_t* const nodeList) {\n    for (size_t i = 0; i < nodeListSize; i++) {\n        PBHeap_Asc_Idx[ctx->node[nodeList[i]].val.val] = nodeList[i];\n    }\n}\n\nstatic void _bHeap_NotifyNodeChange_Desc(const BHeap_Ctx* const ctx, const size_t nodeListSize, const size_t* const nodeList) {\n    for (size_t i = 0; i < nodeListSize; i++) {\n        PBHeap_Desc_Idx[ctx->node[nodeList[i]].val.val] = nodeList[i];\n    }\n}\n\n#define UF_ROOT ((size_t)100000000)\n\ntypedef struct {\n    size_t parent;\n    uint64_t w;\n    uint64_t v;\n    uint64_t wSum;\n    uint64_t vSum;\n} UF_Node;\n\nstatic UF_Node uf_Node[1000000];\n\nstatic size_t uf_GetRoot(const size_t idx) {\n    if (uf_Node[idx].parent == UF_ROOT) {\n        return idx;\n    }\n\n    const size_t root = uf_GetRoot(uf_Node[idx].parent);\n\n    uf_Node[idx].parent = root;\n\n    return root;\n}\n\nstatic void uf_Merge(const size_t a, const size_t b) {\n    const size_t aRoot = uf_GetRoot(a);\n    const size_t bRoot = uf_GetRoot(b);\n\n    if (aRoot != bRoot) {\n        uf_Node[aRoot].parent = bRoot;\n\n        uf_Node[bRoot].wSum += uf_Node[aRoot].wSum;\n        uf_Node[bRoot].vSum += uf_Node[aRoot].vSum;\n    }\n}\n\nstatic void sha1(const char* str, uint64_t len, uint32_t* hash) {\n    if (len == 0) {\n        len = (uint64_t)strlen(str);\n    }\n\n    uint32_t h[5] = { 0x67452301 ,0xEFCDAB89 ,0x98BADCFE ,0x10325476 ,0xC3D2E1F0 };\n\n    uint32_t w[80];\n    for (uint64_t i = 0; i < 16; i++) {\n        w[i] = 0;\n    }\n    for (uint64_t i = 0; i < len; i++) {\n        w[i / 4] |= (uint32_t)(str[i]) << ((i % 4) * 8);\n    }\n    w[15] = (uint32_t)len * 8;\n\n    for (uint64_t i = 16; i < 80; i++) {\n        const uint32_t v = w[i - 3] ^ w[i - 8] ^ w[i - 14] ^ w[i - 16];\n        w[i] = (v << 1) | (v >> 31);\n    }\n\n    uint32_t a = h[0];\n    uint32_t b = h[1];\n    uint32_t c = h[2];\n    uint32_t d = h[3];\n    uint32_t e = h[4];\n\n    for (uint64_t i = 0; i < 80; i++) {\n        uint32_t f = 0;\n        uint32_t k = 0;\n        if (i < 20) {\n            f = (a & b) | (~b & d);\n            k = 0x5A827999;\n        }\n        else if (i < 40) {\n            f = b ^ c ^ d;\n            k = 0x6ED9EBA1;\n        }\n        else if (i < 60) {\n            f = (b & c) | (b & d) | (c & d);\n            k = 0x8F1BBCDC;\n        }\n        else {\n            f = b ^ c ^ d;\n            k = 0xCA62C1D6;\n        }\n\n        const uint32_t t = ((a << 5) | (a >> 27)) + f + e + k + w[i];\n        e = d;\n        d = c;\n        c = (b << 30) | (b >> 2);\n        b = a;\n        a = t;\n    }\n\n    h[0] = h[0] + a;\n    h[1] = h[1] + b;\n    h[2] = h[2] + c;\n    h[3] = h[3] + d;\n    h[4] = h[4] + e;\n\n    hash[4] = h[0];\n    hash[3] = h[1];\n    hash[2] = h[2];\n    hash[1] = h[3];\n    hash[0] = h[4];\n}\n\n#define MOD_VAL (UINT64_C(1000000007))\n\ntypedef struct {\n    uint64_t strListSize;\n    char str[10][11];\n} HMap;\n\nstatic HMap hMap[1000000];\n\nstatic uint64_t H[100000];\n\nstatic bool isGoodPeak[100000];\n\nint main(void) {\n    uint64_t N, M;\n\n    scanf(\"%\"PRIu64\"%\"PRIu64, &N, &M);\n    for (uint64_t i = 0; i < N; i++) {\n        scanf(\"%\"PRIu64, &H[i]);\n\n        isGoodPeak[i] = true;\n    }\n    for (uint64_t i = 0; i < M; i++) {\n        uint64_t A, B;\n        scanf(\"%\"PRIu64\"%\"PRIu64, &A, &B);\n        A--;\n        B--;\n\n        if (H[A] < H[B]) {\n            isGoodPeak[A] = false;\n        }\n        else if (H[A] == H[B]) {\n            isGoodPeak[A] = false;\n            isGoodPeak[B] = false;\n        }\n        else {\n            isGoodPeak[B] = false;\n        }\n    }\n\n    uint64_t cnt = 0;\n    for (uint64_t i = 0; i < N; i++) {\n        if (isGoodPeak[i]) {\n            cnt++;\n        }\n    }\n\n    printf(\"%\"PRIu64, cnt);\n\n    return 0;\n}\n", "language": "C", "metadata": {"date": 1588554826, "filename_ext": "c", "original_language": "C (Clang 10.0.0)", "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/C/s746660250.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s746660250", "user_id": "u615782628"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "#define _CRT_SECURE_NO_WARNINGS\n\n#include <stdbool.h>\n#include <stdio.h>\n#include <stdlib.h>\n#include <inttypes.h>\n#include <limits.h>\n#include <ctype.h>\n#include <stdint.h>\n#include <string.h>\n#include <wchar.h>\n#include <math.h>\n\n#define N_MAX (100)\n#define P_MAX (100)\n#define DP_ARRAY_SIZE (N_MAX * P_MAX / 32 + 1)\n\n#define MIN(a, b) ((a) < (b) ? (a) : (b))\n#define MAX(a, b) ((a) > (b) ? (a) : (b))\n#define ABS(a) ((a) < 0 ? -(a) : (a))\n#define ABSS(a, b) ((a) > (b) ? (a) - (b) : (b) - (a))\n#define SWAP(type, a, b) { const type tmp = a; a = b; b = tmp; }\n\nint compare_sz_asc(const void* a, const void* b) {\n    return *((size_t*)a) < *((size_t*)b) ? -1 : 1;\n}\n\nint compare_sz_desc(const void* a, const void* b) {\n    return *((size_t*)a) > * ((size_t*)b) ? -1 : 1;\n}\n\nint compare_i64_asc(const void* a, const void* b) {\n    return *((int64_t*)a) < *((int64_t*)b) ? -1 : 1;\n}\n\nint compare_i64_desc(const void* a, const void* b) {\n    return *((int64_t*)a) > * ((int64_t*)b) ? -1 : 1;\n}\n\nint compare_u64_asc(const void* a, const void* b) {\n    return *((uint64_t*)a) < *((uint64_t*)b) ? -1 : 1;\n}\n\nint compare_u64_desc(const void* a, const void* b) {\n    return *((uint64_t*)a) > * ((uint64_t*)b) ? -1 : 1;\n}\n\nint compare_c_asc(const void* a, const void* b) {\n    return *((char*)a) < *((char*)b) ? -1 : 1;\n}\n\nint compare_c_desc(const void* a, const void* b) {\n    return *((char*)a) > * ((char*)b) ? -1 : 1;\n}\n\nint compare_dp_asc(const void* a, const void* b) {\n    return *((double*)a) < *((double*)b) ? -1 : 1;\n}\n\nstatic uint64_t modinvU64(const uint64_t a, const uint64_t m) {\n    int64_t aa = (int64_t)a;\n    const int64_t mm = (int64_t)m;\n    int64_t b = mm;\n    int64_t u = 1;\n    int64_t v = 0;\n\n    while (b != 0) {\n        const int64_t t = aa / b;\n\n        aa -= t * b;\n        SWAP(uint64_t, aa, b);\n        u -= t * v;\n        SWAP(uint64_t, u, v);\n    }\n\n    u %= mm;\n    if (u < 0) {\n        u += m;\n    }\n\n    return (uint64_t)u;\n}\n\nstatic size_t powSz(const size_t base, const size_t exp) {\n    if (exp == 0) {\n        return 1;\n    }\n\n    if (exp == 1) {\n        return base;\n    }\n\n    if (exp % 2 == 0) {\n        return powSz(base * base, exp / 2);\n    }\n    else {\n        return base * powSz(base, exp - 1);\n    }\n}\n\nstatic uint64_t powU64(const uint64_t base, const uint64_t exp) {\n    if (exp == 0) {\n        return 1;\n    }\n\n    if (exp == 1) {\n        return base;\n    }\n\n    if (exp % 2 == 0) {\n        return powU64(base * base, exp / 2);\n    }\n    else {\n        return base * powU64(base, exp - 1);\n    }\n}\n\nstatic uint64_t powU64WMod(const uint64_t base, const uint64_t exp, const uint64_t m) {\n    if (exp == 0) {\n        return 1;\n    }\n\n    if (exp == 1) {\n        return base % m;\n    }\n\n    if (exp % 2 == 0) {\n        return powU64WMod(base * base % m, exp / 2, m);\n    }\n    else {\n        return base * powU64WMod(base, exp - 1, m) % m;\n    }\n}\n\nstatic size_t combSz(const size_t n, const size_t r) {\n    size_t result = 1;\n\n    for (size_t i = 0; i < r; i++) {\n        result *= n - i;\n        result /= i + 1;\n    }\n\n    return result;\n}\n\nstatic uint64_t combU64(const uint64_t n, const uint64_t r) {\n    uint64_t result = 1;\n\n    for (uint64_t i = 0; i < r; i++) {\n        result *= n - i;\n        result /= i + 1;\n    }\n\n    return result;\n}\n\nstatic uint64_t combU64WMod(const uint64_t n, const uint64_t r, const uint64_t m) {\n    uint64_t result = 1;\n    uint64_t inv = 1;\n\n    for (uint64_t i = 0; i < r; i++) {\n        result = result * (n - i) % m;\n        inv = inv * (i + 1) % m;\n    }\n\n    return result * modinvU64(inv, m) % m;\n}\n\nstatic uint64_t permU64(const uint64_t n) {\n    uint64_t result = 1;\n\n    for (uint64_t v = 2; v <= n; v++) {\n        result *= v;\n    }\n\n    return result;\n}\n\nstatic uint64_t permU64WMod(const uint64_t n, const uint64_t m) {\n    uint64_t result = 1;\n\n    for (uint64_t v = 2; v <= n; v++) {\n        result *= v;\n        result %= m;\n    }\n\n    return result;\n}\n\nstatic size_t gcdZu(size_t m, size_t n) {\n    size_t temp;\n\n    while (m % n != 0) {\n        temp = n;\n        n = m % n;\n        m = temp;\n    }\n\n    return n;\n}\n\nstatic uint64_t gcdU64(uint64_t m, uint64_t n)\n{\n    uint64_t temp;\n\n    while (m % n != 0) {\n        temp = n;\n        n = m % n;\n        m = temp;\n    }\n\n    return n;\n}\n\nstatic uint64_t popcntU64(uint64_t val) {\n    uint64_t cnt = 0;\n\n    while (val != 0) {\n        if ((val & UINT64_C(0x1)) != 0) {\n            cnt++;\n        }\n\n        val >>= UINT64_C(0x1);\n    }\n\n    return cnt;\n}\n\ntypedef struct {\n    uint64_t val;\n}BHeap_Val;\n\n#define BHEAP_VAL_TYPE BHeap_Val\n\n#define BHEAP_INVALID_NODE ((size_t)100000000)\n\ntypedef struct {\n    BHEAP_VAL_TYPE val;\n} BHeap_Node;\n\n\nstruct _BHeap_Ctx {\n    size_t size;\n    int (*compare)(const BHEAP_VAL_TYPE* parent, const BHEAP_VAL_TYPE* node);\n    void(*notifyNodeChange)(const struct _BHeap_Ctx* const ctx, const size_t nodeListSize, const size_t* const nodeList);\n    BHeap_Node* node;\n};\n\ntypedef struct _BHeap_Ctx BHeap_Ctx;\n\nstatic void bHeap_Init(BHeap_Ctx* const ctx, int(*compare)(const BHEAP_VAL_TYPE* parent, const BHEAP_VAL_TYPE* node), void(*notifyNodeChange)(const BHeap_Ctx* const ctx, const size_t nodeListSize, const size_t* const nodeList), BHeap_Node* const nodes) {\n    ctx->size = 0;\n    ctx->compare = compare;\n    ctx->notifyNodeChange = notifyNodeChange;\n    ctx->node = nodes;\n}\n\nstatic void bHeap_Swap(BHeap_Ctx* const ctx, const size_t node0, const size_t node1) {\n    const BHEAP_VAL_TYPE tmp = ctx->node[node0].val;\n    ctx->node[node0].val = ctx->node[node1].val;\n    ctx->node[node1].val = tmp;\n\n    if (ctx->notifyNodeChange != NULL) {\n        const size_t nodeList[2] = { node0,node1 };\n        ctx->notifyNodeChange(ctx, 2, nodeList);\n    }\n}\n\nstatic void bHeap_UpHeap(BHeap_Ctx* const ctx, const size_t nodeIdx) {\n    if (nodeIdx == 0) {\n        return;\n    }\n\n    const size_t parentIdx = (nodeIdx + 1) / 2 - 1;\n\n    const int compareResult = ctx->compare(&(ctx->node[parentIdx].val), &(ctx->node[nodeIdx].val));\n\n    if (0 < compareResult) {\n        bHeap_Swap(ctx, nodeIdx, parentIdx);\n\n        if (parentIdx != 0) {\n            bHeap_UpHeap(ctx, parentIdx);\n        }\n    }\n}\n\nstatic void bHeap_DownHeap(BHeap_Ctx* const ctx, const size_t nodeIdx) {\n    if (ctx->size - 1 <= nodeIdx) {\n        return;\n    }\n\n    const size_t leftIdx = 2 * (nodeIdx + 1) - 1;\n\n    if (leftIdx < ctx->size) {\n        const int leftResult = ctx->compare(&(ctx->node[nodeIdx].val), &(ctx->node[leftIdx].val));\n\n        size_t swapTarget = leftResult < 0 ? BHEAP_INVALID_NODE : leftIdx;\n\n        const size_t rightIdx = leftIdx + 1;\n\n        if (rightIdx < ctx->size) {\n            const int rightResult = ctx->compare(&(ctx->node[nodeIdx].val), &(ctx->node[rightIdx].val));\n\n            if (swapTarget == BHEAP_INVALID_NODE) {\n                if (0 < rightResult) {\n                    swapTarget = rightIdx;\n                }\n            }\n            else {\n                if (0 < rightResult) {\n                    const int rightLeftResult = ctx->compare(&(ctx->node[leftIdx].val), &(ctx->node[rightIdx].val));\n\n                    if (0 < rightLeftResult) {\n                        swapTarget = rightIdx;\n                    }\n                }\n            }\n        }\n\n        if (swapTarget != BHEAP_INVALID_NODE) {\n            bHeap_Swap(ctx, nodeIdx, swapTarget);\n\n            bHeap_DownHeap(ctx, swapTarget);\n        }\n    }\n}\n\nstatic void bHeap_Add(BHeap_Ctx* const ctx, const BHEAP_VAL_TYPE val) {\n    ctx->node[ctx->size].val = val;\n\n    ctx->size++;\n\n    if (ctx->notifyNodeChange != NULL) {\n        const size_t node = ctx->size - 1;\n        ctx->notifyNodeChange(ctx, 1, &node);\n    }\n\n    bHeap_UpHeap(ctx, ctx->size - 1);\n}\n\nstatic void bHeap_RemoveTop(BHeap_Ctx* const ctx) {\n    if (ctx->size == 0) {\n        return;\n    }\n\n    if (ctx->size == 1) {\n        ctx->size--;\n        return;\n    }\n\n    ctx->node[0].val = ctx->node[ctx->size - 1].val;\n\n    if (ctx->notifyNodeChange != NULL) {\n        const size_t node = 0;\n        ctx->notifyNodeChange(ctx, 1, &node);\n    }\n\n    ctx->size--;\n\n    bHeap_DownHeap(ctx, 0);\n}\n\nstatic void bHeap_RemoveNode(BHeap_Ctx* const ctx, const size_t node) {\n    if (node == ctx->size - 1) {\n        ctx->size--;\n    }\n    else {\n        ctx->node[node].val = ctx->node[ctx->size - 1].val;\n\n        ctx->size--;\n\n        if (ctx->notifyNodeChange != NULL) {\n            ctx->notifyNodeChange(ctx, 1, &node);\n        }\n\n        bHeap_DownHeap(ctx, node);\n        bHeap_UpHeap(ctx, node);\n    }\n}\n\nstatic BHEAP_VAL_TYPE* bHeap_GetTopVal(const BHeap_Ctx* const ctx) {\n    return ctx->size == 0 ? NULL : &(ctx->node[0].val);\n}\n\ntypedef struct {\n    uint64_t cnt;\n    size_t* child;\n    size_t numChild;\n    size_t maxNumChild;\n} Tree_Node;\n\n#define TREE_INIT_ALLOC (128)\n\nstatic Tree_Node tree_Node[200000];\n\nstatic void tree_Init(const uint64_t N) {\n    for (uint64_t i = 0; i < N; i++) {\n        tree_Node[i].cnt = 0;\n        tree_Node[i].numChild = 0;\n        tree_Node[i].child = malloc(sizeof(size_t) * TREE_INIT_ALLOC);\n        tree_Node[i].maxNumChild = TREE_INIT_ALLOC;\n    }\n}\n\nstatic void tree_AddChild(const size_t parent, const size_t child) {\n    if (tree_Node[parent].maxNumChild <= tree_Node[parent].numChild) {\n        tree_Node[parent].child = realloc(tree_Node[parent].child, sizeof(size_t) * tree_Node[parent].maxNumChild * 2);\n        tree_Node[parent].maxNumChild *= 2;\n    }\n\n    tree_Node[parent].child[tree_Node[parent].numChild] = child;\n    tree_Node[parent].numChild++;\n}\n\nstatic BHeap_Node BN_Asc[200000];\nstatic BHeap_Node BN_Desc[200000];\n\nstatic int _bHeap_Compare_Asc(const BHEAP_VAL_TYPE* parent, const BHEAP_VAL_TYPE* node) {\n    return parent->val <= node->val ? -1 : 1;\n}\n\nstatic int _bHeap_Compare_Desc(const BHEAP_VAL_TYPE* parent, const BHEAP_VAL_TYPE* node) {\n    return parent->val >= node->val ? -1 : 1;\n}\n\nstatic size_t PBHeap_Asc_Idx[200000];\nstatic size_t PBHeap_Desc_Idx[200000];\n\nstatic void _bHeap_NotifyNodeChange_Asc(const BHeap_Ctx* const ctx, const size_t nodeListSize, const size_t* const nodeList) {\n    for (size_t i = 0; i < nodeListSize; i++) {\n        PBHeap_Asc_Idx[ctx->node[nodeList[i]].val.val] = nodeList[i];\n    }\n}\n\nstatic void _bHeap_NotifyNodeChange_Desc(const BHeap_Ctx* const ctx, const size_t nodeListSize, const size_t* const nodeList) {\n    for (size_t i = 0; i < nodeListSize; i++) {\n        PBHeap_Desc_Idx[ctx->node[nodeList[i]].val.val] = nodeList[i];\n    }\n}\n\n#define UF_ROOT ((size_t)100000000)\n\ntypedef struct {\n    size_t parent;\n    uint64_t w;\n    uint64_t v;\n    uint64_t wSum;\n    uint64_t vSum;\n} UF_Node;\n\nstatic UF_Node uf_Node[1000000];\n\nstatic size_t uf_GetRoot(const size_t idx) {\n    if (uf_Node[idx].parent == UF_ROOT) {\n        return idx;\n    }\n\n    const size_t root = uf_GetRoot(uf_Node[idx].parent);\n\n    uf_Node[idx].parent = root;\n\n    return root;\n}\n\nstatic void uf_Merge(const size_t a, const size_t b) {\n    const size_t aRoot = uf_GetRoot(a);\n    const size_t bRoot = uf_GetRoot(b);\n\n    if (aRoot != bRoot) {\n        uf_Node[aRoot].parent = bRoot;\n\n        uf_Node[bRoot].wSum += uf_Node[aRoot].wSum;\n        uf_Node[bRoot].vSum += uf_Node[aRoot].vSum;\n    }\n}\n\nstatic void sha1(const char* str, uint64_t len, uint32_t* hash) {\n    if (len == 0) {\n        len = (uint64_t)strlen(str);\n    }\n\n    uint32_t h[5] = { 0x67452301 ,0xEFCDAB89 ,0x98BADCFE ,0x10325476 ,0xC3D2E1F0 };\n\n    uint32_t w[80];\n    for (uint64_t i = 0; i < 16; i++) {\n        w[i] = 0;\n    }\n    for (uint64_t i = 0; i < len; i++) {\n        w[i / 4] |= (uint32_t)(str[i]) << ((i % 4) * 8);\n    }\n    w[15] = (uint32_t)len * 8;\n\n    for (uint64_t i = 16; i < 80; i++) {\n        const uint32_t v = w[i - 3] ^ w[i - 8] ^ w[i - 14] ^ w[i - 16];\n        w[i] = (v << 1) | (v >> 31);\n    }\n\n    uint32_t a = h[0];\n    uint32_t b = h[1];\n    uint32_t c = h[2];\n    uint32_t d = h[3];\n    uint32_t e = h[4];\n\n    for (uint64_t i = 0; i < 80; i++) {\n        uint32_t f = 0;\n        uint32_t k = 0;\n        if (i < 20) {\n            f = (a & b) | (~b & d);\n            k = 0x5A827999;\n        }\n        else if (i < 40) {\n            f = b ^ c ^ d;\n            k = 0x6ED9EBA1;\n        }\n        else if (i < 60) {\n            f = (b & c) | (b & d) | (c & d);\n            k = 0x8F1BBCDC;\n        }\n        else {\n            f = b ^ c ^ d;\n            k = 0xCA62C1D6;\n        }\n\n        const uint32_t t = ((a << 5) | (a >> 27)) + f + e + k + w[i];\n        e = d;\n        d = c;\n        c = (b << 30) | (b >> 2);\n        b = a;\n        a = t;\n    }\n\n    h[0] = h[0] + a;\n    h[1] = h[1] + b;\n    h[2] = h[2] + c;\n    h[3] = h[3] + d;\n    h[4] = h[4] + e;\n\n    hash[4] = h[0];\n    hash[3] = h[1];\n    hash[2] = h[2];\n    hash[1] = h[3];\n    hash[0] = h[4];\n}\n\n#define MOD_VAL (UINT64_C(1000000007))\n\ntypedef struct {\n    uint64_t strListSize;\n    char str[10][11];\n} HMap;\n\nstatic HMap hMap[1000000];\n\nstatic uint64_t H[100000];\n\nstatic bool isGoodPeak[100000];\n\nint main(void) {\n    uint64_t N, M;\n\n    scanf(\"%\"PRIu64\"%\"PRIu64, &N, &M);\n    for (uint64_t i = 0; i < N; i++) {\n        scanf(\"%\"PRIu64, &H[i]);\n\n        isGoodPeak[i] = true;\n    }\n    for (uint64_t i = 0; i < M; i++) {\n        uint64_t A, B;\n        scanf(\"%\"PRIu64\"%\"PRIu64, &A, &B);\n        A--;\n        B--;\n\n        if (H[A] < H[B]) {\n            isGoodPeak[A] = false;\n        }\n        else if (H[A] == H[B]) {\n            isGoodPeak[A] = false;\n            isGoodPeak[B] = false;\n        }\n        else {\n            isGoodPeak[B] = false;\n        }\n    }\n\n    uint64_t cnt = 0;\n    for (uint64_t i = 0; i < N; i++) {\n        if (isGoodPeak[i]) {\n            cnt++;\n        }\n    }\n\n    printf(\"%\"PRIu64, cnt);\n\n    return 0;\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": 13696, "cpu_time_ms": 36, "memory_kb": 3052}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s531750590", "group_id": "codeNet:p02690", "input_text": "#include<stdio.h>\nint keisan(long long int a,long long int b){\n\treturn a*a*a*a+a*a*a*b+a*a*b*b+a*b*b*b+b*b*b*b;\n}\nint main(void){\n\tlong long int x,a,b;\n\tint temp=0;\n\tscanf(\"%lld\",&x);\n\tdo{\n\t\tfor(long long int i=1;i<x+1;i++){\n\t\t\tif(x%i==0){\n\t\t\t\tfor(long long int j=0;j<i;j++){\n\t\t\t\t\ta=j;\n\t\t\t\t\tb=j-i;\n\t\t\t\t\tif((a-b)*keisan(a,b)==x){\n\t\t\t\t\t\ttemp=1;\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\tif(temp==1){\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t}while(temp==0);\n\tprintf(\"%lld %lld\",a,b);\n}", "language": "C", "metadata": {"date": 1588557161, "filename_ext": "c", "original_language": "C (GCC 9.2.1)", "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/C/s531750590.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s531750590", "user_id": "u734001128"}, "prompt_components": {"gold_output": "2 -1\n", "input_to_evaluate": "#include<stdio.h>\nint keisan(long long int a,long long int b){\n\treturn a*a*a*a+a*a*a*b+a*a*b*b+a*b*b*b+b*b*b*b;\n}\nint main(void){\n\tlong long int x,a,b;\n\tint temp=0;\n\tscanf(\"%lld\",&x);\n\tdo{\n\t\tfor(long long int i=1;i<x+1;i++){\n\t\t\tif(x%i==0){\n\t\t\t\tfor(long long int j=0;j<i;j++){\n\t\t\t\t\ta=j;\n\t\t\t\t\tb=j-i;\n\t\t\t\t\tif((a-b)*keisan(a,b)==x){\n\t\t\t\t\t\ttemp=1;\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\tif(temp==1){\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t}while(temp==0);\n\tprintf(\"%lld %lld\",a,b);\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": 455, "cpu_time_ms": 2205, "memory_kb": 1712}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s609510557", "group_id": "codeNet:p02691", "input_text": "#include <stdio.h>\n\n#define int64 long long\n\nint main()\n{\n  int64 nn;\n  scanf(\"%lld\", &nn);\n  int64 aa[nn][2], tmp, cnt = 0;\n  for(int64 ii = 0;ii < nn;ii++)\n  {\n    scanf(\"%lld\", &tmp);\n    if(tmp <= 200000)\n    {\n      aa[cnt][0] = ii;\n      aa[cnt][1] = tmp;\n      cnt++;\n    }\n  }\n  int64 ans = 0;\n  for(int64 ii = 0;ii < cnt - 1;ii++)\n  {\n    for(int64 jj = ii + 1;jj < cnt;jj++)\n    {\n      if(aa[jj][0] - aa[ii][0] == aa[jj][1] + aa[ii][1])\n      {\n        ans++;\n      }\n    }\n  }\n  printf(\"%lld\\n\", ans);\n  return 0;\n}", "language": "C", "metadata": {"date": 1588560604, "filename_ext": "c", "original_language": "C (GCC 9.2.1)", "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/C/s609510557.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s609510557", "user_id": "u834987206"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "#include <stdio.h>\n\n#define int64 long long\n\nint main()\n{\n  int64 nn;\n  scanf(\"%lld\", &nn);\n  int64 aa[nn][2], tmp, cnt = 0;\n  for(int64 ii = 0;ii < nn;ii++)\n  {\n    scanf(\"%lld\", &tmp);\n    if(tmp <= 200000)\n    {\n      aa[cnt][0] = ii;\n      aa[cnt][1] = tmp;\n      cnt++;\n    }\n  }\n  int64 ans = 0;\n  for(int64 ii = 0;ii < cnt - 1;ii++)\n  {\n    for(int64 jj = ii + 1;jj < cnt;jj++)\n    {\n      if(aa[jj][0] - aa[ii][0] == aa[jj][1] + aa[ii][1])\n      {\n        ans++;\n      }\n    }\n  }\n  printf(\"%lld\\n\", ans);\n  return 0;\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": 527, "cpu_time_ms": 2205, "memory_kb": 4620}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s168598505", "group_id": "codeNet:p02693", "input_text": "#include <stdio.h>\n\n\nint main(){\n\tint k,a,b;\n\tint flag = 0;\n\tscanf(\"%d\",&k);\n\tscanf(\"%d %d\",&a,&b);\n\t\tfor(int i=a;i<=b;i++){\n\t\t\tif(i%k==0){\n\t\t\t\tflag = 1;\n\t\t\t}\n\t\t}\n\t\tflag== 1 ? puts(\"OK\") : puts(\"NG\");\n\n\treturn 0;\n}", "language": "C", "metadata": {"date": 1600402594, "filename_ext": "c", "original_language": "C (Clang 10.0.0)", "problem_description_relpath": "problem_descriptions/p02693.html", "problem_id": "p02693", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02693/input.txt", "sample_output_relpath": "derived/input_output/data/p02693/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02693/C/s168598505.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s168598505", "user_id": "u863370423"}, "prompt_components": {"gold_output": "OK\n", "input_to_evaluate": "#include <stdio.h>\n\n\nint main(){\n\tint k,a,b;\n\tint flag = 0;\n\tscanf(\"%d\",&k);\n\tscanf(\"%d %d\",&a,&b);\n\t\tfor(int i=a;i<=b;i++){\n\t\t\tif(i%k==0){\n\t\t\t\tflag = 1;\n\t\t\t}\n\t\t}\n\t\tflag== 1 ? puts(\"OK\") : puts(\"NG\");\n\n\treturn 0;\n}", "problem_context": "Score: 100 points\n\nProblem Statement\n\nTakahashi the Jumbo will practice golf.\n\nHis objective is to get a carry distance that is a multiple of K, while he can only make a carry distance of between A and B (inclusive).\n\nIf he can achieve the objective, print OK; if he cannot, print NG.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A \\leq B \\leq 1000\n\n1 \\leq K \\leq 1000\n\nInput\n\nInput is given from Standard Input in the following format:\n\nK\nA B\n\nOutput\n\nIf he can achieve the objective, print OK; if he cannot, print NG.\n\nSample Input 1\n\n7\n500 600\n\nSample Output 1\n\nOK\n\nAmong the multiples of 7, for example, 567 lies between 500 and 600.\n\nSample Input 2\n\n4\n5 7\n\nSample Output 2\n\nNG\n\nNo multiple of 4 lies between 5 and 7.\n\nSample Input 3\n\n1\n11 11\n\nSample Output 3\n\nOK", "sample_input": "7\n500 600\n"}, "reference_outputs": ["OK\n"], "source_document_id": "p02693", "source_text": "Score: 100 points\n\nProblem Statement\n\nTakahashi the Jumbo will practice golf.\n\nHis objective is to get a carry distance that is a multiple of K, while he can only make a carry distance of between A and B (inclusive).\n\nIf he can achieve the objective, print OK; if he cannot, print NG.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A \\leq B \\leq 1000\n\n1 \\leq K \\leq 1000\n\nInput\n\nInput is given from Standard Input in the following format:\n\nK\nA B\n\nOutput\n\nIf he can achieve the objective, print OK; if he cannot, print NG.\n\nSample Input 1\n\n7\n500 600\n\nSample Output 1\n\nOK\n\nAmong the multiples of 7, for example, 567 lies between 500 and 600.\n\nSample Input 2\n\n4\n5 7\n\nSample Output 2\n\nNG\n\nNo multiple of 4 lies between 5 and 7.\n\nSample Input 3\n\n1\n11 11\n\nSample Output 3\n\nOK", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 214, "cpu_time_ms": 5, "memory_kb": 2048}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s408094230", "group_id": "codeNet:p02693", "input_text": "#include<stdio.h>\nint main(void)\n{\n  int k,a,b;\n  scanf(\"%d %d %d\",&k,&a,&b);\n  for(int i=a;i<=b;i++){\n    if(i%k==0){\n      puts(\"OK\");\n      return 0;\n    }\n  }\n  puts(\"NG\");\n  return 0;\n}\n", "language": "C", "metadata": {"date": 1591247321, "filename_ext": "c", "original_language": "C (GCC 9.2.1)", "problem_description_relpath": "problem_descriptions/p02693.html", "problem_id": "p02693", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02693/input.txt", "sample_output_relpath": "derived/input_output/data/p02693/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02693/C/s408094230.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s408094230", "user_id": "u566317458"}, "prompt_components": {"gold_output": "OK\n", "input_to_evaluate": "#include<stdio.h>\nint main(void)\n{\n  int k,a,b;\n  scanf(\"%d %d %d\",&k,&a,&b);\n  for(int i=a;i<=b;i++){\n    if(i%k==0){\n      puts(\"OK\");\n      return 0;\n    }\n  }\n  puts(\"NG\");\n  return 0;\n}\n", "problem_context": "Score: 100 points\n\nProblem Statement\n\nTakahashi the Jumbo will practice golf.\n\nHis objective is to get a carry distance that is a multiple of K, while he can only make a carry distance of between A and B (inclusive).\n\nIf he can achieve the objective, print OK; if he cannot, print NG.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A \\leq B \\leq 1000\n\n1 \\leq K \\leq 1000\n\nInput\n\nInput is given from Standard Input in the following format:\n\nK\nA B\n\nOutput\n\nIf he can achieve the objective, print OK; if he cannot, print NG.\n\nSample Input 1\n\n7\n500 600\n\nSample Output 1\n\nOK\n\nAmong the multiples of 7, for example, 567 lies between 500 and 600.\n\nSample Input 2\n\n4\n5 7\n\nSample Output 2\n\nNG\n\nNo multiple of 4 lies between 5 and 7.\n\nSample Input 3\n\n1\n11 11\n\nSample Output 3\n\nOK", "sample_input": "7\n500 600\n"}, "reference_outputs": ["OK\n"], "source_document_id": "p02693", "source_text": "Score: 100 points\n\nProblem Statement\n\nTakahashi the Jumbo will practice golf.\n\nHis objective is to get a carry distance that is a multiple of K, while he can only make a carry distance of between A and B (inclusive).\n\nIf he can achieve the objective, print OK; if he cannot, print NG.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A \\leq B \\leq 1000\n\n1 \\leq K \\leq 1000\n\nInput\n\nInput is given from Standard Input in the following format:\n\nK\nA B\n\nOutput\n\nIf he can achieve the objective, print OK; if he cannot, print NG.\n\nSample Input 1\n\n7\n500 600\n\nSample Output 1\n\nOK\n\nAmong the multiples of 7, for example, 567 lies between 500 and 600.\n\nSample Input 2\n\n4\n5 7\n\nSample Output 2\n\nNG\n\nNo multiple of 4 lies between 5 and 7.\n\nSample Input 3\n\n1\n11 11\n\nSample Output 3\n\nOK", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 191, "cpu_time_ms": 2, "memory_kb": 1624}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s010193056", "group_id": "codeNet:p02693", "input_text": "#include <math.h>\n#include <stdbool.h>\n#include <stdio.h>\n#include <stdlib.h>\n#include <string.h>\nint main(void) {\n  int i;\n  int K,A,B;\n  long cnt = 0;\n  scanf(\"%d\", &K);\n  scanf(\"%d %d\", &A, &B);\n  if (K == 1) {\n    printf(\"OK\\n\");\n    return 0;\n  }\n  if (A == B) {\n    if ((A / K )*K == A) {\n      printf(\"OK\\n\");\n    } else {\n      printf(\"NG\\n\");\n    }\n    return 0;\n\n  }\n  int c;\n  if (A % K == 0) {\n    c = (A / K);\n  } else {\n    c = (A / K) + 1;\n  }\n    int d = B / K;\n    if (c <= d) {\n      printf(\"OK\\n\");\n    } else {\n      printf(\"NG\\n\");\n    }\n    return 0;\n  }\n", "language": "C", "metadata": {"date": 1588473921, "filename_ext": "c", "original_language": "C (Clang 10.0.0)", "problem_description_relpath": "problem_descriptions/p02693.html", "problem_id": "p02693", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02693/input.txt", "sample_output_relpath": "derived/input_output/data/p02693/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02693/C/s010193056.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s010193056", "user_id": "u628450150"}, "prompt_components": {"gold_output": "OK\n", "input_to_evaluate": "#include <math.h>\n#include <stdbool.h>\n#include <stdio.h>\n#include <stdlib.h>\n#include <string.h>\nint main(void) {\n  int i;\n  int K,A,B;\n  long cnt = 0;\n  scanf(\"%d\", &K);\n  scanf(\"%d %d\", &A, &B);\n  if (K == 1) {\n    printf(\"OK\\n\");\n    return 0;\n  }\n  if (A == B) {\n    if ((A / K )*K == A) {\n      printf(\"OK\\n\");\n    } else {\n      printf(\"NG\\n\");\n    }\n    return 0;\n\n  }\n  int c;\n  if (A % K == 0) {\n    c = (A / K);\n  } else {\n    c = (A / K) + 1;\n  }\n    int d = B / K;\n    if (c <= d) {\n      printf(\"OK\\n\");\n    } else {\n      printf(\"NG\\n\");\n    }\n    return 0;\n  }\n", "problem_context": "Score: 100 points\n\nProblem Statement\n\nTakahashi the Jumbo will practice golf.\n\nHis objective is to get a carry distance that is a multiple of K, while he can only make a carry distance of between A and B (inclusive).\n\nIf he can achieve the objective, print OK; if he cannot, print NG.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A \\leq B \\leq 1000\n\n1 \\leq K \\leq 1000\n\nInput\n\nInput is given from Standard Input in the following format:\n\nK\nA B\n\nOutput\n\nIf he can achieve the objective, print OK; if he cannot, print NG.\n\nSample Input 1\n\n7\n500 600\n\nSample Output 1\n\nOK\n\nAmong the multiples of 7, for example, 567 lies between 500 and 600.\n\nSample Input 2\n\n4\n5 7\n\nSample Output 2\n\nNG\n\nNo multiple of 4 lies between 5 and 7.\n\nSample Input 3\n\n1\n11 11\n\nSample Output 3\n\nOK", "sample_input": "7\n500 600\n"}, "reference_outputs": ["OK\n"], "source_document_id": "p02693", "source_text": "Score: 100 points\n\nProblem Statement\n\nTakahashi the Jumbo will practice golf.\n\nHis objective is to get a carry distance that is a multiple of K, while he can only make a carry distance of between A and B (inclusive).\n\nIf he can achieve the objective, print OK; if he cannot, print NG.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A \\leq B \\leq 1000\n\n1 \\leq K \\leq 1000\n\nInput\n\nInput is given from Standard Input in the following format:\n\nK\nA B\n\nOutput\n\nIf he can achieve the objective, print OK; if he cannot, print NG.\n\nSample Input 1\n\n7\n500 600\n\nSample Output 1\n\nOK\n\nAmong the multiples of 7, for example, 567 lies between 500 and 600.\n\nSample Input 2\n\n4\n5 7\n\nSample Output 2\n\nNG\n\nNo multiple of 4 lies between 5 and 7.\n\nSample Input 3\n\n1\n11 11\n\nSample Output 3\n\nOK", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 577, "cpu_time_ms": 2, "memory_kb": 2088}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s613364786", "group_id": "codeNet:p02693", "input_text": "# include <stdio.h>\nint main(void){\n    int k,a,b,i;\n    scanf(\"%d\",&k);\n    scanf(\"%d %d\",&a,&b);\n    for(i=0;i<1000;i++){\n        if(i*k>b){\n            printf(\"NG\");\n            return 0;\n        }else if(i*k>=a && i*k<=b){\n            printf(\"OK\");\n            return 0;\n        }\n    }\n}\n", "language": "C", "metadata": {"date": 1588471647, "filename_ext": "c", "original_language": "C (GCC 9.2.1)", "problem_description_relpath": "problem_descriptions/p02693.html", "problem_id": "p02693", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02693/input.txt", "sample_output_relpath": "derived/input_output/data/p02693/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02693/C/s613364786.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s613364786", "user_id": "u643145482"}, "prompt_components": {"gold_output": "OK\n", "input_to_evaluate": "# include <stdio.h>\nint main(void){\n    int k,a,b,i;\n    scanf(\"%d\",&k);\n    scanf(\"%d %d\",&a,&b);\n    for(i=0;i<1000;i++){\n        if(i*k>b){\n            printf(\"NG\");\n            return 0;\n        }else if(i*k>=a && i*k<=b){\n            printf(\"OK\");\n            return 0;\n        }\n    }\n}\n", "problem_context": "Score: 100 points\n\nProblem Statement\n\nTakahashi the Jumbo will practice golf.\n\nHis objective is to get a carry distance that is a multiple of K, while he can only make a carry distance of between A and B (inclusive).\n\nIf he can achieve the objective, print OK; if he cannot, print NG.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A \\leq B \\leq 1000\n\n1 \\leq K \\leq 1000\n\nInput\n\nInput is given from Standard Input in the following format:\n\nK\nA B\n\nOutput\n\nIf he can achieve the objective, print OK; if he cannot, print NG.\n\nSample Input 1\n\n7\n500 600\n\nSample Output 1\n\nOK\n\nAmong the multiples of 7, for example, 567 lies between 500 and 600.\n\nSample Input 2\n\n4\n5 7\n\nSample Output 2\n\nNG\n\nNo multiple of 4 lies between 5 and 7.\n\nSample Input 3\n\n1\n11 11\n\nSample Output 3\n\nOK", "sample_input": "7\n500 600\n"}, "reference_outputs": ["OK\n"], "source_document_id": "p02693", "source_text": "Score: 100 points\n\nProblem Statement\n\nTakahashi the Jumbo will practice golf.\n\nHis objective is to get a carry distance that is a multiple of K, while he can only make a carry distance of between A and B (inclusive).\n\nIf he can achieve the objective, print OK; if he cannot, print NG.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A \\leq B \\leq 1000\n\n1 \\leq K \\leq 1000\n\nInput\n\nInput is given from Standard Input in the following format:\n\nK\nA B\n\nOutput\n\nIf he can achieve the objective, print OK; if he cannot, print NG.\n\nSample Input 1\n\n7\n500 600\n\nSample Output 1\n\nOK\n\nAmong the multiples of 7, for example, 567 lies between 500 and 600.\n\nSample Input 2\n\n4\n5 7\n\nSample Output 2\n\nNG\n\nNo multiple of 4 lies between 5 and 7.\n\nSample Input 3\n\n1\n11 11\n\nSample Output 3\n\nOK", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 293, "cpu_time_ms": 1, "memory_kb": 1732}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s947102400", "group_id": "codeNet:p02693", "input_text": "#include<stdio.h>\n\nint main(void){\n  int k,a,b,i;\n  scanf(\"%d %d %d\", &k, &a, &b);\n  if(k == 1)\n    printf(\"OK\");\n  else if(k > b)\n    printf(\"NG\");\n  else if(k <= b - a)\n    printf(\"OK\");\n  else {\n    for(i=a;i<b;i++){\n      if(i%k == 0){\n        printf(\"OK\");\n        break;\n      }\n      else if(i == b)\n        printf(\"NG\");\n    }\n  }\n  return 0;\n}", "language": "C", "metadata": {"date": 1588469300, "filename_ext": "c", "original_language": "C (GCC 9.2.1)", "problem_description_relpath": "problem_descriptions/p02693.html", "problem_id": "p02693", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02693/input.txt", "sample_output_relpath": "derived/input_output/data/p02693/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02693/C/s947102400.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s947102400", "user_id": "u485893928"}, "prompt_components": {"gold_output": "OK\n", "input_to_evaluate": "#include<stdio.h>\n\nint main(void){\n  int k,a,b,i;\n  scanf(\"%d %d %d\", &k, &a, &b);\n  if(k == 1)\n    printf(\"OK\");\n  else if(k > b)\n    printf(\"NG\");\n  else if(k <= b - a)\n    printf(\"OK\");\n  else {\n    for(i=a;i<b;i++){\n      if(i%k == 0){\n        printf(\"OK\");\n        break;\n      }\n      else if(i == b)\n        printf(\"NG\");\n    }\n  }\n  return 0;\n}", "problem_context": "Score: 100 points\n\nProblem Statement\n\nTakahashi the Jumbo will practice golf.\n\nHis objective is to get a carry distance that is a multiple of K, while he can only make a carry distance of between A and B (inclusive).\n\nIf he can achieve the objective, print OK; if he cannot, print NG.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A \\leq B \\leq 1000\n\n1 \\leq K \\leq 1000\n\nInput\n\nInput is given from Standard Input in the following format:\n\nK\nA B\n\nOutput\n\nIf he can achieve the objective, print OK; if he cannot, print NG.\n\nSample Input 1\n\n7\n500 600\n\nSample Output 1\n\nOK\n\nAmong the multiples of 7, for example, 567 lies between 500 and 600.\n\nSample Input 2\n\n4\n5 7\n\nSample Output 2\n\nNG\n\nNo multiple of 4 lies between 5 and 7.\n\nSample Input 3\n\n1\n11 11\n\nSample Output 3\n\nOK", "sample_input": "7\n500 600\n"}, "reference_outputs": ["OK\n"], "source_document_id": "p02693", "source_text": "Score: 100 points\n\nProblem Statement\n\nTakahashi the Jumbo will practice golf.\n\nHis objective is to get a carry distance that is a multiple of K, while he can only make a carry distance of between A and B (inclusive).\n\nIf he can achieve the objective, print OK; if he cannot, print NG.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A \\leq B \\leq 1000\n\n1 \\leq K \\leq 1000\n\nInput\n\nInput is given from Standard Input in the following format:\n\nK\nA B\n\nOutput\n\nIf he can achieve the objective, print OK; if he cannot, print NG.\n\nSample Input 1\n\n7\n500 600\n\nSample Output 1\n\nOK\n\nAmong the multiples of 7, for example, 567 lies between 500 and 600.\n\nSample Input 2\n\n4\n5 7\n\nSample Output 2\n\nNG\n\nNo multiple of 4 lies between 5 and 7.\n\nSample Input 3\n\n1\n11 11\n\nSample Output 3\n\nOK", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 1, "memory_kb": 1724}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s113018744", "group_id": "codeNet:p02694", "input_text": "#include <stdio.h>\n#include <string.h>\n#include <stdlib.h>\ntypedef long long ll;\n\nint main()\n{\n\tll X;\n\tscanf(\"%lld\", &X);\n\tll a = 100;\n\tll i = 0;\n\twhile (a < X)\n\t{\n\t\ta = ((ll)a*1.01);\n\t\ti++;\n\t}\n\tprintf(\"%lld\",i);\n\treturn (0);\n}\n\n", "language": "C", "metadata": {"date": 1588469144, "filename_ext": "c", "original_language": "C (Clang 10.0.0)", "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/C/s113018744.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s113018744", "user_id": "u025047544"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "#include <stdio.h>\n#include <string.h>\n#include <stdlib.h>\ntypedef long long ll;\n\nint main()\n{\n\tll X;\n\tscanf(\"%lld\", &X);\n\tll a = 100;\n\tll i = 0;\n\twhile (a < X)\n\t{\n\t\ta = ((ll)a*1.01);\n\t\ti++;\n\t}\n\tprintf(\"%lld\",i);\n\treturn (0);\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": 229, "cpu_time_ms": 2, "memory_kb": 2156}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s644892140", "group_id": "codeNet:p02694", "input_text": "#include <stdio.h>\n#define rep(i, n) for (int i = 0; i < n; i++)\n#define ll long long\n\nint main(void) {\n\tll x,y = 100;\n\tscanf(\"%ld\", &x);\n\tfor (int i = 1;; i++) {\n\t\ty += y / 100;\n\t\tif (y >= x) {\n\t\t\tprintf(\"%d\\n\", i);\n\t\t\treturn 0;\n\t\t}\n\t}\n}\n", "language": "C", "metadata": {"date": 1588469076, "filename_ext": "c", "original_language": "C (GCC 9.2.1)", "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/C/s644892140.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s644892140", "user_id": "u613912106"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "#include <stdio.h>\n#define rep(i, n) for (int i = 0; i < n; i++)\n#define ll long long\n\nint main(void) {\n\tll x,y = 100;\n\tscanf(\"%ld\", &x);\n\tfor (int i = 1;; i++) {\n\t\ty += y / 100;\n\t\tif (y >= x) {\n\t\t\tprintf(\"%d\\n\", i);\n\t\t\treturn 0;\n\t\t}\n\t}\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": 239, "cpu_time_ms": 3, "memory_kb": 1728}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s840150850", "group_id": "codeNet:p02695", "input_text": "#include <stdio.h>\nint main(void){\n    //変数定義\n    int N;//N文字\n    int M;//M種類\n    int Q;//フィルターの数\n    int point = 0;//現在のポイント\n    int maxpoint = 0;//最大のポイント\n    scanf(\"%d %d %d\",&N,&M,&Q);//１行目入力\n    int f[Q][4];//フィルター格納用配列、0~(Q-1)\n    int l[N];//数列格納用配列、0~(N-1)\n    //入力プログラム\n    for(int i=0;i<Q;i++){//Q回繰り返す\n    \tscanf(\"%d %d %d %d\",&f[i][0],&f[i][1],&f[i][2],&f[i][3]);//１行読み取り\n    }\n    //ループ＆数列作成\n    //N文字の数列\n    //初期化\n    for(int i=1;i<=N;i++){\n    \tl[i-1]=i;\n    }\n    while(l[0]!=M-N+1){\n        //printf(\"%d %d %d\\n\",l[0],l[1],l[2]);\n    \t//点数計算処理\n    \tpoint = 0;\n    \tfor(int i=0;i<Q;i++){//Q回繰り返す\n    \t    //printf(\"%d %d %d %d\",f[i][0],f[i][1],f[i][2],f[i][3]);\n    \t\tif(l[f[i][1]-1]-l[f[i][0]-1]==f[i][2]){\n    \t\t    //printf(\"*\\n\");\n    \t\t\tpoint += f[i][3];\n    \t\t}else{\n    \t\t    //printf(\"\\n\");\n    \t\t}\n    \t}\n    \tif(maxpoint<=point)\n          \tmaxpoint = point;\n       \t\n    \t//新規数列作成処理\n    \t//各n文字目について処理\n    \tfor(int i=N-1;i>=0;i--){\n    \t\tif(i==N-1){\n    \t\t\tif(l[i]<M){//右端の数がMより小さいなら\n    \t\t\tl[i]++;\n    \t\t\tbreak;\n    \t\t\t}\n    \t\t}else{\n    \t\t\tif(l[i]<l[i+1]){//右端の数がMより小さいなら\n           \t\t\tl[i]++;\n           \t\t\tbreak;\n           \t\t}\n           \t}\n    \t}\n    }\n    printf(\"%d\",maxpoint);\n}\n", "language": "C", "metadata": {"date": 1588475829, "filename_ext": "c", "original_language": "C (GCC 9.2.1)", "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/C/s840150850.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s840150850", "user_id": "u515730978"}, "prompt_components": {"gold_output": "110\n", "input_to_evaluate": "#include <stdio.h>\nint main(void){\n    //変数定義\n    int N;//N文字\n    int M;//M種類\n    int Q;//フィルターの数\n    int point = 0;//現在のポイント\n    int maxpoint = 0;//最大のポイント\n    scanf(\"%d %d %d\",&N,&M,&Q);//１行目入力\n    int f[Q][4];//フィルター格納用配列、0~(Q-1)\n    int l[N];//数列格納用配列、0~(N-1)\n    //入力プログラム\n    for(int i=0;i<Q;i++){//Q回繰り返す\n    \tscanf(\"%d %d %d %d\",&f[i][0],&f[i][1],&f[i][2],&f[i][3]);//１行読み取り\n    }\n    //ループ＆数列作成\n    //N文字の数列\n    //初期化\n    for(int i=1;i<=N;i++){\n    \tl[i-1]=i;\n    }\n    while(l[0]!=M-N+1){\n        //printf(\"%d %d %d\\n\",l[0],l[1],l[2]);\n    \t//点数計算処理\n    \tpoint = 0;\n    \tfor(int i=0;i<Q;i++){//Q回繰り返す\n    \t    //printf(\"%d %d %d %d\",f[i][0],f[i][1],f[i][2],f[i][3]);\n    \t\tif(l[f[i][1]-1]-l[f[i][0]-1]==f[i][2]){\n    \t\t    //printf(\"*\\n\");\n    \t\t\tpoint += f[i][3];\n    \t\t}else{\n    \t\t    //printf(\"\\n\");\n    \t\t}\n    \t}\n    \tif(maxpoint<=point)\n          \tmaxpoint = point;\n       \t\n    \t//新規数列作成処理\n    \t//各n文字目について処理\n    \tfor(int i=N-1;i>=0;i--){\n    \t\tif(i==N-1){\n    \t\t\tif(l[i]<M){//右端の数がMより小さいなら\n    \t\t\tl[i]++;\n    \t\t\tbreak;\n    \t\t\t}\n    \t\t}else{\n    \t\t\tif(l[i]<l[i+1]){//右端の数がMより小さいなら\n           \t\t\tl[i]++;\n           \t\t\tbreak;\n           \t\t}\n           \t}\n    \t}\n    }\n    printf(\"%d\",maxpoint);\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": 1493, "cpu_time_ms": 2205, "memory_kb": 1724}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s341315182", "group_id": "codeNet:p02695", "input_text": "#include<stdio.h>\nint n,m,q,max;\nint A[15];\nint ai[55],bi[55],ci[55],di[55];\nint check(){\n\tint ans=0;\n\tfor(int i=1;i<=q;i++) if(A[bi[i]]-A[ai[i]]==ci[i]) ans+=di[i];\n\treturn ans;\n}\nvoid make(int i,int t){\n\tif(i==n+1){\n\t\tint x=check();\n\t\tif(x>max) max=x;\n\t\treturn ;\n\t}\n\tfor(int j=t;j<=m;j++){\n\t\tA[i]=j;\n\t\tmake(i+1,j);\n\t}\n}\nint main(){\n\tscanf(\"%d%d%d\",&n,&m,&q);\n\tfor(int i=1;i<=q;i++){\n\t\tscanf(\"%d%d%d%d\",&ai[i],&bi[i],&ci[i],&di[i]);\n\t}\n\tmake(1,1);\n\tprintf(\"%d\",max);\n\treturn 0;\n}", "language": "C", "metadata": {"date": 1588470546, "filename_ext": "c", "original_language": "C (GCC 9.2.1)", "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/C/s341315182.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s341315182", "user_id": "u141489905"}, "prompt_components": {"gold_output": "110\n", "input_to_evaluate": "#include<stdio.h>\nint n,m,q,max;\nint A[15];\nint ai[55],bi[55],ci[55],di[55];\nint check(){\n\tint ans=0;\n\tfor(int i=1;i<=q;i++) if(A[bi[i]]-A[ai[i]]==ci[i]) ans+=di[i];\n\treturn ans;\n}\nvoid make(int i,int t){\n\tif(i==n+1){\n\t\tint x=check();\n\t\tif(x>max) max=x;\n\t\treturn ;\n\t}\n\tfor(int j=t;j<=m;j++){\n\t\tA[i]=j;\n\t\tmake(i+1,j);\n\t}\n}\nint main(){\n\tscanf(\"%d%d%d\",&n,&m,&q);\n\tfor(int i=1;i<=q;i++){\n\t\tscanf(\"%d%d%d%d\",&ai[i],&bi[i],&ci[i],&di[i]);\n\t}\n\tmake(1,1);\n\tprintf(\"%d\",max);\n\treturn 0;\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": 480, "cpu_time_ms": 18, "memory_kb": 1736}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s743858417", "group_id": "codeNet:p02696", "input_text": "#include<stdio.h>\n#include<math.h>\nint main(void){\n  int a,b,c,d;\n  scanf(\"%d\",&a);\n  scanf(\"%d\",&b);\n  scanf(\"%d\",&c);\n  int e[c];\n  for(int x=c;x>0;x--){\n    e[c-x]=floor(a*x/b)-a*floor(x/b);\n  }\n  d=e[0];\n  for(int i=0;i<c;i++){\n      if(e[i]>=d){\n          d-e[i];\n      }else{\n          d=d;\n      }\n  }\n  printf(\"%d\",d);\n  return 0;\n}", "language": "C", "metadata": {"date": 1588498570, "filename_ext": "c", "original_language": "C (GCC 9.2.1)", "problem_description_relpath": "problem_descriptions/p02696.html", "problem_id": "p02696", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02696/input.txt", "sample_output_relpath": "derived/input_output/data/p02696/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02696/C/s743858417.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s743858417", "user_id": "u608102555"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "#include<stdio.h>\n#include<math.h>\nint main(void){\n  int a,b,c,d;\n  scanf(\"%d\",&a);\n  scanf(\"%d\",&b);\n  scanf(\"%d\",&c);\n  int e[c];\n  for(int x=c;x>0;x--){\n    e[c-x]=floor(a*x/b)-a*floor(x/b);\n  }\n  d=e[0];\n  for(int i=0;i<c;i++){\n      if(e[i]>=d){\n          d-e[i];\n      }else{\n          d=d;\n      }\n  }\n  printf(\"%d\",d);\n  return 0;\n}", "problem_context": "Score : 400 points\n\nProblem Statement\n\nGiven are integers A, B, and N.\n\nFind the maximum possible value of floor(Ax/B) - A × floor(x/B) for a non-negative integer x not greater than N.\n\nHere floor(t) denotes the greatest integer not greater than the real number t.\n\nConstraints\n\n1 ≤ A ≤ 10^{6}\n\n1 ≤ B ≤ 10^{12}\n\n1 ≤ N ≤ 10^{12}\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B N\n\nOutput\n\nPrint the maximum possible value of floor(Ax/B) - A × floor(x/B) for a non-negative integer x not greater than N, as an integer.\n\nSample Input 1\n\n5 7 4\n\nSample Output 1\n\n2\n\nWhen x=3, floor(Ax/B)-A×floor(x/B) = floor(15/7) - 5×floor(3/7) = 2. This is the maximum value possible.\n\nSample Input 2\n\n11 10 9\n\nSample Output 2\n\n9", "sample_input": "5 7 4\n"}, "reference_outputs": ["2\n"], "source_document_id": "p02696", "source_text": "Score : 400 points\n\nProblem Statement\n\nGiven are integers A, B, and N.\n\nFind the maximum possible value of floor(Ax/B) - A × floor(x/B) for a non-negative integer x not greater than N.\n\nHere floor(t) denotes the greatest integer not greater than the real number t.\n\nConstraints\n\n1 ≤ A ≤ 10^{6}\n\n1 ≤ B ≤ 10^{12}\n\n1 ≤ N ≤ 10^{12}\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B N\n\nOutput\n\nPrint the maximum possible value of floor(Ax/B) - A × floor(x/B) for a non-negative integer x not greater than N, as an integer.\n\nSample Input 1\n\n5 7 4\n\nSample Output 1\n\n2\n\nWhen x=3, floor(Ax/B)-A×floor(x/B) = floor(15/7) - 5×floor(3/7) = 2. This is the maximum value possible.\n\nSample Input 2\n\n11 10 9\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": 340, "cpu_time_ms": 102, "memory_kb": 1740}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s152764187", "group_id": "codeNet:p02696", "input_text": "#include <stdio.h>\n#include <math.h>\n\nint main()\n{\n\tlong long int Point;\n\tlong long int PointMax = 0;\n\tlong long int X = 1;\n\tlong long int A, B, N;\n\n\tscanf(\"%lld%lld%lld\", &A, &B, &N);\n\n\twhile (X <= N) {\n\t\tPoint = floor(A*X / B) - A * floor(X / B);\n\t\tif (Point > PointMax) {\n\t\t\tPointMax = Point;\n\t\t}\n\t\tX++;\n\t}\n\n\tprintf(\"%lld\\n\", PointMax);\n\n\treturn 0;\n}", "language": "C", "metadata": {"date": 1588473965, "filename_ext": "c", "original_language": "C (GCC 9.2.1)", "problem_description_relpath": "problem_descriptions/p02696.html", "problem_id": "p02696", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02696/input.txt", "sample_output_relpath": "derived/input_output/data/p02696/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02696/C/s152764187.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s152764187", "user_id": "u161703388"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "#include <stdio.h>\n#include <math.h>\n\nint main()\n{\n\tlong long int Point;\n\tlong long int PointMax = 0;\n\tlong long int X = 1;\n\tlong long int A, B, N;\n\n\tscanf(\"%lld%lld%lld\", &A, &B, &N);\n\n\twhile (X <= N) {\n\t\tPoint = floor(A*X / B) - A * floor(X / B);\n\t\tif (Point > PointMax) {\n\t\t\tPointMax = Point;\n\t\t}\n\t\tX++;\n\t}\n\n\tprintf(\"%lld\\n\", PointMax);\n\n\treturn 0;\n}", "problem_context": "Score : 400 points\n\nProblem Statement\n\nGiven are integers A, B, and N.\n\nFind the maximum possible value of floor(Ax/B) - A × floor(x/B) for a non-negative integer x not greater than N.\n\nHere floor(t) denotes the greatest integer not greater than the real number t.\n\nConstraints\n\n1 ≤ A ≤ 10^{6}\n\n1 ≤ B ≤ 10^{12}\n\n1 ≤ N ≤ 10^{12}\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B N\n\nOutput\n\nPrint the maximum possible value of floor(Ax/B) - A × floor(x/B) for a non-negative integer x not greater than N, as an integer.\n\nSample Input 1\n\n5 7 4\n\nSample Output 1\n\n2\n\nWhen x=3, floor(Ax/B)-A×floor(x/B) = floor(15/7) - 5×floor(3/7) = 2. This is the maximum value possible.\n\nSample Input 2\n\n11 10 9\n\nSample Output 2\n\n9", "sample_input": "5 7 4\n"}, "reference_outputs": ["2\n"], "source_document_id": "p02696", "source_text": "Score : 400 points\n\nProblem Statement\n\nGiven are integers A, B, and N.\n\nFind the maximum possible value of floor(Ax/B) - A × floor(x/B) for a non-negative integer x not greater than N.\n\nHere floor(t) denotes the greatest integer not greater than the real number t.\n\nConstraints\n\n1 ≤ A ≤ 10^{6}\n\n1 ≤ B ≤ 10^{12}\n\n1 ≤ N ≤ 10^{12}\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B N\n\nOutput\n\nPrint the maximum possible value of floor(Ax/B) - A × floor(x/B) for a non-negative integer x not greater than N, as an integer.\n\nSample Input 1\n\n5 7 4\n\nSample Output 1\n\n2\n\nWhen x=3, floor(Ax/B)-A×floor(x/B) = floor(15/7) - 5×floor(3/7) = 2. This is the maximum value possible.\n\nSample Input 2\n\n11 10 9\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": 353, "cpu_time_ms": 2205, "memory_kb": 1680}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s919421803", "group_id": "codeNet:p02696", "input_text": "#include<stdio.h>\n#include<math.h>\n\nint main(){\n  int a,b,x;\n  int ans;\n  scanf(\"%d %d %d\",&a,&b,&x);\n\n  ans = floor( ( a * x ) / b ) - a * floor( x / b );\n\n  printf(\"%d\\n\",ans);\n}", "language": "C", "metadata": {"date": 1588470278, "filename_ext": "c", "original_language": "C (GCC 9.2.1)", "problem_description_relpath": "problem_descriptions/p02696.html", "problem_id": "p02696", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02696/input.txt", "sample_output_relpath": "derived/input_output/data/p02696/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02696/C/s919421803.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s919421803", "user_id": "u266674382"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "#include<stdio.h>\n#include<math.h>\n\nint main(){\n  int a,b,x;\n  int ans;\n  scanf(\"%d %d %d\",&a,&b,&x);\n\n  ans = floor( ( a * x ) / b ) - a * floor( x / b );\n\n  printf(\"%d\\n\",ans);\n}", "problem_context": "Score : 400 points\n\nProblem Statement\n\nGiven are integers A, B, and N.\n\nFind the maximum possible value of floor(Ax/B) - A × floor(x/B) for a non-negative integer x not greater than N.\n\nHere floor(t) denotes the greatest integer not greater than the real number t.\n\nConstraints\n\n1 ≤ A ≤ 10^{6}\n\n1 ≤ B ≤ 10^{12}\n\n1 ≤ N ≤ 10^{12}\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B N\n\nOutput\n\nPrint the maximum possible value of floor(Ax/B) - A × floor(x/B) for a non-negative integer x not greater than N, as an integer.\n\nSample Input 1\n\n5 7 4\n\nSample Output 1\n\n2\n\nWhen x=3, floor(Ax/B)-A×floor(x/B) = floor(15/7) - 5×floor(3/7) = 2. This is the maximum value possible.\n\nSample Input 2\n\n11 10 9\n\nSample Output 2\n\n9", "sample_input": "5 7 4\n"}, "reference_outputs": ["2\n"], "source_document_id": "p02696", "source_text": "Score : 400 points\n\nProblem Statement\n\nGiven are integers A, B, and N.\n\nFind the maximum possible value of floor(Ax/B) - A × floor(x/B) for a non-negative integer x not greater than N.\n\nHere floor(t) denotes the greatest integer not greater than the real number t.\n\nConstraints\n\n1 ≤ A ≤ 10^{6}\n\n1 ≤ B ≤ 10^{12}\n\n1 ≤ N ≤ 10^{12}\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B N\n\nOutput\n\nPrint the maximum possible value of floor(Ax/B) - A × floor(x/B) for a non-negative integer x not greater than N, as an integer.\n\nSample Input 1\n\n5 7 4\n\nSample Output 1\n\n2\n\nWhen x=3, floor(Ax/B)-A×floor(x/B) = floor(15/7) - 5×floor(3/7) = 2. This is the maximum value possible.\n\nSample Input 2\n\n11 10 9\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": 180, "cpu_time_ms": 6, "memory_kb": 1680}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s334185294", "group_id": "codeNet:p02697", "input_text": "#include <stdio.h>\n\nint main()\n{\n    int n, m;\n\n    scanf(\"%d%d\", &n, &m);\n    for (int i = 1; i <= m; i++)\n    {\n        printf(\"%d %d\\n\", (n / 2) - m + i, (n / 2) + m - i + 1);\n    }\n    return 0;\n}", "language": "C", "metadata": {"date": 1588472817, "filename_ext": "c", "original_language": "C (GCC 9.2.1)", "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/C/s334185294.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s334185294", "user_id": "u477156071"}, "prompt_components": {"gold_output": "2 3\n", "input_to_evaluate": "#include <stdio.h>\n\nint main()\n{\n    int n, m;\n\n    scanf(\"%d%d\", &n, &m);\n    for (int i = 1; i <= m; i++)\n    {\n        printf(\"%d %d\\n\", (n / 2) - m + i, (n / 2) + m - i + 1);\n    }\n    return 0;\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": 200, "cpu_time_ms": 19, "memory_kb": 1736}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s439688027", "group_id": "codeNet:p02697", "input_text": "#include <stdio.h>\n\nstatic unsigned int x=123456789;\nstatic unsigned int y=362436069;\nstatic unsigned int z=521288629;\nstatic unsigned int w=88675123;\n\nvoid seed(unsigned int a,unsigned int b,unsigned int c,unsigned int d) {\n\tif((a|b|c|d)==0)return;\n\tx=a;y=b;z=c;w=d;\n}\n\nunsigned int randint(void) {\n\tunsigned int t;\n\tt=(x^(x<<11));\n\tx=y;y=z;z=w;\n\tw=(w^(w>>19))^(t^(t>>8));\n\treturn w;\n}\n\nint matukisu[271828];\n\nint aru[271828];\n\nint main(void) {\n\tint N, M;\n\tint i;\n\tint gen;\n\tif (scanf(\"%d%d\", &N, &M) != 2) return 1;\n\tfor (i = 0; i < N; i++) {\n\t\tmatukisu[i] = i + 1;\n\t}\n\tfor (gen = 1; ; gen++) {\n\t\tint ng = 0;\n\t\tfor (i = N - 1; i > 0; i--) {\n\t\t\tint pos = (int)(randint() % (i + 1)); /* ごめん */\n\t\t\tint temp = matukisu[pos];\n\t\t\tmatukisu[pos] = matukisu[i];\n\t\t\tmatukisu[i] = temp;\n\t\t}\n\t\tfor (i = 0; i < M; i++) {\n\t\t\tint tomatu = matukisu[i * 2] - matukisu[i * 2 + 1];\n\t\t\tif (tomatu < 0) tomatu = -tomatu;\n\t\t\tif (aru[tomatu] == gen || aru[N - tomatu] == gen) {\n\t\t\t\tng = 1;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tif (!ng) {\n\t\t\tfor (i = 0; i < M; i++) {\n\t\t\t\tprintf(\"%d %d\\n\", matukisu[i * 2], matukisu[i * 2 + 1]);\n\t\t\t}\n\t\t\tbreak;\n\t\t}\n\t}\n\treturn 0;\n}\n\n/*\n\n123**321\n23**3211\n3**32112\n**321123\n*321123*\n\nNG\n\n7 3のケース\n1 6 -> 5 2\n2 5 -> 3 4\n3 4 -> 1 6\n\n8 3にすると\n1 8 -> 7 1\n2 7 -> 5 2\n3 6 -> 3 5\n\n5が被るのでNG\n\n1 7 -> 6 2\n2 6 -> 4 4\n3 5 -> 2 6\n\nNG\n\n1 6 -> 5 3\n2 5 -> 3 5\n3 4 -> 1 7\n\nNG\n\n*/\n", "language": "C", "metadata": {"date": 1588470454, "filename_ext": "c", "original_language": "C (GCC 9.2.1)", "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/C/s439688027.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s439688027", "user_id": "u646118499"}, "prompt_components": {"gold_output": "2 3\n", "input_to_evaluate": "#include <stdio.h>\n\nstatic unsigned int x=123456789;\nstatic unsigned int y=362436069;\nstatic unsigned int z=521288629;\nstatic unsigned int w=88675123;\n\nvoid seed(unsigned int a,unsigned int b,unsigned int c,unsigned int d) {\n\tif((a|b|c|d)==0)return;\n\tx=a;y=b;z=c;w=d;\n}\n\nunsigned int randint(void) {\n\tunsigned int t;\n\tt=(x^(x<<11));\n\tx=y;y=z;z=w;\n\tw=(w^(w>>19))^(t^(t>>8));\n\treturn w;\n}\n\nint matukisu[271828];\n\nint aru[271828];\n\nint main(void) {\n\tint N, M;\n\tint i;\n\tint gen;\n\tif (scanf(\"%d%d\", &N, &M) != 2) return 1;\n\tfor (i = 0; i < N; i++) {\n\t\tmatukisu[i] = i + 1;\n\t}\n\tfor (gen = 1; ; gen++) {\n\t\tint ng = 0;\n\t\tfor (i = N - 1; i > 0; i--) {\n\t\t\tint pos = (int)(randint() % (i + 1)); /* ごめん */\n\t\t\tint temp = matukisu[pos];\n\t\t\tmatukisu[pos] = matukisu[i];\n\t\t\tmatukisu[i] = temp;\n\t\t}\n\t\tfor (i = 0; i < M; i++) {\n\t\t\tint tomatu = matukisu[i * 2] - matukisu[i * 2 + 1];\n\t\t\tif (tomatu < 0) tomatu = -tomatu;\n\t\t\tif (aru[tomatu] == gen || aru[N - tomatu] == gen) {\n\t\t\t\tng = 1;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tif (!ng) {\n\t\t\tfor (i = 0; i < M; i++) {\n\t\t\t\tprintf(\"%d %d\\n\", matukisu[i * 2], matukisu[i * 2 + 1]);\n\t\t\t}\n\t\t\tbreak;\n\t\t}\n\t}\n\treturn 0;\n}\n\n/*\n\n123**321\n23**3211\n3**32112\n**321123\n*321123*\n\nNG\n\n7 3のケース\n1 6 -> 5 2\n2 5 -> 3 4\n3 4 -> 1 6\n\n8 3にすると\n1 8 -> 7 1\n2 7 -> 5 2\n3 6 -> 3 5\n\n5が被るのでNG\n\n1 7 -> 6 2\n2 6 -> 4 4\n3 5 -> 2 6\n\nNG\n\n1 6 -> 5 3\n2 5 -> 3 5\n3 4 -> 1 7\n\nNG\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": 1387, "cpu_time_ms": 19, "memory_kb": 2332}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s008657067", "group_id": "codeNet:p02699", "input_text": "#include <stdio.h>\n\nint main(void) {\n  int w;\n  int s;\n  scanf(\"%d, %d\", &s, &w);\n  if(w >= s) {\n    printf(\"unsafe\");\n  } else {\n    printf(\"safe\");\n  }\n  return 0;\n}\n", "language": "C", "metadata": {"date": 1596511280, "filename_ext": "c", "original_language": "C (GCC 9.2.1)", "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/C/s008657067.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s008657067", "user_id": "u773833122"}, "prompt_components": {"gold_output": "unsafe\n", "input_to_evaluate": "#include <stdio.h>\n\nint main(void) {\n  int w;\n  int s;\n  scanf(\"%d, %d\", &s, &w);\n  if(w >= s) {\n    printf(\"unsafe\");\n  } else {\n    printf(\"safe\");\n  }\n  return 0;\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": 168, "cpu_time_ms": 3, "memory_kb": 1704}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s068481736", "group_id": "codeNet:p02701", "input_text": "#include<stdio.h>\n#include<string.h>\nint main(void)\n{\n  int i, j;\n  int n,sum = 0;\n  scanf(\"%d\",&n);\n  char s[n][10], t[20];\n  for(i = 0 ; i < n ; i++){\n    scanf(\"%s\", s[i]);\n    sum++;\n  }\n  for(i=1 ; i < n ; i++){\n    for(j = 1 ; j < n ; j++){\n      if(strcmp(s[j-1], s[j]) > 0){\n        strcpy(t, s[j-1]);\n        strcpy(s[j-1], s[j]);\n        strcpy(s[j], t);\n      }\n    }\n    if(s[i] == s[i+1])\n      sum--;\n  }\n  printf(\"%d\", sum);\n  return 0;\n}", "language": "C", "metadata": {"date": 1596481769, "filename_ext": "c", "original_language": "C (GCC 9.2.1)", "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/C/s068481736.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s068481736", "user_id": "u651467341"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "#include<stdio.h>\n#include<string.h>\nint main(void)\n{\n  int i, j;\n  int n,sum = 0;\n  scanf(\"%d\",&n);\n  char s[n][10], t[20];\n  for(i = 0 ; i < n ; i++){\n    scanf(\"%s\", s[i]);\n    sum++;\n  }\n  for(i=1 ; i < n ; i++){\n    for(j = 1 ; j < n ; j++){\n      if(strcmp(s[j-1], s[j]) > 0){\n        strcpy(t, s[j-1]);\n        strcpy(s[j-1], s[j]);\n        strcpy(s[j], t);\n      }\n    }\n    if(s[i] == s[i+1])\n      sum--;\n  }\n  printf(\"%d\", sum);\n  return 0;\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": 453, "cpu_time_ms": 2205, "memory_kb": 3552}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s408047706", "group_id": "codeNet:p02701", "input_text": "#include<stdio.h>\n#include<string.h>\n\nint main(void)\n{\n  int N, counter = 0, count1, kind = 1;\n  scanf(\"%d\",&N);\n\n  char S[N][15];\n  while(counter < N){\n    scanf(\"%s\",S[counter]);\n    counter++;\n  }\n\n  for(count1 = 0; count1 < N; count1++){\n    printf(\"%s\\n\",S[count1]);\n  }\n\n  for(count1 = 1; count1 < N; count1++){\n    if(strcmp(S[0],S[count1]) != 0){\n        kind++;\n    }\n  }\n\n  printf(\"%d\\n\", kind);\n\n  return 0;\n}", "language": "C", "metadata": {"date": 1588204451, "filename_ext": "c", "original_language": "C (GCC 9.2.1)", "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/C/s408047706.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s408047706", "user_id": "u227123653"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "#include<stdio.h>\n#include<string.h>\n\nint main(void)\n{\n  int N, counter = 0, count1, kind = 1;\n  scanf(\"%d\",&N);\n\n  char S[N][15];\n  while(counter < N){\n    scanf(\"%s\",S[counter]);\n    counter++;\n  }\n\n  for(count1 = 0; count1 < N; count1++){\n    printf(\"%s\\n\",S[count1]);\n  }\n\n  for(count1 = 1; count1 < N; count1++){\n    if(strcmp(S[0],S[count1]) != 0){\n        kind++;\n    }\n  }\n\n  printf(\"%d\\n\", kind);\n\n  return 0;\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": 420, "cpu_time_ms": 29, "memory_kb": 5388}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s453618455", "group_id": "codeNet:p02701", "input_text": "#include <stdio.h>\n#include <stdlib.h>\n#include <string.h>\n\nint cmp(const void *a, const void *b){\n    char *left_char = (char *)a;\n  char *right_char = (char *)b;\n  return strcmp(left_char, right_char);\n}\n\nint main(void){\n    int n;\n    char s[200005][10];\n    int dif=1;\n    scanf(\"%d\",&n);\n\n    for(int i=0;i<n;i++){\n        scanf(\"%s\",s[i]);\n    }\n\n    qsort(s,n,sizeof(char)*10,cmp);\n\n    for(int i=1;i<n;i++){\n        if(strcmp(s[i-1],s[i])!=0){dif++;}\n    }\n    printf(\"%d\\n\",dif);\n    return 0;\n}\n", "language": "C", "metadata": {"date": 1588011297, "filename_ext": "c", "original_language": "C (GCC 9.2.1)", "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/C/s453618455.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s453618455", "user_id": "u932514381"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "#include <stdio.h>\n#include <stdlib.h>\n#include <string.h>\n\nint cmp(const void *a, const void *b){\n    char *left_char = (char *)a;\n  char *right_char = (char *)b;\n  return strcmp(left_char, right_char);\n}\n\nint main(void){\n    int n;\n    char s[200005][10];\n    int dif=1;\n    scanf(\"%d\",&n);\n\n    for(int i=0;i<n;i++){\n        scanf(\"%s\",s[i]);\n    }\n\n    qsort(s,n,sizeof(char)*10,cmp);\n\n    for(int i=1;i<n;i++){\n        if(strcmp(s[i-1],s[i])!=0){dif++;}\n    }\n    printf(\"%d\\n\",dif);\n    return 0;\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": 505, "cpu_time_ms": 2205, "memory_kb": 5476}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s576469059", "group_id": "codeNet:p02701", "input_text": "#include <stdio.h>\n#include <stdlib.h>\n#include <string.h>\n\nstatic int compareFunction(const void *lhs, const void *rhs) {\n  // 昇順(char)\n  return strcmp(lhs, rhs);\n}\n\nint main() {\n  int amount;\n  scanf(\"%d\", &amount);\n\n  char kind[amount][11];\n  for (int i = 0; i < amount; i += 1) {\n    scanf(\"%s\", *(kind + i));\n  }\n  // ソートして同じ種類のものを固める\n  qsort(kind, amount, sizeof(*kind), compareFunction);\n\n  // 1つ目の種類に関しては絶対カウント1するので1から始める\n  // 同じので固まっていても違うものが出てきて初めてインクリメントなのでこれでOK\n  // たとえ全部同じでも1が正解だし\n  int output = 1;\n\n  // index + 1 との比較になるため、i < amount - 1 が条件\n  for (int i = 0; i < amount - 1; i += 1) {\n    // 並べ替え後の1つ目2つ目...を比較して違っていたらカウントをインクリメント\n    if (strcmp(*(kind + i), *(kind + i + 1)) != 0) {\n      output += 1;\n    }\n  }\n\n  printf(\"%d\", output);\n  printf(\"%c\", '\\n');\n\n  return 0;\n}\n", "language": "C", "metadata": {"date": 1587967475, "filename_ext": "c", "original_language": "C (GCC 9.2.1)", "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/C/s576469059.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s576469059", "user_id": "u967208777"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "#include <stdio.h>\n#include <stdlib.h>\n#include <string.h>\n\nstatic int compareFunction(const void *lhs, const void *rhs) {\n  // 昇順(char)\n  return strcmp(lhs, rhs);\n}\n\nint main() {\n  int amount;\n  scanf(\"%d\", &amount);\n\n  char kind[amount][11];\n  for (int i = 0; i < amount; i += 1) {\n    scanf(\"%s\", *(kind + i));\n  }\n  // ソートして同じ種類のものを固める\n  qsort(kind, amount, sizeof(*kind), compareFunction);\n\n  // 1つ目の種類に関しては絶対カウント1するので1から始める\n  // 同じので固まっていても違うものが出てきて初めてインクリメントなのでこれでOK\n  // たとえ全部同じでも1が正解だし\n  int output = 1;\n\n  // index + 1 との比較になるため、i < amount - 1 が条件\n  for (int i = 0; i < amount - 1; i += 1) {\n    // 並べ替え後の1つ目2つ目...を比較して違っていたらカウントをインクリメント\n    if (strcmp(*(kind + i), *(kind + i + 1)) != 0) {\n      output += 1;\n    }\n  }\n\n  printf(\"%d\", output);\n  printf(\"%c\", '\\n');\n\n  return 0;\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": 1070, "cpu_time_ms": 70, "memory_kb": 5744}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s045154895", "group_id": "codeNet:p02701", "input_text": "#include <stdio.h>\n#include <stdlib.h>\n#include <string.h>\n\nint main(){\n    int n,i,j,count=0,tmp=0;\n    char s[300000][1000]={};\n    char token[1000]={};\n    fgets(token, sizeof(token), stdin);\n    n=atoi(token);\n    for (i=0; i<n; i++) fgets(s[i], sizeof(s[i]), stdin);\n    for (i=0; i<n-1; i++) {\n        tmp=0;\n        for (j=i+1; j<n; j++) {\n            if (strcmp(s[j], s[i])==0){\n                tmp++;\n                break;\n            }\n        }\n        if (tmp==0) count++;\n    }\n    printf(\"%d\",count);\n    return 0;\n}\n", "language": "C", "metadata": {"date": 1587954240, "filename_ext": "c", "original_language": "C (GCC 9.2.1)", "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/C/s045154895.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s045154895", "user_id": "u469867719"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "#include <stdio.h>\n#include <stdlib.h>\n#include <string.h>\n\nint main(){\n    int n,i,j,count=0,tmp=0;\n    char s[300000][1000]={};\n    char token[1000]={};\n    fgets(token, sizeof(token), stdin);\n    n=atoi(token);\n    for (i=0; i<n; i++) fgets(s[i], sizeof(s[i]), stdin);\n    for (i=0; i<n-1; i++) {\n        tmp=0;\n        for (j=i+1; j<n; j++) {\n            if (strcmp(s[j], s[i])==0){\n                tmp++;\n                break;\n            }\n        }\n        if (tmp==0) count++;\n    }\n    printf(\"%d\",count);\n    return 0;\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": 532, "cpu_time_ms": 108, "memory_kb": 1384}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s892336508", "group_id": "codeNet:p02701", "input_text": "#include <stdlib.h>\n#include <stdio.h>\n#include <math.h>\n#include <string.h>\n#include <limits.h>\n\nstatic int cmpfunc(const void *lhs, const void *rhs)\n{\n    return strcmp(lhs, rhs);\n}\n\nint main ()\n{\n  int N;\n  scanf(\"%d\",&N);\n  char S[N][11];\n\n\n  for (int i = 0;i<N;i++)\n  {\n  \tscanf(\"%s\",S[i]);\n\n  }\nqsort(S, N, sizeof(S[0]), cmpfunc);\n int count = 1;\n for (int i = 0;i<N-1;i++)\n {\n \tif (strcmp(S[i],S[i+1])!=0)count++;\n }\n  printf(\"%d\",count);\n\n return 0;\n}\n", "language": "C", "metadata": {"date": 1587951860, "filename_ext": "c", "original_language": "C (GCC 9.2.1)", "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/C/s892336508.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s892336508", "user_id": "u959524814"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "#include <stdlib.h>\n#include <stdio.h>\n#include <math.h>\n#include <string.h>\n#include <limits.h>\n\nstatic int cmpfunc(const void *lhs, const void *rhs)\n{\n    return strcmp(lhs, rhs);\n}\n\nint main ()\n{\n  int N;\n  scanf(\"%d\",&N);\n  char S[N][11];\n\n\n  for (int i = 0;i<N;i++)\n  {\n  \tscanf(\"%s\",S[i]);\n\n  }\nqsort(S, N, sizeof(S[0]), cmpfunc);\n int count = 1;\n for (int i = 0;i<N-1;i++)\n {\n \tif (strcmp(S[i],S[i+1])!=0)count++;\n }\n  printf(\"%d\",count);\n\n return 0;\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": 460, "cpu_time_ms": 67, "memory_kb": 5720}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s982642151", "group_id": "codeNet:p02706", "input_text": "#include<stdio.h>\n\nint main(){\n\n    int day;\n    int homework;\n    int homework_day[10001];\n    int i=0;\n    int homework_day_ruiseki=0;\n    int play=0;\n\n    scanf(\"%d%d\",&day,&homework);\n\n    while(i < homework){\n        scanf(\"%d\",&homework_day[i]);\n        i++;\n    }\n\n    i = 0;\n\n    while(i < homework){\n        homework_day_ruiseki += homework_day[i];\n        i++;   \n    }\n\n    play = day - homework_day_ruiseki;\n\n    if(play <= -1)play = -1;\n    \n    printf(\"%d\\n\",play);\n\n    return 0;\n}", "language": "C", "metadata": {"date": 1587349179, "filename_ext": "c", "original_language": "C (GCC 9.2.1)", "problem_description_relpath": "problem_descriptions/p02706.html", "problem_id": "p02706", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02706/input.txt", "sample_output_relpath": "derived/input_output/data/p02706/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02706/C/s982642151.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s982642151", "user_id": "u445001799"}, "prompt_components": {"gold_output": "30\n", "input_to_evaluate": "#include<stdio.h>\n\nint main(){\n\n    int day;\n    int homework;\n    int homework_day[10001];\n    int i=0;\n    int homework_day_ruiseki=0;\n    int play=0;\n\n    scanf(\"%d%d\",&day,&homework);\n\n    while(i < homework){\n        scanf(\"%d\",&homework_day[i]);\n        i++;\n    }\n\n    i = 0;\n\n    while(i < homework){\n        homework_day_ruiseki += homework_day[i];\n        i++;   \n    }\n\n    play = day - homework_day_ruiseki;\n\n    if(play <= -1)play = -1;\n    \n    printf(\"%d\\n\",play);\n\n    return 0;\n}", "problem_context": "Score : 200 points\n\nProblem Statement\n\nTakahashi has N days of summer vacation.\n\nHis teacher gave him M summer assignments. It will take A_i days for him to do the i-th assignment.\n\nHe cannot do multiple assignments on the same day, or hang out on a day he does an assignment.\n\nWhat is the maximum number of days Takahashi can hang out during the vacation if he finishes all the assignments during this vacation?\n\nIf Takahashi cannot finish all the assignments during the vacation, print -1 instead.\n\nConstraints\n\n1 \\leq N \\leq 10^6\n\n1 \\leq M \\leq 10^4\n\n1 \\leq A_i \\leq 10^4\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nA_1 ... A_M\n\nOutput\n\nPrint the maximum number of days Takahashi can hang out during the vacation, or -1.\n\nSample Input 1\n\n41 2\n5 6\n\nSample Output 1\n\n30\n\nFor example, he can do the first assignment on the first 5 days, hang out on the next 30 days, and do the second assignment on the last 6 days of the vacation. In this way, he can safely spend 30 days hanging out.\n\nSample Input 2\n\n10 2\n5 6\n\nSample Output 2\n\n-1\n\nHe cannot finish his assignments.\n\nSample Input 3\n\n11 2\n5 6\n\nSample Output 3\n\n0\n\nHe can finish his assignments, but he will have no time to hang out.\n\nSample Input 4\n\n314 15\n9 26 5 35 8 9 79 3 23 8 46 2 6 43 3\n\nSample Output 4\n\n9", "sample_input": "41 2\n5 6\n"}, "reference_outputs": ["30\n"], "source_document_id": "p02706", "source_text": "Score : 200 points\n\nProblem Statement\n\nTakahashi has N days of summer vacation.\n\nHis teacher gave him M summer assignments. It will take A_i days for him to do the i-th assignment.\n\nHe cannot do multiple assignments on the same day, or hang out on a day he does an assignment.\n\nWhat is the maximum number of days Takahashi can hang out during the vacation if he finishes all the assignments during this vacation?\n\nIf Takahashi cannot finish all the assignments during the vacation, print -1 instead.\n\nConstraints\n\n1 \\leq N \\leq 10^6\n\n1 \\leq M \\leq 10^4\n\n1 \\leq A_i \\leq 10^4\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nA_1 ... A_M\n\nOutput\n\nPrint the maximum number of days Takahashi can hang out during the vacation, or -1.\n\nSample Input 1\n\n41 2\n5 6\n\nSample Output 1\n\n30\n\nFor example, he can do the first assignment on the first 5 days, hang out on the next 30 days, and do the second assignment on the last 6 days of the vacation. In this way, he can safely spend 30 days hanging out.\n\nSample Input 2\n\n10 2\n5 6\n\nSample Output 2\n\n-1\n\nHe cannot finish his assignments.\n\nSample Input 3\n\n11 2\n5 6\n\nSample Output 3\n\n0\n\nHe can finish his assignments, but he will have no time to hang out.\n\nSample Input 4\n\n314 15\n9 26 5 35 8 9 79 3 23 8 46 2 6 43 3\n\nSample Output 4\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": 496, "cpu_time_ms": 3, "memory_kb": 1768}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s494944700", "group_id": "codeNet:p02706", "input_text": "#include<stdio.h>\nint main() {\n\tint N, M,i,AM;\n\tint A[1000];\n\n\tscanf(\"%d\", &N);\n\tscanf(\"%d\", &M);\n\tfor (i = 0; i < M; i++) {\n\t\tscanf(\"%d\",&A[i]);\n\t}\n  for(i=0;i<M;i++){\n    AM+=A[i];\n    }\n  if(AM==0){\n    printf(\"0\");\n  }\n  \n  if(AM>N){      \n      printf(\"-1\");\n  }\n  if(AM<N){\n    printf(\"%d\",N-AM);\n  }\n  return 0;\n}", "language": "C", "metadata": {"date": 1587347013, "filename_ext": "c", "original_language": "C (GCC 9.2.1)", "problem_description_relpath": "problem_descriptions/p02706.html", "problem_id": "p02706", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02706/input.txt", "sample_output_relpath": "derived/input_output/data/p02706/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02706/C/s494944700.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s494944700", "user_id": "u304563268"}, "prompt_components": {"gold_output": "30\n", "input_to_evaluate": "#include<stdio.h>\nint main() {\n\tint N, M,i,AM;\n\tint A[1000];\n\n\tscanf(\"%d\", &N);\n\tscanf(\"%d\", &M);\n\tfor (i = 0; i < M; i++) {\n\t\tscanf(\"%d\",&A[i]);\n\t}\n  for(i=0;i<M;i++){\n    AM+=A[i];\n    }\n  if(AM==0){\n    printf(\"0\");\n  }\n  \n  if(AM>N){      \n      printf(\"-1\");\n  }\n  if(AM<N){\n    printf(\"%d\",N-AM);\n  }\n  return 0;\n}", "problem_context": "Score : 200 points\n\nProblem Statement\n\nTakahashi has N days of summer vacation.\n\nHis teacher gave him M summer assignments. It will take A_i days for him to do the i-th assignment.\n\nHe cannot do multiple assignments on the same day, or hang out on a day he does an assignment.\n\nWhat is the maximum number of days Takahashi can hang out during the vacation if he finishes all the assignments during this vacation?\n\nIf Takahashi cannot finish all the assignments during the vacation, print -1 instead.\n\nConstraints\n\n1 \\leq N \\leq 10^6\n\n1 \\leq M \\leq 10^4\n\n1 \\leq A_i \\leq 10^4\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nA_1 ... A_M\n\nOutput\n\nPrint the maximum number of days Takahashi can hang out during the vacation, or -1.\n\nSample Input 1\n\n41 2\n5 6\n\nSample Output 1\n\n30\n\nFor example, he can do the first assignment on the first 5 days, hang out on the next 30 days, and do the second assignment on the last 6 days of the vacation. In this way, he can safely spend 30 days hanging out.\n\nSample Input 2\n\n10 2\n5 6\n\nSample Output 2\n\n-1\n\nHe cannot finish his assignments.\n\nSample Input 3\n\n11 2\n5 6\n\nSample Output 3\n\n0\n\nHe can finish his assignments, but he will have no time to hang out.\n\nSample Input 4\n\n314 15\n9 26 5 35 8 9 79 3 23 8 46 2 6 43 3\n\nSample Output 4\n\n9", "sample_input": "41 2\n5 6\n"}, "reference_outputs": ["30\n"], "source_document_id": "p02706", "source_text": "Score : 200 points\n\nProblem Statement\n\nTakahashi has N days of summer vacation.\n\nHis teacher gave him M summer assignments. It will take A_i days for him to do the i-th assignment.\n\nHe cannot do multiple assignments on the same day, or hang out on a day he does an assignment.\n\nWhat is the maximum number of days Takahashi can hang out during the vacation if he finishes all the assignments during this vacation?\n\nIf Takahashi cannot finish all the assignments during the vacation, print -1 instead.\n\nConstraints\n\n1 \\leq N \\leq 10^6\n\n1 \\leq M \\leq 10^4\n\n1 \\leq A_i \\leq 10^4\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nA_1 ... A_M\n\nOutput\n\nPrint the maximum number of days Takahashi can hang out during the vacation, or -1.\n\nSample Input 1\n\n41 2\n5 6\n\nSample Output 1\n\n30\n\nFor example, he can do the first assignment on the first 5 days, hang out on the next 30 days, and do the second assignment on the last 6 days of the vacation. In this way, he can safely spend 30 days hanging out.\n\nSample Input 2\n\n10 2\n5 6\n\nSample Output 2\n\n-1\n\nHe cannot finish his assignments.\n\nSample Input 3\n\n11 2\n5 6\n\nSample Output 3\n\n0\n\nHe can finish his assignments, but he will have no time to hang out.\n\nSample Input 4\n\n314 15\n9 26 5 35 8 9 79 3 23 8 46 2 6 43 3\n\nSample Output 4\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": 320, "cpu_time_ms": 104, "memory_kb": 1736}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s275277034", "group_id": "codeNet:p02706", "input_text": "#include<stdio.h>\n#include<math.h>\nint n,m,all,a[10100];\nint main(){\n\tint i;\n\tscanf(\"%d%d\",&n,&m);\n\tfor(i=1;i<=m;++i){\n\t\tscanf(\"%d\",&a[i]);\n\t\tall+=a[i];\n\t}\n\tif(all>n){\n\t\tprintf(\"-1\");\n\t}\n\telse{\n\t\tprintf(\"%d\",n-all);\n\t}\t\n\treturn 0;\n}", "language": "C", "metadata": {"date": 1587345112, "filename_ext": "c", "original_language": "C (GCC 9.2.1)", "problem_description_relpath": "problem_descriptions/p02706.html", "problem_id": "p02706", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02706/input.txt", "sample_output_relpath": "derived/input_output/data/p02706/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02706/C/s275277034.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s275277034", "user_id": "u864393010"}, "prompt_components": {"gold_output": "30\n", "input_to_evaluate": "#include<stdio.h>\n#include<math.h>\nint n,m,all,a[10100];\nint main(){\n\tint i;\n\tscanf(\"%d%d\",&n,&m);\n\tfor(i=1;i<=m;++i){\n\t\tscanf(\"%d\",&a[i]);\n\t\tall+=a[i];\n\t}\n\tif(all>n){\n\t\tprintf(\"-1\");\n\t}\n\telse{\n\t\tprintf(\"%d\",n-all);\n\t}\t\n\treturn 0;\n}", "problem_context": "Score : 200 points\n\nProblem Statement\n\nTakahashi has N days of summer vacation.\n\nHis teacher gave him M summer assignments. It will take A_i days for him to do the i-th assignment.\n\nHe cannot do multiple assignments on the same day, or hang out on a day he does an assignment.\n\nWhat is the maximum number of days Takahashi can hang out during the vacation if he finishes all the assignments during this vacation?\n\nIf Takahashi cannot finish all the assignments during the vacation, print -1 instead.\n\nConstraints\n\n1 \\leq N \\leq 10^6\n\n1 \\leq M \\leq 10^4\n\n1 \\leq A_i \\leq 10^4\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nA_1 ... A_M\n\nOutput\n\nPrint the maximum number of days Takahashi can hang out during the vacation, or -1.\n\nSample Input 1\n\n41 2\n5 6\n\nSample Output 1\n\n30\n\nFor example, he can do the first assignment on the first 5 days, hang out on the next 30 days, and do the second assignment on the last 6 days of the vacation. In this way, he can safely spend 30 days hanging out.\n\nSample Input 2\n\n10 2\n5 6\n\nSample Output 2\n\n-1\n\nHe cannot finish his assignments.\n\nSample Input 3\n\n11 2\n5 6\n\nSample Output 3\n\n0\n\nHe can finish his assignments, but he will have no time to hang out.\n\nSample Input 4\n\n314 15\n9 26 5 35 8 9 79 3 23 8 46 2 6 43 3\n\nSample Output 4\n\n9", "sample_input": "41 2\n5 6\n"}, "reference_outputs": ["30\n"], "source_document_id": "p02706", "source_text": "Score : 200 points\n\nProblem Statement\n\nTakahashi has N days of summer vacation.\n\nHis teacher gave him M summer assignments. It will take A_i days for him to do the i-th assignment.\n\nHe cannot do multiple assignments on the same day, or hang out on a day he does an assignment.\n\nWhat is the maximum number of days Takahashi can hang out during the vacation if he finishes all the assignments during this vacation?\n\nIf Takahashi cannot finish all the assignments during the vacation, print -1 instead.\n\nConstraints\n\n1 \\leq N \\leq 10^6\n\n1 \\leq M \\leq 10^4\n\n1 \\leq A_i \\leq 10^4\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nA_1 ... A_M\n\nOutput\n\nPrint the maximum number of days Takahashi can hang out during the vacation, or -1.\n\nSample Input 1\n\n41 2\n5 6\n\nSample Output 1\n\n30\n\nFor example, he can do the first assignment on the first 5 days, hang out on the next 30 days, and do the second assignment on the last 6 days of the vacation. In this way, he can safely spend 30 days hanging out.\n\nSample Input 2\n\n10 2\n5 6\n\nSample Output 2\n\n-1\n\nHe cannot finish his assignments.\n\nSample Input 3\n\n11 2\n5 6\n\nSample Output 3\n\n0\n\nHe can finish his assignments, but he will have no time to hang out.\n\nSample Input 4\n\n314 15\n9 26 5 35 8 9 79 3 23 8 46 2 6 43 3\n\nSample Output 4\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": 232, "cpu_time_ms": 3, "memory_kb": 1768}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s229307497", "group_id": "codeNet:p02707", "input_text": "#include<stdio.h>\n \nint main(void){\n  int N;\n  int b,i;\n  int a[20001] = {0};\n  \n  scanf(\"%d\",&N);\n  for(i=2;i<=N;i++){\n    scanf(\"%d\",&b);\n    a[b]++;\n  }\n for(i=1;i<=N;i++){\n printf(\"%d\\n\",a[i]);\n }\n\n}\n ", "language": "C", "metadata": {"date": 1591639828, "filename_ext": "c", "original_language": "C (GCC 9.2.1)", "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/C/s229307497.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s229307497", "user_id": "u707787998"}, "prompt_components": {"gold_output": "2\n2\n0\n0\n0\n", "input_to_evaluate": "#include<stdio.h>\n \nint main(void){\n  int N;\n  int b,i;\n  int a[20001] = {0};\n  \n  scanf(\"%d\",&N);\n  for(i=2;i<=N;i++){\n    scanf(\"%d\",&b);\n    a[b]++;\n  }\n for(i=1;i<=N;i++){\n printf(\"%d\\n\",a[i]);\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": 205, "cpu_time_ms": 120, "memory_kb": 1744}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s002929096", "group_id": "codeNet:p02707", "input_text": "int a[200010];\nint ans[200010];\nint main(){\nint n;\nscanf(\"%d\",&n);\nfor(int i=2;i<=n;i++)scanf(\"%d\",&a[i]);\nfor(int i=2;i<=n;i++)ans[a[i]]++;\nfor(int i=1;i<=n;i++)printf(\"%d\\n\",ans[i]);\n}", "language": "C", "metadata": {"date": 1587786051, "filename_ext": "c", "original_language": "C (GCC 9.2.1)", "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/C/s002929096.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s002929096", "user_id": "u058320503"}, "prompt_components": {"gold_output": "2\n2\n0\n0\n0\n", "input_to_evaluate": "int a[200010];\nint ans[200010];\nint main(){\nint n;\nscanf(\"%d\",&n);\nfor(int i=2;i<=n;i++)scanf(\"%d\",&a[i]);\nfor(int i=2;i<=n;i++)ans[a[i]]++;\nfor(int i=1;i<=n;i++)printf(\"%d\\n\",ans[i]);\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": 186, "cpu_time_ms": 39, "memory_kb": 3236}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s002666199", "group_id": "codeNet:p02707", "input_text": "#include<stdio.h>\nint main()\n{\n    int a,i,b[200000],c[200000]={0};\n    scanf(\"%d\",&a);\n    for(i=0;i<a-1;i++)\n    {\n        scanf(\"%d\",&b[i]);\n\n    }\n    for(i=0;i<a;i++)\n    {\n        c[b[i]]++;\n    }\n    for(i=1;i<=a;i++)\n    {\n        printf(\"%d\\n\",c[i]);\n    }\n}", "language": "C", "metadata": {"date": 1587349220, "filename_ext": "c", "original_language": "C (GCC 9.2.1)", "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/C/s002666199.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s002666199", "user_id": "u851172143"}, "prompt_components": {"gold_output": "2\n2\n0\n0\n0\n", "input_to_evaluate": "#include<stdio.h>\nint main()\n{\n    int a,i,b[200000],c[200000]={0};\n    scanf(\"%d\",&a);\n    for(i=0;i<a-1;i++)\n    {\n        scanf(\"%d\",&b[i]);\n\n    }\n    for(i=0;i<a;i++)\n    {\n        c[b[i]]++;\n    }\n    for(i=1;i<=a;i++)\n    {\n        printf(\"%d\\n\",c[i]);\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": 267, "cpu_time_ms": 36, "memory_kb": 3276}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s550681031", "group_id": "codeNet:p02707", "input_text": "#include<stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int N;\n    int *A;\n    scanf(\"%d\\n\", &N);\n    \n    A = (int *)malloc((N-1)* sizeof(int));\n  \n   int i=0;\n   while(scanf(\"%d\",&A[i])==1)\n   {\n      i++;\n    }\n  \n   int sum;\n   for(int k=1; k<=N; k++)\n   {\n     sum = 0;\n     for(int j=0; j<(N-1); j++)\n     {\n       if(A[j]==k) \n       {\n         sum ++;\n       }\n       else if(A[j]>k)\n       {\n         break;\n       }\n       \n     }\n     printf(\"%d\\n\",sum);\n   }\n   \n   return 0;\n}", "language": "C", "metadata": {"date": 1587348500, "filename_ext": "c", "original_language": "C (GCC 9.2.1)", "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/C/s550681031.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s550681031", "user_id": "u938085021"}, "prompt_components": {"gold_output": "2\n2\n0\n0\n0\n", "input_to_evaluate": "#include<stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int N;\n    int *A;\n    scanf(\"%d\\n\", &N);\n    \n    A = (int *)malloc((N-1)* sizeof(int));\n  \n   int i=0;\n   while(scanf(\"%d\",&A[i])==1)\n   {\n      i++;\n    }\n  \n   int sum;\n   for(int k=1; k<=N; k++)\n   {\n     sum = 0;\n     for(int j=0; j<(N-1); j++)\n     {\n       if(A[j]==k) \n       {\n         sum ++;\n       }\n       else if(A[j]>k)\n       {\n         break;\n       }\n       \n     }\n     printf(\"%d\\n\",sum);\n   }\n   \n   return 0;\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": 489, "cpu_time_ms": 2205, "memory_kb": 2448}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s552966002", "group_id": "codeNet:p02707", "input_text": "#include <stdio.h>\n\nint main(){\n    int N, buf;\n    scanf(\"%d\", &N);\n    int A[300000] = {};\n    for(int i=0; i<N-1; i++){\n        scanf(\"%d\", &buf);\n        A[buf]++;\n    }\n    for(int i=1; i<=N; i++){\n        printf(\"%d\\n\", A[i]);\n    }\n    return 0;\n}", "language": "C", "metadata": {"date": 1587346993, "filename_ext": "c", "original_language": "C (GCC 9.2.1)", "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/C/s552966002.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s552966002", "user_id": "u271743799"}, "prompt_components": {"gold_output": "2\n2\n0\n0\n0\n", "input_to_evaluate": "#include <stdio.h>\n\nint main(){\n    int N, buf;\n    scanf(\"%d\", &N);\n    int A[300000] = {};\n    for(int i=0; i<N-1; i++){\n        scanf(\"%d\", &buf);\n        A[buf]++;\n    }\n    for(int i=1; i<=N; i++){\n        printf(\"%d\\n\", A[i]);\n    }\n    return 0;\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": 254, "cpu_time_ms": 41, "memory_kb": 2896}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s501443428", "group_id": "codeNet:p02707", "input_text": "#include <stdio.h>\ntypedef long long int lld;\ntypedef unsigned long long int llu;\n#define MAX(x,y) (x > y ? x : y)\n#define MIN(x,y) (x < y ? x : y)\n#define INF (long long int)(9223372036854775807)\n#define IINF (int)(2147483647)\n\nint n, a, s[200000];\n\nint main(void) {\n  scanf(\"%d\", &n);\n  for (int i = 0; i < n - 1; i++) {\n    scanf(\"%d\", &a);\n    s[a - 1]++;\n  }\n  for (int i = 0; i < n; i++) {\n    printf(\"%d\\n\", s[i]);\n  }\n}", "language": "C", "metadata": {"date": 1587344927, "filename_ext": "c", "original_language": "C (GCC 9.2.1)", "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/C/s501443428.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s501443428", "user_id": "u028073448"}, "prompt_components": {"gold_output": "2\n2\n0\n0\n0\n", "input_to_evaluate": "#include <stdio.h>\ntypedef long long int lld;\ntypedef unsigned long long int llu;\n#define MAX(x,y) (x > y ? x : y)\n#define MIN(x,y) (x < y ? x : y)\n#define INF (long long int)(9223372036854775807)\n#define IINF (int)(2147483647)\n\nint n, a, s[200000];\n\nint main(void) {\n  scanf(\"%d\", &n);\n  for (int i = 0; i < n - 1; i++) {\n    scanf(\"%d\", &a);\n    s[a - 1]++;\n  }\n  for (int i = 0; i < n; i++) {\n    printf(\"%d\\n\", s[i]);\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": 427, "cpu_time_ms": 41, "memory_kb": 2508}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s564933435", "group_id": "codeNet:p02708", "input_text": "#include<stdio.h>\n\nint main(void)\n{\n  long long int n,k,sum1=0,sum2=0,sum3=0,i,j;\n  \n  scanf(\"%lld%lld\",&n,&k);\n  \n  for(i=k;i<=n;i++){\n    \n    sum1 = i*(i-1)/2;\n    \n    sum2 = i*(2*n-i+1)/2;\n    \n    sum3+=(sum2-sum1+1);\n  }\n  \n  printf(\"%lld\", sum3%1000000007);\n \n  return 0;\n}\n", "language": "C", "metadata": {"date": 1591646347, "filename_ext": "c", "original_language": "C (GCC 9.2.1)", "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/C/s564933435.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s564933435", "user_id": "u418217648"}, "prompt_components": {"gold_output": "10\n", "input_to_evaluate": "#include<stdio.h>\n\nint main(void)\n{\n  long long int n,k,sum1=0,sum2=0,sum3=0,i,j;\n  \n  scanf(\"%lld%lld\",&n,&k);\n  \n  for(i=k;i<=n;i++){\n    \n    sum1 = i*(i-1)/2;\n    \n    sum2 = i*(2*n-i+1)/2;\n    \n    sum3+=(sum2-sum1+1);\n  }\n  \n  printf(\"%lld\", sum3%1000000007);\n \n  return 0;\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": 282, "cpu_time_ms": 5, "memory_kb": 1732}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s244420862", "group_id": "codeNet:p02708", "input_text": "//set many funcs template\n//Ver.20190820\n#include<stdio.h>\n#include<string.h>\n#include<stdlib.h>\n#include<stdbool.h>\n#include<time.h>\n#include<assert.h>\n#define inf 1072114514\n#define llinf 4154118101919364364\n#define mod 1000000007\n#define pi 3.1415926535897932384\n\nint max(int a,int b){if(a>b){return a;}return b;}\nint min(int a,int b){if(a<b){return a;}return b;}\nint zt(int a,int b){return max(a,b)-min(a,b);}\nint round(int a,int b){if((a%b)*2 >= b){return (a/b)+1;}return a/b;}\nint ceil(int a,int b){if(a%b==0){return a/b;}return (a/b)+1;}\nint gcd(int a,int b){int c;while(b!=0){c=a%b;a=b;b=c;}return a;}\nint lcm(int a,int b){int c=gcd(a,b);a/=c;return a*b;}\nint nCr(int a,int b){int i,r=1;for(i=1;i<=b;i++){r*=(a+1-i);r/=i;}return r;}\nint nHr(int a,int b){return nCr(a+b-1,b);}\nint fact(int a){int i,r=1;for(i=1;i<=a;i++){r*=i;}return r;}\nint pow(int a,int b){int i,r=1;for(i=1;i<=b;i++){r*=a;}return r;}\nint dsum(int x){int r=0;while(x){r+=(x%10);x/=10;}return r;}\nint dsumb(int x,int b){int r=0;while(x){r+=(x%b);x/=b;}return r;}\nint sankaku(int x){return ((1+x)*x)/2;}\nvoid swap(int *a,int *b){int c;c=(*a);(*a)=(*b);(*b)=c;}\nlong long llmax(long long a,long long b){if(a>b){return a;}return b;}\nlong long llmin(long long a,long long b){if(a<b){return a;}return b;}\nlong long llzt(long long a,long long b){return llmax(a,b)-llmin(a,b);}\nlong long llround(long long a,long long b){if((a%b)*2 >= b){return (a/b)+1;}return a/b;}\nlong long llceil(long long a,long long b){if(a%b==0){return a/b;}return (a/b)+1;}\nlong long llgcd(long long a,long long b){long long c;while(b!=0){c=a%b;a=b;b=c;}return a;}\nlong long lllcm(long long a,long long b){long long c=llgcd(a,b);a/=c;return a*b;}\nlong long llnCr(long long a,long long b){long long i,r=1;for(i=1;i<=b;i++){r*=(a+1-i);r/=i;}return r;}\nlong long llnHr(long long a,long long b){return llnCr(a+b-1,b);}\nlong long llfact(long long a){long long i,r=1;for(i=1;i<=a;i++){r*=i;}return r;}\nlong long llpow(long long a,long long b){long long i,r=1;for(i=1;i<=b;i++){r*=a;}return r;}\nlong long lldsum(long long x){long long r=0;while(x){r+=(x%10);x/=10;}return r;}\nlong long lldsumb(long long x,long long b){long long r=0;while(x){r+=(x%b);x/=b;}return r;}\nlong long llsankaku(long long x){return ((1+x)*x)/2;}\nvoid llswap(long long *a,long long *b){long long c;c=(*a);(*a)=(*b);(*b)=c;}\ndouble dbmax(double a,double b){if(a>b){return a;}return b;}\ndouble dbmin(double a,double b){if(a<b){return a;}return b;}\ndouble dbzt(double a,double b){return dbmax(a,b)-dbmin(a,b);}\nvoid dbswap(double *a,double *b){double c;c=(*a);(*a)=(*b);(*b)=c;}\nvoid chswap(char *a,char *b){char c;c=(*a);(*a)=(*b);(*b)=c;}\nint sortfncsj(const void *a,const void *b){if(*(int *)a>*(int *)b){return 1;}if(*(int *)a==*(int *)b){return 0;}return -1;}\nint sortfnckj(const void *a,const void *b){if(*(int *)a<*(int *)b){return 1;}if(*(int *)a==*(int *)b){return 0;}return -1;}\nint llsortfncsj(const void *a,const void *b){if(*(long long *)a>*(long long *)b){return 1;}if(*(long long *)a==*(long long *)b){return 0;}return -1;}\nint llsortfnckj(const void *a,const void *b){if(*(long long *)a<*(long long *)b){return 1;}if(*(long long *)a==*(long long *)b){return 0;}return -1;}\nint dbsortfncsj(const void *a,const void *b){if(*(double *)a>*(double *)b){return 1;}if(*(double *)a==*(double *)b){return 0;}return -1;}\nint dbsortfnckj(const void *a,const void *b){if(*(double *)a<*(double *)b){return 1;}if(*(double *)a==*(double *)b){return 0;}return -1;}\nint strsortfncsj(const void *a,const void *b){return strcmp((char *)a,(char *)b);}\nint strsortfnckj(const void *a,const void *b){return strcmp((char *)b,(char *)a);}\nint chsortfncsj(const void *a,const void *b){if(*(char *)a>*(char *)b){return 1;}if(*(char *)a==*(char *)b){return 0;}return -1;}\nint chsortfnckj(const void *a,const void *b){if(*(char *)a<*(char *)b){return 1;}if(*(char *)a==*(char *)b){return 0;}return -1;}\n\nvoid shuffledget(int x[],int n){\n    int i,b[524288],p,c;\n    for(i=0;i<n;i++){\n        b[i]=i;\n    }\n    for(i=n;i>=1;i--){\n        p=rand()%i;\n        c=b[i-1];b[i-1]=b[p];b[p]=c;\n    }\n    for(i=0;i<n;i++){\n        scanf(\"%d\",&x[b[i]]);\n    }\n}\n\nint dx4[4]={1,-1,0,0};\nint dy4[4]={0,0,1,-1};\nint dx8[8]={-1,-1,-1,0,0,1,1,1};\nint dy8[8]={-1,0,1,-1,1,-1,0,1};\n\nint search(int x,int a[],int n){\n    int st=0,fi=n-1,te;\n    while(st<=fi){\n        te=(st+fi)/2;\n        if(a[te]<x){st=te+1;}else{fi=te-1;}\n    }\n    return st;\n}\n\nvoid prarr(int arr[],int n){\n  int i;\n  for(i=0;i<n;i++){\n    if(i){printf(\" \");}\n    printf(\"%d\",arr[i]);\n  }\n  printf(\"\\n\");\n  return;\n}\n\nvoid getperm(int a[],int n){\n  int i,p;\n  for(i=0;i<n;i++){\n    a[i]=i;\n  }\n  for(i=n-1;i>=1;i--){\n    p=rand()%(i+1);\n    swap(&a[p],&a[i]);\n  }\n}\n\ntypedef struct{\nint val;\nint node;\n}sd;\n\nint sdsortfnc(const void *a,const void *b){\nif(((sd*)a)->val < ((sd*)b)->val){return -1;}\nif(((sd*)a)->val > ((sd*)b)->val){return 1;}\nreturn 0;\n}\n\nvoid coordinate_comp(int a[],int n){\n  int i,c=0;\n  sd dat[524288];\n  for(i=0;i<n;i++){\n    dat[i].val=a[i];\n    dat[i].node=i;\n  }\n  qsort(dat,n,sizeof(dat[0]),sdsortfnc);\n  a[dat[0].node]=c;\n  for(i=1;i<n;i++){\n    if(dat[i-1].val!=dat[i].val){c++;}\n    a[dat[i].node]=c;\n  }\n}\n\nlong long power(long long a,long long b){\n  long long x=1,y=a;\n  while(b>0){\n    if(b&1ll){\n      x=(x*y)%mod;\n    }\n    y=(y*y)%mod;\n    b>>=1;\n  }\n  return x%mod;\n}\n\nlong long modular_inverse(long long n){\n  return power(n,mod-2);\n}\n\nlong long factorial[524288];\nlong long invfact[524288];\n\nvoid cfact(){\n  long long i;\n  factorial[0]=1;\n  factorial[1]=1;\n  for(i=2;i<524288;i++){\n    factorial[i]=factorial[i-1]*i;\n    factorial[i]%=mod;\n  }\n  invfact[524287]=modular_inverse(factorial[524287]);\n  for(i=524286;i>=0;i--){\n    invfact[i]=invfact[i+1]*(i+1);\n    invfact[i]%=mod;\n  }\n}\n\nlong long calcnCr(long long n,long long k){\n  if(k<0 || n<k){return 0;}\n  return (factorial[n]*((invfact[k]*invfact[n-k])%mod))%mod;\n}\n\nint main(void){\n  cfact();\n  long long i,j,n,m,k,a[524288],b,c,h,w,r=0,l,t;\n  long long st,fi;\n  scanf(\"%lld%lld\",&n,&k);\n  for(i=k;i<=n+1;i++){\n    st=llsankaku(i-1);\n    fi=llsankaku(n)-llsankaku(n-i);\n    //printf(\"%lld %lld\\n\",st,fi);\n    r+=(fi-st)+1;\n    r%=mod;\n  }\n  printf(\"%lld\\n\",r);\n  return 0;\n}\n", "language": "C", "metadata": {"date": 1587345140, "filename_ext": "c", "original_language": "C (GCC 9.2.1)", "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/C/s244420862.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s244420862", "user_id": "u721060623"}, "prompt_components": {"gold_output": "10\n", "input_to_evaluate": "//set many funcs template\n//Ver.20190820\n#include<stdio.h>\n#include<string.h>\n#include<stdlib.h>\n#include<stdbool.h>\n#include<time.h>\n#include<assert.h>\n#define inf 1072114514\n#define llinf 4154118101919364364\n#define mod 1000000007\n#define pi 3.1415926535897932384\n\nint max(int a,int b){if(a>b){return a;}return b;}\nint min(int a,int b){if(a<b){return a;}return b;}\nint zt(int a,int b){return max(a,b)-min(a,b);}\nint round(int a,int b){if((a%b)*2 >= b){return (a/b)+1;}return a/b;}\nint ceil(int a,int b){if(a%b==0){return a/b;}return (a/b)+1;}\nint gcd(int a,int b){int c;while(b!=0){c=a%b;a=b;b=c;}return a;}\nint lcm(int a,int b){int c=gcd(a,b);a/=c;return a*b;}\nint nCr(int a,int b){int i,r=1;for(i=1;i<=b;i++){r*=(a+1-i);r/=i;}return r;}\nint nHr(int a,int b){return nCr(a+b-1,b);}\nint fact(int a){int i,r=1;for(i=1;i<=a;i++){r*=i;}return r;}\nint pow(int a,int b){int i,r=1;for(i=1;i<=b;i++){r*=a;}return r;}\nint dsum(int x){int r=0;while(x){r+=(x%10);x/=10;}return r;}\nint dsumb(int x,int b){int r=0;while(x){r+=(x%b);x/=b;}return r;}\nint sankaku(int x){return ((1+x)*x)/2;}\nvoid swap(int *a,int *b){int c;c=(*a);(*a)=(*b);(*b)=c;}\nlong long llmax(long long a,long long b){if(a>b){return a;}return b;}\nlong long llmin(long long a,long long b){if(a<b){return a;}return b;}\nlong long llzt(long long a,long long b){return llmax(a,b)-llmin(a,b);}\nlong long llround(long long a,long long b){if((a%b)*2 >= b){return (a/b)+1;}return a/b;}\nlong long llceil(long long a,long long b){if(a%b==0){return a/b;}return (a/b)+1;}\nlong long llgcd(long long a,long long b){long long c;while(b!=0){c=a%b;a=b;b=c;}return a;}\nlong long lllcm(long long a,long long b){long long c=llgcd(a,b);a/=c;return a*b;}\nlong long llnCr(long long a,long long b){long long i,r=1;for(i=1;i<=b;i++){r*=(a+1-i);r/=i;}return r;}\nlong long llnHr(long long a,long long b){return llnCr(a+b-1,b);}\nlong long llfact(long long a){long long i,r=1;for(i=1;i<=a;i++){r*=i;}return r;}\nlong long llpow(long long a,long long b){long long i,r=1;for(i=1;i<=b;i++){r*=a;}return r;}\nlong long lldsum(long long x){long long r=0;while(x){r+=(x%10);x/=10;}return r;}\nlong long lldsumb(long long x,long long b){long long r=0;while(x){r+=(x%b);x/=b;}return r;}\nlong long llsankaku(long long x){return ((1+x)*x)/2;}\nvoid llswap(long long *a,long long *b){long long c;c=(*a);(*a)=(*b);(*b)=c;}\ndouble dbmax(double a,double b){if(a>b){return a;}return b;}\ndouble dbmin(double a,double b){if(a<b){return a;}return b;}\ndouble dbzt(double a,double b){return dbmax(a,b)-dbmin(a,b);}\nvoid dbswap(double *a,double *b){double c;c=(*a);(*a)=(*b);(*b)=c;}\nvoid chswap(char *a,char *b){char c;c=(*a);(*a)=(*b);(*b)=c;}\nint sortfncsj(const void *a,const void *b){if(*(int *)a>*(int *)b){return 1;}if(*(int *)a==*(int *)b){return 0;}return -1;}\nint sortfnckj(const void *a,const void *b){if(*(int *)a<*(int *)b){return 1;}if(*(int *)a==*(int *)b){return 0;}return -1;}\nint llsortfncsj(const void *a,const void *b){if(*(long long *)a>*(long long *)b){return 1;}if(*(long long *)a==*(long long *)b){return 0;}return -1;}\nint llsortfnckj(const void *a,const void *b){if(*(long long *)a<*(long long *)b){return 1;}if(*(long long *)a==*(long long *)b){return 0;}return -1;}\nint dbsortfncsj(const void *a,const void *b){if(*(double *)a>*(double *)b){return 1;}if(*(double *)a==*(double *)b){return 0;}return -1;}\nint dbsortfnckj(const void *a,const void *b){if(*(double *)a<*(double *)b){return 1;}if(*(double *)a==*(double *)b){return 0;}return -1;}\nint strsortfncsj(const void *a,const void *b){return strcmp((char *)a,(char *)b);}\nint strsortfnckj(const void *a,const void *b){return strcmp((char *)b,(char *)a);}\nint chsortfncsj(const void *a,const void *b){if(*(char *)a>*(char *)b){return 1;}if(*(char *)a==*(char *)b){return 0;}return -1;}\nint chsortfnckj(const void *a,const void *b){if(*(char *)a<*(char *)b){return 1;}if(*(char *)a==*(char *)b){return 0;}return -1;}\n\nvoid shuffledget(int x[],int n){\n    int i,b[524288],p,c;\n    for(i=0;i<n;i++){\n        b[i]=i;\n    }\n    for(i=n;i>=1;i--){\n        p=rand()%i;\n        c=b[i-1];b[i-1]=b[p];b[p]=c;\n    }\n    for(i=0;i<n;i++){\n        scanf(\"%d\",&x[b[i]]);\n    }\n}\n\nint dx4[4]={1,-1,0,0};\nint dy4[4]={0,0,1,-1};\nint dx8[8]={-1,-1,-1,0,0,1,1,1};\nint dy8[8]={-1,0,1,-1,1,-1,0,1};\n\nint search(int x,int a[],int n){\n    int st=0,fi=n-1,te;\n    while(st<=fi){\n        te=(st+fi)/2;\n        if(a[te]<x){st=te+1;}else{fi=te-1;}\n    }\n    return st;\n}\n\nvoid prarr(int arr[],int n){\n  int i;\n  for(i=0;i<n;i++){\n    if(i){printf(\" \");}\n    printf(\"%d\",arr[i]);\n  }\n  printf(\"\\n\");\n  return;\n}\n\nvoid getperm(int a[],int n){\n  int i,p;\n  for(i=0;i<n;i++){\n    a[i]=i;\n  }\n  for(i=n-1;i>=1;i--){\n    p=rand()%(i+1);\n    swap(&a[p],&a[i]);\n  }\n}\n\ntypedef struct{\nint val;\nint node;\n}sd;\n\nint sdsortfnc(const void *a,const void *b){\nif(((sd*)a)->val < ((sd*)b)->val){return -1;}\nif(((sd*)a)->val > ((sd*)b)->val){return 1;}\nreturn 0;\n}\n\nvoid coordinate_comp(int a[],int n){\n  int i,c=0;\n  sd dat[524288];\n  for(i=0;i<n;i++){\n    dat[i].val=a[i];\n    dat[i].node=i;\n  }\n  qsort(dat,n,sizeof(dat[0]),sdsortfnc);\n  a[dat[0].node]=c;\n  for(i=1;i<n;i++){\n    if(dat[i-1].val!=dat[i].val){c++;}\n    a[dat[i].node]=c;\n  }\n}\n\nlong long power(long long a,long long b){\n  long long x=1,y=a;\n  while(b>0){\n    if(b&1ll){\n      x=(x*y)%mod;\n    }\n    y=(y*y)%mod;\n    b>>=1;\n  }\n  return x%mod;\n}\n\nlong long modular_inverse(long long n){\n  return power(n,mod-2);\n}\n\nlong long factorial[524288];\nlong long invfact[524288];\n\nvoid cfact(){\n  long long i;\n  factorial[0]=1;\n  factorial[1]=1;\n  for(i=2;i<524288;i++){\n    factorial[i]=factorial[i-1]*i;\n    factorial[i]%=mod;\n  }\n  invfact[524287]=modular_inverse(factorial[524287]);\n  for(i=524286;i>=0;i--){\n    invfact[i]=invfact[i+1]*(i+1);\n    invfact[i]%=mod;\n  }\n}\n\nlong long calcnCr(long long n,long long k){\n  if(k<0 || n<k){return 0;}\n  return (factorial[n]*((invfact[k]*invfact[n-k])%mod))%mod;\n}\n\nint main(void){\n  cfact();\n  long long i,j,n,m,k,a[524288],b,c,h,w,r=0,l,t;\n  long long st,fi;\n  scanf(\"%lld%lld\",&n,&k);\n  for(i=k;i<=n+1;i++){\n    st=llsankaku(i-1);\n    fi=llsankaku(n)-llsankaku(n-i);\n    //printf(\"%lld %lld\\n\",st,fi);\n    r+=(fi-st)+1;\n    r%=mod;\n  }\n  printf(\"%lld\\n\",r);\n  return 0;\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": 6220, "cpu_time_ms": 17, "memory_kb": 9928}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s689137204", "group_id": "codeNet:p02709", "input_text": "#include <stdio.h>\n#include <math.h>\n#include <stdlib.h>\ntypedef long long ll;\nint compare_int(const void* a, const void* b){\n\t\treturn *(int*)b - *(int*)a;\n}\n\nint LorR(ll left, ll right, ll n) {\n\tif (right +left >= n*2) { return 1; }\n\telse { return 0; }//遠い方を指す\n}\n\nint main() {\n\tll i, n, l, r, a[2020][2];//活発度,元々いた座標\n\tll ans=0;\n\tfor (i = 0; i < 2020; i++) { a[i][0] = 0; a[i][1] = 0; }\n\tscanf(\"%lld\", &n);\n\tfor (i = 1; i <= n; i++) {\n\t\ta[i][1] = i;\n\t\tscanf(\"%lld\", &a[i][0]);\n\t}\n\tqsort(a, n, sizeof(a[0]), compare_int);\n\tl = 0; r = n+1;\n\tfor (i = 1; i <= n; i++) {\n\t\tif (LorR(l, r, a[i][1]) == 1) {\n\t\t\tans += a[i][0] * (r - 1 - a[i][1]);\n\t\t\tr--;\n\t\t}\n\t\telse {\n\t\t\tans += a[i][0] * (a[i][1] - l + 1);\n\t\t\tl++;\n\t\t}\n\t}\n\tprintf(\"20\", ans);\n}", "language": "C", "metadata": {"date": 1587349962, "filename_ext": "c", "original_language": "C (GCC 9.2.1)", "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/C/s689137204.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s689137204", "user_id": "u333114422"}, "prompt_components": {"gold_output": "20\n", "input_to_evaluate": "#include <stdio.h>\n#include <math.h>\n#include <stdlib.h>\ntypedef long long ll;\nint compare_int(const void* a, const void* b){\n\t\treturn *(int*)b - *(int*)a;\n}\n\nint LorR(ll left, ll right, ll n) {\n\tif (right +left >= n*2) { return 1; }\n\telse { return 0; }//遠い方を指す\n}\n\nint main() {\n\tll i, n, l, r, a[2020][2];//活発度,元々いた座標\n\tll ans=0;\n\tfor (i = 0; i < 2020; i++) { a[i][0] = 0; a[i][1] = 0; }\n\tscanf(\"%lld\", &n);\n\tfor (i = 1; i <= n; i++) {\n\t\ta[i][1] = i;\n\t\tscanf(\"%lld\", &a[i][0]);\n\t}\n\tqsort(a, n, sizeof(a[0]), compare_int);\n\tl = 0; r = n+1;\n\tfor (i = 1; i <= n; i++) {\n\t\tif (LorR(l, r, a[i][1]) == 1) {\n\t\t\tans += a[i][0] * (r - 1 - a[i][1]);\n\t\t\tr--;\n\t\t}\n\t\telse {\n\t\t\tans += a[i][0] * (a[i][1] - l + 1);\n\t\t\tl++;\n\t\t}\n\t}\n\tprintf(\"20\", ans);\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": 765, "cpu_time_ms": 3, "memory_kb": 1788}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s637283474", "group_id": "codeNet:p02712", "input_text": "#include<stdio.h>\n\nint main(void)\n{\n  int n, i;\n  int sum=0;\n  \n  scanf(\"%d\",&n);\n  \n  for(i=1;i<=n;i++){\n    if(i%3==0);\n    else if(i%5==0);\n    else if(i%15==0);\n    else\n      sum=sum+i;\n  }\n  \n  printf(\"%d\",sum);\n  \n  return 0;\n}\n", "language": "C", "metadata": {"date": 1595270355, "filename_ext": "c", "original_language": "C (GCC 9.2.1)", "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/C/s637283474.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s637283474", "user_id": "u625695424"}, "prompt_components": {"gold_output": "60\n", "input_to_evaluate": "#include<stdio.h>\n\nint main(void)\n{\n  int n, i;\n  int sum=0;\n  \n  scanf(\"%d\",&n);\n  \n  for(i=1;i<=n;i++){\n    if(i%3==0);\n    else if(i%5==0);\n    else if(i%15==0);\n    else\n      sum=sum+i;\n  }\n  \n  printf(\"%d\",sum);\n  \n  return 0;\n}\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": 235, "cpu_time_ms": 7, "memory_kb": 1728}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s049789212", "group_id": "codeNet:p02712", "input_text": "#include <stdio.h>\nint main(void){\n  int n,i;\n  long num=0;\n  scanf(\"%d\",&n);\n for(i=1;i<=n;i++){\n   if(i%3!=0 && i%5!=0)\n     num=i+1;\n }\n  printf(\"%ld\\n\",num);\n  return 0;\n}", "language": "C", "metadata": {"date": 1595269324, "filename_ext": "c", "original_language": "C (GCC 9.2.1)", "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/C/s049789212.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s049789212", "user_id": "u495858610"}, "prompt_components": {"gold_output": "60\n", "input_to_evaluate": "#include <stdio.h>\nint main(void){\n  int n,i;\n  long num=0;\n  scanf(\"%d\",&n);\n for(i=1;i<=n;i++){\n   if(i%3!=0 && i%5!=0)\n     num=i+1;\n }\n  printf(\"%ld\\n\",num);\n  return 0;\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": 175, "cpu_time_ms": 8, "memory_kb": 1712}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s993441471", "group_id": "codeNet:p02712", "input_text": "#include <stdio.h>\nsigned main(){\n    int N;\n    int i;\n    long long sum=0;\n    scanf(\"%d\",&N);\n    for(i=1;i<=N;i++){\n        if(i%3!=0){\n            if(i%5!=0){\n              sum+=i;\n            }\n        }\n    }\n    printf(\"%lld\\n\",sum);\n    return(0);\n}", "language": "C", "metadata": {"date": 1593203741, "filename_ext": "c", "original_language": "C (GCC 9.2.1)", "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/C/s993441471.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s993441471", "user_id": "u976853924"}, "prompt_components": {"gold_output": "60\n", "input_to_evaluate": "#include <stdio.h>\nsigned main(){\n    int N;\n    int i;\n    long long sum=0;\n    scanf(\"%d\",&N);\n    for(i=1;i<=N;i++){\n        if(i%3!=0){\n            if(i%5!=0){\n              sum+=i;\n            }\n        }\n    }\n    printf(\"%lld\\n\",sum);\n    return(0);\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": 258, "cpu_time_ms": 7, "memory_kb": 1600}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s340321177", "group_id": "codeNet:p02712", "input_text": "#include <stdio.h>\n\nint main (){\n  long int N,Fizz, Buzz, FizzBuzz, sum;\n  scanf(\"%d\",&N);\n  Fizz = 3*(N/3)*(N/3 + 1)/2;\n  Buzz = 5* (N/5)*(N/5 + 1)/2;\n  FizzBuzz = 15 * (N/15) * (N/15 + 1)/2;\n  sum = N*(N+1)/2-Fizz-Buzz+FizzBuzz;\n  printf(\"%d\",sum);\n  return 0;\n}\n", "language": "C", "metadata": {"date": 1588794427, "filename_ext": "c", "original_language": "C (GCC 9.2.1)", "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/C/s340321177.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s340321177", "user_id": "u907206866"}, "prompt_components": {"gold_output": "60\n", "input_to_evaluate": "#include <stdio.h>\n\nint main (){\n  long int N,Fizz, Buzz, FizzBuzz, sum;\n  scanf(\"%d\",&N);\n  Fizz = 3*(N/3)*(N/3 + 1)/2;\n  Buzz = 5* (N/5)*(N/5 + 1)/2;\n  FizzBuzz = 15 * (N/15) * (N/15 + 1)/2;\n  sum = N*(N+1)/2-Fizz-Buzz+FizzBuzz;\n  printf(\"%d\",sum);\n  return 0;\n}\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": 265, "cpu_time_ms": 3, "memory_kb": 1704}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s053202832", "group_id": "codeNet:p02712", "input_text": "#include<stdio.h>\n\nint main(void)\n{\n    int i,N;\n\n    scanf(\"%d\",&N);\n    long long a=0;\n    for(i=1;i<=N;i++){\n        if((i%3!=0)&&(i%5!=0)) a+=i;}\n    printf(\"%lld\\n\",a);\n    return 0;\n}\n", "language": "C", "metadata": {"date": 1588385873, "filename_ext": "c", "original_language": "C (GCC 9.2.1)", "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/C/s053202832.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s053202832", "user_id": "u868315131"}, "prompt_components": {"gold_output": "60\n", "input_to_evaluate": "#include<stdio.h>\n\nint main(void)\n{\n    int i,N;\n\n    scanf(\"%d\",&N);\n    long long a=0;\n    for(i=1;i<=N;i++){\n        if((i%3!=0)&&(i%5!=0)) a+=i;}\n    printf(\"%lld\\n\",a);\n    return 0;\n}\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": 190, "cpu_time_ms": 2, "memory_kb": 1736}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s624614312", "group_id": "codeNet:p02712", "input_text": "#include<stdio.h>\nint main(void){\n  long int sc,loop,n;\n  long int sum;\n  scanf(\"%ld\",&sc);\n  sum=0;\n  for(loop=1;loop<=sc;loop++){\n    n=loop;\n      if(loop%3==0 || loop%5==0 || loop%15==0){\n          n=0;\n      }\n      sum+=n;\n  }\n  printf(\"%ld\",sum);\n  return 0;\n}", "language": "C", "metadata": {"date": 1586745166, "filename_ext": "c", "original_language": "C (GCC 9.2.1)", "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/C/s624614312.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s624614312", "user_id": "u716903426"}, "prompt_components": {"gold_output": "60\n", "input_to_evaluate": "#include<stdio.h>\nint main(void){\n  long int sc,loop,n;\n  long int sum;\n  scanf(\"%ld\",&sc);\n  sum=0;\n  for(loop=1;loop<=sc;loop++){\n    n=loop;\n      if(loop%3==0 || loop%5==0 || loop%15==0){\n          n=0;\n      }\n      sum+=n;\n  }\n  printf(\"%ld\",sum);\n  return 0;\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": 267, "cpu_time_ms": 7, "memory_kb": 1736}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s616360416", "group_id": "codeNet:p02712", "input_text": "#include <stdio.h>\n#include <stdlib.h>\n \nint main(void){\n    int i;\n    long int j;\n    j = 0;\n    scanf(\"%d\", &i);\n    for(int x=0 ;x<(i/15);x++){\n    j += x*8*15 + 60;    \n    }\n    \n    switch(i%15){\n    case 0:\n    j += 0;\n    break;\n    case 1:\n    j += 1 + (i/15)*15;\n    break;\n    case 2:\n    j += 3 + (i/15)*15*2;\n    break;\n    case 3:\n    j += 3 + (i/15)*15*2;\n    break;\n    case 4:\n    j += 7 + (i/15)*15*3;\n    break;\n    case 5:\n    j += 7 + (i/15)*15*3;\n    break;\n    case 6:\n    j += 7 + (i/15)*15*3;\n    break;\n    case 7:\n    j += 14 + (i/15)*15*4;\n    break;\n    case 8:\n    j += 22 + (i/15)*15*5;\n    break;\n    case 9:\n    j += 22 + (i/15)*15*5;\n    break;\n    case 10:\n    j += 22 + (i/15)*15*5;\n    break;\n    case 11:\n    j += 33 + (i/15)*15*6;\n    break;\n    case 12:\n    j += 33 + (i/15)*15*6;\n    break;\n    case 13:\n    j += 46 + (i/15)*15*7;\n    break;\n    case 14:\n    j += 60 + (i/15)*15*8;\n    break;\n    }\n    \n  printf(\"%ld\",j);\n  return 0;\n}", "language": "C", "metadata": {"date": 1586744269, "filename_ext": "c", "original_language": "C (GCC 9.2.1)", "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/C/s616360416.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s616360416", "user_id": "u537676206"}, "prompt_components": {"gold_output": "60\n", "input_to_evaluate": "#include <stdio.h>\n#include <stdlib.h>\n \nint main(void){\n    int i;\n    long int j;\n    j = 0;\n    scanf(\"%d\", &i);\n    for(int x=0 ;x<(i/15);x++){\n    j += x*8*15 + 60;    \n    }\n    \n    switch(i%15){\n    case 0:\n    j += 0;\n    break;\n    case 1:\n    j += 1 + (i/15)*15;\n    break;\n    case 2:\n    j += 3 + (i/15)*15*2;\n    break;\n    case 3:\n    j += 3 + (i/15)*15*2;\n    break;\n    case 4:\n    j += 7 + (i/15)*15*3;\n    break;\n    case 5:\n    j += 7 + (i/15)*15*3;\n    break;\n    case 6:\n    j += 7 + (i/15)*15*3;\n    break;\n    case 7:\n    j += 14 + (i/15)*15*4;\n    break;\n    case 8:\n    j += 22 + (i/15)*15*5;\n    break;\n    case 9:\n    j += 22 + (i/15)*15*5;\n    break;\n    case 10:\n    j += 22 + (i/15)*15*5;\n    break;\n    case 11:\n    j += 33 + (i/15)*15*6;\n    break;\n    case 12:\n    j += 33 + (i/15)*15*6;\n    break;\n    case 13:\n    j += 46 + (i/15)*15*7;\n    break;\n    case 14:\n    j += 60 + (i/15)*15*8;\n    break;\n    }\n    \n  printf(\"%ld\",j);\n  return 0;\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": 978, "cpu_time_ms": 2, "memory_kb": 1728}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s303573313", "group_id": "codeNet:p02712", "input_text": "#include<stdio.h>\nint main()\n{\n\n    long long int N,i,sum=0;\n    scanf(\"%lld\",&N);\n    for(i=0;i<=N;i++){\n\n        if(i%3 == 0 || i%5 == 0){\n            sum += i;\n        }\n\n\n    }\n    printf(\"%lld\\n\",sum);\n\n\n    return 0;\n\n}\n", "language": "C", "metadata": {"date": 1586742654, "filename_ext": "c", "original_language": "C (GCC 9.2.1)", "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/C/s303573313.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s303573313", "user_id": "u605177939"}, "prompt_components": {"gold_output": "60\n", "input_to_evaluate": "#include<stdio.h>\nint main()\n{\n\n    long long int N,i,sum=0;\n    scanf(\"%lld\",&N);\n    for(i=0;i<=N;i++){\n\n        if(i%3 == 0 || i%5 == 0){\n            sum += i;\n        }\n\n\n    }\n    printf(\"%lld\\n\",sum);\n\n\n    return 0;\n\n}\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": 226, "cpu_time_ms": 3, "memory_kb": 1732}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s497101614", "group_id": "codeNet:p02712", "input_text": "#include <stdio.h>\n\nint main(){\n   int i,n;\n   long s;\n\n   scanf(\"%d\",&n);\n   s=0;\n   for (i=1;i<=n;i++) \n   if (i%3==0 || i%5==0) continue;\n   else                  s+=i;\n   printf(\"%ld\\n\",s);\n   return 0;\n}\n", "language": "C", "metadata": {"date": 1586741036, "filename_ext": "c", "original_language": "C (GCC 9.2.1)", "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/C/s497101614.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s497101614", "user_id": "u337657882"}, "prompt_components": {"gold_output": "60\n", "input_to_evaluate": "#include <stdio.h>\n\nint main(){\n   int i,n;\n   long s;\n\n   scanf(\"%d\",&n);\n   s=0;\n   for (i=1;i<=n;i++) \n   if (i%3==0 || i%5==0) continue;\n   else                  s+=i;\n   printf(\"%ld\\n\",s);\n   return 0;\n}\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": 209, "cpu_time_ms": 6, "memory_kb": 1736}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s146807561", "group_id": "codeNet:p02712", "input_text": "#include <stdio.h>\n\ntypedef unsigned long long int ULLI;\n\nint main()\n{\n\tint n;\n\tULLI sum = 0;\n\n\tscanf(\"%d\", &n);\n\n\tfor (int i = 1; i <= n; i++) {\n\t\tif (i % 15 != 0 && i % 5 != 0 && i % 3 != 0)\n\t\t\tsum += i;\n\t}\n\n\tprintf(\"%llu\\n\", sum);\n\n\treturn 0;\n}", "language": "C", "metadata": {"date": 1586740176, "filename_ext": "c", "original_language": "C (GCC 9.2.1)", "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/C/s146807561.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s146807561", "user_id": "u500731720"}, "prompt_components": {"gold_output": "60\n", "input_to_evaluate": "#include <stdio.h>\n\ntypedef unsigned long long int ULLI;\n\nint main()\n{\n\tint n;\n\tULLI sum = 0;\n\n\tscanf(\"%d\", &n);\n\n\tfor (int i = 1; i <= n; i++) {\n\t\tif (i % 15 != 0 && i % 5 != 0 && i % 3 != 0)\n\t\t\tsum += i;\n\t}\n\n\tprintf(\"%llu\\n\", sum);\n\n\treturn 0;\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": 247, "cpu_time_ms": 8, "memory_kb": 1728}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s712089453", "group_id": "codeNet:p02719", "input_text": " #include<stdio.h>\n int main(void)\n {\n     int N,K,s,t;\n     scanf(\"%d%d\",&N,&K);\n     if(N%K==0) printf(\"0\\n\");\n\n     if(N%K!=0){\n      while(N>K)\n       N+=-K;\n\n     if(N<K-N) printf(\"%d\\n\",N);\n     else    printf(\"%d\\n\",K-N);\n     }\n\n     return 0;\n }\n", "language": "C", "metadata": {"date": 1587820194, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "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/C/s712089453.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s712089453", "user_id": "u670199931"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": " #include<stdio.h>\n int main(void)\n {\n     int N,K,s,t;\n     scanf(\"%d%d\",&N,&K);\n     if(N%K==0) printf(\"0\\n\");\n\n     if(N%K!=0){\n      while(N>K)\n       N+=-K;\n\n     if(N<K-N) printf(\"%d\\n\",N);\n     else    printf(\"%d\\n\",K-N);\n     }\n\n     return 0;\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": 255, "cpu_time_ms": 68, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s785692400", "group_id": "codeNet:p02719", "input_text": "#include <stdio.h>\nlong chan(long a,long b){\n    if (a > b)\n    {\n        return a - b;\n        \n    }\n    else\n        return b - a;\n}\n\nint main()\n{\n    long a, b,c;\n    scanf(\"%ld %ld\", &a, &b);\n    if(b==1){\n        a = 1;\n    }\n    else if (a>chan(a, b)){\n        while (1)\n        {\n            c = chan(a, b);\n            if(c>=a)\n                break;\n            else\n                a = c;\n        }\n    }\n    if(a==b)\n        a = 0;\n    printf(\"%ld\\n\", a);\n}", "language": "C", "metadata": {"date": 1586051783, "filename_ext": "c", "original_language": "C (Clang 3.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/C/s785692400.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s785692400", "user_id": "u224085427"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "#include <stdio.h>\nlong chan(long a,long b){\n    if (a > b)\n    {\n        return a - b;\n        \n    }\n    else\n        return b - a;\n}\n\nint main()\n{\n    long a, b,c;\n    scanf(\"%ld %ld\", &a, &b);\n    if(b==1){\n        a = 1;\n    }\n    else if (a>chan(a, b)){\n        while (1)\n        {\n            c = chan(a, b);\n            if(c>=a)\n                break;\n            else\n                a = c;\n        }\n    }\n    if(a==b)\n        a = 0;\n    printf(\"%ld\\n\", a);\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": 469, "cpu_time_ms": 2103, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s455364956", "group_id": "codeNet:p02720", "input_text": "#include<stdio.h>\nint main(){\n    int k, head = 1, tail = 10;\n    long long x, p, queue[k + 1];\n    for(int i = 1; i < 10; i++) queue[i] = i;\n    scanf(\"%d\",&k);\n  \tif (k < 10){\n      printf(\"%d\\n\",k);\n      return 0;\n    }\n    while (tail <= k){\n        x = queue[head++];\n        p = x % 10;\n        if (p != 0) queue[tail++] = 10 * x + p - 1;\n        queue[tail++] = 10 * x + p;\n        if (p != 9) queue[tail++] = 10 * x + p + 1;\n    }\n    printf(\"%lld\\n\",queue[k]);\n    return 0;\n}", "language": "C", "metadata": {"date": 1586064426, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "problem_description_relpath": "problem_descriptions/p02720.html", "problem_id": "p02720", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02720/input.txt", "sample_output_relpath": "derived/input_output/data/p02720/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02720/C/s455364956.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s455364956", "user_id": "u188486233"}, "prompt_components": {"gold_output": "23\n", "input_to_evaluate": "#include<stdio.h>\nint main(){\n    int k, head = 1, tail = 10;\n    long long x, p, queue[k + 1];\n    for(int i = 1; i < 10; i++) queue[i] = i;\n    scanf(\"%d\",&k);\n  \tif (k < 10){\n      printf(\"%d\\n\",k);\n      return 0;\n    }\n    while (tail <= k){\n        x = queue[head++];\n        p = x % 10;\n        if (p != 0) queue[tail++] = 10 * x + p - 1;\n        queue[tail++] = 10 * x + p;\n        if (p != 9) queue[tail++] = 10 * x + p + 1;\n    }\n    printf(\"%lld\\n\",queue[k]);\n    return 0;\n}", "problem_context": "Score : 400 points\n\nProblem Statement\n\nA positive integer X is said to be a lunlun number if and only if the following condition is satisfied:\n\nIn the base ten representation of X (without leading zeros), for every pair of two adjacent digits, the absolute difference of those digits is at most 1.\n\nFor example, 1234, 1, and 334 are lunlun numbers, while none of 31415, 119, or 13579 is.\n\nYou are given a positive integer K. Find the K-th smallest lunlun number.\n\nConstraints\n\n1 \\leq K \\leq 10^5\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nK\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n15\n\nSample Output 1\n\n23\n\nWe will list the 15 smallest lunlun numbers in ascending order:\n\n1,\n2,\n3,\n4,\n5,\n6,\n7,\n8,\n9,\n10,\n11,\n12,\n21,\n22,\n23.\n\nThus, the answer is 23.\n\nSample Input 2\n\n1\n\nSample Output 2\n\n1\n\nSample Input 3\n\n13\n\nSample Output 3\n\n21\n\nSample Input 4\n\n100000\n\nSample Output 4\n\n3234566667\n\nNote that the answer may not fit into the 32-bit signed integer type.", "sample_input": "15\n"}, "reference_outputs": ["23\n"], "source_document_id": "p02720", "source_text": "Score : 400 points\n\nProblem Statement\n\nA positive integer X is said to be a lunlun number if and only if the following condition is satisfied:\n\nIn the base ten representation of X (without leading zeros), for every pair of two adjacent digits, the absolute difference of those digits is at most 1.\n\nFor example, 1234, 1, and 334 are lunlun numbers, while none of 31415, 119, or 13579 is.\n\nYou are given a positive integer K. Find the K-th smallest lunlun number.\n\nConstraints\n\n1 \\leq K \\leq 10^5\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nK\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n15\n\nSample Output 1\n\n23\n\nWe will list the 15 smallest lunlun numbers in ascending order:\n\n1,\n2,\n3,\n4,\n5,\n6,\n7,\n8,\n9,\n10,\n11,\n12,\n21,\n22,\n23.\n\nThus, the answer is 23.\n\nSample Input 2\n\n1\n\nSample Output 2\n\n1\n\nSample Input 3\n\n13\n\nSample Output 3\n\n21\n\nSample Input 4\n\n100000\n\nSample Output 4\n\n3234566667\n\nNote that the answer may not fit into the 32-bit signed 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": 486, "cpu_time_ms": 99, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s790700030", "group_id": "codeNet:p02721", "input_text": "#include<stdio.h>\n#define N_MAX 200000\n\nint hantei(long a,long b[],long c){\n  for(long y=0;y<c;y++){\n    if(b[y]==a)return 0;\n  };\n  return 1;\n};\n\nint main(){\n  int magic=1;\n  long N,K,C,m,p=0;\n  char kago;\n  char S[N_MAX]={};\n  long hako[N_MAX]={};\n  scanf(\"%ld %ld %ld\",&N,&K,&C);\n  scanf(\"%s\",S);\n  for(long a=0;a<N;a++){\n    if(magic==0){\n      if(hantei(a,hako,K))continue;\n    };\n    printf(\"%ld日目を検査中\\n\",a+1);\n    kago=S[a];\n    S[a]='x';\n    m=0;\n    while(m<=K){\n      if(m==K){\n        if(magic)magic--;\n        break;\n      };\n      if(p>N-1){\n        printf(\"%ld\\n\",a+1);\n        break;\n      }\n      else if(S[p]=='o'){\n       if(magic)hako[m]=p;\n        p+=C+1;\n        m++;\n      }\n      else if(S[p]=='x'){\n        p++;\n      };\n    };\n    S[a]=kago;\n    p=0;\n  };\n};\n  ", "language": "C", "metadata": {"date": 1587854405, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "problem_description_relpath": "problem_descriptions/p02721.html", "problem_id": "p02721", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02721/input.txt", "sample_output_relpath": "derived/input_output/data/p02721/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02721/C/s790700030.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s790700030", "user_id": "u214368228"}, "prompt_components": {"gold_output": "6\n", "input_to_evaluate": "#include<stdio.h>\n#define N_MAX 200000\n\nint hantei(long a,long b[],long c){\n  for(long y=0;y<c;y++){\n    if(b[y]==a)return 0;\n  };\n  return 1;\n};\n\nint main(){\n  int magic=1;\n  long N,K,C,m,p=0;\n  char kago;\n  char S[N_MAX]={};\n  long hako[N_MAX]={};\n  scanf(\"%ld %ld %ld\",&N,&K,&C);\n  scanf(\"%s\",S);\n  for(long a=0;a<N;a++){\n    if(magic==0){\n      if(hantei(a,hako,K))continue;\n    };\n    printf(\"%ld日目を検査中\\n\",a+1);\n    kago=S[a];\n    S[a]='x';\n    m=0;\n    while(m<=K){\n      if(m==K){\n        if(magic)magic--;\n        break;\n      };\n      if(p>N-1){\n        printf(\"%ld\\n\",a+1);\n        break;\n      }\n      else if(S[p]=='o'){\n       if(magic)hako[m]=p;\n        p+=C+1;\n        m++;\n      }\n      else if(S[p]=='x'){\n        p++;\n      };\n    };\n    S[a]=kago;\n    p=0;\n  };\n};\n  ", "problem_context": "Score : 500 points\n\nProblem Statement\n\nTakahashi has decided to work on K days of his choice from the N days starting with tomorrow.\n\nYou are given an integer C and a string S. Takahashi will choose his workdays as follows:\n\nAfter working for a day, he will refrain from working on the subsequent C days.\n\nIf the i-th character of S is x, he will not work on Day i, where Day 1 is tomorrow, Day 2 is the day after tomorrow, and so on.\n\nFind all days on which Takahashi is bound to work.\n\nConstraints\n\n1 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq K \\leq N\n\n0 \\leq C \\leq N\n\nThe length of S is N.\n\nEach character of S is o or x.\n\nTakahashi can choose his workdays so that the conditions in Problem Statement are satisfied.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K C\nS\n\nOutput\n\nPrint all days on which Takahashi is bound to work in ascending order, one per line.\n\nSample Input 1\n\n11 3 2\nooxxxoxxxoo\n\nSample Output 1\n\n6\n\nTakahashi is going to work on 3 days out of the 11 days. After working for a day, he will refrain from working on the subsequent 2 days.\n\nThere are four possible choices for his workdays: Day 1,6,10, Day 1,6,11, Day 2,6,10, and Day 2,6,11.\n\nThus, he is bound to work on Day 6.\n\nSample Input 2\n\n5 2 3\nooxoo\n\nSample Output 2\n\n1\n5\n\nThere is only one possible choice for his workdays: Day 1,5.\n\nSample Input 3\n\n5 1 0\nooooo\n\nSample Output 3\n\nThere may be no days on which he is bound to work.\n\nSample Input 4\n\n16 4 3\nooxxoxoxxxoxoxxo\n\nSample Output 4\n\n11\n16", "sample_input": "11 3 2\nooxxxoxxxoo\n"}, "reference_outputs": ["6\n"], "source_document_id": "p02721", "source_text": "Score : 500 points\n\nProblem Statement\n\nTakahashi has decided to work on K days of his choice from the N days starting with tomorrow.\n\nYou are given an integer C and a string S. Takahashi will choose his workdays as follows:\n\nAfter working for a day, he will refrain from working on the subsequent C days.\n\nIf the i-th character of S is x, he will not work on Day i, where Day 1 is tomorrow, Day 2 is the day after tomorrow, and so on.\n\nFind all days on which Takahashi is bound to work.\n\nConstraints\n\n1 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq K \\leq N\n\n0 \\leq C \\leq N\n\nThe length of S is N.\n\nEach character of S is o or x.\n\nTakahashi can choose his workdays so that the conditions in Problem Statement are satisfied.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K C\nS\n\nOutput\n\nPrint all days on which Takahashi is bound to work in ascending order, one per line.\n\nSample Input 1\n\n11 3 2\nooxxxoxxxoo\n\nSample Output 1\n\n6\n\nTakahashi is going to work on 3 days out of the 11 days. After working for a day, he will refrain from working on the subsequent 2 days.\n\nThere are four possible choices for his workdays: Day 1,6,10, Day 1,6,11, Day 2,6,10, and Day 2,6,11.\n\nThus, he is bound to work on Day 6.\n\nSample Input 2\n\n5 2 3\nooxoo\n\nSample Output 2\n\n1\n5\n\nThere is only one possible choice for his workdays: Day 1,5.\n\nSample Input 3\n\n5 1 0\nooooo\n\nSample Output 3\n\nThere may be no days on which he is bound to work.\n\nSample Input 4\n\n16 4 3\nooxxoxoxxxoxoxxo\n\nSample Output 4\n\n11\n16", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 798, "cpu_time_ms": 2103, "memory_kb": 2048}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s981899298", "group_id": "codeNet:p02723", "input_text": "#include <stdio.h>\nint main (){\n\tchar kata[5];\n\tscanf(\"%s\", kata);\n\tif (kata[2] != kata[3] && kata[4] != kata[5]){\n\t\tprintf(\"No\");\n\t}\n\telse {\n\t\tprintf(\"Yes\");\n\t}\n\treturn 0;\n}", "language": "C", "metadata": {"date": 1600713698, "filename_ext": "c", "original_language": "C (Clang 10.0.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/C/s981899298.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s981899298", "user_id": "u089230684"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "#include <stdio.h>\nint main (){\n\tchar kata[5];\n\tscanf(\"%s\", kata);\n\tif (kata[2] != kata[3] && kata[4] != kata[5]){\n\t\tprintf(\"No\");\n\t}\n\telse {\n\t\tprintf(\"Yes\");\n\t}\n\treturn 0;\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": 174, "cpu_time_ms": 107, "memory_kb": 1960}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s196156958", "group_id": "codeNet:p02723", "input_text": "#include<stdio.h>\n#include<stdlib.h>\n\n\nint main(){\n\n    char S[7];\n    scanf(\"%[a-z ]s\", S);\n\n\n    if(S[2]==S[3] && S[4]==S[5])\n        printf(\"yes\");\n    else\n        printf(\"no\");\n\nreturn 0;\n}\n", "language": "C", "metadata": {"date": 1586225387, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "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/C/s196156958.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s196156958", "user_id": "u643456728"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "#include<stdio.h>\n#include<stdlib.h>\n\n\nint main(){\n\n    char S[7];\n    scanf(\"%[a-z ]s\", S);\n\n\n    if(S[2]==S[3] && S[4]==S[5])\n        printf(\"yes\");\n    else\n        printf(\"no\");\n\nreturn 0;\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": 195, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s003396844", "group_id": "codeNet:p02723", "input_text": "#include<stdio.h>\nint main(){\n    char S[256]; \n    scanf(\"%s\",S);\n    if(S[2]==S[3]&&S[4]==S[5]){\n        printf(\"Yes\\n\");\n    }else{\n        printf(\"No\\n\");\n    }\n    return 0;\n}", "language": "C", "metadata": {"date": 1586014926, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "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/C/s003396844.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s003396844", "user_id": "u632767051"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "#include<stdio.h>\nint main(){\n    char S[256]; \n    scanf(\"%s\",S);\n    if(S[2]==S[3]&&S[4]==S[5]){\n        printf(\"Yes\\n\");\n    }else{\n        printf(\"No\\n\");\n    }\n    return 0;\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": 180, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s601252610", "group_id": "codeNet:p02723", "input_text": "#include<stdio.h>\n\nint main(void){\n    char c[7];\n    scanf(\"%s\",c);\n    if(c[2] == c[3] && c[4] == c[5]){\n        printf(\"Yes\\n\");\n    }else{\n        printf(\"No\\n\");\n    }\n    return 0;\n}", "language": "C", "metadata": {"date": 1585443863, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "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/C/s601252610.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s601252610", "user_id": "u085230437"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "#include<stdio.h>\n\nint main(void){\n    char c[7];\n    scanf(\"%s\",c);\n    if(c[2] == c[3] && c[4] == c[5]){\n        printf(\"Yes\\n\");\n    }else{\n        printf(\"No\\n\");\n    }\n    return 0;\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": 188, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s636549154", "group_id": "codeNet:p02724", "input_text": "#include <stdio.h>\n\nint main(void) {\n  \n  int money;\n  int i, j;\n  \n  scanf(\"%d\", &money);\n  \n  i=money/500;\n  j=(money%500)/5;\n  \n  printf(\"%d\\n\", 1000*i+5*j);\n  \n  return 0;\n}\n", "language": "C", "metadata": {"date": 1589826021, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "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/C/s636549154.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s636549154", "user_id": "u781520238"}, "prompt_components": {"gold_output": "2020\n", "input_to_evaluate": "#include <stdio.h>\n\nint main(void) {\n  \n  int money;\n  int i, j;\n  \n  scanf(\"%d\", &money);\n  \n  i=money/500;\n  j=(money%500)/5;\n  \n  printf(\"%d\\n\", 1000*i+5*j);\n  \n  return 0;\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": 178, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s847417246", "group_id": "codeNet:p02725", "input_text": "#include <stdio.h>\n\nint main(void)\n{\n\n\tint K;\n\tint N;\n\tint A[100];\n\tscanf(\"%d %d\",&K ,&N);\n\n\tfor(int i=0; i<N; i++){\n\t\tscanf(\"%d\",&A[i]);\n\t}\n\n\tprintf(\"%d\",K/2);\n\treturn 0;\n}\n", "language": "C", "metadata": {"date": 1585700524, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "problem_description_relpath": "problem_descriptions/p02725.html", "problem_id": "p02725", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02725/input.txt", "sample_output_relpath": "derived/input_output/data/p02725/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02725/C/s847417246.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s847417246", "user_id": "u600812052"}, "prompt_components": {"gold_output": "10\n", "input_to_evaluate": "#include <stdio.h>\n\nint main(void)\n{\n\n\tint K;\n\tint N;\n\tint A[100];\n\tscanf(\"%d %d\",&K ,&N);\n\n\tfor(int i=0; i<N; i++){\n\t\tscanf(\"%d\",&A[i]);\n\t}\n\n\tprintf(\"%d\",K/2);\n\treturn 0;\n}\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere is a circular pond with a perimeter of K meters, and N houses around them.\n\nThe i-th house is built at a distance of A_i meters from the northmost point of the pond, measured clockwise around the pond.\n\nWhen traveling between these houses, you can only go around the pond.\n\nFind the minimum distance that needs to be traveled when you start at one of the houses and visit all the N houses.\n\nConstraints\n\n2 \\leq K \\leq 10^6\n\n2 \\leq N \\leq 2 \\times 10^5\n\n0 \\leq A_1 < ... < A_N < K\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nK N\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the minimum distance that needs to be traveled when you start at one of the houses and visit all the N houses.\n\nSample Input 1\n\n20 3\n5 10 15\n\nSample Output 1\n\n10\n\nIf you start at the 1-st house and go to the 2-nd and 3-rd houses in this order, the total distance traveled will be 10.\n\nSample Input 2\n\n20 3\n0 5 15\n\nSample Output 2\n\n10\n\nIf you start at the 2-nd house and go to the 1-st and 3-rd houses in this order, the total distance traveled will be 10.", "sample_input": "20 3\n5 10 15\n"}, "reference_outputs": ["10\n"], "source_document_id": "p02725", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere is a circular pond with a perimeter of K meters, and N houses around them.\n\nThe i-th house is built at a distance of A_i meters from the northmost point of the pond, measured clockwise around the pond.\n\nWhen traveling between these houses, you can only go around the pond.\n\nFind the minimum distance that needs to be traveled when you start at one of the houses and visit all the N houses.\n\nConstraints\n\n2 \\leq K \\leq 10^6\n\n2 \\leq N \\leq 2 \\times 10^5\n\n0 \\leq A_1 < ... < A_N < K\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nK N\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the minimum distance that needs to be traveled when you start at one of the houses and visit all the N houses.\n\nSample Input 1\n\n20 3\n5 10 15\n\nSample Output 1\n\n10\n\nIf you start at the 1-st house and go to the 2-nd and 3-rd houses in this order, the total distance traveled will be 10.\n\nSample Input 2\n\n20 3\n0 5 15\n\nSample Output 2\n\n10\n\nIf you start at the 2-nd house and go to the 1-st and 3-rd houses in this order, the total distance traveled will be 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": 174, "cpu_time_ms": 96, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s600264539", "group_id": "codeNet:p02725", "input_text": "#include <stdio.h>\n#include <stdlib.h>\n\nint\t\tmain()\n{\n\tint\t\tA, K, N;\n\tint\t\t*meter;\n\tint\t\tsum, dis, max, num, i;\n\n\ti = 0;\n\tsum = 0;\n\tmax = 0;\n\tdis = 0;\n\tscanf(\"%d %d\\n\", &K, &N);\n\tmeter = (int *)malloc(sizeof(int) * (N + 2));\n\twhile (i <= N)\n\t{\n\t\tif (i < N)\n\t\t\tscanf(\"%d \\n\", &meter[i]);\n\t\telse\n\t\t\tmeter[i] = K;\n\t\tif (i)\n\t\t\tdis = meter[i] - meter[i - 1];\n\t\tif (dis > max)\n\t\t{\n\t\t\tmax = dis;\n\t\t\tnum = i;\n\t\t}\n\t\tsum += dis;\n\t\ti++;\n\t}\n\tsum -= meter[num] - meter[num - 1];\n\tprintf(\"%d\\n\", sum);\n\treturn (0);\n}\n", "language": "C", "metadata": {"date": 1585450057, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "problem_description_relpath": "problem_descriptions/p02725.html", "problem_id": "p02725", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02725/input.txt", "sample_output_relpath": "derived/input_output/data/p02725/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02725/C/s600264539.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s600264539", "user_id": "u662185644"}, "prompt_components": {"gold_output": "10\n", "input_to_evaluate": "#include <stdio.h>\n#include <stdlib.h>\n\nint\t\tmain()\n{\n\tint\t\tA, K, N;\n\tint\t\t*meter;\n\tint\t\tsum, dis, max, num, i;\n\n\ti = 0;\n\tsum = 0;\n\tmax = 0;\n\tdis = 0;\n\tscanf(\"%d %d\\n\", &K, &N);\n\tmeter = (int *)malloc(sizeof(int) * (N + 2));\n\twhile (i <= N)\n\t{\n\t\tif (i < N)\n\t\t\tscanf(\"%d \\n\", &meter[i]);\n\t\telse\n\t\t\tmeter[i] = K;\n\t\tif (i)\n\t\t\tdis = meter[i] - meter[i - 1];\n\t\tif (dis > max)\n\t\t{\n\t\t\tmax = dis;\n\t\t\tnum = i;\n\t\t}\n\t\tsum += dis;\n\t\ti++;\n\t}\n\tsum -= meter[num] - meter[num - 1];\n\tprintf(\"%d\\n\", sum);\n\treturn (0);\n}\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere is a circular pond with a perimeter of K meters, and N houses around them.\n\nThe i-th house is built at a distance of A_i meters from the northmost point of the pond, measured clockwise around the pond.\n\nWhen traveling between these houses, you can only go around the pond.\n\nFind the minimum distance that needs to be traveled when you start at one of the houses and visit all the N houses.\n\nConstraints\n\n2 \\leq K \\leq 10^6\n\n2 \\leq N \\leq 2 \\times 10^5\n\n0 \\leq A_1 < ... < A_N < K\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nK N\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the minimum distance that needs to be traveled when you start at one of the houses and visit all the N houses.\n\nSample Input 1\n\n20 3\n5 10 15\n\nSample Output 1\n\n10\n\nIf you start at the 1-st house and go to the 2-nd and 3-rd houses in this order, the total distance traveled will be 10.\n\nSample Input 2\n\n20 3\n0 5 15\n\nSample Output 2\n\n10\n\nIf you start at the 2-nd house and go to the 1-st and 3-rd houses in this order, the total distance traveled will be 10.", "sample_input": "20 3\n5 10 15\n"}, "reference_outputs": ["10\n"], "source_document_id": "p02725", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere is a circular pond with a perimeter of K meters, and N houses around them.\n\nThe i-th house is built at a distance of A_i meters from the northmost point of the pond, measured clockwise around the pond.\n\nWhen traveling between these houses, you can only go around the pond.\n\nFind the minimum distance that needs to be traveled when you start at one of the houses and visit all the N houses.\n\nConstraints\n\n2 \\leq K \\leq 10^6\n\n2 \\leq N \\leq 2 \\times 10^5\n\n0 \\leq A_1 < ... < A_N < K\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nK N\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the minimum distance that needs to be traveled when you start at one of the houses and visit all the N houses.\n\nSample Input 1\n\n20 3\n5 10 15\n\nSample Output 1\n\n10\n\nIf you start at the 1-st house and go to the 2-nd and 3-rd houses in this order, the total distance traveled will be 10.\n\nSample Input 2\n\n20 3\n0 5 15\n\nSample Output 2\n\n10\n\nIf you start at the 2-nd house and go to the 1-st and 3-rd houses in this order, the total distance traveled will be 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": 503, "cpu_time_ms": 24, "memory_kb": 896}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s514430323", "group_id": "codeNet:p02725", "input_text": "#include <stdio.h>\n#include <stdlib.h>\n\nint asc(const void *a, const void *b) {\n  return *(int *)a - *(int *)b;\n}\n\nint main()\n{\n    int k,n,a[200000];\n\n    scanf(\"%d %d\",&k,&n);\n\n    int i,j;\n\n    for (i = 0; i < n; i++)\n    {\n        scanf(\"%d\",&a[i]);\n    }\n    \n    qsort(a,n,sizeof(int),asc);\n\n    long long ans = 0,max = 0;\n    for (i = 0; i < n - 1; i++)\n    {\n        ans += a[i + 1] - a[i];\n        if(a[i + 1] - a[i] > max)max = a[i + 1] - a[i];\n    }\n    ans += k - a[n - 1];\n    if(k - a[n - 1] > max)max = k - a[n - 1];\n\n    printf(\"%lld\",ans - max);\n}\n", "language": "C", "metadata": {"date": 1585444803, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "problem_description_relpath": "problem_descriptions/p02725.html", "problem_id": "p02725", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02725/input.txt", "sample_output_relpath": "derived/input_output/data/p02725/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02725/C/s514430323.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s514430323", "user_id": "u494609869"}, "prompt_components": {"gold_output": "10\n", "input_to_evaluate": "#include <stdio.h>\n#include <stdlib.h>\n\nint asc(const void *a, const void *b) {\n  return *(int *)a - *(int *)b;\n}\n\nint main()\n{\n    int k,n,a[200000];\n\n    scanf(\"%d %d\",&k,&n);\n\n    int i,j;\n\n    for (i = 0; i < n; i++)\n    {\n        scanf(\"%d\",&a[i]);\n    }\n    \n    qsort(a,n,sizeof(int),asc);\n\n    long long ans = 0,max = 0;\n    for (i = 0; i < n - 1; i++)\n    {\n        ans += a[i + 1] - a[i];\n        if(a[i + 1] - a[i] > max)max = a[i + 1] - a[i];\n    }\n    ans += k - a[n - 1];\n    if(k - a[n - 1] > max)max = k - a[n - 1];\n\n    printf(\"%lld\",ans - max);\n}\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere is a circular pond with a perimeter of K meters, and N houses around them.\n\nThe i-th house is built at a distance of A_i meters from the northmost point of the pond, measured clockwise around the pond.\n\nWhen traveling between these houses, you can only go around the pond.\n\nFind the minimum distance that needs to be traveled when you start at one of the houses and visit all the N houses.\n\nConstraints\n\n2 \\leq K \\leq 10^6\n\n2 \\leq N \\leq 2 \\times 10^5\n\n0 \\leq A_1 < ... < A_N < K\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nK N\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the minimum distance that needs to be traveled when you start at one of the houses and visit all the N houses.\n\nSample Input 1\n\n20 3\n5 10 15\n\nSample Output 1\n\n10\n\nIf you start at the 1-st house and go to the 2-nd and 3-rd houses in this order, the total distance traveled will be 10.\n\nSample Input 2\n\n20 3\n0 5 15\n\nSample Output 2\n\n10\n\nIf you start at the 2-nd house and go to the 1-st and 3-rd houses in this order, the total distance traveled will be 10.", "sample_input": "20 3\n5 10 15\n"}, "reference_outputs": ["10\n"], "source_document_id": "p02725", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere is a circular pond with a perimeter of K meters, and N houses around them.\n\nThe i-th house is built at a distance of A_i meters from the northmost point of the pond, measured clockwise around the pond.\n\nWhen traveling between these houses, you can only go around the pond.\n\nFind the minimum distance that needs to be traveled when you start at one of the houses and visit all the N houses.\n\nConstraints\n\n2 \\leq K \\leq 10^6\n\n2 \\leq N \\leq 2 \\times 10^5\n\n0 \\leq A_1 < ... < A_N < K\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nK N\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the minimum distance that needs to be traveled when you start at one of the houses and visit all the N houses.\n\nSample Input 1\n\n20 3\n5 10 15\n\nSample Output 1\n\n10\n\nIf you start at the 1-st house and go to the 2-nd and 3-rd houses in this order, the total distance traveled will be 10.\n\nSample Input 2\n\n20 3\n0 5 15\n\nSample Output 2\n\n10\n\nIf you start at the 2-nd house and go to the 1-st and 3-rd houses in this order, the total distance traveled will be 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": 565, "cpu_time_ms": 29, "memory_kb": 1276}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s165361733", "group_id": "codeNet:p02726", "input_text": "/*\nとりあえずソースコード見る前に推し見ていってください。\n                                                                                   ` ....J&wZTUUWc\n                                                                             `...JZY\"!~-._<~~~~_d'\n                                                                       ` ..-Z\"=~`..._~___::~~~_J\\\n       ........                                                    ` ..dY=````..~~__::::::::~_J\\\n  .KY\"=<<<<<<<?77\"YTXa-..                                      `  .JY=`````.-<~--::<<~~~~<:<_d^\n   W,~~~_______<~-..`.. ?7TG+...`         ` ` `  `   ....   `  .v\"~`````.-<~-JT1__........_-d'\n    T,_~:::;:<z+-~~~~<-..``.`._?TSJ.. ..JVYT7TTTTTY\"=<<<?7\"TQJ=~`.``...?~~__(<~_......... .#`\n     (h_~:<::((+v___._.~~?<.`````.`_?TG-__...___.__....` ..?~```.` .J!~~_..-~<7_......._ .P\n      .W,_~~~_?71-.````` _~~?i..````````.``.```..```````._```.. .J>_~_`   ?<<__.......  (%\n        ?p _..._._-z.,  ``` _~_?<- .`.````````````.``.````` _<1>_~~~~._ --(i-......._ .V!\n         .W, ......(>~<~+-....~~~(t<!`.`.`.`.``.```.``.``` `   .<-~~((?1~?=_......_ .J=\n           7e .........!_.C~-(>(?`  ` ````````````````````  `     ?(~_`` ``....  `.-Y\n            .W, .......```` ~(<`   ` `   ` ``````````      `  `     ?-_.    ``` .J\"\n             `?h.     ` ` .~J! ` `     `  `   ` ` `   `  `   `  `  `  1__    ..J=\n                7a,     .~_J`     ` ` `  ` ``   `  `  `   `    `  `  ` 1-_ (d=`\n                  ?TGgJ<<_J`` ` `  ` - `  ```` ``` `  `(   `  `     ` .wWc<W_\n                      .5g-$`   `     >  `````  ``` ` ` (-  `    `  `   _7HHXb.\n                       .@H=`     ` `.l` ````  `  ```` `(<-`  _ `  `   `  j ?NHm,`\n                    `.dHMF ` ` ` . `.$```` `    `` ````(~(.(<J- `  ` `   (  W7HHm,\n                   `.@Ht,P` `   ._  (1_. `  ` `   `` .(T!_<-`?W+  `  ````(  d, (UHh.`\n                `  .M#!  b``  ` ,Sv7TOo.  `  `   ` _~. <`` <. ({`  `` ` .<   h   .UH&`\n                 `.MD`   O-`````vl  v.1__ ``` ``````.;.:``` 1 J1 ` ````.i! ` J;    ?Mh.\n                 .WF     .n...``.?- > ->.-`````````..I+.`` ..e:(- . ```.V-  `.b      UN. `\n                `(F      (C<~(<..l(1c` ?z1---....._jjA.JJadHYW@.> < ``.c(} `  d.      ?N.\n               `.@`     .@  <((-_vM#HmQmq8?1&-~~~(J!`  WHMHMb `.>.> ._J~(!` ``(]       ,b   `\n                ,>      d!`  ` v+(_`.HHMMb. `????````  XxdHMH~` >(iJO!_(> ```_ K        ,`\n                .      .F` ` ``.c1s..HdMMH~````````````(BXVY=``.O>`.c_(>_````(-W\n                      `J{;``` ``(+> `-77\"= ```.````````````   ````..+>~~_````.}d\n                       H(:```````.3 ..````````.````````````` `.` .>~~~({__ ``.Pd\n                     ` Dd_```.....I ``````````_````````````````.v~~:~:(P_~_ ((bK\n                       WM{ ...~~~~(o.``````````````` ..````` .?`(<:~(-+#_~~_1dH%\n                       dvr-l..~~_s_w7+.``.<(-. ?!``~~..-<1.?!` J<+~:(iWH~::(kWF\n                         X_w~~~(jM:Wc_O?42``` ?&+-;+<~``.(:` .4~(D~(Id!H~_(V!!\n                         .hdm_~(d?hdNz-_(>``.._(_.(>_..``(:`` (1H%(uV! HV\"!\n                           7:?4uD.K~.._?z>`.._(JSjk-__`.`(C<<!_7H#\"!\n                                .dI:__-.I?&Jv=_+?>?l_?4v?> -< ...?h.\n                    `        .JHz?1<:::J<(l ` J?1J<1_ `(:..?_...._Jb\n                        `..v\"!``(>(1+:(>~~(1.<(1<iJ><..C<_--1(:::+CJN.\n                        J=````.` (a+g0Ws:::_:_::(<___<(~___(C~:<z<1>-Ta,`\n                       `?e````.z@!     X<:::::::<+:::::?1+jdYTYAaZ!``` ?4a.`    `\n                         (n.````Oe    .D_~~~:::::::::::::(W!     ?U, ````.To.      `\n                          .4,````?Hka.f_....__~~::~:~:~~~_d;       (W,`` `` 7a.\n                            ?N,  `-_4D..............~.~..._W,        ?NJ. ` ` ?4dYBh, `\n                             JD?-   +_......................W.         _TS&,   `  ` TmJN`\n                             .UR-...<z+-_-............-__-((dL             _Wn. `  .! (t   `\n                            ` J8!_.2____<?<<<+(-(--(+<<1<<(_<jL             .N..`.J!  ?W&\n                              d&J?` ~?<+-_(-~(-:(_: <.<(-(<7!_?o             ?B9Tn.` (4kdb\n                        ` `.dY!   ` `./` ` _(????!!~!` ``(_``..?L                .4,m,iW.\n                            .U,    `.!   `  !  `` `. `` ` < `...?r                 Wd?BY`\n                              (N&.`.!` `   <  ```` _ ` ```(_`..(JV`   `  `\n                             `(8-.?=<?1+-..+... ```(.......f<~?r          ` ` ......\n                             .K`.?<-.   __(K<D__<?TC~~~~__```.-S.  ....-&ZY\"\"777?77\"\"9GJ,`   `\n                            `J}````` _??<d= J{~~~~~(i.....-<<~`(Y77<~_``.```.```````.`.(XHa.    `\n                        `   .K`````````.d^  X~~.~.~~_1. ````.`` I_....```.````.``.`````_dWqHm,\n                           `(%``.`.```.Y    R~~~.~.~~~<-`````.``(-~~.....`.`````.``.``.(dWqkHh\n                           .K_```.``.J^     S_~~~~~.~~~?:``.``.`.l~~~~...``.`.``````.``_zWkqkHb`\n                        ` .d'`..```.Y`      q{~.~.~~.~.~(i ````.`(/.~~.....```.``.```.`.dWqqqqH[\n                         .d!`~~_-.J^        .b_~.~~.~~~~~_1.  ..``?+~~~~....````````.` (WkHHM#H#\n                         d!` __?(f`          ?n~~~.~~.~~~~~?i_.````?/~~.~..`.``.``.``._jkY\"7=\n                     `  .D``` `.%             ?h,~~~~.~..~~~~1, ``` j_~~....``.``.``.-V=`\n                       `(}`   (\\                Tm,~~~~~.~.~~~?- `` .>~~....``.``..JY`\n               `   `   .g`   ('                   ?W&-~~~~~.~.~(>  ` 1_~~....`..JT^\n                      d=<  .,Nx                      THaJ-_~~~~~(l   (o.(((JZ\"^`\n                `    .@   `?`.H.                        _\"YBHmggk<!`` > W>\n                      4eJ>:1.(t                                 W+.<(. .(D           `\n                      ({?<!~db                                   W$<<jY4F`\n                      ,h. _`.W`                                 (5..J=.d`\n                    `   7TUY\"`                                  4,...(Y!\n                                                                  ~~`                         `\n\n\tでかいですね。\n\t更にかわいいときた。\n\tうん。好き。\n*/\n\n/*  include  */\n#include <assert.h>\n#include <ctype.h>\n#include <errno.h>\n#include <locale.h>\n#include <limits.h>\n#include <math.h>\n#include <stdio.h>\n#include <stdlib.h>\n#include <time.h>\n#include <setjmp.h>\n#include <string.h>\n#include <signal.h>\n#include <stdarg.h>\n#include <stdbool.h>\n\n/*  typedef  */\ntypedef long long ll;\ntypedef char string[100];\ntypedef int array[100];\n/*  define  */\n\n/*  define funcs  */\n#define sort_d(array,end){int size=end-array;qsort(array,size,sizeof(int),intcmp);}\n#define sort_c(array,end){int size=end-array;qsort(array,size,sizeof(char),charcmp);}\n#define rand_range(min,max) (min)+(rand())%((max)-(min)+(1))\n#define rep(i,j) for(int i=0;i<j;i++)\n#define loop(i,j,z) for(int i=j;i<z;i++)\n#define swap(a,b) ((a!=b)&&(a+=b,b=a-b,a-= b))\n#define getarray_d(array,size){array=(int *)malloc(sizeof(int)*size);}\n#define getarray_c(array,size){array=(char *)malloc(sizeof(char)*size);}\n#define fill(array,end,val){int size=end-array;rep(i,size)array[i]=val;}\n#define min(a,b) (a>b)?b:a\n/*  otter  (Otter)  ｶﾜｳｿｯ！ */\n#define intptr int *\n#define random srand((unsigned)time(NULL))\n#define ON 1\n#define OFF 0\n#define TREE_SIZE 1000\n\n/*  prototype Declaration */\nint intcmp(const void* a, const void* b);\nint charcmp(const void* a, const void* b);\nbool is_sorted(const int* start, const int* end);\nint count(const int* start, const int* end, int target);\nvoid shuffle(int* start, int* end);\nvoid tree_init(void);\nint tree_root(int x);\nvoid unite(int x, int y);\nbool same(int x, int y);\n\n/*  scan  */\n#define sd(a) scanf(\"%d\",&a)\n#define sc(a) scanf(\"%c\",&a), getchar()\n#define sf(a) scanf(\"%f\",&a)\n#define ss(a) scanf(\"%s\",a)\n#define sld(a) scanf(\"%lld\",&a)\n/*  print  */\n#define odn(a) printf(\"%d\\n\",a)\n#define oldn(a) printf(\"%lld\\n\",a)\n#define ocn(a) printf(\"%c\\n\",a)\n#define ofn(a) printf(\"%f\\n\",a)\n#define osn(a) printf(\"%s\\n\",a)\n#define od(a) printf(\"%d \",a)\n#define old(a) printf(\"%lld\\n\",a)\n#define oc(a) printf(\"%c \",a)\n#define of(a) printf(\"%f \",a)\n#define os(a) printf(\"%s \",a)\n\n/*  struct  */\ntypedef struct {\n\tint first;\n\tint second;\n}pair;\n/*  local val  */\nint tree[TREE_SIZE];\nint cnts=0;\n/*  funcs （local）*/\n\n/*  main program  */\nint main(void){\n\tint N, X, Y;\n\tsd(N),sd(X),sd(Y);\n\tint cnt[20000] = {0};\n\tfor(int i=1; i<=N; i++)\n\t\tfor(int j=i+1; j<=N; j++)\n\t\t\tcnt[min(j-i, abs(j-Y) + abs(i-X) + 1)] ++;\n\tfor(int i=1; i<N; i++)\n\t\todn(cnt[i]);\n}\n\n/*  funcs  (global)*/\nvoid sort_first(pair* b, pair* e)\n{\n\tint* dec;\n\tint s2 = e - b;\n\tint size = e - b;\n\tgetarray_d(dec, size);\n\trep(i, size) dec[i] = b[i].first;\n\tsort_d(dec, dec + s2);\n\trep(i, size) b[i].first = dec[i];\n}\nvoid sort_second(pair* b, pair* e)\n{\n\tint* dec;\n\tint s2 = e - b;\n\tint size = e - b;\n\tgetarray_d(dec, size);\n\trep(i, size) dec[i] = b[i].second;\n\tsort_d(dec, dec + s2);\n\trep(i, size) b[i].second = dec[i];\n}\n\n\nint intcmp(const void* a, const void* b)\n{\n\treturn *(int*)a - *(int*)b;\n}\n\nint charcmp(const void* a, const void* b)\n{\n\treturn *(char*)a - *(char*)b;\n}\n\nbool is_sorted(const int* start, const int* end)\n{\n\twhile (start != end) {\n\t\tif (*start > * (start + 1)) return false;\n\t\tstart++;\n\t}\n\treturn true;\n}\n\nint count(const int* start, const int* end, int target)\n{\n\tint cnt = 0;\n\tint* array;\n\tint* p;\n\n\tarray = (int*)malloc((end - start) * sizeof(int));\n\n\tif (array == NULL) {\n\t\tprintf(\"Err0r\");\n\t\texit(-1);\n\t}\n\n\tmemcpy(array, start, sizeof(int) * (end - start));\n\tsort_d(array, array + (end - start));\n\tp = (int*)bsearch(&target, array, end - start, sizeof(int), intcmp);\n\n\tif (p == NULL) {\n\t\tfree(array);\n\t\treturn 0;\n\t}\n\twhile (*p == target)\n\t\tp++;\n\tp--;\n\twhile (*p == target) {\n\t\tcnt++;\n\t\tp--;\n\t}\n\n\tfree(array);\n\n\treturn cnt;\n}\n\nvoid shuffle(int* start, int* end)\n{\n\trandom;\n\n\tint a, b;\n\tint size = end - start;\n\n\trep(i, 500) {\n\t\ta = rand_range(0, size - 1);\n\t\tb = rand_range(0, size - 1);\n\t\tswap(start[a], start[b]);\n\t}\n}\n/*  tree  */\n\nvoid tree_init(void)\n{\n\tfor (int i = 0; i < TREE_SIZE; i++) tree[i] = i;\n}\n\nint tree_root(int x)\n{\n\tif (tree[x] == x) return x;\n\treturn tree[x] = tree_root(tree[x]);\n}\n\nvoid unite(int x, int y)\n{\n\tint rx = tree_root(x);\n\tint ry = tree_root(y);\n\tif (rx == ry) return;\n\ttree[rx] = ry;\n}\n\nbool same(int x, int y)\n{\n\tint rx = tree_root(x);\n\tint ry = tree_root(y);\n\treturn rx == ry;\n}\n\nll pow_mod(ll n, ll k, ll m)\n{\n\tif (k == 0) return 1;\n\telse if (k % 2) return pow_mod(n, k - 1, m) * n % m;\n\telse {\n\t\tint t = pow_mod(n, k / 2, m);\n\t\treturn t * t % m;\n\t}\n}\n", "language": "C", "metadata": {"date": 1585499989, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "problem_description_relpath": "problem_descriptions/p02726.html", "problem_id": "p02726", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02726/input.txt", "sample_output_relpath": "derived/input_output/data/p02726/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02726/C/s165361733.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s165361733", "user_id": "u256093215"}, "prompt_components": {"gold_output": "5\n4\n1\n0\n", "input_to_evaluate": "/*\nとりあえずソースコード見る前に推し見ていってください。\n                                                                                   ` ....J&wZTUUWc\n                                                                             `...JZY\"!~-._<~~~~_d'\n                                                                       ` ..-Z\"=~`..._~___::~~~_J\\\n       ........                                                    ` ..dY=````..~~__::::::::~_J\\\n  .KY\"=<<<<<<<?77\"YTXa-..                                      `  .JY=`````.-<~--::<<~~~~<:<_d^\n   W,~~~_______<~-..`.. ?7TG+...`         ` ` `  `   ....   `  .v\"~`````.-<~-JT1__........_-d'\n    T,_~:::;:<z+-~~~~<-..``.`._?TSJ.. ..JVYT7TTTTTY\"=<<<?7\"TQJ=~`.``...?~~__(<~_......... .#`\n     (h_~:<::((+v___._.~~?<.`````.`_?TG-__...___.__....` ..?~```.` .J!~~_..-~<7_......._ .P\n      .W,_~~~_?71-.````` _~~?i..````````.``.```..```````._```.. .J>_~_`   ?<<__.......  (%\n        ?p _..._._-z.,  ``` _~_?<- .`.````````````.``.````` _<1>_~~~~._ --(i-......._ .V!\n         .W, ......(>~<~+-....~~~(t<!`.`.`.`.``.```.``.``` `   .<-~~((?1~?=_......_ .J=\n           7e .........!_.C~-(>(?`  ` ````````````````````  `     ?(~_`` ``....  `.-Y\n            .W, .......```` ~(<`   ` `   ` ``````````      `  `     ?-_.    ``` .J\"\n             `?h.     ` ` .~J! ` `     `  `   ` ` `   `  `   `  `  `  1__    ..J=\n                7a,     .~_J`     ` ` `  ` ``   `  `  `   `    `  `  ` 1-_ (d=`\n                  ?TGgJ<<_J`` ` `  ` - `  ```` ``` `  `(   `  `     ` .wWc<W_\n                      .5g-$`   `     >  `````  ``` ` ` (-  `    `  `   _7HHXb.\n                       .@H=`     ` `.l` ````  `  ```` `(<-`  _ `  `   `  j ?NHm,`\n                    `.dHMF ` ` ` . `.$```` `    `` ````(~(.(<J- `  ` `   (  W7HHm,\n                   `.@Ht,P` `   ._  (1_. `  ` `   `` .(T!_<-`?W+  `  ````(  d, (UHh.`\n                `  .M#!  b``  ` ,Sv7TOo.  `  `   ` _~. <`` <. ({`  `` ` .<   h   .UH&`\n                 `.MD`   O-`````vl  v.1__ ``` ``````.;.:``` 1 J1 ` ````.i! ` J;    ?Mh.\n                 .WF     .n...``.?- > ->.-`````````..I+.`` ..e:(- . ```.V-  `.b      UN. `\n                `(F      (C<~(<..l(1c` ?z1---....._jjA.JJadHYW@.> < ``.c(} `  d.      ?N.\n               `.@`     .@  <((-_vM#HmQmq8?1&-~~~(J!`  WHMHMb `.>.> ._J~(!` ``(]       ,b   `\n                ,>      d!`  ` v+(_`.HHMMb. `????````  XxdHMH~` >(iJO!_(> ```_ K        ,`\n                .      .F` ` ``.c1s..HdMMH~````````````(BXVY=``.O>`.c_(>_````(-W\n                      `J{;``` ``(+> `-77\"= ```.````````````   ````..+>~~_````.}d\n                       H(:```````.3 ..````````.````````````` `.` .>~~~({__ ``.Pd\n                     ` Dd_```.....I ``````````_````````````````.v~~:~:(P_~_ ((bK\n                       WM{ ...~~~~(o.``````````````` ..````` .?`(<:~(-+#_~~_1dH%\n                       dvr-l..~~_s_w7+.``.<(-. ?!``~~..-<1.?!` J<+~:(iWH~::(kWF\n                         X_w~~~(jM:Wc_O?42``` ?&+-;+<~``.(:` .4~(D~(Id!H~_(V!!\n                         .hdm_~(d?hdNz-_(>``.._(_.(>_..``(:`` (1H%(uV! HV\"!\n                           7:?4uD.K~.._?z>`.._(JSjk-__`.`(C<<!_7H#\"!\n                                .dI:__-.I?&Jv=_+?>?l_?4v?> -< ...?h.\n                    `        .JHz?1<:::J<(l ` J?1J<1_ `(:..?_...._Jb\n                        `..v\"!``(>(1+:(>~~(1.<(1<iJ><..C<_--1(:::+CJN.\n                        J=````.` (a+g0Ws:::_:_::(<___<(~___(C~:<z<1>-Ta,`\n                       `?e````.z@!     X<:::::::<+:::::?1+jdYTYAaZ!``` ?4a.`    `\n                         (n.````Oe    .D_~~~:::::::::::::(W!     ?U, ````.To.      `\n                          .4,````?Hka.f_....__~~::~:~:~~~_d;       (W,`` `` 7a.\n                            ?N,  `-_4D..............~.~..._W,        ?NJ. ` ` ?4dYBh, `\n                             JD?-   +_......................W.         _TS&,   `  ` TmJN`\n                             .UR-...<z+-_-............-__-((dL             _Wn. `  .! (t   `\n                            ` J8!_.2____<?<<<+(-(--(+<<1<<(_<jL             .N..`.J!  ?W&\n                              d&J?` ~?<+-_(-~(-:(_: <.<(-(<7!_?o             ?B9Tn.` (4kdb\n                        ` `.dY!   ` `./` ` _(????!!~!` ``(_``..?L                .4,m,iW.\n                            .U,    `.!   `  !  `` `. `` ` < `...?r                 Wd?BY`\n                              (N&.`.!` `   <  ```` _ ` ```(_`..(JV`   `  `\n                             `(8-.?=<?1+-..+... ```(.......f<~?r          ` ` ......\n                             .K`.?<-.   __(K<D__<?TC~~~~__```.-S.  ....-&ZY\"\"777?77\"\"9GJ,`   `\n                            `J}````` _??<d= J{~~~~~(i.....-<<~`(Y77<~_``.```.```````.`.(XHa.    `\n                        `   .K`````````.d^  X~~.~.~~_1. ````.`` I_....```.````.``.`````_dWqHm,\n                           `(%``.`.```.Y    R~~~.~.~~~<-`````.``(-~~.....`.`````.``.``.(dWqkHh\n                           .K_```.``.J^     S_~~~~~.~~~?:``.``.`.l~~~~...``.`.``````.``_zWkqkHb`\n                        ` .d'`..```.Y`      q{~.~.~~.~.~(i ````.`(/.~~.....```.``.```.`.dWqqqqH[\n                         .d!`~~_-.J^        .b_~.~~.~~~~~_1.  ..``?+~~~~....````````.` (WkHHM#H#\n                         d!` __?(f`          ?n~~~.~~.~~~~~?i_.````?/~~.~..`.``.``.``._jkY\"7=\n                     `  .D``` `.%             ?h,~~~~.~..~~~~1, ``` j_~~....``.``.``.-V=`\n                       `(}`   (\\                Tm,~~~~~.~.~~~?- `` .>~~....``.``..JY`\n               `   `   .g`   ('                   ?W&-~~~~~.~.~(>  ` 1_~~....`..JT^\n                      d=<  .,Nx                      THaJ-_~~~~~(l   (o.(((JZ\"^`\n                `    .@   `?`.H.                        _\"YBHmggk<!`` > W>\n                      4eJ>:1.(t                                 W+.<(. .(D           `\n                      ({?<!~db                                   W$<<jY4F`\n                      ,h. _`.W`                                 (5..J=.d`\n                    `   7TUY\"`                                  4,...(Y!\n                                                                  ~~`                         `\n\n\tでかいですね。\n\t更にかわいいときた。\n\tうん。好き。\n*/\n\n/*  include  */\n#include <assert.h>\n#include <ctype.h>\n#include <errno.h>\n#include <locale.h>\n#include <limits.h>\n#include <math.h>\n#include <stdio.h>\n#include <stdlib.h>\n#include <time.h>\n#include <setjmp.h>\n#include <string.h>\n#include <signal.h>\n#include <stdarg.h>\n#include <stdbool.h>\n\n/*  typedef  */\ntypedef long long ll;\ntypedef char string[100];\ntypedef int array[100];\n/*  define  */\n\n/*  define funcs  */\n#define sort_d(array,end){int size=end-array;qsort(array,size,sizeof(int),intcmp);}\n#define sort_c(array,end){int size=end-array;qsort(array,size,sizeof(char),charcmp);}\n#define rand_range(min,max) (min)+(rand())%((max)-(min)+(1))\n#define rep(i,j) for(int i=0;i<j;i++)\n#define loop(i,j,z) for(int i=j;i<z;i++)\n#define swap(a,b) ((a!=b)&&(a+=b,b=a-b,a-= b))\n#define getarray_d(array,size){array=(int *)malloc(sizeof(int)*size);}\n#define getarray_c(array,size){array=(char *)malloc(sizeof(char)*size);}\n#define fill(array,end,val){int size=end-array;rep(i,size)array[i]=val;}\n#define min(a,b) (a>b)?b:a\n/*  otter  (Otter)  ｶﾜｳｿｯ！ */\n#define intptr int *\n#define random srand((unsigned)time(NULL))\n#define ON 1\n#define OFF 0\n#define TREE_SIZE 1000\n\n/*  prototype Declaration */\nint intcmp(const void* a, const void* b);\nint charcmp(const void* a, const void* b);\nbool is_sorted(const int* start, const int* end);\nint count(const int* start, const int* end, int target);\nvoid shuffle(int* start, int* end);\nvoid tree_init(void);\nint tree_root(int x);\nvoid unite(int x, int y);\nbool same(int x, int y);\n\n/*  scan  */\n#define sd(a) scanf(\"%d\",&a)\n#define sc(a) scanf(\"%c\",&a), getchar()\n#define sf(a) scanf(\"%f\",&a)\n#define ss(a) scanf(\"%s\",a)\n#define sld(a) scanf(\"%lld\",&a)\n/*  print  */\n#define odn(a) printf(\"%d\\n\",a)\n#define oldn(a) printf(\"%lld\\n\",a)\n#define ocn(a) printf(\"%c\\n\",a)\n#define ofn(a) printf(\"%f\\n\",a)\n#define osn(a) printf(\"%s\\n\",a)\n#define od(a) printf(\"%d \",a)\n#define old(a) printf(\"%lld\\n\",a)\n#define oc(a) printf(\"%c \",a)\n#define of(a) printf(\"%f \",a)\n#define os(a) printf(\"%s \",a)\n\n/*  struct  */\ntypedef struct {\n\tint first;\n\tint second;\n}pair;\n/*  local val  */\nint tree[TREE_SIZE];\nint cnts=0;\n/*  funcs （local）*/\n\n/*  main program  */\nint main(void){\n\tint N, X, Y;\n\tsd(N),sd(X),sd(Y);\n\tint cnt[20000] = {0};\n\tfor(int i=1; i<=N; i++)\n\t\tfor(int j=i+1; j<=N; j++)\n\t\t\tcnt[min(j-i, abs(j-Y) + abs(i-X) + 1)] ++;\n\tfor(int i=1; i<N; i++)\n\t\todn(cnt[i]);\n}\n\n/*  funcs  (global)*/\nvoid sort_first(pair* b, pair* e)\n{\n\tint* dec;\n\tint s2 = e - b;\n\tint size = e - b;\n\tgetarray_d(dec, size);\n\trep(i, size) dec[i] = b[i].first;\n\tsort_d(dec, dec + s2);\n\trep(i, size) b[i].first = dec[i];\n}\nvoid sort_second(pair* b, pair* e)\n{\n\tint* dec;\n\tint s2 = e - b;\n\tint size = e - b;\n\tgetarray_d(dec, size);\n\trep(i, size) dec[i] = b[i].second;\n\tsort_d(dec, dec + s2);\n\trep(i, size) b[i].second = dec[i];\n}\n\n\nint intcmp(const void* a, const void* b)\n{\n\treturn *(int*)a - *(int*)b;\n}\n\nint charcmp(const void* a, const void* b)\n{\n\treturn *(char*)a - *(char*)b;\n}\n\nbool is_sorted(const int* start, const int* end)\n{\n\twhile (start != end) {\n\t\tif (*start > * (start + 1)) return false;\n\t\tstart++;\n\t}\n\treturn true;\n}\n\nint count(const int* start, const int* end, int target)\n{\n\tint cnt = 0;\n\tint* array;\n\tint* p;\n\n\tarray = (int*)malloc((end - start) * sizeof(int));\n\n\tif (array == NULL) {\n\t\tprintf(\"Err0r\");\n\t\texit(-1);\n\t}\n\n\tmemcpy(array, start, sizeof(int) * (end - start));\n\tsort_d(array, array + (end - start));\n\tp = (int*)bsearch(&target, array, end - start, sizeof(int), intcmp);\n\n\tif (p == NULL) {\n\t\tfree(array);\n\t\treturn 0;\n\t}\n\twhile (*p == target)\n\t\tp++;\n\tp--;\n\twhile (*p == target) {\n\t\tcnt++;\n\t\tp--;\n\t}\n\n\tfree(array);\n\n\treturn cnt;\n}\n\nvoid shuffle(int* start, int* end)\n{\n\trandom;\n\n\tint a, b;\n\tint size = end - start;\n\n\trep(i, 500) {\n\t\ta = rand_range(0, size - 1);\n\t\tb = rand_range(0, size - 1);\n\t\tswap(start[a], start[b]);\n\t}\n}\n/*  tree  */\n\nvoid tree_init(void)\n{\n\tfor (int i = 0; i < TREE_SIZE; i++) tree[i] = i;\n}\n\nint tree_root(int x)\n{\n\tif (tree[x] == x) return x;\n\treturn tree[x] = tree_root(tree[x]);\n}\n\nvoid unite(int x, int y)\n{\n\tint rx = tree_root(x);\n\tint ry = tree_root(y);\n\tif (rx == ry) return;\n\ttree[rx] = ry;\n}\n\nbool same(int x, int y)\n{\n\tint rx = tree_root(x);\n\tint ry = tree_root(y);\n\treturn rx == ry;\n}\n\nll pow_mod(ll n, ll k, ll m)\n{\n\tif (k == 0) return 1;\n\telse if (k % 2) return pow_mod(n, k - 1, m) * n % m;\n\telse {\n\t\tint t = pow_mod(n, k / 2, m);\n\t\treturn t * t % m;\n\t}\n}\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nWe have an undirected graph G with N vertices numbered 1 to N and N edges as follows:\n\nFor each i=1,2,...,N-1, there is an edge between Vertex i and Vertex i+1.\n\nThere is an edge between Vertex X and Vertex Y.\n\nFor each k=1,2,...,N-1, solve the problem below:\n\nFind the number of pairs of integers (i,j) (1 \\leq i < j \\leq N) such that the shortest distance between Vertex i and Vertex j in G is k.\n\nConstraints\n\n3 \\leq N \\leq 2 \\times 10^3\n\n1 \\leq X,Y \\leq N\n\nX+1 < Y\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN X Y\n\nOutput\n\nFor each k=1, 2, ..., N-1 in this order, print a line containing the answer to the problem.\n\nSample Input 1\n\n5 2 4\n\nSample Output 1\n\n5\n4\n1\n0\n\nThe graph in this input is as follows:\n\nThere are five pairs (i,j) (1 \\leq i < j \\leq N) such that the shortest distance between Vertex i and Vertex j is 1: (1,2)\\,,(2,3)\\,,(2,4)\\,,(3,4)\\,,(4,5).\n\nThere are four pairs (i,j) (1 \\leq i < j \\leq N) such that the shortest distance between Vertex i and Vertex j is 2: (1,3)\\,,(1,4)\\,,(2,5)\\,,(3,5).\n\nThere is one pair (i,j) (1 \\leq i < j \\leq N) such that the shortest distance between Vertex i and Vertex j is 3: (1,5).\n\nThere are no pairs (i,j) (1 \\leq i < j \\leq N) such that the shortest distance between Vertex i and Vertex j is 4.\n\nSample Input 2\n\n3 1 3\n\nSample Output 2\n\n3\n0\n\nThe graph in this input is as follows:\n\nSample Input 3\n\n7 3 7\n\nSample Output 3\n\n7\n8\n4\n2\n0\n0\n\nSample Input 4\n\n10 4 8\n\nSample Output 4\n\n10\n12\n10\n8\n4\n1\n0\n0\n0", "sample_input": "5 2 4\n"}, "reference_outputs": ["5\n4\n1\n0\n"], "source_document_id": "p02726", "source_text": "Score : 400 points\n\nProblem Statement\n\nWe have an undirected graph G with N vertices numbered 1 to N and N edges as follows:\n\nFor each i=1,2,...,N-1, there is an edge between Vertex i and Vertex i+1.\n\nThere is an edge between Vertex X and Vertex Y.\n\nFor each k=1,2,...,N-1, solve the problem below:\n\nFind the number of pairs of integers (i,j) (1 \\leq i < j \\leq N) such that the shortest distance between Vertex i and Vertex j in G is k.\n\nConstraints\n\n3 \\leq N \\leq 2 \\times 10^3\n\n1 \\leq X,Y \\leq N\n\nX+1 < Y\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN X Y\n\nOutput\n\nFor each k=1, 2, ..., N-1 in this order, print a line containing the answer to the problem.\n\nSample Input 1\n\n5 2 4\n\nSample Output 1\n\n5\n4\n1\n0\n\nThe graph in this input is as follows:\n\nThere are five pairs (i,j) (1 \\leq i < j \\leq N) such that the shortest distance between Vertex i and Vertex j is 1: (1,2)\\,,(2,3)\\,,(2,4)\\,,(3,4)\\,,(4,5).\n\nThere are four pairs (i,j) (1 \\leq i < j \\leq N) such that the shortest distance between Vertex i and Vertex j is 2: (1,3)\\,,(1,4)\\,,(2,5)\\,,(3,5).\n\nThere is one pair (i,j) (1 \\leq i < j \\leq N) such that the shortest distance between Vertex i and Vertex j is 3: (1,5).\n\nThere are no pairs (i,j) (1 \\leq i < j \\leq N) such that the shortest distance between Vertex i and Vertex j is 4.\n\nSample Input 2\n\n3 1 3\n\nSample Output 2\n\n3\n0\n\nThe graph in this input is as follows:\n\nSample Input 3\n\n7 3 7\n\nSample Output 3\n\n7\n8\n4\n2\n0\n0\n\nSample Input 4\n\n10 4 8\n\nSample Output 4\n\n10\n12\n10\n8\n4\n1\n0\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": 10534, "cpu_time_ms": 4, "memory_kb": 256}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s492045980", "group_id": "codeNet:p02728", "input_text": "#include <stdio.h>\n\n#define Mod 1000000007\n\nlong long div_mod(long long x, long long y, long long z)\n{\n\tif (x % y == 0) return x / y;\n\telse return (div_mod((1 + x / y) * y - x, (z % y), y) * z + x) / y;\n}\n\ntypedef struct List {\n\tstruct List *next;\n\tint v, size, id;\n\tlong long count;\n} list;\n\nlist *adj[200001] = {}, e[400001];\nlong long fact[200001], fact_inv[200001];\n\nlong long recursion(int k)\n{\n\tif (e[k^1].count > 0) return e[k^1].count;\n\telse e[k^1].count = 1;\n\t\n\tint u = e[k].v, w = e[k^1].v, tmp;\n\tlist *p;\n\tfor (p = adj[u]; p != NULL; p = p->next) {\n\t\tif (p->v == w) continue;\n\t\trecursion(p->id);\n\t\te[k^1].size += e[(p->id)^1].size;\n\t}\n\tfor (p = adj[u], tmp = e[k^1].size; p != NULL; p = p->next) {\n\t\tif (p->v == w) continue;\n\t\te[k^1].count = e[k^1].count * e[(p->id)^1].count % Mod * fact[tmp] % Mod * fact_inv[e[(p->id)^1].size] % Mod * fact_inv[tmp - e[(p->id)^1].size] % Mod;\n\t\ttmp -= e[(p->id)^1].size;\n\t}\n\te[k^1].size++;\n\treturn e[k^1].count;\n}\n\nint main()\n{\n\tint i, N, u, w;\n\tscanf(\"%d\", &N);\n\tfor (i = 0; i < N - 1; i++) {\n\t\tscanf(\"%d %d\", &u, &w);\n\t\te[i*2].v = w;\n\t\te[i*2+1].v = u;\n\t\te[i*2].count = 0;\n\t\te[i*2+1].count = 0;\n\t\te[i*2].size = 0;\n\t\te[i*2+1].size = 0;\n\t\te[i*2].id = i * 2;\n\t\te[i*2+1].id = i * 2 + 1;\n\t\te[i*2].next = adj[u];\n\t\te[i*2+1].next = adj[w];\n\t\tadj[u] = &(e[i*2]);\n\t\tadj[w] = &(e[i*2+1]);\n\t}\n\t\n\tint flag[200001] = {}, q[200001], head, tail;\n\tlong long ans[200001], tmp;\n\tlist *p;\n\tfor (i = 1, fact[0] = 1; i <= N; i++) fact[i] = fact[i-1] * i % Mod;\n\tfor (i = N - 1, fact_inv[N] = div_mod(1, fact[N], Mod); i >= 0; i--) fact_inv[i] = fact_inv[i+1] * (i + 1) % Mod;\n\tfor (head = 0, tail = 1, q[0] = 1, flag[1] = 1; head < tail; head++) {\n\t\tu = q[head];\n\t\tfor (p = adj[u], ans[u] = 1, tmp = N - 1; p != NULL; p = p->next) {\n\t\t\tans[u] = ans[u] * recursion(p->id) % Mod * fact[tmp] % Mod * fact_inv[e[(p->id)^1].size] % Mod * fact_inv[tmp - e[(p->id)^1].size] % Mod;\n\t\t\ttmp -= e[(p->id)^1].size;\n\t\t\tif (flag[p->v] == 0) {\n\t\t\t\tflag[p->v] = 1;\n\t\t\t\tq[tail++] = p->v;\n\t\t\t}\n\t\t}\n\t\tfor (p = adj[u]; p != NULL; p = p->next) {\n\t\t\tif (p->count == 0) {\n\t\t\t\tp->count = div_mod(ans[u], e[(p->id)^1].count * fact[N-1] % Mod * fact_inv[e[(p->id)^1].size] % Mod * fact_inv[N-1-e[(p->id)^1].size], Mod);\n\t\t\t\tp->size = N - e[(p->id)^1].size;\n\t\t\t}\n\t\t}\n\t}\n\tfor (i = 1; i <= N; i++) printf(\"%lld\\n\", ans[i]);\n\tfflush(stdout);\n\treturn 0;\n}", "language": "C", "metadata": {"date": 1596299868, "filename_ext": "c", "original_language": "C (GCC 9.2.1)", "problem_description_relpath": "problem_descriptions/p02728.html", "problem_id": "p02728", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02728/input.txt", "sample_output_relpath": "derived/input_output/data/p02728/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02728/C/s492045980.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s492045980", "user_id": "u943800443"}, "prompt_components": {"gold_output": "2\n1\n1\n", "input_to_evaluate": "#include <stdio.h>\n\n#define Mod 1000000007\n\nlong long div_mod(long long x, long long y, long long z)\n{\n\tif (x % y == 0) return x / y;\n\telse return (div_mod((1 + x / y) * y - x, (z % y), y) * z + x) / y;\n}\n\ntypedef struct List {\n\tstruct List *next;\n\tint v, size, id;\n\tlong long count;\n} list;\n\nlist *adj[200001] = {}, e[400001];\nlong long fact[200001], fact_inv[200001];\n\nlong long recursion(int k)\n{\n\tif (e[k^1].count > 0) return e[k^1].count;\n\telse e[k^1].count = 1;\n\t\n\tint u = e[k].v, w = e[k^1].v, tmp;\n\tlist *p;\n\tfor (p = adj[u]; p != NULL; p = p->next) {\n\t\tif (p->v == w) continue;\n\t\trecursion(p->id);\n\t\te[k^1].size += e[(p->id)^1].size;\n\t}\n\tfor (p = adj[u], tmp = e[k^1].size; p != NULL; p = p->next) {\n\t\tif (p->v == w) continue;\n\t\te[k^1].count = e[k^1].count * e[(p->id)^1].count % Mod * fact[tmp] % Mod * fact_inv[e[(p->id)^1].size] % Mod * fact_inv[tmp - e[(p->id)^1].size] % Mod;\n\t\ttmp -= e[(p->id)^1].size;\n\t}\n\te[k^1].size++;\n\treturn e[k^1].count;\n}\n\nint main()\n{\n\tint i, N, u, w;\n\tscanf(\"%d\", &N);\n\tfor (i = 0; i < N - 1; i++) {\n\t\tscanf(\"%d %d\", &u, &w);\n\t\te[i*2].v = w;\n\t\te[i*2+1].v = u;\n\t\te[i*2].count = 0;\n\t\te[i*2+1].count = 0;\n\t\te[i*2].size = 0;\n\t\te[i*2+1].size = 0;\n\t\te[i*2].id = i * 2;\n\t\te[i*2+1].id = i * 2 + 1;\n\t\te[i*2].next = adj[u];\n\t\te[i*2+1].next = adj[w];\n\t\tadj[u] = &(e[i*2]);\n\t\tadj[w] = &(e[i*2+1]);\n\t}\n\t\n\tint flag[200001] = {}, q[200001], head, tail;\n\tlong long ans[200001], tmp;\n\tlist *p;\n\tfor (i = 1, fact[0] = 1; i <= N; i++) fact[i] = fact[i-1] * i % Mod;\n\tfor (i = N - 1, fact_inv[N] = div_mod(1, fact[N], Mod); i >= 0; i--) fact_inv[i] = fact_inv[i+1] * (i + 1) % Mod;\n\tfor (head = 0, tail = 1, q[0] = 1, flag[1] = 1; head < tail; head++) {\n\t\tu = q[head];\n\t\tfor (p = adj[u], ans[u] = 1, tmp = N - 1; p != NULL; p = p->next) {\n\t\t\tans[u] = ans[u] * recursion(p->id) % Mod * fact[tmp] % Mod * fact_inv[e[(p->id)^1].size] % Mod * fact_inv[tmp - e[(p->id)^1].size] % Mod;\n\t\t\ttmp -= e[(p->id)^1].size;\n\t\t\tif (flag[p->v] == 0) {\n\t\t\t\tflag[p->v] = 1;\n\t\t\t\tq[tail++] = p->v;\n\t\t\t}\n\t\t}\n\t\tfor (p = adj[u]; p != NULL; p = p->next) {\n\t\t\tif (p->count == 0) {\n\t\t\t\tp->count = div_mod(ans[u], e[(p->id)^1].count * fact[N-1] % Mod * fact_inv[e[(p->id)^1].size] % Mod * fact_inv[N-1-e[(p->id)^1].size], Mod);\n\t\t\t\tp->size = N - e[(p->id)^1].size;\n\t\t\t}\n\t\t}\n\t}\n\tfor (i = 1; i <= N; i++) printf(\"%lld\\n\", ans[i]);\n\tfflush(stdout);\n\treturn 0;\n}", "problem_context": "Score : 600 points\n\nProblem Statement\n\nWe have a tree with N vertices numbered 1 to N. The i-th edge in this tree connects Vertex a_i and b_i.\nFor each k=1, ..., N, solve the problem below:\n\nConsider writing a number on each vertex in the tree in the following manner:\n\nFirst, write 1 on Vertex k.\n\nThen, for each of the numbers 2, ..., N in this order, write the number on the vertex chosen as follows:\n\nChoose a vertex that still does not have a number written on it and is adjacent to a vertex with a number already written on it. If there are multiple such vertices, choose one of them at random.\n\nFind the number of ways in which we can write the numbers on the vertices, modulo (10^9+7).\n\nConstraints\n\n2 \\leq N \\leq 2 \\times 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\nFor each k=1, 2, ..., N in this order, print a line containing the answer to the problem.\n\nSample Input 1\n\n3\n1 2\n1 3\n\nSample Output 1\n\n2\n1\n1\n\nThe graph in this input is as follows:\n\nFor k=1, there are two ways in which we can write the numbers on the vertices, as follows:\n\nWriting 1, 2, 3 on Vertex 1, 2, 3, respectively\n\nWriting 1, 3, 2 on Vertex 1, 2, 3, respectively\n\nSample Input 2\n\n2\n1 2\n\nSample Output 2\n\n1\n1\n\nThe graph in this input is as follows:\n\nSample Input 3\n\n5\n1 2\n2 3\n3 4\n3 5\n\nSample Output 3\n\n2\n8\n12\n3\n3\n\nThe graph in this input is as follows:\n\nSample Input 4\n\n8\n1 2\n2 3\n3 4\n3 5\n3 6\n6 7\n6 8\n\nSample Output 4\n\n40\n280\n840\n120\n120\n504\n72\n72\n\nThe graph in this input is as follows:", "sample_input": "3\n1 2\n1 3\n"}, "reference_outputs": ["2\n1\n1\n"], "source_document_id": "p02728", "source_text": "Score : 600 points\n\nProblem Statement\n\nWe have a tree with N vertices numbered 1 to N. The i-th edge in this tree connects Vertex a_i and b_i.\nFor each k=1, ..., N, solve the problem below:\n\nConsider writing a number on each vertex in the tree in the following manner:\n\nFirst, write 1 on Vertex k.\n\nThen, for each of the numbers 2, ..., N in this order, write the number on the vertex chosen as follows:\n\nChoose a vertex that still does not have a number written on it and is adjacent to a vertex with a number already written on it. If there are multiple such vertices, choose one of them at random.\n\nFind the number of ways in which we can write the numbers on the vertices, modulo (10^9+7).\n\nConstraints\n\n2 \\leq N \\leq 2 \\times 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\nFor each k=1, 2, ..., N in this order, print a line containing the answer to the problem.\n\nSample Input 1\n\n3\n1 2\n1 3\n\nSample Output 1\n\n2\n1\n1\n\nThe graph in this input is as follows:\n\nFor k=1, there are two ways in which we can write the numbers on the vertices, as follows:\n\nWriting 1, 2, 3 on Vertex 1, 2, 3, respectively\n\nWriting 1, 3, 2 on Vertex 1, 2, 3, respectively\n\nSample Input 2\n\n2\n1 2\n\nSample Output 2\n\n1\n1\n\nThe graph in this input is as follows:\n\nSample Input 3\n\n5\n1 2\n2 3\n3 4\n3 5\n\nSample Output 3\n\n2\n8\n12\n3\n3\n\nThe graph in this input is as follows:\n\nSample Input 4\n\n8\n1 2\n2 3\n3 4\n3 5\n3 6\n6 7\n6 8\n\nSample Output 4\n\n40\n280\n840\n120\n120\n504\n72\n72\n\nThe graph in this input is as follows:", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 2351, "cpu_time_ms": 259, "memory_kb": 20284}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s463271322", "group_id": "codeNet:p02729", "input_text": "#include<stdio.h>\n\nint main(){\n  int n,m;\n  \n  scanf(\"%d %d\",&n, &m);\n  printf(\"%d\\n\", (n+m)*(n+m-1)-n*m);\n  return 0;\n}", "language": "C", "metadata": {"date": 1586402356, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "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/C/s463271322.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s463271322", "user_id": "u452146609"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "#include<stdio.h>\n\nint main(){\n  int n,m;\n  \n  scanf(\"%d %d\",&n, &m);\n  printf(\"%d\\n\", (n+m)*(n+m-1)-n*m);\n  return 0;\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": 120, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s141724479", "group_id": "codeNet:p02729", "input_text": "#include<stdio.h>\n\nint main(void){\n    int n,m;\n    scanf(\"%d %d\",&n,&m);\n    printf(\"%d\",(n*(n-1>=1?n-1:0)/2)+(m*(m-1>=1?m-1:0)/2));\n    return 0;\n}", "language": "C", "metadata": {"date": 1584925432, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "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/C/s141724479.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s141724479", "user_id": "u491343140"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "#include<stdio.h>\n\nint main(void){\n    int n,m;\n    scanf(\"%d %d\",&n,&m);\n    printf(\"%d\",(n*(n-1>=1?n-1:0)/2)+(m*(m-1>=1?m-1:0)/2));\n    return 0;\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": 149, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s183698268", "group_id": "codeNet:p02730", "input_text": "#include <stdio.h>\n#include <string.h>\n#include <stdlib.h>\n#include <math.h>\n#include <stdbool.h>\n#define LL long long\n#define DB double\n#define INF 1145141919810364364\n#define PI 3.14159265358979\n#define MIN(x,y) ((x)<(y)?(x):(y))\n#define MAX(x,y) ((x)<(y)?(y):(x))\n#define FOR(i,a,n) for(i=a;i<n;i++)\n#define rep(i,n) FOR(i,0,n)\n#define MOD 1000000007\n//#define MOD 998244353\n#define ERR 0.00000000000001\n#define NUM 200010\n\nvoid swap(LL* a,LL* b){LL tmp=*a;*a=*b;*b=tmp;}\nvoid YN(int a){if(a==1)printf(\"Yes\\n\");if(a==0)printf(\"No\\n\");}\nLL pwmn(LL a,LL n){LL ans=1;while(ans<a)ans*=n;return ans;}\nLL GCD(LL a,LL b){LL c=1,tmp=MAX(a,b);b=MIN(a,b);a=tmp;while(c!=0){c=a%b;a=b;b=c;}return a;}\nLL LCM(LL a,LL b){return a*b/GCD(a,b);}\nint lcmp(const void* a,const void* b){if(*(LL*)a>*(LL*)b)return 1;if(*(LL*)a<*(LL*)b)return -1;return 0;}\nint lcmpr(const void* a,const void* b){if(*(LL*)a>*(LL*)b)return -1;if(*(LL*)a<*(LL*)b)return 1;return 0;}\nint ccmp(const void* a,const void* b){return *(char*)a-*(char*)b;}\nint ccmpr(const void* a,const void* b){return *(char*)b-*(char*)a;}\nint scmp(const void* a,const void* b){return strcmp((char*)a,(char*)b);}\nint scmpr(const void* a,const void* b){return strcmp((char*)b,(char*)a);}\nLL mod(LL a,LL m){if(a<0)return a%m+m;else return a%m;}\nLL DIV(LL a,LL d){LL m=MOD,x=1,y=0,k;while(m){k=d/m;d-=k*m;swap(&m,&d);x-=k*y;swap(&x,&y);}return mod(a*mod(x,MOD),MOD);}\nLL FAC(LL a){LL i,ans=1;FOR(i,1,a+1){ans*=i;if(MOD>0&&ans>MOD)ans%=MOD;}return ans;}\nLL POW(LL a,LL n){LL ans=1;while(n>0){if(n&1)ans=ans*a%MOD;a=a*a%MOD;n>>=1;}return ans;}\nLL fact[NUM],finv[NUM],inv[NUM];\nvoid comi(){LL i;fact[0]=fact[1]=1;finv[0]=finv[1]=1;inv[1]=1;FOR(i,2,NUM){fact[i]=fact[i-1]*i%MOD;inv[i]=MOD-inv[MOD%i]*(MOD/i)%MOD;finv[i]=finv[i-1]*inv[i]%MOD;}}\nLL com(LL n,LL k){if(n<k||n<0||k<0)return 0;return fact[n]*(finv[k]*finv[n-k]%MOD)%MOD;}\n\nint main(){\n  LL i,ans=1,a;\n  char S[110]={0};\n  scanf(\"%s\",S);\n  a=strlen(S);\n  rep(i,(a-1)/2){\n    if(S[i]!=S[(a-1)/2-i-1])ans=0;\n    if(S[a-1-i]!=S[(a-1)/2+1+i])ans=0;\n  }\n  rep(i,a){\n    if(S[i]!=S[a-1-i])ans=0;\n  }\n  YN(ans);\n\n  //printf(\"%lld\\n\",ans);\n\treturn 0;\n}\n", "language": "C", "metadata": {"date": 1584925882, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "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/C/s183698268.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s183698268", "user_id": "u596117821"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "#include <stdio.h>\n#include <string.h>\n#include <stdlib.h>\n#include <math.h>\n#include <stdbool.h>\n#define LL long long\n#define DB double\n#define INF 1145141919810364364\n#define PI 3.14159265358979\n#define MIN(x,y) ((x)<(y)?(x):(y))\n#define MAX(x,y) ((x)<(y)?(y):(x))\n#define FOR(i,a,n) for(i=a;i<n;i++)\n#define rep(i,n) FOR(i,0,n)\n#define MOD 1000000007\n//#define MOD 998244353\n#define ERR 0.00000000000001\n#define NUM 200010\n\nvoid swap(LL* a,LL* b){LL tmp=*a;*a=*b;*b=tmp;}\nvoid YN(int a){if(a==1)printf(\"Yes\\n\");if(a==0)printf(\"No\\n\");}\nLL pwmn(LL a,LL n){LL ans=1;while(ans<a)ans*=n;return ans;}\nLL GCD(LL a,LL b){LL c=1,tmp=MAX(a,b);b=MIN(a,b);a=tmp;while(c!=0){c=a%b;a=b;b=c;}return a;}\nLL LCM(LL a,LL b){return a*b/GCD(a,b);}\nint lcmp(const void* a,const void* b){if(*(LL*)a>*(LL*)b)return 1;if(*(LL*)a<*(LL*)b)return -1;return 0;}\nint lcmpr(const void* a,const void* b){if(*(LL*)a>*(LL*)b)return -1;if(*(LL*)a<*(LL*)b)return 1;return 0;}\nint ccmp(const void* a,const void* b){return *(char*)a-*(char*)b;}\nint ccmpr(const void* a,const void* b){return *(char*)b-*(char*)a;}\nint scmp(const void* a,const void* b){return strcmp((char*)a,(char*)b);}\nint scmpr(const void* a,const void* b){return strcmp((char*)b,(char*)a);}\nLL mod(LL a,LL m){if(a<0)return a%m+m;else return a%m;}\nLL DIV(LL a,LL d){LL m=MOD,x=1,y=0,k;while(m){k=d/m;d-=k*m;swap(&m,&d);x-=k*y;swap(&x,&y);}return mod(a*mod(x,MOD),MOD);}\nLL FAC(LL a){LL i,ans=1;FOR(i,1,a+1){ans*=i;if(MOD>0&&ans>MOD)ans%=MOD;}return ans;}\nLL POW(LL a,LL n){LL ans=1;while(n>0){if(n&1)ans=ans*a%MOD;a=a*a%MOD;n>>=1;}return ans;}\nLL fact[NUM],finv[NUM],inv[NUM];\nvoid comi(){LL i;fact[0]=fact[1]=1;finv[0]=finv[1]=1;inv[1]=1;FOR(i,2,NUM){fact[i]=fact[i-1]*i%MOD;inv[i]=MOD-inv[MOD%i]*(MOD/i)%MOD;finv[i]=finv[i-1]*inv[i]%MOD;}}\nLL com(LL n,LL k){if(n<k||n<0||k<0)return 0;return fact[n]*(finv[k]*finv[n-k]%MOD)%MOD;}\n\nint main(){\n  LL i,ans=1,a;\n  char S[110]={0};\n  scanf(\"%s\",S);\n  a=strlen(S);\n  rep(i,(a-1)/2){\n    if(S[i]!=S[(a-1)/2-i-1])ans=0;\n    if(S[a-1-i]!=S[(a-1)/2+1+i])ans=0;\n  }\n  rep(i,a){\n    if(S[i]!=S[a-1-i])ans=0;\n  }\n  YN(ans);\n\n  //printf(\"%lld\\n\",ans);\n\treturn 0;\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": 2138, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s970128497", "group_id": "codeNet:p02732", "input_text": "#include<stdio.h>\n#include<string.h>\nvoid quicksort(int a[], int l, int h)\n{\n    int mid=a[(l+h)/2];\n    int i=l,j=h;\n    int t;\n    while(i<=j)\n    {\n    \twhile(a[i]<mid&&i<h) i++;\n        while(a[j]>mid&&j>0) j--;\n        if(i<=j)\n        {\n            t=a[i];\n\t\t\ta[i]=a[j];\n\t\t\ta[j]=t;\n            i++;\n            j--;\n        }\n\t}\n    if(l<j) quicksort(a,l,j);\n    if(i<h) quicksort(a,i,h);\n}\nint main()\n{\n\tint n,i,a[2000],b[2000][2]={0},c[2000],j=0,s=0,k=0;\n\tscanf(\"%d\",&n);\n\tfor(i=0;i<n;i++)\n\t{\n\t\tscanf(\"%d\",&a[i]);\n\t\tc[i]=a[i];\n\t}\n\tquicksort(a,0,n-1);\n\tb[0][0]=a[0];b[0][1]=1;\n\tfor(i=1;i<n;i++)\n\t{\n\t\tif(a[i]==a[i-1])\n\t\tb[j][1]++;\n\t\telse\n\t\t{\n\t\t\ts+=(b[j][1]*b[j][1]-b[j][1])/2;\n\t\t\tb[++j][0]=a[i];\n\t\t\tb[j][1]=1;\n\t\t}\n\t}\n\ts+=(b[j][1]*b[j][1]-b[j][1])/2;\n\tfor(i=0;i<n;i++)\n\t{\n\t\tfor(k=0;k<=j;k++)\n\t\t{\n\t\t\tif(b[k][0]==c[i])\n\t\t\t{\n\t\t\t\tprintf(\"%d\\n\",s+1-b[k][1]);\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t}\n\treturn 0;\n}", "language": "C", "metadata": {"date": 1585081768, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "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/C/s970128497.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s970128497", "user_id": "u815673304"}, "prompt_components": {"gold_output": "2\n2\n3\n2\n3\n", "input_to_evaluate": "#include<stdio.h>\n#include<string.h>\nvoid quicksort(int a[], int l, int h)\n{\n    int mid=a[(l+h)/2];\n    int i=l,j=h;\n    int t;\n    while(i<=j)\n    {\n    \twhile(a[i]<mid&&i<h) i++;\n        while(a[j]>mid&&j>0) j--;\n        if(i<=j)\n        {\n            t=a[i];\n\t\t\ta[i]=a[j];\n\t\t\ta[j]=t;\n            i++;\n            j--;\n        }\n\t}\n    if(l<j) quicksort(a,l,j);\n    if(i<h) quicksort(a,i,h);\n}\nint main()\n{\n\tint n,i,a[2000],b[2000][2]={0},c[2000],j=0,s=0,k=0;\n\tscanf(\"%d\",&n);\n\tfor(i=0;i<n;i++)\n\t{\n\t\tscanf(\"%d\",&a[i]);\n\t\tc[i]=a[i];\n\t}\n\tquicksort(a,0,n-1);\n\tb[0][0]=a[0];b[0][1]=1;\n\tfor(i=1;i<n;i++)\n\t{\n\t\tif(a[i]==a[i-1])\n\t\tb[j][1]++;\n\t\telse\n\t\t{\n\t\t\ts+=(b[j][1]*b[j][1]-b[j][1])/2;\n\t\t\tb[++j][0]=a[i];\n\t\t\tb[j][1]=1;\n\t\t}\n\t}\n\ts+=(b[j][1]*b[j][1]-b[j][1])/2;\n\tfor(i=0;i<n;i++)\n\t{\n\t\tfor(k=0;k<=j;k++)\n\t\t{\n\t\t\tif(b[k][0]==c[i])\n\t\t\t{\n\t\t\t\tprintf(\"%d\\n\",s+1-b[k][1]);\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t}\n\treturn 0;\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": 894, "cpu_time_ms": 97, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s321541972", "group_id": "codeNet:p02732", "input_text": "#include <stdio.h>\n\nint main(){\n\tint i, j, k, n, dummy, check, c=0;\n\tscanf(\"%d\",&n);\n\tint a[n], ans[n], d[n-1], data[n-1];\n\tfor(i=0;i<n;i++) scanf(\"%d\",&a[i]);\n\tfor(i=0;i<n;i++) ans[i] = 0;\n\t\n\tfor(i=0;i<n;i++){\n\t\t//d[n-1]を、a[i]を除くa[n]の集合とする\n\t\tfor(j=0;j<n;j++){\n\t\t\tif(j<i) d[j]=a[j];\n\t\t\telse if(j>i) d[j-1]=a[j];\n\t\t}\n        for(j=0;j<n-1;j++) data[j]=0;\n\t\tfor(j=0;j<n-1;j++){\n\t\t\tdata[d[j]-1]++;\n        }\n\t\tfor(j=0;j<n-1;j++){\n            ans[i]+=data[j]*(data[j]-1);\n        }\n\t}\n\t\n\t\n\tfor(i=0;i<n;i++) printf(\"%d\\n\",ans[i]/2);\n}\n", "language": "C", "metadata": {"date": 1584977914, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "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/C/s321541972.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s321541972", "user_id": "u697715013"}, "prompt_components": {"gold_output": "2\n2\n3\n2\n3\n", "input_to_evaluate": "#include <stdio.h>\n\nint main(){\n\tint i, j, k, n, dummy, check, c=0;\n\tscanf(\"%d\",&n);\n\tint a[n], ans[n], d[n-1], data[n-1];\n\tfor(i=0;i<n;i++) scanf(\"%d\",&a[i]);\n\tfor(i=0;i<n;i++) ans[i] = 0;\n\t\n\tfor(i=0;i<n;i++){\n\t\t//d[n-1]を、a[i]を除くa[n]の集合とする\n\t\tfor(j=0;j<n;j++){\n\t\t\tif(j<i) d[j]=a[j];\n\t\t\telse if(j>i) d[j-1]=a[j];\n\t\t}\n        for(j=0;j<n-1;j++) data[j]=0;\n\t\tfor(j=0;j<n-1;j++){\n\t\t\tdata[d[j]-1]++;\n        }\n\t\tfor(j=0;j<n-1;j++){\n            ans[i]+=data[j]*(data[j]-1);\n        }\n\t}\n\t\n\t\n\tfor(i=0;i<n;i++) printf(\"%d\\n\",ans[i]/2);\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": 552, "cpu_time_ms": 2103, "memory_kb": 3328}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s913739459", "group_id": "codeNet:p02732", "input_text": "#include<stdio.h>\nint main()\n{\n\tlong int no,p[300000],i,j,k,cnt=0,cnt1=0;\n  \tscanf(\"%ld\",&no);\n  \tfor(i=0;i<no;i++)\n      \tscanf(\"%ld\",&p[i]);\n \tfor(i=0;i<no-1;i++)\n    {\n    \tfor(j=i+1;j<no;j++)\n        {\n        \tif(p[i]==p[j])\n              \tcnt1++;\n        }\n    }\n   // printf(\"%ld\",cnt1);\n  for(i=0;i<no;i++)\n    {\n    \tcnt=0;\n    \tfor(j=0;j<no;j++)\n        {\n        \tif(i!=j)\n        \t{\n\t\t\t\n        \tif(p[i]==p[j])\n              \tcnt++;}\n        }\n    printf(\"%ld\\n\",cnt1-cnt);\n    }\n  return 0;\n}", "language": "C", "metadata": {"date": 1584931133, "filename_ext": "c", "original_language": "C (Clang 3.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/C/s913739459.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s913739459", "user_id": "u846927868"}, "prompt_components": {"gold_output": "2\n2\n3\n2\n3\n", "input_to_evaluate": "#include<stdio.h>\nint main()\n{\n\tlong int no,p[300000],i,j,k,cnt=0,cnt1=0;\n  \tscanf(\"%ld\",&no);\n  \tfor(i=0;i<no;i++)\n      \tscanf(\"%ld\",&p[i]);\n \tfor(i=0;i<no-1;i++)\n    {\n    \tfor(j=i+1;j<no;j++)\n        {\n        \tif(p[i]==p[j])\n              \tcnt1++;\n        }\n    }\n   // printf(\"%ld\",cnt1);\n  for(i=0;i<no;i++)\n    {\n    \tcnt=0;\n    \tfor(j=0;j<no;j++)\n        {\n        \tif(i!=j)\n        \t{\n\t\t\t\n        \tif(p[i]==p[j])\n              \tcnt++;}\n        }\n    printf(\"%ld\\n\",cnt1-cnt);\n    }\n  return 0;\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": 505, "cpu_time_ms": 2107, "memory_kb": 2432}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s156120124", "group_id": "codeNet:p02742", "input_text": "#include<stdio.h>\n\nint main(void){\n\tunsigned long long h,w,ans;\n\tscanf(\"%llu%llu\",&h,&w);\n\tif(h%2==0&&w%2==0){\n\t\tans=(h/2)*w;\n\n\t}else if(h%2==1&&w%2==1){\n\t\tans=((h-1)/2)*(w-1)+(h-1)/2+(w-1)/2+1;\n\t}else if(h%2==1){\n\t\tans=((h-1)/2)*w+w/2;\n\t}else{\n\t\tans=(h/2)*(w-1)+h/2;\n\t}\n\n\tprintf(\"%llu\",ans);\n\treturn 0;\n}\n", "language": "C", "metadata": {"date": 1584239861, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "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/C/s156120124.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s156120124", "user_id": "u027519288"}, "prompt_components": {"gold_output": "10\n", "input_to_evaluate": "#include<stdio.h>\n\nint main(void){\n\tunsigned long long h,w,ans;\n\tscanf(\"%llu%llu\",&h,&w);\n\tif(h%2==0&&w%2==0){\n\t\tans=(h/2)*w;\n\n\t}else if(h%2==1&&w%2==1){\n\t\tans=((h-1)/2)*(w-1)+(h-1)/2+(w-1)/2+1;\n\t}else if(h%2==1){\n\t\tans=((h-1)/2)*w+w/2;\n\t}else{\n\t\tans=(h/2)*(w-1)+h/2;\n\t}\n\n\tprintf(\"%llu\",ans);\n\treturn 0;\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": 306, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s491467344", "group_id": "codeNet:p02742", "input_text": "#include <stdio.h>\n\n\nint main(void) {\n\tlong long int h,w;\n\tscanf(\"%lld%lld\",&h,&w);\n\tlong long int ans;\n\tans=h*w/2+h*w%2;\n    \n\tprintf(\"%lld\",ans);\n\t// your code goes here\n\treturn 0;\n}\n", "language": "C", "metadata": {"date": 1584237733, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "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/C/s491467344.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s491467344", "user_id": "u182837166"}, "prompt_components": {"gold_output": "10\n", "input_to_evaluate": "#include <stdio.h>\n\n\nint main(void) {\n\tlong long int h,w;\n\tscanf(\"%lld%lld\",&h,&w);\n\tlong long int ans;\n\tans=h*w/2+h*w%2;\n    \n\tprintf(\"%lld\",ans);\n\t// your code goes here\n\treturn 0;\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": 185, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s503699971", "group_id": "codeNet:p02742", "input_text": "#include<stdio.h>\nlong long int main()\n{\n  int H,W;\n  unsigned long long int A;\n  scanf(\"%d %d\",&H,&W);\n  if(H*W%2==1){\n    A=H*W*0.5;\n    A=A+1;\n    printf(\"%lld\",A);\n  }\n  else{\n    A=H*W*0.5;\n    printf(\"%ld\",A);\n  }\n  return 0;\n}", "language": "C", "metadata": {"date": 1584235649, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "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/C/s503699971.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s503699971", "user_id": "u451199284"}, "prompt_components": {"gold_output": "10\n", "input_to_evaluate": "#include<stdio.h>\nlong long int main()\n{\n  int H,W;\n  unsigned long long int A;\n  scanf(\"%d %d\",&H,&W);\n  if(H*W%2==1){\n    A=H*W*0.5;\n    A=A+1;\n    printf(\"%lld\",A);\n  }\n  else{\n    A=H*W*0.5;\n    printf(\"%ld\",A);\n  }\n  return 0;\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": 233, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s694672361", "group_id": "codeNet:p02742", "input_text": "#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\n#include <limits.h>\n#include <string.h>\n\nint main(void) {\n long long int H,W;\n scanf(\"%lld %lld\",&H,&W);\n long long int a = H*W;\n if (a>1){\n if (a%2==0)printf(\"%lld\",a/2);\n else printf(\"%lld\",(a+1)/2);\n }\n if (a==1)printf(\"1\");\n return EXIT_SUCCESS;\n}", "language": "C", "metadata": {"date": 1584234947, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "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/C/s694672361.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s694672361", "user_id": "u959524814"}, "prompt_components": {"gold_output": "10\n", "input_to_evaluate": "#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\n#include <limits.h>\n#include <string.h>\n\nint main(void) {\n long long int H,W;\n scanf(\"%lld %lld\",&H,&W);\n long long int a = H*W;\n if (a>1){\n if (a%2==0)printf(\"%lld\",a/2);\n else printf(\"%lld\",(a+1)/2);\n }\n if (a==1)printf(\"1\");\n return EXIT_SUCCESS;\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": 308, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s008134071", "group_id": "codeNet:p02742", "input_text": "main() {\n  long long a, b; scanf(\"%lld%lld\", &a, &b);\n  printf(\"%lld\\n\", (a*b+1)>>1);\n}", "language": "C", "metadata": {"date": 1584234302, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "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/C/s008134071.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s008134071", "user_id": "u516708338"}, "prompt_components": {"gold_output": "10\n", "input_to_evaluate": "main() {\n  long long a, b; scanf(\"%lld%lld\", &a, &b);\n  printf(\"%lld\\n\", (a*b+1)>>1);\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": 87, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s640983834", "group_id": "codeNet:p02748", "input_text": "#include<stdio.h>\n\nint main()\n{\n    long a,b,m;\n    scanf(\"%ld%ld%ld\",&a,&b,&m);\n    int i,j;\n    int a_val[a+1],b_val[b+1];\n    for(i=1;i<=a;i++){\n        scanf(\"%d\",&a_val[i]);\n    }for(i=1;i<=b;i++){\n        scanf(\"%d\",&b_val[i]);\n    }\n    int x[m+1],y[m+1];\n    long c[m+1];\n    long k;\n    long min=200000;\n    for(i=1;i<=m;i++){\n        scanf(\"%d%d%ld\",&x[i],&y[i],&c[i]);\n    }\n    long val[a+1][b+1];\n    for(i=1;i<=a;i++){\n        for(j=1;j<=b;j++){\n            val[i][j]=a_val[i]+b_val[j];\n\n        }\n    }\n    long c_val[a+1][b+1];\n    for(i=1;i<=a;i++){\n        for(j=1;j<=b;j++){\n            c_val[i][j]=200000;\n        }\n    }\n    for(k=1;k<=m;k++){\n        if(c_val[x[k]][y[k]]>c[k]){\n            c_val[x[k]][y[k]]=c[k];\n        }\n    }\n    for(k=1;k<=m;k++){\n        val[x[k]][y[k]]=val[x[k]][y[k]]-c_val[x[k]][y[k]];\n    }\n    for(i=1;i<=a;i++){\n        for(j=1;j<=b;j++){\n            if(val[i][j]<min){\n                min=val[i][j];\n            } \n        }\n    }\n    printf(\"%ld\\n\",min);\n\n    return 0;\n}", "language": "C", "metadata": {"date": 1583719916, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "problem_description_relpath": "problem_descriptions/p02748.html", "problem_id": "p02748", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02748/input.txt", "sample_output_relpath": "derived/input_output/data/p02748/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02748/C/s640983834.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s640983834", "user_id": "u149757670"}, "prompt_components": {"gold_output": "5\n", "input_to_evaluate": "#include<stdio.h>\n\nint main()\n{\n    long a,b,m;\n    scanf(\"%ld%ld%ld\",&a,&b,&m);\n    int i,j;\n    int a_val[a+1],b_val[b+1];\n    for(i=1;i<=a;i++){\n        scanf(\"%d\",&a_val[i]);\n    }for(i=1;i<=b;i++){\n        scanf(\"%d\",&b_val[i]);\n    }\n    int x[m+1],y[m+1];\n    long c[m+1];\n    long k;\n    long min=200000;\n    for(i=1;i<=m;i++){\n        scanf(\"%d%d%ld\",&x[i],&y[i],&c[i]);\n    }\n    long val[a+1][b+1];\n    for(i=1;i<=a;i++){\n        for(j=1;j<=b;j++){\n            val[i][j]=a_val[i]+b_val[j];\n\n        }\n    }\n    long c_val[a+1][b+1];\n    for(i=1;i<=a;i++){\n        for(j=1;j<=b;j++){\n            c_val[i][j]=200000;\n        }\n    }\n    for(k=1;k<=m;k++){\n        if(c_val[x[k]][y[k]]>c[k]){\n            c_val[x[k]][y[k]]=c[k];\n        }\n    }\n    for(k=1;k<=m;k++){\n        val[x[k]][y[k]]=val[x[k]][y[k]]-c_val[x[k]][y[k]];\n    }\n    for(i=1;i<=a;i++){\n        for(j=1;j<=b;j++){\n            if(val[i][j]<min){\n                min=val[i][j];\n            } \n        }\n    }\n    printf(\"%ld\\n\",min);\n\n    return 0;\n}", "problem_context": "Score : 200 points\n\nProblem Statement\n\nYou are visiting a large electronics store to buy a refrigerator and a microwave.\n\nThe store sells A kinds of refrigerators and B kinds of microwaves. The i-th refrigerator ( 1 \\le i \\le A ) is sold at a_i yen (the currency of Japan), and the j-th microwave ( 1 \\le j \\le B ) is sold at b_j yen.\n\nYou have M discount tickets. With the i-th ticket ( 1 \\le i \\le M ), you can get a discount of c_i yen from the total price when buying the x_i-th refrigerator and the y_i-th microwave together. Only one ticket can be used at a time.\n\nYou are planning to buy one refrigerator and one microwave. Find the minimum amount of money required.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\le A \\le 10^5\n\n1 \\le B \\le 10^5\n\n1 \\le M \\le 10^5\n\n1 \\le a_i , b_i , c_i \\le 10^5\n\n1 \\le x_i \\le A\n\n1 \\le y_i \\le B\n\nc_i \\le a_{x_i} + b_{y_i}\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B M\na_1 a_2 ... a_A\nb_1 b_2 ... b_B\nx_1 y_1 c_1\n\\vdots\nx_M y_M c_M\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n2 3 1\n3 3\n3 3 3\n1 2 1\n\nSample Output 1\n\n5\n\nWith the ticket, you can get the 1-st refrigerator and the 2-nd microwave for 3+3-1=5 yen.\n\nSample Input 2\n\n1 1 2\n10\n10\n1 1 5\n1 1 10\n\nSample Output 2\n\n10\n\nNote that you cannot use more than one ticket at a time.\n\nSample Input 3\n\n2 2 1\n3 5\n3 5\n2 2 2\n\nSample Output 3\n\n6\n\nYou can get the 1-st refrigerator and the 1-st microwave for 6 yen, which is the minimum amount to pay in this case.\nNote that using a ticket is optional.", "sample_input": "2 3 1\n3 3\n3 3 3\n1 2 1\n"}, "reference_outputs": ["5\n"], "source_document_id": "p02748", "source_text": "Score : 200 points\n\nProblem Statement\n\nYou are visiting a large electronics store to buy a refrigerator and a microwave.\n\nThe store sells A kinds of refrigerators and B kinds of microwaves. The i-th refrigerator ( 1 \\le i \\le A ) is sold at a_i yen (the currency of Japan), and the j-th microwave ( 1 \\le j \\le B ) is sold at b_j yen.\n\nYou have M discount tickets. With the i-th ticket ( 1 \\le i \\le M ), you can get a discount of c_i yen from the total price when buying the x_i-th refrigerator and the y_i-th microwave together. Only one ticket can be used at a time.\n\nYou are planning to buy one refrigerator and one microwave. Find the minimum amount of money required.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\le A \\le 10^5\n\n1 \\le B \\le 10^5\n\n1 \\le M \\le 10^5\n\n1 \\le a_i , b_i , c_i \\le 10^5\n\n1 \\le x_i \\le A\n\n1 \\le y_i \\le B\n\nc_i \\le a_{x_i} + b_{y_i}\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B M\na_1 a_2 ... a_A\nb_1 b_2 ... b_B\nx_1 y_1 c_1\n\\vdots\nx_M y_M c_M\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n2 3 1\n3 3\n3 3 3\n1 2 1\n\nSample Output 1\n\n5\n\nWith the ticket, you can get the 1-st refrigerator and the 2-nd microwave for 3+3-1=5 yen.\n\nSample Input 2\n\n1 1 2\n10\n10\n1 1 5\n1 1 10\n\nSample Output 2\n\n10\n\nNote that you cannot use more than one ticket at a time.\n\nSample Input 3\n\n2 2 1\n3 5\n3 5\n2 2 2\n\nSample Output 3\n\n6\n\nYou can get the 1-st refrigerator and the 1-st microwave for 6 yen, which is the minimum amount to pay in this case.\nNote that using a ticket is optional.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1025, "cpu_time_ms": 174, "memory_kb": 2560}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s233366016", "group_id": "codeNet:p02753", "input_text": "#include <stdio.h>\n\nint main(void) {\n  char buf[10];\n  fgets(buf, 5, stdin);\n  \n  if(buf[0] == buf[1] && buf[0] == buf[2])\n    puts(\"No\");\n  else\n    puts(\"Yes\");\n  \n  return 0;\n}", "language": "C", "metadata": {"date": 1583634113, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "problem_description_relpath": "problem_descriptions/p02753.html", "problem_id": "p02753", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02753/input.txt", "sample_output_relpath": "derived/input_output/data/p02753/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02753/C/s233366016.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s233366016", "user_id": "u345524991"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "#include <stdio.h>\n\nint main(void) {\n  char buf[10];\n  fgets(buf, 5, stdin);\n  \n  if(buf[0] == buf[1] && buf[0] == buf[2])\n    puts(\"No\");\n  else\n    puts(\"Yes\");\n  \n  return 0;\n}", "problem_context": "Score : 100 points\n\nProblem Statement\n\nIn AtCoder City, there are three stations numbered 1, 2, and 3.\n\nEach of these stations is operated by one of the two railway companies, A and B. A string S of length 3 represents which company operates each station. If S_i is A, Company A operates Station i; if S_i is B, Company B operates Station i.\n\nTo improve the transportation condition, for each pair of a station operated by Company A and one operated by Company B, there will be a bus service connecting them.\n\nDetermine if there is a pair of stations that will be connected by a bus service.\n\nConstraints\n\nEach character of S is A or B.\n\n|S| = 3\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nIf there is a pair of stations that will be connected by a bus service, print Yes; otherwise, print No.\n\nSample Input 1\n\nABA\n\nSample Output 1\n\nYes\n\nCompany A operates Station 1 and 3, while Company B operates Station 2.\n\nThere will be a bus service between Station 1 and 2, and between Station 2 and 3, so print Yes.\n\nSample Input 2\n\nBBA\n\nSample Output 2\n\nYes\n\nCompany B operates Station 1 and 2, while Company A operates Station 3.\n\nThere will be a bus service between Station 1 and 3, and between Station 2 and 3, so print Yes.\n\nSample Input 3\n\nBBB\n\nSample Output 3\n\nNo\n\nCompany B operates all the stations. Thus, there will be no bus service, so print No.", "sample_input": "ABA\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p02753", "source_text": "Score : 100 points\n\nProblem Statement\n\nIn AtCoder City, there are three stations numbered 1, 2, and 3.\n\nEach of these stations is operated by one of the two railway companies, A and B. A string S of length 3 represents which company operates each station. If S_i is A, Company A operates Station i; if S_i is B, Company B operates Station i.\n\nTo improve the transportation condition, for each pair of a station operated by Company A and one operated by Company B, there will be a bus service connecting them.\n\nDetermine if there is a pair of stations that will be connected by a bus service.\n\nConstraints\n\nEach character of S is A or B.\n\n|S| = 3\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nIf there is a pair of stations that will be connected by a bus service, print Yes; otherwise, print No.\n\nSample Input 1\n\nABA\n\nSample Output 1\n\nYes\n\nCompany A operates Station 1 and 3, while Company B operates Station 2.\n\nThere will be a bus service between Station 1 and 2, and between Station 2 and 3, so print Yes.\n\nSample Input 2\n\nBBA\n\nSample Output 2\n\nYes\n\nCompany B operates Station 1 and 2, while Company A operates Station 3.\n\nThere will be a bus service between Station 1 and 3, and between Station 2 and 3, so print Yes.\n\nSample Input 3\n\nBBB\n\nSample Output 3\n\nNo\n\nCompany B operates all the stations. Thus, there will be no bus service, so print 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": 179, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s450614838", "group_id": "codeNet:p02754", "input_text": "#include <stdio.h>\nint main(void)\n{\n    int N,A,B,s,n;\n    scanf(\"%d%d%d\",&N,&A,&B);\n    s=N%(A+B);\n    n=N/(A+B);\n    if(s>=A)\n        s==A;\n    printf(\"%d\\n\",A*n+s);\n    return 0;\n}\n", "language": "C", "metadata": {"date": 1589556837, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "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/C/s450614838.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s450614838", "user_id": "u208284889"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "#include <stdio.h>\nint main(void)\n{\n    int N,A,B,s,n;\n    scanf(\"%d%d%d\",&N,&A,&B);\n    s=N%(A+B);\n    n=N/(A+B);\n    if(s>=A)\n        s==A;\n    printf(\"%d\\n\",A*n+s);\n    return 0;\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": 184, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s590984196", "group_id": "codeNet:p02754", "input_text": "#include <stdio.h>\n\nint main() {\n\n    long long n, a, b, ans, cal;\n\n    scanf(\"%ld %ld %ld\", &n, &a, &b);\n\n    ans = n / (a + b) * a;\n    cal = n % (a + b);\n\n    if(cal >= a) {\n        ans = ans + a;\n    }\n    else {\n        ans = ans + cal;\n    }\n\n    printf(\"%ld\\n\", ans);\n\n    return 0;\n}", "language": "C", "metadata": {"date": 1586891701, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "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/C/s590984196.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s590984196", "user_id": "u396457730"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "#include <stdio.h>\n\nint main() {\n\n    long long n, a, b, ans, cal;\n\n    scanf(\"%ld %ld %ld\", &n, &a, &b);\n\n    ans = n / (a + b) * a;\n    cal = n % (a + b);\n\n    if(cal >= a) {\n        ans = ans + a;\n    }\n    else {\n        ans = ans + cal;\n    }\n\n    printf(\"%ld\\n\", ans);\n\n    return 0;\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": 291, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s945277099", "group_id": "codeNet:p02754", "input_text": "#include<stdio.h>\n\nint main()\n{\n\tint n,a,b,i,l=0,m=0,s=0;\n\n\tscanf(\"%d%d%d\",&n,&a,&b);\n\tfor(i=0;s<n;i++){\n\t\tl+=a;\n\t\tm+=b;\n\t\ts+=l+m;\n\t}\n\tl+=n-s;\n\tprintf(\"%d\\n\",l);\n\treturn 0;\n}", "language": "C", "metadata": {"date": 1586819056, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "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/C/s945277099.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s945277099", "user_id": "u596813883"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "#include<stdio.h>\n\nint main()\n{\n\tint n,a,b,i,l=0,m=0,s=0;\n\n\tscanf(\"%d%d%d\",&n,&a,&b);\n\tfor(i=0;s<n;i++){\n\t\tl+=a;\n\t\tm+=b;\n\t\ts+=l+m;\n\t}\n\tl+=n-s;\n\tprintf(\"%d\\n\",l);\n\treturn 0;\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": 174, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s428946778", "group_id": "codeNet:p02754", "input_text": "#include <stdio.h>\n\nint main(void){\n\tint b = 0;\n\tint r = 0;\n\tint total = 0;\n\tint bTotal = 0;\n\tint n;\n\n\tscanf(\"%d%d%d\", &n, &b, &r);\n\twhile(total > n){\n\t\ttotal += b;\n\t\tbTotal += b;\n\t\tif(total > n){\n\t\t\tprintf(\"%d\\n\", bTotal - total + n);\n\t\t\tbreak;\n\t\t}\n\t\ttotal += r;\n\t\tif(total > n){\n\t\t\tprintf(\"%d\\n\", bTotal);\n\t\t\tbreak;\n\t\t}\n\t}\n\n\treturn 0;\n}", "language": "C", "metadata": {"date": 1583636656, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "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/C/s428946778.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s428946778", "user_id": "u202667807"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "#include <stdio.h>\n\nint main(void){\n\tint b = 0;\n\tint r = 0;\n\tint total = 0;\n\tint bTotal = 0;\n\tint n;\n\n\tscanf(\"%d%d%d\", &n, &b, &r);\n\twhile(total > n){\n\t\ttotal += b;\n\t\tbTotal += b;\n\t\tif(total > n){\n\t\t\tprintf(\"%d\\n\", bTotal - total + n);\n\t\t\tbreak;\n\t\t}\n\t\ttotal += r;\n\t\tif(total > n){\n\t\t\tprintf(\"%d\\n\", bTotal);\n\t\t\tbreak;\n\t\t}\n\t}\n\n\treturn 0;\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": 338, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s684186040", "group_id": "codeNet:p02755", "input_text": "#include<stdio.h>\n#include<string.h>\n\nint main(){\n int a,b;\n  scanf(\"%d %d\",&a,&b);\n  int c,d,e;\n  float f,g,h;\n  c=a/0.08;\n  d=b/0.1;\n  f=a/0.08;\n  g=b/0.1;\n  h=g-f;\n    if(h>-10 && h<12.5){\n      goto next;\n    }else{\n      printf(\"-1\");\n      \n      return 0;\n    }\n \n  \n    next:;\n    if(c>d){\n      e=a/0.08;\n    }else{\n      e=b/0.1;\n    }\n    printf(\"%d\",e);\n  }\n    ", "language": "C", "metadata": {"date": 1584762001, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "problem_description_relpath": "problem_descriptions/p02755.html", "problem_id": "p02755", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02755/input.txt", "sample_output_relpath": "derived/input_output/data/p02755/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02755/C/s684186040.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s684186040", "user_id": "u815247632"}, "prompt_components": {"gold_output": "25\n", "input_to_evaluate": "#include<stdio.h>\n#include<string.h>\n\nint main(){\n int a,b;\n  scanf(\"%d %d\",&a,&b);\n  int c,d,e;\n  float f,g,h;\n  c=a/0.08;\n  d=b/0.1;\n  f=a/0.08;\n  g=b/0.1;\n  h=g-f;\n    if(h>-10 && h<12.5){\n      goto next;\n    }else{\n      printf(\"-1\");\n      \n      return 0;\n    }\n \n  \n    next:;\n    if(c>d){\n      e=a/0.08;\n    }else{\n      e=b/0.1;\n    }\n    printf(\"%d\",e);\n  }\n    ", "problem_context": "Score : 300 points\n\nProblem Statement\n\nFind the price of a product before tax such that, when the consumption tax rate is 8 percent and 10 percent, the amount of consumption tax levied on it is A yen and B yen, respectively. (Yen is the currency of Japan.)\n\nHere, the price before tax must be a positive integer, and the amount of consumption tax is rounded down to the nearest integer.\n\nIf multiple prices satisfy the condition, print the lowest such price; if no price satisfies the condition, print -1.\n\nConstraints\n\n1 \\leq A \\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\nIf there is a price that satisfies the condition, print an integer representing the lowest such price; otherwise, print -1.\n\nSample Input 1\n\n2 2\n\nSample Output 1\n\n25\n\nIf the price of a product before tax is 25 yen, the amount of consumption tax levied on it is:\n\nWhen the consumption tax rate is 8 percent: \\lfloor 25 \\times 0.08 \\rfloor = \\lfloor 2 \\rfloor = 2 yen.\n\nWhen the consumption tax rate is 10 percent: \\lfloor 25 \\times 0.1 \\rfloor = \\lfloor 2.5 \\rfloor = 2 yen.\n\nThus, the price of 25 yen satisfies the condition. There are other possible prices, such as 26 yen, but print the minimum such price, 25.\n\nSample Input 2\n\n8 10\n\nSample Output 2\n\n100\n\nIf the price of a product before tax is 100 yen, the amount of consumption tax levied on it is:\n\nWhen the consumption tax rate is 8 percent: \\lfloor 100 \\times 0.08 \\rfloor = 8 yen.\n\nWhen the consumption tax rate is 10 percent: \\lfloor 100 \\times 0.1 \\rfloor = 10 yen.\n\nSample Input 3\n\n19 99\n\nSample Output 3\n\n-1\n\nThere is no price before tax satisfying this condition, so print -1.", "sample_input": "2 2\n"}, "reference_outputs": ["25\n"], "source_document_id": "p02755", "source_text": "Score : 300 points\n\nProblem Statement\n\nFind the price of a product before tax such that, when the consumption tax rate is 8 percent and 10 percent, the amount of consumption tax levied on it is A yen and B yen, respectively. (Yen is the currency of Japan.)\n\nHere, the price before tax must be a positive integer, and the amount of consumption tax is rounded down to the nearest integer.\n\nIf multiple prices satisfy the condition, print the lowest such price; if no price satisfies the condition, print -1.\n\nConstraints\n\n1 \\leq A \\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\nIf there is a price that satisfies the condition, print an integer representing the lowest such price; otherwise, print -1.\n\nSample Input 1\n\n2 2\n\nSample Output 1\n\n25\n\nIf the price of a product before tax is 25 yen, the amount of consumption tax levied on it is:\n\nWhen the consumption tax rate is 8 percent: \\lfloor 25 \\times 0.08 \\rfloor = \\lfloor 2 \\rfloor = 2 yen.\n\nWhen the consumption tax rate is 10 percent: \\lfloor 25 \\times 0.1 \\rfloor = \\lfloor 2.5 \\rfloor = 2 yen.\n\nThus, the price of 25 yen satisfies the condition. There are other possible prices, such as 26 yen, but print the minimum such price, 25.\n\nSample Input 2\n\n8 10\n\nSample Output 2\n\n100\n\nIf the price of a product before tax is 100 yen, the amount of consumption tax levied on it is:\n\nWhen the consumption tax rate is 8 percent: \\lfloor 100 \\times 0.08 \\rfloor = 8 yen.\n\nWhen the consumption tax rate is 10 percent: \\lfloor 100 \\times 0.1 \\rfloor = 10 yen.\n\nSample Input 3\n\n19 99\n\nSample Output 3\n\n-1\n\nThere is no price before tax satisfying this condition, so print -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": 374, "cpu_time_ms": 3, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s520920671", "group_id": "codeNet:p02756", "input_text": "#include<stdio.h>\n#include<stdlib.h>\n#include<string.h>\n#include<math.h>\n\n#define MODSIZE 300005\n\nchar queue[300005];\n\nint main(){\n  int head = 0;\n  int tail = 0;\n  int i,q;\n  int com1,com2;\n  char t[3];\n  int rev = 0;\n\n  scanf(\"%s\", queue);\n  scanf(\"%d\", &q);\n  tail++;\n  for(i = 0;i < q;i++){\n    scanf(\"%d\", &com1);\n\n    if(com1 == 1) rev++;\n\n    else if(com1 == 2){\n      scanf(\"%d\", &com2);\n\n      if(rev % 2 == 0){\n      if(com2 == 1){\n        head = (head + MODSIZE - 1) % MODSIZE;\n        scanf(\"%s\", t);\n        queue[head] = t[0];\n      }\n\n      else if(com2 == 2){\n        scanf(\"%s\", t);\n        queue[tail] = t[0];\n        tail = (tail + 1) % MODSIZE;\n      }\n    }\n\n    else{\n      if(com2 == 2){\n        head = (head + MODSIZE - 1) % MODSIZE;\n        scanf(\"%s\", t);\n        queue[head] = t[0];\n      }\n\n      else if(com2 == 2){\n        scanf(\"%s\", t);\n        queue[tail] = t[0];\n        tail = (tail + 1) % MODSIZE;\n      }\n    }\n    }\n  }\n\n    while(head != tail){\n      printf(\"%c\", queue[head]);\n      head = (head + 1) % MODSIZE;\n    }\n\n  printf(\"\\n\");\n\n  return 0;\n}\n", "language": "C", "metadata": {"date": 1587944602, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "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/C/s520920671.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s520920671", "user_id": "u253584031"}, "prompt_components": {"gold_output": "cpa\n", "input_to_evaluate": "#include<stdio.h>\n#include<stdlib.h>\n#include<string.h>\n#include<math.h>\n\n#define MODSIZE 300005\n\nchar queue[300005];\n\nint main(){\n  int head = 0;\n  int tail = 0;\n  int i,q;\n  int com1,com2;\n  char t[3];\n  int rev = 0;\n\n  scanf(\"%s\", queue);\n  scanf(\"%d\", &q);\n  tail++;\n  for(i = 0;i < q;i++){\n    scanf(\"%d\", &com1);\n\n    if(com1 == 1) rev++;\n\n    else if(com1 == 2){\n      scanf(\"%d\", &com2);\n\n      if(rev % 2 == 0){\n      if(com2 == 1){\n        head = (head + MODSIZE - 1) % MODSIZE;\n        scanf(\"%s\", t);\n        queue[head] = t[0];\n      }\n\n      else if(com2 == 2){\n        scanf(\"%s\", t);\n        queue[tail] = t[0];\n        tail = (tail + 1) % MODSIZE;\n      }\n    }\n\n    else{\n      if(com2 == 2){\n        head = (head + MODSIZE - 1) % MODSIZE;\n        scanf(\"%s\", t);\n        queue[head] = t[0];\n      }\n\n      else if(com2 == 2){\n        scanf(\"%s\", t);\n        queue[tail] = t[0];\n        tail = (tail + 1) % MODSIZE;\n      }\n    }\n    }\n  }\n\n    while(head != tail){\n      printf(\"%c\", queue[head]);\n      head = (head + 1) % MODSIZE;\n    }\n\n  printf(\"\\n\");\n\n  return 0;\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": 1090, "cpu_time_ms": 49, "memory_kb": 640}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s062665770", "group_id": "codeNet:p02756", "input_text": "#include <stdio.h>\n#include <stdlib.h>\n#include <string.h>\n#include <strings.h>\n\n#ifdef TEST\nstruct test {\n    int ans;\n} td[] = {\n    {},\n};\n#endif\n\nvoid\nsolver(char *s, int q, int *t, int *f, char *c)\n{\n    int i, j;\n    int top = 0;\n    char pre[200001];\n    char post[200001];\n    char ppp[200001];\n\n    bzero(pre, sizeof(pre));\n    bzero(post, sizeof(post));\n\n    for(i = 0; i < q; i++) {\n        if(t[i] == 1) {\n            top = 1 - top;\n        }\n        if(t[i] == 2) {\n            if(f[i] == 1) {\n                if(top == 0) {\n                    pre[strlen(pre)] = c[i];\n                } else {\n                    post[strlen(post)] = c[i];\n                }\n            } else {\n                if(top == 1) {\n                    pre[strlen(pre)] = c[i];\n                } else {\n                    post[strlen(post)] = c[i];\n                }\n            }\n        }\n    }\n    if(top == 0) {\n        for(i = strlen(pre) - 1; i >= 0; i--)\n            printf(\"%c\", pre[i]);\n        printf(\"%s%s\", s, post);\n    } else {\n        j = 0;\n        bzero(ppp, sizeof(ppp));\n        for(i = strlen(post) - 1; i >= 0; i--)\n            ppp[j++] = post[i];\n        printf(\"%s\", ppp);\n\n        j = 0;\n        bzero(ppp, sizeof(ppp));\n        for(i = strlen(s) - 1; i >= 0; i--)\n            ppp[j++] = s[i];\n        printf(\"%s\", ppp);\n\n        printf(\"%s\", pre);\n    }\n    printf(\"\\n\");\n}\n\nint\nmain(int argc, char *argv[])\n{\n    char S[100001];\n    char tmp[100];\n    int Q;\n    int T[200000];\n    int F[200000];\n    char C[200000];\n    int i;\n\n#ifdef TEST\n    int tt;\n    for(tt = 0; tt < sizeof(td) / sizeof(struct test); tt++) {\n        solver();\n        printf(\"%d\\n\", td[tt].ans);\n    }\n#endif\n    scanf(\"%s\", S);\n    scanf(\"%d\", &Q);\n    for(i = 0; i < Q; i++) {\n        scanf(\"%d\", T + i);\n        if(T[i] == 2) {\n            scanf(\"%d %c\", F + i, C + i);\n        }\n    }\n\n    solver(S, Q, T, F, C);\n    return 0;\n}", "language": "C", "metadata": {"date": 1583638276, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "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/C/s062665770.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s062665770", "user_id": "u913347928"}, "prompt_components": {"gold_output": "cpa\n", "input_to_evaluate": "#include <stdio.h>\n#include <stdlib.h>\n#include <string.h>\n#include <strings.h>\n\n#ifdef TEST\nstruct test {\n    int ans;\n} td[] = {\n    {},\n};\n#endif\n\nvoid\nsolver(char *s, int q, int *t, int *f, char *c)\n{\n    int i, j;\n    int top = 0;\n    char pre[200001];\n    char post[200001];\n    char ppp[200001];\n\n    bzero(pre, sizeof(pre));\n    bzero(post, sizeof(post));\n\n    for(i = 0; i < q; i++) {\n        if(t[i] == 1) {\n            top = 1 - top;\n        }\n        if(t[i] == 2) {\n            if(f[i] == 1) {\n                if(top == 0) {\n                    pre[strlen(pre)] = c[i];\n                } else {\n                    post[strlen(post)] = c[i];\n                }\n            } else {\n                if(top == 1) {\n                    pre[strlen(pre)] = c[i];\n                } else {\n                    post[strlen(post)] = c[i];\n                }\n            }\n        }\n    }\n    if(top == 0) {\n        for(i = strlen(pre) - 1; i >= 0; i--)\n            printf(\"%c\", pre[i]);\n        printf(\"%s%s\", s, post);\n    } else {\n        j = 0;\n        bzero(ppp, sizeof(ppp));\n        for(i = strlen(post) - 1; i >= 0; i--)\n            ppp[j++] = post[i];\n        printf(\"%s\", ppp);\n\n        j = 0;\n        bzero(ppp, sizeof(ppp));\n        for(i = strlen(s) - 1; i >= 0; i--)\n            ppp[j++] = s[i];\n        printf(\"%s\", ppp);\n\n        printf(\"%s\", pre);\n    }\n    printf(\"\\n\");\n}\n\nint\nmain(int argc, char *argv[])\n{\n    char S[100001];\n    char tmp[100];\n    int Q;\n    int T[200000];\n    int F[200000];\n    char C[200000];\n    int i;\n\n#ifdef TEST\n    int tt;\n    for(tt = 0; tt < sizeof(td) / sizeof(struct test); tt++) {\n        solver();\n        printf(\"%d\\n\", td[tt].ans);\n    }\n#endif\n    scanf(\"%s\", S);\n    scanf(\"%d\", &Q);\n    for(i = 0; i < Q; i++) {\n        scanf(\"%d\", T + i);\n        if(T[i] == 2) {\n            scanf(\"%d %c\", F + i, C + i);\n        }\n    }\n\n    solver(S, Q, T, F, C);\n    return 0;\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": 1925, "cpu_time_ms": 2103, "memory_kb": 2816}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s207073280", "group_id": "codeNet:p02757", "input_text": "#include <stdio.h>\nint main(void)\n{\n  int n, p, i, temp_num, left_end, right_end, num_of_divisible;\n  char s[200001];\n\n  scanf(\"%d %d\", &n, &p);            // 標準入力からの値取得\n  scanf(\"%s\", s);                    // 標準入力からの値取得\n\n  num_of_divisible = 0;\n  for (left_end = 0; left_end < n; left_end++) {\n    for (right_end = left_end; right_end < n; right_end++) {\n      temp_num = 0;\n      for (i = left_end; i <= right_end; i++) {\n        temp_num = (temp_num * 10 +((int)s[i] - 48)) % p;\n      }\n      if (temp_num == 0) {\n        num_of_divisible++;\n      }\n    }\n  }\n\n  printf(\"%d\\n\", num_of_divisible);   // 出力\n  return 0;\n}", "language": "C", "metadata": {"date": 1584825742, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "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/C/s207073280.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s207073280", "user_id": "u644790106"}, "prompt_components": {"gold_output": "6\n", "input_to_evaluate": "#include <stdio.h>\nint main(void)\n{\n  int n, p, i, temp_num, left_end, right_end, num_of_divisible;\n  char s[200001];\n\n  scanf(\"%d %d\", &n, &p);            // 標準入力からの値取得\n  scanf(\"%s\", s);                    // 標準入力からの値取得\n\n  num_of_divisible = 0;\n  for (left_end = 0; left_end < n; left_end++) {\n    for (right_end = left_end; right_end < n; right_end++) {\n      temp_num = 0;\n      for (i = left_end; i <= right_end; i++) {\n        temp_num = (temp_num * 10 +((int)s[i] - 48)) % p;\n      }\n      if (temp_num == 0) {\n        num_of_divisible++;\n      }\n    }\n  }\n\n  printf(\"%d\\n\", num_of_divisible);   // 出力\n  return 0;\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": 665, "cpu_time_ms": 2103, "memory_kb": 384}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s181728878", "group_id": "codeNet:p02759", "input_text": "#include<stdio.h>\n\nint main(){\n   int n;\n   scanf(\"%d\", &n);\n   if(n%2 == 0){\n      printf(\"%d\", n/2);\n   } else {\n      printf(\"%d\", n/2+1);\n   }\n\n   return 0;\n}\n", "language": "C", "metadata": {"date": 1597711973, "filename_ext": "c", "original_language": "C (GCC 9.2.1)", "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/C/s181728878.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s181728878", "user_id": "u503636785"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "#include<stdio.h>\n\nint main(){\n   int n;\n   scanf(\"%d\", &n);\n   if(n%2 == 0){\n      printf(\"%d\", n/2);\n   } else {\n      printf(\"%d\", n/2+1);\n   }\n\n   return 0;\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": 163, "cpu_time_ms": 7, "memory_kb": 1700}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s730595535", "group_id": "codeNet:p02759", "input_text": "#include <stdio.h>\nint main(void){\n  int N;\n  int s;\n  int o;\n  scanf(\"%d\",&N);\n  s=N/2;\n  o=N%2;\n  if(o==1){\n    s=s+1;\n  }\n  printf(\"%d\\n\",s);\n  return 0;\n}", "language": "C", "metadata": {"date": 1597616806, "filename_ext": "c", "original_language": "C (GCC 9.2.1)", "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/C/s730595535.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s730595535", "user_id": "u625145093"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "#include <stdio.h>\nint main(void){\n  int N;\n  int s;\n  int o;\n  scanf(\"%d\",&N);\n  s=N/2;\n  o=N%2;\n  if(o==1){\n    s=s+1;\n  }\n  printf(\"%d\\n\",s);\n  return 0;\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": 158, "cpu_time_ms": 3, "memory_kb": 1704}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s923305718", "group_id": "codeNet:p02760", "input_text": "#include <stdio.h>\n\nint main(){\n  int arr[101][101];\n  int flag[101][101];\n  for(int i=0;i<3;i++){\n    for(int j=0;j<3;j++){\n      flag[i][j]=0;\n    }\n  }\n  for(int i=0;i<3;i++){\n    for(int j=0;j<3;j++){\n      scanf(\"%d\",&arr[i][j]);\n    }\n  }\n  int a;\n  scanf(\"%d\",&a);\n  for(int i=0;i<a;i++){\n    int x;\n    scanf(\"%d\",&x);\n    for(int j=0;j<3;j++){\n      for(int k=0;k<3;k++){\n        if(x==arr[j][k])\n          flag[j][k]=1;\n    }\n  }\n}\nfor(int i=0;i<3;i++){\n  for(int j=0;j<3;j++){\n    printf(\"%d \",flag[i][j]);\n  }\n  puts(\"\");\n}\nint flg=0;\nfor(int i=0;i<3;i++){\n  if(flag[0][i]&&flag[1][i]&&flag[2][i]){\n    flg=1;\n  }\n}\nfor(int i=0;i<3;i++){\n  if(flag[i][0]&&flag[i][1]&&flag[i][2]){\n    flg=1;\n  }\n}\nif(flag[0][0]&&flag[1][1]&&flag[2][2]){\n  flg=1;\n\n}if(flag[0][2]&&flag[1][1]&&flag[2][0]){\n  flg=1;\n}\n(flg)?puts(\"Yes\"):puts(\"No\");\n  return 0;\n}\n", "language": "C", "metadata": {"date": 1599020696, "filename_ext": "c", "original_language": "C (Clang 10.0.0)", "problem_description_relpath": "problem_descriptions/p02760.html", "problem_id": "p02760", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02760/input.txt", "sample_output_relpath": "derived/input_output/data/p02760/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02760/C/s923305718.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s923305718", "user_id": "u089230684"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "#include <stdio.h>\n\nint main(){\n  int arr[101][101];\n  int flag[101][101];\n  for(int i=0;i<3;i++){\n    for(int j=0;j<3;j++){\n      flag[i][j]=0;\n    }\n  }\n  for(int i=0;i<3;i++){\n    for(int j=0;j<3;j++){\n      scanf(\"%d\",&arr[i][j]);\n    }\n  }\n  int a;\n  scanf(\"%d\",&a);\n  for(int i=0;i<a;i++){\n    int x;\n    scanf(\"%d\",&x);\n    for(int j=0;j<3;j++){\n      for(int k=0;k<3;k++){\n        if(x==arr[j][k])\n          flag[j][k]=1;\n    }\n  }\n}\nfor(int i=0;i<3;i++){\n  for(int j=0;j<3;j++){\n    printf(\"%d \",flag[i][j]);\n  }\n  puts(\"\");\n}\nint flg=0;\nfor(int i=0;i<3;i++){\n  if(flag[0][i]&&flag[1][i]&&flag[2][i]){\n    flg=1;\n  }\n}\nfor(int i=0;i<3;i++){\n  if(flag[i][0]&&flag[i][1]&&flag[i][2]){\n    flg=1;\n  }\n}\nif(flag[0][0]&&flag[1][1]&&flag[2][2]){\n  flg=1;\n\n}if(flag[0][2]&&flag[1][1]&&flag[2][0]){\n  flg=1;\n}\n(flg)?puts(\"Yes\"):puts(\"No\");\n  return 0;\n}\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nWe have a bingo card with a 3\\times3 grid. The square at the i-th row from the top and the j-th column from the left contains the number A_{i, j}.\n\nThe MC will choose N numbers, b_1, b_2, \\cdots, b_N. If our bingo sheet contains some of those numbers, we will mark them on our sheet.\n\nDetermine whether we will have a bingo when the N numbers are chosen, that is, the sheet will contain three marked numbers in a row, column, or diagonal.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A_{i, j} \\leq 100\n\nA_{i_1, j_1} \\neq A_{i_2, j_2} ((i_1, j_1) \\neq (i_2, j_2))\n\n1 \\leq N \\leq 10\n\n1 \\leq b_i \\leq 100\n\nb_i \\neq b_j (i \\neq j)\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA_{1, 1} A_{1, 2} A_{1, 3}\nA_{2, 1} A_{2, 2} A_{2, 3}\nA_{3, 1} A_{3, 2} A_{3, 3}\nN\nb_1\n\\vdots\nb_N\n\nOutput\n\nIf we will have a bingo, print Yes; otherwise, print No.\n\nSample Input 1\n\n84 97 66\n79 89 11\n61 59 7\n7\n89\n7\n87\n79\n24\n84\n30\n\nSample Output 1\n\nYes\n\nWe will mark A_{1, 1}, A_{2, 1}, A_{2, 2}, A_{3, 3}, and complete the diagonal from the top-left to the bottom-right.\n\nSample Input 2\n\n41 7 46\n26 89 2\n78 92 8\n5\n6\n45\n16\n57\n17\n\nSample Output 2\n\nNo\n\nWe will mark nothing.\n\nSample Input 3\n\n60 88 34\n92 41 43\n65 73 48\n10\n60\n43\n88\n11\n48\n73\n65\n41\n92\n34\n\nSample Output 3\n\nYes\n\nWe will mark all the squares.", "sample_input": "84 97 66\n79 89 11\n61 59 7\n7\n89\n7\n87\n79\n24\n84\n30\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p02760", "source_text": "Score : 200 points\n\nProblem Statement\n\nWe have a bingo card with a 3\\times3 grid. The square at the i-th row from the top and the j-th column from the left contains the number A_{i, j}.\n\nThe MC will choose N numbers, b_1, b_2, \\cdots, b_N. If our bingo sheet contains some of those numbers, we will mark them on our sheet.\n\nDetermine whether we will have a bingo when the N numbers are chosen, that is, the sheet will contain three marked numbers in a row, column, or diagonal.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A_{i, j} \\leq 100\n\nA_{i_1, j_1} \\neq A_{i_2, j_2} ((i_1, j_1) \\neq (i_2, j_2))\n\n1 \\leq N \\leq 10\n\n1 \\leq b_i \\leq 100\n\nb_i \\neq b_j (i \\neq j)\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA_{1, 1} A_{1, 2} A_{1, 3}\nA_{2, 1} A_{2, 2} A_{2, 3}\nA_{3, 1} A_{3, 2} A_{3, 3}\nN\nb_1\n\\vdots\nb_N\n\nOutput\n\nIf we will have a bingo, print Yes; otherwise, print No.\n\nSample Input 1\n\n84 97 66\n79 89 11\n61 59 7\n7\n89\n7\n87\n79\n24\n84\n30\n\nSample Output 1\n\nYes\n\nWe will mark A_{1, 1}, A_{2, 1}, A_{2, 2}, A_{3, 3}, and complete the diagonal from the top-left to the bottom-right.\n\nSample Input 2\n\n41 7 46\n26 89 2\n78 92 8\n5\n6\n45\n16\n57\n17\n\nSample Output 2\n\nNo\n\nWe will mark nothing.\n\nSample Input 3\n\n60 88 34\n92 41 43\n65 73 48\n10\n60\n43\n88\n11\n48\n73\n65\n41\n92\n34\n\nSample Output 3\n\nYes\n\nWe will mark all the squares.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 855, "cpu_time_ms": 5, "memory_kb": 2160}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s746871755", "group_id": "codeNet:p02760", "input_text": "#include<stdio.h>\n\nint main(void)\n{\n  int a[3][3],n,i,j,k;\n  for(i=0;i<3;i++)\n    for(j=0;j<3;j++)\n      scanf(\"%d\",&a[i][j]);\n  scanf(\"%d\",&n);\n  int b[n];\n  for(k=0;k<n;k++)\n    scanf(\"%d\",&b[k]);\n  for(i=0;i<3;i++)\n    for(j=0;j<3;j++)\n      for(k=0;k<n;k++)\n        if(a[i][j]==b[k])\n          a[i][j] = 0;\n  for(i=0;i<3;i++){\n    if(a[i][0]+a[i][1]+a[i][2]==0){\n      printf(\"Yes\\n\");\n      return 0;\n    }\n    else if(a[0][i]+a[1][i]+a[2][i]==0){\n      printf(\"Yes\\n\");\n      return 0;\n    }\n  }\n  if(a[0][0]+a[1][1]+a[2][2]==0){\n     printf(\"Yes\\n\");\n     return 0;\n    }\n  else if(a[2][2]+a[1][1]+a[0][0]==0){\n     printf(\"Yes\\n\");\n     return 0;\n    }\n  else\n    printf(\"No\\n\");\n  return 0;\n}", "language": "C", "metadata": {"date": 1588266502, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "problem_description_relpath": "problem_descriptions/p02760.html", "problem_id": "p02760", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02760/input.txt", "sample_output_relpath": "derived/input_output/data/p02760/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02760/C/s746871755.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s746871755", "user_id": "u803101149"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "#include<stdio.h>\n\nint main(void)\n{\n  int a[3][3],n,i,j,k;\n  for(i=0;i<3;i++)\n    for(j=0;j<3;j++)\n      scanf(\"%d\",&a[i][j]);\n  scanf(\"%d\",&n);\n  int b[n];\n  for(k=0;k<n;k++)\n    scanf(\"%d\",&b[k]);\n  for(i=0;i<3;i++)\n    for(j=0;j<3;j++)\n      for(k=0;k<n;k++)\n        if(a[i][j]==b[k])\n          a[i][j] = 0;\n  for(i=0;i<3;i++){\n    if(a[i][0]+a[i][1]+a[i][2]==0){\n      printf(\"Yes\\n\");\n      return 0;\n    }\n    else if(a[0][i]+a[1][i]+a[2][i]==0){\n      printf(\"Yes\\n\");\n      return 0;\n    }\n  }\n  if(a[0][0]+a[1][1]+a[2][2]==0){\n     printf(\"Yes\\n\");\n     return 0;\n    }\n  else if(a[2][2]+a[1][1]+a[0][0]==0){\n     printf(\"Yes\\n\");\n     return 0;\n    }\n  else\n    printf(\"No\\n\");\n  return 0;\n}", "problem_context": "Score : 200 points\n\nProblem Statement\n\nWe have a bingo card with a 3\\times3 grid. The square at the i-th row from the top and the j-th column from the left contains the number A_{i, j}.\n\nThe MC will choose N numbers, b_1, b_2, \\cdots, b_N. If our bingo sheet contains some of those numbers, we will mark them on our sheet.\n\nDetermine whether we will have a bingo when the N numbers are chosen, that is, the sheet will contain three marked numbers in a row, column, or diagonal.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A_{i, j} \\leq 100\n\nA_{i_1, j_1} \\neq A_{i_2, j_2} ((i_1, j_1) \\neq (i_2, j_2))\n\n1 \\leq N \\leq 10\n\n1 \\leq b_i \\leq 100\n\nb_i \\neq b_j (i \\neq j)\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA_{1, 1} A_{1, 2} A_{1, 3}\nA_{2, 1} A_{2, 2} A_{2, 3}\nA_{3, 1} A_{3, 2} A_{3, 3}\nN\nb_1\n\\vdots\nb_N\n\nOutput\n\nIf we will have a bingo, print Yes; otherwise, print No.\n\nSample Input 1\n\n84 97 66\n79 89 11\n61 59 7\n7\n89\n7\n87\n79\n24\n84\n30\n\nSample Output 1\n\nYes\n\nWe will mark A_{1, 1}, A_{2, 1}, A_{2, 2}, A_{3, 3}, and complete the diagonal from the top-left to the bottom-right.\n\nSample Input 2\n\n41 7 46\n26 89 2\n78 92 8\n5\n6\n45\n16\n57\n17\n\nSample Output 2\n\nNo\n\nWe will mark nothing.\n\nSample Input 3\n\n60 88 34\n92 41 43\n65 73 48\n10\n60\n43\n88\n11\n48\n73\n65\n41\n92\n34\n\nSample Output 3\n\nYes\n\nWe will mark all the squares.", "sample_input": "84 97 66\n79 89 11\n61 59 7\n7\n89\n7\n87\n79\n24\n84\n30\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p02760", "source_text": "Score : 200 points\n\nProblem Statement\n\nWe have a bingo card with a 3\\times3 grid. The square at the i-th row from the top and the j-th column from the left contains the number A_{i, j}.\n\nThe MC will choose N numbers, b_1, b_2, \\cdots, b_N. If our bingo sheet contains some of those numbers, we will mark them on our sheet.\n\nDetermine whether we will have a bingo when the N numbers are chosen, that is, the sheet will contain three marked numbers in a row, column, or diagonal.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A_{i, j} \\leq 100\n\nA_{i_1, j_1} \\neq A_{i_2, j_2} ((i_1, j_1) \\neq (i_2, j_2))\n\n1 \\leq N \\leq 10\n\n1 \\leq b_i \\leq 100\n\nb_i \\neq b_j (i \\neq j)\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA_{1, 1} A_{1, 2} A_{1, 3}\nA_{2, 1} A_{2, 2} A_{2, 3}\nA_{3, 1} A_{3, 2} A_{3, 3}\nN\nb_1\n\\vdots\nb_N\n\nOutput\n\nIf we will have a bingo, print Yes; otherwise, print No.\n\nSample Input 1\n\n84 97 66\n79 89 11\n61 59 7\n7\n89\n7\n87\n79\n24\n84\n30\n\nSample Output 1\n\nYes\n\nWe will mark A_{1, 1}, A_{2, 1}, A_{2, 2}, A_{3, 3}, and complete the diagonal from the top-left to the bottom-right.\n\nSample Input 2\n\n41 7 46\n26 89 2\n78 92 8\n5\n6\n45\n16\n57\n17\n\nSample Output 2\n\nNo\n\nWe will mark nothing.\n\nSample Input 3\n\n60 88 34\n92 41 43\n65 73 48\n10\n60\n43\n88\n11\n48\n73\n65\n41\n92\n34\n\nSample Output 3\n\nYes\n\nWe will mark all the squares.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 701, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s620792217", "group_id": "codeNet:p02760", "input_text": "#include<stdio.h>\nint main(){\n  int a[4][4];\n  int i,j,k,check=0;\n  for(i=0;i<3;i++)\n    for(j=0;j<3;j++)\n      scanf(\"%d\",&a[i][j]);\n  int n;\n  scanf(\"%d\",&n);\n  int b[n+1];\n  for(i=0;i<n;i++){\n    scanf(\"%d\",&b[i]);\n    for(j=0;j<3;j++)\n      for(k=0;k<3;k++)\n        if(b[i]==a[j][k])\n          a[j][k]=0;\n  }\n  for(i=0;i<3;i++)\n    if(((a[i][0]==a[i][1])&&(a[i][1]==a[i][2]))||((a[0][i]==a[1][i])&&(a[1][i]==a[2][i])))\n  if(a[0][0]==a[1][1] && a[1][1]==a[2][2])\n  if(a[0][2]==a[1][1] && a[1][1]==a[2][0])\n    check=1;\n  if(check==1)\n    printf(\"Yes\\n\");\n  else\n    printf(\"No\\n\");\n  return 0;\n}", "language": "C", "metadata": {"date": 1586408535, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "problem_description_relpath": "problem_descriptions/p02760.html", "problem_id": "p02760", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02760/input.txt", "sample_output_relpath": "derived/input_output/data/p02760/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02760/C/s620792217.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s620792217", "user_id": "u353919145"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "#include<stdio.h>\nint main(){\n  int a[4][4];\n  int i,j,k,check=0;\n  for(i=0;i<3;i++)\n    for(j=0;j<3;j++)\n      scanf(\"%d\",&a[i][j]);\n  int n;\n  scanf(\"%d\",&n);\n  int b[n+1];\n  for(i=0;i<n;i++){\n    scanf(\"%d\",&b[i]);\n    for(j=0;j<3;j++)\n      for(k=0;k<3;k++)\n        if(b[i]==a[j][k])\n          a[j][k]=0;\n  }\n  for(i=0;i<3;i++)\n    if(((a[i][0]==a[i][1])&&(a[i][1]==a[i][2]))||((a[0][i]==a[1][i])&&(a[1][i]==a[2][i])))\n  if(a[0][0]==a[1][1] && a[1][1]==a[2][2])\n  if(a[0][2]==a[1][1] && a[1][1]==a[2][0])\n    check=1;\n  if(check==1)\n    printf(\"Yes\\n\");\n  else\n    printf(\"No\\n\");\n  return 0;\n}", "problem_context": "Score : 200 points\n\nProblem Statement\n\nWe have a bingo card with a 3\\times3 grid. The square at the i-th row from the top and the j-th column from the left contains the number A_{i, j}.\n\nThe MC will choose N numbers, b_1, b_2, \\cdots, b_N. If our bingo sheet contains some of those numbers, we will mark them on our sheet.\n\nDetermine whether we will have a bingo when the N numbers are chosen, that is, the sheet will contain three marked numbers in a row, column, or diagonal.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A_{i, j} \\leq 100\n\nA_{i_1, j_1} \\neq A_{i_2, j_2} ((i_1, j_1) \\neq (i_2, j_2))\n\n1 \\leq N \\leq 10\n\n1 \\leq b_i \\leq 100\n\nb_i \\neq b_j (i \\neq j)\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA_{1, 1} A_{1, 2} A_{1, 3}\nA_{2, 1} A_{2, 2} A_{2, 3}\nA_{3, 1} A_{3, 2} A_{3, 3}\nN\nb_1\n\\vdots\nb_N\n\nOutput\n\nIf we will have a bingo, print Yes; otherwise, print No.\n\nSample Input 1\n\n84 97 66\n79 89 11\n61 59 7\n7\n89\n7\n87\n79\n24\n84\n30\n\nSample Output 1\n\nYes\n\nWe will mark A_{1, 1}, A_{2, 1}, A_{2, 2}, A_{3, 3}, and complete the diagonal from the top-left to the bottom-right.\n\nSample Input 2\n\n41 7 46\n26 89 2\n78 92 8\n5\n6\n45\n16\n57\n17\n\nSample Output 2\n\nNo\n\nWe will mark nothing.\n\nSample Input 3\n\n60 88 34\n92 41 43\n65 73 48\n10\n60\n43\n88\n11\n48\n73\n65\n41\n92\n34\n\nSample Output 3\n\nYes\n\nWe will mark all the squares.", "sample_input": "84 97 66\n79 89 11\n61 59 7\n7\n89\n7\n87\n79\n24\n84\n30\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p02760", "source_text": "Score : 200 points\n\nProblem Statement\n\nWe have a bingo card with a 3\\times3 grid. The square at the i-th row from the top and the j-th column from the left contains the number A_{i, j}.\n\nThe MC will choose N numbers, b_1, b_2, \\cdots, b_N. If our bingo sheet contains some of those numbers, we will mark them on our sheet.\n\nDetermine whether we will have a bingo when the N numbers are chosen, that is, the sheet will contain three marked numbers in a row, column, or diagonal.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A_{i, j} \\leq 100\n\nA_{i_1, j_1} \\neq A_{i_2, j_2} ((i_1, j_1) \\neq (i_2, j_2))\n\n1 \\leq N \\leq 10\n\n1 \\leq b_i \\leq 100\n\nb_i \\neq b_j (i \\neq j)\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA_{1, 1} A_{1, 2} A_{1, 3}\nA_{2, 1} A_{2, 2} A_{2, 3}\nA_{3, 1} A_{3, 2} A_{3, 3}\nN\nb_1\n\\vdots\nb_N\n\nOutput\n\nIf we will have a bingo, print Yes; otherwise, print No.\n\nSample Input 1\n\n84 97 66\n79 89 11\n61 59 7\n7\n89\n7\n87\n79\n24\n84\n30\n\nSample Output 1\n\nYes\n\nWe will mark A_{1, 1}, A_{2, 1}, A_{2, 2}, A_{3, 3}, and complete the diagonal from the top-left to the bottom-right.\n\nSample Input 2\n\n41 7 46\n26 89 2\n78 92 8\n5\n6\n45\n16\n57\n17\n\nSample Output 2\n\nNo\n\nWe will mark nothing.\n\nSample Input 3\n\n60 88 34\n92 41 43\n65 73 48\n10\n60\n43\n88\n11\n48\n73\n65\n41\n92\n34\n\nSample Output 3\n\nYes\n\nWe will mark all the squares.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 598, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s877217142", "group_id": "codeNet:p02760", "input_text": "\n#include <stdio.h>\n#include <stdlib.h>\n\n\nint main(void) {\n\n\tint A[3][3],N,b[100];\n\tint tate,yoko,naname1,naname2;\n    int i,j,k;\n\n    for(i=0;i<3;i++)\n\t   {scanf(\"%d %d %d\",&A[i][0],&A[i][1],&A[i][2]);}\n    scanf(\"%d\",&N);\n    for(i=0;i<N;i++) {scanf(\"%d\",&b[i]);}\n\n    //tate & yoko\n    for(i=0;i<3;i++) {\n    \ttate=yoko=0;\n    \tfor(j=0;j<3;j++){\n    \t\tfor(k=0;k<N;k++){\n    \t\t   if(A[i][j]==b[k]) tate++;\n    \t\t   if(A[j][i]==b[k]) yoko++;\n    \t\t}\n    \t}\n    \tif((tate==3) || (yoko==3))\n    \t  {printf(\"Yes\");return(0);}\n    }\n\n    //naname\n    naname1=naname2=0;\n    for(i=0;i<3;i++){\n       for(k=0;k<N;k++) {\n    \t   if(A[i][i]   ==b[k]) naname1++;\n    \t   if(A[2-i][i] ==b[k]) naname2++;\n       }\n       if(naname1==3 || naname2==3)\n       {printf(\"yes\");return(0);}\n    }\n    printf(\"No\");return(0);\n }\n\n", "language": "C", "metadata": {"date": 1584395699, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "problem_description_relpath": "problem_descriptions/p02760.html", "problem_id": "p02760", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02760/input.txt", "sample_output_relpath": "derived/input_output/data/p02760/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02760/C/s877217142.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s877217142", "user_id": "u918599282"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "\n#include <stdio.h>\n#include <stdlib.h>\n\n\nint main(void) {\n\n\tint A[3][3],N,b[100];\n\tint tate,yoko,naname1,naname2;\n    int i,j,k;\n\n    for(i=0;i<3;i++)\n\t   {scanf(\"%d %d %d\",&A[i][0],&A[i][1],&A[i][2]);}\n    scanf(\"%d\",&N);\n    for(i=0;i<N;i++) {scanf(\"%d\",&b[i]);}\n\n    //tate & yoko\n    for(i=0;i<3;i++) {\n    \ttate=yoko=0;\n    \tfor(j=0;j<3;j++){\n    \t\tfor(k=0;k<N;k++){\n    \t\t   if(A[i][j]==b[k]) tate++;\n    \t\t   if(A[j][i]==b[k]) yoko++;\n    \t\t}\n    \t}\n    \tif((tate==3) || (yoko==3))\n    \t  {printf(\"Yes\");return(0);}\n    }\n\n    //naname\n    naname1=naname2=0;\n    for(i=0;i<3;i++){\n       for(k=0;k<N;k++) {\n    \t   if(A[i][i]   ==b[k]) naname1++;\n    \t   if(A[2-i][i] ==b[k]) naname2++;\n       }\n       if(naname1==3 || naname2==3)\n       {printf(\"yes\");return(0);}\n    }\n    printf(\"No\");return(0);\n }\n\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nWe have a bingo card with a 3\\times3 grid. The square at the i-th row from the top and the j-th column from the left contains the number A_{i, j}.\n\nThe MC will choose N numbers, b_1, b_2, \\cdots, b_N. If our bingo sheet contains some of those numbers, we will mark them on our sheet.\n\nDetermine whether we will have a bingo when the N numbers are chosen, that is, the sheet will contain three marked numbers in a row, column, or diagonal.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A_{i, j} \\leq 100\n\nA_{i_1, j_1} \\neq A_{i_2, j_2} ((i_1, j_1) \\neq (i_2, j_2))\n\n1 \\leq N \\leq 10\n\n1 \\leq b_i \\leq 100\n\nb_i \\neq b_j (i \\neq j)\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA_{1, 1} A_{1, 2} A_{1, 3}\nA_{2, 1} A_{2, 2} A_{2, 3}\nA_{3, 1} A_{3, 2} A_{3, 3}\nN\nb_1\n\\vdots\nb_N\n\nOutput\n\nIf we will have a bingo, print Yes; otherwise, print No.\n\nSample Input 1\n\n84 97 66\n79 89 11\n61 59 7\n7\n89\n7\n87\n79\n24\n84\n30\n\nSample Output 1\n\nYes\n\nWe will mark A_{1, 1}, A_{2, 1}, A_{2, 2}, A_{3, 3}, and complete the diagonal from the top-left to the bottom-right.\n\nSample Input 2\n\n41 7 46\n26 89 2\n78 92 8\n5\n6\n45\n16\n57\n17\n\nSample Output 2\n\nNo\n\nWe will mark nothing.\n\nSample Input 3\n\n60 88 34\n92 41 43\n65 73 48\n10\n60\n43\n88\n11\n48\n73\n65\n41\n92\n34\n\nSample Output 3\n\nYes\n\nWe will mark all the squares.", "sample_input": "84 97 66\n79 89 11\n61 59 7\n7\n89\n7\n87\n79\n24\n84\n30\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p02760", "source_text": "Score : 200 points\n\nProblem Statement\n\nWe have a bingo card with a 3\\times3 grid. The square at the i-th row from the top and the j-th column from the left contains the number A_{i, j}.\n\nThe MC will choose N numbers, b_1, b_2, \\cdots, b_N. If our bingo sheet contains some of those numbers, we will mark them on our sheet.\n\nDetermine whether we will have a bingo when the N numbers are chosen, that is, the sheet will contain three marked numbers in a row, column, or diagonal.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A_{i, j} \\leq 100\n\nA_{i_1, j_1} \\neq A_{i_2, j_2} ((i_1, j_1) \\neq (i_2, j_2))\n\n1 \\leq N \\leq 10\n\n1 \\leq b_i \\leq 100\n\nb_i \\neq b_j (i \\neq j)\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA_{1, 1} A_{1, 2} A_{1, 3}\nA_{2, 1} A_{2, 2} A_{2, 3}\nA_{3, 1} A_{3, 2} A_{3, 3}\nN\nb_1\n\\vdots\nb_N\n\nOutput\n\nIf we will have a bingo, print Yes; otherwise, print No.\n\nSample Input 1\n\n84 97 66\n79 89 11\n61 59 7\n7\n89\n7\n87\n79\n24\n84\n30\n\nSample Output 1\n\nYes\n\nWe will mark A_{1, 1}, A_{2, 1}, A_{2, 2}, A_{3, 3}, and complete the diagonal from the top-left to the bottom-right.\n\nSample Input 2\n\n41 7 46\n26 89 2\n78 92 8\n5\n6\n45\n16\n57\n17\n\nSample Output 2\n\nNo\n\nWe will mark nothing.\n\nSample Input 3\n\n60 88 34\n92 41 43\n65 73 48\n10\n60\n43\n88\n11\n48\n73\n65\n41\n92\n34\n\nSample Output 3\n\nYes\n\nWe will mark all the squares.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 812, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s898292265", "group_id": "codeNet:p02760", "input_text": "#include <stdio.h>\n\n#define L 3\n\nint main(void) {\n  int A[L][L];\n  int i,j,k;\n  int N;\n  int b[10];\n  int sum;\n  int bingo = 0;\n\n  // ビンゴカード\n  for (i=0; i<L; i++) {\n    for (j=0; j<L; j++) {\n      scanf(\"%d\", &A[i][j]);\n    }\n  }\n\n  // 数字選び\n  scanf(\"%d\", &N);\n  for (k=0; k<N; k++) {\n    scanf(\"%d\", &b[k]);\n  }\n\n  // 印付け\n  for (i=0; i<L; i++) {\n    for (j=0; j<L; j++) {\n      for (k=0; k<N; k++) {\n        if (A[i][j] == b[k]) {\n          A[i][j] = 0;\n          break;\n        }\n      }\n    }\n  }\n\n  // ビンゴ確認\n  // for (i=0; i<L; i++) {\n  //   for (j=0; j<L; j++) {\n  //     printf(\"%d \", A[i][j]);\n  //   }\n  //   printf(\"\\n\");\n  // }\n  // printf(\"\\n\");\n\n  for (i=0; i<L; i++) {\n    sum = 0;\n    for (j=0; j<L; j++) {\n      sum += A[i][j];\n    }\n    // printf(\"sum: %d\\n\", sum);\n    if (sum == 0) bingo = 1;\n  }\n  for (j=0; j<L; j++) {\n    for (i=0; i<L; i++) {\n      sum = 0;\n      sum += A[i][j];\n    }\n    if (sum == 0) bingo = 1;\n  }\n  if (A[0][0] + A[1][1] + A[2][2] == 0) bingo = 1;\n  if (A[0][2] + A[1][1] + A[2][0] == 0) bingo = 1;\n\n  if (bingo) printf(\"Yes\");\n  else printf(\"No\");\n  printf(\"\\n\");\n  return (0);\n}\n", "language": "C", "metadata": {"date": 1583116185, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "problem_description_relpath": "problem_descriptions/p02760.html", "problem_id": "p02760", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02760/input.txt", "sample_output_relpath": "derived/input_output/data/p02760/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02760/C/s898292265.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s898292265", "user_id": "u319245933"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "#include <stdio.h>\n\n#define L 3\n\nint main(void) {\n  int A[L][L];\n  int i,j,k;\n  int N;\n  int b[10];\n  int sum;\n  int bingo = 0;\n\n  // ビンゴカード\n  for (i=0; i<L; i++) {\n    for (j=0; j<L; j++) {\n      scanf(\"%d\", &A[i][j]);\n    }\n  }\n\n  // 数字選び\n  scanf(\"%d\", &N);\n  for (k=0; k<N; k++) {\n    scanf(\"%d\", &b[k]);\n  }\n\n  // 印付け\n  for (i=0; i<L; i++) {\n    for (j=0; j<L; j++) {\n      for (k=0; k<N; k++) {\n        if (A[i][j] == b[k]) {\n          A[i][j] = 0;\n          break;\n        }\n      }\n    }\n  }\n\n  // ビンゴ確認\n  // for (i=0; i<L; i++) {\n  //   for (j=0; j<L; j++) {\n  //     printf(\"%d \", A[i][j]);\n  //   }\n  //   printf(\"\\n\");\n  // }\n  // printf(\"\\n\");\n\n  for (i=0; i<L; i++) {\n    sum = 0;\n    for (j=0; j<L; j++) {\n      sum += A[i][j];\n    }\n    // printf(\"sum: %d\\n\", sum);\n    if (sum == 0) bingo = 1;\n  }\n  for (j=0; j<L; j++) {\n    for (i=0; i<L; i++) {\n      sum = 0;\n      sum += A[i][j];\n    }\n    if (sum == 0) bingo = 1;\n  }\n  if (A[0][0] + A[1][1] + A[2][2] == 0) bingo = 1;\n  if (A[0][2] + A[1][1] + A[2][0] == 0) bingo = 1;\n\n  if (bingo) printf(\"Yes\");\n  else printf(\"No\");\n  printf(\"\\n\");\n  return (0);\n}\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nWe have a bingo card with a 3\\times3 grid. The square at the i-th row from the top and the j-th column from the left contains the number A_{i, j}.\n\nThe MC will choose N numbers, b_1, b_2, \\cdots, b_N. If our bingo sheet contains some of those numbers, we will mark them on our sheet.\n\nDetermine whether we will have a bingo when the N numbers are chosen, that is, the sheet will contain three marked numbers in a row, column, or diagonal.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A_{i, j} \\leq 100\n\nA_{i_1, j_1} \\neq A_{i_2, j_2} ((i_1, j_1) \\neq (i_2, j_2))\n\n1 \\leq N \\leq 10\n\n1 \\leq b_i \\leq 100\n\nb_i \\neq b_j (i \\neq j)\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA_{1, 1} A_{1, 2} A_{1, 3}\nA_{2, 1} A_{2, 2} A_{2, 3}\nA_{3, 1} A_{3, 2} A_{3, 3}\nN\nb_1\n\\vdots\nb_N\n\nOutput\n\nIf we will have a bingo, print Yes; otherwise, print No.\n\nSample Input 1\n\n84 97 66\n79 89 11\n61 59 7\n7\n89\n7\n87\n79\n24\n84\n30\n\nSample Output 1\n\nYes\n\nWe will mark A_{1, 1}, A_{2, 1}, A_{2, 2}, A_{3, 3}, and complete the diagonal from the top-left to the bottom-right.\n\nSample Input 2\n\n41 7 46\n26 89 2\n78 92 8\n5\n6\n45\n16\n57\n17\n\nSample Output 2\n\nNo\n\nWe will mark nothing.\n\nSample Input 3\n\n60 88 34\n92 41 43\n65 73 48\n10\n60\n43\n88\n11\n48\n73\n65\n41\n92\n34\n\nSample Output 3\n\nYes\n\nWe will mark all the squares.", "sample_input": "84 97 66\n79 89 11\n61 59 7\n7\n89\n7\n87\n79\n24\n84\n30\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p02760", "source_text": "Score : 200 points\n\nProblem Statement\n\nWe have a bingo card with a 3\\times3 grid. The square at the i-th row from the top and the j-th column from the left contains the number A_{i, j}.\n\nThe MC will choose N numbers, b_1, b_2, \\cdots, b_N. If our bingo sheet contains some of those numbers, we will mark them on our sheet.\n\nDetermine whether we will have a bingo when the N numbers are chosen, that is, the sheet will contain three marked numbers in a row, column, or diagonal.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A_{i, j} \\leq 100\n\nA_{i_1, j_1} \\neq A_{i_2, j_2} ((i_1, j_1) \\neq (i_2, j_2))\n\n1 \\leq N \\leq 10\n\n1 \\leq b_i \\leq 100\n\nb_i \\neq b_j (i \\neq j)\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA_{1, 1} A_{1, 2} A_{1, 3}\nA_{2, 1} A_{2, 2} A_{2, 3}\nA_{3, 1} A_{3, 2} A_{3, 3}\nN\nb_1\n\\vdots\nb_N\n\nOutput\n\nIf we will have a bingo, print Yes; otherwise, print No.\n\nSample Input 1\n\n84 97 66\n79 89 11\n61 59 7\n7\n89\n7\n87\n79\n24\n84\n30\n\nSample Output 1\n\nYes\n\nWe will mark A_{1, 1}, A_{2, 1}, A_{2, 2}, A_{3, 3}, and complete the diagonal from the top-left to the bottom-right.\n\nSample Input 2\n\n41 7 46\n26 89 2\n78 92 8\n5\n6\n45\n16\n57\n17\n\nSample Output 2\n\nNo\n\nWe will mark nothing.\n\nSample Input 3\n\n60 88 34\n92 41 43\n65 73 48\n10\n60\n43\n88\n11\n48\n73\n65\n41\n92\n34\n\nSample Output 3\n\nYes\n\nWe will mark all the squares.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1160, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s738925699", "group_id": "codeNet:p02760", "input_text": "#include <stdio.h>\n\n\nint main(void){\n    int a[3][3], x[3][3];\n    int i,j;\n    for(i = 0 ; i < 3 ; i++){\n        for(j = 0 ; j < 3 ; j++){\n            scanf(\"%d\", &a[i][j]);\n        }\n    }\n    int n;\n    scanf(\"%d\", &n);\n    int b, k;\n    for(k = 0 ; k < n ; k++){\n        scanf(\"%d\", &b);\n        for(i = 0 ; i < 3 ; i++){\n            for(j = 0 ; j < 3 ; j++){\n                if(a[i][j]==b){\n                    x[i][j] = 1;\n                }\n                else{\n                    x[i][j] = 0;\n                }\n            }\n        }\n    }\n    int xxx=0;\n    int xx;\n    for(i = 0 ; i < 3 ; i++){\n        xx = 0;\n        for(j = 0 ; j < 3 ; j++){\n            if(x[i][j] == 1){\n                xx++;\n            }\n        }\n        if(xx == 3){\n            xxx = 1;\n        }\n    }\n    for(j = 0 ; j < 3 ; j++){\n        xx = 0;\n        for(i = 0 ; i < 3 ; i++){\n            if(x[i][j] == 1){\n                xx++;\n            }\n        }\n        if(xx == 3){\n            xxx = 1;\n        }\n    }\n    if(x[0][0] == 1 && x[1][1] == 1 && x[2][2] == 1){\n        xxx = 1;\n    }\n    if(x[0][2] == 1 && x[1][1] == 1 && x[2][0] == 1){\n        xxx = 1;\n    }\n    if(xxx == 1){\n        printf(\"Yes\\n\");\n    }\n    else{\n        printf(\"No\\n\");\n    }\n\n\n    return 0;\n}", "language": "C", "metadata": {"date": 1583115842, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "problem_description_relpath": "problem_descriptions/p02760.html", "problem_id": "p02760", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02760/input.txt", "sample_output_relpath": "derived/input_output/data/p02760/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02760/C/s738925699.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s738925699", "user_id": "u385514388"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "#include <stdio.h>\n\n\nint main(void){\n    int a[3][3], x[3][3];\n    int i,j;\n    for(i = 0 ; i < 3 ; i++){\n        for(j = 0 ; j < 3 ; j++){\n            scanf(\"%d\", &a[i][j]);\n        }\n    }\n    int n;\n    scanf(\"%d\", &n);\n    int b, k;\n    for(k = 0 ; k < n ; k++){\n        scanf(\"%d\", &b);\n        for(i = 0 ; i < 3 ; i++){\n            for(j = 0 ; j < 3 ; j++){\n                if(a[i][j]==b){\n                    x[i][j] = 1;\n                }\n                else{\n                    x[i][j] = 0;\n                }\n            }\n        }\n    }\n    int xxx=0;\n    int xx;\n    for(i = 0 ; i < 3 ; i++){\n        xx = 0;\n        for(j = 0 ; j < 3 ; j++){\n            if(x[i][j] == 1){\n                xx++;\n            }\n        }\n        if(xx == 3){\n            xxx = 1;\n        }\n    }\n    for(j = 0 ; j < 3 ; j++){\n        xx = 0;\n        for(i = 0 ; i < 3 ; i++){\n            if(x[i][j] == 1){\n                xx++;\n            }\n        }\n        if(xx == 3){\n            xxx = 1;\n        }\n    }\n    if(x[0][0] == 1 && x[1][1] == 1 && x[2][2] == 1){\n        xxx = 1;\n    }\n    if(x[0][2] == 1 && x[1][1] == 1 && x[2][0] == 1){\n        xxx = 1;\n    }\n    if(xxx == 1){\n        printf(\"Yes\\n\");\n    }\n    else{\n        printf(\"No\\n\");\n    }\n\n\n    return 0;\n}", "problem_context": "Score : 200 points\n\nProblem Statement\n\nWe have a bingo card with a 3\\times3 grid. The square at the i-th row from the top and the j-th column from the left contains the number A_{i, j}.\n\nThe MC will choose N numbers, b_1, b_2, \\cdots, b_N. If our bingo sheet contains some of those numbers, we will mark them on our sheet.\n\nDetermine whether we will have a bingo when the N numbers are chosen, that is, the sheet will contain three marked numbers in a row, column, or diagonal.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A_{i, j} \\leq 100\n\nA_{i_1, j_1} \\neq A_{i_2, j_2} ((i_1, j_1) \\neq (i_2, j_2))\n\n1 \\leq N \\leq 10\n\n1 \\leq b_i \\leq 100\n\nb_i \\neq b_j (i \\neq j)\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA_{1, 1} A_{1, 2} A_{1, 3}\nA_{2, 1} A_{2, 2} A_{2, 3}\nA_{3, 1} A_{3, 2} A_{3, 3}\nN\nb_1\n\\vdots\nb_N\n\nOutput\n\nIf we will have a bingo, print Yes; otherwise, print No.\n\nSample Input 1\n\n84 97 66\n79 89 11\n61 59 7\n7\n89\n7\n87\n79\n24\n84\n30\n\nSample Output 1\n\nYes\n\nWe will mark A_{1, 1}, A_{2, 1}, A_{2, 2}, A_{3, 3}, and complete the diagonal from the top-left to the bottom-right.\n\nSample Input 2\n\n41 7 46\n26 89 2\n78 92 8\n5\n6\n45\n16\n57\n17\n\nSample Output 2\n\nNo\n\nWe will mark nothing.\n\nSample Input 3\n\n60 88 34\n92 41 43\n65 73 48\n10\n60\n43\n88\n11\n48\n73\n65\n41\n92\n34\n\nSample Output 3\n\nYes\n\nWe will mark all the squares.", "sample_input": "84 97 66\n79 89 11\n61 59 7\n7\n89\n7\n87\n79\n24\n84\n30\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p02760", "source_text": "Score : 200 points\n\nProblem Statement\n\nWe have a bingo card with a 3\\times3 grid. The square at the i-th row from the top and the j-th column from the left contains the number A_{i, j}.\n\nThe MC will choose N numbers, b_1, b_2, \\cdots, b_N. If our bingo sheet contains some of those numbers, we will mark them on our sheet.\n\nDetermine whether we will have a bingo when the N numbers are chosen, that is, the sheet will contain three marked numbers in a row, column, or diagonal.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A_{i, j} \\leq 100\n\nA_{i_1, j_1} \\neq A_{i_2, j_2} ((i_1, j_1) \\neq (i_2, j_2))\n\n1 \\leq N \\leq 10\n\n1 \\leq b_i \\leq 100\n\nb_i \\neq b_j (i \\neq j)\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA_{1, 1} A_{1, 2} A_{1, 3}\nA_{2, 1} A_{2, 2} A_{2, 3}\nA_{3, 1} A_{3, 2} A_{3, 3}\nN\nb_1\n\\vdots\nb_N\n\nOutput\n\nIf we will have a bingo, print Yes; otherwise, print No.\n\nSample Input 1\n\n84 97 66\n79 89 11\n61 59 7\n7\n89\n7\n87\n79\n24\n84\n30\n\nSample Output 1\n\nYes\n\nWe will mark A_{1, 1}, A_{2, 1}, A_{2, 2}, A_{3, 3}, and complete the diagonal from the top-left to the bottom-right.\n\nSample Input 2\n\n41 7 46\n26 89 2\n78 92 8\n5\n6\n45\n16\n57\n17\n\nSample Output 2\n\nNo\n\nWe will mark nothing.\n\nSample Input 3\n\n60 88 34\n92 41 43\n65 73 48\n10\n60\n43\n88\n11\n48\n73\n65\n41\n92\n34\n\nSample Output 3\n\nYes\n\nWe will mark all the squares.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1265, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s991339693", "group_id": "codeNet:p02762", "input_text": "#include <stdio.h>\n#include <stdlib.h>\n\n#define N 100005\n\ntypedef struct {\n\tint parent;\n\tint appaer;\n\tint member;\n\tint root;\n\tint visit;\n}node_t;\n\nnode_t node[N] = { 0 };\n\nvoid joint(int a, int b) {\n\tint a_root = root(a), b_root = root(b);\n\n\tif (a_root != b_root) {\n\t\tif (node[a_root].member >= node[b_root].member){\n\t\t\tnode[b_root].parent = a_root;\n\t\t\tnode[a_root].member += node[b_root].member;\n\t\t\tnode[b_root].member = 0;\n\t\t}\n\t\telse {\n\t\t\tnode[a_root].parent = b_root;\n\t\t\tnode[b_root].member += node[a_root].member;\n\t\t\tnode[a_root].member = 0;\n\t\t}\n\t}\n\n}\n\nint root(int node_n) {\n\tif (node[node_n].parent == 0)return node_n;\n\telse return root(node[node_n].parent);\n}\nint main(void) {\n\tint n, m, k;\n\tint a, b;\n\tint c, d;\n\n\tscanf(\"%d %d %d\", &n, &m, &k);\n\tfor (int i = 1; i <= n; i++)node[i].member = 1;\n\tfor (int i = 0; i < m; i++) {\n\t\tscanf(\"%d %d\", &a, &b);\n\t\tnode[a].appaer++, node[b].appaer++;\n\t\t\tjoint(a, b);\n\t}\n\tfor (int i = 1; i <= n; i++)\n\t\tnode[i].root = root(i);\n\tfor (int i = 0; i < k; i++) {\n\t\tscanf(\"%d %d\", &c, &d);\n\t\tif (node[c].root == node[d].root) {\n\t\t\tnode[c].appaer++, node[d].appaer++;\n\t\t}\n\t}\n\n\t/*\n\tfor (int i = 1; i <= n; i++) {\n\t\tprintf(\"node[%d].root=%d\\n\", i, node[i].root);\n\t}\n\tfor (int i = 1; i <= n; i++) {\n\t\tprintf(\"node[%d].member=%d\\n\", i, node[i].member);\n\t}\n\t*/\n\tfor (int i = 1; i <= n; i++) {\n\t\tif (node[node[i].root].member > 1)\n\t\t\tprintf(\"%d \", node[node[i].root].member - node[i].appaer - 1);\n\t\telse printf(\"0 \");\n\t}\n\treturn 0;\n}\n", "language": "C", "metadata": {"date": 1583270488, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "problem_description_relpath": "problem_descriptions/p02762.html", "problem_id": "p02762", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02762/input.txt", "sample_output_relpath": "derived/input_output/data/p02762/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02762/C/s991339693.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s991339693", "user_id": "u105100688"}, "prompt_components": {"gold_output": "0 1 0 1\n", "input_to_evaluate": "#include <stdio.h>\n#include <stdlib.h>\n\n#define N 100005\n\ntypedef struct {\n\tint parent;\n\tint appaer;\n\tint member;\n\tint root;\n\tint visit;\n}node_t;\n\nnode_t node[N] = { 0 };\n\nvoid joint(int a, int b) {\n\tint a_root = root(a), b_root = root(b);\n\n\tif (a_root != b_root) {\n\t\tif (node[a_root].member >= node[b_root].member){\n\t\t\tnode[b_root].parent = a_root;\n\t\t\tnode[a_root].member += node[b_root].member;\n\t\t\tnode[b_root].member = 0;\n\t\t}\n\t\telse {\n\t\t\tnode[a_root].parent = b_root;\n\t\t\tnode[b_root].member += node[a_root].member;\n\t\t\tnode[a_root].member = 0;\n\t\t}\n\t}\n\n}\n\nint root(int node_n) {\n\tif (node[node_n].parent == 0)return node_n;\n\telse return root(node[node_n].parent);\n}\nint main(void) {\n\tint n, m, k;\n\tint a, b;\n\tint c, d;\n\n\tscanf(\"%d %d %d\", &n, &m, &k);\n\tfor (int i = 1; i <= n; i++)node[i].member = 1;\n\tfor (int i = 0; i < m; i++) {\n\t\tscanf(\"%d %d\", &a, &b);\n\t\tnode[a].appaer++, node[b].appaer++;\n\t\t\tjoint(a, b);\n\t}\n\tfor (int i = 1; i <= n; i++)\n\t\tnode[i].root = root(i);\n\tfor (int i = 0; i < k; i++) {\n\t\tscanf(\"%d %d\", &c, &d);\n\t\tif (node[c].root == node[d].root) {\n\t\t\tnode[c].appaer++, node[d].appaer++;\n\t\t}\n\t}\n\n\t/*\n\tfor (int i = 1; i <= n; i++) {\n\t\tprintf(\"node[%d].root=%d\\n\", i, node[i].root);\n\t}\n\tfor (int i = 1; i <= n; i++) {\n\t\tprintf(\"node[%d].member=%d\\n\", i, node[i].member);\n\t}\n\t*/\n\tfor (int i = 1; i <= n; i++) {\n\t\tif (node[node[i].root].member > 1)\n\t\t\tprintf(\"%d \", node[node[i].root].member - node[i].appaer - 1);\n\t\telse printf(\"0 \");\n\t}\n\treturn 0;\n}\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nAn SNS has N users - User 1, User 2, \\cdots, User N.\n\nBetween these N users, there are some relationships - M friendships and K blockships.\n\nFor each i = 1, 2, \\cdots, M, there is a bidirectional friendship between User A_i and User B_i.\n\nFor each i = 1, 2, \\cdots, K, there is a bidirectional blockship between User C_i and User D_i.\n\nWe define User a to be a friend candidate for User b when all of the following four conditions are satisfied:\n\na \\neq b.\n\nThere is not a friendship between User a and User b.\n\nThere is not a blockship between User a and User b.\n\nThere exists a sequence c_0, c_1, c_2, \\cdots, c_L consisting of integers between 1 and N (inclusive) such that c_0 = a, c_L = b, and there is a friendship between User c_i and c_{i+1} for each i = 0, 1, \\cdots, L - 1.\n\nFor each user i = 1, 2, ... N, how many friend candidates does it have?\n\nConstraints\n\nAll values in input are integers.\n\n2 ≤ N ≤ 10^5\n\n0 \\leq M \\leq 10^5\n\n0 \\leq K \\leq 10^5\n\n1 \\leq A_i, B_i \\leq N\n\nA_i \\neq B_i\n\n1 \\leq C_i, D_i \\leq N\n\nC_i \\neq D_i\n\n(A_i, B_i) \\neq (A_j, B_j) (i \\neq j)\n\n(A_i, B_i) \\neq (B_j, A_j)\n\n(C_i, D_i) \\neq (C_j, D_j) (i \\neq j)\n\n(C_i, D_i) \\neq (D_j, C_j)\n\n(A_i, B_i) \\neq (C_j, D_j)\n\n(A_i, B_i) \\neq (D_j, C_j)\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M K\nA_1 B_1\n\\vdots\nA_M B_M\nC_1 D_1\n\\vdots\nC_K D_K\n\nOutput\n\nPrint the answers in order, with space in between.\n\nSample Input 1\n\n4 4 1\n2 1\n1 3\n3 2\n3 4\n4 1\n\nSample Output 1\n\n0 1 0 1\n\nThere is a friendship between User 2 and 3, and between 3 and 4. Also, there is no friendship or blockship between User 2 and 4. Thus, User 4 is a friend candidate for User 2.\n\nHowever, neither User 1 or 3 is a friend candidate for User 2, so User 2 has one friend candidate.\n\nSample Input 2\n\n5 10 0\n1 2\n1 3\n1 4\n1 5\n3 2\n2 4\n2 5\n4 3\n5 3\n4 5\n\nSample Output 2\n\n0 0 0 0 0\n\nEveryone is a friend of everyone else and has no friend candidate.\n\nSample Input 3\n\n10 9 3\n10 1\n6 7\n8 2\n2 5\n8 4\n7 3\n10 9\n6 4\n5 8\n2 6\n7 5\n3 1\n\nSample Output 3\n\n1 3 5 4 3 3 3 3 1 0", "sample_input": "4 4 1\n2 1\n1 3\n3 2\n3 4\n4 1\n"}, "reference_outputs": ["0 1 0 1\n"], "source_document_id": "p02762", "source_text": "Score : 400 points\n\nProblem Statement\n\nAn SNS has N users - User 1, User 2, \\cdots, User N.\n\nBetween these N users, there are some relationships - M friendships and K blockships.\n\nFor each i = 1, 2, \\cdots, M, there is a bidirectional friendship between User A_i and User B_i.\n\nFor each i = 1, 2, \\cdots, K, there is a bidirectional blockship between User C_i and User D_i.\n\nWe define User a to be a friend candidate for User b when all of the following four conditions are satisfied:\n\na \\neq b.\n\nThere is not a friendship between User a and User b.\n\nThere is not a blockship between User a and User b.\n\nThere exists a sequence c_0, c_1, c_2, \\cdots, c_L consisting of integers between 1 and N (inclusive) such that c_0 = a, c_L = b, and there is a friendship between User c_i and c_{i+1} for each i = 0, 1, \\cdots, L - 1.\n\nFor each user i = 1, 2, ... N, how many friend candidates does it have?\n\nConstraints\n\nAll values in input are integers.\n\n2 ≤ N ≤ 10^5\n\n0 \\leq M \\leq 10^5\n\n0 \\leq K \\leq 10^5\n\n1 \\leq A_i, B_i \\leq N\n\nA_i \\neq B_i\n\n1 \\leq C_i, D_i \\leq N\n\nC_i \\neq D_i\n\n(A_i, B_i) \\neq (A_j, B_j) (i \\neq j)\n\n(A_i, B_i) \\neq (B_j, A_j)\n\n(C_i, D_i) \\neq (C_j, D_j) (i \\neq j)\n\n(C_i, D_i) \\neq (D_j, C_j)\n\n(A_i, B_i) \\neq (C_j, D_j)\n\n(A_i, B_i) \\neq (D_j, C_j)\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M K\nA_1 B_1\n\\vdots\nA_M B_M\nC_1 D_1\n\\vdots\nC_K D_K\n\nOutput\n\nPrint the answers in order, with space in between.\n\nSample Input 1\n\n4 4 1\n2 1\n1 3\n3 2\n3 4\n4 1\n\nSample Output 1\n\n0 1 0 1\n\nThere is a friendship between User 2 and 3, and between 3 and 4. Also, there is no friendship or blockship between User 2 and 4. Thus, User 4 is a friend candidate for User 2.\n\nHowever, neither User 1 or 3 is a friend candidate for User 2, so User 2 has one friend candidate.\n\nSample Input 2\n\n5 10 0\n1 2\n1 3\n1 4\n1 5\n3 2\n2 4\n2 5\n4 3\n5 3\n4 5\n\nSample Output 2\n\n0 0 0 0 0\n\nEveryone is a friend of everyone else and has no friend candidate.\n\nSample Input 3\n\n10 9 3\n10 1\n6 7\n8 2\n2 5\n8 4\n7 3\n10 9\n6 4\n5 8\n2 6\n7 5\n3 1\n\nSample Output 3\n\n1 3 5 4 3 3 3 3 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": 1466, "cpu_time_ms": 50, "memory_kb": 2688}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s529388591", "group_id": "codeNet:p02765", "input_text": "#include <stdio.h>\n\nint main(void) {\n\tint N, R;\n\tif (scanf(\"%d%d\", &N, &R) != 2) return 1;\n\tprintf(\"%d\\n\", N >= 10 ? R : R + 100 * (10 - N));\n\treturn 0;\n}\n", "language": "C", "metadata": {"date": 1582804365, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "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/C/s529388591.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s529388591", "user_id": "u646118499"}, "prompt_components": {"gold_output": "3719\n", "input_to_evaluate": "#include <stdio.h>\n\nint main(void) {\n\tint N, R;\n\tif (scanf(\"%d%d\", &N, &R) != 2) return 1;\n\tprintf(\"%d\\n\", N >= 10 ? R : R + 100 * (10 - N));\n\treturn 0;\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": 155, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s190701578", "group_id": "codeNet:p02771", "input_text": "#include <stdio.h>\nint x,y,z;\nint main(void){\n  scanf(\"%d\\n\",&x);\n  scanf(\"%d\\n\",&y);\n  scanf(\"%d\\n\",&z);\n  if((x==y&&x!=z)||(x==z&&x!=y)||(y==z&&y!=x))\n     printf(\"Yes\\n\");\n  else printf(\"No\\n\");\n}", "language": "C", "metadata": {"date": 1593430155, "filename_ext": "c", "original_language": "C (GCC 9.2.1)", "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/C/s190701578.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s190701578", "user_id": "u546713579"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "#include <stdio.h>\nint x,y,z;\nint main(void){\n  scanf(\"%d\\n\",&x);\n  scanf(\"%d\\n\",&y);\n  scanf(\"%d\\n\",&z);\n  if((x==y&&x!=z)||(x==z&&x!=y)||(y==z&&y!=x))\n     printf(\"Yes\\n\");\n  else printf(\"No\\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": 199, "cpu_time_ms": 6, "memory_kb": 1664}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s604505455", "group_id": "codeNet:p02771", "input_text": "#include<stdio.h>\nint main(void){\n  int a,b,c;\n  scanf(\"%d%d%d\", &a, &b, &c);\n  int ispoor= 0;\n  if(a==b&&b!=c)ispoor= 1;\n  if(b==c&&c!=a)ispoor= 1;\n  if(c==a&&a!=b)ispoor= 1;\n  if(ispoor) {\n    puts(\"Yes\");\n  }else{\n    puts(\"No\");\n  }\n  return 0;\n}", "language": "C", "metadata": {"date": 1590522622, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "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/C/s604505455.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s604505455", "user_id": "u582095101"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "#include<stdio.h>\nint main(void){\n  int a,b,c;\n  scanf(\"%d%d%d\", &a, &b, &c);\n  int ispoor= 0;\n  if(a==b&&b!=c)ispoor= 1;\n  if(b==c&&c!=a)ispoor= 1;\n  if(c==a&&a!=b)ispoor= 1;\n  if(ispoor) {\n    puts(\"Yes\");\n  }else{\n    puts(\"No\");\n  }\n  return 0;\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": 250, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s054375470", "group_id": "codeNet:p02772", "input_text": "#include<stdio.h>\nmain()\n{\n    int i,n;\n    int x=1;\n    scanf(\"%d\",&n);\n    int arr[n];\n    for(i=1;i<n;i++)\n    {\n        scanf(\"%d\",&arr[i]);\n    }\n    for(i=1;i<n;i++)\n    {\n        if(arr[i]%2==0&&arr[i]%5!=0&&arr[i]%3!=0)\n        {\n            x=0;\n            break;\n        }\n    }\n        if(x==1)\n        printf(\"APPROVED\");\n        else if(x==0)\n        printf(\"DENIED\");\n}", "language": "C", "metadata": {"date": 1587783113, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "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/C/s054375470.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s054375470", "user_id": "u863370423"}, "prompt_components": {"gold_output": "APPROVED\n", "input_to_evaluate": "#include<stdio.h>\nmain()\n{\n    int i,n;\n    int x=1;\n    scanf(\"%d\",&n);\n    int arr[n];\n    for(i=1;i<n;i++)\n    {\n        scanf(\"%d\",&arr[i]);\n    }\n    for(i=1;i<n;i++)\n    {\n        if(arr[i]%2==0&&arr[i]%5!=0&&arr[i]%3!=0)\n        {\n            x=0;\n            break;\n        }\n    }\n        if(x==1)\n        printf(\"APPROVED\");\n        else if(x==0)\n        printf(\"DENIED\");\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": 384, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s156043074", "group_id": "codeNet:p02773", "input_text": "#include <stdio.h>\n#include <stdlib.h>\n#include <string.h>\n\n#define MAX(a,b) (a > b) ? a : b\n#define MIX(a,b) (a < b) ? a : b\n\nint Amax(int *p,int size){\n   int _max = 0;\n   for(int i = 0;i < size;i++)\n      if(p[i] > _max)_max = p[i];\n   return _max;\n}\n\nint main(){\n   int n;scanf(\"%d\",&n);\n   char paper[200000][11];for(int i = 0;i < n;i++)scanf(\"%s\",paper[i]);\n   char tmp[11];\n   int count[200000] ={0};\n   int pointer;\n   for(int i=1;i<n;i++){\n      for(int j=1;j<n;j++){\n         if(strcmp(paper[j-1], paper[j])>0){\n            strcpy(tmp, paper[j-1]);\n            strcpy(paper[j-1], paper[j]);\n            strcpy(paper[j], tmp);\n         }\n      }\n   }\n   pointer = 0;\n   for(int i = 0;i < n-1;i++){\n      if (!(strcmp(paper[i],paper[i+1]))){\n         count[pointer]++;\n      }else {\n         pointer = i+1;\n      }\n   }\n   /*for(int i = 0;i < n;i++){\n      printf(\"%d\\n\",count[i]);\n      printf(\"%s\\n\",paper[i]);\n   }*/\n\n   int x = Amax(count,n);\n   for(int i = 0;i < n;i++){\n      if(count[i] == x)printf(\"%s\\n\",paper[i]);\n   }\n}\n", "language": "C", "metadata": {"date": 1581888889, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "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/C/s156043074.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s156043074", "user_id": "u596612094"}, "prompt_components": {"gold_output": "beet\nvet\n", "input_to_evaluate": "#include <stdio.h>\n#include <stdlib.h>\n#include <string.h>\n\n#define MAX(a,b) (a > b) ? a : b\n#define MIX(a,b) (a < b) ? a : b\n\nint Amax(int *p,int size){\n   int _max = 0;\n   for(int i = 0;i < size;i++)\n      if(p[i] > _max)_max = p[i];\n   return _max;\n}\n\nint main(){\n   int n;scanf(\"%d\",&n);\n   char paper[200000][11];for(int i = 0;i < n;i++)scanf(\"%s\",paper[i]);\n   char tmp[11];\n   int count[200000] ={0};\n   int pointer;\n   for(int i=1;i<n;i++){\n      for(int j=1;j<n;j++){\n         if(strcmp(paper[j-1], paper[j])>0){\n            strcpy(tmp, paper[j-1]);\n            strcpy(paper[j-1], paper[j]);\n            strcpy(paper[j], tmp);\n         }\n      }\n   }\n   pointer = 0;\n   for(int i = 0;i < n-1;i++){\n      if (!(strcmp(paper[i],paper[i+1]))){\n         count[pointer]++;\n      }else {\n         pointer = i+1;\n      }\n   }\n   /*for(int i = 0;i < n;i++){\n      printf(\"%d\\n\",count[i]);\n      printf(\"%s\\n\",paper[i]);\n   }*/\n\n   int x = Amax(count,n);\n   for(int i = 0;i < n;i++){\n      if(count[i] == x)printf(\"%s\\n\",paper[i]);\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": 1039, "cpu_time_ms": 2103, "memory_kb": 3072}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s233686517", "group_id": "codeNet:p02773", "input_text": "#define _CRT_SECURE_NO_WARNINGS\n\n#include <stdbool.h>\n#include <stdio.h>\n#include <stdlib.h>\n#include <inttypes.h>\n#include <limits.h>\n#include <ctype.h>\n#include <stdint.h>\n#include <string.h>\n#include <wchar.h>\n#include <math.h>\n\n#define N_MAX (100)\n#define P_MAX (100)\n#define DP_ARRAY_SIZE (N_MAX * P_MAX / 32 + 1)\n\n#define MIN(a, b) ((a) < (b) ? (a) : (b))\n#define MAX(a, b) ((a) > (b) ? (a) : (b))\n#define ABS(a) ((a) < 0 ? -(a) : (a))\n#define ABSS(a, b) ((a) > (b) ? (a) - (b) : (b) - (a))\n#define SWAP(type, a, b) { const type tmp = a; a = b; b = tmp; }\n\nint compare_sz_asc(const void* a, const void* b) {\n    return *((size_t*)a) < *((size_t*)b) ? -1 : 1;\n}\n\nint compare_sz_desc(const void* a, const void* b) {\n    return *((size_t*)a) > * ((size_t*)b) ? -1 : 1;\n}\n\nint compare_i64_asc(const void* a, const void* b) {\n    return *((int64_t*)a) < *((int64_t*)b) ? -1 : 1;\n}\n\nint compare_i64_desc(const void* a, const void* b) {\n    return *((int64_t*)a) > * ((int64_t*)b) ? -1 : 1;\n}\n\nint compare_u64_asc(const void* a, const void* b) {\n    return *((uint64_t*)a) < *((uint64_t*)b) ? -1 : 1;\n}\n\nint compare_u64_desc(const void* a, const void* b) {\n    return *((uint64_t*)a) > * ((uint64_t*)b) ? -1 : 1;\n}\n\nint compare_c_asc(const void* a, const void* b) {\n    return *((char*)a) < *((char*)b) ? -1 : 1;\n}\n\nint compare_c_desc(const void* a, const void* b) {\n    return *((char*)a) > * ((char*)b) ? -1 : 1;\n}\n\nint compare_dp_asc(const void* a, const void* b) {\n    return *((double*)a) < *((double*)b) ? -1 : 1;\n}\n\nint compare_str_asc(const void* a, const void* b) {\n    return strcmp((char*)a, (char*)b);\n}\n\nstatic uint64_t modinvU64(const uint64_t a, const uint64_t m) {\n    int64_t aa = (int64_t)a;\n    const int64_t mm = (int64_t)m;\n    int64_t b = mm;\n    int64_t u = 1;\n    int64_t v = 0;\n\n    while (b != 0) {\n        const int64_t t = aa / b;\n\n        aa -= t * b;\n        SWAP(uint64_t, aa, b);\n        u -= t * v;\n        SWAP(uint64_t, u, v);\n    }\n\n    u %= mm;\n    if (u < 0) {\n        u += m;\n    }\n\n    return (uint64_t)u;\n}\n\nstatic size_t powSz(const size_t base, const size_t exp) {\n    if (exp == 0) {\n        return 1;\n    }\n\n    if (exp == 1) {\n        return base;\n    }\n\n    if (exp % 2 == 0) {\n        return powSz(base * base, exp / 2);\n    }\n    else {\n        return base * powSz(base, exp - 1);\n    }\n}\n\nstatic uint64_t powU64(const uint64_t base, const uint64_t exp) {\n    if (exp == 0) {\n        return 1;\n    }\n\n    if (exp == 1) {\n        return base;\n    }\n\n    if (exp % 2 == 0) {\n        return powU64(base * base, exp / 2);\n    }\n    else {\n        return base * powU64(base, exp - 1);\n    }\n}\n\nstatic uint64_t powU64WMod(const uint64_t base, const uint64_t exp, const uint64_t m) {\n    if (exp == 0) {\n        return 1;\n    }\n\n    if (exp == 1) {\n        return base % m;\n    }\n\n    if (exp % 2 == 0) {\n        return powU64WMod(base * base % m, exp / 2, m);\n    }\n    else {\n        return base * powU64WMod(base, exp - 1, m) % m;\n    }\n}\n\nstatic size_t combSz(const size_t n, const size_t r) {\n    size_t result = 1;\n\n    for (size_t i = 0; i < r; i++) {\n        result *= n - i;\n        result /= i + 1;\n    }\n\n    return result;\n}\n\nstatic uint64_t combU64(const uint64_t n, const uint64_t r) {\n    uint64_t result = 1;\n\n    for (uint64_t i = 0; i < r; i++) {\n        result *= n - i;\n        result /= i + 1;\n    }\n\n    return result;\n}\n\nstatic uint64_t combU64WMod(const uint64_t n, const uint64_t r, const uint64_t m) {\n    uint64_t result = 1;\n    uint64_t inv = 1;\n\n    for (uint64_t i = 0; i < r; i++) {\n        result = result * (n - i) % m;\n        inv = inv * (i + 1) % m;\n    }\n\n    return result * modinvU64(inv, m) % m;\n}\n\nstatic uint64_t permU64(const uint64_t n) {\n    uint64_t result = 1;\n\n    for (uint64_t v = 2; v <= n; v++) {\n        result *= v;\n    }\n\n    return result;\n}\n\nstatic uint64_t permU64WMod(const uint64_t n, const uint64_t m) {\n    uint64_t result = 1;\n\n    for (uint64_t v = 2; v <= n; v++) {\n        result *= v;\n        result %= m;\n    }\n\n    return result;\n}\n\nstatic size_t gcdZu(size_t m, size_t n) {\n    size_t temp;\n\n    while (m % n != 0) {\n        temp = n;\n        n = m % n;\n        m = temp;\n    }\n\n    return n;\n}\n\nstatic uint64_t gcdU64(uint64_t m, uint64_t n)\n{\n    uint64_t temp;\n\n    while (m % n != 0) {\n        temp = n;\n        n = m % n;\n        m = temp;\n    }\n\n    return n;\n}\n\nstatic uint64_t popcntU64(uint64_t val) {\n    uint64_t cnt = 0;\n\n    while (val != 0) {\n        if ((val & UINT64_C(0x1)) != 0) {\n            cnt++;\n        }\n\n        val >>= UINT64_C(0x1);\n    }\n\n    return cnt;\n}\n\ntypedef struct {\n    uint64_t val;\n}BHeap_Val;\n\n#define BHEAP_VAL_TYPE BHeap_Val\n\n#define BHEAP_INVALID_NODE ((size_t)100000000)\n\ntypedef struct {\n    BHEAP_VAL_TYPE val;\n} BHeap_Node;\n\n\nstruct _BHeap_Ctx {\n    size_t size;\n    int (*compare)(const BHEAP_VAL_TYPE* parent, const BHEAP_VAL_TYPE* node);\n    void(*notifyNodeChange)(const struct _BHeap_Ctx* const ctx, const size_t nodeListSize, const size_t* const nodeList);\n    BHeap_Node* node;\n};\n\ntypedef struct _BHeap_Ctx BHeap_Ctx;\n\nstatic void bHeap_Init(BHeap_Ctx* const ctx, int(*compare)(const BHEAP_VAL_TYPE* parent, const BHEAP_VAL_TYPE* node), void(*notifyNodeChange)(const BHeap_Ctx* const ctx, const size_t nodeListSize, const size_t* const nodeList), BHeap_Node* const nodes) {\n    ctx->size = 0;\n    ctx->compare = compare;\n    ctx->notifyNodeChange = notifyNodeChange;\n    ctx->node = nodes;\n}\n\nstatic void bHeap_Swap(BHeap_Ctx* const ctx, const size_t node0, const size_t node1) {\n    const BHEAP_VAL_TYPE tmp = ctx->node[node0].val;\n    ctx->node[node0].val = ctx->node[node1].val;\n    ctx->node[node1].val = tmp;\n\n    if (ctx->notifyNodeChange != NULL) {\n        const size_t nodeList[2] = { node0,node1 };\n        ctx->notifyNodeChange(ctx, 2, nodeList);\n    }\n}\n\nstatic void bHeap_UpHeap(BHeap_Ctx* const ctx, const size_t nodeIdx) {\n    if (nodeIdx == 0) {\n        return;\n    }\n\n    const size_t parentIdx = (nodeIdx + 1) / 2 - 1;\n\n    const int compareResult = ctx->compare(&(ctx->node[parentIdx].val), &(ctx->node[nodeIdx].val));\n\n    if (0 < compareResult) {\n        bHeap_Swap(ctx, nodeIdx, parentIdx);\n\n        if (parentIdx != 0) {\n            bHeap_UpHeap(ctx, parentIdx);\n        }\n    }\n}\n\nstatic void bHeap_DownHeap(BHeap_Ctx* const ctx, const size_t nodeIdx) {\n    if (ctx->size - 1 <= nodeIdx) {\n        return;\n    }\n\n    const size_t leftIdx = 2 * (nodeIdx + 1) - 1;\n\n    if (leftIdx < ctx->size) {\n        const int leftResult = ctx->compare(&(ctx->node[nodeIdx].val), &(ctx->node[leftIdx].val));\n\n        size_t swapTarget = leftResult < 0 ? BHEAP_INVALID_NODE : leftIdx;\n\n        const size_t rightIdx = leftIdx + 1;\n\n        if (rightIdx < ctx->size) {\n            const int rightResult = ctx->compare(&(ctx->node[nodeIdx].val), &(ctx->node[rightIdx].val));\n\n            if (swapTarget == BHEAP_INVALID_NODE) {\n                if (0 < rightResult) {\n                    swapTarget = rightIdx;\n                }\n            }\n            else {\n                if (0 < rightResult) {\n                    const int rightLeftResult = ctx->compare(&(ctx->node[leftIdx].val), &(ctx->node[rightIdx].val));\n\n                    if (0 < rightLeftResult) {\n                        swapTarget = rightIdx;\n                    }\n                }\n            }\n        }\n\n        if (swapTarget != BHEAP_INVALID_NODE) {\n            bHeap_Swap(ctx, nodeIdx, swapTarget);\n\n            bHeap_DownHeap(ctx, swapTarget);\n        }\n    }\n}\n\nstatic void bHeap_Add(BHeap_Ctx* const ctx, const BHEAP_VAL_TYPE val) {\n    ctx->node[ctx->size].val = val;\n\n    ctx->size++;\n\n    if (ctx->notifyNodeChange != NULL) {\n        const size_t node = ctx->size - 1;\n        ctx->notifyNodeChange(ctx, 1, &node);\n    }\n\n    bHeap_UpHeap(ctx, ctx->size - 1);\n}\n\nstatic void bHeap_RemoveTop(BHeap_Ctx* const ctx) {\n    if (ctx->size == 0) {\n        return;\n    }\n\n    if (ctx->size == 1) {\n        ctx->size--;\n        return;\n    }\n\n    ctx->node[0].val = ctx->node[ctx->size - 1].val;\n\n    if (ctx->notifyNodeChange != NULL) {\n        const size_t node = 0;\n        ctx->notifyNodeChange(ctx, 1, &node);\n    }\n\n    ctx->size--;\n\n    bHeap_DownHeap(ctx, 0);\n}\n\nstatic void bHeap_RemoveNode(BHeap_Ctx* const ctx, const size_t node) {\n    if (node == ctx->size - 1) {\n        ctx->size--;\n    }\n    else {\n        ctx->node[node].val = ctx->node[ctx->size - 1].val;\n\n        ctx->size--;\n\n        if (ctx->notifyNodeChange != NULL) {\n            ctx->notifyNodeChange(ctx, 1, &node);\n        }\n\n        bHeap_DownHeap(ctx, node);\n        bHeap_UpHeap(ctx, node);\n    }\n}\n\nstatic BHEAP_VAL_TYPE* bHeap_GetTopVal(const BHeap_Ctx* const ctx) {\n    return ctx->size == 0 ? NULL : &(ctx->node[0].val);\n}\n\ntypedef struct {\n    uint64_t cnt;\n    size_t* child;\n    size_t numChild;\n    size_t maxNumChild;\n} Tree_Node;\n\n#define TREE_INIT_ALLOC (128)\n\nstatic Tree_Node tree_Node[200000];\n\nstatic void tree_Init(const uint64_t N) {\n    for (uint64_t i = 0; i < N; i++) {\n        tree_Node[i].cnt = 0;\n        tree_Node[i].numChild = 0;\n        tree_Node[i].child = malloc(sizeof(size_t) * TREE_INIT_ALLOC);\n        tree_Node[i].maxNumChild = TREE_INIT_ALLOC;\n    }\n}\n\nstatic void tree_AddChild(const size_t parent, const size_t child) {\n    if (tree_Node[parent].maxNumChild <= tree_Node[parent].numChild) {\n        tree_Node[parent].child = realloc(tree_Node[parent].child, sizeof(size_t) * tree_Node[parent].maxNumChild * 2);\n        tree_Node[parent].maxNumChild *= 2;\n    }\n\n    tree_Node[parent].child[tree_Node[parent].numChild] = child;\n    tree_Node[parent].numChild++;\n}\n\nstatic BHeap_Node BN_Asc[200000];\nstatic BHeap_Node BN_Desc[200000];\n\nstatic int _bHeap_Compare_Asc(const BHEAP_VAL_TYPE* parent, const BHEAP_VAL_TYPE* node) {\n    return parent->val <= node->val ? -1 : 1;\n}\n\nstatic int _bHeap_Compare_Desc(const BHEAP_VAL_TYPE* parent, const BHEAP_VAL_TYPE* node) {\n    return parent->val >= node->val ? -1 : 1;\n}\n\nstatic size_t PBHeap_Asc_Idx[200000];\nstatic size_t PBHeap_Desc_Idx[200000];\n\nstatic void _bHeap_NotifyNodeChange_Asc(const BHeap_Ctx* const ctx, const size_t nodeListSize, const size_t* const nodeList) {\n    for (size_t i = 0; i < nodeListSize; i++) {\n        PBHeap_Asc_Idx[ctx->node[nodeList[i]].val.val] = nodeList[i];\n    }\n}\n\nstatic void _bHeap_NotifyNodeChange_Desc(const BHeap_Ctx* const ctx, const size_t nodeListSize, const size_t* const nodeList) {\n    for (size_t i = 0; i < nodeListSize; i++) {\n        PBHeap_Desc_Idx[ctx->node[nodeList[i]].val.val] = nodeList[i];\n    }\n}\n\n#define UF_ROOT ((size_t)10000000)\n\ntypedef struct {\n    size_t parent;\n    uint64_t w;\n    uint64_t v;\n    uint64_t wSum;\n    uint64_t vSum;\n} UF_Node;\n\nstatic UF_Node uf_Node[101];\n\nstatic size_t uf_GetRoot(const size_t idx) {\n    if (uf_Node[idx].parent == UF_ROOT) {\n        return idx;\n    }\n\n    const size_t root = uf_GetRoot(uf_Node[idx].parent);\n\n    uf_Node[idx].parent = root;\n\n    return root;\n}\n\nstatic void uf_Merge(const size_t a, const size_t b) {\n    const size_t aRoot = uf_GetRoot(a);\n    const size_t bRoot = uf_GetRoot(b);\n\n    if (aRoot != bRoot) {\n        uf_Node[aRoot].parent = bRoot;\n\n        uf_Node[bRoot].wSum += uf_Node[aRoot].wSum;\n        uf_Node[bRoot].vSum += uf_Node[aRoot].vSum;\n    }\n}\n\n#define MOD_VAL (UINT64_C(1000000007))\n\nstatic char S[200000][11];\n\ntypedef struct {\n    char S[11];\n    uint64_t cnt;\n} StrList;\n\nstatic StrList sList[200000];\nstatic uint64_t listSize = 0;\n\nint compare_f(const void* a, const void* b) {\n    const StrList* aP = (StrList*)a;\n    const StrList* bP = (StrList*)b;\n\n    if (aP->cnt > bP->cnt) {\n        return -1;\n    }\n    else if (aP->cnt == bP->cnt) {\n        return strcmp(aP->S, bP->S);\n    }\n    else {\n        return 1;\n    }\n}\n\nint main(void) {\n    uint64_t N;\n\n    scanf(\"%\"PRIu64, &N);\n    for (uint64_t i = 0; i < N; i++) {\n        scanf(\"%s\", S[i]);\n\n        sList[i].cnt = 0;\n    }\n\n    qsort(S, (size_t)N, sizeof(char) * 11, compare_str_asc);\n\n    uint64_t cnt = 1;\n\n    for (uint64_t i = 1; i < N; i++) {\n        if (strcmp(S[i], S[i - 1]) == 0) {\n            cnt++;\n        }\n        else {\n            sList[listSize].cnt = cnt;\n            strcpy(sList[listSize].S, S[i - 1]);\n            listSize++;\n\n            cnt = 1;\n        }\n    }\n\n    sList[listSize].cnt = cnt;\n    strcpy(sList[listSize].S, S[N - 1]);\n    listSize++;\n\n    qsort(sList, (size_t)listSize, sizeof(StrList), compare_f);\n\n    puts(sList[0].S);\n    for (uint64_t i = 1; i < listSize; i++) {\n        if (sList[i].cnt == sList[0].cnt) {\n            puts(sList[i].S);\n        }\n        else {\n            return 0;\n        }\n    }\n\n    return 0;\n}\n", "language": "C", "metadata": {"date": 1581884786, "filename_ext": "c", "original_language": "C (Clang 3.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/C/s233686517.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s233686517", "user_id": "u615782628"}, "prompt_components": {"gold_output": "beet\nvet\n", "input_to_evaluate": "#define _CRT_SECURE_NO_WARNINGS\n\n#include <stdbool.h>\n#include <stdio.h>\n#include <stdlib.h>\n#include <inttypes.h>\n#include <limits.h>\n#include <ctype.h>\n#include <stdint.h>\n#include <string.h>\n#include <wchar.h>\n#include <math.h>\n\n#define N_MAX (100)\n#define P_MAX (100)\n#define DP_ARRAY_SIZE (N_MAX * P_MAX / 32 + 1)\n\n#define MIN(a, b) ((a) < (b) ? (a) : (b))\n#define MAX(a, b) ((a) > (b) ? (a) : (b))\n#define ABS(a) ((a) < 0 ? -(a) : (a))\n#define ABSS(a, b) ((a) > (b) ? (a) - (b) : (b) - (a))\n#define SWAP(type, a, b) { const type tmp = a; a = b; b = tmp; }\n\nint compare_sz_asc(const void* a, const void* b) {\n    return *((size_t*)a) < *((size_t*)b) ? -1 : 1;\n}\n\nint compare_sz_desc(const void* a, const void* b) {\n    return *((size_t*)a) > * ((size_t*)b) ? -1 : 1;\n}\n\nint compare_i64_asc(const void* a, const void* b) {\n    return *((int64_t*)a) < *((int64_t*)b) ? -1 : 1;\n}\n\nint compare_i64_desc(const void* a, const void* b) {\n    return *((int64_t*)a) > * ((int64_t*)b) ? -1 : 1;\n}\n\nint compare_u64_asc(const void* a, const void* b) {\n    return *((uint64_t*)a) < *((uint64_t*)b) ? -1 : 1;\n}\n\nint compare_u64_desc(const void* a, const void* b) {\n    return *((uint64_t*)a) > * ((uint64_t*)b) ? -1 : 1;\n}\n\nint compare_c_asc(const void* a, const void* b) {\n    return *((char*)a) < *((char*)b) ? -1 : 1;\n}\n\nint compare_c_desc(const void* a, const void* b) {\n    return *((char*)a) > * ((char*)b) ? -1 : 1;\n}\n\nint compare_dp_asc(const void* a, const void* b) {\n    return *((double*)a) < *((double*)b) ? -1 : 1;\n}\n\nint compare_str_asc(const void* a, const void* b) {\n    return strcmp((char*)a, (char*)b);\n}\n\nstatic uint64_t modinvU64(const uint64_t a, const uint64_t m) {\n    int64_t aa = (int64_t)a;\n    const int64_t mm = (int64_t)m;\n    int64_t b = mm;\n    int64_t u = 1;\n    int64_t v = 0;\n\n    while (b != 0) {\n        const int64_t t = aa / b;\n\n        aa -= t * b;\n        SWAP(uint64_t, aa, b);\n        u -= t * v;\n        SWAP(uint64_t, u, v);\n    }\n\n    u %= mm;\n    if (u < 0) {\n        u += m;\n    }\n\n    return (uint64_t)u;\n}\n\nstatic size_t powSz(const size_t base, const size_t exp) {\n    if (exp == 0) {\n        return 1;\n    }\n\n    if (exp == 1) {\n        return base;\n    }\n\n    if (exp % 2 == 0) {\n        return powSz(base * base, exp / 2);\n    }\n    else {\n        return base * powSz(base, exp - 1);\n    }\n}\n\nstatic uint64_t powU64(const uint64_t base, const uint64_t exp) {\n    if (exp == 0) {\n        return 1;\n    }\n\n    if (exp == 1) {\n        return base;\n    }\n\n    if (exp % 2 == 0) {\n        return powU64(base * base, exp / 2);\n    }\n    else {\n        return base * powU64(base, exp - 1);\n    }\n}\n\nstatic uint64_t powU64WMod(const uint64_t base, const uint64_t exp, const uint64_t m) {\n    if (exp == 0) {\n        return 1;\n    }\n\n    if (exp == 1) {\n        return base % m;\n    }\n\n    if (exp % 2 == 0) {\n        return powU64WMod(base * base % m, exp / 2, m);\n    }\n    else {\n        return base * powU64WMod(base, exp - 1, m) % m;\n    }\n}\n\nstatic size_t combSz(const size_t n, const size_t r) {\n    size_t result = 1;\n\n    for (size_t i = 0; i < r; i++) {\n        result *= n - i;\n        result /= i + 1;\n    }\n\n    return result;\n}\n\nstatic uint64_t combU64(const uint64_t n, const uint64_t r) {\n    uint64_t result = 1;\n\n    for (uint64_t i = 0; i < r; i++) {\n        result *= n - i;\n        result /= i + 1;\n    }\n\n    return result;\n}\n\nstatic uint64_t combU64WMod(const uint64_t n, const uint64_t r, const uint64_t m) {\n    uint64_t result = 1;\n    uint64_t inv = 1;\n\n    for (uint64_t i = 0; i < r; i++) {\n        result = result * (n - i) % m;\n        inv = inv * (i + 1) % m;\n    }\n\n    return result * modinvU64(inv, m) % m;\n}\n\nstatic uint64_t permU64(const uint64_t n) {\n    uint64_t result = 1;\n\n    for (uint64_t v = 2; v <= n; v++) {\n        result *= v;\n    }\n\n    return result;\n}\n\nstatic uint64_t permU64WMod(const uint64_t n, const uint64_t m) {\n    uint64_t result = 1;\n\n    for (uint64_t v = 2; v <= n; v++) {\n        result *= v;\n        result %= m;\n    }\n\n    return result;\n}\n\nstatic size_t gcdZu(size_t m, size_t n) {\n    size_t temp;\n\n    while (m % n != 0) {\n        temp = n;\n        n = m % n;\n        m = temp;\n    }\n\n    return n;\n}\n\nstatic uint64_t gcdU64(uint64_t m, uint64_t n)\n{\n    uint64_t temp;\n\n    while (m % n != 0) {\n        temp = n;\n        n = m % n;\n        m = temp;\n    }\n\n    return n;\n}\n\nstatic uint64_t popcntU64(uint64_t val) {\n    uint64_t cnt = 0;\n\n    while (val != 0) {\n        if ((val & UINT64_C(0x1)) != 0) {\n            cnt++;\n        }\n\n        val >>= UINT64_C(0x1);\n    }\n\n    return cnt;\n}\n\ntypedef struct {\n    uint64_t val;\n}BHeap_Val;\n\n#define BHEAP_VAL_TYPE BHeap_Val\n\n#define BHEAP_INVALID_NODE ((size_t)100000000)\n\ntypedef struct {\n    BHEAP_VAL_TYPE val;\n} BHeap_Node;\n\n\nstruct _BHeap_Ctx {\n    size_t size;\n    int (*compare)(const BHEAP_VAL_TYPE* parent, const BHEAP_VAL_TYPE* node);\n    void(*notifyNodeChange)(const struct _BHeap_Ctx* const ctx, const size_t nodeListSize, const size_t* const nodeList);\n    BHeap_Node* node;\n};\n\ntypedef struct _BHeap_Ctx BHeap_Ctx;\n\nstatic void bHeap_Init(BHeap_Ctx* const ctx, int(*compare)(const BHEAP_VAL_TYPE* parent, const BHEAP_VAL_TYPE* node), void(*notifyNodeChange)(const BHeap_Ctx* const ctx, const size_t nodeListSize, const size_t* const nodeList), BHeap_Node* const nodes) {\n    ctx->size = 0;\n    ctx->compare = compare;\n    ctx->notifyNodeChange = notifyNodeChange;\n    ctx->node = nodes;\n}\n\nstatic void bHeap_Swap(BHeap_Ctx* const ctx, const size_t node0, const size_t node1) {\n    const BHEAP_VAL_TYPE tmp = ctx->node[node0].val;\n    ctx->node[node0].val = ctx->node[node1].val;\n    ctx->node[node1].val = tmp;\n\n    if (ctx->notifyNodeChange != NULL) {\n        const size_t nodeList[2] = { node0,node1 };\n        ctx->notifyNodeChange(ctx, 2, nodeList);\n    }\n}\n\nstatic void bHeap_UpHeap(BHeap_Ctx* const ctx, const size_t nodeIdx) {\n    if (nodeIdx == 0) {\n        return;\n    }\n\n    const size_t parentIdx = (nodeIdx + 1) / 2 - 1;\n\n    const int compareResult = ctx->compare(&(ctx->node[parentIdx].val), &(ctx->node[nodeIdx].val));\n\n    if (0 < compareResult) {\n        bHeap_Swap(ctx, nodeIdx, parentIdx);\n\n        if (parentIdx != 0) {\n            bHeap_UpHeap(ctx, parentIdx);\n        }\n    }\n}\n\nstatic void bHeap_DownHeap(BHeap_Ctx* const ctx, const size_t nodeIdx) {\n    if (ctx->size - 1 <= nodeIdx) {\n        return;\n    }\n\n    const size_t leftIdx = 2 * (nodeIdx + 1) - 1;\n\n    if (leftIdx < ctx->size) {\n        const int leftResult = ctx->compare(&(ctx->node[nodeIdx].val), &(ctx->node[leftIdx].val));\n\n        size_t swapTarget = leftResult < 0 ? BHEAP_INVALID_NODE : leftIdx;\n\n        const size_t rightIdx = leftIdx + 1;\n\n        if (rightIdx < ctx->size) {\n            const int rightResult = ctx->compare(&(ctx->node[nodeIdx].val), &(ctx->node[rightIdx].val));\n\n            if (swapTarget == BHEAP_INVALID_NODE) {\n                if (0 < rightResult) {\n                    swapTarget = rightIdx;\n                }\n            }\n            else {\n                if (0 < rightResult) {\n                    const int rightLeftResult = ctx->compare(&(ctx->node[leftIdx].val), &(ctx->node[rightIdx].val));\n\n                    if (0 < rightLeftResult) {\n                        swapTarget = rightIdx;\n                    }\n                }\n            }\n        }\n\n        if (swapTarget != BHEAP_INVALID_NODE) {\n            bHeap_Swap(ctx, nodeIdx, swapTarget);\n\n            bHeap_DownHeap(ctx, swapTarget);\n        }\n    }\n}\n\nstatic void bHeap_Add(BHeap_Ctx* const ctx, const BHEAP_VAL_TYPE val) {\n    ctx->node[ctx->size].val = val;\n\n    ctx->size++;\n\n    if (ctx->notifyNodeChange != NULL) {\n        const size_t node = ctx->size - 1;\n        ctx->notifyNodeChange(ctx, 1, &node);\n    }\n\n    bHeap_UpHeap(ctx, ctx->size - 1);\n}\n\nstatic void bHeap_RemoveTop(BHeap_Ctx* const ctx) {\n    if (ctx->size == 0) {\n        return;\n    }\n\n    if (ctx->size == 1) {\n        ctx->size--;\n        return;\n    }\n\n    ctx->node[0].val = ctx->node[ctx->size - 1].val;\n\n    if (ctx->notifyNodeChange != NULL) {\n        const size_t node = 0;\n        ctx->notifyNodeChange(ctx, 1, &node);\n    }\n\n    ctx->size--;\n\n    bHeap_DownHeap(ctx, 0);\n}\n\nstatic void bHeap_RemoveNode(BHeap_Ctx* const ctx, const size_t node) {\n    if (node == ctx->size - 1) {\n        ctx->size--;\n    }\n    else {\n        ctx->node[node].val = ctx->node[ctx->size - 1].val;\n\n        ctx->size--;\n\n        if (ctx->notifyNodeChange != NULL) {\n            ctx->notifyNodeChange(ctx, 1, &node);\n        }\n\n        bHeap_DownHeap(ctx, node);\n        bHeap_UpHeap(ctx, node);\n    }\n}\n\nstatic BHEAP_VAL_TYPE* bHeap_GetTopVal(const BHeap_Ctx* const ctx) {\n    return ctx->size == 0 ? NULL : &(ctx->node[0].val);\n}\n\ntypedef struct {\n    uint64_t cnt;\n    size_t* child;\n    size_t numChild;\n    size_t maxNumChild;\n} Tree_Node;\n\n#define TREE_INIT_ALLOC (128)\n\nstatic Tree_Node tree_Node[200000];\n\nstatic void tree_Init(const uint64_t N) {\n    for (uint64_t i = 0; i < N; i++) {\n        tree_Node[i].cnt = 0;\n        tree_Node[i].numChild = 0;\n        tree_Node[i].child = malloc(sizeof(size_t) * TREE_INIT_ALLOC);\n        tree_Node[i].maxNumChild = TREE_INIT_ALLOC;\n    }\n}\n\nstatic void tree_AddChild(const size_t parent, const size_t child) {\n    if (tree_Node[parent].maxNumChild <= tree_Node[parent].numChild) {\n        tree_Node[parent].child = realloc(tree_Node[parent].child, sizeof(size_t) * tree_Node[parent].maxNumChild * 2);\n        tree_Node[parent].maxNumChild *= 2;\n    }\n\n    tree_Node[parent].child[tree_Node[parent].numChild] = child;\n    tree_Node[parent].numChild++;\n}\n\nstatic BHeap_Node BN_Asc[200000];\nstatic BHeap_Node BN_Desc[200000];\n\nstatic int _bHeap_Compare_Asc(const BHEAP_VAL_TYPE* parent, const BHEAP_VAL_TYPE* node) {\n    return parent->val <= node->val ? -1 : 1;\n}\n\nstatic int _bHeap_Compare_Desc(const BHEAP_VAL_TYPE* parent, const BHEAP_VAL_TYPE* node) {\n    return parent->val >= node->val ? -1 : 1;\n}\n\nstatic size_t PBHeap_Asc_Idx[200000];\nstatic size_t PBHeap_Desc_Idx[200000];\n\nstatic void _bHeap_NotifyNodeChange_Asc(const BHeap_Ctx* const ctx, const size_t nodeListSize, const size_t* const nodeList) {\n    for (size_t i = 0; i < nodeListSize; i++) {\n        PBHeap_Asc_Idx[ctx->node[nodeList[i]].val.val] = nodeList[i];\n    }\n}\n\nstatic void _bHeap_NotifyNodeChange_Desc(const BHeap_Ctx* const ctx, const size_t nodeListSize, const size_t* const nodeList) {\n    for (size_t i = 0; i < nodeListSize; i++) {\n        PBHeap_Desc_Idx[ctx->node[nodeList[i]].val.val] = nodeList[i];\n    }\n}\n\n#define UF_ROOT ((size_t)10000000)\n\ntypedef struct {\n    size_t parent;\n    uint64_t w;\n    uint64_t v;\n    uint64_t wSum;\n    uint64_t vSum;\n} UF_Node;\n\nstatic UF_Node uf_Node[101];\n\nstatic size_t uf_GetRoot(const size_t idx) {\n    if (uf_Node[idx].parent == UF_ROOT) {\n        return idx;\n    }\n\n    const size_t root = uf_GetRoot(uf_Node[idx].parent);\n\n    uf_Node[idx].parent = root;\n\n    return root;\n}\n\nstatic void uf_Merge(const size_t a, const size_t b) {\n    const size_t aRoot = uf_GetRoot(a);\n    const size_t bRoot = uf_GetRoot(b);\n\n    if (aRoot != bRoot) {\n        uf_Node[aRoot].parent = bRoot;\n\n        uf_Node[bRoot].wSum += uf_Node[aRoot].wSum;\n        uf_Node[bRoot].vSum += uf_Node[aRoot].vSum;\n    }\n}\n\n#define MOD_VAL (UINT64_C(1000000007))\n\nstatic char S[200000][11];\n\ntypedef struct {\n    char S[11];\n    uint64_t cnt;\n} StrList;\n\nstatic StrList sList[200000];\nstatic uint64_t listSize = 0;\n\nint compare_f(const void* a, const void* b) {\n    const StrList* aP = (StrList*)a;\n    const StrList* bP = (StrList*)b;\n\n    if (aP->cnt > bP->cnt) {\n        return -1;\n    }\n    else if (aP->cnt == bP->cnt) {\n        return strcmp(aP->S, bP->S);\n    }\n    else {\n        return 1;\n    }\n}\n\nint main(void) {\n    uint64_t N;\n\n    scanf(\"%\"PRIu64, &N);\n    for (uint64_t i = 0; i < N; i++) {\n        scanf(\"%s\", S[i]);\n\n        sList[i].cnt = 0;\n    }\n\n    qsort(S, (size_t)N, sizeof(char) * 11, compare_str_asc);\n\n    uint64_t cnt = 1;\n\n    for (uint64_t i = 1; i < N; i++) {\n        if (strcmp(S[i], S[i - 1]) == 0) {\n            cnt++;\n        }\n        else {\n            sList[listSize].cnt = cnt;\n            strcpy(sList[listSize].S, S[i - 1]);\n            listSize++;\n\n            cnt = 1;\n        }\n    }\n\n    sList[listSize].cnt = cnt;\n    strcpy(sList[listSize].S, S[N - 1]);\n    listSize++;\n\n    qsort(sList, (size_t)listSize, sizeof(StrList), compare_f);\n\n    puts(sList[0].S);\n    for (uint64_t i = 1; i < listSize; i++) {\n        if (sList[i].cnt == sList[0].cnt) {\n            puts(sList[i].S);\n        }\n        else {\n            return 0;\n        }\n    }\n\n    return 0;\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": 12668, "cpu_time_ms": 127, "memory_kb": 10644}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s488059013", "group_id": "codeNet:p02777", "input_text": "#include <stdio.h>\nint main ()\n{\n   int N;\n\n   scanf(\"%d\",&N);\n\n   if(N%2 == 0)  printf(\"%d\\n\",N);\n\n   else    printf(\"%d\\n\",2*N);\n   return 0;\n}\n", "language": "C", "metadata": {"date": 1589308456, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "problem_description_relpath": "problem_descriptions/p02777.html", "problem_id": "p02777", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02777/input.txt", "sample_output_relpath": "derived/input_output/data/p02777/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02777/C/s488059013.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s488059013", "user_id": "u405206429"}, "prompt_components": {"gold_output": "2 4\n", "input_to_evaluate": "#include <stdio.h>\nint main ()\n{\n   int N;\n\n   scanf(\"%d\",&N);\n\n   if(N%2 == 0)  printf(\"%d\\n\",N);\n\n   else    printf(\"%d\\n\",2*N);\n   return 0;\n}\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nWe have A balls with the string S written on each of them and B balls with the string T written on each of them.\n\nFrom these balls, Takahashi chooses one with the string U written on it and throws it away.\n\nFind the number of balls with the string S and balls with the string T that we have now.\n\nConstraints\n\nS, T, and U are strings consisting of lowercase English letters.\n\nThe lengths of S and T are each between 1 and 10 (inclusive).\n\nS \\not= T\n\nS=U or T=U.\n\n1 \\leq A,B \\leq 10\n\nA and B are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS T\nA B\nU\n\nOutput\n\nPrint the answer, with space in between.\n\nSample Input 1\n\nred blue\n3 4\nred\n\nSample Output 1\n\n2 4\n\nTakahashi chose a ball with red written on it and threw it away.\nNow we have two balls with the string S and four balls with the string T.\n\nSample Input 2\n\nred blue\n5 5\nblue\n\nSample Output 2\n\n5 4\n\nTakahashi chose a ball with blue written on it and threw it away.\nNow we have five balls with the string S and four balls with the string T.", "sample_input": "red blue\n3 4\nred\n"}, "reference_outputs": ["2 4\n"], "source_document_id": "p02777", "source_text": "Score : 100 points\n\nProblem Statement\n\nWe have A balls with the string S written on each of them and B balls with the string T written on each of them.\n\nFrom these balls, Takahashi chooses one with the string U written on it and throws it away.\n\nFind the number of balls with the string S and balls with the string T that we have now.\n\nConstraints\n\nS, T, and U are strings consisting of lowercase English letters.\n\nThe lengths of S and T are each between 1 and 10 (inclusive).\n\nS \\not= T\n\nS=U or T=U.\n\n1 \\leq A,B \\leq 10\n\nA and B are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS T\nA B\nU\n\nOutput\n\nPrint the answer, with space in between.\n\nSample Input 1\n\nred blue\n3 4\nred\n\nSample Output 1\n\n2 4\n\nTakahashi chose a ball with red written on it and threw it away.\nNow we have two balls with the string S and four balls with the string T.\n\nSample Input 2\n\nred blue\n5 5\nblue\n\nSample Output 2\n\n5 4\n\nTakahashi chose a ball with blue written on it and threw it away.\nNow we have five balls with the string S and four balls with the string T.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 146, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s211267146", "group_id": "codeNet:p02777", "input_text": "#include <stdio.h>\n#include <string.h>\nint main(void)\n{\n  char S[11];\n\n  char T[11];\n  scanf(\"%s %s\", S, T);\n  \n  int A = 0;\n  \n  int B = 0;\n  scanf(\"%d %d\", &A, &B);\n  \n  char U[11];\n  scanf(\"%s\", U);\n  \n   if(strcmp(S,U)==0){ \n    A = A-1;\n    printf(\"%d %d\", A, B);\n  }\n  else{\n    B = B-1;\n    printf(\"%d %d\", A, B);\n  }\n  return 0;\n}\n\n", "language": "C", "metadata": {"date": 1581284294, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "problem_description_relpath": "problem_descriptions/p02777.html", "problem_id": "p02777", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02777/input.txt", "sample_output_relpath": "derived/input_output/data/p02777/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02777/C/s211267146.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s211267146", "user_id": "u381751428"}, "prompt_components": {"gold_output": "2 4\n", "input_to_evaluate": "#include <stdio.h>\n#include <string.h>\nint main(void)\n{\n  char S[11];\n\n  char T[11];\n  scanf(\"%s %s\", S, T);\n  \n  int A = 0;\n  \n  int B = 0;\n  scanf(\"%d %d\", &A, &B);\n  \n  char U[11];\n  scanf(\"%s\", U);\n  \n   if(strcmp(S,U)==0){ \n    A = A-1;\n    printf(\"%d %d\", A, B);\n  }\n  else{\n    B = B-1;\n    printf(\"%d %d\", A, B);\n  }\n  return 0;\n}\n\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nWe have A balls with the string S written on each of them and B balls with the string T written on each of them.\n\nFrom these balls, Takahashi chooses one with the string U written on it and throws it away.\n\nFind the number of balls with the string S and balls with the string T that we have now.\n\nConstraints\n\nS, T, and U are strings consisting of lowercase English letters.\n\nThe lengths of S and T are each between 1 and 10 (inclusive).\n\nS \\not= T\n\nS=U or T=U.\n\n1 \\leq A,B \\leq 10\n\nA and B are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS T\nA B\nU\n\nOutput\n\nPrint the answer, with space in between.\n\nSample Input 1\n\nred blue\n3 4\nred\n\nSample Output 1\n\n2 4\n\nTakahashi chose a ball with red written on it and threw it away.\nNow we have two balls with the string S and four balls with the string T.\n\nSample Input 2\n\nred blue\n5 5\nblue\n\nSample Output 2\n\n5 4\n\nTakahashi chose a ball with blue written on it and threw it away.\nNow we have five balls with the string S and four balls with the string T.", "sample_input": "red blue\n3 4\nred\n"}, "reference_outputs": ["2 4\n"], "source_document_id": "p02777", "source_text": "Score : 100 points\n\nProblem Statement\n\nWe have A balls with the string S written on each of them and B balls with the string T written on each of them.\n\nFrom these balls, Takahashi chooses one with the string U written on it and throws it away.\n\nFind the number of balls with the string S and balls with the string T that we have now.\n\nConstraints\n\nS, T, and U are strings consisting of lowercase English letters.\n\nThe lengths of S and T are each between 1 and 10 (inclusive).\n\nS \\not= T\n\nS=U or T=U.\n\n1 \\leq A,B \\leq 10\n\nA and B are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS T\nA B\nU\n\nOutput\n\nPrint the answer, with space in between.\n\nSample Input 1\n\nred blue\n3 4\nred\n\nSample Output 1\n\n2 4\n\nTakahashi chose a ball with red written on it and threw it away.\nNow we have two balls with the string S and four balls with the string T.\n\nSample Input 2\n\nred blue\n5 5\nblue\n\nSample Output 2\n\n5 4\n\nTakahashi chose a ball with blue written on it and threw it away.\nNow we have five balls with the string S and four balls with the string T.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 340, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s017978502", "group_id": "codeNet:p02777", "input_text": "#include<stdio.h>\nint main()\n{\n\n    int i,j;\n    char ar[1000],br[10000],cr[10000];\n\n    scanf(\"%s%s\",ar,br);\n    scanf(\"%d%d\",&i,&j);\n    scanf(\"%s\",cr);\n\n\n    if(cr[0]=='r')\n        printf(\"%d %d\\n\",i-1,j);\n    else\n        printf(\"%d %d\\n\",i,j-1);\n\n\n\n\n\n\n\n    return 0;\n}\n", "language": "C", "metadata": {"date": 1581280141, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "problem_description_relpath": "problem_descriptions/p02777.html", "problem_id": "p02777", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02777/input.txt", "sample_output_relpath": "derived/input_output/data/p02777/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02777/C/s017978502.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s017978502", "user_id": "u173849410"}, "prompt_components": {"gold_output": "2 4\n", "input_to_evaluate": "#include<stdio.h>\nint main()\n{\n\n    int i,j;\n    char ar[1000],br[10000],cr[10000];\n\n    scanf(\"%s%s\",ar,br);\n    scanf(\"%d%d\",&i,&j);\n    scanf(\"%s\",cr);\n\n\n    if(cr[0]=='r')\n        printf(\"%d %d\\n\",i-1,j);\n    else\n        printf(\"%d %d\\n\",i,j-1);\n\n\n\n\n\n\n\n    return 0;\n}\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nWe have A balls with the string S written on each of them and B balls with the string T written on each of them.\n\nFrom these balls, Takahashi chooses one with the string U written on it and throws it away.\n\nFind the number of balls with the string S and balls with the string T that we have now.\n\nConstraints\n\nS, T, and U are strings consisting of lowercase English letters.\n\nThe lengths of S and T are each between 1 and 10 (inclusive).\n\nS \\not= T\n\nS=U or T=U.\n\n1 \\leq A,B \\leq 10\n\nA and B are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS T\nA B\nU\n\nOutput\n\nPrint the answer, with space in between.\n\nSample Input 1\n\nred blue\n3 4\nred\n\nSample Output 1\n\n2 4\n\nTakahashi chose a ball with red written on it and threw it away.\nNow we have two balls with the string S and four balls with the string T.\n\nSample Input 2\n\nred blue\n5 5\nblue\n\nSample Output 2\n\n5 4\n\nTakahashi chose a ball with blue written on it and threw it away.\nNow we have five balls with the string S and four balls with the string T.", "sample_input": "red blue\n3 4\nred\n"}, "reference_outputs": ["2 4\n"], "source_document_id": "p02777", "source_text": "Score : 100 points\n\nProblem Statement\n\nWe have A balls with the string S written on each of them and B balls with the string T written on each of them.\n\nFrom these balls, Takahashi chooses one with the string U written on it and throws it away.\n\nFind the number of balls with the string S and balls with the string T that we have now.\n\nConstraints\n\nS, T, and U are strings consisting of lowercase English letters.\n\nThe lengths of S and T are each between 1 and 10 (inclusive).\n\nS \\not= T\n\nS=U or T=U.\n\n1 \\leq A,B \\leq 10\n\nA and B are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS T\nA B\nU\n\nOutput\n\nPrint the answer, with space in between.\n\nSample Input 1\n\nred blue\n3 4\nred\n\nSample Output 1\n\n2 4\n\nTakahashi chose a ball with red written on it and threw it away.\nNow we have two balls with the string S and four balls with the string T.\n\nSample Input 2\n\nred blue\n5 5\nblue\n\nSample Output 2\n\n5 4\n\nTakahashi chose a ball with blue written on it and threw it away.\nNow we have five balls with the string S and four balls with the string T.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 274, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s641852057", "group_id": "codeNet:p02779", "input_text": "#include<stdio.h>\n#include<stdlib.h>\n#include<math.h>\n#include<string.h>\n\nint compare_int(const void *a,const void *b){\n    return *(int*)a-*(int*)b;\n}\n\nint main(){\n    int N;\n    scanf(\"%d\",&N);\n    int A[N+1];\n    int i,j,s=0,count=0;\n    for(i=0;i<N;i++){\n        scanf(\"%d\",&A[i]);\n    }\n\n    qsort(A,N,sizeof(int), compare_int);\n\n    for(i=0;i<N-1;i++){\n        if(A[i]==A[i+1]){\n            printf(\"NO\");\n            return 0;\n        }\n    }\n    printf(\"YES\");\n    return 0;\n}\n    \n\n\n\n", "language": "C", "metadata": {"date": 1588173781, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "problem_description_relpath": "problem_descriptions/p02779.html", "problem_id": "p02779", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02779/input.txt", "sample_output_relpath": "derived/input_output/data/p02779/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02779/C/s641852057.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s641852057", "user_id": "u359243713"}, "prompt_components": {"gold_output": "YES\n", "input_to_evaluate": "#include<stdio.h>\n#include<stdlib.h>\n#include<math.h>\n#include<string.h>\n\nint compare_int(const void *a,const void *b){\n    return *(int*)a-*(int*)b;\n}\n\nint main(){\n    int N;\n    scanf(\"%d\",&N);\n    int A[N+1];\n    int i,j,s=0,count=0;\n    for(i=0;i<N;i++){\n        scanf(\"%d\",&A[i]);\n    }\n\n    qsort(A,N,sizeof(int), compare_int);\n\n    for(i=0;i<N-1;i++){\n        if(A[i]==A[i+1]){\n            printf(\"NO\");\n            return 0;\n        }\n    }\n    printf(\"YES\");\n    return 0;\n}\n    \n\n\n\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nGiven is a sequence of integers A_1, A_2, ..., A_N.\nIf its elements are pairwise distinct, print YES; otherwise, print NO.\n\nConstraints\n\n2 ≤ N ≤ 200000\n\n1 ≤ A_i ≤ 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_N\n\nOutput\n\nIf the elements of the sequence are pairwise distinct, print YES; otherwise, print NO.\n\nSample Input 1\n\n5\n2 6 1 4 5\n\nSample Output 1\n\nYES\n\nThe elements are pairwise distinct.\n\nSample Input 2\n\n6\n4 1 3 1 6 2\n\nSample Output 2\n\nNO\n\nThe second and fourth elements are identical.\n\nSample Input 3\n\n2\n10000000 10000000\n\nSample Output 3\n\nNO", "sample_input": "5\n2 6 1 4 5\n"}, "reference_outputs": ["YES\n"], "source_document_id": "p02779", "source_text": "Score : 300 points\n\nProblem Statement\n\nGiven is a sequence of integers A_1, A_2, ..., A_N.\nIf its elements are pairwise distinct, print YES; otherwise, print NO.\n\nConstraints\n\n2 ≤ N ≤ 200000\n\n1 ≤ A_i ≤ 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_N\n\nOutput\n\nIf the elements of the sequence are pairwise distinct, print YES; otherwise, print NO.\n\nSample Input 1\n\n5\n2 6 1 4 5\n\nSample Output 1\n\nYES\n\nThe elements are pairwise distinct.\n\nSample Input 2\n\n6\n4 1 3 1 6 2\n\nSample Output 2\n\nNO\n\nThe second and fourth elements are identical.\n\nSample Input 3\n\n2\n10000000 10000000\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": 492, "cpu_time_ms": 51, "memory_kb": 1788}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s848264138", "group_id": "codeNet:p02779", "input_text": "#include<stdio.h>\n#include<string.h>\n#include<stdbool.h>\n\nint main(void){\n    bool flag=false;\n    int n,a[200000]={0},s;\n    scanf(\"%d\",&n);\n    for(int b=0;b<n;b++){\n        scanf(\"%d\",&s);\n        a[b]=s;\n    }\n    for(int c=0;c<n-1;c++){\n        for(int d=c+1;d<=n;d++){\n            if(a[c]==a[d]){\n                flag=true;\n            }\n        }\n    }\n    if(flag){\n        printf(\"NO\");\n    }else printf(\"YES\");\n}", "language": "C", "metadata": {"date": 1581869629, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "problem_description_relpath": "problem_descriptions/p02779.html", "problem_id": "p02779", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02779/input.txt", "sample_output_relpath": "derived/input_output/data/p02779/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02779/C/s848264138.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s848264138", "user_id": "u952751817"}, "prompt_components": {"gold_output": "YES\n", "input_to_evaluate": "#include<stdio.h>\n#include<string.h>\n#include<stdbool.h>\n\nint main(void){\n    bool flag=false;\n    int n,a[200000]={0},s;\n    scanf(\"%d\",&n);\n    for(int b=0;b<n;b++){\n        scanf(\"%d\",&s);\n        a[b]=s;\n    }\n    for(int c=0;c<n-1;c++){\n        for(int d=c+1;d<=n;d++){\n            if(a[c]==a[d]){\n                flag=true;\n            }\n        }\n    }\n    if(flag){\n        printf(\"NO\");\n    }else printf(\"YES\");\n}", "problem_context": "Score : 300 points\n\nProblem Statement\n\nGiven is a sequence of integers A_1, A_2, ..., A_N.\nIf its elements are pairwise distinct, print YES; otherwise, print NO.\n\nConstraints\n\n2 ≤ N ≤ 200000\n\n1 ≤ A_i ≤ 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_N\n\nOutput\n\nIf the elements of the sequence are pairwise distinct, print YES; otherwise, print NO.\n\nSample Input 1\n\n5\n2 6 1 4 5\n\nSample Output 1\n\nYES\n\nThe elements are pairwise distinct.\n\nSample Input 2\n\n6\n4 1 3 1 6 2\n\nSample Output 2\n\nNO\n\nThe second and fourth elements are identical.\n\nSample Input 3\n\n2\n10000000 10000000\n\nSample Output 3\n\nNO", "sample_input": "5\n2 6 1 4 5\n"}, "reference_outputs": ["YES\n"], "source_document_id": "p02779", "source_text": "Score : 300 points\n\nProblem Statement\n\nGiven is a sequence of integers A_1, A_2, ..., A_N.\nIf its elements are pairwise distinct, print YES; otherwise, print NO.\n\nConstraints\n\n2 ≤ N ≤ 200000\n\n1 ≤ A_i ≤ 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_N\n\nOutput\n\nIf the elements of the sequence are pairwise distinct, print YES; otherwise, print NO.\n\nSample Input 1\n\n5\n2 6 1 4 5\n\nSample Output 1\n\nYES\n\nThe elements are pairwise distinct.\n\nSample Input 2\n\n6\n4 1 3 1 6 2\n\nSample Output 2\n\nNO\n\nThe second and fourth elements are identical.\n\nSample Input 3\n\n2\n10000000 10000000\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": 422, "cpu_time_ms": 2103, "memory_kb": 896}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s100521185", "group_id": "codeNet:p02779", "input_text": "#include<stdio.h>\n#include <stdlib.h>\n\nint compare_int(const void *a, const void *b)\n{\n    return *(int*)a - *(int*)b;\n}\n\nint main() {\n  int N,d,S[200001];\nscanf(\"%d\",&N);\nfor(int c=0;c<N;c++){\nscanf(\"%d\",&S[c]);\n}\nqsort(S, N, sizeof(int), compare_int);\n\nfor(d=0;d<N;d++){\nif(S[d] == S[d+1]){\nprintf(\"NO\");\nbreak;\n}\n}\nif(d == N){\n  printf(\"YES\");\n          }\n\nreturn 0;\n}\n", "language": "C", "metadata": {"date": 1581434735, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "problem_description_relpath": "problem_descriptions/p02779.html", "problem_id": "p02779", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02779/input.txt", "sample_output_relpath": "derived/input_output/data/p02779/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02779/C/s100521185.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s100521185", "user_id": "u559994901"}, "prompt_components": {"gold_output": "YES\n", "input_to_evaluate": "#include<stdio.h>\n#include <stdlib.h>\n\nint compare_int(const void *a, const void *b)\n{\n    return *(int*)a - *(int*)b;\n}\n\nint main() {\n  int N,d,S[200001];\nscanf(\"%d\",&N);\nfor(int c=0;c<N;c++){\nscanf(\"%d\",&S[c]);\n}\nqsort(S, N, sizeof(int), compare_int);\n\nfor(d=0;d<N;d++){\nif(S[d] == S[d+1]){\nprintf(\"NO\");\nbreak;\n}\n}\nif(d == N){\n  printf(\"YES\");\n          }\n\nreturn 0;\n}\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nGiven is a sequence of integers A_1, A_2, ..., A_N.\nIf its elements are pairwise distinct, print YES; otherwise, print NO.\n\nConstraints\n\n2 ≤ N ≤ 200000\n\n1 ≤ A_i ≤ 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_N\n\nOutput\n\nIf the elements of the sequence are pairwise distinct, print YES; otherwise, print NO.\n\nSample Input 1\n\n5\n2 6 1 4 5\n\nSample Output 1\n\nYES\n\nThe elements are pairwise distinct.\n\nSample Input 2\n\n6\n4 1 3 1 6 2\n\nSample Output 2\n\nNO\n\nThe second and fourth elements are identical.\n\nSample Input 3\n\n2\n10000000 10000000\n\nSample Output 3\n\nNO", "sample_input": "5\n2 6 1 4 5\n"}, "reference_outputs": ["YES\n"], "source_document_id": "p02779", "source_text": "Score : 300 points\n\nProblem Statement\n\nGiven is a sequence of integers A_1, A_2, ..., A_N.\nIf its elements are pairwise distinct, print YES; otherwise, print NO.\n\nConstraints\n\n2 ≤ N ≤ 200000\n\n1 ≤ A_i ≤ 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_N\n\nOutput\n\nIf the elements of the sequence are pairwise distinct, print YES; otherwise, print NO.\n\nSample Input 1\n\n5\n2 6 1 4 5\n\nSample Output 1\n\nYES\n\nThe elements are pairwise distinct.\n\nSample Input 2\n\n6\n4 1 3 1 6 2\n\nSample Output 2\n\nNO\n\nThe second and fourth elements are identical.\n\nSample Input 3\n\n2\n10000000 10000000\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": 372, "cpu_time_ms": 50, "memory_kb": 1788}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s198194346", "group_id": "codeNet:p02780", "input_text": "#include<stdio.h>\nint main() {\n\tint i, j,x,y;\n\tdouble tmp=0;\n\tdouble index=0;\n\tscanf(\"%d %d\", &x, &y);\n\tint m[x];\n\tdouble z[x];\n\tfor (i = 0;i < x;i++) {\n\t\tscanf(\"%d\", &m[i]);\n\t}\n\tfor (i = 0;i < x;i++) {\n\t\tz[i] = (double)(1 + m[i]) / 2;\n\t}\n\tfor (i = 0;i < x;i++) {\n\t\ttmp += z[i];\n\t\tif (i >= y) {\n\t\t\ttmp -= z[i - y];\n\t\t}\n\t\tif (index < tmp) {\n\t\t\tindex = tmp;\n\t\t}\n\t}\n\tprintf(\"%.12f\", index);\n\treturn 0;\n}\n", "language": "C", "metadata": {"date": 1581683643, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "problem_description_relpath": "problem_descriptions/p02780.html", "problem_id": "p02780", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02780/input.txt", "sample_output_relpath": "derived/input_output/data/p02780/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02780/C/s198194346.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s198194346", "user_id": "u379511259"}, "prompt_components": {"gold_output": "7.000000000000\n", "input_to_evaluate": "#include<stdio.h>\nint main() {\n\tint i, j,x,y;\n\tdouble tmp=0;\n\tdouble index=0;\n\tscanf(\"%d %d\", &x, &y);\n\tint m[x];\n\tdouble z[x];\n\tfor (i = 0;i < x;i++) {\n\t\tscanf(\"%d\", &m[i]);\n\t}\n\tfor (i = 0;i < x;i++) {\n\t\tz[i] = (double)(1 + m[i]) / 2;\n\t}\n\tfor (i = 0;i < x;i++) {\n\t\ttmp += z[i];\n\t\tif (i >= y) {\n\t\t\ttmp -= z[i - y];\n\t\t}\n\t\tif (index < tmp) {\n\t\t\tindex = tmp;\n\t\t}\n\t}\n\tprintf(\"%.12f\", index);\n\treturn 0;\n}\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nWe have N dice arranged in a line from left to right. The i-th die from the left shows p_i numbers from 1 to p_i with equal probability when thrown.\n\nWe will choose K adjacent dice, throw each of them independently, and compute the sum of the numbers shown. Find the maximum possible value of the expected value of this sum.\n\nConstraints\n\n1 ≤ K ≤ N ≤ 200000\n\n1 ≤ p_i ≤ 1000\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_N\n\nOutput\n\nPrint the maximum possible value of the expected value of the sum of the numbers shown.\n\nYour output will be considered correct when its absolute or relative error from our answer is at most 10^{-6}.\n\nSample Input 1\n\n5 3\n1 2 2 4 5\n\nSample Output 1\n\n7.000000000000\n\nWhen we throw the third, fourth, and fifth dice from the left, the expected value of the sum of the numbers shown is 7. This is the maximum value we can achieve.\n\nSample Input 2\n\n4 1\n6 6 6 6\n\nSample Output 2\n\n3.500000000000\n\nRegardless of which die we choose, the expected value of the number shown is 3.5.\n\nSample Input 3\n\n10 4\n17 13 13 12 15 20 10 13 17 11\n\nSample Output 3\n\n32.000000000000", "sample_input": "5 3\n1 2 2 4 5\n"}, "reference_outputs": ["7.000000000000\n"], "source_document_id": "p02780", "source_text": "Score : 400 points\n\nProblem Statement\n\nWe have N dice arranged in a line from left to right. The i-th die from the left shows p_i numbers from 1 to p_i with equal probability when thrown.\n\nWe will choose K adjacent dice, throw each of them independently, and compute the sum of the numbers shown. Find the maximum possible value of the expected value of this sum.\n\nConstraints\n\n1 ≤ K ≤ N ≤ 200000\n\n1 ≤ p_i ≤ 1000\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_N\n\nOutput\n\nPrint the maximum possible value of the expected value of the sum of the numbers shown.\n\nYour output will be considered correct when its absolute or relative error from our answer is at most 10^{-6}.\n\nSample Input 1\n\n5 3\n1 2 2 4 5\n\nSample Output 1\n\n7.000000000000\n\nWhen we throw the third, fourth, and fifth dice from the left, the expected value of the sum of the numbers shown is 7. This is the maximum value we can achieve.\n\nSample Input 2\n\n4 1\n6 6 6 6\n\nSample Output 2\n\n3.500000000000\n\nRegardless of which die we choose, the expected value of the number shown is 3.5.\n\nSample Input 3\n\n10 4\n17 13 13 12 15 20 10 13 17 11\n\nSample Output 3\n\n32.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": 401, "cpu_time_ms": 21, "memory_kb": 2560}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s986256032", "group_id": "codeNet:p02780", "input_text": "/*  AUTHOR: AKASH JAIN\n*   EMAIL:  akash19jain@gmail.com\n*   ID:     akash19jain  \n*   DATE:   09-02-2020 17:40:23\n*/\n\n\n// #include<algorithm>\n// #include <bits/stdc++.h>\n// using namespace std;\n \n#include<stdio.h>\n#include<math.h>\n#include<string.h>\n#include<stdlib.h>\n#include<stdbool.h>\n#include<ctype.h>\n#define SC1(x)          scanf(\"%lld\",&x)\n#define SC2(x,y)        scanf(\"%lld%lld\",&x,&y)\n#define SC3(x,y,z)      scanf(\"%lld%lld%lld\",&x,&y,&z)\n#define SCS(x)          scanf(\"\\n%s\", x)\n#define SCA(a,n)        for(long long i=0;i<n;i++)    scanf(\"%lld\",&a[i]);\n#define PF1(x)          printf(\"%lld\\n\",x)\n#define PF2(x,y)        printf(\"%lld %lld\\n\",x,y)\n#define PF3(x,y,z)      printf(\"%lld %lld %lld\\n\",x,y,z)\n#define PFA(a,n)        for(long long i=0;i<n;i++)    printf(\"%lld \",a[i]); printf(\"\\n\");\n#define PFN             printf(\"\\n\")\n#define PFS(x)          printf(\"%s\\n\",x)\n#define REP(i,n)        for(long long i=0;i<(n);++i)\n#define FOR(i,a,b)      for(long long i=(a);i<=(b);++i)\n#define FORD(i,a,b)     for(long long i=(a);i>=(b);--i)\n#define WHILE(n)        while(n--)\n#define MEM(a, b)       memset(a, (b), sizeof(a))\n#define ITOC(c)         ((char)(((ll)'0')+c))\n#define MID(s,e)        (s+(e-s)/2)\n#define SZ(a)           strlen(a)          \n#define PI              3.1415926535897932384626433832795\n#define DEB(x)          printf(\"The value of \\\"%s\\\" is: %d\\n\",#x,x)\n#define CASES           ll t;SC1(t);while(t--)\n#define ABS(a)          ((a>0)?a:-(a))\n#define SWAP(a,b)       ll z=a;a=b;b=z\n#define SWAPC(a,b)      char z=a;a=b;b=z\n#define FLSH            fflush(stdout)\ntypedef long long ll;\ntypedef unsigned long long ull;\nconst ll INF = 1<<29;\nconst ll MOD = 1000000007;\nconst ll FMOD = 998244353;\nconst ll MAX = 10000000005;\nconst ll MIN = -10000000005;\n#define FILEIO(name) \\  freopen(name\".in\", \"r\", stdin); \\   freopen(name\".out\", \"w\", stdout);\nint cmp(const void * a,const void * b);\nlong long maxv(long long a,long long b);\nlong long minv(long long a,long long b);\nlong long gcd(long long u,long long v);\nlong long digits(long long n);\nbool ispoweroftwo(long long n);\nbool isvowel(char x);\nll chartoint(char ch);\nll CEIL(ll x,ll y);\nll FLOOR(ll x,ll y);\n\n\nint main()\n{\n    ll n,k;\n    SC2(n,k);\n    ll arr[n];\n    SCA(arr,n);\n    //qsort(arr,n,sizeof(arr[0]),cmp);\n    double ans=0;\n    REP(i,k)\n    {\n        ll x=arr[i]*(arr[i]+1)/2;\n        ans+=(1.0*x)/arr[i];\n    }\n    double max=ans;\n    FOR(i,k+1,n-1)\n    {\n        ll x=arr[i]*(arr[i]+1)/2;\n        ans+=(1.0*x)/arr[i];\n        x=arr[i-k-1]*(arr[i-k-1]+1)/2;\n        ans-=(1.0*x)/arr[i-k-1];\n        if(max<ans)\n            max=ans;\n\n    }\n    printf(\"%.10f\\n\",max);\n\n    return 0;\n}\n \n \n//qsort(arr,n,sizeof(arr[0]),cmp);\nint cmp (const void * a, const void * b)\n{\n    if( *(ll*)a - *(ll*)b < 0 ) return 1;\n    if( *(ll*)a - *(ll*)b > 0 ) return -1;\n        return 0;\n}\nlong long maxv(long long a,long long b)\n{\n    if(a>b) return a;\n        return b;\n}\nlong long minv(long long a,long long b)\n{\n    if(a<b) return a;\n        return b;\n}\nlong long gcd(long long u,long long v)\n{\n    if (v == 0) return u; \n       return gcd(v, u%v);\n}\nlong long digits(long long n)    //to calculate no of digits in a number\n{\n    return floor(log10(n))+1;\n}\nbool ispoweroftwo(long long x)\n{\n    return x && (!(x&(x-1)));\n}\nbool isvowel(char x)\n{\n    return(x=='a' || x== 'e' ||x=='i' || x== 'o' || x=='u' );\n}\nll chartoint(char ch)\n{\n    if(ch>='A' && ch<='Z') return(ch-'A');\n    else if(ch>='0' && ch<='9') return (ch-'0');\n    else if(ch>='a' && ch<='z') return (ch-'a');\n    else return 0;\n}\nll CEIL(ll x,ll y)\n{\n    if(x%y==0) return(x/y);\n    else return(x/y +1);\n}\n \nll FLOOR(ll x,ll y)\n{\n    if(x%y==0) return(x/y);\n    else return(x/y -1);\n}", "language": "C", "metadata": {"date": 1581279383, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "problem_description_relpath": "problem_descriptions/p02780.html", "problem_id": "p02780", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02780/input.txt", "sample_output_relpath": "derived/input_output/data/p02780/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02780/C/s986256032.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s986256032", "user_id": "u956865570"}, "prompt_components": {"gold_output": "7.000000000000\n", "input_to_evaluate": "/*  AUTHOR: AKASH JAIN\n*   EMAIL:  akash19jain@gmail.com\n*   ID:     akash19jain  \n*   DATE:   09-02-2020 17:40:23\n*/\n\n\n// #include<algorithm>\n// #include <bits/stdc++.h>\n// using namespace std;\n \n#include<stdio.h>\n#include<math.h>\n#include<string.h>\n#include<stdlib.h>\n#include<stdbool.h>\n#include<ctype.h>\n#define SC1(x)          scanf(\"%lld\",&x)\n#define SC2(x,y)        scanf(\"%lld%lld\",&x,&y)\n#define SC3(x,y,z)      scanf(\"%lld%lld%lld\",&x,&y,&z)\n#define SCS(x)          scanf(\"\\n%s\", x)\n#define SCA(a,n)        for(long long i=0;i<n;i++)    scanf(\"%lld\",&a[i]);\n#define PF1(x)          printf(\"%lld\\n\",x)\n#define PF2(x,y)        printf(\"%lld %lld\\n\",x,y)\n#define PF3(x,y,z)      printf(\"%lld %lld %lld\\n\",x,y,z)\n#define PFA(a,n)        for(long long i=0;i<n;i++)    printf(\"%lld \",a[i]); printf(\"\\n\");\n#define PFN             printf(\"\\n\")\n#define PFS(x)          printf(\"%s\\n\",x)\n#define REP(i,n)        for(long long i=0;i<(n);++i)\n#define FOR(i,a,b)      for(long long i=(a);i<=(b);++i)\n#define FORD(i,a,b)     for(long long i=(a);i>=(b);--i)\n#define WHILE(n)        while(n--)\n#define MEM(a, b)       memset(a, (b), sizeof(a))\n#define ITOC(c)         ((char)(((ll)'0')+c))\n#define MID(s,e)        (s+(e-s)/2)\n#define SZ(a)           strlen(a)          \n#define PI              3.1415926535897932384626433832795\n#define DEB(x)          printf(\"The value of \\\"%s\\\" is: %d\\n\",#x,x)\n#define CASES           ll t;SC1(t);while(t--)\n#define ABS(a)          ((a>0)?a:-(a))\n#define SWAP(a,b)       ll z=a;a=b;b=z\n#define SWAPC(a,b)      char z=a;a=b;b=z\n#define FLSH            fflush(stdout)\ntypedef long long ll;\ntypedef unsigned long long ull;\nconst ll INF = 1<<29;\nconst ll MOD = 1000000007;\nconst ll FMOD = 998244353;\nconst ll MAX = 10000000005;\nconst ll MIN = -10000000005;\n#define FILEIO(name) \\  freopen(name\".in\", \"r\", stdin); \\   freopen(name\".out\", \"w\", stdout);\nint cmp(const void * a,const void * b);\nlong long maxv(long long a,long long b);\nlong long minv(long long a,long long b);\nlong long gcd(long long u,long long v);\nlong long digits(long long n);\nbool ispoweroftwo(long long n);\nbool isvowel(char x);\nll chartoint(char ch);\nll CEIL(ll x,ll y);\nll FLOOR(ll x,ll y);\n\n\nint main()\n{\n    ll n,k;\n    SC2(n,k);\n    ll arr[n];\n    SCA(arr,n);\n    //qsort(arr,n,sizeof(arr[0]),cmp);\n    double ans=0;\n    REP(i,k)\n    {\n        ll x=arr[i]*(arr[i]+1)/2;\n        ans+=(1.0*x)/arr[i];\n    }\n    double max=ans;\n    FOR(i,k+1,n-1)\n    {\n        ll x=arr[i]*(arr[i]+1)/2;\n        ans+=(1.0*x)/arr[i];\n        x=arr[i-k-1]*(arr[i-k-1]+1)/2;\n        ans-=(1.0*x)/arr[i-k-1];\n        if(max<ans)\n            max=ans;\n\n    }\n    printf(\"%.10f\\n\",max);\n\n    return 0;\n}\n \n \n//qsort(arr,n,sizeof(arr[0]),cmp);\nint cmp (const void * a, const void * b)\n{\n    if( *(ll*)a - *(ll*)b < 0 ) return 1;\n    if( *(ll*)a - *(ll*)b > 0 ) return -1;\n        return 0;\n}\nlong long maxv(long long a,long long b)\n{\n    if(a>b) return a;\n        return b;\n}\nlong long minv(long long a,long long b)\n{\n    if(a<b) return a;\n        return b;\n}\nlong long gcd(long long u,long long v)\n{\n    if (v == 0) return u; \n       return gcd(v, u%v);\n}\nlong long digits(long long n)    //to calculate no of digits in a number\n{\n    return floor(log10(n))+1;\n}\nbool ispoweroftwo(long long x)\n{\n    return x && (!(x&(x-1)));\n}\nbool isvowel(char x)\n{\n    return(x=='a' || x== 'e' ||x=='i' || x== 'o' || x=='u' );\n}\nll chartoint(char ch)\n{\n    if(ch>='A' && ch<='Z') return(ch-'A');\n    else if(ch>='0' && ch<='9') return (ch-'0');\n    else if(ch>='a' && ch<='z') return (ch-'a');\n    else return 0;\n}\nll CEIL(ll x,ll y)\n{\n    if(x%y==0) return(x/y);\n    else return(x/y +1);\n}\n \nll FLOOR(ll x,ll y)\n{\n    if(x%y==0) return(x/y);\n    else return(x/y -1);\n}", "problem_context": "Score : 400 points\n\nProblem Statement\n\nWe have N dice arranged in a line from left to right. The i-th die from the left shows p_i numbers from 1 to p_i with equal probability when thrown.\n\nWe will choose K adjacent dice, throw each of them independently, and compute the sum of the numbers shown. Find the maximum possible value of the expected value of this sum.\n\nConstraints\n\n1 ≤ K ≤ N ≤ 200000\n\n1 ≤ p_i ≤ 1000\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_N\n\nOutput\n\nPrint the maximum possible value of the expected value of the sum of the numbers shown.\n\nYour output will be considered correct when its absolute or relative error from our answer is at most 10^{-6}.\n\nSample Input 1\n\n5 3\n1 2 2 4 5\n\nSample Output 1\n\n7.000000000000\n\nWhen we throw the third, fourth, and fifth dice from the left, the expected value of the sum of the numbers shown is 7. This is the maximum value we can achieve.\n\nSample Input 2\n\n4 1\n6 6 6 6\n\nSample Output 2\n\n3.500000000000\n\nRegardless of which die we choose, the expected value of the number shown is 3.5.\n\nSample Input 3\n\n10 4\n17 13 13 12 15 20 10 13 17 11\n\nSample Output 3\n\n32.000000000000", "sample_input": "5 3\n1 2 2 4 5\n"}, "reference_outputs": ["7.000000000000\n"], "source_document_id": "p02780", "source_text": "Score : 400 points\n\nProblem Statement\n\nWe have N dice arranged in a line from left to right. The i-th die from the left shows p_i numbers from 1 to p_i with equal probability when thrown.\n\nWe will choose K adjacent dice, throw each of them independently, and compute the sum of the numbers shown. Find the maximum possible value of the expected value of this sum.\n\nConstraints\n\n1 ≤ K ≤ N ≤ 200000\n\n1 ≤ p_i ≤ 1000\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_N\n\nOutput\n\nPrint the maximum possible value of the expected value of the sum of the numbers shown.\n\nYour output will be considered correct when its absolute or relative error from our answer is at most 10^{-6}.\n\nSample Input 1\n\n5 3\n1 2 2 4 5\n\nSample Output 1\n\n7.000000000000\n\nWhen we throw the third, fourth, and fifth dice from the left, the expected value of the sum of the numbers shown is 7. This is the maximum value we can achieve.\n\nSample Input 2\n\n4 1\n6 6 6 6\n\nSample Output 2\n\n3.500000000000\n\nRegardless of which die we choose, the expected value of the number shown is 3.5.\n\nSample Input 3\n\n10 4\n17 13 13 12 15 20 10 13 17 11\n\nSample Output 3\n\n32.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": 3725, "cpu_time_ms": 20, "memory_kb": 1792}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s976405451", "group_id": "codeNet:p02783", "input_text": "#include<stdio.h>\nint main()\n{\nint H,A,x;\nscanf(\"%d%d\",&H,&A);\nif(H%A==0)\n{\nx=H/A;\n}\nelse\n{\n x=(H/A)+1;\n}\nprintf(\"%d\",x);\nreturn 0; }\n", "language": "C", "metadata": {"date": 1581386118, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "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/C/s976405451.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s976405451", "user_id": "u863370423"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "#include<stdio.h>\nint main()\n{\nint H,A,x;\nscanf(\"%d%d\",&H,&A);\nif(H%A==0)\n{\nx=H/A;\n}\nelse\n{\n x=(H/A)+1;\n}\nprintf(\"%d\",x);\nreturn 0; }\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": 134, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s205676992", "group_id": "codeNet:p02783", "input_text": "#include <stdio.h>\n \nint main(void) {\n  int H, N;\n  int A[100];\n  scanf(\"%d%d\", &H, &N);\n  int i;\n  for (i=0; i<N; i++) {\n    scanf(\"%d\", &A[i]);\n  }\n  int sum = 0;\n  for (i=0; i<N; i++) {\n    sum += A[i];\n  }\n  if (sum >= H) {\n    printf(\"yes\");\n  } else {\n    printf(\"no\");\n  }\n  return 0;\n}", "language": "C", "metadata": {"date": 1581265884, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "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/C/s205676992.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s205676992", "user_id": "u247482575"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "#include <stdio.h>\n \nint main(void) {\n  int H, N;\n  int A[100];\n  scanf(\"%d%d\", &H, &N);\n  int i;\n  for (i=0; i<N; i++) {\n    scanf(\"%d\", &A[i]);\n  }\n  int sum = 0;\n  for (i=0; i<N; i++) {\n    sum += A[i];\n  }\n  if (sum >= H) {\n    printf(\"yes\");\n  } else {\n    printf(\"no\");\n  }\n  return 0;\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": 293, "cpu_time_ms": 101, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s590693838", "group_id": "codeNet:p02784", "input_text": "#include <stdlib.h>\n#include <math.h>\n#include <string.h>\n#include <stdbool.h>\n#include <stdio.h>\n\nint main()\n{\n    long long int h, i, n, a, t = 0;    \n    scanf(\"%lld %lld\", &h, &n);\n    for (i = 0; i < n; i++)\n    {\n        scanf(\"%lld\", &a);\n        t += a;\n    }\n    if(t >= h)\n        printf(\"Yes\");\n    else\n        printf(\"No\");\n\treturn 0;\n}\n\n", "language": "C", "metadata": {"date": 1585791049, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "problem_description_relpath": "problem_descriptions/p02784.html", "problem_id": "p02784", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02784/input.txt", "sample_output_relpath": "derived/input_output/data/p02784/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02784/C/s590693838.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s590693838", "user_id": "u089230684"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "#include <stdlib.h>\n#include <math.h>\n#include <string.h>\n#include <stdbool.h>\n#include <stdio.h>\n\nint main()\n{\n    long long int h, i, n, a, t = 0;    \n    scanf(\"%lld %lld\", &h, &n);\n    for (i = 0; i < n; i++)\n    {\n        scanf(\"%lld\", &a);\n        t += a;\n    }\n    if(t >= h)\n        printf(\"Yes\");\n    else\n        printf(\"No\");\n\treturn 0;\n}\n\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nRaccoon is fighting with a monster.\n\nThe health of the monster is H.\n\nRaccoon can use N kinds of special moves. Using the i-th move decreases the monster's health by A_i.\nThere is no other way to decrease the monster's health.\n\nRaccoon wins when the monster's health becomes 0 or below.\n\nIf Raccoon can win without using the same move twice or more, print Yes; otherwise, print No.\n\nConstraints\n\n1 \\leq H \\leq 10^9\n\n1 \\leq N \\leq 10^5\n\n1 \\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\nH N\nA_1 A_2 ... A_N\n\nOutput\n\nIf Raccoon can win without using the same move twice or more, print Yes; otherwise, print No.\n\nSample Input 1\n\n10 3\n4 5 6\n\nSample Output 1\n\nYes\n\nThe monster's health will become 0 or below after, for example, using the second and third moves.\n\nSample Input 2\n\n20 3\n4 5 6\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n210 5\n31 41 59 26 53\n\nSample Output 3\n\nYes\n\nSample Input 4\n\n211 5\n31 41 59 26 53\n\nSample Output 4\n\nNo", "sample_input": "10 3\n4 5 6\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p02784", "source_text": "Score : 200 points\n\nProblem Statement\n\nRaccoon is fighting with a monster.\n\nThe health of the monster is H.\n\nRaccoon can use N kinds of special moves. Using the i-th move decreases the monster's health by A_i.\nThere is no other way to decrease the monster's health.\n\nRaccoon wins when the monster's health becomes 0 or below.\n\nIf Raccoon can win without using the same move twice or more, print Yes; otherwise, print No.\n\nConstraints\n\n1 \\leq H \\leq 10^9\n\n1 \\leq N \\leq 10^5\n\n1 \\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\nH N\nA_1 A_2 ... A_N\n\nOutput\n\nIf Raccoon can win without using the same move twice or more, print Yes; otherwise, print No.\n\nSample Input 1\n\n10 3\n4 5 6\n\nSample Output 1\n\nYes\n\nThe monster's health will become 0 or below after, for example, using the second and third moves.\n\nSample Input 2\n\n20 3\n4 5 6\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n210 5\n31 41 59 26 53\n\nSample Output 3\n\nYes\n\nSample Input 4\n\n211 5\n31 41 59 26 53\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": 351, "cpu_time_ms": 10, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s321390176", "group_id": "codeNet:p02784", "input_text": "#include<stdio.h>\n#include<stdlib.h>\n#include<string.h>\n\nint main(void){\n    int i = 0,h,n,sum = 0,a;\n\n    scanf(\"%d%d\",&h,&n);\n    for(i=0;i<n;i++){\n        scanf(\"%d\",&a);\n        sum += a;\n    }\n\n    if(sum > h) printf(\"Yes\\n\");\n    else printf(\"No\\n\");\n}", "language": "C", "metadata": {"date": 1581785271, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "problem_description_relpath": "problem_descriptions/p02784.html", "problem_id": "p02784", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02784/input.txt", "sample_output_relpath": "derived/input_output/data/p02784/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02784/C/s321390176.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s321390176", "user_id": "u331464808"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "#include<stdio.h>\n#include<stdlib.h>\n#include<string.h>\n\nint main(void){\n    int i = 0,h,n,sum = 0,a;\n\n    scanf(\"%d%d\",&h,&n);\n    for(i=0;i<n;i++){\n        scanf(\"%d\",&a);\n        sum += a;\n    }\n\n    if(sum > h) printf(\"Yes\\n\");\n    else printf(\"No\\n\");\n}", "problem_context": "Score : 200 points\n\nProblem Statement\n\nRaccoon is fighting with a monster.\n\nThe health of the monster is H.\n\nRaccoon can use N kinds of special moves. Using the i-th move decreases the monster's health by A_i.\nThere is no other way to decrease the monster's health.\n\nRaccoon wins when the monster's health becomes 0 or below.\n\nIf Raccoon can win without using the same move twice or more, print Yes; otherwise, print No.\n\nConstraints\n\n1 \\leq H \\leq 10^9\n\n1 \\leq N \\leq 10^5\n\n1 \\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\nH N\nA_1 A_2 ... A_N\n\nOutput\n\nIf Raccoon can win without using the same move twice or more, print Yes; otherwise, print No.\n\nSample Input 1\n\n10 3\n4 5 6\n\nSample Output 1\n\nYes\n\nThe monster's health will become 0 or below after, for example, using the second and third moves.\n\nSample Input 2\n\n20 3\n4 5 6\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n210 5\n31 41 59 26 53\n\nSample Output 3\n\nYes\n\nSample Input 4\n\n211 5\n31 41 59 26 53\n\nSample Output 4\n\nNo", "sample_input": "10 3\n4 5 6\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p02784", "source_text": "Score : 200 points\n\nProblem Statement\n\nRaccoon is fighting with a monster.\n\nThe health of the monster is H.\n\nRaccoon can use N kinds of special moves. Using the i-th move decreases the monster's health by A_i.\nThere is no other way to decrease the monster's health.\n\nRaccoon wins when the monster's health becomes 0 or below.\n\nIf Raccoon can win without using the same move twice or more, print Yes; otherwise, print No.\n\nConstraints\n\n1 \\leq H \\leq 10^9\n\n1 \\leq N \\leq 10^5\n\n1 \\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\nH N\nA_1 A_2 ... A_N\n\nOutput\n\nIf Raccoon can win without using the same move twice or more, print Yes; otherwise, print No.\n\nSample Input 1\n\n10 3\n4 5 6\n\nSample Output 1\n\nYes\n\nThe monster's health will become 0 or below after, for example, using the second and third moves.\n\nSample Input 2\n\n20 3\n4 5 6\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n210 5\n31 41 59 26 53\n\nSample Output 3\n\nYes\n\nSample Input 4\n\n211 5\n31 41 59 26 53\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": 258, "cpu_time_ms": 10, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s163793317", "group_id": "codeNet:p02784", "input_text": "#include <stdio.h>\nint main(){\n    int H,N,A[10001];\n    scanf(\"%d %d\",&H,&N);\n    int i,sum;\n    \n    for(i=0;i<N;i++){\n        scanf(\"%d\",&A[i]);\n    }\n    sum = 0;\n    for(i = 0;i<N ;i++){\n        sum = sum + A[i];\n    }\n    if(sum>=H){\n        printf(\"Yes\\n\");\n    }else{\n        printf(\"No\\n\");\n    }\n    return 0;\n}\n", "language": "C", "metadata": {"date": 1580137591, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "problem_description_relpath": "problem_descriptions/p02784.html", "problem_id": "p02784", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02784/input.txt", "sample_output_relpath": "derived/input_output/data/p02784/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02784/C/s163793317.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s163793317", "user_id": "u396522269"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "#include <stdio.h>\nint main(){\n    int H,N,A[10001];\n    scanf(\"%d %d\",&H,&N);\n    int i,sum;\n    \n    for(i=0;i<N;i++){\n        scanf(\"%d\",&A[i]);\n    }\n    sum = 0;\n    for(i = 0;i<N ;i++){\n        sum = sum + A[i];\n    }\n    if(sum>=H){\n        printf(\"Yes\\n\");\n    }else{\n        printf(\"No\\n\");\n    }\n    return 0;\n}\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nRaccoon is fighting with a monster.\n\nThe health of the monster is H.\n\nRaccoon can use N kinds of special moves. Using the i-th move decreases the monster's health by A_i.\nThere is no other way to decrease the monster's health.\n\nRaccoon wins when the monster's health becomes 0 or below.\n\nIf Raccoon can win without using the same move twice or more, print Yes; otherwise, print No.\n\nConstraints\n\n1 \\leq H \\leq 10^9\n\n1 \\leq N \\leq 10^5\n\n1 \\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\nH N\nA_1 A_2 ... A_N\n\nOutput\n\nIf Raccoon can win without using the same move twice or more, print Yes; otherwise, print No.\n\nSample Input 1\n\n10 3\n4 5 6\n\nSample Output 1\n\nYes\n\nThe monster's health will become 0 or below after, for example, using the second and third moves.\n\nSample Input 2\n\n20 3\n4 5 6\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n210 5\n31 41 59 26 53\n\nSample Output 3\n\nYes\n\nSample Input 4\n\n211 5\n31 41 59 26 53\n\nSample Output 4\n\nNo", "sample_input": "10 3\n4 5 6\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p02784", "source_text": "Score : 200 points\n\nProblem Statement\n\nRaccoon is fighting with a monster.\n\nThe health of the monster is H.\n\nRaccoon can use N kinds of special moves. Using the i-th move decreases the monster's health by A_i.\nThere is no other way to decrease the monster's health.\n\nRaccoon wins when the monster's health becomes 0 or below.\n\nIf Raccoon can win without using the same move twice or more, print Yes; otherwise, print No.\n\nConstraints\n\n1 \\leq H \\leq 10^9\n\n1 \\leq N \\leq 10^5\n\n1 \\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\nH N\nA_1 A_2 ... A_N\n\nOutput\n\nIf Raccoon can win without using the same move twice or more, print Yes; otherwise, print No.\n\nSample Input 1\n\n10 3\n4 5 6\n\nSample Output 1\n\nYes\n\nThe monster's health will become 0 or below after, for example, using the second and third moves.\n\nSample Input 2\n\n20 3\n4 5 6\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n210 5\n31 41 59 26 53\n\nSample Output 3\n\nYes\n\nSample Input 4\n\n211 5\n31 41 59 26 53\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": 322, "cpu_time_ms": 101, "memory_kb": 256}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s023986128", "group_id": "codeNet:p02785", "input_text": "#include <stdio.h>\n\nint main(void){\n  int n, k;\n  scanf(\"%d %d\\n\",&n ,&k);\n\n  if(n <= k){\n    printf(\"0\\n\");\n    return(0);\n  }\n\n\n  long int h[k], sum=0;\n  for (int i = 0; i < n; i++) {\n    scanf(\"%ld\\n\", &h[i]);\n    sum+=h[i];\n  }\n\n  for (int i = 0; i < k; i++) {\n    for (int j = n-1; j > i; j--) {\n      if(h[i]<h[j]){\n        long int temp;\n\n        temp = h[i];\n        h[i] = h[j];\n        h[j] = temp;\n      }\n    }\n  }\n\n  while(k>0){\n    sum -= h[k-1];\n    k--;\n  }\n\n  printf(\"%ld\\n\", sum);\n\n  return(0);\n}\n", "language": "C", "metadata": {"date": 1580330057, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "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/C/s023986128.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s023986128", "user_id": "u898421050"}, "prompt_components": {"gold_output": "5\n", "input_to_evaluate": "#include <stdio.h>\n\nint main(void){\n  int n, k;\n  scanf(\"%d %d\\n\",&n ,&k);\n\n  if(n <= k){\n    printf(\"0\\n\");\n    return(0);\n  }\n\n\n  long int h[k], sum=0;\n  for (int i = 0; i < n; i++) {\n    scanf(\"%ld\\n\", &h[i]);\n    sum+=h[i];\n  }\n\n  for (int i = 0; i < k; i++) {\n    for (int j = n-1; j > i; j--) {\n      if(h[i]<h[j]){\n        long int temp;\n\n        temp = h[i];\n        h[i] = h[j];\n        h[j] = temp;\n      }\n    }\n  }\n\n  while(k>0){\n    sum -= h[k-1];\n    k--;\n  }\n\n  printf(\"%ld\\n\", sum);\n\n  return(0);\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": 515, "cpu_time_ms": 2103, "memory_kb": 1664}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s907466134", "group_id": "codeNet:p02786", "input_text": "#include<stdio.h>\n#include<stdlib.h>\n\ntypedef long long ll;\ntypedef const void cv;\nint downint(cv *a, cv *b) {\n  return *(int *)a < *(int *)b ? 1 : *(int *)a > *(int *)b ? -1 : 0;\n}\n\nll battle(ll hp){\n  if(hp==1){\n     return 1;\n  }else{\n    return battle(hp/2)*2+1;\n  }\n  \n\n}\nint main(void){\n  ll h, result=0;\n  scanf(\"%lld\",&h);\n  result=battle(h);\n  printf(\"%lld\",result);\n  \n  return 0;\n}", "language": "C", "metadata": {"date": 1590789654, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "problem_description_relpath": "problem_descriptions/p02786.html", "problem_id": "p02786", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02786/input.txt", "sample_output_relpath": "derived/input_output/data/p02786/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02786/C/s907466134.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s907466134", "user_id": "u523462306"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "#include<stdio.h>\n#include<stdlib.h>\n\ntypedef long long ll;\ntypedef const void cv;\nint downint(cv *a, cv *b) {\n  return *(int *)a < *(int *)b ? 1 : *(int *)a > *(int *)b ? -1 : 0;\n}\n\nll battle(ll hp){\n  if(hp==1){\n     return 1;\n  }else{\n    return battle(hp/2)*2+1;\n  }\n  \n\n}\nint main(void){\n  ll h, result=0;\n  scanf(\"%lld\",&h);\n  result=battle(h);\n  printf(\"%lld\",result);\n  \n  return 0;\n}", "problem_context": "Score : 400 points\n\nProblem Statement\n\nCaracal is fighting with a monster.\n\nThe health of the monster is H.\n\nCaracal can attack by choosing one monster. When a monster is attacked, depending on that monster's health, the following happens:\n\nIf the monster's health is 1, it drops to 0.\n\nIf the monster's health, X, is greater than 1, that monster disappears. Then, two new monsters appear, each with the health of \\lfloor X/2 \\rfloor.\n\n(\\lfloor r \\rfloor denotes the greatest integer not exceeding r.)\n\nCaracal wins when the healths of all existing monsters become 0 or below.\n\nFind the minimum number of attacks Caracal needs to make before winning.\n\nConstraints\n\n1 \\leq H \\leq 10^{12}\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH\n\nOutput\n\nFind the minimum number of attacks Caracal needs to make before winning.\n\nSample Input 1\n\n2\n\nSample Output 1\n\n3\n\nWhen Caracal attacks the initial monster, it disappears, and two monsters appear, each with the health of 1.\n\nThen, Caracal can attack each of these new monsters once and win with a total of three attacks.\n\nSample Input 2\n\n4\n\nSample Output 2\n\n7\n\nSample Input 3\n\n1000000000000\n\nSample Output 3\n\n1099511627775", "sample_input": "2\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02786", "source_text": "Score : 400 points\n\nProblem Statement\n\nCaracal is fighting with a monster.\n\nThe health of the monster is H.\n\nCaracal can attack by choosing one monster. When a monster is attacked, depending on that monster's health, the following happens:\n\nIf the monster's health is 1, it drops to 0.\n\nIf the monster's health, X, is greater than 1, that monster disappears. Then, two new monsters appear, each with the health of \\lfloor X/2 \\rfloor.\n\n(\\lfloor r \\rfloor denotes the greatest integer not exceeding r.)\n\nCaracal wins when the healths of all existing monsters become 0 or below.\n\nFind the minimum number of attacks Caracal needs to make before winning.\n\nConstraints\n\n1 \\leq H \\leq 10^{12}\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH\n\nOutput\n\nFind the minimum number of attacks Caracal needs to make before winning.\n\nSample Input 1\n\n2\n\nSample Output 1\n\n3\n\nWhen Caracal attacks the initial monster, it disappears, and two monsters appear, each with the health of 1.\n\nThen, Caracal can attack each of these new monsters once and win with a total of three attacks.\n\nSample Input 2\n\n4\n\nSample Output 2\n\n7\n\nSample Input 3\n\n1000000000000\n\nSample Output 3\n\n1099511627775", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s248753618", "group_id": "codeNet:p02786", "input_text": "#include <stdio.h>\nint main()\n{\n\tlong long int a;\n\tlong long int num = 1;\n\tlong long int cnt = 0;\n\tscanf(\"%lld\", &a);\n\twhile (a >= 1)\n\t{\n\t\ta = a / 2;\n\t\tcnt = cnt + num;\n\t\tnum = num * 2;\n\t}\n\tprintf(\"%lld\",cnt);\n        return 0;\n}", "language": "C", "metadata": {"date": 1583852309, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "problem_description_relpath": "problem_descriptions/p02786.html", "problem_id": "p02786", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02786/input.txt", "sample_output_relpath": "derived/input_output/data/p02786/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02786/C/s248753618.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s248753618", "user_id": "u816631826"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "#include <stdio.h>\nint main()\n{\n\tlong long int a;\n\tlong long int num = 1;\n\tlong long int cnt = 0;\n\tscanf(\"%lld\", &a);\n\twhile (a >= 1)\n\t{\n\t\ta = a / 2;\n\t\tcnt = cnt + num;\n\t\tnum = num * 2;\n\t}\n\tprintf(\"%lld\",cnt);\n        return 0;\n}", "problem_context": "Score : 400 points\n\nProblem Statement\n\nCaracal is fighting with a monster.\n\nThe health of the monster is H.\n\nCaracal can attack by choosing one monster. When a monster is attacked, depending on that monster's health, the following happens:\n\nIf the monster's health is 1, it drops to 0.\n\nIf the monster's health, X, is greater than 1, that monster disappears. Then, two new monsters appear, each with the health of \\lfloor X/2 \\rfloor.\n\n(\\lfloor r \\rfloor denotes the greatest integer not exceeding r.)\n\nCaracal wins when the healths of all existing monsters become 0 or below.\n\nFind the minimum number of attacks Caracal needs to make before winning.\n\nConstraints\n\n1 \\leq H \\leq 10^{12}\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH\n\nOutput\n\nFind the minimum number of attacks Caracal needs to make before winning.\n\nSample Input 1\n\n2\n\nSample Output 1\n\n3\n\nWhen Caracal attacks the initial monster, it disappears, and two monsters appear, each with the health of 1.\n\nThen, Caracal can attack each of these new monsters once and win with a total of three attacks.\n\nSample Input 2\n\n4\n\nSample Output 2\n\n7\n\nSample Input 3\n\n1000000000000\n\nSample Output 3\n\n1099511627775", "sample_input": "2\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02786", "source_text": "Score : 400 points\n\nProblem Statement\n\nCaracal is fighting with a monster.\n\nThe health of the monster is H.\n\nCaracal can attack by choosing one monster. When a monster is attacked, depending on that monster's health, the following happens:\n\nIf the monster's health is 1, it drops to 0.\n\nIf the monster's health, X, is greater than 1, that monster disappears. Then, two new monsters appear, each with the health of \\lfloor X/2 \\rfloor.\n\n(\\lfloor r \\rfloor denotes the greatest integer not exceeding r.)\n\nCaracal wins when the healths of all existing monsters become 0 or below.\n\nFind the minimum number of attacks Caracal needs to make before winning.\n\nConstraints\n\n1 \\leq H \\leq 10^{12}\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH\n\nOutput\n\nFind the minimum number of attacks Caracal needs to make before winning.\n\nSample Input 1\n\n2\n\nSample Output 1\n\n3\n\nWhen Caracal attacks the initial monster, it disappears, and two monsters appear, each with the health of 1.\n\nThen, Caracal can attack each of these new monsters once and win with a total of three attacks.\n\nSample Input 2\n\n4\n\nSample Output 2\n\n7\n\nSample Input 3\n\n1000000000000\n\nSample Output 3\n\n1099511627775", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 229, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s546276782", "group_id": "codeNet:p02786", "input_text": "#include<stdio.h>\n\nint main(void){\n    long int h,num=1,cnt=0;\n    scanf(\"%ld\",&h);\n    while(h>0){\n        h/=2;\n        cnt +=num;\n        num*=2;\n    }\n    printf(\"%ld\",cnt);\n}\n", "language": "C", "metadata": {"date": 1580070743, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "problem_description_relpath": "problem_descriptions/p02786.html", "problem_id": "p02786", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02786/input.txt", "sample_output_relpath": "derived/input_output/data/p02786/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02786/C/s546276782.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s546276782", "user_id": "u234365185"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "#include<stdio.h>\n\nint main(void){\n    long int h,num=1,cnt=0;\n    scanf(\"%ld\",&h);\n    while(h>0){\n        h/=2;\n        cnt +=num;\n        num*=2;\n    }\n    printf(\"%ld\",cnt);\n}\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nCaracal is fighting with a monster.\n\nThe health of the monster is H.\n\nCaracal can attack by choosing one monster. When a monster is attacked, depending on that monster's health, the following happens:\n\nIf the monster's health is 1, it drops to 0.\n\nIf the monster's health, X, is greater than 1, that monster disappears. Then, two new monsters appear, each with the health of \\lfloor X/2 \\rfloor.\n\n(\\lfloor r \\rfloor denotes the greatest integer not exceeding r.)\n\nCaracal wins when the healths of all existing monsters become 0 or below.\n\nFind the minimum number of attacks Caracal needs to make before winning.\n\nConstraints\n\n1 \\leq H \\leq 10^{12}\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH\n\nOutput\n\nFind the minimum number of attacks Caracal needs to make before winning.\n\nSample Input 1\n\n2\n\nSample Output 1\n\n3\n\nWhen Caracal attacks the initial monster, it disappears, and two monsters appear, each with the health of 1.\n\nThen, Caracal can attack each of these new monsters once and win with a total of three attacks.\n\nSample Input 2\n\n4\n\nSample Output 2\n\n7\n\nSample Input 3\n\n1000000000000\n\nSample Output 3\n\n1099511627775", "sample_input": "2\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02786", "source_text": "Score : 400 points\n\nProblem Statement\n\nCaracal is fighting with a monster.\n\nThe health of the monster is H.\n\nCaracal can attack by choosing one monster. When a monster is attacked, depending on that monster's health, the following happens:\n\nIf the monster's health is 1, it drops to 0.\n\nIf the monster's health, X, is greater than 1, that monster disappears. Then, two new monsters appear, each with the health of \\lfloor X/2 \\rfloor.\n\n(\\lfloor r \\rfloor denotes the greatest integer not exceeding r.)\n\nCaracal wins when the healths of all existing monsters become 0 or below.\n\nFind the minimum number of attacks Caracal needs to make before winning.\n\nConstraints\n\n1 \\leq H \\leq 10^{12}\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH\n\nOutput\n\nFind the minimum number of attacks Caracal needs to make before winning.\n\nSample Input 1\n\n2\n\nSample Output 1\n\n3\n\nWhen Caracal attacks the initial monster, it disappears, and two monsters appear, each with the health of 1.\n\nThen, Caracal can attack each of these new monsters once and win with a total of three attacks.\n\nSample Input 2\n\n4\n\nSample Output 2\n\n7\n\nSample Input 3\n\n1000000000000\n\nSample Output 3\n\n1099511627775", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 180, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s167264329", "group_id": "codeNet:p02789", "input_text": "#include<stdio.h>\n\nint main()\n{\n  int n, m;\n  scanf(\"%d %d\", &n, &m);\n  \n  if (m < n) {\n    printf(\"No\");\n  } else {\n    printf(\"Yes\");\n  }\n  \n  return 0;\n}", "language": "C", "metadata": {"date": 1598530888, "filename_ext": "c", "original_language": "C (GCC 9.2.1)", "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/C/s167264329.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s167264329", "user_id": "u217053106"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "#include<stdio.h>\n\nint main()\n{\n  int n, m;\n  scanf(\"%d %d\", &n, &m);\n  \n  if (m < n) {\n    printf(\"No\");\n  } else {\n    printf(\"Yes\");\n  }\n  \n  return 0;\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": 156, "cpu_time_ms": 4, "memory_kb": 1736}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s109488586", "group_id": "codeNet:p02789", "input_text": "#include<stdio.h>\nint main()\n{\n    int n,i;\n    scanf(\"%d%d\",&n,&i);\n    if(n==i)\n    {\n        printf(\"Yes\\n\");\n    }\n    else\n    {\n        printf(\"No\\n\");\n    }\n    return 0;\n}\n", "language": "C", "metadata": {"date": 1584744537, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "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/C/s109488586.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s109488586", "user_id": "u753624501"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "#include<stdio.h>\nint main()\n{\n    int n,i;\n    scanf(\"%d%d\",&n,&i);\n    if(n==i)\n    {\n        printf(\"Yes\\n\");\n    }\n    else\n    {\n        printf(\"No\\n\");\n    }\n    return 0;\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": 180, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s691941226", "group_id": "codeNet:p02789", "input_text": "#include<stdio.h>\nint main(){\n    int a,b;\n    scanf(\"%d %d\",&a, &b);\n    if(a==b)\n    printf(\"yes\");\n    else\n        printf(\"no\");\n\nreturn 0;\n}\n", "language": "C", "metadata": {"date": 1581716177, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "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/C/s691941226.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s691941226", "user_id": "u353919145"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "#include<stdio.h>\nint main(){\n    int a,b;\n    scanf(\"%d %d\",&a, &b);\n    if(a==b)\n    printf(\"yes\");\n    else\n        printf(\"no\");\n\nreturn 0;\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": 146, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s090099786", "group_id": "codeNet:p02789", "input_text": "#include<stdio.h>\n\nint main(void)\n{\n    int n,m;\n\n    scanf(\"%d %d\",n,m);\n\n    if(n - m == 0)\n    {\n        printf(\"Yes\\n\");\n\n    }\n    else if(n - m < 0)\n    {\n        printf(\"No\\n\");\n    }\n\n    return 0;\n\n}", "language": "C", "metadata": {"date": 1579873368, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "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/C/s090099786.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s090099786", "user_id": "u347299480"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "#include<stdio.h>\n\nint main(void)\n{\n    int n,m;\n\n    scanf(\"%d %d\",n,m);\n\n    if(n - m == 0)\n    {\n        printf(\"Yes\\n\");\n\n    }\n    else if(n - m < 0)\n    {\n        printf(\"No\\n\");\n    }\n\n    return 0;\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": 208, "cpu_time_ms": 98, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s131002377", "group_id": "codeNet:p02789", "input_text": "#include<stdio.h>\nint main(){\nint n,m;\nscanf(\"%d %d\",&n,&m);\nif(n==m)printf(\"Yes\");\nelse printf(\"No\");\n  return 0;\n}", "language": "C", "metadata": {"date": 1579540802, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "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/C/s131002377.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s131002377", "user_id": "u660009720"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "#include<stdio.h>\nint main(){\nint n,m;\nscanf(\"%d %d\",&n,&m);\nif(n==m)printf(\"Yes\");\nelse printf(\"No\");\n  return 0;\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": 116, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s966818844", "group_id": "codeNet:p02789", "input_text": "#include <stdio.h>\n \nint main(void)\n{\n  float a, b;\n\n  scanf(\"%f\", &a);\n  scanf(\"%f\", &b);\n \n  if (a == b){\n    printf(\"Yes\\n\");\n  }\n  else {\n    printf(\"No\\n\");\n  }\n \n  return 0;\n}\n", "language": "C", "metadata": {"date": 1579464035, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "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/C/s966818844.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s966818844", "user_id": "u428716158"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "#include <stdio.h>\n \nint main(void)\n{\n  float a, b;\n\n  scanf(\"%f\", &a);\n  scanf(\"%f\", &b);\n \n  if (a == b){\n    printf(\"Yes\\n\");\n  }\n  else {\n    printf(\"No\\n\");\n  }\n \n  return 0;\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": 182, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s161101691", "group_id": "codeNet:p02789", "input_text": "#include <stdio.h>\nint main(void){\n    int m,n;\n    scanf(\"%d %d\", &n, &m);\n    if(n = m){\n        printf(\"Yes\\n\");\n    }\n    else{\n        printf(\"No\\n\");\n    }\n    return 0;\n}", "language": "C", "metadata": {"date": 1579463686, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "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/C/s161101691.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s161101691", "user_id": "u509179239"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "#include <stdio.h>\nint main(void){\n    int m,n;\n    scanf(\"%d %d\", &n, &m);\n    if(n = m){\n        printf(\"Yes\\n\");\n    }\n    else{\n        printf(\"No\\n\");\n    }\n    return 0;\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": 177, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s694511247", "group_id": "codeNet:p02791", "input_text": "//なにを出力するかをしっかり確認する必要がある\n\n/*\t<limit.h>で範囲を確認できる\n\tint型サイズ4バイト\t変換指定子d\n\t2147483647～-2147483648\n\t\n\tunsigned int型4バイト\t変換指定子u\n\t4294967295～0\n\t\n\tlong int型　8バイト\t変換指定子ld\n\t9223372036854775807～-9223372036854775808\n\t\n\tunsigned long int 型 8バイト　変換指定子lu\n\t18446744073709551615～0\n\t\n\tshort int型2バイト　変換指定子d\n\t32767～-32768\n\t\n\tunsigned short int型2バイト 変換指定子u\n\t65535～0\n\t\n\tlong long int型\n\tLLまたはｌｌで表す、　unsignedは頭にuをつける\n\t\n\t\n\t配列はnを利用して宣言するわけだからnの格納後に宣言しなければならない\n\t\n\tアルゴリズム\n\ti番目の数字が1～i-1番目の任意の数字以下であるという条件を満たす\n\t整数iの個数を数える\n\t\n\t直観的な考え方\n\t1～i-1番目の全ての数字と比較する\n\t計算量が多くなりそう\n\t\n\t最小の数字を記録していく\n\tその最小の数字>=現在の数字\n\tならば最小の数字を更新+count+1\n\t\n\t\n\t\n*/\n#include <stdio.h>\nint main (void){\n\tint n, i;\n\tint count=0;\n\tint min =2000000;\n\t\n\tscanf(\"%d\", &n);\n\tint P[n];\n\tfor(i=0; i<n ;i++){\n\t\tscanf(\"%*c%d\", &P[i]);\n\t\t\n\t\tif(min < P[i]){\n\t\t\t//最初はどのような値でも条件を満たすことに注意\n\t\t\tif(i==0){\n\t\t\t\tcount+=1;\n\t\t\t}\n\t\t}else{\n\t\t\tmin = P[i];\n\t\t\tcount+=1;\n\t\t}\n\t\t\n\t\t\n\t\t\n\t}\n\tprintf(\"%d\", count);\n\treturn 0;\n}", "language": "C", "metadata": {"date": 1580751638, "filename_ext": "c", "original_language": "C (Clang 3.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/C/s694511247.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s694511247", "user_id": "u695544158"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "//なにを出力するかをしっかり確認する必要がある\n\n/*\t<limit.h>で範囲を確認できる\n\tint型サイズ4バイト\t変換指定子d\n\t2147483647～-2147483648\n\t\n\tunsigned int型4バイト\t変換指定子u\n\t4294967295～0\n\t\n\tlong int型　8バイト\t変換指定子ld\n\t9223372036854775807～-9223372036854775808\n\t\n\tunsigned long int 型 8バイト　変換指定子lu\n\t18446744073709551615～0\n\t\n\tshort int型2バイト　変換指定子d\n\t32767～-32768\n\t\n\tunsigned short int型2バイト 変換指定子u\n\t65535～0\n\t\n\tlong long int型\n\tLLまたはｌｌで表す、　unsignedは頭にuをつける\n\t\n\t\n\t配列はnを利用して宣言するわけだからnの格納後に宣言しなければならない\n\t\n\tアルゴリズム\n\ti番目の数字が1～i-1番目の任意の数字以下であるという条件を満たす\n\t整数iの個数を数える\n\t\n\t直観的な考え方\n\t1～i-1番目の全ての数字と比較する\n\t計算量が多くなりそう\n\t\n\t最小の数字を記録していく\n\tその最小の数字>=現在の数字\n\tならば最小の数字を更新+count+1\n\t\n\t\n\t\n*/\n#include <stdio.h>\nint main (void){\n\tint n, i;\n\tint count=0;\n\tint min =2000000;\n\t\n\tscanf(\"%d\", &n);\n\tint P[n];\n\tfor(i=0; i<n ;i++){\n\t\tscanf(\"%*c%d\", &P[i]);\n\t\t\n\t\tif(min < P[i]){\n\t\t\t//最初はどのような値でも条件を満たすことに注意\n\t\t\tif(i==0){\n\t\t\t\tcount+=1;\n\t\t\t}\n\t\t}else{\n\t\t\tmin = P[i];\n\t\t\tcount+=1;\n\t\t}\n\t\t\n\t\t\n\t\t\n\t}\n\tprintf(\"%d\", count);\n\treturn 0;\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": 1481, "cpu_time_ms": 25, "memory_kb": 896}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s891198782", "group_id": "codeNet:p02792", "input_text": "#include <stdio.h>\n\nint Mdigit(const int x) {\n\tif (99999 < x) {\n\t\treturn x / 100000;\n\t}\n\telse if (9999 < x && x < 100000) {\n\t\treturn x / 10000;\n\t}\n\telse if (999 < x && x < 10000) {\n\t\treturn x / 1000;\n\t}\n\telse if (99 < x && x < 1000) {\n\t\treturn x / 100;\n\t}\n\telse if (9 < x && x < 100) {\n\t\treturn x / 10;\n\t}\n\telse {\n\t\treturn x;\n\t}\n}\n\nint mdigit(const int x) {\n\treturn x % 10;\n}\n\nint main() {\n\tint N, i, j, AM, Am;\n\tlong ans = 0;\n\tlong c[10][10];\n\tscanf(\"%d\", &N);\n\tfor (i = 0; i <= 9; i++) {\n\t\tfor (j = 0; j <= 9; j++) {\n\t\t\tc[i][j] = 0;\n\t\t}\n\t}\n\n\tfor (i = 1; i <= N; i++) {\n\t\tc[Mdigit(i)][mdigit(i)]++;\n\t}\n\n\t//各Aに対して...\n\tfor (i = 1; i <= N; i++) {\n\t\tAM = Mdigit(i);\n\t\tAm = mdigit(i);\n\t\tans += c[Am][AM];\n\t}\n\tprintf(\"%ld\", ans);\n\treturn 0;\n}", "language": "C", "metadata": {"date": 1586509669, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "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/C/s891198782.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s891198782", "user_id": "u333114422"}, "prompt_components": {"gold_output": "17\n", "input_to_evaluate": "#include <stdio.h>\n\nint Mdigit(const int x) {\n\tif (99999 < x) {\n\t\treturn x / 100000;\n\t}\n\telse if (9999 < x && x < 100000) {\n\t\treturn x / 10000;\n\t}\n\telse if (999 < x && x < 10000) {\n\t\treturn x / 1000;\n\t}\n\telse if (99 < x && x < 1000) {\n\t\treturn x / 100;\n\t}\n\telse if (9 < x && x < 100) {\n\t\treturn x / 10;\n\t}\n\telse {\n\t\treturn x;\n\t}\n}\n\nint mdigit(const int x) {\n\treturn x % 10;\n}\n\nint main() {\n\tint N, i, j, AM, Am;\n\tlong ans = 0;\n\tlong c[10][10];\n\tscanf(\"%d\", &N);\n\tfor (i = 0; i <= 9; i++) {\n\t\tfor (j = 0; j <= 9; j++) {\n\t\t\tc[i][j] = 0;\n\t\t}\n\t}\n\n\tfor (i = 1; i <= N; i++) {\n\t\tc[Mdigit(i)][mdigit(i)]++;\n\t}\n\n\t//各Aに対して...\n\tfor (i = 1; i <= N; i++) {\n\t\tAM = Mdigit(i);\n\t\tAm = mdigit(i);\n\t\tans += c[Am][AM];\n\t}\n\tprintf(\"%ld\", ans);\n\treturn 0;\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": 747, "cpu_time_ms": 2, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s863689389", "group_id": "codeNet:p02792", "input_text": "#include<stdio.h>\n#include<stdlib.h>\n#include<stdbool.h>\n#include<ctype.h>\n#define mprint(x) printf(FORMATCONVERSION(x),(x))\n#define FORMATCONVERSION(x) _Generic((x),\\\n                                    int:\"%d\",unsigned int:\"%u\",\\\n                                    double:\"%lf\",long long int:\"%lld\",\\\n                                    unsigned long long int:\"%llu\",\\\n                                    char :\"%c\",char*:\"%s\")\n\n#define mswap(x,y) _Generic((x),int:swap_int,unsigned int:swap_uint,\\\n                            long long:swap_ll,unsigned long long:swap_ull)(&(x),&(y))\n\nvoid swap_int(int *a,int *b){int tmp = *a;*a = *b;*b= tmp;return;}\nvoid swap_uint(unsigned int *a,unsigned int *b){unsigned int tmp = *a;*a = *b;*b= tmp;return;}\nvoid swap_ll(long long *a,long long *b){long long tmp = *a;*a = *b;*b= tmp;return;}\nvoid swap_ull(unsigned long long *a,unsigned long long *b){unsigned long long tmp = *a;*a = *b;*b= tmp;return;}\n\nint main(void){\n    int n;\n    scanf(\"%d\",&n);\n\n    int handtpair[10][10] = {};\n\n    int temp = 0;\n    for(int i = 1;i <= n;i++){\n        temp = i;\n        while(temp >= 10)temp /= 10;\n        if(temp != 0 && i % 10 != 0)++handtpair[temp][i % 10];\n    }\n\n    long long int ans = 0;\n    temp = 0;\n    for(int i = 0;i <= n;i++){\n        temp = i;\n        while(temp >= 10)temp /= 10;\n        if(temp != 0 && i % 10 != 0)ans += handtpair[i % 10][temp];\n    }\n    mprint(ans);\n    return 0;\n}", "language": "C", "metadata": {"date": 1579651285, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "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/C/s863689389.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s863689389", "user_id": "u491343140"}, "prompt_components": {"gold_output": "17\n", "input_to_evaluate": "#include<stdio.h>\n#include<stdlib.h>\n#include<stdbool.h>\n#include<ctype.h>\n#define mprint(x) printf(FORMATCONVERSION(x),(x))\n#define FORMATCONVERSION(x) _Generic((x),\\\n                                    int:\"%d\",unsigned int:\"%u\",\\\n                                    double:\"%lf\",long long int:\"%lld\",\\\n                                    unsigned long long int:\"%llu\",\\\n                                    char :\"%c\",char*:\"%s\")\n\n#define mswap(x,y) _Generic((x),int:swap_int,unsigned int:swap_uint,\\\n                            long long:swap_ll,unsigned long long:swap_ull)(&(x),&(y))\n\nvoid swap_int(int *a,int *b){int tmp = *a;*a = *b;*b= tmp;return;}\nvoid swap_uint(unsigned int *a,unsigned int *b){unsigned int tmp = *a;*a = *b;*b= tmp;return;}\nvoid swap_ll(long long *a,long long *b){long long tmp = *a;*a = *b;*b= tmp;return;}\nvoid swap_ull(unsigned long long *a,unsigned long long *b){unsigned long long tmp = *a;*a = *b;*b= tmp;return;}\n\nint main(void){\n    int n;\n    scanf(\"%d\",&n);\n\n    int handtpair[10][10] = {};\n\n    int temp = 0;\n    for(int i = 1;i <= n;i++){\n        temp = i;\n        while(temp >= 10)temp /= 10;\n        if(temp != 0 && i % 10 != 0)++handtpair[temp][i % 10];\n    }\n\n    long long int ans = 0;\n    temp = 0;\n    for(int i = 0;i <= n;i++){\n        temp = i;\n        while(temp >= 10)temp /= 10;\n        if(temp != 0 && i % 10 != 0)ans += handtpair[i % 10][temp];\n    }\n    mprint(ans);\n    return 0;\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": 1437, "cpu_time_ms": 4, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s552556730", "group_id": "codeNet:p02795", "input_text": "//set many funcs template\n//Ver.20190820\n#include<stdio.h>\n#include<string.h>\n#include<stdlib.h>\n#include<stdbool.h>\n#include<time.h>\n#include<assert.h>\n#define inf 1072114514\n#define llinf 4154118101919364364\n#define mod 1000000007\n#define pi 3.1415926535897932384\n\nint max(int a,int b){if(a>b){return a;}return b;}\nint min(int a,int b){if(a<b){return a;}return b;}\nint zt(int a,int b){return max(a,b)-min(a,b);}\nint round(int a,int b){if((a%b)*2 >= b){return (a/b)+1;}return a/b;}\nint ceil(int a,int b){if(a%b==0){return a/b;}return (a/b)+1;}\nint gcd(int a,int b){int c;while(b!=0){c=a%b;a=b;b=c;}return a;}\nint lcm(int a,int b){int c=gcd(a,b);a/=c;return a*b;}\nint nCr(int a,int b){int i,r=1;for(i=1;i<=b;i++){r*=(a+1-i);r/=i;}return r;}\nint nHr(int a,int b){return nCr(a+b-1,b);}\nint fact(int a){int i,r=1;for(i=1;i<=a;i++){r*=i;}return r;}\nint pow(int a,int b){int i,r=1;for(i=1;i<=b;i++){r*=a;}return r;}\nint dsum(int x){int r=0;while(x){r+=(x%10);x/=10;}return r;}\nint dsumb(int x,int b){int r=0;while(x){r+=(x%b);x/=b;}return r;}\nint sankaku(int x){return ((1+x)*x)/2;}\nvoid swap(int *a,int *b){int c;c=(*a);(*a)=(*b);(*b)=c;}\nlong long llmax(long long a,long long b){if(a>b){return a;}return b;}\nlong long llmin(long long a,long long b){if(a<b){return a;}return b;}\nlong long llzt(long long a,long long b){return llmax(a,b)-llmin(a,b);}\nlong long llround(long long a,long long b){if((a%b)*2 >= b){return (a/b)+1;}return a/b;}\nlong long llceil(long long a,long long b){if(a%b==0){return a/b;}return (a/b)+1;}\nlong long llgcd(long long a,long long b){long long c;while(b!=0){c=a%b;a=b;b=c;}return a;}\nlong long lllcm(long long a,long long b){long long c=llgcd(a,b);a/=c;return a*b;}\nlong long llnCr(long long a,long long b){long long i,r=1;for(i=1;i<=b;i++){r*=(a+1-i);r/=i;}return r;}\nlong long llnHr(long long a,long long b){return llnCr(a+b-1,b);}\nlong long llfact(long long a){long long i,r=1;for(i=1;i<=a;i++){r*=i;}return r;}\nlong long llpow(long long a,long long b){long long i,r=1;for(i=1;i<=b;i++){r*=a;}return r;}\nlong long lldsum(long long x){long long r=0;while(x){r+=(x%10);x/=10;}return r;}\nlong long lldsumb(long long x,long long b){long long r=0;while(x){r+=(x%b);x/=b;}return r;}\nlong long llsankaku(long long x){return ((1+x)*x)/2;}\nvoid llswap(long long *a,long long *b){long long c;c=(*a);(*a)=(*b);(*b)=c;}\ndouble dbmax(double a,double b){if(a>b){return a;}return b;}\ndouble dbmin(double a,double b){if(a<b){return a;}return b;}\ndouble dbzt(double a,double b){return dbmax(a,b)-dbmin(a,b);}\nvoid dbswap(double *a,double *b){double c;c=(*a);(*a)=(*b);(*b)=c;}\nvoid chswap(char *a,char *b){char c;c=(*a);(*a)=(*b);(*b)=c;}\nint sortfncsj(const void *a,const void *b){if(*(int *)a>*(int *)b){return 1;}if(*(int *)a==*(int *)b){return 0;}return -1;}\nint sortfnckj(const void *a,const void *b){if(*(int *)a<*(int *)b){return 1;}if(*(int *)a==*(int *)b){return 0;}return -1;}\nint llsortfncsj(const void *a,const void *b){if(*(long long *)a>*(long long *)b){return 1;}if(*(long long *)a==*(long long *)b){return 0;}return -1;}\nint llsortfnckj(const void *a,const void *b){if(*(long long *)a<*(long long *)b){return 1;}if(*(long long *)a==*(long long *)b){return 0;}return -1;}\nint dbsortfncsj(const void *a,const void *b){if(*(double *)a>*(double *)b){return 1;}if(*(double *)a==*(double *)b){return 0;}return -1;}\nint dbsortfnckj(const void *a,const void *b){if(*(double *)a<*(double *)b){return 1;}if(*(double *)a==*(double *)b){return 0;}return -1;}\nint strsortfncsj(const void *a,const void *b){return strcmp((char *)a,(char *)b);}\nint strsortfnckj(const void *a,const void *b){return strcmp((char *)b,(char *)a);}\nint chsortfncsj(const void *a,const void *b){if(*(char *)a>*(char *)b){return 1;}if(*(char *)a==*(char *)b){return 0;}return -1;}\nint chsortfnckj(const void *a,const void *b){if(*(char *)a<*(char *)b){return 1;}if(*(char *)a==*(char *)b){return 0;}return -1;}\n\nvoid shuffledget(int x[],int n){\n    int i,b[524288],p,c;\n    for(i=0;i<n;i++){\n        b[i]=i;\n    }\n    for(i=n;i>=1;i--){\n        p=rand()%i;\n        c=b[i-1];b[i-1]=b[p];b[p]=c;\n    }\n    for(i=0;i<n;i++){\n        scanf(\"%d\",&x[b[i]]);\n    }\n}\n\nint dx4[4]={1,-1,0,0};\nint dy4[4]={0,0,1,-1};\nint dx8[8]={-1,-1,-1,0,0,1,1,1};\nint dy8[8]={-1,0,1,-1,1,-1,0,1};\n\nint search(int x,int a[],int n){\n    int st=0,fi=n-1,te;\n    while(st<=fi){\n        te=(st+fi)/2;\n        if(a[te]<x){st=te+1;}else{fi=te-1;}\n    }\n    return st;\n}\n\nvoid prarr(int arr[],int n){\n  int i;\n  for(i=0;i<n;i++){\n    if(i){printf(\" \");}\n    printf(\"%d\",arr[i]);\n  }\n  printf(\"\\n\");\n  return;\n}\n\nvoid getperm(int a[],int n){\n  int i,p;\n  for(i=0;i<n;i++){\n    a[i]=i;\n  }\n  for(i=n-1;i>=1;i--){\n    p=rand()%(i+1);\n    swap(&a[p],&a[i]);\n  }\n}\n\ntypedef struct{\nint val;\nint node;\n}sd;\n\nint sdsortfnc(const void *a,const void *b){\nif(((sd*)a)->val < ((sd*)b)->val){return -1;}\nif(((sd*)a)->val > ((sd*)b)->val){return 1;}\nreturn 0;\n}\n\nvoid coordinate_comp(int a[],int n){\n  int i,c=0;\n  sd dat[524288];\n  for(i=0;i<n;i++){\n    dat[i].val=a[i];\n    dat[i].node=i;\n  }\n  qsort(dat,n,sizeof(dat[0]),sdsortfnc);\n  a[dat[0].node]=c;\n  for(i=1;i<n;i++){\n    if(dat[i-1].val!=dat[i].val){c++;}\n    a[dat[i].node]=c;\n  }\n}\n\nint main(void){\n  int i,j,n,m,k,a,b,c=0,h,w,r=0,l,t;\n  scanf(\"%d%d%d\",&h,&w,&n);\n  printf(\"%d\\n\",ceil(n,max(h,w)));\n  return 0;\n}\n", "language": "C", "metadata": {"date": 1579378140, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "problem_description_relpath": "problem_descriptions/p02795.html", "problem_id": "p02795", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02795/input.txt", "sample_output_relpath": "derived/input_output/data/p02795/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02795/C/s552556730.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s552556730", "user_id": "u721060623"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "//set many funcs template\n//Ver.20190820\n#include<stdio.h>\n#include<string.h>\n#include<stdlib.h>\n#include<stdbool.h>\n#include<time.h>\n#include<assert.h>\n#define inf 1072114514\n#define llinf 4154118101919364364\n#define mod 1000000007\n#define pi 3.1415926535897932384\n\nint max(int a,int b){if(a>b){return a;}return b;}\nint min(int a,int b){if(a<b){return a;}return b;}\nint zt(int a,int b){return max(a,b)-min(a,b);}\nint round(int a,int b){if((a%b)*2 >= b){return (a/b)+1;}return a/b;}\nint ceil(int a,int b){if(a%b==0){return a/b;}return (a/b)+1;}\nint gcd(int a,int b){int c;while(b!=0){c=a%b;a=b;b=c;}return a;}\nint lcm(int a,int b){int c=gcd(a,b);a/=c;return a*b;}\nint nCr(int a,int b){int i,r=1;for(i=1;i<=b;i++){r*=(a+1-i);r/=i;}return r;}\nint nHr(int a,int b){return nCr(a+b-1,b);}\nint fact(int a){int i,r=1;for(i=1;i<=a;i++){r*=i;}return r;}\nint pow(int a,int b){int i,r=1;for(i=1;i<=b;i++){r*=a;}return r;}\nint dsum(int x){int r=0;while(x){r+=(x%10);x/=10;}return r;}\nint dsumb(int x,int b){int r=0;while(x){r+=(x%b);x/=b;}return r;}\nint sankaku(int x){return ((1+x)*x)/2;}\nvoid swap(int *a,int *b){int c;c=(*a);(*a)=(*b);(*b)=c;}\nlong long llmax(long long a,long long b){if(a>b){return a;}return b;}\nlong long llmin(long long a,long long b){if(a<b){return a;}return b;}\nlong long llzt(long long a,long long b){return llmax(a,b)-llmin(a,b);}\nlong long llround(long long a,long long b){if((a%b)*2 >= b){return (a/b)+1;}return a/b;}\nlong long llceil(long long a,long long b){if(a%b==0){return a/b;}return (a/b)+1;}\nlong long llgcd(long long a,long long b){long long c;while(b!=0){c=a%b;a=b;b=c;}return a;}\nlong long lllcm(long long a,long long b){long long c=llgcd(a,b);a/=c;return a*b;}\nlong long llnCr(long long a,long long b){long long i,r=1;for(i=1;i<=b;i++){r*=(a+1-i);r/=i;}return r;}\nlong long llnHr(long long a,long long b){return llnCr(a+b-1,b);}\nlong long llfact(long long a){long long i,r=1;for(i=1;i<=a;i++){r*=i;}return r;}\nlong long llpow(long long a,long long b){long long i,r=1;for(i=1;i<=b;i++){r*=a;}return r;}\nlong long lldsum(long long x){long long r=0;while(x){r+=(x%10);x/=10;}return r;}\nlong long lldsumb(long long x,long long b){long long r=0;while(x){r+=(x%b);x/=b;}return r;}\nlong long llsankaku(long long x){return ((1+x)*x)/2;}\nvoid llswap(long long *a,long long *b){long long c;c=(*a);(*a)=(*b);(*b)=c;}\ndouble dbmax(double a,double b){if(a>b){return a;}return b;}\ndouble dbmin(double a,double b){if(a<b){return a;}return b;}\ndouble dbzt(double a,double b){return dbmax(a,b)-dbmin(a,b);}\nvoid dbswap(double *a,double *b){double c;c=(*a);(*a)=(*b);(*b)=c;}\nvoid chswap(char *a,char *b){char c;c=(*a);(*a)=(*b);(*b)=c;}\nint sortfncsj(const void *a,const void *b){if(*(int *)a>*(int *)b){return 1;}if(*(int *)a==*(int *)b){return 0;}return -1;}\nint sortfnckj(const void *a,const void *b){if(*(int *)a<*(int *)b){return 1;}if(*(int *)a==*(int *)b){return 0;}return -1;}\nint llsortfncsj(const void *a,const void *b){if(*(long long *)a>*(long long *)b){return 1;}if(*(long long *)a==*(long long *)b){return 0;}return -1;}\nint llsortfnckj(const void *a,const void *b){if(*(long long *)a<*(long long *)b){return 1;}if(*(long long *)a==*(long long *)b){return 0;}return -1;}\nint dbsortfncsj(const void *a,const void *b){if(*(double *)a>*(double *)b){return 1;}if(*(double *)a==*(double *)b){return 0;}return -1;}\nint dbsortfnckj(const void *a,const void *b){if(*(double *)a<*(double *)b){return 1;}if(*(double *)a==*(double *)b){return 0;}return -1;}\nint strsortfncsj(const void *a,const void *b){return strcmp((char *)a,(char *)b);}\nint strsortfnckj(const void *a,const void *b){return strcmp((char *)b,(char *)a);}\nint chsortfncsj(const void *a,const void *b){if(*(char *)a>*(char *)b){return 1;}if(*(char *)a==*(char *)b){return 0;}return -1;}\nint chsortfnckj(const void *a,const void *b){if(*(char *)a<*(char *)b){return 1;}if(*(char *)a==*(char *)b){return 0;}return -1;}\n\nvoid shuffledget(int x[],int n){\n    int i,b[524288],p,c;\n    for(i=0;i<n;i++){\n        b[i]=i;\n    }\n    for(i=n;i>=1;i--){\n        p=rand()%i;\n        c=b[i-1];b[i-1]=b[p];b[p]=c;\n    }\n    for(i=0;i<n;i++){\n        scanf(\"%d\",&x[b[i]]);\n    }\n}\n\nint dx4[4]={1,-1,0,0};\nint dy4[4]={0,0,1,-1};\nint dx8[8]={-1,-1,-1,0,0,1,1,1};\nint dy8[8]={-1,0,1,-1,1,-1,0,1};\n\nint search(int x,int a[],int n){\n    int st=0,fi=n-1,te;\n    while(st<=fi){\n        te=(st+fi)/2;\n        if(a[te]<x){st=te+1;}else{fi=te-1;}\n    }\n    return st;\n}\n\nvoid prarr(int arr[],int n){\n  int i;\n  for(i=0;i<n;i++){\n    if(i){printf(\" \");}\n    printf(\"%d\",arr[i]);\n  }\n  printf(\"\\n\");\n  return;\n}\n\nvoid getperm(int a[],int n){\n  int i,p;\n  for(i=0;i<n;i++){\n    a[i]=i;\n  }\n  for(i=n-1;i>=1;i--){\n    p=rand()%(i+1);\n    swap(&a[p],&a[i]);\n  }\n}\n\ntypedef struct{\nint val;\nint node;\n}sd;\n\nint sdsortfnc(const void *a,const void *b){\nif(((sd*)a)->val < ((sd*)b)->val){return -1;}\nif(((sd*)a)->val > ((sd*)b)->val){return 1;}\nreturn 0;\n}\n\nvoid coordinate_comp(int a[],int n){\n  int i,c=0;\n  sd dat[524288];\n  for(i=0;i<n;i++){\n    dat[i].val=a[i];\n    dat[i].node=i;\n  }\n  qsort(dat,n,sizeof(dat[0]),sdsortfnc);\n  a[dat[0].node]=c;\n  for(i=1;i<n;i++){\n    if(dat[i-1].val!=dat[i].val){c++;}\n    a[dat[i].node]=c;\n  }\n}\n\nint main(void){\n  int i,j,n,m,k,a,b,c=0,h,w,r=0,l,t;\n  scanf(\"%d%d%d\",&h,&w,&n);\n  printf(\"%d\\n\",ceil(n,max(h,w)));\n  return 0;\n}\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nWe have a grid with H rows and W columns, where all the squares are initially white.\n\nYou will perform some number of painting operations on the grid.\nIn one operation, you can do one of the following two actions:\n\nChoose one row, then paint all the squares in that row black.\n\nChoose one column, then paint all the squares in that column black.\n\nAt least how many operations do you need in order to have N or more black squares in the grid?\nIt is guaranteed that, under the conditions in Constraints, having N or more black squares is always possible by performing some number of operations.\n\nConstraints\n\n1 \\leq H \\leq 100\n\n1 \\leq W \\leq 100\n\n1 \\leq N \\leq H \\times W\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH\nW\nN\n\nOutput\n\nPrint the minimum number of operations needed.\n\nSample Input 1\n\n3\n7\n10\n\nSample Output 1\n\n2\n\nYou can have 14 black squares in the grid by performing the \"row\" operation twice, on different rows.\n\nSample Input 2\n\n14\n12\n112\n\nSample Output 2\n\n8\n\nSample Input 3\n\n2\n100\n200\n\nSample Output 3\n\n2", "sample_input": "3\n7\n10\n"}, "reference_outputs": ["2\n"], "source_document_id": "p02795", "source_text": "Score : 100 points\n\nProblem Statement\n\nWe have a grid with H rows and W columns, where all the squares are initially white.\n\nYou will perform some number of painting operations on the grid.\nIn one operation, you can do one of the following two actions:\n\nChoose one row, then paint all the squares in that row black.\n\nChoose one column, then paint all the squares in that column black.\n\nAt least how many operations do you need in order to have N or more black squares in the grid?\nIt is guaranteed that, under the conditions in Constraints, having N or more black squares is always possible by performing some number of operations.\n\nConstraints\n\n1 \\leq H \\leq 100\n\n1 \\leq W \\leq 100\n\n1 \\leq N \\leq H \\times W\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH\nW\nN\n\nOutput\n\nPrint the minimum number of operations needed.\n\nSample Input 1\n\n3\n7\n10\n\nSample Output 1\n\n2\n\nYou can have 14 black squares in the grid by performing the \"row\" operation twice, on different rows.\n\nSample Input 2\n\n14\n12\n112\n\nSample Output 2\n\n8\n\nSample Input 3\n\n2\n100\n200\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": 5317, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s782824643", "group_id": "codeNet:p02797", "input_text": "#include<stdio.h>\nint main()\n{\n\tlong long m=1e9;\n\tint n,k,s;\n\tscanf(\"%d%d%d\",&n,&k,&s);\n\tfor(int i=0;i<n;i++)\n\t{\n\t\tif(i<k)\n\t\t{\n\t\t\tif(i==0)\n\t\t\tprintf(\"%d\",s);\n\t\t\telse \n\t\t\tprintf(\" %d\",s);\n\t\t}\n\t\telse \n\t\t{\n\t\t\tif(s==m-1)\n\t\t\tprintf(\" %d\",m);\n\t\t\telse \n\t\t\tprintf(\" %d\",m-1);\n\t\t}\t\t\n\t}\n\tprintf(\"\\n\");\n\treturn 0;\n} ", "language": "C", "metadata": {"date": 1586031463, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "problem_description_relpath": "problem_descriptions/p02797.html", "problem_id": "p02797", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02797/input.txt", "sample_output_relpath": "derived/input_output/data/p02797/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02797/C/s782824643.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s782824643", "user_id": "u353919145"}, "prompt_components": {"gold_output": "1 2 3 4\n", "input_to_evaluate": "#include<stdio.h>\nint main()\n{\n\tlong long m=1e9;\n\tint n,k,s;\n\tscanf(\"%d%d%d\",&n,&k,&s);\n\tfor(int i=0;i<n;i++)\n\t{\n\t\tif(i<k)\n\t\t{\n\t\t\tif(i==0)\n\t\t\tprintf(\"%d\",s);\n\t\t\telse \n\t\t\tprintf(\" %d\",s);\n\t\t}\n\t\telse \n\t\t{\n\t\t\tif(s==m-1)\n\t\t\tprintf(\" %d\",m);\n\t\t\telse \n\t\t\tprintf(\" %d\",m-1);\n\t\t}\t\t\n\t}\n\tprintf(\"\\n\");\n\treturn 0;\n} ", "problem_context": "Score : 400 points\n\nProblem Statement\n\nGiven are three integers N, K, and S.\n\nFind a sequence A_1, A_2, ..., A_N of N integers between 1 and 10^9 (inclusive) that satisfies the condition below.\nWe can prove that, under the conditions in Constraints, such a sequence always exists.\n\nThere are exactly K pairs (l, r) of integers such that 1 \\leq l \\leq r \\leq N and A_l + A_{l + 1} + \\cdots + A_r = S.\n\nConstraints\n\n1 \\leq N \\leq 10^5\n\n0 \\leq K \\leq N\n\n1 \\leq S \\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 S\n\nOutput\n\nPrint a sequence satisfying the condition, in the following format:\n\nA_1 A_2 ... A_N\n\nSample Input 1\n\n4 2 3\n\nSample Output 1\n\n1 2 3 4\n\nTwo pairs (l, r) = (1, 2) and (3, 3) satisfy the condition in the statement.\n\nSample Input 2\n\n5 3 100\n\nSample Output 2\n\n50 50 50 30 70", "sample_input": "4 2 3\n"}, "reference_outputs": ["1 2 3 4\n"], "source_document_id": "p02797", "source_text": "Score : 400 points\n\nProblem Statement\n\nGiven are three integers N, K, and S.\n\nFind a sequence A_1, A_2, ..., A_N of N integers between 1 and 10^9 (inclusive) that satisfies the condition below.\nWe can prove that, under the conditions in Constraints, such a sequence always exists.\n\nThere are exactly K pairs (l, r) of integers such that 1 \\leq l \\leq r \\leq N and A_l + A_{l + 1} + \\cdots + A_r = S.\n\nConstraints\n\n1 \\leq N \\leq 10^5\n\n0 \\leq K \\leq N\n\n1 \\leq S \\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 S\n\nOutput\n\nPrint a sequence satisfying the condition, in the following format:\n\nA_1 A_2 ... A_N\n\nSample Input 1\n\n4 2 3\n\nSample Output 1\n\n1 2 3 4\n\nTwo pairs (l, r) = (1, 2) and (3, 3) satisfy the condition in the statement.\n\nSample Input 2\n\n5 3 100\n\nSample Output 2\n\n50 50 50 30 70", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 10, "memory_kb": 1280}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s681969083", "group_id": "codeNet:p02801", "input_text": "#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    char a;\n    scanf(\"%c\",&a);\n    if(a!='z')\n        printf(\"%c\\n\",a+1);\n    else\n        printf(\"%c\\n\",a);\n    return 0;\n}\n", "language": "C", "metadata": {"date": 1578859681, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "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/C/s681969083.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s681969083", "user_id": "u327472682"}, "prompt_components": {"gold_output": "b\n", "input_to_evaluate": "#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    char a;\n    scanf(\"%c\",&a);\n    if(a!='z')\n        printf(\"%c\\n\",a+1);\n    else\n        printf(\"%c\\n\",a);\n    return 0;\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": 179, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s111789055", "group_id": "codeNet:p02802", "input_text": "#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\n#include <string.h>\n\n#define ll long long\n\nvoid swap (int *x, int *y) {\n  int temp;\n\n  temp = *x;\n  *x = *y;\n  *y = temp;\n\n  return;\n}\n\n\nint gcd(int a, int b){\n  int c;\n\n  while (b > 0){\n    c = a % b;\n    a = b;\n    b = c;\n  }\n\n  return a;\n}\n\nint upll(const void*a, const void*b){\n  return*(ll*)a<*(ll*)b?-1:*(ll*)a>*(ll*)b?1:0;\n}\n\nint downll(const void*a, const void*b){\n  return*(ll*)a<*(ll*)b?1:*(ll*)a>*(ll*)b?-1:0;\n}\n\nvoid sortup(ll*a,int n){\n  qsort(a,n,sizeof(ll),upll);\n}\n\nvoid sortdown(ll*a,int n){\n  qsort(a,n,sizeof(ll),downll);\n}\n\nlong int modpow(long int a,long int n,long int mod){\n  long int ans=1;\n  while(n>0){\n    if(n & 1){\n      ans=ans*a%mod;\n    }\n    a=a*a%mod;\n    n/=2;\n  }\n  return ans;\n}\n\nlong int modinv(long int a,long int mod){\n  return modpow(a,mod-2,mod);\n}\n\nint max(int a,int b){\n  if(a<b){\n    return b;\n  }\n  else{\n    return a;\n  }\n}\n\nint min(int a,int b){\n  if(a<b){\n    return a;\n  }\n  else{\n    return b;\n  }\n}\n\nvoid chmax(int *a,int b){\n  if(*a < b){\n    *a = b;\n  }\n\n  return;\n}\n\nvoid chmin(int *a,int b){\n  if(*a > b){\n    *a =b;\n  }\n\n  return;\n}\n\n\n/****************************************\\\n| Thank you for viewing my code:)        |\n| Written by RedSpica a.k.a. RanseMirage |\n| Twitter:@asakaakasaka                  | \n\\****************************************/\n\nint main(void){\n  int n,m;\n  scanf(\"%d%d\",&n,&m);\n  int A[n];\n  int B[n];\n  for(int i=0;i<n;i++){\n    A[i]=0;\n    B[i]=0;\n  }\n\n  for(int i=0;i<m;i++){\n    int p;\n    scanf(\"%d\",&p);\n    p--;\n    char s[20];\n    scanf(\"%s\",s);\n\n    if(s[0]=='W'){\n      if(A[p]==0){\n        B[p]++;\n      }\n    }\n    else{\n      A[p]++;\n    }\n  }\n\n  int ac=0;\n  int pe=0;\n  for(int i=0;i<n;i++){\n    if(A[i]!=0){\n      ac++;\n      pe+=B[i];\n    }\n  }\n\n  printf(\"%d %d\\n\",ac,pe);\n  \n  return 0;\n}", "language": "C", "metadata": {"date": 1599962274, "filename_ext": "c", "original_language": "C (GCC 9.2.1)", "problem_description_relpath": "problem_descriptions/p02802.html", "problem_id": "p02802", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02802/input.txt", "sample_output_relpath": "derived/input_output/data/p02802/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02802/C/s111789055.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s111789055", "user_id": "u835924161"}, "prompt_components": {"gold_output": "2 2\n", "input_to_evaluate": "#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\n#include <string.h>\n\n#define ll long long\n\nvoid swap (int *x, int *y) {\n  int temp;\n\n  temp = *x;\n  *x = *y;\n  *y = temp;\n\n  return;\n}\n\n\nint gcd(int a, int b){\n  int c;\n\n  while (b > 0){\n    c = a % b;\n    a = b;\n    b = c;\n  }\n\n  return a;\n}\n\nint upll(const void*a, const void*b){\n  return*(ll*)a<*(ll*)b?-1:*(ll*)a>*(ll*)b?1:0;\n}\n\nint downll(const void*a, const void*b){\n  return*(ll*)a<*(ll*)b?1:*(ll*)a>*(ll*)b?-1:0;\n}\n\nvoid sortup(ll*a,int n){\n  qsort(a,n,sizeof(ll),upll);\n}\n\nvoid sortdown(ll*a,int n){\n  qsort(a,n,sizeof(ll),downll);\n}\n\nlong int modpow(long int a,long int n,long int mod){\n  long int ans=1;\n  while(n>0){\n    if(n & 1){\n      ans=ans*a%mod;\n    }\n    a=a*a%mod;\n    n/=2;\n  }\n  return ans;\n}\n\nlong int modinv(long int a,long int mod){\n  return modpow(a,mod-2,mod);\n}\n\nint max(int a,int b){\n  if(a<b){\n    return b;\n  }\n  else{\n    return a;\n  }\n}\n\nint min(int a,int b){\n  if(a<b){\n    return a;\n  }\n  else{\n    return b;\n  }\n}\n\nvoid chmax(int *a,int b){\n  if(*a < b){\n    *a = b;\n  }\n\n  return;\n}\n\nvoid chmin(int *a,int b){\n  if(*a > b){\n    *a =b;\n  }\n\n  return;\n}\n\n\n/****************************************\\\n| Thank you for viewing my code:)        |\n| Written by RedSpica a.k.a. RanseMirage |\n| Twitter:@asakaakasaka                  | \n\\****************************************/\n\nint main(void){\n  int n,m;\n  scanf(\"%d%d\",&n,&m);\n  int A[n];\n  int B[n];\n  for(int i=0;i<n;i++){\n    A[i]=0;\n    B[i]=0;\n  }\n\n  for(int i=0;i<m;i++){\n    int p;\n    scanf(\"%d\",&p);\n    p--;\n    char s[20];\n    scanf(\"%s\",s);\n\n    if(s[0]=='W'){\n      if(A[p]==0){\n        B[p]++;\n      }\n    }\n    else{\n      A[p]++;\n    }\n  }\n\n  int ac=0;\n  int pe=0;\n  for(int i=0;i<n;i++){\n    if(A[i]!=0){\n      ac++;\n      pe+=B[i];\n    }\n  }\n\n  printf(\"%d %d\\n\",ac,pe);\n  \n  return 0;\n}", "problem_context": "Score : 300 points\n\nProblem Statement\n\nTakahashi participated in a contest on AtCoder.\n\nThe contest had N problems.\n\nTakahashi made M submissions during the contest.\n\nThe i-th submission was made for the p_i-th problem and received the verdict S_i (AC or WA).\n\nThe number of Takahashi's correct answers is the number of problems on which he received an AC once or more.\n\nThe number of Takahashi's penalties is the sum of the following count for the problems on which he received an AC once or more: the number of WAs received before receiving an AC for the first time on that problem.\n\nFind the numbers of Takahashi's correct answers and penalties.\n\nConstraints\n\nN, M, and p_i are integers.\n\n1 \\leq N \\leq 10^5\n\n0 \\leq M \\leq 10^5\n\n1 \\leq p_i \\leq N\n\nS_i is AC or WA.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\np_1 S_1\n:\np_M S_M\n\nOutput\n\nPrint the number of Takahashi's correct answers and the number of Takahashi's penalties.\n\nSample Input 1\n\n2 5\n1 WA\n1 AC\n2 WA\n2 AC\n2 WA\n\nSample Output 1\n\n2 2\n\nIn his second submission, he received an AC on the first problem for the first time. Before this, he received one WA on this problem.\n\nIn his fourth submission, he received an AC on the second problem for the first time. Before this, he received one WA on this problem.\n\nThus, he has two correct answers and two penalties.\n\nSample Input 2\n\n100000 3\n7777 AC\n7777 AC\n7777 AC\n\nSample Output 2\n\n1 0\n\nNote that it is pointless to get an AC more than once on the same problem.\n\nSample Input 3\n\n6 0\n\nSample Output 3\n\n0 0", "sample_input": "2 5\n1 WA\n1 AC\n2 WA\n2 AC\n2 WA\n"}, "reference_outputs": ["2 2\n"], "source_document_id": "p02802", "source_text": "Score : 300 points\n\nProblem Statement\n\nTakahashi participated in a contest on AtCoder.\n\nThe contest had N problems.\n\nTakahashi made M submissions during the contest.\n\nThe i-th submission was made for the p_i-th problem and received the verdict S_i (AC or WA).\n\nThe number of Takahashi's correct answers is the number of problems on which he received an AC once or more.\n\nThe number of Takahashi's penalties is the sum of the following count for the problems on which he received an AC once or more: the number of WAs received before receiving an AC for the first time on that problem.\n\nFind the numbers of Takahashi's correct answers and penalties.\n\nConstraints\n\nN, M, and p_i are integers.\n\n1 \\leq N \\leq 10^5\n\n0 \\leq M \\leq 10^5\n\n1 \\leq p_i \\leq N\n\nS_i is AC or WA.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\np_1 S_1\n:\np_M S_M\n\nOutput\n\nPrint the number of Takahashi's correct answers and the number of Takahashi's penalties.\n\nSample Input 1\n\n2 5\n1 WA\n1 AC\n2 WA\n2 AC\n2 WA\n\nSample Output 1\n\n2 2\n\nIn his second submission, he received an AC on the first problem for the first time. Before this, he received one WA on this problem.\n\nIn his fourth submission, he received an AC on the second problem for the first time. Before this, he received one WA on this problem.\n\nThus, he has two correct answers and two penalties.\n\nSample Input 2\n\n100000 3\n7777 AC\n7777 AC\n7777 AC\n\nSample Output 2\n\n1 0\n\nNote that it is pointless to get an AC more than once on the same problem.\n\nSample Input 3\n\n6 0\n\nSample Output 3\n\n0 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": 1843, "cpu_time_ms": 30, "memory_kb": 2488}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s176311538", "group_id": "codeNet:p02802", "input_text": "#include<stdio.h>\n\nint main(){\n  int i,n,m,p,c[100005]={0},r;\n  char s[8];\n  scanf(\"%d%d\",&n,&m);\n  for(i=0;i<m;i++){\n    scanf(\"%d%s\",&p,s);\n    if(c[p]>0){continue;}\n    if(s[0]=='A'){\n      c[p]*=-1;\n      c[p]++;\n    }\n    else{\n      c[p]--;\n    }\n  }\n  r=0;p=0;\n  for(i=1;i<=n;i++){\n    if(c[i]>0){\n      p++;\n      r+=c[i];\n    }\n  }\n  printf(\"%d %d\\n\",p,r-p);\n  return 0;\n}\n", "language": "C", "metadata": {"date": 1578885284, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "problem_description_relpath": "problem_descriptions/p02802.html", "problem_id": "p02802", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02802/input.txt", "sample_output_relpath": "derived/input_output/data/p02802/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02802/C/s176311538.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s176311538", "user_id": "u721060623"}, "prompt_components": {"gold_output": "2 2\n", "input_to_evaluate": "#include<stdio.h>\n\nint main(){\n  int i,n,m,p,c[100005]={0},r;\n  char s[8];\n  scanf(\"%d%d\",&n,&m);\n  for(i=0;i<m;i++){\n    scanf(\"%d%s\",&p,s);\n    if(c[p]>0){continue;}\n    if(s[0]=='A'){\n      c[p]*=-1;\n      c[p]++;\n    }\n    else{\n      c[p]--;\n    }\n  }\n  r=0;p=0;\n  for(i=1;i<=n;i++){\n    if(c[i]>0){\n      p++;\n      r+=c[i];\n    }\n  }\n  printf(\"%d %d\\n\",p,r-p);\n  return 0;\n}\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nTakahashi participated in a contest on AtCoder.\n\nThe contest had N problems.\n\nTakahashi made M submissions during the contest.\n\nThe i-th submission was made for the p_i-th problem and received the verdict S_i (AC or WA).\n\nThe number of Takahashi's correct answers is the number of problems on which he received an AC once or more.\n\nThe number of Takahashi's penalties is the sum of the following count for the problems on which he received an AC once or more: the number of WAs received before receiving an AC for the first time on that problem.\n\nFind the numbers of Takahashi's correct answers and penalties.\n\nConstraints\n\nN, M, and p_i are integers.\n\n1 \\leq N \\leq 10^5\n\n0 \\leq M \\leq 10^5\n\n1 \\leq p_i \\leq N\n\nS_i is AC or WA.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\np_1 S_1\n:\np_M S_M\n\nOutput\n\nPrint the number of Takahashi's correct answers and the number of Takahashi's penalties.\n\nSample Input 1\n\n2 5\n1 WA\n1 AC\n2 WA\n2 AC\n2 WA\n\nSample Output 1\n\n2 2\n\nIn his second submission, he received an AC on the first problem for the first time. Before this, he received one WA on this problem.\n\nIn his fourth submission, he received an AC on the second problem for the first time. Before this, he received one WA on this problem.\n\nThus, he has two correct answers and two penalties.\n\nSample Input 2\n\n100000 3\n7777 AC\n7777 AC\n7777 AC\n\nSample Output 2\n\n1 0\n\nNote that it is pointless to get an AC more than once on the same problem.\n\nSample Input 3\n\n6 0\n\nSample Output 3\n\n0 0", "sample_input": "2 5\n1 WA\n1 AC\n2 WA\n2 AC\n2 WA\n"}, "reference_outputs": ["2 2\n"], "source_document_id": "p02802", "source_text": "Score : 300 points\n\nProblem Statement\n\nTakahashi participated in a contest on AtCoder.\n\nThe contest had N problems.\n\nTakahashi made M submissions during the contest.\n\nThe i-th submission was made for the p_i-th problem and received the verdict S_i (AC or WA).\n\nThe number of Takahashi's correct answers is the number of problems on which he received an AC once or more.\n\nThe number of Takahashi's penalties is the sum of the following count for the problems on which he received an AC once or more: the number of WAs received before receiving an AC for the first time on that problem.\n\nFind the numbers of Takahashi's correct answers and penalties.\n\nConstraints\n\nN, M, and p_i are integers.\n\n1 \\leq N \\leq 10^5\n\n0 \\leq M \\leq 10^5\n\n1 \\leq p_i \\leq N\n\nS_i is AC or WA.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\np_1 S_1\n:\np_M S_M\n\nOutput\n\nPrint the number of Takahashi's correct answers and the number of Takahashi's penalties.\n\nSample Input 1\n\n2 5\n1 WA\n1 AC\n2 WA\n2 AC\n2 WA\n\nSample Output 1\n\n2 2\n\nIn his second submission, he received an AC on the first problem for the first time. Before this, he received one WA on this problem.\n\nIn his fourth submission, he received an AC on the second problem for the first time. Before this, he received one WA on this problem.\n\nThus, he has two correct answers and two penalties.\n\nSample Input 2\n\n100000 3\n7777 AC\n7777 AC\n7777 AC\n\nSample Output 2\n\n1 0\n\nNote that it is pointless to get an AC more than once on the same problem.\n\nSample Input 3\n\n6 0\n\nSample Output 3\n\n0 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": 382, "cpu_time_ms": 16, "memory_kb": 512}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s253793448", "group_id": "codeNet:p02806", "input_text": "#include<stdio.h>\n#include<stdlib.h>\n#include<string.h>\n#include<math.h>\nint main(){\n  int n;\n  scanf(\"%d\",&n);\n  char s[n][111], t[111];\n  int u[n], nyaa = 0;\n  for(int i=0;i<n;i++){\n    scanf(\"%s%d\",s[i], &u[i]);\n    nyaa += u[i];\n  }\n  scanf(\"%s\",t);\n  for(int i=0;i<n;i++){\n    nyaa -= u[i];\n    if(!strcmp(s[i], t))break;\n  }\n  printf(\"%d\\n\",nyaa);\n  return 0;\n}", "language": "C", "metadata": {"date": 1578948961, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "problem_description_relpath": "problem_descriptions/p02806.html", "problem_id": "p02806", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02806/input.txt", "sample_output_relpath": "derived/input_output/data/p02806/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02806/C/s253793448.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s253793448", "user_id": "u244203620"}, "prompt_components": {"gold_output": "30\n", "input_to_evaluate": "#include<stdio.h>\n#include<stdlib.h>\n#include<string.h>\n#include<math.h>\nint main(){\n  int n;\n  scanf(\"%d\",&n);\n  char s[n][111], t[111];\n  int u[n], nyaa = 0;\n  for(int i=0;i<n;i++){\n    scanf(\"%s%d\",s[i], &u[i]);\n    nyaa += u[i];\n  }\n  scanf(\"%s\",t);\n  for(int i=0;i<n;i++){\n    nyaa -= u[i];\n    if(!strcmp(s[i], t))break;\n  }\n  printf(\"%d\\n\",nyaa);\n  return 0;\n}", "problem_context": "Score : 200 points\n\nProblem Statement\n\nNiwango created a playlist of N songs.\nThe title and the duration of the i-th song are s_i and t_i seconds, respectively.\nIt is guaranteed that s_1,\\ldots,s_N are all distinct.\n\nNiwango was doing some work while playing this playlist. (That is, all the songs were played once, in the order they appear in the playlist, without any pause in between.)\nHowever, he fell asleep during his work, and he woke up after all the songs were played.\nAccording to his record, it turned out that he fell asleep at the very end of the song titled X.\n\nFind the duration of time when some song was played while Niwango was asleep.\n\nConstraints\n\n1 \\leq N \\leq 50\n\ns_i and X are strings of length between 1 and 100 (inclusive) consisting of lowercase English letters.\n\ns_1,\\ldots,s_N are distinct.\n\nThere exists an integer i such that s_i = X.\n\n1 \\leq t_i \\leq 1000\n\nt_i is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\ns_1 t_1\n\\vdots\ns_{N} t_N\nX\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n3\ndwango 2\nsixth 5\nprelims 25\ndwango\n\nSample Output 1\n\n30\n\nWhile Niwango was asleep, two songs were played: sixth and prelims.\n\nThe answer is the total duration of these songs, 30.\n\nSample Input 2\n\n1\nabcde 1000\nabcde\n\nSample Output 2\n\n0\n\nNo songs were played while Niwango was asleep.\n\nIn such a case, the total duration of songs is 0.\n\nSample Input 3\n\n15\nypnxn 279\nkgjgwx 464\nqquhuwq 327\nrxing 549\npmuduhznoaqu 832\ndagktgdarveusju 595\nwunfagppcoi 200\ndhavrncwfw 720\njpcmigg 658\nwrczqxycivdqn 639\nmcmkkbnjfeod 992\nhtqvkgkbhtytsz 130\ntwflegsjz 467\ndswxxrxuzzfhkp 989\nszfwtzfpnscgue 958\npmuduhznoaqu\n\nSample Output 3\n\n6348", "sample_input": "3\ndwango 2\nsixth 5\nprelims 25\ndwango\n"}, "reference_outputs": ["30\n"], "source_document_id": "p02806", "source_text": "Score : 200 points\n\nProblem Statement\n\nNiwango created a playlist of N songs.\nThe title and the duration of the i-th song are s_i and t_i seconds, respectively.\nIt is guaranteed that s_1,\\ldots,s_N are all distinct.\n\nNiwango was doing some work while playing this playlist. (That is, all the songs were played once, in the order they appear in the playlist, without any pause in between.)\nHowever, he fell asleep during his work, and he woke up after all the songs were played.\nAccording to his record, it turned out that he fell asleep at the very end of the song titled X.\n\nFind the duration of time when some song was played while Niwango was asleep.\n\nConstraints\n\n1 \\leq N \\leq 50\n\ns_i and X are strings of length between 1 and 100 (inclusive) consisting of lowercase English letters.\n\ns_1,\\ldots,s_N are distinct.\n\nThere exists an integer i such that s_i = X.\n\n1 \\leq t_i \\leq 1000\n\nt_i is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\ns_1 t_1\n\\vdots\ns_{N} t_N\nX\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n3\ndwango 2\nsixth 5\nprelims 25\ndwango\n\nSample Output 1\n\n30\n\nWhile Niwango was asleep, two songs were played: sixth and prelims.\n\nThe answer is the total duration of these songs, 30.\n\nSample Input 2\n\n1\nabcde 1000\nabcde\n\nSample Output 2\n\n0\n\nNo songs were played while Niwango was asleep.\n\nIn such a case, the total duration of songs is 0.\n\nSample Input 3\n\n15\nypnxn 279\nkgjgwx 464\nqquhuwq 327\nrxing 549\npmuduhznoaqu 832\ndagktgdarveusju 595\nwunfagppcoi 200\ndhavrncwfw 720\njpcmigg 658\nwrczqxycivdqn 639\nmcmkkbnjfeod 992\nhtqvkgkbhtytsz 130\ntwflegsjz 467\ndswxxrxuzzfhkp 989\nszfwtzfpnscgue 958\npmuduhznoaqu\n\nSample Output 3\n\n6348", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 367, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s067830330", "group_id": "codeNet:p02806", "input_text": "#include<stdio.h>\n\nint main(){\n\tchar string[50][101],X[101];\n\tint time[50];\n\tint N,i,c=0;;\n\tint sleep=0;\n\tscanf(\"%d\",&N);\n\tfor(i=0;i<N;i++)scanf(\"%s %d\",string[i],&time[i]);\n\tscanf(\"%s\",&X[0]);\n\tfor(i=0;i<N;i++){\n\t\tif(c==1)sleep+=time[i];\n\t\tif(strcmp(string[i],X)==0)c=1;\n\t}\n\tprintf(\"%d\\n\",sleep);\n\treturn 0;\n}", "language": "C", "metadata": {"date": 1578792100, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "problem_description_relpath": "problem_descriptions/p02806.html", "problem_id": "p02806", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02806/input.txt", "sample_output_relpath": "derived/input_output/data/p02806/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02806/C/s067830330.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s067830330", "user_id": "u325279090"}, "prompt_components": {"gold_output": "30\n", "input_to_evaluate": "#include<stdio.h>\n\nint main(){\n\tchar string[50][101],X[101];\n\tint time[50];\n\tint N,i,c=0;;\n\tint sleep=0;\n\tscanf(\"%d\",&N);\n\tfor(i=0;i<N;i++)scanf(\"%s %d\",string[i],&time[i]);\n\tscanf(\"%s\",&X[0]);\n\tfor(i=0;i<N;i++){\n\t\tif(c==1)sleep+=time[i];\n\t\tif(strcmp(string[i],X)==0)c=1;\n\t}\n\tprintf(\"%d\\n\",sleep);\n\treturn 0;\n}", "problem_context": "Score : 200 points\n\nProblem Statement\n\nNiwango created a playlist of N songs.\nThe title and the duration of the i-th song are s_i and t_i seconds, respectively.\nIt is guaranteed that s_1,\\ldots,s_N are all distinct.\n\nNiwango was doing some work while playing this playlist. (That is, all the songs were played once, in the order they appear in the playlist, without any pause in between.)\nHowever, he fell asleep during his work, and he woke up after all the songs were played.\nAccording to his record, it turned out that he fell asleep at the very end of the song titled X.\n\nFind the duration of time when some song was played while Niwango was asleep.\n\nConstraints\n\n1 \\leq N \\leq 50\n\ns_i and X are strings of length between 1 and 100 (inclusive) consisting of lowercase English letters.\n\ns_1,\\ldots,s_N are distinct.\n\nThere exists an integer i such that s_i = X.\n\n1 \\leq t_i \\leq 1000\n\nt_i is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\ns_1 t_1\n\\vdots\ns_{N} t_N\nX\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n3\ndwango 2\nsixth 5\nprelims 25\ndwango\n\nSample Output 1\n\n30\n\nWhile Niwango was asleep, two songs were played: sixth and prelims.\n\nThe answer is the total duration of these songs, 30.\n\nSample Input 2\n\n1\nabcde 1000\nabcde\n\nSample Output 2\n\n0\n\nNo songs were played while Niwango was asleep.\n\nIn such a case, the total duration of songs is 0.\n\nSample Input 3\n\n15\nypnxn 279\nkgjgwx 464\nqquhuwq 327\nrxing 549\npmuduhznoaqu 832\ndagktgdarveusju 595\nwunfagppcoi 200\ndhavrncwfw 720\njpcmigg 658\nwrczqxycivdqn 639\nmcmkkbnjfeod 992\nhtqvkgkbhtytsz 130\ntwflegsjz 467\ndswxxrxuzzfhkp 989\nszfwtzfpnscgue 958\npmuduhznoaqu\n\nSample Output 3\n\n6348", "sample_input": "3\ndwango 2\nsixth 5\nprelims 25\ndwango\n"}, "reference_outputs": ["30\n"], "source_document_id": "p02806", "source_text": "Score : 200 points\n\nProblem Statement\n\nNiwango created a playlist of N songs.\nThe title and the duration of the i-th song are s_i and t_i seconds, respectively.\nIt is guaranteed that s_1,\\ldots,s_N are all distinct.\n\nNiwango was doing some work while playing this playlist. (That is, all the songs were played once, in the order they appear in the playlist, without any pause in between.)\nHowever, he fell asleep during his work, and he woke up after all the songs were played.\nAccording to his record, it turned out that he fell asleep at the very end of the song titled X.\n\nFind the duration of time when some song was played while Niwango was asleep.\n\nConstraints\n\n1 \\leq N \\leq 50\n\ns_i and X are strings of length between 1 and 100 (inclusive) consisting of lowercase English letters.\n\ns_1,\\ldots,s_N are distinct.\n\nThere exists an integer i such that s_i = X.\n\n1 \\leq t_i \\leq 1000\n\nt_i is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\ns_1 t_1\n\\vdots\ns_{N} t_N\nX\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n3\ndwango 2\nsixth 5\nprelims 25\ndwango\n\nSample Output 1\n\n30\n\nWhile Niwango was asleep, two songs were played: sixth and prelims.\n\nThe answer is the total duration of these songs, 30.\n\nSample Input 2\n\n1\nabcde 1000\nabcde\n\nSample Output 2\n\n0\n\nNo songs were played while Niwango was asleep.\n\nIn such a case, the total duration of songs is 0.\n\nSample Input 3\n\n15\nypnxn 279\nkgjgwx 464\nqquhuwq 327\nrxing 549\npmuduhznoaqu 832\ndagktgdarveusju 595\nwunfagppcoi 200\ndhavrncwfw 720\njpcmigg 658\nwrczqxycivdqn 639\nmcmkkbnjfeod 992\nhtqvkgkbhtytsz 130\ntwflegsjz 467\ndswxxrxuzzfhkp 989\nszfwtzfpnscgue 958\npmuduhznoaqu\n\nSample Output 3\n\n6348", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s242110707", "group_id": "codeNet:p02812", "input_text": "#include<stdio.h>\n#include<stdlib.h>\n\n#define max(a,b) ((a)>(b))?(a):(b);\n#define min(a,b) ((a)>(b))?(b):(a);\n\nint main(void)\n{\n\tint cnt=0, nc=0, n;\n\tscanf(\"%d\\n\", &n);\n\tchar s[51];\n\tchar* sp = s;\n\tscanf(\"%s\", sp);\n\n\twhile (*sp)\n\t{\n\t\tif (nc+'A'==*sp)\n\t\t{\n\t\t\tnc++;\n\t\t\tif (nc + 'A' == 'C' + 1)\n\t\t\t{\n\t\t\t\tnc = 0;\n\t\t\t\tcnt++;\n\t\t\t}\n\t\t}\n\t\telse\n\t\t{\n\t\t\tnc = 0;\n\t\t}\n\t\tsp++;\n\t}\n\n\tprintf(\"%d\", cnt);\n}", "language": "C", "metadata": {"date": 1586443688, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "problem_description_relpath": "problem_descriptions/p02812.html", "problem_id": "p02812", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02812/input.txt", "sample_output_relpath": "derived/input_output/data/p02812/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02812/C/s242110707.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s242110707", "user_id": "u575926077"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "#include<stdio.h>\n#include<stdlib.h>\n\n#define max(a,b) ((a)>(b))?(a):(b);\n#define min(a,b) ((a)>(b))?(b):(a);\n\nint main(void)\n{\n\tint cnt=0, nc=0, n;\n\tscanf(\"%d\\n\", &n);\n\tchar s[51];\n\tchar* sp = s;\n\tscanf(\"%s\", sp);\n\n\twhile (*sp)\n\t{\n\t\tif (nc+'A'==*sp)\n\t\t{\n\t\t\tnc++;\n\t\t\tif (nc + 'A' == 'C' + 1)\n\t\t\t{\n\t\t\t\tnc = 0;\n\t\t\t\tcnt++;\n\t\t\t}\n\t\t}\n\t\telse\n\t\t{\n\t\t\tnc = 0;\n\t\t}\n\t\tsp++;\n\t}\n\n\tprintf(\"%d\", cnt);\n}", "problem_context": "Score : 200 points\n\nProblem Statement\n\nWe have a string S of length N consisting of uppercase English letters.\n\nHow many times does ABC occur in S as contiguous subsequences (see Sample Inputs and Outputs)?\n\nConstraints\n\n3 \\leq N \\leq 50\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 number of occurrences of ABC in S as contiguous subsequences.\n\nSample Input 1\n\n10\nZABCDBABCQ\n\nSample Output 1\n\n2\n\nTwo contiguous subsequences of S are equal to ABC: the 2-nd through 4-th characters, and the 7-th through 9-th characters.\n\nSample Input 2\n\n19\nTHREEONEFOURONEFIVE\n\nSample Output 2\n\n0\n\nNo contiguous subsequences of S are equal to ABC.\n\nSample Input 3\n\n33\nABCCABCBABCCABACBCBBABCBCBCBCABCB\n\nSample Output 3\n\n5", "sample_input": "10\nZABCDBABCQ\n"}, "reference_outputs": ["2\n"], "source_document_id": "p02812", "source_text": "Score : 200 points\n\nProblem Statement\n\nWe have a string S of length N consisting of uppercase English letters.\n\nHow many times does ABC occur in S as contiguous subsequences (see Sample Inputs and Outputs)?\n\nConstraints\n\n3 \\leq N \\leq 50\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 number of occurrences of ABC in S as contiguous subsequences.\n\nSample Input 1\n\n10\nZABCDBABCQ\n\nSample Output 1\n\n2\n\nTwo contiguous subsequences of S are equal to ABC: the 2-nd through 4-th characters, and the 7-th through 9-th characters.\n\nSample Input 2\n\n19\nTHREEONEFOURONEFIVE\n\nSample Output 2\n\n0\n\nNo contiguous subsequences of S are equal to ABC.\n\nSample Input 3\n\n33\nABCCABCBABCCABACBCBBABCBCBCBCABCB\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": 388, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s208899855", "group_id": "codeNet:p02812", "input_text": "#include <stdio.h>\n\nint main(void)\n{\n\n    int i_characterCount;\n    int matchCount = 0;\n    scanf(\"%d\", &i_characterCount);\n\n    char c_inputString[i_characterCount];\n    scanf(\"%s\", c_inputString);\n\n    int index = 0;\n    while (index < i_characterCount)\n    {\n        if (c_inputString[index] == 65)\n        {\n            index++;\n            if (c_inputString[index] == 66)\n            {\n                index++;\n                if (c_inputString[index] == 67)\n                {\n                    matchCount++;\n                }\n            }\n        }\n        index++;\n    }\n\n    printf(\"%d\", matchCount);\n\n}", "language": "C", "metadata": {"date": 1585166928, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "problem_description_relpath": "problem_descriptions/p02812.html", "problem_id": "p02812", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02812/input.txt", "sample_output_relpath": "derived/input_output/data/p02812/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02812/C/s208899855.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s208899855", "user_id": "u119310692"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "#include <stdio.h>\n\nint main(void)\n{\n\n    int i_characterCount;\n    int matchCount = 0;\n    scanf(\"%d\", &i_characterCount);\n\n    char c_inputString[i_characterCount];\n    scanf(\"%s\", c_inputString);\n\n    int index = 0;\n    while (index < i_characterCount)\n    {\n        if (c_inputString[index] == 65)\n        {\n            index++;\n            if (c_inputString[index] == 66)\n            {\n                index++;\n                if (c_inputString[index] == 67)\n                {\n                    matchCount++;\n                }\n            }\n        }\n        index++;\n    }\n\n    printf(\"%d\", matchCount);\n\n}", "problem_context": "Score : 200 points\n\nProblem Statement\n\nWe have a string S of length N consisting of uppercase English letters.\n\nHow many times does ABC occur in S as contiguous subsequences (see Sample Inputs and Outputs)?\n\nConstraints\n\n3 \\leq N \\leq 50\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 number of occurrences of ABC in S as contiguous subsequences.\n\nSample Input 1\n\n10\nZABCDBABCQ\n\nSample Output 1\n\n2\n\nTwo contiguous subsequences of S are equal to ABC: the 2-nd through 4-th characters, and the 7-th through 9-th characters.\n\nSample Input 2\n\n19\nTHREEONEFOURONEFIVE\n\nSample Output 2\n\n0\n\nNo contiguous subsequences of S are equal to ABC.\n\nSample Input 3\n\n33\nABCCABCBABCCABACBCBBABCBCBCBCABCB\n\nSample Output 3\n\n5", "sample_input": "10\nZABCDBABCQ\n"}, "reference_outputs": ["2\n"], "source_document_id": "p02812", "source_text": "Score : 200 points\n\nProblem Statement\n\nWe have a string S of length N consisting of uppercase English letters.\n\nHow many times does ABC occur in S as contiguous subsequences (see Sample Inputs and Outputs)?\n\nConstraints\n\n3 \\leq N \\leq 50\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 number of occurrences of ABC in S as contiguous subsequences.\n\nSample Input 1\n\n10\nZABCDBABCQ\n\nSample Output 1\n\n2\n\nTwo contiguous subsequences of S are equal to ABC: the 2-nd through 4-th characters, and the 7-th through 9-th characters.\n\nSample Input 2\n\n19\nTHREEONEFOURONEFIVE\n\nSample Output 2\n\n0\n\nNo contiguous subsequences of S are equal to ABC.\n\nSample Input 3\n\n33\nABCCABCBABCCABACBCBBABCBCBCBCABCB\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": 614, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s147928324", "group_id": "codeNet:p02817", "input_text": "#include <stdio.h>\n\n\nint main()\n{\n\tchar A[20], B[20];\n\t\n\tscanf(\"%s %s\", A, B);\n\tprintf(\"%s%s\\n\", B, A);\n\n\treturn 0;\n}", "language": "C", "metadata": {"date": 1600327353, "filename_ext": "c", "original_language": "C (GCC 9.2.1)", "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/C/s147928324.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s147928324", "user_id": "u089230684"}, "prompt_components": {"gold_output": "atcoder\n", "input_to_evaluate": "#include <stdio.h>\n\n\nint main()\n{\n\tchar A[20], B[20];\n\t\n\tscanf(\"%s %s\", A, B);\n\tprintf(\"%s%s\\n\", B, A);\n\n\treturn 0;\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": 117, "cpu_time_ms": 105, "memory_kb": 1712}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s266030310", "group_id": "codeNet:p02817", "input_text": "#include <stdio.h>\n#include <string.h>\n\nint main(void)\n{\n    char S[100] = {};\n    char T[100] = {};\n    \n    scanf(\"%s\",S);\n    scanf(\"%s\",T);\n    \n    printf(\"%s \\n\",strcat(T,S));\n    return 0;\n}", "language": "C", "metadata": {"date": 1578447991, "filename_ext": "c", "original_language": "C (Clang 3.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/C/s266030310.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s266030310", "user_id": "u247887112"}, "prompt_components": {"gold_output": "atcoder\n", "input_to_evaluate": "#include <stdio.h>\n#include <string.h>\n\nint main(void)\n{\n    char S[100] = {};\n    char T[100] = {};\n    \n    scanf(\"%s\",S);\n    scanf(\"%s\",T);\n    \n    printf(\"%s \\n\",strcat(T,S));\n    return 0;\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": 197, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s757202222", "group_id": "codeNet:p02817", "input_text": "#include<stdio.h>\nint main()\n{\n    char b[105],a[105];\n    scanf(\"%s\",&b);\n    scanf(\"%s\",&a);\n    printf(\"%s%s\\n\",a,b);\n    return 0;\n}\n", "language": "C", "metadata": {"date": 1577667697, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "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/C/s757202222.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s757202222", "user_id": "u271369517"}, "prompt_components": {"gold_output": "atcoder\n", "input_to_evaluate": "#include<stdio.h>\nint main()\n{\n    char b[105],a[105];\n    scanf(\"%s\",&b);\n    scanf(\"%s\",&a);\n    printf(\"%s%s\\n\",a,b);\n    return 0;\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": 137, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s426205936", "group_id": "codeNet:p02818", "input_text": "#include <stdio.h>\n\nint main()\n{\n  long long a,b,k;\n\n  scanf(\"%lld%lld%lld\",&a,&b,&k);\n\n  if(k <= a)\n    {a = a-k;}\n  else if(k < a+b)\n    {\n      a = 0;\n      b = b-(k-a);\n    }\n  else\n    {\n      a =0;\n      b =0;\n    }\n\n  printf(\"%lld %lld\",a,b );\n\nreturn 0;\n}\n", "language": "C", "metadata": {"date": 1597690365, "filename_ext": "c", "original_language": "C (GCC 9.2.1)", "problem_description_relpath": "problem_descriptions/p02818.html", "problem_id": "p02818", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02818/input.txt", "sample_output_relpath": "derived/input_output/data/p02818/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02818/C/s426205936.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s426205936", "user_id": "u367958900"}, "prompt_components": {"gold_output": "0 2\n", "input_to_evaluate": "#include <stdio.h>\n\nint main()\n{\n  long long a,b,k;\n\n  scanf(\"%lld%lld%lld\",&a,&b,&k);\n\n  if(k <= a)\n    {a = a-k;}\n  else if(k < a+b)\n    {\n      a = 0;\n      b = b-(k-a);\n    }\n  else\n    {\n      a =0;\n      b =0;\n    }\n\n  printf(\"%lld %lld\",a,b );\n\nreturn 0;\n}\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nTakahashi has A cookies, and Aoki has B cookies.\nTakahashi will do the following action K times:\n\nIf Takahashi has one or more cookies, eat one of his cookies.\n\nOtherwise, if Aoki has one or more cookies, eat one of Aoki's cookies.\n\nIf they both have no cookies, do nothing.\n\nIn the end, how many cookies will Takahashi and Aoki have, respectively?\n\nConstraints\n\n0 \\leq A \\leq 10^{12}\n\n0 \\leq B \\leq 10^{12}\n\n0 \\leq K \\leq 10^{12}\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 the numbers of Takahashi's and Aoki's cookies after K actions.\n\nSample Input 1\n\n2 3 3\n\nSample Output 1\n\n0 2\n\nTakahashi will do the following:\n\nHe has two cookies, so he eats one of them.\n\nNow he has one cookie left, and he eats it.\n\nNow he has no cookies left, but Aoki has three, so Takahashi eats one of them.\n\nThus, in the end, Takahashi will have 0 cookies, and Aoki will have 2.\n\nSample Input 2\n\n500000000000 500000000000 1000000000000\n\nSample Output 2\n\n0 0\n\nWatch out for overflows.", "sample_input": "2 3 3\n"}, "reference_outputs": ["0 2\n"], "source_document_id": "p02818", "source_text": "Score : 200 points\n\nProblem Statement\n\nTakahashi has A cookies, and Aoki has B cookies.\nTakahashi will do the following action K times:\n\nIf Takahashi has one or more cookies, eat one of his cookies.\n\nOtherwise, if Aoki has one or more cookies, eat one of Aoki's cookies.\n\nIf they both have no cookies, do nothing.\n\nIn the end, how many cookies will Takahashi and Aoki have, respectively?\n\nConstraints\n\n0 \\leq A \\leq 10^{12}\n\n0 \\leq B \\leq 10^{12}\n\n0 \\leq K \\leq 10^{12}\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 the numbers of Takahashi's and Aoki's cookies after K actions.\n\nSample Input 1\n\n2 3 3\n\nSample Output 1\n\n0 2\n\nTakahashi will do the following:\n\nHe has two cookies, so he eats one of them.\n\nNow he has one cookie left, and he eats it.\n\nNow he has no cookies left, but Aoki has three, so Takahashi eats one of them.\n\nThus, in the end, Takahashi will have 0 cookies, and Aoki will have 2.\n\nSample Input 2\n\n500000000000 500000000000 1000000000000\n\nSample Output 2\n\n0 0\n\nWatch out for 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": 264, "cpu_time_ms": 6, "memory_kb": 1712}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s519968566", "group_id": "codeNet:p02818", "input_text": "#include<stdio.h>\n#include<stdlib.h>\n\nint main()\n{\n    long long int a,b,k,i;\n    scanf(\"%lld %lld %lld\",&a,&b,&k);\n    if(k<=a)\n    {\n        printf(\"%lld %lld\\n\",k-a,b);\n    }\n    else if(k>a && k<=a+b )\n    {\n        printf(\"0 %lld\\n\",a+b-k);\n    }\n    else if(k>a+b)\n    {\n        printf(\"0 0\\n\");\n    }\n}", "language": "C", "metadata": {"date": 1590344721, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "problem_description_relpath": "problem_descriptions/p02818.html", "problem_id": "p02818", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02818/input.txt", "sample_output_relpath": "derived/input_output/data/p02818/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02818/C/s519968566.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s519968566", "user_id": "u490514083"}, "prompt_components": {"gold_output": "0 2\n", "input_to_evaluate": "#include<stdio.h>\n#include<stdlib.h>\n\nint main()\n{\n    long long int a,b,k,i;\n    scanf(\"%lld %lld %lld\",&a,&b,&k);\n    if(k<=a)\n    {\n        printf(\"%lld %lld\\n\",k-a,b);\n    }\n    else if(k>a && k<=a+b )\n    {\n        printf(\"0 %lld\\n\",a+b-k);\n    }\n    else if(k>a+b)\n    {\n        printf(\"0 0\\n\");\n    }\n}", "problem_context": "Score : 200 points\n\nProblem Statement\n\nTakahashi has A cookies, and Aoki has B cookies.\nTakahashi will do the following action K times:\n\nIf Takahashi has one or more cookies, eat one of his cookies.\n\nOtherwise, if Aoki has one or more cookies, eat one of Aoki's cookies.\n\nIf they both have no cookies, do nothing.\n\nIn the end, how many cookies will Takahashi and Aoki have, respectively?\n\nConstraints\n\n0 \\leq A \\leq 10^{12}\n\n0 \\leq B \\leq 10^{12}\n\n0 \\leq K \\leq 10^{12}\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 the numbers of Takahashi's and Aoki's cookies after K actions.\n\nSample Input 1\n\n2 3 3\n\nSample Output 1\n\n0 2\n\nTakahashi will do the following:\n\nHe has two cookies, so he eats one of them.\n\nNow he has one cookie left, and he eats it.\n\nNow he has no cookies left, but Aoki has three, so Takahashi eats one of them.\n\nThus, in the end, Takahashi will have 0 cookies, and Aoki will have 2.\n\nSample Input 2\n\n500000000000 500000000000 1000000000000\n\nSample Output 2\n\n0 0\n\nWatch out for overflows.", "sample_input": "2 3 3\n"}, "reference_outputs": ["0 2\n"], "source_document_id": "p02818", "source_text": "Score : 200 points\n\nProblem Statement\n\nTakahashi has A cookies, and Aoki has B cookies.\nTakahashi will do the following action K times:\n\nIf Takahashi has one or more cookies, eat one of his cookies.\n\nOtherwise, if Aoki has one or more cookies, eat one of Aoki's cookies.\n\nIf they both have no cookies, do nothing.\n\nIn the end, how many cookies will Takahashi and Aoki have, respectively?\n\nConstraints\n\n0 \\leq A \\leq 10^{12}\n\n0 \\leq B \\leq 10^{12}\n\n0 \\leq K \\leq 10^{12}\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 the numbers of Takahashi's and Aoki's cookies after K actions.\n\nSample Input 1\n\n2 3 3\n\nSample Output 1\n\n0 2\n\nTakahashi will do the following:\n\nHe has two cookies, so he eats one of them.\n\nNow he has one cookie left, and he eats it.\n\nNow he has no cookies left, but Aoki has three, so Takahashi eats one of them.\n\nThus, in the end, Takahashi will have 0 cookies, and Aoki will have 2.\n\nSample Input 2\n\n500000000000 500000000000 1000000000000\n\nSample Output 2\n\n0 0\n\nWatch out for 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": 309, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s797663096", "group_id": "codeNet:p02818", "input_text": "#include <stdio.h>\n\nint main(void)\n{\n long A,B,K;\n scanf(\"%ld%ld%ld\",&A,&B,&K);\n\n  if(A>=K){\n    A=A-K;\n    printf(\"%ld \",A);\n    printf(\"%ld\",B);\n   }\n\n  else if (A+B>=K){\n           printf(\"0 \");\n           printf(\"%ld\\n\",B-(K-A));\n   }\n  else {\n       printf(\"0 \");\n       printf(\"0\\n\");\n  }\n  return 0;\n}", "language": "C", "metadata": {"date": 1587981168, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "problem_description_relpath": "problem_descriptions/p02818.html", "problem_id": "p02818", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02818/input.txt", "sample_output_relpath": "derived/input_output/data/p02818/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02818/C/s797663096.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s797663096", "user_id": "u714554973"}, "prompt_components": {"gold_output": "0 2\n", "input_to_evaluate": "#include <stdio.h>\n\nint main(void)\n{\n long A,B,K;\n scanf(\"%ld%ld%ld\",&A,&B,&K);\n\n  if(A>=K){\n    A=A-K;\n    printf(\"%ld \",A);\n    printf(\"%ld\",B);\n   }\n\n  else if (A+B>=K){\n           printf(\"0 \");\n           printf(\"%ld\\n\",B-(K-A));\n   }\n  else {\n       printf(\"0 \");\n       printf(\"0\\n\");\n  }\n  return 0;\n}", "problem_context": "Score : 200 points\n\nProblem Statement\n\nTakahashi has A cookies, and Aoki has B cookies.\nTakahashi will do the following action K times:\n\nIf Takahashi has one or more cookies, eat one of his cookies.\n\nOtherwise, if Aoki has one or more cookies, eat one of Aoki's cookies.\n\nIf they both have no cookies, do nothing.\n\nIn the end, how many cookies will Takahashi and Aoki have, respectively?\n\nConstraints\n\n0 \\leq A \\leq 10^{12}\n\n0 \\leq B \\leq 10^{12}\n\n0 \\leq K \\leq 10^{12}\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 the numbers of Takahashi's and Aoki's cookies after K actions.\n\nSample Input 1\n\n2 3 3\n\nSample Output 1\n\n0 2\n\nTakahashi will do the following:\n\nHe has two cookies, so he eats one of them.\n\nNow he has one cookie left, and he eats it.\n\nNow he has no cookies left, but Aoki has three, so Takahashi eats one of them.\n\nThus, in the end, Takahashi will have 0 cookies, and Aoki will have 2.\n\nSample Input 2\n\n500000000000 500000000000 1000000000000\n\nSample Output 2\n\n0 0\n\nWatch out for overflows.", "sample_input": "2 3 3\n"}, "reference_outputs": ["0 2\n"], "source_document_id": "p02818", "source_text": "Score : 200 points\n\nProblem Statement\n\nTakahashi has A cookies, and Aoki has B cookies.\nTakahashi will do the following action K times:\n\nIf Takahashi has one or more cookies, eat one of his cookies.\n\nOtherwise, if Aoki has one or more cookies, eat one of Aoki's cookies.\n\nIf they both have no cookies, do nothing.\n\nIn the end, how many cookies will Takahashi and Aoki have, respectively?\n\nConstraints\n\n0 \\leq A \\leq 10^{12}\n\n0 \\leq B \\leq 10^{12}\n\n0 \\leq K \\leq 10^{12}\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 the numbers of Takahashi's and Aoki's cookies after K actions.\n\nSample Input 1\n\n2 3 3\n\nSample Output 1\n\n0 2\n\nTakahashi will do the following:\n\nHe has two cookies, so he eats one of them.\n\nNow he has one cookie left, and he eats it.\n\nNow he has no cookies left, but Aoki has three, so Takahashi eats one of them.\n\nThus, in the end, Takahashi will have 0 cookies, and Aoki will have 2.\n\nSample Input 2\n\n500000000000 500000000000 1000000000000\n\nSample Output 2\n\n0 0\n\nWatch out for 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": 308, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s640331154", "group_id": "codeNet:p02818", "input_text": "#include <stdio.h>\n\nint main(void){\n\n long long int A, B, K;\n  scanf(\"%lld %lld %lld\",&A,&B,&K);\n  if(K<A){\n    printf(\"%lld %lld\",A-K,B);\n  }else if(K>A+B){\n    printf(\"0 0\");\n  }\n  else{\n    printf(\"0 %lld\",B-K+A);\n  }\n\n  return 0;\n}\n", "language": "C", "metadata": {"date": 1582648425, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "problem_description_relpath": "problem_descriptions/p02818.html", "problem_id": "p02818", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02818/input.txt", "sample_output_relpath": "derived/input_output/data/p02818/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02818/C/s640331154.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s640331154", "user_id": "u776439373"}, "prompt_components": {"gold_output": "0 2\n", "input_to_evaluate": "#include <stdio.h>\n\nint main(void){\n\n long long int A, B, K;\n  scanf(\"%lld %lld %lld\",&A,&B,&K);\n  if(K<A){\n    printf(\"%lld %lld\",A-K,B);\n  }else if(K>A+B){\n    printf(\"0 0\");\n  }\n  else{\n    printf(\"0 %lld\",B-K+A);\n  }\n\n  return 0;\n}\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nTakahashi has A cookies, and Aoki has B cookies.\nTakahashi will do the following action K times:\n\nIf Takahashi has one or more cookies, eat one of his cookies.\n\nOtherwise, if Aoki has one or more cookies, eat one of Aoki's cookies.\n\nIf they both have no cookies, do nothing.\n\nIn the end, how many cookies will Takahashi and Aoki have, respectively?\n\nConstraints\n\n0 \\leq A \\leq 10^{12}\n\n0 \\leq B \\leq 10^{12}\n\n0 \\leq K \\leq 10^{12}\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 the numbers of Takahashi's and Aoki's cookies after K actions.\n\nSample Input 1\n\n2 3 3\n\nSample Output 1\n\n0 2\n\nTakahashi will do the following:\n\nHe has two cookies, so he eats one of them.\n\nNow he has one cookie left, and he eats it.\n\nNow he has no cookies left, but Aoki has three, so Takahashi eats one of them.\n\nThus, in the end, Takahashi will have 0 cookies, and Aoki will have 2.\n\nSample Input 2\n\n500000000000 500000000000 1000000000000\n\nSample Output 2\n\n0 0\n\nWatch out for overflows.", "sample_input": "2 3 3\n"}, "reference_outputs": ["0 2\n"], "source_document_id": "p02818", "source_text": "Score : 200 points\n\nProblem Statement\n\nTakahashi has A cookies, and Aoki has B cookies.\nTakahashi will do the following action K times:\n\nIf Takahashi has one or more cookies, eat one of his cookies.\n\nOtherwise, if Aoki has one or more cookies, eat one of Aoki's cookies.\n\nIf they both have no cookies, do nothing.\n\nIn the end, how many cookies will Takahashi and Aoki have, respectively?\n\nConstraints\n\n0 \\leq A \\leq 10^{12}\n\n0 \\leq B \\leq 10^{12}\n\n0 \\leq K \\leq 10^{12}\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 the numbers of Takahashi's and Aoki's cookies after K actions.\n\nSample Input 1\n\n2 3 3\n\nSample Output 1\n\n0 2\n\nTakahashi will do the following:\n\nHe has two cookies, so he eats one of them.\n\nNow he has one cookie left, and he eats it.\n\nNow he has no cookies left, but Aoki has three, so Takahashi eats one of them.\n\nThus, in the end, Takahashi will have 0 cookies, and Aoki will have 2.\n\nSample Input 2\n\n500000000000 500000000000 1000000000000\n\nSample Output 2\n\n0 0\n\nWatch out for 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": 236, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s267109447", "group_id": "codeNet:p02818", "input_text": "#include <stdio.h>\n\nint main () {\n  int a,b,k;\n  scanf(\"%d%d%d\", &a,&b,&k);\n\n  if(k >= a+b)\n   printf(\"0 0\\n\");\n\n  if(k > a && k < a+b)\n   printf(\"0 %d\\n\", b-(k-a));\n\n  if(k <= a)\n   printf(\"%d %d\\n\", a-k, b);\n\n  return 0;\n}\n", "language": "C", "metadata": {"date": 1578312863, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "problem_description_relpath": "problem_descriptions/p02818.html", "problem_id": "p02818", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02818/input.txt", "sample_output_relpath": "derived/input_output/data/p02818/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02818/C/s267109447.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s267109447", "user_id": "u447305329"}, "prompt_components": {"gold_output": "0 2\n", "input_to_evaluate": "#include <stdio.h>\n\nint main () {\n  int a,b,k;\n  scanf(\"%d%d%d\", &a,&b,&k);\n\n  if(k >= a+b)\n   printf(\"0 0\\n\");\n\n  if(k > a && k < a+b)\n   printf(\"0 %d\\n\", b-(k-a));\n\n  if(k <= a)\n   printf(\"%d %d\\n\", a-k, b);\n\n  return 0;\n}\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nTakahashi has A cookies, and Aoki has B cookies.\nTakahashi will do the following action K times:\n\nIf Takahashi has one or more cookies, eat one of his cookies.\n\nOtherwise, if Aoki has one or more cookies, eat one of Aoki's cookies.\n\nIf they both have no cookies, do nothing.\n\nIn the end, how many cookies will Takahashi and Aoki have, respectively?\n\nConstraints\n\n0 \\leq A \\leq 10^{12}\n\n0 \\leq B \\leq 10^{12}\n\n0 \\leq K \\leq 10^{12}\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 the numbers of Takahashi's and Aoki's cookies after K actions.\n\nSample Input 1\n\n2 3 3\n\nSample Output 1\n\n0 2\n\nTakahashi will do the following:\n\nHe has two cookies, so he eats one of them.\n\nNow he has one cookie left, and he eats it.\n\nNow he has no cookies left, but Aoki has three, so Takahashi eats one of them.\n\nThus, in the end, Takahashi will have 0 cookies, and Aoki will have 2.\n\nSample Input 2\n\n500000000000 500000000000 1000000000000\n\nSample Output 2\n\n0 0\n\nWatch out for overflows.", "sample_input": "2 3 3\n"}, "reference_outputs": ["0 2\n"], "source_document_id": "p02818", "source_text": "Score : 200 points\n\nProblem Statement\n\nTakahashi has A cookies, and Aoki has B cookies.\nTakahashi will do the following action K times:\n\nIf Takahashi has one or more cookies, eat one of his cookies.\n\nOtherwise, if Aoki has one or more cookies, eat one of Aoki's cookies.\n\nIf they both have no cookies, do nothing.\n\nIn the end, how many cookies will Takahashi and Aoki have, respectively?\n\nConstraints\n\n0 \\leq A \\leq 10^{12}\n\n0 \\leq B \\leq 10^{12}\n\n0 \\leq K \\leq 10^{12}\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 the numbers of Takahashi's and Aoki's cookies after K actions.\n\nSample Input 1\n\n2 3 3\n\nSample Output 1\n\n0 2\n\nTakahashi will do the following:\n\nHe has two cookies, so he eats one of them.\n\nNow he has one cookie left, and he eats it.\n\nNow he has no cookies left, but Aoki has three, so Takahashi eats one of them.\n\nThus, in the end, Takahashi will have 0 cookies, and Aoki will have 2.\n\nSample Input 2\n\n500000000000 500000000000 1000000000000\n\nSample Output 2\n\n0 0\n\nWatch out for 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": 225, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s984348144", "group_id": "codeNet:p02819", "input_text": "#include<stdio.h>\nint main(){\n  unsigned long int x,i,max=0,j;\n  \n  scanf(\"%ld\",&x);\n  i=x;\n  if(x=0){\n    max=0;\n  }\n  if(x=1){\n    max=1;\n  }\n  if(x=2){\n    max=2;\n  }\n  while(max==0){\n    for(j=2;j<((i/2)+1);j++){ \n    if(i%j==0){\n      i++;\n      break;\n    }\n      else{\n        if(j==(i/2)){\n        max=i;\n          \n          \n        }\n         \n      }\n    }\n      \n  }\n\n    printf(\"%ld\",max);\n\n}", "language": "C", "metadata": {"date": 1578872155, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "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/C/s984348144.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s984348144", "user_id": "u815247632"}, "prompt_components": {"gold_output": "23\n", "input_to_evaluate": "#include<stdio.h>\nint main(){\n  unsigned long int x,i,max=0,j;\n  \n  scanf(\"%ld\",&x);\n  i=x;\n  if(x=0){\n    max=0;\n  }\n  if(x=1){\n    max=1;\n  }\n  if(x=2){\n    max=2;\n  }\n  while(max==0){\n    for(j=2;j<((i/2)+1);j++){ \n    if(i%j==0){\n      i++;\n      break;\n    }\n      else{\n        if(j==(i/2)){\n        max=i;\n          \n          \n        }\n         \n      }\n    }\n      \n  }\n\n    printf(\"%ld\",max);\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": 406, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s371298248", "group_id": "codeNet:p02820", "input_text": "#include<stdio.h>\n#include<string.h>\n#include<math.h>\n\nint main(){\n   char str1[256];\n  char str2[256];\n  char strmax[256];\n unsigned long long int i,N,K,R,S,P;       //a=strの10進数\n  scanf(\"%lld %lld\",&N,&K);\n \n   scanf(\"%lld %lld %lld\",&R,&S,&P);\n   scanf(\"%s\",str1);\n\n\nunsigned long long int b,max=0,j,score=0,c=0,a=0;\n  int str3[256];     //N桁３進数の数列（０グー１チョキ２パー）\n  for(i=0;i<N;i++){\n    str3[i]=0;\n  }\n\n \n  \n  while(c<pow(3,N)){\n  c++;\n\t   a=c;\n    for(b=0;b<N;b++){\n       if(str3[b]==str3[b-K]){\n\t break;\n      }\n      if(a==0){\n\tstr3[b]=0;\n      }else\n      if(a%3==0){\n\tstr3[b]=0;\n\ta=a/3;\n      }else\n      if(a%3==1){\n\tstr3[b]=1;\n\ta=a/3;\n      }else\n      if(a%3==2){\n\tstr3[b]=2;\n\t  a=a/3;\n      }\n     \n    }\n    \n   \n\n     for(i=0;i<N;i++){\n    if(str1[i]=='r'){\n      if(str3[i]==2){\n      score=score+P;\n      }\n    } else if(str1[i]=='s'){\n\tif(str3[i]==0){\n\t  score=score+R;\n        \n\t}\n      }\n\telse if(str1[i]=='p'){\n\t  if(str3[i]==1){\n\t    score=score+S;\n\t   \n\t  }\n\t}\n  \n     }\n \n     if(max<score){\n       max=score;\n      \n     }\n     score=0;\n  next:;\n  }\n\n  printf(\"%lldでした\",max);\n  \n}\n", "language": "C", "metadata": {"date": 1578627199, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "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/C/s371298248.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s371298248", "user_id": "u815247632"}, "prompt_components": {"gold_output": "27\n", "input_to_evaluate": "#include<stdio.h>\n#include<string.h>\n#include<math.h>\n\nint main(){\n   char str1[256];\n  char str2[256];\n  char strmax[256];\n unsigned long long int i,N,K,R,S,P;       //a=strの10進数\n  scanf(\"%lld %lld\",&N,&K);\n \n   scanf(\"%lld %lld %lld\",&R,&S,&P);\n   scanf(\"%s\",str1);\n\n\nunsigned long long int b,max=0,j,score=0,c=0,a=0;\n  int str3[256];     //N桁３進数の数列（０グー１チョキ２パー）\n  for(i=0;i<N;i++){\n    str3[i]=0;\n  }\n\n \n  \n  while(c<pow(3,N)){\n  c++;\n\t   a=c;\n    for(b=0;b<N;b++){\n       if(str3[b]==str3[b-K]){\n\t break;\n      }\n      if(a==0){\n\tstr3[b]=0;\n      }else\n      if(a%3==0){\n\tstr3[b]=0;\n\ta=a/3;\n      }else\n      if(a%3==1){\n\tstr3[b]=1;\n\ta=a/3;\n      }else\n      if(a%3==2){\n\tstr3[b]=2;\n\t  a=a/3;\n      }\n     \n    }\n    \n   \n\n     for(i=0;i<N;i++){\n    if(str1[i]=='r'){\n      if(str3[i]==2){\n      score=score+P;\n      }\n    } else if(str1[i]=='s'){\n\tif(str3[i]==0){\n\t  score=score+R;\n        \n\t}\n      }\n\telse if(str1[i]=='p'){\n\t  if(str3[i]==1){\n\t    score=score+S;\n\t   \n\t  }\n\t}\n  \n     }\n \n     if(max<score){\n       max=score;\n      \n     }\n     score=0;\n  next:;\n  }\n\n  printf(\"%lldでした\",max);\n  \n}\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": 1154, "cpu_time_ms": 2103, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s404046057", "group_id": "codeNet:p02826", "input_text": "//set many funcs template\n//Ver.20190820\n#include<stdio.h>\n#include<string.h>\n#include<stdlib.h>\n#include<stdbool.h>\n#include<time.h>\n#include<assert.h>\n#define inf 1072114514\n#define llinf 4154118101919364364\n#define mod 1000000007\n#define pi 3.1415926535897932384\n#pragma GCC optimize(\"O3\")\n#pragma GCC optimize(\"unroll-loops\")\n#pragma GCC target (\"sse4\")\n\nint max(int a,int b){if(a>b){return a;}return b;}\nint min(int a,int b){if(a<b){return a;}return b;}\nint zt(int a,int b){return max(a,b)-min(a,b);}\nint round(int a,int b){if((a%b)*2 >= b){return (a/b)+1;}return a/b;}\nint ceil(int a,int b){if(a%b==0){return a/b;}return (a/b)+1;}\nint gcd(int a,int b){int c;while(b!=0){c=a%b;a=b;b=c;}return a;}\nint lcm(int a,int b){int c=gcd(a,b);a/=c;return a*b;}\nint nCr(int a,int b){int i,r=1;for(i=1;i<=b;i++){r*=(a+1-i);r/=i;}return r;}\nint nHr(int a,int b){return nCr(a+b-1,b);}\nint fact(int a){int i,r=1;for(i=1;i<=a;i++){r*=i;}return r;}\nint pow(int a,int b){int i,r=1;for(i=1;i<=b;i++){r*=a;}return r;}\nint dsum(int x){int r=0;while(x){r+=(x%10);x/=10;}return r;}\nint dsumb(int x,int b){int r=0;while(x){r+=(x%b);x/=b;}return r;}\nint sankaku(int x){return ((1+x)*x)/2;}\nvoid swap(int *a,int *b){int c;c=(*a);(*a)=(*b);(*b)=c;}\nlong long llmax(long long a,long long b){if(a>b){return a;}return b;}\nlong long llmin(long long a,long long b){if(a<b){return a;}return b;}\nlong long llzt(long long a,long long b){return llmax(a,b)-llmin(a,b);}\nlong long llround(long long a,long long b){if((a%b)*2 >= b){return (a/b)+1;}return a/b;}\nlong long llceil(long long a,long long b){if(a%b==0){return a/b;}return (a/b)+1;}\nlong long llgcd(long long a,long long b){long long c;while(b!=0){c=a%b;a=b;b=c;}return a;}\nlong long lllcm(long long a,long long b){long long c=llgcd(a,b);a/=c;return a*b;}\nlong long llnCr(long long a,long long b){long long i,r=1;for(i=1;i<=b;i++){r*=(a+1-i);r/=i;}return r;}\nlong long llnHr(long long a,long long b){return llnCr(a+b-1,b);}\nlong long llfact(long long a){long long i,r=1;for(i=1;i<=a;i++){r*=i;}return r;}\nlong long llpow(long long a,long long b){long long i,r=1;for(i=1;i<=b;i++){r*=a;}return r;}\nlong long lldsum(long long x){long long r=0;while(x){r+=(x%10);x/=10;}return r;}\nlong long lldsumb(long long x,long long b){long long r=0;while(x){r+=(x%b);x/=b;}return r;}\nlong long llsankaku(long long x){return ((1+x)*x)/2;}\nvoid llswap(long long *a,long long *b){long long c;c=(*a);(*a)=(*b);(*b)=c;}\ndouble dbmax(double a,double b){if(a>b){return a;}return b;}\ndouble dbmin(double a,double b){if(a<b){return a;}return b;}\ndouble dbzt(double a,double b){return dbmax(a,b)-dbmin(a,b);}\nvoid dbswap(double *a,double *b){double c;c=(*a);(*a)=(*b);(*b)=c;}\nvoid chswap(char *a,char *b){char c;c=(*a);(*a)=(*b);(*b)=c;}\nint sortfncsj(const void *a,const void *b){if(*(int *)a>*(int *)b){return 1;}if(*(int *)a==*(int *)b){return 0;}return -1;}\nint sortfnckj(const void *a,const void *b){if(*(int *)a<*(int *)b){return 1;}if(*(int *)a==*(int *)b){return 0;}return -1;}\nint llsortfncsj(const void *a,const void *b){if(*(long long *)a>*(long long *)b){return 1;}if(*(long long *)a==*(long long *)b){return 0;}return -1;}\nint llsortfnckj(const void *a,const void *b){if(*(long long *)a<*(long long *)b){return 1;}if(*(long long *)a==*(long long *)b){return 0;}return -1;}\nint dbsortfncsj(const void *a,const void *b){if(*(double *)a>*(double *)b){return 1;}if(*(double *)a==*(double *)b){return 0;}return -1;}\nint dbsortfnckj(const void *a,const void *b){if(*(double *)a<*(double *)b){return 1;}if(*(double *)a==*(double *)b){return 0;}return -1;}\nint strsortfncsj(const void *a,const void *b){return strcmp((char *)a,(char *)b);}\nint strsortfnckj(const void *a,const void *b){return strcmp((char *)b,(char *)a);}\nint chsortfncsj(const void *a,const void *b){if(*(char *)a>*(char *)b){return 1;}if(*(char *)a==*(char *)b){return 0;}return -1;}\nint chsortfnckj(const void *a,const void *b){if(*(char *)a<*(char *)b){return 1;}if(*(char *)a==*(char *)b){return 0;}return -1;}\n\nvoid shuffledget(int x[],int n){\n    int i,b[524288],p,c;\n    for(i=0;i<n;i++){\n        b[i]=i;\n    }\n    for(i=n;i>=1;i--){\n        p=rand()%i;\n        c=b[i-1];b[i-1]=b[p];b[p]=c;\n    }\n    for(i=0;i<n;i++){\n        scanf(\"%d\",&x[b[i]]);\n    }\n}\n\nint dx4[4]={1,-1,0,0};\nint dy4[4]={0,0,1,-1};\nint dx8[8]={-1,-1,-1,0,0,1,1,1};\nint dy8[8]={-1,0,1,-1,1,-1,0,1};\n\nint search(int x,int a[],int n){\n    int st=0,fi=n-1,te;\n    while(st<=fi){\n        te=(st+fi)/2;\n        if(a[te]<x){st=te+1;}else{fi=te-1;}\n    }\n    return st;\n}\n\nvoid prarr(int arr[],int n){\n  int i;\n  for(i=0;i<n;i++){\n    if(i){printf(\" \");}\n    printf(\"%d\",arr[i]);\n  }\n  printf(\"\\n\");\n  return;\n}\n\nvoid getperm(int a[],int n){\n  int i,p;\n  for(i=0;i<n;i++){\n    a[i]=i;\n  }\n  for(i=n-1;i>=1;i--){\n    p=rand()%(i+1);\n    swap(&a[p],&a[i]);\n  }\n}\n\ntypedef struct{\nint val;\nint node;\n}sd;\n\nint sdsortfnc(const void *a,const void *b){\nif(((sd*)a)->val < ((sd*)b)->val){return -1;}\nif(((sd*)a)->val > ((sd*)b)->val){return 1;}\nreturn 0;\n}\n\nvoid coordinate_comp(int a[],int n){\n  int i,c=0;\n  sd dat[524288];\n  for(i=0;i<n;i++){\n    dat[i].val=a[i];\n    dat[i].node=i;\n  }\n  qsort(dat,n,sizeof(dat[0]),sdsortfnc);\n  a[dat[0].node]=c;\n  for(i=1;i<n;i++){\n    if(dat[i-1].val!=dat[i].val){c++;}\n    a[dat[i].node]=c;\n  }\n}\n\nint main(void){\n  long long i,j,n,m,k,a,b,c,h,w,r=0,l,t,lim,os;\n  long long **dp=malloc(sizeof(long long*)*5555);\n  long long **ndp=malloc(sizeof(long long*)*5555);\n  long long **dx=malloc(sizeof(long long*)*5555);\n  for(i=0;i<5555;i++){\n    dp[i]=malloc(sizeof(long long)*5555);\n    ndp[i]=malloc(sizeof(long long)*5555);\n    dx[i]=malloc(sizeof(long long)*5555);\n    for(j=0;j<5555;j++){\n      dp[i][j]=0;\n      ndp[i][j]=0;\n      dx[i][j]=0;\n    }\n  }\n  long long kr,gr;\n  scanf(\"%lld%lld\",&n,&m);\n  for(i=1;i<=n;i++){\n    dp[n-i][i]=1;\n  }\n  //for(j=0;j<4;j++){\n  //  for(k=0;k<4;k++){\n  //    fprintf(stderr,\"[%lld]\",dp[j][k]);\n  //  }fprintf(stderr,\"\\n\");\n  //}fprintf(stderr,\"\\n\");\n  t=n/2;\n  lim=n;\n  for(i=1;i<=t;i++){\n    for(j=0;j<=lim;j++){\n      for(k=n;k>=0;k--){\n        a=j;b=k-j;os=0;\n        if(b<0){os=-b;a+=b;b=0;}\n        if(a>=0){\n          dx[a][b]+=dp[j][k];\n          ndp[a][b]+=os*dp[j][k];\n        }\n      }\n    }\n    lim=n/i;\n    kr=0;gr=0;\n    for(j=lim;j>=0;j--){\n      for(k=0;k<=n;k++){\n        dx[j][k]%=m;\n        ndp[j][k]+=dx[j][k];\n        ndp[j][k]%=m;\n        if(j!=0){\n          ndp[j-1][k+1]+=ndp[j][k];\n          dx[j-1][k+1]+=dx[j][k];\n        }\n        dp[j][k]=ndp[j][k];\n        if(i==t && k!=0){\n          kr+=dp[j][k];kr%=m;\n          if(j==0){gr+=dp[j][k];gr%=m;}\n        }\n        ndp[j][k]=0;\n        dx[j][k]=0;\n      }\n    }\n    //for(j=0;j<4;j++){\n    //  for(k=0;k<4;k++){\n    //    fprintf(stderr,\"[%lld]\",dp[j][k]);\n    //  }fprintf(stderr,\"\\n\");\n    //}fprintf(stderr,\"\\n\");\n  }\n  if(n%2==1){printf(\"%lld\\n\",kr);}\n  else{printf(\"%lld\\n\",gr);}\n  return 0;\n}\n", "language": "C", "metadata": {"date": 1577592906, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "problem_description_relpath": "problem_descriptions/p02826.html", "problem_id": "p02826", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02826/input.txt", "sample_output_relpath": "derived/input_output/data/p02826/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02826/C/s404046057.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s404046057", "user_id": "u721060623"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "//set many funcs template\n//Ver.20190820\n#include<stdio.h>\n#include<string.h>\n#include<stdlib.h>\n#include<stdbool.h>\n#include<time.h>\n#include<assert.h>\n#define inf 1072114514\n#define llinf 4154118101919364364\n#define mod 1000000007\n#define pi 3.1415926535897932384\n#pragma GCC optimize(\"O3\")\n#pragma GCC optimize(\"unroll-loops\")\n#pragma GCC target (\"sse4\")\n\nint max(int a,int b){if(a>b){return a;}return b;}\nint min(int a,int b){if(a<b){return a;}return b;}\nint zt(int a,int b){return max(a,b)-min(a,b);}\nint round(int a,int b){if((a%b)*2 >= b){return (a/b)+1;}return a/b;}\nint ceil(int a,int b){if(a%b==0){return a/b;}return (a/b)+1;}\nint gcd(int a,int b){int c;while(b!=0){c=a%b;a=b;b=c;}return a;}\nint lcm(int a,int b){int c=gcd(a,b);a/=c;return a*b;}\nint nCr(int a,int b){int i,r=1;for(i=1;i<=b;i++){r*=(a+1-i);r/=i;}return r;}\nint nHr(int a,int b){return nCr(a+b-1,b);}\nint fact(int a){int i,r=1;for(i=1;i<=a;i++){r*=i;}return r;}\nint pow(int a,int b){int i,r=1;for(i=1;i<=b;i++){r*=a;}return r;}\nint dsum(int x){int r=0;while(x){r+=(x%10);x/=10;}return r;}\nint dsumb(int x,int b){int r=0;while(x){r+=(x%b);x/=b;}return r;}\nint sankaku(int x){return ((1+x)*x)/2;}\nvoid swap(int *a,int *b){int c;c=(*a);(*a)=(*b);(*b)=c;}\nlong long llmax(long long a,long long b){if(a>b){return a;}return b;}\nlong long llmin(long long a,long long b){if(a<b){return a;}return b;}\nlong long llzt(long long a,long long b){return llmax(a,b)-llmin(a,b);}\nlong long llround(long long a,long long b){if((a%b)*2 >= b){return (a/b)+1;}return a/b;}\nlong long llceil(long long a,long long b){if(a%b==0){return a/b;}return (a/b)+1;}\nlong long llgcd(long long a,long long b){long long c;while(b!=0){c=a%b;a=b;b=c;}return a;}\nlong long lllcm(long long a,long long b){long long c=llgcd(a,b);a/=c;return a*b;}\nlong long llnCr(long long a,long long b){long long i,r=1;for(i=1;i<=b;i++){r*=(a+1-i);r/=i;}return r;}\nlong long llnHr(long long a,long long b){return llnCr(a+b-1,b);}\nlong long llfact(long long a){long long i,r=1;for(i=1;i<=a;i++){r*=i;}return r;}\nlong long llpow(long long a,long long b){long long i,r=1;for(i=1;i<=b;i++){r*=a;}return r;}\nlong long lldsum(long long x){long long r=0;while(x){r+=(x%10);x/=10;}return r;}\nlong long lldsumb(long long x,long long b){long long r=0;while(x){r+=(x%b);x/=b;}return r;}\nlong long llsankaku(long long x){return ((1+x)*x)/2;}\nvoid llswap(long long *a,long long *b){long long c;c=(*a);(*a)=(*b);(*b)=c;}\ndouble dbmax(double a,double b){if(a>b){return a;}return b;}\ndouble dbmin(double a,double b){if(a<b){return a;}return b;}\ndouble dbzt(double a,double b){return dbmax(a,b)-dbmin(a,b);}\nvoid dbswap(double *a,double *b){double c;c=(*a);(*a)=(*b);(*b)=c;}\nvoid chswap(char *a,char *b){char c;c=(*a);(*a)=(*b);(*b)=c;}\nint sortfncsj(const void *a,const void *b){if(*(int *)a>*(int *)b){return 1;}if(*(int *)a==*(int *)b){return 0;}return -1;}\nint sortfnckj(const void *a,const void *b){if(*(int *)a<*(int *)b){return 1;}if(*(int *)a==*(int *)b){return 0;}return -1;}\nint llsortfncsj(const void *a,const void *b){if(*(long long *)a>*(long long *)b){return 1;}if(*(long long *)a==*(long long *)b){return 0;}return -1;}\nint llsortfnckj(const void *a,const void *b){if(*(long long *)a<*(long long *)b){return 1;}if(*(long long *)a==*(long long *)b){return 0;}return -1;}\nint dbsortfncsj(const void *a,const void *b){if(*(double *)a>*(double *)b){return 1;}if(*(double *)a==*(double *)b){return 0;}return -1;}\nint dbsortfnckj(const void *a,const void *b){if(*(double *)a<*(double *)b){return 1;}if(*(double *)a==*(double *)b){return 0;}return -1;}\nint strsortfncsj(const void *a,const void *b){return strcmp((char *)a,(char *)b);}\nint strsortfnckj(const void *a,const void *b){return strcmp((char *)b,(char *)a);}\nint chsortfncsj(const void *a,const void *b){if(*(char *)a>*(char *)b){return 1;}if(*(char *)a==*(char *)b){return 0;}return -1;}\nint chsortfnckj(const void *a,const void *b){if(*(char *)a<*(char *)b){return 1;}if(*(char *)a==*(char *)b){return 0;}return -1;}\n\nvoid shuffledget(int x[],int n){\n    int i,b[524288],p,c;\n    for(i=0;i<n;i++){\n        b[i]=i;\n    }\n    for(i=n;i>=1;i--){\n        p=rand()%i;\n        c=b[i-1];b[i-1]=b[p];b[p]=c;\n    }\n    for(i=0;i<n;i++){\n        scanf(\"%d\",&x[b[i]]);\n    }\n}\n\nint dx4[4]={1,-1,0,0};\nint dy4[4]={0,0,1,-1};\nint dx8[8]={-1,-1,-1,0,0,1,1,1};\nint dy8[8]={-1,0,1,-1,1,-1,0,1};\n\nint search(int x,int a[],int n){\n    int st=0,fi=n-1,te;\n    while(st<=fi){\n        te=(st+fi)/2;\n        if(a[te]<x){st=te+1;}else{fi=te-1;}\n    }\n    return st;\n}\n\nvoid prarr(int arr[],int n){\n  int i;\n  for(i=0;i<n;i++){\n    if(i){printf(\" \");}\n    printf(\"%d\",arr[i]);\n  }\n  printf(\"\\n\");\n  return;\n}\n\nvoid getperm(int a[],int n){\n  int i,p;\n  for(i=0;i<n;i++){\n    a[i]=i;\n  }\n  for(i=n-1;i>=1;i--){\n    p=rand()%(i+1);\n    swap(&a[p],&a[i]);\n  }\n}\n\ntypedef struct{\nint val;\nint node;\n}sd;\n\nint sdsortfnc(const void *a,const void *b){\nif(((sd*)a)->val < ((sd*)b)->val){return -1;}\nif(((sd*)a)->val > ((sd*)b)->val){return 1;}\nreturn 0;\n}\n\nvoid coordinate_comp(int a[],int n){\n  int i,c=0;\n  sd dat[524288];\n  for(i=0;i<n;i++){\n    dat[i].val=a[i];\n    dat[i].node=i;\n  }\n  qsort(dat,n,sizeof(dat[0]),sdsortfnc);\n  a[dat[0].node]=c;\n  for(i=1;i<n;i++){\n    if(dat[i-1].val!=dat[i].val){c++;}\n    a[dat[i].node]=c;\n  }\n}\n\nint main(void){\n  long long i,j,n,m,k,a,b,c,h,w,r=0,l,t,lim,os;\n  long long **dp=malloc(sizeof(long long*)*5555);\n  long long **ndp=malloc(sizeof(long long*)*5555);\n  long long **dx=malloc(sizeof(long long*)*5555);\n  for(i=0;i<5555;i++){\n    dp[i]=malloc(sizeof(long long)*5555);\n    ndp[i]=malloc(sizeof(long long)*5555);\n    dx[i]=malloc(sizeof(long long)*5555);\n    for(j=0;j<5555;j++){\n      dp[i][j]=0;\n      ndp[i][j]=0;\n      dx[i][j]=0;\n    }\n  }\n  long long kr,gr;\n  scanf(\"%lld%lld\",&n,&m);\n  for(i=1;i<=n;i++){\n    dp[n-i][i]=1;\n  }\n  //for(j=0;j<4;j++){\n  //  for(k=0;k<4;k++){\n  //    fprintf(stderr,\"[%lld]\",dp[j][k]);\n  //  }fprintf(stderr,\"\\n\");\n  //}fprintf(stderr,\"\\n\");\n  t=n/2;\n  lim=n;\n  for(i=1;i<=t;i++){\n    for(j=0;j<=lim;j++){\n      for(k=n;k>=0;k--){\n        a=j;b=k-j;os=0;\n        if(b<0){os=-b;a+=b;b=0;}\n        if(a>=0){\n          dx[a][b]+=dp[j][k];\n          ndp[a][b]+=os*dp[j][k];\n        }\n      }\n    }\n    lim=n/i;\n    kr=0;gr=0;\n    for(j=lim;j>=0;j--){\n      for(k=0;k<=n;k++){\n        dx[j][k]%=m;\n        ndp[j][k]+=dx[j][k];\n        ndp[j][k]%=m;\n        if(j!=0){\n          ndp[j-1][k+1]+=ndp[j][k];\n          dx[j-1][k+1]+=dx[j][k];\n        }\n        dp[j][k]=ndp[j][k];\n        if(i==t && k!=0){\n          kr+=dp[j][k];kr%=m;\n          if(j==0){gr+=dp[j][k];gr%=m;}\n        }\n        ndp[j][k]=0;\n        dx[j][k]=0;\n      }\n    }\n    //for(j=0;j<4;j++){\n    //  for(k=0;k<4;k++){\n    //    fprintf(stderr,\"[%lld]\",dp[j][k]);\n    //  }fprintf(stderr,\"\\n\");\n    //}fprintf(stderr,\"\\n\");\n  }\n  if(n%2==1){printf(\"%lld\\n\",kr);}\n  else{printf(\"%lld\\n\",gr);}\n  return 0;\n}\n", "problem_context": "Score : 1200 points\n\nProblem Statement\n\nN problems have been chosen by the judges, now it's time to assign scores to them!\n\nProblem i must get an integer score A_i between 1 and N, inclusive.\nThe problems have already been sorted by difficulty: A_1 \\le A_2 \\le \\ldots \\le A_N must hold.\nDifferent problems can have the same score, though.\n\nBeing an ICPC fan, you want contestants who solve more problems to be ranked higher.\nThat's why, for any k (1 \\le k \\le N-1), you want the sum of scores of any k problems to be strictly less than the sum of scores of any k+1 problems.\n\nHow many ways to assign scores do you have? Find this number modulo the given prime M.\n\nConstraints\n\n2 \\leq N \\leq 5000\n\n9 \\times 10^8 < M < 10^9\n\nM is a prime.\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 ways to assign scores to the problems, modulo M.\n\nSample Input 1\n\n2 998244353\n\nSample Output 1\n\n3\n\nThe possible assignments are (1, 1), (1, 2), (2, 2).\n\nSample Input 2\n\n3 998244353\n\nSample Output 2\n\n7\n\nThe possible assignments are (1, 1, 1), (1, 2, 2), (1, 3, 3), (2, 2, 2), (2, 2, 3), (2, 3, 3), (3, 3, 3).\n\nSample Input 3\n\n6 966666661\n\nSample Output 3\n\n66\n\nSample Input 4\n\n96 925309799\n\nSample Output 4\n\n83779", "sample_input": "2 998244353\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02826", "source_text": "Score : 1200 points\n\nProblem Statement\n\nN problems have been chosen by the judges, now it's time to assign scores to them!\n\nProblem i must get an integer score A_i between 1 and N, inclusive.\nThe problems have already been sorted by difficulty: A_1 \\le A_2 \\le \\ldots \\le A_N must hold.\nDifferent problems can have the same score, though.\n\nBeing an ICPC fan, you want contestants who solve more problems to be ranked higher.\nThat's why, for any k (1 \\le k \\le N-1), you want the sum of scores of any k problems to be strictly less than the sum of scores of any k+1 problems.\n\nHow many ways to assign scores do you have? Find this number modulo the given prime M.\n\nConstraints\n\n2 \\leq N \\leq 5000\n\n9 \\times 10^8 < M < 10^9\n\nM is a prime.\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 ways to assign scores to the problems, modulo M.\n\nSample Input 1\n\n2 998244353\n\nSample Output 1\n\n3\n\nThe possible assignments are (1, 1), (1, 2), (2, 2).\n\nSample Input 2\n\n3 998244353\n\nSample Output 2\n\n7\n\nThe possible assignments are (1, 1, 1), (1, 2, 2), (1, 3, 3), (2, 2, 2), (2, 2, 3), (2, 3, 3), (3, 3, 3).\n\nSample Input 3\n\n6 966666661\n\nSample Output 3\n\n66\n\nSample Input 4\n\n96 925309799\n\nSample Output 4\n\n83779", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 6894, "cpu_time_ms": 2149, "memory_kb": 716544}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s551069536", "group_id": "codeNet:p02830", "input_text": "#include <stdio.h>\n#include <string.h>\n#include <stdlib.h>\n#include <math.h>\n#include <limits.h>\n#include <time.h>\nint main(){\n    int n,i;\n    char s[100]={},t[100]={},ans[220]={};\n    scanf(\"%d %s %s\",&n,s,t);\n    for(i=0; i<n; i++){\n        ans[2*i]=s[i];\n        ans[2*i+1]=t[i];\n    }\n    printf(\"%s\",ans);\n    return 0;\n}", "language": "C", "metadata": {"date": 1596571443, "filename_ext": "c", "original_language": "C (GCC 9.2.1)", "problem_description_relpath": "problem_descriptions/p02830.html", "problem_id": "p02830", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02830/input.txt", "sample_output_relpath": "derived/input_output/data/p02830/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02830/C/s551069536.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s551069536", "user_id": "u642625812"}, "prompt_components": {"gold_output": "icpc\n", "input_to_evaluate": "#include <stdio.h>\n#include <string.h>\n#include <stdlib.h>\n#include <math.h>\n#include <limits.h>\n#include <time.h>\nint main(){\n    int n,i;\n    char s[100]={},t[100]={},ans[220]={};\n    scanf(\"%d %s %s\",&n,s,t);\n    for(i=0; i<n; i++){\n        ans[2*i]=s[i];\n        ans[2*i+1]=t[i];\n    }\n    printf(\"%s\",ans);\n    return 0;\n}", "problem_context": "Score : 200 points\n\nProblem Statement\n\nGiven are strings s and t of length N each, both consisting of lowercase English letters.\n\nLet us form a new string by alternating the characters of S and the characters of T, as follows: the first character of S, the first character of T, the second character of S, the second character of T, ..., the N-th character of S, the N-th character of T. Print this new string.\n\nConstraints\n\n1 \\leq N \\leq 100\n\n|S| = |T| = N\n\nS and T are strings consisting of lowercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS T\n\nOutput\n\nPrint the string formed.\n\nSample Input 1\n\n2\nip cc\n\nSample Output 1\n\nicpc\n\nSample Input 2\n\n8\nhmhmnknk uuuuuuuu\n\nSample Output 2\n\nhumuhumunukunuku\n\nSample Input 3\n\n5\naaaaa aaaaa\n\nSample Output 3\n\naaaaaaaaaa", "sample_input": "2\nip cc\n"}, "reference_outputs": ["icpc\n"], "source_document_id": "p02830", "source_text": "Score : 200 points\n\nProblem Statement\n\nGiven are strings s and t of length N each, both consisting of lowercase English letters.\n\nLet us form a new string by alternating the characters of S and the characters of T, as follows: the first character of S, the first character of T, the second character of S, the second character of T, ..., the N-th character of S, the N-th character of T. Print this new string.\n\nConstraints\n\n1 \\leq N \\leq 100\n\n|S| = |T| = N\n\nS and T are strings consisting of lowercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS T\n\nOutput\n\nPrint the string formed.\n\nSample Input 1\n\n2\nip cc\n\nSample Output 1\n\nicpc\n\nSample Input 2\n\n8\nhmhmnknk uuuuuuuu\n\nSample Output 2\n\nhumuhumunukunuku\n\nSample Input 3\n\n5\naaaaa aaaaa\n\nSample Output 3\n\naaaaaaaaaa", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 8, "memory_kb": 1728}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s396388349", "group_id": "codeNet:p02831", "input_text": "#include <stdio.h>\n\nlong long int gcd(long long int,long long int);\n\nvoid main(){\n    long  long int a,b;\n    scanf(\"%lld%lld\",&a,&b);\n    printf(\"%lld\",a*b/gcd(a,b));\n}\nlong  long int gcd(long long int m,long long int n){\n    if(n==0)\n        return m;\n    else\n        return gcd(n,m%n);\n}", "language": "C", "metadata": {"date": 1588200771, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "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/C/s396388349.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s396388349", "user_id": "u804880828"}, "prompt_components": {"gold_output": "6\n", "input_to_evaluate": "#include <stdio.h>\n\nlong long int gcd(long long int,long long int);\n\nvoid main(){\n    long  long int a,b;\n    scanf(\"%lld%lld\",&a,&b);\n    printf(\"%lld\",a*b/gcd(a,b));\n}\nlong  long int gcd(long long int m,long long int n){\n    if(n==0)\n        return m;\n    else\n        return gcd(n,m%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": 291, "cpu_time_ms": 2, "memory_kb": 256}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s588109764", "group_id": "codeNet:p02831", "input_text": "#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\n#include <string.h>\n\nint min(int a, int b) {\n    if (a <= b) {\n        return a;\n    } else {\n        return b;\n    }\n}\n\nint main(void) {\n    long long int a, b, gcd = 1, sqrt;\n    scanf(\"%lld%lld\", &a,&b);\n    long long int ans;\n    for (long long int i = 2; i <= min(a,b); i++) {\n        if (a%i==0 && b%i==0) {\n            gcd = i;\n        }\n    }\n    ans = a*b/gcd;\n    printf(\"%lld\\n\", ans);\n    return 0;\n}\n", "language": "C", "metadata": {"date": 1577068587, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "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/C/s588109764.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s588109764", "user_id": "u904655984"}, "prompt_components": {"gold_output": "6\n", "input_to_evaluate": "#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\n#include <string.h>\n\nint min(int a, int b) {\n    if (a <= b) {\n        return a;\n    } else {\n        return b;\n    }\n}\n\nint main(void) {\n    long long int a, b, gcd = 1, sqrt;\n    scanf(\"%lld%lld\", &a,&b);\n    long long int ans;\n    for (long long int i = 2; i <= min(a,b); i++) {\n        if (a%i==0 && b%i==0) {\n            gcd = i;\n        }\n    }\n    ans = a*b/gcd;\n    printf(\"%lld\\n\", ans);\n    return 0;\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": 470, "cpu_time_ms": 2, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s179116965", "group_id": "codeNet:p02832", "input_text": "#include <stdio.h>\n#include <stdlib.h>\n\nint\tmain(void)\n{\n  \tint\tN;\n  \tint\t*a;\n  \tint\tnum;\n  \tint i;\n  \tint j;\n  \tint\tflag;\n  \tint place;\n  \n  \tnum = scanf(\"%d\", &N);\n  \tif (num != 1)\n      \treturn (0);\n  \n  \ta = (int *)malloc(sizeof(int) * (N + 1));\n  \tfor (i=1; i<=N; i++)\n    {\n      \tnum = scanf(\"%d\", &a[i]);\n      \tif (num != 1)\n          \treturn (0);\n    }\n\n    flag = 0;\n    for (i=1; i<=N; i++)\n    {\n        if (a[i] == 1)\n        {\n            place = i;\n            flag = 1;\n        }\n    }\n    if (flag == 0)\n    {\n        printf(\"-1\");\n        return (0);\n    }\n    \n  \tfor (i=place; i<=N; i++)\n    {\n        for (j=1; j<=N; j++)\n        {\n            if (a[i] == j)\n            {\n                place = j;\n                break ;\n            }\n        }\n    }\n  \tprintf(\"%d\", N - j);\n  \treturn (0);\n}", "language": "C", "metadata": {"date": 1584675839, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "problem_description_relpath": "problem_descriptions/p02832.html", "problem_id": "p02832", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02832/input.txt", "sample_output_relpath": "derived/input_output/data/p02832/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02832/C/s179116965.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s179116965", "user_id": "u378188810"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "#include <stdio.h>\n#include <stdlib.h>\n\nint\tmain(void)\n{\n  \tint\tN;\n  \tint\t*a;\n  \tint\tnum;\n  \tint i;\n  \tint j;\n  \tint\tflag;\n  \tint place;\n  \n  \tnum = scanf(\"%d\", &N);\n  \tif (num != 1)\n      \treturn (0);\n  \n  \ta = (int *)malloc(sizeof(int) * (N + 1));\n  \tfor (i=1; i<=N; i++)\n    {\n      \tnum = scanf(\"%d\", &a[i]);\n      \tif (num != 1)\n          \treturn (0);\n    }\n\n    flag = 0;\n    for (i=1; i<=N; i++)\n    {\n        if (a[i] == 1)\n        {\n            place = i;\n            flag = 1;\n        }\n    }\n    if (flag == 0)\n    {\n        printf(\"-1\");\n        return (0);\n    }\n    \n  \tfor (i=place; i<=N; i++)\n    {\n        for (j=1; j<=N; j++)\n        {\n            if (a[i] == j)\n            {\n                place = j;\n                break ;\n            }\n        }\n    }\n  \tprintf(\"%d\", N - j);\n  \treturn (0);\n}", "problem_context": "Score : 400 points\n\nProblem Statement\n\nWe have N bricks arranged in a row from left to right.\n\nThe i-th brick from the left (1 \\leq i \\leq N) has an integer a_i written on it.\n\nAmong them, you can break at most N-1 bricks of your choice.\n\nLet us say there are K bricks remaining. Snuke will be satisfied if, for each integer i (1 \\leq i \\leq K), the i-th of those brick from the left has the integer i written on it.\n\nFind the minimum number of bricks you need to break to satisfy Snuke's desire. If his desire is unsatisfiable, print -1 instead.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 200000\n\n1 \\leq a_i \\leq N\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 number of bricks that need to be broken to satisfy Snuke's desire, or print -1 if his desire is unsatisfiable.\n\nSample Input 1\n\n3\n2 1 2\n\nSample Output 1\n\n1\n\nIf we break the leftmost brick, the remaining bricks have integers 1 and 2 written on them from left to right, in which case Snuke will be satisfied.\n\nSample Input 2\n\n3\n2 2 2\n\nSample Output 2\n\n-1\n\nIn this case, there is no way to break some of the bricks to satisfy Snuke's desire.\n\nSample Input 3\n\n10\n3 1 4 1 5 9 2 6 5 3\n\nSample Output 3\n\n7\n\nSample Input 4\n\n1\n1\n\nSample Output 4\n\n0\n\nThere may be no need to break the bricks at all.", "sample_input": "3\n2 1 2\n"}, "reference_outputs": ["1\n"], "source_document_id": "p02832", "source_text": "Score : 400 points\n\nProblem Statement\n\nWe have N bricks arranged in a row from left to right.\n\nThe i-th brick from the left (1 \\leq i \\leq N) has an integer a_i written on it.\n\nAmong them, you can break at most N-1 bricks of your choice.\n\nLet us say there are K bricks remaining. Snuke will be satisfied if, for each integer i (1 \\leq i \\leq K), the i-th of those brick from the left has the integer i written on it.\n\nFind the minimum number of bricks you need to break to satisfy Snuke's desire. If his desire is unsatisfiable, print -1 instead.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 200000\n\n1 \\leq a_i \\leq N\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 number of bricks that need to be broken to satisfy Snuke's desire, or print -1 if his desire is unsatisfiable.\n\nSample Input 1\n\n3\n2 1 2\n\nSample Output 1\n\n1\n\nIf we break the leftmost brick, the remaining bricks have integers 1 and 2 written on them from left to right, in which case Snuke will be satisfied.\n\nSample Input 2\n\n3\n2 2 2\n\nSample Output 2\n\n-1\n\nIn this case, there is no way to break some of the bricks to satisfy Snuke's desire.\n\nSample Input 3\n\n10\n3 1 4 1 5 9 2 6 5 3\n\nSample Output 3\n\n7\n\nSample Input 4\n\n1\n1\n\nSample Output 4\n\n0\n\nThere may be no need to break the bricks at all.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 2103, "memory_kb": 896}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s124593461", "group_id": "codeNet:p02833", "input_text": "#include<stdio.h>\n#include<string.h>\n#include<math.h>\n\nint main(void) {\n\tlong long n,ans = 0;\n\tlong long div = 1;\n\tscanf(\"%lld\", &n);\n\tif (n % 2) printf(\"%d\", 0);\n\telse {\n\t\tlong long a = n / 2;\n\t\twhile (a / div) {\n\t\t\tdiv *= 5;\n\t\t\tans += a / div;\n\t\t}\n\t\tprintf(\"%lld\", ans);\n\t}\n\treturn 0;\n}\n", "language": "C", "metadata": {"date": 1581825267, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "problem_description_relpath": "problem_descriptions/p02833.html", "problem_id": "p02833", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02833/input.txt", "sample_output_relpath": "derived/input_output/data/p02833/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02833/C/s124593461.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s124593461", "user_id": "u105100688"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "#include<stdio.h>\n#include<string.h>\n#include<math.h>\n\nint main(void) {\n\tlong long n,ans = 0;\n\tlong long div = 1;\n\tscanf(\"%lld\", &n);\n\tif (n % 2) printf(\"%d\", 0);\n\telse {\n\t\tlong long a = n / 2;\n\t\twhile (a / div) {\n\t\t\tdiv *= 5;\n\t\t\tans += a / div;\n\t\t}\n\t\tprintf(\"%lld\", ans);\n\t}\n\treturn 0;\n}\n", "problem_context": "Score : 500 points\n\nProblem Statement\n\nFor an integer n not less than 0, let us define f(n) as follows:\n\nf(n) = 1 (if n < 2)\n\nf(n) = n f(n-2) (if n \\geq 2)\n\nGiven is an integer N. Find the number of trailing zeros in the decimal notation of f(N).\n\nConstraints\n\n0 \\leq N \\leq 10^{18}\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the number of trailing zeros in the decimal notation of f(N).\n\nSample Input 1\n\n12\n\nSample Output 1\n\n1\n\nf(12) = 12 × 10 × 8 × 6 × 4 × 2 = 46080, which has one trailing zero.\n\nSample Input 2\n\n5\n\nSample Output 2\n\n0\n\nf(5) = 5 × 3 × 1 = 15, which has no trailing zeros.\n\nSample Input 3\n\n1000000000000000000\n\nSample Output 3\n\n124999999999999995", "sample_input": "12\n"}, "reference_outputs": ["1\n"], "source_document_id": "p02833", "source_text": "Score : 500 points\n\nProblem Statement\n\nFor an integer n not less than 0, let us define f(n) as follows:\n\nf(n) = 1 (if n < 2)\n\nf(n) = n f(n-2) (if n \\geq 2)\n\nGiven is an integer N. Find the number of trailing zeros in the decimal notation of f(N).\n\nConstraints\n\n0 \\leq N \\leq 10^{18}\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the number of trailing zeros in the decimal notation of f(N).\n\nSample Input 1\n\n12\n\nSample Output 1\n\n1\n\nf(12) = 12 × 10 × 8 × 6 × 4 × 2 = 46080, which has one trailing zero.\n\nSample Input 2\n\n5\n\nSample Output 2\n\n0\n\nf(5) = 5 × 3 × 1 = 15, which has no trailing zeros.\n\nSample Input 3\n\n1000000000000000000\n\nSample Output 3\n\n124999999999999995", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 289, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s190670103", "group_id": "codeNet:p02833", "input_text": "#include<stdio.h>\nint main(void)\n{\n  long int n,i,j,a,b,c;\n  scanf(\"%ld\",&n);\n  if(n%2==1){\n    printf(\"0\\n\");\n  }\n  a=0;\n  if(n%2==0){\n    for(i=0;i<5;i++){\n      if((n-2*i)%10==0){\n        c=n-2*i;\n        break;\n      }\n      if((n-2*i)%10!=0){\n        continue;\n      }\n    }\n    printf(\"%ld\\n\",c);\n    for(i=0;i<n/10;i++){\n      b=c;\n      for(j=0;j<19;j++){\n        if(b%10!=0){\n          break;\n        }\n        if(b%10==0){\n          a++;\n          b=b/10;\n        }\n      }\n      c=c-10;\n    }\n  }\n  printf(\"%ld\\n\",a);\n  return 0;\n}", "language": "C", "metadata": {"date": 1577516930, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "problem_description_relpath": "problem_descriptions/p02833.html", "problem_id": "p02833", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02833/input.txt", "sample_output_relpath": "derived/input_output/data/p02833/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02833/C/s190670103.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s190670103", "user_id": "u986190948"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "#include<stdio.h>\nint main(void)\n{\n  long int n,i,j,a,b,c;\n  scanf(\"%ld\",&n);\n  if(n%2==1){\n    printf(\"0\\n\");\n  }\n  a=0;\n  if(n%2==0){\n    for(i=0;i<5;i++){\n      if((n-2*i)%10==0){\n        c=n-2*i;\n        break;\n      }\n      if((n-2*i)%10!=0){\n        continue;\n      }\n    }\n    printf(\"%ld\\n\",c);\n    for(i=0;i<n/10;i++){\n      b=c;\n      for(j=0;j<19;j++){\n        if(b%10!=0){\n          break;\n        }\n        if(b%10==0){\n          a++;\n          b=b/10;\n        }\n      }\n      c=c-10;\n    }\n  }\n  printf(\"%ld\\n\",a);\n  return 0;\n}", "problem_context": "Score : 500 points\n\nProblem Statement\n\nFor an integer n not less than 0, let us define f(n) as follows:\n\nf(n) = 1 (if n < 2)\n\nf(n) = n f(n-2) (if n \\geq 2)\n\nGiven is an integer N. Find the number of trailing zeros in the decimal notation of f(N).\n\nConstraints\n\n0 \\leq N \\leq 10^{18}\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the number of trailing zeros in the decimal notation of f(N).\n\nSample Input 1\n\n12\n\nSample Output 1\n\n1\n\nf(12) = 12 × 10 × 8 × 6 × 4 × 2 = 46080, which has one trailing zero.\n\nSample Input 2\n\n5\n\nSample Output 2\n\n0\n\nf(5) = 5 × 3 × 1 = 15, which has no trailing zeros.\n\nSample Input 3\n\n1000000000000000000\n\nSample Output 3\n\n124999999999999995", "sample_input": "12\n"}, "reference_outputs": ["1\n"], "source_document_id": "p02833", "source_text": "Score : 500 points\n\nProblem Statement\n\nFor an integer n not less than 0, let us define f(n) as follows:\n\nf(n) = 1 (if n < 2)\n\nf(n) = n f(n-2) (if n \\geq 2)\n\nGiven is an integer N. Find the number of trailing zeros in the decimal notation of f(N).\n\nConstraints\n\n0 \\leq N \\leq 10^{18}\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the number of trailing zeros in the decimal notation of f(N).\n\nSample Input 1\n\n12\n\nSample Output 1\n\n1\n\nf(12) = 12 × 10 × 8 × 6 × 4 × 2 = 46080, which has one trailing zero.\n\nSample Input 2\n\n5\n\nSample Output 2\n\n0\n\nf(5) = 5 × 3 × 1 = 15, which has no trailing zeros.\n\nSample Input 3\n\n1000000000000000000\n\nSample Output 3\n\n124999999999999995", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 542, "cpu_time_ms": 2103, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s927621352", "group_id": "codeNet:p02833", "input_text": "#include <stdio.h>\n\nint main(void) {\n\tlong long int n;\n\tscanf(\"%lld\", &n);\n\n\tif (n%2 != 0) {\n\t\tputs(\"0\");\n\t\treturn 0;\n\t}\n\n\tlong long int cnt = 0;\n\tlong long int div = 2;\n\twhile (n/(div *= 5)) {\n\t\tcnt += n/div;\n\t}\n\n\tprintf(\"%lld\\n\", cnt);\n}\n", "language": "C", "metadata": {"date": 1577328415, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "problem_description_relpath": "problem_descriptions/p02833.html", "problem_id": "p02833", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02833/input.txt", "sample_output_relpath": "derived/input_output/data/p02833/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02833/C/s927621352.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s927621352", "user_id": "u210370951"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "#include <stdio.h>\n\nint main(void) {\n\tlong long int n;\n\tscanf(\"%lld\", &n);\n\n\tif (n%2 != 0) {\n\t\tputs(\"0\");\n\t\treturn 0;\n\t}\n\n\tlong long int cnt = 0;\n\tlong long int div = 2;\n\twhile (n/(div *= 5)) {\n\t\tcnt += n/div;\n\t}\n\n\tprintf(\"%lld\\n\", cnt);\n}\n", "problem_context": "Score : 500 points\n\nProblem Statement\n\nFor an integer n not less than 0, let us define f(n) as follows:\n\nf(n) = 1 (if n < 2)\n\nf(n) = n f(n-2) (if n \\geq 2)\n\nGiven is an integer N. Find the number of trailing zeros in the decimal notation of f(N).\n\nConstraints\n\n0 \\leq N \\leq 10^{18}\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the number of trailing zeros in the decimal notation of f(N).\n\nSample Input 1\n\n12\n\nSample Output 1\n\n1\n\nf(12) = 12 × 10 × 8 × 6 × 4 × 2 = 46080, which has one trailing zero.\n\nSample Input 2\n\n5\n\nSample Output 2\n\n0\n\nf(5) = 5 × 3 × 1 = 15, which has no trailing zeros.\n\nSample Input 3\n\n1000000000000000000\n\nSample Output 3\n\n124999999999999995", "sample_input": "12\n"}, "reference_outputs": ["1\n"], "source_document_id": "p02833", "source_text": "Score : 500 points\n\nProblem Statement\n\nFor an integer n not less than 0, let us define f(n) as follows:\n\nf(n) = 1 (if n < 2)\n\nf(n) = n f(n-2) (if n \\geq 2)\n\nGiven is an integer N. Find the number of trailing zeros in the decimal notation of f(N).\n\nConstraints\n\n0 \\leq N \\leq 10^{18}\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the number of trailing zeros in the decimal notation of f(N).\n\nSample Input 1\n\n12\n\nSample Output 1\n\n1\n\nf(12) = 12 × 10 × 8 × 6 × 4 × 2 = 46080, which has one trailing zero.\n\nSample Input 2\n\n5\n\nSample Output 2\n\n0\n\nf(5) = 5 × 3 × 1 = 15, which has no trailing zeros.\n\nSample Input 3\n\n1000000000000000000\n\nSample Output 3\n\n124999999999999995", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s197716236", "group_id": "codeNet:p02835", "input_text": "#include <stdio.h>\n#include <stdlib.h>\n#include \"time.h\"\n#include \"unistd.h\"\n#include \"string.h\"\n#include <math.h>\nint ans=0;\nint main(int argc, char* argv[]){\n  int a,b,c,sum;\n  scanf(\"%d%d%d\",&a,&b,&c);\n  sum=a+b+c;\n    if(sum<=21)\n    {\n      printf(\"win\");\n    }else{\n      printf(\"bust\");\n    }\n}\n", "language": "C", "metadata": {"date": 1585875677, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "problem_description_relpath": "problem_descriptions/p02835.html", "problem_id": "p02835", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02835/input.txt", "sample_output_relpath": "derived/input_output/data/p02835/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02835/C/s197716236.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s197716236", "user_id": "u488417454"}, "prompt_components": {"gold_output": "win\n", "input_to_evaluate": "#include <stdio.h>\n#include <stdlib.h>\n#include \"time.h\"\n#include \"unistd.h\"\n#include \"string.h\"\n#include <math.h>\nint ans=0;\nint main(int argc, char* argv[]){\n  int a,b,c,sum;\n  scanf(\"%d%d%d\",&a,&b,&c);\n  sum=a+b+c;\n    if(sum<=21)\n    {\n      printf(\"win\");\n    }else{\n      printf(\"bust\");\n    }\n}\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nGiven are three integers A_1, A_2, and A_3.\n\nIf A_1+A_2+A_3 is greater than or equal to 22, print bust; otherwise, print win.\n\nConstraints\n\n1 \\leq A_i \\leq 13 \\ \\ (i=1,2,3)\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA_1 A_2 A_3\n\nOutput\n\nIf A_1+A_2+A_3 is greater than or equal to 22, print bust; otherwise, print win.\n\nSample Input 1\n\n5 7 9\n\nSample Output 1\n\nwin\n\n5+7+9=21, so print win.\n\nSample Input 2\n\n13 7 2\n\nSample Output 2\n\nbust\n\n13+7+2=22, so print bust.", "sample_input": "5 7 9\n"}, "reference_outputs": ["win\n"], "source_document_id": "p02835", "source_text": "Score : 100 points\n\nProblem Statement\n\nGiven are three integers A_1, A_2, and A_3.\n\nIf A_1+A_2+A_3 is greater than or equal to 22, print bust; otherwise, print win.\n\nConstraints\n\n1 \\leq A_i \\leq 13 \\ \\ (i=1,2,3)\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA_1 A_2 A_3\n\nOutput\n\nIf A_1+A_2+A_3 is greater than or equal to 22, print bust; otherwise, print win.\n\nSample Input 1\n\n5 7 9\n\nSample Output 1\n\nwin\n\n5+7+9=21, so print win.\n\nSample Input 2\n\n13 7 2\n\nSample Output 2\n\nbust\n\n13+7+2=22, so print bust.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s447910862", "group_id": "codeNet:p02835", "input_text": "#include <stdio.h>\nint main()\n{\n    int a,b,c,d;\n    scanf(\"%d %d %d\",&a, &b,&c);\n    d=a+b+c;\n    if (d>=22)\n    {\n        printf(\"bust\\n\");\n    }\n    else\n    {\n        printf(\"win\\n\");\n    }\n\n    return 0;\n}\n", "language": "C", "metadata": {"date": 1581145725, "filename_ext": "c", "original_language": "C (Clang 3.8.0)", "problem_description_relpath": "problem_descriptions/p02835.html", "problem_id": "p02835", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02835/input.txt", "sample_output_relpath": "derived/input_output/data/p02835/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02835/C/s447910862.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s447910862", "user_id": "u353919145"}, "prompt_components": {"gold_output": "win\n", "input_to_evaluate": "#include <stdio.h>\nint main()\n{\n    int a,b,c,d;\n    scanf(\"%d %d %d\",&a, &b,&c);\n    d=a+b+c;\n    if (d>=22)\n    {\n        printf(\"bust\\n\");\n    }\n    else\n    {\n        printf(\"win\\n\");\n    }\n\n    return 0;\n}\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nGiven are three integers A_1, A_2, and A_3.\n\nIf A_1+A_2+A_3 is greater than or equal to 22, print bust; otherwise, print win.\n\nConstraints\n\n1 \\leq A_i \\leq 13 \\ \\ (i=1,2,3)\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA_1 A_2 A_3\n\nOutput\n\nIf A_1+A_2+A_3 is greater than or equal to 22, print bust; otherwise, print win.\n\nSample Input 1\n\n5 7 9\n\nSample Output 1\n\nwin\n\n5+7+9=21, so print win.\n\nSample Input 2\n\n13 7 2\n\nSample Output 2\n\nbust\n\n13+7+2=22, so print bust.", "sample_input": "5 7 9\n"}, "reference_outputs": ["win\n"], "source_document_id": "p02835", "source_text": "Score : 100 points\n\nProblem Statement\n\nGiven are three integers A_1, A_2, and A_3.\n\nIf A_1+A_2+A_3 is greater than or equal to 22, print bust; otherwise, print win.\n\nConstraints\n\n1 \\leq A_i \\leq 13 \\ \\ (i=1,2,3)\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA_1 A_2 A_3\n\nOutput\n\nIf A_1+A_2+A_3 is greater than or equal to 22, print bust; otherwise, print win.\n\nSample Input 1\n\n5 7 9\n\nSample Output 1\n\nwin\n\n5+7+9=21, so print win.\n\nSample Input 2\n\n13 7 2\n\nSample Output 2\n\nbust\n\n13+7+2=22, so print bust.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 211, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s718157276", "group_id": "codeNet:p02835", "input_text": "#include<stdio.h>\nint main()\n{\n    int a1, a2, a3, t;\n\n    scanf(\"%d %d %d\", &a1, &a2, &a3);\n\n    t=a1+a2+a3;\n\n    if(t>=22)\n    {\n        printf(\"bust\\n\");\n    }\n    else\n    {\n        printf(\"win\\n\");\n    }\n\n    return 0;\n}", "language": "C", "metadata": {"date": 1581145624, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "problem_description_relpath": "problem_descriptions/p02835.html", "problem_id": "p02835", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02835/input.txt", "sample_output_relpath": "derived/input_output/data/p02835/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02835/C/s718157276.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s718157276", "user_id": "u018679195"}, "prompt_components": {"gold_output": "win\n", "input_to_evaluate": "#include<stdio.h>\nint main()\n{\n    int a1, a2, a3, t;\n\n    scanf(\"%d %d %d\", &a1, &a2, &a3);\n\n    t=a1+a2+a3;\n\n    if(t>=22)\n    {\n        printf(\"bust\\n\");\n    }\n    else\n    {\n        printf(\"win\\n\");\n    }\n\n    return 0;\n}", "problem_context": "Score : 100 points\n\nProblem Statement\n\nGiven are three integers A_1, A_2, and A_3.\n\nIf A_1+A_2+A_3 is greater than or equal to 22, print bust; otherwise, print win.\n\nConstraints\n\n1 \\leq A_i \\leq 13 \\ \\ (i=1,2,3)\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA_1 A_2 A_3\n\nOutput\n\nIf A_1+A_2+A_3 is greater than or equal to 22, print bust; otherwise, print win.\n\nSample Input 1\n\n5 7 9\n\nSample Output 1\n\nwin\n\n5+7+9=21, so print win.\n\nSample Input 2\n\n13 7 2\n\nSample Output 2\n\nbust\n\n13+7+2=22, so print bust.", "sample_input": "5 7 9\n"}, "reference_outputs": ["win\n"], "source_document_id": "p02835", "source_text": "Score : 100 points\n\nProblem Statement\n\nGiven are three integers A_1, A_2, and A_3.\n\nIf A_1+A_2+A_3 is greater than or equal to 22, print bust; otherwise, print win.\n\nConstraints\n\n1 \\leq A_i \\leq 13 \\ \\ (i=1,2,3)\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA_1 A_2 A_3\n\nOutput\n\nIf A_1+A_2+A_3 is greater than or equal to 22, print bust; otherwise, print win.\n\nSample Input 1\n\n5 7 9\n\nSample Output 1\n\nwin\n\n5+7+9=21, so print win.\n\nSample Input 2\n\n13 7 2\n\nSample Output 2\n\nbust\n\n13+7+2=22, so print bust.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 225, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s233079553", "group_id": "codeNet:p02835", "input_text": "  #include <stdio.h>\n  int main(void)\n  {\n    int a,b,c;\n\n    // 入力\n    scanf(\"%d %d %d\", &a, &b, &c);\n    if((a+b+c) >= 21)\n      printf(\"%s\\n\",\"bust\");\n    else\n      printf(\"%s\\n\",\"win\");\n\n    return 0;\n\n  }\n", "language": "C", "metadata": {"date": 1576547343, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "problem_description_relpath": "problem_descriptions/p02835.html", "problem_id": "p02835", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02835/input.txt", "sample_output_relpath": "derived/input_output/data/p02835/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02835/C/s233079553.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s233079553", "user_id": "u182887405"}, "prompt_components": {"gold_output": "win\n", "input_to_evaluate": "  #include <stdio.h>\n  int main(void)\n  {\n    int a,b,c;\n\n    // 入力\n    scanf(\"%d %d %d\", &a, &b, &c);\n    if((a+b+c) >= 21)\n      printf(\"%s\\n\",\"bust\");\n    else\n      printf(\"%s\\n\",\"win\");\n\n    return 0;\n\n  }\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nGiven are three integers A_1, A_2, and A_3.\n\nIf A_1+A_2+A_3 is greater than or equal to 22, print bust; otherwise, print win.\n\nConstraints\n\n1 \\leq A_i \\leq 13 \\ \\ (i=1,2,3)\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA_1 A_2 A_3\n\nOutput\n\nIf A_1+A_2+A_3 is greater than or equal to 22, print bust; otherwise, print win.\n\nSample Input 1\n\n5 7 9\n\nSample Output 1\n\nwin\n\n5+7+9=21, so print win.\n\nSample Input 2\n\n13 7 2\n\nSample Output 2\n\nbust\n\n13+7+2=22, so print bust.", "sample_input": "5 7 9\n"}, "reference_outputs": ["win\n"], "source_document_id": "p02835", "source_text": "Score : 100 points\n\nProblem Statement\n\nGiven are three integers A_1, A_2, and A_3.\n\nIf A_1+A_2+A_3 is greater than or equal to 22, print bust; otherwise, print win.\n\nConstraints\n\n1 \\leq A_i \\leq 13 \\ \\ (i=1,2,3)\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA_1 A_2 A_3\n\nOutput\n\nIf A_1+A_2+A_3 is greater than or equal to 22, print bust; otherwise, print win.\n\nSample Input 1\n\n5 7 9\n\nSample Output 1\n\nwin\n\n5+7+9=21, so print win.\n\nSample Input 2\n\n13 7 2\n\nSample Output 2\n\nbust\n\n13+7+2=22, so print bust.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 215, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s371241158", "group_id": "codeNet:p02835", "input_text": "#include<stdio.h>\n//#include<conio.h>\nint main(){\n  int A1;\n  int A2;\n  int A3;\n  int result=0;\nprintf(\"Enter A1, A2, A3:\");\n  scanf(\"%d\",&A1);\n  scanf(\"%d\",&A2);\n  scanf(\"%d\",&A3);\n  if(result>=22)\n  \tprintf(\"bust\");\n  else \n    printf(\"win\");\n return 0;\n}", "language": "C", "metadata": {"date": 1575860088, "filename_ext": "c", "original_language": "C (Clang 3.8.0)", "problem_description_relpath": "problem_descriptions/p02835.html", "problem_id": "p02835", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02835/input.txt", "sample_output_relpath": "derived/input_output/data/p02835/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02835/C/s371241158.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s371241158", "user_id": "u774615977"}, "prompt_components": {"gold_output": "win\n", "input_to_evaluate": "#include<stdio.h>\n//#include<conio.h>\nint main(){\n  int A1;\n  int A2;\n  int A3;\n  int result=0;\nprintf(\"Enter A1, A2, A3:\");\n  scanf(\"%d\",&A1);\n  scanf(\"%d\",&A2);\n  scanf(\"%d\",&A3);\n  if(result>=22)\n  \tprintf(\"bust\");\n  else \n    printf(\"win\");\n return 0;\n}", "problem_context": "Score : 100 points\n\nProblem Statement\n\nGiven are three integers A_1, A_2, and A_3.\n\nIf A_1+A_2+A_3 is greater than or equal to 22, print bust; otherwise, print win.\n\nConstraints\n\n1 \\leq A_i \\leq 13 \\ \\ (i=1,2,3)\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA_1 A_2 A_3\n\nOutput\n\nIf A_1+A_2+A_3 is greater than or equal to 22, print bust; otherwise, print win.\n\nSample Input 1\n\n5 7 9\n\nSample Output 1\n\nwin\n\n5+7+9=21, so print win.\n\nSample Input 2\n\n13 7 2\n\nSample Output 2\n\nbust\n\n13+7+2=22, so print bust.", "sample_input": "5 7 9\n"}, "reference_outputs": ["win\n"], "source_document_id": "p02835", "source_text": "Score : 100 points\n\nProblem Statement\n\nGiven are three integers A_1, A_2, and A_3.\n\nIf A_1+A_2+A_3 is greater than or equal to 22, print bust; otherwise, print win.\n\nConstraints\n\n1 \\leq A_i \\leq 13 \\ \\ (i=1,2,3)\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA_1 A_2 A_3\n\nOutput\n\nIf A_1+A_2+A_3 is greater than or equal to 22, print bust; otherwise, print win.\n\nSample Input 1\n\n5 7 9\n\nSample Output 1\n\nwin\n\n5+7+9=21, so print win.\n\nSample Input 2\n\n13 7 2\n\nSample Output 2\n\nbust\n\n13+7+2=22, so print bust.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 257, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s185127585", "group_id": "codeNet:p02835", "input_text": "#include<stdio.h>\n#include<string.h>\n \n \nint main(){\n  int a,b,c;\n  scanf(\"%d %d %d\",&a,&b,&c);\n  if(a+b+c<22)\n  printf(\"win\");\n  else\n    printf(\"bust\");\n  return 0;\n}", "language": "C", "metadata": {"date": 1575857136, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "problem_description_relpath": "problem_descriptions/p02835.html", "problem_id": "p02835", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02835/input.txt", "sample_output_relpath": "derived/input_output/data/p02835/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02835/C/s185127585.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s185127585", "user_id": "u272618329"}, "prompt_components": {"gold_output": "win\n", "input_to_evaluate": "#include<stdio.h>\n#include<string.h>\n \n \nint main(){\n  int a,b,c;\n  scanf(\"%d %d %d\",&a,&b,&c);\n  if(a+b+c<22)\n  printf(\"win\");\n  else\n    printf(\"bust\");\n  return 0;\n}", "problem_context": "Score : 100 points\n\nProblem Statement\n\nGiven are three integers A_1, A_2, and A_3.\n\nIf A_1+A_2+A_3 is greater than or equal to 22, print bust; otherwise, print win.\n\nConstraints\n\n1 \\leq A_i \\leq 13 \\ \\ (i=1,2,3)\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA_1 A_2 A_3\n\nOutput\n\nIf A_1+A_2+A_3 is greater than or equal to 22, print bust; otherwise, print win.\n\nSample Input 1\n\n5 7 9\n\nSample Output 1\n\nwin\n\n5+7+9=21, so print win.\n\nSample Input 2\n\n13 7 2\n\nSample Output 2\n\nbust\n\n13+7+2=22, so print bust.", "sample_input": "5 7 9\n"}, "reference_outputs": ["win\n"], "source_document_id": "p02835", "source_text": "Score : 100 points\n\nProblem Statement\n\nGiven are three integers A_1, A_2, and A_3.\n\nIf A_1+A_2+A_3 is greater than or equal to 22, print bust; otherwise, print win.\n\nConstraints\n\n1 \\leq A_i \\leq 13 \\ \\ (i=1,2,3)\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA_1 A_2 A_3\n\nOutput\n\nIf A_1+A_2+A_3 is greater than or equal to 22, print bust; otherwise, print win.\n\nSample Input 1\n\n5 7 9\n\nSample Output 1\n\nwin\n\n5+7+9=21, so print win.\n\nSample Input 2\n\n13 7 2\n\nSample Output 2\n\nbust\n\n13+7+2=22, so print bust.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 168, "cpu_time_ms": 28, "memory_kb": 256}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s051380780", "group_id": "codeNet:p02836", "input_text": "#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\n#include <string.h>\n#define yes \"Yes\\n\"\n#define no \"No\\n\"\n//int m,n;\n//int i,j,k,l;\n//int a,b,c,d,e,f,g;\n//int sum,total;\n//long long int ;\n//float ;\n//double ;\n//char a[101],b[101],s[101],t[101],u[101];\nchar s[101];\nint i,k;\nint main(void){\n    scanf(\"%s\",s);\n    for (i = 0; i < strlen(s) / 2; i++)\n    {\n        if (s[i] != s[strlen(s)-i-1])\n        {\n            k++;\n        }\n    }\n    printf(\"%d\\n\",k);\n    return 0;\n}", "language": "C", "metadata": {"date": 1583946450, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "problem_description_relpath": "problem_descriptions/p02836.html", "problem_id": "p02836", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02836/input.txt", "sample_output_relpath": "derived/input_output/data/p02836/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02836/C/s051380780.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s051380780", "user_id": "u643498479"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\n#include <string.h>\n#define yes \"Yes\\n\"\n#define no \"No\\n\"\n//int m,n;\n//int i,j,k,l;\n//int a,b,c,d,e,f,g;\n//int sum,total;\n//long long int ;\n//float ;\n//double ;\n//char a[101],b[101],s[101],t[101],u[101];\nchar s[101];\nint i,k;\nint main(void){\n    scanf(\"%s\",s);\n    for (i = 0; i < strlen(s) / 2; i++)\n    {\n        if (s[i] != s[strlen(s)-i-1])\n        {\n            k++;\n        }\n    }\n    printf(\"%d\\n\",k);\n    return 0;\n}", "problem_context": "Score : 200 points\n\nProblem Statement\n\nTakahashi loves palindromes. Non-palindromic strings are unacceptable to him. Each time he hugs a string, he can change one of its characters to any character of his choice.\n\nGiven is a string S. Find the minimum number of hugs needed to make S palindromic.\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\nPrint the minimum number of hugs needed to make S palindromic.\n\nSample Input 1\n\nredcoder\n\nSample Output 1\n\n1\n\nFor example, we can change the fourth character to o and get a palindrome redooder.\n\nSample Input 2\n\nvvvvvv\n\nSample Output 2\n\n0\n\nWe might need no hugs at all.\n\nSample Input 3\n\nabcdabc\n\nSample Output 3\n\n2", "sample_input": "redcoder\n"}, "reference_outputs": ["1\n"], "source_document_id": "p02836", "source_text": "Score : 200 points\n\nProblem Statement\n\nTakahashi loves palindromes. Non-palindromic strings are unacceptable to him. Each time he hugs a string, he can change one of its characters to any character of his choice.\n\nGiven is a string S. Find the minimum number of hugs needed to make S palindromic.\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\nPrint the minimum number of hugs needed to make S palindromic.\n\nSample Input 1\n\nredcoder\n\nSample Output 1\n\n1\n\nFor example, we can change the fourth character to o and get a palindrome redooder.\n\nSample Input 2\n\nvvvvvv\n\nSample Output 2\n\n0\n\nWe might need no hugs at all.\n\nSample Input 3\n\nabcdabc\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": 482, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s157128453", "group_id": "codeNet:p02837", "input_text": "#include <stdio.h>\n\nint i, n, m, k, l, x, y, a[15][2];\n\nint main() {\n  for(scanf(\"%d\", &n); i < n; i++) {\n    for(scanf(\"%d\", &m); m--;) {\n      scanf(\"%d%d\", &x, &y);\n      a[i][y] |= 1 << x - 1;\n    }\n  }\n  l = (1 << n) - 1;\n  for(x = 1; x <= l; x++) {\n    for(i = 0; i < n && !((x >> i) & 1 && (a[i][0] & x || a[i][1] & l - x)); i++);\n    if(i == n) {\n      y = __builtin_popcount(x);\n      if(y > k)\n        k = y;\n    }\n  }\n  printf(\"%d\\n\", k);\n  return 0;\n}\n", "language": "C", "metadata": {"date": 1575926714, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "problem_description_relpath": "problem_descriptions/p02837.html", "problem_id": "p02837", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02837/input.txt", "sample_output_relpath": "derived/input_output/data/p02837/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02837/C/s157128453.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s157128453", "user_id": "u021019433"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "#include <stdio.h>\n\nint i, n, m, k, l, x, y, a[15][2];\n\nint main() {\n  for(scanf(\"%d\", &n); i < n; i++) {\n    for(scanf(\"%d\", &m); m--;) {\n      scanf(\"%d%d\", &x, &y);\n      a[i][y] |= 1 << x - 1;\n    }\n  }\n  l = (1 << n) - 1;\n  for(x = 1; x <= l; x++) {\n    for(i = 0; i < n && !((x >> i) & 1 && (a[i][0] & x || a[i][1] & l - x)); i++);\n    if(i == n) {\n      y = __builtin_popcount(x);\n      if(y > k)\n        k = y;\n    }\n  }\n  printf(\"%d\\n\", k);\n  return 0;\n}\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere are N people numbered 1 to N. Each of them is either an honest person whose testimonies are always correct or an unkind person whose testimonies may be correct or not.\n\nPerson i gives A_i testimonies. The j-th testimony by Person i is represented by two integers x_{ij} and y_{ij}. If y_{ij} = 1, the testimony says Person x_{ij} is honest; if y_{ij} = 0, it says Person x_{ij} is unkind.\n\nHow many honest persons can be among those N people at most?\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 15\n\n0 \\leq A_i \\leq N - 1\n\n1 \\leq x_{ij} \\leq N\n\nx_{ij} \\neq i\n\nx_{ij_1} \\neq x_{ij_2} (j_1 \\neq j_2)\n\ny_{ij} = 0, 1\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1\nx_{11} y_{11}\nx_{12} y_{12}\n:\nx_{1A_1} y_{1A_1}\nA_2\nx_{21} y_{21}\nx_{22} y_{22}\n:\nx_{2A_2} y_{2A_2}\n:\nA_N\nx_{N1} y_{N1}\nx_{N2} y_{N2}\n:\nx_{NA_N} y_{NA_N}\n\nOutput\n\nPrint the maximum possible number of honest persons among the N people.\n\nSample Input 1\n\n3\n1\n2 1\n1\n1 1\n1\n2 0\n\nSample Output 1\n\n2\n\nIf Person 1 and Person 2 are honest and Person 3 is unkind, we have two honest persons without inconsistencies, which is the maximum possible number of honest persons.\n\nSample Input 2\n\n3\n2\n2 1\n3 0\n2\n3 1\n1 0\n2\n1 1\n2 0\n\nSample Output 2\n\n0\n\nAssuming that one or more of them are honest immediately leads to a contradiction.\n\nSample Input 3\n\n2\n1\n2 0\n1\n1 0\n\nSample Output 3\n\n1", "sample_input": "3\n1\n2 1\n1\n1 1\n1\n2 0\n"}, "reference_outputs": ["2\n"], "source_document_id": "p02837", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere are N people numbered 1 to N. Each of them is either an honest person whose testimonies are always correct or an unkind person whose testimonies may be correct or not.\n\nPerson i gives A_i testimonies. The j-th testimony by Person i is represented by two integers x_{ij} and y_{ij}. If y_{ij} = 1, the testimony says Person x_{ij} is honest; if y_{ij} = 0, it says Person x_{ij} is unkind.\n\nHow many honest persons can be among those N people at most?\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 15\n\n0 \\leq A_i \\leq N - 1\n\n1 \\leq x_{ij} \\leq N\n\nx_{ij} \\neq i\n\nx_{ij_1} \\neq x_{ij_2} (j_1 \\neq j_2)\n\ny_{ij} = 0, 1\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1\nx_{11} y_{11}\nx_{12} y_{12}\n:\nx_{1A_1} y_{1A_1}\nA_2\nx_{21} y_{21}\nx_{22} y_{22}\n:\nx_{2A_2} y_{2A_2}\n:\nA_N\nx_{N1} y_{N1}\nx_{N2} y_{N2}\n:\nx_{NA_N} y_{NA_N}\n\nOutput\n\nPrint the maximum possible number of honest persons among the N people.\n\nSample Input 1\n\n3\n1\n2 1\n1\n1 1\n1\n2 0\n\nSample Output 1\n\n2\n\nIf Person 1 and Person 2 are honest and Person 3 is unkind, we have two honest persons without inconsistencies, which is the maximum possible number of honest persons.\n\nSample Input 2\n\n3\n2\n2 1\n3 0\n2\n3 1\n1 0\n2\n1 1\n2 0\n\nSample Output 2\n\n0\n\nAssuming that one or more of them are honest immediately leads to a contradiction.\n\nSample Input 3\n\n2\n1\n2 0\n1\n1 0\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": 464, "cpu_time_ms": 2, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s868473076", "group_id": "codeNet:p02839", "input_text": "#include<stdio.h>\n\nint abs(int x){\n  return x > 0 ? x : -x;\n}\n\nint main(){\n  int H, W;\n  scanf(\"%d %d\", &H, &W);\n  \n  int A[H][W];\n  int B[H][W];\n  for(int i = 0; i < H; i++)\n    for(int j = 0; j < W; j++)\n      scanf(\"%d\", &A[i][j]);\n  \n  for(int i = 0; i < H; i++)\n    for(int j = 0; j < W; j++)\n      scanf(\"%d\", &B[i][j]);\n  \n  int dp[H][W][30001];\n  for(int i = 0; i < H; i++)\n    for(int j = 0; j < W; j++)\n      for(int k = 0; k <= 30000; k++)\n        dp[i][j][k] = 0;\n  \n  dp[0][0][abs(A[0][0] - B[0][0])] = 1;\n  \n  for(int i = 0; i < H; i++){\n    for(int j = 0; j < W; j++){\n      for(int k = 0; k <= 30000; k++){\n        if(!dp[i][j][k]) continue;\n        if(i < H - 1){\n          dp[i + 1][j][k + abs(A[i + 1][j] - B[i + 1][j])] = 1;\n          dp[i + 1][j][abs(k - abs(A[i + 1][j] - B[i + 1][j]))] = 1;\n        }\n        if(j < W - 1){\n          dp[i][j + 1][k + abs(A[i][j + 1] - B[i][j + 1])] = 1;\n          dp[i][j + 1][abs(k - abs(A[i][j + 1] - B[i][j + 1]))] = 1;\n        }\n      }\n    }\n  }\n  \n  int b = 0;\n  for(int k = 0; k <= 30000; k++){\n    if(dp[H - 1][W - 1][k]){\n      b = k;\n      break;\n    }\n  }\n  \n  printf(\"%d\\n\", b);\n  \n  return 0;\n}", "language": "C", "metadata": {"date": 1579814550, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "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/C/s868473076.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s868473076", "user_id": "u788717734"}, "prompt_components": {"gold_output": "0\n", "input_to_evaluate": "#include<stdio.h>\n\nint abs(int x){\n  return x > 0 ? x : -x;\n}\n\nint main(){\n  int H, W;\n  scanf(\"%d %d\", &H, &W);\n  \n  int A[H][W];\n  int B[H][W];\n  for(int i = 0; i < H; i++)\n    for(int j = 0; j < W; j++)\n      scanf(\"%d\", &A[i][j]);\n  \n  for(int i = 0; i < H; i++)\n    for(int j = 0; j < W; j++)\n      scanf(\"%d\", &B[i][j]);\n  \n  int dp[H][W][30001];\n  for(int i = 0; i < H; i++)\n    for(int j = 0; j < W; j++)\n      for(int k = 0; k <= 30000; k++)\n        dp[i][j][k] = 0;\n  \n  dp[0][0][abs(A[0][0] - B[0][0])] = 1;\n  \n  for(int i = 0; i < H; i++){\n    for(int j = 0; j < W; j++){\n      for(int k = 0; k <= 30000; k++){\n        if(!dp[i][j][k]) continue;\n        if(i < H - 1){\n          dp[i + 1][j][k + abs(A[i + 1][j] - B[i + 1][j])] = 1;\n          dp[i + 1][j][abs(k - abs(A[i + 1][j] - B[i + 1][j]))] = 1;\n        }\n        if(j < W - 1){\n          dp[i][j + 1][k + abs(A[i][j + 1] - B[i][j + 1])] = 1;\n          dp[i][j + 1][abs(k - abs(A[i][j + 1] - B[i][j + 1]))] = 1;\n        }\n      }\n    }\n  }\n  \n  int b = 0;\n  for(int k = 0; k <= 30000; k++){\n    if(dp[H - 1][W - 1][k]){\n      b = k;\n      break;\n    }\n  }\n  \n  printf(\"%d\\n\", b);\n  \n  return 0;\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": 1164, "cpu_time_ms": 117, "memory_kb": 213888}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s687728668", "group_id": "codeNet:p02843", "input_text": "#include <stdio.h>\n\nint main(void) {\n\tint X;\n\tint i;\n\tif (scanf(\"%d\", &X) != 1) return 1;\n\tfor (i = 0; 101 * i <= X; i++) {\n\t\tint kitaeri = X - 100 * i;\n\t\tif(i <= kitaeri && kitaeri <= 5 * i) {\n\t\t\tputs(\"1\");\n\t\t\treturn 0;\n\t\t}\n\t}\n\tputs(\"0\");\n\treturn 0;\n}\n", "language": "C", "metadata": {"date": 1595823332, "filename_ext": "c", "original_language": "C (GCC 9.2.1)", "problem_description_relpath": "problem_descriptions/p02843.html", "problem_id": "p02843", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02843/input.txt", "sample_output_relpath": "derived/input_output/data/p02843/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02843/C/s687728668.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s687728668", "user_id": "u646118499"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "#include <stdio.h>\n\nint main(void) {\n\tint X;\n\tint i;\n\tif (scanf(\"%d\", &X) != 1) return 1;\n\tfor (i = 0; 101 * i <= X; i++) {\n\t\tint kitaeri = X - 100 * i;\n\t\tif(i <= kitaeri && kitaeri <= 5 * i) {\n\t\t\tputs(\"1\");\n\t\t\treturn 0;\n\t\t}\n\t}\n\tputs(\"0\");\n\treturn 0;\n}\n", "problem_context": "Score: 300 points\n\nProblem Statement\n\nAtCoder Mart sells 1000000 of each of the six items below:\n\nRiceballs, priced at 100 yen (the currency of Japan) each\n\nSandwiches, priced at 101 yen each\n\nCookies, priced at 102 yen each\n\nCakes, priced at 103 yen each\n\nCandies, priced at 104 yen each\n\nComputers, priced at 105 yen each\n\nTakahashi wants to buy some of them that cost exactly X yen in total.\nDetermine whether this is possible.\n\n(Ignore consumption tax.)\n\nConstraints\n\n1 \\leq X \\leq 100000\n\nX is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX\n\nOutput\n\nIf it is possible to buy some set of items that cost exactly X yen in total, print 1; otherwise, print 0.\n\nSample Input 1\n\n615\n\nSample Output 1\n\n1\n\nFor example, we can buy one of each kind of item, which will cost 100+101+102+103+104+105=615 yen in total.\n\nSample Input 2\n\n217\n\nSample Output 2\n\n0\n\nNo set of items costs 217 yen in total.", "sample_input": "615\n"}, "reference_outputs": ["1\n"], "source_document_id": "p02843", "source_text": "Score: 300 points\n\nProblem Statement\n\nAtCoder Mart sells 1000000 of each of the six items below:\n\nRiceballs, priced at 100 yen (the currency of Japan) each\n\nSandwiches, priced at 101 yen each\n\nCookies, priced at 102 yen each\n\nCakes, priced at 103 yen each\n\nCandies, priced at 104 yen each\n\nComputers, priced at 105 yen each\n\nTakahashi wants to buy some of them that cost exactly X yen in total.\nDetermine whether this is possible.\n\n(Ignore consumption tax.)\n\nConstraints\n\n1 \\leq X \\leq 100000\n\nX is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX\n\nOutput\n\nIf it is possible to buy some set of items that cost exactly X yen in total, print 1; otherwise, print 0.\n\nSample Input 1\n\n615\n\nSample Output 1\n\n1\n\nFor example, we can buy one of each kind of item, which will cost 100+101+102+103+104+105=615 yen in total.\n\nSample Input 2\n\n217\n\nSample Output 2\n\n0\n\nNo set of items costs 217 yen 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": 253, "cpu_time_ms": 4, "memory_kb": 1664}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s631339014", "group_id": "codeNet:p02848", "input_text": "#include <stdio.h>\n#include <stdlib.h>\n#include <string.h>\n\n\nint main() {\n    int N;\n    char mozi[10000];\n    scanf(\"%d\", &N);\n    scanf(\"%s\", mozi);\n    int n=strlen(mozi);\n\n    for (int i = 0; i < n; i++) {\n        int x=mozi[i]-'A';\n        x=(x+N)%26;\n        putchar(x+'A');}\n }\n", "language": "C", "metadata": {"date": 1587794710, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "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/C/s631339014.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s631339014", "user_id": "u924783770"}, "prompt_components": {"gold_output": "CDEZAB\n", "input_to_evaluate": "#include <stdio.h>\n#include <stdlib.h>\n#include <string.h>\n\n\nint main() {\n    int N;\n    char mozi[10000];\n    scanf(\"%d\", &N);\n    scanf(\"%s\", mozi);\n    int n=strlen(mozi);\n\n    for (int i = 0; i < n; i++) {\n        int x=mozi[i]-'A';\n        x=(x+N)%26;\n        putchar(x+'A');}\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": 285, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s715782749", "group_id": "codeNet:p02848", "input_text": "#include<stdio.h>\n\nint main(){\n  int N;\n  scanf(\"%d\\n\", &N);\n  \n  char s[1000];\n  scanf(\"%s\", s);\n  for(int i = 0; s[i] != '\\0'; i++){\n    if(s[i] + N >= 91){\n      s[i] -= 26;\n    }\n    printf(\"%c\", (char)(s[i] + N));\n  }\n  \n  return 0;\n}", "language": "C", "metadata": {"date": 1574651079, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "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/C/s715782749.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s715782749", "user_id": "u788717734"}, "prompt_components": {"gold_output": "CDEZAB\n", "input_to_evaluate": "#include<stdio.h>\n\nint main(){\n  int N;\n  scanf(\"%d\\n\", &N);\n  \n  char s[1000];\n  scanf(\"%s\", s);\n  for(int i = 0; s[i] != '\\0'; i++){\n    if(s[i] + N >= 91){\n      s[i] -= 26;\n    }\n    printf(\"%c\", (char)(s[i] + N));\n  }\n  \n  return 0;\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": 239, "cpu_time_ms": 98, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s658397873", "group_id": "codeNet:p02848", "input_text": "#include <stdio.h>\n#include <string.h>\n\nint main(void)\n{\n    int N;\n    char S[10001];\n    int i;\n    \n    \n    scanf(\"%d\", &N);\n    scanf(\"%s\", S);\n    \n    \n    for(i=0; i<strlen(S); i++)\n        printf(\"%c\", 65+((int)S[i]-65+N)%26);\n    \n    printf(\"\\n\");\n    \n    \n    //system(\"pause\");\n    \n    return 0;\n}", "language": "C", "metadata": {"date": 1574649701, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "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/C/s658397873.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s658397873", "user_id": "u154944817"}, "prompt_components": {"gold_output": "CDEZAB\n", "input_to_evaluate": "#include <stdio.h>\n#include <string.h>\n\nint main(void)\n{\n    int N;\n    char S[10001];\n    int i;\n    \n    \n    scanf(\"%d\", &N);\n    scanf(\"%s\", S);\n    \n    \n    for(i=0; i<strlen(S); i++)\n        printf(\"%c\", 65+((int)S[i]-65+N)%26);\n    \n    printf(\"\\n\");\n    \n    \n    //system(\"pause\");\n    \n    return 0;\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": 312, "cpu_time_ms": 18, "memory_kb": 256}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s945450472", "group_id": "codeNet:p02853", "input_text": "#include<stdio.h>\nint main(){\n    int X,Y,sum;\n    scanf(\"%d %d\",&X,&Y);\n\n    if(X==3){\n        sum+=100000;\n    }\n    if(Y==3){\n        sum+=100000;\n    }\n    if(X==2){\n        sum+=200000;\n    }\n    if(Y==2){\n        sum+=200000;\n    }\n    if(X==1){\n        sum+=300000;\n    }\n    if(Y==1){\n        sum+=300000;\n    }\n    if(sum==600000){\n        sum+=400000;\n    }\n\n    printf(\"%d\\n\",sum);\n}", "language": "C", "metadata": {"date": 1574561550, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "problem_description_relpath": "problem_descriptions/p02853.html", "problem_id": "p02853", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02853/input.txt", "sample_output_relpath": "derived/input_output/data/p02853/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02853/C/s945450472.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s945450472", "user_id": "u303722032"}, "prompt_components": {"gold_output": "1000000\n", "input_to_evaluate": "#include<stdio.h>\nint main(){\n    int X,Y,sum;\n    scanf(\"%d %d\",&X,&Y);\n\n    if(X==3){\n        sum+=100000;\n    }\n    if(Y==3){\n        sum+=100000;\n    }\n    if(X==2){\n        sum+=200000;\n    }\n    if(Y==2){\n        sum+=200000;\n    }\n    if(X==1){\n        sum+=300000;\n    }\n    if(Y==1){\n        sum+=300000;\n    }\n    if(sum==600000){\n        sum+=400000;\n    }\n\n    printf(\"%d\\n\",sum);\n}", "problem_context": "Score: 100 points\n\nProblem Statement\n\nWe held two competitions: Coding Contest and Robot Maneuver.\n\nIn each competition, the contestants taking the 3-rd, 2-nd, and 1-st places receive 100000, 200000, and 300000 yen (the currency of Japan), respectively. Furthermore, a contestant taking the first place in both competitions receives an additional 400000 yen.\n\nDISCO-Kun took the X-th place in Coding Contest and the Y-th place in Robot Maneuver.\nFind the total amount of money he earned.\n\nConstraints\n\n1 \\leq X \\leq 205\n\n1 \\leq Y \\leq 205\n\nX and Y are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX Y\n\nOutput\n\nPrint the amount of money DISCO-Kun earned, as an integer.\n\nSample Input 1\n\n1 1\n\nSample Output 1\n\n1000000\n\nIn this case, he earned 300000 yen in Coding Contest and another 300000 yen in Robot Maneuver. Furthermore, as he won both competitions, he got an additional 400000 yen.\nIn total, he made 300000 + 300000 + 400000 = 1000000 yen.\n\nSample Input 2\n\n3 101\n\nSample Output 2\n\n100000\n\nIn this case, he earned 100000 yen in Coding Contest.\n\nSample Input 3\n\n4 4\n\nSample Output 3\n\n0\n\nIn this case, unfortunately, he was the highest-ranked contestant without prize money in both competitions.", "sample_input": "1 1\n"}, "reference_outputs": ["1000000\n"], "source_document_id": "p02853", "source_text": "Score: 100 points\n\nProblem Statement\n\nWe held two competitions: Coding Contest and Robot Maneuver.\n\nIn each competition, the contestants taking the 3-rd, 2-nd, and 1-st places receive 100000, 200000, and 300000 yen (the currency of Japan), respectively. Furthermore, a contestant taking the first place in both competitions receives an additional 400000 yen.\n\nDISCO-Kun took the X-th place in Coding Contest and the Y-th place in Robot Maneuver.\nFind the total amount of money he earned.\n\nConstraints\n\n1 \\leq X \\leq 205\n\n1 \\leq Y \\leq 205\n\nX and Y are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX Y\n\nOutput\n\nPrint the amount of money DISCO-Kun earned, as an integer.\n\nSample Input 1\n\n1 1\n\nSample Output 1\n\n1000000\n\nIn this case, he earned 300000 yen in Coding Contest and another 300000 yen in Robot Maneuver. Furthermore, as he won both competitions, he got an additional 400000 yen.\nIn total, he made 300000 + 300000 + 400000 = 1000000 yen.\n\nSample Input 2\n\n3 101\n\nSample Output 2\n\n100000\n\nIn this case, he earned 100000 yen in Coding Contest.\n\nSample Input 3\n\n4 4\n\nSample Output 3\n\n0\n\nIn this case, unfortunately, he was the highest-ranked contestant without prize money in both competitions.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 394, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s815580829", "group_id": "codeNet:p02853", "input_text": "int main(){\n\n    int X,Y,mon=0;\n    scanf(\"%d %d\",&X,&Y);\n\n    if(X == 1) mon += 300000;\n    else if(X == 2) mon += 2000000;\n    else if(X == 3) mon += 1000000;\n\n    if(Y == 1) mon += 300000;\n    else if(Y == 2) mon += 2000000;\n    else if(Y == 3) mon += 1000000;\n\n    if (X == 1 && Y == 1) mon += 400000;\n\n    printf(\"%d\",mon);\n    return 0;\n}", "language": "C", "metadata": {"date": 1574561102, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "problem_description_relpath": "problem_descriptions/p02853.html", "problem_id": "p02853", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02853/input.txt", "sample_output_relpath": "derived/input_output/data/p02853/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02853/C/s815580829.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s815580829", "user_id": "u503834656"}, "prompt_components": {"gold_output": "1000000\n", "input_to_evaluate": "int main(){\n\n    int X,Y,mon=0;\n    scanf(\"%d %d\",&X,&Y);\n\n    if(X == 1) mon += 300000;\n    else if(X == 2) mon += 2000000;\n    else if(X == 3) mon += 1000000;\n\n    if(Y == 1) mon += 300000;\n    else if(Y == 2) mon += 2000000;\n    else if(Y == 3) mon += 1000000;\n\n    if (X == 1 && Y == 1) mon += 400000;\n\n    printf(\"%d\",mon);\n    return 0;\n}", "problem_context": "Score: 100 points\n\nProblem Statement\n\nWe held two competitions: Coding Contest and Robot Maneuver.\n\nIn each competition, the contestants taking the 3-rd, 2-nd, and 1-st places receive 100000, 200000, and 300000 yen (the currency of Japan), respectively. Furthermore, a contestant taking the first place in both competitions receives an additional 400000 yen.\n\nDISCO-Kun took the X-th place in Coding Contest and the Y-th place in Robot Maneuver.\nFind the total amount of money he earned.\n\nConstraints\n\n1 \\leq X \\leq 205\n\n1 \\leq Y \\leq 205\n\nX and Y are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX Y\n\nOutput\n\nPrint the amount of money DISCO-Kun earned, as an integer.\n\nSample Input 1\n\n1 1\n\nSample Output 1\n\n1000000\n\nIn this case, he earned 300000 yen in Coding Contest and another 300000 yen in Robot Maneuver. Furthermore, as he won both competitions, he got an additional 400000 yen.\nIn total, he made 300000 + 300000 + 400000 = 1000000 yen.\n\nSample Input 2\n\n3 101\n\nSample Output 2\n\n100000\n\nIn this case, he earned 100000 yen in Coding Contest.\n\nSample Input 3\n\n4 4\n\nSample Output 3\n\n0\n\nIn this case, unfortunately, he was the highest-ranked contestant without prize money in both competitions.", "sample_input": "1 1\n"}, "reference_outputs": ["1000000\n"], "source_document_id": "p02853", "source_text": "Score: 100 points\n\nProblem Statement\n\nWe held two competitions: Coding Contest and Robot Maneuver.\n\nIn each competition, the contestants taking the 3-rd, 2-nd, and 1-st places receive 100000, 200000, and 300000 yen (the currency of Japan), respectively. Furthermore, a contestant taking the first place in both competitions receives an additional 400000 yen.\n\nDISCO-Kun took the X-th place in Coding Contest and the Y-th place in Robot Maneuver.\nFind the total amount of money he earned.\n\nConstraints\n\n1 \\leq X \\leq 205\n\n1 \\leq Y \\leq 205\n\nX and Y are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX Y\n\nOutput\n\nPrint the amount of money DISCO-Kun earned, as an integer.\n\nSample Input 1\n\n1 1\n\nSample Output 1\n\n1000000\n\nIn this case, he earned 300000 yen in Coding Contest and another 300000 yen in Robot Maneuver. Furthermore, as he won both competitions, he got an additional 400000 yen.\nIn total, he made 300000 + 300000 + 400000 = 1000000 yen.\n\nSample Input 2\n\n3 101\n\nSample Output 2\n\n100000\n\nIn this case, he earned 100000 yen in Coding Contest.\n\nSample Input 3\n\n4 4\n\nSample Output 3\n\n0\n\nIn this case, unfortunately, he was the highest-ranked contestant without prize money in both competitions.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s271071894", "group_id": "codeNet:p02853", "input_text": "#include<stdio.h>\nint main()\n{\n\tint x, y;\n\tscanf(\"%d %d\", &x, &y);\n\tint ans = 0;\n\tif (x <= 3)\n\t\tans += 100000 * (4 - x);\n\tif (y <= 3)\n\t\tans += 100000 * (4 - y);\n\tif (x == y && x == 1)\n\t\tans += 400000;\n\tprintf(\"%d\\n\", ans);\n\treturn 0;\n}", "language": "C", "metadata": {"date": 1574560990, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "problem_description_relpath": "problem_descriptions/p02853.html", "problem_id": "p02853", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02853/input.txt", "sample_output_relpath": "derived/input_output/data/p02853/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02853/C/s271071894.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s271071894", "user_id": "u600300412"}, "prompt_components": {"gold_output": "1000000\n", "input_to_evaluate": "#include<stdio.h>\nint main()\n{\n\tint x, y;\n\tscanf(\"%d %d\", &x, &y);\n\tint ans = 0;\n\tif (x <= 3)\n\t\tans += 100000 * (4 - x);\n\tif (y <= 3)\n\t\tans += 100000 * (4 - y);\n\tif (x == y && x == 1)\n\t\tans += 400000;\n\tprintf(\"%d\\n\", ans);\n\treturn 0;\n}", "problem_context": "Score: 100 points\n\nProblem Statement\n\nWe held two competitions: Coding Contest and Robot Maneuver.\n\nIn each competition, the contestants taking the 3-rd, 2-nd, and 1-st places receive 100000, 200000, and 300000 yen (the currency of Japan), respectively. Furthermore, a contestant taking the first place in both competitions receives an additional 400000 yen.\n\nDISCO-Kun took the X-th place in Coding Contest and the Y-th place in Robot Maneuver.\nFind the total amount of money he earned.\n\nConstraints\n\n1 \\leq X \\leq 205\n\n1 \\leq Y \\leq 205\n\nX and Y are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX Y\n\nOutput\n\nPrint the amount of money DISCO-Kun earned, as an integer.\n\nSample Input 1\n\n1 1\n\nSample Output 1\n\n1000000\n\nIn this case, he earned 300000 yen in Coding Contest and another 300000 yen in Robot Maneuver. Furthermore, as he won both competitions, he got an additional 400000 yen.\nIn total, he made 300000 + 300000 + 400000 = 1000000 yen.\n\nSample Input 2\n\n3 101\n\nSample Output 2\n\n100000\n\nIn this case, he earned 100000 yen in Coding Contest.\n\nSample Input 3\n\n4 4\n\nSample Output 3\n\n0\n\nIn this case, unfortunately, he was the highest-ranked contestant without prize money in both competitions.", "sample_input": "1 1\n"}, "reference_outputs": ["1000000\n"], "source_document_id": "p02853", "source_text": "Score: 100 points\n\nProblem Statement\n\nWe held two competitions: Coding Contest and Robot Maneuver.\n\nIn each competition, the contestants taking the 3-rd, 2-nd, and 1-st places receive 100000, 200000, and 300000 yen (the currency of Japan), respectively. Furthermore, a contestant taking the first place in both competitions receives an additional 400000 yen.\n\nDISCO-Kun took the X-th place in Coding Contest and the Y-th place in Robot Maneuver.\nFind the total amount of money he earned.\n\nConstraints\n\n1 \\leq X \\leq 205\n\n1 \\leq Y \\leq 205\n\nX and Y are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX Y\n\nOutput\n\nPrint the amount of money DISCO-Kun earned, as an integer.\n\nSample Input 1\n\n1 1\n\nSample Output 1\n\n1000000\n\nIn this case, he earned 300000 yen in Coding Contest and another 300000 yen in Robot Maneuver. Furthermore, as he won both competitions, he got an additional 400000 yen.\nIn total, he made 300000 + 300000 + 400000 = 1000000 yen.\n\nSample Input 2\n\n3 101\n\nSample Output 2\n\n100000\n\nIn this case, he earned 100000 yen in Coding Contest.\n\nSample Input 3\n\n4 4\n\nSample Output 3\n\n0\n\nIn this case, unfortunately, he was the highest-ranked contestant without prize money in both competitions.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 235, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s196932821", "group_id": "codeNet:p02856", "input_text": "#include <stdio.h>\n\nint main(void){\n    int m;\n    scanf(\"%d\", &m);\n    long long int ans = 0;\n    long long int i, d, c;\n    long long int sum = 0;\n    for(i = 0; i < m; i++){\n        scanf(\"%lld%lld\", &d, &c);\n        sum += c * d;\n        ans += c;\n    }\n    ans--;\n    \n    ans += sum / 9;\n    if(sum % 9 == 0){\n        ans--;\n    }\n    printf(\"%lld\\n\", ans);\n}", "language": "C", "metadata": {"date": 1597030553, "filename_ext": "c", "original_language": "C (GCC 9.2.1)", "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/C/s196932821.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s196932821", "user_id": "u072610327"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "#include <stdio.h>\n\nint main(void){\n    int m;\n    scanf(\"%d\", &m);\n    long long int ans = 0;\n    long long int i, d, c;\n    long long int sum = 0;\n    for(i = 0; i < m; i++){\n        scanf(\"%lld%lld\", &d, &c);\n        sum += c * d;\n        ans += c;\n    }\n    ans--;\n    \n    ans += sum / 9;\n    if(sum % 9 == 0){\n        ans--;\n    }\n    printf(\"%lld\\n\", ans);\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": 365, "cpu_time_ms": 44, "memory_kb": 1692}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s335973879", "group_id": "codeNet:p02860", "input_text": "#include<stdio.h>\n\nint main(void)\n{\n  int n,i;\n  char s[110];\n  scanf(\"%d%s\",&n,s);\n  if(n%2==1){\n    printf(\"No\\n\");\n    return -1;\n  }\n  for(i=0;i<n/2;i++)\n    if(s[i]!=s[n/2+i]){\n      printf(\"No\\n\");\n      return -1;\n    }\n  printf(\"Yes\\n\");\n  return 0;\n}\n", "language": "C", "metadata": {"date": 1588005050, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "problem_description_relpath": "problem_descriptions/p02860.html", "problem_id": "p02860", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02860/input.txt", "sample_output_relpath": "derived/input_output/data/p02860/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02860/C/s335973879.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s335973879", "user_id": "u803101149"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "#include<stdio.h>\n\nint main(void)\n{\n  int n,i;\n  char s[110];\n  scanf(\"%d%s\",&n,s);\n  if(n%2==1){\n    printf(\"No\\n\");\n    return -1;\n  }\n  for(i=0;i<n/2;i++)\n    if(s[i]!=s[n/2+i]){\n      printf(\"No\\n\");\n      return -1;\n    }\n  printf(\"Yes\\n\");\n  return 0;\n}\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nGiven are a positive integer N and a string S of length N consisting of lowercase English letters.\n\nDetermine whether the string is a concatenation of two copies of some string.\nThat is, determine whether there is a string T such that S = T + T.\n\nConstraints\n\n1 \\leq N \\leq 100\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\nIf S is a concatenation of two copies of some string, print Yes; otherwise, print No.\n\nSample Input 1\n\n6\nabcabc\n\nSample Output 1\n\nYes\n\nLet T = abc, and S = T + T.\n\nSample Input 2\n\n6\nabcadc\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n1\nz\n\nSample Output 3\n\nNo", "sample_input": "6\nabcabc\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p02860", "source_text": "Score : 200 points\n\nProblem Statement\n\nGiven are a positive integer N and a string S of length N consisting of lowercase English letters.\n\nDetermine whether the string is a concatenation of two copies of some string.\nThat is, determine whether there is a string T such that S = T + T.\n\nConstraints\n\n1 \\leq N \\leq 100\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\nIf S is a concatenation of two copies of some string, print Yes; otherwise, print No.\n\nSample Input 1\n\n6\nabcabc\n\nSample Output 1\n\nYes\n\nLet T = abc, and S = T + T.\n\nSample Input 2\n\n6\nabcadc\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n1\nz\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": 260, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s184163049", "group_id": "codeNet:p02860", "input_text": "#include<stdio.h>\n#include<string.h>\n\nint main(){\n  int n,i;\n  \n  scanf(\"%d\\n\",&n);\n  if(n%2==1){\n  printf(\"No\");\n    return 0;\n  }\n  char str1[n/2];\n  char str2[n/2];\n  for(i=0;i<n/2;i++){\n  scanf(\"%c\",&str1[i]);\n  }\n  for(i=0;i<n/2;i++){\n  scanf(\"%c\",&str2[i]);\n  }\n  \n  if(strncmp(str1,str2,n/2)==0){\n  printf(\"Yes\");\n  return 0;\n  }else{\n  printf(\"No\\n\");\n  }\n  \n  return 0;\n}", "language": "C", "metadata": {"date": 1583785343, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "problem_description_relpath": "problem_descriptions/p02860.html", "problem_id": "p02860", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02860/input.txt", "sample_output_relpath": "derived/input_output/data/p02860/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02860/C/s184163049.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s184163049", "user_id": "u990655988"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "#include<stdio.h>\n#include<string.h>\n\nint main(){\n  int n,i;\n  \n  scanf(\"%d\\n\",&n);\n  if(n%2==1){\n  printf(\"No\");\n    return 0;\n  }\n  char str1[n/2];\n  char str2[n/2];\n  for(i=0;i<n/2;i++){\n  scanf(\"%c\",&str1[i]);\n  }\n  for(i=0;i<n/2;i++){\n  scanf(\"%c\",&str2[i]);\n  }\n  \n  if(strncmp(str1,str2,n/2)==0){\n  printf(\"Yes\");\n  return 0;\n  }else{\n  printf(\"No\\n\");\n  }\n  \n  return 0;\n}", "problem_context": "Score : 200 points\n\nProblem Statement\n\nGiven are a positive integer N and a string S of length N consisting of lowercase English letters.\n\nDetermine whether the string is a concatenation of two copies of some string.\nThat is, determine whether there is a string T such that S = T + T.\n\nConstraints\n\n1 \\leq N \\leq 100\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\nIf S is a concatenation of two copies of some string, print Yes; otherwise, print No.\n\nSample Input 1\n\n6\nabcabc\n\nSample Output 1\n\nYes\n\nLet T = abc, and S = T + T.\n\nSample Input 2\n\n6\nabcadc\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n1\nz\n\nSample Output 3\n\nNo", "sample_input": "6\nabcabc\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p02860", "source_text": "Score : 200 points\n\nProblem Statement\n\nGiven are a positive integer N and a string S of length N consisting of lowercase English letters.\n\nDetermine whether the string is a concatenation of two copies of some string.\nThat is, determine whether there is a string T such that S = T + T.\n\nConstraints\n\n1 \\leq N \\leq 100\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\nIf S is a concatenation of two copies of some string, print Yes; otherwise, print No.\n\nSample Input 1\n\n6\nabcabc\n\nSample Output 1\n\nYes\n\nLet T = abc, and S = T + T.\n\nSample Input 2\n\n6\nabcadc\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n1\nz\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": 380, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s509365866", "group_id": "codeNet:p02860", "input_text": "#include <stdio.h>\n#include <stdbool.h>\n\nint main() {\n    bool result = true;\n    int n, half; char s[101];\n    scanf(\"%d%100s\", &n, s);\n    if (n & 1)result = false;\n    half = n / 2;\n    for (int i = 0; i < half && result; ++i)\n        if (s[i] != s[half + i])result = false;\n    puts(result ? \"Yes\" : \"No\");\n}\n", "language": "C", "metadata": {"date": 1574033809, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "problem_description_relpath": "problem_descriptions/p02860.html", "problem_id": "p02860", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02860/input.txt", "sample_output_relpath": "derived/input_output/data/p02860/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02860/C/s509365866.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s509365866", "user_id": "u967915578"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "#include <stdio.h>\n#include <stdbool.h>\n\nint main() {\n    bool result = true;\n    int n, half; char s[101];\n    scanf(\"%d%100s\", &n, s);\n    if (n & 1)result = false;\n    half = n / 2;\n    for (int i = 0; i < half && result; ++i)\n        if (s[i] != s[half + i])result = false;\n    puts(result ? \"Yes\" : \"No\");\n}\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nGiven are a positive integer N and a string S of length N consisting of lowercase English letters.\n\nDetermine whether the string is a concatenation of two copies of some string.\nThat is, determine whether there is a string T such that S = T + T.\n\nConstraints\n\n1 \\leq N \\leq 100\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\nIf S is a concatenation of two copies of some string, print Yes; otherwise, print No.\n\nSample Input 1\n\n6\nabcabc\n\nSample Output 1\n\nYes\n\nLet T = abc, and S = T + T.\n\nSample Input 2\n\n6\nabcadc\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n1\nz\n\nSample Output 3\n\nNo", "sample_input": "6\nabcabc\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p02860", "source_text": "Score : 200 points\n\nProblem Statement\n\nGiven are a positive integer N and a string S of length N consisting of lowercase English letters.\n\nDetermine whether the string is a concatenation of two copies of some string.\nThat is, determine whether there is a string T such that S = T + T.\n\nConstraints\n\n1 \\leq N \\leq 100\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\nIf S is a concatenation of two copies of some string, print Yes; otherwise, print No.\n\nSample Input 1\n\n6\nabcabc\n\nSample Output 1\n\nYes\n\nLet T = abc, and S = T + T.\n\nSample Input 2\n\n6\nabcadc\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n1\nz\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": 313, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s698863692", "group_id": "codeNet:p02860", "input_text": "#include<stdio.h>\n#include<string.h>\nmain()\n{\n  int N;\n  char S [N];\n  char T [50];\n  char TT[100];\n  scanf(\"%d\",&N);\n  scanf(\"%s\",S);\n  if(N%2==0){\n    strncpy(T,S,N/2);\n    T[N/2]='\\0';\n      strcat(TT,T);\n      if(S==TT){\n    printf(\"Yes\");}\n    else{\n      printf(\"No\");\n  }\n  }\n  else{\n    printf(\"No\");\n  }\n}\n    \n  \n", "language": "C", "metadata": {"date": 1573962629, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "problem_description_relpath": "problem_descriptions/p02860.html", "problem_id": "p02860", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02860/input.txt", "sample_output_relpath": "derived/input_output/data/p02860/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02860/C/s698863692.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s698863692", "user_id": "u550383197"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "#include<stdio.h>\n#include<string.h>\nmain()\n{\n  int N;\n  char S [N];\n  char T [50];\n  char TT[100];\n  scanf(\"%d\",&N);\n  scanf(\"%s\",S);\n  if(N%2==0){\n    strncpy(T,S,N/2);\n    T[N/2]='\\0';\n      strcat(TT,T);\n      if(S==TT){\n    printf(\"Yes\");}\n    else{\n      printf(\"No\");\n  }\n  }\n  else{\n    printf(\"No\");\n  }\n}\n    \n  \n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nGiven are a positive integer N and a string S of length N consisting of lowercase English letters.\n\nDetermine whether the string is a concatenation of two copies of some string.\nThat is, determine whether there is a string T such that S = T + T.\n\nConstraints\n\n1 \\leq N \\leq 100\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\nIf S is a concatenation of two copies of some string, print Yes; otherwise, print No.\n\nSample Input 1\n\n6\nabcabc\n\nSample Output 1\n\nYes\n\nLet T = abc, and S = T + T.\n\nSample Input 2\n\n6\nabcadc\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n1\nz\n\nSample Output 3\n\nNo", "sample_input": "6\nabcabc\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p02860", "source_text": "Score : 200 points\n\nProblem Statement\n\nGiven are a positive integer N and a string S of length N consisting of lowercase English letters.\n\nDetermine whether the string is a concatenation of two copies of some string.\nThat is, determine whether there is a string T such that S = T + T.\n\nConstraints\n\n1 \\leq N \\leq 100\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\nIf S is a concatenation of two copies of some string, print Yes; otherwise, print No.\n\nSample Input 1\n\n6\nabcabc\n\nSample Output 1\n\nYes\n\nLet T = abc, and S = T + T.\n\nSample Input 2\n\n6\nabcadc\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n1\nz\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": 323, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s839496789", "group_id": "codeNet:p02860", "input_text": "#include <stdio.h>\n#include <math.h>\n#include <string.h>\n#define pai 3.1415926535\n\nint main(void) {\n\tint N;\n\tscanf(\"%d\", &N);\n\tchar S[101];\n\tscanf(\"%s\", S);\n\tint count = 0;\n\tfor (int i = 0; i <= N; i++) {\n\t\tif (S[i] == S[N / 2 + i]) {\n\t\t\tcount++;\n\t\t}\n\t}\n\t\n\t\n\tif(count==N/2){\n\t\tprintf(\"Yes\");\n\t}\n\telse {\n\t\tprintf(\"No\");\n\t}\n\n\treturn 0;\n}\n\t", "language": "C", "metadata": {"date": 1573961132, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "problem_description_relpath": "problem_descriptions/p02860.html", "problem_id": "p02860", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02860/input.txt", "sample_output_relpath": "derived/input_output/data/p02860/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02860/C/s839496789.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s839496789", "user_id": "u276980836"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "#include <stdio.h>\n#include <math.h>\n#include <string.h>\n#define pai 3.1415926535\n\nint main(void) {\n\tint N;\n\tscanf(\"%d\", &N);\n\tchar S[101];\n\tscanf(\"%s\", S);\n\tint count = 0;\n\tfor (int i = 0; i <= N; i++) {\n\t\tif (S[i] == S[N / 2 + i]) {\n\t\t\tcount++;\n\t\t}\n\t}\n\t\n\t\n\tif(count==N/2){\n\t\tprintf(\"Yes\");\n\t}\n\telse {\n\t\tprintf(\"No\");\n\t}\n\n\treturn 0;\n}\n\t", "problem_context": "Score : 200 points\n\nProblem Statement\n\nGiven are a positive integer N and a string S of length N consisting of lowercase English letters.\n\nDetermine whether the string is a concatenation of two copies of some string.\nThat is, determine whether there is a string T such that S = T + T.\n\nConstraints\n\n1 \\leq N \\leq 100\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\nIf S is a concatenation of two copies of some string, print Yes; otherwise, print No.\n\nSample Input 1\n\n6\nabcabc\n\nSample Output 1\n\nYes\n\nLet T = abc, and S = T + T.\n\nSample Input 2\n\n6\nabcadc\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n1\nz\n\nSample Output 3\n\nNo", "sample_input": "6\nabcabc\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p02860", "source_text": "Score : 200 points\n\nProblem Statement\n\nGiven are a positive integer N and a string S of length N consisting of lowercase English letters.\n\nDetermine whether the string is a concatenation of two copies of some string.\nThat is, determine whether there is a string T such that S = T + T.\n\nConstraints\n\n1 \\leq N \\leq 100\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\nIf S is a concatenation of two copies of some string, print Yes; otherwise, print No.\n\nSample Input 1\n\n6\nabcabc\n\nSample Output 1\n\nYes\n\nLet T = abc, and S = T + T.\n\nSample Input 2\n\n6\nabcadc\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n1\nz\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": 337, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s465340978", "group_id": "codeNet:p02861", "input_text": "#include <stdio.h>\n#include <math.h>\n#include <string.h>\n#define pai 3.1415926535\n\nint main(void) {\n\t\n\tint N;\n\tint x[8], y[8];\n\tscanf(\"%d\", &N);\n\tfor (int i = 0; i < N; i++) {\n\t\tscanf(\"%d%d\", &x[i], &y[i]);\n\t}\n\tdouble avg=0;\n\tint sum1 = 1;\n\tint sum2 = 1;\n\tfor (int i = N; i > 1; i--) {\n\t\tsum1 *= i;\n\t}\n\tfor (int i = N - 1; i > 1; i--) {\n\t\tsum2 *= i;\n\t}\n\t\n\tfor (int i = 0; i < N; i++) {\n\t\tfor (int j =i+1; j < N; j++) {\n\t\t\tavg += (sqrt((double)(x[j] - x[i])*(x[j] - x[i])+(y[j] - y[i])*(y[j] - y[i])))*2*sum2;\n\t\t}\n\t} \n\tprintf(\"%f\", avg/sum1);\n\n\treturn 0;\n}\n", "language": "C", "metadata": {"date": 1573960815, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "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/C/s465340978.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s465340978", "user_id": "u276980836"}, "prompt_components": {"gold_output": "2.2761423749\n", "input_to_evaluate": "#include <stdio.h>\n#include <math.h>\n#include <string.h>\n#define pai 3.1415926535\n\nint main(void) {\n\t\n\tint N;\n\tint x[8], y[8];\n\tscanf(\"%d\", &N);\n\tfor (int i = 0; i < N; i++) {\n\t\tscanf(\"%d%d\", &x[i], &y[i]);\n\t}\n\tdouble avg=0;\n\tint sum1 = 1;\n\tint sum2 = 1;\n\tfor (int i = N; i > 1; i--) {\n\t\tsum1 *= i;\n\t}\n\tfor (int i = N - 1; i > 1; i--) {\n\t\tsum2 *= i;\n\t}\n\t\n\tfor (int i = 0; i < N; i++) {\n\t\tfor (int j =i+1; j < N; j++) {\n\t\t\tavg += (sqrt((double)(x[j] - x[i])*(x[j] - x[i])+(y[j] - y[i])*(y[j] - y[i])))*2*sum2;\n\t\t}\n\t} \n\tprintf(\"%f\", avg/sum1);\n\n\treturn 0;\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": 556, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s755301336", "group_id": "codeNet:p02865", "input_text": "#include<stdio.h>\nint main(){\n    int n;\n    scanf(\"%d\",&n);\n    int ans = 0;\n    for(int i = 1; i < (n + 1) / 2; i++)\n        if(i != n - i)\n            ans ++;\n    printf(\"%d\\n\",ans);\n    return 0;\n}", "language": "C", "metadata": {"date": 1588538555, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "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/C/s755301336.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s755301336", "user_id": "u188486233"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "#include<stdio.h>\nint main(){\n    int n;\n    scanf(\"%d\",&n);\n    int ans = 0;\n    for(int i = 1; i < (n + 1) / 2; i++)\n        if(i != n - i)\n            ans ++;\n    printf(\"%d\\n\",ans);\n    return 0;\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": 201, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s652368694", "group_id": "codeNet:p02866", "input_text": "#include <stdio.h>                                                                                                 \n                                                                                                                   \nint main() {                                                                                                       \n    long long int n, ans = 1;                                                                                      \n    scanf(\"%lld\", &n);                                                                                             \n    long long int d[n];                                                                                            \n    for (long long int i = 0; i < n; i++){                                                                         \n        scanf(\"%lld\", &d[i]);                                                                                      \n        ans*=(d[i]?d[i]:1)%998244353;                                                                              \n    }                                                                                                              \n    printf(\"%lld\\n\", ans==1?0:ans%998244353);                                                                      \n}\n", "language": "C", "metadata": {"date": 1573356621, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "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/C/s652368694.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s652368694", "user_id": "u473913931"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "#include <stdio.h>                                                                                                 \n                                                                                                                   \nint main() {                                                                                                       \n    long long int n, ans = 1;                                                                                      \n    scanf(\"%lld\", &n);                                                                                             \n    long long int d[n];                                                                                            \n    for (long long int i = 0; i < n; i++){                                                                         \n        scanf(\"%lld\", &d[i]);                                                                                      \n        ans*=(d[i]?d[i]:1)%998244353;                                                                              \n    }                                                                                                              \n    printf(\"%lld\\n\", ans==1?0:ans%998244353);                                                                      \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": 1278, "cpu_time_ms": 11, "memory_kb": 896}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s305574610", "group_id": "codeNet:p02880", "input_text": "/* ex3-3\n   Sagzar1993  */\n\n\n#include <stdio.h>\n\nint main(void) {\n    //表す整数と基数を定義\n    int num;\n\n    //入力を受け取る\n    scanf(\"%d\", &num);\n\n    //numが各数字で割り切れ、かつその商が１から９の間であるとき、Yesを表示\n    if(num % 1 == 0 && num / 1 <= 9){\n        printf(\"Yes\\n\");\n    }else if(num % 2 == 0 && num / 2 <= 9){\n        printf(\"Yes\\n\");\n    }else if(num % 3 == 0 && num / 3 <= 9){\n        printf(\"Yes\\n\");\n    }else if(num % 4 == 0 && num / 4 <= 9){\n        printf(\"Yes\\n\");\n    }else if(num % 5 == 0 && num / 5 <= 9){\n        printf(\"Yes\\n\");\n    }else if(num % 6 == 0 && num / 6 <= 9){\n        printf(\"Yes\\n\");\n    }else if(num % 7 == 0 && num / 7 <= 9){\n        printf(\"Yes\\n\");\n    }else if(num % 8 == 0 && num / 8 <= 9){\n        printf(\"Yes\\n\");\n    }else if(num % 9 == 0 && num / 9 <= 9){\n        printf(\"Yes\\n\");\n    }else{\n        printf(\"No\\n\"); //どれにも当てはまらなかった場合はNoを表示\n    }\n    return 0;\n}", "language": "C", "metadata": {"date": 1590092694, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "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/C/s305574610.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s305574610", "user_id": "u574211979"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "/* ex3-3\n   Sagzar1993  */\n\n\n#include <stdio.h>\n\nint main(void) {\n    //表す整数と基数を定義\n    int num;\n\n    //入力を受け取る\n    scanf(\"%d\", &num);\n\n    //numが各数字で割り切れ、かつその商が１から９の間であるとき、Yesを表示\n    if(num % 1 == 0 && num / 1 <= 9){\n        printf(\"Yes\\n\");\n    }else if(num % 2 == 0 && num / 2 <= 9){\n        printf(\"Yes\\n\");\n    }else if(num % 3 == 0 && num / 3 <= 9){\n        printf(\"Yes\\n\");\n    }else if(num % 4 == 0 && num / 4 <= 9){\n        printf(\"Yes\\n\");\n    }else if(num % 5 == 0 && num / 5 <= 9){\n        printf(\"Yes\\n\");\n    }else if(num % 6 == 0 && num / 6 <= 9){\n        printf(\"Yes\\n\");\n    }else if(num % 7 == 0 && num / 7 <= 9){\n        printf(\"Yes\\n\");\n    }else if(num % 8 == 0 && num / 8 <= 9){\n        printf(\"Yes\\n\");\n    }else if(num % 9 == 0 && num / 9 <= 9){\n        printf(\"Yes\\n\");\n    }else{\n        printf(\"No\\n\"); //どれにも当てはまらなかった場合はNoを表示\n    }\n    return 0;\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": 1008, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s755202314", "group_id": "codeNet:p02880", "input_text": "/* ex3_4\n        fmuacshai */\n \n#include<stdio.h>\n \nint main(void){\n    //整数number、割る数div_number、商quotient\n    int number,div_number,quotient;\n    //numberの入力\n    scanf(\"%d\",&number);\n    //div_numberの初期設定\n    div_number=9;\n    //余りが出なくなるまで計算\n    while(number%div_number>0){\n        div_number=div_number-1;\n    }\n    //quotientの計算\n    quotient=number/div_number;\n    //quotientが10未満ならYes、10以上ならNoと出力\n    if(quotient<10){\n        printf(\"Yes\\n\");\n    }else{\n        printf(\"No\\n\");\n    }\n    return 0;\n}", "language": "C", "metadata": {"date": 1590086744, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "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/C/s755202314.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s755202314", "user_id": "u255811486"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "/* ex3_4\n        fmuacshai */\n \n#include<stdio.h>\n \nint main(void){\n    //整数number、割る数div_number、商quotient\n    int number,div_number,quotient;\n    //numberの入力\n    scanf(\"%d\",&number);\n    //div_numberの初期設定\n    div_number=9;\n    //余りが出なくなるまで計算\n    while(number%div_number>0){\n        div_number=div_number-1;\n    }\n    //quotientの計算\n    quotient=number/div_number;\n    //quotientが10未満ならYes、10以上ならNoと出力\n    if(quotient<10){\n        printf(\"Yes\\n\");\n    }else{\n        printf(\"No\\n\");\n    }\n    return 0;\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": 591, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s270832286", "group_id": "codeNet:p02880", "input_text": "#include<stdio.h>\n\nint main(void){\n\tint a = 0;\n\tint flag = 0;\n\tint i,j = 0;\n\n\tscanf(\"%d\",&a);\n\n\tfor(i = 1 ; i < 10;i++){\n\n\t\tfor(j = 1;j < 10;j++){\n\t\t\tif((a / i > 0 && a / i <= 9) && j * (a/i) == a){\n\t\t\t\tflag = 1;\n\t\t\t\tbreak;\n\t\t\t}else{\n\t\t\tflag = 0;\n\t\t\t}\n\t\t}\n\t\tif(flag == 1) break;\n\n\n\t}\n\n\tif(flag == 1){\n\t\tprintf(\"Yes\");\n\t}else{\n\t\tprintf(\"NO\");\n\t}\n\n\treturn 0;\n}\n", "language": "C", "metadata": {"date": 1573700577, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "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/C/s270832286.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s270832286", "user_id": "u007040153"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "#include<stdio.h>\n\nint main(void){\n\tint a = 0;\n\tint flag = 0;\n\tint i,j = 0;\n\n\tscanf(\"%d\",&a);\n\n\tfor(i = 1 ; i < 10;i++){\n\n\t\tfor(j = 1;j < 10;j++){\n\t\t\tif((a / i > 0 && a / i <= 9) && j * (a/i) == a){\n\t\t\t\tflag = 1;\n\t\t\t\tbreak;\n\t\t\t}else{\n\t\t\tflag = 0;\n\t\t\t}\n\t\t}\n\t\tif(flag == 1) break;\n\n\n\t}\n\n\tif(flag == 1){\n\t\tprintf(\"Yes\");\n\t}else{\n\t\tprintf(\"NO\");\n\t}\n\n\treturn 0;\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": 359, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s578084673", "group_id": "codeNet:p02880", "input_text": "#include <stdio.h>\nint main(void){\n    // Your code here!\n    int a,b;\n    int i = 9;\n    int c = 0;\n    scanf(\"%d\",&a);\n    while(i >= 1){\n        b = a / i;\n        if(b < 10 && a%i == 0){\n            c+=1;\n            printf(\"Yes\");\n            break;\n        }\n        i--;\n    }\n    if(c == 0){\n    printf(\"No\");\n    }\n}", "language": "C", "metadata": {"date": 1573087669, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "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/C/s578084673.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s578084673", "user_id": "u683358630"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "#include <stdio.h>\nint main(void){\n    // Your code here!\n    int a,b;\n    int i = 9;\n    int c = 0;\n    scanf(\"%d\",&a);\n    while(i >= 1){\n        b = a / i;\n        if(b < 10 && a%i == 0){\n            c+=1;\n            printf(\"Yes\");\n            break;\n        }\n        i--;\n    }\n    if(c == 0){\n    printf(\"No\");\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": 325, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s907232294", "group_id": "codeNet:p02880", "input_text": "#include <stdio.h>\n\nint main()\n{\n  int a,i,j;\n  scanf(\"%d\", &a);\n  for(i=1;i<=9;i++)\n    for(j=1;j<=9;j++)\n      if(i*j==a){\n        printf(\"Yes\\n\");\n        return 0;\n      }\n  printf(\"No\\n\");\n  return 0;\n}\n", "language": "C", "metadata": {"date": 1572232115, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "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/C/s907232294.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s907232294", "user_id": "u013962767"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "#include <stdio.h>\n\nint main()\n{\n  int a,i,j;\n  scanf(\"%d\", &a);\n  for(i=1;i<=9;i++)\n    for(j=1;j<=9;j++)\n      if(i*j==a){\n        printf(\"Yes\\n\");\n        return 0;\n      }\n  printf(\"No\\n\");\n  return 0;\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": 208, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s333158176", "group_id": "codeNet:p02880", "input_text": "#include <stdio.h>\n#include <stdlib.h>\n\nint compara(const void * a, const void * b){\n  int x = *(int *) a;\n  int y = *(int *) b;\n  return x>y?1:x<y?-1:0;\n}\n\nvoid soma(int *v, int *r, int a){\n  r[0] = 1;\n  r[1] = 1;\n  for (int i = 0; i < a; i++) {\n    if (i>=(a+1)/2) {\n      r[1]*=v[i];\n    }else{\n      r[0]*=v[i];\n    }\n  }\n}\n\nint dec(int *v,int num1) {\n  int k=0,j,i;\n  for (i = 2; i <= num1;) {\n    if (num1%i==0) {\n      v[k]=i;\n      num1/=i;\n      k++;\n    }else{\n      i++;\n    }\n  }\n  qsort(v,k,sizeof(v[0]),compara);\n  return k;\n}\n\nint main(int argc, char const *argv[]) {\n  int a, b,j;\n  scanf(\"%d\",&a);\n  int vec[a],r[2];\n  int i = dec(vec,a);\n\n  if (i>1) {\n    soma(vec,r,i);\n\n    if (r[0]>9 ||r[1] >9) {\n      printf(\"No\\n\");\n    }else{\n      printf(\"Yes\\n\");\n    }\n  }else{\n    if (r[0] >9) {\n      printf(\"No\\n\");\n    }else{\n      printf(\"Yes\\n\");\n    }\n  }\n\n  return 0;\n}\n", "language": "C", "metadata": {"date": 1572229171, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "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/C/s333158176.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s333158176", "user_id": "u516447556"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "#include <stdio.h>\n#include <stdlib.h>\n\nint compara(const void * a, const void * b){\n  int x = *(int *) a;\n  int y = *(int *) b;\n  return x>y?1:x<y?-1:0;\n}\n\nvoid soma(int *v, int *r, int a){\n  r[0] = 1;\n  r[1] = 1;\n  for (int i = 0; i < a; i++) {\n    if (i>=(a+1)/2) {\n      r[1]*=v[i];\n    }else{\n      r[0]*=v[i];\n    }\n  }\n}\n\nint dec(int *v,int num1) {\n  int k=0,j,i;\n  for (i = 2; i <= num1;) {\n    if (num1%i==0) {\n      v[k]=i;\n      num1/=i;\n      k++;\n    }else{\n      i++;\n    }\n  }\n  qsort(v,k,sizeof(v[0]),compara);\n  return k;\n}\n\nint main(int argc, char const *argv[]) {\n  int a, b,j;\n  scanf(\"%d\",&a);\n  int vec[a],r[2];\n  int i = dec(vec,a);\n\n  if (i>1) {\n    soma(vec,r,i);\n\n    if (r[0]>9 ||r[1] >9) {\n      printf(\"No\\n\");\n    }else{\n      printf(\"Yes\\n\");\n    }\n  }else{\n    if (r[0] >9) {\n      printf(\"No\\n\");\n    }else{\n      printf(\"Yes\\n\");\n    }\n  }\n\n  return 0;\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": 889, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s180450994", "group_id": "codeNet:p02880", "input_text": "#include <stdio.h>\nint main(void){\n    int a=0;\n    scanf(\"%d\",&a);\n    //printf(\"a=%d\\n\",a);\n    \n    \n    //素因数分解できるかを9から調べる\n    int waretakazu=0;\n    int i=0;\n    for(i=9;i>=2;i--){\n        if(a%i==0){\n            waretakazu++;\n            a=a/i;\n            i++;\n          //  printf(\"i=%d,a=%d\\n\",i,a);\n        }\n        \n    }\n    //printf(\"waretakazu=%d\\n\",waretakazu);\n    \n    if(waretakazu<=2&&a==1){\n        printf(\"Yes\");\n    }else{\n        printf(\"No\");\n    }\n}\n", "language": "C", "metadata": {"date": 1572227018, "filename_ext": "c", "original_language": "C (Clang 3.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/C/s180450994.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s180450994", "user_id": "u031237127"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "#include <stdio.h>\nint main(void){\n    int a=0;\n    scanf(\"%d\",&a);\n    //printf(\"a=%d\\n\",a);\n    \n    \n    //素因数分解できるかを9から調べる\n    int waretakazu=0;\n    int i=0;\n    for(i=9;i>=2;i--){\n        if(a%i==0){\n            waretakazu++;\n            a=a/i;\n            i++;\n          //  printf(\"i=%d,a=%d\\n\",i,a);\n        }\n        \n    }\n    //printf(\"waretakazu=%d\\n\",waretakazu);\n    \n    if(waretakazu<=2&&a==1){\n        printf(\"Yes\");\n    }else{\n        printf(\"No\");\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": 505, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s933158645", "group_id": "codeNet:p02881", "input_text": "#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\n#include <string.h>\n#define ll long long\n#define rep(i,n) for(ll i=0;i<(n);i++)\n#define max(p,q) ((p)>(q)?(p):(q))\n#define min(p,q) ((p)<(q)?(p):(q))\n#define chmax(a,b) ((a)=(a)>(b)?(a):(b))\n#define chmin(a,b) ((a)=(a)<(b)?(a):(b))\n#define abs(p) ((p)>=(0)?(p):(-(p)))\n#define MOD 1000000007\nll power(ll a,ll b){ll r=1;rep(i,b){r*=a;}return r;}\n#define swap(a,b) do{ll w=(a);(a)=(b);(b)=w;}while(0)\n\n//your code here!\n\nint main(void){\n    ll N;\n    scanf(\"%lld\", &N);\n    ll n=N, ans=1e15;\n    for(ll i=2; i*i<=n; i++) {\n        if(n%i==0) {\n            ll cnt=1;\n            do{\n                n /= i;\n                ll x=power(i, cnt++);\n                chmin(ans, x + N/x);\n            }while(n%i==0);\n        }\n    }\n    if(n>1) chmin(ans, n + N/n);\n    printf(\"%lld\\n\", ans-2);\n    return 0;\n}\n", "language": "C", "metadata": {"date": 1572228012, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "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/C/s933158645.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s933158645", "user_id": "u924527074"}, "prompt_components": {"gold_output": "5\n", "input_to_evaluate": "#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\n#include <string.h>\n#define ll long long\n#define rep(i,n) for(ll i=0;i<(n);i++)\n#define max(p,q) ((p)>(q)?(p):(q))\n#define min(p,q) ((p)<(q)?(p):(q))\n#define chmax(a,b) ((a)=(a)>(b)?(a):(b))\n#define chmin(a,b) ((a)=(a)<(b)?(a):(b))\n#define abs(p) ((p)>=(0)?(p):(-(p)))\n#define MOD 1000000007\nll power(ll a,ll b){ll r=1;rep(i,b){r*=a;}return r;}\n#define swap(a,b) do{ll w=(a);(a)=(b);(b)=w;}while(0)\n\n//your code here!\n\nint main(void){\n    ll N;\n    scanf(\"%lld\", &N);\n    ll n=N, ans=1e15;\n    for(ll i=2; i*i<=n; i++) {\n        if(n%i==0) {\n            ll cnt=1;\n            do{\n                n /= i;\n                ll x=power(i, cnt++);\n                chmin(ans, x + N/x);\n            }while(n%i==0);\n        }\n    }\n    if(n>1) chmin(ans, n + N/n);\n    printf(\"%lld\\n\", ans-2);\n    return 0;\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": 858, "cpu_time_ms": 11, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s743004988", "group_id": "codeNet:p02882", "input_text": "#include <stdio.h>\n#include <math.h>\n\nint main(void)\n{\n    double a,b,x,th;\n    scanf(\"%lf %lf %lf\", &a, &b, &x);\n    if(a*a*b<=2*x) {\n        th = atan(2*(b/a-x/a/a/a));\n    } else {\n        th = atan(a*b*b/2/x);\n    }\n    printf(\"%.10lf\\n\", th/asin(1)*90);\n    return 0;\n}\n\n", "language": "C", "metadata": {"date": 1580241137, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "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/C/s743004988.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s743004988", "user_id": "u803684095"}, "prompt_components": {"gold_output": "45.0000000000\n", "input_to_evaluate": "#include <stdio.h>\n#include <math.h>\n\nint main(void)\n{\n    double a,b,x,th;\n    scanf(\"%lf %lf %lf\", &a, &b, &x);\n    if(a*a*b<=2*x) {\n        th = atan(2*(b/a-x/a/a/a));\n    } else {\n        th = atan(a*b*b/2/x);\n    }\n    printf(\"%.10lf\\n\", th/asin(1)*90);\n    return 0;\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": 276, "cpu_time_ms": 4, "memory_kb": 512}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s681309749", "group_id": "codeNet:p02885", "input_text": "#include<stdio.h>\nint main()\n{\n    int a,b;\n    scanf(\"%d %d\",&a,&b);\n    int rea =a- (b*2);\n    if (rea<0)\n        rea=0;\n    printf (\"%d\\n\",rea);\n}\n", "language": "C", "metadata": {"date": 1588229632, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "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/C/s681309749.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s681309749", "user_id": "u089230684"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "#include<stdio.h>\nint main()\n{\n    int a,b;\n    scanf(\"%d %d\",&a,&b);\n    int rea =a- (b*2);\n    if (rea<0)\n        rea=0;\n    printf (\"%d\\n\",rea);\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": 150, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s965693855", "group_id": "codeNet:p02885", "input_text": "#include<stdio.h>\n\nint main(void){\n  int a=0,b=0;\n  scanf(\"%d %d\",&a,&b);\n  if(a-2*b>0)\n    printf(\"%d\",a-2*b);\n  else\n    printf(\"0\");\n}", "language": "C", "metadata": {"date": 1571622975, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "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/C/s965693855.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s965693855", "user_id": "u660241222"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "#include<stdio.h>\n\nint main(void){\n  int a=0,b=0;\n  scanf(\"%d %d\",&a,&b);\n  if(a-2*b>0)\n    printf(\"%d\",a-2*b);\n  else\n    printf(\"0\");\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": 137, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s817976222", "group_id": "codeNet:p02886", "input_text": "#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n  int n,i,j,ans=0;\n  int *a;\n\n  scanf(\"%d\",&n );\n\n  a = calloc(n,sizeof(int));\n\n  for(i=0; i<n; i++)\n    scanf(\"%d\", &a[i]);\n\n  for(i=0; i<n-1; i++){\n    for(j=i+1; j<n; j++){\n      ans += a[i]*a[j];\n    }\n  }\n  printf(\"%d\", ans);\n  free(a);\n  return 0;\n}\n", "language": "C", "metadata": {"date": 1597981038, "filename_ext": "c", "original_language": "C (GCC 9.2.1)", "problem_description_relpath": "problem_descriptions/p02886.html", "problem_id": "p02886", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02886/input.txt", "sample_output_relpath": "derived/input_output/data/p02886/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02886/C/s817976222.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s817976222", "user_id": "u367958900"}, "prompt_components": {"gold_output": "11\n", "input_to_evaluate": "#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n  int n,i,j,ans=0;\n  int *a;\n\n  scanf(\"%d\",&n );\n\n  a = calloc(n,sizeof(int));\n\n  for(i=0; i<n; i++)\n    scanf(\"%d\", &a[i]);\n\n  for(i=0; i<n-1; i++){\n    for(j=i+1; j<n; j++){\n      ans += a[i]*a[j];\n    }\n  }\n  printf(\"%d\", ans);\n  free(a);\n  return 0;\n}\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nIt's now the season of TAKOYAKI FESTIVAL!\n\nThis year, N takoyaki (a ball-shaped food with a piece of octopus inside) will be served. The deliciousness of the i-th takoyaki is d_i.\n\nAs is commonly known, when you eat two takoyaki of deliciousness x and y together, you restore x \\times y health points.\n\nThere are \\frac{N \\times (N - 1)}{2} ways to choose two from the N takoyaki served in the festival. For each of these choices, find the health points restored from eating the two takoyaki, then compute the sum of these \\frac{N \\times (N - 1)}{2} values.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 50\n\n0 \\leq d_i \\leq 100\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 sum of the health points restored from eating two takoyaki over all possible choices of two takoyaki from the N takoyaki served.\n\nSample Input 1\n\n3\n3 1 2\n\nSample Output 1\n\n11\n\nThere are three possible choices:\n\nEat the first and second takoyaki. You will restore 3 health points.\n\nEat the second and third takoyaki. You will restore 2 health points.\n\nEat the first and third takoyaki. You will restore 6 health points.\n\nThe sum of these values is 11.\n\nSample Input 2\n\n7\n5 0 7 8 3 3 2\n\nSample Output 2\n\n312", "sample_input": "3\n3 1 2\n"}, "reference_outputs": ["11\n"], "source_document_id": "p02886", "source_text": "Score : 200 points\n\nProblem Statement\n\nIt's now the season of TAKOYAKI FESTIVAL!\n\nThis year, N takoyaki (a ball-shaped food with a piece of octopus inside) will be served. The deliciousness of the i-th takoyaki is d_i.\n\nAs is commonly known, when you eat two takoyaki of deliciousness x and y together, you restore x \\times y health points.\n\nThere are \\frac{N \\times (N - 1)}{2} ways to choose two from the N takoyaki served in the festival. For each of these choices, find the health points restored from eating the two takoyaki, then compute the sum of these \\frac{N \\times (N - 1)}{2} values.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 50\n\n0 \\leq d_i \\leq 100\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 sum of the health points restored from eating two takoyaki over all possible choices of two takoyaki from the N takoyaki served.\n\nSample Input 1\n\n3\n3 1 2\n\nSample Output 1\n\n11\n\nThere are three possible choices:\n\nEat the first and second takoyaki. You will restore 3 health points.\n\nEat the second and third takoyaki. You will restore 2 health points.\n\nEat the first and third takoyaki. You will restore 6 health points.\n\nThe sum of these values is 11.\n\nSample Input 2\n\n7\n5 0 7 8 3 3 2\n\nSample Output 2\n\n312", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 309, "cpu_time_ms": 5, "memory_kb": 1708}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s747633206", "group_id": "codeNet:p02887", "input_text": "#include<stdio.h>\n#include<stdlib.h>\n#include<assert.h>\n\n#define max(a,b) ((a)>(b))?(a):(b)\n#define min(a,b) ((a)>(b))?(b):(a)\n\ntypedef long long ll;\ntypedef unsigned long long ull;\n\nint main(void)\n{\n\tint n, cnt = 1;\n\n\tscanf(\"%d\\n\", &n);\n\tchar pc = getchar();\n\tfor (size_t i = 1; i < n; i++)\n\t{\n\t\tchar c = getchar();\n\t\tif (pc!=c)\n\t\t{\n\t\t\tcnt++;\n\t\t\tpc = c;\n\t\t}\n\t}\n\n\tprintf(\"%d\", cnt);\n}", "language": "C", "metadata": {"date": 1586527823, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "problem_description_relpath": "problem_descriptions/p02887.html", "problem_id": "p02887", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02887/input.txt", "sample_output_relpath": "derived/input_output/data/p02887/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02887/C/s747633206.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s747633206", "user_id": "u575926077"}, "prompt_components": {"gold_output": "5\n", "input_to_evaluate": "#include<stdio.h>\n#include<stdlib.h>\n#include<assert.h>\n\n#define max(a,b) ((a)>(b))?(a):(b)\n#define min(a,b) ((a)>(b))?(b):(a)\n\ntypedef long long ll;\ntypedef unsigned long long ull;\n\nint main(void)\n{\n\tint n, cnt = 1;\n\n\tscanf(\"%d\\n\", &n);\n\tchar pc = getchar();\n\tfor (size_t i = 1; i < n; i++)\n\t{\n\t\tchar c = getchar();\n\t\tif (pc!=c)\n\t\t{\n\t\t\tcnt++;\n\t\t\tpc = c;\n\t\t}\n\t}\n\n\tprintf(\"%d\", cnt);\n}", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere are N slimes lining up from left to right. The colors of these slimes will be given as a string S of length N consisting of lowercase English letters. The i-th slime from the left has the color that corresponds to the i-th character of S.\n\nAdjacent slimes with the same color will fuse into one larger slime without changing the color. If there were a slime adjacent to this group of slimes before fusion, that slime is now adjacent to the new larger slime.\n\nUltimately, how many slimes will be there?\n\nConstraints\n\n1 \\leq N \\leq 10^5\n\n|S| = N\n\nS consists of lowercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS\n\nOutput\n\nPrint the final number of slimes.\n\nSample Input 1\n\n10\naabbbbaaca\n\nSample Output 1\n\n5\n\nUltimately, these slimes will fuse into abaca.\n\nSample Input 2\n\n5\naaaaa\n\nSample Output 2\n\n1\n\nAll the slimes will fuse into one.\n\nSample Input 3\n\n20\nxxzaffeeeeddfkkkkllq\n\nSample Output 3\n\n10", "sample_input": "10\naabbbbaaca\n"}, "reference_outputs": ["5\n"], "source_document_id": "p02887", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere are N slimes lining up from left to right. The colors of these slimes will be given as a string S of length N consisting of lowercase English letters. The i-th slime from the left has the color that corresponds to the i-th character of S.\n\nAdjacent slimes with the same color will fuse into one larger slime without changing the color. If there were a slime adjacent to this group of slimes before fusion, that slime is now adjacent to the new larger slime.\n\nUltimately, how many slimes will be there?\n\nConstraints\n\n1 \\leq N \\leq 10^5\n\n|S| = N\n\nS consists of lowercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS\n\nOutput\n\nPrint the final number of slimes.\n\nSample Input 1\n\n10\naabbbbaaca\n\nSample Output 1\n\n5\n\nUltimately, these slimes will fuse into abaca.\n\nSample Input 2\n\n5\naaaaa\n\nSample Output 2\n\n1\n\nAll the slimes will fuse into one.\n\nSample Input 3\n\n20\nxxzaffeeeeddfkkkkllq\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": 384, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s110709805", "group_id": "codeNet:p02887", "input_text": "#include <stdio.h>\n#include <stdlib.h>\nint main(void) {\nint N;\nchar S[10000]={'\\0'};\nscanf(\"%d\",&N);\nscanf(\"%s\",S);\nint i=0;\nint count=1;\n\n\nwhile (i<N-1){\n    if (S[i]==S[i+1]) {i++;}\n    else if (S[i]!=S[i+1]) {count++;i++;}\n}\nprintf(\"%d\",count);\n return EXIT_SUCCESS;\n}\n", "language": "C", "metadata": {"date": 1582872730, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "problem_description_relpath": "problem_descriptions/p02887.html", "problem_id": "p02887", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02887/input.txt", "sample_output_relpath": "derived/input_output/data/p02887/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02887/C/s110709805.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s110709805", "user_id": "u959524814"}, "prompt_components": {"gold_output": "5\n", "input_to_evaluate": "#include <stdio.h>\n#include <stdlib.h>\nint main(void) {\nint N;\nchar S[10000]={'\\0'};\nscanf(\"%d\",&N);\nscanf(\"%s\",S);\nint i=0;\nint count=1;\n\n\nwhile (i<N-1){\n    if (S[i]==S[i+1]) {i++;}\n    else if (S[i]!=S[i+1]) {count++;i++;}\n}\nprintf(\"%d\",count);\n return EXIT_SUCCESS;\n}\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere are N slimes lining up from left to right. The colors of these slimes will be given as a string S of length N consisting of lowercase English letters. The i-th slime from the left has the color that corresponds to the i-th character of S.\n\nAdjacent slimes with the same color will fuse into one larger slime without changing the color. If there were a slime adjacent to this group of slimes before fusion, that slime is now adjacent to the new larger slime.\n\nUltimately, how many slimes will be there?\n\nConstraints\n\n1 \\leq N \\leq 10^5\n\n|S| = N\n\nS consists of lowercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS\n\nOutput\n\nPrint the final number of slimes.\n\nSample Input 1\n\n10\naabbbbaaca\n\nSample Output 1\n\n5\n\nUltimately, these slimes will fuse into abaca.\n\nSample Input 2\n\n5\naaaaa\n\nSample Output 2\n\n1\n\nAll the slimes will fuse into one.\n\nSample Input 3\n\n20\nxxzaffeeeeddfkkkkllq\n\nSample Output 3\n\n10", "sample_input": "10\naabbbbaaca\n"}, "reference_outputs": ["5\n"], "source_document_id": "p02887", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere are N slimes lining up from left to right. The colors of these slimes will be given as a string S of length N consisting of lowercase English letters. The i-th slime from the left has the color that corresponds to the i-th character of S.\n\nAdjacent slimes with the same color will fuse into one larger slime without changing the color. If there were a slime adjacent to this group of slimes before fusion, that slime is now adjacent to the new larger slime.\n\nUltimately, how many slimes will be there?\n\nConstraints\n\n1 \\leq N \\leq 10^5\n\n|S| = N\n\nS consists of lowercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS\n\nOutput\n\nPrint the final number of slimes.\n\nSample Input 1\n\n10\naabbbbaaca\n\nSample Output 1\n\n5\n\nUltimately, these slimes will fuse into abaca.\n\nSample Input 2\n\n5\naaaaa\n\nSample Output 2\n\n1\n\nAll the slimes will fuse into one.\n\nSample Input 3\n\n20\nxxzaffeeeeddfkkkkllq\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": 272, "cpu_time_ms": 126, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s412449171", "group_id": "codeNet:p02887", "input_text": "#include <stdio.h>\n\nint main(void) {\n    int n, count = 1;\n    scanf(\"%d\", &n);\n    char s[n+1], t;\n    scanf(\"%s\", s);\n    t = s[0];\n    for(int i = 0; i < n; i++) {\n        if(t != s[i]) {\n            t = s[i];\n            count++;\n        }\n    }\n    printf(\"%d\\n\", count);\n    return 0;\n}", "language": "C", "metadata": {"date": 1572030423, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "problem_description_relpath": "problem_descriptions/p02887.html", "problem_id": "p02887", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02887/input.txt", "sample_output_relpath": "derived/input_output/data/p02887/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02887/C/s412449171.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s412449171", "user_id": "u231261695"}, "prompt_components": {"gold_output": "5\n", "input_to_evaluate": "#include <stdio.h>\n\nint main(void) {\n    int n, count = 1;\n    scanf(\"%d\", &n);\n    char s[n+1], t;\n    scanf(\"%s\", s);\n    t = s[0];\n    for(int i = 0; i < n; i++) {\n        if(t != s[i]) {\n            t = s[i];\n            count++;\n        }\n    }\n    printf(\"%d\\n\", count);\n    return 0;\n}", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere are N slimes lining up from left to right. The colors of these slimes will be given as a string S of length N consisting of lowercase English letters. The i-th slime from the left has the color that corresponds to the i-th character of S.\n\nAdjacent slimes with the same color will fuse into one larger slime without changing the color. If there were a slime adjacent to this group of slimes before fusion, that slime is now adjacent to the new larger slime.\n\nUltimately, how many slimes will be there?\n\nConstraints\n\n1 \\leq N \\leq 10^5\n\n|S| = N\n\nS consists of lowercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS\n\nOutput\n\nPrint the final number of slimes.\n\nSample Input 1\n\n10\naabbbbaaca\n\nSample Output 1\n\n5\n\nUltimately, these slimes will fuse into abaca.\n\nSample Input 2\n\n5\naaaaa\n\nSample Output 2\n\n1\n\nAll the slimes will fuse into one.\n\nSample Input 3\n\n20\nxxzaffeeeeddfkkkkllq\n\nSample Output 3\n\n10", "sample_input": "10\naabbbbaaca\n"}, "reference_outputs": ["5\n"], "source_document_id": "p02887", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere are N slimes lining up from left to right. The colors of these slimes will be given as a string S of length N consisting of lowercase English letters. The i-th slime from the left has the color that corresponds to the i-th character of S.\n\nAdjacent slimes with the same color will fuse into one larger slime without changing the color. If there were a slime adjacent to this group of slimes before fusion, that slime is now adjacent to the new larger slime.\n\nUltimately, how many slimes will be there?\n\nConstraints\n\n1 \\leq N \\leq 10^5\n\n|S| = N\n\nS consists of lowercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS\n\nOutput\n\nPrint the final number of slimes.\n\nSample Input 1\n\n10\naabbbbaaca\n\nSample Output 1\n\n5\n\nUltimately, these slimes will fuse into abaca.\n\nSample Input 2\n\n5\naaaaa\n\nSample Output 2\n\n1\n\nAll the slimes will fuse into one.\n\nSample Input 3\n\n20\nxxzaffeeeeddfkkkkllq\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": 292, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s814368193", "group_id": "codeNet:p02888", "input_text": "#include <stdio.h>\n\nint main(){\n    int n, ans = 0;\n\n    scanf(\"%d\", &n);\n \n    int l[n];\n    for(int i = 0; i < n; i ++){\n        scanf(\"%d\", l + i);\n    }\n\n    for(int i = 0; i < n - 2; i ++){\n        for (int j = i  + 1; j < n - 1; j ++){\n            for(int k = j  + 1;k < n; k ++){\n                if(l[i] < (l[j] + l[k]) && l[j] < (l[k] + l[i]) && l[k] < (l[i] + l[j])){\n                ans ++;\n                }\n            }\n        }\n    }\n\n\n    printf(\"%d\", ans);\n    return 0;\n}   ", "language": "C", "metadata": {"date": 1571535856, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "problem_description_relpath": "problem_descriptions/p02888.html", "problem_id": "p02888", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02888/input.txt", "sample_output_relpath": "derived/input_output/data/p02888/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02888/C/s814368193.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s814368193", "user_id": "u832304522"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "#include <stdio.h>\n\nint main(){\n    int n, ans = 0;\n\n    scanf(\"%d\", &n);\n \n    int l[n];\n    for(int i = 0; i < n; i ++){\n        scanf(\"%d\", l + i);\n    }\n\n    for(int i = 0; i < n - 2; i ++){\n        for (int j = i  + 1; j < n - 1; j ++){\n            for(int k = j  + 1;k < n; k ++){\n                if(l[i] < (l[j] + l[k]) && l[j] < (l[k] + l[i]) && l[k] < (l[i] + l[j])){\n                ans ++;\n                }\n            }\n        }\n    }\n\n\n    printf(\"%d\", ans);\n    return 0;\n}   ", "problem_context": "Score : 400 points\n\nProblem Statement\n\nTakahashi has N sticks that are distinguishable from each other. The length of the i-th stick is L_i.\n\nHe is going to form a triangle using three of these sticks. Let a, b, and c be the lengths of the three sticks used. Here, all of the following conditions must be satisfied:\n\na < b + c\n\nb < c + a\n\nc < a + b\n\nHow many different triangles can be formed? Two triangles are considered different when there is a stick used in only one of them.\n\nConstraints\n\nAll values in input are integers.\n\n3 \\leq N \\leq 2 \\times 10^3\n\n1 \\leq L_i \\leq 10^3\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nL_1 L_2 ... L_N\n\nConstraints\n\nPrint the number of different triangles that can be formed.\n\nSample Input 1\n\n4\n3 4 2 1\n\nSample Output 1\n\n1\n\nOnly one triangle can be formed: the triangle formed by the first, second, and third sticks.\n\nSample Input 2\n\n3\n1 1000 1\n\nSample Output 2\n\n0\n\nNo triangles can be formed.\n\nSample Input 3\n\n7\n218 786 704 233 645 728 389\n\nSample Output 3\n\n23", "sample_input": "4\n3 4 2 1\n"}, "reference_outputs": ["1\n"], "source_document_id": "p02888", "source_text": "Score : 400 points\n\nProblem Statement\n\nTakahashi has N sticks that are distinguishable from each other. The length of the i-th stick is L_i.\n\nHe is going to form a triangle using three of these sticks. Let a, b, and c be the lengths of the three sticks used. Here, all of the following conditions must be satisfied:\n\na < b + c\n\nb < c + a\n\nc < a + b\n\nHow many different triangles can be formed? Two triangles are considered different when there is a stick used in only one of them.\n\nConstraints\n\nAll values in input are integers.\n\n3 \\leq N \\leq 2 \\times 10^3\n\n1 \\leq L_i \\leq 10^3\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nL_1 L_2 ... L_N\n\nConstraints\n\nPrint the number of different triangles that can be formed.\n\nSample Input 1\n\n4\n3 4 2 1\n\nSample Output 1\n\n1\n\nOnly one triangle can be formed: the triangle formed by the first, second, and third sticks.\n\nSample Input 2\n\n3\n1 1000 1\n\nSample Output 2\n\n0\n\nNo triangles can be formed.\n\nSample Input 3\n\n7\n218 786 704 233 645 728 389\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": 492, "cpu_time_ms": 2103, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s631667640", "group_id": "codeNet:p02888", "input_text": "#include <stdio.h>\n#include <string.h>\n#include <limits.h>\n#include <stdlib.h>\n#include <math.h>\n\n\nint merge(long int a1[], long int a2[], long int a1_size, long int a2_size, long int a[]);\nint mergeSort(long int a[], long int number);\n\nint main(void)\n{\n\tlong int n;\n\tlong int count;\n\tlong int i, j, k;\n\tlong int work;\n\tlong int flg;\n\tlong int l[2000];\n\t\n\tscanf(\"%ld\", &n);\n\t\n\tfor(i = 0; i < n; i++) {\n\t\tscanf(\"%ld\", &l[i]);\n\t}\n\t\n\tmergeSort(l, n);\n\t/*\n\tfor(i = 0; i < n; i++) {\n\t\tprintf(\"%ld\\n\", l[i]);\n\t}\n\t*/\n\t\n\tcount = 0;\n\t\n\tfor(i = 0; i < n - 2; i++) {\n\t\tflg = 0;\n\t\tfor(j = i + 1; j < n - 1; j++) {\n\t\t\tif(i == j) {\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tfor(k = j + 1; k < n; k++) {\n\t\t\t\tif( (i == k) || (j == k) ) {\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\t\t\t\tif(l[i] < l[j] + l[k]) {\n\t\t\t\t\tcount++;\n\t\t\t\t} else {\n\t\t\t\t\tif(k == j + 1) {\n\t\t\t\t\t\tflg = 1;\n\t\t\t\t\t}\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif(flg) {\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t}\n\t\n\tprintf(\"%ld\\n\", count);\n\t\n\treturn 0;\n}\n\nint merge(long int a1[], long int a2[], long int a1_size, long int a2_size, long int a[])\n{\n\tlong int i = 0, j = 0;\n\t\n\twhile( (i < a1_size ) || (j < a2_size) ){\n\t\tif( (j >= a2_size ) || ( (i < a1_size) && (a1[i] > a2[j]) ) ) {\n\t\t\ta[i + j] = a1[i];\n\t\t\ti++;\n\t\t} else {\n\t\t\ta[i + j] = a2[j];\n\t\t\tj++;\n\t\t}\n\t}\n\t\n\treturn 0;\n}\n\n\nint mergeSort(long int a[], long int number)\n{\n\tlong int m = number / 2, n = number - m;\n\tlong int a1[m];\n\tlong int a2[n];\n\tint i, j;\n\t\n\tif(number > 1) {\n\t\tfor(i = 0; i < m; i++) {\n\t\t\ta1[i] = a[i];\n\t\t}\n\t\tfor(i = 0; i < n; i++) {\n\t\t\ta2[i] = a[m + i];\n\t\t}\n\t\tmergeSort(a1, m);\n\t\tmergeSort(a2, n);\n\t\tmerge(a1, a2, m, n, a);\n\t}\n\t\n\treturn 0;\n}\n", "language": "C", "metadata": {"date": 1571534454, "filename_ext": "c", "original_language": "C (Clang 3.8.0)", "problem_description_relpath": "problem_descriptions/p02888.html", "problem_id": "p02888", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02888/input.txt", "sample_output_relpath": "derived/input_output/data/p02888/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02888/C/s631667640.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s631667640", "user_id": "u833841247"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "#include <stdio.h>\n#include <string.h>\n#include <limits.h>\n#include <stdlib.h>\n#include <math.h>\n\n\nint merge(long int a1[], long int a2[], long int a1_size, long int a2_size, long int a[]);\nint mergeSort(long int a[], long int number);\n\nint main(void)\n{\n\tlong int n;\n\tlong int count;\n\tlong int i, j, k;\n\tlong int work;\n\tlong int flg;\n\tlong int l[2000];\n\t\n\tscanf(\"%ld\", &n);\n\t\n\tfor(i = 0; i < n; i++) {\n\t\tscanf(\"%ld\", &l[i]);\n\t}\n\t\n\tmergeSort(l, n);\n\t/*\n\tfor(i = 0; i < n; i++) {\n\t\tprintf(\"%ld\\n\", l[i]);\n\t}\n\t*/\n\t\n\tcount = 0;\n\t\n\tfor(i = 0; i < n - 2; i++) {\n\t\tflg = 0;\n\t\tfor(j = i + 1; j < n - 1; j++) {\n\t\t\tif(i == j) {\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tfor(k = j + 1; k < n; k++) {\n\t\t\t\tif( (i == k) || (j == k) ) {\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\t\t\t\tif(l[i] < l[j] + l[k]) {\n\t\t\t\t\tcount++;\n\t\t\t\t} else {\n\t\t\t\t\tif(k == j + 1) {\n\t\t\t\t\t\tflg = 1;\n\t\t\t\t\t}\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif(flg) {\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t}\n\t\n\tprintf(\"%ld\\n\", count);\n\t\n\treturn 0;\n}\n\nint merge(long int a1[], long int a2[], long int a1_size, long int a2_size, long int a[])\n{\n\tlong int i = 0, j = 0;\n\t\n\twhile( (i < a1_size ) || (j < a2_size) ){\n\t\tif( (j >= a2_size ) || ( (i < a1_size) && (a1[i] > a2[j]) ) ) {\n\t\t\ta[i + j] = a1[i];\n\t\t\ti++;\n\t\t} else {\n\t\t\ta[i + j] = a2[j];\n\t\t\tj++;\n\t\t}\n\t}\n\t\n\treturn 0;\n}\n\n\nint mergeSort(long int a[], long int number)\n{\n\tlong int m = number / 2, n = number - m;\n\tlong int a1[m];\n\tlong int a2[n];\n\tint i, j;\n\t\n\tif(number > 1) {\n\t\tfor(i = 0; i < m; i++) {\n\t\t\ta1[i] = a[i];\n\t\t}\n\t\tfor(i = 0; i < n; i++) {\n\t\t\ta2[i] = a[m + i];\n\t\t}\n\t\tmergeSort(a1, m);\n\t\tmergeSort(a2, n);\n\t\tmerge(a1, a2, m, n, a);\n\t}\n\t\n\treturn 0;\n}\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nTakahashi has N sticks that are distinguishable from each other. The length of the i-th stick is L_i.\n\nHe is going to form a triangle using three of these sticks. Let a, b, and c be the lengths of the three sticks used. Here, all of the following conditions must be satisfied:\n\na < b + c\n\nb < c + a\n\nc < a + b\n\nHow many different triangles can be formed? Two triangles are considered different when there is a stick used in only one of them.\n\nConstraints\n\nAll values in input are integers.\n\n3 \\leq N \\leq 2 \\times 10^3\n\n1 \\leq L_i \\leq 10^3\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nL_1 L_2 ... L_N\n\nConstraints\n\nPrint the number of different triangles that can be formed.\n\nSample Input 1\n\n4\n3 4 2 1\n\nSample Output 1\n\n1\n\nOnly one triangle can be formed: the triangle formed by the first, second, and third sticks.\n\nSample Input 2\n\n3\n1 1000 1\n\nSample Output 2\n\n0\n\nNo triangles can be formed.\n\nSample Input 3\n\n7\n218 786 704 233 645 728 389\n\nSample Output 3\n\n23", "sample_input": "4\n3 4 2 1\n"}, "reference_outputs": ["1\n"], "source_document_id": "p02888", "source_text": "Score : 400 points\n\nProblem Statement\n\nTakahashi has N sticks that are distinguishable from each other. The length of the i-th stick is L_i.\n\nHe is going to form a triangle using three of these sticks. Let a, b, and c be the lengths of the three sticks used. Here, all of the following conditions must be satisfied:\n\na < b + c\n\nb < c + a\n\nc < a + b\n\nHow many different triangles can be formed? Two triangles are considered different when there is a stick used in only one of them.\n\nConstraints\n\nAll values in input are integers.\n\n3 \\leq N \\leq 2 \\times 10^3\n\n1 \\leq L_i \\leq 10^3\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nL_1 L_2 ... L_N\n\nConstraints\n\nPrint the number of different triangles that can be formed.\n\nSample Input 1\n\n4\n3 4 2 1\n\nSample Output 1\n\n1\n\nOnly one triangle can be formed: the triangle formed by the first, second, and third sticks.\n\nSample Input 2\n\n3\n1 1000 1\n\nSample Output 2\n\n0\n\nNo triangles can be formed.\n\nSample Input 3\n\n7\n218 786 704 233 645 728 389\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": 1583, "cpu_time_ms": 1776, "memory_kb": 256}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s446939516", "group_id": "codeNet:p02897", "input_text": "#include <stdio.h>\n\nint main(){\n\n  //人数 N, 制限身長 K, それぞれのメンバーの身長 h[i]\n  int i;\n  int N;\n  int K;\n\n  scanf(\"%d %d\", &N, &K);\n  int h[N];\n\n  for(i = 1; i <= N; i++){\n\n    scanf(\"%d\", &h[i - 1]);\n  }\n\n  int count = 0;\n  //h の値を K と比較し，K 以上であればカウントを一つ増やす\n  for(i = 1; i <= N; i++){\n\n    if(h[i - 1] >= K){\n      count++;\n    }\n  }\n\n  printf(\"%d\", count);\n\n  return 0;\n}", "language": "C", "metadata": {"date": 1569721941, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "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/C/s446939516.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s446939516", "user_id": "u649503576"}, "prompt_components": {"gold_output": "0.5000000000\n", "input_to_evaluate": "#include <stdio.h>\n\nint main(){\n\n  //人数 N, 制限身長 K, それぞれのメンバーの身長 h[i]\n  int i;\n  int N;\n  int K;\n\n  scanf(\"%d %d\", &N, &K);\n  int h[N];\n\n  for(i = 1; i <= N; i++){\n\n    scanf(\"%d\", &h[i - 1]);\n  }\n\n  int count = 0;\n  //h の値を K と比較し，K 以上であればカウントを一つ増やす\n  for(i = 1; i <= N; i++){\n\n    if(h[i - 1] >= K){\n      count++;\n    }\n  }\n\n  printf(\"%d\", count);\n\n  return 0;\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": 448, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s377896964", "group_id": "codeNet:p02897", "input_text": "#include <stdio.h>\n \nint main(void){\n    int n;\n    scanf(\"%d\",&n);\n    \n    if(n%2 == 0) printf(\"%lf\",(double)1/(double)2);\n    if(n%2 == 1) printf(\"%lf\",(double)(n/2+1)/(double)n);\n  \n    return 0;\n}", "language": "C", "metadata": {"date": 1569720955, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "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/C/s377896964.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s377896964", "user_id": "u967356370"}, "prompt_components": {"gold_output": "0.5000000000\n", "input_to_evaluate": "#include <stdio.h>\n \nint main(void){\n    int n;\n    scanf(\"%d\",&n);\n    \n    if(n%2 == 0) printf(\"%lf\",(double)1/(double)2);\n    if(n%2 == 1) printf(\"%lf\",(double)(n/2+1)/(double)n);\n  \n    return 0;\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": 201, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s549077242", "group_id": "codeNet:p02899", "input_text": "#include <stdio.h>\nint main()\n{\n    long long n;\n    scanf(\"%lli\",&n);\n    long long a[n];\n    long long t[n];\n    for (int i=0;i<n;i++) {\n        t[i] = 0;\n    }\n    long long tmp;\n    for (long long i=0;i<n;i++) {\n        scanf(\"%lli\",&a[i]);\n        tmp = a[i];\n        t[tmp-1] = i+1;\n    }\n    for(int i=0;i<n;i++) {\n        printf(\"%lli \",t[i]);\n    }\n    return 0;\n}", "language": "C", "metadata": {"date": 1592766931, "filename_ext": "c", "original_language": "C (GCC 9.2.1)", "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/C/s549077242.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s549077242", "user_id": "u251041085"}, "prompt_components": {"gold_output": "3 1 2\n", "input_to_evaluate": "#include <stdio.h>\nint main()\n{\n    long long n;\n    scanf(\"%lli\",&n);\n    long long a[n];\n    long long t[n];\n    for (int i=0;i<n;i++) {\n        t[i] = 0;\n    }\n    long long tmp;\n    for (long long i=0;i<n;i++) {\n        scanf(\"%lli\",&a[i]);\n        tmp = a[i];\n        t[tmp-1] = i+1;\n    }\n    for(int i=0;i<n;i++) {\n        printf(\"%lli \",t[i]);\n    }\n    return 0;\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": 373, "cpu_time_ms": 32, "memory_kb": 3224}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s134073730", "group_id": "codeNet:p02899", "input_text": "#include<stdio.h>\n#include<stdlib.h>\nint main()\n{\n    int x,i,j,a,fact;\n    scanf(\"%d\",&x);\n    int A[x+5],B[x+5];\n    for(i=0;i<x;i++)\n    {\n        scanf(\"%d\",&A[i]);\n        B[i]=A[i];\n    }\n     for(i=0;i<x;i++)\n    {\n        for(j=1+i;j<x;j++)\n        {\n            if(A[i]>A[j])\n            {\n                a=A[i];\n                A[i]=A[j];\n                A[j]=a;\n            }\n        }\n    }\n\n     for(i=0;i<x;i++)\n     {\n         for(j=0;j<x;j++)\n      {\n        if(A[i]==B[j])\n        {\n          printf(\"%d\",j+1);\n        }\n\n      }\n      printf(\" \");\n     }\n}\n", "language": "C", "metadata": {"date": 1570408909, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "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/C/s134073730.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s134073730", "user_id": "u131754692"}, "prompt_components": {"gold_output": "3 1 2\n", "input_to_evaluate": "#include<stdio.h>\n#include<stdlib.h>\nint main()\n{\n    int x,i,j,a,fact;\n    scanf(\"%d\",&x);\n    int A[x+5],B[x+5];\n    for(i=0;i<x;i++)\n    {\n        scanf(\"%d\",&A[i]);\n        B[i]=A[i];\n    }\n     for(i=0;i<x;i++)\n    {\n        for(j=1+i;j<x;j++)\n        {\n            if(A[i]>A[j])\n            {\n                a=A[i];\n                A[i]=A[j];\n                A[j]=a;\n            }\n        }\n    }\n\n     for(i=0;i<x;i++)\n     {\n         for(j=0;j<x;j++)\n      {\n        if(A[i]==B[j])\n        {\n          printf(\"%d\",j+1);\n        }\n\n      }\n      printf(\" \");\n     }\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": 576, "cpu_time_ms": 2103, "memory_kb": 896}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s290370664", "group_id": "codeNet:p02900", "input_text": "#include <stdio.h>\n#define ll long long\nll gcd(ll p,ll q){while(q){ll t=p%q;p=q;q=t;}return p;}\nint main(){\n\tll a,b;\n\tscanf(\"%lld%lld\",&a,&b);\n\tll d=gcd(a,b);\n\tint ans=1;\n\tfor(ll i=2;i*i<=d;i++)if(d%i==0){\n\t\tans++;\n\t\twhile(d%i==0)d/=i;\n\t}\n\tprintf(\"%d\",ans+(d!=1));\n}", "language": "C", "metadata": {"date": 1572572865, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "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/C/s290370664.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s290370664", "user_id": "u382163500"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "#include <stdio.h>\n#define ll long long\nll gcd(ll p,ll q){while(q){ll t=p%q;p=q;q=t;}return p;}\nint main(){\n\tll a,b;\n\tscanf(\"%lld%lld\",&a,&b);\n\tll d=gcd(a,b);\n\tint ans=1;\n\tfor(ll i=2;i*i<=d;i++)if(d%i==0){\n\t\tans++;\n\t\twhile(d%i==0)d/=i;\n\t}\n\tprintf(\"%d\",ans+(d!=1));\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": 266, "cpu_time_ms": 10, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s653956551", "group_id": "codeNet:p02900", "input_text": "#include\"stdio.h\"\n#include\"stdlib.h\"\nint gcd( int A, int B){\n  if( A>B ){\n    return gcd( A-B, B);\n  }\n  else if( B>A ){\n    return gcd( A, B-A);\n  }\n  else{\n    return A;\n  }\n}\nint* divisor(int num){\n  int i,j=0;\n  int* list = (int*) calloc(1000,sizeof(int));\n  for(i=1;i<=num;i++){\n    if(num%i == 0){\n      list[j++] = i;\n    }\n  }\n  return list;\n}\nint main(void){\n  int A,B,C,i,j,count,ct=0;\n  int flag=1;\n  int* list;\n  scanf(\"%d %d\",&A,&B);\n  C = gcd( A, B);\n  \n  // output'C' is max gcd(A,B)\n  //printf(\"C:%d\\n\",C);\n\n  // list is sosuu\n  list = divisor(C);\n  for(i=0; list[i]!=0;i++){\n    //printf(\"list[%d]:%d \", i, list[i]);\n  }\n  count=i;\n  //printf(\"count:%d\\n\",count);\n\n  for( i=0; i<count; i++){\n    for( j=2; j<list[i]; j++){\n      if( list[i]%j==0 ){\n        flag=0;\n        break;\n      }\n    }\n    if( flag==1 ){\n      //printf(\"list[%d]:%d\\n\", i, list[i]);\n      ct++;\n    }\n    flag=1;\n  }\n  \n  printf(\"%d\\n\", ct);\n  free(list);\n  return 0;\n}\n", "language": "C", "metadata": {"date": 1570743066, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "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/C/s653956551.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s653956551", "user_id": "u326552320"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "#include\"stdio.h\"\n#include\"stdlib.h\"\nint gcd( int A, int B){\n  if( A>B ){\n    return gcd( A-B, B);\n  }\n  else if( B>A ){\n    return gcd( A, B-A);\n  }\n  else{\n    return A;\n  }\n}\nint* divisor(int num){\n  int i,j=0;\n  int* list = (int*) calloc(1000,sizeof(int));\n  for(i=1;i<=num;i++){\n    if(num%i == 0){\n      list[j++] = i;\n    }\n  }\n  return list;\n}\nint main(void){\n  int A,B,C,i,j,count,ct=0;\n  int flag=1;\n  int* list;\n  scanf(\"%d %d\",&A,&B);\n  C = gcd( A, B);\n  \n  // output'C' is max gcd(A,B)\n  //printf(\"C:%d\\n\",C);\n\n  // list is sosuu\n  list = divisor(C);\n  for(i=0; list[i]!=0;i++){\n    //printf(\"list[%d]:%d \", i, list[i]);\n  }\n  count=i;\n  //printf(\"count:%d\\n\",count);\n\n  for( i=0; i<count; i++){\n    for( j=2; j<list[i]; j++){\n      if( list[i]%j==0 ){\n        flag=0;\n        break;\n      }\n    }\n    if( flag==1 ){\n      //printf(\"list[%d]:%d\\n\", i, list[i]);\n      ct++;\n    }\n    flag=1;\n  }\n  \n  printf(\"%d\\n\", ct);\n  free(list);\n  return 0;\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": 962, "cpu_time_ms": 2103, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s382050101", "group_id": "codeNet:p02900", "input_text": "#define _CRT_SECURE_NO_WARNINGS\n#include <stdio.h>\n\nint main()\n{\n\tint A, B,x,min,Ans=0;\n\tscanf(\"%d %d\", &A, &B);\n   \n\tif (A >= B) min = B;\n\telse min = A;\n\n\tfor (x = min; x > 0; x--) {\n\n\t\tint  t, m = 0;\n\n\t\tif (x >= 4) {\n\t\t\tfor (t = 2; t < x; t++) {\n\t\t\t\tif (x % t == 0) {\n\t\t\t\t\tm++; //素数にならないものはmを1以上にする\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tif (A % x == 0 && B % x == 0 && m==0) Ans++;\n\t}\n\tprintf(\"%d\", Ans);\n}\n\n\n\n\n", "language": "C", "metadata": {"date": 1569725744, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "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/C/s382050101.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s382050101", "user_id": "u059066226"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "#define _CRT_SECURE_NO_WARNINGS\n#include <stdio.h>\n\nint main()\n{\n\tint A, B,x,min,Ans=0;\n\tscanf(\"%d %d\", &A, &B);\n   \n\tif (A >= B) min = B;\n\telse min = A;\n\n\tfor (x = min; x > 0; x--) {\n\n\t\tint  t, m = 0;\n\n\t\tif (x >= 4) {\n\t\t\tfor (t = 2; t < x; t++) {\n\t\t\t\tif (x % t == 0) {\n\t\t\t\t\tm++; //素数にならないものはmを1以上にする\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tif (A % x == 0 && B % x == 0 && m==0) Ans++;\n\t}\n\tprintf(\"%d\", Ans);\n}\n\n\n\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": 436, "cpu_time_ms": 2103, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s819798281", "group_id": "codeNet:p02900", "input_text": "#include <stdbool.h>\n#include <stdio.h>\n#include <stdlib.h>\n#include <inttypes.h>\n#include <ctype.h>\n#include <stdint.h>\n#include <string.h>\n#include <wchar.h>\n#include <math.h>\n\n#define N_MAX (100)\n#define P_MAX (100)\n#define DP_ARRAY_SIZE (N_MAX * P_MAX / 32 + 1)\n\n#define MIN(a, b) ((a) < (b) ? (a) : (b))\n#define MAX(a, b) ((a) > (b) ? (a) : (b))\n#define ABS(a) ((a) < 0 ? -(a) : (a))\n#define ABSS(a, b) ((a) > (b) ? (a) - (b) : (b) - (a))\n#define SWAP(type, a, b) { const type tmp = a; a = b; b = tmp; }\n\nint compare_sz_asc(const void* a, const void* b) {\n    return *((size_t*)a) < *((size_t*)b) ? -1 : 1;\n}\n\nint compare_sz_desc(const void* a, const void* b) {\n    return *((size_t*)a) > * ((size_t*)b) ? -1 : 1;\n}\n\nint compare_i64_asc(const void* a, const void* b) {\n    return *((int64_t*)a) < *((int64_t*)b) ? -1 : 1;\n}\n\nint compare_i64_desc(const void* a, const void* b) {\n    return *((int64_t*)a) > * ((int64_t*)b) ? -1 : 1;\n}\n\nint compare_u64_asc(const void* a, const void* b) {\n    return *((uint64_t*)a) < *((uint64_t*)b) ? -1 : 1;\n}\n\nint compare_u64_desc(const void* a, const void* b) {\n    return *((uint64_t*)a) > * ((uint64_t*)b) ? -1 : 1;\n}\n\nint compare_c_asc(const void* a, const void* b) {\n    return *((char*)a) < *((char*)b) ? -1 : 1;\n}\n\nint compare_c_desc(const void* a, const void* b) {\n    return *((char*)a) > * ((char*)b) ? -1 : 1;\n}\n\nint compare_dp_asc(const void* a, const void* b) {\n    return *((double*)a) < *((double*)b) ? -1 : 1;\n}\n\nstatic uint64_t modinvU64(const uint64_t a, const uint64_t m) {\n    int64_t aa = (int64_t)a;\n    const int64_t mm = (int64_t)m;\n    int64_t b = mm;\n    int64_t u = 1;\n    int64_t v = 0;\n\n    while (b != 0) {\n        const int64_t t = aa / b;\n\n        aa -= t * b;\n        SWAP(uint64_t, aa, b);\n        u -= t * v;\n        SWAP(uint64_t, u, v);\n    }\n\n    u %= mm;\n    if (u < 0) {\n        u += m;\n    }\n\n    return (uint64_t)u;\n}\n\nstatic size_t powSz(const size_t base, const size_t exp) {\n    if (exp == 0) {\n        return 1;\n    }\n\n    if (exp == 1) {\n        return base;\n    }\n\n    if (exp % 2 == 0) {\n        return powSz(base * base, exp / 2);\n    }\n    else {\n        return base * powSz(base, exp - 1);\n    }\n}\n\nstatic size_t comb(const size_t n, const size_t r) {\n    size_t result = 1;\n\n    for (size_t i = 0; i < r; i++) {\n        result *= n - i;\n        result /= i + 1;\n    }\n\n    return result;\n}\n\nstatic uint64_t combU64(const uint64_t n, const uint64_t r) {\n    uint64_t result = 1;\n\n    for (uint64_t i = 0; i < r; i++) {\n        result *= n - i;\n        result /= i + 1;\n    }\n\n    return result;\n}\n\nstatic uint64_t combU64WMod(const uint64_t n, const uint64_t r, const uint64_t m) {\n    uint64_t result = 1;\n\n    for (uint64_t i = 0; i < r; i++) {\n        result = result * (n - i) % m;\n        result = result * modinvU64(i + 1, m) % m;\n    }\n\n    return result;\n}\n\nstatic uint64_t permU64WMod(const uint64_t n, const uint64_t m) {\n    uint64_t result = 1;\n\n    for (uint64_t v = 2; v <= n; v++) {\n        result *= v;\n        result %= m;\n    }\n\n    return result;\n}\n\nstatic size_t gcdZu(size_t m, size_t n) {\n    size_t temp;\n\n    while (m % n != 0) {\n        temp = n;\n        n = m % n;\n        m = temp;\n    }\n\n    return n;\n}\n\nstatic uint64_t gcdU64(uint64_t m, uint64_t n)\n{\n    uint64_t temp;\n\n    while (m % n != 0) {\n        temp = n;\n        n = m % n;\n        m = temp;\n    }\n\n    return n;\n}\n\ntypedef struct {\n    uint64_t val;\n}BHeap_Val;\n\n#define BHEAP_VAL_TYPE BHeap_Val\n\n#define BHEAP_INVALID_NODE ((size_t)100000000)\n\ntypedef struct {\n    BHEAP_VAL_TYPE val;\n} BHeap_Node;\n\n\nstruct _BHeap_Ctx {\n    size_t size;\n    int (*compare)(const BHEAP_VAL_TYPE* parent, const BHEAP_VAL_TYPE* node);\n    void(*notifyNodeChange)(const struct _BHeap_Ctx* const ctx, const size_t nodeListSize, const size_t* const nodeList);\n    BHeap_Node* node;\n};\n\ntypedef struct _BHeap_Ctx BHeap_Ctx;\n\nstatic void bHeap_Init(BHeap_Ctx* const ctx, int(*compare)(const BHEAP_VAL_TYPE* parent, const BHEAP_VAL_TYPE* node), void(*notifyNodeChange)(const BHeap_Ctx* const ctx, const size_t nodeListSize, const size_t* const nodeList), BHeap_Node* const nodes) {\n    ctx->size = 0;\n    ctx->compare = compare;\n    ctx->notifyNodeChange = notifyNodeChange;\n    ctx->node = nodes;\n}\n\nstatic void bHeap_Swap(BHeap_Ctx* const ctx, const size_t node0, const size_t node1) {\n    const BHEAP_VAL_TYPE tmp = ctx->node[node0].val;\n    ctx->node[node0].val = ctx->node[node1].val;\n    ctx->node[node1].val = tmp;\n\n    if (ctx->notifyNodeChange != NULL) {\n        const size_t nodeList[2] = { node0,node1 };\n        ctx->notifyNodeChange(ctx, 2, nodeList);\n    }\n}\n\nstatic void bHeap_UpHeap(BHeap_Ctx* const ctx, const size_t nodeIdx) {\n    if (nodeIdx == 0) {\n        return;\n    }\n\n    const size_t parentIdx = (nodeIdx + 1) / 2 - 1;\n\n    const int compareResult = ctx->compare(&(ctx->node[parentIdx].val), &(ctx->node[nodeIdx].val));\n\n    if (0 < compareResult) {\n        bHeap_Swap(ctx, nodeIdx, parentIdx);\n\n        if (parentIdx != 0) {\n            bHeap_UpHeap(ctx, parentIdx);\n        }\n    }\n}\n\nstatic void bHeap_DownHeap(BHeap_Ctx* const ctx, const size_t nodeIdx) {\n    if (ctx->size - 1 <= nodeIdx) {\n        return;\n    }\n\n    const size_t leftIdx = 2 * (nodeIdx + 1) - 1;\n\n    if (leftIdx < ctx->size) {\n        const int leftResult = ctx->compare(&(ctx->node[nodeIdx].val), &(ctx->node[leftIdx].val));\n\n        size_t swapTarget = leftResult < 0 ? BHEAP_INVALID_NODE : leftIdx;\n\n        const size_t rightIdx = leftIdx + 1;\n\n        if (rightIdx < ctx->size) {\n            const int rightResult = ctx->compare(&(ctx->node[nodeIdx].val), &(ctx->node[rightIdx].val));\n\n            if (swapTarget == BHEAP_INVALID_NODE) {\n                if (0 < rightResult) {\n                    swapTarget = rightIdx;\n                }\n            }\n            else {\n                if (0 < rightResult) {\n                    const int rightLeftResult = ctx->compare(&(ctx->node[leftIdx].val), &(ctx->node[rightIdx].val));\n\n                    if (0 < rightLeftResult) {\n                        swapTarget = rightIdx;\n                    }\n                }\n            }\n        }\n\n        if (swapTarget != BHEAP_INVALID_NODE) {\n            bHeap_Swap(ctx, nodeIdx, swapTarget);\n\n            bHeap_DownHeap(ctx, swapTarget);\n        }\n    }\n}\n\nstatic void bHeap_Add(BHeap_Ctx* const ctx, const BHEAP_VAL_TYPE val) {\n    ctx->node[ctx->size].val = val;\n\n    ctx->size++;\n\n    if (ctx->notifyNodeChange != NULL) {\n        const size_t node = ctx->size - 1;\n        ctx->notifyNodeChange(ctx, 1, &node);\n    }\n\n    bHeap_UpHeap(ctx, ctx->size - 1);\n}\n\nstatic void bHeap_RemoveTop(BHeap_Ctx* const ctx) {\n    if (ctx->size == 0) {\n        return;\n    }\n\n    if (ctx->size == 1) {\n        ctx->size--;\n        return;\n    }\n\n    ctx->node[0].val = ctx->node[ctx->size - 1].val;\n\n    if (ctx->notifyNodeChange != NULL) {\n        const size_t node = 0;\n        ctx->notifyNodeChange(ctx, 1, &node);\n    }\n\n    ctx->size--;\n\n    bHeap_DownHeap(ctx, 0);\n}\n\nstatic void bHeap_RemoveNode(BHeap_Ctx* const ctx, const size_t node) {\n    if (node == ctx->size - 1) {\n        ctx->size--;\n    }\n    else {\n        ctx->node[node].val = ctx->node[ctx->size - 1].val;\n\n        ctx->size--;\n\n        if (ctx->notifyNodeChange != NULL) {\n            ctx->notifyNodeChange(ctx, 1, &node);\n        }\n\n        bHeap_DownHeap(ctx, node);\n        bHeap_UpHeap(ctx, node);\n    }\n}\n\nstatic BHEAP_VAL_TYPE* bHeap_GetTopVal(const BHeap_Ctx* const ctx) {\n    return ctx->size == 0 ? NULL : &(ctx->node[0].val);\n}\n\ntypedef struct {\n    uint64_t cnt;\n    size_t* child;\n    size_t numChild;\n    size_t maxNumChild;\n} Tree_Node;\n\n#define TREE_INIT_ALLOC (128)\n\nstatic Tree_Node tree_Node[200000];\n\nstatic void tree_Init(const uint64_t N) {\n    for (uint64_t i = 0; i < N; i++) {\n        tree_Node[i].cnt = 0;\n        tree_Node[i].numChild = 0;\n        tree_Node[i].child = malloc(sizeof(size_t) * TREE_INIT_ALLOC);\n        tree_Node[i].maxNumChild = TREE_INIT_ALLOC;\n    }\n}\n\nstatic void tree_AddChild(const size_t parent, const size_t child) {\n    if (tree_Node[parent].maxNumChild <= tree_Node[parent].numChild) {\n        tree_Node[parent].child = realloc(tree_Node[parent].child, sizeof(size_t) * tree_Node[parent].maxNumChild * 2);\n        tree_Node[parent].maxNumChild *= 2;\n    }\n\n    tree_Node[parent].child[tree_Node[parent].numChild] = child;\n    tree_Node[parent].numChild++;\n}\n\nstatic BHeap_Node BN_Asc[200000];\nstatic BHeap_Node BN_Desc[200000];\n\nstatic int _bHeap_Compare_Asc(const BHEAP_VAL_TYPE* parent, const BHEAP_VAL_TYPE* node) {\n    return parent->val <= node->val ? -1 : 1;\n}\n\nstatic int _bHeap_Compare_Desc(const BHEAP_VAL_TYPE* parent, const BHEAP_VAL_TYPE* node) {\n    return parent->val >= node->val ? -1 : 1;\n}\n\nstatic size_t PBHeap_Asc_Idx[200000];\nstatic size_t PBHeap_Desc_Idx[200000];\n\nstatic void _bHeap_NotifyNodeChange_Asc(const BHeap_Ctx* const ctx, const size_t nodeListSize, const size_t* const nodeList) {\n    for (size_t i = 0; i < nodeListSize; i++) {\n        PBHeap_Asc_Idx[ctx->node[nodeList[i]].val.val] = nodeList[i];\n    }\n}\n\nstatic void _bHeap_NotifyNodeChange_Desc(const BHeap_Ctx* const ctx, const size_t nodeListSize, const size_t* const nodeList) {\n    for (size_t i = 0; i < nodeListSize; i++) {\n        PBHeap_Desc_Idx[ctx->node[nodeList[i]].val.val] = nodeList[i];\n    }\n}\n\n#define MOD_VAL (UINT64_C(1000000007))\n\nstatic uint64_t cnt[2][1000001];\n\nint main(void) {\n    uint64_t A, B;\n\n    scanf(\"%\"PRIu64\"%\"PRIu64, &A, &B);\n\n    for (uint64_t i = 0; i <= 1000000; i++) {\n        cnt[0][i] = 0;\n        cnt[1][i] = 0;\n    }\n\n    uint64_t divisor = 2;\n    while (1 < A) {\n        if (A % divisor == 0) {\n            cnt[0][divisor]++;\n\n            A /= divisor;\n        }\n        else {\n            divisor++;\n        }\n    }\n\n    divisor = 2;\n\n    uint64_t res = 0;\n\n    while (1 < B) {\n        if (B % divisor == 0) {\n            cnt[1][divisor]++;\n\n            B /= divisor;\n        }\n        else {\n            if (0 < cnt[0][divisor] && 0 < cnt[1][divisor]) {\n                res++;\n            }\n\n            divisor++;\n        }\n    }\n\n    printf(\"%\"PRIu64, res + 1);\n\n    return 0;\n}\n", "language": "C", "metadata": {"date": 1569720379, "filename_ext": "c", "original_language": "C (Clang 3.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/C/s819798281.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s819798281", "user_id": "u615782628"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "#include <stdbool.h>\n#include <stdio.h>\n#include <stdlib.h>\n#include <inttypes.h>\n#include <ctype.h>\n#include <stdint.h>\n#include <string.h>\n#include <wchar.h>\n#include <math.h>\n\n#define N_MAX (100)\n#define P_MAX (100)\n#define DP_ARRAY_SIZE (N_MAX * P_MAX / 32 + 1)\n\n#define MIN(a, b) ((a) < (b) ? (a) : (b))\n#define MAX(a, b) ((a) > (b) ? (a) : (b))\n#define ABS(a) ((a) < 0 ? -(a) : (a))\n#define ABSS(a, b) ((a) > (b) ? (a) - (b) : (b) - (a))\n#define SWAP(type, a, b) { const type tmp = a; a = b; b = tmp; }\n\nint compare_sz_asc(const void* a, const void* b) {\n    return *((size_t*)a) < *((size_t*)b) ? -1 : 1;\n}\n\nint compare_sz_desc(const void* a, const void* b) {\n    return *((size_t*)a) > * ((size_t*)b) ? -1 : 1;\n}\n\nint compare_i64_asc(const void* a, const void* b) {\n    return *((int64_t*)a) < *((int64_t*)b) ? -1 : 1;\n}\n\nint compare_i64_desc(const void* a, const void* b) {\n    return *((int64_t*)a) > * ((int64_t*)b) ? -1 : 1;\n}\n\nint compare_u64_asc(const void* a, const void* b) {\n    return *((uint64_t*)a) < *((uint64_t*)b) ? -1 : 1;\n}\n\nint compare_u64_desc(const void* a, const void* b) {\n    return *((uint64_t*)a) > * ((uint64_t*)b) ? -1 : 1;\n}\n\nint compare_c_asc(const void* a, const void* b) {\n    return *((char*)a) < *((char*)b) ? -1 : 1;\n}\n\nint compare_c_desc(const void* a, const void* b) {\n    return *((char*)a) > * ((char*)b) ? -1 : 1;\n}\n\nint compare_dp_asc(const void* a, const void* b) {\n    return *((double*)a) < *((double*)b) ? -1 : 1;\n}\n\nstatic uint64_t modinvU64(const uint64_t a, const uint64_t m) {\n    int64_t aa = (int64_t)a;\n    const int64_t mm = (int64_t)m;\n    int64_t b = mm;\n    int64_t u = 1;\n    int64_t v = 0;\n\n    while (b != 0) {\n        const int64_t t = aa / b;\n\n        aa -= t * b;\n        SWAP(uint64_t, aa, b);\n        u -= t * v;\n        SWAP(uint64_t, u, v);\n    }\n\n    u %= mm;\n    if (u < 0) {\n        u += m;\n    }\n\n    return (uint64_t)u;\n}\n\nstatic size_t powSz(const size_t base, const size_t exp) {\n    if (exp == 0) {\n        return 1;\n    }\n\n    if (exp == 1) {\n        return base;\n    }\n\n    if (exp % 2 == 0) {\n        return powSz(base * base, exp / 2);\n    }\n    else {\n        return base * powSz(base, exp - 1);\n    }\n}\n\nstatic size_t comb(const size_t n, const size_t r) {\n    size_t result = 1;\n\n    for (size_t i = 0; i < r; i++) {\n        result *= n - i;\n        result /= i + 1;\n    }\n\n    return result;\n}\n\nstatic uint64_t combU64(const uint64_t n, const uint64_t r) {\n    uint64_t result = 1;\n\n    for (uint64_t i = 0; i < r; i++) {\n        result *= n - i;\n        result /= i + 1;\n    }\n\n    return result;\n}\n\nstatic uint64_t combU64WMod(const uint64_t n, const uint64_t r, const uint64_t m) {\n    uint64_t result = 1;\n\n    for (uint64_t i = 0; i < r; i++) {\n        result = result * (n - i) % m;\n        result = result * modinvU64(i + 1, m) % m;\n    }\n\n    return result;\n}\n\nstatic uint64_t permU64WMod(const uint64_t n, const uint64_t m) {\n    uint64_t result = 1;\n\n    for (uint64_t v = 2; v <= n; v++) {\n        result *= v;\n        result %= m;\n    }\n\n    return result;\n}\n\nstatic size_t gcdZu(size_t m, size_t n) {\n    size_t temp;\n\n    while (m % n != 0) {\n        temp = n;\n        n = m % n;\n        m = temp;\n    }\n\n    return n;\n}\n\nstatic uint64_t gcdU64(uint64_t m, uint64_t n)\n{\n    uint64_t temp;\n\n    while (m % n != 0) {\n        temp = n;\n        n = m % n;\n        m = temp;\n    }\n\n    return n;\n}\n\ntypedef struct {\n    uint64_t val;\n}BHeap_Val;\n\n#define BHEAP_VAL_TYPE BHeap_Val\n\n#define BHEAP_INVALID_NODE ((size_t)100000000)\n\ntypedef struct {\n    BHEAP_VAL_TYPE val;\n} BHeap_Node;\n\n\nstruct _BHeap_Ctx {\n    size_t size;\n    int (*compare)(const BHEAP_VAL_TYPE* parent, const BHEAP_VAL_TYPE* node);\n    void(*notifyNodeChange)(const struct _BHeap_Ctx* const ctx, const size_t nodeListSize, const size_t* const nodeList);\n    BHeap_Node* node;\n};\n\ntypedef struct _BHeap_Ctx BHeap_Ctx;\n\nstatic void bHeap_Init(BHeap_Ctx* const ctx, int(*compare)(const BHEAP_VAL_TYPE* parent, const BHEAP_VAL_TYPE* node), void(*notifyNodeChange)(const BHeap_Ctx* const ctx, const size_t nodeListSize, const size_t* const nodeList), BHeap_Node* const nodes) {\n    ctx->size = 0;\n    ctx->compare = compare;\n    ctx->notifyNodeChange = notifyNodeChange;\n    ctx->node = nodes;\n}\n\nstatic void bHeap_Swap(BHeap_Ctx* const ctx, const size_t node0, const size_t node1) {\n    const BHEAP_VAL_TYPE tmp = ctx->node[node0].val;\n    ctx->node[node0].val = ctx->node[node1].val;\n    ctx->node[node1].val = tmp;\n\n    if (ctx->notifyNodeChange != NULL) {\n        const size_t nodeList[2] = { node0,node1 };\n        ctx->notifyNodeChange(ctx, 2, nodeList);\n    }\n}\n\nstatic void bHeap_UpHeap(BHeap_Ctx* const ctx, const size_t nodeIdx) {\n    if (nodeIdx == 0) {\n        return;\n    }\n\n    const size_t parentIdx = (nodeIdx + 1) / 2 - 1;\n\n    const int compareResult = ctx->compare(&(ctx->node[parentIdx].val), &(ctx->node[nodeIdx].val));\n\n    if (0 < compareResult) {\n        bHeap_Swap(ctx, nodeIdx, parentIdx);\n\n        if (parentIdx != 0) {\n            bHeap_UpHeap(ctx, parentIdx);\n        }\n    }\n}\n\nstatic void bHeap_DownHeap(BHeap_Ctx* const ctx, const size_t nodeIdx) {\n    if (ctx->size - 1 <= nodeIdx) {\n        return;\n    }\n\n    const size_t leftIdx = 2 * (nodeIdx + 1) - 1;\n\n    if (leftIdx < ctx->size) {\n        const int leftResult = ctx->compare(&(ctx->node[nodeIdx].val), &(ctx->node[leftIdx].val));\n\n        size_t swapTarget = leftResult < 0 ? BHEAP_INVALID_NODE : leftIdx;\n\n        const size_t rightIdx = leftIdx + 1;\n\n        if (rightIdx < ctx->size) {\n            const int rightResult = ctx->compare(&(ctx->node[nodeIdx].val), &(ctx->node[rightIdx].val));\n\n            if (swapTarget == BHEAP_INVALID_NODE) {\n                if (0 < rightResult) {\n                    swapTarget = rightIdx;\n                }\n            }\n            else {\n                if (0 < rightResult) {\n                    const int rightLeftResult = ctx->compare(&(ctx->node[leftIdx].val), &(ctx->node[rightIdx].val));\n\n                    if (0 < rightLeftResult) {\n                        swapTarget = rightIdx;\n                    }\n                }\n            }\n        }\n\n        if (swapTarget != BHEAP_INVALID_NODE) {\n            bHeap_Swap(ctx, nodeIdx, swapTarget);\n\n            bHeap_DownHeap(ctx, swapTarget);\n        }\n    }\n}\n\nstatic void bHeap_Add(BHeap_Ctx* const ctx, const BHEAP_VAL_TYPE val) {\n    ctx->node[ctx->size].val = val;\n\n    ctx->size++;\n\n    if (ctx->notifyNodeChange != NULL) {\n        const size_t node = ctx->size - 1;\n        ctx->notifyNodeChange(ctx, 1, &node);\n    }\n\n    bHeap_UpHeap(ctx, ctx->size - 1);\n}\n\nstatic void bHeap_RemoveTop(BHeap_Ctx* const ctx) {\n    if (ctx->size == 0) {\n        return;\n    }\n\n    if (ctx->size == 1) {\n        ctx->size--;\n        return;\n    }\n\n    ctx->node[0].val = ctx->node[ctx->size - 1].val;\n\n    if (ctx->notifyNodeChange != NULL) {\n        const size_t node = 0;\n        ctx->notifyNodeChange(ctx, 1, &node);\n    }\n\n    ctx->size--;\n\n    bHeap_DownHeap(ctx, 0);\n}\n\nstatic void bHeap_RemoveNode(BHeap_Ctx* const ctx, const size_t node) {\n    if (node == ctx->size - 1) {\n        ctx->size--;\n    }\n    else {\n        ctx->node[node].val = ctx->node[ctx->size - 1].val;\n\n        ctx->size--;\n\n        if (ctx->notifyNodeChange != NULL) {\n            ctx->notifyNodeChange(ctx, 1, &node);\n        }\n\n        bHeap_DownHeap(ctx, node);\n        bHeap_UpHeap(ctx, node);\n    }\n}\n\nstatic BHEAP_VAL_TYPE* bHeap_GetTopVal(const BHeap_Ctx* const ctx) {\n    return ctx->size == 0 ? NULL : &(ctx->node[0].val);\n}\n\ntypedef struct {\n    uint64_t cnt;\n    size_t* child;\n    size_t numChild;\n    size_t maxNumChild;\n} Tree_Node;\n\n#define TREE_INIT_ALLOC (128)\n\nstatic Tree_Node tree_Node[200000];\n\nstatic void tree_Init(const uint64_t N) {\n    for (uint64_t i = 0; i < N; i++) {\n        tree_Node[i].cnt = 0;\n        tree_Node[i].numChild = 0;\n        tree_Node[i].child = malloc(sizeof(size_t) * TREE_INIT_ALLOC);\n        tree_Node[i].maxNumChild = TREE_INIT_ALLOC;\n    }\n}\n\nstatic void tree_AddChild(const size_t parent, const size_t child) {\n    if (tree_Node[parent].maxNumChild <= tree_Node[parent].numChild) {\n        tree_Node[parent].child = realloc(tree_Node[parent].child, sizeof(size_t) * tree_Node[parent].maxNumChild * 2);\n        tree_Node[parent].maxNumChild *= 2;\n    }\n\n    tree_Node[parent].child[tree_Node[parent].numChild] = child;\n    tree_Node[parent].numChild++;\n}\n\nstatic BHeap_Node BN_Asc[200000];\nstatic BHeap_Node BN_Desc[200000];\n\nstatic int _bHeap_Compare_Asc(const BHEAP_VAL_TYPE* parent, const BHEAP_VAL_TYPE* node) {\n    return parent->val <= node->val ? -1 : 1;\n}\n\nstatic int _bHeap_Compare_Desc(const BHEAP_VAL_TYPE* parent, const BHEAP_VAL_TYPE* node) {\n    return parent->val >= node->val ? -1 : 1;\n}\n\nstatic size_t PBHeap_Asc_Idx[200000];\nstatic size_t PBHeap_Desc_Idx[200000];\n\nstatic void _bHeap_NotifyNodeChange_Asc(const BHeap_Ctx* const ctx, const size_t nodeListSize, const size_t* const nodeList) {\n    for (size_t i = 0; i < nodeListSize; i++) {\n        PBHeap_Asc_Idx[ctx->node[nodeList[i]].val.val] = nodeList[i];\n    }\n}\n\nstatic void _bHeap_NotifyNodeChange_Desc(const BHeap_Ctx* const ctx, const size_t nodeListSize, const size_t* const nodeList) {\n    for (size_t i = 0; i < nodeListSize; i++) {\n        PBHeap_Desc_Idx[ctx->node[nodeList[i]].val.val] = nodeList[i];\n    }\n}\n\n#define MOD_VAL (UINT64_C(1000000007))\n\nstatic uint64_t cnt[2][1000001];\n\nint main(void) {\n    uint64_t A, B;\n\n    scanf(\"%\"PRIu64\"%\"PRIu64, &A, &B);\n\n    for (uint64_t i = 0; i <= 1000000; i++) {\n        cnt[0][i] = 0;\n        cnt[1][i] = 0;\n    }\n\n    uint64_t divisor = 2;\n    while (1 < A) {\n        if (A % divisor == 0) {\n            cnt[0][divisor]++;\n\n            A /= divisor;\n        }\n        else {\n            divisor++;\n        }\n    }\n\n    divisor = 2;\n\n    uint64_t res = 0;\n\n    while (1 < B) {\n        if (B % divisor == 0) {\n            cnt[1][divisor]++;\n\n            B /= divisor;\n        }\n        else {\n            if (0 < cnt[0][divisor] && 0 < cnt[1][divisor]) {\n                res++;\n            }\n\n            divisor++;\n        }\n    }\n\n    printf(\"%\"PRIu64, res + 1);\n\n    return 0;\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": 10179, "cpu_time_ms": 2103, "memory_kb": 15744}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s474701492", "group_id": "codeNet:p02909", "input_text": "#include<stdio.h>\n \nint main(){\n  char S[6];\n  scanf(\"%s\",S);\n  if(S[0]=='S')\n    printf(\"Cloudy\\n\");\n  else if(S[0]=='R')\n    printf(\"Sunny\\n\");\n  else\n    printf(\"Rainy\\n\");\n  \n  return 0;\n}", "language": "C", "metadata": {"date": 1572153344, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "problem_description_relpath": "problem_descriptions/p02909.html", "problem_id": "p02909", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02909/input.txt", "sample_output_relpath": "derived/input_output/data/p02909/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02909/C/s474701492.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s474701492", "user_id": "u272618329"}, "prompt_components": {"gold_output": "Cloudy\n", "input_to_evaluate": "#include<stdio.h>\n \nint main(){\n  char S[6];\n  scanf(\"%s\",S);\n  if(S[0]=='S')\n    printf(\"Cloudy\\n\");\n  else if(S[0]=='R')\n    printf(\"Sunny\\n\");\n  else\n    printf(\"Rainy\\n\");\n  \n  return 0;\n}", "problem_context": "Score: 100 points\n\nProblem Statement\n\nThe weather in Takahashi's town changes day by day, in the following cycle: Sunny, Cloudy, Rainy, Sunny, Cloudy, Rainy, ...\n\nGiven is a string S representing the weather in the town today. Predict the weather tomorrow.\n\nConstraints\n\nS is Sunny, Cloudy, or Rainy.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint a string representing the expected weather tomorrow, in the same format in which input is given.\n\nSample Input 1\n\nSunny\n\nSample Output 1\n\nCloudy\n\nIn Takahashi's town, a sunny day is followed by a cloudy day.\n\nSample Input 2\n\nRainy\n\nSample Output 2\n\nSunny", "sample_input": "Sunny\n"}, "reference_outputs": ["Cloudy\n"], "source_document_id": "p02909", "source_text": "Score: 100 points\n\nProblem Statement\n\nThe weather in Takahashi's town changes day by day, in the following cycle: Sunny, Cloudy, Rainy, Sunny, Cloudy, Rainy, ...\n\nGiven is a string S representing the weather in the town today. Predict the weather tomorrow.\n\nConstraints\n\nS is Sunny, Cloudy, or Rainy.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint a string representing the expected weather tomorrow, in the same format in which input is given.\n\nSample Input 1\n\nSunny\n\nSample Output 1\n\nCloudy\n\nIn Takahashi's town, a sunny day is followed by a cloudy day.\n\nSample Input 2\n\nRainy\n\nSample Output 2\n\nSunny", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 192, "cpu_time_ms": 2, "memory_kb": 256}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s691412921", "group_id": "codeNet:p02910", "input_text": "#include <stdio.h>\n \nint main() {\n     char dance[101];\n     scanf(\"%s\", dance);\n     for (int i = 0; i != '\\0'; i++) {\n \n          if ((i+1)%2 != 0) {\n               if (dance[i] == 'L' || dance[i] == 'U' || dance[i] == 'D') {\n                    continue;\n               } else {\n                    printf(\"No\\n\");\n                    return 0;\n               }\n          }\n          else {\n               if (dance[i] == 'R' || dance[i] == 'U' || dance[i] == 'D') {\n                    continue;\n               } else {\n                    printf(\"No\\n\");\n                    return 0;\n               }\n          }\n \n     }\n     printf(\"Yes\\n\");\n \n     return 0;\n}", "language": "C", "metadata": {"date": 1568598562, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "problem_description_relpath": "problem_descriptions/p02910.html", "problem_id": "p02910", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02910/input.txt", "sample_output_relpath": "derived/input_output/data/p02910/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02910/C/s691412921.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s691412921", "user_id": "u429368318"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "#include <stdio.h>\n \nint main() {\n     char dance[101];\n     scanf(\"%s\", dance);\n     for (int i = 0; i != '\\0'; i++) {\n \n          if ((i+1)%2 != 0) {\n               if (dance[i] == 'L' || dance[i] == 'U' || dance[i] == 'D') {\n                    continue;\n               } else {\n                    printf(\"No\\n\");\n                    return 0;\n               }\n          }\n          else {\n               if (dance[i] == 'R' || dance[i] == 'U' || dance[i] == 'D') {\n                    continue;\n               } else {\n                    printf(\"No\\n\");\n                    return 0;\n               }\n          }\n \n     }\n     printf(\"Yes\\n\");\n \n     return 0;\n}", "problem_context": "Score: 200 points\n\nProblem Statement\n\nTakahashi will do a tap dance. The dance is described by a string S where each character is L, R, U, or D. These characters indicate the positions on which Takahashi should step. He will follow these instructions one by one in order, starting with the first character.\n\nS is said to be easily playable if and only if it satisfies both of the following conditions:\n\nEvery character in an odd position (1-st, 3-rd, 5-th, \\ldots) is R, U, or D.\n\nEvery character in an even position (2-nd, 4-th, 6-th, \\ldots) is L, U, or D.\n\nYour task is to print Yes if S is easily playable, and No otherwise.\n\nConstraints\n\nS is a string of length between 1 and 100 (inclusive).\n\nEach character of S is L, R, U, or D.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint Yes if S is easily playable, and No otherwise.\n\nSample Input 1\n\nRUDLUDR\n\nSample Output 1\n\nYes\n\nEvery character in an odd position (1-st, 3-rd, 5-th, 7-th) is R, U, or D.\n\nEvery character in an even position (2-nd, 4-th, 6-th) is L, U, or D.\n\nThus, S is easily playable.\n\nSample Input 2\n\nDULL\n\nSample Output 2\n\nNo\n\nThe 3-rd character is not R, U, nor D, so S is not easily playable.\n\nSample Input 3\n\nUUUUUUUUUUUUUUU\n\nSample Output 3\n\nYes\n\nSample Input 4\n\nULURU\n\nSample Output 4\n\nNo\n\nSample Input 5\n\nRDULULDURURLRDULRLR\n\nSample Output 5\n\nYes", "sample_input": "RUDLUDR\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p02910", "source_text": "Score: 200 points\n\nProblem Statement\n\nTakahashi will do a tap dance. The dance is described by a string S where each character is L, R, U, or D. These characters indicate the positions on which Takahashi should step. He will follow these instructions one by one in order, starting with the first character.\n\nS is said to be easily playable if and only if it satisfies both of the following conditions:\n\nEvery character in an odd position (1-st, 3-rd, 5-th, \\ldots) is R, U, or D.\n\nEvery character in an even position (2-nd, 4-th, 6-th, \\ldots) is L, U, or D.\n\nYour task is to print Yes if S is easily playable, and No otherwise.\n\nConstraints\n\nS is a string of length between 1 and 100 (inclusive).\n\nEach character of S is L, R, U, or D.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint Yes if S is easily playable, and No otherwise.\n\nSample Input 1\n\nRUDLUDR\n\nSample Output 1\n\nYes\n\nEvery character in an odd position (1-st, 3-rd, 5-th, 7-th) is R, U, or D.\n\nEvery character in an even position (2-nd, 4-th, 6-th) is L, U, or D.\n\nThus, S is easily playable.\n\nSample Input 2\n\nDULL\n\nSample Output 2\n\nNo\n\nThe 3-rd character is not R, U, nor D, so S is not easily playable.\n\nSample Input 3\n\nUUUUUUUUUUUUUUU\n\nSample Output 3\n\nYes\n\nSample Input 4\n\nULURU\n\nSample Output 4\n\nNo\n\nSample Input 5\n\nRDULULDURURLRDULRLR\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": 668, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s294334109", "group_id": "codeNet:p02915", "input_text": "#include <stdio.h>\n#include <math.h>\n\nint main(void){\n    int n;\n\n    scanf(\"%d\", &n);\n\n    printf(\"%d\\n\", (int)pow(n, 3));\n\n    return 0;\n}\n", "language": "C", "metadata": {"date": 1592186578, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "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/C/s294334109.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s294334109", "user_id": "u906918812"}, "prompt_components": {"gold_output": "8\n", "input_to_evaluate": "#include <stdio.h>\n#include <math.h>\n\nint main(void){\n    int n;\n\n    scanf(\"%d\", &n);\n\n    printf(\"%d\\n\", (int)pow(n, 3));\n\n    return 0;\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": 141, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s359143866", "group_id": "codeNet:p02915", "input_text": "#include <stdio.h>\n\nint main(){\n\tint N;\n  \tscanf(\"%d\", &N);\n  \tprintf(\"%d\", N*N*N);\n}", "language": "C", "metadata": {"date": 1589916828, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "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/C/s359143866.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s359143866", "user_id": "u815628714"}, "prompt_components": {"gold_output": "8\n", "input_to_evaluate": "#include <stdio.h>\n\nint main(){\n\tint N;\n  \tscanf(\"%d\", &N);\n  \tprintf(\"%d\", N*N*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": 85, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s832040925", "group_id": "codeNet:p02915", "input_text": "#include <stdio.h>\nint main(void){\n    int n;\n    scanf(\"%d\",&n);\n    printf(\"%d\\n\",2<<(n-1));\n    return 0;\n}", "language": "C", "metadata": {"date": 1576363171, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "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/C/s832040925.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s832040925", "user_id": "u592248346"}, "prompt_components": {"gold_output": "8\n", "input_to_evaluate": "#include <stdio.h>\nint main(void){\n    int n;\n    scanf(\"%d\",&n);\n    printf(\"%d\\n\",2<<(n-1));\n    return 0;\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": 110, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s756330671", "group_id": "codeNet:p02915", "input_text": "#include<stdio.h>\nint main(){\n  int a,b;\n  \n  \n  scanf(\"%d\",&a);\n  b=a*a*a;\n  printf(\"%d\",b);\n  return 0;}", "language": "C", "metadata": {"date": 1570125856, "filename_ext": "c", "original_language": "C (Clang 3.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/C/s756330671.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s756330671", "user_id": "u462460862"}, "prompt_components": {"gold_output": "8\n", "input_to_evaluate": "#include<stdio.h>\nint main(){\n  int a,b;\n  \n  \n  scanf(\"%d\",&a);\n  b=a*a*a;\n  printf(\"%d\",b);\n  return 0;}", "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": 106, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s126597987", "group_id": "codeNet:p02915", "input_text": "#include <stdio.h>\n\nint main(){\n    int n;\n    scanf(\"%d\",&n);\n    int a=1;\n    int i;\n    for(i=0;i<n;i++){\n        a=a*3;\n    }\n    printf(\"%d\",a);\n    return 0;\n}", "language": "C", "metadata": {"date": 1567904662, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "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/C/s126597987.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s126597987", "user_id": "u462639463"}, "prompt_components": {"gold_output": "8\n", "input_to_evaluate": "#include <stdio.h>\n\nint main(){\n    int n;\n    scanf(\"%d\",&n);\n    int a=1;\n    int i;\n    for(i=0;i<n;i++){\n        a=a*3;\n    }\n    printf(\"%d\",a);\n    return 0;\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": 165, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s814554285", "group_id": "codeNet:p02916", "input_text": "#include<stdio.h>\nint main()\n{\n int n;\n scanf(\"%d\",&n);\n int a[n],b[n],c[n-1];\n\n for(int i=0;i<n;i++)\n scanf(\"%d\",&a[i]);\n\n for(int i=0;i<n;i++)\n scanf(\"%d\",&b[i]);\n\n for(int i=0;i<n-1;i++)\n scanf(\"%d\",&c[i]);\n\n int count=0;\n\nfor(int i=0;i<n;i++)\n{\n    count+=b[a[i]-1];\n\n\n}\nfor(int i=1;i<n;i++)\n{\n    if(a[i]-1==a[i-1])\n        count+=c[a[i-1]-1];\n}\nprintf(\"%d\",count);\n}\n", "language": "C", "metadata": {"date": 1570885299, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "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/C/s814554285.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s814554285", "user_id": "u825102492"}, "prompt_components": {"gold_output": "14\n", "input_to_evaluate": "#include<stdio.h>\nint main()\n{\n int n;\n scanf(\"%d\",&n);\n int a[n],b[n],c[n-1];\n\n for(int i=0;i<n;i++)\n scanf(\"%d\",&a[i]);\n\n for(int i=0;i<n;i++)\n scanf(\"%d\",&b[i]);\n\n for(int i=0;i<n-1;i++)\n scanf(\"%d\",&c[i]);\n\n int count=0;\n\nfor(int i=0;i<n;i++)\n{\n    count+=b[a[i]-1];\n\n\n}\nfor(int i=1;i<n;i++)\n{\n    if(a[i]-1==a[i-1])\n        count+=c[a[i-1]-1];\n}\nprintf(\"%d\",count);\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": 373, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s322449825", "group_id": "codeNet:p02916", "input_text": "#include <stdio.h>\n\nint main(void) {\n\tint A[20];\n\tint B[50];\n\tint C[50];\n\tint N;\n\tchar As[100];\n\tchar Bs[100];\n\tchar Cs[100];\n\tscanf(\"%d\\n\", &N);\n\tfgets(As, 150, stdin);\n\tfgets(Bs, 150, stdin);\n\tfgets(Cs, 150, stdin);\n\tint i = N;\n\twhile (i > 0) {\n\t\tsscanf(As + 2*(N - i), \"%d\", &A[N - i]);\n\t\ti--;\n\t}\n\ti = N;\n\twhile (i > 0) {\n\t\tsscanf(Bs + 2*(N - i), \"%d\", &B[N - i]);\n\t\ti--;\n\t}\n\ti = N - 1;\n\twhile (i > 0) {\n\t\tsscanf(Cs + 2*(N - i - 1), \"%d\", &C[N - i - 1]);\n\t\ti--;\n\t}\n\tint sum = 0;\n\tint prev = -1;\n\tfor (int i = 0; i < N; i++) {\n\t\tsum += B[A[i] - 1];\n\t\tif (prev == A[i] - 1) {\n\t\t\tsum += C[prev - 1];\n\t\t}\n\t\tprev = A[i];\n\t}\n\tprintf(\"%d\", sum);\n\treturn 0;\n}", "language": "C", "metadata": {"date": 1569893613, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "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/C/s322449825.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s322449825", "user_id": "u500544894"}, "prompt_components": {"gold_output": "14\n", "input_to_evaluate": "#include <stdio.h>\n\nint main(void) {\n\tint A[20];\n\tint B[50];\n\tint C[50];\n\tint N;\n\tchar As[100];\n\tchar Bs[100];\n\tchar Cs[100];\n\tscanf(\"%d\\n\", &N);\n\tfgets(As, 150, stdin);\n\tfgets(Bs, 150, stdin);\n\tfgets(Cs, 150, stdin);\n\tint i = N;\n\twhile (i > 0) {\n\t\tsscanf(As + 2*(N - i), \"%d\", &A[N - i]);\n\t\ti--;\n\t}\n\ti = N;\n\twhile (i > 0) {\n\t\tsscanf(Bs + 2*(N - i), \"%d\", &B[N - i]);\n\t\ti--;\n\t}\n\ti = N - 1;\n\twhile (i > 0) {\n\t\tsscanf(Cs + 2*(N - i - 1), \"%d\", &C[N - i - 1]);\n\t\ti--;\n\t}\n\tint sum = 0;\n\tint prev = -1;\n\tfor (int i = 0; i < N; i++) {\n\t\tsum += B[A[i] - 1];\n\t\tif (prev == A[i] - 1) {\n\t\t\tsum += C[prev - 1];\n\t\t}\n\t\tprev = A[i];\n\t}\n\tprintf(\"%d\", sum);\n\treturn 0;\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": 654, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s398266390", "group_id": "codeNet:p02916", "input_text": "#include<stdio.h>\n#include<math.h>\n#include<string.h>\n\nint main()\n{\n    int n;\n    int a[50]={0},b[50]={0},c[50]={0};\n    int point = 0, bonus = 0, sumPoint = 0;\n    \n    scanf(\"%d\",&n);\n    for(int i = 1; i <= n; i++){\n        scanf(\"%d \",&a[i]);\n        // printf(\"%3d \",a[i]);\n    }\n    // printf(\"\\n\");\n    for(int i = 1; i <= n; i++){\n        scanf(\"%d \",&b[i]);\n        //  printf(\"%3d \",b[i]);\n        point += b[i];\n    }\n    // printf(\"\\n\");\n    for(int i = 1; i <= n; i++){\n        scanf(\"%d \",&c[i]);\n        //  printf(\"%3d \",c[i]);\n        bonus += c[i];\n    }\n    // printf(\"\\n\");\n\n    sumPoint = point + bonus - c[a[n]];\n    //  printf(\"%d %d/n\",a[n-1],c[a[n-1]-1]);\n    printf(\"%d\",sumPoint);\n\n\n}", "language": "C", "metadata": {"date": 1567905866, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "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/C/s398266390.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s398266390", "user_id": "u425139458"}, "prompt_components": {"gold_output": "14\n", "input_to_evaluate": "#include<stdio.h>\n#include<math.h>\n#include<string.h>\n\nint main()\n{\n    int n;\n    int a[50]={0},b[50]={0},c[50]={0};\n    int point = 0, bonus = 0, sumPoint = 0;\n    \n    scanf(\"%d\",&n);\n    for(int i = 1; i <= n; i++){\n        scanf(\"%d \",&a[i]);\n        // printf(\"%3d \",a[i]);\n    }\n    // printf(\"\\n\");\n    for(int i = 1; i <= n; i++){\n        scanf(\"%d \",&b[i]);\n        //  printf(\"%3d \",b[i]);\n        point += b[i];\n    }\n    // printf(\"\\n\");\n    for(int i = 1; i <= n; i++){\n        scanf(\"%d \",&c[i]);\n        //  printf(\"%3d \",c[i]);\n        bonus += c[i];\n    }\n    // printf(\"\\n\");\n\n    sumPoint = point + bonus - c[a[n]];\n    //  printf(\"%d %d/n\",a[n-1],c[a[n-1]-1]);\n    printf(\"%d\",sumPoint);\n\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": 712, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s489699555", "group_id": "codeNet:p02921", "input_text": "#include <stdio.h>\n\nint main(void)\n{\n        char s[4],t[4];\n        int c=0;\n\n        scanf(\"%s%s\",s,t);\n        for(int i=0;i<3;i++){\n                if(s[i]==t[i]) c++;\n        }\n        printf(\"%d\\n\",c);\n        return 0;\n}\n", "language": "C", "metadata": {"date": 1591176506, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "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/C/s489699555.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s489699555", "user_id": "u048036733"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "#include <stdio.h>\n\nint main(void)\n{\n        char s[4],t[4];\n        int c=0;\n\n        scanf(\"%s%s\",s,t);\n        for(int i=0;i<3;i++){\n                if(s[i]==t[i]) c++;\n        }\n        printf(\"%d\\n\",c);\n        return 0;\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": 228, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s091119438", "group_id": "codeNet:p02921", "input_text": "#include <stdio.h>\n#include <string.h>\n\nint main(void){\n    //input\n    char S[3];\n    scanf(\"%s\",S);\n    char T[3];\n    scanf(\"%s\",T);\n\n    //calu\n    int count = 0;\n    for(int i = 0;i < 3; i++){\n        if(strncmp(&S[i],&T[i],1)==0){\n            count++;\n        }\n    }\n\n    //output\n    printf(\"%d\",count);\n    return 0;\n}\n", "language": "C", "metadata": {"date": 1568712632, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "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/C/s091119438.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s091119438", "user_id": "u504297324"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "#include <stdio.h>\n#include <string.h>\n\nint main(void){\n    //input\n    char S[3];\n    scanf(\"%s\",S);\n    char T[3];\n    scanf(\"%s\",T);\n\n    //calu\n    int count = 0;\n    for(int i = 0;i < 3; i++){\n        if(strncmp(&S[i],&T[i],1)==0){\n            count++;\n        }\n    }\n\n    //output\n    printf(\"%d\",count);\n    return 0;\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": 328, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s705429743", "group_id": "codeNet:p02922", "input_text": "#include<stdio.h>\nint main(void)\n{\n\tint a,b,i,x,s;\n\tif (scanf(\"%d\", &a) == 1) {}\n\tif (scanf(\"%d\", &b) == 1) {}\n\ti = 1;\nif(2 <= a && 20>= a && 1<=b && 20 >= b)\n{\n\tfor(s = a;s <= b;)\n\t{\n\t\ts = (s - 1) + a;\n\t\ti++;\n\t}\n\tprintf(\"%d\\n\",i);\n}\nreturn 0;\n}", "language": "C", "metadata": {"date": 1574946317, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "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/C/s705429743.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s705429743", "user_id": "u596849669"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "#include<stdio.h>\nint main(void)\n{\n\tint a,b,i,x,s;\n\tif (scanf(\"%d\", &a) == 1) {}\n\tif (scanf(\"%d\", &b) == 1) {}\n\ti = 1;\nif(2 <= a && 20>= a && 1<=b && 20 >= b)\n{\n\tfor(s = a;s <= b;)\n\t{\n\t\ts = (s - 1) + a;\n\t\ti++;\n\t}\n\tprintf(\"%d\\n\",i);\n}\nreturn 0;\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": 245, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s217867624", "group_id": "codeNet:p02922", "input_text": "#include <stdio.h>\nint main(){\n\tint a;\n\tscanf(\"%d\",&a);\n\tint b;\n\tscanf(\"%d\",&b);\n\tb -= a;\n\tif(b <= 0){\n\t\tprintf(\"1\");\n\t\treturn 0;\n\t\t}\n\t\tint count = 1;\n\twhile(1){\n\t\tif(b > 0){\n\t\t   b -= (a - 1);\n\t\t   count++;\n\t\t   }\n\t\t   \n\t\tif(b <= 0)break;\n\t\t }\n\t\t printf(\"%d\",count);\n     return 0;\n}\n\t\t\n", "language": "C", "metadata": {"date": 1570686188, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "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/C/s217867624.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s217867624", "user_id": "u491343140"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "#include <stdio.h>\nint main(){\n\tint a;\n\tscanf(\"%d\",&a);\n\tint b;\n\tscanf(\"%d\",&b);\n\tb -= a;\n\tif(b <= 0){\n\t\tprintf(\"1\");\n\t\treturn 0;\n\t\t}\n\t\tint count = 1;\n\twhile(1){\n\t\tif(b > 0){\n\t\t   b -= (a - 1);\n\t\t   count++;\n\t\t   }\n\t\t   \n\t\tif(b <= 0)break;\n\t\t }\n\t\t printf(\"%d\",count);\n     return 0;\n}\n\t\t\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": 288, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s210761742", "group_id": "codeNet:p02922", "input_text": "#include <stdio.h>\n\nint main(void) {\n\tint A,B;\n\tint count=1,ans;\n\tscanf(\"%d %d\",&A,&B);\n\tif(A==B){\n\t\tprintf(\"1\\n\");\n\t}else{\n  \tans=A;\n  \twhile(ans<=B){\n  \tif(ans<=B){\n  \t\tans+=A-1;\n  \t\tcount++;\n  \t}\n\t}\n\t\tprintf(\"%d\",count);\n\t}\n\treturn 0;\n}\n", "language": "C", "metadata": {"date": 1570276455, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "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/C/s210761742.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s210761742", "user_id": "u527993431"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "#include <stdio.h>\n\nint main(void) {\n\tint A,B;\n\tint count=1,ans;\n\tscanf(\"%d %d\",&A,&B);\n\tif(A==B){\n\t\tprintf(\"1\\n\");\n\t}else{\n  \tans=A;\n  \twhile(ans<=B){\n  \tif(ans<=B){\n  \t\tans+=A-1;\n  \t\tcount++;\n  \t}\n\t}\n\t\tprintf(\"%d\",count);\n\t}\n\treturn 0;\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": 240, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s350290520", "group_id": "codeNet:p02922", "input_text": "#include <stdio.h>\n\nint main(){\n    int i=1, a, c, b;\n\n    scanf(\"%d %d\", &a, &b);\n    c=a;\n    if(a>=b){\n        printf(\"%d\\n\", i);\n    }\n    else{\n        for(i;c<b;++i){\n            c+=a-1;\n        }\n        printf(\"%d\\n\", i);\n    }\n    return 0;\n}\n", "language": "C", "metadata": {"date": 1567477563, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "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/C/s350290520.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s350290520", "user_id": "u017519692"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "#include <stdio.h>\n\nint main(){\n    int i=1, a, c, b;\n\n    scanf(\"%d %d\", &a, &b);\n    c=a;\n    if(a>=b){\n        printf(\"%d\\n\", i);\n    }\n    else{\n        for(i;c<b;++i){\n            c+=a-1;\n        }\n        printf(\"%d\\n\", i);\n    }\n    return 0;\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": 252, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s666312397", "group_id": "codeNet:p02924", "input_text": "#include<stdio.h>\n\nint main(){\n    long long int N,max;\n    scanf(\"%lld\",&N);\n    max = N*(N-1)/2;\n    printf(\"%lld\",max);\n    return 0;\n}", "language": "C", "metadata": {"date": 1567369142, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "problem_description_relpath": "problem_descriptions/p02924.html", "problem_id": "p02924", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02924/input.txt", "sample_output_relpath": "derived/input_output/data/p02924/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02924/C/s666312397.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s666312397", "user_id": "u557656621"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "#include<stdio.h>\n\nint main(){\n    long long int N,max;\n    scanf(\"%lld\",&N);\n    max = N*(N-1)/2;\n    printf(\"%lld\",max);\n    return 0;\n}", "problem_context": "Score : 400 points\n\nProblem Statement\n\nFor an integer N, we will choose a permutation \\{P_1, P_2, ..., P_N\\} of \\{1, 2, ..., N\\}.\n\nThen, for each i=1,2,...,N, let M_i be the remainder when i is divided by P_i.\n\nFind the maximum possible value of M_1 + M_2 + \\cdots + M_N.\n\nConstraints\n\nN is an integer satisfying 1 \\leq N \\leq 10^9.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the maximum possible value of M_1 + M_2 + \\cdots + M_N.\n\nSample Input 1\n\n2\n\nSample Output 1\n\n1\n\nWhen the permutation \\{P_1, P_2\\} = \\{2, 1\\} is chosen, M_1 + M_2 = 1 + 0 = 1.\n\nSample Input 2\n\n13\n\nSample Output 2\n\n78\n\nSample Input 3\n\n1\n\nSample Output 3\n\n0", "sample_input": "2\n"}, "reference_outputs": ["1\n"], "source_document_id": "p02924", "source_text": "Score : 400 points\n\nProblem Statement\n\nFor an integer N, we will choose a permutation \\{P_1, P_2, ..., P_N\\} of \\{1, 2, ..., N\\}.\n\nThen, for each i=1,2,...,N, let M_i be the remainder when i is divided by P_i.\n\nFind the maximum possible value of M_1 + M_2 + \\cdots + M_N.\n\nConstraints\n\nN is an integer satisfying 1 \\leq N \\leq 10^9.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the maximum possible value of M_1 + M_2 + \\cdots + M_N.\n\nSample Input 1\n\n2\n\nSample Output 1\n\n1\n\nWhen the permutation \\{P_1, P_2\\} = \\{2, 1\\} is chosen, M_1 + M_2 = 1 + 0 = 1.\n\nSample Input 2\n\n13\n\nSample Output 2\n\n78\n\nSample Input 3\n\n1\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": 138, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s490912734", "group_id": "codeNet:p02925", "input_text": "A[1000][999],I[1000],u[999];i,j;d;F=2;main(N){for(scanf(\"%d\",&N);i<N;++i)for(j=0;~j+N;)scanf(\"%d\",A[j++]+i);for(;F&2;i=N)for(++d,F=1;i--;u[i]<d&&j&&u[F&=2,--j]<d&A[I[j]][j]==i+1&&++I[u[i]=u[j]=d,++I[i],F=2,j])j=A[I[i]][i];printf(\"%d\",F*d-1);}", "language": "C", "metadata": {"date": 1567431490, "filename_ext": "c", "original_language": "C (Clang 3.8.0)", "problem_description_relpath": "problem_descriptions/p02925.html", "problem_id": "p02925", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02925/input.txt", "sample_output_relpath": "derived/input_output/data/p02925/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02925/C/s490912734.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s490912734", "user_id": "u657913472"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "A[1000][999],I[1000],u[999];i,j;d;F=2;main(N){for(scanf(\"%d\",&N);i<N;++i)for(j=0;~j+N;)scanf(\"%d\",A[j++]+i);for(;F&2;i=N)for(++d,F=1;i--;u[i]<d&&j&&u[F&=2,--j]<d&A[I[j]][j]==i+1&&++I[u[i]=u[j]=d,++I[i],F=2,j])j=A[I[i]][i];printf(\"%d\",F*d-1);}", "problem_context": "Score : 500 points\n\nProblem Statement\n\nN players will participate in a tennis tournament. We will call them Player 1, Player 2, \\ldots, Player N.\n\nThe tournament is round-robin format, and there will be N(N-1)/2 matches in total.\nIs it possible to schedule these matches so that all of the following conditions are satisfied? If the answer is yes, also find the minimum number of days required.\n\nEach player plays at most one matches in a day.\n\nEach player i (1 \\leq i \\leq N) plays one match against Player A_{i, 1}, A_{i, 2}, \\ldots, A_{i, N-1} in this order.\n\nConstraints\n\n3 \\leq N \\leq 1000\n\n1 \\leq A_{i, j} \\leq N\n\nA_{i, j} \\neq i\n\nA_{i, 1}, A_{i, 2}, \\ldots, A_{i, N-1} are all different.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_{1, 1} A_{1, 2} \\ldots A_{1, N-1}\nA_{2, 1} A_{2, 2} \\ldots A_{2, N-1}\n:\nA_{N, 1} A_{N, 2} \\ldots A_{N, N-1}\n\nOutput\n\nIf it is possible to schedule all the matches so that all of the conditions are satisfied, print the minimum number of days required; if it is impossible, print -1.\n\nSample Input 1\n\n3\n2 3\n1 3\n1 2\n\nSample Output 1\n\n3\n\nAll the conditions can be satisfied if the matches are scheduled for three days as follows:\n\nDay 1: Player 1 vs Player 2\n\nDay 2: Player 1 vs Player 3\n\nDay 3: Player 2 vs Player 3\n\nThis is the minimum number of days required.\n\nSample Input 2\n\n4\n2 3 4\n1 3 4\n4 1 2\n3 1 2\n\nSample Output 2\n\n4\n\nAll the conditions can be satisfied if the matches are scheduled for four days as follows:\n\nDay 1: Player 1 vs Player 2, Player 3 vs Player 4\n\nDay 2: Player 1 vs Player 3\n\nDay 3: Player 1 vs Player 4, Player 2 vs Player 3\n\nDay 4: Player 2 vs Player 4\n\nThis is the minimum number of days required.\n\nSample Input 3\n\n3\n2 3\n3 1\n1 2\n\nSample Output 3\n\n-1\n\nAny scheduling of the matches violates some condition.", "sample_input": "3\n2 3\n1 3\n1 2\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02925", "source_text": "Score : 500 points\n\nProblem Statement\n\nN players will participate in a tennis tournament. We will call them Player 1, Player 2, \\ldots, Player N.\n\nThe tournament is round-robin format, and there will be N(N-1)/2 matches in total.\nIs it possible to schedule these matches so that all of the following conditions are satisfied? If the answer is yes, also find the minimum number of days required.\n\nEach player plays at most one matches in a day.\n\nEach player i (1 \\leq i \\leq N) plays one match against Player A_{i, 1}, A_{i, 2}, \\ldots, A_{i, N-1} in this order.\n\nConstraints\n\n3 \\leq N \\leq 1000\n\n1 \\leq A_{i, j} \\leq N\n\nA_{i, j} \\neq i\n\nA_{i, 1}, A_{i, 2}, \\ldots, A_{i, N-1} are all different.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_{1, 1} A_{1, 2} \\ldots A_{1, N-1}\nA_{2, 1} A_{2, 2} \\ldots A_{2, N-1}\n:\nA_{N, 1} A_{N, 2} \\ldots A_{N, N-1}\n\nOutput\n\nIf it is possible to schedule all the matches so that all of the conditions are satisfied, print the minimum number of days required; if it is impossible, print -1.\n\nSample Input 1\n\n3\n2 3\n1 3\n1 2\n\nSample Output 1\n\n3\n\nAll the conditions can be satisfied if the matches are scheduled for three days as follows:\n\nDay 1: Player 1 vs Player 2\n\nDay 2: Player 1 vs Player 3\n\nDay 3: Player 2 vs Player 3\n\nThis is the minimum number of days required.\n\nSample Input 2\n\n4\n2 3 4\n1 3 4\n4 1 2\n3 1 2\n\nSample Output 2\n\n4\n\nAll the conditions can be satisfied if the matches are scheduled for four days as follows:\n\nDay 1: Player 1 vs Player 2, Player 3 vs Player 4\n\nDay 2: Player 1 vs Player 3\n\nDay 3: Player 1 vs Player 4, Player 2 vs Player 3\n\nDay 4: Player 2 vs Player 4\n\nThis is the minimum number of days required.\n\nSample Input 3\n\n3\n2 3\n3 1\n1 2\n\nSample Output 3\n\n-1\n\nAny scheduling of the matches violates some 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": 242, "cpu_time_ms": 101, "memory_kb": 4096}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s922261031", "group_id": "codeNet:p02934", "input_text": "#include <stdio.h>\n\nint main(void)\n{\n  int i, n, a[n];\n  double result = 0;\n  scanf(\"%d\", &n);\n  for( i = 0; i < n; i++ ){\n    scanf(\"%d\", &a[i]);\n  }\n  \n  for( i = 0; i < n; i++ ){\n    result += 1 / (double)a[i];\n  }\n  \n  printf(\"%lf\\n\", 1/result);\n  return 0;\n}\n  ", "language": "C", "metadata": {"date": 1583981792, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "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/C/s922261031.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s922261031", "user_id": "u904977303"}, "prompt_components": {"gold_output": "7.5\n", "input_to_evaluate": "#include <stdio.h>\n\nint main(void)\n{\n  int i, n, a[n];\n  double result = 0;\n  scanf(\"%d\", &n);\n  for( i = 0; i < n; i++ ){\n    scanf(\"%d\", &a[i]);\n  }\n  \n  for( i = 0; i < n; i++ ){\n    result += 1 / (double)a[i];\n  }\n  \n  printf(\"%lf\\n\", 1/result);\n  return 0;\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": 266, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s689332909", "group_id": "codeNet:p02934", "input_text": "/* ABC138-B\n   Takatan */\n\n#include<stdio.h>\nint main(void){\n    int number, i;\n    double answer, a;\n    answer = 0;\n\n    scanf( \"%d\" , &number);\n    for(i=0; i < number; i++){\n        scanf( \"%lf\" , &a);\n        answer += 1 / a; /* 逆数にして加算 */\n    }\n    answer = 1 / answer; /* 逆数の総和の逆数をとる */\n    printf( \"%f\\n\" , answer);\n    return 0;\n}", "language": "C", "metadata": {"date": 1568319706, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "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/C/s689332909.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s689332909", "user_id": "u438169806"}, "prompt_components": {"gold_output": "7.5\n", "input_to_evaluate": "/* ABC138-B\n   Takatan */\n\n#include<stdio.h>\nint main(void){\n    int number, i;\n    double answer, a;\n    answer = 0;\n\n    scanf( \"%d\" , &number);\n    for(i=0; i < number; i++){\n        scanf( \"%lf\" , &a);\n        answer += 1 / a; /* 逆数にして加算 */\n    }\n    answer = 1 / answer; /* 逆数の総和の逆数をとる */\n    printf( \"%f\\n\" , answer);\n    return 0;\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": 375, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s945871861", "group_id": "codeNet:p02934", "input_text": "#include <stdio.h>\n\nint main(){\n  int N,i;\n  scanf(\"%d\", &N);\n  int A[N];\n  for(i=0;i<N;i++){\n    scanf(\"%d\", &A[i]);\n  }\n  double bunbo=0,bunsi=1,seki=1;\n  for(i=0;i<N;i++){\n    bunsi = bunsi*A[i];\n  }\n  for(i=0;i<N;i++){\n    seki = seki*A[i];\n  }\n  for(i=0;i<N;i++){\n    bunbo += seki/A[i];\n  }\n  printf(\"%le\\n\", bunsi/bunbo);\n}", "language": "C", "metadata": {"date": 1567090638, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "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/C/s945871861.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s945871861", "user_id": "u848148267"}, "prompt_components": {"gold_output": "7.5\n", "input_to_evaluate": "#include <stdio.h>\n\nint main(){\n  int N,i;\n  scanf(\"%d\", &N);\n  int A[N];\n  for(i=0;i<N;i++){\n    scanf(\"%d\", &A[i]);\n  }\n  double bunbo=0,bunsi=1,seki=1;\n  for(i=0;i<N;i++){\n    bunsi = bunsi*A[i];\n  }\n  for(i=0;i<N;i++){\n    seki = seki*A[i];\n  }\n  for(i=0;i<N;i++){\n    bunbo += seki/A[i];\n  }\n  printf(\"%le\\n\", bunsi/bunbo);\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": 330, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s278442537", "group_id": "codeNet:p02934", "input_text": "#include<stdio.h>\nint main(){\n  int n, i, a;\n  double sum = 0.0, ans;\n  scanf(\"%d\", &n);\n  for(i = 0; i < n; ++i){\n    scanf(\"%d\", &a);\n    sum += 1 / a;\n  }\n  ans = 1 / sum;\n  printf(\"%f\", ans);\n  return 0;\n}", "language": "C", "metadata": {"date": 1566396185, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "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/C/s278442537.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s278442537", "user_id": "u729856984"}, "prompt_components": {"gold_output": "7.5\n", "input_to_evaluate": "#include<stdio.h>\nint main(){\n  int n, i, a;\n  double sum = 0.0, ans;\n  scanf(\"%d\", &n);\n  for(i = 0; i < n; ++i){\n    scanf(\"%d\", &a);\n    sum += 1 / a;\n  }\n  ans = 1 / sum;\n  printf(\"%f\", ans);\n  return 0;\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": 209, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s583676945", "group_id": "codeNet:p02935", "input_text": "#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\nint cmpfunc (const void * a, const void * b) {\n   return ( *(int*)a - *(int*)b );\n}\n\nint main(void) {\n    int N;\nscanf(\"%d\",&N);\nint array[N];\n\nfor (int i=0;i<N;i++)\nscanf(\"%d\",&array[i]);\n qsort(array, N, sizeof(int), cmpfunc);\n int i=0;\n float sum = (float)(array[i]+array[i+1])/2;\nfor (int i=1;i<N-1;i++){\n    sum=(sum+(float)array[i+1])/2;\n}\nprintf(\"%.10f\",sum);\nreturn EXIT_SUCCESS;\n}", "language": "C", "metadata": {"date": 1583222212, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "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/C/s583676945.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s583676945", "user_id": "u959524814"}, "prompt_components": {"gold_output": "3.5\n", "input_to_evaluate": "#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\nint cmpfunc (const void * a, const void * b) {\n   return ( *(int*)a - *(int*)b );\n}\n\nint main(void) {\n    int N;\nscanf(\"%d\",&N);\nint array[N];\n\nfor (int i=0;i<N;i++)\nscanf(\"%d\",&array[i]);\n qsort(array, N, sizeof(int), cmpfunc);\n int i=0;\n float sum = (float)(array[i]+array[i+1])/2;\nfor (int i=1;i<N-1;i++){\n    sum=(sum+(float)array[i+1])/2;\n}\nprintf(\"%.10f\",sum);\nreturn EXIT_SUCCESS;\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": 446, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s562837635", "group_id": "codeNet:p02935", "input_text": "#include<stdio.h>\n#include<math.h>\n#include<string.h>\n#include<stdlib.h>\n\nint main(void){\n\tint N,i,j,v[55],temp,max=0,submax=0;\n  \tdouble ans;\n  \tscanf(\"%d\",&N);\n  \tfor(i=0;i<N;i++){\n      scanf(\"%d\",&v[i]);\n    }\n      /* sort */\n      for(i=0;i<N-1;i++){\n\t\tfor(j=i+1;j<N;j++){\n          if(v[i]>v[j]){\n            temp = v[i];\n            v[i] = v[j];\n            v[j] = temp;\n          }\n        }\n      }\n      /* sort */\n  submax= v[i-1];\n  max = v[i];\n  \n  ans = (v[0]+v[1])/(double)2.0;\n  if(N>=3){\n  \tfor(i=2;i<=N-1;i++){\n \t   ans = (ans + v[i])/(double)2.0;\n \t }\n  }\n  if(N%2==0 && ans<(v[N-1]+v[N-2])/(double)2.0){\n    printf(\"%f\",(v[N-1]+v[N-2])/(double)2.0);\n  }else{\n     printf(\"%f\",ans);\n  }\n}", "language": "C", "metadata": {"date": 1566245572, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "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/C/s562837635.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s562837635", "user_id": "u065799843"}, "prompt_components": {"gold_output": "3.5\n", "input_to_evaluate": "#include<stdio.h>\n#include<math.h>\n#include<string.h>\n#include<stdlib.h>\n\nint main(void){\n\tint N,i,j,v[55],temp,max=0,submax=0;\n  \tdouble ans;\n  \tscanf(\"%d\",&N);\n  \tfor(i=0;i<N;i++){\n      scanf(\"%d\",&v[i]);\n    }\n      /* sort */\n      for(i=0;i<N-1;i++){\n\t\tfor(j=i+1;j<N;j++){\n          if(v[i]>v[j]){\n            temp = v[i];\n            v[i] = v[j];\n            v[j] = temp;\n          }\n        }\n      }\n      /* sort */\n  submax= v[i-1];\n  max = v[i];\n  \n  ans = (v[0]+v[1])/(double)2.0;\n  if(N>=3){\n  \tfor(i=2;i<=N-1;i++){\n \t   ans = (ans + v[i])/(double)2.0;\n \t }\n  }\n  if(N%2==0 && ans<(v[N-1]+v[N-2])/(double)2.0){\n    printf(\"%f\",(v[N-1]+v[N-2])/(double)2.0);\n  }else{\n     printf(\"%f\",ans);\n  }\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": 708, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s474846738", "group_id": "codeNet:p02935", "input_text": "#include <stdio.h>\n#include <stdlib.h>\n\nint main( void ){\n  int N, n, flag;\n  double buf, ans;\n  double* v;\n\n  scanf(\"%d\", &N);\n\n  v = (double*)malloc(sizeof(double) * N);\n\n  for(int i = 0; i < N; i++){\n    scanf(\"%lf\", &v[i]);\n  }\n\n  n = N;\n  do{\n    flag = 0;\n    n--;\n    for(int i = 0; i < n; i++){\n      if(v[i] > v[i+1]){\n        buf = v[i];\n        v[i] = v[i+1];\n        v[i+1] = buf;\n        flag = 1;\n      }\n    }\n  }while(flag == 1);\n\n  ans = v[0];\n  for(int i = 1; i < N; i++){\n    ans += v[i];\n    ans /= 2.0;\n  }\n\n  printf(\"%lf\\n\", ans);\n\n  free(v);\n\n  return 0;\n}\n\n", "language": "C", "metadata": {"date": 1566180979, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "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/C/s474846738.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s474846738", "user_id": "u750767546"}, "prompt_components": {"gold_output": "3.5\n", "input_to_evaluate": "#include <stdio.h>\n#include <stdlib.h>\n\nint main( void ){\n  int N, n, flag;\n  double buf, ans;\n  double* v;\n\n  scanf(\"%d\", &N);\n\n  v = (double*)malloc(sizeof(double) * N);\n\n  for(int i = 0; i < N; i++){\n    scanf(\"%lf\", &v[i]);\n  }\n\n  n = N;\n  do{\n    flag = 0;\n    n--;\n    for(int i = 0; i < n; i++){\n      if(v[i] > v[i+1]){\n        buf = v[i];\n        v[i] = v[i+1];\n        v[i+1] = buf;\n        flag = 1;\n      }\n    }\n  }while(flag == 1);\n\n  ans = v[0];\n  for(int i = 1; i < N; i++){\n    ans += v[i];\n    ans /= 2.0;\n  }\n\n  printf(\"%lf\\n\", ans);\n\n  free(v);\n\n  return 0;\n}\n\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": 581, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s838396692", "group_id": "codeNet:p02945", "input_text": "#include<stdio.h>\nint main ()\n{\n int A,B,a,b,c;\n scanf (\"%d %d\",&A,&B);\n a=A+B;\n b=A-B;\n c=A*B;\n     if (a>=b&&a>=c)\n     {\n         printf (\"%d\\n\",a);\n     }\n   else if (b>=a&&b>=c)\n     {\n         printf (\"%d\\n\",b);\n     }\n    else\n     {\n         printf (\"%d\\n\",c);\n     }\n return 0;\n}\n", "language": "C", "metadata": {"date": 1592723033, "filename_ext": "c", "original_language": "C (GCC 9.2.1)", "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/C/s838396692.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s838396692", "user_id": "u353919145"}, "prompt_components": {"gold_output": "-10\n", "input_to_evaluate": "#include<stdio.h>\nint main ()\n{\n int A,B,a,b,c;\n scanf (\"%d %d\",&A,&B);\n a=A+B;\n b=A-B;\n c=A*B;\n     if (a>=b&&a>=c)\n     {\n         printf (\"%d\\n\",a);\n     }\n   else if (b>=a&&b>=c)\n     {\n         printf (\"%d\\n\",b);\n     }\n    else\n     {\n         printf (\"%d\\n\",c);\n     }\n return 0;\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": 289, "cpu_time_ms": 4, "memory_kb": 1724}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s963857299", "group_id": "codeNet:p02945", "input_text": "#include \"stdio.h\"\n\nint main()\n{\n\tint a,b,ans;\n\tscanf(\"%d %d\", &a,&b);\n\tif (a + b > a - b && a + b > a*b)ans = a + b;\n\tif (a - b > a * b && a - b > a+b)ans = a - b;\n\tif (a * b > a - b && a * b > a+b)ans = a * b;\n\tprintf(\"%d\", ans);\n\treturn 0;\n}\n", "language": "C", "metadata": {"date": 1574826074, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "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/C/s963857299.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s963857299", "user_id": "u517348254"}, "prompt_components": {"gold_output": "-10\n", "input_to_evaluate": "#include \"stdio.h\"\n\nint main()\n{\n\tint a,b,ans;\n\tscanf(\"%d %d\", &a,&b);\n\tif (a + b > a - b && a + b > a*b)ans = a + b;\n\tif (a - b > a * b && a - b > a+b)ans = a - b;\n\tif (a * b > a - b && a * b > a+b)ans = a * b;\n\tprintf(\"%d\", ans);\n\treturn 0;\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": 245, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s935320263", "group_id": "codeNet:p02945", "input_text": "#include <stdio.h>\ntypedef long long ll;\n\nint main(){\n    int a,b,ans;\n    scanf(\"%d %d\",&a,&b);\n    if((a>0&&b>0)||(a<0&&b<0)||(a<0&&b==0)) ans=a*b;\n    else if(a>=0&&b<0) ans=a-b;\n    else ans=a+b;\n    printf(\"%d\",ans);\n}\n\n", "language": "C", "metadata": {"date": 1565491143, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "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/C/s935320263.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s935320263", "user_id": "u517974867"}, "prompt_components": {"gold_output": "-10\n", "input_to_evaluate": "#include <stdio.h>\ntypedef long long ll;\n\nint main(){\n    int a,b,ans;\n    scanf(\"%d %d\",&a,&b);\n    if((a>0&&b>0)||(a<0&&b<0)||(a<0&&b==0)) ans=a*b;\n    else if(a>=0&&b<0) ans=a-b;\n    else ans=a+b;\n    printf(\"%d\",ans);\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": 225, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s804154832", "group_id": "codeNet:p02946", "input_text": "#include <stdio.h>\nint main(){\n  int K,X,ret,i;\n  ret = scanf( \"%d %d\" , &K,&X );\n  if( ret == EOF ) {\n    return -1;\n  }\n  X-=K;\n  for(i=0;i<=K;i++){\n  printf(\"%d \",X+i);\n  }\n  return 0;\n}", "language": "C", "metadata": {"date": 1565499113, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "problem_description_relpath": "problem_descriptions/p02946.html", "problem_id": "p02946", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02946/input.txt", "sample_output_relpath": "derived/input_output/data/p02946/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02946/C/s804154832.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s804154832", "user_id": "u538694792"}, "prompt_components": {"gold_output": "5 6 7 8 9\n", "input_to_evaluate": "#include <stdio.h>\nint main(){\n  int K,X,ret,i;\n  ret = scanf( \"%d %d\" , &K,&X );\n  if( ret == EOF ) {\n    return -1;\n  }\n  X-=K;\n  for(i=0;i<=K;i++){\n  printf(\"%d \",X+i);\n  }\n  return 0;\n}", "problem_context": "Score : 200 points\n\nProblem Statement\n\nThere are 2000001 stones placed on a number line. The coordinates of these stones are -1000000, -999999, -999998, \\ldots, 999999, 1000000.\n\nAmong them, some K consecutive stones are painted black, and the others are painted white.\n\nAdditionally, we know that the stone at coordinate X is painted black.\n\nPrint all coordinates that potentially contain a stone painted black, in ascending order.\n\nConstraints\n\n1 \\leq K \\leq 100\n\n0 \\leq X \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nK X\n\nOutput\n\nPrint all coordinates that potentially contain a stone painted black, in ascending order, with spaces in between.\n\nSample Input 1\n\n3 7\n\nSample Output 1\n\n5 6 7 8 9\n\nWe know that there are three stones painted black, and the stone at coordinate 7 is painted black. There are three possible cases:\n\nThe three stones painted black are placed at coordinates 5, 6, and 7.\n\nThe three stones painted black are placed at coordinates 6, 7, and 8.\n\nThe three stones painted black are placed at coordinates 7, 8, and 9.\n\nThus, five coordinates potentially contain a stone painted black: 5, 6, 7, 8, and 9.\n\nSample Input 2\n\n4 0\n\nSample Output 2\n\n-3 -2 -1 0 1 2 3\n\nNegative coordinates can also contain a stone painted black.\n\nSample Input 3\n\n1 100\n\nSample Output 3\n\n100", "sample_input": "3 7\n"}, "reference_outputs": ["5 6 7 8 9\n"], "source_document_id": "p02946", "source_text": "Score : 200 points\n\nProblem Statement\n\nThere are 2000001 stones placed on a number line. The coordinates of these stones are -1000000, -999999, -999998, \\ldots, 999999, 1000000.\n\nAmong them, some K consecutive stones are painted black, and the others are painted white.\n\nAdditionally, we know that the stone at coordinate X is painted black.\n\nPrint all coordinates that potentially contain a stone painted black, in ascending order.\n\nConstraints\n\n1 \\leq K \\leq 100\n\n0 \\leq X \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nK X\n\nOutput\n\nPrint all coordinates that potentially contain a stone painted black, in ascending order, with spaces in between.\n\nSample Input 1\n\n3 7\n\nSample Output 1\n\n5 6 7 8 9\n\nWe know that there are three stones painted black, and the stone at coordinate 7 is painted black. There are three possible cases:\n\nThe three stones painted black are placed at coordinates 5, 6, and 7.\n\nThe three stones painted black are placed at coordinates 6, 7, and 8.\n\nThe three stones painted black are placed at coordinates 7, 8, and 9.\n\nThus, five coordinates potentially contain a stone painted black: 5, 6, 7, 8, and 9.\n\nSample Input 2\n\n4 0\n\nSample Output 2\n\n-3 -2 -1 0 1 2 3\n\nNegative coordinates can also contain a stone painted black.\n\nSample Input 3\n\n1 100\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": 189, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s595563181", "group_id": "codeNet:p02946", "input_text": "#include<stdio.h>\n\nint main(void)\n{\n\tint a, b,c,i;\n\n\tscanf(\"%d %d\", &a, &b);\n\n\tc = b - a+1;\n\tb = a * 2 - 1;\n\tfor(i=0;i<b;i++,c++)\n\tprintf(\"%d \", c);\n\n\t\n\n\treturn 0;\n}", "language": "C", "metadata": {"date": 1565486283, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "problem_description_relpath": "problem_descriptions/p02946.html", "problem_id": "p02946", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02946/input.txt", "sample_output_relpath": "derived/input_output/data/p02946/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02946/C/s595563181.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s595563181", "user_id": "u739589123"}, "prompt_components": {"gold_output": "5 6 7 8 9\n", "input_to_evaluate": "#include<stdio.h>\n\nint main(void)\n{\n\tint a, b,c,i;\n\n\tscanf(\"%d %d\", &a, &b);\n\n\tc = b - a+1;\n\tb = a * 2 - 1;\n\tfor(i=0;i<b;i++,c++)\n\tprintf(\"%d \", c);\n\n\t\n\n\treturn 0;\n}", "problem_context": "Score : 200 points\n\nProblem Statement\n\nThere are 2000001 stones placed on a number line. The coordinates of these stones are -1000000, -999999, -999998, \\ldots, 999999, 1000000.\n\nAmong them, some K consecutive stones are painted black, and the others are painted white.\n\nAdditionally, we know that the stone at coordinate X is painted black.\n\nPrint all coordinates that potentially contain a stone painted black, in ascending order.\n\nConstraints\n\n1 \\leq K \\leq 100\n\n0 \\leq X \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nK X\n\nOutput\n\nPrint all coordinates that potentially contain a stone painted black, in ascending order, with spaces in between.\n\nSample Input 1\n\n3 7\n\nSample Output 1\n\n5 6 7 8 9\n\nWe know that there are three stones painted black, and the stone at coordinate 7 is painted black. There are three possible cases:\n\nThe three stones painted black are placed at coordinates 5, 6, and 7.\n\nThe three stones painted black are placed at coordinates 6, 7, and 8.\n\nThe three stones painted black are placed at coordinates 7, 8, and 9.\n\nThus, five coordinates potentially contain a stone painted black: 5, 6, 7, 8, and 9.\n\nSample Input 2\n\n4 0\n\nSample Output 2\n\n-3 -2 -1 0 1 2 3\n\nNegative coordinates can also contain a stone painted black.\n\nSample Input 3\n\n1 100\n\nSample Output 3\n\n100", "sample_input": "3 7\n"}, "reference_outputs": ["5 6 7 8 9\n"], "source_document_id": "p02946", "source_text": "Score : 200 points\n\nProblem Statement\n\nThere are 2000001 stones placed on a number line. The coordinates of these stones are -1000000, -999999, -999998, \\ldots, 999999, 1000000.\n\nAmong them, some K consecutive stones are painted black, and the others are painted white.\n\nAdditionally, we know that the stone at coordinate X is painted black.\n\nPrint all coordinates that potentially contain a stone painted black, in ascending order.\n\nConstraints\n\n1 \\leq K \\leq 100\n\n0 \\leq X \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nK X\n\nOutput\n\nPrint all coordinates that potentially contain a stone painted black, in ascending order, with spaces in between.\n\nSample Input 1\n\n3 7\n\nSample Output 1\n\n5 6 7 8 9\n\nWe know that there are three stones painted black, and the stone at coordinate 7 is painted black. There are three possible cases:\n\nThe three stones painted black are placed at coordinates 5, 6, and 7.\n\nThe three stones painted black are placed at coordinates 6, 7, and 8.\n\nThe three stones painted black are placed at coordinates 7, 8, and 9.\n\nThus, five coordinates potentially contain a stone painted black: 5, 6, 7, 8, and 9.\n\nSample Input 2\n\n4 0\n\nSample Output 2\n\n-3 -2 -1 0 1 2 3\n\nNegative coordinates can also contain a stone painted black.\n\nSample Input 3\n\n1 100\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": 165, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s345241922", "group_id": "codeNet:p02947", "input_text": "#include <stdio.h>\n#include <stdlib.h>\n#include <string.h>\n\n\nint tmp(const void *l, const void *r) {\n  return strcmp((char *)l, (char *)r);\n}\n\nint main (int argc, char* argv[]) {\n  long long n;\n  scanf(\"%lld\", &n);\n  char s[n][12];\n  for (int i = 0; i < n; i++) {\n    scanf(\"%s\", s[i]);\n    qsort(s[i], 10, sizeof(char), tmp);\n  }\n\n  qsort(s, n, sizeof(s[0]), tmp);\n\n  long long ans = 0\n    , j = 0\n    , k = 0\n    , l = 0;\n  while (j < n) {\n    if (strcmp(s[j], s[k+1]) == 0) {\n      ans++;\n      ans += l;\n      k++;\n      l++;\n    } else {\n      j = k + 1;\n      k = j;\n      l = 0;\n    }\n  }\n\n  printf(\"%lld\\n\", ans);\n\n  return 0;\n}\n", "language": "C", "metadata": {"date": 1565494415, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "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/C/s345241922.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s345241922", "user_id": "u746419473"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "#include <stdio.h>\n#include <stdlib.h>\n#include <string.h>\n\n\nint tmp(const void *l, const void *r) {\n  return strcmp((char *)l, (char *)r);\n}\n\nint main (int argc, char* argv[]) {\n  long long n;\n  scanf(\"%lld\", &n);\n  char s[n][12];\n  for (int i = 0; i < n; i++) {\n    scanf(\"%s\", s[i]);\n    qsort(s[i], 10, sizeof(char), tmp);\n  }\n\n  qsort(s, n, sizeof(s[0]), tmp);\n\n  long long ans = 0\n    , j = 0\n    , k = 0\n    , l = 0;\n  while (j < n) {\n    if (strcmp(s[j], s[k+1]) == 0) {\n      ans++;\n      ans += l;\n      k++;\n      l++;\n    } else {\n      j = k + 1;\n      k = j;\n      l = 0;\n    }\n  }\n\n  printf(\"%lld\\n\", ans);\n\n  return 0;\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": 637, "cpu_time_ms": 100, "memory_kb": 2556}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s605068722", "group_id": "codeNet:p02947", "input_text": "#include <stdio.h>\n#include <stdlib.h>\n\nint main(void) {\n  int N; scanf(\"%d\", &N);\n  /* int S[MEM][26]; */\n  int **S;\n  S = (int **)malloc(N * sizeof(int *));\n  for (int i = 0; i < N; i++) S[i] = (int *)calloc(26, sizeof(int));\n  char buf[12];\n  fgets(buf, 12, stdin);\n  \n  for (int i = 0; i < N; i++) {\n    fgets(buf, 12, stdin);\n    for (int j = 0; j < 10; j++) S[i][buf[j]-'a']++;\n  }\n\n  long long res = 0;\n  for (int i = 0; i < N; i++) {\n    for (int j = i+1; j < N; j++) {\n      int flag = 1;\n      for (int k = 0; k < 26; k++) {\n\tif (S[i][k] != S[j][k]) {\n\t  flag = 0;\n\t  break;\n\t}\n      }\n      res += flag;\n    }\n  }\n  printf(\"%lld\\n\", res);\n  return 0;\n}\n", "language": "C", "metadata": {"date": 1565488975, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "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/C/s605068722.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s605068722", "user_id": "u330690418"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "#include <stdio.h>\n#include <stdlib.h>\n\nint main(void) {\n  int N; scanf(\"%d\", &N);\n  /* int S[MEM][26]; */\n  int **S;\n  S = (int **)malloc(N * sizeof(int *));\n  for (int i = 0; i < N; i++) S[i] = (int *)calloc(26, sizeof(int));\n  char buf[12];\n  fgets(buf, 12, stdin);\n  \n  for (int i = 0; i < N; i++) {\n    fgets(buf, 12, stdin);\n    for (int j = 0; j < 10; j++) S[i][buf[j]-'a']++;\n  }\n\n  long long res = 0;\n  for (int i = 0; i < N; i++) {\n    for (int j = i+1; j < N; j++) {\n      int flag = 1;\n      for (int k = 0; k < 26; k++) {\n\tif (S[i][k] != S[j][k]) {\n\t  flag = 0;\n\t  break;\n\t}\n      }\n      res += flag;\n    }\n  }\n  printf(\"%lld\\n\", res);\n  return 0;\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": 664, "cpu_time_ms": 2104, "memory_kb": 13952}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s562814750", "group_id": "codeNet:p02948", "input_text": "#include <stdio.h>\n#include<stdlib.h>\n\n//\n// utility\n//\nvoid swap(int* p, int* q) {\n  int swp = *q;\n  *q = *p;\n  *p = swp;\n}\n\n//\n// data structure\n//\nenum pqueue_order {\n  PQUEUE_ORDER_DESC = -1,\n  PQUEUE_ORDER_ASC = 1\n};\n\ntypedef struct pqueue {\n  int* heap;\n  int reserved;                     // reserved memory size\n  int size;                         // heap size\n  int (*push)(struct pqueue*, int);\n  int (*pop)(struct pqueue*);\n  int (*empty)(struct pqueue*);\n  enum pqueue_order ord;\n} pqueue_t;\n\n//\n// methods\n//\nint pqueue_push(pqueue_t* self, int n) {\n  int node;\n  int *heap;\n\n  // ordering\n  n *= self->ord;\n\n  // expand heap size if stervation occured\n  if (self->size >= self->reserved) {\n    self->reserved = self->reserved * 2;\n    self->heap = realloc(self->heap, self->reserved * sizeof(int));\n  }\n\n  heap = self->heap - 1; // index start from 1\n  heap[++self->size] = n;\n\n  // up-heap\n  for (node = self->size; heap[node] < heap[node / 2] && node != 1; node/=2)\n    swap(heap + node, heap + node/2);\n\n  return 0;\n}\n\nint pqueue_pop(pqueue_t* self) {\n  int ret;\n  int left, rght;\n  int node, downto;\n  int *heap = self->heap - 1; // index start from 1\n\n  if (self->size == 0) return -1;\n\n  // de-ordering\n  ret = heap[1] * self->ord;\n\n  // down-heap\n  heap[1] = heap[(self->size)--];\n  for (node = 1, downto = -1; node != downto; swap(heap + node, heap + downto), node = downto) {\n    int left = node*2    ;\n    int rght = node*2 + 1;\n\n    downto = node;\n    // downto = min(parent, left child, right child)\n    if (left <= self->size && heap[left] < heap[downto])\n      downto = left;\n    if (rght <= self->size && heap[rght] < heap[downto])\n      downto = rght;\n  }\n\n  return ret;\n}\n\nint pqueue_empty(pqueue_t* self) {\n  return self->size == 0;\n}\n\n//\n// constructor\n//\npqueue_t* create_pqueue(enum pqueue_order ord) {\n  pqueue_t *p = malloc(sizeof(pqueue_t));\n\n  p->size = 0;\n  p->reserved = 2;\n  p->heap = malloc(p->reserved * sizeof(int));\n\n  p->ord = ord;\n\n  p->push = pqueue_push;\n  p->pop = pqueue_pop;\n  p->empty = pqueue_empty;\n\n  return p;\n}\n\n//\n// destructor\n//\nvoid dispose_pqueue(pqueue_t* q) {\n  free(q->heap);\n  free(q);\n}\n\nint test() {\n  pqueue_t *q;\n  q = create_pqueue(PQUEUE_ORDER_DESC);\n\n  q->push(q, 5);\n  q->push(q, 1);\n  q->push(q, 8);\n  q->push(q, 9);\n  q->push(q, -1);\n\n  while (!q->empty(q))\n    printf(\"%d%c\", q->pop(q), 10);\n\n  dispose_pqueue(q);\n\n  return 0;\n}\n\nint max(int a,int b){\n  if(a > b){\n    return a;\n  }\n  return b;\n}\n\ntypedef struct pair{\n  int x,y;\n}point;\n\nint compare_pair(const void *a,const void *b){\n  if((*(point*)a).x > (*(point*)b).x) return 1;\n  if((*(point*)a).x == (*(point*)b).x)\n    if((*(point*)a).y < (*(point*)b).y) return 1;\n  return -1;\n}\n\n\nint main(void){\n  int N, M;\n  scanf(\"%d%d\", &N, &M);\n\n  point A[N];\n  for (int i = 0; i < N; i++) {\n    scanf(\"%d%d\", &A[i].x, &A[i].y);\n  }\n\n  qsort(A, N, sizeof(point), compare_pair);\n\n  long long ans = 0;\n  int num = 0;\n  pqueue_t *q;\n  q = create_pqueue(PQUEUE_ORDER_DESC);\n  for (int i = 1; i <= M; i++) {\n    while(A[num].x <= i && num < N){\n      q->push(q, A[num].y);\n      num++;\n    }\n    if (!q->empty(q)) ans += q->pop(q);\n  }\n\n  printf(\"%lld\\n\", ans);\n\n  /* printf(\"\\n\"); */\n  /* for (int i = 0; i < N; i++) { */\n  /*   printf(\"%d %d\\n\", A[i].x, A[i].y); */\n  /* } */\n\n  /*   printf(\"\\n\"); */\n  /*   for (int i = 0; i < M; i++) { */\n  /*     for (int j = 0; j < N; j++) { */\n  /*       printf(\"%d \", arr[i][j]); */\n  /*     } */\n  /*     printf(\"\\n\"); */\n  /*   } */\n\n  return 0;\n}", "language": "C", "metadata": {"date": 1565629749, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "problem_description_relpath": "problem_descriptions/p02948.html", "problem_id": "p02948", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02948/input.txt", "sample_output_relpath": "derived/input_output/data/p02948/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02948/C/s562814750.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s562814750", "user_id": "u812973725"}, "prompt_components": {"gold_output": "5\n", "input_to_evaluate": "#include <stdio.h>\n#include<stdlib.h>\n\n//\n// utility\n//\nvoid swap(int* p, int* q) {\n  int swp = *q;\n  *q = *p;\n  *p = swp;\n}\n\n//\n// data structure\n//\nenum pqueue_order {\n  PQUEUE_ORDER_DESC = -1,\n  PQUEUE_ORDER_ASC = 1\n};\n\ntypedef struct pqueue {\n  int* heap;\n  int reserved;                     // reserved memory size\n  int size;                         // heap size\n  int (*push)(struct pqueue*, int);\n  int (*pop)(struct pqueue*);\n  int (*empty)(struct pqueue*);\n  enum pqueue_order ord;\n} pqueue_t;\n\n//\n// methods\n//\nint pqueue_push(pqueue_t* self, int n) {\n  int node;\n  int *heap;\n\n  // ordering\n  n *= self->ord;\n\n  // expand heap size if stervation occured\n  if (self->size >= self->reserved) {\n    self->reserved = self->reserved * 2;\n    self->heap = realloc(self->heap, self->reserved * sizeof(int));\n  }\n\n  heap = self->heap - 1; // index start from 1\n  heap[++self->size] = n;\n\n  // up-heap\n  for (node = self->size; heap[node] < heap[node / 2] && node != 1; node/=2)\n    swap(heap + node, heap + node/2);\n\n  return 0;\n}\n\nint pqueue_pop(pqueue_t* self) {\n  int ret;\n  int left, rght;\n  int node, downto;\n  int *heap = self->heap - 1; // index start from 1\n\n  if (self->size == 0) return -1;\n\n  // de-ordering\n  ret = heap[1] * self->ord;\n\n  // down-heap\n  heap[1] = heap[(self->size)--];\n  for (node = 1, downto = -1; node != downto; swap(heap + node, heap + downto), node = downto) {\n    int left = node*2    ;\n    int rght = node*2 + 1;\n\n    downto = node;\n    // downto = min(parent, left child, right child)\n    if (left <= self->size && heap[left] < heap[downto])\n      downto = left;\n    if (rght <= self->size && heap[rght] < heap[downto])\n      downto = rght;\n  }\n\n  return ret;\n}\n\nint pqueue_empty(pqueue_t* self) {\n  return self->size == 0;\n}\n\n//\n// constructor\n//\npqueue_t* create_pqueue(enum pqueue_order ord) {\n  pqueue_t *p = malloc(sizeof(pqueue_t));\n\n  p->size = 0;\n  p->reserved = 2;\n  p->heap = malloc(p->reserved * sizeof(int));\n\n  p->ord = ord;\n\n  p->push = pqueue_push;\n  p->pop = pqueue_pop;\n  p->empty = pqueue_empty;\n\n  return p;\n}\n\n//\n// destructor\n//\nvoid dispose_pqueue(pqueue_t* q) {\n  free(q->heap);\n  free(q);\n}\n\nint test() {\n  pqueue_t *q;\n  q = create_pqueue(PQUEUE_ORDER_DESC);\n\n  q->push(q, 5);\n  q->push(q, 1);\n  q->push(q, 8);\n  q->push(q, 9);\n  q->push(q, -1);\n\n  while (!q->empty(q))\n    printf(\"%d%c\", q->pop(q), 10);\n\n  dispose_pqueue(q);\n\n  return 0;\n}\n\nint max(int a,int b){\n  if(a > b){\n    return a;\n  }\n  return b;\n}\n\ntypedef struct pair{\n  int x,y;\n}point;\n\nint compare_pair(const void *a,const void *b){\n  if((*(point*)a).x > (*(point*)b).x) return 1;\n  if((*(point*)a).x == (*(point*)b).x)\n    if((*(point*)a).y < (*(point*)b).y) return 1;\n  return -1;\n}\n\n\nint main(void){\n  int N, M;\n  scanf(\"%d%d\", &N, &M);\n\n  point A[N];\n  for (int i = 0; i < N; i++) {\n    scanf(\"%d%d\", &A[i].x, &A[i].y);\n  }\n\n  qsort(A, N, sizeof(point), compare_pair);\n\n  long long ans = 0;\n  int num = 0;\n  pqueue_t *q;\n  q = create_pqueue(PQUEUE_ORDER_DESC);\n  for (int i = 1; i <= M; i++) {\n    while(A[num].x <= i && num < N){\n      q->push(q, A[num].y);\n      num++;\n    }\n    if (!q->empty(q)) ans += q->pop(q);\n  }\n\n  printf(\"%lld\\n\", ans);\n\n  /* printf(\"\\n\"); */\n  /* for (int i = 0; i < N; i++) { */\n  /*   printf(\"%d %d\\n\", A[i].x, A[i].y); */\n  /* } */\n\n  /*   printf(\"\\n\"); */\n  /*   for (int i = 0; i < M; i++) { */\n  /*     for (int j = 0; j < N; j++) { */\n  /*       printf(\"%d \", arr[i][j]); */\n  /*     } */\n  /*     printf(\"\\n\"); */\n  /*   } */\n\n  return 0;\n}", "problem_context": "Score : 400 points\n\nProblem Statement\n\nThere are N one-off jobs available. If you take the i-th job and complete it, you will earn the reward of B_i after A_i days from the day you do it.\n\nYou can take and complete at most one of these jobs in a day.\n\nHowever, you cannot retake a job that you have already done.\n\nFind the maximum total reward that you can earn no later than M days from today.\n\nYou can already start working today.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 10^5\n\n1 \\leq M \\leq 10^5\n\n1 \\leq A_i \\leq 10^5\n\n1 \\leq B_i \\leq 10^4\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 maximum total reward that you can earn no later than M days from today.\n\nSample Input 1\n\n3 4\n4 3\n4 1\n2 2\n\nSample Output 1\n\n5\n\nYou can earn the total reward of 5 by taking the jobs as follows:\n\nTake and complete the first job today. You will earn the reward of 3 after four days from today.\n\nTake and complete the third job tomorrow. You will earn the reward of 2 after two days from tomorrow, that is, after three days from today.\n\nSample Input 2\n\n5 3\n1 2\n1 3\n1 4\n2 1\n2 3\n\nSample Output 2\n\n10\n\nSample Input 3\n\n1 1\n2 1\n\nSample Output 3\n\n0", "sample_input": "3 4\n4 3\n4 1\n2 2\n"}, "reference_outputs": ["5\n"], "source_document_id": "p02948", "source_text": "Score : 400 points\n\nProblem Statement\n\nThere are N one-off jobs available. If you take the i-th job and complete it, you will earn the reward of B_i after A_i days from the day you do it.\n\nYou can take and complete at most one of these jobs in a day.\n\nHowever, you cannot retake a job that you have already done.\n\nFind the maximum total reward that you can earn no later than M days from today.\n\nYou can already start working today.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 10^5\n\n1 \\leq M \\leq 10^5\n\n1 \\leq A_i \\leq 10^5\n\n1 \\leq B_i \\leq 10^4\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 maximum total reward that you can earn no later than M days from today.\n\nSample Input 1\n\n3 4\n4 3\n4 1\n2 2\n\nSample Output 1\n\n5\n\nYou can earn the total reward of 5 by taking the jobs as follows:\n\nTake and complete the first job today. You will earn the reward of 3 after four days from today.\n\nTake and complete the third job tomorrow. You will earn the reward of 2 after two days from tomorrow, that is, after three days from today.\n\nSample Input 2\n\n5 3\n1 2\n1 3\n1 4\n2 1\n2 3\n\nSample Output 2\n\n10\n\nSample Input 3\n\n1 1\n2 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": 3513, "cpu_time_ms": 34, "memory_kb": 1788}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s521691499", "group_id": "codeNet:p02948", "input_text": "//set many funcs template\n//Ver.20181228\n#include<stdio.h>\n#include<string.h>\n#include<stdlib.h>\n#include<stdbool.h>\n#include<time.h>\n#define inf 1072114514\n#define llinf 4154118101919364364\n#define mod 1000000007\n#define pi 3.1415926535897932384\n\nint max(int a,int b){if(a>b){return a;}return b;}\nint min(int a,int b){if(a<b){return a;}return b;}\nint zt(int a,int b){return max(a,b)-min(a,b);}\nint round(int a,int b){if((a%b)*2 >= b){return (a/b)+1;}return a/b;}\nint ceil(int a,int b){if(a%b==0){return a/b;}return (a/b)+1;}\nint gcd(int a,int b){int c;while(b!=0){c=a%b;a=b;b=c;}return a;}\nint lcm(int a,int b){int c=gcd(a,b);a/=c;return a*b;}\nint nCr(int a,int b){int i,r=1;for(i=1;i<=b;i++){r*=(a+1-i);r/=i;}return r;}\nint nHr(int a,int b){return nCr(a+b-1,b);}\nint fact(int a){int i,r=1;for(i=1;i<=a;i++){r*=i;}return r;}\nint pow(int a,int b){int i,r=1;for(i=1;i<=b;i++){r*=a;}return r;}\nint dsum(int x){int r=0;while(x){r+=(x%10);x/=10;}return r;}\nint dsumb(int x,int b){int r=0;while(x){r+=(x%b);x/=b;}return r;}\nint sankaku(int x){return ((1+x)*x)/2;}\nlong long llmax(long long a,long long b){if(a>b){return a;}return b;}\nlong long llmin(long long a,long long b){if(a<b){return a;}return b;}\nlong long llzt(long long a,long long b){return llmax(a,b)-llmin(a,b);}\nlong long llround(long long a,long long b){if((a%b)*2 >= b){return (a/b)+1;}return a/b;}\nlong long llceil(long long a,long long b){if(a%b==0){return a/b;}return (a/b)+1;}\nlong long llgcd(long long a,long long b){long long c;while(b!=0){c=a%b;a=b;b=c;}return a;}\nlong long lllcm(long long a,long long b){long long c=llgcd(a,b);a/=c;return a*b;}\nlong long llnCr(long long a,long long b){long long i,r=1;for(i=1;i<=b;i++){r*=(a+1-i);r/=i;}return r;}\nlong long llnHr(long long a,long long b){return llnCr(a+b-1,b);}\nlong long llfact(long long a){long long i,r=1;for(i=1;i<=a;i++){r*=i;}return r;}\nlong long llpow(long long a,long long b){long long i,r=1;for(i=1;i<=b;i++){r*=a;}return r;}\nlong long lldsum(long long x){long long r=0;while(x){r+=(x%10);x/=10;}return r;}\nlong long lldsumb(long long x,long long b){long long r=0;while(x){r+=(x%b);x/=b;}return r;}\nlong long llsankaku(long long x){return ((1+x)*x)/2;}\ndouble dbmax(double a,double b){if(a>b){return a;}return b;}\ndouble dbmin(double a,double b){if(a<b){return a;}return b;}\ndouble dbzt(double a,double b){return dbmax(a,b)-dbmin(a,b);}\nint sortfncsj(const void *a,const void *b){if(*(int *)a>*(int *)b){return 1;}if(*(int *)a==*(int *)b){return 0;}return -1;}\nint sortfnckj(const void *a,const void *b){if(*(int *)a<*(int *)b){return 1;}if(*(int *)a==*(int *)b){return 0;}return -1;}\nint llsortfncsj(const void *a,const void *b){if(*(long long *)a>*(long long *)b){return 1;}if(*(long long *)a==*(long long *)b){return 0;}return -1;}\nint llsortfnckj(const void *a,const void *b){if(*(long long *)a<*(long long *)b){return 1;}if(*(long long *)a==*(long long *)b){return 0;}return -1;}\nint dbsortfncsj(const void *a,const void *b){if(*(double *)a>*(double *)b){return 1;}if(*(double *)a==*(double *)b){return 0;}return -1;}\nint dbsortfnckj(const void *a,const void *b){if(*(double *)a<*(double *)b){return 1;}if(*(double *)a==*(double *)b){return 0;}return -1;}\nint strsortfncsj(const void *a,const void *b){return strcmp((char *)a,(char *)b);}\nint strsortfnckj(const void *a,const void *b){return strcmp((char *)b,(char *)a);}\nint chsortfncsj(const void *a,const void *b){if(*(char *)a>*(char *)b){return 1;}if(*(char *)a==*(char *)b){return 0;}return -1;}\nint chsortfnckj(const void *a,const void *b){if(*(char *)a<*(char *)b){return 1;}if(*(char *)a==*(char *)b){return 0;}return -1;}\n\nvoid shuffledget(int x[],int n){\n    srand(time(0));\n    int i,b[524288],p,c;\n    for(i=0;i<n;i++){\n        b[i]=i;\n    }\n    for(i=n;i>=1;i--){\n        p=rand()%i;\n        c=b[i-1];b[i-1]=b[p];b[p]=c;\n    }\n    for(i=0;i<n;i++){\n        scanf(\"%d\",&x[b[i]]);\n    }\n}\n\nint dx4[4]={1,-1,0,0};\nint dy4[4]={0,0,1,-1};\nint dx8[8]={-1,-1,-1,0,0,1,1,1};\nint dy8[8]={-1,0,1,-1,1,-1,0,1};\n\nint search(int x,int a[],int n){\n    int st=0,fi=n-1,te;\n    while(st<=fi){\n        te=(st+fi)/2;\n        if(a[te]<x){st=te+1;}else{fi=te-1;}\n    }\n    return st;\n}\n\nvoid prarr(int arr[],int n){\n  int i;\n  for(i=0;i<n;i++){\n    if(i){printf(\" \");}\n    printf(\"%d\",arr[i]);\n  }\n  printf(\"\\n\");\n  return;\n}\n\ntypedef struct{\nlong long val;\nlong long node;\n}sd;\n\nint sdsortfnc(const void *a,const void *b){\nif(((sd*)a)->val < ((sd*)b)->val){return -1;}\nif(((sd*)a)->val > ((sd*)b)->val){return 1;}\nreturn 0;\n}\n\ntypedef struct{\nlong long node;\nlong long cost;\n}data;\n\ndata heap[262144];\nlong long hsize=0;\n\nvoid resheap(){\n    long long i;\n    heap[0].node=-1;\n    heap[0].cost=inf;\n    for(i=1;i<262144;i++){\n        heap[i].node=-1;\n        heap[i].cost=-inf;\n    }\n}\n\nlong long swjud(data high,data low){\n    if(high.cost < low.cost){return 1;}\n    return -1;\n}\n\nvoid pqpush(data x){\n    long long a,b;\n    data m;\n    hsize++;\n    heap[hsize]=x;\n    a=hsize;\n    while(1){\n        b=a/2;\n        if(swjud(heap[b],heap[a]) == 1){\n            m=heap[a];heap[a]=heap[b];heap[b]=m;\n        }\n        else{break;}\n        a=b;\n    }\n}\n\ndata pqpop(){\n    long long a,b,c;\n    data m,sw;\n    m=heap[1];\n    heap[1]=heap[hsize];\n    heap[hsize].node=-1;\n    heap[hsize].cost=-inf;\n    hsize--;\n    a=1;\n    while(1){\n        b=a*2;c=a*2+1;\n        if(swjud(heap[a],heap[b])==-1 && swjud(heap[a],heap[c])==-1){break;}\n        if(swjud(heap[b],heap[c])==-1){\n            sw=heap[a];heap[a]=heap[b];heap[b]=sw;\n            a=b;\n        }\n        else{\n            sw=heap[a];heap[a]=heap[c];heap[c]=sw;\n            a=c;\n        }\n    }\n    return m;\n}\n\nint main(void){\n    resheap();\n    long long i,j,n,m,k,a[524288],b,c,h,w,r=0,l,t;\n    data pd,od;\n    sd dat[262144];\n    scanf(\"%lld%lld\",&n,&k);\n    for(i=0;i<n;i++){\n      scanf(\"%lld%lld\",&dat[i].val,&dat[i].node);\n    }\n    qsort(dat,n,sizeof(dat[0]),sdsortfnc);\n    dat[n].val=inf;\n    j=0;\n    for(i=1;i<=k;i++){\n      while(dat[j].val<=i){\n        pd.cost=dat[j].node;\n        pqpush(pd);\n        j++;\n      }\n      if(hsize>0){\n        od=pqpop();\n        r+=od.cost;\n      }\n    }\n    printf(\"%lld\\n\",r);\n    return 0;\n}\n", "language": "C", "metadata": {"date": 1565493030, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "problem_description_relpath": "problem_descriptions/p02948.html", "problem_id": "p02948", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02948/input.txt", "sample_output_relpath": "derived/input_output/data/p02948/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02948/C/s521691499.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s521691499", "user_id": "u721060623"}, "prompt_components": {"gold_output": "5\n", "input_to_evaluate": "//set many funcs template\n//Ver.20181228\n#include<stdio.h>\n#include<string.h>\n#include<stdlib.h>\n#include<stdbool.h>\n#include<time.h>\n#define inf 1072114514\n#define llinf 4154118101919364364\n#define mod 1000000007\n#define pi 3.1415926535897932384\n\nint max(int a,int b){if(a>b){return a;}return b;}\nint min(int a,int b){if(a<b){return a;}return b;}\nint zt(int a,int b){return max(a,b)-min(a,b);}\nint round(int a,int b){if((a%b)*2 >= b){return (a/b)+1;}return a/b;}\nint ceil(int a,int b){if(a%b==0){return a/b;}return (a/b)+1;}\nint gcd(int a,int b){int c;while(b!=0){c=a%b;a=b;b=c;}return a;}\nint lcm(int a,int b){int c=gcd(a,b);a/=c;return a*b;}\nint nCr(int a,int b){int i,r=1;for(i=1;i<=b;i++){r*=(a+1-i);r/=i;}return r;}\nint nHr(int a,int b){return nCr(a+b-1,b);}\nint fact(int a){int i,r=1;for(i=1;i<=a;i++){r*=i;}return r;}\nint pow(int a,int b){int i,r=1;for(i=1;i<=b;i++){r*=a;}return r;}\nint dsum(int x){int r=0;while(x){r+=(x%10);x/=10;}return r;}\nint dsumb(int x,int b){int r=0;while(x){r+=(x%b);x/=b;}return r;}\nint sankaku(int x){return ((1+x)*x)/2;}\nlong long llmax(long long a,long long b){if(a>b){return a;}return b;}\nlong long llmin(long long a,long long b){if(a<b){return a;}return b;}\nlong long llzt(long long a,long long b){return llmax(a,b)-llmin(a,b);}\nlong long llround(long long a,long long b){if((a%b)*2 >= b){return (a/b)+1;}return a/b;}\nlong long llceil(long long a,long long b){if(a%b==0){return a/b;}return (a/b)+1;}\nlong long llgcd(long long a,long long b){long long c;while(b!=0){c=a%b;a=b;b=c;}return a;}\nlong long lllcm(long long a,long long b){long long c=llgcd(a,b);a/=c;return a*b;}\nlong long llnCr(long long a,long long b){long long i,r=1;for(i=1;i<=b;i++){r*=(a+1-i);r/=i;}return r;}\nlong long llnHr(long long a,long long b){return llnCr(a+b-1,b);}\nlong long llfact(long long a){long long i,r=1;for(i=1;i<=a;i++){r*=i;}return r;}\nlong long llpow(long long a,long long b){long long i,r=1;for(i=1;i<=b;i++){r*=a;}return r;}\nlong long lldsum(long long x){long long r=0;while(x){r+=(x%10);x/=10;}return r;}\nlong long lldsumb(long long x,long long b){long long r=0;while(x){r+=(x%b);x/=b;}return r;}\nlong long llsankaku(long long x){return ((1+x)*x)/2;}\ndouble dbmax(double a,double b){if(a>b){return a;}return b;}\ndouble dbmin(double a,double b){if(a<b){return a;}return b;}\ndouble dbzt(double a,double b){return dbmax(a,b)-dbmin(a,b);}\nint sortfncsj(const void *a,const void *b){if(*(int *)a>*(int *)b){return 1;}if(*(int *)a==*(int *)b){return 0;}return -1;}\nint sortfnckj(const void *a,const void *b){if(*(int *)a<*(int *)b){return 1;}if(*(int *)a==*(int *)b){return 0;}return -1;}\nint llsortfncsj(const void *a,const void *b){if(*(long long *)a>*(long long *)b){return 1;}if(*(long long *)a==*(long long *)b){return 0;}return -1;}\nint llsortfnckj(const void *a,const void *b){if(*(long long *)a<*(long long *)b){return 1;}if(*(long long *)a==*(long long *)b){return 0;}return -1;}\nint dbsortfncsj(const void *a,const void *b){if(*(double *)a>*(double *)b){return 1;}if(*(double *)a==*(double *)b){return 0;}return -1;}\nint dbsortfnckj(const void *a,const void *b){if(*(double *)a<*(double *)b){return 1;}if(*(double *)a==*(double *)b){return 0;}return -1;}\nint strsortfncsj(const void *a,const void *b){return strcmp((char *)a,(char *)b);}\nint strsortfnckj(const void *a,const void *b){return strcmp((char *)b,(char *)a);}\nint chsortfncsj(const void *a,const void *b){if(*(char *)a>*(char *)b){return 1;}if(*(char *)a==*(char *)b){return 0;}return -1;}\nint chsortfnckj(const void *a,const void *b){if(*(char *)a<*(char *)b){return 1;}if(*(char *)a==*(char *)b){return 0;}return -1;}\n\nvoid shuffledget(int x[],int n){\n    srand(time(0));\n    int i,b[524288],p,c;\n    for(i=0;i<n;i++){\n        b[i]=i;\n    }\n    for(i=n;i>=1;i--){\n        p=rand()%i;\n        c=b[i-1];b[i-1]=b[p];b[p]=c;\n    }\n    for(i=0;i<n;i++){\n        scanf(\"%d\",&x[b[i]]);\n    }\n}\n\nint dx4[4]={1,-1,0,0};\nint dy4[4]={0,0,1,-1};\nint dx8[8]={-1,-1,-1,0,0,1,1,1};\nint dy8[8]={-1,0,1,-1,1,-1,0,1};\n\nint search(int x,int a[],int n){\n    int st=0,fi=n-1,te;\n    while(st<=fi){\n        te=(st+fi)/2;\n        if(a[te]<x){st=te+1;}else{fi=te-1;}\n    }\n    return st;\n}\n\nvoid prarr(int arr[],int n){\n  int i;\n  for(i=0;i<n;i++){\n    if(i){printf(\" \");}\n    printf(\"%d\",arr[i]);\n  }\n  printf(\"\\n\");\n  return;\n}\n\ntypedef struct{\nlong long val;\nlong long node;\n}sd;\n\nint sdsortfnc(const void *a,const void *b){\nif(((sd*)a)->val < ((sd*)b)->val){return -1;}\nif(((sd*)a)->val > ((sd*)b)->val){return 1;}\nreturn 0;\n}\n\ntypedef struct{\nlong long node;\nlong long cost;\n}data;\n\ndata heap[262144];\nlong long hsize=0;\n\nvoid resheap(){\n    long long i;\n    heap[0].node=-1;\n    heap[0].cost=inf;\n    for(i=1;i<262144;i++){\n        heap[i].node=-1;\n        heap[i].cost=-inf;\n    }\n}\n\nlong long swjud(data high,data low){\n    if(high.cost < low.cost){return 1;}\n    return -1;\n}\n\nvoid pqpush(data x){\n    long long a,b;\n    data m;\n    hsize++;\n    heap[hsize]=x;\n    a=hsize;\n    while(1){\n        b=a/2;\n        if(swjud(heap[b],heap[a]) == 1){\n            m=heap[a];heap[a]=heap[b];heap[b]=m;\n        }\n        else{break;}\n        a=b;\n    }\n}\n\ndata pqpop(){\n    long long a,b,c;\n    data m,sw;\n    m=heap[1];\n    heap[1]=heap[hsize];\n    heap[hsize].node=-1;\n    heap[hsize].cost=-inf;\n    hsize--;\n    a=1;\n    while(1){\n        b=a*2;c=a*2+1;\n        if(swjud(heap[a],heap[b])==-1 && swjud(heap[a],heap[c])==-1){break;}\n        if(swjud(heap[b],heap[c])==-1){\n            sw=heap[a];heap[a]=heap[b];heap[b]=sw;\n            a=b;\n        }\n        else{\n            sw=heap[a];heap[a]=heap[c];heap[c]=sw;\n            a=c;\n        }\n    }\n    return m;\n}\n\nint main(void){\n    resheap();\n    long long i,j,n,m,k,a[524288],b,c,h,w,r=0,l,t;\n    data pd,od;\n    sd dat[262144];\n    scanf(\"%lld%lld\",&n,&k);\n    for(i=0;i<n;i++){\n      scanf(\"%lld%lld\",&dat[i].val,&dat[i].node);\n    }\n    qsort(dat,n,sizeof(dat[0]),sdsortfnc);\n    dat[n].val=inf;\n    j=0;\n    for(i=1;i<=k;i++){\n      while(dat[j].val<=i){\n        pd.cost=dat[j].node;\n        pqpush(pd);\n        j++;\n      }\n      if(hsize>0){\n        od=pqpop();\n        r+=od.cost;\n      }\n    }\n    printf(\"%lld\\n\",r);\n    return 0;\n}\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nThere are N one-off jobs available. If you take the i-th job and complete it, you will earn the reward of B_i after A_i days from the day you do it.\n\nYou can take and complete at most one of these jobs in a day.\n\nHowever, you cannot retake a job that you have already done.\n\nFind the maximum total reward that you can earn no later than M days from today.\n\nYou can already start working today.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 10^5\n\n1 \\leq M \\leq 10^5\n\n1 \\leq A_i \\leq 10^5\n\n1 \\leq B_i \\leq 10^4\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 maximum total reward that you can earn no later than M days from today.\n\nSample Input 1\n\n3 4\n4 3\n4 1\n2 2\n\nSample Output 1\n\n5\n\nYou can earn the total reward of 5 by taking the jobs as follows:\n\nTake and complete the first job today. You will earn the reward of 3 after four days from today.\n\nTake and complete the third job tomorrow. You will earn the reward of 2 after two days from tomorrow, that is, after three days from today.\n\nSample Input 2\n\n5 3\n1 2\n1 3\n1 4\n2 1\n2 3\n\nSample Output 2\n\n10\n\nSample Input 3\n\n1 1\n2 1\n\nSample Output 3\n\n0", "sample_input": "3 4\n4 3\n4 1\n2 2\n"}, "reference_outputs": ["5\n"], "source_document_id": "p02948", "source_text": "Score : 400 points\n\nProblem Statement\n\nThere are N one-off jobs available. If you take the i-th job and complete it, you will earn the reward of B_i after A_i days from the day you do it.\n\nYou can take and complete at most one of these jobs in a day.\n\nHowever, you cannot retake a job that you have already done.\n\nFind the maximum total reward that you can earn no later than M days from today.\n\nYou can already start working today.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 10^5\n\n1 \\leq M \\leq 10^5\n\n1 \\leq A_i \\leq 10^5\n\n1 \\leq B_i \\leq 10^4\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 maximum total reward that you can earn no later than M days from today.\n\nSample Input 1\n\n3 4\n4 3\n4 1\n2 2\n\nSample Output 1\n\n5\n\nYou can earn the total reward of 5 by taking the jobs as follows:\n\nTake and complete the first job today. You will earn the reward of 3 after four days from today.\n\nTake and complete the third job tomorrow. You will earn the reward of 2 after two days from tomorrow, that is, after three days from today.\n\nSample Input 2\n\n5 3\n1 2\n1 3\n1 4\n2 1\n2 3\n\nSample Output 2\n\n10\n\nSample Input 3\n\n1 1\n2 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": 6171, "cpu_time_ms": 44, "memory_kb": 8828}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s746265835", "group_id": "codeNet:p02952", "input_text": "#include<stdio.h>\nint main(void){\nint N, sum=0;\nscanf(\"%d\",&N);\n/*while(N){\n    dig= N%10;\n    sum+=dig;\n    N/=10;\n}*/\nfor(int i=0;i<=N;i++){\nif(i>=1 && i<=9){\n     sum++;\n}else if(i>=100 && i<=999) {\n    sum++;\n}else if  (i>=10000 && i<=99999) {\n    sum++;\n}\n}\nprintf(\"%d\\n\",sum);\nreturn 0;\n}", "language": "C", "metadata": {"date": 1588483223, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "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/C/s746265835.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s746265835", "user_id": "u397953026"}, "prompt_components": {"gold_output": "9\n", "input_to_evaluate": "#include<stdio.h>\nint main(void){\nint N, sum=0;\nscanf(\"%d\",&N);\n/*while(N){\n    dig= N%10;\n    sum+=dig;\n    N/=10;\n}*/\nfor(int i=0;i<=N;i++){\nif(i>=1 && i<=9){\n     sum++;\n}else if(i>=100 && i<=999) {\n    sum++;\n}else if  (i>=10000 && i<=99999) {\n    sum++;\n}\n}\nprintf(\"%d\\n\",sum);\nreturn 0;\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": 294, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s539664358", "group_id": "codeNet:p02952", "input_text": "    #include <stdio.h>\n\n    int main(void)\n    {\n        int n,out;\n        scanf(\"%d\",&n);\n        if(n>9999)\n        {\n            out=n-9999+900+9;\n            if(n==100000)\n                out--;\n        }\n        else if(n>999)\n            out=999-99+9;\n        else if(n>99)\n            out=n-99+9;\n        else if(n>=9)\n            out=9;\n        else\n            out=n;\n        printf(\"%d\",out);\n        return 0;\n    }\n", "language": "C", "metadata": {"date": 1564970338, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "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/C/s539664358.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s539664358", "user_id": "u697726459"}, "prompt_components": {"gold_output": "9\n", "input_to_evaluate": "    #include <stdio.h>\n\n    int main(void)\n    {\n        int n,out;\n        scanf(\"%d\",&n);\n        if(n>9999)\n        {\n            out=n-9999+900+9;\n            if(n==100000)\n                out--;\n        }\n        else if(n>999)\n            out=999-99+9;\n        else if(n>99)\n            out=n-99+9;\n        else if(n>=9)\n            out=9;\n        else\n            out=n;\n        printf(\"%d\",out);\n        return 0;\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": 428, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s793941376", "group_id": "codeNet:p02958", "input_text": "#include<stdio.h>\nint main()\n{\n    int n, p[55], i, j, c=0, d=0;\n    scanf(\"%d\", &n);\n    for(i=0; i<n; i++)\n    {\n        scanf(\"%d\", &p[i]);\n    }\n    for(i=0; i<n; i++)\n    {\n        if(p[i]!=i+1)\n        {\n            c++;\n        }\n    }\n    if(c>2)\n    {\n        printf(\"NO\");\n    }\n    else if(c==0)\n    {\n        printf(\"YES\");\n    }\n    else\n    {\n        for(i=0; i<n-1; i++)\n        {\n            for(j=1; j<n; j++)\n            {\n                if(p[i]!=i && p[j]!=j && p[i]==j)\n                {\n                    d++;\n                    break;\n                }\n            }\n        }\n        if(d==0)\n        {\n            printf(\"NO\");\n        }\n        else\n        {\n            printf(\"YES\");\n        }\n    }\n    return 0;\n}", "language": "C", "metadata": {"date": 1595131320, "filename_ext": "c", "original_language": "C (GCC 9.2.1)", "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/C/s793941376.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s793941376", "user_id": "u018679195"}, "prompt_components": {"gold_output": "YES\n", "input_to_evaluate": "#include<stdio.h>\nint main()\n{\n    int n, p[55], i, j, c=0, d=0;\n    scanf(\"%d\", &n);\n    for(i=0; i<n; i++)\n    {\n        scanf(\"%d\", &p[i]);\n    }\n    for(i=0; i<n; i++)\n    {\n        if(p[i]!=i+1)\n        {\n            c++;\n        }\n    }\n    if(c>2)\n    {\n        printf(\"NO\");\n    }\n    else if(c==0)\n    {\n        printf(\"YES\");\n    }\n    else\n    {\n        for(i=0; i<n-1; i++)\n        {\n            for(j=1; j<n; j++)\n            {\n                if(p[i]!=i && p[j]!=j && p[i]==j)\n                {\n                    d++;\n                    break;\n                }\n            }\n        }\n        if(d==0)\n        {\n            printf(\"NO\");\n        }\n        else\n        {\n            printf(\"YES\");\n        }\n    }\n    return 0;\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": 747, "cpu_time_ms": 5, "memory_kb": 1728}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s013154620", "group_id": "codeNet:p02958", "input_text": "#include <stdio.h>\nint main(){\n int n;\n scanf(\"%d\",&n);\n int p[n];\n for(int a=0;a<n;a++){\n     scanf(\"%d\",&p[a]);\n }\n int count=0;\n for(int b=0;b<n-1;b++){\n     for(int c=1;c<n-b;c++){\n         if(count==0){\n             if(p[b]>p[b+c]){int tmp=b+c;int tmp3=p[b+c];\n                 for(int d=1;d<n-b-c;d++){\n                     if(tmp3>p[b+c+d]){tmp3=p[b+c+d];tmp=b+c+d;}}\n                     int tmp2;\n                     tmp2=p[b];\n                     p[b]=p[tmp];\n                     p[tmp]=tmp2;\n                     count++;}\n             else{}\n         }\n         else{if(p[b]<p[b+c]){}\n              else{printf(\"NO\\n\");return 0;}}\n     }\n }\n printf(\"YES\\n\");\n return 0;\n}", "language": "C", "metadata": {"date": 1568391538, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "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/C/s013154620.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s013154620", "user_id": "u272131408"}, "prompt_components": {"gold_output": "YES\n", "input_to_evaluate": "#include <stdio.h>\nint main(){\n int n;\n scanf(\"%d\",&n);\n int p[n];\n for(int a=0;a<n;a++){\n     scanf(\"%d\",&p[a]);\n }\n int count=0;\n for(int b=0;b<n-1;b++){\n     for(int c=1;c<n-b;c++){\n         if(count==0){\n             if(p[b]>p[b+c]){int tmp=b+c;int tmp3=p[b+c];\n                 for(int d=1;d<n-b-c;d++){\n                     if(tmp3>p[b+c+d]){tmp3=p[b+c+d];tmp=b+c+d;}}\n                     int tmp2;\n                     tmp2=p[b];\n                     p[b]=p[tmp];\n                     p[tmp]=tmp2;\n                     count++;}\n             else{}\n         }\n         else{if(p[b]<p[b+c]){}\n              else{printf(\"NO\\n\");return 0;}}\n     }\n }\n printf(\"YES\\n\");\n return 0;\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": 686, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s836620896", "group_id": "codeNet:p02958", "input_text": "#include <stdio.h>\n\nint main(void)\n{\n\tint i,j,N;\n\tint p[50]={};\n\tint m;\n\n\tscanf(\"%d\",&N);\n\n\tfor (i=0;i<N;i++){\n\t\tscanf(\"%d\",&p[i]);\n\t}\n\n\tm = 0;\n\tfor (i=0;i<N;i++){\n\t\tif (p[i] != i+1){\n\t\t\tm++;\n\t\t}\n\t}\n\t\n\tif ((m==0) || (m==2)){\n\t\tprintf(\"YES\");\n\t}\n\n\telse {\n\t\tprintf(\"NO\");\n\t}\n\treturn 0;\t\n\t\n}", "language": "C", "metadata": {"date": 1565214140, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "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/C/s836620896.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s836620896", "user_id": "u982939392"}, "prompt_components": {"gold_output": "YES\n", "input_to_evaluate": "#include <stdio.h>\n\nint main(void)\n{\n\tint i,j,N;\n\tint p[50]={};\n\tint m;\n\n\tscanf(\"%d\",&N);\n\n\tfor (i=0;i<N;i++){\n\t\tscanf(\"%d\",&p[i]);\n\t}\n\n\tm = 0;\n\tfor (i=0;i<N;i++){\n\t\tif (p[i] != i+1){\n\t\t\tm++;\n\t\t}\n\t}\n\t\n\tif ((m==0) || (m==2)){\n\t\tprintf(\"YES\");\n\t}\n\n\telse {\n\t\tprintf(\"NO\");\n\t}\n\treturn 0;\t\n\t\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": 288, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s576448312", "group_id": "codeNet:p02958", "input_text": "#include<stdio.h>\n#define FOR(n) for(int i=0;i<n;i++)\n#define PRN(n) printf(\"%d\\n\",n)\n#define PRS(s) printf(\"%s\\n\",s)\nint main(void){\n  int n,cnt=0;\n  scanf(\"%d\",&n);\n  FOR(n){\n    int a;\n    scanf(\"%d\",&a);\n    if(a-i)cnt++;\n  }\n  if(cnt<3){\n    PRS(\"YES\");\n  }else{\n    PRS(\"NO\");\n  }\n  return 0;\n}", "language": "C", "metadata": {"date": 1564284045, "filename_ext": "c", "original_language": "C (Clang 3.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/C/s576448312.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s576448312", "user_id": "u008829811"}, "prompt_components": {"gold_output": "YES\n", "input_to_evaluate": "#include<stdio.h>\n#define FOR(n) for(int i=0;i<n;i++)\n#define PRN(n) printf(\"%d\\n\",n)\n#define PRS(s) printf(\"%s\\n\",s)\nint main(void){\n  int n,cnt=0;\n  scanf(\"%d\",&n);\n  FOR(n){\n    int a;\n    scanf(\"%d\",&a);\n    if(a-i)cnt++;\n  }\n  if(cnt<3){\n    PRS(\"YES\");\n  }else{\n    PRS(\"NO\");\n  }\n  return 0;\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": 300, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s616252394", "group_id": "codeNet:p02958", "input_text": "#include <stdio.h>\n\nint main(void){\n    int n;\n    int count = 0;\n    scanf(\"%d\",&n);\n    int a[n];\n    for(int i = 0;i < n;i++){\n        scanf(\"%d\",&a[i]);\n    }\n    for(int i = 0;i < n;i++){\n        if(a[i]!=i+1){\n            count++;\n        }\n    }\n    if(count <= 2){\n        printf(\"YES\\n\");\n    }else{\n        printf(\"NO\\n\");\n    }\n    \n       return (0);\n    \n}", "language": "C", "metadata": {"date": 1564276964, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "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/C/s616252394.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s616252394", "user_id": "u562544687"}, "prompt_components": {"gold_output": "YES\n", "input_to_evaluate": "#include <stdio.h>\n\nint main(void){\n    int n;\n    int count = 0;\n    scanf(\"%d\",&n);\n    int a[n];\n    for(int i = 0;i < n;i++){\n        scanf(\"%d\",&a[i]);\n    }\n    for(int i = 0;i < n;i++){\n        if(a[i]!=i+1){\n            count++;\n        }\n    }\n    if(count <= 2){\n        printf(\"YES\\n\");\n    }else{\n        printf(\"NO\\n\");\n    }\n    \n       return (0);\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": 369, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s583570153", "group_id": "codeNet:p02958", "input_text": "#include<stdio.h>\n\nint main(void){\n  int i,N,c=0;\n  scanf(\"%d\",&N);\n  int P[N],A[N];\n  for(i=0;i<N;i++){\n    scanf(\"%d\",&P[i]);\n    A[i] = i+1;\n  }\n  \n  \n  \n  for(i=0;i<N;i++){\n    //printf(\"%d %d\\n\",P[i],A[i]);\n    if(P[i]!=A[i]){\n      c++;\n    }\n  }\n  \n  //printf(\"%d\\n\",c);\n  \n  if(c==2 || c==0){\n    printf(\"YES\");\n  }else{\n    printf(\"NO\");\n  }\n  \n}", "language": "C", "metadata": {"date": 1564276614, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "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/C/s583570153.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s583570153", "user_id": "u703877026"}, "prompt_components": {"gold_output": "YES\n", "input_to_evaluate": "#include<stdio.h>\n\nint main(void){\n  int i,N,c=0;\n  scanf(\"%d\",&N);\n  int P[N],A[N];\n  for(i=0;i<N;i++){\n    scanf(\"%d\",&P[i]);\n    A[i] = i+1;\n  }\n  \n  \n  \n  for(i=0;i<N;i++){\n    //printf(\"%d %d\\n\",P[i],A[i]);\n    if(P[i]!=A[i]){\n      c++;\n    }\n  }\n  \n  //printf(\"%d\\n\",c);\n  \n  if(c==2 || c==0){\n    printf(\"YES\");\n  }else{\n    printf(\"NO\");\n  }\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": 355, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s872748418", "group_id": "codeNet:p02963", "input_text": "#include <stdio.h>\n#include <math.h>\n\nint main(void){\n  long s;\n  int x1,y1,x2,y2,x3,y3;\n  double m;\n  long n;\n  int k,l;\n  x1 = 0;\n  \n  scanf(\"%ld\",&s); \n  //printf(\"%ld\",s);\n  \n  m = sqrt(s);\n  n = (int)m;\n  //printf(\"%d\",n);\n \n  int sr = s -n*n;\n  printf(\"%d\\n\",sr);\n  if(sr ==0){\n    printf(\"%d %d %d %d %d %d\\n\",sr,sr,n,sr,sr,n);\n  }else{\n  \n  for(int i = 2;i<1000000001;i++){\n    if(sr%i==0){\n      k =i;\n      l = sr/i;\n      break;\n    }\n    if(i ==1000000000){\n      k = 1;\n      l =sr;\n    }\n  }\n  printf(\"%d %d %d %d %d %d\\n\",x1,k,n,x1,l,n+k);\n  }\n  \n  return 0;\n}\n", "language": "C", "metadata": {"date": 1563763694, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "problem_description_relpath": "problem_descriptions/p02963.html", "problem_id": "p02963", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02963/input.txt", "sample_output_relpath": "derived/input_output/data/p02963/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02963/C/s872748418.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s872748418", "user_id": "u085767701"}, "prompt_components": {"gold_output": "1 0 2 2 0 1\n", "input_to_evaluate": "#include <stdio.h>\n#include <math.h>\n\nint main(void){\n  long s;\n  int x1,y1,x2,y2,x3,y3;\n  double m;\n  long n;\n  int k,l;\n  x1 = 0;\n  \n  scanf(\"%ld\",&s); \n  //printf(\"%ld\",s);\n  \n  m = sqrt(s);\n  n = (int)m;\n  //printf(\"%d\",n);\n \n  int sr = s -n*n;\n  printf(\"%d\\n\",sr);\n  if(sr ==0){\n    printf(\"%d %d %d %d %d %d\\n\",sr,sr,n,sr,sr,n);\n  }else{\n  \n  for(int i = 2;i<1000000001;i++){\n    if(sr%i==0){\n      k =i;\n      l = sr/i;\n      break;\n    }\n    if(i ==1000000000){\n      k = 1;\n      l =sr;\n    }\n  }\n  printf(\"%d %d %d %d %d %d\\n\",x1,k,n,x1,l,n+k);\n  }\n  \n  return 0;\n}\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nGiven is an integer S.\nFind a combination of six integers X_1,Y_1,X_2,Y_2,X_3, and Y_3 that satisfies all of the following conditions:\n\n0 \\leq X_1,Y_1,X_2,Y_2,X_3,Y_3 \\leq 10^9\n\nThe area of the triangle in a two-dimensional plane whose vertices are (X_1,Y_1),(X_2,Y_2), and (X_3,Y_3) is S/2.\n\nWe can prove that there always exist six integers that satisfy the conditions under the constraints of this problem.\n\nConstraints\n\n1 \\leq S \\leq 10^{18}\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 six integers X_1,Y_1,X_2,Y_2,X_3, and Y_3 that satisfy the conditions, in this order, with spaces in between.\nIf multiple solutions exist, any of them will be accepted.\n\nSample Input 1\n\n3\n\nSample Output 1\n\n1 0 2 2 0 1\n\nThe area of the triangle in a two-dimensional plane whose vertices are (1,0),(2,2), and (0,1) is 3/2.\nPrinting 3 0 3 1 0 1 or 1 0 0 1 2 2 will also be accepted.\n\nSample Input 2\n\n100\n\nSample Output 2\n\n0 0 10 0 0 10\n\nSample Input 3\n\n311114770564041497\n\nSample Output 3\n\n314159265 358979323 846264338 327950288 419716939 937510582", "sample_input": "3\n"}, "reference_outputs": ["1 0 2 2 0 1\n"], "source_document_id": "p02963", "source_text": "Score : 400 points\n\nProblem Statement\n\nGiven is an integer S.\nFind a combination of six integers X_1,Y_1,X_2,Y_2,X_3, and Y_3 that satisfies all of the following conditions:\n\n0 \\leq X_1,Y_1,X_2,Y_2,X_3,Y_3 \\leq 10^9\n\nThe area of the triangle in a two-dimensional plane whose vertices are (X_1,Y_1),(X_2,Y_2), and (X_3,Y_3) is S/2.\n\nWe can prove that there always exist six integers that satisfy the conditions under the constraints of this problem.\n\nConstraints\n\n1 \\leq S \\leq 10^{18}\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 six integers X_1,Y_1,X_2,Y_2,X_3, and Y_3 that satisfy the conditions, in this order, with spaces in between.\nIf multiple solutions exist, any of them will be accepted.\n\nSample Input 1\n\n3\n\nSample Output 1\n\n1 0 2 2 0 1\n\nThe area of the triangle in a two-dimensional plane whose vertices are (1,0),(2,2), and (0,1) is 3/2.\nPrinting 3 0 3 1 0 1 or 1 0 0 1 2 2 will also be accepted.\n\nSample Input 2\n\n100\n\nSample Output 2\n\n0 0 10 0 0 10\n\nSample Input 3\n\n311114770564041497\n\nSample Output 3\n\n314159265 358979323 846264338 327950288 419716939 937510582", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 576, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s939476861", "group_id": "codeNet:p02969", "input_text": "#include<stdio.h>\nint main()\n{\n\tint r;\n\n\tscanf(\"%d\",&r);\n\n\tprintf(\"%d\",3*r*r);\n\treturn 0;\n}", "language": "C", "metadata": {"date": 1594947897, "filename_ext": "c", "original_language": "C (GCC 9.2.1)", "problem_description_relpath": "problem_descriptions/p02969.html", "problem_id": "p02969", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02969/input.txt", "sample_output_relpath": "derived/input_output/data/p02969/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02969/C/s939476861.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s939476861", "user_id": "u596813883"}, "prompt_components": {"gold_output": "48\n", "input_to_evaluate": "#include<stdio.h>\nint main()\n{\n\tint r;\n\n\tscanf(\"%d\",&r);\n\n\tprintf(\"%d\",3*r*r);\n\treturn 0;\n}", "problem_context": "Score : 100 points\n\nProblem Statement\n\nIt is known that the area of a regular dodecagon inscribed in a circle of radius a is 3a^2.\n\nGiven an integer r, find the area of a regular dodecagon inscribed in a circle of radius r.\n\nConstraints\n\n1 \\leq r \\leq 100\n\nr is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nr\n\nOutput\n\nPrint an integer representing the area of the regular dodecagon.\n\nSample Input 1\n\n4\n\nSample Output 1\n\n48\n\nThe area of the regular dodecagon is 3 \\times 4^2 = 48.\n\nSample Input 2\n\n15\n\nSample Output 2\n\n675\n\nSample Input 3\n\n80\n\nSample Output 3\n\n19200", "sample_input": "4\n"}, "reference_outputs": ["48\n"], "source_document_id": "p02969", "source_text": "Score : 100 points\n\nProblem Statement\n\nIt is known that the area of a regular dodecagon inscribed in a circle of radius a is 3a^2.\n\nGiven an integer r, find the area of a regular dodecagon inscribed in a circle of radius r.\n\nConstraints\n\n1 \\leq r \\leq 100\n\nr is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nr\n\nOutput\n\nPrint an integer representing the area of the regular dodecagon.\n\nSample Input 1\n\n4\n\nSample Output 1\n\n48\n\nThe area of the regular dodecagon is 3 \\times 4^2 = 48.\n\nSample Input 2\n\n15\n\nSample Output 2\n\n675\n\nSample Input 3\n\n80\n\nSample Output 3\n\n19200", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 91, "cpu_time_ms": 5, "memory_kb": 1696}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s711890068", "group_id": "codeNet:p02971", "input_text": "//ABC135C\n#include <stdio.h>\n#include <string.h>\n#include <math.h>\nint main(){\n\tint n;\n\tscanf(\"%d\",&n);\n\tint a[n];\n\tint i, j, k, l, m;\n\tfor(i=0;i<n;i++){\n\t\tscanf(\"%d\",&a[i]);\n\t}\n\tint max;\n\tfor(j=0;j<n;j++){\n\t\tmax = a[0];\n\t\tif(j==0){\n\t\t\tmax = a[1];\n\t\t\tfor(k=2;k<n;k++){\n\t\t\t\tif(max<a[k]){\n\t\t\t\t\tmax = a[k];\n\t\t\t\t}else{\n\t\t\t\t\tmax = max;\n\t\t\t\t}\n\t\t\t}\n\t\t\tprintf(\"%d\\n\",max);\n\t\t}else{\n\t\t\tfor(l=0;l<j;l++){\n\t\t\t\tif(max<a[l]){\n\t\t\t\t\tmax = a[l];\n\t\t\t\t\t}else{\n\t\t\t\t\t\tmax = max;\n\t\t\t\t\t}\n\t\t\t}\n\t\t\tfor(m=j+1;m<n;m++){\n\t\t\t\tif(max<a[m]){\n\t\t\t\t\tmax = a[m];\n\t\t\t\t}else{\n\t\t\t\t\tmax = max;\n\t\t\t\t}\n\t\t\t}\n\t\tprintf(\"%d\\n\",max);\n\t\t}\n\t}\n\treturn 0;\n}", "language": "C", "metadata": {"date": 1565842413, "filename_ext": "c", "original_language": "C (Clang 3.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/C/s711890068.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s711890068", "user_id": "u733391043"}, "prompt_components": {"gold_output": "4\n3\n4\n", "input_to_evaluate": "//ABC135C\n#include <stdio.h>\n#include <string.h>\n#include <math.h>\nint main(){\n\tint n;\n\tscanf(\"%d\",&n);\n\tint a[n];\n\tint i, j, k, l, m;\n\tfor(i=0;i<n;i++){\n\t\tscanf(\"%d\",&a[i]);\n\t}\n\tint max;\n\tfor(j=0;j<n;j++){\n\t\tmax = a[0];\n\t\tif(j==0){\n\t\t\tmax = a[1];\n\t\t\tfor(k=2;k<n;k++){\n\t\t\t\tif(max<a[k]){\n\t\t\t\t\tmax = a[k];\n\t\t\t\t}else{\n\t\t\t\t\tmax = max;\n\t\t\t\t}\n\t\t\t}\n\t\t\tprintf(\"%d\\n\",max);\n\t\t}else{\n\t\t\tfor(l=0;l<j;l++){\n\t\t\t\tif(max<a[l]){\n\t\t\t\t\tmax = a[l];\n\t\t\t\t\t}else{\n\t\t\t\t\t\tmax = max;\n\t\t\t\t\t}\n\t\t\t}\n\t\t\tfor(m=j+1;m<n;m++){\n\t\t\t\tif(max<a[m]){\n\t\t\t\t\tmax = a[m];\n\t\t\t\t}else{\n\t\t\t\t\tmax = max;\n\t\t\t\t}\n\t\t\t}\n\t\tprintf(\"%d\\n\",max);\n\t\t}\n\t}\n\treturn 0;\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": 608, "cpu_time_ms": 2103, "memory_kb": 1152}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s124219622", "group_id": "codeNet:p02971", "input_text": "#include<stdio.h>\n\nint main(void){\n    long n, max1=0, max2=0, maxnum=0;/*max1最大値, その次 */\n    scanf(\"%ld\", &n);\n    long a[n];\n    for(long i=0; i<n; i++){\n        scanf(\"%ld\", &a[i]);\n        if(a[i] > max1){\n            max2 = max1; \n            max1 = a[i];\n            maxnum = i;//最大値を持つiを保存しておく\n        } \n        else if(a[i] <= max1 && a[i] > max2) max2 = a[i];\n    } \n    puts(\"\");\n    for(long i=0; i<n; i++){\n        if(i == maxnum){\n            printf(\"%ld\\n\", max2);\n        }else{\n            printf(\"%ld\\n\", max1);\n        }\n    }\n\n    return 0;\n}", "language": "C", "metadata": {"date": 1563727921, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "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/C/s124219622.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s124219622", "user_id": "u913543026"}, "prompt_components": {"gold_output": "4\n3\n4\n", "input_to_evaluate": "#include<stdio.h>\n\nint main(void){\n    long n, max1=0, max2=0, maxnum=0;/*max1最大値, その次 */\n    scanf(\"%ld\", &n);\n    long a[n];\n    for(long i=0; i<n; i++){\n        scanf(\"%ld\", &a[i]);\n        if(a[i] > max1){\n            max2 = max1; \n            max1 = a[i];\n            maxnum = i;//最大値を持つiを保存しておく\n        } \n        else if(a[i] <= max1 && a[i] > max2) max2 = a[i];\n    } \n    puts(\"\");\n    for(long i=0; i<n; i++){\n        if(i == maxnum){\n            printf(\"%ld\\n\", max2);\n        }else{\n            printf(\"%ld\\n\", max1);\n        }\n    }\n\n    return 0;\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": 600, "cpu_time_ms": 38, "memory_kb": 3072}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s006383771", "group_id": "codeNet:p02971", "input_text": "#include <stdio.h>\n\nint main()\n{\n  int n, a[200000], i, max, max2, mnum = 0;\n  \n  scanf(\"%d\", &n);\n  \n  for(i = 0; i < n; i++){\n    scanf(\"%d\", &a[i]);\n  }\n  max = max2 = a[0];\n  for(i = 1; i < n; i++){\n    if(max <= a[i]){\n      max2 = max;\n      mnum = i;\n      max = a[i];\n    }\n    else if(max2 < a[i])\n      max2 = a[i];\n  }\n  \n  for(i = 0; i < n; i++){\n    if(mnum == i)\n      printf(\"%d\\n\", max2);\n    else\n      printf(\"%d\\n\", max);\n  }\n  \n  return 0;\n}", "language": "C", "metadata": {"date": 1563675864, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "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/C/s006383771.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s006383771", "user_id": "u162635594"}, "prompt_components": {"gold_output": "4\n3\n4\n", "input_to_evaluate": "#include <stdio.h>\n\nint main()\n{\n  int n, a[200000], i, max, max2, mnum = 0;\n  \n  scanf(\"%d\", &n);\n  \n  for(i = 0; i < n; i++){\n    scanf(\"%d\", &a[i]);\n  }\n  max = max2 = a[0];\n  for(i = 1; i < n; i++){\n    if(max <= a[i]){\n      max2 = max;\n      mnum = i;\n      max = a[i];\n    }\n    else if(max2 < a[i])\n      max2 = a[i];\n  }\n  \n  for(i = 0; i < n; i++){\n    if(mnum == i)\n      printf(\"%d\\n\", max2);\n    else\n      printf(\"%d\\n\", max);\n  }\n  \n  return 0;\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": 461, "cpu_time_ms": 39, "memory_kb": 2304}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s964199704", "group_id": "codeNet:p02971", "input_text": "#include <stdio.h>\n#include <stdlib.h>\n#include <string.h>\n#include <math.h>\nint compare_int(const void *a, const void *b)\n{\n    return *(int*)a - *(int*)b;\n//    return *(long long*)a - *(long long*)b;\n}\n//  qsort(A, b, sizeof(int), compare_int);\n\nlong long  factorial(long long n) {\n    if (n > 0) {\n        return n * factorial(n - 1);\n    } else {\n        return 1;\n    }\n}\n\nint min(int a, int b) {\n    if (a > b)\n        return b;\n    else\n        return a;\n}\n\nint distance(int a, int b) {\n  return abs(a-b)*abs(a-b);\n}\n\n//int ()\n\n\n\nint main()\n{\n  int a ,b, c, d, e, X, Y;\n//  long long  a, b, c, d, e, X, Y;\n  //  double  c;\n  int  A[200003]={};\n//  long long  A[100003]={};\n//  long long  B[100003]={};\n  int  C[100003][11]={};\n\n  int  flg=0;\n\n//  long long  a, b, c, d, X, Y;\n  char s[101][101]={};\n  char t[101]={};\n//  int N, M;\n//  int A[1000000001]={};\n//  long long  C[101]={};\n  int i,j,k;\n  long long p,q;\n//  int flag=0;\n//  int tmp=0;\n  char tmp[101]={};\n//  long long min=10000000000;\n//  long long min=100000001;\n  int len=0;\n  int l=0;\n  int r=1000001;\n  int cnt=0;\n  int num=0;\n  int num1=0;\n  int num2=0;\n  long long ans=1;\n  int max=0;\n  int sum=0;\n  int addr=0;\n  int ptn=0;\n//  bool on_off[100]={};\n  \n//  char alp[26]={'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\n  //  a=0;\n//  scanf(\"%lld %lld\", &a, &b);\n  scanf(\"%d\", &a);\n//    printf(\"%d\\n\", num);\n  for(i=0;i<a;i++){\n    scanf(\"%d\", &A[i]);\n  }\n  for(i=0;i<a;i++){\n    if(num2<A[i]){\n      num2=A[i];\n    } \n    if(num1<num2){\n      ptn=num1;\n      num1=num2;\n      num2=ptn;\n      num=i;\n    }\n  }\n  for(i=0;i<a;i++){\n    if(i==num)    printf(\"%d\\n\", num2);\n    else          printf(\"%d\\n\", num1);\n  }\n  \n\n    \n//    printf(\"%s %d %d\\n\", s[i],C[i][0],C[i][1]);\n   // printf(\"%d\\n\", C[i][1]);\n/*  for(i=0;i<addr;i++){\n//  scanf(\"%lld%lld\", &B[0][i],&B[1][i]);\n//    ans=ans+A[i];\n    printf(\"%lld \", A[i]);\n  }\n*/\n//    printf(\"%d \", cnt);\n   \n\nreturn 0;\n}\n", "language": "C", "metadata": {"date": 1563672586, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "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/C/s964199704.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s964199704", "user_id": "u301843562"}, "prompt_components": {"gold_output": "4\n3\n4\n", "input_to_evaluate": "#include <stdio.h>\n#include <stdlib.h>\n#include <string.h>\n#include <math.h>\nint compare_int(const void *a, const void *b)\n{\n    return *(int*)a - *(int*)b;\n//    return *(long long*)a - *(long long*)b;\n}\n//  qsort(A, b, sizeof(int), compare_int);\n\nlong long  factorial(long long n) {\n    if (n > 0) {\n        return n * factorial(n - 1);\n    } else {\n        return 1;\n    }\n}\n\nint min(int a, int b) {\n    if (a > b)\n        return b;\n    else\n        return a;\n}\n\nint distance(int a, int b) {\n  return abs(a-b)*abs(a-b);\n}\n\n//int ()\n\n\n\nint main()\n{\n  int a ,b, c, d, e, X, Y;\n//  long long  a, b, c, d, e, X, Y;\n  //  double  c;\n  int  A[200003]={};\n//  long long  A[100003]={};\n//  long long  B[100003]={};\n  int  C[100003][11]={};\n\n  int  flg=0;\n\n//  long long  a, b, c, d, X, Y;\n  char s[101][101]={};\n  char t[101]={};\n//  int N, M;\n//  int A[1000000001]={};\n//  long long  C[101]={};\n  int i,j,k;\n  long long p,q;\n//  int flag=0;\n//  int tmp=0;\n  char tmp[101]={};\n//  long long min=10000000000;\n//  long long min=100000001;\n  int len=0;\n  int l=0;\n  int r=1000001;\n  int cnt=0;\n  int num=0;\n  int num1=0;\n  int num2=0;\n  long long ans=1;\n  int max=0;\n  int sum=0;\n  int addr=0;\n  int ptn=0;\n//  bool on_off[100]={};\n  \n//  char alp[26]={'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\n  //  a=0;\n//  scanf(\"%lld %lld\", &a, &b);\n  scanf(\"%d\", &a);\n//    printf(\"%d\\n\", num);\n  for(i=0;i<a;i++){\n    scanf(\"%d\", &A[i]);\n  }\n  for(i=0;i<a;i++){\n    if(num2<A[i]){\n      num2=A[i];\n    } \n    if(num1<num2){\n      ptn=num1;\n      num1=num2;\n      num2=ptn;\n      num=i;\n    }\n  }\n  for(i=0;i<a;i++){\n    if(i==num)    printf(\"%d\\n\", num2);\n    else          printf(\"%d\\n\", num1);\n  }\n  \n\n    \n//    printf(\"%s %d %d\\n\", s[i],C[i][0],C[i][1]);\n   // printf(\"%d\\n\", C[i][1]);\n/*  for(i=0;i<addr;i++){\n//  scanf(\"%lld%lld\", &B[0][i],&B[1][i]);\n//    ans=ans+A[i];\n    printf(\"%lld \", A[i]);\n  }\n*/\n//    printf(\"%d \", cnt);\n   \n\nreturn 0;\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": 2001, "cpu_time_ms": 39, "memory_kb": 2304}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s973298356", "group_id": "codeNet:p02971", "input_text": "#include <stdbool.h>\n#include <stdio.h>\n#include <stdlib.h>\n#include <inttypes.h>\n#include <ctype.h>\n#include <stdint.h>\n#include <string.h>\n#include <wchar.h>\n#include <math.h>\n\n#define N_MAX (100)\n#define P_MAX (100)\n#define DP_ARRAY_SIZE (N_MAX * P_MAX / 32 + 1)\n\n#define MIN(a, b) ((a) < (b) ? (a) : (b))\n#define MAX(a, b) ((a) > (b) ? (a) : (b))\n#define ABS(a) ((a) < 0 ? -(a) : (a))\n#define ABSS(a, b) ((a) > (b) ? (a) - (b) : (b) - (a))\n\nint compare_sz_asc(const void* a, const void* b) {\n    return *((size_t*)a) < *((size_t*)b) ? -1 : 1;\n}\n\nint compare_sz_desc(const void* a, const void* b) {\n    return *((size_t*)a) > * ((size_t*)b) ? -1 : 1;\n}\n\nint compare_i64_asc(const void* a, const void* b) {\n    return *((int64_t*)a) < *((int64_t*)b) ? -1 : 1;\n}\n\nint compare_i64_desc(const void* a, const void* b) {\n    return *((int64_t*)a) > * ((int64_t*)b) ? -1 : 1;\n}\n\nint compare_c_asc(const void* a, const void* b) {\n    return *((char*)a) < *((char*)b) ? -1 : 1;\n}\n\nint compare_c_desc(const void* a, const void* b) {\n    return *((char*)a) > * ((char*)b) ? -1 : 1;\n}\n\nstatic size_t powSz(const size_t base, const size_t exp) {\n    if (exp == 0) {\n        return 1;\n    }\n\n    if (exp == 1) {\n        return base;\n    }\n\n    if (exp % 2 == 0) {\n        return powSz(base * base, exp / 2);\n    }\n    else {\n        return base * powSz(base, exp - 1);\n    }\n}\n\nstatic size_t comb(const size_t n, const size_t r) {\n    size_t result = 1;\n\n    for (size_t i = 0; i < r; i++) {\n        result *= n - i;\n        result /= i + 1;\n    }\n\n    return result;\n}\n\nstatic uint64_t combU64(const uint64_t n, const uint64_t r) {\n    uint64_t result = 1;\n\n    for (uint64_t i = 0; i < r; i++) {\n        result *= n - i;\n        result /= i + 1;\n    }\n\n    return result;\n}\n\nstatic size_t gcdZu(size_t m, size_t n) {\n    size_t temp;\n\n    while (m % n != 0) {\n        temp = n;\n        n = m % n;\n        m = temp;\n    }\n\n    return n;\n}\n\nstatic uint64_t gcdU64(uint64_t m, uint64_t n)\n{\n    uint64_t temp;\n\n    while (m % n != 0) {\n        temp = n;\n        n = m % n;\n        m = temp;\n    }\n\n    return n;\n}\n\ntypedef struct {\n    uint64_t A;\n    uint64_t idx;\n    uint64_t order;\n} _info;\n\nstatic _info info[200000];\n\nstatic int compare_num(const void* a, const void* b) {\n    const _info* aP = (_info*)a;\n    const _info* bP = (_info*)b;\n\n    return aP->A > bP->A ? -1 : 1;\n}\n\nstatic int compare_idx(const void* a, const void* b) {\n    const _info* aP = (_info*)a;\n    const _info* bP = (_info*)b;\n\n    return aP->idx < bP->idx ? -1 : 1;\n}\n\nint main(void) {\n    uint64_t N;\n\n    scanf(\"%\"PRIu64, &N);\n\n    for (uint64_t i = 0; i < N; i++) {\n        scanf(\"%\"PRIu64, &(info[i].A));\n        info[i].idx = i;\n    }\n\n    qsort(info, (size_t)N, sizeof(_info), compare_num);\n\n    for (uint64_t i = 0; i < N; i++) {\n        info[i].order = i;\n    }\n\n    uint64_t orderIdx[2];\n\n    orderIdx[0] = info[0].idx;\n    orderIdx[1] = info[1].idx;\n\n    qsort(info, (size_t)N, sizeof(_info), compare_idx);\n\n    for (uint64_t i = 0; i < N; i++) {\n        printf(\"%\"PRIu64\"\\n\", info[i].order == 0 ? info[orderIdx[1]].A : info[orderIdx[0]].A);\n    }\n\n    return 0;\n}\n", "language": "C", "metadata": {"date": 1563671764, "filename_ext": "c", "original_language": "C (Clang 3.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/C/s973298356.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s973298356", "user_id": "u615782628"}, "prompt_components": {"gold_output": "4\n3\n4\n", "input_to_evaluate": "#include <stdbool.h>\n#include <stdio.h>\n#include <stdlib.h>\n#include <inttypes.h>\n#include <ctype.h>\n#include <stdint.h>\n#include <string.h>\n#include <wchar.h>\n#include <math.h>\n\n#define N_MAX (100)\n#define P_MAX (100)\n#define DP_ARRAY_SIZE (N_MAX * P_MAX / 32 + 1)\n\n#define MIN(a, b) ((a) < (b) ? (a) : (b))\n#define MAX(a, b) ((a) > (b) ? (a) : (b))\n#define ABS(a) ((a) < 0 ? -(a) : (a))\n#define ABSS(a, b) ((a) > (b) ? (a) - (b) : (b) - (a))\n\nint compare_sz_asc(const void* a, const void* b) {\n    return *((size_t*)a) < *((size_t*)b) ? -1 : 1;\n}\n\nint compare_sz_desc(const void* a, const void* b) {\n    return *((size_t*)a) > * ((size_t*)b) ? -1 : 1;\n}\n\nint compare_i64_asc(const void* a, const void* b) {\n    return *((int64_t*)a) < *((int64_t*)b) ? -1 : 1;\n}\n\nint compare_i64_desc(const void* a, const void* b) {\n    return *((int64_t*)a) > * ((int64_t*)b) ? -1 : 1;\n}\n\nint compare_c_asc(const void* a, const void* b) {\n    return *((char*)a) < *((char*)b) ? -1 : 1;\n}\n\nint compare_c_desc(const void* a, const void* b) {\n    return *((char*)a) > * ((char*)b) ? -1 : 1;\n}\n\nstatic size_t powSz(const size_t base, const size_t exp) {\n    if (exp == 0) {\n        return 1;\n    }\n\n    if (exp == 1) {\n        return base;\n    }\n\n    if (exp % 2 == 0) {\n        return powSz(base * base, exp / 2);\n    }\n    else {\n        return base * powSz(base, exp - 1);\n    }\n}\n\nstatic size_t comb(const size_t n, const size_t r) {\n    size_t result = 1;\n\n    for (size_t i = 0; i < r; i++) {\n        result *= n - i;\n        result /= i + 1;\n    }\n\n    return result;\n}\n\nstatic uint64_t combU64(const uint64_t n, const uint64_t r) {\n    uint64_t result = 1;\n\n    for (uint64_t i = 0; i < r; i++) {\n        result *= n - i;\n        result /= i + 1;\n    }\n\n    return result;\n}\n\nstatic size_t gcdZu(size_t m, size_t n) {\n    size_t temp;\n\n    while (m % n != 0) {\n        temp = n;\n        n = m % n;\n        m = temp;\n    }\n\n    return n;\n}\n\nstatic uint64_t gcdU64(uint64_t m, uint64_t n)\n{\n    uint64_t temp;\n\n    while (m % n != 0) {\n        temp = n;\n        n = m % n;\n        m = temp;\n    }\n\n    return n;\n}\n\ntypedef struct {\n    uint64_t A;\n    uint64_t idx;\n    uint64_t order;\n} _info;\n\nstatic _info info[200000];\n\nstatic int compare_num(const void* a, const void* b) {\n    const _info* aP = (_info*)a;\n    const _info* bP = (_info*)b;\n\n    return aP->A > bP->A ? -1 : 1;\n}\n\nstatic int compare_idx(const void* a, const void* b) {\n    const _info* aP = (_info*)a;\n    const _info* bP = (_info*)b;\n\n    return aP->idx < bP->idx ? -1 : 1;\n}\n\nint main(void) {\n    uint64_t N;\n\n    scanf(\"%\"PRIu64, &N);\n\n    for (uint64_t i = 0; i < N; i++) {\n        scanf(\"%\"PRIu64, &(info[i].A));\n        info[i].idx = i;\n    }\n\n    qsort(info, (size_t)N, sizeof(_info), compare_num);\n\n    for (uint64_t i = 0; i < N; i++) {\n        info[i].order = i;\n    }\n\n    uint64_t orderIdx[2];\n\n    orderIdx[0] = info[0].idx;\n    orderIdx[1] = info[1].idx;\n\n    qsort(info, (size_t)N, sizeof(_info), compare_idx);\n\n    for (uint64_t i = 0; i < N; i++) {\n        printf(\"%\"PRIu64\"\\n\", info[i].order == 0 ? info[orderIdx[1]].A : info[orderIdx[0]].A);\n    }\n\n    return 0;\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": 3142, "cpu_time_ms": 118, "memory_kb": 10924}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s312391484", "group_id": "codeNet:p02975", "input_text": "#include <stdio.h>\n#include<math.h>\nint main()\n{\n    int arr[50],flag=0;\n    int t;\n    scanf(\"%d\",&t);\n    for(int j=0;j<t;j++)\n    {\n        scanf(\"%d\",&arr[j]);\n    }\n    int diff[t-1];\n    for (int i = 0; i < (t-1); i++) {\n        diff[i] = abs(arr[i] - arr[i + 1]);\n    }\n    for(int i=0;i<(t-1);i++)\n    {\n        int n=diff[i];\n        if(n==diff[i+1])\n            flag++;\n        else\n            break;\n    }\n\n    if(flag==(t-2))\n        printf(\"Yes\\n\");\n    else\n        printf(\"No\\n\");\n}\n", "language": "C", "metadata": {"date": 1585962523, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "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/C/s312391484.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s312391484", "user_id": "u353919145"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "#include <stdio.h>\n#include<math.h>\nint main()\n{\n    int arr[50],flag=0;\n    int t;\n    scanf(\"%d\",&t);\n    for(int j=0;j<t;j++)\n    {\n        scanf(\"%d\",&arr[j]);\n    }\n    int diff[t-1];\n    for (int i = 0; i < (t-1); i++) {\n        diff[i] = abs(arr[i] - arr[i + 1]);\n    }\n    for(int i=0;i<(t-1);i++)\n    {\n        int n=diff[i];\n        if(n==diff[i+1])\n            flag++;\n        else\n            break;\n    }\n\n    if(flag==(t-2))\n        printf(\"Yes\\n\");\n    else\n        printf(\"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": 499, "cpu_time_ms": 100, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s293230365", "group_id": "codeNet:p02981", "input_text": "#include<stdio.h>\nint main ()\n{\n  int N,A,B,X;\n  scanf(\"%d %d %d\",&N,&A,&B);\n  X=N*A;\n  if(X<B)\n  {\n       printf(\"%d\",X);\n  }\n  else if (X>B)\n  {\n      printf(\"%d\",B);\n  }\n  else if (X=B)\n  {\n       printf(\"%d\",B);\n  }\n}\n", "language": "C", "metadata": {"date": 1571541634, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "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/C/s293230365.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s293230365", "user_id": "u353919145"}, "prompt_components": {"gold_output": "8\n", "input_to_evaluate": "#include<stdio.h>\nint main ()\n{\n  int N,A,B,X;\n  scanf(\"%d %d %d\",&N,&A,&B);\n  X=N*A;\n  if(X<B)\n  {\n       printf(\"%d\",X);\n  }\n  else if (X>B)\n  {\n      printf(\"%d\",B);\n  }\n  else if (X=B)\n  {\n       printf(\"%d\",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": 222, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s963948308", "group_id": "codeNet:p02981", "input_text": "#include<stdio.h>\nint main()\n{\nint n,a,b;\nscanf(\"%d%d%d\",&n,&a,&b);\nif(a>b)\nprintf(\"%d\",n*b);\nelse\nprintf(\"%d\",n*a);\nreturn 0;\n}\n", "language": "C", "metadata": {"date": 1568480848, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "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/C/s963948308.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s963948308", "user_id": "u098592499"}, "prompt_components": {"gold_output": "8\n", "input_to_evaluate": "#include<stdio.h>\nint main()\n{\nint n,a,b;\nscanf(\"%d%d%d\",&n,&a,&b);\nif(a>b)\nprintf(\"%d\",n*b);\nelse\nprintf(\"%d\",n*a);\nreturn 0;\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": 129, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s997190920", "group_id": "codeNet:p02981", "input_text": "#include<stdio.h>\nint main(){\n\n  int A,B,N; \n  int sum1,sum2,min;\n  1 <= N <=20;\n  1 <= A <=50;\n  1 <= B <=50;\n  sum1 = A*N;\n  sum2 = B*N;\n\n  scanf(\"%d,%d,%d\\n\", N,A,B);\n  if (sum1 >= sum2) {\n    min = sum2;\n    printf(\"%d\\n\", min);\n  }\n  else\n   min = sum1;\n   printf(\"%d\\n\", min);\n\n   return 0;\n}", "language": "C", "metadata": {"date": 1564889276, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "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/C/s997190920.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s997190920", "user_id": "u228943017"}, "prompt_components": {"gold_output": "8\n", "input_to_evaluate": "#include<stdio.h>\nint main(){\n\n  int A,B,N; \n  int sum1,sum2,min;\n  1 <= N <=20;\n  1 <= A <=50;\n  1 <= B <=50;\n  sum1 = A*N;\n  sum2 = B*N;\n\n  scanf(\"%d,%d,%d\\n\", N,A,B);\n  if (sum1 >= sum2) {\n    min = sum2;\n    printf(\"%d\\n\", min);\n  }\n  else\n   min = sum1;\n   printf(\"%d\\n\", min);\n\n   return 0;\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": 298, "cpu_time_ms": 98, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s087349176", "group_id": "codeNet:p02981", "input_text": "#include<stdio.h>\nint main()\n{\n    int n,p,q,j;\n    scanf(\"%d %d %d\",&n,&p,&q);\n    if(p>q){j=q*n;}\n    else j=p*n;\n    printf(\"%d\\n\",j);\n    return 0;\n}", "language": "C", "metadata": {"date": 1563774444, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "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/C/s087349176.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s087349176", "user_id": "u089230684"}, "prompt_components": {"gold_output": "8\n", "input_to_evaluate": "#include<stdio.h>\nint main()\n{\n    int n,p,q,j;\n    scanf(\"%d %d %d\",&n,&p,&q);\n    if(p>q){j=q*n;}\n    else j=p*n;\n    printf(\"%d\\n\",j);\n    return 0;\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": 153, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s260818681", "group_id": "codeNet:p02981", "input_text": "#include<stdio.h>\n\nint main(void) {\n\tint N, A, B;\n\tscanf(\"%d%d%d\", &N, &A, &B);\n\tif (N * A >= B) {\n\t\tprintf(\"%d\\n\",B);\n\t}else {\n\t\tprintf(\"%d\\n\", N * A);\n\t}\n\treturn 0;\n}", "language": "C", "metadata": {"date": 1562547939, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "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/C/s260818681.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s260818681", "user_id": "u082245101"}, "prompt_components": {"gold_output": "8\n", "input_to_evaluate": "#include<stdio.h>\n\nint main(void) {\n\tint N, A, B;\n\tscanf(\"%d%d%d\", &N, &A, &B);\n\tif (N * A >= B) {\n\t\tprintf(\"%d\\n\",B);\n\t}else {\n\t\tprintf(\"%d\\n\", N * A);\n\t}\n\treturn 0;\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": 168, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s181718589", "group_id": "codeNet:p02981", "input_text": "#include <stdio.h>\n\nint main(void) {\n\tint a,b,c;\n\tint ans; \n\tscanf(\"%d %d %d\",&a,&b,&c);\n\tans = a*b;\n\tif(ans <c){\n\t    printf(\"%d\",ans);\n\t}else{\n\t    printf(\"%d\",c);\n\t}\n\treturn 0;\n}\n\n", "language": "C", "metadata": {"date": 1562547786, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "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/C/s181718589.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s181718589", "user_id": "u922786510"}, "prompt_components": {"gold_output": "8\n", "input_to_evaluate": "#include <stdio.h>\n\nint main(void) {\n\tint a,b,c;\n\tint ans; \n\tscanf(\"%d %d %d\",&a,&b,&c);\n\tans = a*b;\n\tif(ans <c){\n\t    printf(\"%d\",ans);\n\t}else{\n\t    printf(\"%d\",c);\n\t}\n\treturn 0;\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": 183, "cpu_time_ms": 2, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s335893869", "group_id": "codeNet:p02982", "input_text": "#include<stdio.h>\n#include<math.h>\n\nint main(void)\n{\n  //nとdを入力\n  int n,d;\n  scanf(\"%d%d\",&n,&d);\n\n  //n個の座標をforで入力\n  int i,j,k;\n  int x[n][d];\n  for(i=0;i<n;i++)\n    for(k=0;k<d;k++)\n      scanf(\"%d\",&x[i][k]);\n\n  //計算開始\n  float dist;\n  int cnt=0;\n  //i,jを決める\n  for(i=0;i<n;i++)\n    for(j=i+1;j<n-(i+1);j++){\n\n      //点iと点jの距離を求める\n      dist = 0;\n      for(k=0;k<d;k++)\n        dist += pow((x[i][k]-x[j][k]),2);\n      dist = sqrt(dist);\n      \n      //ceil(切り上げ関数)とfloor(切り捨て関数)を使ってdistが整数か判定\n      //distが整数ならcntを1増やす\n      if(ceil(dist)==floor(dist))\n        cnt++;\n    }\n\n  //cntを出力して終了\n  printf(\"%d\\n\",cnt);\n  return 0;\n}\n", "language": "C", "metadata": {"date": 1590175204, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "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/C/s335893869.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s335893869", "user_id": "u803101149"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "#include<stdio.h>\n#include<math.h>\n\nint main(void)\n{\n  //nとdを入力\n  int n,d;\n  scanf(\"%d%d\",&n,&d);\n\n  //n個の座標をforで入力\n  int i,j,k;\n  int x[n][d];\n  for(i=0;i<n;i++)\n    for(k=0;k<d;k++)\n      scanf(\"%d\",&x[i][k]);\n\n  //計算開始\n  float dist;\n  int cnt=0;\n  //i,jを決める\n  for(i=0;i<n;i++)\n    for(j=i+1;j<n-(i+1);j++){\n\n      //点iと点jの距離を求める\n      dist = 0;\n      for(k=0;k<d;k++)\n        dist += pow((x[i][k]-x[j][k]),2);\n      dist = sqrt(dist);\n      \n      //ceil(切り上げ関数)とfloor(切り捨て関数)を使ってdistが整数か判定\n      //distが整数ならcntを1増やす\n      if(ceil(dist)==floor(dist))\n        cnt++;\n    }\n\n  //cntを出力して終了\n  printf(\"%d\\n\",cnt);\n  return 0;\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": 765, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s292704411", "group_id": "codeNet:p02982", "input_text": "#include <stdio.h>\n\nint main(void)\n{\n    int N,D;\n    int X[10][10];\n    scanf(\"%d%d\",&N,&D);\n    for(int i=1;i<=N;i++){\n        for(int j=1;j<=D;j++){\n            scanf(\"%d\",&X[i][j]);\n        }\n    }\n    int c=0;\n    for(int i=1;i<=N-1;i++){\n        for(int j=i+1;j<=N;j++){\n            //printf(\"i=%d j=%d\\n\",i,j);\n            int sum=0;\n            for(int k=1;k<=D;k++){\n                sum+=(X[i][k]-X[j][k])*(X[i][k]-X[j][k]);\n            }\n            //printf(\"i=%d j=%d sum=%d\\n\",i,j,sum);\n            for(int l=1;l<=20;l++){\n                if(sum==l*l){\n                    c++;\n                    break;\n                }\n            }\n        }\n    }\n    printf(\"%d\\n\",c);\n    return 0;\n}\n", "language": "C", "metadata": {"date": 1562554255, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "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/C/s292704411.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s292704411", "user_id": "u912025537"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "#include <stdio.h>\n\nint main(void)\n{\n    int N,D;\n    int X[10][10];\n    scanf(\"%d%d\",&N,&D);\n    for(int i=1;i<=N;i++){\n        for(int j=1;j<=D;j++){\n            scanf(\"%d\",&X[i][j]);\n        }\n    }\n    int c=0;\n    for(int i=1;i<=N-1;i++){\n        for(int j=i+1;j<=N;j++){\n            //printf(\"i=%d j=%d\\n\",i,j);\n            int sum=0;\n            for(int k=1;k<=D;k++){\n                sum+=(X[i][k]-X[j][k])*(X[i][k]-X[j][k]);\n            }\n            //printf(\"i=%d j=%d sum=%d\\n\",i,j,sum);\n            for(int l=1;l<=20;l++){\n                if(sum==l*l){\n                    c++;\n                    break;\n                }\n            }\n        }\n    }\n    printf(\"%d\\n\",c);\n    return 0;\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": 704, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s042763464", "group_id": "codeNet:p02984", "input_text": "#include <stdio.h>\n#define N 100000\n\nint main(void){\n    int n;\n    int a[N+1];\n    int memo0[N+1] = {};\n    int memo1[N+1] = {};\n    int i;\n    int sum;\n    \n    \n    scanf(\"%d\", &n);\n    for(i = 1; i <= n; i++){\n        scanf(\"%d\", &a[i]);\n    }\n    \n    for(i = 1; i <= n; i++){\n        if(i & 1){//i=2k+1\n            memo0[i] = memo0[i-1] - a[i];\n        }else{\n            memo0[i] = memo0[i-1] + a[i];\n        }\n    }\n    \n    for(i = 1; i <= n; i++){\n        if(i & 1){//i=2k+1\n            memo1[i] = memo1[i-1] + a[i];\n        }else{\n            memo1[i] = memo1[i-1] - a[i];\n        }\n    }\n    \n    for(i = 1; i <= n; i++){\n        if(i == n){\n            //sum = memo0[n];\n            sum = a[i] + (memo0[i-1]) + (memo1[n] - memo1[i]);\n        }else if(i & 1){\n            //sum = a[i] + (memo1[i-1]) + (memo0[n] - memo0[i]);\n            sum = a[i] + (memo0[i-1]) + (memo1[n] - memo1[i]);\n        }else{\n            //sum = a[i] + (memo0[i-1]) + (memo1[n] - memo1[i]);\n            sum = a[i] + (memo1[i-1]) + (memo0[n] - memo0[i]);\n        }\n        \n        printf(\"%d \", sum);\n    }\n    \n    return 0;\n}", "language": "C", "metadata": {"date": 1562552118, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "problem_description_relpath": "problem_descriptions/p02984.html", "problem_id": "p02984", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02984/input.txt", "sample_output_relpath": "derived/input_output/data/p02984/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02984/C/s042763464.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s042763464", "user_id": "u828593789"}, "prompt_components": {"gold_output": "4 0 4\n", "input_to_evaluate": "#include <stdio.h>\n#define N 100000\n\nint main(void){\n    int n;\n    int a[N+1];\n    int memo0[N+1] = {};\n    int memo1[N+1] = {};\n    int i;\n    int sum;\n    \n    \n    scanf(\"%d\", &n);\n    for(i = 1; i <= n; i++){\n        scanf(\"%d\", &a[i]);\n    }\n    \n    for(i = 1; i <= n; i++){\n        if(i & 1){//i=2k+1\n            memo0[i] = memo0[i-1] - a[i];\n        }else{\n            memo0[i] = memo0[i-1] + a[i];\n        }\n    }\n    \n    for(i = 1; i <= n; i++){\n        if(i & 1){//i=2k+1\n            memo1[i] = memo1[i-1] + a[i];\n        }else{\n            memo1[i] = memo1[i-1] - a[i];\n        }\n    }\n    \n    for(i = 1; i <= n; i++){\n        if(i == n){\n            //sum = memo0[n];\n            sum = a[i] + (memo0[i-1]) + (memo1[n] - memo1[i]);\n        }else if(i & 1){\n            //sum = a[i] + (memo1[i-1]) + (memo0[n] - memo0[i]);\n            sum = a[i] + (memo0[i-1]) + (memo1[n] - memo1[i]);\n        }else{\n            //sum = a[i] + (memo0[i-1]) + (memo1[n] - memo1[i]);\n            sum = a[i] + (memo1[i-1]) + (memo0[n] - memo0[i]);\n        }\n        \n        printf(\"%d \", sum);\n    }\n    \n    return 0;\n}", "problem_context": "Score : 400 points\n\nProblem Statement\n\nThere are N mountains in a circle, called Mountain 1, Mountain 2, ..., Mountain N in clockwise order. N is an odd number.\n\nBetween these mountains, there are N dams, called Dam 1, Dam 2, ..., Dam N. Dam i (1 \\leq i \\leq N) is located between Mountain i and i+1 (Mountain N+1 is Mountain 1).\n\nWhen Mountain i (1 \\leq i \\leq N) receives 2x liters of rain, Dam i-1 and Dam i each accumulates x liters of water (Dam 0 is Dam N).\n\nOne day, each of the mountains received a non-negative even number of liters of rain.\n\nAs a result, Dam i (1 \\leq i \\leq N) accumulated a total of A_i liters of water.\n\nFind the amount of rain each of the mountains received. We can prove that the solution is unique under the constraints of this problem.\n\nConstraints\n\nAll values in input are integers.\n\n3 \\leq N \\leq 10^5-1\n\nN is an odd number.\n\n0 \\leq A_i \\leq 10^9\n\nThe situation represented by input can occur when each of the mountains receives a non-negative even number of liters of rain.\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 representing the number of liters of rain Mountain 1, Mountain 2, ..., Mountain N received, in this order.\n\nSample Input 1\n\n3\n2 2 4\n\nSample Output 1\n\n4 0 4\n\nIf we assume Mountain 1, 2, and 3 received 4, 0, and 4 liters of rain, respectively, it is consistent with this input, as follows:\n\nDam 1 should have accumulated \\frac{4}{2} + \\frac{0}{2} = 2 liters of water.\n\nDam 2 should have accumulated \\frac{0}{2} + \\frac{4}{2} = 2 liters of water.\n\nDam 3 should have accumulated \\frac{4}{2} + \\frac{4}{2} = 4 liters of water.\n\nSample Input 2\n\n5\n3 8 7 5 5\n\nSample Output 2\n\n2 4 12 2 8\n\nSample Input 3\n\n3\n1000000000 1000000000 0\n\nSample Output 3\n\n0 2000000000 0", "sample_input": "3\n2 2 4\n"}, "reference_outputs": ["4 0 4\n"], "source_document_id": "p02984", "source_text": "Score : 400 points\n\nProblem Statement\n\nThere are N mountains in a circle, called Mountain 1, Mountain 2, ..., Mountain N in clockwise order. N is an odd number.\n\nBetween these mountains, there are N dams, called Dam 1, Dam 2, ..., Dam N. Dam i (1 \\leq i \\leq N) is located between Mountain i and i+1 (Mountain N+1 is Mountain 1).\n\nWhen Mountain i (1 \\leq i \\leq N) receives 2x liters of rain, Dam i-1 and Dam i each accumulates x liters of water (Dam 0 is Dam N).\n\nOne day, each of the mountains received a non-negative even number of liters of rain.\n\nAs a result, Dam i (1 \\leq i \\leq N) accumulated a total of A_i liters of water.\n\nFind the amount of rain each of the mountains received. We can prove that the solution is unique under the constraints of this problem.\n\nConstraints\n\nAll values in input are integers.\n\n3 \\leq N \\leq 10^5-1\n\nN is an odd number.\n\n0 \\leq A_i \\leq 10^9\n\nThe situation represented by input can occur when each of the mountains receives a non-negative even number of liters of rain.\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 representing the number of liters of rain Mountain 1, Mountain 2, ..., Mountain N received, in this order.\n\nSample Input 1\n\n3\n2 2 4\n\nSample Output 1\n\n4 0 4\n\nIf we assume Mountain 1, 2, and 3 received 4, 0, and 4 liters of rain, respectively, it is consistent with this input, as follows:\n\nDam 1 should have accumulated \\frac{4}{2} + \\frac{0}{2} = 2 liters of water.\n\nDam 2 should have accumulated \\frac{0}{2} + \\frac{4}{2} = 2 liters of water.\n\nDam 3 should have accumulated \\frac{4}{2} + \\frac{4}{2} = 4 liters of water.\n\nSample Input 2\n\n5\n3 8 7 5 5\n\nSample Output 2\n\n2 4 12 2 8\n\nSample Input 3\n\n3\n1000000000 1000000000 0\n\nSample Output 3\n\n0 2000000000 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": 1116, "cpu_time_ms": 23, "memory_kb": 2432}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s998049381", "group_id": "codeNet:p02987", "input_text": "#include <stdio.h>\n \nint main()\n{\n    char s[100];\n    gets(s);\n \n    int count = 0;\n    \n    for(int i=0; i<2; i++){\n      for(int j=1; j<3; j++){\n        if(s[i]==s[j])\n          count++;\n      }\n    }\n  \n  \n    if(count==2){\n      printf(\"YES\");\n    }\n  else{\n    printf(\"NO\");\n  }\n \n   return 0;\n}", "language": "C", "metadata": {"date": 1568837747, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "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/C/s998049381.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s998049381", "user_id": "u353919145"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "#include <stdio.h>\n \nint main()\n{\n    char s[100];\n    gets(s);\n \n    int count = 0;\n    \n    for(int i=0; i<2; i++){\n      for(int j=1; j<3; j++){\n        if(s[i]==s[j])\n          count++;\n      }\n    }\n  \n  \n    if(count==2){\n      printf(\"YES\");\n    }\n  else{\n    printf(\"NO\");\n  }\n \n   return 0;\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": 301, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s819253568", "group_id": "codeNet:p02987", "input_text": "#include<stdio.h>\nint main()\n{\n\tchar s[5];\n\tscanf(\"%s\", s);\n\tchar c;\n\tint i;\n\tfor (i = 0; i < 3; i++)\n\t{\n\t\tif (s[i] > s[i + 1])\n\t\t{\n\t\t\tc = s[i];\n\t\t\ts[i] = s[i + 1];\n\t\t\ts[i + 1] = c;\n\t\t\tif (i > 0)\n\t\t\t\ti -= 2;\n\t\t}\n\t}\n\tif (s[0] == s[1] && s[2] == s[3] && s[1] != s[2])\n\t\tprintf(\"Yes\\n\");\n\telse\n\t\tprintf(\"No\\n\");\n\treturn 0;\n}", "language": "C", "metadata": {"date": 1561856606, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "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/C/s819253568.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s819253568", "user_id": "u600300412"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "#include<stdio.h>\nint main()\n{\n\tchar s[5];\n\tscanf(\"%s\", s);\n\tchar c;\n\tint i;\n\tfor (i = 0; i < 3; i++)\n\t{\n\t\tif (s[i] > s[i + 1])\n\t\t{\n\t\t\tc = s[i];\n\t\t\ts[i] = s[i + 1];\n\t\t\ts[i + 1] = c;\n\t\t\tif (i > 0)\n\t\t\t\ti -= 2;\n\t\t}\n\t}\n\tif (s[0] == s[1] && s[2] == s[3] && s[1] != s[2])\n\t\tprintf(\"Yes\\n\");\n\telse\n\t\tprintf(\"No\\n\");\n\treturn 0;\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": 321, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s159280891", "group_id": "codeNet:p02988", "input_text": "#include<stdio.h>\n\nint main(void){\n  int n;\n  scanf(\"%d\", &n);\n  int array[n];\n  int i , count = 0;\n  int l, c, r; //left, center, right\n\n  for(i=0 ; i<n ; i++)\n    scanf(\"%d\", &array[i]);\n\n  for(i=1 ; i<n-1 ; i++){\n    l = array[i-1]; c = array[i]; r = array[i+1]; \n    if( (l<= c && c<=r)     //a<b<c\n       || ( r<=c && c<=l ) ) //c<b<a\n      count++;\n  }\n\n  printf(\"%d\\n\", count);\n\n  return 0;\n}\n", "language": "C", "metadata": {"date": 1562269356, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "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/C/s159280891.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s159280891", "user_id": "u537852947"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "#include<stdio.h>\n\nint main(void){\n  int n;\n  scanf(\"%d\", &n);\n  int array[n];\n  int i , count = 0;\n  int l, c, r; //left, center, right\n\n  for(i=0 ; i<n ; i++)\n    scanf(\"%d\", &array[i]);\n\n  for(i=1 ; i<n-1 ; i++){\n    l = array[i-1]; c = array[i]; r = array[i+1]; \n    if( (l<= c && c<=r)     //a<b<c\n       || ( r<=c && c<=l ) ) //c<b<a\n      count++;\n  }\n\n  printf(\"%d\\n\", count);\n\n  return 0;\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": 400, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s266039774", "group_id": "codeNet:p02988", "input_text": "#include <stdio.h>\nint main(){\nint n,l=0,p[20];\nscanf(\"%d\",&n);\nfor(int i=0;i<n;i++){\nscanf(\"%d \",&p[i]);\n}\n\nfor(int i=1;i<n-1;i++){\nif((p[i-1]<p[i]&&p[i]<p[i+1])||(p[i-1]>p[i]&&p[i]>p[i+1]))l++;\n}\nprintf(\"%d \",l);\n}", "language": "C", "metadata": {"date": 1562024723, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "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/C/s266039774.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s266039774", "user_id": "u546853743"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "#include <stdio.h>\nint main(){\nint n,l=0,p[20];\nscanf(\"%d\",&n);\nfor(int i=0;i<n;i++){\nscanf(\"%d \",&p[i]);\n}\n\nfor(int i=1;i<n-1;i++){\nif((p[i-1]<p[i]&&p[i]<p[i+1])||(p[i-1]>p[i]&&p[i]>p[i+1]))l++;\n}\nprintf(\"%d \",l);\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": 216, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s848077411", "group_id": "codeNet:p02988", "input_text": "#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int n;\n    scanf(\"%d\", &n);\n    int p[n];\n    int i, k = 0;\n    for (i = 0; i < n; i++)\n    {\n        scanf(\"%d\", &p[i]);\n    }\n    for (i = 1; i < n - 1; i++)\n    {\n        if ((p[i - 1] < p[i] && p[i] < p[i + 1]) || (p[i - 1] > p[i] && p[i] > p[i + 1]))\n        {\n            k++;\n        }\n    }\n    printf(\"%d\\n\", k);\n    return 0;\n}", "language": "C", "metadata": {"date": 1561857167, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "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/C/s848077411.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s848077411", "user_id": "u039518194"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    int n;\n    scanf(\"%d\", &n);\n    int p[n];\n    int i, k = 0;\n    for (i = 0; i < n; i++)\n    {\n        scanf(\"%d\", &p[i]);\n    }\n    for (i = 1; i < n - 1; i++)\n    {\n        if ((p[i - 1] < p[i] && p[i] < p[i + 1]) || (p[i - 1] > p[i] && p[i] > p[i + 1]))\n        {\n            k++;\n        }\n    }\n    printf(\"%d\\n\", k);\n    return 0;\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": 394, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s984111632", "group_id": "codeNet:p02989", "input_text": "#include <stdio.h>\n\nint main(){\n  int n,tmp,miman =0,ans =0;\n  scanf(\"%d\",&n);\n  int d[n];\n  for(int i=0;i<n;i++) scanf(\"%d\",&d[i]);\n  for(int i=0;i<n;i++){\n    for(int j=i+1;j<n;j++){\n      if(d[i] > d[j]){\n        tmp = d[i];\n        d[i] = d[j];\n        d[j] = tmp;\n      }\n    }\n  }\n  int size = sizeof d / sizeof d[0];\n  if(n %2 == 0){\n    printf(\"%d\",d[(size-1)/2+1]-d[(size-1)/2]);\n  }else {\n    printf(\"0\");\n  }\n  return 0;\n}\n", "language": "C", "metadata": {"date": 1561859933, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "problem_description_relpath": "problem_descriptions/p02989.html", "problem_id": "p02989", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02989/input.txt", "sample_output_relpath": "derived/input_output/data/p02989/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02989/C/s984111632.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s984111632", "user_id": "u674812531"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "#include <stdio.h>\n\nint main(){\n  int n,tmp,miman =0,ans =0;\n  scanf(\"%d\",&n);\n  int d[n];\n  for(int i=0;i<n;i++) scanf(\"%d\",&d[i]);\n  for(int i=0;i<n;i++){\n    for(int j=i+1;j<n;j++){\n      if(d[i] > d[j]){\n        tmp = d[i];\n        d[i] = d[j];\n        d[j] = tmp;\n      }\n    }\n  }\n  int size = sizeof d / sizeof d[0];\n  if(n %2 == 0){\n    printf(\"%d\",d[(size-1)/2+1]-d[(size-1)/2]);\n  }else {\n    printf(\"0\");\n  }\n  return 0;\n}\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nTakahashi made N problems for competitive programming.\nThe problems are numbered 1 to N, and the difficulty of Problem i is represented as an integer d_i (the higher, the harder).\n\nHe is dividing the problems into two categories by choosing an integer K, as follows:\n\nA problem with difficulty K or higher will be for ARCs.\n\nA problem with difficulty lower than K will be for ABCs.\n\nHow many choices of the integer K make the number of problems for ARCs and the number of problems for ABCs the same?\n\nProblem Statement\n\n2 \\leq N \\leq 10^5\n\nN is an even number.\n\n1 \\leq d_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\nd_1 d_2 ... d_N\n\nOutput\n\nPrint the number of choices of the integer K that make the number of problems for ARCs and the number of problems for ABCs the same.\n\nSample Input 1\n\n6\n9 1 4 4 6 7\n\nSample Output 1\n\n2\n\nIf we choose K=5 or 6, Problem 1, 5, and 6 will be for ARCs, Problem 2, 3, and 4 will be for ABCs, and the objective is achieved.\nThus, the answer is 2.\n\nSample Input 2\n\n8\n9 1 14 5 5 4 4 14\n\nSample Output 2\n\n0\n\nThere may be no choice of the integer K that make the number of problems for ARCs and the number of problems for ABCs the same.\n\nSample Input 3\n\n14\n99592 10342 29105 78532 83018 11639 92015 77204 30914 21912 34519 80835 100000 1\n\nSample Output 3\n\n42685", "sample_input": "6\n9 1 4 4 6 7\n"}, "reference_outputs": ["2\n"], "source_document_id": "p02989", "source_text": "Score : 300 points\n\nProblem Statement\n\nTakahashi made N problems for competitive programming.\nThe problems are numbered 1 to N, and the difficulty of Problem i is represented as an integer d_i (the higher, the harder).\n\nHe is dividing the problems into two categories by choosing an integer K, as follows:\n\nA problem with difficulty K or higher will be for ARCs.\n\nA problem with difficulty lower than K will be for ABCs.\n\nHow many choices of the integer K make the number of problems for ARCs and the number of problems for ABCs the same?\n\nProblem Statement\n\n2 \\leq N \\leq 10^5\n\nN is an even number.\n\n1 \\leq d_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\nd_1 d_2 ... d_N\n\nOutput\n\nPrint the number of choices of the integer K that make the number of problems for ARCs and the number of problems for ABCs the same.\n\nSample Input 1\n\n6\n9 1 4 4 6 7\n\nSample Output 1\n\n2\n\nIf we choose K=5 or 6, Problem 1, 5, and 6 will be for ARCs, Problem 2, 3, and 4 will be for ABCs, and the objective is achieved.\nThus, the answer is 2.\n\nSample Input 2\n\n8\n9 1 14 5 5 4 4 14\n\nSample Output 2\n\n0\n\nThere may be no choice of the integer K that make the number of problems for ARCs and the number of problems for ABCs the same.\n\nSample Input 3\n\n14\n99592 10342 29105 78532 83018 11639 92015 77204 30914 21912 34519 80835 100000 1\n\nSample Output 3\n\n42685", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 434, "cpu_time_ms": 2103, "memory_kb": 512}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s829519526", "group_id": "codeNet:p02989", "input_text": "#include <stdio.h>\n#include <stdlib.h>\n\nint compare (const void * a, const void * b) {\n   return ( *(int*)a - *(int*)b );\n}\n\nint main() {\n    int n;\n    scanf(\"%d\", &n);\n    int nums[n];\n    \n    for (int i = 0; i < n; i++) {\n        scanf(\"%d\", &nums[i]);\n    }\n\n    qsort(nums, n, sizeof(int), compare);\n    \n    if (n % 2 == 0) {\n        if (nums[n / 2] == nums[n / 2 - 1])\n            printf(\"0\\n\");\n        else\n            printf(\"%d\\n\", nums[n / 2] - nums[n / 2 - 1]);\n    } else {\n        printf(\"0\\n\");\n    }\n}", "language": "C", "metadata": {"date": 1561858264, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "problem_description_relpath": "problem_descriptions/p02989.html", "problem_id": "p02989", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02989/input.txt", "sample_output_relpath": "derived/input_output/data/p02989/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02989/C/s829519526.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s829519526", "user_id": "u444001767"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "#include <stdio.h>\n#include <stdlib.h>\n\nint compare (const void * a, const void * b) {\n   return ( *(int*)a - *(int*)b );\n}\n\nint main() {\n    int n;\n    scanf(\"%d\", &n);\n    int nums[n];\n    \n    for (int i = 0; i < n; i++) {\n        scanf(\"%d\", &nums[i]);\n    }\n\n    qsort(nums, n, sizeof(int), compare);\n    \n    if (n % 2 == 0) {\n        if (nums[n / 2] == nums[n / 2 - 1])\n            printf(\"0\\n\");\n        else\n            printf(\"%d\\n\", nums[n / 2] - nums[n / 2 - 1]);\n    } else {\n        printf(\"0\\n\");\n    }\n}", "problem_context": "Score : 300 points\n\nProblem Statement\n\nTakahashi made N problems for competitive programming.\nThe problems are numbered 1 to N, and the difficulty of Problem i is represented as an integer d_i (the higher, the harder).\n\nHe is dividing the problems into two categories by choosing an integer K, as follows:\n\nA problem with difficulty K or higher will be for ARCs.\n\nA problem with difficulty lower than K will be for ABCs.\n\nHow many choices of the integer K make the number of problems for ARCs and the number of problems for ABCs the same?\n\nProblem Statement\n\n2 \\leq N \\leq 10^5\n\nN is an even number.\n\n1 \\leq d_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\nd_1 d_2 ... d_N\n\nOutput\n\nPrint the number of choices of the integer K that make the number of problems for ARCs and the number of problems for ABCs the same.\n\nSample Input 1\n\n6\n9 1 4 4 6 7\n\nSample Output 1\n\n2\n\nIf we choose K=5 or 6, Problem 1, 5, and 6 will be for ARCs, Problem 2, 3, and 4 will be for ABCs, and the objective is achieved.\nThus, the answer is 2.\n\nSample Input 2\n\n8\n9 1 14 5 5 4 4 14\n\nSample Output 2\n\n0\n\nThere may be no choice of the integer K that make the number of problems for ARCs and the number of problems for ABCs the same.\n\nSample Input 3\n\n14\n99592 10342 29105 78532 83018 11639 92015 77204 30914 21912 34519 80835 100000 1\n\nSample Output 3\n\n42685", "sample_input": "6\n9 1 4 4 6 7\n"}, "reference_outputs": ["2\n"], "source_document_id": "p02989", "source_text": "Score : 300 points\n\nProblem Statement\n\nTakahashi made N problems for competitive programming.\nThe problems are numbered 1 to N, and the difficulty of Problem i is represented as an integer d_i (the higher, the harder).\n\nHe is dividing the problems into two categories by choosing an integer K, as follows:\n\nA problem with difficulty K or higher will be for ARCs.\n\nA problem with difficulty lower than K will be for ABCs.\n\nHow many choices of the integer K make the number of problems for ARCs and the number of problems for ABCs the same?\n\nProblem Statement\n\n2 \\leq N \\leq 10^5\n\nN is an even number.\n\n1 \\leq d_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\nd_1 d_2 ... d_N\n\nOutput\n\nPrint the number of choices of the integer K that make the number of problems for ARCs and the number of problems for ABCs the same.\n\nSample Input 1\n\n6\n9 1 4 4 6 7\n\nSample Output 1\n\n2\n\nIf we choose K=5 or 6, Problem 1, 5, and 6 will be for ARCs, Problem 2, 3, and 4 will be for ABCs, and the objective is achieved.\nThus, the answer is 2.\n\nSample Input 2\n\n8\n9 1 14 5 5 4 4 14\n\nSample Output 2\n\n0\n\nThere may be no choice of the integer K that make the number of problems for ARCs and the number of problems for ABCs the same.\n\nSample Input 3\n\n14\n99592 10342 29105 78532 83018 11639 92015 77204 30914 21912 34519 80835 100000 1\n\nSample Output 3\n\n42685", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 519, "cpu_time_ms": 23, "memory_kb": 892}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s940592135", "group_id": "codeNet:p02991", "input_text": "#include<stdio.h>\n#include<stdlib.h>\n#include<math.h>\n#include<string.h>\n#include<stdbool.h>\n#include<assert.h>\ntypedef long long ll;\ntypedef long double ld;\n#define rep(i,l,r)for(ll i=(l);i<(r);i++)\n#define repp(i,l,r,k)for(ll i=(l);i<(r);i+=(k))\n#define rrep(i,l,r)for(ll i=(l);i>=(r);i--)\n#define INF (1LL<<60)\n#define MOD1 1000000007\n#define MOD2 998244353\n#define MAX_N (1 << 17)\n#define YES printf(\"Yes\\n\")\n#define NO printf(\"No\\n\")\n#define PN printf(\"\\n\")\n#define charsize 100005 //10^5+5\n#define PI 3.141592653589793238\n\nvoid swap(ll *a, ll *b){ll c;c=*b;*b=*a;*a= c;}\nvoid cin(ll *n){ scanf(\"%lld\",&(*n));}\nvoid cin2(ll *a, ll *b){ scanf(\"%lld%lld\",&(*a),&(*b)); }\nvoid cin3(ll *a, ll *b, ll *c){ scanf(\"%lld%lld%lld\",&(*a),&(*b),&(*c)); }\nll max2(ll a,ll b){return a>=b?a:b;}\nll min2(ll a,ll b){return a>=b?b:a;}\nll min3(ll a, ll b, ll c){return (a<=b && a<=c) ? a : b<=c ? b : c;}\nll max3(ll a, ll b, ll c){return (a>=b && a>=c) ? a : b>=c ? b : c;}\nll minn(ll n, ll a[n]){ll b=INF;rep(i,0,n) b=min2(b,a[i]);return b;}\nll maxn(ll n, ll a[n]){ll b=-INF;rep(i,0,n) b=max2(b,a[i]);return b;}\nll ABS(ll a){return a>=0?a:(-a);}\nll POW(ll a, ll b){ll c=1;rep(i,0,b) c*=a;return c;}\ndouble POW_d(double a, double b){double c=1;rep(i,0,b) c*=a;return c;}\nll gcd(ll a,ll b){return b?gcd(b,a%b):a;}\nll lcm(ll a,ll b){return a/gcd(a,b)*b;}\nll mod_MOD1(ll n){n+= n<0?((-n)/MOD1+1)*MOD1:0; return n%=MOD1;}\nll mod_p(ll n ,ll p){n+= n<0?((-n)/p+1)*p:0; return n%=p;}\nll change_into_num(char s[] , ll len, ll p){ return !p ? 0 : POW(10,p-1)*(s[len-p]-'0') + change_into_num(s,len,p-1); }\n\nvoid lr_lower( int *l, int *r, ll am, ll val , int type ){ (type<3) ? ( am < val ?  ( *l = (*l+*r)/2 ) : ( *r= (*l+*r)/2 ) ) : ( am <= val ? ( *l = (*l+*r)/2 ) : ( *r= (*l+*r)/2 ) ); }\nvoid lr_upper( int *l, int *r, ll am, ll val , int type ){ (type<3) ? ( am <= val ?  ( *l = (*l+*r)/2 ) : ( *r= (*l+*r)/2 ) ) : ( am < val ? ( *l = (*l+*r)/2 ) : ( *r= (*l+*r)/2 ) ); }\nint cmp_lower( ll a, ll b, int type ){ return (type==1) ? ( a==b ? 1 : 0 ) : (type==2) ? ( a>=b ? 1 : 0 ) : ( a>b ? 1 : 0 ) ; }\nint cmp_upper( ll a, ll b, int type ){ return (type==1) ? ( a==b ? 1 : 0 ) : (type==2) ? ( a<=b ? 1 : 0 ) : ( a<b ? 1 : 0 ) ; }\n// return smallest p  which meets  a[p]==val :1  >=:2   >:3\nll lower_bound( ll a[], int l, int r, ll val , int type ){  while(r-l>1) lr_lower(&l,&r,a[ (l+r)/2 ],val,type);  return cmp_lower(a[l],val,type) ? l : cmp_lower(a[r],val,type) ? r : -1;  }\n// return biggest p  which meets   a[p]==val :1  <=:2   <:3\nll upper_bound( ll a[], int l, int r, ll val , int type ){  while(r-l>1) lr_upper(&l,&r,a[ (l+r)/2 ],val,type); return cmp_upper(a[r],val,type) ? r : cmp_upper(a[l],val,type) ? l : -1; }\n// count i  which meets ai==x\nll count(ll a[], int l, int r, ll x){  int p = lower_bound(a,l,r,x,1);  return p==-1 ? 0 : upper_bound(a,p,r,x,1)-p+1; }\n\nint upll(const void*a, const void*b){return*(ll*)a<*(ll*)b?-1:*(ll*)a>*(ll*)b?1:0;}\nint downll(const void*a, const void*b){return*(ll*)a<*(ll*)b?1:*(ll*)a>*(ll*)b?-1:0;}\nint cmp_string( const void * a , const void * b ) {  return strcmp( (char *)a , (char *)b ); }  // qsort((void*)s,n,sizeof(s[0]),int_sort );\nint cmp_char(const void * a, const void * b) { return *(char *)a - *(char *)b;}\nvoid sortup(ll*a,int n){qsort(a,n,sizeof(ll),upll);}\nvoid sortdown(ll*a,int n){qsort(a,n,sizeof(ll),downll);}\nvoid sort_string(int n,int size,char s[][size]){ qsort( (void*)s , n , sizeof(s[0]) , cmp_string ); }\nvoid sort_char(char *s){ qsort( (void *)s , strlen(s) , sizeof(char) , cmp_char ); }\nll unique_string(ll n ,ll size, char s[][size]){ ll ans=1; rep(i,1,n) if( strcmp(s[i],s[i-1]) ) ans++; return ans; }\nll unique_num(ll n , ll a[]){ ll ans=1; rep(i,1,n) if( a[i]!=a[i-1] ) ans++; return ans; }\n\ntypedef struct{ int a , b;}fr;\nint cmp1( const void *p, const void *q ) { return ((fr*)p) ->a - ((fr*)q)->a;}\nint cmp2( const void *p, const void *q ) { return ((fr*)q) ->a - ((fr*)p)->a;}\nvoid strsortup(fr*a,int n){qsort(a,n,sizeof(fr),cmp1);}\nvoid strsortdown(fr*a,int n){qsort(a,n,sizeof(fr),cmp2);}\n\n\n/*------------------------------Dijkstra start-------------------------------------------------------------*/\n//http://www.deqnotes.net/acmicpc/dijkstra/\nint edge_cnt[114123];\nll* graph[114123];\nll ans[114123];\nbool is_conf[114123];\n// freeeeeeeeeeeeeeeeeeeeeeeeeeee!!!!!!!!!!!!\n\nvoid pushGraph(ll v1, ll v2, ll weight , ll is_dir){\n    graph[v1] = realloc( graph[v1] , sizeof(ll)*(edge_cnt[v1]*2+2) );    \n    graph[v1][edge_cnt[v1]*2] = v2;\n    graph[v1][edge_cnt[v1]*2+1] = weight;\n    // ednum[v1] = realloc( ednum[v1] , sizeof(ll)*(edge_cnt[v1]+1) );\n    // ednum[v1][edge_cnt[v1]] = num;\n    edge_cnt[v1]++;\n\n    if(!is_dir){\n        graph[v2] = realloc( graph[v2] , sizeof(ll)*(edge_cnt[v2]*2+2) );\n        graph[v2][edge_cnt[v2]*2] = v1;\n        graph[v2][edge_cnt[v2]*2+1] = weight;\n        // ednum[v2] = realloc( ednum[v2] , sizeof(ll)*(edge_cnt[v2]+1) );\n        // ednum[v2][edge_cnt[v2]] = num;\n        edge_cnt[v2]++;\n    }\n}\n/*-----------priorityqueue(strurct)---------------*/\n// kind = max?1:0\nll HeapValue(ll a){return a?-INF:INF;}\nll Heapcmp(ll a, ll b, ll kind){return kind ? (a<b?1:0) : (a>b?1:0);}\n\ntypedef struct{ \n    int from;\n    int to;\n    ll cost; \n}graph_heap;\n\ngraph_heap heap[2*MAX_N];\nvoid str_swap(graph_heap *a,graph_heap *b){ graph_heap c;c=*b;*b=*a;*a=c; }\n\nvoid graph_pushHeap(ll val, ll len , ll kind){\n    ll i=len; heap[i].cost=val;\n    while(i!=0){\n        if( Heapcmp( heap[i].cost, heap[(i-1)/2].cost , ABS(kind-1) )  ) str_swap(&heap[i],&heap[(i-1)/2]);\n        i--;i/=2;\n    }\n}\nvoid graph_popHeap(ll len, ll kind){\n    ll i=0; heap[0].cost=HeapValue(kind);\n    str_swap(&heap[0],&heap[len-1]);\n    while(len>i*2+1){\n        if(i*2+2<len && Heapcmp(heap[i].cost,heap[i*2+2].cost,kind) && Heapcmp(heap[i*2+1].cost,heap[i*2+2].cost,kind) ){\n            str_swap(&heap[i],&heap[i*2+2]);\n            i*=2;i+=2;\n        }else{\n            if( Heapcmp(heap[i].cost,heap[i*2+1].cost,kind) ){\n                str_swap(&heap[i],&heap[i*2+1]);\n                i*=2;i++;\n            }else break;\n        }\n    }\n}\n/*---------------------------------------------*/\n\nvoid dijkstra(ll start){\n    rep(i,0,114123){\n        ans[i] = INF;\n        is_conf[i] = false;\n    }\n    ans[start] = 0;\n    is_conf[start]  = true;\n    int size=0;\n    rep(i,0,edge_cnt[start]){\n        heap[size].from = start;\n        heap[size].to = graph[start][i*2];\n        ans[ heap[size].to ] = graph[start][i*2+1];\n        graph_pushHeap( graph[start][i*2+1] , size , 0 );\n        size++;\n    }\n    // rep(i,0,4) printf(\"%lld \",ans[i]);\n    // PN;\n    ll piv;\n    while(size){\n        if( is_conf[ heap[0].to ] ){\n            graph_popHeap(size,0);\n            size--;\n            continue;\n        }\n        // printf(\"AA: %d %d\\n\",heap[0].from, heap[0].to );\n        is_conf[ heap[0].to ] = true;\n        ans[ heap[0].to ] = heap[0].cost;\n        piv = heap[0].to;\n        // rep(i,0,4) printf(\"%lld \",ans[i]);\n        // PN;\n        rep(i,0,edge_cnt[piv]){\n            if( ans[ graph[ heap[0].to ][i*2] ] > ans[ heap[0].to ] + graph[ heap[0].to ][i*2+1] ){\n                heap[size].from = heap[0].to;\n                heap[size].to = graph[ heap[0].to ][i*2];\n                graph_pushHeap( ans[ heap[0].to ] + graph[ heap[0].to ][i*2+1] , size , 0 );\n                size++;\n            }\n        }\n        graph_popHeap(size,0);\n        size--;\n    }\n}\n/*---------------------------Dijkstra end--------------------------------------------------------------------*/\n\n\nint main(void){\n    // fgets(s,sizeof(s),stdin); \n    // char ;\n    ll n,m,s,t;\n    // ll ans=0;\n    cin(&n);\n    cin(&m);\n    // cin2(&,&);\n    // cin3(&,&,&);\n    // scanf(\"%s\",);\n    ll u,v;\n    rep(i,0,m){\n        cin(&u);\n        cin(&v);\n        // pushGraph(u-1,v-1,1,1);\n        pushGraph(u-1,v-1+n,1,1);\n        pushGraph(u-1+n,v-1+2*n,1,1);\n        pushGraph(u-1+2*n,v-1,1,1);\n    }\n    // rep(i,0,n){\n    //     printf(\"%d \",edge_cnt[i]);\n    // }\n    // PN;\n    cin(&s);\n    cin(&t);\n    dijkstra(s-1);\n    // rep(i,0,n){\n    //     printf(\"%lld \",ans[i]);\n    // }\n    // PN;\n    \n    if(ans[t-1]==INF) printf(\"-1\\n\");\n    else printf(\"%lld\\n\",ans[t-1]/3);\n    return 0;\n}\n", "language": "C", "metadata": {"date": 1589299017, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "problem_description_relpath": "problem_descriptions/p02991.html", "problem_id": "p02991", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02991/input.txt", "sample_output_relpath": "derived/input_output/data/p02991/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02991/C/s940592135.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s940592135", "user_id": "u004279520"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "#include<stdio.h>\n#include<stdlib.h>\n#include<math.h>\n#include<string.h>\n#include<stdbool.h>\n#include<assert.h>\ntypedef long long ll;\ntypedef long double ld;\n#define rep(i,l,r)for(ll i=(l);i<(r);i++)\n#define repp(i,l,r,k)for(ll i=(l);i<(r);i+=(k))\n#define rrep(i,l,r)for(ll i=(l);i>=(r);i--)\n#define INF (1LL<<60)\n#define MOD1 1000000007\n#define MOD2 998244353\n#define MAX_N (1 << 17)\n#define YES printf(\"Yes\\n\")\n#define NO printf(\"No\\n\")\n#define PN printf(\"\\n\")\n#define charsize 100005 //10^5+5\n#define PI 3.141592653589793238\n\nvoid swap(ll *a, ll *b){ll c;c=*b;*b=*a;*a= c;}\nvoid cin(ll *n){ scanf(\"%lld\",&(*n));}\nvoid cin2(ll *a, ll *b){ scanf(\"%lld%lld\",&(*a),&(*b)); }\nvoid cin3(ll *a, ll *b, ll *c){ scanf(\"%lld%lld%lld\",&(*a),&(*b),&(*c)); }\nll max2(ll a,ll b){return a>=b?a:b;}\nll min2(ll a,ll b){return a>=b?b:a;}\nll min3(ll a, ll b, ll c){return (a<=b && a<=c) ? a : b<=c ? b : c;}\nll max3(ll a, ll b, ll c){return (a>=b && a>=c) ? a : b>=c ? b : c;}\nll minn(ll n, ll a[n]){ll b=INF;rep(i,0,n) b=min2(b,a[i]);return b;}\nll maxn(ll n, ll a[n]){ll b=-INF;rep(i,0,n) b=max2(b,a[i]);return b;}\nll ABS(ll a){return a>=0?a:(-a);}\nll POW(ll a, ll b){ll c=1;rep(i,0,b) c*=a;return c;}\ndouble POW_d(double a, double b){double c=1;rep(i,0,b) c*=a;return c;}\nll gcd(ll a,ll b){return b?gcd(b,a%b):a;}\nll lcm(ll a,ll b){return a/gcd(a,b)*b;}\nll mod_MOD1(ll n){n+= n<0?((-n)/MOD1+1)*MOD1:0; return n%=MOD1;}\nll mod_p(ll n ,ll p){n+= n<0?((-n)/p+1)*p:0; return n%=p;}\nll change_into_num(char s[] , ll len, ll p){ return !p ? 0 : POW(10,p-1)*(s[len-p]-'0') + change_into_num(s,len,p-1); }\n\nvoid lr_lower( int *l, int *r, ll am, ll val , int type ){ (type<3) ? ( am < val ?  ( *l = (*l+*r)/2 ) : ( *r= (*l+*r)/2 ) ) : ( am <= val ? ( *l = (*l+*r)/2 ) : ( *r= (*l+*r)/2 ) ); }\nvoid lr_upper( int *l, int *r, ll am, ll val , int type ){ (type<3) ? ( am <= val ?  ( *l = (*l+*r)/2 ) : ( *r= (*l+*r)/2 ) ) : ( am < val ? ( *l = (*l+*r)/2 ) : ( *r= (*l+*r)/2 ) ); }\nint cmp_lower( ll a, ll b, int type ){ return (type==1) ? ( a==b ? 1 : 0 ) : (type==2) ? ( a>=b ? 1 : 0 ) : ( a>b ? 1 : 0 ) ; }\nint cmp_upper( ll a, ll b, int type ){ return (type==1) ? ( a==b ? 1 : 0 ) : (type==2) ? ( a<=b ? 1 : 0 ) : ( a<b ? 1 : 0 ) ; }\n// return smallest p  which meets  a[p]==val :1  >=:2   >:3\nll lower_bound( ll a[], int l, int r, ll val , int type ){  while(r-l>1) lr_lower(&l,&r,a[ (l+r)/2 ],val,type);  return cmp_lower(a[l],val,type) ? l : cmp_lower(a[r],val,type) ? r : -1;  }\n// return biggest p  which meets   a[p]==val :1  <=:2   <:3\nll upper_bound( ll a[], int l, int r, ll val , int type ){  while(r-l>1) lr_upper(&l,&r,a[ (l+r)/2 ],val,type); return cmp_upper(a[r],val,type) ? r : cmp_upper(a[l],val,type) ? l : -1; }\n// count i  which meets ai==x\nll count(ll a[], int l, int r, ll x){  int p = lower_bound(a,l,r,x,1);  return p==-1 ? 0 : upper_bound(a,p,r,x,1)-p+1; }\n\nint upll(const void*a, const void*b){return*(ll*)a<*(ll*)b?-1:*(ll*)a>*(ll*)b?1:0;}\nint downll(const void*a, const void*b){return*(ll*)a<*(ll*)b?1:*(ll*)a>*(ll*)b?-1:0;}\nint cmp_string( const void * a , const void * b ) {  return strcmp( (char *)a , (char *)b ); }  // qsort((void*)s,n,sizeof(s[0]),int_sort );\nint cmp_char(const void * a, const void * b) { return *(char *)a - *(char *)b;}\nvoid sortup(ll*a,int n){qsort(a,n,sizeof(ll),upll);}\nvoid sortdown(ll*a,int n){qsort(a,n,sizeof(ll),downll);}\nvoid sort_string(int n,int size,char s[][size]){ qsort( (void*)s , n , sizeof(s[0]) , cmp_string ); }\nvoid sort_char(char *s){ qsort( (void *)s , strlen(s) , sizeof(char) , cmp_char ); }\nll unique_string(ll n ,ll size, char s[][size]){ ll ans=1; rep(i,1,n) if( strcmp(s[i],s[i-1]) ) ans++; return ans; }\nll unique_num(ll n , ll a[]){ ll ans=1; rep(i,1,n) if( a[i]!=a[i-1] ) ans++; return ans; }\n\ntypedef struct{ int a , b;}fr;\nint cmp1( const void *p, const void *q ) { return ((fr*)p) ->a - ((fr*)q)->a;}\nint cmp2( const void *p, const void *q ) { return ((fr*)q) ->a - ((fr*)p)->a;}\nvoid strsortup(fr*a,int n){qsort(a,n,sizeof(fr),cmp1);}\nvoid strsortdown(fr*a,int n){qsort(a,n,sizeof(fr),cmp2);}\n\n\n/*------------------------------Dijkstra start-------------------------------------------------------------*/\n//http://www.deqnotes.net/acmicpc/dijkstra/\nint edge_cnt[114123];\nll* graph[114123];\nll ans[114123];\nbool is_conf[114123];\n// freeeeeeeeeeeeeeeeeeeeeeeeeeee!!!!!!!!!!!!\n\nvoid pushGraph(ll v1, ll v2, ll weight , ll is_dir){\n    graph[v1] = realloc( graph[v1] , sizeof(ll)*(edge_cnt[v1]*2+2) );    \n    graph[v1][edge_cnt[v1]*2] = v2;\n    graph[v1][edge_cnt[v1]*2+1] = weight;\n    // ednum[v1] = realloc( ednum[v1] , sizeof(ll)*(edge_cnt[v1]+1) );\n    // ednum[v1][edge_cnt[v1]] = num;\n    edge_cnt[v1]++;\n\n    if(!is_dir){\n        graph[v2] = realloc( graph[v2] , sizeof(ll)*(edge_cnt[v2]*2+2) );\n        graph[v2][edge_cnt[v2]*2] = v1;\n        graph[v2][edge_cnt[v2]*2+1] = weight;\n        // ednum[v2] = realloc( ednum[v2] , sizeof(ll)*(edge_cnt[v2]+1) );\n        // ednum[v2][edge_cnt[v2]] = num;\n        edge_cnt[v2]++;\n    }\n}\n/*-----------priorityqueue(strurct)---------------*/\n// kind = max?1:0\nll HeapValue(ll a){return a?-INF:INF;}\nll Heapcmp(ll a, ll b, ll kind){return kind ? (a<b?1:0) : (a>b?1:0);}\n\ntypedef struct{ \n    int from;\n    int to;\n    ll cost; \n}graph_heap;\n\ngraph_heap heap[2*MAX_N];\nvoid str_swap(graph_heap *a,graph_heap *b){ graph_heap c;c=*b;*b=*a;*a=c; }\n\nvoid graph_pushHeap(ll val, ll len , ll kind){\n    ll i=len; heap[i].cost=val;\n    while(i!=0){\n        if( Heapcmp( heap[i].cost, heap[(i-1)/2].cost , ABS(kind-1) )  ) str_swap(&heap[i],&heap[(i-1)/2]);\n        i--;i/=2;\n    }\n}\nvoid graph_popHeap(ll len, ll kind){\n    ll i=0; heap[0].cost=HeapValue(kind);\n    str_swap(&heap[0],&heap[len-1]);\n    while(len>i*2+1){\n        if(i*2+2<len && Heapcmp(heap[i].cost,heap[i*2+2].cost,kind) && Heapcmp(heap[i*2+1].cost,heap[i*2+2].cost,kind) ){\n            str_swap(&heap[i],&heap[i*2+2]);\n            i*=2;i+=2;\n        }else{\n            if( Heapcmp(heap[i].cost,heap[i*2+1].cost,kind) ){\n                str_swap(&heap[i],&heap[i*2+1]);\n                i*=2;i++;\n            }else break;\n        }\n    }\n}\n/*---------------------------------------------*/\n\nvoid dijkstra(ll start){\n    rep(i,0,114123){\n        ans[i] = INF;\n        is_conf[i] = false;\n    }\n    ans[start] = 0;\n    is_conf[start]  = true;\n    int size=0;\n    rep(i,0,edge_cnt[start]){\n        heap[size].from = start;\n        heap[size].to = graph[start][i*2];\n        ans[ heap[size].to ] = graph[start][i*2+1];\n        graph_pushHeap( graph[start][i*2+1] , size , 0 );\n        size++;\n    }\n    // rep(i,0,4) printf(\"%lld \",ans[i]);\n    // PN;\n    ll piv;\n    while(size){\n        if( is_conf[ heap[0].to ] ){\n            graph_popHeap(size,0);\n            size--;\n            continue;\n        }\n        // printf(\"AA: %d %d\\n\",heap[0].from, heap[0].to );\n        is_conf[ heap[0].to ] = true;\n        ans[ heap[0].to ] = heap[0].cost;\n        piv = heap[0].to;\n        // rep(i,0,4) printf(\"%lld \",ans[i]);\n        // PN;\n        rep(i,0,edge_cnt[piv]){\n            if( ans[ graph[ heap[0].to ][i*2] ] > ans[ heap[0].to ] + graph[ heap[0].to ][i*2+1] ){\n                heap[size].from = heap[0].to;\n                heap[size].to = graph[ heap[0].to ][i*2];\n                graph_pushHeap( ans[ heap[0].to ] + graph[ heap[0].to ][i*2+1] , size , 0 );\n                size++;\n            }\n        }\n        graph_popHeap(size,0);\n        size--;\n    }\n}\n/*---------------------------Dijkstra end--------------------------------------------------------------------*/\n\n\nint main(void){\n    // fgets(s,sizeof(s),stdin); \n    // char ;\n    ll n,m,s,t;\n    // ll ans=0;\n    cin(&n);\n    cin(&m);\n    // cin2(&,&);\n    // cin3(&,&,&);\n    // scanf(\"%s\",);\n    ll u,v;\n    rep(i,0,m){\n        cin(&u);\n        cin(&v);\n        // pushGraph(u-1,v-1,1,1);\n        pushGraph(u-1,v-1+n,1,1);\n        pushGraph(u-1+n,v-1+2*n,1,1);\n        pushGraph(u-1+2*n,v-1,1,1);\n    }\n    // rep(i,0,n){\n    //     printf(\"%d \",edge_cnt[i]);\n    // }\n    // PN;\n    cin(&s);\n    cin(&t);\n    dijkstra(s-1);\n    // rep(i,0,n){\n    //     printf(\"%lld \",ans[i]);\n    // }\n    // PN;\n    \n    if(ans[t-1]==INF) printf(\"-1\\n\");\n    else printf(\"%lld\\n\",ans[t-1]/3);\n    return 0;\n}\n", "problem_context": "Score : 500 points\n\nProblem Statement\n\nKen loves ken-ken-pa (Japanese version of hopscotch). Today, he will play it on a directed graph G.\nG consists of N vertices numbered 1 to N, and M edges. The i-th edge points from Vertex u_i to Vertex v_i.\n\nFirst, Ken stands on Vertex S. He wants to reach Vertex T by repeating ken-ken-pa. In one ken-ken-pa, he does the following exactly three times: follow an edge pointing from the vertex on which he is standing.\n\nDetermine if he can reach Vertex T by repeating ken-ken-pa. If the answer is yes, find the minimum number of ken-ken-pa needed to reach Vertex T. Note that visiting Vertex T in the middle of a ken-ken-pa does not count as reaching Vertex T by repeating ken-ken-pa.\n\nConstraints\n\n2 \\leq N \\leq 10^5\n\n0 \\leq M \\leq \\min(10^5, N (N-1))\n\n1 \\leq u_i, v_i \\leq N(1 \\leq i \\leq M)\n\nu_i \\neq v_i (1 \\leq i \\leq M)\n\nIf i \\neq j, (u_i, v_i) \\neq (u_j, v_j).\n\n1 \\leq S, T \\leq N\n\nS \\neq T\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nu_1 v_1\n:\nu_M v_M\nS T\n\nOutput\n\nIf Ken cannot reach Vertex T from Vertex S by repeating ken-ken-pa, print -1.\nIf he can, print the minimum number of ken-ken-pa needed to reach vertex T.\n\nSample Input 1\n\n4 4\n1 2\n2 3\n3 4\n4 1\n1 3\n\nSample Output 1\n\n2\n\nKen can reach Vertex 3 from Vertex 1 in two ken-ken-pa, as follows: 1 \\rightarrow 2 \\rightarrow 3 \\rightarrow 4 in the first ken-ken-pa, then 4 \\rightarrow 1 \\rightarrow 2 \\rightarrow 3 in the second ken-ken-pa. This is the minimum number of ken-ken-pa needed.\n\nSample Input 2\n\n3 3\n1 2\n2 3\n3 1\n1 2\n\nSample Output 2\n\n-1\n\nAny number of ken-ken-pa will bring Ken back to Vertex 1, so he cannot reach Vertex 2, though he can pass through it in the middle of a ken-ken-pa.\n\nSample Input 3\n\n2 0\n1 2\n\nSample Output 3\n\n-1\n\nVertex S and Vertex T may be disconnected.\n\nSample Input 4\n\n6 8\n1 2\n2 3\n3 4\n4 5\n5 1\n1 4\n1 5\n4 6\n1 6\n\nSample Output 4\n\n2", "sample_input": "4 4\n1 2\n2 3\n3 4\n4 1\n1 3\n"}, "reference_outputs": ["2\n"], "source_document_id": "p02991", "source_text": "Score : 500 points\n\nProblem Statement\n\nKen loves ken-ken-pa (Japanese version of hopscotch). Today, he will play it on a directed graph G.\nG consists of N vertices numbered 1 to N, and M edges. The i-th edge points from Vertex u_i to Vertex v_i.\n\nFirst, Ken stands on Vertex S. He wants to reach Vertex T by repeating ken-ken-pa. In one ken-ken-pa, he does the following exactly three times: follow an edge pointing from the vertex on which he is standing.\n\nDetermine if he can reach Vertex T by repeating ken-ken-pa. If the answer is yes, find the minimum number of ken-ken-pa needed to reach Vertex T. Note that visiting Vertex T in the middle of a ken-ken-pa does not count as reaching Vertex T by repeating ken-ken-pa.\n\nConstraints\n\n2 \\leq N \\leq 10^5\n\n0 \\leq M \\leq \\min(10^5, N (N-1))\n\n1 \\leq u_i, v_i \\leq N(1 \\leq i \\leq M)\n\nu_i \\neq v_i (1 \\leq i \\leq M)\n\nIf i \\neq j, (u_i, v_i) \\neq (u_j, v_j).\n\n1 \\leq S, T \\leq N\n\nS \\neq T\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nu_1 v_1\n:\nu_M v_M\nS T\n\nOutput\n\nIf Ken cannot reach Vertex T from Vertex S by repeating ken-ken-pa, print -1.\nIf he can, print the minimum number of ken-ken-pa needed to reach vertex T.\n\nSample Input 1\n\n4 4\n1 2\n2 3\n3 4\n4 1\n1 3\n\nSample Output 1\n\n2\n\nKen can reach Vertex 3 from Vertex 1 in two ken-ken-pa, as follows: 1 \\rightarrow 2 \\rightarrow 3 \\rightarrow 4 in the first ken-ken-pa, then 4 \\rightarrow 1 \\rightarrow 2 \\rightarrow 3 in the second ken-ken-pa. This is the minimum number of ken-ken-pa needed.\n\nSample Input 2\n\n3 3\n1 2\n2 3\n3 1\n1 2\n\nSample Output 2\n\n-1\n\nAny number of ken-ken-pa will bring Ken back to Vertex 1, so he cannot reach Vertex 2, though he can pass through it in the middle of a ken-ken-pa.\n\nSample Input 3\n\n2 0\n1 2\n\nSample Output 3\n\n-1\n\nVertex S and Vertex T may be disconnected.\n\nSample Input 4\n\n6 8\n1 2\n2 3\n3 4\n4 5\n5 1\n1 4\n1 5\n4 6\n1 6\n\nSample Output 4\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": 8231, "cpu_time_ms": 110, "memory_kb": 11008}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s452698403", "group_id": "codeNet:p02993", "input_text": "#include <stdio.h>\n#include <stdlib.h>\n#include <string.h>\nint main(void){\nchar s[5];\nscanf(\"%s\",s);\nif(s[0]==s[1]||s[0]==s[2]||s[0]==s[3]||s[1]==s[2]||s[1]==s[3]||s[2]==s[3]){printf(\"Bad\");}\nelse{printf(\"Good\");}\nreturn 0;\n}", "language": "C", "metadata": {"date": 1569209789, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "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/C/s452698403.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s452698403", "user_id": "u932514381"}, "prompt_components": {"gold_output": "Bad\n", "input_to_evaluate": "#include <stdio.h>\n#include <stdlib.h>\n#include <string.h>\nint main(void){\nchar s[5];\nscanf(\"%s\",s);\nif(s[0]==s[1]||s[0]==s[2]||s[0]==s[3]||s[1]==s[2]||s[1]==s[3]||s[2]==s[3]){printf(\"Bad\");}\nelse{printf(\"Good\");}\nreturn 0;\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": 225, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s089666617", "group_id": "codeNet:p02993", "input_text": "#include<stdio.h>\n \nint main(void){\n  char S[4];\n  scanf(\"%s\",S);\n  for(int i=0;i<3;i++){\n    if(S[i]==S[i+1]){\n      printf(\"Bad\");\n    }else if(i==2){\n      printf(\"Good\");\n    }\n  }\n  return 0;\n}", "language": "C", "metadata": {"date": 1561353485, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "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/C/s089666617.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s089666617", "user_id": "u198896942"}, "prompt_components": {"gold_output": "Bad\n", "input_to_evaluate": "#include<stdio.h>\n \nint main(void){\n  char S[4];\n  scanf(\"%s\",S);\n  for(int i=0;i<3;i++){\n    if(S[i]==S[i+1]){\n      printf(\"Bad\");\n    }else if(i==2){\n      printf(\"Good\");\n    }\n  }\n  return 0;\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": 198, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s738103733", "group_id": "codeNet:p02993", "input_text": "#include \"stdio.h\"\n#include \"math.h\"\nint main()\n{\n  int i,S,g2,h[3],d;\n  scanf(\"%d\",&S);\n  g2=S;\n  for (i = 0; i < 4; i++)\n  {\n    S=S/(int)pow(10,3-i);\n    h[i]=S;\n    S=g2%(int)pow(10,3-i);\n  }\n  for (i = 0; i < 5; i++)\n  {\n    if (h[i]==h[i+1])\n    {\n      d=1;\n      break;\n    }else{\n      d=0;\n    }\n\n  }\n  if (d==1) {\n    puts(\"Bad\");\n  }else{\n    puts(\"Good\");\n  }\n  return 0;\n}", "language": "C", "metadata": {"date": 1561255051, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "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/C/s738103733.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s738103733", "user_id": "u488417454"}, "prompt_components": {"gold_output": "Bad\n", "input_to_evaluate": "#include \"stdio.h\"\n#include \"math.h\"\nint main()\n{\n  int i,S,g2,h[3],d;\n  scanf(\"%d\",&S);\n  g2=S;\n  for (i = 0; i < 4; i++)\n  {\n    S=S/(int)pow(10,3-i);\n    h[i]=S;\n    S=g2%(int)pow(10,3-i);\n  }\n  for (i = 0; i < 5; i++)\n  {\n    if (h[i]==h[i+1])\n    {\n      d=1;\n      break;\n    }else{\n      d=0;\n    }\n\n  }\n  if (d==1) {\n    puts(\"Bad\");\n  }else{\n    puts(\"Good\");\n  }\n  return 0;\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": 386, "cpu_time_ms": 2, "memory_kb": 256}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s241739924", "group_id": "codeNet:p02993", "input_text": "#include <stdio.h>\n\nint main(int argc, char *argv[]){\n  int i;\n  char a,b,c,d;\n  scanf(\"%c%c%c%c\", &a,&b,&c,&d);\n  if(a == b || b == c || a == c || b == d || c == d || a == d){\n    printf(\"Bad\");\n  }else{\n    printf(\"Good\");\n  }\n  return 0;\n}", "language": "C", "metadata": {"date": 1561253326, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "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/C/s241739924.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s241739924", "user_id": "u700161499"}, "prompt_components": {"gold_output": "Bad\n", "input_to_evaluate": "#include <stdio.h>\n\nint main(int argc, char *argv[]){\n  int i;\n  char a,b,c,d;\n  scanf(\"%c%c%c%c\", &a,&b,&c,&d);\n  if(a == b || b == c || a == c || b == d || c == d || a == d){\n    printf(\"Bad\");\n  }else{\n    printf(\"Good\");\n  }\n  return 0;\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": 242, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s634334121", "group_id": "codeNet:p02994", "input_text": "// AtCoder ABC131: B - Bite Eating\n// 2019.9.3 bal4u\n\n#include <stdio.h>\n\n#define ABS(x)  ((x)>=0?(x):-(x))\n\nint main()\n{\n\tint i, L, N, ans, mi, x;\n\t\n\tscanf(\"%d%d\", &N, &L);\n\tmi = 1000;\n\tfor (i = 0; i < N; i++) {\n\t\tif (ABS(L+i) < mi) x = L+i, mi = ABS(x);\n\t}\n\tprintf(\"%d\\n\", N*L+(N-1)*N/2 - x);\n\treturn 0;\n}\n\n", "language": "C", "metadata": {"date": 1567559688, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "problem_description_relpath": "problem_descriptions/p02994.html", "problem_id": "p02994", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02994/input.txt", "sample_output_relpath": "derived/input_output/data/p02994/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02994/C/s634334121.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s634334121", "user_id": "u759237395"}, "prompt_components": {"gold_output": "18\n", "input_to_evaluate": "// AtCoder ABC131: B - Bite Eating\n// 2019.9.3 bal4u\n\n#include <stdio.h>\n\n#define ABS(x)  ((x)>=0?(x):-(x))\n\nint main()\n{\n\tint i, L, N, ans, mi, x;\n\t\n\tscanf(\"%d%d\", &N, &L);\n\tmi = 1000;\n\tfor (i = 0; i < N; i++) {\n\t\tif (ABS(L+i) < mi) x = L+i, mi = ABS(x);\n\t}\n\tprintf(\"%d\\n\", N*L+(N-1)*N/2 - x);\n\treturn 0;\n}\n\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nYou have N apples, called Apple 1, Apple 2, Apple 3, ..., Apple N. The flavor of Apple i is L+i-1, which can be negative.\n\nYou can make an apple pie using one or more of the apples. The flavor of the apple pie will be the sum of the flavors of the apples used.\n\nYou planned to make an apple pie using all of the apples, but being hungry tempts you to eat one of them, which can no longer be used to make the apple pie.\n\nYou want to make an apple pie that is as similar as possible to the one that you planned to make. Thus, you will choose the apple to eat so that the flavor of the apple pie made of the remaining N-1 apples will have the smallest possible absolute difference from the flavor of the apple pie made of all the N apples.\n\nFind the flavor of the apple pie made of the remaining N-1 apples when you choose the apple to eat as above.\n\nWe can prove that this value is uniquely determined.\n\nConstraints\n\n2 \\leq N \\leq 200\n\n-100 \\leq L \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN L\n\nOutput\n\nFind the flavor of the apple pie made of the remaining N-1 apples when you optimally choose the apple to eat.\n\nSample Input 1\n\n5 2\n\nSample Output 1\n\n18\n\nThe flavors of Apple 1, 2, 3, 4, and 5 are 2, 3, 4, 5, and 6, respectively. The optimal choice is to eat Apple 1, so the answer is 3+4+5+6=18.\n\nSample Input 2\n\n3 -1\n\nSample Output 2\n\n0\n\nThe flavors of Apple 1, 2, and 3 are -1, 0, and 1, respectively. The optimal choice is to eat Apple 2, so the answer is (-1)+1=0.\n\nSample Input 3\n\n30 -50\n\nSample Output 3\n\n-1044", "sample_input": "5 2\n"}, "reference_outputs": ["18\n"], "source_document_id": "p02994", "source_text": "Score : 200 points\n\nProblem Statement\n\nYou have N apples, called Apple 1, Apple 2, Apple 3, ..., Apple N. The flavor of Apple i is L+i-1, which can be negative.\n\nYou can make an apple pie using one or more of the apples. The flavor of the apple pie will be the sum of the flavors of the apples used.\n\nYou planned to make an apple pie using all of the apples, but being hungry tempts you to eat one of them, which can no longer be used to make the apple pie.\n\nYou want to make an apple pie that is as similar as possible to the one that you planned to make. Thus, you will choose the apple to eat so that the flavor of the apple pie made of the remaining N-1 apples will have the smallest possible absolute difference from the flavor of the apple pie made of all the N apples.\n\nFind the flavor of the apple pie made of the remaining N-1 apples when you choose the apple to eat as above.\n\nWe can prove that this value is uniquely determined.\n\nConstraints\n\n2 \\leq N \\leq 200\n\n-100 \\leq L \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN L\n\nOutput\n\nFind the flavor of the apple pie made of the remaining N-1 apples when you optimally choose the apple to eat.\n\nSample Input 1\n\n5 2\n\nSample Output 1\n\n18\n\nThe flavors of Apple 1, 2, 3, 4, and 5 are 2, 3, 4, 5, and 6, respectively. The optimal choice is to eat Apple 1, so the answer is 3+4+5+6=18.\n\nSample Input 2\n\n3 -1\n\nSample Output 2\n\n0\n\nThe flavors of Apple 1, 2, and 3 are -1, 0, and 1, respectively. The optimal choice is to eat Apple 2, so the answer is (-1)+1=0.\n\nSample Input 3\n\n30 -50\n\nSample Output 3\n\n-1044", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 309, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s614912403", "group_id": "codeNet:p02994", "input_text": "#include<stdio.h>\n\nint main(void) {\n\tint N, L;\n\tscanf(\"%d%d\", &N, &L);\n\n\tint i;\n\tint v = 0;\n\n\tfor (i = 0;i < N;i++) {\n\t\tv += L + i;\n\t}\n\n\tif (N + L - 1 < 0) {\n\t\tv -= N + L - 1;\n\t}else if(L > 0) {\n\t\tv -= L;\n\t}else{}\n\n\tprintf(\"%d\", v);\n\n\treturn 0;\n}", "language": "C", "metadata": {"date": 1561252525, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "problem_description_relpath": "problem_descriptions/p02994.html", "problem_id": "p02994", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02994/input.txt", "sample_output_relpath": "derived/input_output/data/p02994/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02994/C/s614912403.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s614912403", "user_id": "u177053419"}, "prompt_components": {"gold_output": "18\n", "input_to_evaluate": "#include<stdio.h>\n\nint main(void) {\n\tint N, L;\n\tscanf(\"%d%d\", &N, &L);\n\n\tint i;\n\tint v = 0;\n\n\tfor (i = 0;i < N;i++) {\n\t\tv += L + i;\n\t}\n\n\tif (N + L - 1 < 0) {\n\t\tv -= N + L - 1;\n\t}else if(L > 0) {\n\t\tv -= L;\n\t}else{}\n\n\tprintf(\"%d\", v);\n\n\treturn 0;\n}", "problem_context": "Score : 200 points\n\nProblem Statement\n\nYou have N apples, called Apple 1, Apple 2, Apple 3, ..., Apple N. The flavor of Apple i is L+i-1, which can be negative.\n\nYou can make an apple pie using one or more of the apples. The flavor of the apple pie will be the sum of the flavors of the apples used.\n\nYou planned to make an apple pie using all of the apples, but being hungry tempts you to eat one of them, which can no longer be used to make the apple pie.\n\nYou want to make an apple pie that is as similar as possible to the one that you planned to make. Thus, you will choose the apple to eat so that the flavor of the apple pie made of the remaining N-1 apples will have the smallest possible absolute difference from the flavor of the apple pie made of all the N apples.\n\nFind the flavor of the apple pie made of the remaining N-1 apples when you choose the apple to eat as above.\n\nWe can prove that this value is uniquely determined.\n\nConstraints\n\n2 \\leq N \\leq 200\n\n-100 \\leq L \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN L\n\nOutput\n\nFind the flavor of the apple pie made of the remaining N-1 apples when you optimally choose the apple to eat.\n\nSample Input 1\n\n5 2\n\nSample Output 1\n\n18\n\nThe flavors of Apple 1, 2, 3, 4, and 5 are 2, 3, 4, 5, and 6, respectively. The optimal choice is to eat Apple 1, so the answer is 3+4+5+6=18.\n\nSample Input 2\n\n3 -1\n\nSample Output 2\n\n0\n\nThe flavors of Apple 1, 2, and 3 are -1, 0, and 1, respectively. The optimal choice is to eat Apple 2, so the answer is (-1)+1=0.\n\nSample Input 3\n\n30 -50\n\nSample Output 3\n\n-1044", "sample_input": "5 2\n"}, "reference_outputs": ["18\n"], "source_document_id": "p02994", "source_text": "Score : 200 points\n\nProblem Statement\n\nYou have N apples, called Apple 1, Apple 2, Apple 3, ..., Apple N. The flavor of Apple i is L+i-1, which can be negative.\n\nYou can make an apple pie using one or more of the apples. The flavor of the apple pie will be the sum of the flavors of the apples used.\n\nYou planned to make an apple pie using all of the apples, but being hungry tempts you to eat one of them, which can no longer be used to make the apple pie.\n\nYou want to make an apple pie that is as similar as possible to the one that you planned to make. Thus, you will choose the apple to eat so that the flavor of the apple pie made of the remaining N-1 apples will have the smallest possible absolute difference from the flavor of the apple pie made of all the N apples.\n\nFind the flavor of the apple pie made of the remaining N-1 apples when you choose the apple to eat as above.\n\nWe can prove that this value is uniquely determined.\n\nConstraints\n\n2 \\leq N \\leq 200\n\n-100 \\leq L \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN L\n\nOutput\n\nFind the flavor of the apple pie made of the remaining N-1 apples when you optimally choose the apple to eat.\n\nSample Input 1\n\n5 2\n\nSample Output 1\n\n18\n\nThe flavors of Apple 1, 2, 3, 4, and 5 are 2, 3, 4, 5, and 6, respectively. The optimal choice is to eat Apple 1, so the answer is 3+4+5+6=18.\n\nSample Input 2\n\n3 -1\n\nSample Output 2\n\n0\n\nThe flavors of Apple 1, 2, and 3 are -1, 0, and 1, respectively. The optimal choice is to eat Apple 2, so the answer is (-1)+1=0.\n\nSample Input 3\n\n30 -50\n\nSample Output 3\n\n-1044", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 246, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s826329250", "group_id": "codeNet:p02994", "input_text": "/*\n\tsubmission # - User: herp_sy\n\thttps://atcoder.jp/contests/\n*/\n\n#include <stdio.h>\n#include <stdlib.h>\n#include <string.h>\n#include <math.h>\n#include <time.h>\n\n#define _CRT_SECURE_NO_WARNINGS\n#define TLong long long\n#define TBMod 1000000007\n\nint nongetpop(int *array,int *size){\n\trealloc(array,sizeof(int) * (*size - 1));\n\t--(*size);\n}\n\nint main(int argc, char const *argv[])\n{\n\tint n,l;\n\tint a[203];\n\tint sum = 0;\n\tscanf(\"%d%d\",&n,&l);\n\tfor (int i = 1; i <= n; ++i){\n\t\ta[i] = l + i - 1;\n\t\tsum += a[i];\n\t}\n\tfor (int i = 1; i <= n; ++i)\n\t{\n\t\tif(a[i] == 0){\n\t\t\tprintf(\"%d\\n\", sum);\n\t\t\treturn 0;\n\t\t}\n\t}\n\tif(sum < 0){\n\t\tprintf(\"%d\\n\", sum - a[n]);\n\t}\n\telse{\n\t\tprintf(\"%d\\n\", sum - a[1]);\n\t}\n\treturn 0;\n}\n", "language": "C", "metadata": {"date": 1561252195, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "problem_description_relpath": "problem_descriptions/p02994.html", "problem_id": "p02994", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02994/input.txt", "sample_output_relpath": "derived/input_output/data/p02994/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02994/C/s826329250.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s826329250", "user_id": "u185464141"}, "prompt_components": {"gold_output": "18\n", "input_to_evaluate": "/*\n\tsubmission # - User: herp_sy\n\thttps://atcoder.jp/contests/\n*/\n\n#include <stdio.h>\n#include <stdlib.h>\n#include <string.h>\n#include <math.h>\n#include <time.h>\n\n#define _CRT_SECURE_NO_WARNINGS\n#define TLong long long\n#define TBMod 1000000007\n\nint nongetpop(int *array,int *size){\n\trealloc(array,sizeof(int) * (*size - 1));\n\t--(*size);\n}\n\nint main(int argc, char const *argv[])\n{\n\tint n,l;\n\tint a[203];\n\tint sum = 0;\n\tscanf(\"%d%d\",&n,&l);\n\tfor (int i = 1; i <= n; ++i){\n\t\ta[i] = l + i - 1;\n\t\tsum += a[i];\n\t}\n\tfor (int i = 1; i <= n; ++i)\n\t{\n\t\tif(a[i] == 0){\n\t\t\tprintf(\"%d\\n\", sum);\n\t\t\treturn 0;\n\t\t}\n\t}\n\tif(sum < 0){\n\t\tprintf(\"%d\\n\", sum - a[n]);\n\t}\n\telse{\n\t\tprintf(\"%d\\n\", sum - a[1]);\n\t}\n\treturn 0;\n}\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nYou have N apples, called Apple 1, Apple 2, Apple 3, ..., Apple N. The flavor of Apple i is L+i-1, which can be negative.\n\nYou can make an apple pie using one or more of the apples. The flavor of the apple pie will be the sum of the flavors of the apples used.\n\nYou planned to make an apple pie using all of the apples, but being hungry tempts you to eat one of them, which can no longer be used to make the apple pie.\n\nYou want to make an apple pie that is as similar as possible to the one that you planned to make. Thus, you will choose the apple to eat so that the flavor of the apple pie made of the remaining N-1 apples will have the smallest possible absolute difference from the flavor of the apple pie made of all the N apples.\n\nFind the flavor of the apple pie made of the remaining N-1 apples when you choose the apple to eat as above.\n\nWe can prove that this value is uniquely determined.\n\nConstraints\n\n2 \\leq N \\leq 200\n\n-100 \\leq L \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN L\n\nOutput\n\nFind the flavor of the apple pie made of the remaining N-1 apples when you optimally choose the apple to eat.\n\nSample Input 1\n\n5 2\n\nSample Output 1\n\n18\n\nThe flavors of Apple 1, 2, 3, 4, and 5 are 2, 3, 4, 5, and 6, respectively. The optimal choice is to eat Apple 1, so the answer is 3+4+5+6=18.\n\nSample Input 2\n\n3 -1\n\nSample Output 2\n\n0\n\nThe flavors of Apple 1, 2, and 3 are -1, 0, and 1, respectively. The optimal choice is to eat Apple 2, so the answer is (-1)+1=0.\n\nSample Input 3\n\n30 -50\n\nSample Output 3\n\n-1044", "sample_input": "5 2\n"}, "reference_outputs": ["18\n"], "source_document_id": "p02994", "source_text": "Score : 200 points\n\nProblem Statement\n\nYou have N apples, called Apple 1, Apple 2, Apple 3, ..., Apple N. The flavor of Apple i is L+i-1, which can be negative.\n\nYou can make an apple pie using one or more of the apples. The flavor of the apple pie will be the sum of the flavors of the apples used.\n\nYou planned to make an apple pie using all of the apples, but being hungry tempts you to eat one of them, which can no longer be used to make the apple pie.\n\nYou want to make an apple pie that is as similar as possible to the one that you planned to make. Thus, you will choose the apple to eat so that the flavor of the apple pie made of the remaining N-1 apples will have the smallest possible absolute difference from the flavor of the apple pie made of all the N apples.\n\nFind the flavor of the apple pie made of the remaining N-1 apples when you choose the apple to eat as above.\n\nWe can prove that this value is uniquely determined.\n\nConstraints\n\n2 \\leq N \\leq 200\n\n-100 \\leq L \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN L\n\nOutput\n\nFind the flavor of the apple pie made of the remaining N-1 apples when you optimally choose the apple to eat.\n\nSample Input 1\n\n5 2\n\nSample Output 1\n\n18\n\nThe flavors of Apple 1, 2, 3, 4, and 5 are 2, 3, 4, 5, and 6, respectively. The optimal choice is to eat Apple 1, so the answer is 3+4+5+6=18.\n\nSample Input 2\n\n3 -1\n\nSample Output 2\n\n0\n\nThe flavors of Apple 1, 2, and 3 are -1, 0, and 1, respectively. The optimal choice is to eat Apple 2, so the answer is (-1)+1=0.\n\nSample Input 3\n\n30 -50\n\nSample Output 3\n\n-1044", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 703, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s100255028", "group_id": "codeNet:p02995", "input_text": "#include <stdio.h>\n\nint main(){\n\tlong long int a, b, c, d;\n\tscanf(\"%lld %lld %lld %lld\", &a, &b, &c, &d);\n\tlong long int i, ans=0, x, y, z;\n    \n    x = (b-a+1+a%c)/c;\n    y = (b-a+1+a%d)/d;\n    z = (b-a+1+a%(c*d))/(c*d);\n\t\n\tprintf(\"%lld\", (b-a+1)-x-y+z);\n\t\n\treturn 0;\n}", "language": "C", "metadata": {"date": 1561235057, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "problem_description_relpath": "problem_descriptions/p02995.html", "problem_id": "p02995", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02995/input.txt", "sample_output_relpath": "derived/input_output/data/p02995/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02995/C/s100255028.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s100255028", "user_id": "u818818531"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "#include <stdio.h>\n\nint main(){\n\tlong long int a, b, c, d;\n\tscanf(\"%lld %lld %lld %lld\", &a, &b, &c, &d);\n\tlong long int i, ans=0, x, y, z;\n    \n    x = (b-a+1+a%c)/c;\n    y = (b-a+1+a%d)/d;\n    z = (b-a+1+a%(c*d))/(c*d);\n\t\n\tprintf(\"%lld\", (b-a+1)-x-y+z);\n\t\n\treturn 0;\n}", "problem_context": "Score : 300 points\n\nProblem Statement\n\nYou are given four integers A, B, C, and D. Find the number of integers between A and B (inclusive) that can be evenly divided by neither C nor D.\n\nConstraints\n\n1\\leq A\\leq B\\leq 10^{18}\n\n1\\leq C,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 number of integers between A and B (inclusive) that can be evenly divided by neither C nor D.\n\nSample Input 1\n\n4 9 2 3\n\nSample Output 1\n\n2\n\n5 and 7 satisfy the condition.\n\nSample Input 2\n\n10 40 6 8\n\nSample Output 2\n\n23\n\nSample Input 3\n\n314159265358979323 846264338327950288 419716939 937510582\n\nSample Output 3\n\n532105071133627368", "sample_input": "4 9 2 3\n"}, "reference_outputs": ["2\n"], "source_document_id": "p02995", "source_text": "Score : 300 points\n\nProblem Statement\n\nYou are given four integers A, B, C, and D. Find the number of integers between A and B (inclusive) that can be evenly divided by neither C nor D.\n\nConstraints\n\n1\\leq A\\leq B\\leq 10^{18}\n\n1\\leq C,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 number of integers between A and B (inclusive) that can be evenly divided by neither C nor D.\n\nSample Input 1\n\n4 9 2 3\n\nSample Output 1\n\n2\n\n5 and 7 satisfy the condition.\n\nSample Input 2\n\n10 40 6 8\n\nSample Output 2\n\n23\n\nSample Input 3\n\n314159265358979323 846264338327950288 419716939 937510582\n\nSample Output 3\n\n532105071133627368", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 270, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s183872962", "group_id": "codeNet:p02995", "input_text": "#include <stdio.h>\n\nint main(void){\n  unsigned long long a,b,c,d,sum=0;\n  scanf(\"%lld %lld %lld %lld\",&a,&b,&c,&d);\n  sum += (b/c) - (a-1)/c;\n  sum += (b/d) - (a-1)/d;\n  printf(\"%lld\\n\",sum);\n  return 0;\n}", "language": "C", "metadata": {"date": 1561234653, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "problem_description_relpath": "problem_descriptions/p02995.html", "problem_id": "p02995", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02995/input.txt", "sample_output_relpath": "derived/input_output/data/p02995/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02995/C/s183872962.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s183872962", "user_id": "u053826808"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "#include <stdio.h>\n\nint main(void){\n  unsigned long long a,b,c,d,sum=0;\n  scanf(\"%lld %lld %lld %lld\",&a,&b,&c,&d);\n  sum += (b/c) - (a-1)/c;\n  sum += (b/d) - (a-1)/d;\n  printf(\"%lld\\n\",sum);\n  return 0;\n}", "problem_context": "Score : 300 points\n\nProblem Statement\n\nYou are given four integers A, B, C, and D. Find the number of integers between A and B (inclusive) that can be evenly divided by neither C nor D.\n\nConstraints\n\n1\\leq A\\leq B\\leq 10^{18}\n\n1\\leq C,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 number of integers between A and B (inclusive) that can be evenly divided by neither C nor D.\n\nSample Input 1\n\n4 9 2 3\n\nSample Output 1\n\n2\n\n5 and 7 satisfy the condition.\n\nSample Input 2\n\n10 40 6 8\n\nSample Output 2\n\n23\n\nSample Input 3\n\n314159265358979323 846264338327950288 419716939 937510582\n\nSample Output 3\n\n532105071133627368", "sample_input": "4 9 2 3\n"}, "reference_outputs": ["2\n"], "source_document_id": "p02995", "source_text": "Score : 300 points\n\nProblem Statement\n\nYou are given four integers A, B, C, and D. Find the number of integers between A and B (inclusive) that can be evenly divided by neither C nor D.\n\nConstraints\n\n1\\leq A\\leq B\\leq 10^{18}\n\n1\\leq C,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 number of integers between A and B (inclusive) that can be evenly divided by neither C nor D.\n\nSample Input 1\n\n4 9 2 3\n\nSample Output 1\n\n2\n\n5 and 7 satisfy the condition.\n\nSample Input 2\n\n10 40 6 8\n\nSample Output 2\n\n23\n\nSample Input 3\n\n314159265358979323 846264338327950288 419716939 937510582\n\nSample Output 3\n\n532105071133627368", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 205, "cpu_time_ms": 2, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s199375228", "group_id": "codeNet:p02995", "input_text": "#include <stdio.h>\nint main(void){\n    // Your code here!\n    int a,b,c,d;\n    unsigned long long int cnt = 0;\n    scanf(\"%d %d %d %d\",&a,&b,&c,&d);\n    for(int i=a; i<= b;i++){\n        if(i%c != 0 && i%d != 0){\n            cnt++;\n        }\n    }\n    printf(\"%d\\n\",cnt);\n}\n", "language": "C", "metadata": {"date": 1561231249, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "problem_description_relpath": "problem_descriptions/p02995.html", "problem_id": "p02995", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p02995/input.txt", "sample_output_relpath": "derived/input_output/data/p02995/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02995/C/s199375228.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s199375228", "user_id": "u693933222"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "#include <stdio.h>\nint main(void){\n    // Your code here!\n    int a,b,c,d;\n    unsigned long long int cnt = 0;\n    scanf(\"%d %d %d %d\",&a,&b,&c,&d);\n    for(int i=a; i<= b;i++){\n        if(i%c != 0 && i%d != 0){\n            cnt++;\n        }\n    }\n    printf(\"%d\\n\",cnt);\n}\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nYou are given four integers A, B, C, and D. Find the number of integers between A and B (inclusive) that can be evenly divided by neither C nor D.\n\nConstraints\n\n1\\leq A\\leq B\\leq 10^{18}\n\n1\\leq C,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 number of integers between A and B (inclusive) that can be evenly divided by neither C nor D.\n\nSample Input 1\n\n4 9 2 3\n\nSample Output 1\n\n2\n\n5 and 7 satisfy the condition.\n\nSample Input 2\n\n10 40 6 8\n\nSample Output 2\n\n23\n\nSample Input 3\n\n314159265358979323 846264338327950288 419716939 937510582\n\nSample Output 3\n\n532105071133627368", "sample_input": "4 9 2 3\n"}, "reference_outputs": ["2\n"], "source_document_id": "p02995", "source_text": "Score : 300 points\n\nProblem Statement\n\nYou are given four integers A, B, C, and D. Find the number of integers between A and B (inclusive) that can be evenly divided by neither C nor D.\n\nConstraints\n\n1\\leq A\\leq B\\leq 10^{18}\n\n1\\leq C,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 number of integers between A and B (inclusive) that can be evenly divided by neither C nor D.\n\nSample Input 1\n\n4 9 2 3\n\nSample Output 1\n\n2\n\n5 and 7 satisfy the condition.\n\nSample Input 2\n\n10 40 6 8\n\nSample Output 2\n\n23\n\nSample Input 3\n\n314159265358979323 846264338327950288 419716939 937510582\n\nSample Output 3\n\n532105071133627368", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 273, "cpu_time_ms": 2103, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s079259251", "group_id": "codeNet:p02996", "input_text": "#include<stdio.h>\n#include<stdlib.h>\n\ntypedef struct {\n  int a_val;\n  int b_val;\n} st;\n\nint cmp_a(const void *x, const void *y) {\n  st *X = (st *)x;\n  st *Y = (st *)y;\n  return Y->a_val - X->a_val;\n}\n\nint cmp_b(const void *x, const void *y) {\n  st *X = (st *)x;\n  st *Y = (st *)y;\n  return X->b_val - Y->b_val;\n}\n/*\nint cmp(const void *a, const void *b) {\n  int(*func[])(st* pa_, st* pb_) = {&cmp_a, &cmp_b};\n  st *pa = (st*)a;\n  st *pb = (st*)b;\n  for (int i = 0; i < sizeof(func) / sizeof(func[0]); i++) {\n    int ret = func[i](pa, pb);\n    if (ret != 0) {\n      return ret;\n\t\t}\n\t}\n}\n*/\n\nint main() {\n  int i;\n  int n;\n  scanf(\"%d\", &n);\n\n  int *a, *b;\n  a = (int *)malloc(sizeof(int) * n);\n  b = (int *)malloc(sizeof(int) * n);\n\n  for(i = 0; i < n; i++) {\n    scanf(\"%d %d\", &a[i], &b[i]);\n  }\n\n  st *c;\n  c = (st *)malloc(sizeof(st) * n);\n  for(i = 0; i < n; i++) {\n    c[i].a_val = a[i];\n    c[i].b_val = b[i];\n  }\n\n  qsort(c, n, sizeof(st), cmp_b);\n\n  int alltime = 0;\n  for(i = 0; i < n; i++) {\n    alltime += c[i].a_val;\n    if(alltime > c[i].b_val) {\n      printf(\"No\\n\");\n      return 0;\n    }\n  }\n  printf(\"Yes\\n\");\n\n  return 0;\n}\n", "language": "C", "metadata": {"date": 1561235720, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "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/C/s079259251.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s079259251", "user_id": "u355520191"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "#include<stdio.h>\n#include<stdlib.h>\n\ntypedef struct {\n  int a_val;\n  int b_val;\n} st;\n\nint cmp_a(const void *x, const void *y) {\n  st *X = (st *)x;\n  st *Y = (st *)y;\n  return Y->a_val - X->a_val;\n}\n\nint cmp_b(const void *x, const void *y) {\n  st *X = (st *)x;\n  st *Y = (st *)y;\n  return X->b_val - Y->b_val;\n}\n/*\nint cmp(const void *a, const void *b) {\n  int(*func[])(st* pa_, st* pb_) = {&cmp_a, &cmp_b};\n  st *pa = (st*)a;\n  st *pb = (st*)b;\n  for (int i = 0; i < sizeof(func) / sizeof(func[0]); i++) {\n    int ret = func[i](pa, pb);\n    if (ret != 0) {\n      return ret;\n\t\t}\n\t}\n}\n*/\n\nint main() {\n  int i;\n  int n;\n  scanf(\"%d\", &n);\n\n  int *a, *b;\n  a = (int *)malloc(sizeof(int) * n);\n  b = (int *)malloc(sizeof(int) * n);\n\n  for(i = 0; i < n; i++) {\n    scanf(\"%d %d\", &a[i], &b[i]);\n  }\n\n  st *c;\n  c = (st *)malloc(sizeof(st) * n);\n  for(i = 0; i < n; i++) {\n    c[i].a_val = a[i];\n    c[i].b_val = b[i];\n  }\n\n  qsort(c, n, sizeof(st), cmp_b);\n\n  int alltime = 0;\n  for(i = 0; i < n; i++) {\n    alltime += c[i].a_val;\n    if(alltime > c[i].b_val) {\n      printf(\"No\\n\");\n      return 0;\n    }\n  }\n  printf(\"Yes\\n\");\n\n  return 0;\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": 1142, "cpu_time_ms": 65, "memory_kb": 4860}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s231345127", "group_id": "codeNet:p02999", "input_text": "#include<stdio.h>\n#define N 100\n\nint main(){\nint n,x,l[N];\n  int i,j,cnt;\n  \n  scanf(\"%d%d\",&n,&x);\n  for(i=0;i<3;i++){\n    scanf(\"%d\",l[i]);\n  }\n  \n  for(j=0;j<n;j++){\n    if(l[j]<=x) cnt++;\n  }\n  \n  printf(\"%d\",cnt);\n\n\nreturn 0;\n}", "language": "C", "metadata": {"date": 1560712779, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "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/C/s231345127.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s231345127", "user_id": "u523228574"}, "prompt_components": {"gold_output": "0\n", "input_to_evaluate": "#include<stdio.h>\n#define N 100\n\nint main(){\nint n,x,l[N];\n  int i,j,cnt;\n  \n  scanf(\"%d%d\",&n,&x);\n  for(i=0;i<3;i++){\n    scanf(\"%d\",l[i]);\n  }\n  \n  for(j=0;j<n;j++){\n    if(l[j]<=x) cnt++;\n  }\n  \n  printf(\"%d\",cnt);\n\n\nreturn 0;\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": 232, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s020425967", "group_id": "codeNet:p03000", "input_text": "#include<stdio.h>\n\nint main(){\n  int x,n,i,j,count=0;\n  scanf(\"%d %d\",&n,&x);\n  int l[n],d[n];\n  for(j=1;j<n+1;j++){\n    scanf(\"%d\",&l[j]);\n  }\n  d[1]=0;\n  for(i=2;i<n+1;i++){\n    d[i]=d[i-1]+l[i-1];\n    if(d[i]<=x) count++;\n  }\n  printf(\"%d\\n\",count+1);\n  return 0;\n}", "language": "C", "metadata": {"date": 1565109771, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "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/C/s020425967.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s020425967", "user_id": "u659187034"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "#include<stdio.h>\n\nint main(){\n  int x,n,i,j,count=0;\n  scanf(\"%d %d\",&n,&x);\n  int l[n],d[n];\n  for(j=1;j<n+1;j++){\n    scanf(\"%d\",&l[j]);\n  }\n  d[1]=0;\n  for(i=2;i<n+1;i++){\n    d[i]=d[i-1]+l[i-1];\n    if(d[i]<=x) count++;\n  }\n  printf(\"%d\\n\",count+1);\n  return 0;\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": 268, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s137849875", "group_id": "codeNet:p03000", "input_text": "#include<stdio.h>\nint main(void){\n    int N,n,x,a=0;\n    N=n+1;\n    int l[100],d[100];\n    d[0]=0;\n    scanf(\"%d\",&n);\n    scanf(\" %d\", &x);\n    for(int i=0; i<n-1;i++){\n        scanf(\"%d \", &l[i]);\n    \n    }\n    for(int i=1;i<n;i++){\n        d[i]=d[i-1]+l[i-1];\n        if(d[i]<=x)\n        a++;\n    }\n   \nprintf(\"%d\\n\",a+1);\n}", "language": "C", "metadata": {"date": 1562765505, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "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/C/s137849875.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s137849875", "user_id": "u371497661"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "#include<stdio.h>\nint main(void){\n    int N,n,x,a=0;\n    N=n+1;\n    int l[100],d[100];\n    d[0]=0;\n    scanf(\"%d\",&n);\n    scanf(\" %d\", &x);\n    for(int i=0; i<n-1;i++){\n        scanf(\"%d \", &l[i]);\n    \n    }\n    for(int i=1;i<n;i++){\n        d[i]=d[i-1]+l[i-1];\n        if(d[i]<=x)\n        a++;\n    }\n   \nprintf(\"%d\\n\",a+1);\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": 328, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s458128758", "group_id": "codeNet:p03001", "input_text": "#include<stdio.h>\nint main(void){\n  double W,H,x,y;\n  scanf(\"%d %d %d %d\",&W,&H,&x,&y);\n  if(W/2==x && H/2==y){\n    printf(\"%f 1\\n\",W*H/2);\n  }else{\n    printf(\"%f 0\\n\",W*H/2);\n  }\n  return 0;\n}", "language": "C", "metadata": {"date": 1561550181, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "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/C/s458128758.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s458128758", "user_id": "u083980875"}, "prompt_components": {"gold_output": "3.000000 0\n", "input_to_evaluate": "#include<stdio.h>\nint main(void){\n  double W,H,x,y;\n  scanf(\"%d %d %d %d\",&W,&H,&x,&y);\n  if(W/2==x && H/2==y){\n    printf(\"%f 1\\n\",W*H/2);\n  }else{\n    printf(\"%f 0\\n\",W*H/2);\n  }\n  return 0;\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": 194, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s277876448", "group_id": "codeNet:p03001", "input_text": "#include<stdio.h>\nint main(void) {\n    float w,h,x,y;\n    scanf(\"%f %f %f %f\",&w, &h, &x, &y);\n    float size = w*h/2.0;\n    int flag;\n    if(x==w/2.0 && y==h/2.0)\n        flag = 1;\n    else\n        flag = 0;\n    printf(\"%f %d\\n\", size,flag);\n\n}", "language": "C", "metadata": {"date": 1560716546, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "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/C/s277876448.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s277876448", "user_id": "u477648767"}, "prompt_components": {"gold_output": "3.000000 0\n", "input_to_evaluate": "#include<stdio.h>\nint main(void) {\n    float w,h,x,y;\n    scanf(\"%f %f %f %f\",&w, &h, &x, &y);\n    float size = w*h/2.0;\n    int flag;\n    if(x==w/2.0 && y==h/2.0)\n        flag = 1;\n    else\n        flag = 0;\n    printf(\"%f %d\\n\", size,flag);\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": 245, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s374583539", "group_id": "codeNet:p03006", "input_text": "#include <stdio.h>\n#include <stdlib.h>\n#include <string.h>\n#define ll long long\n#define rep(i,l,r)for(ll i=(l);i<(r);i++)\n#define repp(i,l,r,k)for(ll i=(l);i<(r);i+=(k))\n#define INF ((1LL<<62)-(1LL<<31))\n#define max(p,q)((p)>(q)?(p):(q))\n#define min(p,q)((p)<(q)?(p):(q))\n#define bit(n,m)(((n)>>(m))&1)\nint upll(const void*a, const void*b){return*(ll*)a<*(ll*)b?-1:*(ll*)a>*(ll*)b?1:0;}\nint downll(const void*a, const void*b){return*(ll*)a<*(ll*)b?1:*(ll*)a>*(ll*)b?-1:0;}\nvoid sortup(ll*a,int n){qsort(a,n,sizeof(ll),upll);}\nvoid sortdown(ll*a,int n){qsort(a,n,sizeof(ll),downll);}\nll pom(ll a,ll n,int m){ll x=1;for(a%=m;n;n/=2)n&1?x=x*a%m:0,a=a*a%m;return x;}\n//#define MOD 998244353\n#define MOD 1000000007\n#define invp(a,p)pom(a,p-2,p)\n\nll n;\nll x[99],y[99];\nll idx[99];\nll idx2[99];\n\nint c(const void*a,const void*b){\n\tll p=*(ll*)a,q=*(ll*)b;\n\tll ppp=x[p]*2000000001+y[p];\n\tll qqq=x[q]*2000000001+y[q];\n\tif(ppp<qqq)return -1;\n\treturn 1;\n}\nint c2(const void*a,const void*b){\n\tll p=*(ll*)a,q=*(ll*)b;\n\tll ppp=x[p]*2000000001-y[p];\n\tll qqq=x[q]*2000000001-y[q];\n\tif(ppp<qqq)return -1;\n\treturn 1;\n}\n\nint main(){\n\tscanf(\"%lld\",&n);\n\trep(i,0,n)scanf(\"%lld %lld\",x+i,y+i);\n\trep(i,0,n)idx[i]=idx2[i]=i;\n\tqsort(idx,n,sizeof(ll),c);\n\tqsort(idx2,n,sizeof(ll),c2);\n\tll ans=n;\n\t\n\trep(aaa,0,n)rep(bbb,0,n)if(aaa!=bbb){\n\t\t//aaa,bbb間の移動を(p,q)に指定する\n\t\tll p=x[aaa]-x[bbb];\n\t\tll q=y[aaa]-y[bbb];\n\t\tll tempx[99]={};\n\t\tll tempy[99]={};\n\n\t\tif(p*q>=0){\n\t\t\tif(p>0||q>0){\n\t\t\t\t//左下から右下へ\n\t\t\t\trep(i,0,n){\n\t\t\t\t\ttempx[i]=x[idx[i]];\n\t\t\t\t\ttempy[i]=y[idx[i]];\n\t\t\t\t}\n\t\t\t}else{\n\t\t\t\t//右上から左下へ\n\t\t\t\tfor(ll i=n-1;i>=0;i--){\n\t\t\t\t\ttempx[i]=x[idx[i]];\n\t\t\t\t\ttempy[i]=y[idx[i]];\n\t\t\t\t}\n\t\t\t}\n\t\t}else{\n\t\t\tif(p<0){\n\t\t\t\t//左上から右下へ\n\t\t\t\trep(i,0,n){\n\t\t\t\t\ttempx[i]=x[idx2[i]];\n\t\t\t\t\ttempy[i]=y[idx2[i]];\n\t\t\t\t}\n\t\t\t}else{\n\t\t\t\t//右下から左上へ\n\t\t\t\tfor(ll i=n-1;i>=0;i--){\n\t\t\t\t\ttempx[i]=x[idx2[i]];\n\t\t\t\t\ttempy[i]=y[idx2[i]];\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\t\n\t\tll cnt=0;\n\t\trep(i,0,n){\n\t\t\tif(tempx[i]!=INF){\n\t\t\t\tcnt++;\n\t\t\t\tint flag=1;\n\t\t\t\tll crrx=tempx[i];\n\t\t\t\tll crry=tempy[i];\n\t\t\t\ttempx[i]=INF;\n\t\t\t\ttempy[i]=INF;\n\t\t\t\t\n\t\t\t\twhile(flag){\n\t\t\t\t\tflag=0;\n\t\t\t\t\tcrrx+=p;\n\t\t\t\t\tcrry+=q;\n\t\t\t\t\trep(j,0,n){\n\t\t\t\t\t\tif(crrx==tempx[j]&&crry==tempy[j]){\n\t\t\t\t\t\t\tflag=1;\n\t\t\t\t\t\t\ttempx[j]=INF;\n\t\t\t\t\t\t\ttempy[j]=INF;\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}\n\t\t}\n\t\tans=min(ans,cnt);\n\t}\n\tprintf(\"%lld\",ans);\n}\n", "language": "C", "metadata": {"date": 1560649381, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "problem_description_relpath": "problem_descriptions/p03006.html", "problem_id": "p03006", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03006/input.txt", "sample_output_relpath": "derived/input_output/data/p03006/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03006/C/s374583539.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s374583539", "user_id": "u382163500"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "#include <stdio.h>\n#include <stdlib.h>\n#include <string.h>\n#define ll long long\n#define rep(i,l,r)for(ll i=(l);i<(r);i++)\n#define repp(i,l,r,k)for(ll i=(l);i<(r);i+=(k))\n#define INF ((1LL<<62)-(1LL<<31))\n#define max(p,q)((p)>(q)?(p):(q))\n#define min(p,q)((p)<(q)?(p):(q))\n#define bit(n,m)(((n)>>(m))&1)\nint upll(const void*a, const void*b){return*(ll*)a<*(ll*)b?-1:*(ll*)a>*(ll*)b?1:0;}\nint downll(const void*a, const void*b){return*(ll*)a<*(ll*)b?1:*(ll*)a>*(ll*)b?-1:0;}\nvoid sortup(ll*a,int n){qsort(a,n,sizeof(ll),upll);}\nvoid sortdown(ll*a,int n){qsort(a,n,sizeof(ll),downll);}\nll pom(ll a,ll n,int m){ll x=1;for(a%=m;n;n/=2)n&1?x=x*a%m:0,a=a*a%m;return x;}\n//#define MOD 998244353\n#define MOD 1000000007\n#define invp(a,p)pom(a,p-2,p)\n\nll n;\nll x[99],y[99];\nll idx[99];\nll idx2[99];\n\nint c(const void*a,const void*b){\n\tll p=*(ll*)a,q=*(ll*)b;\n\tll ppp=x[p]*2000000001+y[p];\n\tll qqq=x[q]*2000000001+y[q];\n\tif(ppp<qqq)return -1;\n\treturn 1;\n}\nint c2(const void*a,const void*b){\n\tll p=*(ll*)a,q=*(ll*)b;\n\tll ppp=x[p]*2000000001-y[p];\n\tll qqq=x[q]*2000000001-y[q];\n\tif(ppp<qqq)return -1;\n\treturn 1;\n}\n\nint main(){\n\tscanf(\"%lld\",&n);\n\trep(i,0,n)scanf(\"%lld %lld\",x+i,y+i);\n\trep(i,0,n)idx[i]=idx2[i]=i;\n\tqsort(idx,n,sizeof(ll),c);\n\tqsort(idx2,n,sizeof(ll),c2);\n\tll ans=n;\n\t\n\trep(aaa,0,n)rep(bbb,0,n)if(aaa!=bbb){\n\t\t//aaa,bbb間の移動を(p,q)に指定する\n\t\tll p=x[aaa]-x[bbb];\n\t\tll q=y[aaa]-y[bbb];\n\t\tll tempx[99]={};\n\t\tll tempy[99]={};\n\n\t\tif(p*q>=0){\n\t\t\tif(p>0||q>0){\n\t\t\t\t//左下から右下へ\n\t\t\t\trep(i,0,n){\n\t\t\t\t\ttempx[i]=x[idx[i]];\n\t\t\t\t\ttempy[i]=y[idx[i]];\n\t\t\t\t}\n\t\t\t}else{\n\t\t\t\t//右上から左下へ\n\t\t\t\tfor(ll i=n-1;i>=0;i--){\n\t\t\t\t\ttempx[i]=x[idx[i]];\n\t\t\t\t\ttempy[i]=y[idx[i]];\n\t\t\t\t}\n\t\t\t}\n\t\t}else{\n\t\t\tif(p<0){\n\t\t\t\t//左上から右下へ\n\t\t\t\trep(i,0,n){\n\t\t\t\t\ttempx[i]=x[idx2[i]];\n\t\t\t\t\ttempy[i]=y[idx2[i]];\n\t\t\t\t}\n\t\t\t}else{\n\t\t\t\t//右下から左上へ\n\t\t\t\tfor(ll i=n-1;i>=0;i--){\n\t\t\t\t\ttempx[i]=x[idx2[i]];\n\t\t\t\t\ttempy[i]=y[idx2[i]];\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\t\n\t\tll cnt=0;\n\t\trep(i,0,n){\n\t\t\tif(tempx[i]!=INF){\n\t\t\t\tcnt++;\n\t\t\t\tint flag=1;\n\t\t\t\tll crrx=tempx[i];\n\t\t\t\tll crry=tempy[i];\n\t\t\t\ttempx[i]=INF;\n\t\t\t\ttempy[i]=INF;\n\t\t\t\t\n\t\t\t\twhile(flag){\n\t\t\t\t\tflag=0;\n\t\t\t\t\tcrrx+=p;\n\t\t\t\t\tcrry+=q;\n\t\t\t\t\trep(j,0,n){\n\t\t\t\t\t\tif(crrx==tempx[j]&&crry==tempy[j]){\n\t\t\t\t\t\t\tflag=1;\n\t\t\t\t\t\t\ttempx[j]=INF;\n\t\t\t\t\t\t\ttempy[j]=INF;\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}\n\t\t}\n\t\tans=min(ans,cnt);\n\t}\n\tprintf(\"%lld\",ans);\n}\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere are N balls in a two-dimensional plane. The i-th ball is at coordinates (x_i, y_i).\n\nWe will collect all of these balls, by choosing two integers p and q such that p \\neq 0 or q \\neq 0 and then repeating the following operation:\n\nChoose a ball remaining in the plane and collect it. Let (a, b) be the coordinates of this ball. If we collected a ball at coordinates (a - p, b - q) in the previous operation, the cost of this operation is 0. Otherwise, including when this is the first time to do this operation, the cost of this operation is 1.\n\nFind the minimum total cost required to collect all the balls when we optimally choose p and q.\n\nConstraints\n\n1 \\leq N \\leq 50\n\n|x_i|, |y_i| \\leq 10^9\n\nIf i \\neq j, x_i \\neq x_j or y_i \\neq y_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 y_1\n:\nx_N y_N\n\nOutput\n\nPrint the minimum total cost required to collect all the balls.\n\nSample Input 1\n\n2\n1 1\n2 2\n\nSample Output 1\n\n1\n\nIf we choose p = 1, q = 1, we can collect all the balls at a cost of 1 by collecting them in the order (1, 1), (2, 2).\n\nSample Input 2\n\n3\n1 4\n4 6\n7 8\n\nSample Output 2\n\n1\n\nIf we choose p = -3, q = -2, we can collect all the balls at a cost of 1 by collecting them in the order (7, 8), (4, 6), (1, 4).\n\nSample Input 3\n\n4\n1 1\n1 2\n2 1\n2 2\n\nSample Output 3\n\n2", "sample_input": "2\n1 1\n2 2\n"}, "reference_outputs": ["1\n"], "source_document_id": "p03006", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere are N balls in a two-dimensional plane. The i-th ball is at coordinates (x_i, y_i).\n\nWe will collect all of these balls, by choosing two integers p and q such that p \\neq 0 or q \\neq 0 and then repeating the following operation:\n\nChoose a ball remaining in the plane and collect it. Let (a, b) be the coordinates of this ball. If we collected a ball at coordinates (a - p, b - q) in the previous operation, the cost of this operation is 0. Otherwise, including when this is the first time to do this operation, the cost of this operation is 1.\n\nFind the minimum total cost required to collect all the balls when we optimally choose p and q.\n\nConstraints\n\n1 \\leq N \\leq 50\n\n|x_i|, |y_i| \\leq 10^9\n\nIf i \\neq j, x_i \\neq x_j or y_i \\neq y_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 y_1\n:\nx_N y_N\n\nOutput\n\nPrint the minimum total cost required to collect all the balls.\n\nSample Input 1\n\n2\n1 1\n2 2\n\nSample Output 1\n\n1\n\nIf we choose p = 1, q = 1, we can collect all the balls at a cost of 1 by collecting them in the order (1, 1), (2, 2).\n\nSample Input 2\n\n3\n1 4\n4 6\n7 8\n\nSample Output 2\n\n1\n\nIf we choose p = -3, q = -2, we can collect all the balls at a cost of 1 by collecting them in the order (7, 8), (4, 6), (1, 4).\n\nSample Input 3\n\n4\n1 1\n1 2\n2 1\n2 2\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": 2381, "cpu_time_ms": 10, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s634838914", "group_id": "codeNet:p03008", "input_text": "#include <stdio.h>\n#include <stdlib.h>\n#include <string.h>\n#include <ctype.h>\n#define max(a, b)\t(((a) > (b)) ? (a) : (b))\t\t/* ２個の値の最大値 */\n#define min(a, b)\t(((a) < (b)) ? (a) : (b))\t\t/* ２個の値の最小値 */\n#define ENTER\t\tprintf(\"\\n\")\t\t\t\t\t/* 改行プリント */\n/********************************************************************************************************************************/\n/* main *************************************************************************************************************************/\n/********************************************************************************************************************************/\nint DEBUG = 1;\t\t\t\t\t\t\t\t\t\t/* デバッグプリント 提出時は0 */\nint main()\n{\n\tint\t\tans = 0;\n\tint\t\ti,j,N,a[3],b[3],r[3],m;\n\tint\t\tn[4] = {0};\n\tscanf(\"%d\", &N);\n\tscanf(\"%d %d %d\", &a[0], &a[1], &a[2]);\n\tscanf(\"%d %d %d\", &b[0], &b[1], &b[2]);\n\n\tn[3] = N;\n\t\n\tr[0] = b[0] - a[0];\n\tr[1] = b[1] - a[1];\n\tr[2] = b[2] - a[2];\n\n\tfor(i=0;i<3;i++) {\n\t\tif ((r[0]>r[1])&&(r[0]>r[2])) m=0;\n\t\telse if ((r[1]>r[0])&&(r[1]>r[2])) m=1;\n\t\telse m=2;\n\t\tif (r[m]<=0) continue;\n\t\tj = n[3] - (n[3]%a[m]);\n\t\tn[3] -= j;\n\t\tn[m] += j/a[m];\n\t\tr[m] = -1;\n\t}\n\t\t\n\tfor(i=0;i<3;i++) {\n\t\tj = n[i]*b[i];\n\t\tn[3] += j;\n\t\tn[i] = 0;\n\t}\n\n\tr[0] = a[0] - b[0];\n\tr[1] = a[1] - b[1];\n\tr[2] = a[2] - b[2];\n\n\tfor(i=0;i<3;i++) {\n\t\tif ((r[0]>r[1])&&(r[0]>r[2])) m=0;\n\t\telse if ((r[1]>r[0])&&(r[1]>r[2])) m=1;\n\t\telse m=2;\n\t\tif (r[m]<=0) continue;\n\t\tj = n[3] - (n[3]%b[m]);\n\t\tn[3] -= j;\n\t\tn[m] += j/b[m];\n\t\tr[m] = -1;\n\t}\n\t\t\n\tfor(i=0;i<3;i++) {\n\t\tj = n[i]*a[i];\n\t\tn[3] += j;\n\t\tn[i] = 0;\n\t}\n\n\tprintf(\"%d\\n\",n[3]);\n\n\n\treturn 0;\n}\n", "language": "C", "metadata": {"date": 1560652435, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "problem_description_relpath": "problem_descriptions/p03008.html", "problem_id": "p03008", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03008/input.txt", "sample_output_relpath": "derived/input_output/data/p03008/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03008/C/s634838914.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s634838914", "user_id": "u231667262"}, "prompt_components": {"gold_output": "46\n", "input_to_evaluate": "#include <stdio.h>\n#include <stdlib.h>\n#include <string.h>\n#include <ctype.h>\n#define max(a, b)\t(((a) > (b)) ? (a) : (b))\t\t/* ２個の値の最大値 */\n#define min(a, b)\t(((a) < (b)) ? (a) : (b))\t\t/* ２個の値の最小値 */\n#define ENTER\t\tprintf(\"\\n\")\t\t\t\t\t/* 改行プリント */\n/********************************************************************************************************************************/\n/* main *************************************************************************************************************************/\n/********************************************************************************************************************************/\nint DEBUG = 1;\t\t\t\t\t\t\t\t\t\t/* デバッグプリント 提出時は0 */\nint main()\n{\n\tint\t\tans = 0;\n\tint\t\ti,j,N,a[3],b[3],r[3],m;\n\tint\t\tn[4] = {0};\n\tscanf(\"%d\", &N);\n\tscanf(\"%d %d %d\", &a[0], &a[1], &a[2]);\n\tscanf(\"%d %d %d\", &b[0], &b[1], &b[2]);\n\n\tn[3] = N;\n\t\n\tr[0] = b[0] - a[0];\n\tr[1] = b[1] - a[1];\n\tr[2] = b[2] - a[2];\n\n\tfor(i=0;i<3;i++) {\n\t\tif ((r[0]>r[1])&&(r[0]>r[2])) m=0;\n\t\telse if ((r[1]>r[0])&&(r[1]>r[2])) m=1;\n\t\telse m=2;\n\t\tif (r[m]<=0) continue;\n\t\tj = n[3] - (n[3]%a[m]);\n\t\tn[3] -= j;\n\t\tn[m] += j/a[m];\n\t\tr[m] = -1;\n\t}\n\t\t\n\tfor(i=0;i<3;i++) {\n\t\tj = n[i]*b[i];\n\t\tn[3] += j;\n\t\tn[i] = 0;\n\t}\n\n\tr[0] = a[0] - b[0];\n\tr[1] = a[1] - b[1];\n\tr[2] = a[2] - b[2];\n\n\tfor(i=0;i<3;i++) {\n\t\tif ((r[0]>r[1])&&(r[0]>r[2])) m=0;\n\t\telse if ((r[1]>r[0])&&(r[1]>r[2])) m=1;\n\t\telse m=2;\n\t\tif (r[m]<=0) continue;\n\t\tj = n[3] - (n[3]%b[m]);\n\t\tn[3] -= j;\n\t\tn[m] += j/b[m];\n\t\tr[m] = -1;\n\t}\n\t\t\n\tfor(i=0;i<3;i++) {\n\t\tj = n[i]*a[i];\n\t\tn[3] += j;\n\t\tn[i] = 0;\n\t}\n\n\tprintf(\"%d\\n\",n[3]);\n\n\n\treturn 0;\n}\n", "problem_context": "Score : 600 points\n\nProblem Statement\n\nThe squirrel Chokudai has N acorns.\nOne day, he decides to do some trades in multiple precious metal exchanges to make more acorns.\n\nHis plan is as follows:\n\nGet out of the nest with N acorns in his hands.\n\nGo to Exchange A and do some trades.\n\nGo to Exchange B and do some trades.\n\nGo to Exchange A and do some trades.\n\nGo back to the nest.\n\nIn Exchange X (X = A, B), he can perform the following operations any integer number of times (possibly zero) in any order:\n\nLose g_{X} acorns and gain 1 gram of gold.\n\nGain g_{X} acorns and lose 1 gram of gold.\n\nLose s_{X} acorns and gain 1 gram of silver.\n\nGain s_{X} acorns and lose 1 gram of silver.\n\nLose b_{X} acorns and gain 1 gram of bronze.\n\nGain b_{X} acorns and lose 1 gram of bronze.\n\nNaturally, he cannot perform an operation that would leave him with a negative amount of acorns, gold, silver, or bronze.\n\nWhat is the maximum number of acorns that he can bring to the nest?\nNote that gold, silver, or bronze brought to the nest would be worthless because he is just a squirrel.\n\nConstraints\n\n1 \\leq N \\leq 5000\n\n1 \\leq g_{X} \\leq 5000\n\n1 \\leq s_{X} \\leq 5000\n\n1 \\leq b_{X} \\leq 5000\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\ng_A s_A b_A\ng_B s_B b_B\n\nOutput\n\nPrint the maximum number of acorns that Chokudai can bring to the nest.\n\nSample Input 1\n\n23\n1 1 1\n2 1 1\n\nSample Output 1\n\n46\n\nHe can bring 46 acorns to the nest, as follows:\n\nIn Exchange A, trade 23 acorns for 23 grams of gold. {acorns, gold, silver, bronze}={ 0,23,0,0 }\n\nIn Exchange B, trade 23 grams of gold for 46 acorns. {acorns, gold, silver, bronze}={ 46,0,0,0 }\n\nIn Exchange A, trade nothing. {acorns, gold, silver, bronze}={ 46,0,0,0 }\n\nHe cannot have 47 or more acorns, so the answer is 46.", "sample_input": "23\n1 1 1\n2 1 1\n"}, "reference_outputs": ["46\n"], "source_document_id": "p03008", "source_text": "Score : 600 points\n\nProblem Statement\n\nThe squirrel Chokudai has N acorns.\nOne day, he decides to do some trades in multiple precious metal exchanges to make more acorns.\n\nHis plan is as follows:\n\nGet out of the nest with N acorns in his hands.\n\nGo to Exchange A and do some trades.\n\nGo to Exchange B and do some trades.\n\nGo to Exchange A and do some trades.\n\nGo back to the nest.\n\nIn Exchange X (X = A, B), he can perform the following operations any integer number of times (possibly zero) in any order:\n\nLose g_{X} acorns and gain 1 gram of gold.\n\nGain g_{X} acorns and lose 1 gram of gold.\n\nLose s_{X} acorns and gain 1 gram of silver.\n\nGain s_{X} acorns and lose 1 gram of silver.\n\nLose b_{X} acorns and gain 1 gram of bronze.\n\nGain b_{X} acorns and lose 1 gram of bronze.\n\nNaturally, he cannot perform an operation that would leave him with a negative amount of acorns, gold, silver, or bronze.\n\nWhat is the maximum number of acorns that he can bring to the nest?\nNote that gold, silver, or bronze brought to the nest would be worthless because he is just a squirrel.\n\nConstraints\n\n1 \\leq N \\leq 5000\n\n1 \\leq g_{X} \\leq 5000\n\n1 \\leq s_{X} \\leq 5000\n\n1 \\leq b_{X} \\leq 5000\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\ng_A s_A b_A\ng_B s_B b_B\n\nOutput\n\nPrint the maximum number of acorns that Chokudai can bring to the nest.\n\nSample Input 1\n\n23\n1 1 1\n2 1 1\n\nSample Output 1\n\n46\n\nHe can bring 46 acorns to the nest, as follows:\n\nIn Exchange A, trade 23 acorns for 23 grams of gold. {acorns, gold, silver, bronze}={ 0,23,0,0 }\n\nIn Exchange B, trade 23 grams of gold for 46 acorns. {acorns, gold, silver, bronze}={ 46,0,0,0 }\n\nIn Exchange A, trade nothing. {acorns, gold, silver, bronze}={ 46,0,0,0 }\n\nHe cannot have 47 or more acorns, so the answer is 46.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s511123959", "group_id": "codeNet:p03011", "input_text": "#include  <stdio.h>\nint main(){\n  int a,b,c,d,e,f;\n  scanf(\"%d %d %d\",&a,&b,&c);\n  d=a+b;\n  e=b+c;\n  f=c+a;\n  if(d>e && d>f){\n    printf(\"%d\",d);\n  }\n  else if(e>d && e>f){\n    printf(\"%d\",e);\n  }\n  else{\n    printf(\"%d\",f);\n  }\n  return 0;\n}", "language": "C", "metadata": {"date": 1585349802, "filename_ext": "c", "original_language": "C (Clang 3.8.0)", "problem_description_relpath": "problem_descriptions/p03011.html", "problem_id": "p03011", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03011/input.txt", "sample_output_relpath": "derived/input_output/data/p03011/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03011/C/s511123959.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s511123959", "user_id": "u331180971"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "#include  <stdio.h>\nint main(){\n  int a,b,c,d,e,f;\n  scanf(\"%d %d %d\",&a,&b,&c);\n  d=a+b;\n  e=b+c;\n  f=c+a;\n  if(d>e && d>f){\n    printf(\"%d\",d);\n  }\n  else if(e>d && e>f){\n    printf(\"%d\",e);\n  }\n  else{\n    printf(\"%d\",f);\n  }\n  return 0;\n}", "problem_context": "Score : 100 points\n\nProblem Statement\n\nThere are three airports A, B and C, and flights between each pair of airports in both directions.\n\nA one-way flight between airports A and B takes P hours, a one-way flight between airports B and C takes Q hours, and a one-way flight between airports C and A takes R hours.\n\nConsider a route where we start at one of the airports, fly to another airport and then fly to the other airport.\n\nWhat is the minimum possible sum of the flight times?\n\nConstraints\n\n1 \\leq P,Q,R \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nP Q R\n\nOutput\n\nPrint the minimum possible sum of the flight times.\n\nSample Input 1\n\n1 3 4\n\nSample Output 1\n\n4\n\nThe sum of the flight times in the route A \\rightarrow B \\rightarrow C: 1 + 3 = 4 hours\n\nThe sum of the flight times in the route A \\rightarrow C \\rightarrow C: 4 + 3 = 7 hours\n\nThe sum of the flight times in the route B \\rightarrow A \\rightarrow C: 1 + 4 = 5 hours\n\nThe sum of the flight times in the route B \\rightarrow C \\rightarrow A: 3 + 4 = 7 hours\n\nThe sum of the flight times in the route C \\rightarrow A \\rightarrow B: 4 + 1 = 5 hours\n\nThe sum of the flight times in the route C \\rightarrow B \\rightarrow A: 3 + 1 = 4 hours\n\nThe minimum of these is 4 hours.\n\nSample Input 2\n\n3 2 3\n\nSample Output 2\n\n5", "sample_input": "1 3 4\n"}, "reference_outputs": ["4\n"], "source_document_id": "p03011", "source_text": "Score : 100 points\n\nProblem Statement\n\nThere are three airports A, B and C, and flights between each pair of airports in both directions.\n\nA one-way flight between airports A and B takes P hours, a one-way flight between airports B and C takes Q hours, and a one-way flight between airports C and A takes R hours.\n\nConsider a route where we start at one of the airports, fly to another airport and then fly to the other airport.\n\nWhat is the minimum possible sum of the flight times?\n\nConstraints\n\n1 \\leq P,Q,R \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nP Q R\n\nOutput\n\nPrint the minimum possible sum of the flight times.\n\nSample Input 1\n\n1 3 4\n\nSample Output 1\n\n4\n\nThe sum of the flight times in the route A \\rightarrow B \\rightarrow C: 1 + 3 = 4 hours\n\nThe sum of the flight times in the route A \\rightarrow C \\rightarrow C: 4 + 3 = 7 hours\n\nThe sum of the flight times in the route B \\rightarrow A \\rightarrow C: 1 + 4 = 5 hours\n\nThe sum of the flight times in the route B \\rightarrow C \\rightarrow A: 3 + 4 = 7 hours\n\nThe sum of the flight times in the route C \\rightarrow A \\rightarrow B: 4 + 1 = 5 hours\n\nThe sum of the flight times in the route C \\rightarrow B \\rightarrow A: 3 + 1 = 4 hours\n\nThe minimum of these is 4 hours.\n\nSample Input 2\n\n3 2 3\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": 242, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s365538884", "group_id": "codeNet:p03011", "input_text": "#include<stdio.h>\n#define max(a,b) a>b?a:b\nint main()\n{\n    int p,q,r;\n    int s1,s2,s3;\n    scanf(\"%d %d %d\",&p,&q,&r);\n    s1=p+q;\n    s2=p+r;\n    s2=q+r;\n    int d=max(s1,max(s2,s3));\n    printf(\"%d\",d);\n}\n\n", "language": "C", "metadata": {"date": 1573158348, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "problem_description_relpath": "problem_descriptions/p03011.html", "problem_id": "p03011", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03011/input.txt", "sample_output_relpath": "derived/input_output/data/p03011/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03011/C/s365538884.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s365538884", "user_id": "u435867227"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "#include<stdio.h>\n#define max(a,b) a>b?a:b\nint main()\n{\n    int p,q,r;\n    int s1,s2,s3;\n    scanf(\"%d %d %d\",&p,&q,&r);\n    s1=p+q;\n    s2=p+r;\n    s2=q+r;\n    int d=max(s1,max(s2,s3));\n    printf(\"%d\",d);\n}\n\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nThere are three airports A, B and C, and flights between each pair of airports in both directions.\n\nA one-way flight between airports A and B takes P hours, a one-way flight between airports B and C takes Q hours, and a one-way flight between airports C and A takes R hours.\n\nConsider a route where we start at one of the airports, fly to another airport and then fly to the other airport.\n\nWhat is the minimum possible sum of the flight times?\n\nConstraints\n\n1 \\leq P,Q,R \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nP Q R\n\nOutput\n\nPrint the minimum possible sum of the flight times.\n\nSample Input 1\n\n1 3 4\n\nSample Output 1\n\n4\n\nThe sum of the flight times in the route A \\rightarrow B \\rightarrow C: 1 + 3 = 4 hours\n\nThe sum of the flight times in the route A \\rightarrow C \\rightarrow C: 4 + 3 = 7 hours\n\nThe sum of the flight times in the route B \\rightarrow A \\rightarrow C: 1 + 4 = 5 hours\n\nThe sum of the flight times in the route B \\rightarrow C \\rightarrow A: 3 + 4 = 7 hours\n\nThe sum of the flight times in the route C \\rightarrow A \\rightarrow B: 4 + 1 = 5 hours\n\nThe sum of the flight times in the route C \\rightarrow B \\rightarrow A: 3 + 1 = 4 hours\n\nThe minimum of these is 4 hours.\n\nSample Input 2\n\n3 2 3\n\nSample Output 2\n\n5", "sample_input": "1 3 4\n"}, "reference_outputs": ["4\n"], "source_document_id": "p03011", "source_text": "Score : 100 points\n\nProblem Statement\n\nThere are three airports A, B and C, and flights between each pair of airports in both directions.\n\nA one-way flight between airports A and B takes P hours, a one-way flight between airports B and C takes Q hours, and a one-way flight between airports C and A takes R hours.\n\nConsider a route where we start at one of the airports, fly to another airport and then fly to the other airport.\n\nWhat is the minimum possible sum of the flight times?\n\nConstraints\n\n1 \\leq P,Q,R \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nP Q R\n\nOutput\n\nPrint the minimum possible sum of the flight times.\n\nSample Input 1\n\n1 3 4\n\nSample Output 1\n\n4\n\nThe sum of the flight times in the route A \\rightarrow B \\rightarrow C: 1 + 3 = 4 hours\n\nThe sum of the flight times in the route A \\rightarrow C \\rightarrow C: 4 + 3 = 7 hours\n\nThe sum of the flight times in the route B \\rightarrow A \\rightarrow C: 1 + 4 = 5 hours\n\nThe sum of the flight times in the route B \\rightarrow C \\rightarrow A: 3 + 4 = 7 hours\n\nThe sum of the flight times in the route C \\rightarrow A \\rightarrow B: 4 + 1 = 5 hours\n\nThe sum of the flight times in the route C \\rightarrow B \\rightarrow A: 3 + 1 = 4 hours\n\nThe minimum of these is 4 hours.\n\nSample Input 2\n\n3 2 3\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": 210, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s676997774", "group_id": "codeNet:p03011", "input_text": "#include<stdio.h>\n\nint main(void){\n        int P, Q, R;\n        int SUM[6] = {0};\n        int i;\n        int minimam = 0;\n\n        scanf(\"%d %d %d\", &P, &Q, &R);\n        SUM[0] = P + Q;\n        SUM[1] = R + Q;\n        SUM[2] = P + R;\n        SUM[3] = Q + R;\n        SUM[4] = R + P;\n        SUM[5] = Q + P;\n\n        minimam = SUM[0];\n        for(i=1; i< 6; i++){\n                if(minimam > SUM[i]){\n                        minimam = SUM[i];\n                }\n        }\n        printf(\"%d\\n\", minimam);\n        return 0;\n}", "language": "C", "metadata": {"date": 1560710799, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "problem_description_relpath": "problem_descriptions/p03011.html", "problem_id": "p03011", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03011/input.txt", "sample_output_relpath": "derived/input_output/data/p03011/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03011/C/s676997774.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s676997774", "user_id": "u734473573"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "#include<stdio.h>\n\nint main(void){\n        int P, Q, R;\n        int SUM[6] = {0};\n        int i;\n        int minimam = 0;\n\n        scanf(\"%d %d %d\", &P, &Q, &R);\n        SUM[0] = P + Q;\n        SUM[1] = R + Q;\n        SUM[2] = P + R;\n        SUM[3] = Q + R;\n        SUM[4] = R + P;\n        SUM[5] = Q + P;\n\n        minimam = SUM[0];\n        for(i=1; i< 6; i++){\n                if(minimam > SUM[i]){\n                        minimam = SUM[i];\n                }\n        }\n        printf(\"%d\\n\", minimam);\n        return 0;\n}", "problem_context": "Score : 100 points\n\nProblem Statement\n\nThere are three airports A, B and C, and flights between each pair of airports in both directions.\n\nA one-way flight between airports A and B takes P hours, a one-way flight between airports B and C takes Q hours, and a one-way flight between airports C and A takes R hours.\n\nConsider a route where we start at one of the airports, fly to another airport and then fly to the other airport.\n\nWhat is the minimum possible sum of the flight times?\n\nConstraints\n\n1 \\leq P,Q,R \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nP Q R\n\nOutput\n\nPrint the minimum possible sum of the flight times.\n\nSample Input 1\n\n1 3 4\n\nSample Output 1\n\n4\n\nThe sum of the flight times in the route A \\rightarrow B \\rightarrow C: 1 + 3 = 4 hours\n\nThe sum of the flight times in the route A \\rightarrow C \\rightarrow C: 4 + 3 = 7 hours\n\nThe sum of the flight times in the route B \\rightarrow A \\rightarrow C: 1 + 4 = 5 hours\n\nThe sum of the flight times in the route B \\rightarrow C \\rightarrow A: 3 + 4 = 7 hours\n\nThe sum of the flight times in the route C \\rightarrow A \\rightarrow B: 4 + 1 = 5 hours\n\nThe sum of the flight times in the route C \\rightarrow B \\rightarrow A: 3 + 1 = 4 hours\n\nThe minimum of these is 4 hours.\n\nSample Input 2\n\n3 2 3\n\nSample Output 2\n\n5", "sample_input": "1 3 4\n"}, "reference_outputs": ["4\n"], "source_document_id": "p03011", "source_text": "Score : 100 points\n\nProblem Statement\n\nThere are three airports A, B and C, and flights between each pair of airports in both directions.\n\nA one-way flight between airports A and B takes P hours, a one-way flight between airports B and C takes Q hours, and a one-way flight between airports C and A takes R hours.\n\nConsider a route where we start at one of the airports, fly to another airport and then fly to the other airport.\n\nWhat is the minimum possible sum of the flight times?\n\nConstraints\n\n1 \\leq P,Q,R \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nP Q R\n\nOutput\n\nPrint the minimum possible sum of the flight times.\n\nSample Input 1\n\n1 3 4\n\nSample Output 1\n\n4\n\nThe sum of the flight times in the route A \\rightarrow B \\rightarrow C: 1 + 3 = 4 hours\n\nThe sum of the flight times in the route A \\rightarrow C \\rightarrow C: 4 + 3 = 7 hours\n\nThe sum of the flight times in the route B \\rightarrow A \\rightarrow C: 1 + 4 = 5 hours\n\nThe sum of the flight times in the route B \\rightarrow C \\rightarrow A: 3 + 4 = 7 hours\n\nThe sum of the flight times in the route C \\rightarrow A \\rightarrow B: 4 + 1 = 5 hours\n\nThe sum of the flight times in the route C \\rightarrow B \\rightarrow A: 3 + 1 = 4 hours\n\nThe minimum of these is 4 hours.\n\nSample Input 2\n\n3 2 3\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": 522, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s362608738", "group_id": "codeNet:p03011", "input_text": "#include<stdio.h>\nint main()\n{\n  int p,q,r,t1,t2,t3,min;\n  scanf(\"%d%d%d\", &p, &q, &r);\n  t1 = p+q; min = t1;\n  t2 = q+r; if (min>t2) min = t2;\n  t3 = r+p; if (min>t3) min = t3;\n  printf(\"%d\", min);\n  return 0;\n}", "language": "C", "metadata": {"date": 1560175918, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "problem_description_relpath": "problem_descriptions/p03011.html", "problem_id": "p03011", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03011/input.txt", "sample_output_relpath": "derived/input_output/data/p03011/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03011/C/s362608738.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s362608738", "user_id": "u244011526"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "#include<stdio.h>\nint main()\n{\n  int p,q,r,t1,t2,t3,min;\n  scanf(\"%d%d%d\", &p, &q, &r);\n  t1 = p+q; min = t1;\n  t2 = q+r; if (min>t2) min = t2;\n  t3 = r+p; if (min>t3) min = t3;\n  printf(\"%d\", min);\n  return 0;\n}", "problem_context": "Score : 100 points\n\nProblem Statement\n\nThere are three airports A, B and C, and flights between each pair of airports in both directions.\n\nA one-way flight between airports A and B takes P hours, a one-way flight between airports B and C takes Q hours, and a one-way flight between airports C and A takes R hours.\n\nConsider a route where we start at one of the airports, fly to another airport and then fly to the other airport.\n\nWhat is the minimum possible sum of the flight times?\n\nConstraints\n\n1 \\leq P,Q,R \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nP Q R\n\nOutput\n\nPrint the minimum possible sum of the flight times.\n\nSample Input 1\n\n1 3 4\n\nSample Output 1\n\n4\n\nThe sum of the flight times in the route A \\rightarrow B \\rightarrow C: 1 + 3 = 4 hours\n\nThe sum of the flight times in the route A \\rightarrow C \\rightarrow C: 4 + 3 = 7 hours\n\nThe sum of the flight times in the route B \\rightarrow A \\rightarrow C: 1 + 4 = 5 hours\n\nThe sum of the flight times in the route B \\rightarrow C \\rightarrow A: 3 + 4 = 7 hours\n\nThe sum of the flight times in the route C \\rightarrow A \\rightarrow B: 4 + 1 = 5 hours\n\nThe sum of the flight times in the route C \\rightarrow B \\rightarrow A: 3 + 1 = 4 hours\n\nThe minimum of these is 4 hours.\n\nSample Input 2\n\n3 2 3\n\nSample Output 2\n\n5", "sample_input": "1 3 4\n"}, "reference_outputs": ["4\n"], "source_document_id": "p03011", "source_text": "Score : 100 points\n\nProblem Statement\n\nThere are three airports A, B and C, and flights between each pair of airports in both directions.\n\nA one-way flight between airports A and B takes P hours, a one-way flight between airports B and C takes Q hours, and a one-way flight between airports C and A takes R hours.\n\nConsider a route where we start at one of the airports, fly to another airport and then fly to the other airport.\n\nWhat is the minimum possible sum of the flight times?\n\nConstraints\n\n1 \\leq P,Q,R \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nP Q R\n\nOutput\n\nPrint the minimum possible sum of the flight times.\n\nSample Input 1\n\n1 3 4\n\nSample Output 1\n\n4\n\nThe sum of the flight times in the route A \\rightarrow B \\rightarrow C: 1 + 3 = 4 hours\n\nThe sum of the flight times in the route A \\rightarrow C \\rightarrow C: 4 + 3 = 7 hours\n\nThe sum of the flight times in the route B \\rightarrow A \\rightarrow C: 1 + 4 = 5 hours\n\nThe sum of the flight times in the route B \\rightarrow C \\rightarrow A: 3 + 4 = 7 hours\n\nThe sum of the flight times in the route C \\rightarrow A \\rightarrow B: 4 + 1 = 5 hours\n\nThe sum of the flight times in the route C \\rightarrow B \\rightarrow A: 3 + 1 = 4 hours\n\nThe minimum of these is 4 hours.\n\nSample Input 2\n\n3 2 3\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": 212, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s075383649", "group_id": "codeNet:p03011", "input_text": "#include<stdio.h>\nint main(void){\n    int p,q,r,min;\n    scanf(\"%d\",&p);\n    scanf(\"%d\",&q);\n    scanf(\"%d\",&r);\n    min=p+q;\n    if(p+r<min){\n        min=p+r;\n    }\n    else if(q+p<min){\n        min=q+p;\n    }\n    else if(q+r<min){\n        min=q+r;\n    }\n    else if(r+p<min){\n        min=r+p;\n    }\n    else if(r+q<min){\n        min=r+q;\n    }\n        printf(\"%d\",min);\n    return 0;\n}", "language": "C", "metadata": {"date": 1560129793, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "problem_description_relpath": "problem_descriptions/p03011.html", "problem_id": "p03011", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03011/input.txt", "sample_output_relpath": "derived/input_output/data/p03011/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03011/C/s075383649.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s075383649", "user_id": "u038913694"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "#include<stdio.h>\nint main(void){\n    int p,q,r,min;\n    scanf(\"%d\",&p);\n    scanf(\"%d\",&q);\n    scanf(\"%d\",&r);\n    min=p+q;\n    if(p+r<min){\n        min=p+r;\n    }\n    else if(q+p<min){\n        min=q+p;\n    }\n    else if(q+r<min){\n        min=q+r;\n    }\n    else if(r+p<min){\n        min=r+p;\n    }\n    else if(r+q<min){\n        min=r+q;\n    }\n        printf(\"%d\",min);\n    return 0;\n}", "problem_context": "Score : 100 points\n\nProblem Statement\n\nThere are three airports A, B and C, and flights between each pair of airports in both directions.\n\nA one-way flight between airports A and B takes P hours, a one-way flight between airports B and C takes Q hours, and a one-way flight between airports C and A takes R hours.\n\nConsider a route where we start at one of the airports, fly to another airport and then fly to the other airport.\n\nWhat is the minimum possible sum of the flight times?\n\nConstraints\n\n1 \\leq P,Q,R \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nP Q R\n\nOutput\n\nPrint the minimum possible sum of the flight times.\n\nSample Input 1\n\n1 3 4\n\nSample Output 1\n\n4\n\nThe sum of the flight times in the route A \\rightarrow B \\rightarrow C: 1 + 3 = 4 hours\n\nThe sum of the flight times in the route A \\rightarrow C \\rightarrow C: 4 + 3 = 7 hours\n\nThe sum of the flight times in the route B \\rightarrow A \\rightarrow C: 1 + 4 = 5 hours\n\nThe sum of the flight times in the route B \\rightarrow C \\rightarrow A: 3 + 4 = 7 hours\n\nThe sum of the flight times in the route C \\rightarrow A \\rightarrow B: 4 + 1 = 5 hours\n\nThe sum of the flight times in the route C \\rightarrow B \\rightarrow A: 3 + 1 = 4 hours\n\nThe minimum of these is 4 hours.\n\nSample Input 2\n\n3 2 3\n\nSample Output 2\n\n5", "sample_input": "1 3 4\n"}, "reference_outputs": ["4\n"], "source_document_id": "p03011", "source_text": "Score : 100 points\n\nProblem Statement\n\nThere are three airports A, B and C, and flights between each pair of airports in both directions.\n\nA one-way flight between airports A and B takes P hours, a one-way flight between airports B and C takes Q hours, and a one-way flight between airports C and A takes R hours.\n\nConsider a route where we start at one of the airports, fly to another airport and then fly to the other airport.\n\nWhat is the minimum possible sum of the flight times?\n\nConstraints\n\n1 \\leq P,Q,R \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nP Q R\n\nOutput\n\nPrint the minimum possible sum of the flight times.\n\nSample Input 1\n\n1 3 4\n\nSample Output 1\n\n4\n\nThe sum of the flight times in the route A \\rightarrow B \\rightarrow C: 1 + 3 = 4 hours\n\nThe sum of the flight times in the route A \\rightarrow C \\rightarrow C: 4 + 3 = 7 hours\n\nThe sum of the flight times in the route B \\rightarrow A \\rightarrow C: 1 + 4 = 5 hours\n\nThe sum of the flight times in the route B \\rightarrow C \\rightarrow A: 3 + 4 = 7 hours\n\nThe sum of the flight times in the route C \\rightarrow A \\rightarrow B: 4 + 1 = 5 hours\n\nThe sum of the flight times in the route C \\rightarrow B \\rightarrow A: 3 + 1 = 4 hours\n\nThe minimum of these is 4 hours.\n\nSample Input 2\n\n3 2 3\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": 387, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s943850592", "group_id": "codeNet:p03011", "input_text": "#include<stdio.h>\nint main()\n{\n\tint P, Q, R;\n\tscanf(\"%d %d %d\", &P,&Q, &R);\n\t\n\tint a, b, c;\n\t\n\tif(P <= Q && Q <= R){\n\t\ta=P;\n\t\tb=Q;\n\t\tc=R;\n\t}\n\t\n\telse if (P > Q && P <= R){\n\t\ta = Q;\n\t\tb = P;\n\t\tc = R;\n\t}\n\t\n\telse if (P <= R && Q > R){\n\t\ta = P;\n\t\tb = R;\n\t\tc =Q;\n\t}\n\t\n\telse if (P <= Q && R < P){\n\t\ta = R;\n\t\tb = P;\n\t\tc = Q;\n\t}\n\t\n\telse if (P > Q && P > R){\n\t\ta = Q;\n\t\tb = R;\n\t\tc = P;\n\t}\n\t\n\telse{\n\t\ta = R;\n\t\tb = Q;\n\t\tc = P;\n\t}\n\t\n\t\n\tprintf(\"%d\", a+b);\n\t\n\treturn 0;\n\t\n}", "language": "C", "metadata": {"date": 1560129188, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "problem_description_relpath": "problem_descriptions/p03011.html", "problem_id": "p03011", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03011/input.txt", "sample_output_relpath": "derived/input_output/data/p03011/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03011/C/s943850592.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s943850592", "user_id": "u374372942"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "#include<stdio.h>\nint main()\n{\n\tint P, Q, R;\n\tscanf(\"%d %d %d\", &P,&Q, &R);\n\t\n\tint a, b, c;\n\t\n\tif(P <= Q && Q <= R){\n\t\ta=P;\n\t\tb=Q;\n\t\tc=R;\n\t}\n\t\n\telse if (P > Q && P <= R){\n\t\ta = Q;\n\t\tb = P;\n\t\tc = R;\n\t}\n\t\n\telse if (P <= R && Q > R){\n\t\ta = P;\n\t\tb = R;\n\t\tc =Q;\n\t}\n\t\n\telse if (P <= Q && R < P){\n\t\ta = R;\n\t\tb = P;\n\t\tc = Q;\n\t}\n\t\n\telse if (P > Q && P > R){\n\t\ta = Q;\n\t\tb = R;\n\t\tc = P;\n\t}\n\t\n\telse{\n\t\ta = R;\n\t\tb = Q;\n\t\tc = P;\n\t}\n\t\n\t\n\tprintf(\"%d\", a+b);\n\t\n\treturn 0;\n\t\n}", "problem_context": "Score : 100 points\n\nProblem Statement\n\nThere are three airports A, B and C, and flights between each pair of airports in both directions.\n\nA one-way flight between airports A and B takes P hours, a one-way flight between airports B and C takes Q hours, and a one-way flight between airports C and A takes R hours.\n\nConsider a route where we start at one of the airports, fly to another airport and then fly to the other airport.\n\nWhat is the minimum possible sum of the flight times?\n\nConstraints\n\n1 \\leq P,Q,R \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nP Q R\n\nOutput\n\nPrint the minimum possible sum of the flight times.\n\nSample Input 1\n\n1 3 4\n\nSample Output 1\n\n4\n\nThe sum of the flight times in the route A \\rightarrow B \\rightarrow C: 1 + 3 = 4 hours\n\nThe sum of the flight times in the route A \\rightarrow C \\rightarrow C: 4 + 3 = 7 hours\n\nThe sum of the flight times in the route B \\rightarrow A \\rightarrow C: 1 + 4 = 5 hours\n\nThe sum of the flight times in the route B \\rightarrow C \\rightarrow A: 3 + 4 = 7 hours\n\nThe sum of the flight times in the route C \\rightarrow A \\rightarrow B: 4 + 1 = 5 hours\n\nThe sum of the flight times in the route C \\rightarrow B \\rightarrow A: 3 + 1 = 4 hours\n\nThe minimum of these is 4 hours.\n\nSample Input 2\n\n3 2 3\n\nSample Output 2\n\n5", "sample_input": "1 3 4\n"}, "reference_outputs": ["4\n"], "source_document_id": "p03011", "source_text": "Score : 100 points\n\nProblem Statement\n\nThere are three airports A, B and C, and flights between each pair of airports in both directions.\n\nA one-way flight between airports A and B takes P hours, a one-way flight between airports B and C takes Q hours, and a one-way flight between airports C and A takes R hours.\n\nConsider a route where we start at one of the airports, fly to another airport and then fly to the other airport.\n\nWhat is the minimum possible sum of the flight times?\n\nConstraints\n\n1 \\leq P,Q,R \\leq 100\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nP Q R\n\nOutput\n\nPrint the minimum possible sum of the flight times.\n\nSample Input 1\n\n1 3 4\n\nSample Output 1\n\n4\n\nThe sum of the flight times in the route A \\rightarrow B \\rightarrow C: 1 + 3 = 4 hours\n\nThe sum of the flight times in the route A \\rightarrow C \\rightarrow C: 4 + 3 = 7 hours\n\nThe sum of the flight times in the route B \\rightarrow A \\rightarrow C: 1 + 4 = 5 hours\n\nThe sum of the flight times in the route B \\rightarrow C \\rightarrow A: 3 + 4 = 7 hours\n\nThe sum of the flight times in the route C \\rightarrow A \\rightarrow B: 4 + 1 = 5 hours\n\nThe sum of the flight times in the route C \\rightarrow B \\rightarrow A: 3 + 1 = 4 hours\n\nThe minimum of these is 4 hours.\n\nSample Input 2\n\n3 2 3\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": 458, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s068305714", "group_id": "codeNet:p03012", "input_text": "#include<stdio.h>\n#include<stdlib.h>\nint cmp(const void *a,const void *b){\n  return *(int*)a - *(int*)b;\n}\nint min(int a,int b){\n  if(a>b) return b;\n  return a;\n}\n\nint main(void){\n  int n,i,j,s1,s2,tmp,ans=1e9;\n  scanf(\"%d\",&n);\n  int a[n];\n  for(i=0;i<n;i++) scanf(\"%d\",&a[i]);\n  //for(i=0;i<n;i++) printf(\"%d\\n\",a[i]);\n  for(i=0;i<n-1;i++){\n    s1=0;\n    s2=0;\n    for(j=0;j<=i;j++) s1+=a[j];\n    for(j=i+1;j<n;j++) s2+=a[j];\n    tmp = abs(s1-s2);\n    ans = min(ans,tmp);\n  }\n  printf(\"%d\\n\",ans);\n  return 0;\n}", "language": "C", "metadata": {"date": 1561219006, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "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/C/s068305714.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s068305714", "user_id": "u992736202"}, "prompt_components": {"gold_output": "0\n", "input_to_evaluate": "#include<stdio.h>\n#include<stdlib.h>\nint cmp(const void *a,const void *b){\n  return *(int*)a - *(int*)b;\n}\nint min(int a,int b){\n  if(a>b) return b;\n  return a;\n}\n\nint main(void){\n  int n,i,j,s1,s2,tmp,ans=1e9;\n  scanf(\"%d\",&n);\n  int a[n];\n  for(i=0;i<n;i++) scanf(\"%d\",&a[i]);\n  //for(i=0;i<n;i++) printf(\"%d\\n\",a[i]);\n  for(i=0;i<n-1;i++){\n    s1=0;\n    s2=0;\n    for(j=0;j<=i;j++) s1+=a[j];\n    for(j=i+1;j<n;j++) s2+=a[j];\n    tmp = abs(s1-s2);\n    ans = min(ans,tmp);\n  }\n  printf(\"%d\\n\",ans);\n  return 0;\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": 513, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s586490025", "group_id": "codeNet:p03014", "input_text": "S['= r'],m[4]['= r'],z,d[4]={0,-2},k,i;f(i){m[k][i]=S[i]+47?0:m[k][i]?:1+f(d[k]-~i);}main(t){for(scanf(\"%*d%d \",d),d[2]=-*d-2;S[++i-~*d]=~getchar(););for(;--i;z=fmax(z,1-t))for(t=k=4;k--;)t-=f(i-~*d);printf(\"%d\",z);}", "language": "C", "metadata": {"date": 1560241289, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "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/C/s586490025.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s586490025", "user_id": "u657913472"}, "prompt_components": {"gold_output": "8\n", "input_to_evaluate": "S['= r'],m[4]['= r'],z,d[4]={0,-2},k,i;f(i){m[k][i]=S[i]+47?0:m[k][i]?:1+f(d[k]-~i);}main(t){for(scanf(\"%*d%d \",d),d[2]=-*d-2;S[++i-~*d]=~getchar(););for(;--i;z=fmax(z,1-t))for(t=k=4;k--;)t-=f(i-~*d);printf(\"%d\",z);}", "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": 216, "cpu_time_ms": 212, "memory_kb": 78464}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s923669433", "group_id": "codeNet:p03014", "input_text": "# include <stdio.h>\n# include <string.h>\n# include <stdlib.h>\n\nint max(int a, int b)\n{\n    return a >= b ? a : b;\n}\n\nint main()\n{\n    int H, W;\n    scanf(\"%d%d\", &H, &W);\n\n    char map[H][W];\n    for (int i = 0; i < H; ++i)\n    {\n        scanf(\"%s\", map[i]);\n    }\n\n    int ans[H][W];\n\n    for (int i = 0; i < H; ++i)\n    {\n        int ct = 0;\n        int tmp = 0;\n        for (int j = 0; j < W; ++j)\n        {\n            if (map[i][j] == '.')\n            {\n                if (j != W-1) ct++;\n                else\n                {\n                    ct++;\n                    for (int k = tmp+1; k < W; ++k)\n                    {\n                        ans[i][k] = ct;\n                    }\n                }\n            }\n            else\n            {\n                ans[i][j] = 0;\n                int buf = tmp + 1;\n                if (j == tmp + 1) buf = j;\n                if (tmp == 0) buf = 0;\n\n                for (int k = buf; k < j; ++k)\n                {\n                    ans[i][k] = ct;\n                }\n                ct = 0;\n                tmp = j;\n            }\n        }\n    }\n\n    int re = 0;\n\n    for (int i = 0; i < W; ++i)\n    {\n        int ct = 0;\n        int tmp = 0;\n        for (int j = 0; j < H; ++j)\n        {\n            if (map[j][i] == '.')\n            {\n                if (j != H-1) ct++;\n                else\n                {\n                    ct++;\n                    for (int k = tmp+1; k < H; ++k)\n                    {\n                        re = max(re, ans[k][i] + ct);\n                    }\n                }\n            }\n            else\n            {\n                ans[j][i] = 0;\n                int buf = tmp + 1;\n                if (j == tmp + 1) buf = j;\n                if (tmp == 0) buf = 0;\n\n                for (int k = buf; k < j; ++k)\n                {\n                    re = max(re, ans[k][i] + ct);\n                }\n                ct = 0;\n                tmp = j;\n            }\n        }\n    }\n\n    printf(\"%d\", re-1);\n\n    return 0;\n}", "language": "C", "metadata": {"date": 1560134434, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "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/C/s923669433.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s923669433", "user_id": "u442030035"}, "prompt_components": {"gold_output": "8\n", "input_to_evaluate": "# include <stdio.h>\n# include <string.h>\n# include <stdlib.h>\n\nint max(int a, int b)\n{\n    return a >= b ? a : b;\n}\n\nint main()\n{\n    int H, W;\n    scanf(\"%d%d\", &H, &W);\n\n    char map[H][W];\n    for (int i = 0; i < H; ++i)\n    {\n        scanf(\"%s\", map[i]);\n    }\n\n    int ans[H][W];\n\n    for (int i = 0; i < H; ++i)\n    {\n        int ct = 0;\n        int tmp = 0;\n        for (int j = 0; j < W; ++j)\n        {\n            if (map[i][j] == '.')\n            {\n                if (j != W-1) ct++;\n                else\n                {\n                    ct++;\n                    for (int k = tmp+1; k < W; ++k)\n                    {\n                        ans[i][k] = ct;\n                    }\n                }\n            }\n            else\n            {\n                ans[i][j] = 0;\n                int buf = tmp + 1;\n                if (j == tmp + 1) buf = j;\n                if (tmp == 0) buf = 0;\n\n                for (int k = buf; k < j; ++k)\n                {\n                    ans[i][k] = ct;\n                }\n                ct = 0;\n                tmp = j;\n            }\n        }\n    }\n\n    int re = 0;\n\n    for (int i = 0; i < W; ++i)\n    {\n        int ct = 0;\n        int tmp = 0;\n        for (int j = 0; j < H; ++j)\n        {\n            if (map[j][i] == '.')\n            {\n                if (j != H-1) ct++;\n                else\n                {\n                    ct++;\n                    for (int k = tmp+1; k < H; ++k)\n                    {\n                        re = max(re, ans[k][i] + ct);\n                    }\n                }\n            }\n            else\n            {\n                ans[j][i] = 0;\n                int buf = tmp + 1;\n                if (j == tmp + 1) buf = j;\n                if (tmp == 0) buf = 0;\n\n                for (int k = buf; k < j; ++k)\n                {\n                    re = max(re, ans[k][i] + ct);\n                }\n                ct = 0;\n                tmp = j;\n            }\n        }\n    }\n\n    printf(\"%d\", re-1);\n\n    return 0;\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": 2011, "cpu_time_ms": 82, "memory_kb": 19712}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s084489969", "group_id": "codeNet:p03017", "input_text": "#include<stdio.h>\n\nint main() {\n\tint i, j, k;\n\tint\tn, m, h, w, g, a, b, c, d;\n\tint f = 0;\n\tchar s[2100000];\n\n\n\tscanf(\"%d %d %d %d %d\", &n, &a, &b, &c, &d);\n\n\tscanf(\"%s\", s);\n\n\n\tfor (i = a;i < n;i++) {\n\t\tif (s[i] == '#') {\n\t\t\tif (s[i + 1] == '#') {\n\t\t\t\tif (i > a) {\n\t\t\t\t\tif (i < c) {\n\t\t\t\t\t\tf = 1;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tif (i > b) {\n\t\t\t\t\tif (i < d) {\n\t\t\t\t\t\tf = 1;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n\tif (d < c&&f==0) {\n\t\tf = 1;\n\t\tfor (i = b;i < n;i++) {\n\t\t\tif (s[i] == '.'&&i != d - 1) {\n\t\t\t\tif (s[i + 1] == '.') {\n\t\t\t\t\tif (s[i + 2] == '.'&&i != d - 1) {\n\t\t\t\t\t\tf = 0;\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n\n\n\n\tif (f == 0) {\n\t\tprintf(\"Yes\");\n\t}\n\telse {\n\t\tprintf(\"No\");\n\t}\n\n\n\treturn 0;\n}", "language": "C", "metadata": {"date": 1559529869, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "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/C/s084489969.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s084489969", "user_id": "u133959444"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "#include<stdio.h>\n\nint main() {\n\tint i, j, k;\n\tint\tn, m, h, w, g, a, b, c, d;\n\tint f = 0;\n\tchar s[2100000];\n\n\n\tscanf(\"%d %d %d %d %d\", &n, &a, &b, &c, &d);\n\n\tscanf(\"%s\", s);\n\n\n\tfor (i = a;i < n;i++) {\n\t\tif (s[i] == '#') {\n\t\t\tif (s[i + 1] == '#') {\n\t\t\t\tif (i > a) {\n\t\t\t\t\tif (i < c) {\n\t\t\t\t\t\tf = 1;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tif (i > b) {\n\t\t\t\t\tif (i < d) {\n\t\t\t\t\t\tf = 1;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n\tif (d < c&&f==0) {\n\t\tf = 1;\n\t\tfor (i = b;i < n;i++) {\n\t\t\tif (s[i] == '.'&&i != d - 1) {\n\t\t\t\tif (s[i + 1] == '.') {\n\t\t\t\t\tif (s[i + 2] == '.'&&i != d - 1) {\n\t\t\t\t\t\tf = 0;\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n\n\n\n\tif (f == 0) {\n\t\tprintf(\"Yes\");\n\t}\n\telse {\n\t\tprintf(\"No\");\n\t}\n\n\n\treturn 0;\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": 670, "cpu_time_ms": 2, "memory_kb": 384}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s396248731", "group_id": "codeNet:p03024", "input_text": "#include <stdio.h>\n\nint main(){\n  int ret,win = 0,lose = 0,num = 0;\n  char c;\n  while(1){\n    ret = scanf(\"%c\", &c);\n    if(ret == EOF || c == '\\n') break;\n    else if(c == 'o') win++;\n    else if(c == 'x') lose++;\n    num++;\n  }\n  int flag = 0;\n  if(lose >= 8) flag = 1;\n  if(flag == 0) printf(\"YES\\n\");\n  else printf(\"NO\\n\");\n  return 0;\n}", "language": "C", "metadata": {"date": 1559437698, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "problem_description_relpath": "problem_descriptions/p03024.html", "problem_id": "p03024", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03024/input.txt", "sample_output_relpath": "derived/input_output/data/p03024/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03024/C/s396248731.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s396248731", "user_id": "u245851904"}, "prompt_components": {"gold_output": "YES\n", "input_to_evaluate": "#include <stdio.h>\n\nint main(){\n  int ret,win = 0,lose = 0,num = 0;\n  char c;\n  while(1){\n    ret = scanf(\"%c\", &c);\n    if(ret == EOF || c == '\\n') break;\n    else if(c == 'o') win++;\n    else if(c == 'x') lose++;\n    num++;\n  }\n  int flag = 0;\n  if(lose >= 8) flag = 1;\n  if(flag == 0) printf(\"YES\\n\");\n  else printf(\"NO\\n\");\n  return 0;\n}", "problem_context": "Score : 200 points\n\nProblem Statement\n\nTakahashi is competing in a sumo tournament.\nThe tournament lasts for 15 days, during which he performs in one match per day.\nIf he wins 8 or more matches, he can also participate in the next tournament.\n\nThe matches for the first k days have finished.\nYou are given the results of Takahashi's matches as a string S consisting of o and x.\nIf the i-th character in S is o, it means that Takahashi won the match on the i-th day; if that character is x, it means that Takahashi lost the match on the i-th day.\n\nPrint YES if there is a possibility that Takahashi can participate in the next tournament, and print NO if there is no such possibility.\n\nConstraints\n\n1 \\leq k \\leq 15\n\nS is a string of length k consisting of o and x.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint YES if there is a possibility that Takahashi can participate in the next tournament, and print NO otherwise.\n\nSample Input 1\n\noxoxoxoxoxoxox\n\nSample Output 1\n\nYES\n\nTakahashi has 7 wins and 7 losses before the last match. If he wins that match, he will have 8 wins.\n\nSample Input 2\n\nxxxxxxxx\n\nSample Output 2\n\nNO", "sample_input": "oxoxoxoxoxoxox\n"}, "reference_outputs": ["YES\n"], "source_document_id": "p03024", "source_text": "Score : 200 points\n\nProblem Statement\n\nTakahashi is competing in a sumo tournament.\nThe tournament lasts for 15 days, during which he performs in one match per day.\nIf he wins 8 or more matches, he can also participate in the next tournament.\n\nThe matches for the first k days have finished.\nYou are given the results of Takahashi's matches as a string S consisting of o and x.\nIf the i-th character in S is o, it means that Takahashi won the match on the i-th day; if that character is x, it means that Takahashi lost the match on the i-th day.\n\nPrint YES if there is a possibility that Takahashi can participate in the next tournament, and print NO if there is no such possibility.\n\nConstraints\n\n1 \\leq k \\leq 15\n\nS is a string of length k consisting of o and x.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint YES if there is a possibility that Takahashi can participate in the next tournament, and print NO otherwise.\n\nSample Input 1\n\noxoxoxoxoxoxox\n\nSample Output 1\n\nYES\n\nTakahashi has 7 wins and 7 losses before the last match. If he wins that match, he will have 8 wins.\n\nSample Input 2\n\nxxxxxxxx\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": 341, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s684608544", "group_id": "codeNet:p03029", "input_text": "#include<stdio.h>\nint main(){\n    int a,p;\n    scanf(\"%d %d\",&a,&p);\n    printf(\"%d\\n\",((a*3)+p)/2);\nreturn 0;\n}\n\n", "language": "C", "metadata": {"date": 1584344039, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "problem_description_relpath": "problem_descriptions/p03029.html", "problem_id": "p03029", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03029/input.txt", "sample_output_relpath": "derived/input_output/data/p03029/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03029/C/s684608544.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s684608544", "user_id": "u353919145"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "#include<stdio.h>\nint main(){\n    int a,p;\n    scanf(\"%d %d\",&a,&p);\n    printf(\"%d\\n\",((a*3)+p)/2);\nreturn 0;\n}\n\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nWe have A apples and P pieces of apple.\n\nWe can cut an apple into three pieces of apple, and make one apple pie by simmering two pieces of apple in a pan.\n\nFind the maximum number of apple pies we can make with what we have now.\n\nConstraints\n\nAll values in input are integers.\n\n0 \\leq A, P \\leq 100\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA P\n\nOutput\n\nPrint the maximum number of apple pies we can make with what we have.\n\nSample Input 1\n\n1 3\n\nSample Output 1\n\n3\n\nWe can first make one apple pie by simmering two of the three pieces of apple. Then, we can make two more by simmering the remaining piece and three more pieces obtained by cutting the whole apple.\n\nSample Input 2\n\n0 1\n\nSample Output 2\n\n0\n\nWe cannot make an apple pie in this case, unfortunately.\n\nSample Input 3\n\n32 21\n\nSample Output 3\n\n58", "sample_input": "1 3\n"}, "reference_outputs": ["3\n"], "source_document_id": "p03029", "source_text": "Score : 100 points\n\nProblem Statement\n\nWe have A apples and P pieces of apple.\n\nWe can cut an apple into three pieces of apple, and make one apple pie by simmering two pieces of apple in a pan.\n\nFind the maximum number of apple pies we can make with what we have now.\n\nConstraints\n\nAll values in input are integers.\n\n0 \\leq A, P \\leq 100\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA P\n\nOutput\n\nPrint the maximum number of apple pies we can make with what we have.\n\nSample Input 1\n\n1 3\n\nSample Output 1\n\n3\n\nWe can first make one apple pie by simmering two of the three pieces of apple. Then, we can make two more by simmering the remaining piece and three more pieces obtained by cutting the whole apple.\n\nSample Input 2\n\n0 1\n\nSample Output 2\n\n0\n\nWe cannot make an apple pie in this case, unfortunately.\n\nSample Input 3\n\n32 21\n\nSample Output 3\n\n58", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 114, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s753333453", "group_id": "codeNet:p03029", "input_text": "#include<stdio.h>\nint main(){\n\tint a,p;\n\tscanf(\"%d %d\",&a,&p);\n\tprintf(\"%d\\n\",(3*a+p)/2);\n}", "language": "C", "metadata": {"date": 1558919217, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "problem_description_relpath": "problem_descriptions/p03029.html", "problem_id": "p03029", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03029/input.txt", "sample_output_relpath": "derived/input_output/data/p03029/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03029/C/s753333453.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s753333453", "user_id": "u538296348"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "#include<stdio.h>\nint main(){\n\tint a,p;\n\tscanf(\"%d %d\",&a,&p);\n\tprintf(\"%d\\n\",(3*a+p)/2);\n}", "problem_context": "Score : 100 points\n\nProblem Statement\n\nWe have A apples and P pieces of apple.\n\nWe can cut an apple into three pieces of apple, and make one apple pie by simmering two pieces of apple in a pan.\n\nFind the maximum number of apple pies we can make with what we have now.\n\nConstraints\n\nAll values in input are integers.\n\n0 \\leq A, P \\leq 100\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA P\n\nOutput\n\nPrint the maximum number of apple pies we can make with what we have.\n\nSample Input 1\n\n1 3\n\nSample Output 1\n\n3\n\nWe can first make one apple pie by simmering two of the three pieces of apple. Then, we can make two more by simmering the remaining piece and three more pieces obtained by cutting the whole apple.\n\nSample Input 2\n\n0 1\n\nSample Output 2\n\n0\n\nWe cannot make an apple pie in this case, unfortunately.\n\nSample Input 3\n\n32 21\n\nSample Output 3\n\n58", "sample_input": "1 3\n"}, "reference_outputs": ["3\n"], "source_document_id": "p03029", "source_text": "Score : 100 points\n\nProblem Statement\n\nWe have A apples and P pieces of apple.\n\nWe can cut an apple into three pieces of apple, and make one apple pie by simmering two pieces of apple in a pan.\n\nFind the maximum number of apple pies we can make with what we have now.\n\nConstraints\n\nAll values in input are integers.\n\n0 \\leq A, P \\leq 100\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA P\n\nOutput\n\nPrint the maximum number of apple pies we can make with what we have.\n\nSample Input 1\n\n1 3\n\nSample Output 1\n\n3\n\nWe can first make one apple pie by simmering two of the three pieces of apple. Then, we can make two more by simmering the remaining piece and three more pieces obtained by cutting the whole apple.\n\nSample Input 2\n\n0 1\n\nSample Output 2\n\n0\n\nWe cannot make an apple pie in this case, unfortunately.\n\nSample Input 3\n\n32 21\n\nSample Output 3\n\n58", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 91, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s255363795", "group_id": "codeNet:p03029", "input_text": "#include <stdio.h>\n#include <stdlib.h>\n#include <string.h>\n#include <math.h>\nint compare_int(const void *a, const void *b)\n{\n//    return *(int*)a - *(int*)b;\n    return *(long long*)a - *(long long*)b;\n}\n//  qsort(A, b, sizeof(int), compare_int);\n\nint main()\n{\n  int a ,b, c, d, e, X, Y;\n//  long long  b, c, d, e, X, Y;\n  //  double  c;\n  long long  A[200003]={};\n  long long  B[100003]={};\n  int  C[100003]={};\n\n  int  flag[103]={};\n\n//  long long  a, b, c, d, X, Y;\n  char s[101]={};\n//  int N, M;\n//  int A[1000000001]={};\n//  long long  C[101]={};\n  int i,j,k;\n//  int flag=0;\n  int tmp=0;\n//  int min=1000000;\n  long long min=100000001;\n  int len=0;\n  int l=0;\n  int r=1000001;\n  int cnt=0;\n  int num=0;\n  int ans=0;\n  int max=0;\n  int addr=0;\n//  char alp[26]={'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\n  //  a=0;\n//  scanf(\"%lld %lld\", &a, &b);\n//  scanf(\"%d%d\", &a,&c);\n//  cnt = strlen(t);\n// printf(\"%d\\n\",a);\n    scanf(\"%d%d\", &a,&b);\n/*  for(i=0;i<a;i++){\n    scanf(\"%lld\", &A[i]);\n  }\n//  puts(\"\");\n  addr=a;\n  for(i=0;i<b;i++){\n    scanf(\"%lld%lld\", &B[0],&B[1]);\n    for(j=0;j<B[0];j++,addr++){\n      A[addr]=B[1];\n      cnt++;\n    }\n  }\n/*  for(i=0;i<addr;i++){\n//  scanf(\"%lld%lld\", &B[0][i],&B[1][i]);\n//    ans=ans+A[i];\n    printf(\"%lld \", A[i]);\n  }\n*/\n//    printf(\"%d \", cnt);\n   \n  ans=a*3;\n  ans=(ans+b)/2;\n  printf(\"%d\\n\", ans);\n\n  \n//  printf(\"%lf\\n\",ans);\n  //  //  if(flag==0)   printf(\"TLE\\n\");\n//    if(max < cnt - max)  printf(\"Yes\\n\");\n//    else  printf(\"No\\n\");\n  \nreturn 0;\n}\n", "language": "C", "metadata": {"date": 1558919209, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "problem_description_relpath": "problem_descriptions/p03029.html", "problem_id": "p03029", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03029/input.txt", "sample_output_relpath": "derived/input_output/data/p03029/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03029/C/s255363795.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s255363795", "user_id": "u301843562"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "#include <stdio.h>\n#include <stdlib.h>\n#include <string.h>\n#include <math.h>\nint compare_int(const void *a, const void *b)\n{\n//    return *(int*)a - *(int*)b;\n    return *(long long*)a - *(long long*)b;\n}\n//  qsort(A, b, sizeof(int), compare_int);\n\nint main()\n{\n  int a ,b, c, d, e, X, Y;\n//  long long  b, c, d, e, X, Y;\n  //  double  c;\n  long long  A[200003]={};\n  long long  B[100003]={};\n  int  C[100003]={};\n\n  int  flag[103]={};\n\n//  long long  a, b, c, d, X, Y;\n  char s[101]={};\n//  int N, M;\n//  int A[1000000001]={};\n//  long long  C[101]={};\n  int i,j,k;\n//  int flag=0;\n  int tmp=0;\n//  int min=1000000;\n  long long min=100000001;\n  int len=0;\n  int l=0;\n  int r=1000001;\n  int cnt=0;\n  int num=0;\n  int ans=0;\n  int max=0;\n  int addr=0;\n//  char alp[26]={'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\n  //  a=0;\n//  scanf(\"%lld %lld\", &a, &b);\n//  scanf(\"%d%d\", &a,&c);\n//  cnt = strlen(t);\n// printf(\"%d\\n\",a);\n    scanf(\"%d%d\", &a,&b);\n/*  for(i=0;i<a;i++){\n    scanf(\"%lld\", &A[i]);\n  }\n//  puts(\"\");\n  addr=a;\n  for(i=0;i<b;i++){\n    scanf(\"%lld%lld\", &B[0],&B[1]);\n    for(j=0;j<B[0];j++,addr++){\n      A[addr]=B[1];\n      cnt++;\n    }\n  }\n/*  for(i=0;i<addr;i++){\n//  scanf(\"%lld%lld\", &B[0][i],&B[1][i]);\n//    ans=ans+A[i];\n    printf(\"%lld \", A[i]);\n  }\n*/\n//    printf(\"%d \", cnt);\n   \n  ans=a*3;\n  ans=(ans+b)/2;\n  printf(\"%d\\n\", ans);\n\n  \n//  printf(\"%lf\\n\",ans);\n  //  //  if(flag==0)   printf(\"TLE\\n\");\n//    if(max < cnt - max)  printf(\"Yes\\n\");\n//    else  printf(\"No\\n\");\n  \nreturn 0;\n}\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nWe have A apples and P pieces of apple.\n\nWe can cut an apple into three pieces of apple, and make one apple pie by simmering two pieces of apple in a pan.\n\nFind the maximum number of apple pies we can make with what we have now.\n\nConstraints\n\nAll values in input are integers.\n\n0 \\leq A, P \\leq 100\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA P\n\nOutput\n\nPrint the maximum number of apple pies we can make with what we have.\n\nSample Input 1\n\n1 3\n\nSample Output 1\n\n3\n\nWe can first make one apple pie by simmering two of the three pieces of apple. Then, we can make two more by simmering the remaining piece and three more pieces obtained by cutting the whole apple.\n\nSample Input 2\n\n0 1\n\nSample Output 2\n\n0\n\nWe cannot make an apple pie in this case, unfortunately.\n\nSample Input 3\n\n32 21\n\nSample Output 3\n\n58", "sample_input": "1 3\n"}, "reference_outputs": ["3\n"], "source_document_id": "p03029", "source_text": "Score : 100 points\n\nProblem Statement\n\nWe have A apples and P pieces of apple.\n\nWe can cut an apple into three pieces of apple, and make one apple pie by simmering two pieces of apple in a pan.\n\nFind the maximum number of apple pies we can make with what we have now.\n\nConstraints\n\nAll values in input are integers.\n\n0 \\leq A, P \\leq 100\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA P\n\nOutput\n\nPrint the maximum number of apple pies we can make with what we have.\n\nSample Input 1\n\n1 3\n\nSample Output 1\n\n3\n\nWe can first make one apple pie by simmering two of the three pieces of apple. Then, we can make two more by simmering the remaining piece and three more pieces obtained by cutting the whole apple.\n\nSample Input 2\n\n0 1\n\nSample Output 2\n\n0\n\nWe cannot make an apple pie in this case, unfortunately.\n\nSample Input 3\n\n32 21\n\nSample Output 3\n\n58", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1579, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s120338133", "group_id": "codeNet:p03030", "input_text": "#include <stdio.h>\n#include <stdlib.h>\n#include <string.h>\n\ntypedef struct {\n\tchar toshi[256];\n\tint hyouka;\n\tint x;\n}house;\n\nvoid scan(house* data);\nint cmp_str(const void* p, const void* q) {\n\treturn strcmp(((house*)p)->toshi,((house*)q)->toshi);\n}\nint cmp_num(const void* p, const void* q) {\n\treturn((house*)q)->hyouka - ((house*)p)->hyouka;\n}\nint print(house* data);\n/*int testprint(house* data);*/\n\nint main(void) {\n\tint i;\n\tint N;\n\n\tscanf(\"%d\", &N);\n\n\thouse data[N];\n\n\tfor (i = 0;i < N;i++) {\n\n\t\tscan(&data[i]);\n\t\tdata[i].x = i + 1;\n\n\t}\n\n\tqsort(data, N, sizeof(house), cmp_num);\n\tqsort(data, N, sizeof(house), cmp_str);\n\n\tfor (i = 0;i < N;i++) {\n\t\tprint(&data[i]);\n\t}\n\n\t/*for (i = 0;i < N;i++) {\n\t\ttestprint(&data[i]);\n\t}*/\n\n\treturn 0;\n\n}\n\n\nvoid scan(house * data) {\n\n\t\tscanf(\"%s%d\", data->toshi, &data->hyouka);\n\n\t\treturn;\n}\n\nint print(house * data) {\n\t\tprintf(\"%d\\n\", data->x);\n\n\t\treturn 0;\n}\n\n/*int testprint(house* data) {\n\tprintf(\"%s %d\\n\", data->toshi, data->hyouka);\n\n\treturn 0;\n}*/", "language": "C", "metadata": {"date": 1558972927, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "problem_description_relpath": "problem_descriptions/p03030.html", "problem_id": "p03030", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03030/input.txt", "sample_output_relpath": "derived/input_output/data/p03030/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03030/C/s120338133.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s120338133", "user_id": "u177053419"}, "prompt_components": {"gold_output": "3\n4\n6\n1\n5\n2\n", "input_to_evaluate": "#include <stdio.h>\n#include <stdlib.h>\n#include <string.h>\n\ntypedef struct {\n\tchar toshi[256];\n\tint hyouka;\n\tint x;\n}house;\n\nvoid scan(house* data);\nint cmp_str(const void* p, const void* q) {\n\treturn strcmp(((house*)p)->toshi,((house*)q)->toshi);\n}\nint cmp_num(const void* p, const void* q) {\n\treturn((house*)q)->hyouka - ((house*)p)->hyouka;\n}\nint print(house* data);\n/*int testprint(house* data);*/\n\nint main(void) {\n\tint i;\n\tint N;\n\n\tscanf(\"%d\", &N);\n\n\thouse data[N];\n\n\tfor (i = 0;i < N;i++) {\n\n\t\tscan(&data[i]);\n\t\tdata[i].x = i + 1;\n\n\t}\n\n\tqsort(data, N, sizeof(house), cmp_num);\n\tqsort(data, N, sizeof(house), cmp_str);\n\n\tfor (i = 0;i < N;i++) {\n\t\tprint(&data[i]);\n\t}\n\n\t/*for (i = 0;i < N;i++) {\n\t\ttestprint(&data[i]);\n\t}*/\n\n\treturn 0;\n\n}\n\n\nvoid scan(house * data) {\n\n\t\tscanf(\"%s%d\", data->toshi, &data->hyouka);\n\n\t\treturn;\n}\n\nint print(house * data) {\n\t\tprintf(\"%d\\n\", data->x);\n\n\t\treturn 0;\n}\n\n/*int testprint(house* data) {\n\tprintf(\"%s %d\\n\", data->toshi, data->hyouka);\n\n\treturn 0;\n}*/", "problem_context": "Score : 200 points\n\nProblem Statement\n\nYou have decided to write a book introducing good restaurants.\nThere are N restaurants that you want to introduce: Restaurant 1, Restaurant 2, ..., Restaurant N. Restaurant i is in city S_i, and your assessment score of that restaurant on a 100-point scale is P_i.\nNo two restaurants have the same score.\n\nYou want to introduce the restaurants in the following order:\n\nThe restaurants are arranged in lexicographical order of the names of their cities.\n\nIf there are multiple restaurants in the same city, they are arranged in descending order of score.\n\nPrint the identification numbers of the restaurants in the order they are introduced in the book.\n\nConstraints\n\n1 ≤ N ≤ 100\n\nS is a string of length between 1 and 10 (inclusive) consisting of lowercase English letters.\n\n0 ≤ P_i ≤ 100\n\nP_i is an integer.\n\nP_i ≠ P_j (1 ≤ i < j ≤ N)\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS_1 P_1\n:\nS_N P_N\n\nOutput\n\nPrint N lines. The i-th line (1 ≤ i ≤ N) should contain the identification number of the restaurant that is introduced i-th in the book.\n\nSample Input 1\n\n6\nkhabarovsk 20\nmoscow 10\nkazan 50\nkazan 35\nmoscow 60\nkhabarovsk 40\n\nSample Output 1\n\n3\n4\n6\n1\n5\n2\n\nThe lexicographical order of the names of the three cities is kazan < khabarovsk < moscow. For each of these cities, the restaurants in it are introduced in descending order of score. Thus, the restaurants are introduced in the order 3,4,6,1,5,2.\n\nSample Input 2\n\n10\nyakutsk 10\nyakutsk 20\nyakutsk 30\nyakutsk 40\nyakutsk 50\nyakutsk 60\nyakutsk 70\nyakutsk 80\nyakutsk 90\nyakutsk 100\n\nSample Output 2\n\n10\n9\n8\n7\n6\n5\n4\n3\n2\n1", "sample_input": "6\nkhabarovsk 20\nmoscow 10\nkazan 50\nkazan 35\nmoscow 60\nkhabarovsk 40\n"}, "reference_outputs": ["3\n4\n6\n1\n5\n2\n"], "source_document_id": "p03030", "source_text": "Score : 200 points\n\nProblem Statement\n\nYou have decided to write a book introducing good restaurants.\nThere are N restaurants that you want to introduce: Restaurant 1, Restaurant 2, ..., Restaurant N. Restaurant i is in city S_i, and your assessment score of that restaurant on a 100-point scale is P_i.\nNo two restaurants have the same score.\n\nYou want to introduce the restaurants in the following order:\n\nThe restaurants are arranged in lexicographical order of the names of their cities.\n\nIf there are multiple restaurants in the same city, they are arranged in descending order of score.\n\nPrint the identification numbers of the restaurants in the order they are introduced in the book.\n\nConstraints\n\n1 ≤ N ≤ 100\n\nS is a string of length between 1 and 10 (inclusive) consisting of lowercase English letters.\n\n0 ≤ P_i ≤ 100\n\nP_i is an integer.\n\nP_i ≠ P_j (1 ≤ i < j ≤ N)\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS_1 P_1\n:\nS_N P_N\n\nOutput\n\nPrint N lines. The i-th line (1 ≤ i ≤ N) should contain the identification number of the restaurant that is introduced i-th in the book.\n\nSample Input 1\n\n6\nkhabarovsk 20\nmoscow 10\nkazan 50\nkazan 35\nmoscow 60\nkhabarovsk 40\n\nSample Output 1\n\n3\n4\n6\n1\n5\n2\n\nThe lexicographical order of the names of the three cities is kazan < khabarovsk < moscow. For each of these cities, the restaurants in it are introduced in descending order of score. Thus, the restaurants are introduced in the order 3,4,6,1,5,2.\n\nSample Input 2\n\n10\nyakutsk 10\nyakutsk 20\nyakutsk 30\nyakutsk 40\nyakutsk 50\nyakutsk 60\nyakutsk 70\nyakutsk 80\nyakutsk 90\nyakutsk 100\n\nSample Output 2\n\n10\n9\n8\n7\n6\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": 994, "cpu_time_ms": 1, "memory_kb": 252}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s068113033", "group_id": "codeNet:p03035", "input_text": "#include<stdio.h>\nint main()\n{\n  int a,b;\n  scanf(\"%d %d\",&a,&b);\n  if(a>=13)\n  \tprintf(\"%d\",b);\n   else if(a>=6&&a<=12)\n     printf(\"%d\",b/2);\n     else\n       printf(\"0\");\n  return 0;\n}", "language": "C", "metadata": {"date": 1580850750, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "problem_description_relpath": "problem_descriptions/p03035.html", "problem_id": "p03035", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03035/input.txt", "sample_output_relpath": "derived/input_output/data/p03035/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03035/C/s068113033.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s068113033", "user_id": "u271369517"}, "prompt_components": {"gold_output": "100\n", "input_to_evaluate": "#include<stdio.h>\nint main()\n{\n  int a,b;\n  scanf(\"%d %d\",&a,&b);\n  if(a>=13)\n  \tprintf(\"%d\",b);\n   else if(a>=6&&a<=12)\n     printf(\"%d\",b/2);\n     else\n       printf(\"0\");\n  return 0;\n}", "problem_context": "Score : 100 points\n\nProblem Statement\n\nTakahashi, who is A years old, is riding a Ferris wheel.\n\nIt costs B yen (B is an even number) to ride the Ferris wheel if you are 13 years old or older, but children between 6 and 12 years old (inclusive) can ride it for half the cost, and children who are 5 years old or younger are free of charge. (Yen is the currency of Japan.)\n\nFind the cost of the Ferris wheel for Takahashi.\n\nConstraints\n\n0 ≤ A ≤ 100\n\n2 ≤ B ≤ 1000\n\nB is an even number.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the cost of the Ferris wheel for Takahashi.\n\nSample Input 1\n\n30 100\n\nSample Output 1\n\n100\n\nTakahashi is 30 years old now, and the cost of the Ferris wheel is 100 yen.\n\nSample Input 2\n\n12 100\n\nSample Output 2\n\n50\n\nTakahashi is 12 years old, and the cost of the Ferris wheel is the half of 100 yen, that is, 50 yen.\n\nSample Input 3\n\n0 100\n\nSample Output 3\n\n0\n\nTakahashi is 0 years old, and he can ride the Ferris wheel for free.", "sample_input": "30 100\n"}, "reference_outputs": ["100\n"], "source_document_id": "p03035", "source_text": "Score : 100 points\n\nProblem Statement\n\nTakahashi, who is A years old, is riding a Ferris wheel.\n\nIt costs B yen (B is an even number) to ride the Ferris wheel if you are 13 years old or older, but children between 6 and 12 years old (inclusive) can ride it for half the cost, and children who are 5 years old or younger are free of charge. (Yen is the currency of Japan.)\n\nFind the cost of the Ferris wheel for Takahashi.\n\nConstraints\n\n0 ≤ A ≤ 100\n\n2 ≤ B ≤ 1000\n\nB is an even number.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the cost of the Ferris wheel for Takahashi.\n\nSample Input 1\n\n30 100\n\nSample Output 1\n\n100\n\nTakahashi is 30 years old now, and the cost of the Ferris wheel is 100 yen.\n\nSample Input 2\n\n12 100\n\nSample Output 2\n\n50\n\nTakahashi is 12 years old, and the cost of the Ferris wheel is the half of 100 yen, that is, 50 yen.\n\nSample Input 3\n\n0 100\n\nSample Output 3\n\n0\n\nTakahashi is 0 years old, and he can ride the Ferris wheel for free.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 187, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s396726139", "group_id": "codeNet:p03035", "input_text": "#include<stdio.h>\nint main(){\n  int a,b;\n  scanf(\"%d\",&a);\n  scanf(\"%d\",&b);\n  if(a>=13)printf(\"%d\",b);\n  else if(12>=a>=6)printf(\"%d\",b/2);\n  else printf(\"%d\",0);\n}", "language": "C", "metadata": {"date": 1576469770, "filename_ext": "c", "original_language": "C (Clang 3.8.0)", "problem_description_relpath": "problem_descriptions/p03035.html", "problem_id": "p03035", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03035/input.txt", "sample_output_relpath": "derived/input_output/data/p03035/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03035/C/s396726139.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s396726139", "user_id": "u722117999"}, "prompt_components": {"gold_output": "100\n", "input_to_evaluate": "#include<stdio.h>\nint main(){\n  int a,b;\n  scanf(\"%d\",&a);\n  scanf(\"%d\",&b);\n  if(a>=13)printf(\"%d\",b);\n  else if(12>=a>=6)printf(\"%d\",b/2);\n  else printf(\"%d\",0);\n}", "problem_context": "Score : 100 points\n\nProblem Statement\n\nTakahashi, who is A years old, is riding a Ferris wheel.\n\nIt costs B yen (B is an even number) to ride the Ferris wheel if you are 13 years old or older, but children between 6 and 12 years old (inclusive) can ride it for half the cost, and children who are 5 years old or younger are free of charge. (Yen is the currency of Japan.)\n\nFind the cost of the Ferris wheel for Takahashi.\n\nConstraints\n\n0 ≤ A ≤ 100\n\n2 ≤ B ≤ 1000\n\nB is an even number.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the cost of the Ferris wheel for Takahashi.\n\nSample Input 1\n\n30 100\n\nSample Output 1\n\n100\n\nTakahashi is 30 years old now, and the cost of the Ferris wheel is 100 yen.\n\nSample Input 2\n\n12 100\n\nSample Output 2\n\n50\n\nTakahashi is 12 years old, and the cost of the Ferris wheel is the half of 100 yen, that is, 50 yen.\n\nSample Input 3\n\n0 100\n\nSample Output 3\n\n0\n\nTakahashi is 0 years old, and he can ride the Ferris wheel for free.", "sample_input": "30 100\n"}, "reference_outputs": ["100\n"], "source_document_id": "p03035", "source_text": "Score : 100 points\n\nProblem Statement\n\nTakahashi, who is A years old, is riding a Ferris wheel.\n\nIt costs B yen (B is an even number) to ride the Ferris wheel if you are 13 years old or older, but children between 6 and 12 years old (inclusive) can ride it for half the cost, and children who are 5 years old or younger are free of charge. (Yen is the currency of Japan.)\n\nFind the cost of the Ferris wheel for Takahashi.\n\nConstraints\n\n0 ≤ A ≤ 100\n\n2 ≤ B ≤ 1000\n\nB is an even number.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the cost of the Ferris wheel for Takahashi.\n\nSample Input 1\n\n30 100\n\nSample Output 1\n\n100\n\nTakahashi is 30 years old now, and the cost of the Ferris wheel is 100 yen.\n\nSample Input 2\n\n12 100\n\nSample Output 2\n\n50\n\nTakahashi is 12 years old, and the cost of the Ferris wheel is the half of 100 yen, that is, 50 yen.\n\nSample Input 3\n\n0 100\n\nSample Output 3\n\n0\n\nTakahashi is 0 years old, and he can ride the Ferris wheel for free.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 165, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s065958586", "group_id": "codeNet:p03035", "input_text": "#include <stdio.h>\n\nint main(void){\n  int a,b;\n  scanf(\"%d%d\",&a,&b);\n  if(a>=13){\n    printf(\"%d\",b);\n  }else if(a>=6 && a<=12){\n    printf(\"%d\",b/2);\n  }else{\n    printf(\"0\");\n  }\n}", "language": "C", "metadata": {"date": 1563667785, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "problem_description_relpath": "problem_descriptions/p03035.html", "problem_id": "p03035", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03035/input.txt", "sample_output_relpath": "derived/input_output/data/p03035/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03035/C/s065958586.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s065958586", "user_id": "u606393507"}, "prompt_components": {"gold_output": "100\n", "input_to_evaluate": "#include <stdio.h>\n\nint main(void){\n  int a,b;\n  scanf(\"%d%d\",&a,&b);\n  if(a>=13){\n    printf(\"%d\",b);\n  }else if(a>=6 && a<=12){\n    printf(\"%d\",b/2);\n  }else{\n    printf(\"0\");\n  }\n}", "problem_context": "Score : 100 points\n\nProblem Statement\n\nTakahashi, who is A years old, is riding a Ferris wheel.\n\nIt costs B yen (B is an even number) to ride the Ferris wheel if you are 13 years old or older, but children between 6 and 12 years old (inclusive) can ride it for half the cost, and children who are 5 years old or younger are free of charge. (Yen is the currency of Japan.)\n\nFind the cost of the Ferris wheel for Takahashi.\n\nConstraints\n\n0 ≤ A ≤ 100\n\n2 ≤ B ≤ 1000\n\nB is an even number.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the cost of the Ferris wheel for Takahashi.\n\nSample Input 1\n\n30 100\n\nSample Output 1\n\n100\n\nTakahashi is 30 years old now, and the cost of the Ferris wheel is 100 yen.\n\nSample Input 2\n\n12 100\n\nSample Output 2\n\n50\n\nTakahashi is 12 years old, and the cost of the Ferris wheel is the half of 100 yen, that is, 50 yen.\n\nSample Input 3\n\n0 100\n\nSample Output 3\n\n0\n\nTakahashi is 0 years old, and he can ride the Ferris wheel for free.", "sample_input": "30 100\n"}, "reference_outputs": ["100\n"], "source_document_id": "p03035", "source_text": "Score : 100 points\n\nProblem Statement\n\nTakahashi, who is A years old, is riding a Ferris wheel.\n\nIt costs B yen (B is an even number) to ride the Ferris wheel if you are 13 years old or older, but children between 6 and 12 years old (inclusive) can ride it for half the cost, and children who are 5 years old or younger are free of charge. (Yen is the currency of Japan.)\n\nFind the cost of the Ferris wheel for Takahashi.\n\nConstraints\n\n0 ≤ A ≤ 100\n\n2 ≤ B ≤ 1000\n\nB is an even number.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the cost of the Ferris wheel for Takahashi.\n\nSample Input 1\n\n30 100\n\nSample Output 1\n\n100\n\nTakahashi is 30 years old now, and the cost of the Ferris wheel is 100 yen.\n\nSample Input 2\n\n12 100\n\nSample Output 2\n\n50\n\nTakahashi is 12 years old, and the cost of the Ferris wheel is the half of 100 yen, that is, 50 yen.\n\nSample Input 3\n\n0 100\n\nSample Output 3\n\n0\n\nTakahashi is 0 years old, and he can ride the Ferris wheel for free.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 183, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s504365408", "group_id": "codeNet:p03035", "input_text": "#include <stdio.h>\n\nvoid main()\n{\n  int age;\n  int money;\n  scanf(\"%d\",&age);\n  scanf(\"%d\",&money);\n  if(age>12){\n  printf(\"%d\",&money);\n  }else if(age<13){\n  printf(\"%d\",money/2);\n  }else{\n  printf(\"0\");\n  }\n  return 0;\n  \n}", "language": "C", "metadata": {"date": 1558833755, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "problem_description_relpath": "problem_descriptions/p03035.html", "problem_id": "p03035", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03035/input.txt", "sample_output_relpath": "derived/input_output/data/p03035/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03035/C/s504365408.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s504365408", "user_id": "u455481742"}, "prompt_components": {"gold_output": "100\n", "input_to_evaluate": "#include <stdio.h>\n\nvoid main()\n{\n  int age;\n  int money;\n  scanf(\"%d\",&age);\n  scanf(\"%d\",&money);\n  if(age>12){\n  printf(\"%d\",&money);\n  }else if(age<13){\n  printf(\"%d\",money/2);\n  }else{\n  printf(\"0\");\n  }\n  return 0;\n  \n}", "problem_context": "Score : 100 points\n\nProblem Statement\n\nTakahashi, who is A years old, is riding a Ferris wheel.\n\nIt costs B yen (B is an even number) to ride the Ferris wheel if you are 13 years old or older, but children between 6 and 12 years old (inclusive) can ride it for half the cost, and children who are 5 years old or younger are free of charge. (Yen is the currency of Japan.)\n\nFind the cost of the Ferris wheel for Takahashi.\n\nConstraints\n\n0 ≤ A ≤ 100\n\n2 ≤ B ≤ 1000\n\nB is an even number.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the cost of the Ferris wheel for Takahashi.\n\nSample Input 1\n\n30 100\n\nSample Output 1\n\n100\n\nTakahashi is 30 years old now, and the cost of the Ferris wheel is 100 yen.\n\nSample Input 2\n\n12 100\n\nSample Output 2\n\n50\n\nTakahashi is 12 years old, and the cost of the Ferris wheel is the half of 100 yen, that is, 50 yen.\n\nSample Input 3\n\n0 100\n\nSample Output 3\n\n0\n\nTakahashi is 0 years old, and he can ride the Ferris wheel for free.", "sample_input": "30 100\n"}, "reference_outputs": ["100\n"], "source_document_id": "p03035", "source_text": "Score : 100 points\n\nProblem Statement\n\nTakahashi, who is A years old, is riding a Ferris wheel.\n\nIt costs B yen (B is an even number) to ride the Ferris wheel if you are 13 years old or older, but children between 6 and 12 years old (inclusive) can ride it for half the cost, and children who are 5 years old or younger are free of charge. (Yen is the currency of Japan.)\n\nFind the cost of the Ferris wheel for Takahashi.\n\nConstraints\n\n0 ≤ A ≤ 100\n\n2 ≤ B ≤ 1000\n\nB is an even number.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the cost of the Ferris wheel for Takahashi.\n\nSample Input 1\n\n30 100\n\nSample Output 1\n\n100\n\nTakahashi is 30 years old now, and the cost of the Ferris wheel is 100 yen.\n\nSample Input 2\n\n12 100\n\nSample Output 2\n\n50\n\nTakahashi is 12 years old, and the cost of the Ferris wheel is the half of 100 yen, that is, 50 yen.\n\nSample Input 3\n\n0 100\n\nSample Output 3\n\n0\n\nTakahashi is 0 years old, and he can ride the Ferris wheel for free.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 225, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s543904110", "group_id": "codeNet:p03035", "input_text": "#include <stdio.h>\nint main()\n{\n    int a, b;\n    scanf(\"%d %d\", &a, &b);\n    if (a >= 13)\n        printf(\"%d\\n\", b);\n    if (a <= 12 && a >= 6)\n        printf(\"%d\\n\", b / 2);\n    if (a < 6)\n        printf(\"0\\n\");\n    return 0;\n}\n", "language": "C", "metadata": {"date": 1558833585, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "problem_description_relpath": "problem_descriptions/p03035.html", "problem_id": "p03035", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03035/input.txt", "sample_output_relpath": "derived/input_output/data/p03035/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03035/C/s543904110.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s543904110", "user_id": "u722211380"}, "prompt_components": {"gold_output": "100\n", "input_to_evaluate": "#include <stdio.h>\nint main()\n{\n    int a, b;\n    scanf(\"%d %d\", &a, &b);\n    if (a >= 13)\n        printf(\"%d\\n\", b);\n    if (a <= 12 && a >= 6)\n        printf(\"%d\\n\", b / 2);\n    if (a < 6)\n        printf(\"0\\n\");\n    return 0;\n}\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nTakahashi, who is A years old, is riding a Ferris wheel.\n\nIt costs B yen (B is an even number) to ride the Ferris wheel if you are 13 years old or older, but children between 6 and 12 years old (inclusive) can ride it for half the cost, and children who are 5 years old or younger are free of charge. (Yen is the currency of Japan.)\n\nFind the cost of the Ferris wheel for Takahashi.\n\nConstraints\n\n0 ≤ A ≤ 100\n\n2 ≤ B ≤ 1000\n\nB is an even number.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the cost of the Ferris wheel for Takahashi.\n\nSample Input 1\n\n30 100\n\nSample Output 1\n\n100\n\nTakahashi is 30 years old now, and the cost of the Ferris wheel is 100 yen.\n\nSample Input 2\n\n12 100\n\nSample Output 2\n\n50\n\nTakahashi is 12 years old, and the cost of the Ferris wheel is the half of 100 yen, that is, 50 yen.\n\nSample Input 3\n\n0 100\n\nSample Output 3\n\n0\n\nTakahashi is 0 years old, and he can ride the Ferris wheel for free.", "sample_input": "30 100\n"}, "reference_outputs": ["100\n"], "source_document_id": "p03035", "source_text": "Score : 100 points\n\nProblem Statement\n\nTakahashi, who is A years old, is riding a Ferris wheel.\n\nIt costs B yen (B is an even number) to ride the Ferris wheel if you are 13 years old or older, but children between 6 and 12 years old (inclusive) can ride it for half the cost, and children who are 5 years old or younger are free of charge. (Yen is the currency of Japan.)\n\nFind the cost of the Ferris wheel for Takahashi.\n\nConstraints\n\n0 ≤ A ≤ 100\n\n2 ≤ B ≤ 1000\n\nB is an even number.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the cost of the Ferris wheel for Takahashi.\n\nSample Input 1\n\n30 100\n\nSample Output 1\n\n100\n\nTakahashi is 30 years old now, and the cost of the Ferris wheel is 100 yen.\n\nSample Input 2\n\n12 100\n\nSample Output 2\n\n50\n\nTakahashi is 12 years old, and the cost of the Ferris wheel is the half of 100 yen, that is, 50 yen.\n\nSample Input 3\n\n0 100\n\nSample Output 3\n\n0\n\nTakahashi is 0 years old, and he can ride the Ferris wheel for free.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 230, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s393941318", "group_id": "codeNet:p03035", "input_text": "#include <stdio.h>\n\nint main(void){\n    int a,b;\n    scanf(\"%d %d\", &a, &b);\n    \n    if(a >= 13){\n        printf(\"%d\\n\", b);\n    }else if(a >= 6){\n        printf(\"%d\\n\", b/2);\n    }else{\n        puts(\"0\");\n    }\n    \n    return 0;\n}", "language": "C", "metadata": {"date": 1558832577, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "problem_description_relpath": "problem_descriptions/p03035.html", "problem_id": "p03035", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03035/input.txt", "sample_output_relpath": "derived/input_output/data/p03035/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03035/C/s393941318.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s393941318", "user_id": "u828593789"}, "prompt_components": {"gold_output": "100\n", "input_to_evaluate": "#include <stdio.h>\n\nint main(void){\n    int a,b;\n    scanf(\"%d %d\", &a, &b);\n    \n    if(a >= 13){\n        printf(\"%d\\n\", b);\n    }else if(a >= 6){\n        printf(\"%d\\n\", b/2);\n    }else{\n        puts(\"0\");\n    }\n    \n    return 0;\n}", "problem_context": "Score : 100 points\n\nProblem Statement\n\nTakahashi, who is A years old, is riding a Ferris wheel.\n\nIt costs B yen (B is an even number) to ride the Ferris wheel if you are 13 years old or older, but children between 6 and 12 years old (inclusive) can ride it for half the cost, and children who are 5 years old or younger are free of charge. (Yen is the currency of Japan.)\n\nFind the cost of the Ferris wheel for Takahashi.\n\nConstraints\n\n0 ≤ A ≤ 100\n\n2 ≤ B ≤ 1000\n\nB is an even number.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the cost of the Ferris wheel for Takahashi.\n\nSample Input 1\n\n30 100\n\nSample Output 1\n\n100\n\nTakahashi is 30 years old now, and the cost of the Ferris wheel is 100 yen.\n\nSample Input 2\n\n12 100\n\nSample Output 2\n\n50\n\nTakahashi is 12 years old, and the cost of the Ferris wheel is the half of 100 yen, that is, 50 yen.\n\nSample Input 3\n\n0 100\n\nSample Output 3\n\n0\n\nTakahashi is 0 years old, and he can ride the Ferris wheel for free.", "sample_input": "30 100\n"}, "reference_outputs": ["100\n"], "source_document_id": "p03035", "source_text": "Score : 100 points\n\nProblem Statement\n\nTakahashi, who is A years old, is riding a Ferris wheel.\n\nIt costs B yen (B is an even number) to ride the Ferris wheel if you are 13 years old or older, but children between 6 and 12 years old (inclusive) can ride it for half the cost, and children who are 5 years old or younger are free of charge. (Yen is the currency of Japan.)\n\nFind the cost of the Ferris wheel for Takahashi.\n\nConstraints\n\n0 ≤ A ≤ 100\n\n2 ≤ B ≤ 1000\n\nB is an even number.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the cost of the Ferris wheel for Takahashi.\n\nSample Input 1\n\n30 100\n\nSample Output 1\n\n100\n\nTakahashi is 30 years old now, and the cost of the Ferris wheel is 100 yen.\n\nSample Input 2\n\n12 100\n\nSample Output 2\n\n50\n\nTakahashi is 12 years old, and the cost of the Ferris wheel is the half of 100 yen, that is, 50 yen.\n\nSample Input 3\n\n0 100\n\nSample Output 3\n\n0\n\nTakahashi is 0 years old, and he can ride the Ferris wheel for free.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 233, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s761551845", "group_id": "codeNet:p03036", "input_text": "#include <stdio.h>\n\nint main(void){\n  int r,d,x;\n  \n  scanf(\"%d %d %d\",&r,&d,&x);\n  \n  for(int i = 0; i < 10; i++){\n    x = r*x - d;\n    printf(\"%d\", x);\n  }\n  \n}\n", "language": "C", "metadata": {"date": 1594253026, "filename_ext": "c", "original_language": "C (GCC 9.2.1)", "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/C/s761551845.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s761551845", "user_id": "u306203950"}, "prompt_components": {"gold_output": "30\n50\n90\n170\n330\n650\n1290\n2570\n5130\n10250\n", "input_to_evaluate": "#include <stdio.h>\n\nint main(void){\n  int r,d,x;\n  \n  scanf(\"%d %d %d\",&r,&d,&x);\n  \n  for(int i = 0; i < 10; i++){\n    x = r*x - d;\n    printf(\"%d\", x);\n  }\n  \n}\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": 163, "cpu_time_ms": 5, "memory_kb": 1724}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s127912249", "group_id": "codeNet:p03037", "input_text": "#include <stdio.h>\n\nint main(void)\n{\n  int N,M,i,ans;\n  scanf(\"%d %d\",&N,&M);\n  int L[M],R[M];\n  int L_max = 1,R_min = N;\n  for(i = 0;i < M;i++) {\n    scanf(\"%d %d\",&L[i],&R[i]);    \n  }\n  for(i = 0;i < M;i++) {\n    if(L_max < L[i]) L_max = L[i];\n    if(R_min > R[i]) R_min = R[i];\n  }\n  ans = R_min - L_max + 1;\n  if(ans >= 0) printf(\"%d\\n\",ans);\n  else printf(\"0\\n\");\n  return 0;\n}", "language": "C", "metadata": {"date": 1558834341, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "problem_description_relpath": "problem_descriptions/p03037.html", "problem_id": "p03037", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03037/input.txt", "sample_output_relpath": "derived/input_output/data/p03037/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03037/C/s127912249.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s127912249", "user_id": "u692704469"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "#include <stdio.h>\n\nint main(void)\n{\n  int N,M,i,ans;\n  scanf(\"%d %d\",&N,&M);\n  int L[M],R[M];\n  int L_max = 1,R_min = N;\n  for(i = 0;i < M;i++) {\n    scanf(\"%d %d\",&L[i],&R[i]);    \n  }\n  for(i = 0;i < M;i++) {\n    if(L_max < L[i]) L_max = L[i];\n    if(R_min > R[i]) R_min = R[i];\n  }\n  ans = R_min - L_max + 1;\n  if(ans >= 0) printf(\"%d\\n\",ans);\n  else printf(\"0\\n\");\n  return 0;\n}", "problem_context": "Score : 300 points\n\nProblem Statement\n\nWe have N ID cards, and there are M gates.\n\nWe can pass the i-th gate if we have one of the following ID cards: the L_i-th, (L_i+1)-th, ..., and R_i-th ID cards.\n\nHow many of the ID cards allow us to pass all the gates alone?\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 10^5\n\n1 \\leq M \\leq 10^5\n\n1 \\leq L_i \\leq R_i \\leq N\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nL_1 R_1\nL_2 R_2\n\\vdots\nL_M R_M\n\nOutput\n\nPrint the number of ID cards that allow us to pass all the gates alone.\n\nSample Input 1\n\n4 2\n1 3\n2 4\n\nSample Output 1\n\n2\n\nTwo ID cards allow us to pass all the gates alone, as follows:\n\nThe first ID card does not allow us to pass the second gate.\n\nThe second ID card allows us to pass all the gates.\n\nThe third ID card allows us to pass all the gates.\n\nThe fourth ID card does not allow us to pass the first gate.\n\nSample Input 2\n\n10 3\n3 6\n5 7\n6 9\n\nSample Output 2\n\n1\n\nSample Input 3\n\n100000 1\n1 100000\n\nSample Output 3\n\n100000", "sample_input": "4 2\n1 3\n2 4\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03037", "source_text": "Score : 300 points\n\nProblem Statement\n\nWe have N ID cards, and there are M gates.\n\nWe can pass the i-th gate if we have one of the following ID cards: the L_i-th, (L_i+1)-th, ..., and R_i-th ID cards.\n\nHow many of the ID cards allow us to pass all the gates alone?\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 10^5\n\n1 \\leq M \\leq 10^5\n\n1 \\leq L_i \\leq R_i \\leq N\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nL_1 R_1\nL_2 R_2\n\\vdots\nL_M R_M\n\nOutput\n\nPrint the number of ID cards that allow us to pass all the gates alone.\n\nSample Input 1\n\n4 2\n1 3\n2 4\n\nSample Output 1\n\n2\n\nTwo ID cards allow us to pass all the gates alone, as follows:\n\nThe first ID card does not allow us to pass the second gate.\n\nThe second ID card allows us to pass all the gates.\n\nThe third ID card allows us to pass all the gates.\n\nThe fourth ID card does not allow us to pass the first gate.\n\nSample Input 2\n\n10 3\n3 6\n5 7\n6 9\n\nSample Output 2\n\n1\n\nSample Input 3\n\n100000 1\n1 100000\n\nSample Output 3\n\n100000", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 383, "cpu_time_ms": 18, "memory_kb": 896}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s328300719", "group_id": "codeNet:p03037", "input_text": "#include <stdio.h>\n#include <stdlib.h>\n#include <string.h>\n#include <math.h>\n\n#define max(a,b) ((a) < (b) ? (b) : (a))\n#define min(a,b) ((a) > (b) ? (b) : (a))\n\nint main(void) {\n\tint N, M, L, R, max_L = 0, min_R = 100001;\n\t\n\tscanf(\"%d %d\", &N, &M);\n\tfor (int i = 0; i < M; i++) {\n\t\tscanf(\"%d %d\", &L, &R);\n\t\tmax_L = max(max_L, L);\n\t\tmin_R = min(min_R, R);\n\t}\n\t\n\tif (min_R - max_L >= 0)\n\t\tprintf(\"%d\\n\", min_R - max_L + 1);\n\telse\n\t\tprintf(\"0\\n\");\n\t\n\treturn 0;\n}", "language": "C", "metadata": {"date": 1558833410, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "problem_description_relpath": "problem_descriptions/p03037.html", "problem_id": "p03037", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03037/input.txt", "sample_output_relpath": "derived/input_output/data/p03037/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03037/C/s328300719.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s328300719", "user_id": "u194609748"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "#include <stdio.h>\n#include <stdlib.h>\n#include <string.h>\n#include <math.h>\n\n#define max(a,b) ((a) < (b) ? (b) : (a))\n#define min(a,b) ((a) > (b) ? (b) : (a))\n\nint main(void) {\n\tint N, M, L, R, max_L = 0, min_R = 100001;\n\t\n\tscanf(\"%d %d\", &N, &M);\n\tfor (int i = 0; i < M; i++) {\n\t\tscanf(\"%d %d\", &L, &R);\n\t\tmax_L = max(max_L, L);\n\t\tmin_R = min(min_R, R);\n\t}\n\t\n\tif (min_R - max_L >= 0)\n\t\tprintf(\"%d\\n\", min_R - max_L + 1);\n\telse\n\t\tprintf(\"0\\n\");\n\t\n\treturn 0;\n}", "problem_context": "Score : 300 points\n\nProblem Statement\n\nWe have N ID cards, and there are M gates.\n\nWe can pass the i-th gate if we have one of the following ID cards: the L_i-th, (L_i+1)-th, ..., and R_i-th ID cards.\n\nHow many of the ID cards allow us to pass all the gates alone?\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 10^5\n\n1 \\leq M \\leq 10^5\n\n1 \\leq L_i \\leq R_i \\leq N\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nL_1 R_1\nL_2 R_2\n\\vdots\nL_M R_M\n\nOutput\n\nPrint the number of ID cards that allow us to pass all the gates alone.\n\nSample Input 1\n\n4 2\n1 3\n2 4\n\nSample Output 1\n\n2\n\nTwo ID cards allow us to pass all the gates alone, as follows:\n\nThe first ID card does not allow us to pass the second gate.\n\nThe second ID card allows us to pass all the gates.\n\nThe third ID card allows us to pass all the gates.\n\nThe fourth ID card does not allow us to pass the first gate.\n\nSample Input 2\n\n10 3\n3 6\n5 7\n6 9\n\nSample Output 2\n\n1\n\nSample Input 3\n\n100000 1\n1 100000\n\nSample Output 3\n\n100000", "sample_input": "4 2\n1 3\n2 4\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03037", "source_text": "Score : 300 points\n\nProblem Statement\n\nWe have N ID cards, and there are M gates.\n\nWe can pass the i-th gate if we have one of the following ID cards: the L_i-th, (L_i+1)-th, ..., and R_i-th ID cards.\n\nHow many of the ID cards allow us to pass all the gates alone?\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 10^5\n\n1 \\leq M \\leq 10^5\n\n1 \\leq L_i \\leq R_i \\leq N\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nL_1 R_1\nL_2 R_2\n\\vdots\nL_M R_M\n\nOutput\n\nPrint the number of ID cards that allow us to pass all the gates alone.\n\nSample Input 1\n\n4 2\n1 3\n2 4\n\nSample Output 1\n\n2\n\nTwo ID cards allow us to pass all the gates alone, as follows:\n\nThe first ID card does not allow us to pass the second gate.\n\nThe second ID card allows us to pass all the gates.\n\nThe third ID card allows us to pass all the gates.\n\nThe fourth ID card does not allow us to pass the first gate.\n\nSample Input 2\n\n10 3\n3 6\n5 7\n6 9\n\nSample Output 2\n\n1\n\nSample Input 3\n\n100000 1\n1 100000\n\nSample Output 3\n\n100000", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 18, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s846643958", "group_id": "codeNet:p03038", "input_text": "#include<stdio.h>\nint e[100002],f[100002][2];\n//小さい順\nvoid merge(int i,int j,int *s){\n  if(i!=j){\n    merge(i,(i+j)/2,s);\n    merge((i+j)/2+1,j,s);\n    int a=i,b=(i+j)/2+1;\n    int d;\n    for(d=i;d<=j;d++){\n      if((i+j)/2<a){\n        e[d]=s[b];\n        b++;\n      }\n      else if(j<b){\n        e[d]=s[a];\n        a++;\n      }\n      else if(s[a]<s[b]){\n        e[d]=s[a];\n        a++;\n      }\n      else{\n        e[d]=s[b];\n        b++;\n      }\n    }\n    for(d=i;d<=j;d++)\n      s[d]=e[d];\n  }\n}\n\n//大きい順\nvoid sort(int i,int j,int s[][2]){\n  if(i!=j){\n    sort(i,(i+j)/2,s);\n    sort((i+j)/2+1,j,s);\n    int a=i,b=(i+j)/2+1;\n    int d;\n    for(d=i;d<=j;d++){\n      if((i+j)/2<a){\n        f[d][0]=s[b][0];\n        f[d][1]=s[b][1];\n        b++;\n      }\n      else if(j<b){\n        f[d][0]=s[a][0];\n        f[d][1]=s[a][1];\n        a++;\n      }\n      else if(s[a][1]>s[b][1]){\n        f[d][0]=s[a][0];\n        f[d][1]=s[a][1];\n        a++;\n      }\n      else{\n        f[d][0]=s[b][0];\n        f[d][1]=s[b][1];\n        b++;\n      }\n    }\n    for(d=i;d<=j;d++){\n      s[d][0]=f[d][0];\n      s[d][1]=f[d][1];\n    }\n  }\n}\n\nint main(){\n  int n,m,i;\n  scanf(\"%d%d\",&n,&m);\n  int a[n+1],b[m+1][2];\n  for(i=0;i<n;i++)\n    scanf(\"%d\",&a[i]);\n  merge(0,n-1,a);\n  for(i=0;i<m;i++)\n    scanf(\"%d%d\",&b[i][0],&b[i][1]);\n  sort(0,m-1,b);\n  int j=0,jcount=0;\n  long long sum=0;\n  for(i=0;i<n;i++){\n    if(jcount==b[j][0]){\n      j++;\n      jcount=0;\n    }\n    if(a[i]<b[j][1]){\n      a[i]=b[j][1];\n      jcount++;\n    }\n    long long num=a[i];\n    sum+=num;\n  }\n  printf(\"%lld\\n\",sum);\n  return 0;\n}\n", "language": "C", "metadata": {"date": 1589552734, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "problem_description_relpath": "problem_descriptions/p03038.html", "problem_id": "p03038", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03038/input.txt", "sample_output_relpath": "derived/input_output/data/p03038/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03038/C/s846643958.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s846643958", "user_id": "u917851778"}, "prompt_components": {"gold_output": "14\n", "input_to_evaluate": "#include<stdio.h>\nint e[100002],f[100002][2];\n//小さい順\nvoid merge(int i,int j,int *s){\n  if(i!=j){\n    merge(i,(i+j)/2,s);\n    merge((i+j)/2+1,j,s);\n    int a=i,b=(i+j)/2+1;\n    int d;\n    for(d=i;d<=j;d++){\n      if((i+j)/2<a){\n        e[d]=s[b];\n        b++;\n      }\n      else if(j<b){\n        e[d]=s[a];\n        a++;\n      }\n      else if(s[a]<s[b]){\n        e[d]=s[a];\n        a++;\n      }\n      else{\n        e[d]=s[b];\n        b++;\n      }\n    }\n    for(d=i;d<=j;d++)\n      s[d]=e[d];\n  }\n}\n\n//大きい順\nvoid sort(int i,int j,int s[][2]){\n  if(i!=j){\n    sort(i,(i+j)/2,s);\n    sort((i+j)/2+1,j,s);\n    int a=i,b=(i+j)/2+1;\n    int d;\n    for(d=i;d<=j;d++){\n      if((i+j)/2<a){\n        f[d][0]=s[b][0];\n        f[d][1]=s[b][1];\n        b++;\n      }\n      else if(j<b){\n        f[d][0]=s[a][0];\n        f[d][1]=s[a][1];\n        a++;\n      }\n      else if(s[a][1]>s[b][1]){\n        f[d][0]=s[a][0];\n        f[d][1]=s[a][1];\n        a++;\n      }\n      else{\n        f[d][0]=s[b][0];\n        f[d][1]=s[b][1];\n        b++;\n      }\n    }\n    for(d=i;d<=j;d++){\n      s[d][0]=f[d][0];\n      s[d][1]=f[d][1];\n    }\n  }\n}\n\nint main(){\n  int n,m,i;\n  scanf(\"%d%d\",&n,&m);\n  int a[n+1],b[m+1][2];\n  for(i=0;i<n;i++)\n    scanf(\"%d\",&a[i]);\n  merge(0,n-1,a);\n  for(i=0;i<m;i++)\n    scanf(\"%d%d\",&b[i][0],&b[i][1]);\n  sort(0,m-1,b);\n  int j=0,jcount=0;\n  long long sum=0;\n  for(i=0;i<n;i++){\n    if(jcount==b[j][0]){\n      j++;\n      jcount=0;\n    }\n    if(a[i]<b[j][1]){\n      a[i]=b[j][1];\n      jcount++;\n    }\n    long long num=a[i];\n    sum+=num;\n  }\n  printf(\"%lld\\n\",sum);\n  return 0;\n}\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nYou have N cards. On the i-th card, an integer A_i is written.\n\nFor each j = 1, 2, ..., M in this order, you will perform the following operation once:\n\nOperation: Choose at most B_j cards (possibly zero). Replace the integer written on each chosen card with C_j.\n\nFind the maximum possible sum of the integers written on the N cards after the M operations.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 10^5\n\n1 \\leq M \\leq 10^5\n\n1 \\leq A_i, C_i \\leq 10^9\n\n1 \\leq B_i \\leq N\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nA_1 A_2 ... A_N\nB_1 C_1\nB_2 C_2\n\\vdots\nB_M C_M\n\nOutput\n\nPrint the maximum possible sum of the integers written on the N cards after the M operations.\n\nSample Input 1\n\n3 2\n5 1 4\n2 3\n1 5\n\nSample Output 1\n\n14\n\nBy replacing the integer on the second card with 5, the sum of the integers written on the three cards becomes 5 + 5 + 4 = 14, which is the maximum result.\n\nSample Input 2\n\n10 3\n1 8 5 7 100 4 52 33 13 5\n3 10\n4 30\n1 4\n\nSample Output 2\n\n338\n\nSample Input 3\n\n3 2\n100 100 100\n3 99\n3 99\n\nSample Output 3\n\n300\n\nSample Input 4\n\n11 3\n1 1 1 1 1 1 1 1 1 1 1\n3 1000000000\n4 1000000000\n3 1000000000\n\nSample Output 4\n\n10000000001\n\nThe output may not fit into a 32-bit integer type.", "sample_input": "3 2\n5 1 4\n2 3\n1 5\n"}, "reference_outputs": ["14\n"], "source_document_id": "p03038", "source_text": "Score : 400 points\n\nProblem Statement\n\nYou have N cards. On the i-th card, an integer A_i is written.\n\nFor each j = 1, 2, ..., M in this order, you will perform the following operation once:\n\nOperation: Choose at most B_j cards (possibly zero). Replace the integer written on each chosen card with C_j.\n\nFind the maximum possible sum of the integers written on the N cards after the M operations.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 10^5\n\n1 \\leq M \\leq 10^5\n\n1 \\leq A_i, C_i \\leq 10^9\n\n1 \\leq B_i \\leq N\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nA_1 A_2 ... A_N\nB_1 C_1\nB_2 C_2\n\\vdots\nB_M C_M\n\nOutput\n\nPrint the maximum possible sum of the integers written on the N cards after the M operations.\n\nSample Input 1\n\n3 2\n5 1 4\n2 3\n1 5\n\nSample Output 1\n\n14\n\nBy replacing the integer on the second card with 5, the sum of the integers written on the three cards becomes 5 + 5 + 4 = 14, which is the maximum result.\n\nSample Input 2\n\n10 3\n1 8 5 7 100 4 52 33 13 5\n3 10\n4 30\n1 4\n\nSample Output 2\n\n338\n\nSample Input 3\n\n3 2\n100 100 100\n3 99\n3 99\n\nSample Output 3\n\n300\n\nSample Input 4\n\n11 3\n1 1 1 1 1 1 1 1 1 1 1\n3 1000000000\n4 1000000000\n3 1000000000\n\nSample Output 4\n\n10000000001\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": 1597, "cpu_time_ms": 55, "memory_kb": 2560}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s474052208", "group_id": "codeNet:p03038", "input_text": "#include <stdio.h>\n#include <string.h>\n#include <limits.h>\n#include <stdlib.h>\n#include <math.h>\n\n\nint merge(long int a1[], long int a2[], int a1_size, int a2_size, long int a[]);\nint merge2(long int b1[], long int b2[], long int c1[], long int c2[], int b1_size, int b2_size, long int b[], long int c[]);\nint mergeSort(long int a[], int number);\nint mergeSort2(long int a[], long int b[], int number);\n\nint main(void)\n{\n\tint n, m;\n\tlong int sum = 0;\n\tint i, j, index = 0;;\n\tlong int work;\n\tlong int a[100000], b[100000], c[100000];\n\t\n\tscanf(\"%d%d\", &n, &m);\n\t\n\tfor(i = 0; i < n; i++) {\n\t\tscanf(\"%ld\", &a[i]);\n\t\tsum += a[i];\n\t}\n\tfor(i = 0; i < m; i++) {\n\t\tscanf(\"%ld%ld\", &b[i], &c[i]);\n\t}\n\t\n\tmergeSort(a, n);\n\tmergeSort2(b, c, m);\n\t\t\n\tfor(i = 0; i < m; i++) {\n\t\tif(a[index] > c[i]) {\n\t\t\tbreak;\n\t\t}\n\t\tfor(j = 0; j < b[i]; j++) {\n\t\t\tif(index + j >= n) {\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tif(a[index + j] < c[i]) {\n\t\t\t\tsum += c[i] - a[index + j];\n\t\t\t}\n\t\t}\n\t\tindex += b[i];\n\t\tif(index >= n) {\n\t\t\tbreak;\n\t\t}\n\t}\n\t/*\n\tfor(i = 0; i < n; i++) {\n\t\tprintf(\"%ld\\n\", a[i]);\n\t}\n\t\n\tfor(i = 0; i < m; i++) {\n\t\tprintf(\"%ld %ld\\n\", b[i], c[i]);\n\t}\n\t*/\n\tprintf(\"%ld\\n\", sum);\n\t\n\treturn 0;\n}\n\nint merge(long int a1[], long int a2[], int a1_size, int a2_size, long int a[])\n{\n\tint i = 0, j = 0;\n\t\n\twhile(i < a1_size ) {\n\t\tif( (j >= a2_size ) || ( (i < a1_size) && (a1[i] < a2[j]) ) ) {\n\t\t\ta[i + j] = a1[i];\n\t\t\ti++;\n\t\t} else {\n\t\t\ta[i + j] = a2[j];\n\t\t\tj++;\n\t\t}\n\t}\n\t\n\treturn 0;\n}\n\nint merge2(long int b1[], long int b2[], long int c1[], long int c2[], int b1_size, int b2_size, long int b[], long int c[])\n{\n\tint i = 0, j = 0;\n\t\n\t\n\twhile(i < b1_size ) {\n\t\tif( (j >= b2_size ) || ( (i < b1_size) && (c1[i] > c2[j]) ) ) {\n\t\t\tb[i + j] = b1[i];\n\t\t\tc[i + j] = c1[i];\n\t\t\ti++;\n\t\t} else {\n\t\t\tb[i + j] = b2[j];\n\t\t\tc[i + j] = c2[j];\n\t\t\tj++;\n\t\t}\n\t}\n\t\n\treturn 0;\n}\n\nint mergeSort(long int a[], int number)\n{\n\tint m = number / 2, n = number - m;\n\tlong int a1[m];\n\tlong int a2[n];\n\tint i, j;\n\t\n\tif(number > 1) {\n\t\tfor(i = 0; i < m; i++) {\n\t\t\ta1[i] = a[i];\n\t\t}\n\t\tfor(i = 0; i < n; i++) {\n\t\t\ta2[i] = a[m + i];\n\t\t}\n\t\tmergeSort(a1, m);\n\t\tmergeSort(a2, n);\n\t\tmerge(a1, a2, m, n, a);\n\t}\n\t\n\treturn 0;\n}\n\nint mergeSort2(long int b[], long int c[], int number)\n{\n\tint m = number / 2, n = number - m;\n\tlong int b1[m];\n\tlong int b2[n];\n\tlong int c1[m];\n\tlong int c2[n];\n\tint i, j;\n\t\n\tif(number > 1) {\n\t\tfor(i = 0; i < m; i++) {\n\t\t\tb1[i] = b[i];\n\t\t}\n\t\tfor(i = 0; i < n; i++) {\n\t\t\tb2[i] = b[m + i];\n\t\t}\n\t\t\n\t\tfor(i = 0; i < m; i++) {\n\t\t\tc1[i] = c[i];\n\t\t}\n\t\tfor(i = 0; i < n; i++) {\n\t\t\tc2[i] = c[m + i];\n\t\t}\n\t\t\n\t\tmergeSort2(b1, c1, n);\n\t\tmergeSort2(b2, c2, m);\n\t\tmerge2(b1, b2, c1, c2, m, n, b, c);\n\t}\n\t\n\treturn 0;\n}", "language": "C", "metadata": {"date": 1558845084, "filename_ext": "c", "original_language": "C (Clang 3.8.0)", "problem_description_relpath": "problem_descriptions/p03038.html", "problem_id": "p03038", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03038/input.txt", "sample_output_relpath": "derived/input_output/data/p03038/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03038/C/s474052208.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s474052208", "user_id": "u833841247"}, "prompt_components": {"gold_output": "14\n", "input_to_evaluate": "#include <stdio.h>\n#include <string.h>\n#include <limits.h>\n#include <stdlib.h>\n#include <math.h>\n\n\nint merge(long int a1[], long int a2[], int a1_size, int a2_size, long int a[]);\nint merge2(long int b1[], long int b2[], long int c1[], long int c2[], int b1_size, int b2_size, long int b[], long int c[]);\nint mergeSort(long int a[], int number);\nint mergeSort2(long int a[], long int b[], int number);\n\nint main(void)\n{\n\tint n, m;\n\tlong int sum = 0;\n\tint i, j, index = 0;;\n\tlong int work;\n\tlong int a[100000], b[100000], c[100000];\n\t\n\tscanf(\"%d%d\", &n, &m);\n\t\n\tfor(i = 0; i < n; i++) {\n\t\tscanf(\"%ld\", &a[i]);\n\t\tsum += a[i];\n\t}\n\tfor(i = 0; i < m; i++) {\n\t\tscanf(\"%ld%ld\", &b[i], &c[i]);\n\t}\n\t\n\tmergeSort(a, n);\n\tmergeSort2(b, c, m);\n\t\t\n\tfor(i = 0; i < m; i++) {\n\t\tif(a[index] > c[i]) {\n\t\t\tbreak;\n\t\t}\n\t\tfor(j = 0; j < b[i]; j++) {\n\t\t\tif(index + j >= n) {\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tif(a[index + j] < c[i]) {\n\t\t\t\tsum += c[i] - a[index + j];\n\t\t\t}\n\t\t}\n\t\tindex += b[i];\n\t\tif(index >= n) {\n\t\t\tbreak;\n\t\t}\n\t}\n\t/*\n\tfor(i = 0; i < n; i++) {\n\t\tprintf(\"%ld\\n\", a[i]);\n\t}\n\t\n\tfor(i = 0; i < m; i++) {\n\t\tprintf(\"%ld %ld\\n\", b[i], c[i]);\n\t}\n\t*/\n\tprintf(\"%ld\\n\", sum);\n\t\n\treturn 0;\n}\n\nint merge(long int a1[], long int a2[], int a1_size, int a2_size, long int a[])\n{\n\tint i = 0, j = 0;\n\t\n\twhile(i < a1_size ) {\n\t\tif( (j >= a2_size ) || ( (i < a1_size) && (a1[i] < a2[j]) ) ) {\n\t\t\ta[i + j] = a1[i];\n\t\t\ti++;\n\t\t} else {\n\t\t\ta[i + j] = a2[j];\n\t\t\tj++;\n\t\t}\n\t}\n\t\n\treturn 0;\n}\n\nint merge2(long int b1[], long int b2[], long int c1[], long int c2[], int b1_size, int b2_size, long int b[], long int c[])\n{\n\tint i = 0, j = 0;\n\t\n\t\n\twhile(i < b1_size ) {\n\t\tif( (j >= b2_size ) || ( (i < b1_size) && (c1[i] > c2[j]) ) ) {\n\t\t\tb[i + j] = b1[i];\n\t\t\tc[i + j] = c1[i];\n\t\t\ti++;\n\t\t} else {\n\t\t\tb[i + j] = b2[j];\n\t\t\tc[i + j] = c2[j];\n\t\t\tj++;\n\t\t}\n\t}\n\t\n\treturn 0;\n}\n\nint mergeSort(long int a[], int number)\n{\n\tint m = number / 2, n = number - m;\n\tlong int a1[m];\n\tlong int a2[n];\n\tint i, j;\n\t\n\tif(number > 1) {\n\t\tfor(i = 0; i < m; i++) {\n\t\t\ta1[i] = a[i];\n\t\t}\n\t\tfor(i = 0; i < n; i++) {\n\t\t\ta2[i] = a[m + i];\n\t\t}\n\t\tmergeSort(a1, m);\n\t\tmergeSort(a2, n);\n\t\tmerge(a1, a2, m, n, a);\n\t}\n\t\n\treturn 0;\n}\n\nint mergeSort2(long int b[], long int c[], int number)\n{\n\tint m = number / 2, n = number - m;\n\tlong int b1[m];\n\tlong int b2[n];\n\tlong int c1[m];\n\tlong int c2[n];\n\tint i, j;\n\t\n\tif(number > 1) {\n\t\tfor(i = 0; i < m; i++) {\n\t\t\tb1[i] = b[i];\n\t\t}\n\t\tfor(i = 0; i < n; i++) {\n\t\t\tb2[i] = b[m + i];\n\t\t}\n\t\t\n\t\tfor(i = 0; i < m; i++) {\n\t\t\tc1[i] = c[i];\n\t\t}\n\t\tfor(i = 0; i < n; i++) {\n\t\t\tc2[i] = c[m + i];\n\t\t}\n\t\t\n\t\tmergeSort2(b1, c1, n);\n\t\tmergeSort2(b2, c2, m);\n\t\tmerge2(b1, b2, c1, c2, m, n, b, c);\n\t}\n\t\n\treturn 0;\n}", "problem_context": "Score : 400 points\n\nProblem Statement\n\nYou have N cards. On the i-th card, an integer A_i is written.\n\nFor each j = 1, 2, ..., M in this order, you will perform the following operation once:\n\nOperation: Choose at most B_j cards (possibly zero). Replace the integer written on each chosen card with C_j.\n\nFind the maximum possible sum of the integers written on the N cards after the M operations.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 10^5\n\n1 \\leq M \\leq 10^5\n\n1 \\leq A_i, C_i \\leq 10^9\n\n1 \\leq B_i \\leq N\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nA_1 A_2 ... A_N\nB_1 C_1\nB_2 C_2\n\\vdots\nB_M C_M\n\nOutput\n\nPrint the maximum possible sum of the integers written on the N cards after the M operations.\n\nSample Input 1\n\n3 2\n5 1 4\n2 3\n1 5\n\nSample Output 1\n\n14\n\nBy replacing the integer on the second card with 5, the sum of the integers written on the three cards becomes 5 + 5 + 4 = 14, which is the maximum result.\n\nSample Input 2\n\n10 3\n1 8 5 7 100 4 52 33 13 5\n3 10\n4 30\n1 4\n\nSample Output 2\n\n338\n\nSample Input 3\n\n3 2\n100 100 100\n3 99\n3 99\n\nSample Output 3\n\n300\n\nSample Input 4\n\n11 3\n1 1 1 1 1 1 1 1 1 1 1\n3 1000000000\n4 1000000000\n3 1000000000\n\nSample Output 4\n\n10000000001\n\nThe output may not fit into a 32-bit integer type.", "sample_input": "3 2\n5 1 4\n2 3\n1 5\n"}, "reference_outputs": ["14\n"], "source_document_id": "p03038", "source_text": "Score : 400 points\n\nProblem Statement\n\nYou have N cards. On the i-th card, an integer A_i is written.\n\nFor each j = 1, 2, ..., M in this order, you will perform the following operation once:\n\nOperation: Choose at most B_j cards (possibly zero). Replace the integer written on each chosen card with C_j.\n\nFind the maximum possible sum of the integers written on the N cards after the M operations.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 10^5\n\n1 \\leq M \\leq 10^5\n\n1 \\leq A_i, C_i \\leq 10^9\n\n1 \\leq B_i \\leq N\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nA_1 A_2 ... A_N\nB_1 C_1\nB_2 C_2\n\\vdots\nB_M C_M\n\nOutput\n\nPrint the maximum possible sum of the integers written on the N cards after the M operations.\n\nSample Input 1\n\n3 2\n5 1 4\n2 3\n1 5\n\nSample Output 1\n\n14\n\nBy replacing the integer on the second card with 5, the sum of the integers written on the three cards becomes 5 + 5 + 4 = 14, which is the maximum result.\n\nSample Input 2\n\n10 3\n1 8 5 7 100 4 52 33 13 5\n3 10\n4 30\n1 4\n\nSample Output 2\n\n338\n\nSample Input 3\n\n3 2\n100 100 100\n3 99\n3 99\n\nSample Output 3\n\n300\n\nSample Input 4\n\n11 3\n1 1 1 1 1 1 1 1 1 1 1\n3 1000000000\n4 1000000000\n3 1000000000\n\nSample Output 4\n\n10000000001\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": 2649, "cpu_time_ms": 150, "memory_kb": 5632}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s684224854", "group_id": "codeNet:p03039", "input_text": "#include <stdio.h>\n#define MAX 200010\n#define MOD 1000000007\n\nlong long int fac[MAX]={0};\nlong long int inv[MAX]={0};\nlong long int finv[MAX]={0};\nint i;\n\nvoid comb_init()\n{\n\tfac[0]=1;\n\tfac[1]=1;\n\tfinv[0]=1;\n\tfinv[1]=1;\n\tinv[1]=1;\n\tfor(i=2;i<MAX;i++)\n\t{\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\nlong long int comb(int n,int k)\n{\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\nlong long int tetra(int n)\n{\n\tlong long int lln=(long long int)n;\n\treturn (lln*(lln+1)*(lln+2)/6)%MOD;\n}\n\nint main()\n{\n\tint n,m,k;\n\t\n\tlong long int ans,a,b;\n\tscanf(\"%d %d %d\",&n,&m,&k);\n\tcomb_init();\n\ta=((tetra(m-1)*n)%MOD*n)%MOD;\n\t//printf(\"%d\\n\",((tetra(m-1)*n)%MOD*n));\n\tb=((tetra(n-1)*m)%MOD*m)%MOD;\n\tans=(((a+b)%MOD)*(comb((n*m-2),(k-2)))%MOD);\n\t//printf(\"%d %d %d\",a+b,comb((n*m-2),(k-2)),ans);\n\tprintf(\"%d\",ans);\n\treturn 0;\n}\n", "language": "C", "metadata": {"date": 1559751545, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "problem_description_relpath": "problem_descriptions/p03039.html", "problem_id": "p03039", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03039/input.txt", "sample_output_relpath": "derived/input_output/data/p03039/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03039/C/s684224854.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s684224854", "user_id": "u791173062"}, "prompt_components": {"gold_output": "8\n", "input_to_evaluate": "#include <stdio.h>\n#define MAX 200010\n#define MOD 1000000007\n\nlong long int fac[MAX]={0};\nlong long int inv[MAX]={0};\nlong long int finv[MAX]={0};\nint i;\n\nvoid comb_init()\n{\n\tfac[0]=1;\n\tfac[1]=1;\n\tfinv[0]=1;\n\tfinv[1]=1;\n\tinv[1]=1;\n\tfor(i=2;i<MAX;i++)\n\t{\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\nlong long int comb(int n,int k)\n{\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\nlong long int tetra(int n)\n{\n\tlong long int lln=(long long int)n;\n\treturn (lln*(lln+1)*(lln+2)/6)%MOD;\n}\n\nint main()\n{\n\tint n,m,k;\n\t\n\tlong long int ans,a,b;\n\tscanf(\"%d %d %d\",&n,&m,&k);\n\tcomb_init();\n\ta=((tetra(m-1)*n)%MOD*n)%MOD;\n\t//printf(\"%d\\n\",((tetra(m-1)*n)%MOD*n));\n\tb=((tetra(n-1)*m)%MOD*m)%MOD;\n\tans=(((a+b)%MOD)*(comb((n*m-2),(k-2)))%MOD);\n\t//printf(\"%d %d %d\",a+b,comb((n*m-2),(k-2)),ans);\n\tprintf(\"%d\",ans);\n\treturn 0;\n}\n", "problem_context": "Score : 500 points\n\nProblem Statement\n\nWe have a grid of squares with N rows and M columns. Let (i, j) denote the square at the i-th row from the top and j-th column from the left. We will choose K of the squares and put a piece on each of them.\n\nIf we place the K pieces on squares (x_1, y_1), (x_2, y_2), ..., and (x_K, y_K), the cost of this arrangement is computed as:\n\n\\sum_{i=1}^{K-1} \\sum_{j=i+1}^K (|x_i - x_j| + |y_i - y_j|)\n\nFind the sum of the costs of all possible arrangements of the pieces. Since this value can be tremendous, print it modulo 10^9+7.\n\nWe consider two arrangements of the pieces different if and only if there is a square that contains a piece in one of the arrangements but not in the other.\n\nConstraints\n\n2 \\leq N \\times M \\leq 2 \\times 10^5\n\n2 \\leq K \\leq N \\times M\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M K\n\nOutput\n\nPrint the sum of the costs of all possible arrangements of the pieces, modulo 10^9+7.\n\nSample Input 1\n\n2 2 2\n\nSample Output 1\n\n8\n\nThere are six possible arrangements of the pieces, as follows:\n\n((1,1),(1,2)), with the cost |1-1|+|1-2| = 1\n\n((1,1),(2,1)), with the cost |1-2|+|1-1| = 1\n\n((1,1),(2,2)), with the cost |1-2|+|1-2| = 2\n\n((1,2),(2,1)), with the cost |1-2|+|2-1| = 2\n\n((1,2),(2,2)), with the cost |1-2|+|2-2| = 1\n\n((2,1),(2,2)), with the cost |2-2|+|1-2| = 1\n\nThe sum of these costs is 8.\n\nSample Input 2\n\n4 5 4\n\nSample Output 2\n\n87210\n\nSample Input 3\n\n100 100 5000\n\nSample Output 3\n\n817260251\n\nBe sure to print the sum modulo 10^9+7.", "sample_input": "2 2 2\n"}, "reference_outputs": ["8\n"], "source_document_id": "p03039", "source_text": "Score : 500 points\n\nProblem Statement\n\nWe have a grid of squares with N rows and M columns. Let (i, j) denote the square at the i-th row from the top and j-th column from the left. We will choose K of the squares and put a piece on each of them.\n\nIf we place the K pieces on squares (x_1, y_1), (x_2, y_2), ..., and (x_K, y_K), the cost of this arrangement is computed as:\n\n\\sum_{i=1}^{K-1} \\sum_{j=i+1}^K (|x_i - x_j| + |y_i - y_j|)\n\nFind the sum of the costs of all possible arrangements of the pieces. Since this value can be tremendous, print it modulo 10^9+7.\n\nWe consider two arrangements of the pieces different if and only if there is a square that contains a piece in one of the arrangements but not in the other.\n\nConstraints\n\n2 \\leq N \\times M \\leq 2 \\times 10^5\n\n2 \\leq K \\leq N \\times M\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M K\n\nOutput\n\nPrint the sum of the costs of all possible arrangements of the pieces, modulo 10^9+7.\n\nSample Input 1\n\n2 2 2\n\nSample Output 1\n\n8\n\nThere are six possible arrangements of the pieces, as follows:\n\n((1,1),(1,2)), with the cost |1-1|+|1-2| = 1\n\n((1,1),(2,1)), with the cost |1-2|+|1-1| = 1\n\n((1,1),(2,2)), with the cost |1-2|+|1-2| = 2\n\n((1,2),(2,1)), with the cost |1-2|+|2-1| = 2\n\n((1,2),(2,2)), with the cost |1-2|+|2-2| = 1\n\n((2,1),(2,2)), with the cost |2-2|+|1-2| = 1\n\nThe sum of these costs is 8.\n\nSample Input 2\n\n4 5 4\n\nSample Output 2\n\n87210\n\nSample Input 3\n\n100 100 5000\n\nSample Output 3\n\n817260251\n\nBe sure to print 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": 910, "cpu_time_ms": 5, "memory_kb": 4864}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s610432625", "group_id": "codeNet:p03041", "input_text": "#include <stdio.h>\n#include <stdlib.h>\n\nint main(void){\n    int num, att, i;\n    char *message;\n\n    scanf(\"%d %d\", &num, &att);\n    message=(char*)malloc(sizeof(char)*(num+1));\n    (void)getchar();\n    for(i=0;i<num;i++){\n        scanf(\"%c\", &message[i]);\n    }\n\n    message[att-1]+=32;\n    printf(\"%s\\n\", message);\n    return 0;\n}", "language": "C", "metadata": {"date": 1561258378, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "problem_description_relpath": "problem_descriptions/p03041.html", "problem_id": "p03041", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03041/input.txt", "sample_output_relpath": "derived/input_output/data/p03041/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03041/C/s610432625.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s610432625", "user_id": "u150694792"}, "prompt_components": {"gold_output": "aBC\n", "input_to_evaluate": "#include <stdio.h>\n#include <stdlib.h>\n\nint main(void){\n    int num, att, i;\n    char *message;\n\n    scanf(\"%d %d\", &num, &att);\n    message=(char*)malloc(sizeof(char)*(num+1));\n    (void)getchar();\n    for(i=0;i<num;i++){\n        scanf(\"%c\", &message[i]);\n    }\n\n    message[att-1]+=32;\n    printf(\"%s\\n\", message);\n    return 0;\n}", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou are given a string S of length N consisting of A, B and C, and an integer K which is between 1 and N (inclusive).\nPrint the string S after lowercasing the K-th character in it.\n\nConstraints\n\n1 ≤ N ≤ 50\n\n1 ≤ K ≤ N\n\nS is a string of length N consisting of A, B and C.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nS\n\nOutput\n\nPrint the string S after lowercasing the K-th character in it.\n\nSample Input 1\n\n3 1\nABC\n\nSample Output 1\n\naBC\n\nSample Input 2\n\n4 3\nCABA\n\nSample Output 2\n\nCAbA", "sample_input": "3 1\nABC\n"}, "reference_outputs": ["aBC\n"], "source_document_id": "p03041", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou are given a string S of length N consisting of A, B and C, and an integer K which is between 1 and N (inclusive).\nPrint the string S after lowercasing the K-th character in it.\n\nConstraints\n\n1 ≤ N ≤ 50\n\n1 ≤ K ≤ N\n\nS is a string of length N consisting of A, B and C.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nS\n\nOutput\n\nPrint the string S after lowercasing the K-th character in it.\n\nSample Input 1\n\n3 1\nABC\n\nSample Output 1\n\naBC\n\nSample Input 2\n\n4 3\nCABA\n\nSample Output 2\n\nCAbA", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 332, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s625078742", "group_id": "codeNet:p03041", "input_text": "#define _CRT_SECURE_NO_WARNINGS\n#include<stdio.h>\n#include<string.h>\nint main() {\n\tint num, num1;\n\tchar str[50];\n\tscanf(\"%d %d\", &num, &num1);\n\t\n\t\t\n\t\n\t\tscanf(\"%s\", str);\n\t\n\tfor (int i = 0; i < num; i++) {\n\n\n\n\t\tif (num1 -1== i) {\n\t\t\tif ('A'==str[i]) {\n\t\t\t\tstr[i ] = 'a';\n\t\t\t}\n\t\t\telse if ('B'==str[i ]) {\n\t\t\t\tstr[i] = 'b';\n\t\t\t}\n\t\t\telse if ('C'==str[i]) {\n\t\t\t\tstr[i] = 'c';\n\t\t\t}\n\n\t\t}\n\t}\n\t\t\n\t\t\tprintf(\"%s\", str);\n\t\t\n\t}\n", "language": "C", "metadata": {"date": 1558321433, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "problem_description_relpath": "problem_descriptions/p03041.html", "problem_id": "p03041", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03041/input.txt", "sample_output_relpath": "derived/input_output/data/p03041/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03041/C/s625078742.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s625078742", "user_id": "u918373199"}, "prompt_components": {"gold_output": "aBC\n", "input_to_evaluate": "#define _CRT_SECURE_NO_WARNINGS\n#include<stdio.h>\n#include<string.h>\nint main() {\n\tint num, num1;\n\tchar str[50];\n\tscanf(\"%d %d\", &num, &num1);\n\t\n\t\t\n\t\n\t\tscanf(\"%s\", str);\n\t\n\tfor (int i = 0; i < num; i++) {\n\n\n\n\t\tif (num1 -1== i) {\n\t\t\tif ('A'==str[i]) {\n\t\t\t\tstr[i ] = 'a';\n\t\t\t}\n\t\t\telse if ('B'==str[i ]) {\n\t\t\t\tstr[i] = 'b';\n\t\t\t}\n\t\t\telse if ('C'==str[i]) {\n\t\t\t\tstr[i] = 'c';\n\t\t\t}\n\n\t\t}\n\t}\n\t\t\n\t\t\tprintf(\"%s\", str);\n\t\t\n\t}\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou are given a string S of length N consisting of A, B and C, and an integer K which is between 1 and N (inclusive).\nPrint the string S after lowercasing the K-th character in it.\n\nConstraints\n\n1 ≤ N ≤ 50\n\n1 ≤ K ≤ N\n\nS is a string of length N consisting of A, B and C.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nS\n\nOutput\n\nPrint the string S after lowercasing the K-th character in it.\n\nSample Input 1\n\n3 1\nABC\n\nSample Output 1\n\naBC\n\nSample Input 2\n\n4 3\nCABA\n\nSample Output 2\n\nCAbA", "sample_input": "3 1\nABC\n"}, "reference_outputs": ["aBC\n"], "source_document_id": "p03041", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou are given a string S of length N consisting of A, B and C, and an integer K which is between 1 and N (inclusive).\nPrint the string S after lowercasing the K-th character in it.\n\nConstraints\n\n1 ≤ N ≤ 50\n\n1 ≤ K ≤ N\n\nS is a string of length N consisting of A, B and C.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nS\n\nOutput\n\nPrint the string S after lowercasing the K-th character in it.\n\nSample Input 1\n\n3 1\nABC\n\nSample Output 1\n\naBC\n\nSample Input 2\n\n4 3\nCABA\n\nSample Output 2\n\nCAbA", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s969060631", "group_id": "codeNet:p03042", "input_text": "#include<stdio.h>\n\nint main()\n{\n    int num,n1,n2,i;\n    scanf(\"%d\",&num);\n\n    n1 = num%100;\n    n2 = num/100;\n\n    if(n2>=0 && n2<=99 && n1>0 && n1<=12 && n1>=0 && n1<=99 && n2>0 && n2<=12) printf(\"AMBIGUOUS\\n\");\n\n    else if(n2>=0 && n2<=99 && n1>0 && n1<=12) printf(\"YYMM\\n\");\n\n    else if(n1>=0 && n1<=99 && n2>0 && n2<=12) printf(\"YYMM\\n\");\n\n    else  printf(\"NA\\n\");\n\n    return 0;\n}\n", "language": "C", "metadata": {"date": 1558819676, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "problem_description_relpath": "problem_descriptions/p03042.html", "problem_id": "p03042", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03042/input.txt", "sample_output_relpath": "derived/input_output/data/p03042/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03042/C/s969060631.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s969060631", "user_id": "u516513783"}, "prompt_components": {"gold_output": "YYMM\n", "input_to_evaluate": "#include<stdio.h>\n\nint main()\n{\n    int num,n1,n2,i;\n    scanf(\"%d\",&num);\n\n    n1 = num%100;\n    n2 = num/100;\n\n    if(n2>=0 && n2<=99 && n1>0 && n1<=12 && n1>=0 && n1<=99 && n2>0 && n2<=12) printf(\"AMBIGUOUS\\n\");\n\n    else if(n2>=0 && n2<=99 && n1>0 && n1<=12) printf(\"YYMM\\n\");\n\n    else if(n1>=0 && n1<=99 && n2>0 && n2<=12) printf(\"YYMM\\n\");\n\n    else  printf(\"NA\\n\");\n\n    return 0;\n}\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nYou have a digit sequence S of length 4. You are wondering which of the following formats S is in:\n\nYYMM format: the last two digits of the year and the two-digit representation of the month (example: 01 for January), concatenated in this order\n\nMMYY format: the two-digit representation of the month and the last two digits of the year, concatenated in this order\n\nIf S is valid in only YYMM format, print YYMM; if S is valid in only MMYY format, print MMYY; if S is valid in both formats, print AMBIGUOUS; if S is valid in neither format, print NA.\n\nConstraints\n\nS is a digit sequence of length 4.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the specified string: YYMM, MMYY, AMBIGUOUS or NA.\n\nSample Input 1\n\n1905\n\nSample Output 1\n\nYYMM\n\nMay XX19 is a valid date, but 19 is not valid as a month. Thus, this string is only valid in YYMM format.\n\nSample Input 2\n\n0112\n\nSample Output 2\n\nAMBIGUOUS\n\nBoth December XX01 and January XX12 are valid dates. Thus, this string is valid in both formats.\n\nSample Input 3\n\n1700\n\nSample Output 3\n\nNA\n\nNeither 0 nor 17 is valid as a month. Thus, this string is valid in neither format.", "sample_input": "1905\n"}, "reference_outputs": ["YYMM\n"], "source_document_id": "p03042", "source_text": "Score : 200 points\n\nProblem Statement\n\nYou have a digit sequence S of length 4. You are wondering which of the following formats S is in:\n\nYYMM format: the last two digits of the year and the two-digit representation of the month (example: 01 for January), concatenated in this order\n\nMMYY format: the two-digit representation of the month and the last two digits of the year, concatenated in this order\n\nIf S is valid in only YYMM format, print YYMM; if S is valid in only MMYY format, print MMYY; if S is valid in both formats, print AMBIGUOUS; if S is valid in neither format, print NA.\n\nConstraints\n\nS is a digit sequence of length 4.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the specified string: YYMM, MMYY, AMBIGUOUS or NA.\n\nSample Input 1\n\n1905\n\nSample Output 1\n\nYYMM\n\nMay XX19 is a valid date, but 19 is not valid as a month. Thus, this string is only valid in YYMM format.\n\nSample Input 2\n\n0112\n\nSample Output 2\n\nAMBIGUOUS\n\nBoth December XX01 and January XX12 are valid dates. Thus, this string is valid in both formats.\n\nSample Input 3\n\n1700\n\nSample Output 3\n\nNA\n\nNeither 0 nor 17 is valid as a month. Thus, this string is valid in neither format.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 391, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s583424067", "group_id": "codeNet:p03042", "input_text": "#include <stdio.h>\n#include <stdlib.h>\n#include <string.h>\n#include <math.h>\n#include <time.h>\n \nint main(int argc, char const *argv[])\n{\n\tint n;\n\tint l,r;\n\n\tscanf(\"%d\",&n);\n\tl = n / 100;\n\tr = n % 100;\n\n\tif( 1 <= l && l <= 12 )\n\t{\n\t\tif( 1 <= r && r <= 12 )\n\t\t\tputs(\"AMBIGUOUS\");\n\t\telse\n\t\t\tputs(\"MMYY\");\n\t}\n\telse{\n\t\tif( 1 <= r && r <= 12 )\n\t\t\tputs(\"YYMM\");\n\t\telse\n\t\t\tputs(\"NA\");\n\t}\n\n\treturn 0;\n}", "language": "C", "metadata": {"date": 1558376500, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "problem_description_relpath": "problem_descriptions/p03042.html", "problem_id": "p03042", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03042/input.txt", "sample_output_relpath": "derived/input_output/data/p03042/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03042/C/s583424067.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s583424067", "user_id": "u266344698"}, "prompt_components": {"gold_output": "YYMM\n", "input_to_evaluate": "#include <stdio.h>\n#include <stdlib.h>\n#include <string.h>\n#include <math.h>\n#include <time.h>\n \nint main(int argc, char const *argv[])\n{\n\tint n;\n\tint l,r;\n\n\tscanf(\"%d\",&n);\n\tl = n / 100;\n\tr = n % 100;\n\n\tif( 1 <= l && l <= 12 )\n\t{\n\t\tif( 1 <= r && r <= 12 )\n\t\t\tputs(\"AMBIGUOUS\");\n\t\telse\n\t\t\tputs(\"MMYY\");\n\t}\n\telse{\n\t\tif( 1 <= r && r <= 12 )\n\t\t\tputs(\"YYMM\");\n\t\telse\n\t\t\tputs(\"NA\");\n\t}\n\n\treturn 0;\n}", "problem_context": "Score : 200 points\n\nProblem Statement\n\nYou have a digit sequence S of length 4. You are wondering which of the following formats S is in:\n\nYYMM format: the last two digits of the year and the two-digit representation of the month (example: 01 for January), concatenated in this order\n\nMMYY format: the two-digit representation of the month and the last two digits of the year, concatenated in this order\n\nIf S is valid in only YYMM format, print YYMM; if S is valid in only MMYY format, print MMYY; if S is valid in both formats, print AMBIGUOUS; if S is valid in neither format, print NA.\n\nConstraints\n\nS is a digit sequence of length 4.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the specified string: YYMM, MMYY, AMBIGUOUS or NA.\n\nSample Input 1\n\n1905\n\nSample Output 1\n\nYYMM\n\nMay XX19 is a valid date, but 19 is not valid as a month. Thus, this string is only valid in YYMM format.\n\nSample Input 2\n\n0112\n\nSample Output 2\n\nAMBIGUOUS\n\nBoth December XX01 and January XX12 are valid dates. Thus, this string is valid in both formats.\n\nSample Input 3\n\n1700\n\nSample Output 3\n\nNA\n\nNeither 0 nor 17 is valid as a month. Thus, this string is valid in neither format.", "sample_input": "1905\n"}, "reference_outputs": ["YYMM\n"], "source_document_id": "p03042", "source_text": "Score : 200 points\n\nProblem Statement\n\nYou have a digit sequence S of length 4. You are wondering which of the following formats S is in:\n\nYYMM format: the last two digits of the year and the two-digit representation of the month (example: 01 for January), concatenated in this order\n\nMMYY format: the two-digit representation of the month and the last two digits of the year, concatenated in this order\n\nIf S is valid in only YYMM format, print YYMM; if S is valid in only MMYY format, print MMYY; if S is valid in both formats, print AMBIGUOUS; if S is valid in neither format, print NA.\n\nConstraints\n\nS is a digit sequence of length 4.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the specified string: YYMM, MMYY, AMBIGUOUS or NA.\n\nSample Input 1\n\n1905\n\nSample Output 1\n\nYYMM\n\nMay XX19 is a valid date, but 19 is not valid as a month. Thus, this string is only valid in YYMM format.\n\nSample Input 2\n\n0112\n\nSample Output 2\n\nAMBIGUOUS\n\nBoth December XX01 and January XX12 are valid dates. Thus, this string is valid in both formats.\n\nSample Input 3\n\n1700\n\nSample Output 3\n\nNA\n\nNeither 0 nor 17 is valid as a month. Thus, this string is valid in neither format.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 394, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s733577947", "group_id": "codeNet:p03042", "input_text": "#include<stdio.h>\n\nint main(void)\n{\n  int S,S100,S1;\n  scanf(\"%d\",&S);\n  S100 = S/100;\n  S1 = S - (S100*100);\n  if(S100 >= 13){\n    if(S1 >= 13){\n      printf(\"NA\");\n    }\n    else if(S1 == 0){\n      printf(\"NA\");\n    }\n    else{\n      printf(\"YYMM\");\n    }\n  }\n  else if(S100 == 0){\n    printf(\"NA\");\n  }\n  else{\n    if(S1 >= 1 && S1 <=12){\n      printf(\"AMBIGUOUS\");\n    }\n    else if(S1 >= 13 && S1 <= 31){\n      printf(\"MMDD\");\n    }\n    else if(S1 == 0){\n      printf(\"NA\");\n    }\n    else{\n      printf(\"NA\");\n    }\n  }\n  return 0;\n  \n}", "language": "C", "metadata": {"date": 1558334686, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "problem_description_relpath": "problem_descriptions/p03042.html", "problem_id": "p03042", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03042/input.txt", "sample_output_relpath": "derived/input_output/data/p03042/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03042/C/s733577947.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s733577947", "user_id": "u112567325"}, "prompt_components": {"gold_output": "YYMM\n", "input_to_evaluate": "#include<stdio.h>\n\nint main(void)\n{\n  int S,S100,S1;\n  scanf(\"%d\",&S);\n  S100 = S/100;\n  S1 = S - (S100*100);\n  if(S100 >= 13){\n    if(S1 >= 13){\n      printf(\"NA\");\n    }\n    else if(S1 == 0){\n      printf(\"NA\");\n    }\n    else{\n      printf(\"YYMM\");\n    }\n  }\n  else if(S100 == 0){\n    printf(\"NA\");\n  }\n  else{\n    if(S1 >= 1 && S1 <=12){\n      printf(\"AMBIGUOUS\");\n    }\n    else if(S1 >= 13 && S1 <= 31){\n      printf(\"MMDD\");\n    }\n    else if(S1 == 0){\n      printf(\"NA\");\n    }\n    else{\n      printf(\"NA\");\n    }\n  }\n  return 0;\n  \n}", "problem_context": "Score : 200 points\n\nProblem Statement\n\nYou have a digit sequence S of length 4. You are wondering which of the following formats S is in:\n\nYYMM format: the last two digits of the year and the two-digit representation of the month (example: 01 for January), concatenated in this order\n\nMMYY format: the two-digit representation of the month and the last two digits of the year, concatenated in this order\n\nIf S is valid in only YYMM format, print YYMM; if S is valid in only MMYY format, print MMYY; if S is valid in both formats, print AMBIGUOUS; if S is valid in neither format, print NA.\n\nConstraints\n\nS is a digit sequence of length 4.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the specified string: YYMM, MMYY, AMBIGUOUS or NA.\n\nSample Input 1\n\n1905\n\nSample Output 1\n\nYYMM\n\nMay XX19 is a valid date, but 19 is not valid as a month. Thus, this string is only valid in YYMM format.\n\nSample Input 2\n\n0112\n\nSample Output 2\n\nAMBIGUOUS\n\nBoth December XX01 and January XX12 are valid dates. Thus, this string is valid in both formats.\n\nSample Input 3\n\n1700\n\nSample Output 3\n\nNA\n\nNeither 0 nor 17 is valid as a month. Thus, this string is valid in neither format.", "sample_input": "1905\n"}, "reference_outputs": ["YYMM\n"], "source_document_id": "p03042", "source_text": "Score : 200 points\n\nProblem Statement\n\nYou have a digit sequence S of length 4. You are wondering which of the following formats S is in:\n\nYYMM format: the last two digits of the year and the two-digit representation of the month (example: 01 for January), concatenated in this order\n\nMMYY format: the two-digit representation of the month and the last two digits of the year, concatenated in this order\n\nIf S is valid in only YYMM format, print YYMM; if S is valid in only MMYY format, print MMYY; if S is valid in both formats, print AMBIGUOUS; if S is valid in neither format, print NA.\n\nConstraints\n\nS is a digit sequence of length 4.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the specified string: YYMM, MMYY, AMBIGUOUS or NA.\n\nSample Input 1\n\n1905\n\nSample Output 1\n\nYYMM\n\nMay XX19 is a valid date, but 19 is not valid as a month. Thus, this string is only valid in YYMM format.\n\nSample Input 2\n\n0112\n\nSample Output 2\n\nAMBIGUOUS\n\nBoth December XX01 and January XX12 are valid dates. Thus, this string is valid in both formats.\n\nSample Input 3\n\n1700\n\nSample Output 3\n\nNA\n\nNeither 0 nor 17 is valid as a month. Thus, this string is valid in neither format.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 542, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s144829011", "group_id": "codeNet:p03042", "input_text": "#include <stdio.h>\n\nint main(){\n  int S; scanf(\"%d\", &S);\n  if(S >= 1213){\n    if((S % 100 <= 12) && (S % 100 != 0)){ // 9912, 1403, etc\n      printf(\"YYMM\"); \n    }\n    else{\n      printf(\"NA\");\n    }\n  }\n  \n  else{\n    if(S < 100){ // korede YYMM ka NA ga kakutei\n      if((S <= 12) && (S != 0)){ // 0012 ~ 0001\n\tprintf(\"YYMM\");\n      }\n      else{ // 0099 ~ 0013, 0000\n\tprintf(\"NA\");\n      }\n    }\n    else{ // \n      if((S % 100 <= 12) && (S % 100 != 0)){ // 1231 ~ \n\tprintf(\"AMBIGUOUS\");\n      }\n      else{\n\tprintf(\"YYMM\");\n      }\n    }\n  }\n  return 0;\n}\n", "language": "C", "metadata": {"date": 1558316604, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "problem_description_relpath": "problem_descriptions/p03042.html", "problem_id": "p03042", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03042/input.txt", "sample_output_relpath": "derived/input_output/data/p03042/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03042/C/s144829011.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s144829011", "user_id": "u415875614"}, "prompt_components": {"gold_output": "YYMM\n", "input_to_evaluate": "#include <stdio.h>\n\nint main(){\n  int S; scanf(\"%d\", &S);\n  if(S >= 1213){\n    if((S % 100 <= 12) && (S % 100 != 0)){ // 9912, 1403, etc\n      printf(\"YYMM\"); \n    }\n    else{\n      printf(\"NA\");\n    }\n  }\n  \n  else{\n    if(S < 100){ // korede YYMM ka NA ga kakutei\n      if((S <= 12) && (S != 0)){ // 0012 ~ 0001\n\tprintf(\"YYMM\");\n      }\n      else{ // 0099 ~ 0013, 0000\n\tprintf(\"NA\");\n      }\n    }\n    else{ // \n      if((S % 100 <= 12) && (S % 100 != 0)){ // 1231 ~ \n\tprintf(\"AMBIGUOUS\");\n      }\n      else{\n\tprintf(\"YYMM\");\n      }\n    }\n  }\n  return 0;\n}\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nYou have a digit sequence S of length 4. You are wondering which of the following formats S is in:\n\nYYMM format: the last two digits of the year and the two-digit representation of the month (example: 01 for January), concatenated in this order\n\nMMYY format: the two-digit representation of the month and the last two digits of the year, concatenated in this order\n\nIf S is valid in only YYMM format, print YYMM; if S is valid in only MMYY format, print MMYY; if S is valid in both formats, print AMBIGUOUS; if S is valid in neither format, print NA.\n\nConstraints\n\nS is a digit sequence of length 4.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the specified string: YYMM, MMYY, AMBIGUOUS or NA.\n\nSample Input 1\n\n1905\n\nSample Output 1\n\nYYMM\n\nMay XX19 is a valid date, but 19 is not valid as a month. Thus, this string is only valid in YYMM format.\n\nSample Input 2\n\n0112\n\nSample Output 2\n\nAMBIGUOUS\n\nBoth December XX01 and January XX12 are valid dates. Thus, this string is valid in both formats.\n\nSample Input 3\n\n1700\n\nSample Output 3\n\nNA\n\nNeither 0 nor 17 is valid as a month. Thus, this string is valid in neither format.", "sample_input": "1905\n"}, "reference_outputs": ["YYMM\n"], "source_document_id": "p03042", "source_text": "Score : 200 points\n\nProblem Statement\n\nYou have a digit sequence S of length 4. You are wondering which of the following formats S is in:\n\nYYMM format: the last two digits of the year and the two-digit representation of the month (example: 01 for January), concatenated in this order\n\nMMYY format: the two-digit representation of the month and the last two digits of the year, concatenated in this order\n\nIf S is valid in only YYMM format, print YYMM; if S is valid in only MMYY format, print MMYY; if S is valid in both formats, print AMBIGUOUS; if S is valid in neither format, print NA.\n\nConstraints\n\nS is a digit sequence of length 4.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the specified string: YYMM, MMYY, AMBIGUOUS or NA.\n\nSample Input 1\n\n1905\n\nSample Output 1\n\nYYMM\n\nMay XX19 is a valid date, but 19 is not valid as a month. Thus, this string is only valid in YYMM format.\n\nSample Input 2\n\n0112\n\nSample Output 2\n\nAMBIGUOUS\n\nBoth December XX01 and January XX12 are valid dates. Thus, this string is valid in both formats.\n\nSample Input 3\n\n1700\n\nSample Output 3\n\nNA\n\nNeither 0 nor 17 is valid as a month. Thus, this string is valid in neither format.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s477465603", "group_id": "codeNet:p03043", "input_text": "#include<stdio.h>\nint main(){\n    //printf(\"ok1\");\n    int n;\n    int k;\n    scanf(\"%d %d\",&n,&k);\n    int score=1;\n    float prob=0;\n   // printf(\"ok\");\n    for(int i=1;i<=n;i++){\n        float p=1;\n        while(score<k){\n            p=p/(2*n);\n            score=i;\n            score=score*2;\n        }\n        prob=prob+p;\n    }\n    printf(\"%f\",prob);\n    return 0;\n}", "language": "C", "metadata": {"date": 1598127855, "filename_ext": "c", "original_language": "C (GCC 9.2.1)", "problem_description_relpath": "problem_descriptions/p03043.html", "problem_id": "p03043", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03043/input.txt", "sample_output_relpath": "derived/input_output/data/p03043/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03043/C/s477465603.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s477465603", "user_id": "u403081723"}, "prompt_components": {"gold_output": "0.145833333333\n", "input_to_evaluate": "#include<stdio.h>\nint main(){\n    //printf(\"ok1\");\n    int n;\n    int k;\n    scanf(\"%d %d\",&n,&k);\n    int score=1;\n    float prob=0;\n   // printf(\"ok\");\n    for(int i=1;i<=n;i++){\n        float p=1;\n        while(score<k){\n            p=p/(2*n);\n            score=i;\n            score=score*2;\n        }\n        prob=prob+p;\n    }\n    printf(\"%f\",prob);\n    return 0;\n}", "problem_context": "Score : 300 points\n\nProblem Statement\n\nSnuke has a fair N-sided die that shows the integers from 1 to N with equal probability and a fair coin. He will play the following game with them:\n\nThrow the die. The current score is the result of the die.\n\nAs long as the score is between 1 and K-1 (inclusive), keep flipping the coin. The score is doubled each time the coin lands heads up, and the score becomes 0 if the coin lands tails up.\n\nThe game ends when the score becomes 0 or becomes K or above. Snuke wins if the score is K or above, and loses if the score is 0.\n\nYou are given N and K. Find the probability that Snuke wins the game.\n\nConstraints\n\n1 ≤ N ≤ 10^5\n\n1 ≤ K ≤ 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\n\nOutput\n\nPrint the probability that Snuke wins the game. The output is considered correct when the absolute or relative error is at most 10^{-9}.\n\nSample Input 1\n\n3 10\n\nSample Output 1\n\n0.145833333333\n\nIf the die shows 1, Snuke needs to get four consecutive heads from four coin flips to obtain a score of 10 or above. The probability of this happening is \\frac{1}{3} \\times (\\frac{1}{2})^4 = \\frac{1}{48}.\n\nIf the die shows 2, Snuke needs to get three consecutive heads from three coin flips to obtain a score of 10 or above. The probability of this happening is \\frac{1}{3} \\times (\\frac{1}{2})^3 = \\frac{1}{24}.\n\nIf the die shows 3, Snuke needs to get two consecutive heads from two coin flips to obtain a score of 10 or above. The probability of this happening is \\frac{1}{3} \\times (\\frac{1}{2})^2 = \\frac{1}{12}.\n\nThus, the probability that Snuke wins is \\frac{1}{48} + \\frac{1}{24} + \\frac{1}{12} = \\frac{7}{48} \\simeq 0.1458333333.\n\nSample Input 2\n\n100000 5\n\nSample Output 2\n\n0.999973749998", "sample_input": "3 10\n"}, "reference_outputs": ["0.145833333333\n"], "source_document_id": "p03043", "source_text": "Score : 300 points\n\nProblem Statement\n\nSnuke has a fair N-sided die that shows the integers from 1 to N with equal probability and a fair coin. He will play the following game with them:\n\nThrow the die. The current score is the result of the die.\n\nAs long as the score is between 1 and K-1 (inclusive), keep flipping the coin. The score is doubled each time the coin lands heads up, and the score becomes 0 if the coin lands tails up.\n\nThe game ends when the score becomes 0 or becomes K or above. Snuke wins if the score is K or above, and loses if the score is 0.\n\nYou are given N and K. Find the probability that Snuke wins the game.\n\nConstraints\n\n1 ≤ N ≤ 10^5\n\n1 ≤ K ≤ 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\n\nOutput\n\nPrint the probability that Snuke wins the game. The output is considered correct when the absolute or relative error is at most 10^{-9}.\n\nSample Input 1\n\n3 10\n\nSample Output 1\n\n0.145833333333\n\nIf the die shows 1, Snuke needs to get four consecutive heads from four coin flips to obtain a score of 10 or above. The probability of this happening is \\frac{1}{3} \\times (\\frac{1}{2})^4 = \\frac{1}{48}.\n\nIf the die shows 2, Snuke needs to get three consecutive heads from three coin flips to obtain a score of 10 or above. The probability of this happening is \\frac{1}{3} \\times (\\frac{1}{2})^3 = \\frac{1}{24}.\n\nIf the die shows 3, Snuke needs to get two consecutive heads from two coin flips to obtain a score of 10 or above. The probability of this happening is \\frac{1}{3} \\times (\\frac{1}{2})^2 = \\frac{1}{12}.\n\nThus, the probability that Snuke wins is \\frac{1}{48} + \\frac{1}{24} + \\frac{1}{12} = \\frac{7}{48} \\simeq 0.1458333333.\n\nSample Input 2\n\n100000 5\n\nSample Output 2\n\n0.999973749998", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 2205, "memory_kb": 1632}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s551421843", "group_id": "codeNet:p03043", "input_text": "#include <stdio.h>\n#include <math.h>\n\ndouble N;\ndouble K;\n\nint main(void){\n\tscanf(\"%lf %lf\",&N,&K);\n\n\tdouble winPro=0;\n\tdouble invN=1/N;\n\n\tdouble m;\n\n\tfor(double i=1; i<=N; i++){\n\n\t\tfor(m=0; ;m++){\n\t\t\tif(K<=pow(2,m)*i){\n\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\n\t\twinPro += invN * pow(0.5,m);\n\t}\n\n\tprintf(\"%.13lf\\n\",winPro);\n\n\n}", "language": "C", "metadata": {"date": 1558317847, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "problem_description_relpath": "problem_descriptions/p03043.html", "problem_id": "p03043", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03043/input.txt", "sample_output_relpath": "derived/input_output/data/p03043/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03043/C/s551421843.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s551421843", "user_id": "u107464079"}, "prompt_components": {"gold_output": "0.145833333333\n", "input_to_evaluate": "#include <stdio.h>\n#include <math.h>\n\ndouble N;\ndouble K;\n\nint main(void){\n\tscanf(\"%lf %lf\",&N,&K);\n\n\tdouble winPro=0;\n\tdouble invN=1/N;\n\n\tdouble m;\n\n\tfor(double i=1; i<=N; i++){\n\n\t\tfor(m=0; ;m++){\n\t\t\tif(K<=pow(2,m)*i){\n\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\n\t\twinPro += invN * pow(0.5,m);\n\t}\n\n\tprintf(\"%.13lf\\n\",winPro);\n\n\n}", "problem_context": "Score : 300 points\n\nProblem Statement\n\nSnuke has a fair N-sided die that shows the integers from 1 to N with equal probability and a fair coin. He will play the following game with them:\n\nThrow the die. The current score is the result of the die.\n\nAs long as the score is between 1 and K-1 (inclusive), keep flipping the coin. The score is doubled each time the coin lands heads up, and the score becomes 0 if the coin lands tails up.\n\nThe game ends when the score becomes 0 or becomes K or above. Snuke wins if the score is K or above, and loses if the score is 0.\n\nYou are given N and K. Find the probability that Snuke wins the game.\n\nConstraints\n\n1 ≤ N ≤ 10^5\n\n1 ≤ K ≤ 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\n\nOutput\n\nPrint the probability that Snuke wins the game. The output is considered correct when the absolute or relative error is at most 10^{-9}.\n\nSample Input 1\n\n3 10\n\nSample Output 1\n\n0.145833333333\n\nIf the die shows 1, Snuke needs to get four consecutive heads from four coin flips to obtain a score of 10 or above. The probability of this happening is \\frac{1}{3} \\times (\\frac{1}{2})^4 = \\frac{1}{48}.\n\nIf the die shows 2, Snuke needs to get three consecutive heads from three coin flips to obtain a score of 10 or above. The probability of this happening is \\frac{1}{3} \\times (\\frac{1}{2})^3 = \\frac{1}{24}.\n\nIf the die shows 3, Snuke needs to get two consecutive heads from two coin flips to obtain a score of 10 or above. The probability of this happening is \\frac{1}{3} \\times (\\frac{1}{2})^2 = \\frac{1}{12}.\n\nThus, the probability that Snuke wins is \\frac{1}{48} + \\frac{1}{24} + \\frac{1}{12} = \\frac{7}{48} \\simeq 0.1458333333.\n\nSample Input 2\n\n100000 5\n\nSample Output 2\n\n0.999973749998", "sample_input": "3 10\n"}, "reference_outputs": ["0.145833333333\n"], "source_document_id": "p03043", "source_text": "Score : 300 points\n\nProblem Statement\n\nSnuke has a fair N-sided die that shows the integers from 1 to N with equal probability and a fair coin. He will play the following game with them:\n\nThrow the die. The current score is the result of the die.\n\nAs long as the score is between 1 and K-1 (inclusive), keep flipping the coin. The score is doubled each time the coin lands heads up, and the score becomes 0 if the coin lands tails up.\n\nThe game ends when the score becomes 0 or becomes K or above. Snuke wins if the score is K or above, and loses if the score is 0.\n\nYou are given N and K. Find the probability that Snuke wins the game.\n\nConstraints\n\n1 ≤ N ≤ 10^5\n\n1 ≤ K ≤ 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\n\nOutput\n\nPrint the probability that Snuke wins the game. The output is considered correct when the absolute or relative error is at most 10^{-9}.\n\nSample Input 1\n\n3 10\n\nSample Output 1\n\n0.145833333333\n\nIf the die shows 1, Snuke needs to get four consecutive heads from four coin flips to obtain a score of 10 or above. The probability of this happening is \\frac{1}{3} \\times (\\frac{1}{2})^4 = \\frac{1}{48}.\n\nIf the die shows 2, Snuke needs to get three consecutive heads from three coin flips to obtain a score of 10 or above. The probability of this happening is \\frac{1}{3} \\times (\\frac{1}{2})^3 = \\frac{1}{24}.\n\nIf the die shows 3, Snuke needs to get two consecutive heads from two coin flips to obtain a score of 10 or above. The probability of this happening is \\frac{1}{3} \\times (\\frac{1}{2})^2 = \\frac{1}{12}.\n\nThus, the probability that Snuke wins is \\frac{1}{48} + \\frac{1}{24} + \\frac{1}{12} = \\frac{7}{48} \\simeq 0.1458333333.\n\nSample Input 2\n\n100000 5\n\nSample Output 2\n\n0.999973749998", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 308, "cpu_time_ms": 4, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s940912694", "group_id": "codeNet:p03047", "input_text": "#include <stdio.h>\n\nint main() {\n    int N, K, a;\n    scanf(\"%d, %d\", &N, &K);\n    if(N>50 || N <= 1) return -1;\n    else if(K > N) return -1;\n\n    a = N - K + 1;\n    printf(\"%d\", a);\n    \n    return 0;\n}", "language": "C", "metadata": {"date": 1557624700, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "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/C/s940912694.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s940912694", "user_id": "u014704891"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "#include <stdio.h>\n\nint main() {\n    int N, K, a;\n    scanf(\"%d, %d\", &N, &K);\n    if(N>50 || N <= 1) return -1;\n    else if(K > N) return -1;\n\n    a = N - K + 1;\n    printf(\"%d\", a);\n    \n    return 0;\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": 204, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s346638240", "group_id": "codeNet:p03048", "input_text": "#include <stdio.h>\nint main(void)\n{\n\tint r;\n\tint g;\n\tint b;\n\tint n;\n\tint x;\n\tint y;\n\tint temp;\n\tint res;\n\n\tscanf(\"%d%d%d%d\", &r,&g,&b,&n);\n\tres = 0;\n\tx = 0;\n\twhile (x <= n)\n\t{\n\t\ty = 0;\n\t\twhile (y <= n)\n\t\t{\n\t\t\ttemp = n - r*x - g*y;\n\t\t\tif (temp >= 0 && temp % b == 0)\n\t\t\t{\n\t\t\t\tres++;\n\t\t\t}\n\t\t\ty++;\n\t\t}\n\t\tx++;\n\t}\n\tprintf(\"%d\\n\", res);\n\treturn (0);\n}\n", "language": "C", "metadata": {"date": 1598577686, "filename_ext": "c", "original_language": "C (GCC 9.2.1)", "problem_description_relpath": "problem_descriptions/p03048.html", "problem_id": "p03048", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03048/input.txt", "sample_output_relpath": "derived/input_output/data/p03048/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03048/C/s346638240.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s346638240", "user_id": "u528349265"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "#include <stdio.h>\nint main(void)\n{\n\tint r;\n\tint g;\n\tint b;\n\tint n;\n\tint x;\n\tint y;\n\tint temp;\n\tint res;\n\n\tscanf(\"%d%d%d%d\", &r,&g,&b,&n);\n\tres = 0;\n\tx = 0;\n\twhile (x <= n)\n\t{\n\t\ty = 0;\n\t\twhile (y <= n)\n\t\t{\n\t\t\ttemp = n - r*x - g*y;\n\t\t\tif (temp >= 0 && temp % b == 0)\n\t\t\t{\n\t\t\t\tres++;\n\t\t\t}\n\t\t\ty++;\n\t\t}\n\t\tx++;\n\t}\n\tprintf(\"%d\\n\", res);\n\treturn (0);\n}\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nSnuke has come to a store that sells boxes containing balls. The store sells the following three kinds of boxes:\n\nRed boxes, each containing R red balls\n\nGreen boxes, each containing G green balls\n\nBlue boxes, each containing B blue balls\n\nSnuke wants to get a total of exactly N balls by buying r red boxes, g green boxes and b blue boxes.\nHow many triples of non-negative integers (r,g,b) achieve this?\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq R,G,B,N \\leq 3000\n\nInput\n\nInput is given from Standard Input in the following format:\n\nR G B N\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n1 2 3 4\n\nSample Output 1\n\n4\n\nFour triples achieve the objective, as follows:\n\n(4,0,0)\n\n(2,1,0)\n\n(1,0,1)\n\n(0,2,0)\n\nSample Input 2\n\n13 1 4 3000\n\nSample Output 2\n\n87058", "sample_input": "1 2 3 4\n"}, "reference_outputs": ["4\n"], "source_document_id": "p03048", "source_text": "Score : 200 points\n\nProblem Statement\n\nSnuke has come to a store that sells boxes containing balls. The store sells the following three kinds of boxes:\n\nRed boxes, each containing R red balls\n\nGreen boxes, each containing G green balls\n\nBlue boxes, each containing B blue balls\n\nSnuke wants to get a total of exactly N balls by buying r red boxes, g green boxes and b blue boxes.\nHow many triples of non-negative integers (r,g,b) achieve this?\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq R,G,B,N \\leq 3000\n\nInput\n\nInput is given from Standard Input in the following format:\n\nR G B N\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n1 2 3 4\n\nSample Output 1\n\n4\n\nFour triples achieve the objective, as follows:\n\n(4,0,0)\n\n(2,1,0)\n\n(1,0,1)\n\n(0,2,0)\n\nSample Input 2\n\n13 1 4 3000\n\nSample Output 2\n\n87058", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 346, "cpu_time_ms": 23, "memory_kb": 1708}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s829412336", "group_id": "codeNet:p03048", "input_text": "#include<stdio.h>\nint main(){\n\tint n,a=0,i,j,b[4];\n\tscanf(\"%d %d %d %d\",&b[1],&b[2],&b[3],&n);\n\tif(b[1]>b[2]){\n\t\tb[0]=b[1];\n\t\tb[1]=b[2];\n\t\tb[2]=b[0];\n\t}\n\tif(b[2]>b[3]){\n\t\tb[0]=b[2];\n\t\tb[2]=b[3];\n\t\tb[3]=b[0];\n\t}\n\tif(b[1]>b[2]){\n\t\tb[0]=b[1];\n\t\tb[1]=b[2];\n\t\tb[2]=b[0];\n\t}\n  for(i=n/b[3];i>=0;i--){\n\t\tfor(j=(n-b[3]*i)/b[2];j>=0;j--) a++;\n\t}\n\tprintf(\"%d\",a);\n\tprintf(\"%d\",a);\n\treturn 0;\n}", "language": "C", "metadata": {"date": 1557630825, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "problem_description_relpath": "problem_descriptions/p03048.html", "problem_id": "p03048", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03048/input.txt", "sample_output_relpath": "derived/input_output/data/p03048/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03048/C/s829412336.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s829412336", "user_id": "u660009720"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "#include<stdio.h>\nint main(){\n\tint n,a=0,i,j,b[4];\n\tscanf(\"%d %d %d %d\",&b[1],&b[2],&b[3],&n);\n\tif(b[1]>b[2]){\n\t\tb[0]=b[1];\n\t\tb[1]=b[2];\n\t\tb[2]=b[0];\n\t}\n\tif(b[2]>b[3]){\n\t\tb[0]=b[2];\n\t\tb[2]=b[3];\n\t\tb[3]=b[0];\n\t}\n\tif(b[1]>b[2]){\n\t\tb[0]=b[1];\n\t\tb[1]=b[2];\n\t\tb[2]=b[0];\n\t}\n  for(i=n/b[3];i>=0;i--){\n\t\tfor(j=(n-b[3]*i)/b[2];j>=0;j--) a++;\n\t}\n\tprintf(\"%d\",a);\n\tprintf(\"%d\",a);\n\treturn 0;\n}", "problem_context": "Score : 200 points\n\nProblem Statement\n\nSnuke has come to a store that sells boxes containing balls. The store sells the following three kinds of boxes:\n\nRed boxes, each containing R red balls\n\nGreen boxes, each containing G green balls\n\nBlue boxes, each containing B blue balls\n\nSnuke wants to get a total of exactly N balls by buying r red boxes, g green boxes and b blue boxes.\nHow many triples of non-negative integers (r,g,b) achieve this?\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq R,G,B,N \\leq 3000\n\nInput\n\nInput is given from Standard Input in the following format:\n\nR G B N\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n1 2 3 4\n\nSample Output 1\n\n4\n\nFour triples achieve the objective, as follows:\n\n(4,0,0)\n\n(2,1,0)\n\n(1,0,1)\n\n(0,2,0)\n\nSample Input 2\n\n13 1 4 3000\n\nSample Output 2\n\n87058", "sample_input": "1 2 3 4\n"}, "reference_outputs": ["4\n"], "source_document_id": "p03048", "source_text": "Score : 200 points\n\nProblem Statement\n\nSnuke has come to a store that sells boxes containing balls. The store sells the following three kinds of boxes:\n\nRed boxes, each containing R red balls\n\nGreen boxes, each containing G green balls\n\nBlue boxes, each containing B blue balls\n\nSnuke wants to get a total of exactly N balls by buying r red boxes, g green boxes and b blue boxes.\nHow many triples of non-negative integers (r,g,b) achieve this?\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq R,G,B,N \\leq 3000\n\nInput\n\nInput is given from Standard Input in the following format:\n\nR G B N\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n1 2 3 4\n\nSample Output 1\n\n4\n\nFour triples achieve the objective, as follows:\n\n(4,0,0)\n\n(2,1,0)\n\n(1,0,1)\n\n(0,2,0)\n\nSample Input 2\n\n13 1 4 3000\n\nSample Output 2\n\n87058", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 383, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s724165884", "group_id": "codeNet:p03049", "input_text": "#include <stdio.h>\nint min(int a,int b){\n    if(a<b) return a;\n    return b;\n}\nint max(int a,int b){\n    if(a>b) return a;\n    return b;\n}\nint main(void){\n    int n;\n    char s[10000][15]={0};\n    int i,j;\n    int cnt=0,first=0,last=0,b=0,sum=0;\n    scanf(\"%d\",&n);\n    for(i=0;i<n;i++){\n        scanf(\"%s\",s[i]);\n    }\n    for(i=0;i<n;i++){\n        j=0;\n        while(s[i][j]){\n            if(s[i][j]=='A'&&(s[i][j-1]=='B')) cnt++;\n            j++;\n        }\n        if((s[i][j-1]=='A')&&s[i][0]=='B'){\n            b++;\n        }else if(s[i][j-1]=='A'){\n            last++;\n        }else if(s[i][0]=='B'){\n            first++;\n        }\n    }\n    sum=max(b-1,0);\n    if(b!=0){\n        sum+=min(first+1,last+1);\n    }else{\n        sum+=min(first,last);\n    }\n    printf(\"%d\\n\",cnt+sum);//cnt+sum);\n    return 0;\n}\n", "language": "C", "metadata": {"date": 1557630343, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "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/C/s724165884.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s724165884", "user_id": "u633404120"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "#include <stdio.h>\nint min(int a,int b){\n    if(a<b) return a;\n    return b;\n}\nint max(int a,int b){\n    if(a>b) return a;\n    return b;\n}\nint main(void){\n    int n;\n    char s[10000][15]={0};\n    int i,j;\n    int cnt=0,first=0,last=0,b=0,sum=0;\n    scanf(\"%d\",&n);\n    for(i=0;i<n;i++){\n        scanf(\"%s\",s[i]);\n    }\n    for(i=0;i<n;i++){\n        j=0;\n        while(s[i][j]){\n            if(s[i][j]=='A'&&(s[i][j-1]=='B')) cnt++;\n            j++;\n        }\n        if((s[i][j-1]=='A')&&s[i][0]=='B'){\n            b++;\n        }else if(s[i][j-1]=='A'){\n            last++;\n        }else if(s[i][0]=='B'){\n            first++;\n        }\n    }\n    sum=max(b-1,0);\n    if(b!=0){\n        sum+=min(first+1,last+1);\n    }else{\n        sum+=min(first,last);\n    }\n    printf(\"%d\\n\",cnt+sum);//cnt+sum);\n    return 0;\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": 814, "cpu_time_ms": 2, "memory_kb": 256}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s404896029", "group_id": "codeNet:p03049", "input_text": "#include <stdio.h>\n#include <stdint.h>\n#include <inttypes.h>\n\nint main (int argc, char const *argv[])\n{\n    int64_t N;\n    char s[(int)1e4][11];\n    int64_t initial_b = 0, final_a = 0, both = 0, ans = 0, flag = 0;\n\n    scanf(\"%\"PRId64, &N);\n    for (int i = 0; i < N; i++) {\n        int p = 0;\n        scanf(\"%s\", s[i]);\n        while (s[i][p]) {\n            if ((s[i][p] == 'A') && (s[i][p + 1] == 'B')) ans++;\n            p++;\n        }\n        if ((s[i][p - 1] == 'A') && (s[i][0] == 'B')) both++;\n        else if (s[i][0] == 'B') initial_b++;\n        else if (s[i][p - 1] == 'A') final_a++;\n    }\n\n    ans += initial_b > final_a ? final_a : initial_b;\n    if ((initial_b != 0) || (final_a != 0)) {\n        ans += both;\n    } else {\n        ans += both - 1;\n    }\n\n    printf(\"%\"PRId64\"\\n\", ans);\n}\n", "language": "C", "metadata": {"date": 1557628742, "filename_ext": "c", "original_language": "C (Clang 3.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/C/s404896029.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s404896029", "user_id": "u335453773"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "#include <stdio.h>\n#include <stdint.h>\n#include <inttypes.h>\n\nint main (int argc, char const *argv[])\n{\n    int64_t N;\n    char s[(int)1e4][11];\n    int64_t initial_b = 0, final_a = 0, both = 0, ans = 0, flag = 0;\n\n    scanf(\"%\"PRId64, &N);\n    for (int i = 0; i < N; i++) {\n        int p = 0;\n        scanf(\"%s\", s[i]);\n        while (s[i][p]) {\n            if ((s[i][p] == 'A') && (s[i][p + 1] == 'B')) ans++;\n            p++;\n        }\n        if ((s[i][p - 1] == 'A') && (s[i][0] == 'B')) both++;\n        else if (s[i][0] == 'B') initial_b++;\n        else if (s[i][p - 1] == 'A') final_a++;\n    }\n\n    ans += initial_b > final_a ? final_a : initial_b;\n    if ((initial_b != 0) || (final_a != 0)) {\n        ans += both;\n    } else {\n        ans += both - 1;\n    }\n\n    printf(\"%\"PRId64\"\\n\", ans);\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": 802, "cpu_time_ms": 2, "memory_kb": 256}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s994487675", "group_id": "codeNet:p03050", "input_text": "#include<stdio.h>\n#include<math.h>\nint main()\n{\n\tlong N;\n\tlong sum=0;\n\tlong i;\n\tscanf(\"%ld\",&N);\n\tfor(i=1;i<=sqrt(N);i++){\n\t\tif(N%i==0){\n\t\t\tsum+=N/i-1;\n\t\t}\n\t}\n\tprintf(\"%ld\",sum);\n}", "language": "C", "metadata": {"date": 1558115376, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "problem_description_relpath": "problem_descriptions/p03050.html", "problem_id": "p03050", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03050/input.txt", "sample_output_relpath": "derived/input_output/data/p03050/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03050/C/s994487675.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s994487675", "user_id": "u596200441"}, "prompt_components": {"gold_output": "10\n", "input_to_evaluate": "#include<stdio.h>\n#include<math.h>\nint main()\n{\n\tlong N;\n\tlong sum=0;\n\tlong i;\n\tscanf(\"%ld\",&N);\n\tfor(i=1;i<=sqrt(N);i++){\n\t\tif(N%i==0){\n\t\t\tsum+=N/i-1;\n\t\t}\n\t}\n\tprintf(\"%ld\",sum);\n}", "problem_context": "Score : 500 points\n\nProblem Statement\n\nSnuke received a positive integer N from Takahashi.\nA positive integer m is called a favorite number when the following condition is satisfied:\n\nThe quotient and remainder of N divided by m are equal, that is, \\lfloor \\frac{N}{m} \\rfloor = N \\bmod m holds.\n\nFind all favorite numbers and print the sum of those.\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 answer.\n\nSample Input 1\n\n8\n\nSample Output 1\n\n10\n\nThere are two favorite numbers: 3 and 7. Print the sum of these, 10.\n\nSample Input 2\n\n1000000000000\n\nSample Output 2\n\n2499686339916\n\nWatch out for overflow.", "sample_input": "8\n"}, "reference_outputs": ["10\n"], "source_document_id": "p03050", "source_text": "Score : 500 points\n\nProblem Statement\n\nSnuke received a positive integer N from Takahashi.\nA positive integer m is called a favorite number when the following condition is satisfied:\n\nThe quotient and remainder of N divided by m are equal, that is, \\lfloor \\frac{N}{m} \\rfloor = N \\bmod m holds.\n\nFind all favorite numbers and print the sum of those.\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 answer.\n\nSample Input 1\n\n8\n\nSample Output 1\n\n10\n\nThere are two favorite numbers: 3 and 7. Print the sum of these, 10.\n\nSample Input 2\n\n1000000000000\n\nSample Output 2\n\n2499686339916\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": 180, "cpu_time_ms": 12, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s086129708", "group_id": "codeNet:p03059", "input_text": "#include <stdio.h>\nint main(){\n  int a,b,t;\n  scanf(\"%d%d%d\",&a,&b,&t);\n  printf(\"%d\\n\",b*(t/a));\n  return 0;\n}", "language": "C", "metadata": {"date": 1556413521, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "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/C/s086129708.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s086129708", "user_id": "u351299035"}, "prompt_components": {"gold_output": "10\n", "input_to_evaluate": "#include <stdio.h>\nint main(){\n  int a,b,t;\n  scanf(\"%d%d%d\",&a,&b,&t);\n  printf(\"%d\\n\",b*(t/a));\n  return 0;\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": 111, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s097510014", "group_id": "codeNet:p03059", "input_text": "#include<stdio.h>\n\n\nint main(){\n\tint a, b, t;\n\tscanf(\"%d%d%d\", &a, &b,&t);\n\tprintf(\"%d\", (t / a)*b);\n\t\n\treturn 0;\n\n}", "language": "C", "metadata": {"date": 1556413397, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "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/C/s097510014.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s097510014", "user_id": "u342005896"}, "prompt_components": {"gold_output": "10\n", "input_to_evaluate": "#include<stdio.h>\n\n\nint main(){\n\tint a, b, t;\n\tscanf(\"%d%d%d\", &a, &b,&t);\n\tprintf(\"%d\", (t / a)*b);\n\t\n\treturn 0;\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": 116, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s581100258", "group_id": "codeNet:p03059", "input_text": "#include <stdio.h>\nint main(void){\n\tint a,b,t;\n\tscanf(\"%d%d%d\",&a,&b,&t);\n\tint ans=t/a*b;\n\t\n\tprintf(\"%d\",ans);\n\treturn 0;\n}", "language": "C", "metadata": {"date": 1556413329, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "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/C/s581100258.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s581100258", "user_id": "u853477575"}, "prompt_components": {"gold_output": "10\n", "input_to_evaluate": "#include <stdio.h>\nint main(void){\n\tint a,b,t;\n\tscanf(\"%d%d%d\",&a,&b,&t);\n\tint ans=t/a*b;\n\t\n\tprintf(\"%d\",ans);\n\treturn 0;\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": 123, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s278216207", "group_id": "codeNet:p03060", "input_text": "#include <stdio.h>\n#include <stdlib.h>\n\nint main(int argc, char const *argv[]) {\n    int N;\n    scanf(\"%d\", &N);\n    int *t1 = (int *)malloc(sizeof(int) * N);\n    int *t2 = (int *)malloc(sizeof(int) * N);\n    int i;\n    int som = 0;\n    for (i = 0; i < N; i++)\n        scanf(\"%d\", t1 + i);\n\n    for (i = 0; i < N; i++)\n        scanf(\"%d\", t2 + i);\n\n    for (i = 0; i < N; i++) {\n        if (t1[i] - t2[i] > 0)\n            som += t1[i] - t2[i];\n    }\n\n    printf(\"%d\", som);\n\n    return 0;\n}", "language": "C", "metadata": {"date": 1556415334, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "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/C/s278216207.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s278216207", "user_id": "u034394519"}, "prompt_components": {"gold_output": "5\n", "input_to_evaluate": "#include <stdio.h>\n#include <stdlib.h>\n\nint main(int argc, char const *argv[]) {\n    int N;\n    scanf(\"%d\", &N);\n    int *t1 = (int *)malloc(sizeof(int) * N);\n    int *t2 = (int *)malloc(sizeof(int) * N);\n    int i;\n    int som = 0;\n    for (i = 0; i < N; i++)\n        scanf(\"%d\", t1 + i);\n\n    for (i = 0; i < N; i++)\n        scanf(\"%d\", t2 + i);\n\n    for (i = 0; i < N; i++) {\n        if (t1[i] - t2[i] > 0)\n            som += t1[i] - t2[i];\n    }\n\n    printf(\"%d\", som);\n\n    return 0;\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": 490, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s496487519", "group_id": "codeNet:p03063", "input_text": "#include<stdio.h>\n#include<stdlib.h>\n#include<stdint.h>\n#include<inttypes.h>\n\ntypedef int32_t i32;\n\n#define MIN(a,b) ((a) < (b) ? (a) : (b))\n\nvoid run (void) {\n  i32 n;\n  scanf (\"%\" SCNi32, &n);\n  char *s = (char *) calloc (n + 1, sizeof (char));\n  scanf (\"%s\", s);\n  uint8_t *d = (uint8_t *) calloc (n, sizeof (uint8_t));\n  i32 cnt[2];\n  for (i32 i = 0; i < n; ++i) {\n    d[i] = (s[i] == '.' ? 0 : 1);\n    cnt[d[i]]++;\n  }\n  i32 min = MIN(cnt[1], cnt[0]);\n  i32 lcnt[2] = {0, 0};\n  for (i32 i = 0; i < n; ++i) {\n    cnt[d[i]]--;\n    lcnt[d[i]]++;\n    min = MIN(min, cnt[0] + lcnt[1]);\n  }\n  printf (\"%\" PRIi32, min);\n}\n\nint main (void) {\n  run();\n  return 0;\n}", "language": "C", "metadata": {"date": 1555809234, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "problem_description_relpath": "problem_descriptions/p03063.html", "problem_id": "p03063", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03063/input.txt", "sample_output_relpath": "derived/input_output/data/p03063/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03063/C/s496487519.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s496487519", "user_id": "u425248533"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "#include<stdio.h>\n#include<stdlib.h>\n#include<stdint.h>\n#include<inttypes.h>\n\ntypedef int32_t i32;\n\n#define MIN(a,b) ((a) < (b) ? (a) : (b))\n\nvoid run (void) {\n  i32 n;\n  scanf (\"%\" SCNi32, &n);\n  char *s = (char *) calloc (n + 1, sizeof (char));\n  scanf (\"%s\", s);\n  uint8_t *d = (uint8_t *) calloc (n, sizeof (uint8_t));\n  i32 cnt[2];\n  for (i32 i = 0; i < n; ++i) {\n    d[i] = (s[i] == '.' ? 0 : 1);\n    cnt[d[i]]++;\n  }\n  i32 min = MIN(cnt[1], cnt[0]);\n  i32 lcnt[2] = {0, 0};\n  for (i32 i = 0; i < n; ++i) {\n    cnt[d[i]]--;\n    lcnt[d[i]]++;\n    min = MIN(min, cnt[0] + lcnt[1]);\n  }\n  printf (\"%\" PRIi32, min);\n}\n\nint main (void) {\n  run();\n  return 0;\n}", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere are N stones arranged in a row. Every stone is painted white or black.\nA string S represents the color of the stones. The i-th stone from the left is white if the i-th character of S is ., and the stone is black if the character is #.\n\nTakahashi wants to change the colors of some stones to black or white so that there will be no white stone immediately to the right of a black stone.\nFind the minimum number of stones that needs to be recolored.\n\nConstraints\n\n1 \\leq N \\leq 2\\times 10^5\n\nS is a string of length N consisting of . and #.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS\n\nOutput\n\nPrint the minimum number of stones that needs to be recolored.\n\nSample Input 1\n\n3\n#.#\n\nSample Output 1\n\n1\n\nIt is enough to change the color of the first stone to white.\n\nSample Input 2\n\n5\n#.##.\n\nSample Output 2\n\n2\n\nSample Input 3\n\n9\n.........\n\nSample Output 3\n\n0", "sample_input": "3\n#.#\n"}, "reference_outputs": ["1\n"], "source_document_id": "p03063", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere are N stones arranged in a row. Every stone is painted white or black.\nA string S represents the color of the stones. The i-th stone from the left is white if the i-th character of S is ., and the stone is black if the character is #.\n\nTakahashi wants to change the colors of some stones to black or white so that there will be no white stone immediately to the right of a black stone.\nFind the minimum number of stones that needs to be recolored.\n\nConstraints\n\n1 \\leq N \\leq 2\\times 10^5\n\nS is a string of length N consisting of . and #.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS\n\nOutput\n\nPrint the minimum number of stones that needs to be recolored.\n\nSample Input 1\n\n3\n#.#\n\nSample Output 1\n\n1\n\nIt is enough to change the color of the first stone to white.\n\nSample Input 2\n\n5\n#.##.\n\nSample Output 2\n\n2\n\nSample Input 3\n\n9\n.........\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": 661, "cpu_time_ms": 2, "memory_kb": 512}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s855283447", "group_id": "codeNet:p03068", "input_text": "#include <stdio.h>\n\nint main(void){\n    int N,K,n;\n    char S[20];\n\n    scanf(\"%d\",&N);\n    scanf(\"%s\",S);\n    scanf(\"%d\",&K);\n\n    for(n=0 ; n < N ; n++){\n        if(S[n] != S[K-1]){\n            S[n] = '*';\n        }\n    }\n    printf(\"%s\\n\",S);\n    return 0;\n}\n", "language": "C", "metadata": {"date": 1555810759, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "problem_description_relpath": "problem_descriptions/p03068.html", "problem_id": "p03068", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03068/input.txt", "sample_output_relpath": "derived/input_output/data/p03068/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03068/C/s855283447.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s855283447", "user_id": "u447116202"}, "prompt_components": {"gold_output": "*rr*r\n", "input_to_evaluate": "#include <stdio.h>\n\nint main(void){\n    int N,K,n;\n    char S[20];\n\n    scanf(\"%d\",&N);\n    scanf(\"%s\",S);\n    scanf(\"%d\",&K);\n\n    for(n=0 ; n < N ; n++){\n        if(S[n] != S[K-1]){\n            S[n] = '*';\n        }\n    }\n    printf(\"%s\\n\",S);\n    return 0;\n}\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nYou are given a string S of length N consisting of lowercase English letters, and an integer K.\nPrint the string obtained by replacing every character in S that differs from the K-th character of S, with *.\n\nConstraints\n\n1 \\leq K \\leq N\\leq 10\n\nS is a string of length N consisting of lowercase English letters.\n\nN and K are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS\nK\n\nOutput\n\nPrint the string obtained by replacing every character in S that differs from the K-th character of S, with *.\n\nSample Input 1\n\n5\nerror\n2\n\nSample Output 1\n\n*rr*r\n\nThe second character of S is r. When we replace every character in error that differs from r with *, we get the string *rr*r.\n\nSample Input 2\n\n6\neleven\n5\n\nSample Output 2\n\ne*e*e*\n\nSample Input 3\n\n9\neducation\n7\n\nSample Output 3\n\n******i**", "sample_input": "5\nerror\n2\n"}, "reference_outputs": ["*rr*r\n"], "source_document_id": "p03068", "source_text": "Score : 200 points\n\nProblem Statement\n\nYou are given a string S of length N consisting of lowercase English letters, and an integer K.\nPrint the string obtained by replacing every character in S that differs from the K-th character of S, with *.\n\nConstraints\n\n1 \\leq K \\leq N\\leq 10\n\nS is a string of length N consisting of lowercase English letters.\n\nN and K are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS\nK\n\nOutput\n\nPrint the string obtained by replacing every character in S that differs from the K-th character of S, with *.\n\nSample Input 1\n\n5\nerror\n2\n\nSample Output 1\n\n*rr*r\n\nThe second character of S is r. When we replace every character in error that differs from r with *, we get the string *rr*r.\n\nSample Input 2\n\n6\neleven\n5\n\nSample Output 2\n\ne*e*e*\n\nSample Input 3\n\n9\neducation\n7\n\nSample Output 3\n\n******i**", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s274462491", "group_id": "codeNet:p03069", "input_text": " int main() {\n   int ablack=0,black=0;\n  int  white=0,rwhite=0,rblack=0,sum=0,n,i;\n   \n   scanf(\"%d\",&n);\n   char s[n];\n   scanf(\"%s\",s);\n  \n   for(i=0;i<n;i++){\n  if(s[i]=='.')rwhite++;\n     if(s[i]=='#'){rwhite=0;ablack;}\n   }\n   n=n-rwhite;\n       for(i=0;i<n;i++){\n  if(s[i]=='.')rblack=0;\n     if(s[i]=='#')rblack++;\n   } \n     \n   n=n-rblack;\n   \n    for(i=0;i<n;i++){\n  if(s[i]=='.')white++;\n     if(s[i]=='#')black++;\n   }\n\n   if(rblack>rwhite)\n    sum=rwhite;\n   else\n     sum=rblack;\n   \n   if(black<white)\n     sum=sum+black;\n   else\n     sum=sum+white;\n   printf(\"%d\",sum);\n   return 0;\n }", "language": "C", "metadata": {"date": 1557782520, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "problem_description_relpath": "problem_descriptions/p03069.html", "problem_id": "p03069", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03069/input.txt", "sample_output_relpath": "derived/input_output/data/p03069/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03069/C/s274462491.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s274462491", "user_id": "u916106917"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": " int main() {\n   int ablack=0,black=0;\n  int  white=0,rwhite=0,rblack=0,sum=0,n,i;\n   \n   scanf(\"%d\",&n);\n   char s[n];\n   scanf(\"%s\",s);\n  \n   for(i=0;i<n;i++){\n  if(s[i]=='.')rwhite++;\n     if(s[i]=='#'){rwhite=0;ablack;}\n   }\n   n=n-rwhite;\n       for(i=0;i<n;i++){\n  if(s[i]=='.')rblack=0;\n     if(s[i]=='#')rblack++;\n   } \n     \n   n=n-rblack;\n   \n    for(i=0;i<n;i++){\n  if(s[i]=='.')white++;\n     if(s[i]=='#')black++;\n   }\n\n   if(rblack>rwhite)\n    sum=rwhite;\n   else\n     sum=rblack;\n   \n   if(black<white)\n     sum=sum+black;\n   else\n     sum=sum+white;\n   printf(\"%d\",sum);\n   return 0;\n }", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere are N stones arranged in a row. Every stone is painted white or black.\nA string S represents the color of the stones. The i-th stone from the left is white if the i-th character of S is ., and the stone is black if the character is #.\n\nTakahashi wants to change the colors of some stones to black or white so that there will be no white stone immediately to the right of a black stone.\nFind the minimum number of stones that needs to be recolored.\n\nConstraints\n\n1 \\leq N \\leq 2\\times 10^5\n\nS is a string of length N consisting of . and #.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS\n\nOutput\n\nPrint the minimum number of stones that needs to be recolored.\n\nSample Input 1\n\n3\n#.#\n\nSample Output 1\n\n1\n\nIt is enough to change the color of the first stone to white.\n\nSample Input 2\n\n5\n#.##.\n\nSample Output 2\n\n2\n\nSample Input 3\n\n9\n.........\n\nSample Output 3\n\n0", "sample_input": "3\n#.#\n"}, "reference_outputs": ["1\n"], "source_document_id": "p03069", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere are N stones arranged in a row. Every stone is painted white or black.\nA string S represents the color of the stones. The i-th stone from the left is white if the i-th character of S is ., and the stone is black if the character is #.\n\nTakahashi wants to change the colors of some stones to black or white so that there will be no white stone immediately to the right of a black stone.\nFind the minimum number of stones that needs to be recolored.\n\nConstraints\n\n1 \\leq N \\leq 2\\times 10^5\n\nS is a string of length N consisting of . and #.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS\n\nOutput\n\nPrint the minimum number of stones that needs to be recolored.\n\nSample Input 1\n\n3\n#.#\n\nSample Output 1\n\n1\n\nIt is enough to change the color of the first stone to white.\n\nSample Input 2\n\n5\n#.##.\n\nSample Output 2\n\n2\n\nSample Input 3\n\n9\n.........\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": 601, "cpu_time_ms": 4, "memory_kb": 384}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s370875832", "group_id": "codeNet:p03069", "input_text": "#include <stdio.h>\nint main(){\n    long N;\n    scanf(\"%ld\", &N);\n    char S[N+1];\n    scanf(\"%s\", S);\n    S[N] = '\\0';\n    long cnt = -1;\n    for(long i=0;i<N;i++){\n        if(S[i]=='#'){\n            cnt = i;\n            break;\n        }\n    }\n    long ans = 0;\n    for(long i=cnt;i<N;i++){\n        if(S[i] == '.'){\n            ans ++;\n        }\n    }\n    if(cnt == -1){\n        ans = 0;\n    }\n    if(ans > N/2){\n        ans = N - ans;\n    }\n    printf(\"%ld\\n\", ans);\n    return 0;\n}", "language": "C", "metadata": {"date": 1555811676, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "problem_description_relpath": "problem_descriptions/p03069.html", "problem_id": "p03069", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03069/input.txt", "sample_output_relpath": "derived/input_output/data/p03069/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03069/C/s370875832.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s370875832", "user_id": "u564196421"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "#include <stdio.h>\nint main(){\n    long N;\n    scanf(\"%ld\", &N);\n    char S[N+1];\n    scanf(\"%s\", S);\n    S[N] = '\\0';\n    long cnt = -1;\n    for(long i=0;i<N;i++){\n        if(S[i]=='#'){\n            cnt = i;\n            break;\n        }\n    }\n    long ans = 0;\n    for(long i=cnt;i<N;i++){\n        if(S[i] == '.'){\n            ans ++;\n        }\n    }\n    if(cnt == -1){\n        ans = 0;\n    }\n    if(ans > N/2){\n        ans = N - ans;\n    }\n    printf(\"%ld\\n\", ans);\n    return 0;\n}", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere are N stones arranged in a row. Every stone is painted white or black.\nA string S represents the color of the stones. The i-th stone from the left is white if the i-th character of S is ., and the stone is black if the character is #.\n\nTakahashi wants to change the colors of some stones to black or white so that there will be no white stone immediately to the right of a black stone.\nFind the minimum number of stones that needs to be recolored.\n\nConstraints\n\n1 \\leq N \\leq 2\\times 10^5\n\nS is a string of length N consisting of . and #.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS\n\nOutput\n\nPrint the minimum number of stones that needs to be recolored.\n\nSample Input 1\n\n3\n#.#\n\nSample Output 1\n\n1\n\nIt is enough to change the color of the first stone to white.\n\nSample Input 2\n\n5\n#.##.\n\nSample Output 2\n\n2\n\nSample Input 3\n\n9\n.........\n\nSample Output 3\n\n0", "sample_input": "3\n#.#\n"}, "reference_outputs": ["1\n"], "source_document_id": "p03069", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere are N stones arranged in a row. Every stone is painted white or black.\nA string S represents the color of the stones. The i-th stone from the left is white if the i-th character of S is ., and the stone is black if the character is #.\n\nTakahashi wants to change the colors of some stones to black or white so that there will be no white stone immediately to the right of a black stone.\nFind the minimum number of stones that needs to be recolored.\n\nConstraints\n\n1 \\leq N \\leq 2\\times 10^5\n\nS is a string of length N consisting of . and #.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS\n\nOutput\n\nPrint the minimum number of stones that needs to be recolored.\n\nSample Input 1\n\n3\n#.#\n\nSample Output 1\n\n1\n\nIt is enough to change the color of the first stone to white.\n\nSample Input 2\n\n5\n#.##.\n\nSample Output 2\n\n2\n\nSample Input 3\n\n9\n.........\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": 483, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s883651035", "group_id": "codeNet:p03069", "input_text": "#include <stdio.h>\n#include <stdlib.h>\n#include <string.h>\n#include <math.h>\n\nint main(void) {\n\tint n;\n\tchar s[200001];\n\tint flag = 0, count = 0;\n\t\n\tscanf(\"%d %s\", &n, &s[0]);\n\t\n\tfor (int i = 0; i < n; i++) {\n\t\tif (s[i] == '#') {\n\t\t\tflag = 1;\n\t\t} else {\n\t\t\tif (flag)\n\t\t\t\tcount++;\n\t\t}\n\t}\n\t\n\tprintf(\"%d\", count);\n\t\n\treturn 0;\n}", "language": "C", "metadata": {"date": 1555808946, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "problem_description_relpath": "problem_descriptions/p03069.html", "problem_id": "p03069", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03069/input.txt", "sample_output_relpath": "derived/input_output/data/p03069/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03069/C/s883651035.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s883651035", "user_id": "u194609748"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "#include <stdio.h>\n#include <stdlib.h>\n#include <string.h>\n#include <math.h>\n\nint main(void) {\n\tint n;\n\tchar s[200001];\n\tint flag = 0, count = 0;\n\t\n\tscanf(\"%d %s\", &n, &s[0]);\n\t\n\tfor (int i = 0; i < n; i++) {\n\t\tif (s[i] == '#') {\n\t\t\tflag = 1;\n\t\t} else {\n\t\t\tif (flag)\n\t\t\t\tcount++;\n\t\t}\n\t}\n\t\n\tprintf(\"%d\", count);\n\t\n\treturn 0;\n}", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere are N stones arranged in a row. Every stone is painted white or black.\nA string S represents the color of the stones. The i-th stone from the left is white if the i-th character of S is ., and the stone is black if the character is #.\n\nTakahashi wants to change the colors of some stones to black or white so that there will be no white stone immediately to the right of a black stone.\nFind the minimum number of stones that needs to be recolored.\n\nConstraints\n\n1 \\leq N \\leq 2\\times 10^5\n\nS is a string of length N consisting of . and #.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS\n\nOutput\n\nPrint the minimum number of stones that needs to be recolored.\n\nSample Input 1\n\n3\n#.#\n\nSample Output 1\n\n1\n\nIt is enough to change the color of the first stone to white.\n\nSample Input 2\n\n5\n#.##.\n\nSample Output 2\n\n2\n\nSample Input 3\n\n9\n.........\n\nSample Output 3\n\n0", "sample_input": "3\n#.#\n"}, "reference_outputs": ["1\n"], "source_document_id": "p03069", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere are N stones arranged in a row. Every stone is painted white or black.\nA string S represents the color of the stones. The i-th stone from the left is white if the i-th character of S is ., and the stone is black if the character is #.\n\nTakahashi wants to change the colors of some stones to black or white so that there will be no white stone immediately to the right of a black stone.\nFind the minimum number of stones that needs to be recolored.\n\nConstraints\n\n1 \\leq N \\leq 2\\times 10^5\n\nS is a string of length N consisting of . and #.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS\n\nOutput\n\nPrint the minimum number of stones that needs to be recolored.\n\nSample Input 1\n\n3\n#.#\n\nSample Output 1\n\n1\n\nIt is enough to change the color of the first stone to white.\n\nSample Input 2\n\n5\n#.##.\n\nSample Output 2\n\n2\n\nSample Input 3\n\n9\n.........\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": 325, "cpu_time_ms": 2, "memory_kb": 384}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s959173046", "group_id": "codeNet:p03071", "input_text": "#include <stdio.h>\nint main (void)\n{\n  int a,b,num;\n  scanf(\"%d %d\",&a,&b);\n \n  if(a>b) num=a+a-1;\n  if(b>a) num=b+b-1;\n  if(a==b) num=a+b;\n  \n  printf(\"%d\",num);\n  \n  return 0;\n}", "language": "C", "metadata": {"date": 1557402739, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "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/C/s959173046.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s959173046", "user_id": "u591901398"}, "prompt_components": {"gold_output": "9\n", "input_to_evaluate": "#include <stdio.h>\nint main (void)\n{\n  int a,b,num;\n  scanf(\"%d %d\",&a,&b);\n \n  if(a>b) num=a+a-1;\n  if(b>a) num=b+b-1;\n  if(a==b) num=a+b;\n  \n  printf(\"%d\",num);\n  \n  return 0;\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": 179, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s033548747", "group_id": "codeNet:p03072", "input_text": "#include<stdio.h>\nint main(){\n  int sum=0,N,H,i,max=0;\n  scanf(\"%d\",&N);\n  for(i=0;i<N;i++){\n    scanf(\"%d\",&H);\n    if(H>=max){\n      sum++;\n      max=H;\n    }\n    \n  }\n  printf(\"%d\\n\",sum);\n  return 0;\n}\n  ", "language": "C", "metadata": {"date": 1555226433, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "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/C/s033548747.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s033548747", "user_id": "u370145882"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "#include<stdio.h>\nint main(){\n  int sum=0,N,H,i,max=0;\n  scanf(\"%d\",&N);\n  for(i=0;i<N;i++){\n    scanf(\"%d\",&H);\n    if(H>=max){\n      sum++;\n      max=H;\n    }\n    \n  }\n  printf(\"%d\\n\",sum);\n  return 0;\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": 208, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s955183594", "group_id": "codeNet:p03073", "input_text": "#include<stdio.h>\n#include<string.h>\n#define S 100\nint main()\n{\n  char a[S];\n  int m,k,n,i;\n  m=0;\n  k=0;\n  scanf(\"%s\",a);\n  n=strlen(a);\n  char b[S],c[S];\n  for(i=0;i<n;i++)\n  {\n      if(i%2==0)\n           {\n               b[i]='1';\n               c[i]='0';\n\n           }\n      else\n         {\n              b[i]='0';\n              c[i]='1';\n         }\n  }\n   for(i=0;i<n;i++)\n     {\n         if(a[i]!=b[i])\n               m++;\n     }\n   for(i=0;i<n;i++)\n     {\n         if(a[i]!=c[i])\n               k++;\n     }\n   if(m<k)\n        printf(\"%d\",m);\n   else\n        printf(\"%d\",k);\n   return 0;\n}\n", "language": "C", "metadata": {"date": 1567867265, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "problem_description_relpath": "problem_descriptions/p03073.html", "problem_id": "p03073", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03073/input.txt", "sample_output_relpath": "derived/input_output/data/p03073/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03073/C/s955183594.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s955183594", "user_id": "u353919145"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "#include<stdio.h>\n#include<string.h>\n#define S 100\nint main()\n{\n  char a[S];\n  int m,k,n,i;\n  m=0;\n  k=0;\n  scanf(\"%s\",a);\n  n=strlen(a);\n  char b[S],c[S];\n  for(i=0;i<n;i++)\n  {\n      if(i%2==0)\n           {\n               b[i]='1';\n               c[i]='0';\n\n           }\n      else\n         {\n              b[i]='0';\n              c[i]='1';\n         }\n  }\n   for(i=0;i<n;i++)\n     {\n         if(a[i]!=b[i])\n               m++;\n     }\n   for(i=0;i<n;i++)\n     {\n         if(a[i]!=c[i])\n               k++;\n     }\n   if(m<k)\n        printf(\"%d\",m);\n   else\n        printf(\"%d\",k);\n   return 0;\n}\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nN tiles are arranged in a row from left to right. The initial color of each tile is represented by a string S of length N.\n\nThe i-th tile from the left is painted black if the i-th character of S is 0, and painted white if that character is 1.\n\nYou want to repaint some of the tiles black or white, so that any two adjacent tiles have different colors.\n\nAt least how many tiles need to be repainted to satisfy the condition?\n\nConstraints\n\n1 \\leq |S| \\leq 10^5\n\nS_i is 0 or 1.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the minimum number of tiles that need to be repainted to satisfy the condition.\n\nSample Input 1\n\n000\n\nSample Output 1\n\n1\n\nThe condition can be satisfied by repainting the middle tile white.\n\nSample Input 2\n\n10010010\n\nSample Output 2\n\n3\n\nSample Input 3\n\n0\n\nSample Output 3\n\n0", "sample_input": "000\n"}, "reference_outputs": ["1\n"], "source_document_id": "p03073", "source_text": "Score : 300 points\n\nProblem Statement\n\nN tiles are arranged in a row from left to right. The initial color of each tile is represented by a string S of length N.\n\nThe i-th tile from the left is painted black if the i-th character of S is 0, and painted white if that character is 1.\n\nYou want to repaint some of the tiles black or white, so that any two adjacent tiles have different colors.\n\nAt least how many tiles need to be repainted to satisfy the condition?\n\nConstraints\n\n1 \\leq |S| \\leq 10^5\n\nS_i is 0 or 1.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the minimum number of tiles that need to be repainted to satisfy the condition.\n\nSample Input 1\n\n000\n\nSample Output 1\n\n1\n\nThe condition can be satisfied by repainting the middle tile white.\n\nSample Input 2\n\n10010010\n\nSample Output 2\n\n3\n\nSample Input 3\n\n0\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": 596, "cpu_time_ms": 99, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s494082822", "group_id": "codeNet:p03073", "input_text": "#include <stdio.h>\n#include <string.h>\n \nint main(){\n  int i,flag=0,acount=0,bcount=0;\n  char s[100001];\n  scanf(\"%s\",s);\n    for(i=0;i<strlen(s);i++){\n      if(flag == 0){\n        if(s[i]=='0') acount++;\n        else bcount++;\n        flag=1;\n      }\n      else{\n        if(s[i]=='1') acount++;\n        else bcount++;\n        flag=0;\n      }\n    }\n \n    if(acount>bcount) printf(\"%d\",strlen(s)-acount);\n    else printf(\"%d\",strlen(s)-bcount);\n  return 0;\n}", "language": "C", "metadata": {"date": 1562940646, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "problem_description_relpath": "problem_descriptions/p03073.html", "problem_id": "p03073", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03073/input.txt", "sample_output_relpath": "derived/input_output/data/p03073/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03073/C/s494082822.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s494082822", "user_id": "u858781353"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "#include <stdio.h>\n#include <string.h>\n \nint main(){\n  int i,flag=0,acount=0,bcount=0;\n  char s[100001];\n  scanf(\"%s\",s);\n    for(i=0;i<strlen(s);i++){\n      if(flag == 0){\n        if(s[i]=='0') acount++;\n        else bcount++;\n        flag=1;\n      }\n      else{\n        if(s[i]=='1') acount++;\n        else bcount++;\n        flag=0;\n      }\n    }\n \n    if(acount>bcount) printf(\"%d\",strlen(s)-acount);\n    else printf(\"%d\",strlen(s)-bcount);\n  return 0;\n}", "problem_context": "Score : 300 points\n\nProblem Statement\n\nN tiles are arranged in a row from left to right. The initial color of each tile is represented by a string S of length N.\n\nThe i-th tile from the left is painted black if the i-th character of S is 0, and painted white if that character is 1.\n\nYou want to repaint some of the tiles black or white, so that any two adjacent tiles have different colors.\n\nAt least how many tiles need to be repainted to satisfy the condition?\n\nConstraints\n\n1 \\leq |S| \\leq 10^5\n\nS_i is 0 or 1.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the minimum number of tiles that need to be repainted to satisfy the condition.\n\nSample Input 1\n\n000\n\nSample Output 1\n\n1\n\nThe condition can be satisfied by repainting the middle tile white.\n\nSample Input 2\n\n10010010\n\nSample Output 2\n\n3\n\nSample Input 3\n\n0\n\nSample Output 3\n\n0", "sample_input": "000\n"}, "reference_outputs": ["1\n"], "source_document_id": "p03073", "source_text": "Score : 300 points\n\nProblem Statement\n\nN tiles are arranged in a row from left to right. The initial color of each tile is represented by a string S of length N.\n\nThe i-th tile from the left is painted black if the i-th character of S is 0, and painted white if that character is 1.\n\nYou want to repaint some of the tiles black or white, so that any two adjacent tiles have different colors.\n\nAt least how many tiles need to be repainted to satisfy the condition?\n\nConstraints\n\n1 \\leq |S| \\leq 10^5\n\nS_i is 0 or 1.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the minimum number of tiles that need to be repainted to satisfy the condition.\n\nSample Input 1\n\n000\n\nSample Output 1\n\n1\n\nThe condition can be satisfied by repainting the middle tile white.\n\nSample Input 2\n\n10010010\n\nSample Output 2\n\n3\n\nSample Input 3\n\n0\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": 457, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s189127227", "group_id": "codeNet:p03073", "input_text": "#include <stdio.h>\nint oddEven(int digit, char *s){\n    int ansx = 0;\n    int ansy = 0;\n    char ansA[111];\n    char ansB[111];\n    \n    if(digit == 1)\n        return 0;\n    for(int i = 0; i < digit; i++){\n        if(i == 0 || (i % 2) == 0){\n            ansA[i] = '1';\n            ansB[i] = '0';\n        }else{\n            ansA[i] = '0';\n            ansB[i] = '1';\n        }\n    }\n    for(int i = 0; i < digit; i++){\n        if(ansA[i] == *(s+i)){\n            ansy += 1;\n        }else{\n            ansx += 1;\n        }\n    }\n    if(ansx < ansy){\n        return ansx;\n    }else{\n        return ansy;\n    }\n}\nint main(void){\n    int n;\n    int digit = 1;\n    char order[1001];\n    \n    fgets(order, 1000, stdin);\n    while(1){\n        if(order[digit] == '\\n'){\n            break;\n        }\n        digit += 1;\n    }\n    n = oddEven(digit, order);\n    printf(\"%d\\n\", n);\n    \n    return 0;\n}", "language": "C", "metadata": {"date": 1555541961, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "problem_description_relpath": "problem_descriptions/p03073.html", "problem_id": "p03073", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03073/input.txt", "sample_output_relpath": "derived/input_output/data/p03073/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03073/C/s189127227.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s189127227", "user_id": "u852874944"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "#include <stdio.h>\nint oddEven(int digit, char *s){\n    int ansx = 0;\n    int ansy = 0;\n    char ansA[111];\n    char ansB[111];\n    \n    if(digit == 1)\n        return 0;\n    for(int i = 0; i < digit; i++){\n        if(i == 0 || (i % 2) == 0){\n            ansA[i] = '1';\n            ansB[i] = '0';\n        }else{\n            ansA[i] = '0';\n            ansB[i] = '1';\n        }\n    }\n    for(int i = 0; i < digit; i++){\n        if(ansA[i] == *(s+i)){\n            ansy += 1;\n        }else{\n            ansx += 1;\n        }\n    }\n    if(ansx < ansy){\n        return ansx;\n    }else{\n        return ansy;\n    }\n}\nint main(void){\n    int n;\n    int digit = 1;\n    char order[1001];\n    \n    fgets(order, 1000, stdin);\n    while(1){\n        if(order[digit] == '\\n'){\n            break;\n        }\n        digit += 1;\n    }\n    n = oddEven(digit, order);\n    printf(\"%d\\n\", n);\n    \n    return 0;\n}", "problem_context": "Score : 300 points\n\nProblem Statement\n\nN tiles are arranged in a row from left to right. The initial color of each tile is represented by a string S of length N.\n\nThe i-th tile from the left is painted black if the i-th character of S is 0, and painted white if that character is 1.\n\nYou want to repaint some of the tiles black or white, so that any two adjacent tiles have different colors.\n\nAt least how many tiles need to be repainted to satisfy the condition?\n\nConstraints\n\n1 \\leq |S| \\leq 10^5\n\nS_i is 0 or 1.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the minimum number of tiles that need to be repainted to satisfy the condition.\n\nSample Input 1\n\n000\n\nSample Output 1\n\n1\n\nThe condition can be satisfied by repainting the middle tile white.\n\nSample Input 2\n\n10010010\n\nSample Output 2\n\n3\n\nSample Input 3\n\n0\n\nSample Output 3\n\n0", "sample_input": "000\n"}, "reference_outputs": ["1\n"], "source_document_id": "p03073", "source_text": "Score : 300 points\n\nProblem Statement\n\nN tiles are arranged in a row from left to right. The initial color of each tile is represented by a string S of length N.\n\nThe i-th tile from the left is painted black if the i-th character of S is 0, and painted white if that character is 1.\n\nYou want to repaint some of the tiles black or white, so that any two adjacent tiles have different colors.\n\nAt least how many tiles need to be repainted to satisfy the condition?\n\nConstraints\n\n1 \\leq |S| \\leq 10^5\n\nS_i is 0 or 1.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the minimum number of tiles that need to be repainted to satisfy the condition.\n\nSample Input 1\n\n000\n\nSample Output 1\n\n1\n\nThe condition can be satisfied by repainting the middle tile white.\n\nSample Input 2\n\n10010010\n\nSample Output 2\n\n3\n\nSample Input 3\n\n0\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": 888, "cpu_time_ms": 97, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s004787487", "group_id": "codeNet:p03074", "input_text": "#include <stdio.h>\n\nint groups[100002];\n\nint main(void) {\n\tint n, k;\n\tscanf(\"%d%d \", &n, &k);\n\n\tint gind = groups[0] = 0;\n\tfor (int i = 0; i < n; i++) {\n\t\tint c = getchar() == '1';\n\t\tif (c == gind%2) groups[gind]++;\n\t\telse groups[++gind] = 1;\n\t}\n\tif (gind%2) groups[++gind] = 0;\n\n\tint max = 0;\n\tfor (int i = 1; i <= gind; i += 2) {\n\t\tif (max < groups[i]) max = groups[i];\n\t}\n\n\tint sum = 0;\n\tfor (int i = 0; i <= gind; i++) {\n\t\tif (i+1 > 2*k+1) sum -= groups[i-2*k-1];\n\t\tsum += groups[i];\n\t\tif (i%2 != gind%2 && max < sum) max = sum;\n\t}\n\n\tprintf(\"%d\\n\", max);\n}\n", "language": "C", "metadata": {"date": 1560040980, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "problem_description_relpath": "problem_descriptions/p03074.html", "problem_id": "p03074", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03074/input.txt", "sample_output_relpath": "derived/input_output/data/p03074/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03074/C/s004787487.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s004787487", "user_id": "u210370951"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "#include <stdio.h>\n\nint groups[100002];\n\nint main(void) {\n\tint n, k;\n\tscanf(\"%d%d \", &n, &k);\n\n\tint gind = groups[0] = 0;\n\tfor (int i = 0; i < n; i++) {\n\t\tint c = getchar() == '1';\n\t\tif (c == gind%2) groups[gind]++;\n\t\telse groups[++gind] = 1;\n\t}\n\tif (gind%2) groups[++gind] = 0;\n\n\tint max = 0;\n\tfor (int i = 1; i <= gind; i += 2) {\n\t\tif (max < groups[i]) max = groups[i];\n\t}\n\n\tint sum = 0;\n\tfor (int i = 0; i <= gind; i++) {\n\t\tif (i+1 > 2*k+1) sum -= groups[i-2*k-1];\n\t\tsum += groups[i];\n\t\tif (i%2 != gind%2 && max < sum) max = sum;\n\t}\n\n\tprintf(\"%d\\n\", max);\n}\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nN people are arranged in a row from left to right.\n\nYou are given a string S of length N consisting of 0 and 1, and a positive integer K.\n\nThe i-th person from the left is standing on feet if the i-th character of S is 0, and standing on hands if that character is 1.\n\nYou will give the following direction at most K times (possibly zero):\n\nDirection: Choose integers l and r satisfying 1 \\leq l \\leq r \\leq N, and flip the l-th, (l+1)-th, ..., and r-th persons. That is, for each i = l, l+1, ..., r, the i-th person from the left now stands on hands if he/she was standing on feet, and stands on feet if he/she was standing on hands.\n\nFind the maximum possible number of consecutive people standing on hands after at most K directions.\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\nThe length of the string S is N.\n\nEach character of the string S is 0 or 1.\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 consecutive people standing on hands after at most K directions.\n\nSample Input 1\n\n5 1\n00010\n\nSample Output 1\n\n4\n\nWe can have four consecutive people standing on hands, which is the maximum result, by giving the following direction:\n\nGive the direction with l = 1, r = 3, which flips the first, second and third persons from the left.\n\nSample Input 2\n\n14 2\n11101010110011\n\nSample Output 2\n\n8\n\nSample Input 3\n\n1 1\n1\n\nSample Output 3\n\n1\n\nNo directions are necessary.", "sample_input": "5 1\n00010\n"}, "reference_outputs": ["4\n"], "source_document_id": "p03074", "source_text": "Score : 400 points\n\nProblem Statement\n\nN people are arranged in a row from left to right.\n\nYou are given a string S of length N consisting of 0 and 1, and a positive integer K.\n\nThe i-th person from the left is standing on feet if the i-th character of S is 0, and standing on hands if that character is 1.\n\nYou will give the following direction at most K times (possibly zero):\n\nDirection: Choose integers l and r satisfying 1 \\leq l \\leq r \\leq N, and flip the l-th, (l+1)-th, ..., and r-th persons. That is, for each i = l, l+1, ..., r, the i-th person from the left now stands on hands if he/she was standing on feet, and stands on feet if he/she was standing on hands.\n\nFind the maximum possible number of consecutive people standing on hands after at most K directions.\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\nThe length of the string S is N.\n\nEach character of the string S is 0 or 1.\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 consecutive people standing on hands after at most K directions.\n\nSample Input 1\n\n5 1\n00010\n\nSample Output 1\n\n4\n\nWe can have four consecutive people standing on hands, which is the maximum result, by giving the following direction:\n\nGive the direction with l = 1, r = 3, which flips the first, second and third persons from the left.\n\nSample Input 2\n\n14 2\n11101010110011\n\nSample Output 2\n\n8\n\nSample Input 3\n\n1 1\n1\n\nSample Output 3\n\n1\n\nNo directions are necessary.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 2, "memory_kb": 512}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s179932829", "group_id": "codeNet:p03076", "input_text": "#include<stdio.h>\n\n\n\nint main(void){\n    int a,b,c,d,e;\n    int hun[5],u[5];\n    int max=0;\n    scanf(\"%d%d%d%d%d\",&a,&b,&c,&d,&e);\n    for(int i=0;i<14;i++){\n        if(a>10*i && a<=10*(i+1)){\n            hun[0]=10*(i+1);\n            u[0]=hun[0]-a;\n            break;\n        }\n    }\n    for(int i=0;i<14;i++){\n        if(b>10*i && b<=10*(i+1)){\n            hun[1]=10*(i+1);\n            u[1]=hun[1]-b;\n            break;\n        }\n    }\n    for(int i=0;i<14;i++){\n        if(c>10*i && c<=10*(i+1)){\n            hun[2]=10*(i+1);\n            u[2]=hun[2]-c;\n            break;\n        }\n    }\n    for(int i=0;i<14;i++){\n        if(d>10*i && d<=10*(i+1)){\n            hun[3]=10*(i+1);\n            u[3]=hun[3]-d;\n            break;\n        }\n    }\n    for(int i=0;i<14;i++){\n        if(e>10*i && e<=10*(i+1)){\n            hun[4]=10*(i+1);\n            u[4]=hun[4]-e;\n            break;\n        }\n    }\n    for(int i=0;i<5;i++){\n        if(u[i]>max){\n            max=u[i];\n        }\n    }\n\n    int sum=hun[0]+hun[1]+hun[2]+hun[3]+hun[4];\n    printf(\"%d\",sum-max);\n\n    return 0;\n}", "language": "C", "metadata": {"date": 1554579517, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "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/C/s179932829.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s179932829", "user_id": "u527697010"}, "prompt_components": {"gold_output": "215\n", "input_to_evaluate": "#include<stdio.h>\n\n\n\nint main(void){\n    int a,b,c,d,e;\n    int hun[5],u[5];\n    int max=0;\n    scanf(\"%d%d%d%d%d\",&a,&b,&c,&d,&e);\n    for(int i=0;i<14;i++){\n        if(a>10*i && a<=10*(i+1)){\n            hun[0]=10*(i+1);\n            u[0]=hun[0]-a;\n            break;\n        }\n    }\n    for(int i=0;i<14;i++){\n        if(b>10*i && b<=10*(i+1)){\n            hun[1]=10*(i+1);\n            u[1]=hun[1]-b;\n            break;\n        }\n    }\n    for(int i=0;i<14;i++){\n        if(c>10*i && c<=10*(i+1)){\n            hun[2]=10*(i+1);\n            u[2]=hun[2]-c;\n            break;\n        }\n    }\n    for(int i=0;i<14;i++){\n        if(d>10*i && d<=10*(i+1)){\n            hun[3]=10*(i+1);\n            u[3]=hun[3]-d;\n            break;\n        }\n    }\n    for(int i=0;i<14;i++){\n        if(e>10*i && e<=10*(i+1)){\n            hun[4]=10*(i+1);\n            u[4]=hun[4]-e;\n            break;\n        }\n    }\n    for(int i=0;i<5;i++){\n        if(u[i]>max){\n            max=u[i];\n        }\n    }\n\n    int sum=hun[0]+hun[1]+hun[2]+hun[3]+hun[4];\n    printf(\"%d\",sum-max);\n\n    return 0;\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": 1074, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s581412077", "group_id": "codeNet:p03076", "input_text": "    #include<stdio.h>\n    #include<string.h>\n    int main(void){\n    int A,B,C,a,b,c,d,e,k,i,j,cou,min,v[1000000];\n    char S[100000];\n    scanf(\"%d\",&a);\n    scanf(\"%d\",&b);\n    scanf(\"%d\",&c);\n    scanf(\"%d\",&d);\n    scanf(\"%d\",&e);\n    if((a==b)&&(a==c)&&(a==d)&&(a==e)){\n        if(a%10!=0){\n        a=a/10+1;\n        a=a*10;\n    }\n    if(b%10!=0){\n        b=b/10+1;\n        b=b*10;\n    }\n    if(c%10!=0){\n        c=c/10+1;\n        c=c*10;\n    }\n    if(d%10!=0){\n        d=d/10+1;\n        d=d*10;\n    }\n    printf(\"%d\",a+b+c+d+e);\n    }else{\n      min=a%10;\n    if((min>b%10)&&(b%10!=0)){\n        min=b%10;\n    }\n    if((min>c%10)&&(c%10!=0)){\n        min=c%10;\n    }\n    if((min>d%10)&&(d%10!=0)){\n        min=d%10;\n    }\n    if((min>e%10)&&(e%10!=0)){\n        min=e%10;\n    }\n    if((a%10!=0)&&(a%10!=min)){\n        a=a/10+1;\n        a=a*10;\n    }\n    if((b%10!=0)&&(b%10!=min)){\n        b=b/10+1;\n        b=b*10;\n    }\n    if((c%10!=0)&&(c%10!=min)){\n        c=c/10+1;\n        c=c*10;\n    }\n    if((d%10!=0)&&(d%10!=min)){\n        d=d/10+1;\n        d=d*10;\n    }\n    if((e%10!=0)&&(e%10!=min)){\n        e=e/10+1;\n        e=e*10;\n    }\n    printf(\"%d\",a+b+c+d+e);\n    }return 0;\n    }", "language": "C", "metadata": {"date": 1554579156, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "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/C/s581412077.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s581412077", "user_id": "u635508156"}, "prompt_components": {"gold_output": "215\n", "input_to_evaluate": "    #include<stdio.h>\n    #include<string.h>\n    int main(void){\n    int A,B,C,a,b,c,d,e,k,i,j,cou,min,v[1000000];\n    char S[100000];\n    scanf(\"%d\",&a);\n    scanf(\"%d\",&b);\n    scanf(\"%d\",&c);\n    scanf(\"%d\",&d);\n    scanf(\"%d\",&e);\n    if((a==b)&&(a==c)&&(a==d)&&(a==e)){\n        if(a%10!=0){\n        a=a/10+1;\n        a=a*10;\n    }\n    if(b%10!=0){\n        b=b/10+1;\n        b=b*10;\n    }\n    if(c%10!=0){\n        c=c/10+1;\n        c=c*10;\n    }\n    if(d%10!=0){\n        d=d/10+1;\n        d=d*10;\n    }\n    printf(\"%d\",a+b+c+d+e);\n    }else{\n      min=a%10;\n    if((min>b%10)&&(b%10!=0)){\n        min=b%10;\n    }\n    if((min>c%10)&&(c%10!=0)){\n        min=c%10;\n    }\n    if((min>d%10)&&(d%10!=0)){\n        min=d%10;\n    }\n    if((min>e%10)&&(e%10!=0)){\n        min=e%10;\n    }\n    if((a%10!=0)&&(a%10!=min)){\n        a=a/10+1;\n        a=a*10;\n    }\n    if((b%10!=0)&&(b%10!=min)){\n        b=b/10+1;\n        b=b*10;\n    }\n    if((c%10!=0)&&(c%10!=min)){\n        c=c/10+1;\n        c=c*10;\n    }\n    if((d%10!=0)&&(d%10!=min)){\n        d=d/10+1;\n        d=d*10;\n    }\n    if((e%10!=0)&&(e%10!=min)){\n        e=e/10+1;\n        e=e*10;\n    }\n    printf(\"%d\",a+b+c+d+e);\n    }return 0;\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": 1190, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s763541452", "group_id": "codeNet:p03076", "input_text": "#include <stdio.h>\nint main(void)\n{\n    int a[5], i, min=100, minidx, ans=0;\n    for(i=0;i<5;i++){\n        scanf(\"%d\", &a[i]);\n    }\n\n    for(i=0;i<5;i++){\n        if((a[i]%10)<min && (a[i]%10)!=0){\n            min=a[i]%10;\n            minidx=i;\n        }\n    }\n\n    for(i=0;i<5;i++){\n        if(i!=minidx){\n            ans=ans+a[i];\n            if(10-(a[i]%10)!=10) ans=ans+10-(a[i]%10);\n        }\n        else ans=ans+a[i];\n    }\n\n    printf(\"%d\\n\", ans);\n    \n\n    return 0;\n}\n", "language": "C", "metadata": {"date": 1554578751, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "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/C/s763541452.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s763541452", "user_id": "u196254124"}, "prompt_components": {"gold_output": "215\n", "input_to_evaluate": "#include <stdio.h>\nint main(void)\n{\n    int a[5], i, min=100, minidx, ans=0;\n    for(i=0;i<5;i++){\n        scanf(\"%d\", &a[i]);\n    }\n\n    for(i=0;i<5;i++){\n        if((a[i]%10)<min && (a[i]%10)!=0){\n            min=a[i]%10;\n            minidx=i;\n        }\n    }\n\n    for(i=0;i<5;i++){\n        if(i!=minidx){\n            ans=ans+a[i];\n            if(10-(a[i]%10)!=10) ans=ans+10-(a[i]%10);\n        }\n        else ans=ans+a[i];\n    }\n\n    printf(\"%d\\n\", ans);\n    \n\n    return 0;\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": 480, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s951291368", "group_id": "codeNet:p03078", "input_text": "#include <stdio.h>\n#include <string.h>\n#include <stdbool.h>\n#include <stdlib.h>\n#include <math.h>\nint acs(const void *a, const void *b) { return *(int *)a - *(int *)b; }                            /* 1,2,3,4.. */\nint cmp_char(const void *a, const void *b) { return *(char *)a - *(char *)b; }                     /* a,b,c,d.. */\nint cmp_str(const void *a, const void *b) { return strcmp(*(const char **)a, *(const char **)b); } /* aaa,aab.. */\n#define min(a, b) (a < b ? a : b)\n#define max(a, b) (a > b ? a : b)\n#define rep(i, l, r) for (int i = l; i < r; i++)\n#define MAX 10000000\n#define MOD 1000000007\n\ntypedef long long int lli;\n\nint des(const void *a, const void *b)\n{\n  if (*(long long int *)a > *(long long int *)b)\n    return -1;\n  if (*(long long int *)a < *(long long int *)b)\n    return 1;\n  return 0;\n}\n\n// 優先度付きキュー Priority Queue\n\ntypedef struct\n{\n  long long int pri;\n  long long int val[3];\n} que;\n\nque pq[MAX];\nint pq_size = 0; // 最大要素\n\nvoid PQadd(long long int pri, long long int val1,\n           long long int val2, long long int val3)\n{\n  int last = ++pq_size;\n  que new;\n  new.pri = pri;\n  new.val[0] = val1;\n  new.val[1] = val2;\n  new.val[2] = val3;\n  pq[pq_size] = new;\n\n  while (last > 1 && pq[last].pri > pq[last / 2].pri)\n  {\n    que temp;\n    temp = pq[last];\n    pq[last] = pq[last / 2];\n    pq[last / 2] = temp;\n    last /= 2;\n  }\n  return;\n}\n\nque PQget(void)\n{\n  que root = pq[1];\n  pq[1] = pq[pq_size--];\n\n  int last = 1, bigger_child;\n  while (last * 2 <= pq_size)\n  {\n    if (last * 2 == pq_size)\n      bigger_child = last * 2;\n    else\n      bigger_child = pq[last * 2].pri > pq[last * 2 + 1].pri ? last * 2 : last * 2 + 1;\n\n    if (pq[last].pri < pq[bigger_child].pri)\n    {\n      que temp;\n      temp = pq[last];\n      pq[last] = pq[bigger_child];\n      pq[bigger_child] = temp;\n      last = bigger_child;\n    }\n    else\n      break;\n  }\n  return root;\n}\n\nint main(void)\n{\n  lli a[1001], b[1001], c[1001];\n  int x, y, z, k;\n  scanf(\"%d %d %d %d\", &x, &y, &z, &k);\n  rep(i, 0, x) scanf(\"%lld\", &a[i]);\n  rep(i, 0, y) scanf(\"%lld\", &b[i]);\n  rep(i, 0, z) scanf(\"%lld\", &c[i]);\n\n  qsort(a, x, sizeof(lli), des);\n  qsort(b, y, sizeof(lli), des);\n  qsort(c, z, sizeof(lli), des);\n\n  PQadd(a[0] + b[0] + c[0], 0, 0, 0);\n  rep(i, 0, k)\n  {\n    que max = PQget();\n\n    int ai = max.val[0];\n    int bi = max.val[1];\n    int ci = max.val[2];\n\n    PQadd(a[ai + 1] + b[bi] + c[ci], ai + 1, bi, ci);\n    PQadd(a[ai] + b[bi + 1] + c[ci], ai, bi + 1, ci);\n    PQadd(a[ai] + b[bi] + c[ci + 1], ai, bi, ci + 1);\n\n    printf(\"%lld\\n\", max.pri);\n  }\n\n  return 0;\n}\n", "language": "C", "metadata": {"date": 1573157474, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "problem_description_relpath": "problem_descriptions/p03078.html", "problem_id": "p03078", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03078/input.txt", "sample_output_relpath": "derived/input_output/data/p03078/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03078/C/s951291368.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s951291368", "user_id": "u391667116"}, "prompt_components": {"gold_output": "19\n17\n15\n14\n13\n12\n10\n8\n", "input_to_evaluate": "#include <stdio.h>\n#include <string.h>\n#include <stdbool.h>\n#include <stdlib.h>\n#include <math.h>\nint acs(const void *a, const void *b) { return *(int *)a - *(int *)b; }                            /* 1,2,3,4.. */\nint cmp_char(const void *a, const void *b) { return *(char *)a - *(char *)b; }                     /* a,b,c,d.. */\nint cmp_str(const void *a, const void *b) { return strcmp(*(const char **)a, *(const char **)b); } /* aaa,aab.. */\n#define min(a, b) (a < b ? a : b)\n#define max(a, b) (a > b ? a : b)\n#define rep(i, l, r) for (int i = l; i < r; i++)\n#define MAX 10000000\n#define MOD 1000000007\n\ntypedef long long int lli;\n\nint des(const void *a, const void *b)\n{\n  if (*(long long int *)a > *(long long int *)b)\n    return -1;\n  if (*(long long int *)a < *(long long int *)b)\n    return 1;\n  return 0;\n}\n\n// 優先度付きキュー Priority Queue\n\ntypedef struct\n{\n  long long int pri;\n  long long int val[3];\n} que;\n\nque pq[MAX];\nint pq_size = 0; // 最大要素\n\nvoid PQadd(long long int pri, long long int val1,\n           long long int val2, long long int val3)\n{\n  int last = ++pq_size;\n  que new;\n  new.pri = pri;\n  new.val[0] = val1;\n  new.val[1] = val2;\n  new.val[2] = val3;\n  pq[pq_size] = new;\n\n  while (last > 1 && pq[last].pri > pq[last / 2].pri)\n  {\n    que temp;\n    temp = pq[last];\n    pq[last] = pq[last / 2];\n    pq[last / 2] = temp;\n    last /= 2;\n  }\n  return;\n}\n\nque PQget(void)\n{\n  que root = pq[1];\n  pq[1] = pq[pq_size--];\n\n  int last = 1, bigger_child;\n  while (last * 2 <= pq_size)\n  {\n    if (last * 2 == pq_size)\n      bigger_child = last * 2;\n    else\n      bigger_child = pq[last * 2].pri > pq[last * 2 + 1].pri ? last * 2 : last * 2 + 1;\n\n    if (pq[last].pri < pq[bigger_child].pri)\n    {\n      que temp;\n      temp = pq[last];\n      pq[last] = pq[bigger_child];\n      pq[bigger_child] = temp;\n      last = bigger_child;\n    }\n    else\n      break;\n  }\n  return root;\n}\n\nint main(void)\n{\n  lli a[1001], b[1001], c[1001];\n  int x, y, z, k;\n  scanf(\"%d %d %d %d\", &x, &y, &z, &k);\n  rep(i, 0, x) scanf(\"%lld\", &a[i]);\n  rep(i, 0, y) scanf(\"%lld\", &b[i]);\n  rep(i, 0, z) scanf(\"%lld\", &c[i]);\n\n  qsort(a, x, sizeof(lli), des);\n  qsort(b, y, sizeof(lli), des);\n  qsort(c, z, sizeof(lli), des);\n\n  PQadd(a[0] + b[0] + c[0], 0, 0, 0);\n  rep(i, 0, k)\n  {\n    que max = PQget();\n\n    int ai = max.val[0];\n    int bi = max.val[1];\n    int ci = max.val[2];\n\n    PQadd(a[ai + 1] + b[bi] + c[ci], ai + 1, bi, ci);\n    PQadd(a[ai] + b[bi + 1] + c[ci], ai, bi + 1, ci);\n    PQadd(a[ai] + b[bi] + c[ci + 1], ai, bi, ci + 1);\n\n    printf(\"%lld\\n\", max.pri);\n  }\n\n  return 0;\n}\n", "problem_context": "Score: 400 points\n\nProblem Statement\n\nThe Patisserie AtCoder sells cakes with number-shaped candles.\nThere are X, Y and Z kinds of cakes with 1-shaped, 2-shaped and 3-shaped candles, respectively.\nEach cake has an integer value called deliciousness, as follows:\n\nThe deliciousness of the cakes with 1-shaped candles are A_1, A_2, ..., A_X.\n\nThe deliciousness of the cakes with 2-shaped candles are B_1, B_2, ..., B_Y.\n\nThe deliciousness of the cakes with 3-shaped candles are C_1, C_2, ..., C_Z.\n\nTakahashi decides to buy three cakes, one for each of the three shapes of the candles, to celebrate ABC 123.\n\nThere are X \\times Y \\times Z such ways to choose three cakes.\n\nWe will arrange these X \\times Y \\times Z ways in descending order of the sum of the deliciousness of the cakes.\n\nPrint the sums of the deliciousness of the cakes for the first, second, ..., K-th ways in this list.\n\nConstraints\n\n1 \\leq X \\leq 1 \\ 000\n\n1 \\leq Y \\leq 1 \\ 000\n\n1 \\leq Z \\leq 1 \\ 000\n\n1 \\leq K \\leq \\min(3 \\ 000, X \\times Y \\times Z)\n\n1 \\leq A_i \\leq 10 \\ 000 \\ 000 \\ 000\n\n1 \\leq B_i \\leq 10 \\ 000 \\ 000 \\ 000\n\n1 \\leq C_i \\leq 10 \\ 000 \\ 000 \\ 000\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX Y Z K\nA_1 \\ A_2 \\ A_3 \\ ... \\ A_X\nB_1 \\ B_2 \\ B_3 \\ ... \\ B_Y\nC_1 \\ C_2 \\ C_3 \\ ... \\ C_Z\n\nOutput\n\nPrint K lines. The i-th line should contain the i-th value stated in the problem statement.\n\nSample Input 1\n\n2 2 2 8\n4 6\n1 5\n3 8\n\nSample Output 1\n\n19\n17\n15\n14\n13\n12\n10\n8\n\nThere are 2 \\times 2 \\times 2 = 8 ways to choose three cakes, as shown below in descending order of the sum of the deliciousness of the cakes:\n\n(A_2, B_2, C_2): 6 + 5 + 8 = 19\n\n(A_1, B_2, C_2): 4 + 5 + 8 = 17\n\n(A_2, B_1, C_2): 6 + 1 + 8 = 15\n\n(A_2, B_2, C_1): 6 + 5 + 3 = 14\n\n(A_1, B_1, C_2): 4 + 1 + 8 = 13\n\n(A_1, B_2, C_1): 4 + 5 + 3 = 12\n\n(A_2, B_1, C_1): 6 + 1 + 3 = 10\n\n(A_1, B_1, C_1): 4 + 1 + 3 = 8\n\nSample Input 2\n\n3 3 3 5\n1 10 100\n2 20 200\n1 10 100\n\nSample Output 2\n\n400\n310\n310\n301\n301\n\nThere may be multiple combinations of cakes with the same sum of the deliciousness. For example, in this test case, the sum of A_1, B_3, C_3 and the sum of A_3, B_3, C_1 are both 301.\nHowever, they are different ways of choosing cakes, so 301 occurs twice in the output.\n\nSample Input 3\n\n10 10 10 20\n7467038376 5724769290 292794712 2843504496 3381970101 8402252870 249131806 6310293640 6690322794 6082257488\n1873977926 2576529623 1144842195 1379118507 6003234687 4925540914 3902539811 3326692703 484657758 2877436338\n4975681328 8974383988 2882263257 7690203955 514305523 6679823484 4263279310 585966808 3752282379 620585736\n\nSample Output 3\n\n23379871545\n22444657051\n22302177772\n22095691512\n21667941469\n21366963278\n21287912315\n21279176669\n21160477018\n21085311041\n21059876163\n21017997739\n20703329561\n20702387965\n20590247696\n20383761436\n20343962175\n20254073196\n20210218542\n20150096547\n\nNote that the input or output may not fit into a 32-bit integer type.", "sample_input": "2 2 2 8\n4 6\n1 5\n3 8\n"}, "reference_outputs": ["19\n17\n15\n14\n13\n12\n10\n8\n"], "source_document_id": "p03078", "source_text": "Score: 400 points\n\nProblem Statement\n\nThe Patisserie AtCoder sells cakes with number-shaped candles.\nThere are X, Y and Z kinds of cakes with 1-shaped, 2-shaped and 3-shaped candles, respectively.\nEach cake has an integer value called deliciousness, as follows:\n\nThe deliciousness of the cakes with 1-shaped candles are A_1, A_2, ..., A_X.\n\nThe deliciousness of the cakes with 2-shaped candles are B_1, B_2, ..., B_Y.\n\nThe deliciousness of the cakes with 3-shaped candles are C_1, C_2, ..., C_Z.\n\nTakahashi decides to buy three cakes, one for each of the three shapes of the candles, to celebrate ABC 123.\n\nThere are X \\times Y \\times Z such ways to choose three cakes.\n\nWe will arrange these X \\times Y \\times Z ways in descending order of the sum of the deliciousness of the cakes.\n\nPrint the sums of the deliciousness of the cakes for the first, second, ..., K-th ways in this list.\n\nConstraints\n\n1 \\leq X \\leq 1 \\ 000\n\n1 \\leq Y \\leq 1 \\ 000\n\n1 \\leq Z \\leq 1 \\ 000\n\n1 \\leq K \\leq \\min(3 \\ 000, X \\times Y \\times Z)\n\n1 \\leq A_i \\leq 10 \\ 000 \\ 000 \\ 000\n\n1 \\leq B_i \\leq 10 \\ 000 \\ 000 \\ 000\n\n1 \\leq C_i \\leq 10 \\ 000 \\ 000 \\ 000\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX Y Z K\nA_1 \\ A_2 \\ A_3 \\ ... \\ A_X\nB_1 \\ B_2 \\ B_3 \\ ... \\ B_Y\nC_1 \\ C_2 \\ C_3 \\ ... \\ C_Z\n\nOutput\n\nPrint K lines. The i-th line should contain the i-th value stated in the problem statement.\n\nSample Input 1\n\n2 2 2 8\n4 6\n1 5\n3 8\n\nSample Output 1\n\n19\n17\n15\n14\n13\n12\n10\n8\n\nThere are 2 \\times 2 \\times 2 = 8 ways to choose three cakes, as shown below in descending order of the sum of the deliciousness of the cakes:\n\n(A_2, B_2, C_2): 6 + 5 + 8 = 19\n\n(A_1, B_2, C_2): 4 + 5 + 8 = 17\n\n(A_2, B_1, C_2): 6 + 1 + 8 = 15\n\n(A_2, B_2, C_1): 6 + 5 + 3 = 14\n\n(A_1, B_1, C_2): 4 + 1 + 8 = 13\n\n(A_1, B_2, C_1): 4 + 5 + 3 = 12\n\n(A_2, B_1, C_1): 6 + 1 + 3 = 10\n\n(A_1, B_1, C_1): 4 + 1 + 3 = 8\n\nSample Input 2\n\n3 3 3 5\n1 10 100\n2 20 200\n1 10 100\n\nSample Output 2\n\n400\n310\n310\n301\n301\n\nThere may be multiple combinations of cakes with the same sum of the deliciousness. For example, in this test case, the sum of A_1, B_3, C_3 and the sum of A_3, B_3, C_1 are both 301.\nHowever, they are different ways of choosing cakes, so 301 occurs twice in the output.\n\nSample Input 3\n\n10 10 10 20\n7467038376 5724769290 292794712 2843504496 3381970101 8402252870 249131806 6310293640 6690322794 6082257488\n1873977926 2576529623 1144842195 1379118507 6003234687 4925540914 3902539811 3326692703 484657758 2877436338\n4975681328 8974383988 2882263257 7690203955 514305523 6679823484 4263279310 585966808 3752282379 620585736\n\nSample Output 3\n\n23379871545\n22444657051\n22302177772\n22095691512\n21667941469\n21366963278\n21287912315\n21279176669\n21160477018\n21085311041\n21059876163\n21017997739\n20703329561\n20702387965\n20590247696\n20383761436\n20343962175\n20254073196\n20210218542\n20150096547\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": 2604, "cpu_time_ms": 2, "memory_kb": 380}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s831723923", "group_id": "codeNet:p03085", "input_text": "#include<stdio.h>\nint main()\n{\n    char b;\n    scanf(\"%c\", &b);\n    if(b=='A'){\n        printf(\"T\\n\");\n    }\n    else if(b=='T'){\n        printf(\"A\\n\");\n    }\n    else if(b=='C'){\n        printf(\"G\\n\");\n    }\n    else if(b=='G'){\n        printf(\"C\\n\");\n    }\n    return 0;\n}\n", "language": "C", "metadata": {"date": 1593708568, "filename_ext": "c", "original_language": "C (GCC 9.2.1)", "problem_description_relpath": "problem_descriptions/p03085.html", "problem_id": "p03085", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03085/input.txt", "sample_output_relpath": "derived/input_output/data/p03085/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03085/C/s831723923.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s831723923", "user_id": "u863370423"}, "prompt_components": {"gold_output": "T\n", "input_to_evaluate": "#include<stdio.h>\nint main()\n{\n    char b;\n    scanf(\"%c\", &b);\n    if(b=='A'){\n        printf(\"T\\n\");\n    }\n    else if(b=='T'){\n        printf(\"A\\n\");\n    }\n    else if(b=='C'){\n        printf(\"G\\n\");\n    }\n    else if(b=='G'){\n        printf(\"C\\n\");\n    }\n    return 0;\n}\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nOn the Planet AtCoder, there are four types of bases: A, C, G and T. A bonds with T, and C bonds with G.\n\nYou are given a letter b as input, which is A, C, G or T. Write a program that prints the letter representing the base that bonds with the base b.\n\nConstraints\n\nb is one of the letters A, C, G and T.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nb\n\nOutput\n\nPrint the letter representing the base that bonds with the base b.\n\nSample Input 1\n\nA\n\nSample Output 1\n\nT\n\nSample Input 2\n\nG\n\nSample Output 2\n\nC", "sample_input": "A\n"}, "reference_outputs": ["T\n"], "source_document_id": "p03085", "source_text": "Score : 100 points\n\nProblem Statement\n\nOn the Planet AtCoder, there are four types of bases: A, C, G and T. A bonds with T, and C bonds with G.\n\nYou are given a letter b as input, which is A, C, G or T. Write a program that prints the letter representing the base that bonds with the base b.\n\nConstraints\n\nb is one of the letters A, C, G and T.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nb\n\nOutput\n\nPrint the letter representing the base that bonds with the base b.\n\nSample Input 1\n\nA\n\nSample Output 1\n\nT\n\nSample Input 2\n\nG\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": 275, "cpu_time_ms": 7, "memory_kb": 1600}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s189146680", "group_id": "codeNet:p03085", "input_text": "#include<stdio.h>\n \nint main(void)\n{\n char a[2];\n scanf(\"%s\",a);\n  if(a[0]=='A')\n    printf(\"T\");\n   if(a[0]=='T')\n    printf(\"A\");\n   if(a[0]=='C')\n    printf(\"G\");\n   if(a[0]=='G')\n    printf(\"C\");\n return 0;\n}", "language": "C", "metadata": {"date": 1557406408, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "problem_description_relpath": "problem_descriptions/p03085.html", "problem_id": "p03085", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03085/input.txt", "sample_output_relpath": "derived/input_output/data/p03085/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03085/C/s189146680.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s189146680", "user_id": "u139428943"}, "prompt_components": {"gold_output": "T\n", "input_to_evaluate": "#include<stdio.h>\n \nint main(void)\n{\n char a[2];\n scanf(\"%s\",a);\n  if(a[0]=='A')\n    printf(\"T\");\n   if(a[0]=='T')\n    printf(\"A\");\n   if(a[0]=='C')\n    printf(\"G\");\n   if(a[0]=='G')\n    printf(\"C\");\n return 0;\n}", "problem_context": "Score : 100 points\n\nProblem Statement\n\nOn the Planet AtCoder, there are four types of bases: A, C, G and T. A bonds with T, and C bonds with G.\n\nYou are given a letter b as input, which is A, C, G or T. Write a program that prints the letter representing the base that bonds with the base b.\n\nConstraints\n\nb is one of the letters A, C, G and T.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nb\n\nOutput\n\nPrint the letter representing the base that bonds with the base b.\n\nSample Input 1\n\nA\n\nSample Output 1\n\nT\n\nSample Input 2\n\nG\n\nSample Output 2\n\nC", "sample_input": "A\n"}, "reference_outputs": ["T\n"], "source_document_id": "p03085", "source_text": "Score : 100 points\n\nProblem Statement\n\nOn the Planet AtCoder, there are four types of bases: A, C, G and T. A bonds with T, and C bonds with G.\n\nYou are given a letter b as input, which is A, C, G or T. Write a program that prints the letter representing the base that bonds with the base b.\n\nConstraints\n\nb is one of the letters A, C, G and T.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nb\n\nOutput\n\nPrint the letter representing the base that bonds with the base b.\n\nSample Input 1\n\nA\n\nSample Output 1\n\nT\n\nSample Input 2\n\nG\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": 212, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s713466353", "group_id": "codeNet:p03085", "input_text": "#include <stdio.h>\n\nint main(void)\n{\n\tchar c;\n\tscanf(\"%c\",&c);\n\t\n\tif(c == 'A'){\n\t\tprintf(\"T\\n\");\n\t}else if(c == 'T'){\n\t\tprintf(\"A\\n\");\n\t}else if(c == 'C'){\n\t\tprintf(\"G\\n\");\n\t}else if(c == 'G'){\n\t\tprintf(\"C\\n\");\n\t}\n\treturn 0;\n}\n", "language": "C", "metadata": {"date": 1553459629, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "problem_description_relpath": "problem_descriptions/p03085.html", "problem_id": "p03085", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03085/input.txt", "sample_output_relpath": "derived/input_output/data/p03085/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03085/C/s713466353.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s713466353", "user_id": "u573564324"}, "prompt_components": {"gold_output": "T\n", "input_to_evaluate": "#include <stdio.h>\n\nint main(void)\n{\n\tchar c;\n\tscanf(\"%c\",&c);\n\t\n\tif(c == 'A'){\n\t\tprintf(\"T\\n\");\n\t}else if(c == 'T'){\n\t\tprintf(\"A\\n\");\n\t}else if(c == 'C'){\n\t\tprintf(\"G\\n\");\n\t}else if(c == 'G'){\n\t\tprintf(\"C\\n\");\n\t}\n\treturn 0;\n}\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nOn the Planet AtCoder, there are four types of bases: A, C, G and T. A bonds with T, and C bonds with G.\n\nYou are given a letter b as input, which is A, C, G or T. Write a program that prints the letter representing the base that bonds with the base b.\n\nConstraints\n\nb is one of the letters A, C, G and T.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nb\n\nOutput\n\nPrint the letter representing the base that bonds with the base b.\n\nSample Input 1\n\nA\n\nSample Output 1\n\nT\n\nSample Input 2\n\nG\n\nSample Output 2\n\nC", "sample_input": "A\n"}, "reference_outputs": ["T\n"], "source_document_id": "p03085", "source_text": "Score : 100 points\n\nProblem Statement\n\nOn the Planet AtCoder, there are four types of bases: A, C, G and T. A bonds with T, and C bonds with G.\n\nYou are given a letter b as input, which is A, C, G or T. Write a program that prints the letter representing the base that bonds with the base b.\n\nConstraints\n\nb is one of the letters A, C, G and T.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nb\n\nOutput\n\nPrint the letter representing the base that bonds with the base b.\n\nSample Input 1\n\nA\n\nSample Output 1\n\nT\n\nSample Input 2\n\nG\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": 227, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s683445461", "group_id": "codeNet:p03086", "input_text": "#include <stdio.h>\n#include <string.h>\nint main (void){\n    char str[11];\n    scanf(\"%s\",str);\n\n  \tint i;\n    int length = 0;\n    int length_max = 0;\n    for(i=0;i<strlen(str);i++){\n        if(str[i] != 'A' &&\n            str[i] != 'C' &&\n            str[i] != 'G' &&\n            str[i] != 'T'){\n              length = 0;  \n        }else{\n            length++;\n            if(length >length_max){\n                length_max = length;\n            }\n        }\n    }\n    printf(\"%d\",length_max);\n    \n}", "language": "C", "metadata": {"date": 1599935895, "filename_ext": "c", "original_language": "C (GCC 9.2.1)", "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/C/s683445461.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s683445461", "user_id": "u806585072"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "#include <stdio.h>\n#include <string.h>\nint main (void){\n    char str[11];\n    scanf(\"%s\",str);\n\n  \tint i;\n    int length = 0;\n    int length_max = 0;\n    for(i=0;i<strlen(str);i++){\n        if(str[i] != 'A' &&\n            str[i] != 'C' &&\n            str[i] != 'G' &&\n            str[i] != 'T'){\n              length = 0;  \n        }else{\n            length++;\n            if(length >length_max){\n                length_max = length;\n            }\n        }\n    }\n    printf(\"%d\",length_max);\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": 499, "cpu_time_ms": 4, "memory_kb": 1720}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s021579948", "group_id": "codeNet:p03086", "input_text": "#include <stdio.h>\nint main(void){\n\n  char S[11];\n  int count=0;\n  int max=0;\n  \n  scanf(\"%s\",S);\n  \n  for(int i=0;i<10;i++){\n  \t  if(S[i]=='A' || S[i]=='C' || S[i]=='G' || S[i]=='T'){\n        while(S[i]=='A' || S[i]=='C' || S[i]=='G' || S[i]=='T'){\n        \tcount++;\n        }\n        if(count>max){\n        \tmax=count;\n        }else{\n        \tcount=0;\n        }\n      }\n  }\n\n  printf(\"%d\",max);\n  \n return 0;\n}", "language": "C", "metadata": {"date": 1590283243, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "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/C/s021579948.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s021579948", "user_id": "u856193324"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "#include <stdio.h>\nint main(void){\n\n  char S[11];\n  int count=0;\n  int max=0;\n  \n  scanf(\"%s\",S);\n  \n  for(int i=0;i<10;i++){\n  \t  if(S[i]=='A' || S[i]=='C' || S[i]=='G' || S[i]=='T'){\n        while(S[i]=='A' || S[i]=='C' || S[i]=='G' || S[i]=='T'){\n        \tcount++;\n        }\n        if(count>max){\n        \tmax=count;\n        }else{\n        \tcount=0;\n        }\n      }\n  }\n\n  printf(\"%d\",max);\n  \n return 0;\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": 412, "cpu_time_ms": 2103, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s437566348", "group_id": "codeNet:p03086", "input_text": "#include<stdio.h>\n#include<string.h>\n\nint main(){\n    int i,max=0,slen;\n    char s[20], str[10];\n    int ans=0;\n    \n    scanf(\"%s\", &s);\n    slen = strlen(s);\n\n    for(i=0; i<slen; i++){\n        if(s[i] == 'A'){\n            ans += 1;\n        }else if( s[i] == 'C' ){\n            ans += 1;\n        }else if(s[i] == 'G'){\n            ans += 1;\n        }else if(s[i] == 'T'){\n            ans += 1;\n        }else{\n            ans = 0;\n        }\n        if(max<ans){\n            max = ans;\n        }\n    }\n\n    printf(\"%d\", max);\n    return 0;\n\n}", "language": "C", "metadata": {"date": 1561886256, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "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/C/s437566348.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s437566348", "user_id": "u235231201"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "#include<stdio.h>\n#include<string.h>\n\nint main(){\n    int i,max=0,slen;\n    char s[20], str[10];\n    int ans=0;\n    \n    scanf(\"%s\", &s);\n    slen = strlen(s);\n\n    for(i=0; i<slen; i++){\n        if(s[i] == 'A'){\n            ans += 1;\n        }else if( s[i] == 'C' ){\n            ans += 1;\n        }else if(s[i] == 'G'){\n            ans += 1;\n        }else if(s[i] == 'T'){\n            ans += 1;\n        }else{\n            ans = 0;\n        }\n        if(max<ans){\n            max = ans;\n        }\n    }\n\n    printf(\"%d\", max);\n    return 0;\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": 542, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s153851408", "group_id": "codeNet:p03087", "input_text": "#include <stdio.h>\n#include <stdlib.h>\n#include <string.h>\n#include <math.h>\n\nvoid check (char *s, int n, int *a) {\n    int flag = 0;\n    for (int i=0; i<n; i++) {\n        if (s[i] == 'A') {\n            flag = 1;\n        }\n        else if (s[i] == 'C') {\n            if (flag) {\n                a[i] = 1;\n                flag = 0;\n            }\n        }\n        else {\n            flag = 0;\n        }\n    }\n}\n\nint main() {\n    int n = 0,q = 0;\n    scanf(\"%d %d\\n\", &n, &q);\n    char s[n+2];\n    fgets(s, n+2, stdin);\n    int a[n];\n    for (int i=0; i<n; i++) {\n        a[i] = 0;\n    }\n    check(s, n, a);\n    int *find = (int *)malloc(sizeof(int)*n*n);\n    for (int i=0; i<n; i++) {\n        for (int j=i; j<n; j++) {\n            if (j == i) *(find+n*i+j) = 0;\n            else *(find+n*i+j) = *(find+n*i+j-1) + a[j];\n        }\n    }\n    int l = 0, r = 0;\n    for (int i=0; i<q; i++) {\n        scanf(\"%d %d\\n\", &l, &r);\n        printf(\"%d\\n\", *(find+n*(l-1)+r-1));\n    }\n    free(find);\n    return 0;\n}\n", "language": "C", "metadata": {"date": 1557914668, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "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/C/s153851408.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s153851408", "user_id": "u324549724"}, "prompt_components": {"gold_output": "2\n0\n3\n", "input_to_evaluate": "#include <stdio.h>\n#include <stdlib.h>\n#include <string.h>\n#include <math.h>\n\nvoid check (char *s, int n, int *a) {\n    int flag = 0;\n    for (int i=0; i<n; i++) {\n        if (s[i] == 'A') {\n            flag = 1;\n        }\n        else if (s[i] == 'C') {\n            if (flag) {\n                a[i] = 1;\n                flag = 0;\n            }\n        }\n        else {\n            flag = 0;\n        }\n    }\n}\n\nint main() {\n    int n = 0,q = 0;\n    scanf(\"%d %d\\n\", &n, &q);\n    char s[n+2];\n    fgets(s, n+2, stdin);\n    int a[n];\n    for (int i=0; i<n; i++) {\n        a[i] = 0;\n    }\n    check(s, n, a);\n    int *find = (int *)malloc(sizeof(int)*n*n);\n    for (int i=0; i<n; i++) {\n        for (int j=i; j<n; j++) {\n            if (j == i) *(find+n*i+j) = 0;\n            else *(find+n*i+j) = *(find+n*i+j-1) + a[j];\n        }\n    }\n    int l = 0, r = 0;\n    for (int i=0; i<q; i++) {\n        scanf(\"%d %d\\n\", &l, &r);\n        printf(\"%d\\n\", *(find+n*(l-1)+r-1));\n    }\n    free(find);\n    return 0;\n}\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": 1003, "cpu_time_ms": 299, "memory_kb": 640}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s909194109", "group_id": "codeNet:p03087", "input_text": "#include<stdio.h>\nint main(void)\n{\n\tint N, Q,i,j;\n\tscanf(\"%d %d\",&N,&Q);\n\tchar s[N+1];\n\tint l[Q+1],r[Q+1];\n\tscanf(\"%s\",s);\n\tfor(i=0;i<Q;i++){\n\t\tscanf(\"%d %d\",&l[i],&r[i]);\n\t}\n\tint count;\n\tfor(i=0;i<Q;i++){\n\t\tcount = 0;\n\t\tfor(j=l[i]-1;j<r[i]-1;j++){\n\t\t\tif('A' == s[j] && 'C' == s[j+1])count++;\n\t\t}\n\t\tif(i == Q-1){printf(\"%d\",count);\n\t\t}else{\n\t\tprintf(\"%d\\n\",count);\n\t\t}\n\t}\n\treturn 0;\n}", "language": "C", "metadata": {"date": 1553461577, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "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/C/s909194109.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s909194109", "user_id": "u834403535"}, "prompt_components": {"gold_output": "2\n0\n3\n", "input_to_evaluate": "#include<stdio.h>\nint main(void)\n{\n\tint N, Q,i,j;\n\tscanf(\"%d %d\",&N,&Q);\n\tchar s[N+1];\n\tint l[Q+1],r[Q+1];\n\tscanf(\"%s\",s);\n\tfor(i=0;i<Q;i++){\n\t\tscanf(\"%d %d\",&l[i],&r[i]);\n\t}\n\tint count;\n\tfor(i=0;i<Q;i++){\n\t\tcount = 0;\n\t\tfor(j=l[i]-1;j<r[i]-1;j++){\n\t\t\tif('A' == s[j] && 'C' == s[j+1])count++;\n\t\t}\n\t\tif(i == Q-1){printf(\"%d\",count);\n\t\t}else{\n\t\tprintf(\"%d\\n\",count);\n\t\t}\n\t}\n\treturn 0;\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": 384, "cpu_time_ms": 2103, "memory_kb": 1408}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s547122574", "group_id": "codeNet:p03087", "input_text": "#include <stdio.h>\n#include <stdlib.h>\n#include <string.h>\n#include <math.h>\n#include <limits.h>\n\n#define REP(i,n) for(i=0;i<n;i++)\n#define REVREP(i,n) for(i=n-1;i>=0;i--)\n\nint iin() {\n    int i;\n    scanf(\"%d\", &i);\n    return i;\n}\n\nlong long llin() {\n    long long i;\n    scanf(\"%lld\", &i);\n    return i; \n}\n\ndouble din() {\n    double i;\n    scanf(\"%lf\", &i);\n    return i;\n}\n\nchar cin() {\n    char c;\n    scanf(\"%c\", &c);\n    return c;\n}\n\nvoid stin(char *s) {\n    scanf(\"%s\", s);\n}\n\nvoid iout(int i) {\n    printf(\"%d\\n\", i);\n}\n\nvoid llout(long long i) {\n    printf(\"%lld\\n\", i);\n}\n\nvoid dout(double i) {\n    printf(\"%lf\\n\", i);\n}\n\nvoid cout(char c) {\n    printf(\"%c\\n\", c);\n}\n\nvoid stout(char *s) {\n    printf(\"%s\\n\", s);\n}\n\nvoid check(char *S, int *C) {\n    int i, j;\n    REVREP(i,strlen(S)) {\n        j = i + 1;\n        if (j > strlen(S)) continue;\n//        cout(S[i]);\n        if (S[i] != 'A') {\n            C[i] += C[j];\n        } else {\n            if (S[j] != 'C') {\n                C[i] += C[j];\n            } else {\n                C[i] += (C[j] + 1);\n            }\n        }\n    }\n}\n\nint main() {\n    int N = iin(), Q = iin();\n    char S[N];\n    int C[N];\n    int i;\n    stin(S);\n    memset(C, 0, sizeof C);\n//    stout(S);\n    check(S, C);\n//    REP(i,N) { iout(C[i]); }\n    REP(i,Q) {\n        int l = iin(), r = iin();\n        iout(C[l - 1] - C[r - 1]);\n    }\n    return 0;\n}", "language": "C", "metadata": {"date": 1553459648, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "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/C/s547122574.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s547122574", "user_id": "u420082791"}, "prompt_components": {"gold_output": "2\n0\n3\n", "input_to_evaluate": "#include <stdio.h>\n#include <stdlib.h>\n#include <string.h>\n#include <math.h>\n#include <limits.h>\n\n#define REP(i,n) for(i=0;i<n;i++)\n#define REVREP(i,n) for(i=n-1;i>=0;i--)\n\nint iin() {\n    int i;\n    scanf(\"%d\", &i);\n    return i;\n}\n\nlong long llin() {\n    long long i;\n    scanf(\"%lld\", &i);\n    return i; \n}\n\ndouble din() {\n    double i;\n    scanf(\"%lf\", &i);\n    return i;\n}\n\nchar cin() {\n    char c;\n    scanf(\"%c\", &c);\n    return c;\n}\n\nvoid stin(char *s) {\n    scanf(\"%s\", s);\n}\n\nvoid iout(int i) {\n    printf(\"%d\\n\", i);\n}\n\nvoid llout(long long i) {\n    printf(\"%lld\\n\", i);\n}\n\nvoid dout(double i) {\n    printf(\"%lf\\n\", i);\n}\n\nvoid cout(char c) {\n    printf(\"%c\\n\", c);\n}\n\nvoid stout(char *s) {\n    printf(\"%s\\n\", s);\n}\n\nvoid check(char *S, int *C) {\n    int i, j;\n    REVREP(i,strlen(S)) {\n        j = i + 1;\n        if (j > strlen(S)) continue;\n//        cout(S[i]);\n        if (S[i] != 'A') {\n            C[i] += C[j];\n        } else {\n            if (S[j] != 'C') {\n                C[i] += C[j];\n            } else {\n                C[i] += (C[j] + 1);\n            }\n        }\n    }\n}\n\nint main() {\n    int N = iin(), Q = iin();\n    char S[N];\n    int C[N];\n    int i;\n    stin(S);\n    memset(C, 0, sizeof C);\n//    stout(S);\n    check(S, C);\n//    REP(i,N) { iout(C[i]); }\n    REP(i,Q) {\n        int l = iin(), r = iin();\n        iout(C[l - 1] - C[r - 1]);\n    }\n    return 0;\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": 1390, "cpu_time_ms": 290, "memory_kb": 1280}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s346596504", "group_id": "codeNet:p03095", "input_text": "//temp\n#include<stdio.h>\n#include<stdlib.h>\n\nint search(char str[],char sear) {\n\tint i;\n\tint num = 0;\n\n\tfor (i = 0;i < 110000;i++) {\n\t\tif (str[i] == sear) {\n\t\t\tnum++;\n\t\t}\n\t}\n\treturn num;\n}\n\nint main() {\n\tint i, j, k, f = 0, n, t, m;\n\tint a, b, c, d, e;\n\tint x, y, z;\n\tchar s[110000];\n\tint b0[30];\n\tchar a0[30];\n\n\tscanf(\"%d\", &n);\n\tscanf(\"%s\", s);\n\n\ti = 0;\n\ta0[i] = 'a';\n\tb0[i] = search(s, a0[i])+1;\n\ti++;\n\ta0[i] = 'b';\n\tb0[i] = search(s, a0[i])+1;\n\ti++;\n\ta0[i] = 'c';\n\tb0[i] = search(s, a0[i])+1;\n\ti++;\n\ta0[i] = 'd';\n\tb0[i] = search(s, a0[i])+1;\n\ti++;\n\ta0[i] = 'e';\n\tb0[i] = search(s, a0[i])+1;\n\ti++;\n\ta0[i] = 'f';\n\tb0[i] = search(s, a0[i])+1;\n\ti++;\n\ta0[i] = 'g';\n\tb0[i] = search(s, a0[i])+1;\n\ti++;\n\ta0[i] = 'h';\n\tb0[i] = search(s, a0[i])+1;\n\ti++;\n\ta0[i] = 'i';\n\tb0[i] = search(s, a0[i])+1;\n\ti++;\n\ta0[i] = 'j';\n\tb0[i] = search(s, a0[i])+1;\n\ti++;\n\ta0[i] = 'k';\n\tb0[i] = search(s, a0[i])+1;\n\ti++;\n\ta0[i] = 'l';\n\tb0[i] = search(s, a0[i])+1;\n\ti++;\n\ta0[i] = 'm';\n\tb0[i] = search(s, a0[i])+1;\n\ti++;\n\ta0[i] = 'n';\n\tb0[i] = search(s, a0[i])+1;\n\ti++;\n\ta0[i] = 'o';\n\tb0[i] = search(s, a0[i])+1;\n\ti++;\n\ta0[i] = 'p';\n\tb0[i] = search(s, a0[i])+1;\n\ti++;\n\ta0[i] = 'q';\n\tb0[i] = search(s, a0[i])+1;\n\ti++;\n\ta0[i] = 'r';\n\tb0[i] = search(s, a0[i])+1;\n\ti++;\n\ta0[i] = 's';\n\tb0[i] = search(s, a0[i])+1;\n\ti++;\n\ta0[i] = 't';\n\tb0[i] = search(s, a0[i])+1;\n\ti++;\n\ta0[i] = 'u';\n\tb0[i] = search(s, a0[i])+1;\n\ti++;\n\ta0[i] = 'v';\n\tb0[i] = search(s, a0[i])+1;\n\ti++;\n\ta0[i] = 'w';\n\tb0[i] = search(s, a0[i])+1;\n\ti++;\n\ta0[i] = 'x';\n\tb0[i] = search(s, a0[i])+1;\n\ti++;\n\ta0[i] = 'y';\n\tb0[i] = search(s, a0[i])+1;\n\ti++;\n\ta0[i] = 'z';\n\tb0[i] = search(s, a0[i])+1;\n\n\n\tx = 1;\n\n\tfor (i = 0;i < 26;i++) {\n\t\tx = x * b0[i];\n\t}\n\n\n\tx = x - 1;\n\tx = x % 1000000007;\n\tprintf(\"%d\", x);\n\n\treturn 0;\n}", "language": "C", "metadata": {"date": 1552769789, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "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/C/s346596504.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s346596504", "user_id": "u133959444"}, "prompt_components": {"gold_output": "15\n", "input_to_evaluate": "//temp\n#include<stdio.h>\n#include<stdlib.h>\n\nint search(char str[],char sear) {\n\tint i;\n\tint num = 0;\n\n\tfor (i = 0;i < 110000;i++) {\n\t\tif (str[i] == sear) {\n\t\t\tnum++;\n\t\t}\n\t}\n\treturn num;\n}\n\nint main() {\n\tint i, j, k, f = 0, n, t, m;\n\tint a, b, c, d, e;\n\tint x, y, z;\n\tchar s[110000];\n\tint b0[30];\n\tchar a0[30];\n\n\tscanf(\"%d\", &n);\n\tscanf(\"%s\", s);\n\n\ti = 0;\n\ta0[i] = 'a';\n\tb0[i] = search(s, a0[i])+1;\n\ti++;\n\ta0[i] = 'b';\n\tb0[i] = search(s, a0[i])+1;\n\ti++;\n\ta0[i] = 'c';\n\tb0[i] = search(s, a0[i])+1;\n\ti++;\n\ta0[i] = 'd';\n\tb0[i] = search(s, a0[i])+1;\n\ti++;\n\ta0[i] = 'e';\n\tb0[i] = search(s, a0[i])+1;\n\ti++;\n\ta0[i] = 'f';\n\tb0[i] = search(s, a0[i])+1;\n\ti++;\n\ta0[i] = 'g';\n\tb0[i] = search(s, a0[i])+1;\n\ti++;\n\ta0[i] = 'h';\n\tb0[i] = search(s, a0[i])+1;\n\ti++;\n\ta0[i] = 'i';\n\tb0[i] = search(s, a0[i])+1;\n\ti++;\n\ta0[i] = 'j';\n\tb0[i] = search(s, a0[i])+1;\n\ti++;\n\ta0[i] = 'k';\n\tb0[i] = search(s, a0[i])+1;\n\ti++;\n\ta0[i] = 'l';\n\tb0[i] = search(s, a0[i])+1;\n\ti++;\n\ta0[i] = 'm';\n\tb0[i] = search(s, a0[i])+1;\n\ti++;\n\ta0[i] = 'n';\n\tb0[i] = search(s, a0[i])+1;\n\ti++;\n\ta0[i] = 'o';\n\tb0[i] = search(s, a0[i])+1;\n\ti++;\n\ta0[i] = 'p';\n\tb0[i] = search(s, a0[i])+1;\n\ti++;\n\ta0[i] = 'q';\n\tb0[i] = search(s, a0[i])+1;\n\ti++;\n\ta0[i] = 'r';\n\tb0[i] = search(s, a0[i])+1;\n\ti++;\n\ta0[i] = 's';\n\tb0[i] = search(s, a0[i])+1;\n\ti++;\n\ta0[i] = 't';\n\tb0[i] = search(s, a0[i])+1;\n\ti++;\n\ta0[i] = 'u';\n\tb0[i] = search(s, a0[i])+1;\n\ti++;\n\ta0[i] = 'v';\n\tb0[i] = search(s, a0[i])+1;\n\ti++;\n\ta0[i] = 'w';\n\tb0[i] = search(s, a0[i])+1;\n\ti++;\n\ta0[i] = 'x';\n\tb0[i] = search(s, a0[i])+1;\n\ti++;\n\ta0[i] = 'y';\n\tb0[i] = search(s, a0[i])+1;\n\ti++;\n\ta0[i] = 'z';\n\tb0[i] = search(s, a0[i])+1;\n\n\n\tx = 1;\n\n\tfor (i = 0;i < 26;i++) {\n\t\tx = x * b0[i];\n\t}\n\n\n\tx = x - 1;\n\tx = x % 1000000007;\n\tprintf(\"%d\", x);\n\n\treturn 0;\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": 1747, "cpu_time_ms": 3, "memory_kb": 256}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s178708732", "group_id": "codeNet:p03101", "input_text": "#include <stdio.h>\n\nint main(void)\n{\n  int h_size, w_size;\n  int h, w;\n  int answer;\n  scanf(\"%d%d\", &h_size, &w_size);\n  scanf(\"%d%d\", &h, &w);\n\n  answer\n    = h_size * w_size\n    - h * w_size\n    - h_size * w\n    + h * w;\n\n  printf(\"%d\\n\", answer);\n  return 0;\n}\n", "language": "C", "metadata": {"date": 1554306111, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "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/C/s178708732.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s178708732", "user_id": "u300773907"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "#include <stdio.h>\n\nint main(void)\n{\n  int h_size, w_size;\n  int h, w;\n  int answer;\n  scanf(\"%d%d\", &h_size, &w_size);\n  scanf(\"%d%d\", &h, &w);\n\n  answer\n    = h_size * w_size\n    - h * w_size\n    - h_size * w\n    + h * w;\n\n  printf(\"%d\\n\", answer);\n  return 0;\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": 265, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s160713798", "group_id": "codeNet:p03101", "input_text": "#include <stdio.h>\n#include <stdlib.h>\n#include <string.h>\n#include <math.h>\nint compare_int(const void *a, const void *b)\n{\n    return *(int*)a - *(int*)b;\n//    return *(long long*)a - *(long long*)b;\n}\n//  qsort(A, b, sizeof(int), compare_int);\n\nint main()\n{\n \n  int a, b, c, d, e, X, Y;\n  //  double  c;\n  int  A[100001]={};\n  int  B[100001]={};\n//  int  B[100003]={};\n  int  L[1003]={};\n\n  int  flag[103]={};\n\n//  long long  a, b, c, d, X, Y;\nchar s[100001]={};\n  long long JPY;\n  double BTC;\nchar t[100001]={};\n//  int N, M;\n//  int A[1000000001]={};\n//  long long  C[101]={};\n  int i,j,k;\n//  int flag=0;\n  double tmp=0;\n//  int min=1000000;\n  long long min=100000001;\n  int len=0;\n  int cnt=0;\n  int cnt0=0;\n  int cnt1=0;\n  int num=0;\n//  double ans=0.0;\n  long long ans[100001]={};\n  int max=0;\n  int sum=0;\n//  char alp[26]={'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\n  //  a=0;\n//  scanf(\"%lld %lld\", &a, &b);\n  scanf(\"%d%d\", &a,&b);\n  scanf(\"%d%d\", &c,&d);\n  \n  \n  \n printf(\"%d\\n\", (a*b)-(c*a)-(d*b)+(c*d));\n\n\n  //    if(max < cnt - max)  printf(\"Yes\\n\");\n//    else  \n  \nreturn 0;\n}\n", "language": "C", "metadata": {"date": 1552161890, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "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/C/s160713798.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s160713798", "user_id": "u301843562"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "#include <stdio.h>\n#include <stdlib.h>\n#include <string.h>\n#include <math.h>\nint compare_int(const void *a, const void *b)\n{\n    return *(int*)a - *(int*)b;\n//    return *(long long*)a - *(long long*)b;\n}\n//  qsort(A, b, sizeof(int), compare_int);\n\nint main()\n{\n \n  int a, b, c, d, e, X, Y;\n  //  double  c;\n  int  A[100001]={};\n  int  B[100001]={};\n//  int  B[100003]={};\n  int  L[1003]={};\n\n  int  flag[103]={};\n\n//  long long  a, b, c, d, X, Y;\nchar s[100001]={};\n  long long JPY;\n  double BTC;\nchar t[100001]={};\n//  int N, M;\n//  int A[1000000001]={};\n//  long long  C[101]={};\n  int i,j,k;\n//  int flag=0;\n  double tmp=0;\n//  int min=1000000;\n  long long min=100000001;\n  int len=0;\n  int cnt=0;\n  int cnt0=0;\n  int cnt1=0;\n  int num=0;\n//  double ans=0.0;\n  long long ans[100001]={};\n  int max=0;\n  int sum=0;\n//  char alp[26]={'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\n  //  a=0;\n//  scanf(\"%lld %lld\", &a, &b);\n  scanf(\"%d%d\", &a,&b);\n  scanf(\"%d%d\", &c,&d);\n  \n  \n  \n printf(\"%d\\n\", (a*b)-(c*a)-(d*b)+(c*d));\n\n\n  //    if(max < cnt - max)  printf(\"Yes\\n\");\n//    else  \n  \nreturn 0;\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": 1160, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s943551817", "group_id": "codeNet:p03101", "input_text": "#include <stdio.h>\n\n#define DEBUG 1\n#define NINF -1\n#define PINF 1E9+1\n\nint main()\n{\n\tint a,b,c,d,i,ret;\n\tscanf(\"%d\",&a);\n\tscanf(\"%d\",&b);\n\tscanf(\"%d\",&c);\n\tscanf(\"%d\",&d);\n\n\tret = 0;\n\n\tfor (i=0;i<c;i++) {\n\t\tret += b;\n\t}\n\tfor (i=0;i<d;i++) {\n\t\tret += a-c;\n\t}\n\n\n\tprintf(\"%d\\n\",a*b-ret);\n\treturn 0;\n}\n", "language": "C", "metadata": {"date": 1552161790, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "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/C/s943551817.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s943551817", "user_id": "u280385457"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "#include <stdio.h>\n\n#define DEBUG 1\n#define NINF -1\n#define PINF 1E9+1\n\nint main()\n{\n\tint a,b,c,d,i,ret;\n\tscanf(\"%d\",&a);\n\tscanf(\"%d\",&b);\n\tscanf(\"%d\",&c);\n\tscanf(\"%d\",&d);\n\n\tret = 0;\n\n\tfor (i=0;i<c;i++) {\n\t\tret += b;\n\t}\n\tfor (i=0;i<d;i++) {\n\t\tret += a-c;\n\t}\n\n\n\tprintf(\"%d\\n\",a*b-ret);\n\treturn 0;\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": 299, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s726279120", "group_id": "codeNet:p03103", "input_text": "#include<stdio.h>\n#include<stdlib.h>\ntypedef struct{\n  long long int value;\n  int cost;\n} box;\nint cmp( const void *p, const void *q ) {\n    return ((box*)p)->cost - ((box*)q)->cost;\n}\n\nint main(void) {\n  int a,b;\n  long long wallet=0;\n  scanf(\"%d %d\",&a,&b);\n  box store[a];\n  for(int i=0;i<a;i++){\n    scanf(\"%d %d\",&(store[i].cost),&(store[i].value));\n}\n  qsort(store,a,sizeof(box),cmp);\n \n  int num=0,want=0;\n  while(b-want>0){\n      if(store[num].value>0){\n\twallet+=store[num].cost;\n\tstore[num].value--;\n\twant++;}\n      else num++;\n      \n}\n  printf(\"%d\",wallet);\n  return 0;\n}", "language": "C", "metadata": {"date": 1552166252, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "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/C/s726279120.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s726279120", "user_id": "u535659144"}, "prompt_components": {"gold_output": "12\n", "input_to_evaluate": "#include<stdio.h>\n#include<stdlib.h>\ntypedef struct{\n  long long int value;\n  int cost;\n} box;\nint cmp( const void *p, const void *q ) {\n    return ((box*)p)->cost - ((box*)q)->cost;\n}\n\nint main(void) {\n  int a,b;\n  long long wallet=0;\n  scanf(\"%d %d\",&a,&b);\n  box store[a];\n  for(int i=0;i<a;i++){\n    scanf(\"%d %d\",&(store[i].cost),&(store[i].value));\n}\n  qsort(store,a,sizeof(box),cmp);\n \n  int num=0,want=0;\n  while(b-want>0){\n      if(store[num].value>0){\n\twallet+=store[num].cost;\n\tstore[num].value--;\n\twant++;}\n      else num++;\n      \n}\n  printf(\"%d\",wallet);\n  return 0;\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": 582, "cpu_time_ms": 37, "memory_kb": 3324}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s593855842", "group_id": "codeNet:p03106", "input_text": "#include <stdio.h>\nint func(int a,int b,int c){\n  int min = a>b?b:a;\n  int array[99];\n  int count = 0;\n  for(int i = 1 ; i < min ; i ++){\n    if ((a % i == 0) && (b % i == 0)){\n      array[count] = i;\n      count ++;\n    }\n  }\n  return array[count - c];\n\n}\nint main(){\n    int a,b,c;\n    scanf(\"%d%d%d\",&a,&b,&c);\n    printf(\"%d\\n\",func(a,b,c));\n    return 0;\n}\n", "language": "C", "metadata": {"date": 1551646509, "filename_ext": "c", "original_language": "C (Clang 3.8.0)", "problem_description_relpath": "problem_descriptions/p03106.html", "problem_id": "p03106", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03106/input.txt", "sample_output_relpath": "derived/input_output/data/p03106/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03106/C/s593855842.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s593855842", "user_id": "u849486571"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "#include <stdio.h>\nint func(int a,int b,int c){\n  int min = a>b?b:a;\n  int array[99];\n  int count = 0;\n  for(int i = 1 ; i < min ; i ++){\n    if ((a % i == 0) && (b % i == 0)){\n      array[count] = i;\n      count ++;\n    }\n  }\n  return array[count - c];\n\n}\nint main(){\n    int a,b,c;\n    scanf(\"%d%d%d\",&a,&b,&c);\n    printf(\"%d\\n\",func(a,b,c));\n    return 0;\n}\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nYou are given positive integers A and B.\n\nFind the K-th largest positive integer that divides both A and B.\n\nThe input guarantees that there exists such a number.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A, B \\leq 100\n\nThe K-th largest positive integer that divides both A and B exists.\n\nK \\geq 1\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B K\n\nOutput\n\nPrint the K-th largest positive integer that divides both A and B.\n\nSample Input 1\n\n8 12 2\n\nSample Output 1\n\n2\n\nThree positive integers divides both 8 and 12: 1, 2 and 4.\nAmong them, the second largest is 2.\n\nSample Input 2\n\n100 50 4\n\nSample Output 2\n\n5\n\nSample Input 3\n\n1 1 1\n\nSample Output 3\n\n1", "sample_input": "8 12 2\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03106", "source_text": "Score : 200 points\n\nProblem Statement\n\nYou are given positive integers A and B.\n\nFind the K-th largest positive integer that divides both A and B.\n\nThe input guarantees that there exists such a number.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A, B \\leq 100\n\nThe K-th largest positive integer that divides both A and B exists.\n\nK \\geq 1\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B K\n\nOutput\n\nPrint the K-th largest positive integer that divides both A and B.\n\nSample Input 1\n\n8 12 2\n\nSample Output 1\n\n2\n\nThree positive integers divides both 8 and 12: 1, 2 and 4.\nAmong them, the second largest is 2.\n\nSample Input 2\n\n100 50 4\n\nSample Output 2\n\n5\n\nSample Input 3\n\n1 1 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": 362, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s602234469", "group_id": "codeNet:p03106", "input_text": "#include <stdio.h>\n\nint main(void)\n{\n\tint a,b,k,i;\n\tscanf(\"%d %d %d\",&a,&b,&k);\n\tint ans[101],j=0;\n\tfor(i=1;i<=100;i++){\n\t\tif((a%i==0) && (b%i==0)){\n\t\t\t//printf(\"%d\\n\",i);\n\t\t\tans[j]=i;\n\t\t\tj++;\n\t\t}\n\t}\n\tprintf(\"%d\\n\",ans[j-k]);\n\treturn 0;\n}\n", "language": "C", "metadata": {"date": 1551645690, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "problem_description_relpath": "problem_descriptions/p03106.html", "problem_id": "p03106", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03106/input.txt", "sample_output_relpath": "derived/input_output/data/p03106/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03106/C/s602234469.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s602234469", "user_id": "u573564324"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "#include <stdio.h>\n\nint main(void)\n{\n\tint a,b,k,i;\n\tscanf(\"%d %d %d\",&a,&b,&k);\n\tint ans[101],j=0;\n\tfor(i=1;i<=100;i++){\n\t\tif((a%i==0) && (b%i==0)){\n\t\t\t//printf(\"%d\\n\",i);\n\t\t\tans[j]=i;\n\t\t\tj++;\n\t\t}\n\t}\n\tprintf(\"%d\\n\",ans[j-k]);\n\treturn 0;\n}\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nYou are given positive integers A and B.\n\nFind the K-th largest positive integer that divides both A and B.\n\nThe input guarantees that there exists such a number.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A, B \\leq 100\n\nThe K-th largest positive integer that divides both A and B exists.\n\nK \\geq 1\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B K\n\nOutput\n\nPrint the K-th largest positive integer that divides both A and B.\n\nSample Input 1\n\n8 12 2\n\nSample Output 1\n\n2\n\nThree positive integers divides both 8 and 12: 1, 2 and 4.\nAmong them, the second largest is 2.\n\nSample Input 2\n\n100 50 4\n\nSample Output 2\n\n5\n\nSample Input 3\n\n1 1 1\n\nSample Output 3\n\n1", "sample_input": "8 12 2\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03106", "source_text": "Score : 200 points\n\nProblem Statement\n\nYou are given positive integers A and B.\n\nFind the K-th largest positive integer that divides both A and B.\n\nThe input guarantees that there exists such a number.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A, B \\leq 100\n\nThe K-th largest positive integer that divides both A and B exists.\n\nK \\geq 1\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B K\n\nOutput\n\nPrint the K-th largest positive integer that divides both A and B.\n\nSample Input 1\n\n8 12 2\n\nSample Output 1\n\n2\n\nThree positive integers divides both 8 and 12: 1, 2 and 4.\nAmong them, the second largest is 2.\n\nSample Input 2\n\n100 50 4\n\nSample Output 2\n\n5\n\nSample Input 3\n\n1 1 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": 239, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s177100592", "group_id": "codeNet:p03106", "input_text": "#include <stdio.h>\n\nint N(int A, int B, int K){\n  int n, c;\n  c = 0;\n  for(n = 100;n > 0;n--){\n    if(A % n + B % n == 0) c++;\n    if(c == K) break;\n  }\n  return n;\n}\n\nint main(void){\n  int A, B, K;\n  scanf(\"%d %d %d\", &A, &B, &K);\n  printf(\"%d\\n\", N(A, B, K));\n  return 0;\n}\n", "language": "C", "metadata": {"date": 1551644431, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "problem_description_relpath": "problem_descriptions/p03106.html", "problem_id": "p03106", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03106/input.txt", "sample_output_relpath": "derived/input_output/data/p03106/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03106/C/s177100592.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s177100592", "user_id": "u194243606"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "#include <stdio.h>\n\nint N(int A, int B, int K){\n  int n, c;\n  c = 0;\n  for(n = 100;n > 0;n--){\n    if(A % n + B % n == 0) c++;\n    if(c == K) break;\n  }\n  return n;\n}\n\nint main(void){\n  int A, B, K;\n  scanf(\"%d %d %d\", &A, &B, &K);\n  printf(\"%d\\n\", N(A, B, K));\n  return 0;\n}\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nYou are given positive integers A and B.\n\nFind the K-th largest positive integer that divides both A and B.\n\nThe input guarantees that there exists such a number.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A, B \\leq 100\n\nThe K-th largest positive integer that divides both A and B exists.\n\nK \\geq 1\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B K\n\nOutput\n\nPrint the K-th largest positive integer that divides both A and B.\n\nSample Input 1\n\n8 12 2\n\nSample Output 1\n\n2\n\nThree positive integers divides both 8 and 12: 1, 2 and 4.\nAmong them, the second largest is 2.\n\nSample Input 2\n\n100 50 4\n\nSample Output 2\n\n5\n\nSample Input 3\n\n1 1 1\n\nSample Output 3\n\n1", "sample_input": "8 12 2\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03106", "source_text": "Score : 200 points\n\nProblem Statement\n\nYou are given positive integers A and B.\n\nFind the K-th largest positive integer that divides both A and B.\n\nThe input guarantees that there exists such a number.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A, B \\leq 100\n\nThe K-th largest positive integer that divides both A and B exists.\n\nK \\geq 1\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B K\n\nOutput\n\nPrint the K-th largest positive integer that divides both A and B.\n\nSample Input 1\n\n8 12 2\n\nSample Output 1\n\n2\n\nThree positive integers divides both 8 and 12: 1, 2 and 4.\nAmong them, the second largest is 2.\n\nSample Input 2\n\n100 50 4\n\nSample Output 2\n\n5\n\nSample Input 3\n\n1 1 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": 276, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s817953911", "group_id": "codeNet:p03107", "input_text": "#include <stdio.h>\n#include <string.h>\n#include <stdlib.h>\n#include <math.h>\n#include <stdbool.h>\n#define LL long long\n#define INF 1<<31-1\n#define MIN(x,y) ((x)<(y)?(x):(y))\n#define MAX(x,y) ((x)<(y)?(y):(x))\n#define FOR(i,a,n) for(i=a;i<n;i++)\n#define MOD 1000000007\n#define NUM 100001\n\nvoid swap(int* a,int* b){int tmp=*a;*a=*b;*b=tmp;}\nint GCD(int a,int b){int c=1,tmp=MAX(a,b);b=MIN(a,b);a=tmp;while(c!=0){c=a%b;a=b;b=c;}return a;}\nint LCM(int a,int b){return a*b/GCD(a,b);}\nint POW(LL a,LL n){LL ans=1;while(n>0){if(n&1)ans=ans*a%MOD;a=a*a%MOD;n>>=1;}return (int)ans;}\nint icmp(const void* a,const void* b){return *(int*)a-*(int*)b;}\nint ccmp(const void* a,const void* b){return *(char*)a-*(char*)b;}\nint scmp(const void* a,const void* b){return strcmp(*(char**)a,*(char**)b);}\nLL fac[NUM],finv[NUM],inv[NUM];\nvoid comi(){int i;fac[0]=fac[1]=1;finv[0]=finv[1]=1;inv[1]=1;FOR(i,2,NUM){fac[i]=fac[i-1]*i%MOD;inv[i]=MOD-inv[MOD%i]*(MOD/i)%MOD;finv[i]=finv[i-1]*inv[i]%MOD;}}\nint com(int n,int k){if(n<k||n<0||k<0)return 0;return fac[n]*(finv[k]*finv[n-k]%MOD)%MOD;}\n\ntypedef struct{int s,e,c;}Edge;\nint par[NUM];\nint UF(){for(int i=0;i<NUM;i++)par[i]=-1;}\nint Root(int x){if(par[x]<0)return x;else return par[x]=Root(par[x]);}\nint Size(int x){return -par[Root(x)];}\nbool Same(int x,int y){return Root(x)==Root(y);}\nvoid Unite(int x,int y){x=Root(x);y=Root(y);if(x!=y){if(Size(x)<Size(y))swap(&x,&y);par[x]+=par[y];par[y]=x;}}\nint cmpc(const void* a,const void* b){return ((Edge*)a)->c-((Edge*)b)->c;}\nint Kruscal(Edge* edge,int n){int i,ans=0;Edge e;qsort(edge,n,sizeof(Edge),cmpc);UF();FOR(i,0,n){e=edge[i];if(!Same(e.s,e.e)){Unite(e.s,e.e);ans+=e.c;}}return ans;}\n\n\nint main(){\n  int i,a=0,b=0,s,ans=0;\n\tchar S[NUM];\n  scanf(\"%s\",S);\n\ts=strlen(S);\n\tFOR(i,0,s){\n\t\tif(S[i]=='0')a++;\n\t\telse b++;\n\t}\n\n  printf(\"%d\\n\",MIN(a,b)*2);\n\treturn 0;\n}\n", "language": "C", "metadata": {"date": 1571937853, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "problem_description_relpath": "problem_descriptions/p03107.html", "problem_id": "p03107", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03107/input.txt", "sample_output_relpath": "derived/input_output/data/p03107/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03107/C/s817953911.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s817953911", "user_id": "u596117821"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "#include <stdio.h>\n#include <string.h>\n#include <stdlib.h>\n#include <math.h>\n#include <stdbool.h>\n#define LL long long\n#define INF 1<<31-1\n#define MIN(x,y) ((x)<(y)?(x):(y))\n#define MAX(x,y) ((x)<(y)?(y):(x))\n#define FOR(i,a,n) for(i=a;i<n;i++)\n#define MOD 1000000007\n#define NUM 100001\n\nvoid swap(int* a,int* b){int tmp=*a;*a=*b;*b=tmp;}\nint GCD(int a,int b){int c=1,tmp=MAX(a,b);b=MIN(a,b);a=tmp;while(c!=0){c=a%b;a=b;b=c;}return a;}\nint LCM(int a,int b){return a*b/GCD(a,b);}\nint POW(LL a,LL n){LL ans=1;while(n>0){if(n&1)ans=ans*a%MOD;a=a*a%MOD;n>>=1;}return (int)ans;}\nint icmp(const void* a,const void* b){return *(int*)a-*(int*)b;}\nint ccmp(const void* a,const void* b){return *(char*)a-*(char*)b;}\nint scmp(const void* a,const void* b){return strcmp(*(char**)a,*(char**)b);}\nLL fac[NUM],finv[NUM],inv[NUM];\nvoid comi(){int i;fac[0]=fac[1]=1;finv[0]=finv[1]=1;inv[1]=1;FOR(i,2,NUM){fac[i]=fac[i-1]*i%MOD;inv[i]=MOD-inv[MOD%i]*(MOD/i)%MOD;finv[i]=finv[i-1]*inv[i]%MOD;}}\nint com(int n,int k){if(n<k||n<0||k<0)return 0;return fac[n]*(finv[k]*finv[n-k]%MOD)%MOD;}\n\ntypedef struct{int s,e,c;}Edge;\nint par[NUM];\nint UF(){for(int i=0;i<NUM;i++)par[i]=-1;}\nint Root(int x){if(par[x]<0)return x;else return par[x]=Root(par[x]);}\nint Size(int x){return -par[Root(x)];}\nbool Same(int x,int y){return Root(x)==Root(y);}\nvoid Unite(int x,int y){x=Root(x);y=Root(y);if(x!=y){if(Size(x)<Size(y))swap(&x,&y);par[x]+=par[y];par[y]=x;}}\nint cmpc(const void* a,const void* b){return ((Edge*)a)->c-((Edge*)b)->c;}\nint Kruscal(Edge* edge,int n){int i,ans=0;Edge e;qsort(edge,n,sizeof(Edge),cmpc);UF();FOR(i,0,n){e=edge[i];if(!Same(e.s,e.e)){Unite(e.s,e.e);ans+=e.c;}}return ans;}\n\n\nint main(){\n  int i,a=0,b=0,s,ans=0;\n\tchar S[NUM];\n  scanf(\"%s\",S);\n\ts=strlen(S);\n\tFOR(i,0,s){\n\t\tif(S[i]=='0')a++;\n\t\telse b++;\n\t}\n\n  printf(\"%d\\n\",MIN(a,b)*2);\n\treturn 0;\n}\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere are N cubes stacked vertically on a desk.\n\nYou are given a string S of length N. The color of the i-th cube from the bottom is red if the i-th character in S is 0, and blue if that character is 1.\n\nYou can perform the following operation any number of times: choose a red cube and a blue cube that are adjacent, and remove them. Here, the cubes that were stacked on the removed cubes will fall down onto the object below them.\n\nAt most how many cubes can be removed?\n\nConstraints\n\n1 \\leq N \\leq 10^5\n\n|S| = N\n\nEach character in S is 0 or 1.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the maximum number of cubes that can be removed.\n\nSample Input 1\n\n0011\n\nSample Output 1\n\n4\n\nAll four cubes can be removed, by performing the operation as follows:\n\nRemove the second and third cubes from the bottom. Then, the fourth cube drops onto the first cube.\n\nRemove the first and second cubes from the bottom.\n\nSample Input 2\n\n11011010001011\n\nSample Output 2\n\n12\n\nSample Input 3\n\n0\n\nSample Output 3\n\n0", "sample_input": "0011\n"}, "reference_outputs": ["4\n"], "source_document_id": "p03107", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere are N cubes stacked vertically on a desk.\n\nYou are given a string S of length N. The color of the i-th cube from the bottom is red if the i-th character in S is 0, and blue if that character is 1.\n\nYou can perform the following operation any number of times: choose a red cube and a blue cube that are adjacent, and remove them. Here, the cubes that were stacked on the removed cubes will fall down onto the object below them.\n\nAt most how many cubes can be removed?\n\nConstraints\n\n1 \\leq N \\leq 10^5\n\n|S| = N\n\nEach character in S is 0 or 1.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the maximum number of cubes that can be removed.\n\nSample Input 1\n\n0011\n\nSample Output 1\n\n4\n\nAll four cubes can be removed, by performing the operation as follows:\n\nRemove the second and third cubes from the bottom. Then, the fourth cube drops onto the first cube.\n\nRemove the first and second cubes from the bottom.\n\nSample Input 2\n\n11011010001011\n\nSample Output 2\n\n12\n\nSample Input 3\n\n0\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": 1843, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s275953474", "group_id": "codeNet:p03107", "input_text": "#include<stdio.h>\n\nint main(void)\n{\n        char s[99999];\n        int i, a, b;\n\n        scanf(\"%s\", s);\n\n        for(i=0; s[i]!='\\0'; i++){\n                if(s[i]=='0') a++;\n                else if(s[i]=='1') b++;\n        }\n        if(a<b) printf(\"%d\\n\", a*2);\n        else printf(\"%d\\n\", b*2);\n\n        return 0;\n}\n", "language": "C", "metadata": {"date": 1555422267, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "problem_description_relpath": "problem_descriptions/p03107.html", "problem_id": "p03107", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03107/input.txt", "sample_output_relpath": "derived/input_output/data/p03107/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03107/C/s275953474.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s275953474", "user_id": "u438782979"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "#include<stdio.h>\n\nint main(void)\n{\n        char s[99999];\n        int i, a, b;\n\n        scanf(\"%s\", s);\n\n        for(i=0; s[i]!='\\0'; i++){\n                if(s[i]=='0') a++;\n                else if(s[i]=='1') b++;\n        }\n        if(a<b) printf(\"%d\\n\", a*2);\n        else printf(\"%d\\n\", b*2);\n\n        return 0;\n}\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere are N cubes stacked vertically on a desk.\n\nYou are given a string S of length N. The color of the i-th cube from the bottom is red if the i-th character in S is 0, and blue if that character is 1.\n\nYou can perform the following operation any number of times: choose a red cube and a blue cube that are adjacent, and remove them. Here, the cubes that were stacked on the removed cubes will fall down onto the object below them.\n\nAt most how many cubes can be removed?\n\nConstraints\n\n1 \\leq N \\leq 10^5\n\n|S| = N\n\nEach character in S is 0 or 1.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the maximum number of cubes that can be removed.\n\nSample Input 1\n\n0011\n\nSample Output 1\n\n4\n\nAll four cubes can be removed, by performing the operation as follows:\n\nRemove the second and third cubes from the bottom. Then, the fourth cube drops onto the first cube.\n\nRemove the first and second cubes from the bottom.\n\nSample Input 2\n\n11011010001011\n\nSample Output 2\n\n12\n\nSample Input 3\n\n0\n\nSample Output 3\n\n0", "sample_input": "0011\n"}, "reference_outputs": ["4\n"], "source_document_id": "p03107", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere are N cubes stacked vertically on a desk.\n\nYou are given a string S of length N. The color of the i-th cube from the bottom is red if the i-th character in S is 0, and blue if that character is 1.\n\nYou can perform the following operation any number of times: choose a red cube and a blue cube that are adjacent, and remove them. Here, the cubes that were stacked on the removed cubes will fall down onto the object below them.\n\nAt most how many cubes can be removed?\n\nConstraints\n\n1 \\leq N \\leq 10^5\n\n|S| = N\n\nEach character in S is 0 or 1.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the maximum number of cubes that can be removed.\n\nSample Input 1\n\n0011\n\nSample Output 1\n\n4\n\nAll four cubes can be removed, by performing the operation as follows:\n\nRemove the second and third cubes from the bottom. Then, the fourth cube drops onto the first cube.\n\nRemove the first and second cubes from the bottom.\n\nSample Input 2\n\n11011010001011\n\nSample Output 2\n\n12\n\nSample Input 3\n\n0\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": 318, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s717862751", "group_id": "codeNet:p03107", "input_text": "#include<stdio.h>\n#include<string.h>\n\nint main(){\n\t\n  int i, count0=0, count1;\n  char S[100000];\n  \n  if(scanf(\"%s\", S)==0) return -1;\n  \n  count1=strlen(S);\n  \n  for(i=0;S[i]!='\\0';i++){\n  \tif(S[i]=='0') count0++;\n  }\n\n  count1-=count0;\n  \n  if(count1>=count0) printf(\"%d\", count0*2);\n  else printf(\"%d\", count1*2);\n  \n  return 0;\n}\n", "language": "C", "metadata": {"date": 1554553699, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "problem_description_relpath": "problem_descriptions/p03107.html", "problem_id": "p03107", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03107/input.txt", "sample_output_relpath": "derived/input_output/data/p03107/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03107/C/s717862751.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s717862751", "user_id": "u737756998"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "#include<stdio.h>\n#include<string.h>\n\nint main(){\n\t\n  int i, count0=0, count1;\n  char S[100000];\n  \n  if(scanf(\"%s\", S)==0) return -1;\n  \n  count1=strlen(S);\n  \n  for(i=0;S[i]!='\\0';i++){\n  \tif(S[i]=='0') count0++;\n  }\n\n  count1-=count0;\n  \n  if(count1>=count0) printf(\"%d\", count0*2);\n  else printf(\"%d\", count1*2);\n  \n  return 0;\n}\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere are N cubes stacked vertically on a desk.\n\nYou are given a string S of length N. The color of the i-th cube from the bottom is red if the i-th character in S is 0, and blue if that character is 1.\n\nYou can perform the following operation any number of times: choose a red cube and a blue cube that are adjacent, and remove them. Here, the cubes that were stacked on the removed cubes will fall down onto the object below them.\n\nAt most how many cubes can be removed?\n\nConstraints\n\n1 \\leq N \\leq 10^5\n\n|S| = N\n\nEach character in S is 0 or 1.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the maximum number of cubes that can be removed.\n\nSample Input 1\n\n0011\n\nSample Output 1\n\n4\n\nAll four cubes can be removed, by performing the operation as follows:\n\nRemove the second and third cubes from the bottom. Then, the fourth cube drops onto the first cube.\n\nRemove the first and second cubes from the bottom.\n\nSample Input 2\n\n11011010001011\n\nSample Output 2\n\n12\n\nSample Input 3\n\n0\n\nSample Output 3\n\n0", "sample_input": "0011\n"}, "reference_outputs": ["4\n"], "source_document_id": "p03107", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere are N cubes stacked vertically on a desk.\n\nYou are given a string S of length N. The color of the i-th cube from the bottom is red if the i-th character in S is 0, and blue if that character is 1.\n\nYou can perform the following operation any number of times: choose a red cube and a blue cube that are adjacent, and remove them. Here, the cubes that were stacked on the removed cubes will fall down onto the object below them.\n\nAt most how many cubes can be removed?\n\nConstraints\n\n1 \\leq N \\leq 10^5\n\n|S| = N\n\nEach character in S is 0 or 1.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the maximum number of cubes that can be removed.\n\nSample Input 1\n\n0011\n\nSample Output 1\n\n4\n\nAll four cubes can be removed, by performing the operation as follows:\n\nRemove the second and third cubes from the bottom. Then, the fourth cube drops onto the first cube.\n\nRemove the first and second cubes from the bottom.\n\nSample Input 2\n\n11011010001011\n\nSample Output 2\n\n12\n\nSample Input 3\n\n0\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": 334, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s663750598", "group_id": "codeNet:p03109", "input_text": "#include <stdio.h>\n\nint main(void)\n{\n  int y, m, d;\n  char a,b;\n  scanf(\"%d%c%d%c%d\", &y, &a, &m, &b, &d);\n  printf(\"%d%c%d%c%d\",y,a,m,b,d);\n  if (m <= 4){\n    printf(\"Heisei\\n\");\n  }\n  else{\n    printf(\"TBD\\n\");\n  }\n  return 0;\n}", "language": "C", "metadata": {"date": 1558775514, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "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/C/s663750598.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s663750598", "user_id": "u089592731"}, "prompt_components": {"gold_output": "Heisei\n", "input_to_evaluate": "#include <stdio.h>\n\nint main(void)\n{\n  int y, m, d;\n  char a,b;\n  scanf(\"%d%c%d%c%d\", &y, &a, &m, &b, &d);\n  printf(\"%d%c%d%c%d\",y,a,m,b,d);\n  if (m <= 4){\n    printf(\"Heisei\\n\");\n  }\n  else{\n    printf(\"TBD\\n\");\n  }\n  return 0;\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": 230, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s756429588", "group_id": "codeNet:p03109", "input_text": "#include<stdio.h>\n\nint main(){\n  int year,mon,day,lastd,scan;\n  int days[] = { 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31 };\n\n  //入力取得\n  scan = scanf(\"%d/%d/%d\",&year,&mon,&day);\n\n  lastd = days[mon-1];\n  //うるう年\n  if(mon == 2){\n    if( year % 4 == 0 && year % 100 != 0 || year % 400 == 0 ) lastd = 29;\n  }\n\n  if(0 < day && day < lastd){\n    //月が１～4か\n    if(mon<5){\n      //2019年までであれば'Heisei'\n      if(year < 2020){\n        printf(\"Heisei\\n\");\n      }\n      //月が5以上12以下で2018年までであれば'Heisei'\n    }else if(mon < 13 && year < 2019){\n      printf(\"Heisei\\n\");\n    }else{\n      //条件に当てはまらなければ'TBD'\n      printf(\"TBD\\n\");\n    }\n  }else{\n    printf(\"入力された日付が存在しません。\\n\");\n  }\n  return 0;\n}\n", "language": "C", "metadata": {"date": 1551042967, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "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/C/s756429588.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s756429588", "user_id": "u701638736"}, "prompt_components": {"gold_output": "Heisei\n", "input_to_evaluate": "#include<stdio.h>\n\nint main(){\n  int year,mon,day,lastd,scan;\n  int days[] = { 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31 };\n\n  //入力取得\n  scan = scanf(\"%d/%d/%d\",&year,&mon,&day);\n\n  lastd = days[mon-1];\n  //うるう年\n  if(mon == 2){\n    if( year % 4 == 0 && year % 100 != 0 || year % 400 == 0 ) lastd = 29;\n  }\n\n  if(0 < day && day < lastd){\n    //月が１～4か\n    if(mon<5){\n      //2019年までであれば'Heisei'\n      if(year < 2020){\n        printf(\"Heisei\\n\");\n      }\n      //月が5以上12以下で2018年までであれば'Heisei'\n    }else if(mon < 13 && year < 2019){\n      printf(\"Heisei\\n\");\n    }else{\n      //条件に当てはまらなければ'TBD'\n      printf(\"TBD\\n\");\n    }\n  }else{\n    printf(\"入力された日付が存在しません。\\n\");\n  }\n  return 0;\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": 807, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s403055980", "group_id": "codeNet:p03110", "input_text": "#include <stdio.h>\n\nint main(){\n  int n,sum = 0;\n  char a[40] = \"JPY\";\n  scanf(\"%d\",&n);\n  for (int i = 0; i < n; i++) {\n    float x;\n    char u[100];\n    scanf(\"%f %s\",&x,u);\n    if (u[0] == a[0]) {\n      sum += x;\n    }else{\n      sum += x * 380000.0;\n    }\n  }\n  printf(\"%d\\n\",sum);\n}\n", "language": "C", "metadata": {"date": 1553097991, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "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/C/s403055980.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s403055980", "user_id": "u623231048"}, "prompt_components": {"gold_output": "48000.0\n", "input_to_evaluate": "#include <stdio.h>\n\nint main(){\n  int n,sum = 0;\n  char a[40] = \"JPY\";\n  scanf(\"%d\",&n);\n  for (int i = 0; i < n; i++) {\n    float x;\n    char u[100];\n    scanf(\"%f %s\",&x,u);\n    if (u[0] == a[0]) {\n      sum += x;\n    }else{\n      sum += x * 380000.0;\n    }\n  }\n  printf(\"%d\\n\",sum);\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": 288, "cpu_time_ms": 2, "memory_kb": 384}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s549055197", "group_id": "codeNet:p03110", "input_text": "#include <stdio.h>\n#include <string.h>\n#include <stdlib.h>\n\nint main (void){\n    int N;\n    char str[256];\n    double x,sum;\n    sum = 0.0;\n    scanf(\"%d\",&N);\n    for(int i=0; i<N; i++){\n        scanf(\"%lf\",&x);\n        scanf(\"%s\", str);\n        if(!strcmp(str,\"JPY\")){\n            sum += x;\n        }\n        if(!strcmp(str,\"BTC\")){\n            sum += 380000.0*x;\n        }\n    }\n    printf(\"%lf\\n\",sum);\n    return 0;\n}\n", "language": "C", "metadata": {"date": 1551042157, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "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/C/s549055197.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s549055197", "user_id": "u967841198"}, "prompt_components": {"gold_output": "48000.0\n", "input_to_evaluate": "#include <stdio.h>\n#include <string.h>\n#include <stdlib.h>\n\nint main (void){\n    int N;\n    char str[256];\n    double x,sum;\n    sum = 0.0;\n    scanf(\"%d\",&N);\n    for(int i=0; i<N; i++){\n        scanf(\"%lf\",&x);\n        scanf(\"%s\", str);\n        if(!strcmp(str,\"JPY\")){\n            sum += x;\n        }\n        if(!strcmp(str,\"BTC\")){\n            sum += 380000.0*x;\n        }\n    }\n    printf(\"%lf\\n\",sum);\n    return 0;\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": 423, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s730304412", "group_id": "codeNet:p03125", "input_text": "#include<stdio.h>\n \nint  main(void){\n  int A, B;\n  int ans;\n  scanf(\"%d %d\", &A, &B);\n  if(B % A)ans = A + B;\n  else ans = B - A;\n  printf(\"%d\\n\", ans);\n  return 0;\n}", "language": "C", "metadata": {"date": 1551204925, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "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/C/s730304412.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s730304412", "user_id": "u382251756"}, "prompt_components": {"gold_output": "16\n", "input_to_evaluate": "#include<stdio.h>\n \nint  main(void){\n  int A, B;\n  int ans;\n  scanf(\"%d %d\", &A, &B);\n  if(B % A)ans = A + B;\n  else ans = B - A;\n  printf(\"%d\\n\", ans);\n  return 0;\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": 166, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s949198293", "group_id": "codeNet:p03125", "input_text": "#include<stdio.h>\nint main(void)\n{\n\tunsigned int A,B;\n\n\tscanf(\"%d %d\", &A, &B );\n\t\n\tif(B%A == 0) printf(\"%d\\n\",A+B);\n\telse printf(\"%d\\n\",B-A);\n\n\treturn(0);\n}", "language": "C", "metadata": {"date": 1550372492, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "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/C/s949198293.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s949198293", "user_id": "u397213737"}, "prompt_components": {"gold_output": "16\n", "input_to_evaluate": "#include<stdio.h>\nint main(void)\n{\n\tunsigned int A,B;\n\n\tscanf(\"%d %d\", &A, &B );\n\t\n\tif(B%A == 0) printf(\"%d\\n\",A+B);\n\telse printf(\"%d\\n\",B-A);\n\n\treturn(0);\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": 157, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s071643163", "group_id": "codeNet:p03126", "input_text": "#include<stdio.h>\nint main(){\n  int n,m;\n  scanf(\"%d\",&n);\n  scanf(\"%d\",&m);\n  int q;\n  int a[m],count[m];\n  for(int i=0;i<m;i++){\n    count[i]=0;\n  }\n  for(int i=0;i<n;i++){\n    q=0;\n    scanf(\"%d\",&q);\n    for(int j=0;j<q;j++){\n      scanf(\"%d\",&a[j]);\n      for(int k=0;k<m;k++){\n        if(a[j]==k+1){\n          count[k]++;\n        }\n      }\n    }\n  }\n  int ans;\n  ans=0;\n  for(int i=0;i<m;i++){\n    if(count[i]==n)\n      ans++;\n  }\n  printf(\"%d\",ans);\n}\n          \n", "language": "C", "metadata": {"date": 1550373134, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "problem_description_relpath": "problem_descriptions/p03126.html", "problem_id": "p03126", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03126/input.txt", "sample_output_relpath": "derived/input_output/data/p03126/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03126/C/s071643163.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s071643163", "user_id": "u567480139"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "#include<stdio.h>\nint main(){\n  int n,m;\n  scanf(\"%d\",&n);\n  scanf(\"%d\",&m);\n  int q;\n  int a[m],count[m];\n  for(int i=0;i<m;i++){\n    count[i]=0;\n  }\n  for(int i=0;i<n;i++){\n    q=0;\n    scanf(\"%d\",&q);\n    for(int j=0;j<q;j++){\n      scanf(\"%d\",&a[j]);\n      for(int k=0;k<m;k++){\n        if(a[j]==k+1){\n          count[k]++;\n        }\n      }\n    }\n  }\n  int ans;\n  ans=0;\n  for(int i=0;i<m;i++){\n    if(count[i]==n)\n      ans++;\n  }\n  printf(\"%d\",ans);\n}\n          \n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nKatsusando loves omelette rice.\n\nBesides, he loves crème brûlée, tenderloin steak and so on, and believes that these foods are all loved by everyone.\n\nTo prove that hypothesis, he conducted a survey on M kinds of foods and asked N people whether they like these foods or not.\n\nThe i-th person answered that he/she only likes the A_{i1}-th, A_{i2}-th, ..., A_{iK_i}-th food.\n\nFind the number of the foods liked by all the N people.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N, M \\leq 30\n\n1 \\leq K_i \\leq M\n\n1 \\leq A_{ij} \\leq M\n\nFor each i (1 \\leq i \\leq N), A_{i1}, A_{i2}, ..., A_{iK_i} are distinct.\n\nConstraints\n\nInput is given from Standard Input in the following format:\n\nN M\nK_1 A_{11} A_{12} ... A_{1K_1}\nK_2 A_{21} A_{22} ... A_{2K_2}\n:\nK_N A_{N1} A_{N2} ... A_{NK_N}\n\nOutput\n\nPrint the number of the foods liked by all the N people.\n\nSample Input 1\n\n3 4\n2 1 3\n3 1 2 3\n2 3 2\n\nSample Output 1\n\n1\n\nAs only the third food is liked by all the three people, 1 should be printed.\n\nSample Input 2\n\n5 5\n4 2 3 4 5\n4 1 3 4 5\n4 1 2 4 5\n4 1 2 3 5\n4 1 2 3 4\n\nSample Output 2\n\n0\n\nKatsusando's hypothesis turned out to be wrong.\n\nSample Input 3\n\n1 30\n3 5 10 30\n\nSample Output 3\n\n3", "sample_input": "3 4\n2 1 3\n3 1 2 3\n2 3 2\n"}, "reference_outputs": ["1\n"], "source_document_id": "p03126", "source_text": "Score : 200 points\n\nProblem Statement\n\nKatsusando loves omelette rice.\n\nBesides, he loves crème brûlée, tenderloin steak and so on, and believes that these foods are all loved by everyone.\n\nTo prove that hypothesis, he conducted a survey on M kinds of foods and asked N people whether they like these foods or not.\n\nThe i-th person answered that he/she only likes the A_{i1}-th, A_{i2}-th, ..., A_{iK_i}-th food.\n\nFind the number of the foods liked by all the N people.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N, M \\leq 30\n\n1 \\leq K_i \\leq M\n\n1 \\leq A_{ij} \\leq M\n\nFor each i (1 \\leq i \\leq N), A_{i1}, A_{i2}, ..., A_{iK_i} are distinct.\n\nConstraints\n\nInput is given from Standard Input in the following format:\n\nN M\nK_1 A_{11} A_{12} ... A_{1K_1}\nK_2 A_{21} A_{22} ... A_{2K_2}\n:\nK_N A_{N1} A_{N2} ... A_{NK_N}\n\nOutput\n\nPrint the number of the foods liked by all the N people.\n\nSample Input 1\n\n3 4\n2 1 3\n3 1 2 3\n2 3 2\n\nSample Output 1\n\n1\n\nAs only the third food is liked by all the three people, 1 should be printed.\n\nSample Input 2\n\n5 5\n4 2 3 4 5\n4 1 3 4 5\n4 1 2 4 5\n4 1 2 3 5\n4 1 2 3 4\n\nSample Output 2\n\n0\n\nKatsusando's hypothesis turned out to be wrong.\n\nSample Input 3\n\n1 30\n3 5 10 30\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": 470, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s985728161", "group_id": "codeNet:p03127", "input_text": "#include <stdio.h>\n\nint yakusuu(int a, int b)\n{\n  while(1) {\n    if (a > b) {\n      a %= b;\n      if (a == 0) {\n\treturn b;\n        break;\n      }\n    } else {\n      b %= a;\n      if (b == 0) {\n\treturn a;\n        break;\n      }\n    }\n  }\n}\n\nint main(void)\n{\n  int n;\n  scanf(\"%d\", &n);\n\n  int a[n];\n  for (int i = 0; i < n; i++)\n    scanf(\"%d\", &a[i]);\n\n  int min = yakusuu(a[0], a[1]);\n  for (int i = 2; i < n; i++) \n    min = yakusuu(a[i], min);\n    \n  printf(\"%d\\n\", min);\n\n  return 0;\n}\n    \n", "language": "C", "metadata": {"date": 1550777733, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "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/C/s985728161.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s985728161", "user_id": "u035009844"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "#include <stdio.h>\n\nint yakusuu(int a, int b)\n{\n  while(1) {\n    if (a > b) {\n      a %= b;\n      if (a == 0) {\n\treturn b;\n        break;\n      }\n    } else {\n      b %= a;\n      if (b == 0) {\n\treturn a;\n        break;\n      }\n    }\n  }\n}\n\nint main(void)\n{\n  int n;\n  scanf(\"%d\", &n);\n\n  int a[n];\n  for (int i = 0; i < n; i++)\n    scanf(\"%d\", &a[i]);\n\n  int min = yakusuu(a[0], a[1]);\n  for (int i = 2; i < n; i++) \n    min = yakusuu(a[i], min);\n    \n  printf(\"%d\\n\", min);\n\n  return 0;\n}\n    \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": 495, "cpu_time_ms": 13, "memory_kb": 512}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s863006618", "group_id": "codeNet:p03127", "input_text": "#include <stdio.h>\n\nint gcd(int a, int b)\n{\n    if(b == 0) {\n        return a;\n    }\n\n    return gcd(b, a%b);\n}\n\nint main()\n{\n    int N;\n    int A1;\n    int A2;\n    int i;\n\n    scanf(\"%d\", &N);\n    scanf(\"%d\", &A1);\n    for(i = 1; i < N; i++) {\n        scanf(\"%d\", &A2);\n        A1 = gcd(A1, A2);\n    }\n\n    printf(\"%d\\n\", A1);\n\n    return 0;\n}", "language": "C", "metadata": {"date": 1550369973, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "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/C/s863006618.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s863006618", "user_id": "u658283466"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "#include <stdio.h>\n\nint gcd(int a, int b)\n{\n    if(b == 0) {\n        return a;\n    }\n\n    return gcd(b, a%b);\n}\n\nint main()\n{\n    int N;\n    int A1;\n    int A2;\n    int i;\n\n    scanf(\"%d\", &N);\n    scanf(\"%d\", &A1);\n    for(i = 1; i < N; i++) {\n        scanf(\"%d\", &A2);\n        A1 = gcd(A1, A2);\n    }\n\n    printf(\"%d\\n\", A1);\n\n    return 0;\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": 344, "cpu_time_ms": 13, "memory_kb": 256}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s692177365", "group_id": "codeNet:p03129", "input_text": "#include<stdio.h>\nint main(void){\n\tint n,k,i,j,count=0;\n\t\n\tscanf(\"%d %d\",&n,&k);\n\t\n\tfor(i=1;i<n;i++){\n\t\tfor(j=1;i!=1&&j<i;j++){\n\t\t\tif(i!=j+1&&i!=j-1){\n\t\t\t\tcount++;\n\t\t\t}\n\t\t}\n\t}\n\tif(count>=k){\n\t\tputs(\"YES\");\n\t}else{\n\t\tputs(\"NO\");\n\t}\n\t\n\treturn 0;\n}", "language": "C", "metadata": {"date": 1549767364, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "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/C/s692177365.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s692177365", "user_id": "u649196210"}, "prompt_components": {"gold_output": "YES\n", "input_to_evaluate": "#include<stdio.h>\nint main(void){\n\tint n,k,i,j,count=0;\n\t\n\tscanf(\"%d %d\",&n,&k);\n\t\n\tfor(i=1;i<n;i++){\n\t\tfor(j=1;i!=1&&j<i;j++){\n\t\t\tif(i!=j+1&&i!=j-1){\n\t\t\t\tcount++;\n\t\t\t}\n\t\t}\n\t}\n\tif(count>=k){\n\t\tputs(\"YES\");\n\t}else{\n\t\tputs(\"NO\");\n\t}\n\t\n\treturn 0;\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": 245, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s929031949", "group_id": "codeNet:p03130", "input_text": "#include<stdio.h>\n\nint main(void){\n    int count[4]={};\n    int a,b;\n    for(int i=0; i<3; i++){\n        scanf(\"%d %d\", &a, &b);\n        count[a]++;\n        count[b]++;\n    }\n    for(int i=0; i<4; i++)\n        if(count[i] >= 3 || count[i]==0){\n            printf(\"NO\\n\");\n            return 0;\n        }\n    \n    printf(\"YES\\n\");\n    return 0;\n}\n", "language": "C", "metadata": {"date": 1549765497, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "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/C/s929031949.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s929031949", "user_id": "u967841198"}, "prompt_components": {"gold_output": "YES\n", "input_to_evaluate": "#include<stdio.h>\n\nint main(void){\n    int count[4]={};\n    int a,b;\n    for(int i=0; i<3; i++){\n        scanf(\"%d %d\", &a, &b);\n        count[a]++;\n        count[b]++;\n    }\n    for(int i=0; i<4; i++)\n        if(count[i] >= 3 || count[i]==0){\n            printf(\"NO\\n\");\n            return 0;\n        }\n    \n    printf(\"YES\\n\");\n    return 0;\n}\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": 346, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s183760526", "group_id": "codeNet:p03135", "input_text": "#include<stdio.h>\n\nint main()\n{\n    int T,X;\n    float t;\n\n    scanf(\"%d %d\", &T, &X);\n\n    t = (float)T/X;\n    \n    printf(\"%f\\n\",t);\n    \n    return 0;\n}\n", "language": "C", "metadata": {"date": 1549246220, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "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/C/s183760526.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s183760526", "user_id": "u555232945"}, "prompt_components": {"gold_output": "2.6666666667\n", "input_to_evaluate": "#include<stdio.h>\n\nint main()\n{\n    int T,X;\n    float t;\n\n    scanf(\"%d %d\", &T, &X);\n\n    t = (float)T/X;\n    \n    printf(\"%f\\n\",t);\n    \n    return 0;\n}\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": 156, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s616018812", "group_id": "codeNet:p03136", "input_text": "#include <stdio.h>\n\nint main(){\n  int n,i,max,sum=0;\n  scanf(\"%d\",&n);\n  int l[n];\n  for(i=0; i<n; i++){\n    scanf(\"%d\",&l[i]);\n  }\n  for(i=0; i<n; i++){\n    if(l[i]>max) max=l[i];\n    sum+=l[i];\n  }\n  if(max>=sum-max) printf(\"No\");\n  else printf(\"Yes\");\n  return 0;\n}\n", "language": "C", "metadata": {"date": 1560401430, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "problem_description_relpath": "problem_descriptions/p03136.html", "problem_id": "p03136", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03136/input.txt", "sample_output_relpath": "derived/input_output/data/p03136/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03136/C/s616018812.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s616018812", "user_id": "u649421008"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "#include <stdio.h>\n\nint main(){\n  int n,i,max,sum=0;\n  scanf(\"%d\",&n);\n  int l[n];\n  for(i=0; i<n; i++){\n    scanf(\"%d\",&l[i]);\n  }\n  for(i=0; i<n; i++){\n    if(l[i]>max) max=l[i];\n    sum+=l[i];\n  }\n  if(max>=sum-max) printf(\"No\");\n  else printf(\"Yes\");\n  return 0;\n}\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nDetermine if an N-sided polygon (not necessarily convex) with sides of length L_1, L_2, ..., L_N can be drawn in a two-dimensional plane.\n\nYou can use the following theorem:\n\nTheorem: an N-sided polygon satisfying the condition can be drawn if and only if the longest side is strictly shorter than the sum of the lengths of the other N-1 sides.\n\nConstraints\n\nAll values in input are integers.\n\n3 \\leq N \\leq 10\n\n1 \\leq L_i \\leq 100\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nL_1 L_2 ... L_N\n\nOutput\n\nIf an N-sided polygon satisfying the condition can be drawn, print Yes; otherwise, print No.\n\nSample Input 1\n\n4\n3 8 5 1\n\nSample Output 1\n\nYes\n\nSince 8 < 9 = 3 + 5 + 1, it follows from the theorem that such a polygon can be drawn on a plane.\n\nSample Input 2\n\n4\n3 8 4 1\n\nSample Output 2\n\nNo\n\nSince 8 \\geq 8 = 3 + 4 + 1, it follows from the theorem that such a polygon cannot be drawn on a plane.\n\nSample Input 3\n\n10\n1 8 10 5 8 12 34 100 11 3\n\nSample Output 3\n\nNo", "sample_input": "4\n3 8 5 1\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p03136", "source_text": "Score : 200 points\n\nProblem Statement\n\nDetermine if an N-sided polygon (not necessarily convex) with sides of length L_1, L_2, ..., L_N can be drawn in a two-dimensional plane.\n\nYou can use the following theorem:\n\nTheorem: an N-sided polygon satisfying the condition can be drawn if and only if the longest side is strictly shorter than the sum of the lengths of the other N-1 sides.\n\nConstraints\n\nAll values in input are integers.\n\n3 \\leq N \\leq 10\n\n1 \\leq L_i \\leq 100\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nL_1 L_2 ... L_N\n\nOutput\n\nIf an N-sided polygon satisfying the condition can be drawn, print Yes; otherwise, print No.\n\nSample Input 1\n\n4\n3 8 5 1\n\nSample Output 1\n\nYes\n\nSince 8 < 9 = 3 + 5 + 1, it follows from the theorem that such a polygon can be drawn on a plane.\n\nSample Input 2\n\n4\n3 8 4 1\n\nSample Output 2\n\nNo\n\nSince 8 \\geq 8 = 3 + 4 + 1, it follows from the theorem that such a polygon cannot be drawn on a plane.\n\nSample Input 3\n\n10\n1 8 10 5 8 12 34 100 11 3\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": 269, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s656938683", "group_id": "codeNet:p03136", "input_text": "#include <stdio.h>\nint main(void){\n    int N,L,S=0,max=0;\n    scanf(\"%d\",&N);\n    for (int i=0 ; i<N; i++) {\n        scanf(\"%d\",&L);\n        S+=L;\n        if(L>max){\n            max=L;\n        }\n    }\n    if(S-(2*max)>0){\n        printf(\"Yes\");\n    }\n    else{\n        printf(\"No\");\n    }\n    printf(\"\\n\");\n    \n    return 0;\n}\n", "language": "C", "metadata": {"date": 1549506380, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "problem_description_relpath": "problem_descriptions/p03136.html", "problem_id": "p03136", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03136/input.txt", "sample_output_relpath": "derived/input_output/data/p03136/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03136/C/s656938683.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s656938683", "user_id": "u077870329"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "#include <stdio.h>\nint main(void){\n    int N,L,S=0,max=0;\n    scanf(\"%d\",&N);\n    for (int i=0 ; i<N; i++) {\n        scanf(\"%d\",&L);\n        S+=L;\n        if(L>max){\n            max=L;\n        }\n    }\n    if(S-(2*max)>0){\n        printf(\"Yes\");\n    }\n    else{\n        printf(\"No\");\n    }\n    printf(\"\\n\");\n    \n    return 0;\n}\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nDetermine if an N-sided polygon (not necessarily convex) with sides of length L_1, L_2, ..., L_N can be drawn in a two-dimensional plane.\n\nYou can use the following theorem:\n\nTheorem: an N-sided polygon satisfying the condition can be drawn if and only if the longest side is strictly shorter than the sum of the lengths of the other N-1 sides.\n\nConstraints\n\nAll values in input are integers.\n\n3 \\leq N \\leq 10\n\n1 \\leq L_i \\leq 100\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nL_1 L_2 ... L_N\n\nOutput\n\nIf an N-sided polygon satisfying the condition can be drawn, print Yes; otherwise, print No.\n\nSample Input 1\n\n4\n3 8 5 1\n\nSample Output 1\n\nYes\n\nSince 8 < 9 = 3 + 5 + 1, it follows from the theorem that such a polygon can be drawn on a plane.\n\nSample Input 2\n\n4\n3 8 4 1\n\nSample Output 2\n\nNo\n\nSince 8 \\geq 8 = 3 + 4 + 1, it follows from the theorem that such a polygon cannot be drawn on a plane.\n\nSample Input 3\n\n10\n1 8 10 5 8 12 34 100 11 3\n\nSample Output 3\n\nNo", "sample_input": "4\n3 8 5 1\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p03136", "source_text": "Score : 200 points\n\nProblem Statement\n\nDetermine if an N-sided polygon (not necessarily convex) with sides of length L_1, L_2, ..., L_N can be drawn in a two-dimensional plane.\n\nYou can use the following theorem:\n\nTheorem: an N-sided polygon satisfying the condition can be drawn if and only if the longest side is strictly shorter than the sum of the lengths of the other N-1 sides.\n\nConstraints\n\nAll values in input are integers.\n\n3 \\leq N \\leq 10\n\n1 \\leq L_i \\leq 100\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nL_1 L_2 ... L_N\n\nOutput\n\nIf an N-sided polygon satisfying the condition can be drawn, print Yes; otherwise, print No.\n\nSample Input 1\n\n4\n3 8 5 1\n\nSample Output 1\n\nYes\n\nSince 8 < 9 = 3 + 5 + 1, it follows from the theorem that such a polygon can be drawn on a plane.\n\nSample Input 2\n\n4\n3 8 4 1\n\nSample Output 2\n\nNo\n\nSince 8 \\geq 8 = 3 + 4 + 1, it follows from the theorem that such a polygon cannot be drawn on a plane.\n\nSample Input 3\n\n10\n1 8 10 5 8 12 34 100 11 3\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": 328, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s663242593", "group_id": "codeNet:p03136", "input_text": "#include <stdio.h>\n\nint main(void){\n\n   int N;\n   \n   scanf(\"%d\",&N);\n   \n   int i,sum,max;\n   int L[N];\n   \n   sum = 0;\n   for(i = 0;i < N;i++){\n      scanf(\"%d\",&L[i]);\n      sum = sum + L[i];\n      if(i == 0 || max <= L[i]){\n         max = L[i];\n      }\n   }\n   \n   if(max < sum - max){\n      printf(\"Yes\\n\");\n   }\n   else {\n      printf(\"No\\n\");\n   }\n   \n  return 0;\n}\n", "language": "C", "metadata": {"date": 1549249305, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "problem_description_relpath": "problem_descriptions/p03136.html", "problem_id": "p03136", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03136/input.txt", "sample_output_relpath": "derived/input_output/data/p03136/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03136/C/s663242593.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s663242593", "user_id": "u686007983"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "#include <stdio.h>\n\nint main(void){\n\n   int N;\n   \n   scanf(\"%d\",&N);\n   \n   int i,sum,max;\n   int L[N];\n   \n   sum = 0;\n   for(i = 0;i < N;i++){\n      scanf(\"%d\",&L[i]);\n      sum = sum + L[i];\n      if(i == 0 || max <= L[i]){\n         max = L[i];\n      }\n   }\n   \n   if(max < sum - max){\n      printf(\"Yes\\n\");\n   }\n   else {\n      printf(\"No\\n\");\n   }\n   \n  return 0;\n}\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nDetermine if an N-sided polygon (not necessarily convex) with sides of length L_1, L_2, ..., L_N can be drawn in a two-dimensional plane.\n\nYou can use the following theorem:\n\nTheorem: an N-sided polygon satisfying the condition can be drawn if and only if the longest side is strictly shorter than the sum of the lengths of the other N-1 sides.\n\nConstraints\n\nAll values in input are integers.\n\n3 \\leq N \\leq 10\n\n1 \\leq L_i \\leq 100\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nL_1 L_2 ... L_N\n\nOutput\n\nIf an N-sided polygon satisfying the condition can be drawn, print Yes; otherwise, print No.\n\nSample Input 1\n\n4\n3 8 5 1\n\nSample Output 1\n\nYes\n\nSince 8 < 9 = 3 + 5 + 1, it follows from the theorem that such a polygon can be drawn on a plane.\n\nSample Input 2\n\n4\n3 8 4 1\n\nSample Output 2\n\nNo\n\nSince 8 \\geq 8 = 3 + 4 + 1, it follows from the theorem that such a polygon cannot be drawn on a plane.\n\nSample Input 3\n\n10\n1 8 10 5 8 12 34 100 11 3\n\nSample Output 3\n\nNo", "sample_input": "4\n3 8 5 1\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p03136", "source_text": "Score : 200 points\n\nProblem Statement\n\nDetermine if an N-sided polygon (not necessarily convex) with sides of length L_1, L_2, ..., L_N can be drawn in a two-dimensional plane.\n\nYou can use the following theorem:\n\nTheorem: an N-sided polygon satisfying the condition can be drawn if and only if the longest side is strictly shorter than the sum of the lengths of the other N-1 sides.\n\nConstraints\n\nAll values in input are integers.\n\n3 \\leq N \\leq 10\n\n1 \\leq L_i \\leq 100\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nL_1 L_2 ... L_N\n\nOutput\n\nIf an N-sided polygon satisfying the condition can be drawn, print Yes; otherwise, print No.\n\nSample Input 1\n\n4\n3 8 5 1\n\nSample Output 1\n\nYes\n\nSince 8 < 9 = 3 + 5 + 1, it follows from the theorem that such a polygon can be drawn on a plane.\n\nSample Input 2\n\n4\n3 8 4 1\n\nSample Output 2\n\nNo\n\nSince 8 \\geq 8 = 3 + 4 + 1, it follows from the theorem that such a polygon cannot be drawn on a plane.\n\nSample Input 3\n\n10\n1 8 10 5 8 12 34 100 11 3\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": 373, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s972384345", "group_id": "codeNet:p03139", "input_text": "#include <stdio.h>\n#include <math.h>\nint main(void){\n  int n,x,y;\n  scanf(\"%d%d%d\",&n,&x,&y);\n  if(n>=x+y) printf(\"%d %d\",(int)fmin(x,y),0);\n  else printf(\"%d %d\",(int)fmin(x,y),x+y-n);\n  return 0;\n}", "language": "C", "metadata": {"date": 1548648811, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "problem_description_relpath": "problem_descriptions/p03139.html", "problem_id": "p03139", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03139/input.txt", "sample_output_relpath": "derived/input_output/data/p03139/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03139/C/s972384345.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s972384345", "user_id": "u185896732"}, "prompt_components": {"gold_output": "3 0\n", "input_to_evaluate": "#include <stdio.h>\n#include <math.h>\nint main(void){\n  int n,x,y;\n  scanf(\"%d%d%d\",&n,&x,&y);\n  if(n>=x+y) printf(\"%d %d\",(int)fmin(x,y),0);\n  else printf(\"%d %d\",(int)fmin(x,y),x+y-n);\n  return 0;\n}", "problem_context": "Score : 100 points\n\nProblem Statement\n\nWe conducted a survey on newspaper subscriptions.\nMore specifically, we asked each of the N respondents the following two questions:\n\nQuestion 1: Are you subscribing to Newspaper X?\n\nQuestion 2: Are you subscribing to Newspaper Y?\n\nAs the result, A respondents answered \"yes\" to Question 1, and B respondents answered \"yes\" to Question 2.\n\nWhat are the maximum possible number and the minimum possible number of respondents subscribing to both newspapers X and Y?\n\nWrite a program to answer this question.\n\nConstraints\n\n1 \\leq N \\leq 100\n\n0 \\leq A \\leq N\n\n0 \\leq B \\leq N\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 maximum possible number and the minimum possible number of respondents subscribing to both newspapers, in this order, with a space in between.\n\nSample Input 1\n\n10 3 5\n\nSample Output 1\n\n3 0\n\nIn this sample, out of the 10 respondents, 3 answered they are subscribing to Newspaper X, and 5 answered they are subscribing to Newspaper Y.\n\nHere, the number of respondents subscribing to both newspapers is at most 3 and at least 0.\n\nSample Input 2\n\n10 7 5\n\nSample Output 2\n\n5 2\n\nIn this sample, out of the 10 respondents, 7 answered they are subscribing to Newspaper X, and 5 answered they are subscribing to Newspaper Y.\n\nHere, the number of respondents subscribing to both newspapers is at most 5 and at least 2.\n\nSample Input 3\n\n100 100 100\n\nSample Output 3\n\n100 100", "sample_input": "10 3 5\n"}, "reference_outputs": ["3 0\n"], "source_document_id": "p03139", "source_text": "Score : 100 points\n\nProblem Statement\n\nWe conducted a survey on newspaper subscriptions.\nMore specifically, we asked each of the N respondents the following two questions:\n\nQuestion 1: Are you subscribing to Newspaper X?\n\nQuestion 2: Are you subscribing to Newspaper Y?\n\nAs the result, A respondents answered \"yes\" to Question 1, and B respondents answered \"yes\" to Question 2.\n\nWhat are the maximum possible number and the minimum possible number of respondents subscribing to both newspapers X and Y?\n\nWrite a program to answer this question.\n\nConstraints\n\n1 \\leq N \\leq 100\n\n0 \\leq A \\leq N\n\n0 \\leq B \\leq N\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 maximum possible number and the minimum possible number of respondents subscribing to both newspapers, in this order, with a space in between.\n\nSample Input 1\n\n10 3 5\n\nSample Output 1\n\n3 0\n\nIn this sample, out of the 10 respondents, 3 answered they are subscribing to Newspaper X, and 5 answered they are subscribing to Newspaper Y.\n\nHere, the number of respondents subscribing to both newspapers is at most 3 and at least 0.\n\nSample Input 2\n\n10 7 5\n\nSample Output 2\n\n5 2\n\nIn this sample, out of the 10 respondents, 7 answered they are subscribing to Newspaper X, and 5 answered they are subscribing to Newspaper Y.\n\nHere, the number of respondents subscribing to both newspapers is at most 5 and at least 2.\n\nSample Input 3\n\n100 100 100\n\nSample Output 3\n\n100 100", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 199, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s218911712", "group_id": "codeNet:p03140", "input_text": "#include <stdio.h>\n#include <string.h>\nint main(int argc, char* argv[]) {\n    int n;\n    char a[101], b[101], c[101];\n    int min;\n    int i;\n    \n    scanf(\"%d\\n%s\\n%s\\n%s\", &n, a, b, c);\n    \n    min = n*3;\n    \n    for(i=0; i<n; i++) {\n    \tif(a[i] == b[i]) {\n    \t\tmin -= 2;\n    \t\tif(a[i] == c[i]) {\n    \t\t\tmin--;\n    \t\t}\n    \t} else if(b[i] == c[i]) {\n    \t\tmin -= 2;\n    \t\tif(b[i] == a[i]) {\n    \t\t\tmin--;\n    \t\t}\n    \t} else if(c[i] == a[i]) {\n    \t\tmin -= 2;\n    \t\tif(c[i] == b[i]) {\n    \t\t\tmin--;\n    \t\t}\n    \t} else {\n    \t\tmin--;\n    \t}\n    }\n    printf(\"%d\\n\", min);\n    return 0;\n}", "language": "C", "metadata": {"date": 1548643951, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "problem_description_relpath": "problem_descriptions/p03140.html", "problem_id": "p03140", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03140/input.txt", "sample_output_relpath": "derived/input_output/data/p03140/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03140/C/s218911712.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s218911712", "user_id": "u043686888"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "#include <stdio.h>\n#include <string.h>\nint main(int argc, char* argv[]) {\n    int n;\n    char a[101], b[101], c[101];\n    int min;\n    int i;\n    \n    scanf(\"%d\\n%s\\n%s\\n%s\", &n, a, b, c);\n    \n    min = n*3;\n    \n    for(i=0; i<n; i++) {\n    \tif(a[i] == b[i]) {\n    \t\tmin -= 2;\n    \t\tif(a[i] == c[i]) {\n    \t\t\tmin--;\n    \t\t}\n    \t} else if(b[i] == c[i]) {\n    \t\tmin -= 2;\n    \t\tif(b[i] == a[i]) {\n    \t\t\tmin--;\n    \t\t}\n    \t} else if(c[i] == a[i]) {\n    \t\tmin -= 2;\n    \t\tif(c[i] == b[i]) {\n    \t\t\tmin--;\n    \t\t}\n    \t} else {\n    \t\tmin--;\n    \t}\n    }\n    printf(\"%d\\n\", min);\n    return 0;\n}", "problem_context": "Score : 200 points\n\nProblem Statement\n\nYou are given three strings A, B and C. Each of these is a string of length N consisting of lowercase English letters.\n\nOur objective is to make all these three strings equal. For that, you can repeatedly perform the following operation:\n\nOperation: Choose one of the strings A, B and C, and specify an integer i between 1 and N (inclusive). Change the i-th character from the beginning of the chosen string to some other lowercase English letter.\n\nWhat is the minimum number of operations required to achieve the objective?\n\nConstraints\n\n1 \\leq N \\leq 100\n\nEach of the strings A, B and C is a string of length N.\n\nEach character in each of the strings A, B and C is a lowercase English letter.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA\nB\nC\n\nOutput\n\nPrint the minimum number of operations required.\n\nSample Input 1\n\n4\nwest\neast\nwait\n\nSample Output 1\n\n3\n\nIn this sample, initially A = west、B = east、C = wait. We can achieve the objective in the minimum number of operations by performing three operations as follows:\n\nChange the second character in A to a. A is now wast.\n\nChange the first character in B to w. B is now wast.\n\nChange the third character in C to s. C is now wast.\n\nSample Input 2\n\n9\ndifferent\ndifferent\ndifferent\n\nSample Output 2\n\n0\n\nIf A, B and C are already equal in the beginning, the number of operations required is 0.\n\nSample Input 3\n\n7\nzenkoku\ntouitsu\nprogram\n\nSample Output 3\n\n13", "sample_input": "4\nwest\neast\nwait\n"}, "reference_outputs": ["3\n"], "source_document_id": "p03140", "source_text": "Score : 200 points\n\nProblem Statement\n\nYou are given three strings A, B and C. Each of these is a string of length N consisting of lowercase English letters.\n\nOur objective is to make all these three strings equal. For that, you can repeatedly perform the following operation:\n\nOperation: Choose one of the strings A, B and C, and specify an integer i between 1 and N (inclusive). Change the i-th character from the beginning of the chosen string to some other lowercase English letter.\n\nWhat is the minimum number of operations required to achieve the objective?\n\nConstraints\n\n1 \\leq N \\leq 100\n\nEach of the strings A, B and C is a string of length N.\n\nEach character in each of the strings A, B and C is a lowercase English letter.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA\nB\nC\n\nOutput\n\nPrint the minimum number of operations required.\n\nSample Input 1\n\n4\nwest\neast\nwait\n\nSample Output 1\n\n3\n\nIn this sample, initially A = west、B = east、C = wait. We can achieve the objective in the minimum number of operations by performing three operations as follows:\n\nChange the second character in A to a. A is now wast.\n\nChange the first character in B to w. B is now wast.\n\nChange the third character in C to s. C is now wast.\n\nSample Input 2\n\n9\ndifferent\ndifferent\ndifferent\n\nSample Output 2\n\n0\n\nIf A, B and C are already equal in the beginning, the number of operations required is 0.\n\nSample Input 3\n\n7\nzenkoku\ntouitsu\nprogram\n\nSample Output 3\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": 594, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s052609523", "group_id": "codeNet:p03140", "input_text": "#include<stdio.h>\n#include<string.h>\nint main(void){\n    int N,i,k,cou;\n    char A[100],B[100],C[100];\n    scanf(\"%d\",&N);\n    scanf(\"%s\",A);\n    scanf(\"%s\",B);\n    scanf(\"%s\",C);\n\nfor(i=0;i<N;i++){\n    k=0;\n    if(A[i]==B[i]){\n        k++;\n    }\n    if(A[i]==C[i]){\n        k++;\n    }\n    if(B[i]==C[i]){\n        k++;\n    }\n\n    if(k==1){\n        cou+=1;\n    }else if(k==0){\n        cou+=2;\n    }\n}\n\n\nprintf(\"%d\",cou);\n\n\n    return 0;\n}", "language": "C", "metadata": {"date": 1548643547, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "problem_description_relpath": "problem_descriptions/p03140.html", "problem_id": "p03140", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03140/input.txt", "sample_output_relpath": "derived/input_output/data/p03140/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03140/C/s052609523.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s052609523", "user_id": "u635508156"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "#include<stdio.h>\n#include<string.h>\nint main(void){\n    int N,i,k,cou;\n    char A[100],B[100],C[100];\n    scanf(\"%d\",&N);\n    scanf(\"%s\",A);\n    scanf(\"%s\",B);\n    scanf(\"%s\",C);\n\nfor(i=0;i<N;i++){\n    k=0;\n    if(A[i]==B[i]){\n        k++;\n    }\n    if(A[i]==C[i]){\n        k++;\n    }\n    if(B[i]==C[i]){\n        k++;\n    }\n\n    if(k==1){\n        cou+=1;\n    }else if(k==0){\n        cou+=2;\n    }\n}\n\n\nprintf(\"%d\",cou);\n\n\n    return 0;\n}", "problem_context": "Score : 200 points\n\nProblem Statement\n\nYou are given three strings A, B and C. Each of these is a string of length N consisting of lowercase English letters.\n\nOur objective is to make all these three strings equal. For that, you can repeatedly perform the following operation:\n\nOperation: Choose one of the strings A, B and C, and specify an integer i between 1 and N (inclusive). Change the i-th character from the beginning of the chosen string to some other lowercase English letter.\n\nWhat is the minimum number of operations required to achieve the objective?\n\nConstraints\n\n1 \\leq N \\leq 100\n\nEach of the strings A, B and C is a string of length N.\n\nEach character in each of the strings A, B and C is a lowercase English letter.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA\nB\nC\n\nOutput\n\nPrint the minimum number of operations required.\n\nSample Input 1\n\n4\nwest\neast\nwait\n\nSample Output 1\n\n3\n\nIn this sample, initially A = west、B = east、C = wait. We can achieve the objective in the minimum number of operations by performing three operations as follows:\n\nChange the second character in A to a. A is now wast.\n\nChange the first character in B to w. B is now wast.\n\nChange the third character in C to s. C is now wast.\n\nSample Input 2\n\n9\ndifferent\ndifferent\ndifferent\n\nSample Output 2\n\n0\n\nIf A, B and C are already equal in the beginning, the number of operations required is 0.\n\nSample Input 3\n\n7\nzenkoku\ntouitsu\nprogram\n\nSample Output 3\n\n13", "sample_input": "4\nwest\neast\nwait\n"}, "reference_outputs": ["3\n"], "source_document_id": "p03140", "source_text": "Score : 200 points\n\nProblem Statement\n\nYou are given three strings A, B and C. Each of these is a string of length N consisting of lowercase English letters.\n\nOur objective is to make all these three strings equal. For that, you can repeatedly perform the following operation:\n\nOperation: Choose one of the strings A, B and C, and specify an integer i between 1 and N (inclusive). Change the i-th character from the beginning of the chosen string to some other lowercase English letter.\n\nWhat is the minimum number of operations required to achieve the objective?\n\nConstraints\n\n1 \\leq N \\leq 100\n\nEach of the strings A, B and C is a string of length N.\n\nEach character in each of the strings A, B and C is a lowercase English letter.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA\nB\nC\n\nOutput\n\nPrint the minimum number of operations required.\n\nSample Input 1\n\n4\nwest\neast\nwait\n\nSample Output 1\n\n3\n\nIn this sample, initially A = west、B = east、C = wait. We can achieve the objective in the minimum number of operations by performing three operations as follows:\n\nChange the second character in A to a. A is now wast.\n\nChange the first character in B to w. B is now wast.\n\nChange the third character in C to s. C is now wast.\n\nSample Input 2\n\n9\ndifferent\ndifferent\ndifferent\n\nSample Output 2\n\n0\n\nIf A, B and C are already equal in the beginning, the number of operations required is 0.\n\nSample Input 3\n\n7\nzenkoku\ntouitsu\nprogram\n\nSample Output 3\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": 437, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s877595772", "group_id": "codeNet:p03141", "input_text": "#include<stdio.h>\n#include<stdlib.h>\n\nint main(){\n    int n, i, j, k, work, sum_a=0, sum_b=0;\n    long *a,*b; \n\n    scanf(\"%d\",&n);\n\n    a = (long*)malloc(sizeof(long)*n);\n    b = (long*)malloc(sizeof(long)*n);\n\n    for(i=0;i<n;i++){\n        scanf(\"%ld %ld\",&a[i],&b[i]);\n    }\n    for(j=0;j<n;j++){\n        for(k=j+1;k<n;k++){\n            if(a[j]<a[k]){\n                work = a[j];\n                a[j] = a[k];\n                a[k] = work;\n            }\n            if(b[j]<b[k]){\n                work = b[j];\n                b[j] = b[k];\n                b[k] = work;\n            }\n        }\n    }\n    for(i=0;i<n;i++){\n        if(i%2==0){\n            sum_a+=a[i];\n        }else{\n            sum_b+=b[i];\n        }\n    }\n    printf(\"%d\",sum_a-sum_b);\n    free(a);\n    free(b);\n\n    return 0;\n}", "language": "C", "metadata": {"date": 1548655042, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "problem_description_relpath": "problem_descriptions/p03141.html", "problem_id": "p03141", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03141/input.txt", "sample_output_relpath": "derived/input_output/data/p03141/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03141/C/s877595772.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s877595772", "user_id": "u710135612"}, "prompt_components": {"gold_output": "20\n", "input_to_evaluate": "#include<stdio.h>\n#include<stdlib.h>\n\nint main(){\n    int n, i, j, k, work, sum_a=0, sum_b=0;\n    long *a,*b; \n\n    scanf(\"%d\",&n);\n\n    a = (long*)malloc(sizeof(long)*n);\n    b = (long*)malloc(sizeof(long)*n);\n\n    for(i=0;i<n;i++){\n        scanf(\"%ld %ld\",&a[i],&b[i]);\n    }\n    for(j=0;j<n;j++){\n        for(k=j+1;k<n;k++){\n            if(a[j]<a[k]){\n                work = a[j];\n                a[j] = a[k];\n                a[k] = work;\n            }\n            if(b[j]<b[k]){\n                work = b[j];\n                b[j] = b[k];\n                b[k] = work;\n            }\n        }\n    }\n    for(i=0;i<n;i++){\n        if(i%2==0){\n            sum_a+=a[i];\n        }else{\n            sum_b+=b[i];\n        }\n    }\n    printf(\"%d\",sum_a-sum_b);\n    free(a);\n    free(b);\n\n    return 0;\n}", "problem_context": "Score : 400 points\n\nProblem Statement\n\nThere are N dishes of cuisine placed in front of Takahashi and Aoki.\nFor convenience, we call these dishes Dish 1, Dish 2, ..., Dish N.\n\nWhen Takahashi eats Dish i, he earns A_i points of happiness; when Aoki eats Dish i, she earns B_i points of happiness.\n\nStarting from Takahashi, they alternately choose one dish and eat it, until there is no more dish to eat.\nHere, both of them choose dishes so that the following value is maximized: \"the sum of the happiness he/she will earn in the end\" minus \"the sum of the happiness the other person will earn in the end\".\n\nFind the value: \"the sum of the happiness Takahashi earns in the end\" minus \"the sum of the happiness Aoki earns in the end\".\n\nConstraints\n\n1 \\leq N \\leq 10^5\n\n1 \\leq A_i \\leq 10^9\n\n1 \\leq B_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 B_1\n:\nA_N B_N\n\nOutput\n\nPrint the value: \"the sum of the happiness Takahashi earns in the end\" minus \"the sum of the happiness Aoki earns in the end\".\n\nSample Input 1\n\n3\n10 10\n20 20\n30 30\n\nSample Output 1\n\n20\n\nIn this sample, both of them earns 10 points of happiness by eating Dish 1, 20 points by eating Dish 2, and 30 points by eating Dish 3.\n\nIn this case, since Takahashi and Aoki have the same \"taste\", each time they will choose the dish with which they can earn the greatest happiness. Thus, first Takahashi will choose Dish 3, then Aoki will choose Dish 2, and finally Takahashi will choose Dish 1, so the answer is (30 + 10) - 20 = 20.\n\nSample Input 2\n\n3\n20 10\n20 20\n20 30\n\nSample Output 2\n\n20\n\nIn this sample, Takahashi earns 20 points of happiness by eating any one of the dishes 1, 2 and 3, but Aoki earns 10 points of happiness by eating Dish 1, 20 points by eating Dish 2, and 30 points by eating Dish 3.\n\nIn this case, since only Aoki has likes and dislikes, each time they will choose the dish with which Aoki can earn the greatest happiness. Thus, first Takahashi will choose Dish 3, then Aoki will choose Dish 2, and finally Takahashi will choose Dish 1, so the answer is (20 + 20) - 20 = 20.\n\nSample Input 3\n\n6\n1 1000000000\n1 1000000000\n1 1000000000\n1 1000000000\n1 1000000000\n1 1000000000\n\nSample Output 3\n\n-2999999997\n\nNote that the answer may not fit into a 32-bit integer.", "sample_input": "3\n10 10\n20 20\n30 30\n"}, "reference_outputs": ["20\n"], "source_document_id": "p03141", "source_text": "Score : 400 points\n\nProblem Statement\n\nThere are N dishes of cuisine placed in front of Takahashi and Aoki.\nFor convenience, we call these dishes Dish 1, Dish 2, ..., Dish N.\n\nWhen Takahashi eats Dish i, he earns A_i points of happiness; when Aoki eats Dish i, she earns B_i points of happiness.\n\nStarting from Takahashi, they alternately choose one dish and eat it, until there is no more dish to eat.\nHere, both of them choose dishes so that the following value is maximized: \"the sum of the happiness he/she will earn in the end\" minus \"the sum of the happiness the other person will earn in the end\".\n\nFind the value: \"the sum of the happiness Takahashi earns in the end\" minus \"the sum of the happiness Aoki earns in the end\".\n\nConstraints\n\n1 \\leq N \\leq 10^5\n\n1 \\leq A_i \\leq 10^9\n\n1 \\leq B_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 B_1\n:\nA_N B_N\n\nOutput\n\nPrint the value: \"the sum of the happiness Takahashi earns in the end\" minus \"the sum of the happiness Aoki earns in the end\".\n\nSample Input 1\n\n3\n10 10\n20 20\n30 30\n\nSample Output 1\n\n20\n\nIn this sample, both of them earns 10 points of happiness by eating Dish 1, 20 points by eating Dish 2, and 30 points by eating Dish 3.\n\nIn this case, since Takahashi and Aoki have the same \"taste\", each time they will choose the dish with which they can earn the greatest happiness. Thus, first Takahashi will choose Dish 3, then Aoki will choose Dish 2, and finally Takahashi will choose Dish 1, so the answer is (30 + 10) - 20 = 20.\n\nSample Input 2\n\n3\n20 10\n20 20\n20 30\n\nSample Output 2\n\n20\n\nIn this sample, Takahashi earns 20 points of happiness by eating any one of the dishes 1, 2 and 3, but Aoki earns 10 points of happiness by eating Dish 1, 20 points by eating Dish 2, and 30 points by eating Dish 3.\n\nIn this case, since only Aoki has likes and dislikes, each time they will choose the dish with which Aoki can earn the greatest happiness. Thus, first Takahashi will choose Dish 3, then Aoki will choose Dish 2, and finally Takahashi will choose Dish 1, so the answer is (20 + 20) - 20 = 20.\n\nSample Input 3\n\n6\n1 1000000000\n1 1000000000\n1 1000000000\n1 1000000000\n1 1000000000\n1 1000000000\n\nSample Output 3\n\n-2999999997\n\nNote that the answer may not fit into a 32-bit integer.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 2103, "memory_kb": 1664}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s445020095", "group_id": "codeNet:p03141", "input_text": "#include<stdio.h>\n#include<stdint.h>\n#include<stdlib.h>\nint main()\n{\n    int N;\n    int A[100000],B[100000],tmp;\n    uint64_t sum_a=0;\n    uint64_t sum_b=0;\n    int64_t sum;\n    int i;\n    int j,max_a,max_b,max_j;\n    int a_i[100000],b_i[100000];\n    int a_i_c=0, b_i_c=0;\n    scanf(\"%d\", &N);\n\n    for(i=0;i<N;i++){\n       scanf(\"%d %d\", &A[i],&B[i]);\n       a_i[i]=i;\n       b_i[i]=i;\n    }\n\n    for(i=0;i<N;i++){\n        for(j=0;j<N-i-1;j++){\n            if(A[a_i[j]]<A[a_i[j+1]]){\n                tmp = a_i[j];\n                a_i[j] = a_i[j+1];\n                a_i[j+1] = tmp;\n            }\n            if(A[a_i[j]]==A[a_i[j+1]] && B[a_i[j]] < B[a_i[j+1]]){\n                tmp = a_i[j];\n                a_i[j] = a_i[j+1];\n                a_i[j+1] = tmp;\n            }\n        }\n    }\n\n    for(i=0;i<N;i++){\n        for(j=0;j<N-i-1;j++){\n            if(B[b_i[j]]<B[b_i[j+1]]){\n                tmp = b_i[j];\n                b_i[j] = b_i[j+1];\n                b_i[j+1] = tmp;\n            }\n            if(B[b_i[j]]==B[b_i[j+1]] && A[b_i[j]] < A[b_i[j+1]]){\n                tmp = b_i[j];\n                b_i[j] = b_i[j+1];\n                b_i[j+1] = tmp;\n            }\n        }\n    }\n\n    for(i=0;i<N;i++){\n        if(i%2==0){\n            for(j = a_i_c;j<N;j++){\n                if(A[a_i[j]] == 0)continue;\n                sum_a = sum_a + A[a_i[j]];\n                A[a_i[j]] = 0;\n                B[a_i[j]] = 0;\n                a_i_c = j + 1;\n                break;\n            }\n        }else{\n            for(j = b_i_c;j<N;j++){\n                if(B[b_i[j]] == 0)continue;\n                sum_b = sum_b + B[b_i[j]];\n                A[b_i[j]] = 0;\n                B[b_i[j]] = 0;\n                b_i_c = j + 1;\n                break;\n             }\n        }\n    }\n\n    sum = sum_a - sum_b;\n    printf(\"%lld\\n\", sum);\n    fflush(stdout);\n    return 0;\n}\n", "language": "C", "metadata": {"date": 1548646720, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "problem_description_relpath": "problem_descriptions/p03141.html", "problem_id": "p03141", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03141/input.txt", "sample_output_relpath": "derived/input_output/data/p03141/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03141/C/s445020095.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s445020095", "user_id": "u688088919"}, "prompt_components": {"gold_output": "20\n", "input_to_evaluate": "#include<stdio.h>\n#include<stdint.h>\n#include<stdlib.h>\nint main()\n{\n    int N;\n    int A[100000],B[100000],tmp;\n    uint64_t sum_a=0;\n    uint64_t sum_b=0;\n    int64_t sum;\n    int i;\n    int j,max_a,max_b,max_j;\n    int a_i[100000],b_i[100000];\n    int a_i_c=0, b_i_c=0;\n    scanf(\"%d\", &N);\n\n    for(i=0;i<N;i++){\n       scanf(\"%d %d\", &A[i],&B[i]);\n       a_i[i]=i;\n       b_i[i]=i;\n    }\n\n    for(i=0;i<N;i++){\n        for(j=0;j<N-i-1;j++){\n            if(A[a_i[j]]<A[a_i[j+1]]){\n                tmp = a_i[j];\n                a_i[j] = a_i[j+1];\n                a_i[j+1] = tmp;\n            }\n            if(A[a_i[j]]==A[a_i[j+1]] && B[a_i[j]] < B[a_i[j+1]]){\n                tmp = a_i[j];\n                a_i[j] = a_i[j+1];\n                a_i[j+1] = tmp;\n            }\n        }\n    }\n\n    for(i=0;i<N;i++){\n        for(j=0;j<N-i-1;j++){\n            if(B[b_i[j]]<B[b_i[j+1]]){\n                tmp = b_i[j];\n                b_i[j] = b_i[j+1];\n                b_i[j+1] = tmp;\n            }\n            if(B[b_i[j]]==B[b_i[j+1]] && A[b_i[j]] < A[b_i[j+1]]){\n                tmp = b_i[j];\n                b_i[j] = b_i[j+1];\n                b_i[j+1] = tmp;\n            }\n        }\n    }\n\n    for(i=0;i<N;i++){\n        if(i%2==0){\n            for(j = a_i_c;j<N;j++){\n                if(A[a_i[j]] == 0)continue;\n                sum_a = sum_a + A[a_i[j]];\n                A[a_i[j]] = 0;\n                B[a_i[j]] = 0;\n                a_i_c = j + 1;\n                break;\n            }\n        }else{\n            for(j = b_i_c;j<N;j++){\n                if(B[b_i[j]] == 0)continue;\n                sum_b = sum_b + B[b_i[j]];\n                A[b_i[j]] = 0;\n                B[b_i[j]] = 0;\n                b_i_c = j + 1;\n                break;\n             }\n        }\n    }\n\n    sum = sum_a - sum_b;\n    printf(\"%lld\\n\", sum);\n    fflush(stdout);\n    return 0;\n}\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nThere are N dishes of cuisine placed in front of Takahashi and Aoki.\nFor convenience, we call these dishes Dish 1, Dish 2, ..., Dish N.\n\nWhen Takahashi eats Dish i, he earns A_i points of happiness; when Aoki eats Dish i, she earns B_i points of happiness.\n\nStarting from Takahashi, they alternately choose one dish and eat it, until there is no more dish to eat.\nHere, both of them choose dishes so that the following value is maximized: \"the sum of the happiness he/she will earn in the end\" minus \"the sum of the happiness the other person will earn in the end\".\n\nFind the value: \"the sum of the happiness Takahashi earns in the end\" minus \"the sum of the happiness Aoki earns in the end\".\n\nConstraints\n\n1 \\leq N \\leq 10^5\n\n1 \\leq A_i \\leq 10^9\n\n1 \\leq B_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 B_1\n:\nA_N B_N\n\nOutput\n\nPrint the value: \"the sum of the happiness Takahashi earns in the end\" minus \"the sum of the happiness Aoki earns in the end\".\n\nSample Input 1\n\n3\n10 10\n20 20\n30 30\n\nSample Output 1\n\n20\n\nIn this sample, both of them earns 10 points of happiness by eating Dish 1, 20 points by eating Dish 2, and 30 points by eating Dish 3.\n\nIn this case, since Takahashi and Aoki have the same \"taste\", each time they will choose the dish with which they can earn the greatest happiness. Thus, first Takahashi will choose Dish 3, then Aoki will choose Dish 2, and finally Takahashi will choose Dish 1, so the answer is (30 + 10) - 20 = 20.\n\nSample Input 2\n\n3\n20 10\n20 20\n20 30\n\nSample Output 2\n\n20\n\nIn this sample, Takahashi earns 20 points of happiness by eating any one of the dishes 1, 2 and 3, but Aoki earns 10 points of happiness by eating Dish 1, 20 points by eating Dish 2, and 30 points by eating Dish 3.\n\nIn this case, since only Aoki has likes and dislikes, each time they will choose the dish with which Aoki can earn the greatest happiness. Thus, first Takahashi will choose Dish 3, then Aoki will choose Dish 2, and finally Takahashi will choose Dish 1, so the answer is (20 + 20) - 20 = 20.\n\nSample Input 3\n\n6\n1 1000000000\n1 1000000000\n1 1000000000\n1 1000000000\n1 1000000000\n1 1000000000\n\nSample Output 3\n\n-2999999997\n\nNote that the answer may not fit into a 32-bit integer.", "sample_input": "3\n10 10\n20 20\n30 30\n"}, "reference_outputs": ["20\n"], "source_document_id": "p03141", "source_text": "Score : 400 points\n\nProblem Statement\n\nThere are N dishes of cuisine placed in front of Takahashi and Aoki.\nFor convenience, we call these dishes Dish 1, Dish 2, ..., Dish N.\n\nWhen Takahashi eats Dish i, he earns A_i points of happiness; when Aoki eats Dish i, she earns B_i points of happiness.\n\nStarting from Takahashi, they alternately choose one dish and eat it, until there is no more dish to eat.\nHere, both of them choose dishes so that the following value is maximized: \"the sum of the happiness he/she will earn in the end\" minus \"the sum of the happiness the other person will earn in the end\".\n\nFind the value: \"the sum of the happiness Takahashi earns in the end\" minus \"the sum of the happiness Aoki earns in the end\".\n\nConstraints\n\n1 \\leq N \\leq 10^5\n\n1 \\leq A_i \\leq 10^9\n\n1 \\leq B_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 B_1\n:\nA_N B_N\n\nOutput\n\nPrint the value: \"the sum of the happiness Takahashi earns in the end\" minus \"the sum of the happiness Aoki earns in the end\".\n\nSample Input 1\n\n3\n10 10\n20 20\n30 30\n\nSample Output 1\n\n20\n\nIn this sample, both of them earns 10 points of happiness by eating Dish 1, 20 points by eating Dish 2, and 30 points by eating Dish 3.\n\nIn this case, since Takahashi and Aoki have the same \"taste\", each time they will choose the dish with which they can earn the greatest happiness. Thus, first Takahashi will choose Dish 3, then Aoki will choose Dish 2, and finally Takahashi will choose Dish 1, so the answer is (30 + 10) - 20 = 20.\n\nSample Input 2\n\n3\n20 10\n20 20\n20 30\n\nSample Output 2\n\n20\n\nIn this sample, Takahashi earns 20 points of happiness by eating any one of the dishes 1, 2 and 3, but Aoki earns 10 points of happiness by eating Dish 1, 20 points by eating Dish 2, and 30 points by eating Dish 3.\n\nIn this case, since only Aoki has likes and dislikes, each time they will choose the dish with which Aoki can earn the greatest happiness. Thus, first Takahashi will choose Dish 3, then Aoki will choose Dish 2, and finally Takahashi will choose Dish 1, so the answer is (20 + 20) - 20 = 20.\n\nSample Input 3\n\n6\n1 1000000000\n1 1000000000\n1 1000000000\n1 1000000000\n1 1000000000\n1 1000000000\n\nSample Output 3\n\n-2999999997\n\nNote that the answer may not fit into a 32-bit integer.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1857, "cpu_time_ms": 2103, "memory_kb": 1664}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s802616832", "group_id": "codeNet:p03145", "input_text": "#include<stdio.h>\n\nint main() {\n   int ab, bc, ca;\n   scanf(\"%d %d %d\", &ab, &bc, &ca);\n   int area = ab * bc / 2;\n   printf(\"%d\\n\", area);\n}\n", "language": "C", "metadata": {"date": 1587419750, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "problem_description_relpath": "problem_descriptions/p03145.html", "problem_id": "p03145", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03145/input.txt", "sample_output_relpath": "derived/input_output/data/p03145/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03145/C/s802616832.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s802616832", "user_id": "u081472919"}, "prompt_components": {"gold_output": "6\n", "input_to_evaluate": "#include<stdio.h>\n\nint main() {\n   int ab, bc, ca;\n   scanf(\"%d %d %d\", &ab, &bc, &ca);\n   int area = ab * bc / 2;\n   printf(\"%d\\n\", area);\n}\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nThere is a right triangle ABC with ∠ABC=90°.\n\nGiven the lengths of the three sides, |AB|,|BC| and |CA|, find the area of the right triangle ABC.\n\nIt is guaranteed that the area of the triangle ABC is an integer.\n\nConstraints\n\n1 \\leq |AB|,|BC|,|CA| \\leq 100\n\nAll values in input are integers.\n\nThe area of the triangle ABC is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\n|AB| |BC| |CA|\n\nOutput\n\nPrint the area of the triangle ABC.\n\nSample Input 1\n\n3 4 5\n\nSample Output 1\n\n6\n\nThis triangle has an area of 6.\n\nSample Input 2\n\n5 12 13\n\nSample Output 2\n\n30\n\nThis triangle has an area of 30.\n\nSample Input 3\n\n45 28 53\n\nSample Output 3\n\n630\n\nThis triangle has an area of 630.", "sample_input": "3 4 5\n"}, "reference_outputs": ["6\n"], "source_document_id": "p03145", "source_text": "Score : 100 points\n\nProblem Statement\n\nThere is a right triangle ABC with ∠ABC=90°.\n\nGiven the lengths of the three sides, |AB|,|BC| and |CA|, find the area of the right triangle ABC.\n\nIt is guaranteed that the area of the triangle ABC is an integer.\n\nConstraints\n\n1 \\leq |AB|,|BC|,|CA| \\leq 100\n\nAll values in input are integers.\n\nThe area of the triangle ABC is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\n|AB| |BC| |CA|\n\nOutput\n\nPrint the area of the triangle ABC.\n\nSample Input 1\n\n3 4 5\n\nSample Output 1\n\n6\n\nThis triangle has an area of 6.\n\nSample Input 2\n\n5 12 13\n\nSample Output 2\n\n30\n\nThis triangle has an area of 30.\n\nSample Input 3\n\n45 28 53\n\nSample Output 3\n\n630\n\nThis triangle has an area of 630.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 142, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s552595025", "group_id": "codeNet:p03146", "input_text": "#include <stdio.h>\nint main(void)\n{\n  int s,i=0,j,m=0;\n  int a[1000];\n  scanf(\"%d\",&s);\n  a[i] = s;i++;\n  while(m == 0){\n    if((a[i-1]%2) == 0)\n    \ta[i] = a[i-1]/2;\n  \telse\n    \ta[i] = 3*a[i-1]+1;\n    for(j=0;j<i;j++){\n      if(a[j] == a[i])\n        m = i;\n    }\n    i++;\n  }\n  printf(\"%d\",m);\n  return 0;\n}", "language": "C", "metadata": {"date": 1548038103, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "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/C/s552595025.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s552595025", "user_id": "u923206646"}, "prompt_components": {"gold_output": "5\n", "input_to_evaluate": "#include <stdio.h>\nint main(void)\n{\n  int s,i=0,j,m=0;\n  int a[1000];\n  scanf(\"%d\",&s);\n  a[i] = s;i++;\n  while(m == 0){\n    if((a[i-1]%2) == 0)\n    \ta[i] = a[i-1]/2;\n  \telse\n    \ta[i] = 3*a[i-1]+1;\n    for(j=0;j<i;j++){\n      if(a[j] == a[i])\n        m = i;\n    }\n    i++;\n  }\n  printf(\"%d\",m);\n  return 0;\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": 309, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s833661077", "group_id": "codeNet:p03147", "input_text": "#include<stdio.h>\n#include<stdbool.h>\nint main(void){\n  int n=0;\n  int h[n];\n  int mizuyariCount=0;\n  int l=0;\n  int r=n;\n  bool allZero=false;\n  \n  bool eluJudge=false;\n  bool aruJudge=false;\n  \n  //本数指定\n  scanf(\"%d\",&n);\n  for(int i=0;i<n;i++){\n    //要素ごとの高さ指定\n    scanf(\"%d\",&h[i]);\n  }\n  \n  //ここからmizuyari を Count\n  while(allZero==true){\n    \n  \t// l の指定\n  \twhile(eluJudge==true){\n      for(int j=0;j<n;j++){\n    \tif(h[n]!=0){\n      \t  l=j;\n          eluJudge = true;\n          j = 101;\n    \t}\n      }\n    }\n      // r の指定\n    while(aruJudge==true){\n      for(int k=0;k<n;k++){\n        if(h[n]==0){\n          r = k -1;\n          aruJudge = true;\n          k = 101;\n        }\n      }\n    }\n \n    //0でない部分で水やり    \n    for(l;l<r;l++){\n      h[l] = h[l]-1;\n    }\n    mizuyariCount++;\n    \n    //要素全部 0 になったか調べる\n    if(eluJudge==false&&aruJudge==false){\n      allZero=true;\n    }else{\n    //値の初期化\n    l=0;\n    r=n;\n    eluJudge=false;\n    aruJudge=false;\n    }\n    \n  }\n  printf(\"%d\",mizuyariCount);\n  return 0;\n  }\n  ", "language": "C", "metadata": {"date": 1585753936, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "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/C/s833661077.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s833661077", "user_id": "u353420611"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "#include<stdio.h>\n#include<stdbool.h>\nint main(void){\n  int n=0;\n  int h[n];\n  int mizuyariCount=0;\n  int l=0;\n  int r=n;\n  bool allZero=false;\n  \n  bool eluJudge=false;\n  bool aruJudge=false;\n  \n  //本数指定\n  scanf(\"%d\",&n);\n  for(int i=0;i<n;i++){\n    //要素ごとの高さ指定\n    scanf(\"%d\",&h[i]);\n  }\n  \n  //ここからmizuyari を Count\n  while(allZero==true){\n    \n  \t// l の指定\n  \twhile(eluJudge==true){\n      for(int j=0;j<n;j++){\n    \tif(h[n]!=0){\n      \t  l=j;\n          eluJudge = true;\n          j = 101;\n    \t}\n      }\n    }\n      // r の指定\n    while(aruJudge==true){\n      for(int k=0;k<n;k++){\n        if(h[n]==0){\n          r = k -1;\n          aruJudge = true;\n          k = 101;\n        }\n      }\n    }\n \n    //0でない部分で水やり    \n    for(l;l<r;l++){\n      h[l] = h[l]-1;\n    }\n    mizuyariCount++;\n    \n    //要素全部 0 になったか調べる\n    if(eluJudge==false&&aruJudge==false){\n      allZero=true;\n    }else{\n    //値の初期化\n    l=0;\n    r=n;\n    eluJudge=false;\n    aruJudge=false;\n    }\n    \n  }\n  printf(\"%d\",mizuyariCount);\n  return 0;\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": 1117, "cpu_time_ms": 97, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s583036203", "group_id": "codeNet:p03166", "input_text": "#include <stdio.h>\n\nint dp[100010] = {0};\nint M;\nint l[100010][2];\n\nint maxNum(int a,int b){\n\tif(a>b) return a;\n\telse return b;\n}\n\nint f(int a){\n\tif(dp[a]>=0) return dp[a];\n\tint max = 0;\n\tfor(int i=0;i<M;i++){\n\t\tif(a==l[i][0]) max = maxNum(f(l[i][1])+1,max);\n\t}\n\tdp[a] = max;\n\treturn dp[a];\n}\n\nint main(void) {\n\tint N;\n\tscanf(\"%d%d\",&N,&M);\n\tfor(int i=0;i<M;i++) scanf(\"%d%d\",&l[i][0],&l[i][1]);\n\tfor(int i=0;i<=N;i++) dp[i] = -1;\n\tint ans=0;\n\tfor(int i=1;i<=N;i++){\n\t\tans = maxNum(f(i),ans);\n\t}\n\tprintf(\"%d\",ans);\n\t/*for(int i=1;i<=N;i++){\n\t\tprintf(\"%d\\n\",dp[i]);\n\t}*/\n\treturn 0;\n}", "language": "C", "metadata": {"date": 1573905947, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "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/C/s583036203.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s583036203", "user_id": "u170126526"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "#include <stdio.h>\n\nint dp[100010] = {0};\nint M;\nint l[100010][2];\n\nint maxNum(int a,int b){\n\tif(a>b) return a;\n\telse return b;\n}\n\nint f(int a){\n\tif(dp[a]>=0) return dp[a];\n\tint max = 0;\n\tfor(int i=0;i<M;i++){\n\t\tif(a==l[i][0]) max = maxNum(f(l[i][1])+1,max);\n\t}\n\tdp[a] = max;\n\treturn dp[a];\n}\n\nint main(void) {\n\tint N;\n\tscanf(\"%d%d\",&N,&M);\n\tfor(int i=0;i<M;i++) scanf(\"%d%d\",&l[i][0],&l[i][1]);\n\tfor(int i=0;i<=N;i++) dp[i] = -1;\n\tint ans=0;\n\tfor(int i=1;i<=N;i++){\n\t\tans = maxNum(f(i),ans);\n\t}\n\tprintf(\"%d\",ans);\n\t/*for(int i=1;i<=N;i++){\n\t\tprintf(\"%d\\n\",dp[i]);\n\t}*/\n\treturn 0;\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": 582, "cpu_time_ms": 2103, "memory_kb": 2688}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s756466901", "group_id": "codeNet:p03166", "input_text": "#include<stdio.h>\n#include<math.h>\n#include<stdlib.h>\n \nint N,M,x,y;\nint **G,*aa,*z;\n\nint num(int n)\n{\n  int k,temp;\n  \n  if(aa[n]!=-1)\n  {\n    return aa[n];\n  }\n  else \n  {\n    temp=0;\n \n    for(k=0;k<z[n];k++)\n    {\n      temp=fmax(temp,num(G[n][k])+1);\n    }\n    aa[n]=temp;\n  }\n  \n  return temp;\n  \n}\n \nint main()\n{\n  \n  int i,j,s,t;\n  scanf(\"%d %d\",&N,&M);\n\n  aa=(int *)malloc(sizeof(int)*(N+1));\n  z=(int *)malloc(sizeof(int)*(N+1));\n\n  for(i=1;i<N+1;i++)\n  {\n    aa[i]=-1;\n    z[i]=0;\n\n  }\n  \n  G=(int **)malloc(sizeof(int)*(N+1));\n  for(i=0;i<N+1;i++)\n  {\n    G[i]=(int *)malloc(sizeof(int)*(M+1));\n  }\n  \n  \n  for(i=1;i<M+1;i++)\n  {\n    scanf(\"%d %d\",&x,&y);\n    \n    G[x][z[x]]=y;\n    z[x]++;\n  }\n  \n\n    \n  \n  j=0;\n  for(i=1;i<N+1;i++)\n  {\n    j=fmax(j,num(i));\n  }\n  \n  printf(\"%d\",j);\n  \n  return 0;\n}", "language": "C", "metadata": {"date": 1567713413, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "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/C/s756466901.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s756466901", "user_id": "u596430580"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "#include<stdio.h>\n#include<math.h>\n#include<stdlib.h>\n \nint N,M,x,y;\nint **G,*aa,*z;\n\nint num(int n)\n{\n  int k,temp;\n  \n  if(aa[n]!=-1)\n  {\n    return aa[n];\n  }\n  else \n  {\n    temp=0;\n \n    for(k=0;k<z[n];k++)\n    {\n      temp=fmax(temp,num(G[n][k])+1);\n    }\n    aa[n]=temp;\n  }\n  \n  return temp;\n  \n}\n \nint main()\n{\n  \n  int i,j,s,t;\n  scanf(\"%d %d\",&N,&M);\n\n  aa=(int *)malloc(sizeof(int)*(N+1));\n  z=(int *)malloc(sizeof(int)*(N+1));\n\n  for(i=1;i<N+1;i++)\n  {\n    aa[i]=-1;\n    z[i]=0;\n\n  }\n  \n  G=(int **)malloc(sizeof(int)*(N+1));\n  for(i=0;i<N+1;i++)\n  {\n    G[i]=(int *)malloc(sizeof(int)*(M+1));\n  }\n  \n  \n  for(i=1;i<M+1;i++)\n  {\n    scanf(\"%d %d\",&x,&y);\n    \n    G[x][z[x]]=y;\n    z[x]++;\n  }\n  \n\n    \n  \n  j=0;\n  for(i=1;i<N+1;i++)\n  {\n    j=fmax(j,num(i));\n  }\n  \n  printf(\"%d\",j);\n  \n  return 0;\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": 814, "cpu_time_ms": 349, "memory_kb": 401408}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s577889214", "group_id": "codeNet:p03168", "input_text": "#include <stdio.h>\n#include <stdlib.h>\n\nint main() {\n    int N;\n    scanf(\"%d\", &N);\n    float *p = malloc((N + 1) * sizeof(float));\n    float **DP = malloc((N + 1) * sizeof(float*));\n    for (int i = 1; i <= N; i++) {\n        scanf(\"%f\", &p[i]);\n    }\n    for (int i = 0; i <= N; i++) {\n        DP[i] = malloc((N + 1) * sizeof(float));\n        for (int j = 0; j <= N; j++) {\n            DP[i][j] = 0.0;\n        }\n    }\n\n    // initialize\n    DP[1][0] = 1.0 - p[1];\n    DP[1][1] = p[1];\n\n    //DP[i][j]: i枚目まででj枚が面の確率 (jは最大i)\n    for (int i = 2; i <= N; i++) {\n        DP[i][0] = DP[i-1][0] * (1.0 - p[i]); // i-1枚目で表が一枚も出てない状態で裏が出る\n        for (int j = 1; j <= i; j++) {\n            DP[i][j] = (DP[i-1][j] * (1.0 -p[i]) + DP[i-1][j-1] * p[i]);  // i-1枚目までで、j枚表が出てる時に裏が出る or j-1枚表が出てる状態で、表が出る\n        }\n    }\n\n    float ans = 0.0;\n    // ansは(N-1)/2 + 1ちょうど一枚表が多い確率からN枚表になる確率を足した値\n    for (int i = (N - 1)/2 + 1; i <= N; i++) {\n        ans += DP[N][i];\n    }\n    printf(\"%f\\n\", ans);\n\n    return 0;\n}\n", "language": "C", "metadata": {"date": 1589497988, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "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/C/s577889214.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s577889214", "user_id": "u619677540"}, "prompt_components": {"gold_output": "0.612\n", "input_to_evaluate": "#include <stdio.h>\n#include <stdlib.h>\n\nint main() {\n    int N;\n    scanf(\"%d\", &N);\n    float *p = malloc((N + 1) * sizeof(float));\n    float **DP = malloc((N + 1) * sizeof(float*));\n    for (int i = 1; i <= N; i++) {\n        scanf(\"%f\", &p[i]);\n    }\n    for (int i = 0; i <= N; i++) {\n        DP[i] = malloc((N + 1) * sizeof(float));\n        for (int j = 0; j <= N; j++) {\n            DP[i][j] = 0.0;\n        }\n    }\n\n    // initialize\n    DP[1][0] = 1.0 - p[1];\n    DP[1][1] = p[1];\n\n    //DP[i][j]: i枚目まででj枚が面の確率 (jは最大i)\n    for (int i = 2; i <= N; i++) {\n        DP[i][0] = DP[i-1][0] * (1.0 - p[i]); // i-1枚目で表が一枚も出てない状態で裏が出る\n        for (int j = 1; j <= i; j++) {\n            DP[i][j] = (DP[i-1][j] * (1.0 -p[i]) + DP[i-1][j-1] * p[i]);  // i-1枚目までで、j枚表が出てる時に裏が出る or j-1枚表が出てる状態で、表が出る\n        }\n    }\n\n    float ans = 0.0;\n    // ansは(N-1)/2 + 1ちょうど一枚表が多い確率からN枚表になる確率を足した値\n    for (int i = (N - 1)/2 + 1; i <= N; i++) {\n        ans += DP[N][i];\n    }\n    printf(\"%f\\n\", ans);\n\n    return 0;\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": 1185, "cpu_time_ms": 41, "memory_kb": 35456}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s130865204", "group_id": "codeNet:p03177", "input_text": "#define $;for(i=j=0;i<n;i+=++j/n,j%=n)\n#define _(a,b)$ for(b=l=0;l<n;)b+=a[i][l]*p[l++][j]%m $ a[i][j]=b%m;}\nlong m=1e9+7,p[50][50],a[50][50],b[50][50],k;i,j,l;main(n){scanf(\"%d%ld\",&n,&k)$ a[i][i]=scanf(\"%d\",p[i]+j);for(;k;k/=2){if(k&1){_(a,b[i][j])_(p,b[i][j])$ k+=a[i][j];printf(\"%d\",k%m);}", "language": "C", "metadata": {"date": 1556257560, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "problem_description_relpath": "problem_descriptions/p03177.html", "problem_id": "p03177", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03177/input.txt", "sample_output_relpath": "derived/input_output/data/p03177/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03177/C/s130865204.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s130865204", "user_id": "u657913472"}, "prompt_components": {"gold_output": "6\n", "input_to_evaluate": "#define $;for(i=j=0;i<n;i+=++j/n,j%=n)\n#define _(a,b)$ for(b=l=0;l<n;)b+=a[i][l]*p[l++][j]%m $ a[i][j]=b%m;}\nlong m=1e9+7,p[50][50],a[50][50],b[50][50],k;i,j,l;main(n){scanf(\"%d%ld\",&n,&k)$ a[i][i]=scanf(\"%d\",p[i]+j);for(;k;k/=2){if(k&1){_(a,b[i][j])_(p,b[i][j])$ k+=a[i][j];printf(\"%d\",k%m);}", "problem_context": "Score : 100 points\n\nProblem Statement\n\nThere is a simple directed graph G with N vertices, numbered 1, 2, \\ldots, N.\n\nFor each i and j (1 \\leq i, j \\leq N), you are given an integer a_{i, j} that represents whether there is a directed edge from Vertex i to j.\nIf a_{i, j} = 1, there is a directed edge from Vertex i to j; if a_{i, j} = 0, there is not.\n\nFind the number of different directed paths of length K in G, modulo 10^9 + 7.\nWe will also count a path that traverses the same edge multiple times.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 50\n\n1 \\leq K \\leq 10^{18}\n\na_{i, j} is 0 or 1.\n\na_{i, i} = 0\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\na_{1, 1} \\ldots a_{1, N}\n:\na_{N, 1} \\ldots a_{N, N}\n\nOutput\n\nPrint the number of different directed paths of length K in G, modulo 10^9 + 7.\n\nSample Input 1\n\n4 2\n0 1 0 0\n0 0 1 1\n0 0 0 1\n1 0 0 0\n\nSample Output 1\n\n6\n\nG is drawn in the figure below:\n\nThere are six directed paths of length 2:\n\n1 → 2 → 3\n\n1 → 2 → 4\n\n2 → 3 → 4\n\n2 → 4 → 1\n\n3 → 4 → 1\n\n4 → 1 → 2\n\nSample Input 2\n\n3 3\n0 1 0\n1 0 1\n0 0 0\n\nSample Output 2\n\n3\n\nG is drawn in the figure below:\n\nThere are three directed paths of length 3:\n\n1 → 2 → 1 → 2\n\n2 → 1 → 2 → 1\n\n2 → 1 → 2 → 3\n\nSample Input 3\n\n6 2\n0 0 0 0 0 0\n0 0 1 0 0 0\n0 0 0 0 0 0\n0 0 0 0 1 0\n0 0 0 0 0 1\n0 0 0 0 0 0\n\nSample Output 3\n\n1\n\nG is drawn in the figure below:\n\nThere is one directed path of length 2:\n\n4 → 5 → 6\n\nSample Input 4\n\n1 1\n0\n\nSample Output 4\n\n0\n\nSample Input 5\n\n10 1000000000000000000\n0 0 1 1 0 0 0 1 1 0\n0 0 0 0 0 1 1 1 0 0\n0 1 0 0 0 1 0 1 0 1\n1 1 1 0 1 1 0 1 1 0\n0 1 1 1 0 1 0 1 1 1\n0 0 0 1 0 0 1 0 1 0\n0 0 0 1 1 0 0 1 0 1\n1 0 0 0 1 0 1 0 0 0\n0 0 0 0 0 1 0 0 0 0\n1 0 1 1 1 0 1 1 1 0\n\nSample Output 5\n\n957538352\n\nBe sure to print the count modulo 10^9 + 7.", "sample_input": "4 2\n0 1 0 0\n0 0 1 1\n0 0 0 1\n1 0 0 0\n"}, "reference_outputs": ["6\n"], "source_document_id": "p03177", "source_text": "Score : 100 points\n\nProblem Statement\n\nThere is a simple directed graph G with N vertices, numbered 1, 2, \\ldots, N.\n\nFor each i and j (1 \\leq i, j \\leq N), you are given an integer a_{i, j} that represents whether there is a directed edge from Vertex i to j.\nIf a_{i, j} = 1, there is a directed edge from Vertex i to j; if a_{i, j} = 0, there is not.\n\nFind the number of different directed paths of length K in G, modulo 10^9 + 7.\nWe will also count a path that traverses the same edge multiple times.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 50\n\n1 \\leq K \\leq 10^{18}\n\na_{i, j} is 0 or 1.\n\na_{i, i} = 0\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\na_{1, 1} \\ldots a_{1, N}\n:\na_{N, 1} \\ldots a_{N, N}\n\nOutput\n\nPrint the number of different directed paths of length K in G, modulo 10^9 + 7.\n\nSample Input 1\n\n4 2\n0 1 0 0\n0 0 1 1\n0 0 0 1\n1 0 0 0\n\nSample Output 1\n\n6\n\nG is drawn in the figure below:\n\nThere are six directed paths of length 2:\n\n1 → 2 → 3\n\n1 → 2 → 4\n\n2 → 3 → 4\n\n2 → 4 → 1\n\n3 → 4 → 1\n\n4 → 1 → 2\n\nSample Input 2\n\n3 3\n0 1 0\n1 0 1\n0 0 0\n\nSample Output 2\n\n3\n\nG is drawn in the figure below:\n\nThere are three directed paths of length 3:\n\n1 → 2 → 1 → 2\n\n2 → 1 → 2 → 1\n\n2 → 1 → 2 → 3\n\nSample Input 3\n\n6 2\n0 0 0 0 0 0\n0 0 1 0 0 0\n0 0 0 0 0 0\n0 0 0 0 1 0\n0 0 0 0 0 1\n0 0 0 0 0 0\n\nSample Output 3\n\n1\n\nG is drawn in the figure below:\n\nThere is one directed path of length 2:\n\n4 → 5 → 6\n\nSample Input 4\n\n1 1\n0\n\nSample Output 4\n\n0\n\nSample Input 5\n\n10 1000000000000000000\n0 0 1 1 0 0 0 1 1 0\n0 0 0 0 0 1 1 1 0 0\n0 1 0 0 0 1 0 1 0 1\n1 1 1 0 1 1 0 1 1 0\n0 1 1 1 0 1 0 1 1 1\n0 0 0 1 0 0 1 0 1 0\n0 0 0 1 1 0 0 1 0 1\n1 0 0 0 1 0 1 0 0 0\n0 0 0 0 0 1 0 0 0 0\n1 0 1 1 1 0 1 1 1 0\n\nSample Output 5\n\n957538352\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": 293, "cpu_time_ms": 159, "memory_kb": 256}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s748897551", "group_id": "codeNet:p03178", "input_text": "d,m=1e9+7,dp[10001][2][100];\nchar s[11111];\nf(l,i,k,t,x,L)\n{\n\tint*r=dp[i][t]+k;\n\t*r=i-l?*r:!k;\n\tif(!~*r)\n\t{\n\t\t*r=0;\n\t\tL=t?9:s[i]-48;\n\t\tfor(x=0;x<=L;*r%=m)*r+=f(l,i+1,(k+x++)%d,t|x<L);\n\t}\n\treturn*r;\n}\nmain()\n{\n\tscanf(\"%s%d\",s,&d);\n\tmemset(dp,-1,sizeof dp);\n\tprintf(\"%d\",(f(strlen(s))-1+m)%m);\n}", "language": "C", "metadata": {"date": 1546887941, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "problem_description_relpath": "problem_descriptions/p03178.html", "problem_id": "p03178", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03178/input.txt", "sample_output_relpath": "derived/input_output/data/p03178/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03178/C/s748897551.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s748897551", "user_id": "u657913472"}, "prompt_components": {"gold_output": "6\n", "input_to_evaluate": "d,m=1e9+7,dp[10001][2][100];\nchar s[11111];\nf(l,i,k,t,x,L)\n{\n\tint*r=dp[i][t]+k;\n\t*r=i-l?*r:!k;\n\tif(!~*r)\n\t{\n\t\t*r=0;\n\t\tL=t?9:s[i]-48;\n\t\tfor(x=0;x<=L;*r%=m)*r+=f(l,i+1,(k+x++)%d,t|x<L);\n\t}\n\treturn*r;\n}\nmain()\n{\n\tscanf(\"%s%d\",s,&d);\n\tmemset(dp,-1,sizeof dp);\n\tprintf(\"%d\",(f(strlen(s))-1+m)%m);\n}", "problem_context": "Score : 100 points\n\nProblem Statement\n\nFind the number of integers between 1 and K (inclusive) satisfying the following condition, modulo 10^9 + 7:\n\nThe sum of the digits in base ten is a multiple of D.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq K < 10^{10000}\n\n1 \\leq D \\leq 100\n\nInput\n\nInput is given from Standard Input in the following format:\n\nK\nD\n\nOutput\n\nPrint the number of integers satisfying the condition, modulo 10^9 + 7.\n\nSample Input 1\n\n30\n4\n\nSample Output 1\n\n6\n\nThose six integers are: 4, 8, 13, 17, 22 and 26.\n\nSample Input 2\n\n1000000009\n1\n\nSample Output 2\n\n2\n\nBe sure to print the number modulo 10^9 + 7.\n\nSample Input 3\n\n98765432109876543210\n58\n\nSample Output 3\n\n635270834", "sample_input": "30\n4\n"}, "reference_outputs": ["6\n"], "source_document_id": "p03178", "source_text": "Score : 100 points\n\nProblem Statement\n\nFind the number of integers between 1 and K (inclusive) satisfying the following condition, modulo 10^9 + 7:\n\nThe sum of the digits in base ten is a multiple of D.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq K < 10^{10000}\n\n1 \\leq D \\leq 100\n\nInput\n\nInput is given from Standard Input in the following format:\n\nK\nD\n\nOutput\n\nPrint the number of integers satisfying the condition, modulo 10^9 + 7.\n\nSample Input 1\n\n30\n4\n\nSample Output 1\n\n6\n\nThose six integers are: 4, 8, 13, 17, 22 and 26.\n\nSample Input 2\n\n1000000009\n1\n\nSample Output 2\n\n2\n\nBe sure to print the number modulo 10^9 + 7.\n\nSample Input 3\n\n98765432109876543210\n58\n\nSample Output 3\n\n635270834", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 293, "cpu_time_ms": 105, "memory_kb": 7936}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s169013064", "group_id": "codeNet:p03181", "input_text": "#include <stdio.h>\n\ntypedef struct List {\n\tstruct List *next;\n\tint v;\n\tlong long num;\n} list;\n\nint main()\n{\n\tint i, N, M, u, w;\n\tlist *adj[100001] = {}, e[200001], *p;\n\tscanf(\"%d %d\", &N, &M);\n\tfor (i = 0; i < N - 1; i++) {\n\t\tscanf(\"%d %d\", &u, &w);\n\t\te[i*2].v = w;\n\t\te[i*2+1].v = u;\n\t\te[i*2].num = -1;\n\t\te[i*2+1].num = -1;\n\t\te[i*2].next = adj[u];\n\t\te[i*2+1].next = adj[w];\n\t\tadj[u] = &(e[i*2]);\n\t\tadj[w] = &(e[i*2+1]);\n\t}\n\t\n\tint par[100001] = {}, q[100001], head, tail;\n\tlong long ans, dp[100001] = {};\n\tfor (i = 1; i <= N; i++) {\n\t\tans = 1;\n\t\tq[0] = i;\n\t\tpar[i] = i;\n\t\tfor (head = 0, tail = 1; head < tail; head++) {\n\t\t\tu = q[head];\n\t\t\tfor (p = adj[u]; p != NULL; p = p->next) {\n\t\t\t\tif (p->num == -1 && par[p->v] == 0) {\n\t\t\t\t\tpar[p->v] = u;\n\t\t\t\t\tq[tail++] = p->v;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tfor (head--; head >= 0; head--) {\n\t\t\tu = q[head];\n\t\t\tdp[u] = 1;\n\t\t\tfor (p = adj[u]; p != NULL; p = p->next) {\n\t\t\t\tif (p->v == par[u]) continue;\n\t\t\t\telse {\n\t\t\t\t\tif (p->num == -1) p->num = dp[p->v];\n\t\t\t\t\tdp[u] = dp[u] * (p->num + 1) % M;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\t\n\t\tprintf(\"%lld\\n\", dp[i]);\n\t\tfor (head++; head < tail; head++) {\n\t\t\tu = q[head];\n\t\t\tpar[u] = 0;\n\t\t\tdp[u] = 0;\n\t\t}\n\t}\n\t\n\tfflush(stdout);\n\treturn 0;\n}", "language": "C", "metadata": {"date": 1600007037, "filename_ext": "c", "original_language": "C (GCC 9.2.1)", "problem_description_relpath": "problem_descriptions/p03181.html", "problem_id": "p03181", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03181/input.txt", "sample_output_relpath": "derived/input_output/data/p03181/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03181/C/s169013064.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s169013064", "user_id": "u943800443"}, "prompt_components": {"gold_output": "3\n4\n3\n", "input_to_evaluate": "#include <stdio.h>\n\ntypedef struct List {\n\tstruct List *next;\n\tint v;\n\tlong long num;\n} list;\n\nint main()\n{\n\tint i, N, M, u, w;\n\tlist *adj[100001] = {}, e[200001], *p;\n\tscanf(\"%d %d\", &N, &M);\n\tfor (i = 0; i < N - 1; i++) {\n\t\tscanf(\"%d %d\", &u, &w);\n\t\te[i*2].v = w;\n\t\te[i*2+1].v = u;\n\t\te[i*2].num = -1;\n\t\te[i*2+1].num = -1;\n\t\te[i*2].next = adj[u];\n\t\te[i*2+1].next = adj[w];\n\t\tadj[u] = &(e[i*2]);\n\t\tadj[w] = &(e[i*2+1]);\n\t}\n\t\n\tint par[100001] = {}, q[100001], head, tail;\n\tlong long ans, dp[100001] = {};\n\tfor (i = 1; i <= N; i++) {\n\t\tans = 1;\n\t\tq[0] = i;\n\t\tpar[i] = i;\n\t\tfor (head = 0, tail = 1; head < tail; head++) {\n\t\t\tu = q[head];\n\t\t\tfor (p = adj[u]; p != NULL; p = p->next) {\n\t\t\t\tif (p->num == -1 && par[p->v] == 0) {\n\t\t\t\t\tpar[p->v] = u;\n\t\t\t\t\tq[tail++] = p->v;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tfor (head--; head >= 0; head--) {\n\t\t\tu = q[head];\n\t\t\tdp[u] = 1;\n\t\t\tfor (p = adj[u]; p != NULL; p = p->next) {\n\t\t\t\tif (p->v == par[u]) continue;\n\t\t\t\telse {\n\t\t\t\t\tif (p->num == -1) p->num = dp[p->v];\n\t\t\t\t\tdp[u] = dp[u] * (p->num + 1) % M;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\t\n\t\tprintf(\"%lld\\n\", dp[i]);\n\t\tfor (head++; head < tail; head++) {\n\t\t\tu = q[head];\n\t\t\tpar[u] = 0;\n\t\t\tdp[u] = 0;\n\t\t}\n\t}\n\t\n\tfflush(stdout);\n\treturn 0;\n}", "problem_context": "Score : 100 points\n\nProblem Statement\n\nThere is a tree with N vertices, numbered 1, 2, \\ldots, N.\nFor each i (1 \\leq i \\leq N - 1), the i-th edge connects Vertex x_i and y_i.\n\nTaro has decided to paint each vertex in white or black, so that any black vertex can be reached from any other black vertex by passing through only black vertices.\n\nYou are given a positive integer M.\nFor each v (1 \\leq v \\leq N), answer the following question:\n\nAssuming that Vertex v has to be black, find the number of ways in which the vertices can be painted, modulo 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 x_i, y_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 M\nx_1 y_1\nx_2 y_2\n:\nx_{N - 1} y_{N - 1}\n\nOutput\n\nPrint N lines.\nThe v-th (1 \\leq v \\leq N) line should contain the answer to the following question:\n\nAssuming that Vertex v has to be black, find the number of ways in which the vertices can be painted, modulo M.\n\nSample Input 1\n\n3 100\n1 2\n2 3\n\nSample Output 1\n\n3\n4\n3\n\nThere are seven ways to paint the vertices, as shown in the figure below.\nAmong them, there are three ways such that Vertex 1 is black, four ways such that Vertex 2 is black and three ways such that Vertex 3 is black.\n\nSample Input 2\n\n4 100\n1 2\n1 3\n1 4\n\nSample Output 2\n\n8\n5\n5\n5\n\nSample Input 3\n\n1 100\n\nSample Output 3\n\n1\n\nSample Input 4\n\n10 2\n8 5\n10 8\n6 5\n1 5\n4 8\n2 10\n3 6\n9 2\n1 7\n\nSample Output 4\n\n0\n0\n1\n1\n1\n0\n1\n0\n1\n1\n\nBe sure to print the answers modulo M.", "sample_input": "3 100\n1 2\n2 3\n"}, "reference_outputs": ["3\n4\n3\n"], "source_document_id": "p03181", "source_text": "Score : 100 points\n\nProblem Statement\n\nThere is a tree with N vertices, numbered 1, 2, \\ldots, N.\nFor each i (1 \\leq i \\leq N - 1), the i-th edge connects Vertex x_i and y_i.\n\nTaro has decided to paint each vertex in white or black, so that any black vertex can be reached from any other black vertex by passing through only black vertices.\n\nYou are given a positive integer M.\nFor each v (1 \\leq v \\leq N), answer the following question:\n\nAssuming that Vertex v has to be black, find the number of ways in which the vertices can be painted, modulo 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 x_i, y_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 M\nx_1 y_1\nx_2 y_2\n:\nx_{N - 1} y_{N - 1}\n\nOutput\n\nPrint N lines.\nThe v-th (1 \\leq v \\leq N) line should contain the answer to the following question:\n\nAssuming that Vertex v has to be black, find the number of ways in which the vertices can be painted, modulo M.\n\nSample Input 1\n\n3 100\n1 2\n2 3\n\nSample Output 1\n\n3\n4\n3\n\nThere are seven ways to paint the vertices, as shown in the figure below.\nAmong them, there are three ways such that Vertex 1 is black, four ways such that Vertex 2 is black and three ways such that Vertex 3 is black.\n\nSample Input 2\n\n4 100\n1 2\n1 3\n1 4\n\nSample Output 2\n\n8\n5\n5\n5\n\nSample Input 3\n\n1 100\n\nSample Output 3\n\n1\n\nSample Input 4\n\n10 2\n8 5\n10 8\n6 5\n1 5\n4 8\n2 10\n3 6\n9 2\n1 7\n\nSample Output 4\n\n0\n0\n1\n1\n1\n0\n1\n0\n1\n1\n\nBe sure to print the answers modulo M.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1185, "cpu_time_ms": 2206, "memory_kb": 8728}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s462961683", "group_id": "codeNet:p03181", "input_text": "n;\ni;\nu,v;\nlong ea[2<<17],eb[2<<17],next[2<<17],first[1<<17];\nlong M,dp1[1<<17],dp2[1<<17],L[2<<17]={1},R[2<<17]={1};\ndfs1(u,p)\n{\n\tdp1[u]=1;\n\tint id=first[u];\n\twhile(id)\n\t{\n\t\tif(eb[id]!=p)\n\t\t{\n\t\t\tdfs1(eb[id],u);\n\t\t\tdp1[u]=dp1[u]*-~dp1[eb[id]]%M;\n\t\t}\n\t\tid=next[id];\n\t}\n}\nmake();\ndfs2(u,p,x)long x;\n{\n\tx%=M;\n\tdp2[u]=dp1[u]*x%M;\n\tmake(first[u],p,x%M);\n\tint id=first[u];\n\twhile(id)\n\t{\n\t\tif(eb[id]!=p)\n\t\t{\n\t\t\tdfs2(eb[id],u,(L[id]*R[next[id]]%M+1)%M);\n\t\t}\n\t\tid=next[id];\n\t}\n}\nmake(id,p,x,t)long x,t;\n{\n\tif(id>0)\n\t{\n\t\tL[id]=x%M;\n\t\tt=next[id]>0&&eb[next[id]]!=p?-~dp1[eb[next[id]]]%M:1;\n\t\tmake(next[id],p,t*x%M);\n\t\tif(next[id]>0)R[next[id]]=R[next[next[id]]]*t%M;\n\t}\n}\nmain()\n{\n\tscanf(\"%d%ld\",&n,&M);\n\tfor(i=0;~scanf(\"%d%d\",&u,&v);)\n\t{\n\t\ti++;\n\t\tea[i]=u;\n\t\teb[i]=v;\n\t\ti++;\n\t\tea[i]=v;\n\t\teb[i]=u;\n\t}\n\tfor(i=1;i<2*n;i++)\n\t{\n\t\tnext[i]=first[ea[i]];\n\t\tfirst[ea[i]]=i;\n\t}\n\tdfs1(1,0);\n\tdfs2(1,0,1);\n\tfor(i=1;i<=n;i++)printf(\"%ld\\n\",dp2[i]%M);\n}", "language": "C", "metadata": {"date": 1546929915, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "problem_description_relpath": "problem_descriptions/p03181.html", "problem_id": "p03181", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03181/input.txt", "sample_output_relpath": "derived/input_output/data/p03181/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03181/C/s462961683.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s462961683", "user_id": "u657913472"}, "prompt_components": {"gold_output": "3\n4\n3\n", "input_to_evaluate": "n;\ni;\nu,v;\nlong ea[2<<17],eb[2<<17],next[2<<17],first[1<<17];\nlong M,dp1[1<<17],dp2[1<<17],L[2<<17]={1},R[2<<17]={1};\ndfs1(u,p)\n{\n\tdp1[u]=1;\n\tint id=first[u];\n\twhile(id)\n\t{\n\t\tif(eb[id]!=p)\n\t\t{\n\t\t\tdfs1(eb[id],u);\n\t\t\tdp1[u]=dp1[u]*-~dp1[eb[id]]%M;\n\t\t}\n\t\tid=next[id];\n\t}\n}\nmake();\ndfs2(u,p,x)long x;\n{\n\tx%=M;\n\tdp2[u]=dp1[u]*x%M;\n\tmake(first[u],p,x%M);\n\tint id=first[u];\n\twhile(id)\n\t{\n\t\tif(eb[id]!=p)\n\t\t{\n\t\t\tdfs2(eb[id],u,(L[id]*R[next[id]]%M+1)%M);\n\t\t}\n\t\tid=next[id];\n\t}\n}\nmake(id,p,x,t)long x,t;\n{\n\tif(id>0)\n\t{\n\t\tL[id]=x%M;\n\t\tt=next[id]>0&&eb[next[id]]!=p?-~dp1[eb[next[id]]]%M:1;\n\t\tmake(next[id],p,t*x%M);\n\t\tif(next[id]>0)R[next[id]]=R[next[next[id]]]*t%M;\n\t}\n}\nmain()\n{\n\tscanf(\"%d%ld\",&n,&M);\n\tfor(i=0;~scanf(\"%d%d\",&u,&v);)\n\t{\n\t\ti++;\n\t\tea[i]=u;\n\t\teb[i]=v;\n\t\ti++;\n\t\tea[i]=v;\n\t\teb[i]=u;\n\t}\n\tfor(i=1;i<2*n;i++)\n\t{\n\t\tnext[i]=first[ea[i]];\n\t\tfirst[ea[i]]=i;\n\t}\n\tdfs1(1,0);\n\tdfs2(1,0,1);\n\tfor(i=1;i<=n;i++)printf(\"%ld\\n\",dp2[i]%M);\n}", "problem_context": "Score : 100 points\n\nProblem Statement\n\nThere is a tree with N vertices, numbered 1, 2, \\ldots, N.\nFor each i (1 \\leq i \\leq N - 1), the i-th edge connects Vertex x_i and y_i.\n\nTaro has decided to paint each vertex in white or black, so that any black vertex can be reached from any other black vertex by passing through only black vertices.\n\nYou are given a positive integer M.\nFor each v (1 \\leq v \\leq N), answer the following question:\n\nAssuming that Vertex v has to be black, find the number of ways in which the vertices can be painted, modulo 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 x_i, y_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 M\nx_1 y_1\nx_2 y_2\n:\nx_{N - 1} y_{N - 1}\n\nOutput\n\nPrint N lines.\nThe v-th (1 \\leq v \\leq N) line should contain the answer to the following question:\n\nAssuming that Vertex v has to be black, find the number of ways in which the vertices can be painted, modulo M.\n\nSample Input 1\n\n3 100\n1 2\n2 3\n\nSample Output 1\n\n3\n4\n3\n\nThere are seven ways to paint the vertices, as shown in the figure below.\nAmong them, there are three ways such that Vertex 1 is black, four ways such that Vertex 2 is black and three ways such that Vertex 3 is black.\n\nSample Input 2\n\n4 100\n1 2\n1 3\n1 4\n\nSample Output 2\n\n8\n5\n5\n5\n\nSample Input 3\n\n1 100\n\nSample Output 3\n\n1\n\nSample Input 4\n\n10 2\n8 5\n10 8\n6 5\n1 5\n4 8\n2 10\n3 6\n9 2\n1 7\n\nSample Output 4\n\n0\n0\n1\n1\n1\n0\n1\n0\n1\n1\n\nBe sure to print the answers modulo M.", "sample_input": "3 100\n1 2\n2 3\n"}, "reference_outputs": ["3\n4\n3\n"], "source_document_id": "p03181", "source_text": "Score : 100 points\n\nProblem Statement\n\nThere is a tree with N vertices, numbered 1, 2, \\ldots, N.\nFor each i (1 \\leq i \\leq N - 1), the i-th edge connects Vertex x_i and y_i.\n\nTaro has decided to paint each vertex in white or black, so that any black vertex can be reached from any other black vertex by passing through only black vertices.\n\nYou are given a positive integer M.\nFor each v (1 \\leq v \\leq N), answer the following question:\n\nAssuming that Vertex v has to be black, find the number of ways in which the vertices can be painted, modulo 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 x_i, y_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 M\nx_1 y_1\nx_2 y_2\n:\nx_{N - 1} y_{N - 1}\n\nOutput\n\nPrint N lines.\nThe v-th (1 \\leq v \\leq N) line should contain the answer to the following question:\n\nAssuming that Vertex v has to be black, find the number of ways in which the vertices can be painted, modulo M.\n\nSample Input 1\n\n3 100\n1 2\n2 3\n\nSample Output 1\n\n3\n4\n3\n\nThere are seven ways to paint the vertices, as shown in the figure below.\nAmong them, there are three ways such that Vertex 1 is black, four ways such that Vertex 2 is black and three ways such that Vertex 3 is black.\n\nSample Input 2\n\n4 100\n1 2\n1 3\n1 4\n\nSample Output 2\n\n8\n5\n5\n5\n\nSample Input 3\n\n1 100\n\nSample Output 3\n\n1\n\nSample Input 4\n\n10 2\n8 5\n10 8\n6 5\n1 5\n4 8\n2 10\n3 6\n9 2\n1 7\n\nSample Output 4\n\n0\n0\n1\n1\n1\n0\n1\n0\n1\n1\n\nBe sure to print the answers modulo M.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 928, "cpu_time_ms": 57, "memory_kb": 16256}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s844679173", "group_id": "codeNet:p03182", "input_text": "n=1<<18;N,m;L[1<<18],p;first[1<<18],next[1<<18];i;\nlong dat[1<<20],lazy[1<<20],A[1<<18],x;\neval(i,l,r){\n\tdat[i]+=lazy[i];\n\tlazy[2*i+1]+=lazy[i];\n\tlazy[2*i+2]+=lazy[i];\n\tlazy[i]=0;\n}\nlong update(a,b,k,l,r){\n\teval(k,l,r);\n\treturn a<=l&r<=b?lazy[k]+=x,eval(k,l,r),dat[k]:l<b&a<r?dat[k]=fmax(\n\t\tupdate(a,b,2*k+1,l,(l+r)/2),\n\t\tupdate(a,b,2*k+2,(l+r)/2,r)\n\t):dat[k];\n}\nlong query(a,b,k,l,r){\n\teval(k,l,r);\n\treturn a<=l&r<=b?dat[k]:l<b&a<r?fmax(\n\t\tquery(a,b,2*k+1,l,(l+r)/2),\n\t\tquery(a,b,2*k+2,(l+r)/2,r)\n\t):0;\n}\nmain(j){\n\tfor(scanf(\"%d%d\",&N,&m);~scanf(\"%d%d%ld\",L+j,&p,A+j);first[p]=j++)next[j]=first[p];\n\tfor(;i++<N;){\n\t\tx=0;x=update(0,i,0,0,n);\n\t\t//x=query(0,i,0,0,n);\n\t\tupdate(i,i+1,0,0,n);\n\t\tfor(p=first[i];p!=0;p=next[p])x=A[p],update(L[p],i+1,0,0,n);\n\t}\n\tx=0;\n\tprintf(\"%ld\",update(0,N+1,0,0,n));\n\t//printf(\"%ld\",query(0,N+1,0,0,n));\n}\n\n/*\n####################################################################################################\n####################################################################################################\n####################################################################################################\n####################################################################################################\n####################################################################################################\n####################################################################################################\n####################################################################################################\n####################################################################################################\n####################################################################################################\n####################################################################################################\n*/", "language": "C", "metadata": {"date": 1547093625, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "problem_description_relpath": "problem_descriptions/p03182.html", "problem_id": "p03182", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03182/input.txt", "sample_output_relpath": "derived/input_output/data/p03182/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03182/C/s844679173.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s844679173", "user_id": "u657913472"}, "prompt_components": {"gold_output": "20\n", "input_to_evaluate": "n=1<<18;N,m;L[1<<18],p;first[1<<18],next[1<<18];i;\nlong dat[1<<20],lazy[1<<20],A[1<<18],x;\neval(i,l,r){\n\tdat[i]+=lazy[i];\n\tlazy[2*i+1]+=lazy[i];\n\tlazy[2*i+2]+=lazy[i];\n\tlazy[i]=0;\n}\nlong update(a,b,k,l,r){\n\teval(k,l,r);\n\treturn a<=l&r<=b?lazy[k]+=x,eval(k,l,r),dat[k]:l<b&a<r?dat[k]=fmax(\n\t\tupdate(a,b,2*k+1,l,(l+r)/2),\n\t\tupdate(a,b,2*k+2,(l+r)/2,r)\n\t):dat[k];\n}\nlong query(a,b,k,l,r){\n\teval(k,l,r);\n\treturn a<=l&r<=b?dat[k]:l<b&a<r?fmax(\n\t\tquery(a,b,2*k+1,l,(l+r)/2),\n\t\tquery(a,b,2*k+2,(l+r)/2,r)\n\t):0;\n}\nmain(j){\n\tfor(scanf(\"%d%d\",&N,&m);~scanf(\"%d%d%ld\",L+j,&p,A+j);first[p]=j++)next[j]=first[p];\n\tfor(;i++<N;){\n\t\tx=0;x=update(0,i,0,0,n);\n\t\t//x=query(0,i,0,0,n);\n\t\tupdate(i,i+1,0,0,n);\n\t\tfor(p=first[i];p!=0;p=next[p])x=A[p],update(L[p],i+1,0,0,n);\n\t}\n\tx=0;\n\tprintf(\"%ld\",update(0,N+1,0,0,n));\n\t//printf(\"%ld\",query(0,N+1,0,0,n));\n}\n\n/*\n####################################################################################################\n####################################################################################################\n####################################################################################################\n####################################################################################################\n####################################################################################################\n####################################################################################################\n####################################################################################################\n####################################################################################################\n####################################################################################################\n####################################################################################################\n*/", "problem_context": "Score : 100 points\n\nProblem Statement\n\nConsider a string of length N consisting of 0 and 1.\nThe score for the string is calculated as follows:\n\nFor each i (1 \\leq i \\leq M), a_i is added to the score if the string contains 1 at least once between the l_i-th and r_i-th characters (inclusive).\n\nFind the maximum possible score of a string.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 2 × 10^5\n\n1 \\leq M \\leq 2 × 10^5\n\n1 \\leq l_i \\leq r_i \\leq N\n\n|a_i| \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nl_1 r_1 a_1\nl_2 r_2 a_2\n:\nl_M r_M a_M\n\nOutput\n\nPrint the maximum possible score of a string.\n\nSample Input 1\n\n5 3\n1 3 10\n2 4 -10\n3 5 10\n\nSample Output 1\n\n20\n\nThe score for 10001 is a_1 + a_3 = 10 + 10 = 20.\n\nSample Input 2\n\n3 4\n1 3 100\n1 1 -10\n2 2 -20\n3 3 -30\n\nSample Output 2\n\n90\n\nThe score for 100 is a_1 + a_2 = 100 + (-10) = 90.\n\nSample Input 3\n\n1 1\n1 1 -10\n\nSample Output 3\n\n0\n\nThe score for 0 is 0.\n\nSample Input 4\n\n1 5\n1 1 1000000000\n1 1 1000000000\n1 1 1000000000\n1 1 1000000000\n1 1 1000000000\n\nSample Output 4\n\n5000000000\n\nThe answer may not fit into a 32-bit integer type.\n\nSample Input 5\n\n6 8\n5 5 3\n1 1 10\n1 6 -8\n3 6 5\n3 4 9\n5 5 -2\n1 3 -6\n4 6 -7\n\nSample Output 5\n\n10\n\nFor example, the score for 101000 is a_2 + a_3 + a_4 + a_5 + a_7 = 10 + (-8) + 5 + 9 + (-6) = 10.", "sample_input": "5 3\n1 3 10\n2 4 -10\n3 5 10\n"}, "reference_outputs": ["20\n"], "source_document_id": "p03182", "source_text": "Score : 100 points\n\nProblem Statement\n\nConsider a string of length N consisting of 0 and 1.\nThe score for the string is calculated as follows:\n\nFor each i (1 \\leq i \\leq M), a_i is added to the score if the string contains 1 at least once between the l_i-th and r_i-th characters (inclusive).\n\nFind the maximum possible score of a string.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 2 × 10^5\n\n1 \\leq M \\leq 2 × 10^5\n\n1 \\leq l_i \\leq r_i \\leq N\n\n|a_i| \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nl_1 r_1 a_1\nl_2 r_2 a_2\n:\nl_M r_M a_M\n\nOutput\n\nPrint the maximum possible score of a string.\n\nSample Input 1\n\n5 3\n1 3 10\n2 4 -10\n3 5 10\n\nSample Output 1\n\n20\n\nThe score for 10001 is a_1 + a_3 = 10 + 10 = 20.\n\nSample Input 2\n\n3 4\n1 3 100\n1 1 -10\n2 2 -20\n3 3 -30\n\nSample Output 2\n\n90\n\nThe score for 100 is a_1 + a_2 = 100 + (-10) = 90.\n\nSample Input 3\n\n1 1\n1 1 -10\n\nSample Output 3\n\n0\n\nThe score for 0 is 0.\n\nSample Input 4\n\n1 5\n1 1 1000000000\n1 1 1000000000\n1 1 1000000000\n1 1 1000000000\n1 1 1000000000\n\nSample Output 4\n\n5000000000\n\nThe answer may not fit into a 32-bit integer type.\n\nSample Input 5\n\n6 8\n5 5 3\n1 1 10\n1 6 -8\n3 6 5\n3 4 9\n5 5 -2\n1 3 -6\n4 6 -7\n\nSample Output 5\n\n10\n\nFor example, the score for 101000 is a_2 + a_3 + a_4 + a_5 + a_7 = 10 + (-8) + 5 + 9 + (-6) = 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": 1852, "cpu_time_ms": 327, "memory_kb": 18944}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s475383525", "group_id": "codeNet:p03186", "input_text": "#include <stdio.h>\nint main(void){\n  int a,b,c,max;\n    fscanf(\"%d,%d,%d\",&a,&b,&c);\n    //2連続で毒入り食べると死\n    if(a+b>=c) max=b+c;\n    else max=a+2*b;  \n  return 0;\n}", "language": "C", "metadata": {"date": 1547382931, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "problem_description_relpath": "problem_descriptions/p03186.html", "problem_id": "p03186", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03186/input.txt", "sample_output_relpath": "derived/input_output/data/p03186/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03186/C/s475383525.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s475383525", "user_id": "u275279141"}, "prompt_components": {"gold_output": "5\n", "input_to_evaluate": "#include <stdio.h>\nint main(void){\n  int a,b,c,max;\n    fscanf(\"%d,%d,%d\",&a,&b,&c);\n    //2連続で毒入り食べると死\n    if(a+b>=c) max=b+c;\n    else max=a+2*b;  \n  return 0;\n}", "problem_context": "Score : 200 points\n\nProblem Statement\n\nTakahashi has A untasty cookies containing antidotes, B tasty cookies containing antidotes and C tasty cookies containing poison.\n\nEating a cookie containing poison results in a stomachache, and eating a cookie containing poison while having a stomachache results in a death.\nAs he wants to live, he cannot eat one in such a situation.\nEating a cookie containing antidotes while having a stomachache cures it, and there is no other way to cure stomachaches.\n\nFind the maximum number of tasty cookies that Takahashi can eat.\n\nConstraints\n\n0 \\leq A,B,C \\leq 10^9\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 the maximum number of tasty cookies that Takahashi can eat.\n\nSample Input 1\n\n3 1 4\n\nSample Output 1\n\n5\n\nWe can eat all tasty cookies, in the following order:\n\nA tasty cookie containing poison\n\nAn untasty cookie containing antidotes\n\nA tasty cookie containing poison\n\nA tasty cookie containing antidotes\n\nA tasty cookie containing poison\n\nAn untasty cookie containing antidotes\n\nA tasty cookie containing poison\n\nSample Input 2\n\n5 2 9\n\nSample Output 2\n\n10\n\nSample Input 3\n\n8 8 1\n\nSample Output 3\n\n9", "sample_input": "3 1 4\n"}, "reference_outputs": ["5\n"], "source_document_id": "p03186", "source_text": "Score : 200 points\n\nProblem Statement\n\nTakahashi has A untasty cookies containing antidotes, B tasty cookies containing antidotes and C tasty cookies containing poison.\n\nEating a cookie containing poison results in a stomachache, and eating a cookie containing poison while having a stomachache results in a death.\nAs he wants to live, he cannot eat one in such a situation.\nEating a cookie containing antidotes while having a stomachache cures it, and there is no other way to cure stomachaches.\n\nFind the maximum number of tasty cookies that Takahashi can eat.\n\nConstraints\n\n0 \\leq A,B,C \\leq 10^9\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 the maximum number of tasty cookies that Takahashi can eat.\n\nSample Input 1\n\n3 1 4\n\nSample Output 1\n\n5\n\nWe can eat all tasty cookies, in the following order:\n\nA tasty cookie containing poison\n\nAn untasty cookie containing antidotes\n\nA tasty cookie containing poison\n\nA tasty cookie containing antidotes\n\nA tasty cookie containing poison\n\nAn untasty cookie containing antidotes\n\nA tasty cookie containing poison\n\nSample Input 2\n\n5 2 9\n\nSample Output 2\n\n10\n\nSample Input 3\n\n8 8 1\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": 185, "cpu_time_ms": 101, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s231007709", "group_id": "codeNet:p03186", "input_text": "#include<stdio.h>\n#include<stdlib.h>\n\nint main(void){\n  int a, b, c;\n  int total=0;\n\n  scanf(\"%d %d %d\", &a, &b, &c);\n  while((a+b+1) < c){\n    c -= 1;\n  }\n  total = b + c;\n  printf(\"%d\\n\", total);\n  return 0;\n}\n", "language": "C", "metadata": {"date": 1546489294, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "problem_description_relpath": "problem_descriptions/p03186.html", "problem_id": "p03186", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03186/input.txt", "sample_output_relpath": "derived/input_output/data/p03186/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03186/C/s231007709.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s231007709", "user_id": "u598995109"}, "prompt_components": {"gold_output": "5\n", "input_to_evaluate": "#include<stdio.h>\n#include<stdlib.h>\n\nint main(void){\n  int a, b, c;\n  int total=0;\n\n  scanf(\"%d %d %d\", &a, &b, &c);\n  while((a+b+1) < c){\n    c -= 1;\n  }\n  total = b + c;\n  printf(\"%d\\n\", total);\n  return 0;\n}\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nTakahashi has A untasty cookies containing antidotes, B tasty cookies containing antidotes and C tasty cookies containing poison.\n\nEating a cookie containing poison results in a stomachache, and eating a cookie containing poison while having a stomachache results in a death.\nAs he wants to live, he cannot eat one in such a situation.\nEating a cookie containing antidotes while having a stomachache cures it, and there is no other way to cure stomachaches.\n\nFind the maximum number of tasty cookies that Takahashi can eat.\n\nConstraints\n\n0 \\leq A,B,C \\leq 10^9\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 the maximum number of tasty cookies that Takahashi can eat.\n\nSample Input 1\n\n3 1 4\n\nSample Output 1\n\n5\n\nWe can eat all tasty cookies, in the following order:\n\nA tasty cookie containing poison\n\nAn untasty cookie containing antidotes\n\nA tasty cookie containing poison\n\nA tasty cookie containing antidotes\n\nA tasty cookie containing poison\n\nAn untasty cookie containing antidotes\n\nA tasty cookie containing poison\n\nSample Input 2\n\n5 2 9\n\nSample Output 2\n\n10\n\nSample Input 3\n\n8 8 1\n\nSample Output 3\n\n9", "sample_input": "3 1 4\n"}, "reference_outputs": ["5\n"], "source_document_id": "p03186", "source_text": "Score : 200 points\n\nProblem Statement\n\nTakahashi has A untasty cookies containing antidotes, B tasty cookies containing antidotes and C tasty cookies containing poison.\n\nEating a cookie containing poison results in a stomachache, and eating a cookie containing poison while having a stomachache results in a death.\nAs he wants to live, he cannot eat one in such a situation.\nEating a cookie containing antidotes while having a stomachache cures it, and there is no other way to cure stomachaches.\n\nFind the maximum number of tasty cookies that Takahashi can eat.\n\nConstraints\n\n0 \\leq A,B,C \\leq 10^9\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 the maximum number of tasty cookies that Takahashi can eat.\n\nSample Input 1\n\n3 1 4\n\nSample Output 1\n\n5\n\nWe can eat all tasty cookies, in the following order:\n\nA tasty cookie containing poison\n\nAn untasty cookie containing antidotes\n\nA tasty cookie containing poison\n\nA tasty cookie containing antidotes\n\nA tasty cookie containing poison\n\nAn untasty cookie containing antidotes\n\nA tasty cookie containing poison\n\nSample Input 2\n\n5 2 9\n\nSample Output 2\n\n10\n\nSample Input 3\n\n8 8 1\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": 212, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s246198262", "group_id": "codeNet:p03188", "input_text": "#include<stdio.h>\n#include<string.h>\n#include<stdlib.h>\nint main() {\n\tlong long int  N, s[1005][1005] = {},p=2;\n\tscanf(\"%lld\", &N);\n  \tprintf(\"%lld\\n\", N);\n\tfor (int i = 1; i <= N; i++) {\n\t\tfor (int j = 1; j <= N; j++) {\n\t\t\tprintf(\"%d \", i);\n\t\t}\n      \tprintf(\"\\n\");\n\t}\n}", "language": "C", "metadata": {"date": 1546142493, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "problem_description_relpath": "problem_descriptions/p03188.html", "problem_id": "p03188", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03188/input.txt", "sample_output_relpath": "derived/input_output/data/p03188/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03188/C/s246198262.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s246198262", "user_id": "u018872912"}, "prompt_components": {"gold_output": "3\n1 1 1\n1 1 1\n2 2 2\n", "input_to_evaluate": "#include<stdio.h>\n#include<string.h>\n#include<stdlib.h>\nint main() {\n\tlong long int  N, s[1005][1005] = {},p=2;\n\tscanf(\"%lld\", &N);\n  \tprintf(\"%lld\\n\", N);\n\tfor (int i = 1; i <= N; i++) {\n\t\tfor (int j = 1; j <= N; j++) {\n\t\t\tprintf(\"%d \", i);\n\t\t}\n      \tprintf(\"\\n\");\n\t}\n}", "problem_context": "Score : 1000 points\n\nProblem Statement\n\nFor an n \\times n grid, let (r, c) denote the square at the (r+1)-th row from the top and the (c+1)-th column from the left.\nA good coloring of this grid using K colors is a coloring that satisfies the following:\n\nEach square is painted in one of the K colors.\n\nEach of the K colors is used for some squares.\n\nLet us number the K colors 1, 2, ..., K. For any colors i and j (1 \\leq i \\leq K, 1 \\leq j \\leq K), every square in Color i has the same number of adjacent squares in Color j. Here, the squares adjacent to square (r, c) are ((r-1)\\; mod\\; n, c), ((r+1)\\; mod\\; n, c), (r, (c-1)\\; mod\\; n) and (r, (c+1)\\; mod\\; n) (if the same square appears multiple times among these four, the square is counted that number of times).\n\nGiven K, choose n between 1 and 500 (inclusive) freely and construct a good coloring of an n \\times n grid using K colors.\nIt can be proved that this is always possible under the constraints of this problem,\n\nConstraints\n\n1 \\leq K \\leq 1000\n\nInput\n\nInput is given from Standard Input in the following format:\n\nK\n\nOutput\n\nOutput should be in the following format:\n\nn\nc_{0,0} c_{0,1} ... c_{0,n-1}\nc_{1,0} c_{1,1} ... c_{1,n-1}\n:\nc_{n-1,0} c_{n-1,1} ... c_{n-1,n-1}\n\nn should represent the size of the grid, and 1 \\leq n \\leq 500 must hold.\nc_{r,c} should be an integer such that 1 \\leq c_{r,c} \\leq K and represent the color for the square (r, c).\n\nSample Input 1\n\n2\n\nSample Output 1\n\n3\n1 1 1\n1 1 1\n2 2 2\n\nEvery square in Color 1 has three adjacent squares in Color 1 and one adjacent square in Color 2.\n\nEvery square in Color 2 has two adjacent squares in Color 1 and two adjacent squares in Color 2.\n\nOutput such as the following will be judged incorrect:\n\n2\n1 2\n2 2\n\n3\n1 1 1\n1 1 1\n1 1 1\n\nSample Input 2\n\n9\n\nSample Output 2\n\n3\n1 2 3\n4 5 6\n7 8 9", "sample_input": "2\n"}, "reference_outputs": ["3\n1 1 1\n1 1 1\n2 2 2\n"], "source_document_id": "p03188", "source_text": "Score : 1000 points\n\nProblem Statement\n\nFor an n \\times n grid, let (r, c) denote the square at the (r+1)-th row from the top and the (c+1)-th column from the left.\nA good coloring of this grid using K colors is a coloring that satisfies the following:\n\nEach square is painted in one of the K colors.\n\nEach of the K colors is used for some squares.\n\nLet us number the K colors 1, 2, ..., K. For any colors i and j (1 \\leq i \\leq K, 1 \\leq j \\leq K), every square in Color i has the same number of adjacent squares in Color j. Here, the squares adjacent to square (r, c) are ((r-1)\\; mod\\; n, c), ((r+1)\\; mod\\; n, c), (r, (c-1)\\; mod\\; n) and (r, (c+1)\\; mod\\; n) (if the same square appears multiple times among these four, the square is counted that number of times).\n\nGiven K, choose n between 1 and 500 (inclusive) freely and construct a good coloring of an n \\times n grid using K colors.\nIt can be proved that this is always possible under the constraints of this problem,\n\nConstraints\n\n1 \\leq K \\leq 1000\n\nInput\n\nInput is given from Standard Input in the following format:\n\nK\n\nOutput\n\nOutput should be in the following format:\n\nn\nc_{0,0} c_{0,1} ... c_{0,n-1}\nc_{1,0} c_{1,1} ... c_{1,n-1}\n:\nc_{n-1,0} c_{n-1,1} ... c_{n-1,n-1}\n\nn should represent the size of the grid, and 1 \\leq n \\leq 500 must hold.\nc_{r,c} should be an integer such that 1 \\leq c_{r,c} \\leq K and represent the color for the square (r, c).\n\nSample Input 1\n\n2\n\nSample Output 1\n\n3\n1 1 1\n1 1 1\n2 2 2\n\nEvery square in Color 1 has three adjacent squares in Color 1 and one adjacent square in Color 2.\n\nEvery square in Color 2 has two adjacent squares in Color 1 and two adjacent squares in Color 2.\n\nOutput such as the following will be judged incorrect:\n\n2\n1 2\n2 2\n\n3\n1 1 1\n1 1 1\n1 1 1\n\nSample Input 2\n\n9\n\nSample Output 2\n\n3\n1 2 3\n4 5 6\n7 8 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": 271, "cpu_time_ms": 76, "memory_kb": 3968}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s394453421", "group_id": "codeNet:p03194", "input_text": "#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\n\nint main(int argc, char *argv)\n{\n    long long n, p;\n\n    long long maxCommon; \n    long long maxN;\n    long long i;\n    long long num;\n\n    scanf(\"%lld %lld\", &n, &p);\n\n    maxCommon = 1;\n    maxN = pow(p, 1/((double)n));\n\n    // i = 2のとき\n    while (1) {\n        num = pow(maxCommon * 2, n);\n\n        if (p % num == 0) {\n            maxCommon *= 2;\n        } else {\n            break;\n        }\n    }\n\n    i = 3;\n    while(i <= maxN) {\n        num = pow(maxCommon * i, n);\n        if (num > p) {break;}\n\n        if (p % num == 0) {\n            maxCommon *= i;\n        } else {\n            i += 2;\n        }\n    }\n\n    printf(\"%lld\\n\", maxCommon);\n     \n\n    return 0;\n}\n", "language": "C", "metadata": {"date": 1545532263, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "problem_description_relpath": "problem_descriptions/p03194.html", "problem_id": "p03194", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03194/input.txt", "sample_output_relpath": "derived/input_output/data/p03194/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03194/C/s394453421.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s394453421", "user_id": "u676699191"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\n\nint main(int argc, char *argv)\n{\n    long long n, p;\n\n    long long maxCommon; \n    long long maxN;\n    long long i;\n    long long num;\n\n    scanf(\"%lld %lld\", &n, &p);\n\n    maxCommon = 1;\n    maxN = pow(p, 1/((double)n));\n\n    // i = 2のとき\n    while (1) {\n        num = pow(maxCommon * 2, n);\n\n        if (p % num == 0) {\n            maxCommon *= 2;\n        } else {\n            break;\n        }\n    }\n\n    i = 3;\n    while(i <= maxN) {\n        num = pow(maxCommon * i, n);\n        if (num > p) {break;}\n\n        if (p % num == 0) {\n            maxCommon *= i;\n        } else {\n            i += 2;\n        }\n    }\n\n    printf(\"%lld\\n\", maxCommon);\n     \n\n    return 0;\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": "p03194", "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": 735, "cpu_time_ms": 2103, "memory_kb": 384}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s130929082", "group_id": "codeNet:p03200", "input_text": "#include <stdio.h>\n\nint main(){\n   char s[200001];\n   int i,j,a;\n    \n   scanf(\"%s\",s);\n   for (i=a=0;s[i]!='\\0';i++)\n      if (s[i]=='B') {\n         for (j=i+1;s[j]=='B';j++);\n         if (s[j]=='W') {\n            s[j]='B';\n            s[i]='W';\n            a+=j-i;\n         } else break;\n      }\n   printf(\"%d\\n\",a);\n   return 0;\n}\n", "language": "C", "metadata": {"date": 1544926395, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "problem_description_relpath": "problem_descriptions/p03200.html", "problem_id": "p03200", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03200/input.txt", "sample_output_relpath": "derived/input_output/data/p03200/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03200/C/s130929082.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s130929082", "user_id": "u337657882"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "#include <stdio.h>\n\nint main(){\n   char s[200001];\n   int i,j,a;\n    \n   scanf(\"%s\",s);\n   for (i=a=0;s[i]!='\\0';i++)\n      if (s[i]=='B') {\n         for (j=i+1;s[j]=='B';j++);\n         if (s[j]=='W') {\n            s[j]='B';\n            s[i]='W';\n            a+=j-i;\n         } else break;\n      }\n   printf(\"%d\\n\",a);\n   return 0;\n}\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere are N Reversi pieces arranged in a row. (A Reversi piece is a disc with a black side and a white side.)\nThe state of each piece is represented by a string S of length N.\nIf S_i=B, the i-th piece from the left is showing black;\nIf S_i=W, the i-th piece from the left is showing white.\n\nConsider performing the following operation:\n\nChoose i (1 \\leq i < N) such that the i-th piece from the left is showing black and the (i+1)-th piece from the left is showing white, then flip both of those pieces. That is, the i-th piece from the left is now showing white and the (i+1)-th piece from the left is now showing black.\n\nFind the maximum possible number of times this operation can be performed.\n\nConstraints\n\n1 \\leq |S| \\leq 2\\times 10^5\n\nS_i=B or W\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the maximum possible number of times the operation can be performed.\n\nSample Input 1\n\nBBW\n\nSample Output 1\n\n2\n\nThe operation can be performed twice, as follows:\n\nFlip the second and third pieces from the left.\n\nFlip the first and second pieces from the left.\n\nSample Input 2\n\nBWBWBW\n\nSample Output 2\n\n6", "sample_input": "BBW\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03200", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere are N Reversi pieces arranged in a row. (A Reversi piece is a disc with a black side and a white side.)\nThe state of each piece is represented by a string S of length N.\nIf S_i=B, the i-th piece from the left is showing black;\nIf S_i=W, the i-th piece from the left is showing white.\n\nConsider performing the following operation:\n\nChoose i (1 \\leq i < N) such that the i-th piece from the left is showing black and the (i+1)-th piece from the left is showing white, then flip both of those pieces. That is, the i-th piece from the left is now showing white and the (i+1)-th piece from the left is now showing black.\n\nFind the maximum possible number of times this operation can be performed.\n\nConstraints\n\n1 \\leq |S| \\leq 2\\times 10^5\n\nS_i=B or W\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the maximum possible number of times the operation can be performed.\n\nSample Input 1\n\nBBW\n\nSample Output 1\n\n2\n\nThe operation can be performed twice, as follows:\n\nFlip the second and third pieces from the left.\n\nFlip the first and second pieces from the left.\n\nSample Input 2\n\nBWBWBW\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": 334, "cpu_time_ms": 2103, "memory_kb": 384}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s105983485", "group_id": "codeNet:p03201", "input_text": "#if 0\ncat <<EOF >mistaken-paste\n#endif\n// thanks for @rsk0315_h4x\n\n#pragma GCC diagnostic ignored \"-Wincompatible-pointer-types\"\n#define _USE_MATH_DEFINES\n\n#include <stdio.h>\n#include <stdint.h>\n#include <stdlib.h>\n#include <string.h>\n#include <stdbool.h>\n#include <math.h>\n#include <time.h>\n\n#define BIG 2000000007\n#define VERYBIG 2000000000000007LL\n\n#define MOD 1000000007\n#define FOD  998244353\ntypedef uint64_t ull;\ntypedef  int64_t sll;\n\n#define N_MAX 1000000\n\n#ifdef __cplusplus\n#include <queue>\n#include <stack>\n#include <tuple>\n#include <set>\n#include <map>\n#include <string>\n#include <algorithm>\n#include <functional>\n#include <array>\n\nusing std::queue;\nusing std::priority_queue;\nusing std::stack;\nusing std::tuple;\nusing std::set;\nusing std::map;\nusing std::vector;\nusing std::greater;\nusing std::pair;\nusing std::string;\nusing std::get;\n\ntemplate <typename T, typename U>\npair<T, U> operator+(pair<T, U> l, pair<T, U> r) {\n\treturn pair<T, U>(l.first + r.first, l.second + r.second);\n}\n\n#endif\n\ntypedef struct {\n\tint32_t a;\n\tint32_t b;\n} hw;\n\ntypedef struct {\n\tsll a;\n\tsll b;\n} hwll;\n\ntypedef struct {\n\tsll a;\n\tsll b;\n\tsll c;\n} hwllc;\n\ntypedef struct {\n\thwll a;\n\thwll b;\n} linell;\n\null n, m;\null h, w;\null k;\null q;\nsll va, vb, vc, vd, ve, vf;\null ua, ub, uc, ud, ue, uf;\nlong double vra, vrb, vrc;\ndouble vda, vdb, vdc;\nchar ch, dh;\n\null umin (ull x, ull y) {\n\treturn (x < y) ? x : y;\n}\n\null umax (ull x, ull y) {\n\treturn (x > y) ? x : y;\n}\n\nsll smin (sll x, sll y) {\n\treturn (x < y) ? x : y;\n}\n\nsll smax (sll x, sll y) {\n\treturn (x > y) ? x : y;\n}\n\null gcd (ull x, ull y) {\n\tif (x < y) {\n\t\treturn gcd(y, x);\n\t} else if (y == 0) {\n\t\treturn x;\n\t} else {\n\t\treturn gcd(y, x % y);\n\t}\n}\n\null bitpow (ull a, ull x, ull modulo) {\n\tull result = 1;\n\twhile (x) {\n\t\tif (x & 1) {\n\t\t\tresult *= a;\n\t\t\tresult %= modulo;\n\t\t}\n\t\tx /= 2;\n\t\ta = (a * a) % modulo;\n\t}\n\treturn result;\n}\n\null divide (ull a, ull b, ull modulo) {\n\treturn (a * bitpow(b, modulo - 2, modulo)) % modulo;\n}\n\null udiff (ull a, ull b) {\n\tif (a >= b) {\n\t\treturn a - b;\n\t} else {\n\t\treturn b - a;\n\t}\n}\n\nsll sdiff (sll a, sll b) {\n\tif (a >= b) {\n\t\treturn a - b;\n\t} else {\n\t\treturn b - a;\n\t}\n}\n\nint bitcount (ull n) {\n\tint result = 0;\n\twhile (n) {\n\t\tif (n & 1) result++;\n\t\tn /= 2;\n\t}\n\treturn result;\n}\n\n#define BEGCMP(NAME) int32_t NAME (const void *left, const void *right)\n#define DEFLR(TYPE) TYPE l=*(TYPE*)left,r=*(TYPE*)right\n#define CMPRET(L, R) if((L)<(R))return-1;if((L)>(R))return+1\n\n// int32_t pullcomp (const void *left, const void *right) {\n// \tull l = *(ull*)left;\n// \tull r = *(ull*)right;\n// \tif (l < r) {\n// \t\treturn -1;\n// \t}\n// \tif (l > r) {\n// \t\treturn +1;\n// \t}\n// \treturn 0;\n// }\nBEGCMP(pullcomp){\n\tDEFLR(ull);\n\tCMPRET(l, r);\n\treturn 0;\n}\nBEGCMP(prevcomp){\n\tDEFLR(ull);\n\tCMPRET(r, l);\n\treturn 0;\n}\nBEGCMP(psllcomp){\n\tDEFLR(sll);\n\tCMPRET(l, r);\n\treturn 0;\n}\nBEGCMP(pcharcomp){\n\tDEFLR(char);\n\tCMPRET(l, r);\n\treturn 0;\n}\nBEGCMP(pdoublecomp){\n\tDEFLR(double);\n\tCMPRET(l, r);\n\treturn 0;\n}\n\nint32_t pstrcomp (const void *left, const void *right) {\n\tchar* l = *(char**)left;\n\tchar* r = *(char**)right;\n\n\treturn strcmp(l, r);\n}\n\nBEGCMP(phwllABcomp){\n\tDEFLR(hwll);\n\tCMPRET(l.a, r.a);\n\tCMPRET(l.b, r.b);\n\treturn 0;\n}\nBEGCMP(phwllREVcomp){\n\tDEFLR(hwll);\n\tCMPRET(l.b, r.b);\n\tCMPRET(l.a, r.a);\n\treturn 0;\n}\nBEGCMP(ptriplecomp){\n\tDEFLR(hwllc);\n\tCMPRET(l.a, r.a);\n\tCMPRET(l.b, r.b);\n\tCMPRET(l.c, r.c);\n\treturn 0;\n}\nBEGCMP(ptripleREVcomp){\n\tDEFLR(hwllc);\n\tCMPRET(l.b, r.b);\n\tCMPRET(l.a, r.a);\n\tCMPRET(l.c, r.c);\n\treturn 0;\n}\n\nint32_t pquadcomp (const void *left, const void *right) {\n\tlinell l = *(linell*)left;\n\tlinell r = *(linell*)right;\n\n\tsll ac = phwllABcomp(&(l.a), &(r.a));\n\tif (ac) return ac;\n\tsll bc = phwllABcomp(&(l.b), &(r.b));\n\tif (bc) return bc;\n\n\treturn 0;\n}\n\nbool isinrange (sll left, sll x, sll right) {\n\treturn (left <= x && x <= right);\n}\n\nbool isinrange_soft (sll left, sll x, sll right) {\n\treturn (left <= x && x <= right) || (left >= x && x >= right);\n}\n\nsll a[N_MAX + 5];\n// ull a[N_MAX + 5];\n// sll a[3001][3001];\nsll b[N_MAX + 5];\n// ull b[N_MAX + 5];\n// sll b[3001][3001];\null c[N_MAX + 5];\null d[N_MAX + 5];\nsll e[N_MAX];\nchar s[N_MAX + 1];\n// char s[3010][3010];\nchar t[N_MAX + 1];\n// char t[3010][3010];\n// char u[N_MAX + 1];\nhwll xy[N_MAX + 5];\nhwllc tup[N_MAX + 5];\nsll table[3000][3000];\n// here we go\n\nsll find (ull ok, ull ng, ull x) {\n\twhile (ok + 1 < ng) {\n\t\tull med = (ok + ng) / 2;\n\t\tif (tup[med].b <= x) {\n\t\t\tok = med;\n\t\t} else {\n\t\t\tng = med;\n\t\t}\n\t}\n\tif (tup[ok].b == x) {\n\t\treturn ok;\n\t} else {\n\t\treturn -1;\n\t}\n}\n\null f (ull x) {\n\tif (x & 1) return 0;\n\treturn f(x >> 1) + 1;\n}\null g (ull x) {\n\tull b = 1;\n\twhile (b <= x) b <<= 1;\n\n\treturn (b - 1) - x;\n}\n\null solve () {\n\tsll i, j, ki, li;\n\t// ull result = 0;\n\tsll result = 0;\n\tdouble dresult = 0;\n\t// ull maybe = 0;\n\tsll maybe = 0;\n\t// ull sum = 0;\n\tsll sum = 0;\n\tsll item;\n\tull *dpcell;\n\n\tfor (i = 0; i < n; i++) {\n\t\tull s = f(a[i]);\n\t\txy[i] = (hwll){s, (a[i] >> (s + 1))};\n\t}\n\tqsort(xy, n, sizeof(hwll), phwllABcomp);\n\tki = 0;\n\ti = 0;\n\twhile (i < n) {\n\t\tj = i;\n\t\twhile (i < n && xy[i].b == xy[j].b && xy[i].a == xy[j].a) i++;\n\n\t\tull cnt = i - j;\n\t\ttup[ki++] = (hwllc){xy[j].a, xy[j].b, cnt};\n\t}\n\n\n\ti = 0;\n\twhile (i < ki) {\n\t\tj = i;\n\t\twhile (i < ki && tup[i].a == tup[j].a) i++;\n\n\t\t// for (li = i - 1; li >= j; li--) {\n\n\t\t// \tprintf(\"%llu, %llu, %llu\\n\", tup[li].a, tup[li].b, tup[li].c);\n\t\t// }\n\n\n\t\tli = i;\n\t\twhile (--li >= j) {\n\t\t\tif (tup[li].c <= 0) continue;\n\t\t\tif (tup[li].b <= 0) break;\n\t\t\tsll x = find(j, i, g(tup[li].b));\n\t\t\tif (x < 0) continue;\n\n\t\t\tresult += smin(tup[x].c, tup[li].c);\n\t\t\ttup[x].c -= smin(tup[x].c, tup[li].c);\n\n\n\t\t\t// printf(\"%llu..\\n\", result);\n\t\t}\n\t}\n\n\tprintf(\"%lld\\n\", result);\n\t// printf(\"%.15lf\\n\", dresult);\n\t// puts(s);\n\n\treturn 0;\n\n\tsuccess:\n\t// puts(\"YES\");\n\tputs(\"Yes\");\n\t// printf(\"%llu\\n\", result);\n\t// puts(\"0\");\n\t// puts(\"Yay!\");\n\treturn 0;\n\n\tfail:\n\t// puts(\"NO\");\n\t// puts(\"No\");\n\t// puts(\"0\");\n\tputs(\"-1\");\n\t// puts(\"-1 -1 -1\");\n\t// puts(\"Impossible\");\n\treturn 1;\n}\n\nint32_t main (void) {\n\tint32_t i, j;\n\tint32_t x, y;\n\n\n\n\t// scanf(\"%llu%llu\", &h, &w);\n\tscanf(\"%llu\", &n, &m);\n\t// scanf(\"%llu\", &k, &n, &m);\n\t// scanf(\"%llu%llu\", &h, &w);\n\t// scanf(\"%llu\", &q);\n\t// scanf(\"%s\", s);\n\t// scanf(\"%lld%lld\", &va, &vb, &vc, &vd);\n\t// scanf(\"%llu%llu%llu\", &ua, &ub, &uc, &ud);\n\t// scanf(\"%s\", t);\n\t// scanf(\"%lld\", &m);\n\tfor (i = 0; i < n; i++) {\n\t\t// scanf(\"%lld%lld\", &xy[i].a, &xy[i].b);\n\t\t// scanf(\"%lld%lld%lld\", &tup[i].a, &tup[i].b, &tup[i].c);\n\t\tscanf(\"%lld\", &a[i]);\n\t\t// scanf(\"%lld\", &b[i]);\n\t\t// scanf(\"%lld\", &c[i]);\n\t\t// scanf(\"%lld\", &d[i]);\n\t\t// a[i]--;\n\t\t// b[i]--;\n\t\t// c[i]--;\n\t\t// d[i]--;\n\t\t// tup[i].a--;\n\t\t// tup[i].b--;\n\t}\n\t// scanf(\"%llu\", &m, &k);\n\t// scanf(\"%llu\", &q);\n\t// scanf(\"%s\", s);\n\t// for (i = 0; i < n; i++) {\n\t// \tscanf(\"%llu\", &c[i]);\n\t// \t// c[i]--;\n\t// }\n\t// scanf(\"%llu\", &q);\n\n\n\n\t// for (i = 0; i < h; i++) {\n\t// \tfor (j = 0; j < w; j++) {\n\t// \t\tscanf(\"%lld\", &table[i][j]);\n\t// \t\t// table[i][j]--;\n\t// \t}\n\t// }\n\t// for (i = 0; i < h; i++) {\n\t// \tscanf(\"%s\", s[i]);\n\t// }\n\t// scanf(\"%llu\", &q);\n\n\tsolve();\n\n\treturn 0;\n}\n", "language": "C", "metadata": {"date": 1544929192, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "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/C/s105983485.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s105983485", "user_id": "u238041222"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "#if 0\ncat <<EOF >mistaken-paste\n#endif\n// thanks for @rsk0315_h4x\n\n#pragma GCC diagnostic ignored \"-Wincompatible-pointer-types\"\n#define _USE_MATH_DEFINES\n\n#include <stdio.h>\n#include <stdint.h>\n#include <stdlib.h>\n#include <string.h>\n#include <stdbool.h>\n#include <math.h>\n#include <time.h>\n\n#define BIG 2000000007\n#define VERYBIG 2000000000000007LL\n\n#define MOD 1000000007\n#define FOD  998244353\ntypedef uint64_t ull;\ntypedef  int64_t sll;\n\n#define N_MAX 1000000\n\n#ifdef __cplusplus\n#include <queue>\n#include <stack>\n#include <tuple>\n#include <set>\n#include <map>\n#include <string>\n#include <algorithm>\n#include <functional>\n#include <array>\n\nusing std::queue;\nusing std::priority_queue;\nusing std::stack;\nusing std::tuple;\nusing std::set;\nusing std::map;\nusing std::vector;\nusing std::greater;\nusing std::pair;\nusing std::string;\nusing std::get;\n\ntemplate <typename T, typename U>\npair<T, U> operator+(pair<T, U> l, pair<T, U> r) {\n\treturn pair<T, U>(l.first + r.first, l.second + r.second);\n}\n\n#endif\n\ntypedef struct {\n\tint32_t a;\n\tint32_t b;\n} hw;\n\ntypedef struct {\n\tsll a;\n\tsll b;\n} hwll;\n\ntypedef struct {\n\tsll a;\n\tsll b;\n\tsll c;\n} hwllc;\n\ntypedef struct {\n\thwll a;\n\thwll b;\n} linell;\n\null n, m;\null h, w;\null k;\null q;\nsll va, vb, vc, vd, ve, vf;\null ua, ub, uc, ud, ue, uf;\nlong double vra, vrb, vrc;\ndouble vda, vdb, vdc;\nchar ch, dh;\n\null umin (ull x, ull y) {\n\treturn (x < y) ? x : y;\n}\n\null umax (ull x, ull y) {\n\treturn (x > y) ? x : y;\n}\n\nsll smin (sll x, sll y) {\n\treturn (x < y) ? x : y;\n}\n\nsll smax (sll x, sll y) {\n\treturn (x > y) ? x : y;\n}\n\null gcd (ull x, ull y) {\n\tif (x < y) {\n\t\treturn gcd(y, x);\n\t} else if (y == 0) {\n\t\treturn x;\n\t} else {\n\t\treturn gcd(y, x % y);\n\t}\n}\n\null bitpow (ull a, ull x, ull modulo) {\n\tull result = 1;\n\twhile (x) {\n\t\tif (x & 1) {\n\t\t\tresult *= a;\n\t\t\tresult %= modulo;\n\t\t}\n\t\tx /= 2;\n\t\ta = (a * a) % modulo;\n\t}\n\treturn result;\n}\n\null divide (ull a, ull b, ull modulo) {\n\treturn (a * bitpow(b, modulo - 2, modulo)) % modulo;\n}\n\null udiff (ull a, ull b) {\n\tif (a >= b) {\n\t\treturn a - b;\n\t} else {\n\t\treturn b - a;\n\t}\n}\n\nsll sdiff (sll a, sll b) {\n\tif (a >= b) {\n\t\treturn a - b;\n\t} else {\n\t\treturn b - a;\n\t}\n}\n\nint bitcount (ull n) {\n\tint result = 0;\n\twhile (n) {\n\t\tif (n & 1) result++;\n\t\tn /= 2;\n\t}\n\treturn result;\n}\n\n#define BEGCMP(NAME) int32_t NAME (const void *left, const void *right)\n#define DEFLR(TYPE) TYPE l=*(TYPE*)left,r=*(TYPE*)right\n#define CMPRET(L, R) if((L)<(R))return-1;if((L)>(R))return+1\n\n// int32_t pullcomp (const void *left, const void *right) {\n// \tull l = *(ull*)left;\n// \tull r = *(ull*)right;\n// \tif (l < r) {\n// \t\treturn -1;\n// \t}\n// \tif (l > r) {\n// \t\treturn +1;\n// \t}\n// \treturn 0;\n// }\nBEGCMP(pullcomp){\n\tDEFLR(ull);\n\tCMPRET(l, r);\n\treturn 0;\n}\nBEGCMP(prevcomp){\n\tDEFLR(ull);\n\tCMPRET(r, l);\n\treturn 0;\n}\nBEGCMP(psllcomp){\n\tDEFLR(sll);\n\tCMPRET(l, r);\n\treturn 0;\n}\nBEGCMP(pcharcomp){\n\tDEFLR(char);\n\tCMPRET(l, r);\n\treturn 0;\n}\nBEGCMP(pdoublecomp){\n\tDEFLR(double);\n\tCMPRET(l, r);\n\treturn 0;\n}\n\nint32_t pstrcomp (const void *left, const void *right) {\n\tchar* l = *(char**)left;\n\tchar* r = *(char**)right;\n\n\treturn strcmp(l, r);\n}\n\nBEGCMP(phwllABcomp){\n\tDEFLR(hwll);\n\tCMPRET(l.a, r.a);\n\tCMPRET(l.b, r.b);\n\treturn 0;\n}\nBEGCMP(phwllREVcomp){\n\tDEFLR(hwll);\n\tCMPRET(l.b, r.b);\n\tCMPRET(l.a, r.a);\n\treturn 0;\n}\nBEGCMP(ptriplecomp){\n\tDEFLR(hwllc);\n\tCMPRET(l.a, r.a);\n\tCMPRET(l.b, r.b);\n\tCMPRET(l.c, r.c);\n\treturn 0;\n}\nBEGCMP(ptripleREVcomp){\n\tDEFLR(hwllc);\n\tCMPRET(l.b, r.b);\n\tCMPRET(l.a, r.a);\n\tCMPRET(l.c, r.c);\n\treturn 0;\n}\n\nint32_t pquadcomp (const void *left, const void *right) {\n\tlinell l = *(linell*)left;\n\tlinell r = *(linell*)right;\n\n\tsll ac = phwllABcomp(&(l.a), &(r.a));\n\tif (ac) return ac;\n\tsll bc = phwllABcomp(&(l.b), &(r.b));\n\tif (bc) return bc;\n\n\treturn 0;\n}\n\nbool isinrange (sll left, sll x, sll right) {\n\treturn (left <= x && x <= right);\n}\n\nbool isinrange_soft (sll left, sll x, sll right) {\n\treturn (left <= x && x <= right) || (left >= x && x >= right);\n}\n\nsll a[N_MAX + 5];\n// ull a[N_MAX + 5];\n// sll a[3001][3001];\nsll b[N_MAX + 5];\n// ull b[N_MAX + 5];\n// sll b[3001][3001];\null c[N_MAX + 5];\null d[N_MAX + 5];\nsll e[N_MAX];\nchar s[N_MAX + 1];\n// char s[3010][3010];\nchar t[N_MAX + 1];\n// char t[3010][3010];\n// char u[N_MAX + 1];\nhwll xy[N_MAX + 5];\nhwllc tup[N_MAX + 5];\nsll table[3000][3000];\n// here we go\n\nsll find (ull ok, ull ng, ull x) {\n\twhile (ok + 1 < ng) {\n\t\tull med = (ok + ng) / 2;\n\t\tif (tup[med].b <= x) {\n\t\t\tok = med;\n\t\t} else {\n\t\t\tng = med;\n\t\t}\n\t}\n\tif (tup[ok].b == x) {\n\t\treturn ok;\n\t} else {\n\t\treturn -1;\n\t}\n}\n\null f (ull x) {\n\tif (x & 1) return 0;\n\treturn f(x >> 1) + 1;\n}\null g (ull x) {\n\tull b = 1;\n\twhile (b <= x) b <<= 1;\n\n\treturn (b - 1) - x;\n}\n\null solve () {\n\tsll i, j, ki, li;\n\t// ull result = 0;\n\tsll result = 0;\n\tdouble dresult = 0;\n\t// ull maybe = 0;\n\tsll maybe = 0;\n\t// ull sum = 0;\n\tsll sum = 0;\n\tsll item;\n\tull *dpcell;\n\n\tfor (i = 0; i < n; i++) {\n\t\tull s = f(a[i]);\n\t\txy[i] = (hwll){s, (a[i] >> (s + 1))};\n\t}\n\tqsort(xy, n, sizeof(hwll), phwllABcomp);\n\tki = 0;\n\ti = 0;\n\twhile (i < n) {\n\t\tj = i;\n\t\twhile (i < n && xy[i].b == xy[j].b && xy[i].a == xy[j].a) i++;\n\n\t\tull cnt = i - j;\n\t\ttup[ki++] = (hwllc){xy[j].a, xy[j].b, cnt};\n\t}\n\n\n\ti = 0;\n\twhile (i < ki) {\n\t\tj = i;\n\t\twhile (i < ki && tup[i].a == tup[j].a) i++;\n\n\t\t// for (li = i - 1; li >= j; li--) {\n\n\t\t// \tprintf(\"%llu, %llu, %llu\\n\", tup[li].a, tup[li].b, tup[li].c);\n\t\t// }\n\n\n\t\tli = i;\n\t\twhile (--li >= j) {\n\t\t\tif (tup[li].c <= 0) continue;\n\t\t\tif (tup[li].b <= 0) break;\n\t\t\tsll x = find(j, i, g(tup[li].b));\n\t\t\tif (x < 0) continue;\n\n\t\t\tresult += smin(tup[x].c, tup[li].c);\n\t\t\ttup[x].c -= smin(tup[x].c, tup[li].c);\n\n\n\t\t\t// printf(\"%llu..\\n\", result);\n\t\t}\n\t}\n\n\tprintf(\"%lld\\n\", result);\n\t// printf(\"%.15lf\\n\", dresult);\n\t// puts(s);\n\n\treturn 0;\n\n\tsuccess:\n\t// puts(\"YES\");\n\tputs(\"Yes\");\n\t// printf(\"%llu\\n\", result);\n\t// puts(\"0\");\n\t// puts(\"Yay!\");\n\treturn 0;\n\n\tfail:\n\t// puts(\"NO\");\n\t// puts(\"No\");\n\t// puts(\"0\");\n\tputs(\"-1\");\n\t// puts(\"-1 -1 -1\");\n\t// puts(\"Impossible\");\n\treturn 1;\n}\n\nint32_t main (void) {\n\tint32_t i, j;\n\tint32_t x, y;\n\n\n\n\t// scanf(\"%llu%llu\", &h, &w);\n\tscanf(\"%llu\", &n, &m);\n\t// scanf(\"%llu\", &k, &n, &m);\n\t// scanf(\"%llu%llu\", &h, &w);\n\t// scanf(\"%llu\", &q);\n\t// scanf(\"%s\", s);\n\t// scanf(\"%lld%lld\", &va, &vb, &vc, &vd);\n\t// scanf(\"%llu%llu%llu\", &ua, &ub, &uc, &ud);\n\t// scanf(\"%s\", t);\n\t// scanf(\"%lld\", &m);\n\tfor (i = 0; i < n; i++) {\n\t\t// scanf(\"%lld%lld\", &xy[i].a, &xy[i].b);\n\t\t// scanf(\"%lld%lld%lld\", &tup[i].a, &tup[i].b, &tup[i].c);\n\t\tscanf(\"%lld\", &a[i]);\n\t\t// scanf(\"%lld\", &b[i]);\n\t\t// scanf(\"%lld\", &c[i]);\n\t\t// scanf(\"%lld\", &d[i]);\n\t\t// a[i]--;\n\t\t// b[i]--;\n\t\t// c[i]--;\n\t\t// d[i]--;\n\t\t// tup[i].a--;\n\t\t// tup[i].b--;\n\t}\n\t// scanf(\"%llu\", &m, &k);\n\t// scanf(\"%llu\", &q);\n\t// scanf(\"%s\", s);\n\t// for (i = 0; i < n; i++) {\n\t// \tscanf(\"%llu\", &c[i]);\n\t// \t// c[i]--;\n\t// }\n\t// scanf(\"%llu\", &q);\n\n\n\n\t// for (i = 0; i < h; i++) {\n\t// \tfor (j = 0; j < w; j++) {\n\t// \t\tscanf(\"%lld\", &table[i][j]);\n\t// \t\t// table[i][j]--;\n\t// \t}\n\t// }\n\t// for (i = 0; i < h; i++) {\n\t// \tscanf(\"%s\", s[i]);\n\t// }\n\t// scanf(\"%llu\", &q);\n\n\tsolve();\n\n\treturn 0;\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": 7054, "cpu_time_ms": 81, "memory_kb": 18628}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s665802176", "group_id": "codeNet:p03201", "input_text": "#include <stdio.h>\n#include <stdlib.h>\n#include <string.h>\n#define ll long long\n#define rep(i,l,r)for(ll i=(l);i<(r);i++)\n#define repp(i,l,r,k)for(ll i=(l);i<(r);i+=(k))\n#define INF ((1LL<<62)-(1LL<<31))\n#define max(p,q)((p)>(q)?(p):(q))\n#define min(p,q)((p)<(q)?(p):(q))\n#define bit(n,m)(((n)>>(m))&1)\nint upll(const void*a, const void*b){return*(ll*)a<*(ll*)b?-1:*(ll*)a>*(ll*)b?1:0;}\nint downll(const void*a, const void*b){return*(ll*)a<*(ll*)b?1:*(ll*)a>*(ll*)b?-1:0;}\nvoid sortup(ll*a,int n){qsort(a,n,sizeof(ll),upll);}\nvoid sortdown(ll*a,int n){qsort(a,n,sizeof(ll),downll);}\nll pom(ll a,ll n,int m){ll x=1;for(a%=m;n;n/=2)n&1?x=x*a%m:0,a=a*a%m;return x;}\n//#define MOD 998244353\n#define MOD 1000000007\n#define invp(a,p)pom(a,p-2,p)\n\nint cmp(const void*a,const void*b){\n\tll aa=*(ll*)a;\n\tll bb=*(ll*)b;\n\tll aaa=aa&-aa;\n\tll bbb=bb&-bb;\n\tif(aaa<bbb)return -1;\n\tif(aaa>bbb)return 1;\n\tif(aa<bb)return -1;\n\treturn 1;\n}\n\nll n,ans;\nll a[200010];\nint flag[200010];\nint nibutan(int l,int r,int x){\n\t//x以下の最大のものを[l,r)で探す\n\tif(a[l]>x)return -1;\n\twhile(r-l>1){\n\t\tint m=(l+r)/2;\n\t\tif(a[m]<x)l=m;\n\t\telse if(a[m]>x)r=m;\n\t\telse if(flag[m])r=m;\n\t\telse l=m;\n\t}\n\treturn l;\n}\n\nint main(){\n\tscanf(\"%lld\",&n);\n\trep(i,0,n)scanf(\"%lld\",a+i);\n\tqsort(a,n,sizeof(ll),cmp);\n\tfor(int i=0;i<n;){\n\t\tint r=i;\n\t\tint t=a[i]&-a[i];\n\t\twhile((a[r]&-a[r])==t)r++;\n\t\t//[i,r)で組にする\n\t\tfor(int j=r-1;j>i;j--)if(!flag[j]){\n\t\t\t//a[j]と組に出来るものは、a[j]より真に大きい最小の2ベキをXとしてX-a[j]のみ\n\t\t\t//これを[i,j)でにぶたんして探す\n\t\t\tflag[j]=1;\n\t\t\tint x=1;\n\t\t\twhile(x<=a[j])x+=x;\n\t\t\tint idx=nibutan(i,r,x-a[j]);\n\t\t\tif(idx!=-1&&a[idx]+a[j]==x&&!flag[idx]){\n\t\t\t\tans++;\n\t\t\t\tflag[idx]=1;\n\t\t\t}\n\t\t}\n\t\ti=r;\n\t}\n\tprintf(\"%lld\",ans);\n}", "language": "C", "metadata": {"date": 1544926746, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "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/C/s665802176.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s665802176", "user_id": "u382163500"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "#include <stdio.h>\n#include <stdlib.h>\n#include <string.h>\n#define ll long long\n#define rep(i,l,r)for(ll i=(l);i<(r);i++)\n#define repp(i,l,r,k)for(ll i=(l);i<(r);i+=(k))\n#define INF ((1LL<<62)-(1LL<<31))\n#define max(p,q)((p)>(q)?(p):(q))\n#define min(p,q)((p)<(q)?(p):(q))\n#define bit(n,m)(((n)>>(m))&1)\nint upll(const void*a, const void*b){return*(ll*)a<*(ll*)b?-1:*(ll*)a>*(ll*)b?1:0;}\nint downll(const void*a, const void*b){return*(ll*)a<*(ll*)b?1:*(ll*)a>*(ll*)b?-1:0;}\nvoid sortup(ll*a,int n){qsort(a,n,sizeof(ll),upll);}\nvoid sortdown(ll*a,int n){qsort(a,n,sizeof(ll),downll);}\nll pom(ll a,ll n,int m){ll x=1;for(a%=m;n;n/=2)n&1?x=x*a%m:0,a=a*a%m;return x;}\n//#define MOD 998244353\n#define MOD 1000000007\n#define invp(a,p)pom(a,p-2,p)\n\nint cmp(const void*a,const void*b){\n\tll aa=*(ll*)a;\n\tll bb=*(ll*)b;\n\tll aaa=aa&-aa;\n\tll bbb=bb&-bb;\n\tif(aaa<bbb)return -1;\n\tif(aaa>bbb)return 1;\n\tif(aa<bb)return -1;\n\treturn 1;\n}\n\nll n,ans;\nll a[200010];\nint flag[200010];\nint nibutan(int l,int r,int x){\n\t//x以下の最大のものを[l,r)で探す\n\tif(a[l]>x)return -1;\n\twhile(r-l>1){\n\t\tint m=(l+r)/2;\n\t\tif(a[m]<x)l=m;\n\t\telse if(a[m]>x)r=m;\n\t\telse if(flag[m])r=m;\n\t\telse l=m;\n\t}\n\treturn l;\n}\n\nint main(){\n\tscanf(\"%lld\",&n);\n\trep(i,0,n)scanf(\"%lld\",a+i);\n\tqsort(a,n,sizeof(ll),cmp);\n\tfor(int i=0;i<n;){\n\t\tint r=i;\n\t\tint t=a[i]&-a[i];\n\t\twhile((a[r]&-a[r])==t)r++;\n\t\t//[i,r)で組にする\n\t\tfor(int j=r-1;j>i;j--)if(!flag[j]){\n\t\t\t//a[j]と組に出来るものは、a[j]より真に大きい最小の2ベキをXとしてX-a[j]のみ\n\t\t\t//これを[i,j)でにぶたんして探す\n\t\t\tflag[j]=1;\n\t\t\tint x=1;\n\t\t\twhile(x<=a[j])x+=x;\n\t\t\tint idx=nibutan(i,r,x-a[j]);\n\t\t\tif(idx!=-1&&a[idx]+a[j]==x&&!flag[idx]){\n\t\t\t\tans++;\n\t\t\t\tflag[idx]=1;\n\t\t\t}\n\t\t}\n\t\ti=r;\n\t}\n\tprintf(\"%lld\",ans);\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": 1765, "cpu_time_ms": 68, "memory_kb": 3324}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s869248359", "group_id": "codeNet:p03208", "input_text": "#include<stdio.h>\n#include<stdlib.h>\n#include<math.h>\n//q_dort(double,int,int);\n\nvoid q_sort(double numbers[], int left, int right)\n{\n    int l_hold, r_hold;\n    double pivot;\n\n    l_hold = left;\n    r_hold = right;\n    pivot = numbers[left];\n    while (left < right)\n    {\n        while ((numbers[right] >= pivot) && (left < right))\n            right--;\n        if (left != right)\n        {\n            numbers[left] = numbers[right];\n            left++;\n        }\n        while ((numbers[left] <= pivot) && (left < right))\n            left++;\n        if (left != right)\n        {\n            numbers[right] = numbers[left];\n            right--;\n        }\n    }\n    numbers[left] = pivot;\n    pivot = left;\n    left = l_hold;\n    right = r_hold;\n    if (left < pivot)\n        q_sort(numbers, left, pivot-1);\n    if (right > pivot)\n        q_sort(numbers, pivot+1, right);\n}\n\nint main(void){\n  int N,K,i,j,m;//,temp,min;\n  double temp,min;\n  double h[100000]={};\n  min=1000000000;\n  if(scanf(\"%d%d\",&N,&K)>2){\n    exit(1);\n  }\n  for(i=0;i<N;i++){\n    if(scanf(\"%lf\",&h[i])>1){\n    exit(1);\n  }\n  }  \n  /*\n  for(i=0; i<N; i++){\n    for(j=N-1; j>i; j--){\n      if(h[j] < h[j-1]){\n        temp = h[j];\n        h[j] = h[j-1];\n        h[j-1] = temp;\n      }\n    }\n  }\n  */\n  q_sort(h,0,N-1);\n  for(i=0;i<N-K+1;i++){\n    if(min>h[i+K-1]-h[i]){\n    min=h[i+K-1]-h[i];\n    if(min==0)break;\n  }\n  }\n  m=min;\n  printf(\"%d\",m);\n  return 0;\n}\n", "language": "C", "metadata": {"date": 1544324344, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "problem_description_relpath": "problem_descriptions/p03208.html", "problem_id": "p03208", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03208/input.txt", "sample_output_relpath": "derived/input_output/data/p03208/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03208/C/s869248359.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s869248359", "user_id": "u777320783"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "#include<stdio.h>\n#include<stdlib.h>\n#include<math.h>\n//q_dort(double,int,int);\n\nvoid q_sort(double numbers[], int left, int right)\n{\n    int l_hold, r_hold;\n    double pivot;\n\n    l_hold = left;\n    r_hold = right;\n    pivot = numbers[left];\n    while (left < right)\n    {\n        while ((numbers[right] >= pivot) && (left < right))\n            right--;\n        if (left != right)\n        {\n            numbers[left] = numbers[right];\n            left++;\n        }\n        while ((numbers[left] <= pivot) && (left < right))\n            left++;\n        if (left != right)\n        {\n            numbers[right] = numbers[left];\n            right--;\n        }\n    }\n    numbers[left] = pivot;\n    pivot = left;\n    left = l_hold;\n    right = r_hold;\n    if (left < pivot)\n        q_sort(numbers, left, pivot-1);\n    if (right > pivot)\n        q_sort(numbers, pivot+1, right);\n}\n\nint main(void){\n  int N,K,i,j,m;//,temp,min;\n  double temp,min;\n  double h[100000]={};\n  min=1000000000;\n  if(scanf(\"%d%d\",&N,&K)>2){\n    exit(1);\n  }\n  for(i=0;i<N;i++){\n    if(scanf(\"%lf\",&h[i])>1){\n    exit(1);\n  }\n  }  \n  /*\n  for(i=0; i<N; i++){\n    for(j=N-1; j>i; j--){\n      if(h[j] < h[j-1]){\n        temp = h[j];\n        h[j] = h[j-1];\n        h[j-1] = temp;\n      }\n    }\n  }\n  */\n  q_sort(h,0,N-1);\n  for(i=0;i<N-K+1;i++){\n    if(min>h[i+K-1]-h[i]){\n    min=h[i+K-1]-h[i];\n    if(min==0)break;\n  }\n  }\n  m=min;\n  printf(\"%d\",m);\n  return 0;\n}\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nIn some other world, today is Christmas Eve.\n\nThere are N trees planted in Mr. Takaha's garden. The height of the i-th tree (1 \\leq i \\leq N) is h_i meters.\n\nHe decides to choose K trees from these trees and decorate them with electric lights. To make the scenery more beautiful, the heights of the decorated trees should be as close to each other as possible.\n\nMore specifically, let the height of the tallest decorated tree be h_{max} meters, and the height of the shortest decorated tree be h_{min} meters. The smaller the value h_{max} - h_{min} is, the better. What is the minimum possible value of h_{max} - h_{min}?\n\nConstraints\n\n2 \\leq K < N \\leq 10^5\n\n1 \\leq h_i \\leq 10^9\n\nh_i is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nh_1\nh_2\n:\nh_N\n\nOutput\n\nPrint the minimum possible value of h_{max} - h_{min}.\n\nSample Input 1\n\n5 3\n10\n15\n11\n14\n12\n\nSample Output 1\n\n2\n\nIf we decorate the first, third and fifth trees, h_{max} = 12, h_{min} = 10 so h_{max} - h_{min} = 2. This is optimal.\n\nSample Input 2\n\n5 3\n5\n7\n5\n7\n7\n\nSample Output 2\n\n0\n\nIf we decorate the second, fourth and fifth trees, h_{max} = 7, h_{min} = 7 so h_{max} - h_{min} = 0. This is optimal.\n\nThere are not too many trees in these sample inputs, but note that there can be at most one hundred thousand trees (we just can't put a sample with a hundred thousand lines here).", "sample_input": "5 3\n10\n15\n11\n14\n12\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03208", "source_text": "Score : 300 points\n\nProblem Statement\n\nIn some other world, today is Christmas Eve.\n\nThere are N trees planted in Mr. Takaha's garden. The height of the i-th tree (1 \\leq i \\leq N) is h_i meters.\n\nHe decides to choose K trees from these trees and decorate them with electric lights. To make the scenery more beautiful, the heights of the decorated trees should be as close to each other as possible.\n\nMore specifically, let the height of the tallest decorated tree be h_{max} meters, and the height of the shortest decorated tree be h_{min} meters. The smaller the value h_{max} - h_{min} is, the better. What is the minimum possible value of h_{max} - h_{min}?\n\nConstraints\n\n2 \\leq K < N \\leq 10^5\n\n1 \\leq h_i \\leq 10^9\n\nh_i is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nh_1\nh_2\n:\nh_N\n\nOutput\n\nPrint the minimum possible value of h_{max} - h_{min}.\n\nSample Input 1\n\n5 3\n10\n15\n11\n14\n12\n\nSample Output 1\n\n2\n\nIf we decorate the first, third and fifth trees, h_{max} = 12, h_{min} = 10 so h_{max} - h_{min} = 2. This is optimal.\n\nSample Input 2\n\n5 3\n5\n7\n5\n7\n7\n\nSample Output 2\n\n0\n\nIf we decorate the second, fourth and fifth trees, h_{max} = 7, h_{min} = 7 so h_{max} - h_{min} = 0. This is optimal.\n\nThere are not too many trees in these sample inputs, but note that there can be at most one hundred thousand trees (we just can't put a sample with a hundred thousand lines 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": 1431, "cpu_time_ms": 2103, "memory_kb": 896}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s108827505", "group_id": "codeNet:p03210", "input_text": "#include<stdio.h>\nint main()\n{\n    int x;\n    scanf(\"%d\",&x);\n\n    if(x==3||x==5||x==7)\n    {\n        printf(\"YES\");\n    }\n    else\n    {\n        printf(\"NO\");\n    }\n}\n", "language": "C", "metadata": {"date": 1566795207, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "problem_description_relpath": "problem_descriptions/p03210.html", "problem_id": "p03210", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03210/input.txt", "sample_output_relpath": "derived/input_output/data/p03210/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03210/C/s108827505.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s108827505", "user_id": "u568382716"}, "prompt_components": {"gold_output": "YES\n", "input_to_evaluate": "#include<stdio.h>\nint main()\n{\n    int x;\n    scanf(\"%d\",&x);\n\n    if(x==3||x==5||x==7)\n    {\n        printf(\"YES\");\n    }\n    else\n    {\n        printf(\"NO\");\n    }\n}\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nShichi-Go-San (literally \"Seven-Five-Three\") is a traditional event in a certain country to celebrate the growth of seven-, five- and three-year-old children.\n\nTakahashi is now X years old. Will his growth be celebrated in Shichi-Go-San this time?\n\nConstraints\n\n1 ≤ X ≤ 9\n\nX is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX\n\nOutput\n\nIf Takahashi's growth will be celebrated, print YES; if it will not, print NO.\n\nSample Input 1\n\n5\n\nSample Output 1\n\nYES\n\nThe growth of a five-year-old child will be celebrated.\n\nSample Input 2\n\n6\n\nSample Output 2\n\nNO\n\nSee you next year.", "sample_input": "5\n"}, "reference_outputs": ["YES\n"], "source_document_id": "p03210", "source_text": "Score : 100 points\n\nProblem Statement\n\nShichi-Go-San (literally \"Seven-Five-Three\") is a traditional event in a certain country to celebrate the growth of seven-, five- and three-year-old children.\n\nTakahashi is now X years old. Will his growth be celebrated in Shichi-Go-San this time?\n\nConstraints\n\n1 ≤ X ≤ 9\n\nX is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX\n\nOutput\n\nIf Takahashi's growth will be celebrated, print YES; if it will not, print NO.\n\nSample Input 1\n\n5\n\nSample Output 1\n\nYES\n\nThe growth of a five-year-old child will be celebrated.\n\nSample Input 2\n\n6\n\nSample Output 2\n\nNO\n\nSee you next year.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 168, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s749225203", "group_id": "codeNet:p03210", "input_text": "#include <stdio.h>\n\nint main()\n{\n    int x;\n\n    scanf(\"%d\", &x);\n\n    if (x == 3 || x == 5 || x == 7) {\n        printf(\"YES\\n\");\n    } else {\n        printf(\"NO\\n\");\n    }\n\n    return 0;\n}\n", "language": "C", "metadata": {"date": 1544129626, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "problem_description_relpath": "problem_descriptions/p03210.html", "problem_id": "p03210", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03210/input.txt", "sample_output_relpath": "derived/input_output/data/p03210/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03210/C/s749225203.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s749225203", "user_id": "u683588090"}, "prompt_components": {"gold_output": "YES\n", "input_to_evaluate": "#include <stdio.h>\n\nint main()\n{\n    int x;\n\n    scanf(\"%d\", &x);\n\n    if (x == 3 || x == 5 || x == 7) {\n        printf(\"YES\\n\");\n    } else {\n        printf(\"NO\\n\");\n    }\n\n    return 0;\n}\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nShichi-Go-San (literally \"Seven-Five-Three\") is a traditional event in a certain country to celebrate the growth of seven-, five- and three-year-old children.\n\nTakahashi is now X years old. Will his growth be celebrated in Shichi-Go-San this time?\n\nConstraints\n\n1 ≤ X ≤ 9\n\nX is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX\n\nOutput\n\nIf Takahashi's growth will be celebrated, print YES; if it will not, print NO.\n\nSample Input 1\n\n5\n\nSample Output 1\n\nYES\n\nThe growth of a five-year-old child will be celebrated.\n\nSample Input 2\n\n6\n\nSample Output 2\n\nNO\n\nSee you next year.", "sample_input": "5\n"}, "reference_outputs": ["YES\n"], "source_document_id": "p03210", "source_text": "Score : 100 points\n\nProblem Statement\n\nShichi-Go-San (literally \"Seven-Five-Three\") is a traditional event in a certain country to celebrate the growth of seven-, five- and three-year-old children.\n\nTakahashi is now X years old. Will his growth be celebrated in Shichi-Go-San this time?\n\nConstraints\n\n1 ≤ X ≤ 9\n\nX is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX\n\nOutput\n\nIf Takahashi's growth will be celebrated, print YES; if it will not, print NO.\n\nSample Input 1\n\n5\n\nSample Output 1\n\nYES\n\nThe growth of a five-year-old child will be celebrated.\n\nSample Input 2\n\n6\n\nSample Output 2\n\nNO\n\nSee you next year.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 190, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s327531949", "group_id": "codeNet:p03211", "input_text": "#include <stdio.h>\n#include <stdlib.h>\n#include <string.h>\n\nint abs(int num){\n\tif(num < 0)\tnum *= -1;\n\treturn num;\n}\n\n\nint main(int argc, char const *argv[])\n{\n\tint min = 999,val;\n\tchar S[12];\n\tscanf(\"%s\",S);\n\tfor (int i = 0; i < strlen(S) - 2; ++i){\n\t\tval = abs(753 - (100 * (S[i] - '0') + 10 * (S[i + 1] - '0') + (S[i + 2] - '0')));\n\t\tif(min > val)\tmin = val;\n\t}\n\tprintf(\"%d\\n\", min);\n\treturn 0;\n}", "language": "C", "metadata": {"date": 1543803732, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "problem_description_relpath": "problem_descriptions/p03211.html", "problem_id": "p03211", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03211/input.txt", "sample_output_relpath": "derived/input_output/data/p03211/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03211/C/s327531949.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s327531949", "user_id": "u185464141"}, "prompt_components": {"gold_output": "34\n", "input_to_evaluate": "#include <stdio.h>\n#include <stdlib.h>\n#include <string.h>\n\nint abs(int num){\n\tif(num < 0)\tnum *= -1;\n\treturn num;\n}\n\n\nint main(int argc, char const *argv[])\n{\n\tint min = 999,val;\n\tchar S[12];\n\tscanf(\"%s\",S);\n\tfor (int i = 0; i < strlen(S) - 2; ++i){\n\t\tval = abs(753 - (100 * (S[i] - '0') + 10 * (S[i + 1] - '0') + (S[i + 2] - '0')));\n\t\tif(min > val)\tmin = val;\n\t}\n\tprintf(\"%d\\n\", min);\n\treturn 0;\n}", "problem_context": "Score : 200 points\n\nProblem Statement\n\nThere is a string S consisting of digits 1, 2, ..., 9.\nLunlun, the Dachshund, will take out three consecutive digits from S, treat them as a single integer X and bring it to her master. (She cannot rearrange the digits.)\n\nThe master's favorite number is 753. The closer to this number, the better.\nWhat is the minimum possible (absolute) difference between X and 753?\n\nConstraints\n\nS is a string of length between 4 and 10 (inclusive).\n\nEach character in S is 1, 2, ..., or 9.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the minimum possible difference between X and 753.\n\nSample Input 1\n\n1234567876\n\nSample Output 1\n\n34\n\nTaking out the seventh to ninth characters results in X = 787, and the difference between this and 753 is 787 - 753 = 34. The difference cannot be made smaller, no matter where X is taken from.\n\nNote that the digits cannot be rearranged. For example, taking out 567 and rearranging it to 765 is not allowed.\n\nWe cannot take out three digits that are not consecutive from S, either. For example, taking out the seventh digit 7, the ninth digit 7 and the tenth digit 6 to obtain 776 is not allowed.\n\nSample Input 2\n\n35753\n\nSample Output 2\n\n0\n\nIf 753 itself can be taken out, the answer is 0.\n\nSample Input 3\n\n1111111111\n\nSample Output 3\n\n642\n\nNo matter where X is taken from, X = 111, with the difference 753 - 111 = 642.", "sample_input": "1234567876\n"}, "reference_outputs": ["34\n"], "source_document_id": "p03211", "source_text": "Score : 200 points\n\nProblem Statement\n\nThere is a string S consisting of digits 1, 2, ..., 9.\nLunlun, the Dachshund, will take out three consecutive digits from S, treat them as a single integer X and bring it to her master. (She cannot rearrange the digits.)\n\nThe master's favorite number is 753. The closer to this number, the better.\nWhat is the minimum possible (absolute) difference between X and 753?\n\nConstraints\n\nS is a string of length between 4 and 10 (inclusive).\n\nEach character in S is 1, 2, ..., or 9.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the minimum possible difference between X and 753.\n\nSample Input 1\n\n1234567876\n\nSample Output 1\n\n34\n\nTaking out the seventh to ninth characters results in X = 787, and the difference between this and 753 is 787 - 753 = 34. The difference cannot be made smaller, no matter where X is taken from.\n\nNote that the digits cannot be rearranged. For example, taking out 567 and rearranging it to 765 is not allowed.\n\nWe cannot take out three digits that are not consecutive from S, either. For example, taking out the seventh digit 7, the ninth digit 7 and the tenth digit 6 to obtain 776 is not allowed.\n\nSample Input 2\n\n35753\n\nSample Output 2\n\n0\n\nIf 753 itself can be taken out, the answer is 0.\n\nSample Input 3\n\n1111111111\n\nSample Output 3\n\n642\n\nNo matter where X is taken from, X = 111, with the difference 753 - 111 = 642.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s113527332", "group_id": "codeNet:p03213", "input_text": "#include <stdio.h>\n#include <string.h>\n#include <stdlib.h>\n#include <math.h>\n\nint main(){\n  int i,j;\n  int n;\n  long long int m = 1;\n  long long int x;\n  int y = 0;\n  int l=0;\n\n  scanf(\"%d\",&n);\n\n  for(i=1; i<=n; i++){\n    m = m * i;\n  }\n\n  for(i=1; i<=m; i++){\n    if(m%i == 0){\n      x = i;\n      l = 0;\n\n    for(j=1; j<=x; j++){\n      if(x%j == 0){\n        l++;\n      }\n    }\n    if(l==75){\n      y++;\n    }\n  }\n  }\n  printf(\"%d\\n\",y);\n\n  return 0;\n}\n", "language": "C", "metadata": {"date": 1543807852, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "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/C/s113527332.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s113527332", "user_id": "u768080464"}, "prompt_components": {"gold_output": "0\n", "input_to_evaluate": "#include <stdio.h>\n#include <string.h>\n#include <stdlib.h>\n#include <math.h>\n\nint main(){\n  int i,j;\n  int n;\n  long long int m = 1;\n  long long int x;\n  int y = 0;\n  int l=0;\n\n  scanf(\"%d\",&n);\n\n  for(i=1; i<=n; i++){\n    m = m * i;\n  }\n\n  for(i=1; i<=m; i++){\n    if(m%i == 0){\n      x = i;\n      l = 0;\n\n    for(j=1; j<=x; j++){\n      if(x%j == 0){\n        l++;\n      }\n    }\n    if(l==75){\n      y++;\n    }\n  }\n  }\n  printf(\"%d\\n\",y);\n\n  return 0;\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": 454, "cpu_time_ms": 2103, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s795364854", "group_id": "codeNet:p03219", "input_text": "#include <stdio.h>\n#include <stdlib.h>\n#include <string.h>\n\nint main()\n{\n    int m,a,b;\n    while(~scanf(\"%d%d\",&a,&b))\n    {\n        b=b/2;\n        printf(\"%d\\n\",a+b);\n    }\n    return 0;\n}\n", "language": "C", "metadata": {"date": 1576028794, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "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/C/s795364854.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s795364854", "user_id": "u089230684"}, "prompt_components": {"gold_output": "110\n", "input_to_evaluate": "#include <stdio.h>\n#include <stdlib.h>\n#include <string.h>\n\nint main()\n{\n    int m,a,b;\n    while(~scanf(\"%d%d\",&a,&b))\n    {\n        b=b/2;\n        printf(\"%d\\n\",a+b);\n    }\n    return 0;\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": 191, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s825286442", "group_id": "codeNet:p03220", "input_text": "#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    long long n;\n    long long t, a;\n    long long ans;\n    long long hi;\n    long long minv = 1ll << 50ll;\n    long long h;\n\n    scanf(\"%lld\", &n);\n    scanf(\"%lld %lld\", &t, &a); t *= 1000; a *= 1000;\n\n    for (long long i = 0; i < n; i++) {\n        scanf(\"%lld\", &h);\n        \n        hi = t - h * 6;\n\n        if (minv > abs(a - hi)) {\n            minv = abs(a - hi);\n            ans = i + 1;\n        }\n    }\n\n    printf(\"%lld\\n\", ans);\n\n    return 0;\n}\n", "language": "C", "metadata": {"date": 1542238196, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "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/C/s825286442.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s825286442", "user_id": "u683588090"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    long long n;\n    long long t, a;\n    long long ans;\n    long long hi;\n    long long minv = 1ll << 50ll;\n    long long h;\n\n    scanf(\"%lld\", &n);\n    scanf(\"%lld %lld\", &t, &a); t *= 1000; a *= 1000;\n\n    for (long long i = 0; i < n; i++) {\n        scanf(\"%lld\", &h);\n        \n        hi = t - h * 6;\n\n        if (minv > abs(a - hi)) {\n            minv = abs(a - hi);\n            ans = i + 1;\n        }\n    }\n\n    printf(\"%lld\\n\", ans);\n\n    return 0;\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": 510, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s806504106", "group_id": "codeNet:p03220", "input_text": "#include <stdio.h>\n#include <stdlib.h>\n\ndouble fabs(double x);\n\nint main(){\n    int n;\n    int t,a;\n    scanf(\"%d\",&n);\n    scanf(\"%d %d\",&t,&a);\n    double h[n];\n    int i;\n    double tmp;\n    int maxplcnum[2]={100000,0};\n    for(i=0; i<n; i++){\n        scanf(\"%lf\",&h[i]);\n        tmp=t-h[i]*0.006;\n        h[i]=a-tmp;\n        h[i]=fabs(h[i]);\n        if(maxplcnum[0]>h[i]){\n            maxplcnum[0]=h[i];\n            maxplcnum[1]=i+1;\n        }\n    }\n    \n    printf(\"%d\\n\",maxplcnum[1]);\n    \n    return 0;\n    }", "language": "C", "metadata": {"date": 1541561534, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "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/C/s806504106.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s806504106", "user_id": "u123896133"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "#include <stdio.h>\n#include <stdlib.h>\n\ndouble fabs(double x);\n\nint main(){\n    int n;\n    int t,a;\n    scanf(\"%d\",&n);\n    scanf(\"%d %d\",&t,&a);\n    double h[n];\n    int i;\n    double tmp;\n    int maxplcnum[2]={100000,0};\n    for(i=0; i<n; i++){\n        scanf(\"%lf\",&h[i]);\n        tmp=t-h[i]*0.006;\n        h[i]=a-tmp;\n        h[i]=fabs(h[i]);\n        if(maxplcnum[0]>h[i]){\n            maxplcnum[0]=h[i];\n            maxplcnum[1]=i+1;\n        }\n    }\n    \n    printf(\"%d\\n\",maxplcnum[1]);\n    \n    return 0;\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": 516, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s896713255", "group_id": "codeNet:p03220", "input_text": "#include <stdlib.h>\n#include <math.h>\n#include <string.h>\n#include <stdio.h>\n\nint main()\n{   int a,b,y,k,n,i,t,h[1001];\n    double th[1001],x=114514191;\n    scanf(\"%d%d%d\",&n,&t,&a);\n    for(i=0;i<n;i++){\n        scanf(\"%d\",&h[i]);\n        th[i]=t-h[i]*0.006;\n    }\n    for(i=0;i<n;i++){\n        if(abs(th[i]-a)<x){\n            x=abs(th[i]-a);\n            y=i;\n        }\n    }\n    printf(\"%d\",y+1);\n\n    return 0;\n}\n", "language": "C", "metadata": {"date": 1541385033, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "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/C/s896713255.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s896713255", "user_id": "u993046043"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "#include <stdlib.h>\n#include <math.h>\n#include <string.h>\n#include <stdio.h>\n\nint main()\n{   int a,b,y,k,n,i,t,h[1001];\n    double th[1001],x=114514191;\n    scanf(\"%d%d%d\",&n,&t,&a);\n    for(i=0;i<n;i++){\n        scanf(\"%d\",&h[i]);\n        th[i]=t-h[i]*0.006;\n    }\n    for(i=0;i<n;i++){\n        if(abs(th[i]-a)<x){\n            x=abs(th[i]-a);\n            y=i;\n        }\n    }\n    printf(\"%d\",y+1);\n\n    return 0;\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": 416, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s086230517", "group_id": "codeNet:p03229", "input_text": "#include <stdio.h>\nvoid sortm(int number[1000000],int n){\n int i, j, tmp;\n \n  for (i=0; i<n;i++) {\n    for (j=i+1; j<n;j++) {\n      if (number[i] < number[j]) {\n        tmp =  number[i];\n        number[i] = number[j];\n        number[j] = tmp;\n      }\n    }\n  }\n}\n\nint ab(int a,int b){\n    if(a>b)\n    return(a-b);\n    else\n    return(b-a);\n}\n\n\nint main(){\n    int A[1000000],i,N,B[1000000],sum=0;\n    \n    scanf(\"%d\",&N);\n    \n    for(i=0;i<N;i++)\n    scanf(\"%d\",&A[i]);\n    \n    sortm(A,N);\n   \n   for(i=0;i<N/2;i++){\n   B[2*i+1]=A[i];\n   B[0]=A[N/2];\n   }\n   \n    if(N%2==1){\n   B[N-1]=A[1+N/2];\n    for(i=1;i<N/2;i++)\n    B[2*i]=A[N/2+1+i];\n    }\n    else{\n    for(i=1;i<N/2;i++)\n    B[2*i]=A[N/2+i];\n    }\n    \n   for(i=0;i<N-1;i++){\n       sum+=ab(B[i],B[i+1]);\n   }\n    \n    printf(\"%d\",sum);\n    return(0);\n}", "language": "C", "metadata": {"date": 1555701545, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "problem_description_relpath": "problem_descriptions/p03229.html", "problem_id": "p03229", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03229/input.txt", "sample_output_relpath": "derived/input_output/data/p03229/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03229/C/s086230517.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s086230517", "user_id": "u284501132"}, "prompt_components": {"gold_output": "21\n", "input_to_evaluate": "#include <stdio.h>\nvoid sortm(int number[1000000],int n){\n int i, j, tmp;\n \n  for (i=0; i<n;i++) {\n    for (j=i+1; j<n;j++) {\n      if (number[i] < number[j]) {\n        tmp =  number[i];\n        number[i] = number[j];\n        number[j] = tmp;\n      }\n    }\n  }\n}\n\nint ab(int a,int b){\n    if(a>b)\n    return(a-b);\n    else\n    return(b-a);\n}\n\n\nint main(){\n    int A[1000000],i,N,B[1000000],sum=0;\n    \n    scanf(\"%d\",&N);\n    \n    for(i=0;i<N;i++)\n    scanf(\"%d\",&A[i]);\n    \n    sortm(A,N);\n   \n   for(i=0;i<N/2;i++){\n   B[2*i+1]=A[i];\n   B[0]=A[N/2];\n   }\n   \n    if(N%2==1){\n   B[N-1]=A[1+N/2];\n    for(i=1;i<N/2;i++)\n    B[2*i]=A[N/2+1+i];\n    }\n    else{\n    for(i=1;i<N/2;i++)\n    B[2*i]=A[N/2+i];\n    }\n    \n   for(i=0;i<N-1;i++){\n       sum+=ab(B[i],B[i+1]);\n   }\n    \n    printf(\"%d\",sum);\n    return(0);\n}", "problem_context": "Score : 400 points\n\nProblem Statement\n\nYou are given N integers; the i-th of them is A_i.\nFind the maximum possible sum of the absolute differences between the adjacent elements after arranging these integers in a row in any order you like.\n\nConstraints\n\n2 \\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\n:\nA_N\n\nOutput\n\nPrint the maximum possible sum of the absolute differences between the adjacent elements after arranging the given integers in a row in any order you like.\n\nSample Input 1\n\n5\n6\n8\n1\n2\n3\n\nSample Output 1\n\n21\n\nWhen the integers are arranged as 3,8,1,6,2, the sum of the absolute differences between the adjacent elements is |3 - 8| + |8 - 1| + |1 - 6| + |6 - 2| = 21. This is the maximum possible sum.\n\nSample Input 2\n\n6\n3\n1\n4\n1\n5\n9\n\nSample Output 2\n\n25\n\nSample Input 3\n\n3\n5\n5\n1\n\nSample Output 3\n\n8", "sample_input": "5\n6\n8\n1\n2\n3\n"}, "reference_outputs": ["21\n"], "source_document_id": "p03229", "source_text": "Score : 400 points\n\nProblem Statement\n\nYou are given N integers; the i-th of them is A_i.\nFind the maximum possible sum of the absolute differences between the adjacent elements after arranging these integers in a row in any order you like.\n\nConstraints\n\n2 \\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\n:\nA_N\n\nOutput\n\nPrint the maximum possible sum of the absolute differences between the adjacent elements after arranging the given integers in a row in any order you like.\n\nSample Input 1\n\n5\n6\n8\n1\n2\n3\n\nSample Output 1\n\n21\n\nWhen the integers are arranged as 3,8,1,6,2, the sum of the absolute differences between the adjacent elements is |3 - 8| + |8 - 1| + |1 - 6| + |6 - 2| = 21. This is the maximum possible sum.\n\nSample Input 2\n\n6\n3\n1\n4\n1\n5\n9\n\nSample Output 2\n\n25\n\nSample Input 3\n\n3\n5\n5\n1\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": 815, "cpu_time_ms": 2103, "memory_kb": 2560}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s563421470", "group_id": "codeNet:p03231", "input_text": "#include<stdio.h>\n#include<string.h>\n#include<stdlib.h>\nint gcd(int x, int y);\nint main(void){\n  long n,m,i,x,y,g=0;\n  scanf(\"%ld %ld\", &n, &m);\n  if(n<m){\n    i=n;\n    n=m;\n    m=i;\n    g=1;\n  }\n  char s[n], t[m];\n  if(g==1){\n   scanf(\"%s\", t);\n   scanf(\"%s\",s);\n  }\n  else {\n   scanf(\"%s\", s);\n   scanf(\"%s\", t);\n  }\n  g = gcd(n,m);\n  x = n/g;\n  y = m/g;\n  for(i=0; m >= y*i ; i++){\n     \n    if(*(s+x*i)==*(t+y*i)); \n    else{\n     x=1;\n     y=1;\n     g=-1;\n     break;\n     }\n   }\n  printf(\"%ld\",x*y*g);\n  return 0;\n}\nint gcd(int x, int y){\n\n  if(x%y==0) return y;\n  else {\n    int t;\n    t = x%y;\n    x = y;\n    y = t;\n    return gcd(x, y);\n  }\n}\n  \n", "language": "C", "metadata": {"date": 1542008366, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "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/C/s563421470.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s563421470", "user_id": "u982152304"}, "prompt_components": {"gold_output": "6\n", "input_to_evaluate": "#include<stdio.h>\n#include<string.h>\n#include<stdlib.h>\nint gcd(int x, int y);\nint main(void){\n  long n,m,i,x,y,g=0;\n  scanf(\"%ld %ld\", &n, &m);\n  if(n<m){\n    i=n;\n    n=m;\n    m=i;\n    g=1;\n  }\n  char s[n], t[m];\n  if(g==1){\n   scanf(\"%s\", t);\n   scanf(\"%s\",s);\n  }\n  else {\n   scanf(\"%s\", s);\n   scanf(\"%s\", t);\n  }\n  g = gcd(n,m);\n  x = n/g;\n  y = m/g;\n  for(i=0; m >= y*i ; i++){\n     \n    if(*(s+x*i)==*(t+y*i)); \n    else{\n     x=1;\n     y=1;\n     g=-1;\n     break;\n     }\n   }\n  printf(\"%ld\",x*y*g);\n  return 0;\n}\nint gcd(int x, int y){\n\n  if(x%y==0) return y;\n  else {\n    int t;\n    t = x%y;\n    x = y;\n    y = t;\n    return gcd(x, y);\n  }\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": 655, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s387644545", "group_id": "codeNet:p03231", "input_text": "#include <stdio.h>\n\nint get_lcm(int a, int b);\n\nint main(void)\n{\n\tint i, n, m, lcm;\n\tscanf(\"%d %d%*c\", &n, &m);\n\tlcm = get_lcm(n,m);\n\n\tchar s[100001], t[100001];\n\tfor(i=0;i<n;i++)\n\t\tscanf(\"%c\", &s[i]);\n\ts[i] = '\\0';\n\tprintf(\"%s\\n\", s);\n\tscanf(\"%*c\");\n\tfor(i=0;i<m;i++)\n\t\tscanf(\"%c\", &t[i]);\n\tt[i] = '\\0';\n\tprintf(\"%s\\n\", t);\n\n\tif(s[0] != t[0]) {\n\t\tprintf(\"%d\\n\", -1);\n\t\treturn 0;\n\t}\n\tif(n%m == 0) {\n\t\tint flag = 0;\n\t\tfor(i=0;i<m;i++) {\n\t\t\tif(s[i*(n/m)] != t[i]) {\n\t\t\t\tflag = 1;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tif(flag) {\n\t\t\tprintf(\"%d\\n\", -1);\n\t\t\treturn 0;\n\t\t} else {\n\t\t\tprintf(\"%d\\n\", lcm);\n\t\t\treturn 0;\n\t\t}\n\t}\n\telse if(m%n == 0) {\n\t\tint flag = 0;\n\t\tfor(i=0;i<n;i++) {\n\t\t\tif(t[i*(m/n)] != s[i]) {\n\t\t\t\tflag = 1;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tif(flag) {\n\t\t\tprintf(\"%d\\n\", -1);\n\t\t\treturn 0;\n\t\t} else {\n\t\t\tprintf(\"%d\\n\", lcm);\n\t\t\treturn 0;\n\t\t}\n\t}\n\n\tprintf(\"%d\\n\", lcm);\n\n\treturn 0;\n}\n\nint get_lcm(int a, int b)\n{\n\tint g, l, lcm;\n\tif(a>b) {\n\t\tg = a; l = b;\n\t} else {\n\t\tg = b; l = a;\n\t}\n\tlcm = g;\n\n\twhile(lcm % l != 0) lcm += g;\n\n\treturn lcm;\n}", "language": "C", "metadata": {"date": 1539482230, "filename_ext": "c", "original_language": "C (Clang 3.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/C/s387644545.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s387644545", "user_id": "u810947110"}, "prompt_components": {"gold_output": "6\n", "input_to_evaluate": "#include <stdio.h>\n\nint get_lcm(int a, int b);\n\nint main(void)\n{\n\tint i, n, m, lcm;\n\tscanf(\"%d %d%*c\", &n, &m);\n\tlcm = get_lcm(n,m);\n\n\tchar s[100001], t[100001];\n\tfor(i=0;i<n;i++)\n\t\tscanf(\"%c\", &s[i]);\n\ts[i] = '\\0';\n\tprintf(\"%s\\n\", s);\n\tscanf(\"%*c\");\n\tfor(i=0;i<m;i++)\n\t\tscanf(\"%c\", &t[i]);\n\tt[i] = '\\0';\n\tprintf(\"%s\\n\", t);\n\n\tif(s[0] != t[0]) {\n\t\tprintf(\"%d\\n\", -1);\n\t\treturn 0;\n\t}\n\tif(n%m == 0) {\n\t\tint flag = 0;\n\t\tfor(i=0;i<m;i++) {\n\t\t\tif(s[i*(n/m)] != t[i]) {\n\t\t\t\tflag = 1;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tif(flag) {\n\t\t\tprintf(\"%d\\n\", -1);\n\t\t\treturn 0;\n\t\t} else {\n\t\t\tprintf(\"%d\\n\", lcm);\n\t\t\treturn 0;\n\t\t}\n\t}\n\telse if(m%n == 0) {\n\t\tint flag = 0;\n\t\tfor(i=0;i<n;i++) {\n\t\t\tif(t[i*(m/n)] != s[i]) {\n\t\t\t\tflag = 1;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tif(flag) {\n\t\t\tprintf(\"%d\\n\", -1);\n\t\t\treturn 0;\n\t\t} else {\n\t\t\tprintf(\"%d\\n\", lcm);\n\t\t\treturn 0;\n\t\t}\n\t}\n\n\tprintf(\"%d\\n\", lcm);\n\n\treturn 0;\n}\n\nint get_lcm(int a, int b)\n{\n\tint g, l, lcm;\n\tif(a>b) {\n\t\tg = a; l = b;\n\t} else {\n\t\tg = b; l = a;\n\t}\n\tlcm = g;\n\n\twhile(lcm % l != 0) lcm += g;\n\n\treturn lcm;\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": 1021, "cpu_time_ms": 7, "memory_kb": 512}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s916734549", "group_id": "codeNet:p03231", "input_text": "#include <stdio.h>\n#include <string.h>\n\nint gcd(int a, int b) {\n    if (b == 0)\n        return a;\n\n    return gcd(b, a % b);\n}\n\nint lcm(int a, int b) {\n    return a * b / gcd(a, b);\n}\n\n\n\nint main(){\n  int N,M;\n  scanf(\"%d%d\",&N,&M);\n  char S[N];\n  char T[M];\n  scanf(\"%s\",S);\n  scanf(\"%s\",T);\n  int i;\n  int flag=0;\n\n  int ans=-1;\n  if(S[0]!=T[0]){\n    flag=1;\n  }\n  if(N==M){\n    for(i=0;i<N;i++){\n      if(S[i]!=T[i]){\n\tflag=1;\n      }\n    }\n  }else{\n    for(i=0;i<N;i++){\n      if(i*M%N==0){\n\tif(S[i]!=T[i*M/N]){\n\t  flag=1;\n\t}\n      }\n    }\n  }\n  if(flag==0){\n    ans=lcm(N,M);\n  }\n  printf(\"%d\",ans);\n  return 0;\n}\n\n    \n", "language": "C", "metadata": {"date": 1539480041, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "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/C/s916734549.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s916734549", "user_id": "u950580323"}, "prompt_components": {"gold_output": "6\n", "input_to_evaluate": "#include <stdio.h>\n#include <string.h>\n\nint gcd(int a, int b) {\n    if (b == 0)\n        return a;\n\n    return gcd(b, a % b);\n}\n\nint lcm(int a, int b) {\n    return a * b / gcd(a, b);\n}\n\n\n\nint main(){\n  int N,M;\n  scanf(\"%d%d\",&N,&M);\n  char S[N];\n  char T[M];\n  scanf(\"%s\",S);\n  scanf(\"%s\",T);\n  int i;\n  int flag=0;\n\n  int ans=-1;\n  if(S[0]!=T[0]){\n    flag=1;\n  }\n  if(N==M){\n    for(i=0;i<N;i++){\n      if(S[i]!=T[i]){\n\tflag=1;\n      }\n    }\n  }else{\n    for(i=0;i<N;i++){\n      if(i*M%N==0){\n\tif(S[i]!=T[i*M/N]){\n\t  flag=1;\n\t}\n      }\n    }\n  }\n  if(flag==0){\n    ans=lcm(N,M);\n  }\n  printf(\"%d\",ans);\n  return 0;\n}\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": 625, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s359891988", "group_id": "codeNet:p03239", "input_text": "#include<stdio.h>\n\nint main()\n{\n\tint N, T;\n\tscanf(\"%d %d\", &N, &T);\n\tint ary[2][N];\n\t\n\tint i, j = 0;\n\tfor(i = 0; i < N; ++i){\n\t\tscanf(\"%d%d\", &ary[0][j], &ary[1][j]);\n\t\tif(ary[1][j] <= T) ++j;\n\t}\n\tprintf(\" j = %d\\n\", j);\n\tif(j == 0) printf(\"TEL\\n\");\n\telse{\n\t\tint Min = 1001;\t\n\t\tfor(i = 0; i < j; ++i){\n\t\t\tif(Min > ary[0][i]) Min = ary[0][i];\n\t\t}\n\t\tprintf(\"%d\\n\", Min);\n\t}\n\t\n\treturn 0;\n}", "language": "C", "metadata": {"date": 1541738671, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "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/C/s359891988.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s359891988", "user_id": "u200849592"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "#include<stdio.h>\n\nint main()\n{\n\tint N, T;\n\tscanf(\"%d %d\", &N, &T);\n\tint ary[2][N];\n\t\n\tint i, j = 0;\n\tfor(i = 0; i < N; ++i){\n\t\tscanf(\"%d%d\", &ary[0][j], &ary[1][j]);\n\t\tif(ary[1][j] <= T) ++j;\n\t}\n\tprintf(\" j = %d\\n\", j);\n\tif(j == 0) printf(\"TEL\\n\");\n\telse{\n\t\tint Min = 1001;\t\n\t\tfor(i = 0; i < j; ++i){\n\t\t\tif(Min > ary[0][i]) Min = ary[0][i];\n\t\t}\n\t\tprintf(\"%d\\n\", Min);\n\t}\n\t\n\treturn 0;\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": 386, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s035832272", "group_id": "codeNet:p03241", "input_text": "#include <stdio.h>\n\nint main()\n{\n\tunsigned int n, m;\n\tscanf(\"%u %u\", &n, &m); \n\tint i, rec;\n\tfor (i = 1; i <= (m / n); i++) {\n\t\tif (m % i == 0) {\n\t\t\trec = i;\t\n\t\t}\n\t}\n\tprintf(\"%d\", rec);\n\treturn 0;\n}\n", "language": "C", "metadata": {"date": 1539754667, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "problem_description_relpath": "problem_descriptions/p03241.html", "problem_id": "p03241", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03241/input.txt", "sample_output_relpath": "derived/input_output/data/p03241/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03241/C/s035832272.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s035832272", "user_id": "u470481460"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "#include <stdio.h>\n\nint main()\n{\n\tunsigned int n, m;\n\tscanf(\"%u %u\", &n, &m); \n\tint i, rec;\n\tfor (i = 1; i <= (m / n); i++) {\n\t\tif (m % i == 0) {\n\t\t\trec = i;\t\n\t\t}\n\t}\n\tprintf(\"%d\", rec);\n\treturn 0;\n}\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nYou are given integers N and M.\n\nConsider a sequence a of length N consisting of positive integers such that a_1 + a_2 + ... + a_N = M. Find the maximum possible value of the greatest common divisor of a_1, a_2, ..., a_N.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 10^5\n\nN \\leq M \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\n\nOutput\n\nPrint the maximum possible value of the greatest common divisor of a sequence a_1, a_2, ..., a_N that satisfies the condition.\n\nSample Input 1\n\n3 14\n\nSample Output 1\n\n2\n\nConsider the sequence (a_1, a_2, a_3) = (2, 4, 8). Their greatest common divisor is 2, and this is the maximum value.\n\nSample Input 2\n\n10 123\n\nSample Output 2\n\n3\n\nSample Input 3\n\n100000 1000000000\n\nSample Output 3\n\n10000", "sample_input": "3 14\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03241", "source_text": "Score : 400 points\n\nProblem Statement\n\nYou are given integers N and M.\n\nConsider a sequence a of length N consisting of positive integers such that a_1 + a_2 + ... + a_N = M. Find the maximum possible value of the greatest common divisor of a_1, a_2, ..., a_N.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 10^5\n\nN \\leq M \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\n\nOutput\n\nPrint the maximum possible value of the greatest common divisor of a sequence a_1, a_2, ..., a_N that satisfies the condition.\n\nSample Input 1\n\n3 14\n\nSample Output 1\n\n2\n\nConsider the sequence (a_1, a_2, a_3) = (2, 4, 8). Their greatest common divisor is 2, and this is the maximum value.\n\nSample Input 2\n\n10 123\n\nSample Output 2\n\n3\n\nSample Input 3\n\n100000 1000000000\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": 199, "cpu_time_ms": 2103, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s184610501", "group_id": "codeNet:p03242", "input_text": "#include<stdio.h>\n#include<stdlib.h>\n\nint main(void)\n{\n    char s[4];\n\n    scanf(\"%s\",s);\n\n    for (int i = 0; i < 3; i++)\n    {\n        s[i]=(s[i]=='1')? '9':'1';\n    }\n\n    printf(\"%s\",s);\n\n    return 0;\n}", "language": "C", "metadata": {"date": 1588699791, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "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/C/s184610501.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s184610501", "user_id": "u007202328"}, "prompt_components": {"gold_output": "991\n", "input_to_evaluate": "#include<stdio.h>\n#include<stdlib.h>\n\nint main(void)\n{\n    char s[4];\n\n    scanf(\"%s\",s);\n\n    for (int i = 0; i < 3; i++)\n    {\n        s[i]=(s[i]=='1')? '9':'1';\n    }\n\n    printf(\"%s\",s);\n\n    return 0;\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": 207, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s357787484", "group_id": "codeNet:p03242", "input_text": "#include <stdio.h>\n\nvoid Do(int n){\n  if(n > 10) Do(n / 10);\n  if(n % 10 == 1) printf(\"9\");\n  else printf(\"1\");\n}\n\nint main(void){\n  int n;\n  scanf(\"%d\", &n);\n  Do(n);\n  printf(\"\\n\");\n  return 0;\n}\n", "language": "C", "metadata": {"date": 1538270049, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "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/C/s357787484.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s357787484", "user_id": "u194243606"}, "prompt_components": {"gold_output": "991\n", "input_to_evaluate": "#include <stdio.h>\n\nvoid Do(int n){\n  if(n > 10) Do(n / 10);\n  if(n % 10 == 1) printf(\"9\");\n  else printf(\"1\");\n}\n\nint main(void){\n  int n;\n  scanf(\"%d\", &n);\n  Do(n);\n  printf(\"\\n\");\n  return 0;\n}\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": 198, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s820194141", "group_id": "codeNet:p03243", "input_text": "#include<stdio.h>\nint main(void){\n\tint N,x,a,b,c,i;\n\tscanf(\"%d\", &N);\n\tx = N;\n\tfor (i = 0; i < 999 - N; i++){\n\t\t\n\t\tif (x % 111 == 0){\n\t\t\tbreak;\n\t\t}\n\t\tx++;\n\t}\n\tprintf(\"%d\", x);\n\n\t\treturn 0;\n}", "language": "C", "metadata": {"date": 1554500103, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "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/C/s820194141.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s820194141", "user_id": "u635508156"}, "prompt_components": {"gold_output": "111\n", "input_to_evaluate": "#include<stdio.h>\nint main(void){\n\tint N,x,a,b,c,i;\n\tscanf(\"%d\", &N);\n\tx = N;\n\tfor (i = 0; i < 999 - N; i++){\n\t\t\n\t\tif (x % 111 == 0){\n\t\t\tbreak;\n\t\t}\n\t\tx++;\n\t}\n\tprintf(\"%d\", x);\n\n\t\treturn 0;\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": 190, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s360870974", "group_id": "codeNet:p03243", "input_text": "#include<stdio.h>\nint main()\n{\n   int n,x,temp=0,i=0;\n   scanf(\"%d\",&n);\n   while(n!=0){\n    x=n%10;\n    if(x>temp){\n        temp=x;\n    }\n    n=n/10;\n    i++;\n   }\n   while(i>0){\n    printf(\"%d\",temp);\n    i--;\n   }\n   return 0;\n\n}\n", "language": "C", "metadata": {"date": 1541498169, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "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/C/s360870974.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s360870974", "user_id": "u293712835"}, "prompt_components": {"gold_output": "111\n", "input_to_evaluate": "#include<stdio.h>\nint main()\n{\n   int n,x,temp=0,i=0;\n   scanf(\"%d\",&n);\n   while(n!=0){\n    x=n%10;\n    if(x>temp){\n        temp=x;\n    }\n    n=n/10;\n    i++;\n   }\n   while(i>0){\n    printf(\"%d\",temp);\n    i--;\n   }\n   return 0;\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": 233, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s960024356", "group_id": "codeNet:p03244", "input_text": "#include <stdio.h>\n#include<stdlib.h>\nint compare(const void *a,const void *b){\n    return *(int*)a-*(int*)b;\n}\nint Min(int a,int b){\n    if(a<=b){\n        return a;\n    }else{\n        return b;\n    }\n}\nint main()\n{   int ans,nodd,neven,j=0,k=0,i,n,odd[100000],even[100000],oddpr=0,oddse=0,evenpr=0,evense=0,cnt=0;\n    scanf(\"%d\",&n);\n    for(i=0;i<n;i++){\n        if(i%2==0){\n            scanf(\"%d\",&odd[j]);\n            j++;\n        }else{\n            scanf(\"%d\",&even[k]);\n            k++;\n        }\n    }\n    qsort(odd,j,sizeof(int),compare);\n    qsort(even,k,sizeof(int),compare);\n    /*for(i=0;i<j;i++){\n        printf(\"%d \",odd[i]);\n    }\n    for(i=0;i<k;i++){\n        printf(\"%d \",even[i]);\n    }\n   */\n    for(i=0;i<j-1;i++){\n        if(odd[i]==odd[i+1]){\n            cnt++;\n        }else{\n            if(cnt>oddpr){\n                nodd=odd[i];\n                oddse=oddpr;\n                oddpr=cnt;\n            }else if(cnt>oddse){\n                oddse=cnt;\n            }\n            cnt=0;\n        }\n    }\n    if(cnt>oddpr){\n                nodd=odd[i];\n                oddse=oddpr;\n                oddpr=cnt;\n            }else if(cnt>oddse){\n                oddse=cnt;\n            }\n    cnt=0;\n    for(i=0;i<k-1;i++){\n        if(even[i]==even[i+1]){\n            cnt++;\n        }else{\n            if(cnt>evenpr){\n                neven=even[i];\n                evense=evenpr;\n                evenpr=cnt;\n            }else if(cnt>evense){\n                evense=cnt;\n            }\n            cnt=0;\n        }\n    }\n    if(cnt>evenpr){\n                neven=even[i];\n                evense=evenpr;\n                evenpr=cnt;\n            }else if(cnt>evense){\n                evense=cnt;\n            }\n    if(neven==nodd&&(evense!=0||oddse!=0)){\n        ans=Min(oddpr+evense,evenpr+oddse);\n    }else{\n        ans=oddpr+evenpr;\n    }\n    printf(\"%d\",ans);\n    \n    return 0;\n}\n", "language": "C", "metadata": {"date": 1542729782, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "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/C/s960024356.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s960024356", "user_id": "u993046043"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "#include <stdio.h>\n#include<stdlib.h>\nint compare(const void *a,const void *b){\n    return *(int*)a-*(int*)b;\n}\nint Min(int a,int b){\n    if(a<=b){\n        return a;\n    }else{\n        return b;\n    }\n}\nint main()\n{   int ans,nodd,neven,j=0,k=0,i,n,odd[100000],even[100000],oddpr=0,oddse=0,evenpr=0,evense=0,cnt=0;\n    scanf(\"%d\",&n);\n    for(i=0;i<n;i++){\n        if(i%2==0){\n            scanf(\"%d\",&odd[j]);\n            j++;\n        }else{\n            scanf(\"%d\",&even[k]);\n            k++;\n        }\n    }\n    qsort(odd,j,sizeof(int),compare);\n    qsort(even,k,sizeof(int),compare);\n    /*for(i=0;i<j;i++){\n        printf(\"%d \",odd[i]);\n    }\n    for(i=0;i<k;i++){\n        printf(\"%d \",even[i]);\n    }\n   */\n    for(i=0;i<j-1;i++){\n        if(odd[i]==odd[i+1]){\n            cnt++;\n        }else{\n            if(cnt>oddpr){\n                nodd=odd[i];\n                oddse=oddpr;\n                oddpr=cnt;\n            }else if(cnt>oddse){\n                oddse=cnt;\n            }\n            cnt=0;\n        }\n    }\n    if(cnt>oddpr){\n                nodd=odd[i];\n                oddse=oddpr;\n                oddpr=cnt;\n            }else if(cnt>oddse){\n                oddse=cnt;\n            }\n    cnt=0;\n    for(i=0;i<k-1;i++){\n        if(even[i]==even[i+1]){\n            cnt++;\n        }else{\n            if(cnt>evenpr){\n                neven=even[i];\n                evense=evenpr;\n                evenpr=cnt;\n            }else if(cnt>evense){\n                evense=cnt;\n            }\n            cnt=0;\n        }\n    }\n    if(cnt>evenpr){\n                neven=even[i];\n                evense=evenpr;\n                evenpr=cnt;\n            }else if(cnt>evense){\n                evense=cnt;\n            }\n    if(neven==nodd&&(evense!=0||oddse!=0)){\n        ans=Min(oddpr+evense,evenpr+oddse);\n    }else{\n        ans=oddpr+evenpr;\n    }\n    printf(\"%d\",ans);\n    \n    return 0;\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": 1888, "cpu_time_ms": 22, "memory_kb": 824}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s256488064", "group_id": "codeNet:p03244", "input_text": "#include <stdio.h>\n#include <stdlib.h>\n\nmain()\n{\n  int n,*a,*b,i,maxa=0,maxai=0,maxb=0,maxbi=0,count;\n  int maxa2=0,maxai2=0,maxb2=0,maxbi2=0;\n  int c[1000000]={};\n  scanf(\"%d\",&n);\n  a = malloc(sizeof(int)*(n/2));\n  b = malloc(sizeof(int)*(n/2));\n  for(i=0; i<n/2; i++)\n  {\n    scanf(\"%d%d\",&a[i],&b[i]);\n  }\n//aの処理  \n  for(i=0; i<n/2; i++)\n  {\n    c[a[i]]++;\n    if(maxa<c[a[i]])\n    {\n      maxa2 = maxa;\n      maxai2 = maxai;\n      maxa = c[a[i]];\n      maxai = a[i];\n    }\n  }\n//bの処理\n  for(i=0; i<1000000; i++)\n    c[i] = 0;\n  for(i=0; i<n/2; i++)\n  {\n    c[b[i]]++;\n    if(maxb<c[b[i]])\n    {\n      maxb2 = maxb;\n      maxbi2 = maxbi;\n      maxb = c[b[i]];\n      maxbi = b[i];\n    }\n  }\n  count = n - maxa - maxb;\n  if(count!=0)\n  {\n      if(maxai!=maxbi)\n        printf(\"%d\\n\",count);\n      else if(maxa>=maxb)\n        printf(\"%d\\n\",n-maxa-maxb2);\n      else\n        printf(\"%d\\n\",n-maxa2-maxb);\n  }\n  else\n  {\n    if(a[0]==b[0])\n      printf(\"%d\\n\",n/2);\n    else\n      printf(\"0\\n\");\n  }\n}", "language": "C", "metadata": {"date": 1538273070, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "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/C/s256488064.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s256488064", "user_id": "u350997995"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "#include <stdio.h>\n#include <stdlib.h>\n\nmain()\n{\n  int n,*a,*b,i,maxa=0,maxai=0,maxb=0,maxbi=0,count;\n  int maxa2=0,maxai2=0,maxb2=0,maxbi2=0;\n  int c[1000000]={};\n  scanf(\"%d\",&n);\n  a = malloc(sizeof(int)*(n/2));\n  b = malloc(sizeof(int)*(n/2));\n  for(i=0; i<n/2; i++)\n  {\n    scanf(\"%d%d\",&a[i],&b[i]);\n  }\n//aの処理  \n  for(i=0; i<n/2; i++)\n  {\n    c[a[i]]++;\n    if(maxa<c[a[i]])\n    {\n      maxa2 = maxa;\n      maxai2 = maxai;\n      maxa = c[a[i]];\n      maxai = a[i];\n    }\n  }\n//bの処理\n  for(i=0; i<1000000; i++)\n    c[i] = 0;\n  for(i=0; i<n/2; i++)\n  {\n    c[b[i]]++;\n    if(maxb<c[b[i]])\n    {\n      maxb2 = maxb;\n      maxbi2 = maxbi;\n      maxb = c[b[i]];\n      maxbi = b[i];\n    }\n  }\n  count = n - maxa - maxb;\n  if(count!=0)\n  {\n      if(maxai!=maxbi)\n        printf(\"%d\\n\",count);\n      else if(maxa>=maxb)\n        printf(\"%d\\n\",n-maxa-maxb2);\n      else\n        printf(\"%d\\n\",n-maxa2-maxb);\n  }\n  else\n  {\n    if(a[0]==b[0])\n      printf(\"%d\\n\",n/2);\n    else\n      printf(\"0\\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": 1010, "cpu_time_ms": 12, "memory_kb": 4480}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s716612748", "group_id": "codeNet:p03252", "input_text": "#include <stdio.h>\n#include <string.h>\n\nint main(void){\n    char S[200001];\n    char T[200001];\n    memset(&S,'\\0',sizeof(S));\n    memset(&T,'\\0',sizeof(T));\n    scanf(\"%s\",S);\n    scanf(\"%s\",T);\n    \n    int size = strlen(S);\n\n    char alpha[26];\n    memset(&alpha,'\\0',sizeof(alpha));\n    for(int i = 0;i<size;i++){\n        // printf(\"alpha %c\\n\",alpha[T[i] - 'a']);\n        // printf(\"alalpha %c\\n\",alpha[alpha[T[i] - 'a'] - 'a']);\n        if(alpha[T[i] - 'a'] == '\\0'){\n            if(S[i] != T[i]){\n                alpha[T[i] - 'a'] = S[i];\n            }\n        }else if(alpha[T[i] - 'a'] != S[i]){\n            printf(\"No\\n\");\n            return 0;\n        }else{\n            continue;\n        }\n    }\n    // printf(\"S %s\\n\",S);\n    // printf(\"T %s\\n\",T);\n    printf(\"Yes\\n\");\n    return 0;\n}", "language": "C", "metadata": {"date": 1539869870, "filename_ext": "c", "original_language": "C (Clang 3.8.0)", "problem_description_relpath": "problem_descriptions/p03252.html", "problem_id": "p03252", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03252/input.txt", "sample_output_relpath": "derived/input_output/data/p03252/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03252/C/s716612748.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s716612748", "user_id": "u633463117"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "#include <stdio.h>\n#include <string.h>\n\nint main(void){\n    char S[200001];\n    char T[200001];\n    memset(&S,'\\0',sizeof(S));\n    memset(&T,'\\0',sizeof(T));\n    scanf(\"%s\",S);\n    scanf(\"%s\",T);\n    \n    int size = strlen(S);\n\n    char alpha[26];\n    memset(&alpha,'\\0',sizeof(alpha));\n    for(int i = 0;i<size;i++){\n        // printf(\"alpha %c\\n\",alpha[T[i] - 'a']);\n        // printf(\"alalpha %c\\n\",alpha[alpha[T[i] - 'a'] - 'a']);\n        if(alpha[T[i] - 'a'] == '\\0'){\n            if(S[i] != T[i]){\n                alpha[T[i] - 'a'] = S[i];\n            }\n        }else if(alpha[T[i] - 'a'] != S[i]){\n            printf(\"No\\n\");\n            return 0;\n        }else{\n            continue;\n        }\n    }\n    // printf(\"S %s\\n\",S);\n    // printf(\"T %s\\n\",T);\n    printf(\"Yes\\n\");\n    return 0;\n}", "problem_context": "Score : 300 points\n\nProblem Statement\n\nYou are given strings S and T consisting of lowercase English letters.\n\nYou can perform the following operation on S any number of times:\n\nOperation: Choose two distinct lowercase English letters c_1 and c_2, then replace every occurrence of c_1 with c_2, and every occurrence of c_2 with c_1.\n\nDetermine if S and T can be made equal by performing the operation zero or more times.\n\nConstraints\n\n1 \\leq |S| \\leq 2 \\times 10^5\n\n|S| = |T|\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 S and T can be made equal, print Yes; otherwise, print No.\n\nSample Input 1\n\nazzel\napple\n\nSample Output 1\n\nYes\n\nazzel can be changed to apple, as follows:\n\nChoose e as c_1 and l as c_2. azzel becomes azzle.\n\nChoose z as c_1 and p as c_2. azzle becomes apple.\n\nSample Input 2\n\nchokudai\nredcoder\n\nSample Output 2\n\nNo\n\nNo sequences of operation can change chokudai to redcoder.\n\nSample Input 3\n\nabcdefghijklmnopqrstuvwxyz\nibyhqfrekavclxjstdwgpzmonu\n\nSample Output 3\n\nYes", "sample_input": "azzel\napple\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p03252", "source_text": "Score : 300 points\n\nProblem Statement\n\nYou are given strings S and T consisting of lowercase English letters.\n\nYou can perform the following operation on S any number of times:\n\nOperation: Choose two distinct lowercase English letters c_1 and c_2, then replace every occurrence of c_1 with c_2, and every occurrence of c_2 with c_1.\n\nDetermine if S and T can be made equal by performing the operation zero or more times.\n\nConstraints\n\n1 \\leq |S| \\leq 2 \\times 10^5\n\n|S| = |T|\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 S and T can be made equal, print Yes; otherwise, print No.\n\nSample Input 1\n\nazzel\napple\n\nSample Output 1\n\nYes\n\nazzel can be changed to apple, as follows:\n\nChoose e as c_1 and l as c_2. azzel becomes azzle.\n\nChoose z as c_1 and p as c_2. azzle becomes apple.\n\nSample Input 2\n\nchokudai\nredcoder\n\nSample Output 2\n\nNo\n\nNo sequences of operation can change chokudai to redcoder.\n\nSample Input 3\n\nabcdefghijklmnopqrstuvwxyz\nibyhqfrekavclxjstdwgpzmonu\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": 798, "cpu_time_ms": 2, "memory_kb": 512}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s688247693", "group_id": "codeNet:p03254", "input_text": "#include <stdio.h>\n\nint main()\n{\n\tint i, N, x, a[101];\n\tscanf(\"%d %d\", &N, &x);\n\tfor (i = 1; i <= N; i++) scanf(\"%d\", &(a[i]));\n\t\n\tint count = 0, min, argmin, flag[101] = {};\n\twhile (1) {\n\t\tmin = 1000000001;\n\t\targmin = 0;\n\t\tfor (i = 1; i <= N; i++) {\n\t\t\tif (flag[i] == 0 && a[i] < min) {\n\t\t\t\tmin = a[i];\n\t\t\t\targmin = i;\n\t\t\t}\n\t\t}\n\t\tif (x < min) break;\n\t\telse if (argmin == 0) {\n\t\t\tif (x > 0) count--;\n\t\t\tbreak;\n\t\t} else {\n\t\t\tx -= min;\n\t\t\tflag[argmin] = 1;\n\t\t\tcount++;\n\t\t}\n\t}\n\n\tprintf(\"%d\\n\", count);\n\tfflush(stdout);\n\treturn 0;\n}", "language": "C", "metadata": {"date": 1589069233, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "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/C/s688247693.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s688247693", "user_id": "u943800443"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "#include <stdio.h>\n\nint main()\n{\n\tint i, N, x, a[101];\n\tscanf(\"%d %d\", &N, &x);\n\tfor (i = 1; i <= N; i++) scanf(\"%d\", &(a[i]));\n\t\n\tint count = 0, min, argmin, flag[101] = {};\n\twhile (1) {\n\t\tmin = 1000000001;\n\t\targmin = 0;\n\t\tfor (i = 1; i <= N; i++) {\n\t\t\tif (flag[i] == 0 && a[i] < min) {\n\t\t\t\tmin = a[i];\n\t\t\t\targmin = i;\n\t\t\t}\n\t\t}\n\t\tif (x < min) break;\n\t\telse if (argmin == 0) {\n\t\t\tif (x > 0) count--;\n\t\t\tbreak;\n\t\t} else {\n\t\t\tx -= min;\n\t\t\tflag[argmin] = 1;\n\t\t\tcount++;\n\t\t}\n\t}\n\n\tprintf(\"%d\\n\", count);\n\tfflush(stdout);\n\treturn 0;\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": 528, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s195454292", "group_id": "codeNet:p03254", "input_text": "#include<stdio.h>\n#include<stdlib.h>\n\nint asc(const void *x, const void *y) {\n\tconst int* a=(const int*)x;\n\tconst int* b=(const int*)y;\n\tif(*a>*b)return 1;\n\tif(*a<*b)return -1;\n\treturn 0;\n}\n\nint main(){\n\n    int kids;\n    int candy_max;\n    int array[128] = {0};\n    int happy = 0;\n    int pointer = 0;\n    int num;\n\n    scanf(\"%d %d\\n\",&kids,&candy_max);\n    int candy = candy_max;\n\n    for(int i=0; i<kids; i++){\n        scanf(\"%d\",&array[i]);\n    }\n\n    //sort\n    qsort( array, kids, sizeof(array[0]), asc);\n\n    //degug\n    //printf(\"degug:\");\n    //for(int i=0; i<kids; i++){\n    //    printf(\"%d \", array[i]);\n    //}\n    //printf(\"\\n\");\n\n    //candyを小さいほうから割り当てる\n    for(int i=0; i < kids; i++){\n        candy -= array[i];\n        if(candy == 0){\n            happy++;\n            printf(\"%d\",happy);\n            return 0;\n        } \n        if(candy <= 0){\n            printf(\"%d\",happy);\n            return 0;\n        }\n        happy++;\n    }\n    \n    if(candy > 0 && candy != candy_max){\n        happy--;\n        printf(\"%d\",happy);\n        return 0;\n    }\n\n    printf(\"0\");\n    return 0;\n}\n", "language": "C", "metadata": {"date": 1537067795, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "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/C/s195454292.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s195454292", "user_id": "u071695942"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "#include<stdio.h>\n#include<stdlib.h>\n\nint asc(const void *x, const void *y) {\n\tconst int* a=(const int*)x;\n\tconst int* b=(const int*)y;\n\tif(*a>*b)return 1;\n\tif(*a<*b)return -1;\n\treturn 0;\n}\n\nint main(){\n\n    int kids;\n    int candy_max;\n    int array[128] = {0};\n    int happy = 0;\n    int pointer = 0;\n    int num;\n\n    scanf(\"%d %d\\n\",&kids,&candy_max);\n    int candy = candy_max;\n\n    for(int i=0; i<kids; i++){\n        scanf(\"%d\",&array[i]);\n    }\n\n    //sort\n    qsort( array, kids, sizeof(array[0]), asc);\n\n    //degug\n    //printf(\"degug:\");\n    //for(int i=0; i<kids; i++){\n    //    printf(\"%d \", array[i]);\n    //}\n    //printf(\"\\n\");\n\n    //candyを小さいほうから割り当てる\n    for(int i=0; i < kids; i++){\n        candy -= array[i];\n        if(candy == 0){\n            happy++;\n            printf(\"%d\",happy);\n            return 0;\n        } \n        if(candy <= 0){\n            printf(\"%d\",happy);\n            return 0;\n        }\n        happy++;\n    }\n    \n    if(candy > 0 && candy != candy_max){\n        happy--;\n        printf(\"%d\",happy);\n        return 0;\n    }\n\n    printf(\"0\");\n    return 0;\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": 1127, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s574316170", "group_id": "codeNet:p03264", "input_text": "#include <stdio.h>\n\nint main(void) {\n\tint a,b,c,d;\n\tscanf(\"%d\",&a);\n\tif(a%2){\n\t\tb=a/2;\n\t\tc=a/2+1;\n\t}else{\n\t\tb=a/2;\n\t\tc=a/2;\n\t}\n\td=b*c;\n\tprintf(\"%d\",d);\n\treturn 0;\n}\n", "language": "C", "metadata": {"date": 1558381249, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "problem_description_relpath": "problem_descriptions/p03264.html", "problem_id": "p03264", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03264/input.txt", "sample_output_relpath": "derived/input_output/data/p03264/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03264/C/s574316170.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s574316170", "user_id": "u618381309"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "#include <stdio.h>\n\nint main(void) {\n\tint a,b,c,d;\n\tscanf(\"%d\",&a);\n\tif(a%2){\n\t\tb=a/2;\n\t\tc=a/2+1;\n\t}else{\n\t\tb=a/2;\n\t\tc=a/2;\n\t}\n\td=b*c;\n\tprintf(\"%d\",d);\n\treturn 0;\n}\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nFind the number of ways to choose a pair of an even number and an odd number from the positive integers between 1 and K (inclusive). The order does not matter.\n\nConstraints\n\n2\\leq K\\leq 100\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 number of ways to choose a pair of an even number and an odd number from the positive integers between 1 and K (inclusive).\n\nSample Input 1\n\n3\n\nSample Output 1\n\n2\n\nTwo pairs can be chosen: (2,1) and (2,3).\n\nSample Input 2\n\n6\n\nSample Output 2\n\n9\n\nSample Input 3\n\n11\n\nSample Output 3\n\n30\n\nSample Input 4\n\n50\n\nSample Output 4\n\n625", "sample_input": "3\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03264", "source_text": "Score : 100 points\n\nProblem Statement\n\nFind the number of ways to choose a pair of an even number and an odd number from the positive integers between 1 and K (inclusive). The order does not matter.\n\nConstraints\n\n2\\leq K\\leq 100\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 number of ways to choose a pair of an even number and an odd number from the positive integers between 1 and K (inclusive).\n\nSample Input 1\n\n3\n\nSample Output 1\n\n2\n\nTwo pairs can be chosen: (2,1) and (2,3).\n\nSample Input 2\n\n6\n\nSample Output 2\n\n9\n\nSample Input 3\n\n11\n\nSample Output 3\n\n30\n\nSample Input 4\n\n50\n\nSample Output 4\n\n625", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 165, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s557190533", "group_id": "codeNet:p03264", "input_text": "#include <stdio.h>\n\nint main(void){\n    int n, ans;\n    scanf(\"%d\", &n);\n    ans = n*n/4;\n    printf(\"%d\\n\", ans);\n    \n    return 0;\n}", "language": "C", "metadata": {"date": 1546122801, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "problem_description_relpath": "problem_descriptions/p03264.html", "problem_id": "p03264", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03264/input.txt", "sample_output_relpath": "derived/input_output/data/p03264/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03264/C/s557190533.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s557190533", "user_id": "u058295774"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "#include <stdio.h>\n\nint main(void){\n    int n, ans;\n    scanf(\"%d\", &n);\n    ans = n*n/4;\n    printf(\"%d\\n\", ans);\n    \n    return 0;\n}", "problem_context": "Score : 100 points\n\nProblem Statement\n\nFind the number of ways to choose a pair of an even number and an odd number from the positive integers between 1 and K (inclusive). The order does not matter.\n\nConstraints\n\n2\\leq K\\leq 100\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 number of ways to choose a pair of an even number and an odd number from the positive integers between 1 and K (inclusive).\n\nSample Input 1\n\n3\n\nSample Output 1\n\n2\n\nTwo pairs can be chosen: (2,1) and (2,3).\n\nSample Input 2\n\n6\n\nSample Output 2\n\n9\n\nSample Input 3\n\n11\n\nSample Output 3\n\n30\n\nSample Input 4\n\n50\n\nSample Output 4\n\n625", "sample_input": "3\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03264", "source_text": "Score : 100 points\n\nProblem Statement\n\nFind the number of ways to choose a pair of an even number and an odd number from the positive integers between 1 and K (inclusive). The order does not matter.\n\nConstraints\n\n2\\leq K\\leq 100\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 number of ways to choose a pair of an even number and an odd number from the positive integers between 1 and K (inclusive).\n\nSample Input 1\n\n3\n\nSample Output 1\n\n2\n\nTwo pairs can be chosen: (2,1) and (2,3).\n\nSample Input 2\n\n6\n\nSample Output 2\n\n9\n\nSample Input 3\n\n11\n\nSample Output 3\n\n30\n\nSample Input 4\n\n50\n\nSample Output 4\n\n625", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 135, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s206776952", "group_id": "codeNet:p03264", "input_text": "#include <stdio.h>\n\nint main(){\n    //読み取り\n    int a;\n    int ans;\n    scanf(\"%d\",&a);\n    if(a%2==0){\n        ans = (a/2)*(a/2);\n        printf(\"%d\",ans);\n    }else{\n        ans = ((a+1)/2) * ((a-1)/2);\n        printf(\"%d\",ans);\n    }\n    return 0;\n}", "language": "C", "metadata": {"date": 1539363947, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "problem_description_relpath": "problem_descriptions/p03264.html", "problem_id": "p03264", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03264/input.txt", "sample_output_relpath": "derived/input_output/data/p03264/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03264/C/s206776952.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s206776952", "user_id": "u028413707"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "#include <stdio.h>\n\nint main(){\n    //読み取り\n    int a;\n    int ans;\n    scanf(\"%d\",&a);\n    if(a%2==0){\n        ans = (a/2)*(a/2);\n        printf(\"%d\",ans);\n    }else{\n        ans = ((a+1)/2) * ((a-1)/2);\n        printf(\"%d\",ans);\n    }\n    return 0;\n}", "problem_context": "Score : 100 points\n\nProblem Statement\n\nFind the number of ways to choose a pair of an even number and an odd number from the positive integers between 1 and K (inclusive). The order does not matter.\n\nConstraints\n\n2\\leq K\\leq 100\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 number of ways to choose a pair of an even number and an odd number from the positive integers between 1 and K (inclusive).\n\nSample Input 1\n\n3\n\nSample Output 1\n\n2\n\nTwo pairs can be chosen: (2,1) and (2,3).\n\nSample Input 2\n\n6\n\nSample Output 2\n\n9\n\nSample Input 3\n\n11\n\nSample Output 3\n\n30\n\nSample Input 4\n\n50\n\nSample Output 4\n\n625", "sample_input": "3\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03264", "source_text": "Score : 100 points\n\nProblem Statement\n\nFind the number of ways to choose a pair of an even number and an odd number from the positive integers between 1 and K (inclusive). The order does not matter.\n\nConstraints\n\n2\\leq K\\leq 100\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 number of ways to choose a pair of an even number and an odd number from the positive integers between 1 and K (inclusive).\n\nSample Input 1\n\n3\n\nSample Output 1\n\n2\n\nTwo pairs can be chosen: (2,1) and (2,3).\n\nSample Input 2\n\n6\n\nSample Output 2\n\n9\n\nSample Input 3\n\n11\n\nSample Output 3\n\n30\n\nSample Input 4\n\n50\n\nSample Output 4\n\n625", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 259, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s739804434", "group_id": "codeNet:p03264", "input_text": "#include<stdio.h>\n\nint main(void){\nint a;\nscanf(\"%d\\n\",a);\nprintf(\"%d\",(a/2)*((a+1)/2));\n}", "language": "C", "metadata": {"date": 1536161380, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "problem_description_relpath": "problem_descriptions/p03264.html", "problem_id": "p03264", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03264/input.txt", "sample_output_relpath": "derived/input_output/data/p03264/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03264/C/s739804434.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s739804434", "user_id": "u554988565"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "#include<stdio.h>\n\nint main(void){\nint a;\nscanf(\"%d\\n\",a);\nprintf(\"%d\",(a/2)*((a+1)/2));\n}", "problem_context": "Score : 100 points\n\nProblem Statement\n\nFind the number of ways to choose a pair of an even number and an odd number from the positive integers between 1 and K (inclusive). The order does not matter.\n\nConstraints\n\n2\\leq K\\leq 100\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 number of ways to choose a pair of an even number and an odd number from the positive integers between 1 and K (inclusive).\n\nSample Input 1\n\n3\n\nSample Output 1\n\n2\n\nTwo pairs can be chosen: (2,1) and (2,3).\n\nSample Input 2\n\n6\n\nSample Output 2\n\n9\n\nSample Input 3\n\n11\n\nSample Output 3\n\n30\n\nSample Input 4\n\n50\n\nSample Output 4\n\n625", "sample_input": "3\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03264", "source_text": "Score : 100 points\n\nProblem Statement\n\nFind the number of ways to choose a pair of an even number and an odd number from the positive integers between 1 and K (inclusive). The order does not matter.\n\nConstraints\n\n2\\leq K\\leq 100\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 number of ways to choose a pair of an even number and an odd number from the positive integers between 1 and K (inclusive).\n\nSample Input 1\n\n3\n\nSample Output 1\n\n2\n\nTwo pairs can be chosen: (2,1) and (2,3).\n\nSample Input 2\n\n6\n\nSample Output 2\n\n9\n\nSample Input 3\n\n11\n\nSample Output 3\n\n30\n\nSample Input 4\n\n50\n\nSample Output 4\n\n625", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 90, "cpu_time_ms": 98, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s878132720", "group_id": "codeNet:p03265", "input_text": "/*  ex7-1\n    toshiwaka */\n\n//point構造体\ntypedef struct point{\n    int x_elem;\n    int y_elem;\n}point;\n\n//ref_pointからx,y軸方向にshift_x,shift_yだけそれぞれ移動\n//移動後の点の座標をshifted_pointのメンバに代入\nvoid shift_point(point *shifted_point, point *ref_point, int shift_x, int shift_y);\n\n#include <stdio.h>\n\nint main(void) {\n  //point:正方形の頂点\n  //diff:2点間のx,y軸方向の距離\n  point point[4], diff;\n\n  //入力\n  scanf(\"%d %d %d %d\", &point[0].x_elem, &point[0].y_elem, &point[1].x_elem, &point[1].y_elem);\n\n  //2点間のx,y軸方向の距離\n  diff.x_elem = point[1].x_elem - point[0].x_elem;\n  diff.y_elem = point[1].y_elem - point[0].y_elem;\n\n  //残りの２点を算出\n  shift_point(&point[2], &point[1], -1 * diff.y_elem, diff.x_elem);\n  shift_point(&point[3], &point[0], -1 * diff.y_elem, diff.x_elem);\n\n  //出力\n  printf(\"%d %d %d %d\\n\", point[2].x_elem, point[2].y_elem, point[3].x_elem, point[3].y_elem);\n\n  return 0;\n}\n\n\n//ref_pointからx,y軸方向にshift_x,shift_yだけそれぞれ移動\n//移動後の点の座標をshifted_pointのメンバに代入\nvoid shift_point(point *shifted_point, point *ref_point, int shift_x, int shift_y){\n  shifted_point->x_elem = ref_point->x_elem + shift_x;\n  shifted_point->y_elem = ref_point->y_elem + shift_y;\n};", "language": "C", "metadata": {"date": 1594657652, "filename_ext": "c", "original_language": "C (GCC 9.2.1)", "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/C/s878132720.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s878132720", "user_id": "u727097577"}, "prompt_components": {"gold_output": "-1 1 -1 0\n", "input_to_evaluate": "/*  ex7-1\n    toshiwaka */\n\n//point構造体\ntypedef struct point{\n    int x_elem;\n    int y_elem;\n}point;\n\n//ref_pointからx,y軸方向にshift_x,shift_yだけそれぞれ移動\n//移動後の点の座標をshifted_pointのメンバに代入\nvoid shift_point(point *shifted_point, point *ref_point, int shift_x, int shift_y);\n\n#include <stdio.h>\n\nint main(void) {\n  //point:正方形の頂点\n  //diff:2点間のx,y軸方向の距離\n  point point[4], diff;\n\n  //入力\n  scanf(\"%d %d %d %d\", &point[0].x_elem, &point[0].y_elem, &point[1].x_elem, &point[1].y_elem);\n\n  //2点間のx,y軸方向の距離\n  diff.x_elem = point[1].x_elem - point[0].x_elem;\n  diff.y_elem = point[1].y_elem - point[0].y_elem;\n\n  //残りの２点を算出\n  shift_point(&point[2], &point[1], -1 * diff.y_elem, diff.x_elem);\n  shift_point(&point[3], &point[0], -1 * diff.y_elem, diff.x_elem);\n\n  //出力\n  printf(\"%d %d %d %d\\n\", point[2].x_elem, point[2].y_elem, point[3].x_elem, point[3].y_elem);\n\n  return 0;\n}\n\n\n//ref_pointからx,y軸方向にshift_x,shift_yだけそれぞれ移動\n//移動後の点の座標をshifted_pointのメンバに代入\nvoid shift_point(point *shifted_point, point *ref_point, int shift_x, int shift_y){\n  shifted_point->x_elem = ref_point->x_elem + shift_x;\n  shifted_point->y_elem = ref_point->y_elem + shift_y;\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": 1329, "cpu_time_ms": 4, "memory_kb": 1704}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s731623446", "group_id": "codeNet:p03265", "input_text": "#include <stdio.h>\n\nint main(void) {\n    int h, w;\n    char a[100][100];\n    //入力\n    scanf(\"%d %d\", &h, &w);\n    for (int i = 0; i < h; i++) {\n        scanf(\"%s\", a[i]);\n    }\n\n    for (int i = 0; i < h; i++) {\n        int flag = 0;\n        for (int j = 0; j < w; j++) {\n            if (a[i][j] == '#') { flag = 1; }\n        }\n        if (!flag) {\n            for (int l = i; l < h - 1; l++) {\n                for (int j = 0; j < w; j++) {\n                    a[l][j] = a[l + 1][j];\n                }\n            }\n            h--;\n            i--;\n        }\n    }\n    for (int i = 0; i < w; i++) {\n        int flag = 0;\n        for (int j = 0; j < h; j++) {\n            if (a[j][i] == '#') { flag = 1; }\n        }\n        if (!flag) {\n            for (int l = i; l < w - 1; l++) {\n                for (int j = 0; j < h; j++) {\n                    a[j][l] = a[j][l + 1];\n                }\n            }\n            i--;\n            w--;\n        }\n    }\n\n    //出力\n    for (int i = 0; i < h; i++) {\n        for (int j = 0; j < w; j++) {\n            printf(\"%c\", a[i][j]);\n        }\n        printf(\"\\n\");\n    }\n\n    return 0;\n}", "language": "C", "metadata": {"date": 1590199930, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "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/C/s731623446.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s731623446", "user_id": "u347086824"}, "prompt_components": {"gold_output": "-1 1 -1 0\n", "input_to_evaluate": "#include <stdio.h>\n\nint main(void) {\n    int h, w;\n    char a[100][100];\n    //入力\n    scanf(\"%d %d\", &h, &w);\n    for (int i = 0; i < h; i++) {\n        scanf(\"%s\", a[i]);\n    }\n\n    for (int i = 0; i < h; i++) {\n        int flag = 0;\n        for (int j = 0; j < w; j++) {\n            if (a[i][j] == '#') { flag = 1; }\n        }\n        if (!flag) {\n            for (int l = i; l < h - 1; l++) {\n                for (int j = 0; j < w; j++) {\n                    a[l][j] = a[l + 1][j];\n                }\n            }\n            h--;\n            i--;\n        }\n    }\n    for (int i = 0; i < w; i++) {\n        int flag = 0;\n        for (int j = 0; j < h; j++) {\n            if (a[j][i] == '#') { flag = 1; }\n        }\n        if (!flag) {\n            for (int l = i; l < w - 1; l++) {\n                for (int j = 0; j < h; j++) {\n                    a[j][l] = a[j][l + 1];\n                }\n            }\n            i--;\n            w--;\n        }\n    }\n\n    //出力\n    for (int i = 0; i < h; i++) {\n        for (int j = 0; j < w; j++) {\n            printf(\"%c\", a[i][j]);\n        }\n        printf(\"\\n\");\n    }\n\n    return 0;\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": 1133, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s927776301", "group_id": "codeNet:p03267", "input_text": "#include<stdio.h>\n#include<string.h>\nint main(void)\n{\n  long int l;\n  long int n,m;\n  long int p[20], r[60];\n  long int i;\n  scanf(\"%ld\",&l);\n  n = 2*l;  m = 3*l-2;\n  printf(\"%ld %ld\\n\",n,m);\n  for(i=1;i<l;i++){\n    printf(\"%ld %ld %ld\\n\",i,i+1,0);\n    printf(\"%ld %ld %ld\\n\",i+4,i+5,1);\n  }\n  for(i=0;i<l;i++){\n    printf(\"%ld %ld %ld\\n\",i+1,i+5,0);\n  }\n  return 0;\n}\n", "language": "C", "metadata": {"date": 1538262537, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "problem_description_relpath": "problem_descriptions/p03267.html", "problem_id": "p03267", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03267/input.txt", "sample_output_relpath": "derived/input_output/data/p03267/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03267/C/s927776301.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s927776301", "user_id": "u543173665"}, "prompt_components": {"gold_output": "8 10\n1 2 0\n2 3 0\n3 4 0\n1 5 0\n2 6 0\n3 7 0\n4 8 0\n5 6 1\n6 7 1\n7 8 1\n", "input_to_evaluate": "#include<stdio.h>\n#include<string.h>\nint main(void)\n{\n  long int l;\n  long int n,m;\n  long int p[20], r[60];\n  long int i;\n  scanf(\"%ld\",&l);\n  n = 2*l;  m = 3*l-2;\n  printf(\"%ld %ld\\n\",n,m);\n  for(i=1;i<l;i++){\n    printf(\"%ld %ld %ld\\n\",i,i+1,0);\n    printf(\"%ld %ld %ld\\n\",i+4,i+5,1);\n  }\n  for(i=0;i<l;i++){\n    printf(\"%ld %ld %ld\\n\",i+1,i+5,0);\n  }\n  return 0;\n}\n", "problem_context": "Score : 700 points\n\nProblem Statement\n\nYou are given an integer L. Construct a directed graph that satisfies the conditions below. The graph may contain multiple edges between the same pair of vertices. It can be proved that such a graph always exists.\n\nThe number of vertices, N, is at most 20. The vertices are given ID numbers from 1 to N.\n\nThe number of edges, M, is at most 60. Each edge has an integer length between 0 and 10^6 (inclusive).\n\nEvery edge is directed from the vertex with the smaller ID to the vertex with the larger ID. That is, 1,2,...,N is one possible topological order of the vertices.\n\nThere are exactly L different paths from Vertex 1 to Vertex N. The lengths of these paths are all different, and they are integers between 0 and L-1.\n\nHere, the length of a path is the sum of the lengths of the edges contained in that path, and two paths are considered different when the sets of the edges contained in those paths are different.\n\nConstraints\n\n2 \\leq L \\leq 10^6\n\nL is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nL\n\nOutput\n\nIn the first line, print N and M, the number of the vertices and edges in your graph.\nIn the i-th of the following M lines, print three integers u_i,v_i and w_i, representing the starting vertex, the ending vertex and the length of the i-th edge.\nIf there are multiple solutions, any of them will be accepted.\n\nSample Input 1\n\n4\n\nSample Output 1\n\n8 10\n1 2 0\n2 3 0\n3 4 0\n1 5 0\n2 6 0\n3 7 0\n4 8 0\n5 6 1\n6 7 1\n7 8 1\n\nIn the graph represented by the sample output, there are four paths from Vertex 1 to N=8:\n\n1 → 2 → 3 → 4 → 8 with length 0\n\n1 → 2 → 3 → 7 → 8 with length 1\n\n1 → 2 → 6 → 7 → 8 with length 2\n\n1 → 5 → 6 → 7 → 8 with length 3\n\nThere are other possible solutions.\n\nSample Input 2\n\n5\n\nSample Output 2\n\n5 7\n1 2 0\n2 3 1\n3 4 0\n4 5 0\n2 4 0\n1 3 3\n3 5 1", "sample_input": "4\n"}, "reference_outputs": ["8 10\n1 2 0\n2 3 0\n3 4 0\n1 5 0\n2 6 0\n3 7 0\n4 8 0\n5 6 1\n6 7 1\n7 8 1\n"], "source_document_id": "p03267", "source_text": "Score : 700 points\n\nProblem Statement\n\nYou are given an integer L. Construct a directed graph that satisfies the conditions below. The graph may contain multiple edges between the same pair of vertices. It can be proved that such a graph always exists.\n\nThe number of vertices, N, is at most 20. The vertices are given ID numbers from 1 to N.\n\nThe number of edges, M, is at most 60. Each edge has an integer length between 0 and 10^6 (inclusive).\n\nEvery edge is directed from the vertex with the smaller ID to the vertex with the larger ID. That is, 1,2,...,N is one possible topological order of the vertices.\n\nThere are exactly L different paths from Vertex 1 to Vertex N. The lengths of these paths are all different, and they are integers between 0 and L-1.\n\nHere, the length of a path is the sum of the lengths of the edges contained in that path, and two paths are considered different when the sets of the edges contained in those paths are different.\n\nConstraints\n\n2 \\leq L \\leq 10^6\n\nL is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nL\n\nOutput\n\nIn the first line, print N and M, the number of the vertices and edges in your graph.\nIn the i-th of the following M lines, print three integers u_i,v_i and w_i, representing the starting vertex, the ending vertex and the length of the i-th edge.\nIf there are multiple solutions, any of them will be accepted.\n\nSample Input 1\n\n4\n\nSample Output 1\n\n8 10\n1 2 0\n2 3 0\n3 4 0\n1 5 0\n2 6 0\n3 7 0\n4 8 0\n5 6 1\n6 7 1\n7 8 1\n\nIn the graph represented by the sample output, there are four paths from Vertex 1 to N=8:\n\n1 → 2 → 3 → 4 → 8 with length 0\n\n1 → 2 → 3 → 7 → 8 with length 1\n\n1 → 2 → 6 → 7 → 8 with length 2\n\n1 → 5 → 6 → 7 → 8 with length 3\n\nThere are other possible solutions.\n\nSample Input 2\n\n5\n\nSample Output 2\n\n5 7\n1 2 0\n2 3 1\n3 4 0\n4 5 0\n2 4 0\n1 3 3\n3 5 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": 369, "cpu_time_ms": 563, "memory_kb": 46336}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s156512878", "group_id": "codeNet:p03268", "input_text": "#include <stdio.h>\n#include <math.h>\nint main(){\n  int n,k,buf,buf2;\n  scanf(\"%d%d\",&n,&k);\n  buf=n/k;//n%k==0\n  buf=pow(buf,3);\n  if(k%2==0){\n    buf2=((2*n)/k)-(n/k);\n    buf2=pow(buf2,3);\n  }\n  printf(\"%d\",buf+buf2);\n}", "language": "C", "metadata": {"date": 1556152806, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "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/C/s156512878.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s156512878", "user_id": "u755499606"}, "prompt_components": {"gold_output": "9\n", "input_to_evaluate": "#include <stdio.h>\n#include <math.h>\nint main(){\n  int n,k,buf,buf2;\n  scanf(\"%d%d\",&n,&k);\n  buf=n/k;//n%k==0\n  buf=pow(buf,3);\n  if(k%2==0){\n    buf2=((2*n)/k)-(n/k);\n    buf2=pow(buf2,3);\n  }\n  printf(\"%d\",buf+buf2);\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": "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": 221, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s807722374", "group_id": "codeNet:p03272", "input_text": "#include <stdio.h>\nint main(void){\n\tint a,b;\n\tscanf(\"%d %d\",&a,&b);\n\tprintf(\"%d\",(a-b)+1);\n\treturn 0;\n}", "language": "C", "metadata": {"date": 1553822053, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "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/C/s807722374.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s807722374", "user_id": "u168774513"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "#include <stdio.h>\nint main(void){\n\tint a,b;\n\tscanf(\"%d %d\",&a,&b);\n\tprintf(\"%d\",(a-b)+1);\n\treturn 0;\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": 103, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s894094606", "group_id": "codeNet:p03273", "input_text": "/* ex7-3\n   Sagzar1993  */\n\n#include <stdio.h>\n#include <stdlib.h>\n\nint main(void) {\n    int row, col, i, j;//行と列の数\n\n    /*  各行・各列が全て白であるか否かを記憶する配列\n        各行、各列について全てのマス目が白なら１、そうでなければ０ */\n    int *ptrWhiteRow, *ptrWhiteCol;\n    \n    char **ptrColor; //各マスの記号の配列\n    scanf(\"%d %d\", &row, &col); //行数、列数の入力\n\n    //各配列のポインタについて、メモリを動的確保\n    ptrColor = (char**)calloc(row, sizeof(char*));\n    ptrWhiteRow = (int*)calloc(row, sizeof(int));\n    ptrWhiteCol = (int*)calloc(row, sizeof(int));\n    //メモリの確保に失敗した場合はエラー終了\n    if(ptrColor == NULL || ptrWhiteRow == NULL || ptrWhiteCol == NULL){\n        exit(1);\n    }\n    //各行の要素分のメモリを確保\n    for(i = 0; i < row; i++){\n        ptrColor[i] = (char*)calloc(col, sizeof(char));\n        //メモリの確保に失敗した場合はエラー終了\n        if(ptrColor[i] == NULL){\n            exit(1);\n        }\n    }\n\n    for(i = 0; i < row; i++){\n        for(j = 0; j < col; j++){\n            scanf(\" %c\", &ptrColor[i][j]); //各マス目の色記号の入力\n        }\n    }\n\n    for(i = 0; i < row; i++){\n        for(j = 0; j < col; j++){\n            if(ptrColor[i][j] != '.'){\n                break; //各行について、白でないマス目があれば終了して次の行へ\n            }\n        }\n        if(j == col){\n            ptrWhiteRow[i] = 1; //行の全てのマス目が白ならwhiteRowに1を保存\n        }\n    }\n    \n    for(j = 0; j < col; j++){\n        for(i = 0; i < row; i++){\n            if(ptrColor[i][j] != '.'){\n                break; //各列について、白でないマス目があれば終了して次の行へ\n            }\n        }\n        if(i == row){\n            ptrWhiteCol[j] = 1; //列の全てのマス目が白ならwhiteColに1を保存\n        }\n    }\n    \n    for(i = 0; i < row; i++){\n        if(ptrWhiteRow[i] == 1){\n            continue;  //各行について、whiteRowを参照し、その行の全てのマス目が白ならスキップ\n        }\n\n        for(j = 0; j < col; j++){\n            if(ptrWhiteCol[j] == 1){\n                continue; //各行の各列のマス目について、その列が全てのマス目が白である列ならスキップ\n            }\n            printf(\"%c\", ptrColor[i][j]); //そのマス目の行と列がともに全て白でないときは出力\n        }\n        printf(\"\\n\"); //各行について、全てのマス目を調べ終えたら改行\n    }\n    \n    //ptrColorの各行の要素分のメモリを解放\n    for(i = 0; i < row; i++){\n        free(ptrColor[i]);\n    }\n    //ptrColorの各行の配列と他の２つの配列へのポインタの領域を解放\n    free(ptrColor);\n    free(ptrWhiteRow);\n    free(ptrWhiteCol);\n\n    return 0;\n}", "language": "C", "metadata": {"date": 1594594091, "filename_ext": "c", "original_language": "C (GCC 9.2.1)", "problem_description_relpath": "problem_descriptions/p03273.html", "problem_id": "p03273", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03273/input.txt", "sample_output_relpath": "derived/input_output/data/p03273/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03273/C/s894094606.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s894094606", "user_id": "u574211979"}, "prompt_components": {"gold_output": "###\n###\n.##\n", "input_to_evaluate": "/* ex7-3\n   Sagzar1993  */\n\n#include <stdio.h>\n#include <stdlib.h>\n\nint main(void) {\n    int row, col, i, j;//行と列の数\n\n    /*  各行・各列が全て白であるか否かを記憶する配列\n        各行、各列について全てのマス目が白なら１、そうでなければ０ */\n    int *ptrWhiteRow, *ptrWhiteCol;\n    \n    char **ptrColor; //各マスの記号の配列\n    scanf(\"%d %d\", &row, &col); //行数、列数の入力\n\n    //各配列のポインタについて、メモリを動的確保\n    ptrColor = (char**)calloc(row, sizeof(char*));\n    ptrWhiteRow = (int*)calloc(row, sizeof(int));\n    ptrWhiteCol = (int*)calloc(row, sizeof(int));\n    //メモリの確保に失敗した場合はエラー終了\n    if(ptrColor == NULL || ptrWhiteRow == NULL || ptrWhiteCol == NULL){\n        exit(1);\n    }\n    //各行の要素分のメモリを確保\n    for(i = 0; i < row; i++){\n        ptrColor[i] = (char*)calloc(col, sizeof(char));\n        //メモリの確保に失敗した場合はエラー終了\n        if(ptrColor[i] == NULL){\n            exit(1);\n        }\n    }\n\n    for(i = 0; i < row; i++){\n        for(j = 0; j < col; j++){\n            scanf(\" %c\", &ptrColor[i][j]); //各マス目の色記号の入力\n        }\n    }\n\n    for(i = 0; i < row; i++){\n        for(j = 0; j < col; j++){\n            if(ptrColor[i][j] != '.'){\n                break; //各行について、白でないマス目があれば終了して次の行へ\n            }\n        }\n        if(j == col){\n            ptrWhiteRow[i] = 1; //行の全てのマス目が白ならwhiteRowに1を保存\n        }\n    }\n    \n    for(j = 0; j < col; j++){\n        for(i = 0; i < row; i++){\n            if(ptrColor[i][j] != '.'){\n                break; //各列について、白でないマス目があれば終了して次の行へ\n            }\n        }\n        if(i == row){\n            ptrWhiteCol[j] = 1; //列の全てのマス目が白ならwhiteColに1を保存\n        }\n    }\n    \n    for(i = 0; i < row; i++){\n        if(ptrWhiteRow[i] == 1){\n            continue;  //各行について、whiteRowを参照し、その行の全てのマス目が白ならスキップ\n        }\n\n        for(j = 0; j < col; j++){\n            if(ptrWhiteCol[j] == 1){\n                continue; //各行の各列のマス目について、その列が全てのマス目が白である列ならスキップ\n            }\n            printf(\"%c\", ptrColor[i][j]); //そのマス目の行と列がともに全て白でないときは出力\n        }\n        printf(\"\\n\"); //各行について、全てのマス目を調べ終えたら改行\n    }\n    \n    //ptrColorの各行の要素分のメモリを解放\n    for(i = 0; i < row; i++){\n        free(ptrColor[i]);\n    }\n    //ptrColorの各行の配列と他の２つの配列へのポインタの領域を解放\n    free(ptrColor);\n    free(ptrWhiteRow);\n    free(ptrWhiteCol);\n\n    return 0;\n}", "problem_context": "Score : 200 points\n\nProblem Statement\n\nThere is a grid of squares with H horizontal rows and W vertical columns.\nThe square at the i-th row from the top and the j-th column from the left is represented as (i, j).\nEach square is black or white.\nThe color of the square is given as an H-by-W matrix (a_{i, j}).\nIf a_{i, j} is ., the square (i, j) is white; if a_{i, j} is #, the square (i, j) is black.\n\nSnuke is compressing this grid.\nHe will do so by repeatedly performing the following operation while there is a row or column that consists only of white squares:\n\nOperation: choose any one row or column that consists only of white squares, remove it and delete the space between the rows or columns.\n\nIt can be shown that the final state of the grid is uniquely determined regardless of what row or column is chosen in each operation.\nFind the final state of the grid.\n\nConstraints\n\n1 \\leq H, W \\leq 100\n\na_{i, j} is . or #.\n\nThere is at least one black square in the whole grid.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W\na_{1, 1}...a_{1, W}\n:\na_{H, 1}...a_{H, W}\n\nOutput\n\nPrint the final state of the grid in the same format as input (without the numbers of rows and columns); see the samples for clarity.\n\nSample Input 1\n\n4 4\n##.#\n....\n##.#\n.#.#\n\nSample Output 1\n\n###\n###\n.##\n\nThe second row and the third column in the original grid will be removed.\n\nSample Input 2\n\n3 3\n#..\n.#.\n..#\n\nSample Output 2\n\n#..\n.#.\n..#\n\nAs there is no row or column that consists only of white squares, no operation will be performed.\n\nSample Input 3\n\n4 5\n.....\n.....\n..#..\n.....\n\nSample Output 3\n\n#\n\nSample Input 4\n\n7 6\n......\n....#.\n.#....\n..#...\n..#...\n......\n.#..#.\n\nSample Output 4\n\n..#\n#..\n.#.\n.#.\n#.#", "sample_input": "4 4\n##.#\n....\n##.#\n.#.#\n"}, "reference_outputs": ["###\n###\n.##\n"], "source_document_id": "p03273", "source_text": "Score : 200 points\n\nProblem Statement\n\nThere is a grid of squares with H horizontal rows and W vertical columns.\nThe square at the i-th row from the top and the j-th column from the left is represented as (i, j).\nEach square is black or white.\nThe color of the square is given as an H-by-W matrix (a_{i, j}).\nIf a_{i, j} is ., the square (i, j) is white; if a_{i, j} is #, the square (i, j) is black.\n\nSnuke is compressing this grid.\nHe will do so by repeatedly performing the following operation while there is a row or column that consists only of white squares:\n\nOperation: choose any one row or column that consists only of white squares, remove it and delete the space between the rows or columns.\n\nIt can be shown that the final state of the grid is uniquely determined regardless of what row or column is chosen in each operation.\nFind the final state of the grid.\n\nConstraints\n\n1 \\leq H, W \\leq 100\n\na_{i, j} is . or #.\n\nThere is at least one black square in the whole grid.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W\na_{1, 1}...a_{1, W}\n:\na_{H, 1}...a_{H, W}\n\nOutput\n\nPrint the final state of the grid in the same format as input (without the numbers of rows and columns); see the samples for clarity.\n\nSample Input 1\n\n4 4\n##.#\n....\n##.#\n.#.#\n\nSample Output 1\n\n###\n###\n.##\n\nThe second row and the third column in the original grid will be removed.\n\nSample Input 2\n\n3 3\n#..\n.#.\n..#\n\nSample Output 2\n\n#..\n.#.\n..#\n\nAs there is no row or column that consists only of white squares, no operation will be performed.\n\nSample Input 3\n\n4 5\n.....\n.....\n..#..\n.....\n\nSample Output 3\n\n#\n\nSample Input 4\n\n7 6\n......\n....#.\n.#....\n..#...\n..#...\n......\n.#..#.\n\nSample Output 4\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": 2940, "cpu_time_ms": 111, "memory_kb": 1644}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s475211387", "group_id": "codeNet:p03273", "input_text": "/* ex5_3\n   UMAboogie */\n#include<stdio.h>\n\nint main(void){\n  int height,width;\n  scanf(\"%d %d\",&height,&width);\n  char grid[height][width];\n  int row_exist[height];\n  int col_exist[width];\n  for(int i = 0;i < height;i++){\n    for(int j = 0;j < width;j++){\n      scanf(\" %c\",&grid[i][j]);\n      if(grid[i][j] == '#'){\n        row_exist[i]=1;\n        col_exist[j]=1;\n      }\n    }\n  }\n  for(int i = 0;i < height;i++){\n      for(int j;j < width;j++){\n        if(row_exist[i] == 1 && col_exist[j] == 1){\n          printf(\"%c\",grid[i][j]);\n        }\n      }\n      printf(\"\\n\");\n    }\n  return 0;\n}\n", "language": "C", "metadata": {"date": 1591299415, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "problem_description_relpath": "problem_descriptions/p03273.html", "problem_id": "p03273", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03273/input.txt", "sample_output_relpath": "derived/input_output/data/p03273/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03273/C/s475211387.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s475211387", "user_id": "u426254738"}, "prompt_components": {"gold_output": "###\n###\n.##\n", "input_to_evaluate": "/* ex5_3\n   UMAboogie */\n#include<stdio.h>\n\nint main(void){\n  int height,width;\n  scanf(\"%d %d\",&height,&width);\n  char grid[height][width];\n  int row_exist[height];\n  int col_exist[width];\n  for(int i = 0;i < height;i++){\n    for(int j = 0;j < width;j++){\n      scanf(\" %c\",&grid[i][j]);\n      if(grid[i][j] == '#'){\n        row_exist[i]=1;\n        col_exist[j]=1;\n      }\n    }\n  }\n  for(int i = 0;i < height;i++){\n      for(int j;j < width;j++){\n        if(row_exist[i] == 1 && col_exist[j] == 1){\n          printf(\"%c\",grid[i][j]);\n        }\n      }\n      printf(\"\\n\");\n    }\n  return 0;\n}\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nThere is a grid of squares with H horizontal rows and W vertical columns.\nThe square at the i-th row from the top and the j-th column from the left is represented as (i, j).\nEach square is black or white.\nThe color of the square is given as an H-by-W matrix (a_{i, j}).\nIf a_{i, j} is ., the square (i, j) is white; if a_{i, j} is #, the square (i, j) is black.\n\nSnuke is compressing this grid.\nHe will do so by repeatedly performing the following operation while there is a row or column that consists only of white squares:\n\nOperation: choose any one row or column that consists only of white squares, remove it and delete the space between the rows or columns.\n\nIt can be shown that the final state of the grid is uniquely determined regardless of what row or column is chosen in each operation.\nFind the final state of the grid.\n\nConstraints\n\n1 \\leq H, W \\leq 100\n\na_{i, j} is . or #.\n\nThere is at least one black square in the whole grid.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W\na_{1, 1}...a_{1, W}\n:\na_{H, 1}...a_{H, W}\n\nOutput\n\nPrint the final state of the grid in the same format as input (without the numbers of rows and columns); see the samples for clarity.\n\nSample Input 1\n\n4 4\n##.#\n....\n##.#\n.#.#\n\nSample Output 1\n\n###\n###\n.##\n\nThe second row and the third column in the original grid will be removed.\n\nSample Input 2\n\n3 3\n#..\n.#.\n..#\n\nSample Output 2\n\n#..\n.#.\n..#\n\nAs there is no row or column that consists only of white squares, no operation will be performed.\n\nSample Input 3\n\n4 5\n.....\n.....\n..#..\n.....\n\nSample Output 3\n\n#\n\nSample Input 4\n\n7 6\n......\n....#.\n.#....\n..#...\n..#...\n......\n.#..#.\n\nSample Output 4\n\n..#\n#..\n.#.\n.#.\n#.#", "sample_input": "4 4\n##.#\n....\n##.#\n.#.#\n"}, "reference_outputs": ["###\n###\n.##\n"], "source_document_id": "p03273", "source_text": "Score : 200 points\n\nProblem Statement\n\nThere is a grid of squares with H horizontal rows and W vertical columns.\nThe square at the i-th row from the top and the j-th column from the left is represented as (i, j).\nEach square is black or white.\nThe color of the square is given as an H-by-W matrix (a_{i, j}).\nIf a_{i, j} is ., the square (i, j) is white; if a_{i, j} is #, the square (i, j) is black.\n\nSnuke is compressing this grid.\nHe will do so by repeatedly performing the following operation while there is a row or column that consists only of white squares:\n\nOperation: choose any one row or column that consists only of white squares, remove it and delete the space between the rows or columns.\n\nIt can be shown that the final state of the grid is uniquely determined regardless of what row or column is chosen in each operation.\nFind the final state of the grid.\n\nConstraints\n\n1 \\leq H, W \\leq 100\n\na_{i, j} is . or #.\n\nThere is at least one black square in the whole grid.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W\na_{1, 1}...a_{1, W}\n:\na_{H, 1}...a_{H, W}\n\nOutput\n\nPrint the final state of the grid in the same format as input (without the numbers of rows and columns); see the samples for clarity.\n\nSample Input 1\n\n4 4\n##.#\n....\n##.#\n.#.#\n\nSample Output 1\n\n###\n###\n.##\n\nThe second row and the third column in the original grid will be removed.\n\nSample Input 2\n\n3 3\n#..\n.#.\n..#\n\nSample Output 2\n\n#..\n.#.\n..#\n\nAs there is no row or column that consists only of white squares, no operation will be performed.\n\nSample Input 3\n\n4 5\n.....\n.....\n..#..\n.....\n\nSample Output 3\n\n#\n\nSample Input 4\n\n7 6\n......\n....#.\n.#....\n..#...\n..#...\n......\n.#..#.\n\nSample Output 4\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": 594, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s026428676", "group_id": "codeNet:p03280", "input_text": "#include<stdio.h>\n\nint main(void){\n    int a, b;\n\n\n    scanf(\"%d %d\",&a, &b);\n    \n    printf(\"%d\\n\",a*b-(a+b-1));\n\n}", "language": "C", "metadata": {"date": 1569618054, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "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/C/s026428676.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s026428676", "user_id": "u617440820"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "#include<stdio.h>\n\nint main(void){\n    int a, b;\n\n\n    scanf(\"%d %d\",&a, &b);\n    \n    printf(\"%d\\n\",a*b-(a+b-1));\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": 117, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s058663010", "group_id": "codeNet:p03281", "input_text": "#include <stdio.h>\n\nint main(void)\n{\n    int n,s=0,t,i,j;\n    scanf(\"%d\",&n);\n    for(i=1;i<=n;i+=2){\n        t=0;\n        for(j=1;j<=i;j++)if(i%j==0)t++;\n        if(t==8)s++;\n    }\n    printf(\"%d\",s);\n    return 0;\n}", "language": "C", "metadata": {"date": 1534647873, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "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/C/s058663010.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s058663010", "user_id": "u102795616"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "#include <stdio.h>\n\nint main(void)\n{\n    int n,s=0,t,i,j;\n    scanf(\"%d\",&n);\n    for(i=1;i<=n;i+=2){\n        t=0;\n        for(j=1;j<=i;j++)if(i%j==0)t++;\n        if(t==8)s++;\n    }\n    printf(\"%d\",s);\n    return 0;\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": 217, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s832378215", "group_id": "codeNet:p03283", "input_text": "#include <stdio.h>\n\nint main(void){\n  int i, j, k;\n  int N, M, Q;\n  int left, right;\n  scanf(\"%d %d %d\", &N, &M, &Q);\n  \n  int table[501][501] = {{0}};\n  \n  for(i = 0; i < M; i++){\n    scanf(\"%d %d\", &left, &right);\n    table[left][right]++;\n  }\n  \n  for(i = 0; i < Q; i++){\n    scanf(\"%d %d\", &left, &right);\n    int count = 0;\n    for(j = left; j <= right; j++)\n      for(k = left; k <= right; k++)\n       count += table[j][k];\n    printf(\"%d\\n\", count);\n  }\n  \n  return 0;\n}", "language": "C", "metadata": {"date": 1535481648, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "problem_description_relpath": "problem_descriptions/p03283.html", "problem_id": "p03283", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03283/input.txt", "sample_output_relpath": "derived/input_output/data/p03283/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03283/C/s832378215.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s832378215", "user_id": "u101511466"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "#include <stdio.h>\n\nint main(void){\n  int i, j, k;\n  int N, M, Q;\n  int left, right;\n  scanf(\"%d %d %d\", &N, &M, &Q);\n  \n  int table[501][501] = {{0}};\n  \n  for(i = 0; i < M; i++){\n    scanf(\"%d %d\", &left, &right);\n    table[left][right]++;\n  }\n  \n  for(i = 0; i < Q; i++){\n    scanf(\"%d %d\", &left, &right);\n    int count = 0;\n    for(j = left; j <= right; j++)\n      for(k = left; k <= right; k++)\n       count += table[j][k];\n    printf(\"%d\\n\", count);\n  }\n  \n  return 0;\n}", "problem_context": "Score: 400 points\n\nProblem Statement\n\nIn Takahashi Kingdom, there is a east-west railroad and N cities along it, numbered 1, 2, 3, ..., N from west to east.\nA company called AtCoder Express possesses M trains, and the train i runs from City L_i to City R_i (it is possible that L_i = R_i).\nTakahashi the king is interested in the following Q matters:\n\nThe number of the trains that runs strictly within the section from City p_i to City q_i, that is, the number of trains j such that p_i \\leq L_j and R_j \\leq q_i.\n\nAlthough he is genius, this is too much data to process by himself. Find the answer for each of these Q queries to help him.\n\nConstraints\n\nN is an integer between 1 and 500 (inclusive).\n\nM is an integer between 1 and 200 \\ 000 (inclusive).\n\nQ is an integer between 1 and 100 \\ 000 (inclusive).\n\n1 \\leq L_i \\leq R_i \\leq N (1 \\leq i \\leq M)\n\n1 \\leq p_i \\leq q_i \\leq N (1 \\leq i \\leq Q)\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M Q\nL_1 R_1\nL_2 R_2\n:\nL_M R_M\np_1 q_1\np_2 q_2\n:\np_Q q_Q\n\nOutput\n\nPrint Q lines. The i-th line should contain the number of the trains that runs strictly within the section from City p_i to City q_i.\n\nSample Input 1\n\n2 3 1\n1 1\n1 2\n2 2\n1 2\n\nSample Output 1\n\n3\n\nAs all the trains runs within the section from City 1 to City 2, the answer to the only query is 3.\n\nSample Input 2\n\n10 3 2\n1 5\n2 8\n7 10\n1 7\n3 10\n\nSample Output 2\n\n1\n1\n\nThe first query is on the section from City 1 to 7. There is only one train that runs strictly within that section: Train 1.\nThe second query is on the section from City 3 to 10. There is only one train that runs strictly within that section: Train 3.\n\nSample Input 3\n\n10 10 10\n1 6\n2 9\n4 5\n4 7\n4 7\n5 8\n6 6\n6 7\n7 9\n10 10\n1 8\n1 9\n1 10\n2 8\n2 9\n2 10\n3 8\n3 9\n3 10\n1 10\n\nSample Output 3\n\n7\n9\n10\n6\n8\n9\n6\n7\n8\n10", "sample_input": "2 3 1\n1 1\n1 2\n2 2\n1 2\n"}, "reference_outputs": ["3\n"], "source_document_id": "p03283", "source_text": "Score: 400 points\n\nProblem Statement\n\nIn Takahashi Kingdom, there is a east-west railroad and N cities along it, numbered 1, 2, 3, ..., N from west to east.\nA company called AtCoder Express possesses M trains, and the train i runs from City L_i to City R_i (it is possible that L_i = R_i).\nTakahashi the king is interested in the following Q matters:\n\nThe number of the trains that runs strictly within the section from City p_i to City q_i, that is, the number of trains j such that p_i \\leq L_j and R_j \\leq q_i.\n\nAlthough he is genius, this is too much data to process by himself. Find the answer for each of these Q queries to help him.\n\nConstraints\n\nN is an integer between 1 and 500 (inclusive).\n\nM is an integer between 1 and 200 \\ 000 (inclusive).\n\nQ is an integer between 1 and 100 \\ 000 (inclusive).\n\n1 \\leq L_i \\leq R_i \\leq N (1 \\leq i \\leq M)\n\n1 \\leq p_i \\leq q_i \\leq N (1 \\leq i \\leq Q)\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M Q\nL_1 R_1\nL_2 R_2\n:\nL_M R_M\np_1 q_1\np_2 q_2\n:\np_Q q_Q\n\nOutput\n\nPrint Q lines. The i-th line should contain the number of the trains that runs strictly within the section from City p_i to City q_i.\n\nSample Input 1\n\n2 3 1\n1 1\n1 2\n2 2\n1 2\n\nSample Output 1\n\n3\n\nAs all the trains runs within the section from City 1 to City 2, the answer to the only query is 3.\n\nSample Input 2\n\n10 3 2\n1 5\n2 8\n7 10\n1 7\n3 10\n\nSample Output 2\n\n1\n1\n\nThe first query is on the section from City 1 to 7. There is only one train that runs strictly within that section: Train 1.\nThe second query is on the section from City 3 to 10. There is only one train that runs strictly within that section: Train 3.\n\nSample Input 3\n\n10 10 10\n1 6\n2 9\n4 5\n4 7\n4 7\n5 8\n6 6\n6 7\n7 9\n10 10\n1 8\n1 9\n1 10\n2 8\n2 9\n2 10\n3 8\n3 9\n3 10\n1 10\n\nSample Output 3\n\n7\n9\n10\n6\n8\n9\n6\n7\n8\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": 477, "cpu_time_ms": 3155, "memory_kb": 1664}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s558057623", "group_id": "codeNet:p03284", "input_text": "#include<stdio.h>\nint main(void)\n{\n  int n,k;\n  \n  scanf(\"%d %d\",&n,&k);\n  int a=n/k;\n  int b=n%k;\n  if(b>=1){\n    printf(\"%d\\n\",a+1);\n  }\n  else{\n    printf(\"%d\\n\",a);\n  }\n  return 0;\n}", "language": "C", "metadata": {"date": 1574557049, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "problem_description_relpath": "problem_descriptions/p03284.html", "problem_id": "p03284", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03284/input.txt", "sample_output_relpath": "derived/input_output/data/p03284/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03284/C/s558057623.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s558057623", "user_id": "u180133008"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "#include<stdio.h>\nint main(void)\n{\n  int n,k;\n  \n  scanf(\"%d %d\",&n,&k);\n  int a=n/k;\n  int b=n%k;\n  if(b>=1){\n    printf(\"%d\\n\",a+1);\n  }\n  else{\n    printf(\"%d\\n\",a);\n  }\n  return 0;\n}", "problem_context": "Score : 100 points\n\nProblem Statement\n\nTakahashi has decided to distribute N AtCoder Crackers to K users of as evenly as possible.\nWhen all the crackers are distributed, find the minimum possible (absolute) difference between the largest number of crackers received by a user and the smallest number received by a user.\n\nConstraints\n\n1 \\leq N,K \\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 minimum possible (absolute) difference between the largest number of crackers received by a user and the smallest number received by a user.\n\nSample Input 1\n\n7 3\n\nSample Output 1\n\n1\n\nWhen the users receive two, two and three crackers, respectively, the (absolute) difference between the largest number of crackers received by a user and the smallest number received by a user, is 1.\n\nSample Input 2\n\n100 10\n\nSample Output 2\n\n0\n\nThe crackers can be distributed evenly.\n\nSample Input 3\n\n1 1\n\nSample Output 3\n\n0", "sample_input": "7 3\n"}, "reference_outputs": ["1\n"], "source_document_id": "p03284", "source_text": "Score : 100 points\n\nProblem Statement\n\nTakahashi has decided to distribute N AtCoder Crackers to K users of as evenly as possible.\nWhen all the crackers are distributed, find the minimum possible (absolute) difference between the largest number of crackers received by a user and the smallest number received by a user.\n\nConstraints\n\n1 \\leq N,K \\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 minimum possible (absolute) difference between the largest number of crackers received by a user and the smallest number received by a user.\n\nSample Input 1\n\n7 3\n\nSample Output 1\n\n1\n\nWhen the users receive two, two and three crackers, respectively, the (absolute) difference between the largest number of crackers received by a user and the smallest number received by a user, is 1.\n\nSample Input 2\n\n100 10\n\nSample Output 2\n\n0\n\nThe crackers can be distributed evenly.\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": 186, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s706977886", "group_id": "codeNet:p03285", "input_text": "#include<stdio.h>\n#include<stdlib.h>\n#include<string.h>\n\ntypedef long long ll;\n\nint max(int a, int b){\n  if(a > b) return a;\n  else return b;\n}\nint min(int a, int b){\n  if(a < b) return a;\n  else return b;\n}\n\nint sort(const void *a ,const void *b){\n  return *(int*)a - *(int*)b;\n}\n\nint main(){\n\n  int n;\n  scanf(\"%d\",&n);\n  for(int i = 0; i < 26; ++i){\n    for(int j = 0; j < 16; ++j){\n      if( i*4 + 7*j == n ){\n        printf(\"Yes\");\n        return 0;\n      }\n    }\n  }\n\n  printf(\"No\");\n\n  return 0;\n}\n", "language": "C", "metadata": {"date": 1592781375, "filename_ext": "c", "original_language": "C (GCC 9.2.1)", "problem_description_relpath": "problem_descriptions/p03285.html", "problem_id": "p03285", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03285/input.txt", "sample_output_relpath": "derived/input_output/data/p03285/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03285/C/s706977886.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s706977886", "user_id": "u759675243"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "#include<stdio.h>\n#include<stdlib.h>\n#include<string.h>\n\ntypedef long long ll;\n\nint max(int a, int b){\n  if(a > b) return a;\n  else return b;\n}\nint min(int a, int b){\n  if(a < b) return a;\n  else return b;\n}\n\nint sort(const void *a ,const void *b){\n  return *(int*)a - *(int*)b;\n}\n\nint main(){\n\n  int n;\n  scanf(\"%d\",&n);\n  for(int i = 0; i < 26; ++i){\n    for(int j = 0; j < 16; ++j){\n      if( i*4 + 7*j == n ){\n        printf(\"Yes\");\n        return 0;\n      }\n    }\n  }\n\n  printf(\"No\");\n\n  return 0;\n}\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nLa Confiserie d'ABC sells cakes at 4 dollars each and doughnuts at 7 dollars each.\nDetermine if there is a way to buy some of them for exactly N dollars. You can buy two or more doughnuts and two or more cakes, and you can also choose to buy zero doughnuts or zero cakes.\n\nConstraints\n\nN is an integer between 1 and 100, inclusive.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nIf there is a way to buy some cakes and some doughnuts for exactly N dollars, print Yes; otherwise, print No.\n\nSample Input 1\n\n11\n\nSample Output 1\n\nYes\n\nIf you buy one cake and one doughnut, the total will be 4 + 7 = 11 dollars.\n\nSample Input 2\n\n40\n\nSample Output 2\n\nYes\n\nIf you buy ten cakes, the total will be 4 \\times 10 = 40 dollars.\n\nSample Input 3\n\n3\n\nSample Output 3\n\nNo\n\nThe prices of cakes (4 dollars) and doughnuts (7 dollars) are both higher than 3 dollars, so there is no such way.", "sample_input": "11\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p03285", "source_text": "Score : 200 points\n\nProblem Statement\n\nLa Confiserie d'ABC sells cakes at 4 dollars each and doughnuts at 7 dollars each.\nDetermine if there is a way to buy some of them for exactly N dollars. You can buy two or more doughnuts and two or more cakes, and you can also choose to buy zero doughnuts or zero cakes.\n\nConstraints\n\nN is an integer between 1 and 100, inclusive.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nIf there is a way to buy some cakes and some doughnuts for exactly N dollars, print Yes; otherwise, print No.\n\nSample Input 1\n\n11\n\nSample Output 1\n\nYes\n\nIf you buy one cake and one doughnut, the total will be 4 + 7 = 11 dollars.\n\nSample Input 2\n\n40\n\nSample Output 2\n\nYes\n\nIf you buy ten cakes, the total will be 4 \\times 10 = 40 dollars.\n\nSample Input 3\n\n3\n\nSample Output 3\n\nNo\n\nThe prices of cakes (4 dollars) and doughnuts (7 dollars) are both higher than 3 dollars, so there is no such way.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 505, "cpu_time_ms": 9, "memory_kb": 1700}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s494395156", "group_id": "codeNet:p03285", "input_text": "#include <stdio.h>\n\nint main(void){\n  int N;\n\n  scanf(\"%d\",&N);\n  for(int i = 0;7*i <= N;i++){\n    for(int j = 0;7*i+4*j <= N;j++){\n      if(7*i+j*4 == N){\n        printf(\"Yes\\n\");\n        return 0;\n      }\n    }\n  }\n\n  printf(\"No\\n\");\n  return 0;\n}", "language": "C", "metadata": {"date": 1549228562, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "problem_description_relpath": "problem_descriptions/p03285.html", "problem_id": "p03285", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03285/input.txt", "sample_output_relpath": "derived/input_output/data/p03285/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03285/C/s494395156.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s494395156", "user_id": "u812973725"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "#include <stdio.h>\n\nint main(void){\n  int N;\n\n  scanf(\"%d\",&N);\n  for(int i = 0;7*i <= N;i++){\n    for(int j = 0;7*i+4*j <= N;j++){\n      if(7*i+j*4 == N){\n        printf(\"Yes\\n\");\n        return 0;\n      }\n    }\n  }\n\n  printf(\"No\\n\");\n  return 0;\n}", "problem_context": "Score : 200 points\n\nProblem Statement\n\nLa Confiserie d'ABC sells cakes at 4 dollars each and doughnuts at 7 dollars each.\nDetermine if there is a way to buy some of them for exactly N dollars. You can buy two or more doughnuts and two or more cakes, and you can also choose to buy zero doughnuts or zero cakes.\n\nConstraints\n\nN is an integer between 1 and 100, inclusive.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nIf there is a way to buy some cakes and some doughnuts for exactly N dollars, print Yes; otherwise, print No.\n\nSample Input 1\n\n11\n\nSample Output 1\n\nYes\n\nIf you buy one cake and one doughnut, the total will be 4 + 7 = 11 dollars.\n\nSample Input 2\n\n40\n\nSample Output 2\n\nYes\n\nIf you buy ten cakes, the total will be 4 \\times 10 = 40 dollars.\n\nSample Input 3\n\n3\n\nSample Output 3\n\nNo\n\nThe prices of cakes (4 dollars) and doughnuts (7 dollars) are both higher than 3 dollars, so there is no such way.", "sample_input": "11\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p03285", "source_text": "Score : 200 points\n\nProblem Statement\n\nLa Confiserie d'ABC sells cakes at 4 dollars each and doughnuts at 7 dollars each.\nDetermine if there is a way to buy some of them for exactly N dollars. You can buy two or more doughnuts and two or more cakes, and you can also choose to buy zero doughnuts or zero cakes.\n\nConstraints\n\nN is an integer between 1 and 100, inclusive.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nIf there is a way to buy some cakes and some doughnuts for exactly N dollars, print Yes; otherwise, print No.\n\nSample Input 1\n\n11\n\nSample Output 1\n\nYes\n\nIf you buy one cake and one doughnut, the total will be 4 + 7 = 11 dollars.\n\nSample Input 2\n\n40\n\nSample Output 2\n\nYes\n\nIf you buy ten cakes, the total will be 4 \\times 10 = 40 dollars.\n\nSample Input 3\n\n3\n\nSample Output 3\n\nNo\n\nThe prices of cakes (4 dollars) and doughnuts (7 dollars) are both higher than 3 dollars, so there is no such way.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 249, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s953105614", "group_id": "codeNet:p03285", "input_text": "#include <stdio.h>\n#include <stdlib.h>\n#include <string.h>\n\nint main(void){\n  int N;\n  \n  \n  scanf(\"%d\",&N);\n  \n  for(int i = 0; i <= N; i = i + 4){\n    for(int j = 0; i + j <= N; j = j + 7){\n      if(N == i+j){\n        printf(\"Yes\");\n        return 0;\n      }\n    }\n  }\n  printf(\"No\");\n  return 0;\n}", "language": "C", "metadata": {"date": 1534037022, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "problem_description_relpath": "problem_descriptions/p03285.html", "problem_id": "p03285", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03285/input.txt", "sample_output_relpath": "derived/input_output/data/p03285/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03285/C/s953105614.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s953105614", "user_id": "u427892219"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "#include <stdio.h>\n#include <stdlib.h>\n#include <string.h>\n\nint main(void){\n  int N;\n  \n  \n  scanf(\"%d\",&N);\n  \n  for(int i = 0; i <= N; i = i + 4){\n    for(int j = 0; i + j <= N; j = j + 7){\n      if(N == i+j){\n        printf(\"Yes\");\n        return 0;\n      }\n    }\n  }\n  printf(\"No\");\n  return 0;\n}", "problem_context": "Score : 200 points\n\nProblem Statement\n\nLa Confiserie d'ABC sells cakes at 4 dollars each and doughnuts at 7 dollars each.\nDetermine if there is a way to buy some of them for exactly N dollars. You can buy two or more doughnuts and two or more cakes, and you can also choose to buy zero doughnuts or zero cakes.\n\nConstraints\n\nN is an integer between 1 and 100, inclusive.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nIf there is a way to buy some cakes and some doughnuts for exactly N dollars, print Yes; otherwise, print No.\n\nSample Input 1\n\n11\n\nSample Output 1\n\nYes\n\nIf you buy one cake and one doughnut, the total will be 4 + 7 = 11 dollars.\n\nSample Input 2\n\n40\n\nSample Output 2\n\nYes\n\nIf you buy ten cakes, the total will be 4 \\times 10 = 40 dollars.\n\nSample Input 3\n\n3\n\nSample Output 3\n\nNo\n\nThe prices of cakes (4 dollars) and doughnuts (7 dollars) are both higher than 3 dollars, so there is no such way.", "sample_input": "11\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p03285", "source_text": "Score : 200 points\n\nProblem Statement\n\nLa Confiserie d'ABC sells cakes at 4 dollars each and doughnuts at 7 dollars each.\nDetermine if there is a way to buy some of them for exactly N dollars. You can buy two or more doughnuts and two or more cakes, and you can also choose to buy zero doughnuts or zero cakes.\n\nConstraints\n\nN is an integer between 1 and 100, inclusive.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nIf there is a way to buy some cakes and some doughnuts for exactly N dollars, print Yes; otherwise, print No.\n\nSample Input 1\n\n11\n\nSample Output 1\n\nYes\n\nIf you buy one cake and one doughnut, the total will be 4 + 7 = 11 dollars.\n\nSample Input 2\n\n40\n\nSample Output 2\n\nYes\n\nIf you buy ten cakes, the total will be 4 \\times 10 = 40 dollars.\n\nSample Input 3\n\n3\n\nSample Output 3\n\nNo\n\nThe prices of cakes (4 dollars) and doughnuts (7 dollars) are both higher than 3 dollars, so there is no such way.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s225740597", "group_id": "codeNet:p03286", "input_text": "#include<stdio.h>\n#include<stdlib.h>\n\nint main(void){\n\tlong N;\n\tscanf(\"%d\",&N);\n\tint a[64],i;\n\t\n\tif(N!=0){\n\t\n\tfor(i=0;i<64;i++){\n\t\ta[i]=abs(N%2);\n\t\tN-=a[i];\n\t\tN/=-2;\n\t}\n\n\tint check=0;\n\t\n\tfor(i=64;i>=0;i--){\n\t\t\n\t\tif(a[i]!=0){\n\t\t\tcheck++;\n\t\t}\n\t\t\n\t\tif(check>0){\n\t\t\tprintf(\"%d\",a[i]);\n\t\t}\n\t}\n\t}\n\telse{\n\t\tprintf(\"0\");\n\t}\n\treturn 0;\n}", "language": "C", "metadata": {"date": 1534038096, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "problem_description_relpath": "problem_descriptions/p03286.html", "problem_id": "p03286", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03286/input.txt", "sample_output_relpath": "derived/input_output/data/p03286/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03286/C/s225740597.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s225740597", "user_id": "u769724991"}, "prompt_components": {"gold_output": "1011\n", "input_to_evaluate": "#include<stdio.h>\n#include<stdlib.h>\n\nint main(void){\n\tlong N;\n\tscanf(\"%d\",&N);\n\tint a[64],i;\n\t\n\tif(N!=0){\n\t\n\tfor(i=0;i<64;i++){\n\t\ta[i]=abs(N%2);\n\t\tN-=a[i];\n\t\tN/=-2;\n\t}\n\n\tint check=0;\n\t\n\tfor(i=64;i>=0;i--){\n\t\t\n\t\tif(a[i]!=0){\n\t\t\tcheck++;\n\t\t}\n\t\t\n\t\tif(check>0){\n\t\t\tprintf(\"%d\",a[i]);\n\t\t}\n\t}\n\t}\n\telse{\n\t\tprintf(\"0\");\n\t}\n\treturn 0;\n}", "problem_context": "Score : 300 points\n\nProblem Statement\n\nGiven an integer N, find the base -2 representation of N.\n\nHere, S is the base -2 representation of N when the following are all satisfied:\n\nS is a string consisting of 0 and 1.\n\nUnless S = 0, the initial character of S is 1.\n\nLet S = S_k S_{k-1} ... S_0, then S_0 \\times (-2)^0 + S_1 \\times (-2)^1 + ... + S_k \\times (-2)^k = N.\n\nIt can be proved that, for any integer M, the base -2 representation of M is uniquely determined.\n\nConstraints\n\nEvery value in input is integer.\n\n-10^9 \\leq N \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the base -2 representation of N.\n\nSample Input 1\n\n-9\n\nSample Output 1\n\n1011\n\nAs (-2)^0 + (-2)^1 + (-2)^3 = 1 + (-2) + (-8) = -9, 1011 is the base -2 representation of -9.\n\nSample Input 2\n\n123456789\n\nSample Output 2\n\n11000101011001101110100010101\n\nSample Input 3\n\n0\n\nSample Output 3\n\n0", "sample_input": "-9\n"}, "reference_outputs": ["1011\n"], "source_document_id": "p03286", "source_text": "Score : 300 points\n\nProblem Statement\n\nGiven an integer N, find the base -2 representation of N.\n\nHere, S is the base -2 representation of N when the following are all satisfied:\n\nS is a string consisting of 0 and 1.\n\nUnless S = 0, the initial character of S is 1.\n\nLet S = S_k S_{k-1} ... S_0, then S_0 \\times (-2)^0 + S_1 \\times (-2)^1 + ... + S_k \\times (-2)^k = N.\n\nIt can be proved that, for any integer M, the base -2 representation of M is uniquely determined.\n\nConstraints\n\nEvery value in input is integer.\n\n-10^9 \\leq N \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the base -2 representation of N.\n\nSample Input 1\n\n-9\n\nSample Output 1\n\n1011\n\nAs (-2)^0 + (-2)^1 + (-2)^3 = 1 + (-2) + (-8) = -9, 1011 is the base -2 representation of -9.\n\nSample Input 2\n\n123456789\n\nSample Output 2\n\n11000101011001101110100010101\n\nSample Input 3\n\n0\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": 328, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s701183628", "group_id": "codeNet:p03288", "input_text": "#include<stdio.h>\nint main()\n{\n    int r;\nscanf(\"%d\",&r);\n\nif (r < 1200)\n\n    printf(\"ABC\");\n\nelse if (1200 <= r &&  r< 2800)\n\n    printf(\"ARC\");\n\nelse{\n        if (2800<=r && r <= 4208);\n\n    printf(\"AGC\");\n}\n    return 0;\n}\n", "language": "C", "metadata": {"date": 1582105436, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "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/C/s701183628.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s701183628", "user_id": "u816631826"}, "prompt_components": {"gold_output": "ABC\n", "input_to_evaluate": "#include<stdio.h>\nint main()\n{\n    int r;\nscanf(\"%d\",&r);\n\nif (r < 1200)\n\n    printf(\"ABC\");\n\nelse if (1200 <= r &&  r< 2800)\n\n    printf(\"ARC\");\n\nelse{\n        if (2800<=r && r <= 4208);\n\n    printf(\"AGC\");\n}\n    return 0;\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": 226, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s504501006", "group_id": "codeNet:p03288", "input_text": "#include <stdio.h>\n\nint main(void)\n{\n  int R;\n  scanf(\"%d\", &R);\n  if(R < 1200){\n    printf(\"ABC\\n\");\n  } else if(R < 2800){\n    printf(\"ARC\\n\");\n  } else {\n    printf(\"AGC\\n\");\n  }\n  return 0;\n}\n", "language": "C", "metadata": {"date": 1557773356, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "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/C/s504501006.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s504501006", "user_id": "u752907799"}, "prompt_components": {"gold_output": "ABC\n", "input_to_evaluate": "#include <stdio.h>\n\nint main(void)\n{\n  int R;\n  scanf(\"%d\", &R);\n  if(R < 1200){\n    printf(\"ABC\\n\");\n  } else if(R < 2800){\n    printf(\"ARC\\n\");\n  } else {\n    printf(\"AGC\\n\");\n  }\n  return 0;\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": 196, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s426043368", "group_id": "codeNet:p03292", "input_text": "#include <stdio.h>\n\nint main(void)\n{\n\tint i,A[3],max,min,ans;\n\t\n\tfor(i = 0; i < 3; i++)\n\t{\n\t\tscanf(\"%d\", &A[i]);\n\t}\n\t\n\tmax = A[0];\n\tmin = A[2];\n\t\n\tfor(i = 0; i < 3; i++)\n\t{\n\t\tif(A[i] > max){\n\t\t\tmax = A[i];\n\t\t}else if(A[i] < min){\n\t\t\tmin = A[i];\n\t\t}\n\t}\n\t\n\tans = max - min;\n\tprintf(\"%d\",ans);\n\t\n\treturn 0;\n}\n", "language": "C", "metadata": {"date": 1532221954, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "problem_description_relpath": "problem_descriptions/p03292.html", "problem_id": "p03292", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03292/input.txt", "sample_output_relpath": "derived/input_output/data/p03292/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03292/C/s426043368.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s426043368", "user_id": "u251963385"}, "prompt_components": {"gold_output": "5\n", "input_to_evaluate": "#include <stdio.h>\n\nint main(void)\n{\n\tint i,A[3],max,min,ans;\n\t\n\tfor(i = 0; i < 3; i++)\n\t{\n\t\tscanf(\"%d\", &A[i]);\n\t}\n\t\n\tmax = A[0];\n\tmin = A[2];\n\t\n\tfor(i = 0; i < 3; i++)\n\t{\n\t\tif(A[i] > max){\n\t\t\tmax = A[i];\n\t\t}else if(A[i] < min){\n\t\t\tmin = A[i];\n\t\t}\n\t}\n\t\n\tans = max - min;\n\tprintf(\"%d\",ans);\n\t\n\treturn 0;\n}\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou have three tasks, all of which need to be completed.\n\nFirst, you can complete any one task at cost 0.\n\nThen, just after completing the i-th task, you can complete the j-th task at cost |A_j - A_i|.\n\nHere, |x| denotes the absolute value of x.\n\nFind the minimum total cost required to complete all the task.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A_1, A_2, A_3 \\leq 100\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA_1 A_2 A_3\n\nOutput\n\nPrint the minimum total cost required to complete all the task.\n\nSample Input 1\n\n1 6 3\n\nSample Output 1\n\n5\n\nWhen the tasks are completed in the following order, the total cost will be 5, which is the minimum:\n\nComplete the first task at cost 0.\n\nComplete the third task at cost 2.\n\nComplete the second task at cost 3.\n\nSample Input 2\n\n11 5 5\n\nSample Output 2\n\n6\n\nSample Input 3\n\n100 100 100\n\nSample Output 3\n\n0", "sample_input": "1 6 3\n"}, "reference_outputs": ["5\n"], "source_document_id": "p03292", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou have three tasks, all of which need to be completed.\n\nFirst, you can complete any one task at cost 0.\n\nThen, just after completing the i-th task, you can complete the j-th task at cost |A_j - A_i|.\n\nHere, |x| denotes the absolute value of x.\n\nFind the minimum total cost required to complete all the task.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq A_1, A_2, A_3 \\leq 100\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA_1 A_2 A_3\n\nOutput\n\nPrint the minimum total cost required to complete all the task.\n\nSample Input 1\n\n1 6 3\n\nSample Output 1\n\n5\n\nWhen the tasks are completed in the following order, the total cost will be 5, which is the minimum:\n\nComplete the first task at cost 0.\n\nComplete the third task at cost 2.\n\nComplete the second task at cost 3.\n\nSample Input 2\n\n11 5 5\n\nSample Output 2\n\n6\n\nSample Input 3\n\n100 100 100\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": 306, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s341767268", "group_id": "codeNet:p03293", "input_text": "#include<stdio.h>\n#include<string.h>\n\nint main(void)\n{\n char s[100],t[100];\n int a,b,i,n;\n\n scanf(\"%s%s\",s,t);\n\n n=strlen(s);\n\n a=s[0];\n b=t[0];\n\n for(i=1;i<n;i++){\n   a=s[i]+a;\n   b=t[i]+b;\n }\n\n if(a==b) printf(\"Yes\\n\");\n else printf(\"No\\n\");\n\n return 0;\n}\n", "language": "C", "metadata": {"date": 1551214719, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "problem_description_relpath": "problem_descriptions/p03293.html", "problem_id": "p03293", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03293/input.txt", "sample_output_relpath": "derived/input_output/data/p03293/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03293/C/s341767268.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s341767268", "user_id": "u631851824"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "#include<stdio.h>\n#include<string.h>\n\nint main(void)\n{\n char s[100],t[100];\n int a,b,i,n;\n\n scanf(\"%s%s\",s,t);\n\n n=strlen(s);\n\n a=s[0];\n b=t[0];\n\n for(i=1;i<n;i++){\n   a=s[i]+a;\n   b=t[i]+b;\n }\n\n if(a==b) printf(\"Yes\\n\");\n else printf(\"No\\n\");\n\n return 0;\n}\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nYou are given string S and T consisting of lowercase English letters.\n\nDetermine if S equals T after rotation.\n\nThat is, determine if S equals T after the following operation is performed some number of times:\n\nOperation: Let S = S_1 S_2 ... S_{|S|}. Change S to S_{|S|} S_1 S_2 ... S_{|S|-1}.\n\nHere, |X| denotes the length of the string X.\n\nConstraints\n\n2 \\leq |S| \\leq 100\n\n|S| = |T|\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\nIf S equals T after rotation, print Yes; if it does not, print No.\n\nSample Input 1\n\nkyoto\ntokyo\n\nSample Output 1\n\nYes\n\nIn the first operation, kyoto becomes okyot.\n\nIn the second operation, okyot becomes tokyo.\n\nSample Input 2\n\nabc\narc\n\nSample Output 2\n\nNo\n\nabc does not equal arc after any number of operations.\n\nSample Input 3\n\naaaaaaaaaaaaaaab\naaaaaaaaaaaaaaab\n\nSample Output 3\n\nYes", "sample_input": "kyoto\ntokyo\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p03293", "source_text": "Score : 200 points\n\nProblem Statement\n\nYou are given string S and T consisting of lowercase English letters.\n\nDetermine if S equals T after rotation.\n\nThat is, determine if S equals T after the following operation is performed some number of times:\n\nOperation: Let S = S_1 S_2 ... S_{|S|}. Change S to S_{|S|} S_1 S_2 ... S_{|S|-1}.\n\nHere, |X| denotes the length of the string X.\n\nConstraints\n\n2 \\leq |S| \\leq 100\n\n|S| = |T|\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\nIf S equals T after rotation, print Yes; if it does not, print No.\n\nSample Input 1\n\nkyoto\ntokyo\n\nSample Output 1\n\nYes\n\nIn the first operation, kyoto becomes okyot.\n\nIn the second operation, okyot becomes tokyo.\n\nSample Input 2\n\nabc\narc\n\nSample Output 2\n\nNo\n\nabc does not equal arc after any number of operations.\n\nSample Input 3\n\naaaaaaaaaaaaaaab\naaaaaaaaaaaaaaab\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": 258, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s317979887", "group_id": "codeNet:p03293", "input_text": "#include<stdio.h>\n#include<string.h>\n\nint main(){\n\n  char str[2][105]={{0}};\n  scanf(\"%s\",str[0]);\n  scanf(\"%s\",str[1]);\n\n  int i;int f=0;\n  int j;\n  int size=0;\n  while(str[0][size] !=0){\n    size++;\n  }\n  for(i=0;i<size;++i){\n    int j;\n    if(memcmp(str[0],str[1],sizeof(str[0]))==0){\n      f=1;\n      break;\n    }else{\n      char temp=str[0][size-1];\n      for(j=size-1;j>0;j--){\n        str[0][j]=str[0][j-1];\n      }\n      str[0][0]=temp;\n    }\n  }\n  if(f==0)puts(\"No\");\n  if(f==1)puts(\"Yes\");\n  return 0;\n}\n", "language": "C", "metadata": {"date": 1532228669, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "problem_description_relpath": "problem_descriptions/p03293.html", "problem_id": "p03293", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03293/input.txt", "sample_output_relpath": "derived/input_output/data/p03293/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03293/C/s317979887.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s317979887", "user_id": "u946810083"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "#include<stdio.h>\n#include<string.h>\n\nint main(){\n\n  char str[2][105]={{0}};\n  scanf(\"%s\",str[0]);\n  scanf(\"%s\",str[1]);\n\n  int i;int f=0;\n  int j;\n  int size=0;\n  while(str[0][size] !=0){\n    size++;\n  }\n  for(i=0;i<size;++i){\n    int j;\n    if(memcmp(str[0],str[1],sizeof(str[0]))==0){\n      f=1;\n      break;\n    }else{\n      char temp=str[0][size-1];\n      for(j=size-1;j>0;j--){\n        str[0][j]=str[0][j-1];\n      }\n      str[0][0]=temp;\n    }\n  }\n  if(f==0)puts(\"No\");\n  if(f==1)puts(\"Yes\");\n  return 0;\n}\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nYou are given string S and T consisting of lowercase English letters.\n\nDetermine if S equals T after rotation.\n\nThat is, determine if S equals T after the following operation is performed some number of times:\n\nOperation: Let S = S_1 S_2 ... S_{|S|}. Change S to S_{|S|} S_1 S_2 ... S_{|S|-1}.\n\nHere, |X| denotes the length of the string X.\n\nConstraints\n\n2 \\leq |S| \\leq 100\n\n|S| = |T|\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\nIf S equals T after rotation, print Yes; if it does not, print No.\n\nSample Input 1\n\nkyoto\ntokyo\n\nSample Output 1\n\nYes\n\nIn the first operation, kyoto becomes okyot.\n\nIn the second operation, okyot becomes tokyo.\n\nSample Input 2\n\nabc\narc\n\nSample Output 2\n\nNo\n\nabc does not equal arc after any number of operations.\n\nSample Input 3\n\naaaaaaaaaaaaaaab\naaaaaaaaaaaaaaab\n\nSample Output 3\n\nYes", "sample_input": "kyoto\ntokyo\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p03293", "source_text": "Score : 200 points\n\nProblem Statement\n\nYou are given string S and T consisting of lowercase English letters.\n\nDetermine if S equals T after rotation.\n\nThat is, determine if S equals T after the following operation is performed some number of times:\n\nOperation: Let S = S_1 S_2 ... S_{|S|}. Change S to S_{|S|} S_1 S_2 ... S_{|S|-1}.\n\nHere, |X| denotes the length of the string X.\n\nConstraints\n\n2 \\leq |S| \\leq 100\n\n|S| = |T|\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\nIf S equals T after rotation, print Yes; if it does not, print No.\n\nSample Input 1\n\nkyoto\ntokyo\n\nSample Output 1\n\nYes\n\nIn the first operation, kyoto becomes okyot.\n\nIn the second operation, okyot becomes tokyo.\n\nSample Input 2\n\nabc\narc\n\nSample Output 2\n\nNo\n\nabc does not equal arc after any number of operations.\n\nSample Input 3\n\naaaaaaaaaaaaaaab\naaaaaaaaaaaaaaab\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": 514, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s023351138", "group_id": "codeNet:p03293", "input_text": "#include<stdio.h>\n#include<string.h>\n\nint main(){\n\n  char str[2][100]={{0}};int st;\n  st=scanf(\"%s\",str[0]);\n  st=scanf(\"%s\",str[1]);\n\n  int i;int f=0;int d=0;\n  int j;\n  int size=0;\n  while(str[0][size] !=0){\n    size++;\n  }\n//  printf(\"%d\\n\",size);\n  for(i=0;i<size+1;i++){\n    int j;\n    if(memcmp(str[0],str[1],sizeof(str[0]))==0)f=1;\n    if(f==1){\n      break;\n    }\n    char temp=str[0][size-1];\n    for(j=size-1;j>0;j--){\n      str[0][j]=str[0][j-1];\n    }\n    str[0][0]=temp;\n//    printf(\"%s\\n\",str[0]);\n  }\n  if(f==0)puts(\"No\");\n  if(f==1)puts(\"Yes\");\n  return 0;\n}\n", "language": "C", "metadata": {"date": 1532225922, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "problem_description_relpath": "problem_descriptions/p03293.html", "problem_id": "p03293", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03293/input.txt", "sample_output_relpath": "derived/input_output/data/p03293/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03293/C/s023351138.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s023351138", "user_id": "u946810083"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "#include<stdio.h>\n#include<string.h>\n\nint main(){\n\n  char str[2][100]={{0}};int st;\n  st=scanf(\"%s\",str[0]);\n  st=scanf(\"%s\",str[1]);\n\n  int i;int f=0;int d=0;\n  int j;\n  int size=0;\n  while(str[0][size] !=0){\n    size++;\n  }\n//  printf(\"%d\\n\",size);\n  for(i=0;i<size+1;i++){\n    int j;\n    if(memcmp(str[0],str[1],sizeof(str[0]))==0)f=1;\n    if(f==1){\n      break;\n    }\n    char temp=str[0][size-1];\n    for(j=size-1;j>0;j--){\n      str[0][j]=str[0][j-1];\n    }\n    str[0][0]=temp;\n//    printf(\"%s\\n\",str[0]);\n  }\n  if(f==0)puts(\"No\");\n  if(f==1)puts(\"Yes\");\n  return 0;\n}\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nYou are given string S and T consisting of lowercase English letters.\n\nDetermine if S equals T after rotation.\n\nThat is, determine if S equals T after the following operation is performed some number of times:\n\nOperation: Let S = S_1 S_2 ... S_{|S|}. Change S to S_{|S|} S_1 S_2 ... S_{|S|-1}.\n\nHere, |X| denotes the length of the string X.\n\nConstraints\n\n2 \\leq |S| \\leq 100\n\n|S| = |T|\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\nIf S equals T after rotation, print Yes; if it does not, print No.\n\nSample Input 1\n\nkyoto\ntokyo\n\nSample Output 1\n\nYes\n\nIn the first operation, kyoto becomes okyot.\n\nIn the second operation, okyot becomes tokyo.\n\nSample Input 2\n\nabc\narc\n\nSample Output 2\n\nNo\n\nabc does not equal arc after any number of operations.\n\nSample Input 3\n\naaaaaaaaaaaaaaab\naaaaaaaaaaaaaaab\n\nSample Output 3\n\nYes", "sample_input": "kyoto\ntokyo\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p03293", "source_text": "Score : 200 points\n\nProblem Statement\n\nYou are given string S and T consisting of lowercase English letters.\n\nDetermine if S equals T after rotation.\n\nThat is, determine if S equals T after the following operation is performed some number of times:\n\nOperation: Let S = S_1 S_2 ... S_{|S|}. Change S to S_{|S|} S_1 S_2 ... S_{|S|-1}.\n\nHere, |X| denotes the length of the string X.\n\nConstraints\n\n2 \\leq |S| \\leq 100\n\n|S| = |T|\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\nIf S equals T after rotation, print Yes; if it does not, print No.\n\nSample Input 1\n\nkyoto\ntokyo\n\nSample Output 1\n\nYes\n\nIn the first operation, kyoto becomes okyot.\n\nIn the second operation, okyot becomes tokyo.\n\nSample Input 2\n\nabc\narc\n\nSample Output 2\n\nNo\n\nabc does not equal arc after any number of operations.\n\nSample Input 3\n\naaaaaaaaaaaaaaab\naaaaaaaaaaaaaaab\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": 576, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s327755223", "group_id": "codeNet:p03293", "input_text": "#include<stdio.h>\n\nint chksame(char *S,char *T,int len){\n    for(int i=0;i<len;i++){\n        if(S[i]!=T[i]){\n\n            return -1;\n        }\n    }\n    return 1;\n}\n\n\nint main(void){\n    char S[100]={};\n    char T[100]={};\n    scanf(\"%s\",S);\n    scanf(\"%s\",T);\n    int len=0;\n    while(S[len]!='\\0'){\n        len++;\n    }\n    for(int i=0;i<len;i++){\n        char temp = S[0];\n        for(int j=0;j<len-1;j++){\n            S[j]=S[j+1];\n        }\n        S[len-1]=temp;\n        if(chksame(S,T,len)==1){\n            printf(\"Yes\\n\");\n            return 0;\n        }\n    }\n    printf(\"No\\n\");\n    return 0;\n}", "language": "C", "metadata": {"date": 1532223849, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "problem_description_relpath": "problem_descriptions/p03293.html", "problem_id": "p03293", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03293/input.txt", "sample_output_relpath": "derived/input_output/data/p03293/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03293/C/s327755223.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s327755223", "user_id": "u085356325"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "#include<stdio.h>\n\nint chksame(char *S,char *T,int len){\n    for(int i=0;i<len;i++){\n        if(S[i]!=T[i]){\n\n            return -1;\n        }\n    }\n    return 1;\n}\n\n\nint main(void){\n    char S[100]={};\n    char T[100]={};\n    scanf(\"%s\",S);\n    scanf(\"%s\",T);\n    int len=0;\n    while(S[len]!='\\0'){\n        len++;\n    }\n    for(int i=0;i<len;i++){\n        char temp = S[0];\n        for(int j=0;j<len-1;j++){\n            S[j]=S[j+1];\n        }\n        S[len-1]=temp;\n        if(chksame(S,T,len)==1){\n            printf(\"Yes\\n\");\n            return 0;\n        }\n    }\n    printf(\"No\\n\");\n    return 0;\n}", "problem_context": "Score : 200 points\n\nProblem Statement\n\nYou are given string S and T consisting of lowercase English letters.\n\nDetermine if S equals T after rotation.\n\nThat is, determine if S equals T after the following operation is performed some number of times:\n\nOperation: Let S = S_1 S_2 ... S_{|S|}. Change S to S_{|S|} S_1 S_2 ... S_{|S|-1}.\n\nHere, |X| denotes the length of the string X.\n\nConstraints\n\n2 \\leq |S| \\leq 100\n\n|S| = |T|\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\nIf S equals T after rotation, print Yes; if it does not, print No.\n\nSample Input 1\n\nkyoto\ntokyo\n\nSample Output 1\n\nYes\n\nIn the first operation, kyoto becomes okyot.\n\nIn the second operation, okyot becomes tokyo.\n\nSample Input 2\n\nabc\narc\n\nSample Output 2\n\nNo\n\nabc does not equal arc after any number of operations.\n\nSample Input 3\n\naaaaaaaaaaaaaaab\naaaaaaaaaaaaaaab\n\nSample Output 3\n\nYes", "sample_input": "kyoto\ntokyo\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p03293", "source_text": "Score : 200 points\n\nProblem Statement\n\nYou are given string S and T consisting of lowercase English letters.\n\nDetermine if S equals T after rotation.\n\nThat is, determine if S equals T after the following operation is performed some number of times:\n\nOperation: Let S = S_1 S_2 ... S_{|S|}. Change S to S_{|S|} S_1 S_2 ... S_{|S|-1}.\n\nHere, |X| denotes the length of the string X.\n\nConstraints\n\n2 \\leq |S| \\leq 100\n\n|S| = |T|\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\nIf S equals T after rotation, print Yes; if it does not, print No.\n\nSample Input 1\n\nkyoto\ntokyo\n\nSample Output 1\n\nYes\n\nIn the first operation, kyoto becomes okyot.\n\nIn the second operation, okyot becomes tokyo.\n\nSample Input 2\n\nabc\narc\n\nSample Output 2\n\nNo\n\nabc does not equal arc after any number of operations.\n\nSample Input 3\n\naaaaaaaaaaaaaaab\naaaaaaaaaaaaaaab\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": 603, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s653052400", "group_id": "codeNet:p03294", "input_text": "#include <stdio.h>\nint main ()\n{\n\tlong long int n,a[3001],i,sum;\n\tscanf(\"%lld\",&n);\n\tfor(i=0;i<n;i++)\n\t{\n\t\tscanf(\"%lld\",&a[i]);\n\t}\n\tfor(i=0;i<n;i++)\n\t{\n\t\tsum=sum+a[i];\n\t}\n\tprintf(\"%lld\\n\",sum-n);\n\treturn 0;\n}", "language": "C", "metadata": {"date": 1594441580, "filename_ext": "c", "original_language": "C (GCC 9.2.1)", "problem_description_relpath": "problem_descriptions/p03294.html", "problem_id": "p03294", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03294/input.txt", "sample_output_relpath": "derived/input_output/data/p03294/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03294/C/s653052400.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s653052400", "user_id": "u816631826"}, "prompt_components": {"gold_output": "10\n", "input_to_evaluate": "#include <stdio.h>\nint main ()\n{\n\tlong long int n,a[3001],i,sum;\n\tscanf(\"%lld\",&n);\n\tfor(i=0;i<n;i++)\n\t{\n\t\tscanf(\"%lld\",&a[i]);\n\t}\n\tfor(i=0;i<n;i++)\n\t{\n\t\tsum=sum+a[i];\n\t}\n\tprintf(\"%lld\\n\",sum-n);\n\treturn 0;\n}", "problem_context": "Score : 300 points\n\nProblem Statement\n\nYou are given N positive integers a_1, a_2, ..., a_N.\n\nFor a non-negative integer m, let f(m) = (m\\ mod\\ a_1) + (m\\ mod\\ a_2) + ... + (m\\ mod\\ a_N).\n\nHere, X\\ mod\\ Y denotes the remainder of the division of X by Y.\n\nFind the maximum value of f.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 3000\n\n2 \\leq a_i \\leq 10^5\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 value of f.\n\nSample Input 1\n\n3\n3 4 6\n\nSample Output 1\n\n10\n\nf(11) = (11\\ mod\\ 3) + (11\\ mod\\ 4) + (11\\ mod\\ 6) = 10 is the maximum value of f.\n\nSample Input 2\n\n5\n7 46 11 20 11\n\nSample Output 2\n\n90\n\nSample Input 3\n\n7\n994 518 941 851 647 2 581\n\nSample Output 3\n\n4527", "sample_input": "3\n3 4 6\n"}, "reference_outputs": ["10\n"], "source_document_id": "p03294", "source_text": "Score : 300 points\n\nProblem Statement\n\nYou are given N positive integers a_1, a_2, ..., a_N.\n\nFor a non-negative integer m, let f(m) = (m\\ mod\\ a_1) + (m\\ mod\\ a_2) + ... + (m\\ mod\\ a_N).\n\nHere, X\\ mod\\ Y denotes the remainder of the division of X by Y.\n\nFind the maximum value of f.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 3000\n\n2 \\leq a_i \\leq 10^5\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 value of f.\n\nSample Input 1\n\n3\n3 4 6\n\nSample Output 1\n\n10\n\nf(11) = (11\\ mod\\ 3) + (11\\ mod\\ 4) + (11\\ mod\\ 6) = 10 is the maximum value of f.\n\nSample Input 2\n\n5\n7 46 11 20 11\n\nSample Output 2\n\n90\n\nSample Input 3\n\n7\n994 518 941 851 647 2 581\n\nSample Output 3\n\n4527", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 208, "cpu_time_ms": 5, "memory_kb": 1728}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s457158356", "group_id": "codeNet:p03294", "input_text": "#include<stdio.h>\nint gcd(int a, int b)\n{\n    if(b==0)\n        return a;\n    return gcd(b,a%b);\n}\nint lcm( int a, int b)\n{\n    return a*b/(gcd(a,b));\n}\nint main()\n{\n    int n,i;\n    scanf(\"%d\",&n);\n    long long int a[n],sum=0,l;\n    for(i=0;i<n;i++)\n        scanf(\"%lld\",&a[i]);\n    l=a[0];\n    for(i=0;i<n;i++)\n        l=lcm(l,a[i]);\n    l=l-1;\n    for(i=0;i<n;i++)\n        sum+=l%a[i];\n    printf(\"%lld\",sum);\n}\n", "language": "C", "metadata": {"date": 1572504841, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "problem_description_relpath": "problem_descriptions/p03294.html", "problem_id": "p03294", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03294/input.txt", "sample_output_relpath": "derived/input_output/data/p03294/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03294/C/s457158356.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s457158356", "user_id": "u018679195"}, "prompt_components": {"gold_output": "10\n", "input_to_evaluate": "#include<stdio.h>\nint gcd(int a, int b)\n{\n    if(b==0)\n        return a;\n    return gcd(b,a%b);\n}\nint lcm( int a, int b)\n{\n    return a*b/(gcd(a,b));\n}\nint main()\n{\n    int n,i;\n    scanf(\"%d\",&n);\n    long long int a[n],sum=0,l;\n    for(i=0;i<n;i++)\n        scanf(\"%lld\",&a[i]);\n    l=a[0];\n    for(i=0;i<n;i++)\n        l=lcm(l,a[i]);\n    l=l-1;\n    for(i=0;i<n;i++)\n        sum+=l%a[i];\n    printf(\"%lld\",sum);\n}\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nYou are given N positive integers a_1, a_2, ..., a_N.\n\nFor a non-negative integer m, let f(m) = (m\\ mod\\ a_1) + (m\\ mod\\ a_2) + ... + (m\\ mod\\ a_N).\n\nHere, X\\ mod\\ Y denotes the remainder of the division of X by Y.\n\nFind the maximum value of f.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 3000\n\n2 \\leq a_i \\leq 10^5\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 value of f.\n\nSample Input 1\n\n3\n3 4 6\n\nSample Output 1\n\n10\n\nf(11) = (11\\ mod\\ 3) + (11\\ mod\\ 4) + (11\\ mod\\ 6) = 10 is the maximum value of f.\n\nSample Input 2\n\n5\n7 46 11 20 11\n\nSample Output 2\n\n90\n\nSample Input 3\n\n7\n994 518 941 851 647 2 581\n\nSample Output 3\n\n4527", "sample_input": "3\n3 4 6\n"}, "reference_outputs": ["10\n"], "source_document_id": "p03294", "source_text": "Score : 300 points\n\nProblem Statement\n\nYou are given N positive integers a_1, a_2, ..., a_N.\n\nFor a non-negative integer m, let f(m) = (m\\ mod\\ a_1) + (m\\ mod\\ a_2) + ... + (m\\ mod\\ a_N).\n\nHere, X\\ mod\\ Y denotes the remainder of the division of X by Y.\n\nFind the maximum value of f.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 3000\n\n2 \\leq a_i \\leq 10^5\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 value of f.\n\nSample Input 1\n\n3\n3 4 6\n\nSample Output 1\n\n10\n\nf(11) = (11\\ mod\\ 3) + (11\\ mod\\ 4) + (11\\ mod\\ 6) = 10 is the maximum value of f.\n\nSample Input 2\n\n5\n7 46 11 20 11\n\nSample Output 2\n\n90\n\nSample Input 3\n\n7\n994 518 941 851 647 2 581\n\nSample Output 3\n\n4527", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s360992382", "group_id": "codeNet:p03295", "input_text": "#include<stdio.h>\n#include<stdlib.h>\n#include<math.h>\n#include<string.h>\n#define F(i,a,n) for(int i=a; i<n; i++)\n\nint main(){\n    int n,m;\n    scanf(\"%d%d\",&n,&m);\n    int a[m],b[m],tmp_a,tmp_b,sum[n-1];\n    F(k,0,n-1){\n        sum[k]=0;\n    }\n    \n    F(i,0,m){\n        scanf(\"%d%d\",a+i,b+i);\n    }\n    \n    int iter=1;\n    while(iter){\n        iter=0;\n        F(i,0,m-1){\n            if(b[i]>b[i+1]){\n                tmp_b=b[i];\n                b[i]=b[i+1];\n                b[i+1]=tmp_b;\n                tmp_a=a[i];\n                a[i]=a[i+1];\n                a[i+1]=tmp_a;\n                iter=1;\n            }\n        }\n    }\n\n    int rem_num=0;\n    F(j,0,m){\n        if(b[j] != 0){\n            F(k,j+1,m){\n                if(a[k]<b[j]){\n                    a[k]=0;\n                    b[k]=0;\n                }\n            }\n            rem_num++;\n        }\n    }\n    printf(\"%d\\n\",rem_num);\n    return 0;\n}", "language": "C", "metadata": {"date": 1584153413, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "problem_description_relpath": "problem_descriptions/p03295.html", "problem_id": "p03295", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03295/input.txt", "sample_output_relpath": "derived/input_output/data/p03295/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03295/C/s360992382.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s360992382", "user_id": "u110006361"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "#include<stdio.h>\n#include<stdlib.h>\n#include<math.h>\n#include<string.h>\n#define F(i,a,n) for(int i=a; i<n; i++)\n\nint main(){\n    int n,m;\n    scanf(\"%d%d\",&n,&m);\n    int a[m],b[m],tmp_a,tmp_b,sum[n-1];\n    F(k,0,n-1){\n        sum[k]=0;\n    }\n    \n    F(i,0,m){\n        scanf(\"%d%d\",a+i,b+i);\n    }\n    \n    int iter=1;\n    while(iter){\n        iter=0;\n        F(i,0,m-1){\n            if(b[i]>b[i+1]){\n                tmp_b=b[i];\n                b[i]=b[i+1];\n                b[i+1]=tmp_b;\n                tmp_a=a[i];\n                a[i]=a[i+1];\n                a[i+1]=tmp_a;\n                iter=1;\n            }\n        }\n    }\n\n    int rem_num=0;\n    F(j,0,m){\n        if(b[j] != 0){\n            F(k,j+1,m){\n                if(a[k]<b[j]){\n                    a[k]=0;\n                    b[k]=0;\n                }\n            }\n            rem_num++;\n        }\n    }\n    printf(\"%d\\n\",rem_num);\n    return 0;\n}", "problem_context": "Score : 400 points\n\nProblem Statement\n\nThere are N islands lining up from west to east, connected by N-1 bridges.\n\nThe i-th bridge connects the i-th island from the west and the (i+1)-th island from the west.\n\nOne day, disputes took place between some islands, and there were M requests from the inhabitants of the islands:\n\nRequest i: A dispute took place between the a_i-th island from the west and the b_i-th island from the west. Please make traveling between these islands with bridges impossible.\n\nYou decided to remove some bridges to meet all these M requests.\n\nFind the minimum number of bridges that must be removed.\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 a_i < b_i \\leq N\n\nAll pairs (a_i, b_i) are distinct.\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\nPrint the minimum number of bridges that must be removed.\n\nSample Input 1\n\n5 2\n1 4\n2 5\n\nSample Output 1\n\n1\n\nThe requests can be met by removing the bridge connecting the second and third islands from the west.\n\nSample Input 2\n\n9 5\n1 8\n2 7\n3 5\n4 6\n7 9\n\nSample Output 2\n\n2\n\nSample Input 3\n\n5 10\n1 2\n1 3\n1 4\n1 5\n2 3\n2 4\n2 5\n3 4\n3 5\n4 5\n\nSample Output 3\n\n4", "sample_input": "5 2\n1 4\n2 5\n"}, "reference_outputs": ["1\n"], "source_document_id": "p03295", "source_text": "Score : 400 points\n\nProblem Statement\n\nThere are N islands lining up from west to east, connected by N-1 bridges.\n\nThe i-th bridge connects the i-th island from the west and the (i+1)-th island from the west.\n\nOne day, disputes took place between some islands, and there were M requests from the inhabitants of the islands:\n\nRequest i: A dispute took place between the a_i-th island from the west and the b_i-th island from the west. Please make traveling between these islands with bridges impossible.\n\nYou decided to remove some bridges to meet all these M requests.\n\nFind the minimum number of bridges that must be removed.\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 a_i < b_i \\leq N\n\nAll pairs (a_i, b_i) are distinct.\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\nPrint the minimum number of bridges that must be removed.\n\nSample Input 1\n\n5 2\n1 4\n2 5\n\nSample Output 1\n\n1\n\nThe requests can be met by removing the bridge connecting the second and third islands from the west.\n\nSample Input 2\n\n9 5\n1 8\n2 7\n3 5\n4 6\n7 9\n\nSample Output 2\n\n2\n\nSample Input 3\n\n5 10\n1 2\n1 3\n1 4\n1 5\n2 3\n2 4\n2 5\n3 4\n3 5\n4 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": 913, "cpu_time_ms": 2103, "memory_kb": 1280}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s632891321", "group_id": "codeNet:p03296", "input_text": "#include <stdio.h>\n\nint main(void) {\n\tint i, n, a, b = -1, cnt = 0, ans = 0;\n\t\n\tscanf(\"%d\", &n);\n\t\n\tfor (i = 0; i < n; i++) {\n\t\tscanf(\"%d\", &a);\n\t\tif (b == a) {\n\t\t\tcnt++;\n\t\t} else {\n\t\t\tans += (cnt+1) / 2;\n\t\t\tcnt = 0;\n\t\t}\n\t\tb = a;\n\t}\n\t\n\tans += (cnt+1) / 2;\n\t\n\tprintf(\"%d\\n\", ans);\n\t\n\treturn 0;\n}", "language": "C", "metadata": {"date": 1531617083, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "problem_description_relpath": "problem_descriptions/p03296.html", "problem_id": "p03296", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03296/input.txt", "sample_output_relpath": "derived/input_output/data/p03296/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03296/C/s632891321.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s632891321", "user_id": "u194609748"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "#include <stdio.h>\n\nint main(void) {\n\tint i, n, a, b = -1, cnt = 0, ans = 0;\n\t\n\tscanf(\"%d\", &n);\n\t\n\tfor (i = 0; i < n; i++) {\n\t\tscanf(\"%d\", &a);\n\t\tif (b == a) {\n\t\t\tcnt++;\n\t\t} else {\n\t\t\tans += (cnt+1) / 2;\n\t\t\tcnt = 0;\n\t\t}\n\t\tb = a;\n\t}\n\t\n\tans += (cnt+1) / 2;\n\t\n\tprintf(\"%d\\n\", ans);\n\t\n\treturn 0;\n}", "problem_context": "Score : 200 points\n\nProblem Statement\n\nTakahashi lives in another world. There are slimes (creatures) of 10000 colors in this world. Let us call these colors Color 1, 2, ..., 10000.\n\nTakahashi has N slimes, and they are standing in a row from left to right. The color of the i-th slime from the left is a_i.\nIf two slimes of the same color are adjacent, they will start to combine themselves. Because Takahashi likes smaller slimes, he has decided to change the colors of some of the slimes with his magic.\n\nTakahashi can change the color of one slime to any of the 10000 colors by one spell.\nHow many spells are required so that no slimes will start to combine themselves?\n\nConstraints\n\n2 \\leq N \\leq 100\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\nPrint the minimum number of spells required.\n\nSample Input 1\n\n5\n1 1 2 2 2\n\nSample Output 1\n\n2\n\nFor example, if we change the color of the second slime from the left to 4, and the color of the fourth slime to 5, the colors of the slimes will be 1, 4, 2, 5, 2, which satisfy the condition.\n\nSample Input 2\n\n3\n1 2 1\n\nSample Output 2\n\n0\n\nAlthough the colors of the first and third slimes are the same, they are not adjacent, so no spell is required.\n\nSample Input 3\n\n5\n1 1 1 1 1\n\nSample Output 3\n\n2\n\nFor example, if we change the colors of the second and fourth slimes from the left to 2, the colors of the slimes will be 1, 2, 1, 2, 1, which satisfy the condition.\n\nSample Input 4\n\n14\n1 2 2 3 3 3 4 4 4 4 1 2 3 4\n\nSample Output 4\n\n4", "sample_input": "5\n1 1 2 2 2\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03296", "source_text": "Score : 200 points\n\nProblem Statement\n\nTakahashi lives in another world. There are slimes (creatures) of 10000 colors in this world. Let us call these colors Color 1, 2, ..., 10000.\n\nTakahashi has N slimes, and they are standing in a row from left to right. The color of the i-th slime from the left is a_i.\nIf two slimes of the same color are adjacent, they will start to combine themselves. Because Takahashi likes smaller slimes, he has decided to change the colors of some of the slimes with his magic.\n\nTakahashi can change the color of one slime to any of the 10000 colors by one spell.\nHow many spells are required so that no slimes will start to combine themselves?\n\nConstraints\n\n2 \\leq N \\leq 100\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\nPrint the minimum number of spells required.\n\nSample Input 1\n\n5\n1 1 2 2 2\n\nSample Output 1\n\n2\n\nFor example, if we change the color of the second slime from the left to 4, and the color of the fourth slime to 5, the colors of the slimes will be 1, 4, 2, 5, 2, which satisfy the condition.\n\nSample Input 2\n\n3\n1 2 1\n\nSample Output 2\n\n0\n\nAlthough the colors of the first and third slimes are the same, they are not adjacent, so no spell is required.\n\nSample Input 3\n\n5\n1 1 1 1 1\n\nSample Output 3\n\n2\n\nFor example, if we change the colors of the second and fourth slimes from the left to 2, the colors of the slimes will be 1, 2, 1, 2, 1, which satisfy the condition.\n\nSample Input 4\n\n14\n1 2 2 3 3 3 4 4 4 4 1 2 3 4\n\nSample Output 4\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": 294, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s055233856", "group_id": "codeNet:p03297", "input_text": "#include <stdio.h>\n#include <string.h>\n#include <stdlib.h>\n\nint compare_long(const void *p, const void *q){\n    return *(long*)p - *(long*)q;\n}\n\nint main(){\n    int  i,N;\n    int  flg;\n    int  count=0;\n    long A,B,C,D;\n    long AB[1000000] = {};\n    long noon,night;\n    long *ptr;\n    \n    scanf(\"%d\", &N);\n    for(i=0;i<N;i++){\n        scanf(\"%ld %ld %ld %ld\", &A,&B,&C,&D);\n        night = A;\n        count = 0;\n        memset(AB,0,sizeof(AB));\n        \n        // 同じA-Bか出現するかA-Bがマイナスになるまでループ\n        while(1){\n            noon = night-B;\n            // マイナスになったらNo終了\n            if(noon < 0) {\n               flg = 1;\n               break;\n            }\n            \n            // 過去出たリストに同値があるか走査\n            ptr = (long*)bsearch(&noon,AB,count,sizeof(long),compare_long);\n            // 過去に出てない？\n            if( ptr == NULL ){\n                // 過去出たリストに追加してソート\n                AB[count++] = noon;\n                qsort(AB, count, sizeof(long), compare_long);\n                \n                // C以下ならD本補充\n                if(noon<=C){\n                    night = noon + D;\n                }\n                else{\n                    night = noon;\n                }\n            }\n            // 過去と同じA-Bが出現したらYes終了\n            else{\n                flg=0;\n                break;\n            }\n        }\n\n        if(flg==0){\n            printf(\"Yes\\n\");\n        }\n        else{\n            printf(\"No\\n\");\n        }\n    }\n\n    return 0;\n}\n", "language": "C", "metadata": {"date": 1532724978, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "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/C/s055233856.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s055233856", "user_id": "u892645884"}, "prompt_components": {"gold_output": "No\nYes\nNo\nYes\nYes\nNo\nNo\nYes\nNo\nYes\nYes\nNo\nNo\nYes\n", "input_to_evaluate": "#include <stdio.h>\n#include <string.h>\n#include <stdlib.h>\n\nint compare_long(const void *p, const void *q){\n    return *(long*)p - *(long*)q;\n}\n\nint main(){\n    int  i,N;\n    int  flg;\n    int  count=0;\n    long A,B,C,D;\n    long AB[1000000] = {};\n    long noon,night;\n    long *ptr;\n    \n    scanf(\"%d\", &N);\n    for(i=0;i<N;i++){\n        scanf(\"%ld %ld %ld %ld\", &A,&B,&C,&D);\n        night = A;\n        count = 0;\n        memset(AB,0,sizeof(AB));\n        \n        // 同じA-Bか出現するかA-Bがマイナスになるまでループ\n        while(1){\n            noon = night-B;\n            // マイナスになったらNo終了\n            if(noon < 0) {\n               flg = 1;\n               break;\n            }\n            \n            // 過去出たリストに同値があるか走査\n            ptr = (long*)bsearch(&noon,AB,count,sizeof(long),compare_long);\n            // 過去に出てない？\n            if( ptr == NULL ){\n                // 過去出たリストに追加してソート\n                AB[count++] = noon;\n                qsort(AB, count, sizeof(long), compare_long);\n                \n                // C以下ならD本補充\n                if(noon<=C){\n                    night = noon + D;\n                }\n                else{\n                    night = noon;\n                }\n            }\n            // 過去と同じA-Bが出現したらYes終了\n            else{\n                flg=0;\n                break;\n            }\n        }\n\n        if(flg==0){\n            printf(\"Yes\\n\");\n        }\n        else{\n            printf(\"No\\n\");\n        }\n    }\n\n    return 0;\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": 1628, "cpu_time_ms": 2103, "memory_kb": 8060}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s965706788", "group_id": "codeNet:p03302", "input_text": "#include <stdio.h>\nint main()\n{\n    int num1,num2;\n    scanf(\"%d%d\",&num1,&num2);\n    if(num1+num2==15)\n        printf(\"+\\n\");\n    else if(num1*num2==15)\n        printf(\"*\\n\");\n    else\n        printf(\"x\\n\");\n    return 0;\n}\n", "language": "C", "metadata": {"date": 1579800197, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "problem_description_relpath": "problem_descriptions/p03302.html", "problem_id": "p03302", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03302/input.txt", "sample_output_relpath": "derived/input_output/data/p03302/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03302/C/s965706788.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s965706788", "user_id": "u018679195"}, "prompt_components": {"gold_output": "+\n", "input_to_evaluate": "#include <stdio.h>\nint main()\n{\n    int num1,num2;\n    scanf(\"%d%d\",&num1,&num2);\n    if(num1+num2==15)\n        printf(\"+\\n\");\n    else if(num1*num2==15)\n        printf(\"*\\n\");\n    else\n        printf(\"x\\n\");\n    return 0;\n}\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou are given two integers a and b.\nDetermine if a+b=15 or a\\times b=15 or neither holds.\n\nNote that a+b=15 and a\\times b=15 do not hold at the same time.\n\nConstraints\n\n1 \\leq a,b \\leq 15\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\nIf a+b=15, print +;\nif a\\times b=15, print *;\nif neither holds, print x.\n\nSample Input 1\n\n4 11\n\nSample Output 1\n\n+\n\n4+11=15.\n\nSample Input 2\n\n3 5\n\nSample Output 2\n\n*\n\n3\\times 5=15.\n\nSample Input 3\n\n1 1\n\nSample Output 3\n\nx\n\n1+1=2 and 1\\times 1=1, neither of which is 15.", "sample_input": "4 11\n"}, "reference_outputs": ["+\n"], "source_document_id": "p03302", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou are given two integers a and b.\nDetermine if a+b=15 or a\\times b=15 or neither holds.\n\nNote that a+b=15 and a\\times b=15 do not hold at the same time.\n\nConstraints\n\n1 \\leq a,b \\leq 15\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\nIf a+b=15, print +;\nif a\\times b=15, print *;\nif neither holds, print x.\n\nSample Input 1\n\n4 11\n\nSample Output 1\n\n+\n\n4+11=15.\n\nSample Input 2\n\n3 5\n\nSample Output 2\n\n*\n\n3\\times 5=15.\n\nSample Input 3\n\n1 1\n\nSample Output 3\n\nx\n\n1+1=2 and 1\\times 1=1, neither of which is 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": 225, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s363366768", "group_id": "codeNet:p03302", "input_text": "#include <stdio.h>\n\nint main(){\n\tint a,b;\n\tscanf(\"%d%d\",&a,&b);\n\tif(a+b==15)\n\tprintf(\"+\\n\");\n\telse if(a*b==15)\n\tprintf(\"*\\n\");\n\telse \n\tprintf(\"×\\n\");\t\n\treturn 0;\n}", "language": "C", "metadata": {"date": 1531014865, "filename_ext": "c", "original_language": "C (Clang 3.8.0)", "problem_description_relpath": "problem_descriptions/p03302.html", "problem_id": "p03302", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03302/input.txt", "sample_output_relpath": "derived/input_output/data/p03302/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03302/C/s363366768.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s363366768", "user_id": "u592432366"}, "prompt_components": {"gold_output": "+\n", "input_to_evaluate": "#include <stdio.h>\n\nint main(){\n\tint a,b;\n\tscanf(\"%d%d\",&a,&b);\n\tif(a+b==15)\n\tprintf(\"+\\n\");\n\telse if(a*b==15)\n\tprintf(\"*\\n\");\n\telse \n\tprintf(\"×\\n\");\t\n\treturn 0;\n}", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou are given two integers a and b.\nDetermine if a+b=15 or a\\times b=15 or neither holds.\n\nNote that a+b=15 and a\\times b=15 do not hold at the same time.\n\nConstraints\n\n1 \\leq a,b \\leq 15\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\nIf a+b=15, print +;\nif a\\times b=15, print *;\nif neither holds, print x.\n\nSample Input 1\n\n4 11\n\nSample Output 1\n\n+\n\n4+11=15.\n\nSample Input 2\n\n3 5\n\nSample Output 2\n\n*\n\n3\\times 5=15.\n\nSample Input 3\n\n1 1\n\nSample Output 3\n\nx\n\n1+1=2 and 1\\times 1=1, neither of which is 15.", "sample_input": "4 11\n"}, "reference_outputs": ["+\n"], "source_document_id": "p03302", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou are given two integers a and b.\nDetermine if a+b=15 or a\\times b=15 or neither holds.\n\nNote that a+b=15 and a\\times b=15 do not hold at the same time.\n\nConstraints\n\n1 \\leq a,b \\leq 15\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\nIf a+b=15, print +;\nif a\\times b=15, print *;\nif neither holds, print x.\n\nSample Input 1\n\n4 11\n\nSample Output 1\n\n+\n\n4+11=15.\n\nSample Input 2\n\n3 5\n\nSample Output 2\n\n*\n\n3\\times 5=15.\n\nSample Input 3\n\n1 1\n\nSample Output 3\n\nx\n\n1+1=2 and 1\\times 1=1, neither of which is 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": 164, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s182144574", "group_id": "codeNet:p03303", "input_text": "#include<stdio.h>\n#include<string.h>\n\nint main()\n\n{\n      char str[1001];\n      scanf(\"%s\",str);\n      int n, i;\n      scanf(\"%d\",&n);\n      for(i=0; i<strlen(str);i=i+n)\n             {\n                   printf(\"%s\",str[i]);\n             }\nprintf(\"\\n\");\nreturn 0;\n}", "language": "C", "metadata": {"date": 1536130192, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "problem_description_relpath": "problem_descriptions/p03303.html", "problem_id": "p03303", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03303/input.txt", "sample_output_relpath": "derived/input_output/data/p03303/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03303/C/s182144574.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s182144574", "user_id": "u089230684"}, "prompt_components": {"gold_output": "adg\n", "input_to_evaluate": "#include<stdio.h>\n#include<string.h>\n\nint main()\n\n{\n      char str[1001];\n      scanf(\"%s\",str);\n      int n, i;\n      scanf(\"%d\",&n);\n      for(i=0; i<strlen(str);i=i+n)\n             {\n                   printf(\"%s\",str[i]);\n             }\nprintf(\"\\n\");\nreturn 0;\n}", "problem_context": "Score : 200 points\n\nProblem Statement\n\nYou are given a string S consisting of lowercase English letters.\nWe will write down this string, starting a new line after every w letters. Print the string obtained by concatenating the letters at the beginnings of these lines from top to bottom.\n\nConstraints\n\n1 \\leq w \\leq |S| \\leq 1000\n\nS consists of lowercase English letters.\n\nw is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\nw\n\nOutput\n\nPrint the desired string in one line.\n\nSample Input 1\n\nabcdefgh\n3\n\nSample Output 1\n\nadg\n\nWhen we write down abcdefgh, starting a new line after every three letters, we get the following:\n\nabc\n\ndef\n\ngh\n\nConcatenating the letters at the beginnings of these lines, we obtain adg.\n\nSample Input 2\n\nlllll\n1\n\nSample Output 2\n\nlllll\n\nSample Input 3\n\nsouuundhound\n2\n\nSample Output 3\n\nsuudon", "sample_input": "abcdefgh\n3\n"}, "reference_outputs": ["adg\n"], "source_document_id": "p03303", "source_text": "Score : 200 points\n\nProblem Statement\n\nYou are given a string S consisting of lowercase English letters.\nWe will write down this string, starting a new line after every w letters. Print the string obtained by concatenating the letters at the beginnings of these lines from top to bottom.\n\nConstraints\n\n1 \\leq w \\leq |S| \\leq 1000\n\nS consists of lowercase English letters.\n\nw is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\nw\n\nOutput\n\nPrint the desired string in one line.\n\nSample Input 1\n\nabcdefgh\n3\n\nSample Output 1\n\nadg\n\nWhen we write down abcdefgh, starting a new line after every three letters, we get the following:\n\nabc\n\ndef\n\ngh\n\nConcatenating the letters at the beginnings of these lines, we obtain adg.\n\nSample Input 2\n\nlllll\n1\n\nSample Output 2\n\nlllll\n\nSample Input 3\n\nsouuundhound\n2\n\nSample Output 3\n\nsuudon", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 99, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s055557828", "group_id": "codeNet:p03305", "input_text": "#include <stdio.h>\n#include <stdlib.h>\n#include <string.h>\n#include <stdbool.h>\n#include <math.h>\n#include <limits.h>\n\nint main(void){\n    long long n,m,s,t;\n    scanf(\"%lld%lld%lld%lld\",&n,&m,&s,&t);\n    s--;\n    t--;\n    long long u[m],v[m],a[m],b[m];\n    for (int i=0; i<m; i++){\n        scanf(\"%lld%lld%lld%lld\",&u[i],&v[i],&a[i],&b[i]);\n        u[i]--;\n        v[i]--;\n    }\n    long long y[m],k[m];\n    bool visited[n];\n    for (int i=0; i<n; i++){\n        y[i]=LLONG_MAX;\n        visited[i]=false;\n    }    \n    y[s]=0;\n    for (int i=0; i<n; i++){\n        long long tmp=LLONG_MAX,next;\n        for (int l=0; l<n; l++){\n            if (tmp>y[l] && visited[l]==false){\n                tmp=y[l];\n                next=l;\n            }\n        }\n        visited[next]=true;\n        for (int l=0; l<m; l++){\n            if (u[l]==next){\n                if (y[v[l]]>y[next]+a[l]){\n                    y[v[l]]=y[next]+a[l];\n                }\n            }\n            if (v[l]==next){\n                if (y[u[l]]>y[next]+a[l]){\n                    y[u[l]]=y[next]+a[l];\n                }\n            }\n        }\n    }\n    for (int i=0; i<n; i++){\n        k[i]=LLONG_MAX;\n        visited[i]=false;\n    }    \n    k[t]=0;\n    for (int i=0; i<n; i++){\n        long long tmp=LLONG_MAX,next;\n        for (int l=0; l<n; l++){\n            if (tmp>k[l] && visited[l]==false){\n                tmp=k[l];\n                next=l;\n            }\n        }\n        visited[next]=true;\n        for (int l=0; l<m; l++){\n            if (u[l]==next){\n                if (k[v[l]]>k[next]+b[l]){\n                    k[v[l]]=k[next]+b[l];\n                }\n            }\n            if (v[l]==next){\n                if (k[u[l]]>k[next]+b[l]){\n                    k[u[l]]=k[next]+b[l];\n                }\n            }\n        }\n    } \n    long long ans[n];\n    for (int i=0; i<n; i++){\n        ans[i]=y[i]+k[i];\n    }\n    for (int i=n-1; i>0; i--){\n        if (ans[i-1]>ans[i]){\n            ans[i-1]=ans[i];\n        }\n    }\n    for (int i=0; i<n; i++){\n        printf(\"%lld\\n\",1000000000000000-ans[i]);\n    }\n\treturn 0 ;\n}", "language": "C", "metadata": {"date": 1536759831, "filename_ext": "c", "original_language": "C (Clang 3.8.0)", "problem_description_relpath": "problem_descriptions/p03305.html", "problem_id": "p03305", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03305/input.txt", "sample_output_relpath": "derived/input_output/data/p03305/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03305/C/s055557828.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s055557828", "user_id": "u750028862"}, "prompt_components": {"gold_output": "999999999999998\n999999999999989\n999999999999979\n999999999999897\n", "input_to_evaluate": "#include <stdio.h>\n#include <stdlib.h>\n#include <string.h>\n#include <stdbool.h>\n#include <math.h>\n#include <limits.h>\n\nint main(void){\n    long long n,m,s,t;\n    scanf(\"%lld%lld%lld%lld\",&n,&m,&s,&t);\n    s--;\n    t--;\n    long long u[m],v[m],a[m],b[m];\n    for (int i=0; i<m; i++){\n        scanf(\"%lld%lld%lld%lld\",&u[i],&v[i],&a[i],&b[i]);\n        u[i]--;\n        v[i]--;\n    }\n    long long y[m],k[m];\n    bool visited[n];\n    for (int i=0; i<n; i++){\n        y[i]=LLONG_MAX;\n        visited[i]=false;\n    }    \n    y[s]=0;\n    for (int i=0; i<n; i++){\n        long long tmp=LLONG_MAX,next;\n        for (int l=0; l<n; l++){\n            if (tmp>y[l] && visited[l]==false){\n                tmp=y[l];\n                next=l;\n            }\n        }\n        visited[next]=true;\n        for (int l=0; l<m; l++){\n            if (u[l]==next){\n                if (y[v[l]]>y[next]+a[l]){\n                    y[v[l]]=y[next]+a[l];\n                }\n            }\n            if (v[l]==next){\n                if (y[u[l]]>y[next]+a[l]){\n                    y[u[l]]=y[next]+a[l];\n                }\n            }\n        }\n    }\n    for (int i=0; i<n; i++){\n        k[i]=LLONG_MAX;\n        visited[i]=false;\n    }    \n    k[t]=0;\n    for (int i=0; i<n; i++){\n        long long tmp=LLONG_MAX,next;\n        for (int l=0; l<n; l++){\n            if (tmp>k[l] && visited[l]==false){\n                tmp=k[l];\n                next=l;\n            }\n        }\n        visited[next]=true;\n        for (int l=0; l<m; l++){\n            if (u[l]==next){\n                if (k[v[l]]>k[next]+b[l]){\n                    k[v[l]]=k[next]+b[l];\n                }\n            }\n            if (v[l]==next){\n                if (k[u[l]]>k[next]+b[l]){\n                    k[u[l]]=k[next]+b[l];\n                }\n            }\n        }\n    } \n    long long ans[n];\n    for (int i=0; i<n; i++){\n        ans[i]=y[i]+k[i];\n    }\n    for (int i=n-1; i>0; i--){\n        if (ans[i-1]>ans[i]){\n            ans[i-1]=ans[i];\n        }\n    }\n    for (int i=0; i<n; i++){\n        printf(\"%lld\\n\",1000000000000000-ans[i]);\n    }\n\treturn 0 ;\n}", "problem_context": "Score : 400 points\n\nProblem Statement\n\nKenkoooo is planning a trip in Republic of Snuke.\nIn this country, there are n cities and m trains running.\nThe cities are numbered 1 through n, and the i-th train connects City u_i and v_i bidirectionally.\nAny city can be reached from any city by changing trains.\n\nTwo currencies are used in the country: yen and snuuk.\nAny train fare can be paid by both yen and snuuk.\nThe fare of the i-th train is a_i yen if paid in yen, and b_i snuuk if paid in snuuk.\n\nIn a city with a money exchange office, you can change 1 yen into 1 snuuk.\nHowever, when you do a money exchange, you have to change all your yen into snuuk.\nThat is, if Kenkoooo does a money exchange when he has X yen, he will then have X snuuk.\nCurrently, there is a money exchange office in every city, but the office in City i will shut down in i years and can never be used in and after that year.\n\nKenkoooo is planning to depart City s with 10^{15} yen in his pocket and head for City t, and change his yen into snuuk in some city while traveling.\nIt is acceptable to do the exchange in City s or City t.\n\nKenkoooo would like to have as much snuuk as possible when he reaches City t by making the optimal choices for the route to travel and the city to do the exchange.\nFor each i=0,...,n-1, find the maximum amount of snuuk that Kenkoooo has when he reaches City t if he goes on a trip from City s to City t after i years.\nYou can assume that the trip finishes within the year.\n\nConstraints\n\n2 \\leq n \\leq 10^5\n\n1 \\leq m \\leq 10^5\n\n1 \\leq s,t \\leq n\n\ns \\neq t\n\n1 \\leq u_i < v_i \\leq n\n\n1 \\leq a_i,b_i \\leq 10^9\n\nIf i\\neq j, then u_i \\neq u_j or v_i \\neq v_j.\n\nAny city can be reached from any city by changing trains.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nn m s t\nu_1 v_1 a_1 b_1\n:\nu_m v_m a_m b_m\n\nOutput\n\nPrint n lines.\nIn the i-th line, print the maximum amount of snuuk that Kenkoooo has when he reaches City t if he goes on a trip from City s to City t after i-1 years.\n\nSample Input 1\n\n4 3 2 3\n1 4 1 100\n1 2 1 10\n1 3 20 1\n\nSample Output 1\n\n999999999999998\n999999999999989\n999999999999979\n999999999999897\n\nAfter 0 years, it is optimal to do the exchange in City 1.\n\nAfter 1 years, it is optimal to do the exchange in City 2.\n\nNote that City 1 can still be visited even after the exchange office is closed.\nAlso note that, if it was allowed to keep 1 yen when do the exchange in City 2 and change the remaining yen into snuuk, we could reach City 3 with 999999999999998 snuuk, but this is NOT allowed.\n\nAfter 2 years, it is optimal to do the exchange in City 3.\n\nAfter 3 years, it is optimal to do the exchange in City 4.\nNote that the same train can be used multiple times.\n\nSample Input 2\n\n8 12 3 8\n2 8 685087149 857180777\n6 7 298270585 209942236\n2 4 346080035 234079976\n2 5 131857300 22507157\n4 8 30723332 173476334\n2 6 480845267 448565596\n1 4 181424400 548830121\n4 5 57429995 195056405\n7 8 160277628 479932440\n1 6 475692952 203530153\n3 5 336869679 160714712\n2 7 389775999 199123879\n\nSample Output 2\n\n999999574976994\n999999574976994\n999999574976994\n999999574976994\n999999574976994\n999999574976994\n999999574976994\n999999574976994", "sample_input": "4 3 2 3\n1 4 1 100\n1 2 1 10\n1 3 20 1\n"}, "reference_outputs": ["999999999999998\n999999999999989\n999999999999979\n999999999999897\n"], "source_document_id": "p03305", "source_text": "Score : 400 points\n\nProblem Statement\n\nKenkoooo is planning a trip in Republic of Snuke.\nIn this country, there are n cities and m trains running.\nThe cities are numbered 1 through n, and the i-th train connects City u_i and v_i bidirectionally.\nAny city can be reached from any city by changing trains.\n\nTwo currencies are used in the country: yen and snuuk.\nAny train fare can be paid by both yen and snuuk.\nThe fare of the i-th train is a_i yen if paid in yen, and b_i snuuk if paid in snuuk.\n\nIn a city with a money exchange office, you can change 1 yen into 1 snuuk.\nHowever, when you do a money exchange, you have to change all your yen into snuuk.\nThat is, if Kenkoooo does a money exchange when he has X yen, he will then have X snuuk.\nCurrently, there is a money exchange office in every city, but the office in City i will shut down in i years and can never be used in and after that year.\n\nKenkoooo is planning to depart City s with 10^{15} yen in his pocket and head for City t, and change his yen into snuuk in some city while traveling.\nIt is acceptable to do the exchange in City s or City t.\n\nKenkoooo would like to have as much snuuk as possible when he reaches City t by making the optimal choices for the route to travel and the city to do the exchange.\nFor each i=0,...,n-1, find the maximum amount of snuuk that Kenkoooo has when he reaches City t if he goes on a trip from City s to City t after i years.\nYou can assume that the trip finishes within the year.\n\nConstraints\n\n2 \\leq n \\leq 10^5\n\n1 \\leq m \\leq 10^5\n\n1 \\leq s,t \\leq n\n\ns \\neq t\n\n1 \\leq u_i < v_i \\leq n\n\n1 \\leq a_i,b_i \\leq 10^9\n\nIf i\\neq j, then u_i \\neq u_j or v_i \\neq v_j.\n\nAny city can be reached from any city by changing trains.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nn m s t\nu_1 v_1 a_1 b_1\n:\nu_m v_m a_m b_m\n\nOutput\n\nPrint n lines.\nIn the i-th line, print the maximum amount of snuuk that Kenkoooo has when he reaches City t if he goes on a trip from City s to City t after i-1 years.\n\nSample Input 1\n\n4 3 2 3\n1 4 1 100\n1 2 1 10\n1 3 20 1\n\nSample Output 1\n\n999999999999998\n999999999999989\n999999999999979\n999999999999897\n\nAfter 0 years, it is optimal to do the exchange in City 1.\n\nAfter 1 years, it is optimal to do the exchange in City 2.\n\nNote that City 1 can still be visited even after the exchange office is closed.\nAlso note that, if it was allowed to keep 1 yen when do the exchange in City 2 and change the remaining yen into snuuk, we could reach City 3 with 999999999999998 snuuk, but this is NOT allowed.\n\nAfter 2 years, it is optimal to do the exchange in City 3.\n\nAfter 3 years, it is optimal to do the exchange in City 4.\nNote that the same train can be used multiple times.\n\nSample Input 2\n\n8 12 3 8\n2 8 685087149 857180777\n6 7 298270585 209942236\n2 4 346080035 234079976\n2 5 131857300 22507157\n4 8 30723332 173476334\n2 6 480845267 448565596\n1 4 181424400 548830121\n4 5 57429995 195056405\n7 8 160277628 479932440\n1 6 475692952 203530153\n3 5 336869679 160714712\n2 7 389775999 199123879\n\nSample Output 2\n\n999999574976994\n999999574976994\n999999574976994\n999999574976994\n999999574976994\n999999574976994\n999999574976994\n999999574976994", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 2098, "cpu_time_ms": 2104, "memory_kb": 4224}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s112609650", "group_id": "codeNet:p03307", "input_text": "#include<stdio.h>\nint main()\n{\n\tint a;\n\tscanf(\"%d\",&a);\n\t\n\tif(a%2==0) printf(\"%d\\n\",a);\n\telse printf(\"%d\\n\",2*a);\n \n\treturn 0;\n}", "language": "C", "metadata": {"date": 1596063543, "filename_ext": "c", "original_language": "C (Clang 10.0.0)", "problem_description_relpath": "problem_descriptions/p03307.html", "problem_id": "p03307", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03307/input.txt", "sample_output_relpath": "derived/input_output/data/p03307/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03307/C/s112609650.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s112609650", "user_id": "u353919145"}, "prompt_components": {"gold_output": "6\n", "input_to_evaluate": "#include<stdio.h>\nint main()\n{\n\tint a;\n\tscanf(\"%d\",&a);\n\t\n\tif(a%2==0) printf(\"%d\\n\",a);\n\telse printf(\"%d\\n\",2*a);\n \n\treturn 0;\n}", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou are given a positive integer N.\nFind the minimum positive integer divisible by both 2 and N.\n\nConstraints\n\n1 \\leq N \\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\n\nOutput\n\nPrint the minimum positive integer divisible by both 2 and N.\n\nSample Input 1\n\n3\n\nSample Output 1\n\n6\n\n6 is divisible by both 2 and 3.\nAlso, there is no positive integer less than 6 that is divisible by both 2 and 3.\nThus, the answer is 6.\n\nSample Input 2\n\n10\n\nSample Output 2\n\n10\n\nSample Input 3\n\n999999999\n\nSample Output 3\n\n1999999998", "sample_input": "3\n"}, "reference_outputs": ["6\n"], "source_document_id": "p03307", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou are given a positive integer N.\nFind the minimum positive integer divisible by both 2 and N.\n\nConstraints\n\n1 \\leq N \\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\n\nOutput\n\nPrint the minimum positive integer divisible by both 2 and N.\n\nSample Input 1\n\n3\n\nSample Output 1\n\n6\n\n6 is divisible by both 2 and 3.\nAlso, there is no positive integer less than 6 that is divisible by both 2 and 3.\nThus, the answer is 6.\n\nSample Input 2\n\n10\n\nSample Output 2\n\n10\n\nSample Input 3\n\n999999999\n\nSample Output 3\n\n1999999998", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 128, "cpu_time_ms": 5, "memory_kb": 2112}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s900222049", "group_id": "codeNet:p03308", "input_text": "#include<stdio.h>\n\nint main(void)\n{\n int max,min,n;\n int tmp,i,s[100];\n\n scanf(\"%d\",&n);\n\n for(i=0;i<n;i++){\n  scanf(\"%d\",&s[i]);\n }\n max=s[0];\n min=s[0];\n\n for(i=0;i<n;i++){\n   if(max<s[i]) max=s[i];\n else if(min>s[i]) max=s[i];\n }\n\n tmp=max-min;\n printf(\"%d\\n\",tmp);\n\n return 0;\n}\n", "language": "C", "metadata": {"date": 1551211715, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "problem_description_relpath": "problem_descriptions/p03308.html", "problem_id": "p03308", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03308/input.txt", "sample_output_relpath": "derived/input_output/data/p03308/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03308/C/s900222049.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s900222049", "user_id": "u631851824"}, "prompt_components": {"gold_output": "5\n", "input_to_evaluate": "#include<stdio.h>\n\nint main(void)\n{\n int max,min,n;\n int tmp,i,s[100];\n\n scanf(\"%d\",&n);\n\n for(i=0;i<n;i++){\n  scanf(\"%d\",&s[i]);\n }\n max=s[0];\n min=s[0];\n\n for(i=0;i<n;i++){\n   if(max<s[i]) max=s[i];\n else if(min>s[i]) max=s[i];\n }\n\n tmp=max-min;\n printf(\"%d\\n\",tmp);\n\n return 0;\n}\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nYou are given an integer sequence A of length N.\nFind the maximum absolute difference of two elements (with different indices) in A.\n\nConstraints\n\n2 \\leq N \\leq 100\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 absolute difference of two elements (with different indices) in A.\n\nSample Input 1\n\n4\n1 4 6 3\n\nSample Output 1\n\n5\n\nThe maximum absolute difference of two elements is A_3-A_1=6-1=5.\n\nSample Input 2\n\n2\n1000000000 1\n\nSample Output 2\n\n999999999\n\nSample Input 3\n\n5\n1 1 1 1 1\n\nSample Output 3\n\n0", "sample_input": "4\n1 4 6 3\n"}, "reference_outputs": ["5\n"], "source_document_id": "p03308", "source_text": "Score : 200 points\n\nProblem Statement\n\nYou are given an integer sequence A of length N.\nFind the maximum absolute difference of two elements (with different indices) in A.\n\nConstraints\n\n2 \\leq N \\leq 100\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 absolute difference of two elements (with different indices) in A.\n\nSample Input 1\n\n4\n1 4 6 3\n\nSample Output 1\n\n5\n\nThe maximum absolute difference of two elements is A_3-A_1=6-1=5.\n\nSample Input 2\n\n2\n1000000000 1\n\nSample Output 2\n\n999999999\n\nSample Input 3\n\n5\n1 1 1 1 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": 283, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s077915854", "group_id": "codeNet:p03309", "input_text": "#include <stdio.h>\n#include <stdint.h>\n\nint main(void){\n  int n, i, sum=0, b, sad=0, tmp;\n  int l[200000];\n  scanf(\"%d\",&n);\n  for(i=0;i<n;i++){\n    scanf(\"%d\",&(l[i]));\n    l[i]-=(i+1);\n    sum+=l[i];\n  }\n  printf(\"%d\\n\", sum);\n  b=(sum-n)/n;\n  for(i=0;i<n;i++){\n    tmp=((l[i]-b)>0)?l[i]-b:b-l[i];\n    printf(\"%d \", tmp);\n    sad+=tmp;\n  }\n  printf(\"\\n%d\\n\", sad);\n}", "language": "C", "metadata": {"date": 1530495137, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "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/C/s077915854.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s077915854", "user_id": "u510283765"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "#include <stdio.h>\n#include <stdint.h>\n\nint main(void){\n  int n, i, sum=0, b, sad=0, tmp;\n  int l[200000];\n  scanf(\"%d\",&n);\n  for(i=0;i<n;i++){\n    scanf(\"%d\",&(l[i]));\n    l[i]-=(i+1);\n    sum+=l[i];\n  }\n  printf(\"%d\\n\", sum);\n  b=(sum-n)/n;\n  for(i=0;i<n;i++){\n    tmp=((l[i]-b)>0)?l[i]-b:b-l[i];\n    printf(\"%d \", tmp);\n    sad+=tmp;\n  }\n  printf(\"\\n%d\\n\", sad);\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": 368, "cpu_time_ms": 44, "memory_kb": 2944}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s085845795", "group_id": "codeNet:p03315", "input_text": "#include <stdio.h>\n#include <stdlib.h>\n#include <string.h>\nint main() {\n  int i,c=0;\n  char s[5];\n  scanf(\"%s\",s );\n  for(i=0;i<4;i++){\n    if(s[i]=='+')\n    c++;\n    else\n    c--;\n  }\n  printf(\"%d\",c );\n}\n", "language": "C", "metadata": {"date": 1534992918, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "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/C/s085845795.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s085845795", "user_id": "u645250356"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "#include <stdio.h>\n#include <stdlib.h>\n#include <string.h>\nint main() {\n  int i,c=0;\n  char s[5];\n  scanf(\"%s\",s );\n  for(i=0;i<4;i++){\n    if(s[i]=='+')\n    c++;\n    else\n    c--;\n  }\n  printf(\"%d\",c );\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": 206, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s526658781", "group_id": "codeNet:p03315", "input_text": "#include<stdio.h>\n\nint main(void)\n{\n  int ans=0,i;\n  char s[5];\n  scanf(\"%s\",s);\n  for(i=0;i<4;i++)\n    {\n      if(s[i] == '-')\n\t{\n\t  ans--;\n\t}\n      else\n\t{\n\t  ans++;\n\t}\n    }\n  printf(\"%d\\n\",ans);\n  return 0;\n}\n\n", "language": "C", "metadata": {"date": 1529865060, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "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/C/s526658781.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s526658781", "user_id": "u610509294"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "#include<stdio.h>\n\nint main(void)\n{\n  int ans=0,i;\n  char s[5];\n  scanf(\"%s\",s);\n  for(i=0;i<4;i++)\n    {\n      if(s[i] == '-')\n\t{\n\t  ans--;\n\t}\n      else\n\t{\n\t  ans++;\n\t}\n    }\n  printf(\"%d\\n\",ans);\n  return 0;\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": 214, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s517050821", "group_id": "codeNet:p03315", "input_text": "#include<stdio.h>\n#include<string.h>\n\nint main(void){\n    int ct = 0;\n    char a[5] = {'\\0'};\n    int i;\n\n    scanf(\"%s\", a);\n\n    for( i =0 ; a[i] != '\\0'; i++){\n        if(a[i] == '+'){\n            ct++;\n        }else{\n            ct--;\n        }\n    }\n\n    printf(\"%d\\n\", ct);\n    return 0;\n}\n", "language": "C", "metadata": {"date": 1529803709, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "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/C/s517050821.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s517050821", "user_id": "u579508806"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "#include<stdio.h>\n#include<string.h>\n\nint main(void){\n    int ct = 0;\n    char a[5] = {'\\0'};\n    int i;\n\n    scanf(\"%s\", a);\n\n    for( i =0 ; a[i] != '\\0'; i++){\n        if(a[i] == '+'){\n            ct++;\n        }else{\n            ct--;\n        }\n    }\n\n    printf(\"%d\\n\", ct);\n    return 0;\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": 296, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s595817318", "group_id": "codeNet:p03316", "input_text": "#include <stdio.h>\n#include <string.h>\n\nint main(void)\n{\n    int i, total = 0, x, y;\n    int n;\n    scanf(\"%d\", &n);\n\n    x = n;\n    while (x / 10 > 0)\n    {\n        y = x % 10;\n        x = x / 10;\n        total += y;\n    }\n\n    total += x;\n\n    if (n % total == 0)\n    {\n        printf(\"Yes\\n\");\n    }\n    else\n    {\n        printf(\"No\\n\");\n    }\n    return 0;\n}", "language": "C", "metadata": {"date": 1542578827, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "problem_description_relpath": "problem_descriptions/p03316.html", "problem_id": "p03316", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03316/input.txt", "sample_output_relpath": "derived/input_output/data/p03316/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03316/C/s595817318.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s595817318", "user_id": "u878923622"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "#include <stdio.h>\n#include <string.h>\n\nint main(void)\n{\n    int i, total = 0, x, y;\n    int n;\n    scanf(\"%d\", &n);\n\n    x = n;\n    while (x / 10 > 0)\n    {\n        y = x % 10;\n        x = x / 10;\n        total += y;\n    }\n\n    total += x;\n\n    if (n % total == 0)\n    {\n        printf(\"Yes\\n\");\n    }\n    else\n    {\n        printf(\"No\\n\");\n    }\n    return 0;\n}", "problem_context": "Score : 200 points\n\nProblem Statement\n\nLet S(n) denote the sum of the digits in the decimal notation of n.\nFor example, S(101) = 1 + 0 + 1 = 2.\n\nGiven an integer N, determine if S(N) divides N.\n\nConstraints\n\n1 \\leq N \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nIf S(N) divides N, print Yes; if it does not, print No.\n\nSample Input 1\n\n12\n\nSample Output 1\n\nYes\n\nIn this input, N=12.\nAs S(12) = 1 + 2 = 3, S(N) divides N.\n\nSample Input 2\n\n101\n\nSample Output 2\n\nNo\n\nAs S(101) = 1 + 0 + 1 = 2, S(N) does not divide N.\n\nSample Input 3\n\n999999999\n\nSample Output 3\n\nYes", "sample_input": "12\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p03316", "source_text": "Score : 200 points\n\nProblem Statement\n\nLet S(n) denote the sum of the digits in the decimal notation of n.\nFor example, S(101) = 1 + 0 + 1 = 2.\n\nGiven an integer N, determine if S(N) divides N.\n\nConstraints\n\n1 \\leq N \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nIf S(N) divides N, print Yes; if it does not, print No.\n\nSample Input 1\n\n12\n\nSample Output 1\n\nYes\n\nIn this input, N=12.\nAs S(12) = 1 + 2 = 3, S(N) divides N.\n\nSample Input 2\n\n101\n\nSample Output 2\n\nNo\n\nAs S(101) = 1 + 0 + 1 = 2, S(N) does not divide N.\n\nSample Input 3\n\n999999999\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": 363, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s490356385", "group_id": "codeNet:p03317", "input_text": "#include<stdio.h>\nint main(void){\n  int n,k,ans=1;\n  scanf(\"%d %d\",&n,&k);\n  while (n>ans*(k-1)+1){\n    ans++;\n  }\n  printf(ans);\n  return 0;\n}", "language": "C", "metadata": {"date": 1557258818, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "problem_description_relpath": "problem_descriptions/p03317.html", "problem_id": "p03317", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03317/input.txt", "sample_output_relpath": "derived/input_output/data/p03317/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03317/C/s490356385.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s490356385", "user_id": "u046585946"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "#include<stdio.h>\nint main(void){\n  int n,k,ans=1;\n  scanf(\"%d %d\",&n,&k);\n  while (n>ans*(k-1)+1){\n    ans++;\n  }\n  printf(ans);\n  return 0;\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": "p03317", "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": 143, "cpu_time_ms": 97, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s443895006", "group_id": "codeNet:p03323", "input_text": "#include<stdio.h>\nint main()\n{\n    int a,b,ck;\n    scanf(\"%d %d\",&a,&b);\n    if((a<=8 && b<=8) &&(a+b<=16))\n        printf(\"Yay!\\n\");\n    else\n        printf(\":(\\n\");\n\n    return 0;\n}\n", "language": "C", "metadata": {"date": 1537505044, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "problem_description_relpath": "problem_descriptions/p03323.html", "problem_id": "p03323", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03323/input.txt", "sample_output_relpath": "derived/input_output/data/p03323/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03323/C/s443895006.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s443895006", "user_id": "u089230684"}, "prompt_components": {"gold_output": "Yay!\n", "input_to_evaluate": "#include<stdio.h>\nint main()\n{\n    int a,b,ck;\n    scanf(\"%d %d\",&a,&b);\n    if((a<=8 && b<=8) &&(a+b<=16))\n        printf(\"Yay!\\n\");\n    else\n        printf(\":(\\n\");\n\n    return 0;\n}\n", "problem_context": "Score: 100 points\n\nProblem Statement\n\nE869120's and square1001's 16-th birthday is coming soon.\n\nTakahashi from AtCoder Kingdom gave them a round cake cut into 16 equal fan-shaped pieces.\n\nE869120 and square1001 were just about to eat A and B of those pieces, respectively,\n\nwhen they found a note attached to the cake saying that \"the same person should not take two adjacent pieces of cake\".\n\nCan both of them obey the instruction in the note and take desired numbers of pieces of cake?\n\nConstraints\n\nA and B are integers between 1 and 16 (inclusive).\n\nA+B is at most 16.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nIf both E869120 and square1001 can obey the instruction in the note and take desired numbers of pieces of cake, print Yay!; otherwise, print :(.\n\nSample Input 1\n\n5 4\n\nSample Output 1\n\nYay!\n\nBoth of them can take desired number of pieces as follows:\n\nSample Input 2\n\n8 8\n\nSample Output 2\n\nYay!\n\nBoth of them can take desired number of pieces as follows:\n\nSample Input 3\n\n11 4\n\nSample Output 3\n\n:(\n\nIn this case, there is no way for them to take desired number of pieces, unfortunately.", "sample_input": "5 4\n"}, "reference_outputs": ["Yay!\n"], "source_document_id": "p03323", "source_text": "Score: 100 points\n\nProblem Statement\n\nE869120's and square1001's 16-th birthday is coming soon.\n\nTakahashi from AtCoder Kingdom gave them a round cake cut into 16 equal fan-shaped pieces.\n\nE869120 and square1001 were just about to eat A and B of those pieces, respectively,\n\nwhen they found a note attached to the cake saying that \"the same person should not take two adjacent pieces of cake\".\n\nCan both of them obey the instruction in the note and take desired numbers of pieces of cake?\n\nConstraints\n\nA and B are integers between 1 and 16 (inclusive).\n\nA+B is at most 16.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nIf both E869120 and square1001 can obey the instruction in the note and take desired numbers of pieces of cake, print Yay!; otherwise, print :(.\n\nSample Input 1\n\n5 4\n\nSample Output 1\n\nYay!\n\nBoth of them can take desired number of pieces as follows:\n\nSample Input 2\n\n8 8\n\nSample Output 2\n\nYay!\n\nBoth of them can take desired number of pieces as follows:\n\nSample Input 3\n\n11 4\n\nSample Output 3\n\n:(\n\nIn this case, there is no way for them to take desired number of pieces, unfortunately.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 184, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s323988650", "group_id": "codeNet:p03323", "input_text": "#include<stdio.h>\n\nint main(){\n    int A, B, ans;\n    scanf(\"%d %d\", &A, &B);\n    if(A <= 8 && B <= 8){\n        printf(\"Yay!\");\n    }\n    else{\n        printf(\":(\");\n    }\n    return 0;\n}", "language": "C", "metadata": {"date": 1536175858, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "problem_description_relpath": "problem_descriptions/p03323.html", "problem_id": "p03323", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03323/input.txt", "sample_output_relpath": "derived/input_output/data/p03323/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03323/C/s323988650.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s323988650", "user_id": "u251252118"}, "prompt_components": {"gold_output": "Yay!\n", "input_to_evaluate": "#include<stdio.h>\n\nint main(){\n    int A, B, ans;\n    scanf(\"%d %d\", &A, &B);\n    if(A <= 8 && B <= 8){\n        printf(\"Yay!\");\n    }\n    else{\n        printf(\":(\");\n    }\n    return 0;\n}", "problem_context": "Score: 100 points\n\nProblem Statement\n\nE869120's and square1001's 16-th birthday is coming soon.\n\nTakahashi from AtCoder Kingdom gave them a round cake cut into 16 equal fan-shaped pieces.\n\nE869120 and square1001 were just about to eat A and B of those pieces, respectively,\n\nwhen they found a note attached to the cake saying that \"the same person should not take two adjacent pieces of cake\".\n\nCan both of them obey the instruction in the note and take desired numbers of pieces of cake?\n\nConstraints\n\nA and B are integers between 1 and 16 (inclusive).\n\nA+B is at most 16.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nIf both E869120 and square1001 can obey the instruction in the note and take desired numbers of pieces of cake, print Yay!; otherwise, print :(.\n\nSample Input 1\n\n5 4\n\nSample Output 1\n\nYay!\n\nBoth of them can take desired number of pieces as follows:\n\nSample Input 2\n\n8 8\n\nSample Output 2\n\nYay!\n\nBoth of them can take desired number of pieces as follows:\n\nSample Input 3\n\n11 4\n\nSample Output 3\n\n:(\n\nIn this case, there is no way for them to take desired number of pieces, unfortunately.", "sample_input": "5 4\n"}, "reference_outputs": ["Yay!\n"], "source_document_id": "p03323", "source_text": "Score: 100 points\n\nProblem Statement\n\nE869120's and square1001's 16-th birthday is coming soon.\n\nTakahashi from AtCoder Kingdom gave them a round cake cut into 16 equal fan-shaped pieces.\n\nE869120 and square1001 were just about to eat A and B of those pieces, respectively,\n\nwhen they found a note attached to the cake saying that \"the same person should not take two adjacent pieces of cake\".\n\nCan both of them obey the instruction in the note and take desired numbers of pieces of cake?\n\nConstraints\n\nA and B are integers between 1 and 16 (inclusive).\n\nA+B is at most 16.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nIf both E869120 and square1001 can obey the instruction in the note and take desired numbers of pieces of cake, print Yay!; otherwise, print :(.\n\nSample Input 1\n\n5 4\n\nSample Output 1\n\nYay!\n\nBoth of them can take desired number of pieces as follows:\n\nSample Input 2\n\n8 8\n\nSample Output 2\n\nYay!\n\nBoth of them can take desired number of pieces as follows:\n\nSample Input 3\n\n11 4\n\nSample Output 3\n\n:(\n\nIn this case, there is no way for them to take desired number of pieces, unfortunately.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 187, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s619361631", "group_id": "codeNet:p03323", "input_text": "#include<stdio.h>\n\nint main(void)\n{\n   int a,b;\n\n   scanf(\"%d%d\",&a,&b);\n\n   if(a<=8 && b<=8)\n     printf(\"Yay!\\n\");\n   else\n     printf(\":(\\n\");\n\n   return 0;\n}\n", "language": "C", "metadata": {"date": 1530278333, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "problem_description_relpath": "problem_descriptions/p03323.html", "problem_id": "p03323", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03323/input.txt", "sample_output_relpath": "derived/input_output/data/p03323/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03323/C/s619361631.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s619361631", "user_id": "u276193349"}, "prompt_components": {"gold_output": "Yay!\n", "input_to_evaluate": "#include<stdio.h>\n\nint main(void)\n{\n   int a,b;\n\n   scanf(\"%d%d\",&a,&b);\n\n   if(a<=8 && b<=8)\n     printf(\"Yay!\\n\");\n   else\n     printf(\":(\\n\");\n\n   return 0;\n}\n", "problem_context": "Score: 100 points\n\nProblem Statement\n\nE869120's and square1001's 16-th birthday is coming soon.\n\nTakahashi from AtCoder Kingdom gave them a round cake cut into 16 equal fan-shaped pieces.\n\nE869120 and square1001 were just about to eat A and B of those pieces, respectively,\n\nwhen they found a note attached to the cake saying that \"the same person should not take two adjacent pieces of cake\".\n\nCan both of them obey the instruction in the note and take desired numbers of pieces of cake?\n\nConstraints\n\nA and B are integers between 1 and 16 (inclusive).\n\nA+B is at most 16.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nIf both E869120 and square1001 can obey the instruction in the note and take desired numbers of pieces of cake, print Yay!; otherwise, print :(.\n\nSample Input 1\n\n5 4\n\nSample Output 1\n\nYay!\n\nBoth of them can take desired number of pieces as follows:\n\nSample Input 2\n\n8 8\n\nSample Output 2\n\nYay!\n\nBoth of them can take desired number of pieces as follows:\n\nSample Input 3\n\n11 4\n\nSample Output 3\n\n:(\n\nIn this case, there is no way for them to take desired number of pieces, unfortunately.", "sample_input": "5 4\n"}, "reference_outputs": ["Yay!\n"], "source_document_id": "p03323", "source_text": "Score: 100 points\n\nProblem Statement\n\nE869120's and square1001's 16-th birthday is coming soon.\n\nTakahashi from AtCoder Kingdom gave them a round cake cut into 16 equal fan-shaped pieces.\n\nE869120 and square1001 were just about to eat A and B of those pieces, respectively,\n\nwhen they found a note attached to the cake saying that \"the same person should not take two adjacent pieces of cake\".\n\nCan both of them obey the instruction in the note and take desired numbers of pieces of cake?\n\nConstraints\n\nA and B are integers between 1 and 16 (inclusive).\n\nA+B is at most 16.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nIf both E869120 and square1001 can obey the instruction in the note and take desired numbers of pieces of cake, print Yay!; otherwise, print :(.\n\nSample Input 1\n\n5 4\n\nSample Output 1\n\nYay!\n\nBoth of them can take desired number of pieces as follows:\n\nSample Input 2\n\n8 8\n\nSample Output 2\n\nYay!\n\nBoth of them can take desired number of pieces as follows:\n\nSample Input 3\n\n11 4\n\nSample Output 3\n\n:(\n\nIn this case, there is no way for them to take desired number of pieces, unfortunately.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 162, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s044911831", "group_id": "codeNet:p03328", "input_text": "#include<stdio.h>\n\nint main(){\n\t\tint a,b;\n\t\tscanf(\"%d%d\",&a,&b);\n\t\tint sa=b-a-1;\n\t\tint sowa=(sa+1)*sa/2;\n\t\tprintf(\"%d\\n\",sowa-a);\n\n\t\treturn 0;\n}\n\n", "language": "C", "metadata": {"date": 1534446745, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "problem_description_relpath": "problem_descriptions/p03328.html", "problem_id": "p03328", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03328/input.txt", "sample_output_relpath": "derived/input_output/data/p03328/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03328/C/s044911831.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s044911831", "user_id": "u946810083"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "#include<stdio.h>\n\nint main(){\n\t\tint a,b;\n\t\tscanf(\"%d%d\",&a,&b);\n\t\tint sa=b-a-1;\n\t\tint sowa=(sa+1)*sa/2;\n\t\tprintf(\"%d\\n\",sowa-a);\n\n\t\treturn 0;\n}\n\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nIn some village, there are 999 towers that are 1,(1+2),(1+2+3),...,(1+2+3+...+999) meters high from west to east, at intervals of 1 meter.\n\nIt had been snowing for a while before it finally stopped. For some two adjacent towers located 1 meter apart, we measured the lengths of the parts of those towers that are not covered with snow, and the results are a meters for the west tower, and b meters for the east tower.\n\nAssuming that the depth of snow cover and the altitude are the same everywhere in the village, find the amount of the snow cover.\n\nAssume also that the depth of the snow cover is always at least 1 meter.\n\nConstraints\n\n1 \\leq a < b < 499500(=1+2+3+...+999)\n\nAll values in input are integers.\n\nThere is no input that contradicts the assumption.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na b\n\nOutput\n\nIf the depth of the snow cover is x meters, print x as an integer.\n\nSample Input 1\n\n8 13\n\nSample Output 1\n\n2\n\nThe heights of the two towers are 10 meters and 15 meters, respectively.\nThus, we can see that the depth of the snow cover is 2 meters.\n\nSample Input 2\n\n54 65\n\nSample Output 2\n\n1", "sample_input": "8 13\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03328", "source_text": "Score : 200 points\n\nProblem Statement\n\nIn some village, there are 999 towers that are 1,(1+2),(1+2+3),...,(1+2+3+...+999) meters high from west to east, at intervals of 1 meter.\n\nIt had been snowing for a while before it finally stopped. For some two adjacent towers located 1 meter apart, we measured the lengths of the parts of those towers that are not covered with snow, and the results are a meters for the west tower, and b meters for the east tower.\n\nAssuming that the depth of snow cover and the altitude are the same everywhere in the village, find the amount of the snow cover.\n\nAssume also that the depth of the snow cover is always at least 1 meter.\n\nConstraints\n\n1 \\leq a < b < 499500(=1+2+3+...+999)\n\nAll values in input are integers.\n\nThere is no input that contradicts the assumption.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na b\n\nOutput\n\nIf the depth of the snow cover is x meters, print x as an integer.\n\nSample Input 1\n\n8 13\n\nSample Output 1\n\n2\n\nThe heights of the two towers are 10 meters and 15 meters, respectively.\nThus, we can see that the depth of the snow cover is 2 meters.\n\nSample Input 2\n\n54 65\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": 146, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s701117066", "group_id": "codeNet:p03329", "input_text": "#include <stdio.h>\n\n#define Nmax 110000\n#define MAX(x, y) (((x) > (y)) ? (x) : (y))\n#define MIN(x, y) (((x) < (y)) ? (x) : (y))\nint memo[Nmax];\n\nint dp(int n) {\n    if (memo[n] != -1) return memo[n];\n    if (n == 0) return 0;\n    int ans = 100000000;\n    for (int n6 = 1; n6 <= n; n6 *= 6) {\n        ans = MIN(ans, 1 + dp(n - n6));\n    }\n    for (int n9 = 1; n9 <= n; n9 *= 9) {\n        ans = MIN(ans, 1 + dp(n - n9));\n    }\n    return memo[n] = ans;\n}\n\nint main() {\n    int N;\n    scanf(\"%d\",&N);  \n    for (int i=0; i<Nmax; i++) memo[i] = -1;\n    printf(\"%d\", dp(N));\n}\n\n\n", "language": "C", "metadata": {"date": 1548491173, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "problem_description_relpath": "problem_descriptions/p03329.html", "problem_id": "p03329", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03329/input.txt", "sample_output_relpath": "derived/input_output/data/p03329/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03329/C/s701117066.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s701117066", "user_id": "u909601929"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "#include <stdio.h>\n\n#define Nmax 110000\n#define MAX(x, y) (((x) > (y)) ? (x) : (y))\n#define MIN(x, y) (((x) < (y)) ? (x) : (y))\nint memo[Nmax];\n\nint dp(int n) {\n    if (memo[n] != -1) return memo[n];\n    if (n == 0) return 0;\n    int ans = 100000000;\n    for (int n6 = 1; n6 <= n; n6 *= 6) {\n        ans = MIN(ans, 1 + dp(n - n6));\n    }\n    for (int n9 = 1; n9 <= n; n9 *= 9) {\n        ans = MIN(ans, 1 + dp(n - n9));\n    }\n    return memo[n] = ans;\n}\n\nint main() {\n    int N;\n    scanf(\"%d\",&N);  \n    for (int i=0; i<Nmax; i++) memo[i] = -1;\n    printf(\"%d\", dp(N));\n}\n\n\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nTo make it difficult to withdraw money, a certain bank allows its customers to withdraw only one of the following amounts in one operation:\n\n1 yen (the currency of Japan)\n\n6 yen, 6^2(=36) yen, 6^3(=216) yen, ...\n\n9 yen, 9^2(=81) yen, 9^3(=729) yen, ...\n\nAt least how many operations are required to withdraw exactly N yen in total?\n\nIt is not allowed to re-deposit the money you withdrew.\n\nConstraints\n\n1 \\leq N \\leq 100000\n\nN is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nIf at least x operations are required to withdraw exactly N yen in total, print x.\n\nSample Input 1\n\n127\n\nSample Output 1\n\n4\n\nBy withdrawing 1 yen, 9 yen, 36(=6^2) yen and 81(=9^2) yen, we can withdraw 127 yen in four operations.\n\nSample Input 2\n\n3\n\nSample Output 2\n\n3\n\nBy withdrawing 1 yen three times, we can withdraw 3 yen in three operations.\n\nSample Input 3\n\n44852\n\nSample Output 3\n\n16", "sample_input": "127\n"}, "reference_outputs": ["4\n"], "source_document_id": "p03329", "source_text": "Score : 300 points\n\nProblem Statement\n\nTo make it difficult to withdraw money, a certain bank allows its customers to withdraw only one of the following amounts in one operation:\n\n1 yen (the currency of Japan)\n\n6 yen, 6^2(=36) yen, 6^3(=216) yen, ...\n\n9 yen, 9^2(=81) yen, 9^3(=729) yen, ...\n\nAt least how many operations are required to withdraw exactly N yen in total?\n\nIt is not allowed to re-deposit the money you withdrew.\n\nConstraints\n\n1 \\leq N \\leq 100000\n\nN is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nIf at least x operations are required to withdraw exactly N yen in total, print x.\n\nSample Input 1\n\n127\n\nSample Output 1\n\n4\n\nBy withdrawing 1 yen, 9 yen, 36(=6^2) yen and 81(=9^2) yen, we can withdraw 127 yen in four operations.\n\nSample Input 2\n\n3\n\nSample Output 2\n\n3\n\nBy withdrawing 1 yen three times, we can withdraw 3 yen in three operations.\n\nSample Input 3\n\n44852\n\nSample Output 3\n\n16", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 574, "cpu_time_ms": 9, "memory_kb": 5248}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s190185152", "group_id": "codeNet:p03331", "input_text": "#include<stdio.h>\n\nint main(){\n    int n,ans=0, i,b;\n    scanf(\"%d\", &n);\n    for(i=0;i<6;i++){\n        b = n%10;\n        n = n/10;\n        ans += b;\n    }\n    printf(\"%d\\n\", ans);\n    return 0;\n}", "language": "C", "metadata": {"date": 1529803062, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "problem_description_relpath": "problem_descriptions/p03331.html", "problem_id": "p03331", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03331/input.txt", "sample_output_relpath": "derived/input_output/data/p03331/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03331/C/s190185152.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s190185152", "user_id": "u291369268"}, "prompt_components": {"gold_output": "6\n", "input_to_evaluate": "#include<stdio.h>\n\nint main(){\n    int n,ans=0, i,b;\n    scanf(\"%d\", &n);\n    for(i=0;i<6;i++){\n        b = n%10;\n        n = n/10;\n        ans += b;\n    }\n    printf(\"%d\\n\", ans);\n    return 0;\n}", "problem_context": "Score : 200 points\n\nProblem Statement\n\nTakahashi has two positive integers A and B.\n\nIt is known that A plus B equals N.\nFind the minimum possible value of \"the sum of the digits of A\" plus \"the sum of the digits of B\" (in base 10).\n\nConstraints\n\n2 ≤ N ≤ 10^5\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 possible value of \"the sum of the digits of A\" plus \"the sum of the digits of B\".\n\nSample Input 1\n\n15\n\nSample Output 1\n\n6\n\nWhen A=2 and B=13, the sums of their digits are 2 and 4, which minimizes the value in question.\n\nSample Input 2\n\n100000\n\nSample Output 2\n\n10", "sample_input": "15\n"}, "reference_outputs": ["6\n"], "source_document_id": "p03331", "source_text": "Score : 200 points\n\nProblem Statement\n\nTakahashi has two positive integers A and B.\n\nIt is known that A plus B equals N.\nFind the minimum possible value of \"the sum of the digits of A\" plus \"the sum of the digits of B\" (in base 10).\n\nConstraints\n\n2 ≤ N ≤ 10^5\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 possible value of \"the sum of the digits of A\" plus \"the sum of the digits of B\".\n\nSample Input 1\n\n15\n\nSample Output 1\n\n6\n\nWhen A=2 and B=13, the sums of their digits are 2 and 4, which minimizes the value in question.\n\nSample Input 2\n\n100000\n\nSample Output 2\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": 196, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s346328610", "group_id": "codeNet:p03331", "input_text": "#include<stdio.h>\nint main(){\n int n;\n  scanf(\"%d\",&n);\n  int c=0;\n  if(n%10==0){\n    printf(\"%d\",10);\n    return 0;\n  }\n  while(n!=0){\n   c+=n%10;\n    n/=10;\n  }\n printf(\"%d\",c);  \n  return 0;\n}", "language": "C", "metadata": {"date": 1528120928, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "problem_description_relpath": "problem_descriptions/p03331.html", "problem_id": "p03331", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03331/input.txt", "sample_output_relpath": "derived/input_output/data/p03331/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03331/C/s346328610.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s346328610", "user_id": "u381746350"}, "prompt_components": {"gold_output": "6\n", "input_to_evaluate": "#include<stdio.h>\nint main(){\n int n;\n  scanf(\"%d\",&n);\n  int c=0;\n  if(n%10==0){\n    printf(\"%d\",10);\n    return 0;\n  }\n  while(n!=0){\n   c+=n%10;\n    n/=10;\n  }\n printf(\"%d\",c);  \n  return 0;\n}", "problem_context": "Score : 200 points\n\nProblem Statement\n\nTakahashi has two positive integers A and B.\n\nIt is known that A plus B equals N.\nFind the minimum possible value of \"the sum of the digits of A\" plus \"the sum of the digits of B\" (in base 10).\n\nConstraints\n\n2 ≤ N ≤ 10^5\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 possible value of \"the sum of the digits of A\" plus \"the sum of the digits of B\".\n\nSample Input 1\n\n15\n\nSample Output 1\n\n6\n\nWhen A=2 and B=13, the sums of their digits are 2 and 4, which minimizes the value in question.\n\nSample Input 2\n\n100000\n\nSample Output 2\n\n10", "sample_input": "15\n"}, "reference_outputs": ["6\n"], "source_document_id": "p03331", "source_text": "Score : 200 points\n\nProblem Statement\n\nTakahashi has two positive integers A and B.\n\nIt is known that A plus B equals N.\nFind the minimum possible value of \"the sum of the digits of A\" plus \"the sum of the digits of B\" (in base 10).\n\nConstraints\n\n2 ≤ N ≤ 10^5\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 possible value of \"the sum of the digits of A\" plus \"the sum of the digits of B\".\n\nSample Input 1\n\n15\n\nSample Output 1\n\n6\n\nWhen A=2 and B=13, the sums of their digits are 2 and 4, which minimizes the value in question.\n\nSample Input 2\n\n100000\n\nSample Output 2\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": 195, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s161781448", "group_id": "codeNet:p03332", "input_text": "#include <stdio.h>\n\nint digit_sum(int x) {\n    int sum=0;\n    while(x>0) {\n        sum += x%10;\n        x /= 10;\n    }\n    return sum;\n}\n\nint main(void) {\n    int n, a, b, k, i, j,l, cnt=0;\n    scanf(\"%d %d %d %d\", &n, &a, &b, &k);\n    \n    for(i=0; i<=n; i++) {\n        for(j=0; j<=n; j++) {\n            for(l=0; l<=n; l++) {\n                if(a*i+b*j+(a+b)*l==k)\n                    cnt++;\n            }\n        }\n    }\n    printf(\"%d\\n\", cnt);\n    return 0;\n}\n", "language": "C", "metadata": {"date": 1528159732, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "problem_description_relpath": "problem_descriptions/p03332.html", "problem_id": "p03332", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03332/input.txt", "sample_output_relpath": "derived/input_output/data/p03332/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03332/C/s161781448.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s161781448", "user_id": "u768152935"}, "prompt_components": {"gold_output": "40\n", "input_to_evaluate": "#include <stdio.h>\n\nint digit_sum(int x) {\n    int sum=0;\n    while(x>0) {\n        sum += x%10;\n        x /= 10;\n    }\n    return sum;\n}\n\nint main(void) {\n    int n, a, b, k, i, j,l, cnt=0;\n    scanf(\"%d %d %d %d\", &n, &a, &b, &k);\n    \n    for(i=0; i<=n; i++) {\n        for(j=0; j<=n; j++) {\n            for(l=0; l<=n; l++) {\n                if(a*i+b*j+(a+b)*l==k)\n                    cnt++;\n            }\n        }\n    }\n    printf(\"%d\\n\", cnt);\n    return 0;\n}\n", "problem_context": "Score : 700 points\n\nProblem Statement\n\nTakahashi has a tower which is divided into N layers.\nInitially, all the layers are uncolored. Takahashi is going to paint some of the layers in red, green or blue to make a beautiful tower.\nHe defines the beauty of the tower as follows:\n\nThe beauty of the tower is the sum of the scores of the N layers, where the score of a layer is A if the layer is painted red, A+B if the layer is painted green, B if the layer is painted blue, and 0 if the layer is uncolored.\n\nHere, A and B are positive integer constants given beforehand. Also note that a layer may not be painted in two or more colors.\n\nTakahashi is planning to paint the tower so that the beauty of the tower becomes exactly K.\nHow many such ways are there to paint the tower? Find the count modulo 998244353.\nTwo ways to paint the tower are considered different when there exists a layer that is painted in different colors, or a layer that is painted in some color in one of the ways and not in the other.\n\nConstraints\n\n1 ≤ N ≤ 3×10^5\n\n1 ≤ A,B ≤ 3×10^5\n\n0 ≤ K ≤ 18×10^{10}\n\nAll values in the input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN A B K\n\nOutput\n\nPrint the number of the ways to paint tiles, modulo 998244353.\n\nSample Input 1\n\n4 1 2 5\n\nSample Output 1\n\n40\n\nIn this case, a red layer worth 1 points, a green layer worth 3 points and the blue layer worth 2 points. The beauty of the tower is 5 when we have one of the following sets of painted layers:\n\n1 green, 1 blue\n\n1 red, 2 blues\n\n2 reds, 1 green\n\n3 reds, 1 blue\n\nThe total number of the ways to produce them is 40.\n\nSample Input 2\n\n2 5 6 0\n\nSample Output 2\n\n1\n\nThe beauty of the tower is 0 only when all the layers are uncolored. Thus, the answer is 1.\n\nSample Input 3\n\n90081 33447 90629 6391049189\n\nSample Output 3\n\n577742975", "sample_input": "4 1 2 5\n"}, "reference_outputs": ["40\n"], "source_document_id": "p03332", "source_text": "Score : 700 points\n\nProblem Statement\n\nTakahashi has a tower which is divided into N layers.\nInitially, all the layers are uncolored. Takahashi is going to paint some of the layers in red, green or blue to make a beautiful tower.\nHe defines the beauty of the tower as follows:\n\nThe beauty of the tower is the sum of the scores of the N layers, where the score of a layer is A if the layer is painted red, A+B if the layer is painted green, B if the layer is painted blue, and 0 if the layer is uncolored.\n\nHere, A and B are positive integer constants given beforehand. Also note that a layer may not be painted in two or more colors.\n\nTakahashi is planning to paint the tower so that the beauty of the tower becomes exactly K.\nHow many such ways are there to paint the tower? Find the count modulo 998244353.\nTwo ways to paint the tower are considered different when there exists a layer that is painted in different colors, or a layer that is painted in some color in one of the ways and not in the other.\n\nConstraints\n\n1 ≤ N ≤ 3×10^5\n\n1 ≤ A,B ≤ 3×10^5\n\n0 ≤ K ≤ 18×10^{10}\n\nAll values in the input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN A B K\n\nOutput\n\nPrint the number of the ways to paint tiles, modulo 998244353.\n\nSample Input 1\n\n4 1 2 5\n\nSample Output 1\n\n40\n\nIn this case, a red layer worth 1 points, a green layer worth 3 points and the blue layer worth 2 points. The beauty of the tower is 5 when we have one of the following sets of painted layers:\n\n1 green, 1 blue\n\n1 red, 2 blues\n\n2 reds, 1 green\n\n3 reds, 1 blue\n\nThe total number of the ways to produce them is 40.\n\nSample Input 2\n\n2 5 6 0\n\nSample Output 2\n\n1\n\nThe beauty of the tower is 0 only when all the layers are uncolored. Thus, the answer is 1.\n\nSample Input 3\n\n90081 33447 90629 6391049189\n\nSample Output 3\n\n577742975", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 2103, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s699600017", "group_id": "codeNet:p03334", "input_text": "#include <stdio.h>\n#include <stdlib.h>\n\nint main(){\n\tint N, D1, D2, i, j, k, l, f, g;\n\tscanf(\"%d%d%d\", &N, &D1, &D2);\n\tfor(k = 0; (D1 & 1) == 0; D1 >>= 1, k++){}\n\tfor(l = 0; (D2 & 1) == 0; D2 >>= 1, l++){}\n\tint num = 0;\n\tfor(i = 0; i < 2 * N; i++){\n\t\tfor(j = 0; j < 2 * N; j++){\n\t\t\tif(num == N * N){\n\t\t\t\treturn 0;\n\t\t\t}\n\t\t\tif((((k & 1) == 0 && (((i >> (k >> 1)) ^ (j >> (k >> 1))) & 1) == 0) || ((k & 1) == 1 && ((i >> (k >> 1)) & 1) == 0)) && (((l & 1) == 0 && (((i >> (l >> 1)) ^ (j >> (l >> 1))) & 1) == 0) || ((l & 1) == 1 && ((i >> (l >> 1)) & 1) == 0))){\n\t\t\t\tprintf(\"%d %d\\n\", i, j);\n\t\t\t\tnum++;\n\t\t\t}\n/*\t\t\tif(k % 2 == 0){\n\t\t\t\ti >> (k >> 1)\n\t\t\t\tif(((i / (1 << (k / 2))) + (j / (1 << (k / 2)))) % 2 == 0){\n\t\t\t\t\tf = 0;\n\t\t\t\t}\n\t\t\t\telse{\n\t\t\t\t\tf = 1;\n\t\t\t\t}\n\t\t\t}\n\t\t\telse{\n\t\t\t\tif((i / (1 << (k / 2))) % 2 == 0){\n\t\t\t\t\tf = 0;\n\t\t\t\t}\n\t\t\t\telse{\n\t\t\t\t\tf = 1;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif(l % 2 == 0){\n\t\t\t\tif(((i / (1 << (l / 2))) + (j / (1 << (l / 2)))) % 2 == 0){\n\t\t\t\t\tg = 0;\n\t\t\t\t}\n\t\t\t\telse{\n\t\t\t\t\tg = 1;\n\t\t\t\t}\n\t\t\t}\n\t\t\telse{\n\t\t\t\tif((i / (1 << (l / 2))) % 2 == 0){\n\t\t\t\t\tg = 0;\n\t\t\t\t}\n\t\t\t\telse{\n\t\t\t\t\tg = 1;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif(f == 0 && g == 0){\n\t\t\t\tprintf(\"%d %d\\n\", i, j);\n\t\t\t\tnum++;\n\t\t\t}\n*/\t\t}\n\t}\n\treturn 0;\n}", "language": "C", "metadata": {"date": 1528190432, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "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/C/s699600017.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s699600017", "user_id": "u208608367"}, "prompt_components": {"gold_output": "0 0\n0 2\n2 0\n2 2\n", "input_to_evaluate": "#include <stdio.h>\n#include <stdlib.h>\n\nint main(){\n\tint N, D1, D2, i, j, k, l, f, g;\n\tscanf(\"%d%d%d\", &N, &D1, &D2);\n\tfor(k = 0; (D1 & 1) == 0; D1 >>= 1, k++){}\n\tfor(l = 0; (D2 & 1) == 0; D2 >>= 1, l++){}\n\tint num = 0;\n\tfor(i = 0; i < 2 * N; i++){\n\t\tfor(j = 0; j < 2 * N; j++){\n\t\t\tif(num == N * N){\n\t\t\t\treturn 0;\n\t\t\t}\n\t\t\tif((((k & 1) == 0 && (((i >> (k >> 1)) ^ (j >> (k >> 1))) & 1) == 0) || ((k & 1) == 1 && ((i >> (k >> 1)) & 1) == 0)) && (((l & 1) == 0 && (((i >> (l >> 1)) ^ (j >> (l >> 1))) & 1) == 0) || ((l & 1) == 1 && ((i >> (l >> 1)) & 1) == 0))){\n\t\t\t\tprintf(\"%d %d\\n\", i, j);\n\t\t\t\tnum++;\n\t\t\t}\n/*\t\t\tif(k % 2 == 0){\n\t\t\t\ti >> (k >> 1)\n\t\t\t\tif(((i / (1 << (k / 2))) + (j / (1 << (k / 2)))) % 2 == 0){\n\t\t\t\t\tf = 0;\n\t\t\t\t}\n\t\t\t\telse{\n\t\t\t\t\tf = 1;\n\t\t\t\t}\n\t\t\t}\n\t\t\telse{\n\t\t\t\tif((i / (1 << (k / 2))) % 2 == 0){\n\t\t\t\t\tf = 0;\n\t\t\t\t}\n\t\t\t\telse{\n\t\t\t\t\tf = 1;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif(l % 2 == 0){\n\t\t\t\tif(((i / (1 << (l / 2))) + (j / (1 << (l / 2)))) % 2 == 0){\n\t\t\t\t\tg = 0;\n\t\t\t\t}\n\t\t\t\telse{\n\t\t\t\t\tg = 1;\n\t\t\t\t}\n\t\t\t}\n\t\t\telse{\n\t\t\t\tif((i / (1 << (l / 2))) % 2 == 0){\n\t\t\t\t\tg = 0;\n\t\t\t\t}\n\t\t\t\telse{\n\t\t\t\t\tg = 1;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif(f == 0 && g == 0){\n\t\t\t\tprintf(\"%d %d\\n\", i, j);\n\t\t\t\tnum++;\n\t\t\t}\n*/\t\t}\n\t}\n\treturn 0;\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": 1182, "cpu_time_ms": 13, "memory_kb": 896}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s955809713", "group_id": "codeNet:p03337", "input_text": "#include<stdio.h>\n \nint main()\n{\n \tint a,b,c;\n\tscanf(\"%d%d%d\",a,b,c);\n\tint max=a;\n\tif(a<b){\n\t\tmax=b;\n\t}\n\tif(b<c){\n\t\tmax=c;\n \t}\n\tprintf(\"%d\\n\",10*max+a+b+c-max);\n\treturn 0;\n \n}", "language": "C", "metadata": {"date": 1537752414, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "problem_description_relpath": "problem_descriptions/p03337.html", "problem_id": "p03337", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03337/input.txt", "sample_output_relpath": "derived/input_output/data/p03337/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03337/C/s955809713.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s955809713", "user_id": "u437973379"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "#include<stdio.h>\n \nint main()\n{\n \tint a,b,c;\n\tscanf(\"%d%d%d\",a,b,c);\n\tint max=a;\n\tif(a<b){\n\t\tmax=b;\n\t}\n\tif(b<c){\n\t\tmax=c;\n \t}\n\tprintf(\"%d\\n\",10*max+a+b+c-max);\n\treturn 0;\n \n}", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou are given two integers A and B.\nFind the largest value among A+B, A-B and A \\times B.\n\nConstraints\n\n-1000 \\leq A,B \\leq 1000\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 largest value among A+B, A-B and A \\times B.\n\nSample Input 1\n\n3 1\n\nSample Output 1\n\n4\n\n3+1=4, 3-1=2 and 3 \\times 1=3. The largest among them is 4.\n\nSample Input 2\n\n4 -2\n\nSample Output 2\n\n6\n\nThe largest is 4 - (-2) = 6.\n\nSample Input 3\n\n0 0\n\nSample Output 3\n\n0", "sample_input": "3 1\n"}, "reference_outputs": ["4\n"], "source_document_id": "p03337", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou are given two integers A and B.\nFind the largest value among A+B, A-B and A \\times B.\n\nConstraints\n\n-1000 \\leq A,B \\leq 1000\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 largest value among A+B, A-B and A \\times B.\n\nSample Input 1\n\n3 1\n\nSample Output 1\n\n4\n\n3+1=4, 3-1=2 and 3 \\times 1=3. The largest among them is 4.\n\nSample Input 2\n\n4 -2\n\nSample Output 2\n\n6\n\nThe largest is 4 - (-2) = 6.\n\nSample Input 3\n\n0 0\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": 175, "cpu_time_ms": 218, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s083259858", "group_id": "codeNet:p03337", "input_text": "#include<stdio.h>\nint main()\n{\n    int A,B,x,y,z;\n\n    scanf(\"%d %d\",&A,&B);\n\n    x=A+B;\n    y=A-B;\n    z=A*B;\n\n    if(x>y && x>z)\n    {\n        printf(\"%d\\n\",x);\n        printf(\"%d + %d = %d,%d - %d = %d,%d * %d = %d The largest is %d.\\n\",A,B,x,A,B,y,A,B,z,x);\n\n    }\n    else if(y>x && y>z)\n    {\n        printf(\"%d\\n\",y);\n        printf(\" The largest is %d - (%d) = %d.\\n\",A,B,y);\n    }\n\n    else\n    {\n\n        printf(\"%d\\n\",z);\n    }\n\n\n\n\n    return 0;\n}\n\n", "language": "C", "metadata": {"date": 1531424519, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "problem_description_relpath": "problem_descriptions/p03337.html", "problem_id": "p03337", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03337/input.txt", "sample_output_relpath": "derived/input_output/data/p03337/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03337/C/s083259858.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s083259858", "user_id": "u863370423"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "#include<stdio.h>\nint main()\n{\n    int A,B,x,y,z;\n\n    scanf(\"%d %d\",&A,&B);\n\n    x=A+B;\n    y=A-B;\n    z=A*B;\n\n    if(x>y && x>z)\n    {\n        printf(\"%d\\n\",x);\n        printf(\"%d + %d = %d,%d - %d = %d,%d * %d = %d The largest is %d.\\n\",A,B,x,A,B,y,A,B,z,x);\n\n    }\n    else if(y>x && y>z)\n    {\n        printf(\"%d\\n\",y);\n        printf(\" The largest is %d - (%d) = %d.\\n\",A,B,y);\n    }\n\n    else\n    {\n\n        printf(\"%d\\n\",z);\n    }\n\n\n\n\n    return 0;\n}\n\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou are given two integers A and B.\nFind the largest value among A+B, A-B and A \\times B.\n\nConstraints\n\n-1000 \\leq A,B \\leq 1000\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 largest value among A+B, A-B and A \\times B.\n\nSample Input 1\n\n3 1\n\nSample Output 1\n\n4\n\n3+1=4, 3-1=2 and 3 \\times 1=3. The largest among them is 4.\n\nSample Input 2\n\n4 -2\n\nSample Output 2\n\n6\n\nThe largest is 4 - (-2) = 6.\n\nSample Input 3\n\n0 0\n\nSample Output 3\n\n0", "sample_input": "3 1\n"}, "reference_outputs": ["4\n"], "source_document_id": "p03337", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou are given two integers A and B.\nFind the largest value among A+B, A-B and A \\times B.\n\nConstraints\n\n-1000 \\leq A,B \\leq 1000\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 largest value among A+B, A-B and A \\times B.\n\nSample Input 1\n\n3 1\n\nSample Output 1\n\n4\n\n3+1=4, 3-1=2 and 3 \\times 1=3. The largest among them is 4.\n\nSample Input 2\n\n4 -2\n\nSample Output 2\n\n6\n\nThe largest is 4 - (-2) = 6.\n\nSample Input 3\n\n0 0\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": 460, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s603073680", "group_id": "codeNet:p03337", "input_text": "#include<stdio.h>\n\nint main(){\n  int a,b,c;\n  scanf(\"%d%d\",&a,&b);\n  if((a+b)>(a-b)){\n   c=a+b; \n  }else{\n  c=a-b;  \n    \n  }\n  if(c>(a*b)){\n    printf(\"%d\",c);\n    return 0; \n  }else{\n\tprintf(\"%d\",a*b);    \n  }\n\n  \n  \n  \n  \n return 0; \n}", "language": "C", "metadata": {"date": 1527512354, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "problem_description_relpath": "problem_descriptions/p03337.html", "problem_id": "p03337", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03337/input.txt", "sample_output_relpath": "derived/input_output/data/p03337/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03337/C/s603073680.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s603073680", "user_id": "u381746350"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "#include<stdio.h>\n\nint main(){\n  int a,b,c;\n  scanf(\"%d%d\",&a,&b);\n  if((a+b)>(a-b)){\n   c=a+b; \n  }else{\n  c=a-b;  \n    \n  }\n  if(c>(a*b)){\n    printf(\"%d\",c);\n    return 0; \n  }else{\n\tprintf(\"%d\",a*b);    \n  }\n\n  \n  \n  \n  \n return 0; \n}", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou are given two integers A and B.\nFind the largest value among A+B, A-B and A \\times B.\n\nConstraints\n\n-1000 \\leq A,B \\leq 1000\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 largest value among A+B, A-B and A \\times B.\n\nSample Input 1\n\n3 1\n\nSample Output 1\n\n4\n\n3+1=4, 3-1=2 and 3 \\times 1=3. The largest among them is 4.\n\nSample Input 2\n\n4 -2\n\nSample Output 2\n\n6\n\nThe largest is 4 - (-2) = 6.\n\nSample Input 3\n\n0 0\n\nSample Output 3\n\n0", "sample_input": "3 1\n"}, "reference_outputs": ["4\n"], "source_document_id": "p03337", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou are given two integers A and B.\nFind the largest value among A+B, A-B and A \\times B.\n\nConstraints\n\n-1000 \\leq A,B \\leq 1000\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 largest value among A+B, A-B and A \\times B.\n\nSample Input 1\n\n3 1\n\nSample Output 1\n\n4\n\n3+1=4, 3-1=2 and 3 \\times 1=3. The largest among them is 4.\n\nSample Input 2\n\n4 -2\n\nSample Output 2\n\n6\n\nThe largest is 4 - (-2) = 6.\n\nSample Input 3\n\n0 0\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": 238, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s799340071", "group_id": "codeNet:p03338", "input_text": "#include <stdio.h>\n#include<string.h>\n\nint main(){\n  int len;\n  char s[100];\n  int c;\n  scanf(\"%d\", &len);\n  int p;\n  char ls[100];\n  char rs[100];\n  char matchs[100];\n  char ts[2];\n  \n  p = 1;\n  int lp, rp;\n  int i,j;\n  \n  \n  int maxc = 0;\n  lp = 1; // ひだりの長さ\n  while(lp < len){\n  \tc = 0;\n    \n    for(i = 0; i < 100; i++)\n    matchs[i] = '\\0';\n    \n    strcpy(rs, &s[lp]);\n    \n    for(j = 0; j < lp; j++){\n      ts[0] = s[j];\n      ts[1] = '\\0';\n    \tif((strstr(rs,ts) != NULL) && (strstr(matchs, ts) == NULL)){ // 左の文字列があるとき\n    \n      \tstrcat(matchs, ts);\n      \tc++;\n    \n   \t\t}\n    \n    }\n    if(maxc < c)\n        maxc = c;\n  lp++;\n}\n \n    printf(\"%d\\n\", c);\n  return 0;\n}", "language": "C", "metadata": {"date": 1528325886, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "problem_description_relpath": "problem_descriptions/p03338.html", "problem_id": "p03338", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03338/input.txt", "sample_output_relpath": "derived/input_output/data/p03338/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03338/C/s799340071.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s799340071", "user_id": "u686390526"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "#include <stdio.h>\n#include<string.h>\n\nint main(){\n  int len;\n  char s[100];\n  int c;\n  scanf(\"%d\", &len);\n  int p;\n  char ls[100];\n  char rs[100];\n  char matchs[100];\n  char ts[2];\n  \n  p = 1;\n  int lp, rp;\n  int i,j;\n  \n  \n  int maxc = 0;\n  lp = 1; // ひだりの長さ\n  while(lp < len){\n  \tc = 0;\n    \n    for(i = 0; i < 100; i++)\n    matchs[i] = '\\0';\n    \n    strcpy(rs, &s[lp]);\n    \n    for(j = 0; j < lp; j++){\n      ts[0] = s[j];\n      ts[1] = '\\0';\n    \tif((strstr(rs,ts) != NULL) && (strstr(matchs, ts) == NULL)){ // 左の文字列があるとき\n    \n      \tstrcat(matchs, ts);\n      \tc++;\n    \n   \t\t}\n    \n    }\n    if(maxc < c)\n        maxc = c;\n  lp++;\n}\n \n    printf(\"%d\\n\", c);\n  return 0;\n}", "problem_context": "Score : 200 points\n\nProblem Statement\n\nYou are given a string S of length N consisting of lowercase English letters.\nWe will cut this string at one position into two strings X and Y.\nHere, we would like to maximize the number of different letters contained in both X and Y.\nFind the largest possible number of different letters contained in both X and Y when we cut the string at the optimal position.\n\nConstraints\n\n2 \\leq N \\leq 100\n\n|S| = N\n\nS consists of lowercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS\n\nOutput\n\nPrint the largest possible number of different letters contained in both X and Y.\n\nSample Input 1\n\n6\naabbca\n\nSample Output 1\n\n2\n\nIf we cut the string between the third and fourth letters into X = aab and Y = bca, the letters contained in both X and Y are a and b.\nThere will never be three or more different letters contained in both X and Y, so the answer is 2.\n\nSample Input 2\n\n10\naaaaaaaaaa\n\nSample Output 2\n\n1\n\nHowever we divide S, only a will be contained in both X and Y.\n\nSample Input 3\n\n45\ntgxgdqkyjzhyputjjtllptdfxocrylqfqjynmfbfucbir\n\nSample Output 3\n\n9", "sample_input": "6\naabbca\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03338", "source_text": "Score : 200 points\n\nProblem Statement\n\nYou are given a string S of length N consisting of lowercase English letters.\nWe will cut this string at one position into two strings X and Y.\nHere, we would like to maximize the number of different letters contained in both X and Y.\nFind the largest possible number of different letters contained in both X and Y when we cut the string at the optimal position.\n\nConstraints\n\n2 \\leq N \\leq 100\n\n|S| = N\n\nS consists of lowercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS\n\nOutput\n\nPrint the largest possible number of different letters contained in both X and Y.\n\nSample Input 1\n\n6\naabbca\n\nSample Output 1\n\n2\n\nIf we cut the string between the third and fourth letters into X = aab and Y = bca, the letters contained in both X and Y are a and b.\nThere will never be three or more different letters contained in both X and Y, so the answer is 2.\n\nSample Input 2\n\n10\naaaaaaaaaa\n\nSample Output 2\n\n1\n\nHowever we divide S, only a will be contained in both X and Y.\n\nSample Input 3\n\n45\ntgxgdqkyjzhyputjjtllptdfxocrylqfqjynmfbfucbir\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": 711, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s154600240", "group_id": "codeNet:p03338", "input_text": "#include<stdio.h>\n#include<string.h>\n\nint check(char str2[], char str[]);\nvoid move(char str3[]);\n\nint main(void){\n\tint n;\n\tscanf(\"%d\", &n);\n\t\n\tchar str[n+1];\n\tscanf(\"%s\", str);\n\t\n\tint i;\n\tint c_max;\n\tint max;\n\tchar str2[50] = {'\\0'};\n\tchar str3[50] = {'\\0'};\n\tstr2[0] = str[0];\n\tfor(i=0;i<n;i++){\n\t\tstr3[i] = str[i+1];\n\t}\n\tmax = check(str2, str3);\n\tfor(i=1;i<=(n-1)/2;i++){\n\t\tstr2[i] = str[i];\n\t\tmove(str3);\n\t\tc_max = check(str2, str3);\n\t\tif(max <= c_max){\n\t\t\tmax = c_max;\n\t\t}\n\t}\n\tprintf(\"%d\", max);\n\treturn 0;\n}\n\nint check(char str2[], char str[]){\n\tint i;\n\tint j;\n\tint cnt = 0;\n\tint flag = 0;\n\tfor(i=0;str2[i]!='\\0';i++){\n\t\tfor(j=0;j<i;j++){\n\t\t\tif(str2[j]==str2[i]){\n\t\t\t\tflag=1;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tif(flag==0){\n\t\t\tif(strchr(str, str2[i]) != NULL){\n\t\t\t\tcnt+=1;\n\t\t\t}\n\t\t}\n\t\tflag = 0;\n\t}\n\treturn cnt;\n}\n\nvoid move(char str3[]){\n\tint i;\n\tfor(i=1;str3[i]!='\\0';i++){\n\t\tstr3[i-1] = str3[i];\n\t}\n}", "language": "C", "metadata": {"date": 1527390931, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "problem_description_relpath": "problem_descriptions/p03338.html", "problem_id": "p03338", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03338/input.txt", "sample_output_relpath": "derived/input_output/data/p03338/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03338/C/s154600240.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s154600240", "user_id": "u579508806"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "#include<stdio.h>\n#include<string.h>\n\nint check(char str2[], char str[]);\nvoid move(char str3[]);\n\nint main(void){\n\tint n;\n\tscanf(\"%d\", &n);\n\t\n\tchar str[n+1];\n\tscanf(\"%s\", str);\n\t\n\tint i;\n\tint c_max;\n\tint max;\n\tchar str2[50] = {'\\0'};\n\tchar str3[50] = {'\\0'};\n\tstr2[0] = str[0];\n\tfor(i=0;i<n;i++){\n\t\tstr3[i] = str[i+1];\n\t}\n\tmax = check(str2, str3);\n\tfor(i=1;i<=(n-1)/2;i++){\n\t\tstr2[i] = str[i];\n\t\tmove(str3);\n\t\tc_max = check(str2, str3);\n\t\tif(max <= c_max){\n\t\t\tmax = c_max;\n\t\t}\n\t}\n\tprintf(\"%d\", max);\n\treturn 0;\n}\n\nint check(char str2[], char str[]){\n\tint i;\n\tint j;\n\tint cnt = 0;\n\tint flag = 0;\n\tfor(i=0;str2[i]!='\\0';i++){\n\t\tfor(j=0;j<i;j++){\n\t\t\tif(str2[j]==str2[i]){\n\t\t\t\tflag=1;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tif(flag==0){\n\t\t\tif(strchr(str, str2[i]) != NULL){\n\t\t\t\tcnt+=1;\n\t\t\t}\n\t\t}\n\t\tflag = 0;\n\t}\n\treturn cnt;\n}\n\nvoid move(char str3[]){\n\tint i;\n\tfor(i=1;str3[i]!='\\0';i++){\n\t\tstr3[i-1] = str3[i];\n\t}\n}", "problem_context": "Score : 200 points\n\nProblem Statement\n\nYou are given a string S of length N consisting of lowercase English letters.\nWe will cut this string at one position into two strings X and Y.\nHere, we would like to maximize the number of different letters contained in both X and Y.\nFind the largest possible number of different letters contained in both X and Y when we cut the string at the optimal position.\n\nConstraints\n\n2 \\leq N \\leq 100\n\n|S| = N\n\nS consists of lowercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS\n\nOutput\n\nPrint the largest possible number of different letters contained in both X and Y.\n\nSample Input 1\n\n6\naabbca\n\nSample Output 1\n\n2\n\nIf we cut the string between the third and fourth letters into X = aab and Y = bca, the letters contained in both X and Y are a and b.\nThere will never be three or more different letters contained in both X and Y, so the answer is 2.\n\nSample Input 2\n\n10\naaaaaaaaaa\n\nSample Output 2\n\n1\n\nHowever we divide S, only a will be contained in both X and Y.\n\nSample Input 3\n\n45\ntgxgdqkyjzhyputjjtllptdfxocrylqfqjynmfbfucbir\n\nSample Output 3\n\n9", "sample_input": "6\naabbca\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03338", "source_text": "Score : 200 points\n\nProblem Statement\n\nYou are given a string S of length N consisting of lowercase English letters.\nWe will cut this string at one position into two strings X and Y.\nHere, we would like to maximize the number of different letters contained in both X and Y.\nFind the largest possible number of different letters contained in both X and Y when we cut the string at the optimal position.\n\nConstraints\n\n2 \\leq N \\leq 100\n\n|S| = N\n\nS consists of lowercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS\n\nOutput\n\nPrint the largest possible number of different letters contained in both X and Y.\n\nSample Input 1\n\n6\naabbca\n\nSample Output 1\n\n2\n\nIf we cut the string between the third and fourth letters into X = aab and Y = bca, the letters contained in both X and Y are a and b.\nThere will never be three or more different letters contained in both X and Y, so the answer is 2.\n\nSample Input 2\n\n10\naaaaaaaaaa\n\nSample Output 2\n\n1\n\nHowever we divide S, only a will be contained in both X and Y.\n\nSample Input 3\n\n45\ntgxgdqkyjzhyputjjtllptdfxocrylqfqjynmfbfucbir\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": 894, "cpu_time_ms": 96, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s146469597", "group_id": "codeNet:p03344", "input_text": "#if 0\ncat <<EOF >mistaken-paste\n#endif\n// thx Ebi-chan!\n\n#pragma GCC diagnostic ignored \"-Wincompatible-pointer-types\"\n#define _USE_MATH_DEFINES\n\n#include <stdio.h>\n#include <stdint.h>\n#include <stdlib.h>\n#include <string.h>\n#include <stdbool.h>\n#include <math.h>\n#include <time.h>\n\n#define BIG 2000000007\n#define VERYBIG 20000000000000007LL\n\n#define MOD 1000000007\n#define FOD  998244353\ntypedef uint64_t ull;\ntypedef  int64_t sll;\n\n#define N_MAX 1048576\n\n#ifdef __cplusplus\n#include <queue>\n#include <stack>\n#include <tuple>\n#include <set>\n#include <map>\n#include <string>\n#include <algorithm>\n#include <functional>\n#include <array>\n\nusing std::queue;\nusing std::priority_queue;\nusing std::stack;\nusing std::tuple;\nusing std::set;\nusing std::map;\nusing std::vector;\nusing std::greater;\nusing std::pair;\nusing std::string;\nusing std::get;\n\ntemplate <typename T, typename U>\npair<T, U> operator+(pair<T, U> l, pair<T, U> r) {\n\treturn pair<T, U>(l.first + r.first, l.second + r.second);\n}\n\n#endif\n\n#ifndef M_PI\n#define M_PI 3.14159265358979323846264338327950\n#endif\n\ntypedef struct {\n\tsll a;\n\tsll b;\n} hwll;\n\ntypedef struct {\n\tsll a;\n\tsll b;\n\tsll c;\n} hwllc;\n\ntypedef struct {\n\thwll a;\n\thwll b;\n} linell;\n\ntypedef struct {\n\tdouble a;\n\tdouble b;\n} hwreal;\n\nsll n, m;\nsll h, w;\nsll k;\nsll q;\nsll va, vb, vc, vd, ve, vf;\null ua, ub, uc, ud, ue, uf;\nlong double vra, vrb, vrc;\ndouble vda, vdb, vdc;\nchar ch, dh;\n\null umin (ull x, ull y) {\n\treturn (x < y) ? x : y;\n}\n\null umax (ull x, ull y) {\n\treturn (x > y) ? x : y;\n}\n\nsll smin (sll x, sll y) {\n\treturn (x < y) ? x : y;\n}\n\nsll smax (sll x, sll y) {\n\treturn (x > y) ? x : y;\n}\n\null gcd (ull x, ull y) {\n\tif (y == 0) {\n\t\treturn x;\n\t} else {\n\t\treturn gcd(y, x % y);\n\t}\n}\n\null bitpow (ull a, ull x, ull modulo) {\n\tull result = 1;\n\twhile (x) {\n\t\tif (x & 1) {\n\t\t\tresult *= a;\n\t\t\tresult %= modulo;\n\t\t}\n\t\tx /= 2;\n\t\ta = (a * a) % modulo;\n\t}\n\treturn result;\n}\n\null divide (ull a, ull b, ull modulo) {\n\treturn (a * bitpow(b, modulo - 2, modulo)) % modulo;\n}\n\null udiff (ull a, ull b) {\n\tif (a >= b) {\n\t\treturn a - b;\n\t} else {\n\t\treturn b - a;\n\t}\n}\n\nsll sdiff (sll a, sll b) {\n\tif (a >= b) {\n\t\treturn a - b;\n\t} else {\n\t\treturn b - a;\n\t}\n}\n\nint bitcount (ull n) {\n\tint result = 0;\n\twhile (n) {\n\t\tif (n & 1) result++;\n\t\tn /= 2;\n\t}\n\treturn result;\n}\n\n#define BEGCMP(NAME) int32_t NAME (const void *left, const void *right)\n#define DEFLR(TYPE) TYPE l=*(TYPE*)left,r=*(TYPE*)right\n#define CMPRET(L, R) if((L)<(R))return-1;if((L)>(R))return+1\n\n// int32_t pullcomp (const void *left, const void *right) {\n// \tull l = *(ull*)left;\n// \tull r = *(ull*)right;\n// \tif (l < r) {\n// \t\treturn -1;\n// \t}\n// \tif (l > r) {\n// \t\treturn +1;\n// \t}\n// \treturn 0;\n// }\nBEGCMP(pullcomp){\n\tDEFLR(ull);\n\tCMPRET(l, r);\n\treturn 0;\n}\nBEGCMP(prevcomp){\n\tDEFLR(sll);\n\tCMPRET(r, l);\n\treturn 0;\n}\nBEGCMP(psllcomp){\n\tDEFLR(sll);\n\tCMPRET(l, r);\n\treturn 0;\n}\nBEGCMP(pcharcomp){\n\tDEFLR(char);\n\tCMPRET(l, r);\n\treturn 0;\n}\nBEGCMP(pdoublecomp){\n\tDEFLR(double);\n\tCMPRET(l, r);\n\treturn 0;\n}\n\nint32_t pstrcomp (const void *left, const void *right) {\n\tchar* l = *(char**)left;\n\tchar* r = *(char**)right;\n\n\treturn strcmp(l, r);\n}\n\nBEGCMP(phwllABcomp){\n\tDEFLR(hwll);\n\tCMPRET(l.a, r.a);\n\tCMPRET(l.b, r.b);\n\treturn 0;\n}\nBEGCMP(phwllREVcomp){\n\tDEFLR(hwll);\n\tCMPRET(l.b, r.b);\n\tCMPRET(l.a, r.a);\n\treturn 0;\n}\nBEGCMP(ptriplecomp){\n\tDEFLR(hwllc);\n\tCMPRET(l.a, r.a);\n\tCMPRET(l.b, r.b);\n\tCMPRET(l.c, r.c);\n\treturn 0;\n}\nBEGCMP(ptripleREVcomp){\n\tDEFLR(hwllc);\n\tCMPRET(l.b, r.b);\n\tCMPRET(l.a, r.a);\n\tCMPRET(l.c, r.c);\n\treturn 0;\n}\nBEGCMP(ptripleCABcomp){\n\tDEFLR(hwllc);\n\tCMPRET(l.c, r.c);\n\tCMPRET(l.a, r.a);\n\tCMPRET(l.b, r.b);\n\treturn 0;\n}\nBEGCMP(phwrealcomp){\n\tDEFLR(hwreal);\n\tCMPRET(l.a, r.a);\n\tCMPRET(l.b, r.b);\n\treturn 0;\n}\n\nint32_t pquadcomp (const void *left, const void *right) {\n\tlinell l = *(linell*)left;\n\tlinell r = *(linell*)right;\n\n\tsll ac = phwllABcomp(&(l.a), &(r.a));\n\tif (ac) return ac;\n\tsll bc = phwllABcomp(&(l.b), &(r.b));\n\tif (bc) return bc;\n\n\treturn 0;\n}\nint32_t pfracomp (const void *left, const void *right) {\n\thwllc l = *(hwllc*)left;\n\thwllc r = *(hwllc*)right;\n\n\tCMPRET(l.a * r.b, l.b * r.a);\n\treturn 0;\n}\nbool isinrange (sll left, sll x, sll right) {\n\treturn (left <= x && x <= right);\n}\n\nbool isinrange_soft (sll left, sll x, sll right) {\n\treturn (left <= x && x <= right) || (left >= x && x >= right);\n}\n\nvoid sw (sll *l, sll *r) {\n\tif (*l == *r) return;\n\tsll t = *l;\n\t*l = *r;\n\t*r = t;\n}\n\null frac[N_MAX * 3], invf[N_MAX * 3];\null ncr (sll n, sll r, ull m) {\n\tif (n < 0 || r < 0 || n < r) return 0;\n\treturn frac[n] * (invf[r] * invf[n - r] % m) % m;\n}\n\nsll a[N_MAX + 5];\n// ull a[N_MAX + 5];\n// sll a[3001][3001];\nsll b[N_MAX + 5];\n// ull b[N_MAX + 5];\n// sll b[3001][3001];\nsll c[N_MAX + 5];\nsll d[N_MAX + 5];\nsll e[N_MAX * 4];\nchar s[N_MAX + 1];\n// char s[3010][3010];\nchar t[N_MAX + 1];\n// char t[3010][3010];\nchar u[N_MAX + 1];\nhwll xy[N_MAX + 5];\nhwllc tup[N_MAX + 5];\nsll table[3005][3005];\null gin[N_MAX];\n// here we go\n\nhwll sorted[N_MAX];\nhwll tg[N_MAX];\null tin[N_MAX];\n\null rank[N_MAX];\n\null dp[N_MAX];\null bsum[N_MAX];\nvoid dfs (ull v) {\n\tdp[v] = smax(a[v] - b[v], 0);\n\n\tfor (sll i = tin[v]; i < tin[v + 1]; i++) {\n\t\tull u = tg[i].b;\n\n\t\tdfs(u);\n\t\tif (dp[u] + bsum[u] + b[v] >= a[v]) {\n\t\t\tdp[v] = smin(dp[v], dp[u]);\n\t\t} else {\n\t\t\tdp[v] = smin(dp[v], a[v] - bsum[u] - b[v]);\n\t\t}\n\n\t\tbsum[v] += bsum[u];\n\t}\n\tbsum[v] += b[v];\n\n\t// printf(\"%lld: %lld + %lld\\n\", v, dp[v], bsum[v]);\n}\n\null parent[N_MAX], size[N_MAX];\nvoid init (ull n) {\n\tfor (sll i = 0; i < n; i++) {\n\t\tparent[i] = i;\n\t\tsize[i] = 1;\n\t}\n}\null find (ull x) {\n\tif (parent[x] == x) return x;\n\treturn parent[x] = find(parent[x]);\n}\nbool unite (ull p, ull v) {\n\tparent[v] = p;\n\treturn true;\n}\n\null solve () {\n\tsll i, j, ki, li;\n\t// ull result = 0;\n\tsll result = 0;\n\tdouble dresult = 0;\n\t// ull maybe = 0;\n\tsll maybe = 0;\n\t// ull sum = 0;\n\tsll sum = 0;\n\tsll item;\n\tsll *dpcell;\n\n\tfor (i = 0; i < m; i++) {\n\t\txy[i + m] = (hwll){xy[i].b, xy[i].a};\n\t}\n\tqsort(xy, m * 2, sizeof(hwll), phwllABcomp);\n\ti = j = 0;\n\twhile (i <= n) {\n\t\tgin[i] = j;\n\t\twhile (j < m * 2 && xy[j].a == i) j++;\n\t\ti++;\n\t}\n\n\tfor (i = 0; i < n; i++) {\n\t\tsorted[i] = (hwll){smax(a[i] - b[i], 0), i};\n\t}\n\tqsort(sorted, n, sizeof(hwll), phwllABcomp);\n\tfor (i = 0; i < n; i++) {\n\t\trank[sorted[i].b] = i;\n\t\t// printf(\"%lld..\\n\", sorted[i].b);\n\t}\n\n\tinit(n);\n\n\tki = 0;\n\tfor (i = 0; i < n; i++) {\n\t\tull v = sorted[i].b;\n\n\t\tfor (j = gin[v]; j < gin[v + 1]; j++) {\n\t\t\tull u = xy[j].b;\n\n\t\t\tif (rank[u] >= rank[v]) continue;\n\t\t\tif (find(u) == find(v)) continue;\n\n\t\t\tull up = find(u);\n\t\t\t// printf(\"%lld->%lld\\n\", v, up);\n\t\t\ttg[ki++] = (hwll){v, up};\n\t\t\tunite(v, up);\n\t\t}\n\t}\n\tif (ki != n - 1) abort();\n\n\tqsort(tg, n - 1, sizeof(hwll), phwllABcomp);\n\ti = j = 0;\n\twhile (i <= n) {\n\t\ttin[i] = j;\n\t\twhile (j < n - 1 && tg[j].a == i) j++;\n\t\ti++;\n\t}\n\n\tull root = sorted[n - 1].b;\n\tdfs(root);\n\n\tresult = dp[root] + bsum[root];\n\n\tprintf(\"%lld\\n\", result);\n\t// printf(\"%.15f\\n\", dresult);\n\t// puts(s);\n\n\treturn 0;\n\n\tsuccess:\n\t// puts(\"YES\");\n\tputs(\"Yes\");\n\t// printf(\"%llu\\n\", result);\n\t// puts(\"0\");\n\t// puts(\"First\");\n\treturn 0;\n\n\tfail:\n\t// puts(\"NO\");\n\t// puts(\"No\");\n\t// puts(\"0\");\n\tputs(\"-1\");\n\t// puts(\"-1 -1 -1\");\n\t// puts(\"Second\");\n\treturn 1;\n}\n\nint32_t main (int argc, char *argv[]) {\n\tint32_t i, j;\n\n\tn = 4;\n\tm = 0;\n\n\t// scanf(\"%llu\", &m);\n\t// scanf(\"%llu%llu\", &h, &w);\n\tscanf(\"%llu%llu\", &n, &m);\n\t// scanf(\"%llu\", &k, &n, &m);\n\t// scanf(\"%llu%llu\", &h, &w);\n\t// scanf(\"%llu\", &q);\n\t// scanf(\"%lld%lld\", &va, &vb, &vc, &vd);\n\t// va--;\n\t// vb--;\n\t// scanf(\"%llu%llu%llu%llu\", &ua, &ub, &uc, &ud, &ue);\n\t// scanf(\"%s\", s);\n\t// scanf(\"%s\", t);\n\t// scanf(\"%s\", u);\n\t// scanf(\"%llu\", &k);\n\t// scanf(\"%lld\", &m);\n\t// for (i = 0; i < n; i++) {\n\t// \t// scanf(\"%lld\", &a[i]);\n\t// \tscanf(\"%lld\", &d[i]);\n\t// }\n\t// scanf(\"%llu\", &q);\n\tfor (i = 0; i < n; i++) {\n\t\t// scanf(\"%lld%lld\", &xy[i].a, &xy[i].b);\n\t\t// scanf(\"%lld%lld%lld\", &tup[i].a, &tup[i].b, &tup[i].c);\n\t\t// scanf(\"%lld\", &c[i]);\n\n\t\tscanf(\"%lld\", &a[i]);\n\t\tscanf(\"%lld\", &b[i]);\n\t\t// scanf(\"%lld\", &c[i]);\n\t\t// scanf(\"%lld\", &d[i]);\n\t\t// a[i]--;\n\t\t// b[i]--;\n\t\t// c[i]--;\n\t\t// d[i]--;\n\t\t// xy[i].a--;\n\t\t// xy[i].b--;\n\t\t// tup[i].a--;\n\t\t// tup[i].b--;\n\t}\n\t// scanf(\"%llu\", &m);\n\t// scanf(\"%llu\", &q);\n\tfor (i = 0; i < m; i++) {\n\t\tscanf(\"%lld%lld\", &xy[i].a, &xy[i].b);\n\t\txy[i].a--;\n\t\txy[i].b--;\n\t\t// scanf(\"%lld%lld\", &a[i], &b[i]);\n\t\t// scanf(\"%lld\", &b[i]);\n\t\t// a[i]--;\n\t\t// b[i]--;\n\t\t// scanf(\"%lld\", &c[i]);\n\t\t// scanf(\"%lld\", &d[i]);\n\t\t// scanf(\"%lld\", &e[i]);\n\t\t// c[i]--;\n\t\t// d[i]--;\n\t}\n\n\t// for (i = 0; i < q; i++) {\n\t// \t// scanf(\"%lld%lld\", &xy[i].a, &xy[i].b);\n\t// \tscanf(\"%lld\", &c[i]);\n\t// \t// xy[i].a--;\n\t// \t// xy[i].b--;\n\t// }\n\n\t// for (i = 0; i < h; i++) {\n\t// \tfor (j = 0; j < w; j++) {\n\t// \t\tscanf(\"%lld\", &table[i][j]);\n\t// \t\t// table[i][j]--;\n\t// \t}\n\t// }\n\t// for (i = 0; i < h; i++) {\n\t// \tscanf(\"%s\", s[i]);\n\t// }\n\t// scanf(\"%llu\", &q);\n\n\tsolve();\n\n\treturn 0;\n}\n", "language": "C", "metadata": {"date": 1567565208, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "problem_description_relpath": "problem_descriptions/p03344.html", "problem_id": "p03344", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03344/input.txt", "sample_output_relpath": "derived/input_output/data/p03344/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03344/C/s146469597.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s146469597", "user_id": "u238041222"}, "prompt_components": {"gold_output": "6\n", "input_to_evaluate": "#if 0\ncat <<EOF >mistaken-paste\n#endif\n// thx Ebi-chan!\n\n#pragma GCC diagnostic ignored \"-Wincompatible-pointer-types\"\n#define _USE_MATH_DEFINES\n\n#include <stdio.h>\n#include <stdint.h>\n#include <stdlib.h>\n#include <string.h>\n#include <stdbool.h>\n#include <math.h>\n#include <time.h>\n\n#define BIG 2000000007\n#define VERYBIG 20000000000000007LL\n\n#define MOD 1000000007\n#define FOD  998244353\ntypedef uint64_t ull;\ntypedef  int64_t sll;\n\n#define N_MAX 1048576\n\n#ifdef __cplusplus\n#include <queue>\n#include <stack>\n#include <tuple>\n#include <set>\n#include <map>\n#include <string>\n#include <algorithm>\n#include <functional>\n#include <array>\n\nusing std::queue;\nusing std::priority_queue;\nusing std::stack;\nusing std::tuple;\nusing std::set;\nusing std::map;\nusing std::vector;\nusing std::greater;\nusing std::pair;\nusing std::string;\nusing std::get;\n\ntemplate <typename T, typename U>\npair<T, U> operator+(pair<T, U> l, pair<T, U> r) {\n\treturn pair<T, U>(l.first + r.first, l.second + r.second);\n}\n\n#endif\n\n#ifndef M_PI\n#define M_PI 3.14159265358979323846264338327950\n#endif\n\ntypedef struct {\n\tsll a;\n\tsll b;\n} hwll;\n\ntypedef struct {\n\tsll a;\n\tsll b;\n\tsll c;\n} hwllc;\n\ntypedef struct {\n\thwll a;\n\thwll b;\n} linell;\n\ntypedef struct {\n\tdouble a;\n\tdouble b;\n} hwreal;\n\nsll n, m;\nsll h, w;\nsll k;\nsll q;\nsll va, vb, vc, vd, ve, vf;\null ua, ub, uc, ud, ue, uf;\nlong double vra, vrb, vrc;\ndouble vda, vdb, vdc;\nchar ch, dh;\n\null umin (ull x, ull y) {\n\treturn (x < y) ? x : y;\n}\n\null umax (ull x, ull y) {\n\treturn (x > y) ? x : y;\n}\n\nsll smin (sll x, sll y) {\n\treturn (x < y) ? x : y;\n}\n\nsll smax (sll x, sll y) {\n\treturn (x > y) ? x : y;\n}\n\null gcd (ull x, ull y) {\n\tif (y == 0) {\n\t\treturn x;\n\t} else {\n\t\treturn gcd(y, x % y);\n\t}\n}\n\null bitpow (ull a, ull x, ull modulo) {\n\tull result = 1;\n\twhile (x) {\n\t\tif (x & 1) {\n\t\t\tresult *= a;\n\t\t\tresult %= modulo;\n\t\t}\n\t\tx /= 2;\n\t\ta = (a * a) % modulo;\n\t}\n\treturn result;\n}\n\null divide (ull a, ull b, ull modulo) {\n\treturn (a * bitpow(b, modulo - 2, modulo)) % modulo;\n}\n\null udiff (ull a, ull b) {\n\tif (a >= b) {\n\t\treturn a - b;\n\t} else {\n\t\treturn b - a;\n\t}\n}\n\nsll sdiff (sll a, sll b) {\n\tif (a >= b) {\n\t\treturn a - b;\n\t} else {\n\t\treturn b - a;\n\t}\n}\n\nint bitcount (ull n) {\n\tint result = 0;\n\twhile (n) {\n\t\tif (n & 1) result++;\n\t\tn /= 2;\n\t}\n\treturn result;\n}\n\n#define BEGCMP(NAME) int32_t NAME (const void *left, const void *right)\n#define DEFLR(TYPE) TYPE l=*(TYPE*)left,r=*(TYPE*)right\n#define CMPRET(L, R) if((L)<(R))return-1;if((L)>(R))return+1\n\n// int32_t pullcomp (const void *left, const void *right) {\n// \tull l = *(ull*)left;\n// \tull r = *(ull*)right;\n// \tif (l < r) {\n// \t\treturn -1;\n// \t}\n// \tif (l > r) {\n// \t\treturn +1;\n// \t}\n// \treturn 0;\n// }\nBEGCMP(pullcomp){\n\tDEFLR(ull);\n\tCMPRET(l, r);\n\treturn 0;\n}\nBEGCMP(prevcomp){\n\tDEFLR(sll);\n\tCMPRET(r, l);\n\treturn 0;\n}\nBEGCMP(psllcomp){\n\tDEFLR(sll);\n\tCMPRET(l, r);\n\treturn 0;\n}\nBEGCMP(pcharcomp){\n\tDEFLR(char);\n\tCMPRET(l, r);\n\treturn 0;\n}\nBEGCMP(pdoublecomp){\n\tDEFLR(double);\n\tCMPRET(l, r);\n\treturn 0;\n}\n\nint32_t pstrcomp (const void *left, const void *right) {\n\tchar* l = *(char**)left;\n\tchar* r = *(char**)right;\n\n\treturn strcmp(l, r);\n}\n\nBEGCMP(phwllABcomp){\n\tDEFLR(hwll);\n\tCMPRET(l.a, r.a);\n\tCMPRET(l.b, r.b);\n\treturn 0;\n}\nBEGCMP(phwllREVcomp){\n\tDEFLR(hwll);\n\tCMPRET(l.b, r.b);\n\tCMPRET(l.a, r.a);\n\treturn 0;\n}\nBEGCMP(ptriplecomp){\n\tDEFLR(hwllc);\n\tCMPRET(l.a, r.a);\n\tCMPRET(l.b, r.b);\n\tCMPRET(l.c, r.c);\n\treturn 0;\n}\nBEGCMP(ptripleREVcomp){\n\tDEFLR(hwllc);\n\tCMPRET(l.b, r.b);\n\tCMPRET(l.a, r.a);\n\tCMPRET(l.c, r.c);\n\treturn 0;\n}\nBEGCMP(ptripleCABcomp){\n\tDEFLR(hwllc);\n\tCMPRET(l.c, r.c);\n\tCMPRET(l.a, r.a);\n\tCMPRET(l.b, r.b);\n\treturn 0;\n}\nBEGCMP(phwrealcomp){\n\tDEFLR(hwreal);\n\tCMPRET(l.a, r.a);\n\tCMPRET(l.b, r.b);\n\treturn 0;\n}\n\nint32_t pquadcomp (const void *left, const void *right) {\n\tlinell l = *(linell*)left;\n\tlinell r = *(linell*)right;\n\n\tsll ac = phwllABcomp(&(l.a), &(r.a));\n\tif (ac) return ac;\n\tsll bc = phwllABcomp(&(l.b), &(r.b));\n\tif (bc) return bc;\n\n\treturn 0;\n}\nint32_t pfracomp (const void *left, const void *right) {\n\thwllc l = *(hwllc*)left;\n\thwllc r = *(hwllc*)right;\n\n\tCMPRET(l.a * r.b, l.b * r.a);\n\treturn 0;\n}\nbool isinrange (sll left, sll x, sll right) {\n\treturn (left <= x && x <= right);\n}\n\nbool isinrange_soft (sll left, sll x, sll right) {\n\treturn (left <= x && x <= right) || (left >= x && x >= right);\n}\n\nvoid sw (sll *l, sll *r) {\n\tif (*l == *r) return;\n\tsll t = *l;\n\t*l = *r;\n\t*r = t;\n}\n\null frac[N_MAX * 3], invf[N_MAX * 3];\null ncr (sll n, sll r, ull m) {\n\tif (n < 0 || r < 0 || n < r) return 0;\n\treturn frac[n] * (invf[r] * invf[n - r] % m) % m;\n}\n\nsll a[N_MAX + 5];\n// ull a[N_MAX + 5];\n// sll a[3001][3001];\nsll b[N_MAX + 5];\n// ull b[N_MAX + 5];\n// sll b[3001][3001];\nsll c[N_MAX + 5];\nsll d[N_MAX + 5];\nsll e[N_MAX * 4];\nchar s[N_MAX + 1];\n// char s[3010][3010];\nchar t[N_MAX + 1];\n// char t[3010][3010];\nchar u[N_MAX + 1];\nhwll xy[N_MAX + 5];\nhwllc tup[N_MAX + 5];\nsll table[3005][3005];\null gin[N_MAX];\n// here we go\n\nhwll sorted[N_MAX];\nhwll tg[N_MAX];\null tin[N_MAX];\n\null rank[N_MAX];\n\null dp[N_MAX];\null bsum[N_MAX];\nvoid dfs (ull v) {\n\tdp[v] = smax(a[v] - b[v], 0);\n\n\tfor (sll i = tin[v]; i < tin[v + 1]; i++) {\n\t\tull u = tg[i].b;\n\n\t\tdfs(u);\n\t\tif (dp[u] + bsum[u] + b[v] >= a[v]) {\n\t\t\tdp[v] = smin(dp[v], dp[u]);\n\t\t} else {\n\t\t\tdp[v] = smin(dp[v], a[v] - bsum[u] - b[v]);\n\t\t}\n\n\t\tbsum[v] += bsum[u];\n\t}\n\tbsum[v] += b[v];\n\n\t// printf(\"%lld: %lld + %lld\\n\", v, dp[v], bsum[v]);\n}\n\null parent[N_MAX], size[N_MAX];\nvoid init (ull n) {\n\tfor (sll i = 0; i < n; i++) {\n\t\tparent[i] = i;\n\t\tsize[i] = 1;\n\t}\n}\null find (ull x) {\n\tif (parent[x] == x) return x;\n\treturn parent[x] = find(parent[x]);\n}\nbool unite (ull p, ull v) {\n\tparent[v] = p;\n\treturn true;\n}\n\null solve () {\n\tsll i, j, ki, li;\n\t// ull result = 0;\n\tsll result = 0;\n\tdouble dresult = 0;\n\t// ull maybe = 0;\n\tsll maybe = 0;\n\t// ull sum = 0;\n\tsll sum = 0;\n\tsll item;\n\tsll *dpcell;\n\n\tfor (i = 0; i < m; i++) {\n\t\txy[i + m] = (hwll){xy[i].b, xy[i].a};\n\t}\n\tqsort(xy, m * 2, sizeof(hwll), phwllABcomp);\n\ti = j = 0;\n\twhile (i <= n) {\n\t\tgin[i] = j;\n\t\twhile (j < m * 2 && xy[j].a == i) j++;\n\t\ti++;\n\t}\n\n\tfor (i = 0; i < n; i++) {\n\t\tsorted[i] = (hwll){smax(a[i] - b[i], 0), i};\n\t}\n\tqsort(sorted, n, sizeof(hwll), phwllABcomp);\n\tfor (i = 0; i < n; i++) {\n\t\trank[sorted[i].b] = i;\n\t\t// printf(\"%lld..\\n\", sorted[i].b);\n\t}\n\n\tinit(n);\n\n\tki = 0;\n\tfor (i = 0; i < n; i++) {\n\t\tull v = sorted[i].b;\n\n\t\tfor (j = gin[v]; j < gin[v + 1]; j++) {\n\t\t\tull u = xy[j].b;\n\n\t\t\tif (rank[u] >= rank[v]) continue;\n\t\t\tif (find(u) == find(v)) continue;\n\n\t\t\tull up = find(u);\n\t\t\t// printf(\"%lld->%lld\\n\", v, up);\n\t\t\ttg[ki++] = (hwll){v, up};\n\t\t\tunite(v, up);\n\t\t}\n\t}\n\tif (ki != n - 1) abort();\n\n\tqsort(tg, n - 1, sizeof(hwll), phwllABcomp);\n\ti = j = 0;\n\twhile (i <= n) {\n\t\ttin[i] = j;\n\t\twhile (j < n - 1 && tg[j].a == i) j++;\n\t\ti++;\n\t}\n\n\tull root = sorted[n - 1].b;\n\tdfs(root);\n\n\tresult = dp[root] + bsum[root];\n\n\tprintf(\"%lld\\n\", result);\n\t// printf(\"%.15f\\n\", dresult);\n\t// puts(s);\n\n\treturn 0;\n\n\tsuccess:\n\t// puts(\"YES\");\n\tputs(\"Yes\");\n\t// printf(\"%llu\\n\", result);\n\t// puts(\"0\");\n\t// puts(\"First\");\n\treturn 0;\n\n\tfail:\n\t// puts(\"NO\");\n\t// puts(\"No\");\n\t// puts(\"0\");\n\tputs(\"-1\");\n\t// puts(\"-1 -1 -1\");\n\t// puts(\"Second\");\n\treturn 1;\n}\n\nint32_t main (int argc, char *argv[]) {\n\tint32_t i, j;\n\n\tn = 4;\n\tm = 0;\n\n\t// scanf(\"%llu\", &m);\n\t// scanf(\"%llu%llu\", &h, &w);\n\tscanf(\"%llu%llu\", &n, &m);\n\t// scanf(\"%llu\", &k, &n, &m);\n\t// scanf(\"%llu%llu\", &h, &w);\n\t// scanf(\"%llu\", &q);\n\t// scanf(\"%lld%lld\", &va, &vb, &vc, &vd);\n\t// va--;\n\t// vb--;\n\t// scanf(\"%llu%llu%llu%llu\", &ua, &ub, &uc, &ud, &ue);\n\t// scanf(\"%s\", s);\n\t// scanf(\"%s\", t);\n\t// scanf(\"%s\", u);\n\t// scanf(\"%llu\", &k);\n\t// scanf(\"%lld\", &m);\n\t// for (i = 0; i < n; i++) {\n\t// \t// scanf(\"%lld\", &a[i]);\n\t// \tscanf(\"%lld\", &d[i]);\n\t// }\n\t// scanf(\"%llu\", &q);\n\tfor (i = 0; i < n; i++) {\n\t\t// scanf(\"%lld%lld\", &xy[i].a, &xy[i].b);\n\t\t// scanf(\"%lld%lld%lld\", &tup[i].a, &tup[i].b, &tup[i].c);\n\t\t// scanf(\"%lld\", &c[i]);\n\n\t\tscanf(\"%lld\", &a[i]);\n\t\tscanf(\"%lld\", &b[i]);\n\t\t// scanf(\"%lld\", &c[i]);\n\t\t// scanf(\"%lld\", &d[i]);\n\t\t// a[i]--;\n\t\t// b[i]--;\n\t\t// c[i]--;\n\t\t// d[i]--;\n\t\t// xy[i].a--;\n\t\t// xy[i].b--;\n\t\t// tup[i].a--;\n\t\t// tup[i].b--;\n\t}\n\t// scanf(\"%llu\", &m);\n\t// scanf(\"%llu\", &q);\n\tfor (i = 0; i < m; i++) {\n\t\tscanf(\"%lld%lld\", &xy[i].a, &xy[i].b);\n\t\txy[i].a--;\n\t\txy[i].b--;\n\t\t// scanf(\"%lld%lld\", &a[i], &b[i]);\n\t\t// scanf(\"%lld\", &b[i]);\n\t\t// a[i]--;\n\t\t// b[i]--;\n\t\t// scanf(\"%lld\", &c[i]);\n\t\t// scanf(\"%lld\", &d[i]);\n\t\t// scanf(\"%lld\", &e[i]);\n\t\t// c[i]--;\n\t\t// d[i]--;\n\t}\n\n\t// for (i = 0; i < q; i++) {\n\t// \t// scanf(\"%lld%lld\", &xy[i].a, &xy[i].b);\n\t// \tscanf(\"%lld\", &c[i]);\n\t// \t// xy[i].a--;\n\t// \t// xy[i].b--;\n\t// }\n\n\t// for (i = 0; i < h; i++) {\n\t// \tfor (j = 0; j < w; j++) {\n\t// \t\tscanf(\"%lld\", &table[i][j]);\n\t// \t\t// table[i][j]--;\n\t// \t}\n\t// }\n\t// for (i = 0; i < h; i++) {\n\t// \tscanf(\"%s\", s[i]);\n\t// }\n\t// scanf(\"%llu\", &q);\n\n\tsolve();\n\n\treturn 0;\n}\n", "problem_context": "Score : 1000 points\n\nProblem Statement\n\nThere is a simple undirected graph with N vertices and M edges.\nThe vertices are numbered 1 through N, and the edges are numbered 1 through M.\nEdge i connects Vertex U_i and V_i.\nAlso, Vertex i has two predetermined integers A_i and B_i.\nYou will play the following game on this graph.\n\nFirst, choose one vertex and stand on it, with W yen (the currency of Japan) in your pocket.\nHere, A_s \\leq W must hold, where s is the vertex you choose.\nThen, perform the following two kinds of operations any number of times in any order:\n\nChoose one vertex v that is directly connected by an edge to the vertex you are standing on, and move to vertex v. Here, you need to have at least A_v yen in your pocket when you perform this move.\n\nDonate B_v yen to the vertex v you are standing on. Here, the amount of money in your pocket must not become less than 0 yen.\n\nYou win the game when you donate once to every vertex.\nFind the smallest initial amount of money W that enables you to win the game.\n\nConstraints\n\n1 \\leq N \\leq 10^5\n\nN-1 \\leq M \\leq 10^5\n\n1 \\leq A_i,B_i \\leq 10^9\n\n1 \\leq U_i < V_i \\leq N\n\nThe given graph is connected and simple (there is at most one edge between any pair of vertices).\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_N B_N\nU_1 V_1\nU_2 V_2\n:\nU_M V_M\n\nOutput\n\nPrint the smallest initial amount of money W that enables you to win the game.\n\nSample Input 1\n\n4 5\n3 1\n1 2\n4 1\n6 2\n1 2\n2 3\n2 4\n1 4\n3 4\n\nSample Output 1\n\n6\n\nIf you have 6 yen initially, you can win the game as follows:\n\nStand on Vertex 4. This is possible since you have not less than 6 yen.\n\nDonate 2 yen to Vertex 4. Now you have 4 yen.\n\nMove to Vertex 3. This is possible since you have not less than 4 yen.\n\nDonate 1 yen to Vertex 3. Now you have 3 yen.\n\nMove to Vertex 2. This is possible since you have not less than 1 yen.\n\nMove to Vertex 1. This is possible since you have not less than 3 yen.\n\nDonate 1 yen to Vertex 1. Now you have 2 yen.\n\nMove to Vertex 2. This is possible since you have not less than 1 yen.\n\nDonate 2 yen to Vertex 2. Now you have 0 yen.\n\nIf you have less than 6 yen initially, you cannot win the game. Thus, the answer is 6.\n\nSample Input 2\n\n5 8\n6 4\n15 13\n15 19\n15 1\n20 7\n1 3\n1 4\n1 5\n2 3\n2 4\n2 5\n3 5\n4 5\n\nSample Output 2\n\n44\n\nSample Input 3\n\n9 10\n131 2\n98 79\n242 32\n231 38\n382 82\n224 22\n140 88\n209 70\n164 64\n6 8\n1 6\n1 4\n1 3\n4 7\n4 9\n3 7\n3 9\n5 9\n2 5\n\nSample Output 3\n\n582", "sample_input": "4 5\n3 1\n1 2\n4 1\n6 2\n1 2\n2 3\n2 4\n1 4\n3 4\n"}, "reference_outputs": ["6\n"], "source_document_id": "p03344", "source_text": "Score : 1000 points\n\nProblem Statement\n\nThere is a simple undirected graph with N vertices and M edges.\nThe vertices are numbered 1 through N, and the edges are numbered 1 through M.\nEdge i connects Vertex U_i and V_i.\nAlso, Vertex i has two predetermined integers A_i and B_i.\nYou will play the following game on this graph.\n\nFirst, choose one vertex and stand on it, with W yen (the currency of Japan) in your pocket.\nHere, A_s \\leq W must hold, where s is the vertex you choose.\nThen, perform the following two kinds of operations any number of times in any order:\n\nChoose one vertex v that is directly connected by an edge to the vertex you are standing on, and move to vertex v. Here, you need to have at least A_v yen in your pocket when you perform this move.\n\nDonate B_v yen to the vertex v you are standing on. Here, the amount of money in your pocket must not become less than 0 yen.\n\nYou win the game when you donate once to every vertex.\nFind the smallest initial amount of money W that enables you to win the game.\n\nConstraints\n\n1 \\leq N \\leq 10^5\n\nN-1 \\leq M \\leq 10^5\n\n1 \\leq A_i,B_i \\leq 10^9\n\n1 \\leq U_i < V_i \\leq N\n\nThe given graph is connected and simple (there is at most one edge between any pair of vertices).\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_N B_N\nU_1 V_1\nU_2 V_2\n:\nU_M V_M\n\nOutput\n\nPrint the smallest initial amount of money W that enables you to win the game.\n\nSample Input 1\n\n4 5\n3 1\n1 2\n4 1\n6 2\n1 2\n2 3\n2 4\n1 4\n3 4\n\nSample Output 1\n\n6\n\nIf you have 6 yen initially, you can win the game as follows:\n\nStand on Vertex 4. This is possible since you have not less than 6 yen.\n\nDonate 2 yen to Vertex 4. Now you have 4 yen.\n\nMove to Vertex 3. This is possible since you have not less than 4 yen.\n\nDonate 1 yen to Vertex 3. Now you have 3 yen.\n\nMove to Vertex 2. This is possible since you have not less than 1 yen.\n\nMove to Vertex 1. This is possible since you have not less than 3 yen.\n\nDonate 1 yen to Vertex 1. Now you have 2 yen.\n\nMove to Vertex 2. This is possible since you have not less than 1 yen.\n\nDonate 2 yen to Vertex 2. Now you have 0 yen.\n\nIf you have less than 6 yen initially, you cannot win the game. Thus, the answer is 6.\n\nSample Input 2\n\n5 8\n6 4\n15 13\n15 19\n15 1\n20 7\n1 3\n1 4\n1 5\n2 3\n2 4\n2 5\n3 5\n4 5\n\nSample Output 2\n\n44\n\nSample Input 3\n\n9 10\n131 2\n98 79\n242 32\n231 38\n382 82\n224 22\n140 88\n209 70\n164 64\n6 8\n1 6\n1 4\n1 3\n4 7\n4 9\n3 7\n3 9\n5 9\n2 5\n\nSample Output 3\n\n582", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 8870, "cpu_time_ms": 131, "memory_kb": 46412}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s849417303", "group_id": "codeNet:p03345", "input_text": "#include<stdio.h>\nint main(void){\n  long long int a,b,c,x;\n  scanf(\"%d %d %d %d\",&a,&b,&c,&x);\n  long long ans=a-b;\n  if(x&1){\n    ans=-1*ans;\n  }\n  printf(\"%lld\\n\",ans);\n  return 0;\n}", "language": "C", "metadata": {"date": 1588116690, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "problem_description_relpath": "problem_descriptions/p03345.html", "problem_id": "p03345", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03345/input.txt", "sample_output_relpath": "derived/input_output/data/p03345/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03345/C/s849417303.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s849417303", "user_id": "u716903426"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "#include<stdio.h>\nint main(void){\n  long long int a,b,c,x;\n  scanf(\"%d %d %d %d\",&a,&b,&c,&x);\n  long long ans=a-b;\n  if(x&1){\n    ans=-1*ans;\n  }\n  printf(\"%lld\\n\",ans);\n  return 0;\n}", "problem_context": "Score : 300 points\n\nProblem Statement\n\nTakahashi, Nakahashi and Hikuhashi have integers A, B and C, respectively.\nAfter repeating the following operation K times, find the integer Takahashi will get minus the integer Nakahashi will get:\n\nEach of them simultaneously calculate the sum of the integers that the other two people have, then replace his own integer with the result.\n\nHowever, if the absolute value of the answer exceeds 10^{18}, print Unfair instead.\n\nConstraints\n\n1 \\leq A,B,C \\leq 10^9\n\n0 \\leq K \\leq 10^{18}\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C K\n\nOutput\n\nPrint the integer Takahashi will get minus the integer Nakahashi will get, after repeating the following operation K times.\nIf the absolute value of the answer exceeds 10^{18}, print Unfair instead.\n\nSample Input 1\n\n1 2 3 1\n\nSample Output 1\n\n1\n\nAfter one operation, Takahashi, Nakahashi and Hikuhashi have 5, 4 and 3, respectively. We should print 5-4=1.\n\nSample Input 2\n\n2 3 2 0\n\nSample Output 2\n\n-1\n\nSample Input 3\n\n1000000000 1000000000 1000000000 1000000000000000000\n\nSample Output 3\n\n0", "sample_input": "1 2 3 1\n"}, "reference_outputs": ["1\n"], "source_document_id": "p03345", "source_text": "Score : 300 points\n\nProblem Statement\n\nTakahashi, Nakahashi and Hikuhashi have integers A, B and C, respectively.\nAfter repeating the following operation K times, find the integer Takahashi will get minus the integer Nakahashi will get:\n\nEach of them simultaneously calculate the sum of the integers that the other two people have, then replace his own integer with the result.\n\nHowever, if the absolute value of the answer exceeds 10^{18}, print Unfair instead.\n\nConstraints\n\n1 \\leq A,B,C \\leq 10^9\n\n0 \\leq K \\leq 10^{18}\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C K\n\nOutput\n\nPrint the integer Takahashi will get minus the integer Nakahashi will get, after repeating the following operation K times.\nIf the absolute value of the answer exceeds 10^{18}, print Unfair instead.\n\nSample Input 1\n\n1 2 3 1\n\nSample Output 1\n\n1\n\nAfter one operation, Takahashi, Nakahashi and Hikuhashi have 5, 4 and 3, respectively. We should print 5-4=1.\n\nSample Input 2\n\n2 3 2 0\n\nSample Output 2\n\n-1\n\nSample Input 3\n\n1000000000 1000000000 1000000000 1000000000000000000\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": 184, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s496810409", "group_id": "codeNet:p03351", "input_text": "//ABC097A\n#include<stdio.h>\nmain() {\n\tint a, b, c, d, i, j, k;\n\n\tscanf(\"%d %d %d %d\", &a, &b, &c, &d);\n\t\n\ti = abs(c - a);\n\tj = abs(b - a);\n\tk = abs(c - b);\n\n\tif (i <= d) {\n\t\tprintf(\"YES\");\n\t\n\t}else if (j <= d && k <= d){\n\t\tprintf(\"YES\");\n\n\t}\n\telse {\n\t\tprintf(\"NO\");\n\t}\n\treturn 0;\n}", "language": "C", "metadata": {"date": 1526486529, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "problem_description_relpath": "problem_descriptions/p03351.html", "problem_id": "p03351", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03351/input.txt", "sample_output_relpath": "derived/input_output/data/p03351/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03351/C/s496810409.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s496810409", "user_id": "u863205391"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "//ABC097A\n#include<stdio.h>\nmain() {\n\tint a, b, c, d, i, j, k;\n\n\tscanf(\"%d %d %d %d\", &a, &b, &c, &d);\n\t\n\ti = abs(c - a);\n\tj = abs(b - a);\n\tk = abs(c - b);\n\n\tif (i <= d) {\n\t\tprintf(\"YES\");\n\t\n\t}else if (j <= d && k <= d){\n\t\tprintf(\"YES\");\n\n\t}\n\telse {\n\t\tprintf(\"NO\");\n\t}\n\treturn 0;\n}", "problem_context": "Score : 100 points\n\nProblem Statement\n\nThree people, A, B and C, are trying to communicate using transceivers.\nThey are standing along a number line, and the coordinates of A, B and C are a, b and c (in meters), respectively.\nTwo people can directly communicate when the distance between them is at most d meters.\nDetermine if A and C can communicate, either directly or indirectly.\nHere, A and C can indirectly communicate when A and B can directly communicate and also B and C can directly communicate.\n\nConstraints\n\n1 ≤ a,b,c ≤ 100\n\n1 ≤ d ≤ 100\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\nIf A and C can communicate, print Yes; if they cannot, print No.\n\nSample Input 1\n\n4 7 9 3\n\nSample Output 1\n\nYes\n\nA and B can directly communicate, and also B and C can directly communicate, so we should print Yes.\n\nSample Input 2\n\n100 10 1 2\n\nSample Output 2\n\nNo\n\nThey cannot communicate in this case.\n\nSample Input 3\n\n10 10 10 1\n\nSample Output 3\n\nYes\n\nThere can be multiple people at the same position.\n\nSample Input 4\n\n1 100 2 10\n\nSample Output 4\n\nYes", "sample_input": "4 7 9 3\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p03351", "source_text": "Score : 100 points\n\nProblem Statement\n\nThree people, A, B and C, are trying to communicate using transceivers.\nThey are standing along a number line, and the coordinates of A, B and C are a, b and c (in meters), respectively.\nTwo people can directly communicate when the distance between them is at most d meters.\nDetermine if A and C can communicate, either directly or indirectly.\nHere, A and C can indirectly communicate when A and B can directly communicate and also B and C can directly communicate.\n\nConstraints\n\n1 ≤ a,b,c ≤ 100\n\n1 ≤ d ≤ 100\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\nIf A and C can communicate, print Yes; if they cannot, print No.\n\nSample Input 1\n\n4 7 9 3\n\nSample Output 1\n\nYes\n\nA and B can directly communicate, and also B and C can directly communicate, so we should print Yes.\n\nSample Input 2\n\n100 10 1 2\n\nSample Output 2\n\nNo\n\nThey cannot communicate in this case.\n\nSample Input 3\n\n10 10 10 1\n\nSample Output 3\n\nYes\n\nThere can be multiple people at the same position.\n\nSample Input 4\n\n1 100 2 10\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": 281, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s558543855", "group_id": "codeNet:p03352", "input_text": "#include <stdio.h>\nint main(){\n  double i,j,x,r=1;\n  scanf(\"%lf\",&x);\n  for(i=2;i<=x;i++)for(j=2;pow(i,j)<=x;j++)if(pow(i,j)>r)r=pow(i,j);\n  printf(\"%d\",(int)r);\n  return 0;\n}", "language": "C", "metadata": {"date": 1562254453, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "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/C/s558543855.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s558543855", "user_id": "u855016901"}, "prompt_components": {"gold_output": "9\n", "input_to_evaluate": "#include <stdio.h>\nint main(){\n  double i,j,x,r=1;\n  scanf(\"%lf\",&x);\n  for(i=2;i<=x;i++)for(j=2;pow(i,j)<=x;j++)if(pow(i,j)>r)r=pow(i,j);\n  printf(\"%d\",(int)r);\n  return 0;\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": 175, "cpu_time_ms": 2, "memory_kb": 512}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s092869217", "group_id": "codeNet:p03352", "input_text": "#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\n\nint main()\n{\n    double numX;\n    scanf(\"%lf\", &numX);\n\n    double outnum;\n\n    for (double numA = 1; numA <= 31; numA++)\n    {\n        for (double pownum = 2; pownum <= 10; pownum++)\n        {\n            double ans = pow(numA, pownum);    \n            if (ans < numX)\n            {\n                outnum = ans;\n            }\n        }\n    }\n\n    printf(\"%lf\\n\", outnum);\n\n    return 0;\n}", "language": "C", "metadata": {"date": 1528408825, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "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/C/s092869217.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s092869217", "user_id": "u251252118"}, "prompt_components": {"gold_output": "9\n", "input_to_evaluate": "#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\n\nint main()\n{\n    double numX;\n    scanf(\"%lf\", &numX);\n\n    double outnum;\n\n    for (double numA = 1; numA <= 31; numA++)\n    {\n        for (double pownum = 2; pownum <= 10; pownum++)\n        {\n            double ans = pow(numA, pownum);    \n            if (ans < numX)\n            {\n                outnum = ans;\n            }\n        }\n    }\n\n    printf(\"%lf\\n\", outnum);\n\n    return 0;\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": 448, "cpu_time_ms": 3, "memory_kb": 256}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s479426711", "group_id": "codeNet:p03352", "input_text": "#include <stdio.h>\n#include <stdlib.h>\n#include<math.h>\nint comparewhether(int x,int y,int z);\nint main()\n{\n    int i,x,k=2;\n    double result, max=1.0;\n    double ii,kk;\n    scanf(\"%d\",&x);\n\n    kk=(double)k;\n\n    if(x==1)\n    {\n        printf(\"%d\",x);\n    }\n    else\n    {\n\n\n        for(i=2; i<32; i++)\n        {\n            ii=(double)i;\n            while(pow(ii,kk)<x&&k<10)\n            {\n\n\n\n                if(pow(ii,kk)>max)\n                {\n                    max=pow(ii,kk);\n                }\n                printf(\"result=%f\\n\",pow(ii,kk));\n                printf(\"max=%f\\n\",max);\n\n                 k++;\n                  kk=(double)k;\n            }\n\n            k=2;\n             kk=(double)k;\n\n        }\n        printf(\"%d\",(int)max);\n    }\n\n\n    return 0;\n\n\n}\n\n", "language": "C", "metadata": {"date": 1526178239, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "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/C/s479426711.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s479426711", "user_id": "u851032031"}, "prompt_components": {"gold_output": "9\n", "input_to_evaluate": "#include <stdio.h>\n#include <stdlib.h>\n#include<math.h>\nint comparewhether(int x,int y,int z);\nint main()\n{\n    int i,x,k=2;\n    double result, max=1.0;\n    double ii,kk;\n    scanf(\"%d\",&x);\n\n    kk=(double)k;\n\n    if(x==1)\n    {\n        printf(\"%d\",x);\n    }\n    else\n    {\n\n\n        for(i=2; i<32; i++)\n        {\n            ii=(double)i;\n            while(pow(ii,kk)<x&&k<10)\n            {\n\n\n\n                if(pow(ii,kk)>max)\n                {\n                    max=pow(ii,kk);\n                }\n                printf(\"result=%f\\n\",pow(ii,kk));\n                printf(\"max=%f\\n\",max);\n\n                 k++;\n                  kk=(double)k;\n            }\n\n            k=2;\n             kk=(double)k;\n\n        }\n        printf(\"%d\",(int)max);\n    }\n\n\n    return 0;\n\n\n}\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": 776, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s450494491", "group_id": "codeNet:p03352", "input_text": "#include <stdio.h>\n  \nint main(void)\n{\n    int X;\n    int i;\n    scanf(\"%d\",&X);\n \n    for(i = 1; i < X; i++) {\n        if(X == 1) {\n            printf(\"X\\n\");\n            break;\n        }\n        else if(i * i > X) {\n            printf(\"%d\\n\", (i-1) * (i-1));\n            break;\n        }\n    }\n \n    return 0;\n}", "language": "C", "metadata": {"date": 1526176895, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "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/C/s450494491.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s450494491", "user_id": "u133142920"}, "prompt_components": {"gold_output": "9\n", "input_to_evaluate": "#include <stdio.h>\n  \nint main(void)\n{\n    int X;\n    int i;\n    scanf(\"%d\",&X);\n \n    for(i = 1; i < X; i++) {\n        if(X == 1) {\n            printf(\"X\\n\");\n            break;\n        }\n        else if(i * i > X) {\n            printf(\"%d\\n\", (i-1) * (i-1));\n            break;\n        }\n    }\n \n    return 0;\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": 313, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s433752078", "group_id": "codeNet:p03359", "input_text": "#include <stdio.h>\nint main(void){\n    int t[2];\n    scanf(\"%d %d\",&t[0],&t[1]);\n    if(t[0]<t[1]){printf(\"%d\\n\",t[0]);}else{printf(\"%d\\n\",t[0]-1);}\n    return 0;\n}\n", "language": "C", "metadata": {"date": 1546461446, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "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/C/s433752078.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s433752078", "user_id": "u875408597"}, "prompt_components": {"gold_output": "5\n", "input_to_evaluate": "#include <stdio.h>\nint main(void){\n    int t[2];\n    scanf(\"%d %d\",&t[0],&t[1]);\n    if(t[0]<t[1]){printf(\"%d\\n\",t[0]);}else{printf(\"%d\\n\",t[0]-1);}\n    return 0;\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": 165, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s166710993", "group_id": "codeNet:p03359", "input_text": "#include <stdio.h>\n\nint main(void)\n{\n  int a, b;\n  scanf(\"%d %d\", &a, &b);\n  if(a <= b) printf(\"%d\\n\", a);\n  else printf(\"%d\\n\", a - 1);\n  \n  return 0;\n}", "language": "C", "metadata": {"date": 1528939319, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "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/C/s166710993.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s166710993", "user_id": "u973997867"}, "prompt_components": {"gold_output": "5\n", "input_to_evaluate": "#include <stdio.h>\n\nint main(void)\n{\n  int a, b;\n  scanf(\"%d %d\", &a, &b);\n  if(a <= b) printf(\"%d\\n\", a);\n  else printf(\"%d\\n\", a - 1);\n  \n  return 0;\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": 153, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s881901835", "group_id": "codeNet:p03359", "input_text": "#include <stdio.h>\nint main() {\nint a, b, x = 0;\nscanf(\"%d\", &a);\nscanf(\"%d\", &b);\nif (a <= b) {\nx = a;\n} else if(a > b) {\nx = a - 1;\n} printf(\"%d\\n\", x);\nreturn 0;\n}", "language": "C", "metadata": {"date": 1525896935, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "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/C/s881901835.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s881901835", "user_id": "u086097200"}, "prompt_components": {"gold_output": "5\n", "input_to_evaluate": "#include <stdio.h>\nint main() {\nint a, b, x = 0;\nscanf(\"%d\", &a);\nscanf(\"%d\", &b);\nif (a <= b) {\nx = a;\n} else if(a > b) {\nx = a - 1;\n} printf(\"%d\\n\", x);\nreturn 0;\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": 166, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s990957081", "group_id": "codeNet:p03361", "input_text": "#include<stdio.h>\nint main(){\n  int h,w;\n  scanf(\"%d %d\",&h,&w);\n  char s[h][w],dx[4] = {1,0,-1,0},dy[4] = {0,1,0,-1};\n  for(int i = 0;i < h;i++){\n    scanf(\"%s\",&s[i]);\n  }\n  for(int i = 0;i < h;i++){\n    for(int j = 0;j < w;j++){\n      if(s[i][j] == '#'){\n        int c = 0;\n        for(int d = 0;d < 4;d++){\n          int x = i + dx[d],y = j + dy[d];\n          if(-1 < x && x < h && -1 < y && y < w && s[x][y] == '#'){\n            c = 1;\n          }\n        }\n        if(c < 1){\n          printf(\"No\\n\");\n          return 0;\n        }\n      }\n    }\n  }\n  printf(\"Yes\\n\");\n  return 0;\n}", "language": "C", "metadata": {"date": 1552443685, "filename_ext": "c", "original_language": "C (Clang 3.8.0)", "problem_description_relpath": "problem_descriptions/p03361.html", "problem_id": "p03361", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03361/input.txt", "sample_output_relpath": "derived/input_output/data/p03361/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03361/C/s990957081.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s990957081", "user_id": "u008829811"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "#include<stdio.h>\nint main(){\n  int h,w;\n  scanf(\"%d %d\",&h,&w);\n  char s[h][w],dx[4] = {1,0,-1,0},dy[4] = {0,1,0,-1};\n  for(int i = 0;i < h;i++){\n    scanf(\"%s\",&s[i]);\n  }\n  for(int i = 0;i < h;i++){\n    for(int j = 0;j < w;j++){\n      if(s[i][j] == '#'){\n        int c = 0;\n        for(int d = 0;d < 4;d++){\n          int x = i + dx[d],y = j + dy[d];\n          if(-1 < x && x < h && -1 < y && y < w && s[x][y] == '#'){\n            c = 1;\n          }\n        }\n        if(c < 1){\n          printf(\"No\\n\");\n          return 0;\n        }\n      }\n    }\n  }\n  printf(\"Yes\\n\");\n  return 0;\n}", "problem_context": "Score: 300 points\n\nProblem Statement\n\nWe have a canvas divided into a grid with H rows and W columns. The square at the i-th row from the top and the j-th column from the left is represented as (i, j).\n\nInitially, all the squares are white. square1001 wants to draw a picture with black paint. His specific objective is to make Square (i, j) black when s_{i, j}= #, and to make Square (i, j) white when s_{i, j}= ..\n\nHowever, since he is not a good painter, he can only choose two squares that are horizontally or vertically adjacent and paint those squares black, for some number of times (possibly zero). He may choose squares that are already painted black, in which case the color of those squares remain black.\n\nDetermine if square1001 can achieve his objective.\n\nConstraints\n\nH is an integer between 1 and 50 (inclusive).\n\nW is an integer between 1 and 50 (inclusive).\n\nFor every (i, j) (1 \\leq i \\leq H, 1 \\leq j \\leq W), s_{i, j} is # or ..\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W\ns_{1, 1} s_{1, 2} s_{1, 3} ... s_{1, W}\ns_{2, 1} s_{2, 2} s_{2, 3} ... s_{2, W}\n: :\ns_{H, 1} s_{H, 2} s_{H, 3} ... s_{H, W}\n\nOutput\n\nIf square1001 can achieve his objective, print Yes; if he cannot, print No.\n\nSample Input 1\n\n3 3\n.#.\n###\n.#.\n\nSample Output 1\n\nYes\n\nOne possible way to achieve the objective is shown in the figure below. Here, the squares being painted are marked by stars.\n\nSample Input 2\n\n5 5\n#.#.#\n.#.#.\n#.#.#\n.#.#.\n#.#.#\n\nSample Output 2\n\nNo\n\nsquare1001 cannot achieve his objective here.\n\nSample Input 3\n\n11 11\n...#####...\n.##.....##.\n#..##.##..#\n#..##.##..#\n#.........#\n#...###...#\n.#########.\n.#.#.#.#.#.\n##.#.#.#.##\n..##.#.##..\n.##..#..##.\n\nSample Output 3\n\nYes", "sample_input": "3 3\n.#.\n###\n.#.\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p03361", "source_text": "Score: 300 points\n\nProblem Statement\n\nWe have a canvas divided into a grid with H rows and W columns. The square at the i-th row from the top and the j-th column from the left is represented as (i, j).\n\nInitially, all the squares are white. square1001 wants to draw a picture with black paint. His specific objective is to make Square (i, j) black when s_{i, j}= #, and to make Square (i, j) white when s_{i, j}= ..\n\nHowever, since he is not a good painter, he can only choose two squares that are horizontally or vertically adjacent and paint those squares black, for some number of times (possibly zero). He may choose squares that are already painted black, in which case the color of those squares remain black.\n\nDetermine if square1001 can achieve his objective.\n\nConstraints\n\nH is an integer between 1 and 50 (inclusive).\n\nW is an integer between 1 and 50 (inclusive).\n\nFor every (i, j) (1 \\leq i \\leq H, 1 \\leq j \\leq W), s_{i, j} is # or ..\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W\ns_{1, 1} s_{1, 2} s_{1, 3} ... s_{1, W}\ns_{2, 1} s_{2, 2} s_{2, 3} ... s_{2, W}\n: :\ns_{H, 1} s_{H, 2} s_{H, 3} ... s_{H, W}\n\nOutput\n\nIf square1001 can achieve his objective, print Yes; if he cannot, print No.\n\nSample Input 1\n\n3 3\n.#.\n###\n.#.\n\nSample Output 1\n\nYes\n\nOne possible way to achieve the objective is shown in the figure below. Here, the squares being painted are marked by stars.\n\nSample Input 2\n\n5 5\n#.#.#\n.#.#.\n#.#.#\n.#.#.\n#.#.#\n\nSample Output 2\n\nNo\n\nsquare1001 cannot achieve his objective here.\n\nSample Input 3\n\n11 11\n...#####...\n.##.....##.\n#..##.##..#\n#..##.##..#\n#.........#\n#...###...#\n.#########.\n.#.#.#.#.#.\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": 588, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s357814116", "group_id": "codeNet:p03363", "input_text": "#include<stdio.h>\nint main(void){\n  int N,sum=0,b=0,ans=0,i,j,count=0;\n  scanf(\"%d\",&N);\n  int A[N],Asum[N];\n  for(i=0;i<N;i++){\n    scanf(\"%d\",&A[i]);\n  }\n  for(i=0;i<N;i++){\n    sum=sum+A[i];\n    Asum[i]=sum;\n  }\n  for(i=0;i<N;i++){\n    b=Asum[i];\n    for(j=0;j<=i;j++){\n      if(b==0){\n        count=count+1;\n      }\n      b=b-A[j];\n    }\n  }\n  printf(\"%d\",count);\n    return 0;\n}", "language": "C", "metadata": {"date": 1562194891, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "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/C/s357814116.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s357814116", "user_id": "u601444374"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "#include<stdio.h>\nint main(void){\n  int N,sum=0,b=0,ans=0,i,j,count=0;\n  scanf(\"%d\",&N);\n  int A[N],Asum[N];\n  for(i=0;i<N;i++){\n    scanf(\"%d\",&A[i]);\n  }\n  for(i=0;i<N;i++){\n    sum=sum+A[i];\n    Asum[i]=sum;\n  }\n  for(i=0;i<N;i++){\n    b=Asum[i];\n    for(j=0;j<=i;j++){\n      if(b==0){\n        count=count+1;\n      }\n      b=b-A[j];\n    }\n  }\n  printf(\"%d\",count);\n    return 0;\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": 383, "cpu_time_ms": 2103, "memory_kb": 1792}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s691511466", "group_id": "codeNet:p03363", "input_text": "//set many funcs template\n//Ver.20181228\n#include<stdio.h>\n#include<string.h>\n#include<stdlib.h>\n#include<stdbool.h>\n#include<time.h>\n#define inf 1072114514\n#define llinf 4154118101919364364\n#define mod 1000000007\n#define pi 3.1415926535897932384\n#define bas 1000003\n\nint max(int a,int b){if(a>b){return a;}return b;}\nint min(int a,int b){if(a<b){return a;}return b;}\nint zt(int a,int b){return max(a,b)-min(a,b);}\nint round(int a,int b){if((a%b)*2 >= b){return (a/b)+1;}return a/b;}\nint ceil(int a,int b){if(a%b==0){return a/b;}return (a/b)+1;}\nint gcd(int a,int b){int c;while(b!=0){c=a%b;a=b;b=c;}return a;}\nint lcm(int a,int b){int c=gcd(a,b);a/=c;return a*b;}\nint nCr(int a,int b){int i,r=1;for(i=1;i<=b;i++){r*=(a+1-i);r/=i;}return r;}\nint nHr(int a,int b){return nCr(a+b-1,b);}\nint fact(int a){int i,r=1;for(i=1;i<=a;i++){r*=i;}return r;}\nint pow(int a,int b){int i,r=1;for(i=1;i<=b;i++){r*=a;}return r;}\nint dsum(int x){int r=0;while(x){r+=(x%10);x/=10;}return r;}\nint dsumb(int x,int b){int r=0;while(x){r+=(x%b);x/=b;}return r;}\nint sankaku(int x){return ((1+x)*x)/2;}\nlong long llmax(long long a,long long b){if(a>b){return a;}return b;}\nlong long llmin(long long a,long long b){if(a<b){return a;}return b;}\nlong long llzt(long long a,long long b){return llmax(a,b)-llmin(a,b);}\nlong long llround(long long a,long long b){if((a%b)*2 >= b){return (a/b)+1;}return a/b;}\nlong long llceil(long long a,long long b){if(a%b==0){return a/b;}return (a/b)+1;}\nlong long llgcd(long long a,long long b){long long c;while(b!=0){c=a%b;a=b;b=c;}return a;}\nlong long lllcm(long long a,long long b){long long c=llgcd(a,b);a/=c;return a*b;}\nlong long llnCr(long long a,long long b){long long i,r=1;for(i=1;i<=b;i++){r*=(a+1-i);r/=i;}return r;}\nlong long llnHr(long long a,long long b){return llnCr(a+b-1,b);}\nlong long llfact(long long a){long long i,r=1;for(i=1;i<=a;i++){r*=i;}return r;}\nlong long llpow(long long a,long long b){long long i,r=1;for(i=1;i<=b;i++){r*=a;}return r;}\nlong long lldsum(long long x){long long r=0;while(x){r+=(x%10);x/=10;}return r;}\nlong long lldsumb(long long x,long long b){long long r=0;while(x){r+=(x%b);x/=b;}return r;}\nlong long llsankaku(long long x){return ((1+x)*x)/2;}\ndouble dbmax(double a,double b){if(a>b){return a;}return b;}\ndouble dbmin(double a,double b){if(a<b){return a;}return b;}\ndouble dbzt(double a,double b){return dbmax(a,b)-dbmin(a,b);}\nint sortfncsj(const void *a,const void *b){if(*(int *)a>*(int *)b){return 1;}if(*(int *)a==*(int *)b){return 0;}return -1;}\nint sortfnckj(const void *a,const void *b){if(*(int *)a<*(int *)b){return 1;}if(*(int *)a==*(int *)b){return 0;}return -1;}\nint llsortfncsj(const void *a,const void *b){if(*(long long *)a>*(long long *)b){return 1;}if(*(long long *)a==*(long long *)b){return 0;}return -1;}\nint llsortfnckj(const void *a,const void *b){if(*(long long *)a<*(long long *)b){return 1;}if(*(long long *)a==*(long long *)b){return 0;}return -1;}\nint dbsortfncsj(const void *a,const void *b){if(*(double *)a>*(double *)b){return 1;}if(*(double *)a==*(double *)b){return 0;}return -1;}\nint dbsortfnckj(const void *a,const void *b){if(*(double *)a<*(double *)b){return 1;}if(*(double *)a==*(double *)b){return 0;}return -1;}\nint strsortfncsj(const void *a,const void *b){return strcmp((char *)a,(char *)b);}\nint strsortfnckj(const void *a,const void *b){return strcmp((char *)b,(char *)a);}\nint chsortfncsj(const void *a,const void *b){if(*(char *)a>*(char *)b){return 1;}if(*(char *)a==*(char *)b){return 0;}return -1;}\nint chsortfnckj(const void *a,const void *b){if(*(char *)a<*(char *)b){return 1;}if(*(char *)a==*(char *)b){return 0;}return -1;}\n\nvoid shuffledget(int x[],int n){\n    srand(time(0));\n    int i,b[524288],p,c;\n    for(i=0;i<n;i++){\n        b[i]=i;\n    }\n    for(i=n;i>=1;i--){\n        p=rand()%i;\n        c=b[i-1];b[i-1]=b[p];b[p]=c;\n    }\n    for(i=0;i<n;i++){\n        scanf(\"%d\",&x[b[i]]);\n    }\n}\n\nint dx4[4]={1,-1,0,0};\nint dy4[4]={0,0,1,-1};\nint dx8[8]={-1,-1,-1,0,0,1,1,1};\nint dy8[8]={-1,0,1,-1,1,-1,0,1};\n\nvoid prarr(int arr[],int n){\n  int i;\n  for(i=0;i<n;i++){\n    if(i){printf(\" \");}\n    printf(\"%d\",arr[i]);\n  }\n  printf(\"\\n\");\n  return;\n}\n\ntypedef struct{\nint val;\nint node;\n}sd;\n\nint sdsortfnc(const void *a,const void *b){\nif(((sd*)a)->val < ((sd*)b)->val){return -1;}\nif(((sd*)a)->val > ((sd*)b)->val){return 1;}\nreturn 0;\n}\n\ntypedef struct{\n    char str[32];\n    long long val;\n}data;\n\ndata hmap[1048576];\n\nvoid hinit(){\n    long long i;\n    for(i=0;i<bas;i++){\n        strcpy(hmap[i].str,\"\");\n        hmap[i].val=0;\n    }\n}\n\nlong long chash(char s[]){\n    long long l,i,r=0,k;\n    l=strlen(s);\n    k=1;\n    for(i=0;i<l;i++){\n        r+=(k*s[i]);r%=bas;\n        k*=128;k%=bas;\n    }\n    return r;\n}\n\nlong long search(char s[]){\n    long long h,p;\n    h=chash(s);\n    p=h;\n    while(1){\n        if(strcmp(hmap[p].str,s)==0){return p;}\n        if(strlen(hmap[p].str)==0){return -1;}\n        p++;p%=bas;\n        if(p==h){return -1;}\n    }\n}\n\nvoid add(char s[]){\n    long long h,p;\n    h=search(s);\n    if(h!=-1){hmap[h].val++;return;}\n    h=chash(s);\n    p=h;\n    while(1){\n        if(strlen(hmap[p].str)==0){\n            strcpy(hmap[p].str,s);\n            hmap[p].val++;\n            return;\n        }\n        p++;p%=bas;\n        if(p==h){return;}\n    }\n}\n\nint main(void){\n  hinit();\n  long long i,j,n,m,k,a[524288],b,c,h,w,r=0,l,t;\n  char s[32];\n  scanf(\"%lld\",&n);\n  t=0;\n  sprintf(s,\"%lld\",t);\n  add(s);\n  for(i=0;i<n;i++){\n    scanf(\"%lld\",&a[i]);\n    t+=a[i];\n    sprintf(s,\"%lld\",t);\n    add(s);\n  }\n  for(i=0;i<bas;i++){\n    w=hmap[i].val;\n    r+=((w*(w-1))/2);\n  }\n  printf(\"%lld\\n\",r);\n  return 0;\n}\n", "language": "C", "metadata": {"date": 1554135978, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "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/C/s691511466.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s691511466", "user_id": "u721060623"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "//set many funcs template\n//Ver.20181228\n#include<stdio.h>\n#include<string.h>\n#include<stdlib.h>\n#include<stdbool.h>\n#include<time.h>\n#define inf 1072114514\n#define llinf 4154118101919364364\n#define mod 1000000007\n#define pi 3.1415926535897932384\n#define bas 1000003\n\nint max(int a,int b){if(a>b){return a;}return b;}\nint min(int a,int b){if(a<b){return a;}return b;}\nint zt(int a,int b){return max(a,b)-min(a,b);}\nint round(int a,int b){if((a%b)*2 >= b){return (a/b)+1;}return a/b;}\nint ceil(int a,int b){if(a%b==0){return a/b;}return (a/b)+1;}\nint gcd(int a,int b){int c;while(b!=0){c=a%b;a=b;b=c;}return a;}\nint lcm(int a,int b){int c=gcd(a,b);a/=c;return a*b;}\nint nCr(int a,int b){int i,r=1;for(i=1;i<=b;i++){r*=(a+1-i);r/=i;}return r;}\nint nHr(int a,int b){return nCr(a+b-1,b);}\nint fact(int a){int i,r=1;for(i=1;i<=a;i++){r*=i;}return r;}\nint pow(int a,int b){int i,r=1;for(i=1;i<=b;i++){r*=a;}return r;}\nint dsum(int x){int r=0;while(x){r+=(x%10);x/=10;}return r;}\nint dsumb(int x,int b){int r=0;while(x){r+=(x%b);x/=b;}return r;}\nint sankaku(int x){return ((1+x)*x)/2;}\nlong long llmax(long long a,long long b){if(a>b){return a;}return b;}\nlong long llmin(long long a,long long b){if(a<b){return a;}return b;}\nlong long llzt(long long a,long long b){return llmax(a,b)-llmin(a,b);}\nlong long llround(long long a,long long b){if((a%b)*2 >= b){return (a/b)+1;}return a/b;}\nlong long llceil(long long a,long long b){if(a%b==0){return a/b;}return (a/b)+1;}\nlong long llgcd(long long a,long long b){long long c;while(b!=0){c=a%b;a=b;b=c;}return a;}\nlong long lllcm(long long a,long long b){long long c=llgcd(a,b);a/=c;return a*b;}\nlong long llnCr(long long a,long long b){long long i,r=1;for(i=1;i<=b;i++){r*=(a+1-i);r/=i;}return r;}\nlong long llnHr(long long a,long long b){return llnCr(a+b-1,b);}\nlong long llfact(long long a){long long i,r=1;for(i=1;i<=a;i++){r*=i;}return r;}\nlong long llpow(long long a,long long b){long long i,r=1;for(i=1;i<=b;i++){r*=a;}return r;}\nlong long lldsum(long long x){long long r=0;while(x){r+=(x%10);x/=10;}return r;}\nlong long lldsumb(long long x,long long b){long long r=0;while(x){r+=(x%b);x/=b;}return r;}\nlong long llsankaku(long long x){return ((1+x)*x)/2;}\ndouble dbmax(double a,double b){if(a>b){return a;}return b;}\ndouble dbmin(double a,double b){if(a<b){return a;}return b;}\ndouble dbzt(double a,double b){return dbmax(a,b)-dbmin(a,b);}\nint sortfncsj(const void *a,const void *b){if(*(int *)a>*(int *)b){return 1;}if(*(int *)a==*(int *)b){return 0;}return -1;}\nint sortfnckj(const void *a,const void *b){if(*(int *)a<*(int *)b){return 1;}if(*(int *)a==*(int *)b){return 0;}return -1;}\nint llsortfncsj(const void *a,const void *b){if(*(long long *)a>*(long long *)b){return 1;}if(*(long long *)a==*(long long *)b){return 0;}return -1;}\nint llsortfnckj(const void *a,const void *b){if(*(long long *)a<*(long long *)b){return 1;}if(*(long long *)a==*(long long *)b){return 0;}return -1;}\nint dbsortfncsj(const void *a,const void *b){if(*(double *)a>*(double *)b){return 1;}if(*(double *)a==*(double *)b){return 0;}return -1;}\nint dbsortfnckj(const void *a,const void *b){if(*(double *)a<*(double *)b){return 1;}if(*(double *)a==*(double *)b){return 0;}return -1;}\nint strsortfncsj(const void *a,const void *b){return strcmp((char *)a,(char *)b);}\nint strsortfnckj(const void *a,const void *b){return strcmp((char *)b,(char *)a);}\nint chsortfncsj(const void *a,const void *b){if(*(char *)a>*(char *)b){return 1;}if(*(char *)a==*(char *)b){return 0;}return -1;}\nint chsortfnckj(const void *a,const void *b){if(*(char *)a<*(char *)b){return 1;}if(*(char *)a==*(char *)b){return 0;}return -1;}\n\nvoid shuffledget(int x[],int n){\n    srand(time(0));\n    int i,b[524288],p,c;\n    for(i=0;i<n;i++){\n        b[i]=i;\n    }\n    for(i=n;i>=1;i--){\n        p=rand()%i;\n        c=b[i-1];b[i-1]=b[p];b[p]=c;\n    }\n    for(i=0;i<n;i++){\n        scanf(\"%d\",&x[b[i]]);\n    }\n}\n\nint dx4[4]={1,-1,0,0};\nint dy4[4]={0,0,1,-1};\nint dx8[8]={-1,-1,-1,0,0,1,1,1};\nint dy8[8]={-1,0,1,-1,1,-1,0,1};\n\nvoid prarr(int arr[],int n){\n  int i;\n  for(i=0;i<n;i++){\n    if(i){printf(\" \");}\n    printf(\"%d\",arr[i]);\n  }\n  printf(\"\\n\");\n  return;\n}\n\ntypedef struct{\nint val;\nint node;\n}sd;\n\nint sdsortfnc(const void *a,const void *b){\nif(((sd*)a)->val < ((sd*)b)->val){return -1;}\nif(((sd*)a)->val > ((sd*)b)->val){return 1;}\nreturn 0;\n}\n\ntypedef struct{\n    char str[32];\n    long long val;\n}data;\n\ndata hmap[1048576];\n\nvoid hinit(){\n    long long i;\n    for(i=0;i<bas;i++){\n        strcpy(hmap[i].str,\"\");\n        hmap[i].val=0;\n    }\n}\n\nlong long chash(char s[]){\n    long long l,i,r=0,k;\n    l=strlen(s);\n    k=1;\n    for(i=0;i<l;i++){\n        r+=(k*s[i]);r%=bas;\n        k*=128;k%=bas;\n    }\n    return r;\n}\n\nlong long search(char s[]){\n    long long h,p;\n    h=chash(s);\n    p=h;\n    while(1){\n        if(strcmp(hmap[p].str,s)==0){return p;}\n        if(strlen(hmap[p].str)==0){return -1;}\n        p++;p%=bas;\n        if(p==h){return -1;}\n    }\n}\n\nvoid add(char s[]){\n    long long h,p;\n    h=search(s);\n    if(h!=-1){hmap[h].val++;return;}\n    h=chash(s);\n    p=h;\n    while(1){\n        if(strlen(hmap[p].str)==0){\n            strcpy(hmap[p].str,s);\n            hmap[p].val++;\n            return;\n        }\n        p++;p%=bas;\n        if(p==h){return;}\n    }\n}\n\nint main(void){\n  hinit();\n  long long i,j,n,m,k,a[524288],b,c,h,w,r=0,l,t;\n  char s[32];\n  scanf(\"%lld\",&n);\n  t=0;\n  sprintf(s,\"%lld\",t);\n  add(s);\n  for(i=0;i<n;i++){\n    scanf(\"%lld\",&a[i]);\n    t+=a[i];\n    sprintf(s,\"%lld\",t);\n    add(s);\n  }\n  for(i=0;i<bas;i++){\n    w=hmap[i].val;\n    r+=((w*(w-1))/2);\n  }\n  printf(\"%lld\\n\",r);\n  return 0;\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": 5629, "cpu_time_ms": 98, "memory_kb": 44544}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s548247632", "group_id": "codeNet:p03363", "input_text": "#include <stdio.h>\n#include <stdlib.h>\n\nint combination(int n, int k) {\n\tif (n < k)return 0;\n\tif (k > 0) {\n\t\treturn combination(n, k - 1) * (n - k + 1) / k;\n\t}\n\telse {\n\t\treturn 1;\n\t}\n}\n\nint func(const void *a, const void *b)\n{\n\treturn *(int*)a - *(int*)b;\n}\n\nint main(void) {\n\tint N;\n\tlong S[200001];\n\tlong sorted[200001];\n\tscanf(\"%d\", &N);\n\tS[0] = 0;\n\tfor (int i = 1; i <= N; i++) {\n\t\tlong temp;\n\t\tscanf(\"%ld\", &temp);\n\t\tS[i] = S[i - 1] + temp;\n\t}\n\tlong max = -10000000;\n\tfor (int i = 1; i <= N; i++) {\n\t\tif (max < S[i])max = S[i];\n\t}\n\t//counting_sort(S, sorted, max, N + 1);\n\tqsort(S, N + 1, sizeof(long), func);\n\tint before = 1;\n\tint res = 0;\n\tfor (int i = 1; i <= N; i++) {\n\t\tif (S[i] == S[i - 1]) {\n\t\t\tbefore++;\n\t\t}\n\t\telse {\n\t\t\tres += combination(before, 2);\n\t\t\tbefore = 1;\n\t\t}\n\t}\n\tres += combination(before, 2);\n\tprintf(\"%d\\n\", res);\n\treturn 0;\n}", "language": "C", "metadata": {"date": 1525254665, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "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/C/s548247632.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s548247632", "user_id": "u544437477"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "#include <stdio.h>\n#include <stdlib.h>\n\nint combination(int n, int k) {\n\tif (n < k)return 0;\n\tif (k > 0) {\n\t\treturn combination(n, k - 1) * (n - k + 1) / k;\n\t}\n\telse {\n\t\treturn 1;\n\t}\n}\n\nint func(const void *a, const void *b)\n{\n\treturn *(int*)a - *(int*)b;\n}\n\nint main(void) {\n\tint N;\n\tlong S[200001];\n\tlong sorted[200001];\n\tscanf(\"%d\", &N);\n\tS[0] = 0;\n\tfor (int i = 1; i <= N; i++) {\n\t\tlong temp;\n\t\tscanf(\"%ld\", &temp);\n\t\tS[i] = S[i - 1] + temp;\n\t}\n\tlong max = -10000000;\n\tfor (int i = 1; i <= N; i++) {\n\t\tif (max < S[i])max = S[i];\n\t}\n\t//counting_sort(S, sorted, max, N + 1);\n\tqsort(S, N + 1, sizeof(long), func);\n\tint before = 1;\n\tint res = 0;\n\tfor (int i = 1; i <= N; i++) {\n\t\tif (S[i] == S[i - 1]) {\n\t\t\tbefore++;\n\t\t}\n\t\telse {\n\t\t\tres += combination(before, 2);\n\t\t\tbefore = 1;\n\t\t}\n\t}\n\tres += combination(before, 2);\n\tprintf(\"%d\\n\", res);\n\treturn 0;\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": 852, "cpu_time_ms": 49, "memory_kb": 3324}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s975550955", "group_id": "codeNet:p03369", "input_text": "#include <stdio.h>\n\nint main(void) {\n\tchar S[4];\n\tif (scanf(\"%3s\", S) != 1) return 1;\n\tprintf(\"%d00\\n\", 7 + (S[0] == 'o') + (S[1] == 'o') + (S[2] == 'o'));\n\treturn 0;\n}\n", "language": "C", "metadata": {"date": 1578979425, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "problem_description_relpath": "problem_descriptions/p03369.html", "problem_id": "p03369", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03369/input.txt", "sample_output_relpath": "derived/input_output/data/p03369/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03369/C/s975550955.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s975550955", "user_id": "u646118499"}, "prompt_components": {"gold_output": "900\n", "input_to_evaluate": "#include <stdio.h>\n\nint main(void) {\n\tchar S[4];\n\tif (scanf(\"%3s\", S) != 1) return 1;\n\tprintf(\"%d00\\n\", 7 + (S[0] == 'o') + (S[1] == 'o') + (S[2] == 'o'));\n\treturn 0;\n}\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nIn \"Takahashi-ya\", a ramen restaurant, a bowl of ramen costs 700 yen (the currency of Japan), plus 100 yen for each kind of topping (boiled egg, sliced pork, green onions).\n\nA customer ordered a bowl of ramen and told which toppings to put on his ramen to a clerk. The clerk took a memo of the order as a string S. S is three characters long, and if the first character in S is o, it means the ramen should be topped with boiled egg; if that character is x, it means the ramen should not be topped with boiled egg. Similarly, the second and third characters in S mean the presence or absence of sliced pork and green onions on top of the ramen.\n\nWrite a program that, when S is given, prints the price of the corresponding bowl of ramen.\n\nConstraints\n\nS is a string of length 3.\n\nEach character in S is o or x.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the price of the bowl of ramen corresponding to S.\n\nSample Input 1\n\noxo\n\nSample Output 1\n\n900\n\nThe price of a ramen topped with two kinds of toppings, boiled egg and green onions, is 700 + 100 \\times 2 = 900 yen.\n\nSample Input 2\n\nooo\n\nSample Output 2\n\n1000\n\nThe price of a ramen topped with all three kinds of toppings is 700 + 100 \\times 3 = 1000 yen.\n\nSample Input 3\n\nxxx\n\nSample Output 3\n\n700\n\nThe price of a ramen without any toppings is 700 yen.", "sample_input": "oxo\n"}, "reference_outputs": ["900\n"], "source_document_id": "p03369", "source_text": "Score : 100 points\n\nProblem Statement\n\nIn \"Takahashi-ya\", a ramen restaurant, a bowl of ramen costs 700 yen (the currency of Japan), plus 100 yen for each kind of topping (boiled egg, sliced pork, green onions).\n\nA customer ordered a bowl of ramen and told which toppings to put on his ramen to a clerk. The clerk took a memo of the order as a string S. S is three characters long, and if the first character in S is o, it means the ramen should be topped with boiled egg; if that character is x, it means the ramen should not be topped with boiled egg. Similarly, the second and third characters in S mean the presence or absence of sliced pork and green onions on top of the ramen.\n\nWrite a program that, when S is given, prints the price of the corresponding bowl of ramen.\n\nConstraints\n\nS is a string of length 3.\n\nEach character in S is o or x.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the price of the bowl of ramen corresponding to S.\n\nSample Input 1\n\noxo\n\nSample Output 1\n\n900\n\nThe price of a ramen topped with two kinds of toppings, boiled egg and green onions, is 700 + 100 \\times 2 = 900 yen.\n\nSample Input 2\n\nooo\n\nSample Output 2\n\n1000\n\nThe price of a ramen topped with all three kinds of toppings is 700 + 100 \\times 3 = 1000 yen.\n\nSample Input 3\n\nxxx\n\nSample Output 3\n\n700\n\nThe price of a ramen without any toppings is 700 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": 169, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s253850990", "group_id": "codeNet:p03370", "input_text": "#include<stdio.h>\nint main(){\nint n,x,i,m,minm=1234567890,r;\nscanf(\"%d%d\",&n,&x);\nr=n;\nfor(i=0;i<n;i++){\nscanf(\"%d\",&m);\nx-=m;\nif(m<minm){minm=m;}\n}\nprintf(\"%d\\n\",r+(x/minm));\nreturn 0;\n}", "language": "C", "metadata": {"date": 1524944959, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "problem_description_relpath": "problem_descriptions/p03370.html", "problem_id": "p03370", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03370/input.txt", "sample_output_relpath": "derived/input_output/data/p03370/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03370/C/s253850990.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s253850990", "user_id": "u721060623"}, "prompt_components": {"gold_output": "9\n", "input_to_evaluate": "#include<stdio.h>\nint main(){\nint n,x,i,m,minm=1234567890,r;\nscanf(\"%d%d\",&n,&x);\nr=n;\nfor(i=0;i<n;i++){\nscanf(\"%d\",&m);\nx-=m;\nif(m<minm){minm=m;}\n}\nprintf(\"%d\\n\",r+(x/minm));\nreturn 0;\n}", "problem_context": "Score : 200 points\n\nProblem Statement\n\nAkaki, a patissier, can make N kinds of doughnut using only a certain powder called \"Okashi no Moto\" (literally \"material of pastry\", simply called Moto below) as ingredient. These doughnuts are called Doughnut 1, Doughnut 2, ..., Doughnut N. In order to make one Doughnut i (1 ≤ i ≤ N), she needs to consume m_i grams of Moto. She cannot make a non-integer number of doughnuts, such as 0.5 doughnuts.\n\nNow, she has X grams of Moto. She decides to make as many doughnuts as possible for a party tonight. However, since the tastes of the guests differ, she will obey the following condition:\n\nFor each of the N kinds of doughnuts, make at least one doughnut of that kind.\n\nAt most how many doughnuts can be made here? She does not necessarily need to consume all of her Moto. Also, under the constraints of this problem, it is always possible to obey the condition.\n\nConstraints\n\n2 ≤ N ≤ 100\n\n1 ≤ m_i ≤ 1000\n\nm_1 + m_2 + ... + m_N ≤ X ≤ 10^5\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN X\nm_1\nm_2\n:\nm_N\n\nOutput\n\nPrint the maximum number of doughnuts that can be made under the condition.\n\nSample Input 1\n\n3 1000\n120\n100\n140\n\nSample Output 1\n\n9\n\nShe has 1000 grams of Moto and can make three kinds of doughnuts. If she makes one doughnut for each of the three kinds, she consumes 120 + 100 + 140 = 360 grams of Moto. From the 640 grams of Moto that remains here, she can make additional six Doughnuts 2. This is how she can made a total of nine doughnuts, which is the maximum.\n\nSample Input 2\n\n4 360\n90\n90\n90\n90\n\nSample Output 2\n\n4\n\nMaking one doughnut for each of the four kinds consumes all of her Moto.\n\nSample Input 3\n\n5 3000\n150\n130\n150\n130\n110\n\nSample Output 3\n\n26", "sample_input": "3 1000\n120\n100\n140\n"}, "reference_outputs": ["9\n"], "source_document_id": "p03370", "source_text": "Score : 200 points\n\nProblem Statement\n\nAkaki, a patissier, can make N kinds of doughnut using only a certain powder called \"Okashi no Moto\" (literally \"material of pastry\", simply called Moto below) as ingredient. These doughnuts are called Doughnut 1, Doughnut 2, ..., Doughnut N. In order to make one Doughnut i (1 ≤ i ≤ N), she needs to consume m_i grams of Moto. She cannot make a non-integer number of doughnuts, such as 0.5 doughnuts.\n\nNow, she has X grams of Moto. She decides to make as many doughnuts as possible for a party tonight. However, since the tastes of the guests differ, she will obey the following condition:\n\nFor each of the N kinds of doughnuts, make at least one doughnut of that kind.\n\nAt most how many doughnuts can be made here? She does not necessarily need to consume all of her Moto. Also, under the constraints of this problem, it is always possible to obey the condition.\n\nConstraints\n\n2 ≤ N ≤ 100\n\n1 ≤ m_i ≤ 1000\n\nm_1 + m_2 + ... + m_N ≤ X ≤ 10^5\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN X\nm_1\nm_2\n:\nm_N\n\nOutput\n\nPrint the maximum number of doughnuts that can be made under the condition.\n\nSample Input 1\n\n3 1000\n120\n100\n140\n\nSample Output 1\n\n9\n\nShe has 1000 grams of Moto and can make three kinds of doughnuts. If she makes one doughnut for each of the three kinds, she consumes 120 + 100 + 140 = 360 grams of Moto. From the 640 grams of Moto that remains here, she can make additional six Doughnuts 2. This is how she can made a total of nine doughnuts, which is the maximum.\n\nSample Input 2\n\n4 360\n90\n90\n90\n90\n\nSample Output 2\n\n4\n\nMaking one doughnut for each of the four kinds consumes all of her Moto.\n\nSample Input 3\n\n5 3000\n150\n130\n150\n130\n110\n\nSample Output 3\n\n26", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 187, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s976244994", "group_id": "codeNet:p03374", "input_text": "#include <stdio.h>\n#define MAX_N 100000\n#define MAXEQ(m, x) m = (x)>m ? (x) : m\n\nlong x[MAX_N];\nlong v[MAX_N];\nlong leftw[MAX_N];\nlong rightw[MAX_N];\n\nint main(void){\n    long n, c;\n    scanf(\"%ld %ld\\n\", &n, &c);\n    long max_cal = 0;\n    {\n        long now_cal = 0;\n        long pos = 0;\n        // left\n        for(long i=0; i<n; i++){\n            scanf(\"%ld %ld\\n\", x+i, v+i);\n            now_cal += v[i] - x[i] + pos;\n            pos = x[i];\n            leftw[i] = now_cal;\n            MAXEQ(max_cal, now_cal);\n        }\n    }\n    {\n        long now_cal = 0;\n        long pos = c;\n        // right\n        for(long i=n-1; i>=0; i--){\n            now_cal += v[i] - pos + x[i];\n            pos = x[i];\n            rightw[i] = now_cal;\n            MAXEQ(max_cal, now_cal);\n        }\n    }\n    for(long i=0; i<n; i++){\n        {\n            long tmax = 0;\n            for(long j=0; j<i; j++){\n                MAXEQ(tmax, leftw[j]);\n            }\n            MAXEQ(max_cal, rightw[i] - c + x[i] + tmax);\n        }\n        {\n            long tmax = 0;\n            for(long j=i+1; j<n; j++){\n                MAXEQ(tmax, rightw[j]);\n            }\n            MAXEQ(max_cal, leftw[i] - x[i] + tmax);\n        }\n    }\n    printf(\"%ld\\n\", max_cal);\n    return 0;\n}\n", "language": "C", "metadata": {"date": 1524364494, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "problem_description_relpath": "problem_descriptions/p03374.html", "problem_id": "p03374", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03374/input.txt", "sample_output_relpath": "derived/input_output/data/p03374/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03374/C/s976244994.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s976244994", "user_id": "u188638030"}, "prompt_components": {"gold_output": "191\n", "input_to_evaluate": "#include <stdio.h>\n#define MAX_N 100000\n#define MAXEQ(m, x) m = (x)>m ? (x) : m\n\nlong x[MAX_N];\nlong v[MAX_N];\nlong leftw[MAX_N];\nlong rightw[MAX_N];\n\nint main(void){\n    long n, c;\n    scanf(\"%ld %ld\\n\", &n, &c);\n    long max_cal = 0;\n    {\n        long now_cal = 0;\n        long pos = 0;\n        // left\n        for(long i=0; i<n; i++){\n            scanf(\"%ld %ld\\n\", x+i, v+i);\n            now_cal += v[i] - x[i] + pos;\n            pos = x[i];\n            leftw[i] = now_cal;\n            MAXEQ(max_cal, now_cal);\n        }\n    }\n    {\n        long now_cal = 0;\n        long pos = c;\n        // right\n        for(long i=n-1; i>=0; i--){\n            now_cal += v[i] - pos + x[i];\n            pos = x[i];\n            rightw[i] = now_cal;\n            MAXEQ(max_cal, now_cal);\n        }\n    }\n    for(long i=0; i<n; i++){\n        {\n            long tmax = 0;\n            for(long j=0; j<i; j++){\n                MAXEQ(tmax, leftw[j]);\n            }\n            MAXEQ(max_cal, rightw[i] - c + x[i] + tmax);\n        }\n        {\n            long tmax = 0;\n            for(long j=i+1; j<n; j++){\n                MAXEQ(tmax, rightw[j]);\n            }\n            MAXEQ(max_cal, leftw[i] - x[i] + tmax);\n        }\n    }\n    printf(\"%ld\\n\", max_cal);\n    return 0;\n}\n", "problem_context": "Score : 500 points\n\nProblem Statement\n\n\"Teishi-zushi\", a Japanese restaurant, is a plain restaurant with only one round counter. The outer circumference of the counter is C meters. Customers cannot go inside the counter.\n\nNakahashi entered Teishi-zushi, and he was guided to the counter. Now, there are N pieces of sushi (vinegared rice with seafood and so on) on the counter. The distance measured clockwise from the point where Nakahashi is standing to the point where the i-th sushi is placed, is x_i meters. Also, the i-th sushi has a nutritive value of v_i kilocalories.\n\nNakahashi can freely walk around the circumference of the counter. When he reach a point where a sushi is placed, he can eat that sushi and take in its nutrition (naturally, the sushi disappears). However, while walking, he consumes 1 kilocalories per meter.\n\nWhenever he is satisfied, he can leave the restaurant from any place (he does not have to return to the initial place). On balance, at most how much nutrition can he take in before he leaves? That is, what is the maximum possible value of the total nutrition taken in minus the total energy consumed? Assume that there are no other customers, and no new sushi will be added to the counter. Also, since Nakahashi has plenty of nutrition in his body, assume that no matter how much he walks and consumes energy, he never dies from hunger.\n\nConstraints\n\n1 ≤ N ≤ 10^5\n\n2 ≤ C ≤ 10^{14}\n\n1 ≤ x_1 < x_2 < ... < x_N < C\n\n1 ≤ v_i ≤ 10^9\n\nAll values in input are integers.\n\nSubscores\n\n300 points will be awarded for passing the test set satisfying N ≤ 100.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN C\nx_1 v_1\nx_2 v_2\n:\nx_N v_N\n\nOutput\n\nIf Nakahashi can take in at most c kilocalories on balance before he leaves the restaurant, print c.\n\nSample Input 1\n\n3 20\n2 80\n9 120\n16 1\n\nSample Output 1\n\n191\n\nThere are three sushi on the counter with a circumference of 20 meters. If he walks two meters clockwise from the initial place, he can eat a sushi of 80 kilocalories. If he walks seven more meters clockwise, he can eat a sushi of 120 kilocalories. If he leaves now, the total nutrition taken in is 200 kilocalories, and the total energy consumed is 9 kilocalories, thus he can take in 191 kilocalories on balance, which is the largest possible value.\n\nSample Input 2\n\n3 20\n2 80\n9 1\n16 120\n\nSample Output 2\n\n192\n\nThe second and third sushi have been swapped. Again, if he walks two meters clockwise from the initial place, he can eat a sushi of 80 kilocalories. If he walks six more meters counterclockwise this time, he can eat a sushi of 120 kilocalories. If he leaves now, the total nutrition taken in is 200 kilocalories, and the total energy consumed is 8 kilocalories, thus he can take in 192 kilocalories on balance, which is the largest possible value.\n\nSample Input 3\n\n1 100000000000000\n50000000000000 1\n\nSample Output 3\n\n0\n\nEven though the only sushi is so far that it does not fit into a 32-bit integer, its nutritive value is low, thus he should immediately leave without doing anything.\n\nSample Input 4\n\n15 10000000000\n400000000 1000000000\n800000000 1000000000\n1900000000 1000000000\n2400000000 1000000000\n2900000000 1000000000\n3300000000 1000000000\n3700000000 1000000000\n3800000000 1000000000\n4000000000 1000000000\n4100000000 1000000000\n5200000000 1000000000\n6600000000 1000000000\n8000000000 1000000000\n9300000000 1000000000\n9700000000 1000000000\n\nSample Output 4\n\n6500000000\n\nAll these sample inputs above are included in the test set for the partial score.", "sample_input": "3 20\n2 80\n9 120\n16 1\n"}, "reference_outputs": ["191\n"], "source_document_id": "p03374", "source_text": "Score : 500 points\n\nProblem Statement\n\n\"Teishi-zushi\", a Japanese restaurant, is a plain restaurant with only one round counter. The outer circumference of the counter is C meters. Customers cannot go inside the counter.\n\nNakahashi entered Teishi-zushi, and he was guided to the counter. Now, there are N pieces of sushi (vinegared rice with seafood and so on) on the counter. The distance measured clockwise from the point where Nakahashi is standing to the point where the i-th sushi is placed, is x_i meters. Also, the i-th sushi has a nutritive value of v_i kilocalories.\n\nNakahashi can freely walk around the circumference of the counter. When he reach a point where a sushi is placed, he can eat that sushi and take in its nutrition (naturally, the sushi disappears). However, while walking, he consumes 1 kilocalories per meter.\n\nWhenever he is satisfied, he can leave the restaurant from any place (he does not have to return to the initial place). On balance, at most how much nutrition can he take in before he leaves? That is, what is the maximum possible value of the total nutrition taken in minus the total energy consumed? Assume that there are no other customers, and no new sushi will be added to the counter. Also, since Nakahashi has plenty of nutrition in his body, assume that no matter how much he walks and consumes energy, he never dies from hunger.\n\nConstraints\n\n1 ≤ N ≤ 10^5\n\n2 ≤ C ≤ 10^{14}\n\n1 ≤ x_1 < x_2 < ... < x_N < C\n\n1 ≤ v_i ≤ 10^9\n\nAll values in input are integers.\n\nSubscores\n\n300 points will be awarded for passing the test set satisfying N ≤ 100.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN C\nx_1 v_1\nx_2 v_2\n:\nx_N v_N\n\nOutput\n\nIf Nakahashi can take in at most c kilocalories on balance before he leaves the restaurant, print c.\n\nSample Input 1\n\n3 20\n2 80\n9 120\n16 1\n\nSample Output 1\n\n191\n\nThere are three sushi on the counter with a circumference of 20 meters. If he walks two meters clockwise from the initial place, he can eat a sushi of 80 kilocalories. If he walks seven more meters clockwise, he can eat a sushi of 120 kilocalories. If he leaves now, the total nutrition taken in is 200 kilocalories, and the total energy consumed is 9 kilocalories, thus he can take in 191 kilocalories on balance, which is the largest possible value.\n\nSample Input 2\n\n3 20\n2 80\n9 1\n16 120\n\nSample Output 2\n\n192\n\nThe second and third sushi have been swapped. Again, if he walks two meters clockwise from the initial place, he can eat a sushi of 80 kilocalories. If he walks six more meters counterclockwise this time, he can eat a sushi of 120 kilocalories. If he leaves now, the total nutrition taken in is 200 kilocalories, and the total energy consumed is 8 kilocalories, thus he can take in 192 kilocalories on balance, which is the largest possible value.\n\nSample Input 3\n\n1 100000000000000\n50000000000000 1\n\nSample Output 3\n\n0\n\nEven though the only sushi is so far that it does not fit into a 32-bit integer, its nutritive value is low, thus he should immediately leave without doing anything.\n\nSample Input 4\n\n15 10000000000\n400000000 1000000000\n800000000 1000000000\n1900000000 1000000000\n2400000000 1000000000\n2900000000 1000000000\n3300000000 1000000000\n3700000000 1000000000\n3800000000 1000000000\n4000000000 1000000000\n4100000000 1000000000\n5200000000 1000000000\n6600000000 1000000000\n8000000000 1000000000\n9300000000 1000000000\n9700000000 1000000000\n\nSample Output 4\n\n6500000000\n\nAll these sample inputs above are included in the test set for the partial score.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1258, "cpu_time_ms": 2103, "memory_kb": 3328}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s442298215", "group_id": "codeNet:p03377", "input_text": "#include <stdio.h>\n#include <stdlib.h>\n\nint main(int argc, char *argv[])\n{\n    int A,B,C,X;\n\n    if (scanf(\"%d %d %d\", &A, &B, &X) < 3)\n    {\n        exit(1);\n    }\n\n    if (1 <= A && A <= 100 && 1 <= B && B <= 100 && 1 <= X && X <= 200)\n    {\n\n        C = A + B;\n\n        if (X < A)\n        {\n            printf(\"NO\\n\");\n        }\n        else\n        {\n            if (X > C)\n            {\n                printf(\"NO\\n\");\n            }\n            else\n            {\n                printf(\"YES\\n\");\n            }\n        }\n    }\n    return 1;\n}", "language": "C", "metadata": {"date": 1532394211, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "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/C/s442298215.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s442298215", "user_id": "u421091367"}, "prompt_components": {"gold_output": "YES\n", "input_to_evaluate": "#include <stdio.h>\n#include <stdlib.h>\n\nint main(int argc, char *argv[])\n{\n    int A,B,C,X;\n\n    if (scanf(\"%d %d %d\", &A, &B, &X) < 3)\n    {\n        exit(1);\n    }\n\n    if (1 <= A && A <= 100 && 1 <= B && B <= 100 && 1 <= X && X <= 200)\n    {\n\n        C = A + B;\n\n        if (X < A)\n        {\n            printf(\"NO\\n\");\n        }\n        else\n        {\n            if (X > C)\n            {\n                printf(\"NO\\n\");\n            }\n            else\n            {\n                printf(\"YES\\n\");\n            }\n        }\n    }\n    return 1;\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": 547, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s594390530", "group_id": "codeNet:p03380", "input_text": "#include <stdio.h>\n#include <stdlib.h>\nint main(void)\n{\nint i;\nint n;\nint max=0;\nint max2=0;\nint a[100001];\nscanf(\"%d\",&n);\nfor(i=0;i<n;i++)\n{\nscanf(\"%d\",&a[i]);\nif(max<a[i])\n{max=a[i];}\n}\nfor(i=0;i<n;i++)\n{\nif(abs(max-max2*2)>abs(max-a[i]*2))\n{max2=a[i];}\n}\nprintf(\"%d\",max);\nprintf(\"%d\",max2);\nreturn 0;}", "language": "C", "metadata": {"date": 1523757314, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "problem_description_relpath": "problem_descriptions/p03380.html", "problem_id": "p03380", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03380/input.txt", "sample_output_relpath": "derived/input_output/data/p03380/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03380/C/s594390530.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s594390530", "user_id": "u942675949"}, "prompt_components": {"gold_output": "11 6\n", "input_to_evaluate": "#include <stdio.h>\n#include <stdlib.h>\nint main(void)\n{\nint i;\nint n;\nint max=0;\nint max2=0;\nint a[100001];\nscanf(\"%d\",&n);\nfor(i=0;i<n;i++)\n{\nscanf(\"%d\",&a[i]);\nif(max<a[i])\n{max=a[i];}\n}\nfor(i=0;i<n;i++)\n{\nif(abs(max-max2*2)>abs(max-a[i]*2))\n{max2=a[i];}\n}\nprintf(\"%d\",max);\nprintf(\"%d\",max2);\nreturn 0;}", "problem_context": "Score : 400 points\n\nProblem Statement\n\nLet {\\rm comb}(n,r) be the number of ways to choose r objects from among n objects, disregarding order.\nFrom n non-negative integers a_1, a_2, ..., a_n, select two numbers a_i > a_j so that {\\rm comb}(a_i,a_j) is maximized.\nIf there are multiple pairs that maximize the value, any of them is accepted.\n\nConstraints\n\n2 \\leq n \\leq 10^5\n\n0 \\leq a_i \\leq 10^9\n\na_1,a_2,...,a_n are pairwise distinct.\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 a_i and a_j that you selected, with a space in between.\n\nSample Input 1\n\n5\n6 9 4 2 11\n\nSample Output 1\n\n11 6\n\n\\rm{comb}(a_i,a_j) for each possible selection is as follows:\n\n\\rm{comb}(4,2)=6\n\n\\rm{comb}(6,2)=15\n\n\\rm{comb}(6,4)=15\n\n\\rm{comb}(9,2)=36\n\n\\rm{comb}(9,4)=126\n\n\\rm{comb}(9,6)=84\n\n\\rm{comb}(11,2)=55\n\n\\rm{comb}(11,4)=330\n\n\\rm{comb}(11,6)=462\n\n\\rm{comb}(11,9)=55\n\nThus, we should print 11 and 6.\n\nSample Input 2\n\n2\n100 0\n\nSample Output 2\n\n100 0", "sample_input": "5\n6 9 4 2 11\n"}, "reference_outputs": ["11 6\n"], "source_document_id": "p03380", "source_text": "Score : 400 points\n\nProblem Statement\n\nLet {\\rm comb}(n,r) be the number of ways to choose r objects from among n objects, disregarding order.\nFrom n non-negative integers a_1, a_2, ..., a_n, select two numbers a_i > a_j so that {\\rm comb}(a_i,a_j) is maximized.\nIf there are multiple pairs that maximize the value, any of them is accepted.\n\nConstraints\n\n2 \\leq n \\leq 10^5\n\n0 \\leq a_i \\leq 10^9\n\na_1,a_2,...,a_n are pairwise distinct.\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 a_i and a_j that you selected, with a space in between.\n\nSample Input 1\n\n5\n6 9 4 2 11\n\nSample Output 1\n\n11 6\n\n\\rm{comb}(a_i,a_j) for each possible selection is as follows:\n\n\\rm{comb}(4,2)=6\n\n\\rm{comb}(6,2)=15\n\n\\rm{comb}(6,4)=15\n\n\\rm{comb}(9,2)=36\n\n\\rm{comb}(9,4)=126\n\n\\rm{comb}(9,6)=84\n\n\\rm{comb}(11,2)=55\n\n\\rm{comb}(11,4)=330\n\n\\rm{comb}(11,6)=462\n\n\\rm{comb}(11,9)=55\n\nThus, we should print 11 and 6.\n\nSample Input 2\n\n2\n100 0\n\nSample Output 2\n\n100 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": 306, "cpu_time_ms": 13, "memory_kb": 512}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s966498477", "group_id": "codeNet:p03385", "input_text": "#include<stdio.h>\n#include<string.h>\nint main()\n{\n    int i,l,j,ck=0;\n    char ch[4],ch1[4]=\"abc\",ch2[4]=\"bac\",ch3[4]=\"cab\",ch4[4]=\"bca\",ch5[4]=\"acb\",ch6[4]=\"cba\";\n    scanf(\"%s\",ch);\n    if(strcmp(ch,ch1)==0 || strcmp(ch,ch2)==0 || strcmp(ch,ch3)==0 || strcmp(ch,ch4)==0 || strcmp(ch,ch5)==0 || strcmp(ch,ch6)==0)\n    {\n        printf(\"Yes\\n\");\n    }\n    else\n        printf(\"No\\n\");\n\n    return 0;\n}", "language": "C", "metadata": {"date": 1537504597, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "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/C/s966498477.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s966498477", "user_id": "u089230684"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "#include<stdio.h>\n#include<string.h>\nint main()\n{\n    int i,l,j,ck=0;\n    char ch[4],ch1[4]=\"abc\",ch2[4]=\"bac\",ch3[4]=\"cab\",ch4[4]=\"bca\",ch5[4]=\"acb\",ch6[4]=\"cba\";\n    scanf(\"%s\",ch);\n    if(strcmp(ch,ch1)==0 || strcmp(ch,ch2)==0 || strcmp(ch,ch3)==0 || strcmp(ch,ch4)==0 || strcmp(ch,ch5)==0 || strcmp(ch,ch6)==0)\n    {\n        printf(\"Yes\\n\");\n    }\n    else\n        printf(\"No\\n\");\n\n    return 0;\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": 401, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s780396588", "group_id": "codeNet:p03386", "input_text": "#include<stdio.h>\nint main()\n{\n\tint i, j;\n\tint t;\n\tint max,z;\n\tscanf(\"%d %d %d\", &i, &j, &t);\n\tmax = j - i + 1;\n\tif (max <= 2 * t)\n\t{\n\t\tfor (z = i; z<= j; z++)\n\t\t{\n\t\t\tprintf(\"%d\", z);\n\t\t\tif (z != j)printf(\"\\n\");\n\t\t}\n\t}\n\telse\n\t{\n\t\tfor (z = i; z < i + t; z++)\n\t\t{\n\t\t\tprintf(\"%d\\n\", z);\n\t\t}\n\t\tfor (z = j-t+1; z <= j; z++)\n\t\t{\n\t\t\tprintf(\"%d\", z);\n\t\t\tif (z != j)printf(\"\\n\");\n\t\t}\n\t}\n\treturn 0;\n}", "language": "C", "metadata": {"date": 1523150647, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "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/C/s780396588.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s780396588", "user_id": "u817436547"}, "prompt_components": {"gold_output": "3\n4\n7\n8\n", "input_to_evaluate": "#include<stdio.h>\nint main()\n{\n\tint i, j;\n\tint t;\n\tint max,z;\n\tscanf(\"%d %d %d\", &i, &j, &t);\n\tmax = j - i + 1;\n\tif (max <= 2 * t)\n\t{\n\t\tfor (z = i; z<= j; z++)\n\t\t{\n\t\t\tprintf(\"%d\", z);\n\t\t\tif (z != j)printf(\"\\n\");\n\t\t}\n\t}\n\telse\n\t{\n\t\tfor (z = i; z < i + t; z++)\n\t\t{\n\t\t\tprintf(\"%d\\n\", z);\n\t\t}\n\t\tfor (z = j-t+1; z <= j; z++)\n\t\t{\n\t\t\tprintf(\"%d\", z);\n\t\t\tif (z != j)printf(\"\\n\");\n\t\t}\n\t}\n\treturn 0;\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": 390, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s055123925", "group_id": "codeNet:p03399", "input_text": "#include<stdio.h>\nint main()\n{\n\tint a,b,c,d,x=0;\n\tscanf(\"%d %d %d %d\",&a,&b,&c,&d);\n if(a<b) x+=a;\n else x+=b;\n if(c<d) x+=c;\n else x+=d;\n printf(\"%d\\n\",x);\n}", "language": "C", "metadata": {"date": 1596055163, "filename_ext": "c", "original_language": "C (GCC 9.2.1)", "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/C/s055123925.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s055123925", "user_id": "u018679195"}, "prompt_components": {"gold_output": "520\n", "input_to_evaluate": "#include<stdio.h>\nint main()\n{\n\tint a,b,c,d,x=0;\n\tscanf(\"%d %d %d %d\",&a,&b,&c,&d);\n if(a<b) x+=a;\n else x+=b;\n if(c<d) x+=c;\n else x+=d;\n printf(\"%d\\n\",x);\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": 158, "cpu_time_ms": 5, "memory_kb": 1728}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s507920328", "group_id": "codeNet:p03407", "input_text": "#include<stdio.h>\nint main(){\n  int a,b,c;\n  scanf(\"%d%d%d\",&a,&b,&c);\n  if(a+b>=c)\n    printf(\"Yes\");\n  else\n    printf(\"No\");\n  return 0;\n}", "language": "C", "metadata": {"date": 1521334933, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "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/C/s507920328.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s507920328", "user_id": "u857484987"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "#include<stdio.h>\nint main(){\n  int a,b,c;\n  scanf(\"%d%d%d\",&a,&b,&c);\n  if(a+b>=c)\n    printf(\"Yes\");\n  else\n    printf(\"No\");\n  return 0;\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": 141, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s799706716", "group_id": "codeNet:p03415", "input_text": "#include <stdio.h>\n\nint main(int argc, char const *argv[])\n{\n\tchar c =0;\n\tchar str[4];\n \tfor(int i = 0;i < 3;i++){\n\tscanf(\"%s\",str);\n\tprintf(\"%c\",str[i]);\n \t}\n\n \tprintf(\"\\n\");\n\treturn 0;\n}", "language": "C", "metadata": {"date": 1520817663, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "problem_description_relpath": "problem_descriptions/p03415.html", "problem_id": "p03415", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03415/input.txt", "sample_output_relpath": "derived/input_output/data/p03415/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03415/C/s799706716.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s799706716", "user_id": "u091659432"}, "prompt_components": {"gold_output": "abc\n", "input_to_evaluate": "#include <stdio.h>\n\nint main(int argc, char const *argv[])\n{\n\tchar c =0;\n\tchar str[4];\n \tfor(int i = 0;i < 3;i++){\n\tscanf(\"%s\",str);\n\tprintf(\"%c\",str[i]);\n \t}\n\n \tprintf(\"\\n\");\n\treturn 0;\n}", "problem_context": "Score : 100 points\n\nProblem Statement\n\nWe have a 3×3 square grid, where each square contains a lowercase English letters.\nThe letter in the square at the i-th row from the top and j-th column from the left is c_{ij}.\n\nPrint the string of length 3 that can be obtained by concatenating the letters in the squares on the diagonal connecting the top-left and bottom-right corner of the grid, from the top-left to bottom-right.\n\nConstraints\n\nInput consists of lowercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nc_{11}c_{12}c_{13}\nc_{21}c_{22}c_{23}\nc_{31}c_{32}c_{33}\n\nOutput\n\nPrint the string of length 3 that can be obtained by concatenating the letters on the diagonal connecting the top-left and bottom-right corner of the grid, from the top-left to bottom-right.\n\nSample Input 1\n\nant\nobe\nrec\n\nSample Output 1\n\nabc\n\nThe letters in the squares on the diagonal connecting the top-left and bottom-right corner of the grid are a, b and c from top-right to bottom-left. Concatenate these letters and print abc.\n\nSample Input 2\n\nedu\ncat\nion\n\nSample Output 2\n\nean", "sample_input": "ant\nobe\nrec\n"}, "reference_outputs": ["abc\n"], "source_document_id": "p03415", "source_text": "Score : 100 points\n\nProblem Statement\n\nWe have a 3×3 square grid, where each square contains a lowercase English letters.\nThe letter in the square at the i-th row from the top and j-th column from the left is c_{ij}.\n\nPrint the string of length 3 that can be obtained by concatenating the letters in the squares on the diagonal connecting the top-left and bottom-right corner of the grid, from the top-left to bottom-right.\n\nConstraints\n\nInput consists of lowercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nc_{11}c_{12}c_{13}\nc_{21}c_{22}c_{23}\nc_{31}c_{32}c_{33}\n\nOutput\n\nPrint the string of length 3 that can be obtained by concatenating the letters on the diagonal connecting the top-left and bottom-right corner of the grid, from the top-left to bottom-right.\n\nSample Input 1\n\nant\nobe\nrec\n\nSample Output 1\n\nabc\n\nThe letters in the squares on the diagonal connecting the top-left and bottom-right corner of the grid are a, b and c from top-right to bottom-left. Concatenate these letters and print abc.\n\nSample Input 2\n\nedu\ncat\nion\n\nSample Output 2\n\nean", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 188, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s802645796", "group_id": "codeNet:p03415", "input_text": "/*\n AtCoder XXX 000\n */\n \n#include <stdio.h>\n\nint main(void){\n  char a,b,c;\n  char out[4];\n  \n  scanf(\"%c%c%c\\n\",&a,&b,&c);\n  out[0]=a;\n  scanf(\"%c%c%c\\n\",&a,&b,&c);\n  out[1]=b;\n  scanf(\"%c%c%c\\n\",&a,&b,&c);\n  out[2]=c;\n  \n  printf(\"%c%c%c\",out[0],out[1],out[2]);\n  return 0;\n}", "language": "C", "metadata": {"date": 1520817166, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "problem_description_relpath": "problem_descriptions/p03415.html", "problem_id": "p03415", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03415/input.txt", "sample_output_relpath": "derived/input_output/data/p03415/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03415/C/s802645796.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s802645796", "user_id": "u565219356"}, "prompt_components": {"gold_output": "abc\n", "input_to_evaluate": "/*\n AtCoder XXX 000\n */\n \n#include <stdio.h>\n\nint main(void){\n  char a,b,c;\n  char out[4];\n  \n  scanf(\"%c%c%c\\n\",&a,&b,&c);\n  out[0]=a;\n  scanf(\"%c%c%c\\n\",&a,&b,&c);\n  out[1]=b;\n  scanf(\"%c%c%c\\n\",&a,&b,&c);\n  out[2]=c;\n  \n  printf(\"%c%c%c\",out[0],out[1],out[2]);\n  return 0;\n}", "problem_context": "Score : 100 points\n\nProblem Statement\n\nWe have a 3×3 square grid, where each square contains a lowercase English letters.\nThe letter in the square at the i-th row from the top and j-th column from the left is c_{ij}.\n\nPrint the string of length 3 that can be obtained by concatenating the letters in the squares on the diagonal connecting the top-left and bottom-right corner of the grid, from the top-left to bottom-right.\n\nConstraints\n\nInput consists of lowercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nc_{11}c_{12}c_{13}\nc_{21}c_{22}c_{23}\nc_{31}c_{32}c_{33}\n\nOutput\n\nPrint the string of length 3 that can be obtained by concatenating the letters on the diagonal connecting the top-left and bottom-right corner of the grid, from the top-left to bottom-right.\n\nSample Input 1\n\nant\nobe\nrec\n\nSample Output 1\n\nabc\n\nThe letters in the squares on the diagonal connecting the top-left and bottom-right corner of the grid are a, b and c from top-right to bottom-left. Concatenate these letters and print abc.\n\nSample Input 2\n\nedu\ncat\nion\n\nSample Output 2\n\nean", "sample_input": "ant\nobe\nrec\n"}, "reference_outputs": ["abc\n"], "source_document_id": "p03415", "source_text": "Score : 100 points\n\nProblem Statement\n\nWe have a 3×3 square grid, where each square contains a lowercase English letters.\nThe letter in the square at the i-th row from the top and j-th column from the left is c_{ij}.\n\nPrint the string of length 3 that can be obtained by concatenating the letters in the squares on the diagonal connecting the top-left and bottom-right corner of the grid, from the top-left to bottom-right.\n\nConstraints\n\nInput consists of lowercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nc_{11}c_{12}c_{13}\nc_{21}c_{22}c_{23}\nc_{31}c_{32}c_{33}\n\nOutput\n\nPrint the string of length 3 that can be obtained by concatenating the letters on the diagonal connecting the top-left and bottom-right corner of the grid, from the top-left to bottom-right.\n\nSample Input 1\n\nant\nobe\nrec\n\nSample Output 1\n\nabc\n\nThe letters in the squares on the diagonal connecting the top-left and bottom-right corner of the grid are a, b and c from top-right to bottom-left. Concatenate these letters and print abc.\n\nSample Input 2\n\nedu\ncat\nion\n\nSample Output 2\n\nean", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s700763475", "group_id": "codeNet:p03416", "input_text": "#include <stdio.h>\n#include <math.h>\n#include <string.h>\n\nint main(void){\n\n\tint in[2]={0};\n\t\n\tchar tmp;\n\tint i,j;\n\tint count=0;\n\tint rev=0,num=0;\n\tscanf(\"%d %d\",&in[0],&in[1]);\n\t//printf(\"%d %d\\n\",in[0],in[1]);\n\t\n\tfor(i=in[0];i<in[1];i++){\n\t\t\n\t\tnum=i;\n\t\trev=0;\n\t\twhile(num>0){\n\t\t\trev=rev*10+num%10;\n\t\t\tnum/=10;\n\t\t}\n\t\t\n\t\tif(i==rev){\n\t\t\tcount++;\n\t\t}\n\t}\n\t\n\tprintf(\"%d\",count);\t\n\t\n\treturn 0;\n}\n", "language": "C", "metadata": {"date": 1586138017, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "problem_description_relpath": "problem_descriptions/p03416.html", "problem_id": "p03416", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03416/input.txt", "sample_output_relpath": "derived/input_output/data/p03416/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03416/C/s700763475.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s700763475", "user_id": "u604256333"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "#include <stdio.h>\n#include <math.h>\n#include <string.h>\n\nint main(void){\n\n\tint in[2]={0};\n\t\n\tchar tmp;\n\tint i,j;\n\tint count=0;\n\tint rev=0,num=0;\n\tscanf(\"%d %d\",&in[0],&in[1]);\n\t//printf(\"%d %d\\n\",in[0],in[1]);\n\t\n\tfor(i=in[0];i<in[1];i++){\n\t\t\n\t\tnum=i;\n\t\trev=0;\n\t\twhile(num>0){\n\t\t\trev=rev*10+num%10;\n\t\t\tnum/=10;\n\t\t}\n\t\t\n\t\tif(i==rev){\n\t\t\tcount++;\n\t\t}\n\t}\n\t\n\tprintf(\"%d\",count);\t\n\t\n\treturn 0;\n}\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nFind the number of palindromic numbers among the integers between A and B (inclusive).\nHere, a palindromic number is a positive integer whose string representation in base 10 (without leading zeros) reads the same forward and backward.\n\nConstraints\n\n10000 \\leq A \\leq B \\leq 99999\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the number of palindromic numbers among the integers between A and B (inclusive).\n\nSample Input 1\n\n11009 11332\n\nSample Output 1\n\n4\n\nThere are four integers that satisfy the conditions: 11011, 11111, 11211 and 11311.\n\nSample Input 2\n\n31415 92653\n\nSample Output 2\n\n612", "sample_input": "11009 11332\n"}, "reference_outputs": ["4\n"], "source_document_id": "p03416", "source_text": "Score : 200 points\n\nProblem Statement\n\nFind the number of palindromic numbers among the integers between A and B (inclusive).\nHere, a palindromic number is a positive integer whose string representation in base 10 (without leading zeros) reads the same forward and backward.\n\nConstraints\n\n10000 \\leq A \\leq B \\leq 99999\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the number of palindromic numbers among the integers between A and B (inclusive).\n\nSample Input 1\n\n11009 11332\n\nSample Output 1\n\n4\n\nThere are four integers that satisfy the conditions: 11011, 11111, 11211 and 11311.\n\nSample Input 2\n\n31415 92653\n\nSample Output 2\n\n612", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 390, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s824990790", "group_id": "codeNet:p03417", "input_text": "#include <stdio.h>\n\nint main(){\n\tlong long int N,M;\n\tscanf(\"%lld%lld\",&N,&M);\n\tif(N==1 && M==1){\n\t\tprintf(\"1\\n\");\n\t}else if(N==1 && M>1){\n\t\tprintf(\"%lld\\n\",M-2);\n\t}else if(N>1 && M==1){\n\t\tprintf(\"%lld\",N-2);\n\t}else{\n\t\tprintf(\"%lld\\n\",(M-2)*(N-2));\n\t}\n\treturn 0;\n}", "language": "C", "metadata": {"date": 1556935645, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "problem_description_relpath": "problem_descriptions/p03417.html", "problem_id": "p03417", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03417/input.txt", "sample_output_relpath": "derived/input_output/data/p03417/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03417/C/s824990790.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s824990790", "user_id": "u325411666"}, "prompt_components": {"gold_output": "0\n", "input_to_evaluate": "#include <stdio.h>\n\nint main(){\n\tlong long int N,M;\n\tscanf(\"%lld%lld\",&N,&M);\n\tif(N==1 && M==1){\n\t\tprintf(\"1\\n\");\n\t}else if(N==1 && M>1){\n\t\tprintf(\"%lld\\n\",M-2);\n\t}else if(N>1 && M==1){\n\t\tprintf(\"%lld\",N-2);\n\t}else{\n\t\tprintf(\"%lld\\n\",(M-2)*(N-2));\n\t}\n\treturn 0;\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": "p03417", "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": 263, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s834664382", "group_id": "codeNet:p03417", "input_text": "#include<stdio.h>\nint main()\n{\n    long long sum,n,m;\n    scanf(\"%lld%lld\",&n,&m);\n    if(n==1)\n    {\n        if(m==1)\n            printf(\"1\\n\");\n        else\n            printf(\"%lld\\n\",m-2);\n    }\n    else if(m==1)\n    {\n        printf(\"%lld\\n\",n-2);\n    }\n    else\n    {\n        sum=n*m;\n        sum-=(n+m-2)*2;\n        printf(\"%lld\\n\",sum);\n    }\n    return 0;\n}\n", "language": "C", "metadata": {"date": 1520986939, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "problem_description_relpath": "problem_descriptions/p03417.html", "problem_id": "p03417", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03417/input.txt", "sample_output_relpath": "derived/input_output/data/p03417/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03417/C/s834664382.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s834664382", "user_id": "u920439603"}, "prompt_components": {"gold_output": "0\n", "input_to_evaluate": "#include<stdio.h>\nint main()\n{\n    long long sum,n,m;\n    scanf(\"%lld%lld\",&n,&m);\n    if(n==1)\n    {\n        if(m==1)\n            printf(\"1\\n\");\n        else\n            printf(\"%lld\\n\",m-2);\n    }\n    else if(m==1)\n    {\n        printf(\"%lld\\n\",n-2);\n    }\n    else\n    {\n        sum=n*m;\n        sum-=(n+m-2)*2;\n        printf(\"%lld\\n\",sum);\n    }\n    return 0;\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": "p03417", "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": 367, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s248189202", "group_id": "codeNet:p03418", "input_text": "#include<stdio.h>\n\nint main(void){\n    int N,K;\n    int count = 0;\n    scanf(\"%d %d\",&N,&K);\n    for(int i=1;i<=N;i++){\n        for(int j=1;j<=N;j++){\n            if(i%j>=K){\n                count ++;\n            }\n        }\n    }\n    printf(\"%d\",count);\n    return 0;\n}", "language": "C", "metadata": {"date": 1520880042, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "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/C/s248189202.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s248189202", "user_id": "u085356325"}, "prompt_components": {"gold_output": "7\n", "input_to_evaluate": "#include<stdio.h>\n\nint main(void){\n    int N,K;\n    int count = 0;\n    scanf(\"%d %d\",&N,&K);\n    for(int i=1;i<=N;i++){\n        for(int j=1;j<=N;j++){\n            if(i%j>=K){\n                count ++;\n            }\n        }\n    }\n    printf(\"%d\",count);\n    return 0;\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": 270, "cpu_time_ms": 2103, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s899467624", "group_id": "codeNet:p03419", "input_text": "#include <stdio.h>\n#include <math.h>\n#include <stdbool.h>\n#include <stdlib.h>\n#include <string.h>\n#include <time.h>\n\nint main(){\n\tlong long int n, m, i, j;\n\tscanf(\"%lld\", &n);\n\tscanf(\"%lld\", &m);\n\tif(n==1 && m==1){\n\t\tprintf(\"%lld\\n\", n*m);\n\t}\n\telse if(n==1 || m==1){\n\t\tprintf(\"%lld\\n\", n*m-2);\n\t}\n\telse {\n\t\tprintf(\"%lld\\n\", (n-2)*(m-2));\n\t}\n\treturn 0;\n}", "language": "C", "metadata": {"date": 1520818155, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "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/C/s899467624.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s899467624", "user_id": "u833393891"}, "prompt_components": {"gold_output": "0\n", "input_to_evaluate": "#include <stdio.h>\n#include <math.h>\n#include <stdbool.h>\n#include <stdlib.h>\n#include <string.h>\n#include <time.h>\n\nint main(){\n\tlong long int n, m, i, j;\n\tscanf(\"%lld\", &n);\n\tscanf(\"%lld\", &m);\n\tif(n==1 && m==1){\n\t\tprintf(\"%lld\\n\", n*m);\n\t}\n\telse if(n==1 || m==1){\n\t\tprintf(\"%lld\\n\", n*m-2);\n\t}\n\telse {\n\t\tprintf(\"%lld\\n\", (n-2)*(m-2));\n\t}\n\treturn 0;\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": 353, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s085909883", "group_id": "codeNet:p03423", "input_text": "#include <stdio.h>\nint main(void){\n   int N;\n   scanf(\"%d\",&N);\n   printf(\"%d\",N/3);\n   return 0;\n}", "language": "C", "metadata": {"date": 1520297705, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "problem_description_relpath": "problem_descriptions/p03423.html", "problem_id": "p03423", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03423/input.txt", "sample_output_relpath": "derived/input_output/data/p03423/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03423/C/s085909883.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s085909883", "user_id": "u398221039"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "#include <stdio.h>\nint main(void){\n   int N;\n   scanf(\"%d\",&N);\n   printf(\"%d\",N/3);\n   return 0;\n}", "problem_context": "Score : 100 points\n\nProblem Statement\n\nThere are N students in a school.\n\nWe will divide these students into some groups, and in each group they will discuss some themes.\n\nYou think that groups consisting of two or less students cannot have an effective discussion, so you want to have as many groups consisting of three or more students as possible.\n\nDivide the students so that the number of groups consisting of three or more students is maximized.\n\nConstraints\n\n1 \\leq N \\leq 1000\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nIf you can form at most x groups consisting of three or more students, print x.\n\nSample Input 1\n\n8\n\nSample Output 1\n\n2\n\nFor example, you can form a group of three students and another of five students.\n\nSample Input 2\n\n2\n\nSample Output 2\n\n0\n\nSometimes you cannot form any group consisting of three or more students, regardless of how you divide the students.\n\nSample Input 3\n\n9\n\nSample Output 3\n\n3", "sample_input": "8\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03423", "source_text": "Score : 100 points\n\nProblem Statement\n\nThere are N students in a school.\n\nWe will divide these students into some groups, and in each group they will discuss some themes.\n\nYou think that groups consisting of two or less students cannot have an effective discussion, so you want to have as many groups consisting of three or more students as possible.\n\nDivide the students so that the number of groups consisting of three or more students is maximized.\n\nConstraints\n\n1 \\leq N \\leq 1000\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nIf you can form at most x groups consisting of three or more students, print x.\n\nSample Input 1\n\n8\n\nSample Output 1\n\n2\n\nFor example, you can form a group of three students and another of five students.\n\nSample Input 2\n\n2\n\nSample Output 2\n\n0\n\nSometimes you cannot form any group consisting of three or more students, regardless of how you divide the students.\n\nSample Input 3\n\n9\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": 99, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s161941688", "group_id": "codeNet:p03424", "input_text": "#include <stdio.h>\n\nint main(void)\n{\n    int n,s[100],i;\n\n    scanf(\"%d\",&n);\n\n    for(i=0;i<n;i++)  scanf(\"%d\",s[i]);\n\n    int flag=0;\n    for(i=0;i<n-1;i++){\n        if(s[i]=='Y'){  \n           flag=1;\n           break;\n        }\n    }  \n\n\n    if(flag==0)    printf(\"Three\\n\");\n    else        printf(\"four\\n\");\n\n    return 0;\n}\n", "language": "C", "metadata": {"date": 1588104220, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "problem_description_relpath": "problem_descriptions/p03424.html", "problem_id": "p03424", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03424/input.txt", "sample_output_relpath": "derived/input_output/data/p03424/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03424/C/s161941688.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s161941688", "user_id": "u152440373"}, "prompt_components": {"gold_output": "Four\n", "input_to_evaluate": "#include <stdio.h>\n\nint main(void)\n{\n    int n,s[100],i;\n\n    scanf(\"%d\",&n);\n\n    for(i=0;i<n;i++)  scanf(\"%d\",s[i]);\n\n    int flag=0;\n    for(i=0;i<n-1;i++){\n        if(s[i]=='Y'){  \n           flag=1;\n           break;\n        }\n    }  \n\n\n    if(flag==0)    printf(\"Three\\n\");\n    else        printf(\"four\\n\");\n\n    return 0;\n}\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nIn Japan, people make offerings called hina arare, colorful crackers, on March 3.\n\nWe have a bag that contains N hina arare. (From here, we call them arare.)\n\nIt is known that the bag either contains arare in three colors: pink, white and green, or contains arare in four colors: pink, white, green and yellow.\n\nWe have taken out the arare in the bag one by one, and the color of the i-th arare was S_i, where colors are represented as follows - pink: P, white: W, green: G, yellow: Y.\n\nIf the number of colors of the arare in the bag was three, print Three; if the number of colors was four, print Four.\n\nConstraints\n\n1 \\leq N \\leq 100\n\nS_i is P, W, G or Y.\n\nThere always exist i, j and k such that S_i=P, S_j=W and S_k=G.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS_1 S_2 ... S_N\n\nOutput\n\nIf the number of colors of the arare in the bag was three, print Three; if the number of colors was four, print Four.\n\nSample Input 1\n\n6\nG W Y P Y W\n\nSample Output 1\n\nFour\n\nThe bag contained arare in four colors, so you should print Four.\n\nSample Input 2\n\n9\nG W W G P W P G G\n\nSample Output 2\n\nThree\n\nThe bag contained arare in three colors, so you should print Three.\n\nSample Input 3\n\n8\nP Y W G Y W Y Y\n\nSample Output 3\n\nFour", "sample_input": "6\nG W Y P Y W\n"}, "reference_outputs": ["Four\n"], "source_document_id": "p03424", "source_text": "Score : 200 points\n\nProblem Statement\n\nIn Japan, people make offerings called hina arare, colorful crackers, on March 3.\n\nWe have a bag that contains N hina arare. (From here, we call them arare.)\n\nIt is known that the bag either contains arare in three colors: pink, white and green, or contains arare in four colors: pink, white, green and yellow.\n\nWe have taken out the arare in the bag one by one, and the color of the i-th arare was S_i, where colors are represented as follows - pink: P, white: W, green: G, yellow: Y.\n\nIf the number of colors of the arare in the bag was three, print Three; if the number of colors was four, print Four.\n\nConstraints\n\n1 \\leq N \\leq 100\n\nS_i is P, W, G or Y.\n\nThere always exist i, j and k such that S_i=P, S_j=W and S_k=G.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS_1 S_2 ... S_N\n\nOutput\n\nIf the number of colors of the arare in the bag was three, print Three; if the number of colors was four, print Four.\n\nSample Input 1\n\n6\nG W Y P Y W\n\nSample Output 1\n\nFour\n\nThe bag contained arare in four colors, so you should print Four.\n\nSample Input 2\n\n9\nG W W G P W P G G\n\nSample Output 2\n\nThree\n\nThe bag contained arare in three colors, so you should print Three.\n\nSample Input 3\n\n8\nP Y W G Y W Y Y\n\nSample Output 3\n\nFour", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 331, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s645037162", "group_id": "codeNet:p03424", "input_text": "#include <stdio.h>\n\nint main(void){\n  int N;\n  scanf(\"%d\",&N);\n  char S;\n  int flag = 0;\n\n  for(int i = 0;i < N;i++){\n    scanf(\"%c\",&S);\n    if(S == 'Y'){\n      flag = 1;\n      break;\n    }\n  }\n\n  if(flag){\n    printf(\"Four\\n\");\n  }else{\n    printf(\"Three\\n\");\n  }\n  return 0;\n}", "language": "C", "metadata": {"date": 1549472346, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "problem_description_relpath": "problem_descriptions/p03424.html", "problem_id": "p03424", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03424/input.txt", "sample_output_relpath": "derived/input_output/data/p03424/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03424/C/s645037162.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s645037162", "user_id": "u812973725"}, "prompt_components": {"gold_output": "Four\n", "input_to_evaluate": "#include <stdio.h>\n\nint main(void){\n  int N;\n  scanf(\"%d\",&N);\n  char S;\n  int flag = 0;\n\n  for(int i = 0;i < N;i++){\n    scanf(\"%c\",&S);\n    if(S == 'Y'){\n      flag = 1;\n      break;\n    }\n  }\n\n  if(flag){\n    printf(\"Four\\n\");\n  }else{\n    printf(\"Three\\n\");\n  }\n  return 0;\n}", "problem_context": "Score : 200 points\n\nProblem Statement\n\nIn Japan, people make offerings called hina arare, colorful crackers, on March 3.\n\nWe have a bag that contains N hina arare. (From here, we call them arare.)\n\nIt is known that the bag either contains arare in three colors: pink, white and green, or contains arare in four colors: pink, white, green and yellow.\n\nWe have taken out the arare in the bag one by one, and the color of the i-th arare was S_i, where colors are represented as follows - pink: P, white: W, green: G, yellow: Y.\n\nIf the number of colors of the arare in the bag was three, print Three; if the number of colors was four, print Four.\n\nConstraints\n\n1 \\leq N \\leq 100\n\nS_i is P, W, G or Y.\n\nThere always exist i, j and k such that S_i=P, S_j=W and S_k=G.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS_1 S_2 ... S_N\n\nOutput\n\nIf the number of colors of the arare in the bag was three, print Three; if the number of colors was four, print Four.\n\nSample Input 1\n\n6\nG W Y P Y W\n\nSample Output 1\n\nFour\n\nThe bag contained arare in four colors, so you should print Four.\n\nSample Input 2\n\n9\nG W W G P W P G G\n\nSample Output 2\n\nThree\n\nThe bag contained arare in three colors, so you should print Three.\n\nSample Input 3\n\n8\nP Y W G Y W Y Y\n\nSample Output 3\n\nFour", "sample_input": "6\nG W Y P Y W\n"}, "reference_outputs": ["Four\n"], "source_document_id": "p03424", "source_text": "Score : 200 points\n\nProblem Statement\n\nIn Japan, people make offerings called hina arare, colorful crackers, on March 3.\n\nWe have a bag that contains N hina arare. (From here, we call them arare.)\n\nIt is known that the bag either contains arare in three colors: pink, white and green, or contains arare in four colors: pink, white, green and yellow.\n\nWe have taken out the arare in the bag one by one, and the color of the i-th arare was S_i, where colors are represented as follows - pink: P, white: W, green: G, yellow: Y.\n\nIf the number of colors of the arare in the bag was three, print Three; if the number of colors was four, print Four.\n\nConstraints\n\n1 \\leq N \\leq 100\n\nS_i is P, W, G or Y.\n\nThere always exist i, j and k such that S_i=P, S_j=W and S_k=G.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS_1 S_2 ... S_N\n\nOutput\n\nIf the number of colors of the arare in the bag was three, print Three; if the number of colors was four, print Four.\n\nSample Input 1\n\n6\nG W Y P Y W\n\nSample Output 1\n\nFour\n\nThe bag contained arare in four colors, so you should print Four.\n\nSample Input 2\n\n9\nG W W G P W P G G\n\nSample Output 2\n\nThree\n\nThe bag contained arare in three colors, so you should print Three.\n\nSample Input 3\n\n8\nP Y W G Y W Y Y\n\nSample Output 3\n\nFour", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 279, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s749645081", "group_id": "codeNet:p03424", "input_text": "#include <stdio.h>\n\nint main(void)\n{\n        int n,i;\n        char s[101];\n\n        scanf(\"%d\\n\",&n);\n\n        scanf(\"%s\",s);\n\n        for (i=1;i<=n;i++){\n                if (s[i]=='Y'){\n                        printf(\"Four\\n\");\n                        return 0;\n                }\n        }\n\n        printf(\"Three\\n\");\n\n        return 0;\n}", "language": "C", "metadata": {"date": 1525194086, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "problem_description_relpath": "problem_descriptions/p03424.html", "problem_id": "p03424", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03424/input.txt", "sample_output_relpath": "derived/input_output/data/p03424/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03424/C/s749645081.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s749645081", "user_id": "u162003826"}, "prompt_components": {"gold_output": "Four\n", "input_to_evaluate": "#include <stdio.h>\n\nint main(void)\n{\n        int n,i;\n        char s[101];\n\n        scanf(\"%d\\n\",&n);\n\n        scanf(\"%s\",s);\n\n        for (i=1;i<=n;i++){\n                if (s[i]=='Y'){\n                        printf(\"Four\\n\");\n                        return 0;\n                }\n        }\n\n        printf(\"Three\\n\");\n\n        return 0;\n}", "problem_context": "Score : 200 points\n\nProblem Statement\n\nIn Japan, people make offerings called hina arare, colorful crackers, on March 3.\n\nWe have a bag that contains N hina arare. (From here, we call them arare.)\n\nIt is known that the bag either contains arare in three colors: pink, white and green, or contains arare in four colors: pink, white, green and yellow.\n\nWe have taken out the arare in the bag one by one, and the color of the i-th arare was S_i, where colors are represented as follows - pink: P, white: W, green: G, yellow: Y.\n\nIf the number of colors of the arare in the bag was three, print Three; if the number of colors was four, print Four.\n\nConstraints\n\n1 \\leq N \\leq 100\n\nS_i is P, W, G or Y.\n\nThere always exist i, j and k such that S_i=P, S_j=W and S_k=G.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS_1 S_2 ... S_N\n\nOutput\n\nIf the number of colors of the arare in the bag was three, print Three; if the number of colors was four, print Four.\n\nSample Input 1\n\n6\nG W Y P Y W\n\nSample Output 1\n\nFour\n\nThe bag contained arare in four colors, so you should print Four.\n\nSample Input 2\n\n9\nG W W G P W P G G\n\nSample Output 2\n\nThree\n\nThe bag contained arare in three colors, so you should print Three.\n\nSample Input 3\n\n8\nP Y W G Y W Y Y\n\nSample Output 3\n\nFour", "sample_input": "6\nG W Y P Y W\n"}, "reference_outputs": ["Four\n"], "source_document_id": "p03424", "source_text": "Score : 200 points\n\nProblem Statement\n\nIn Japan, people make offerings called hina arare, colorful crackers, on March 3.\n\nWe have a bag that contains N hina arare. (From here, we call them arare.)\n\nIt is known that the bag either contains arare in three colors: pink, white and green, or contains arare in four colors: pink, white, green and yellow.\n\nWe have taken out the arare in the bag one by one, and the color of the i-th arare was S_i, where colors are represented as follows - pink: P, white: W, green: G, yellow: Y.\n\nIf the number of colors of the arare in the bag was three, print Three; if the number of colors was four, print Four.\n\nConstraints\n\n1 \\leq N \\leq 100\n\nS_i is P, W, G or Y.\n\nThere always exist i, j and k such that S_i=P, S_j=W and S_k=G.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS_1 S_2 ... S_N\n\nOutput\n\nIf the number of colors of the arare in the bag was three, print Three; if the number of colors was four, print Four.\n\nSample Input 1\n\n6\nG W Y P Y W\n\nSample Output 1\n\nFour\n\nThe bag contained arare in four colors, so you should print Four.\n\nSample Input 2\n\n9\nG W W G P W P G G\n\nSample Output 2\n\nThree\n\nThe bag contained arare in three colors, so you should print Three.\n\nSample Input 3\n\n8\nP Y W G Y W Y Y\n\nSample Output 3\n\nFour", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 339, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s217113910", "group_id": "codeNet:p03426", "input_text": "/*\n AtCoder XXX 000\n */\n \n#include <stdio.h>\n \nint abs(int x){\n\treturn (x>0) ? x : (-x);\n}\n \nint main(void){\n\t\n\tint n;\n\tint width,height,dist;\n\tint x[60000];\n\tint y[60000];\n\tint q;\n\tint l,r;\n\tint i,j,k;\n\tint maryoku;\n\t\n\tscanf(\"%d\",&height);\n\tscanf(\"%d\",&width);\n\tscanf(\"%d\",&dist);\n\t\n\tfor(j=0; j<height; j++) for(i=0; i<width; i++){\n\t\tscanf(\"%d\",&n);\n\t\tx[n] = i;\n\t\ty[n] = j;\n\t}\n\t\n\tscanf(\"%d\",&q);\n\tfor(k=0; k<q; k++){\n\t\tmaryoku=0;\n\t\tscanf(\"%d\",&l);\n\t\tscanf(\"%d\",&r);\n\t\t\n\t\twhile(l < r-dist){\n\t\t\tmaryoku += abs(x[l] - x[l+dist]) + abs(y[l] - y[l+dist]);\n\t\t\tl += dist;\n\t\t}\n\t\t\n\t\tprintf(\"%d\\n\",maryoku);\n\t}\n\t\n\treturn 0;\n}", "language": "C", "metadata": {"date": 1520749249, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "problem_description_relpath": "problem_descriptions/p03426.html", "problem_id": "p03426", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03426/input.txt", "sample_output_relpath": "derived/input_output/data/p03426/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03426/C/s217113910.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s217113910", "user_id": "u565219356"}, "prompt_components": {"gold_output": "5\n", "input_to_evaluate": "/*\n AtCoder XXX 000\n */\n \n#include <stdio.h>\n \nint abs(int x){\n\treturn (x>0) ? x : (-x);\n}\n \nint main(void){\n\t\n\tint n;\n\tint width,height,dist;\n\tint x[60000];\n\tint y[60000];\n\tint q;\n\tint l,r;\n\tint i,j,k;\n\tint maryoku;\n\t\n\tscanf(\"%d\",&height);\n\tscanf(\"%d\",&width);\n\tscanf(\"%d\",&dist);\n\t\n\tfor(j=0; j<height; j++) for(i=0; i<width; i++){\n\t\tscanf(\"%d\",&n);\n\t\tx[n] = i;\n\t\ty[n] = j;\n\t}\n\t\n\tscanf(\"%d\",&q);\n\tfor(k=0; k<q; k++){\n\t\tmaryoku=0;\n\t\tscanf(\"%d\",&l);\n\t\tscanf(\"%d\",&r);\n\t\t\n\t\twhile(l < r-dist){\n\t\t\tmaryoku += abs(x[l] - x[l+dist]) + abs(y[l] - y[l+dist]);\n\t\t\tl += dist;\n\t\t}\n\t\t\n\t\tprintf(\"%d\\n\",maryoku);\n\t}\n\t\n\treturn 0;\n}", "problem_context": "Score : 400 points\n\nProblem Statement\n\nWe have a grid with H rows and W columns. The square at the i-th row and the j-th column will be called Square (i,j).\n\nThe integers from 1 through H×W are written throughout the grid, and the integer written in Square (i,j) is A_{i,j}.\n\nYou, a magical girl, can teleport a piece placed on Square (i,j) to Square (x,y) by consuming |x-i|+|y-j| magic points.\n\nYou now have to take Q practical tests of your ability as a magical girl.\n\nThe i-th test will be conducted as follows:\n\nInitially, a piece is placed on the square where the integer L_i is written.\n\nLet x be the integer written in the square occupied by the piece. Repeatedly move the piece to the square where the integer x+D is written, as long as x is not R_i. The test ends when x=R_i.\n\nHere, it is guaranteed that R_i-L_i is a multiple of D.\n\nFor each test, find the sum of magic points consumed during that test.\n\nConstraints\n\n1 \\leq H,W \\leq 300\n\n1 \\leq D \\leq H×W\n\n1 \\leq A_{i,j} \\leq H×W\n\nA_{i,j} \\neq A_{x,y} ((i,j) \\neq (x,y))\n\n1 \\leq Q \\leq 10^5\n\n1 \\leq L_i \\leq R_i \\leq H×W\n\n(R_i-L_i) is a multiple of D.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W D\nA_{1,1} A_{1,2} ... A_{1,W}\n:\nA_{H,1} A_{H,2} ... A_{H,W}\nQ\nL_1 R_1\n:\nL_Q R_Q\n\nOutput\n\nFor each test, print the sum of magic points consumed during that test.\n\nOutput should be in the order the tests are conducted.\n\nSample Input 1\n\n3 3 2\n1 4 3\n2 5 7\n8 9 6\n1\n4 8\n\nSample Output 1\n\n5\n\n4 is written in Square (1,2).\n\n6 is written in Square (3,3).\n\n8 is written in Square (3,1).\n\nThus, the sum of magic points consumed during the first test is (|3-1|+|3-2|)+(|3-3|+|1-3|)=5.\n\nSample Input 2\n\n4 2 3\n3 7\n1 4\n5 2\n6 8\n2\n2 2\n2 2\n\nSample Output 2\n\n0\n0\n\nNote that there may be a test where the piece is not moved at all, and there may be multiple identical tests.\n\nSample Input 3\n\n5 5 4\n13 25 7 15 17\n16 22 20 2 9\n14 11 12 1 19\n10 6 23 8 18\n3 21 5 24 4\n3\n13 13\n2 10\n13 13\n\nSample Output 3\n\n0\n5\n0", "sample_input": "3 3 2\n1 4 3\n2 5 7\n8 9 6\n1\n4 8\n"}, "reference_outputs": ["5\n"], "source_document_id": "p03426", "source_text": "Score : 400 points\n\nProblem Statement\n\nWe have a grid with H rows and W columns. The square at the i-th row and the j-th column will be called Square (i,j).\n\nThe integers from 1 through H×W are written throughout the grid, and the integer written in Square (i,j) is A_{i,j}.\n\nYou, a magical girl, can teleport a piece placed on Square (i,j) to Square (x,y) by consuming |x-i|+|y-j| magic points.\n\nYou now have to take Q practical tests of your ability as a magical girl.\n\nThe i-th test will be conducted as follows:\n\nInitially, a piece is placed on the square where the integer L_i is written.\n\nLet x be the integer written in the square occupied by the piece. Repeatedly move the piece to the square where the integer x+D is written, as long as x is not R_i. The test ends when x=R_i.\n\nHere, it is guaranteed that R_i-L_i is a multiple of D.\n\nFor each test, find the sum of magic points consumed during that test.\n\nConstraints\n\n1 \\leq H,W \\leq 300\n\n1 \\leq D \\leq H×W\n\n1 \\leq A_{i,j} \\leq H×W\n\nA_{i,j} \\neq A_{x,y} ((i,j) \\neq (x,y))\n\n1 \\leq Q \\leq 10^5\n\n1 \\leq L_i \\leq R_i \\leq H×W\n\n(R_i-L_i) is a multiple of D.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W D\nA_{1,1} A_{1,2} ... A_{1,W}\n:\nA_{H,1} A_{H,2} ... A_{H,W}\nQ\nL_1 R_1\n:\nL_Q R_Q\n\nOutput\n\nFor each test, print the sum of magic points consumed during that test.\n\nOutput should be in the order the tests are conducted.\n\nSample Input 1\n\n3 3 2\n1 4 3\n2 5 7\n8 9 6\n1\n4 8\n\nSample Output 1\n\n5\n\n4 is written in Square (1,2).\n\n6 is written in Square (3,3).\n\n8 is written in Square (3,1).\n\nThus, the sum of magic points consumed during the first test is (|3-1|+|3-2|)+(|3-3|+|1-3|)=5.\n\nSample Input 2\n\n4 2 3\n3 7\n1 4\n5 2\n6 8\n2\n2 2\n2 2\n\nSample Output 2\n\n0\n0\n\nNote that there may be a test where the piece is not moved at all, and there may be multiple identical tests.\n\nSample Input 3\n\n5 5 4\n13 25 7 15 17\n16 22 20 2 9\n14 11 12 1 19\n10 6 23 8 18\n3 21 5 24 4\n3\n13 13\n2 10\n13 13\n\nSample Output 3\n\n0\n5\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": 616, "cpu_time_ms": 97, "memory_kb": 512}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s776092096", "group_id": "codeNet:p03426", "input_text": "#include <stdio.h>\n#include <stdlib.h>\nint h, w, d;\nint xs[90001];\nint ys[90001];\n\nint main() {\n  int q;\n  scanf(\"%d%d%d\", &h, &w, &d);\n  for (int y = 0; y < h; y++) {\n    for (int x = 0; x < w; x++) {\n      int v;\n      scanf(\"%d\", &v);\n      xs[v] = x;\n      ys[v] = y;\n    }\n  }\n  scanf(\"%d\", &q);\n  for (int _ = 0; _ < q; _++) {\n    int l, r;\n    scanf(\"%d%d\", &l, &r);\n    int ans = 0;\n    for (int l0 = l; l0 < r; l0 += d) {\n      int r0 = l0 + d;\n      ans += abs(xs[r0] - xs[l0]) + abs(ys[r0] - ys[l0]);\n    }\n    printf(\"%d\\n\", ans);\n  }\n  return 0;\n}", "language": "C", "metadata": {"date": 1520217129, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "problem_description_relpath": "problem_descriptions/p03426.html", "problem_id": "p03426", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03426/input.txt", "sample_output_relpath": "derived/input_output/data/p03426/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03426/C/s776092096.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s776092096", "user_id": "u237316771"}, "prompt_components": {"gold_output": "5\n", "input_to_evaluate": "#include <stdio.h>\n#include <stdlib.h>\nint h, w, d;\nint xs[90001];\nint ys[90001];\n\nint main() {\n  int q;\n  scanf(\"%d%d%d\", &h, &w, &d);\n  for (int y = 0; y < h; y++) {\n    for (int x = 0; x < w; x++) {\n      int v;\n      scanf(\"%d\", &v);\n      xs[v] = x;\n      ys[v] = y;\n    }\n  }\n  scanf(\"%d\", &q);\n  for (int _ = 0; _ < q; _++) {\n    int l, r;\n    scanf(\"%d%d\", &l, &r);\n    int ans = 0;\n    for (int l0 = l; l0 < r; l0 += d) {\n      int r0 = l0 + d;\n      ans += abs(xs[r0] - xs[l0]) + abs(ys[r0] - ys[l0]);\n    }\n    printf(\"%d\\n\", ans);\n  }\n  return 0;\n}", "problem_context": "Score : 400 points\n\nProblem Statement\n\nWe have a grid with H rows and W columns. The square at the i-th row and the j-th column will be called Square (i,j).\n\nThe integers from 1 through H×W are written throughout the grid, and the integer written in Square (i,j) is A_{i,j}.\n\nYou, a magical girl, can teleport a piece placed on Square (i,j) to Square (x,y) by consuming |x-i|+|y-j| magic points.\n\nYou now have to take Q practical tests of your ability as a magical girl.\n\nThe i-th test will be conducted as follows:\n\nInitially, a piece is placed on the square where the integer L_i is written.\n\nLet x be the integer written in the square occupied by the piece. Repeatedly move the piece to the square where the integer x+D is written, as long as x is not R_i. The test ends when x=R_i.\n\nHere, it is guaranteed that R_i-L_i is a multiple of D.\n\nFor each test, find the sum of magic points consumed during that test.\n\nConstraints\n\n1 \\leq H,W \\leq 300\n\n1 \\leq D \\leq H×W\n\n1 \\leq A_{i,j} \\leq H×W\n\nA_{i,j} \\neq A_{x,y} ((i,j) \\neq (x,y))\n\n1 \\leq Q \\leq 10^5\n\n1 \\leq L_i \\leq R_i \\leq H×W\n\n(R_i-L_i) is a multiple of D.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W D\nA_{1,1} A_{1,2} ... A_{1,W}\n:\nA_{H,1} A_{H,2} ... A_{H,W}\nQ\nL_1 R_1\n:\nL_Q R_Q\n\nOutput\n\nFor each test, print the sum of magic points consumed during that test.\n\nOutput should be in the order the tests are conducted.\n\nSample Input 1\n\n3 3 2\n1 4 3\n2 5 7\n8 9 6\n1\n4 8\n\nSample Output 1\n\n5\n\n4 is written in Square (1,2).\n\n6 is written in Square (3,3).\n\n8 is written in Square (3,1).\n\nThus, the sum of magic points consumed during the first test is (|3-1|+|3-2|)+(|3-3|+|1-3|)=5.\n\nSample Input 2\n\n4 2 3\n3 7\n1 4\n5 2\n6 8\n2\n2 2\n2 2\n\nSample Output 2\n\n0\n0\n\nNote that there may be a test where the piece is not moved at all, and there may be multiple identical tests.\n\nSample Input 3\n\n5 5 4\n13 25 7 15 17\n16 22 20 2 9\n14 11 12 1 19\n10 6 23 8 18\n3 21 5 24 4\n3\n13 13\n2 10\n13 13\n\nSample Output 3\n\n0\n5\n0", "sample_input": "3 3 2\n1 4 3\n2 5 7\n8 9 6\n1\n4 8\n"}, "reference_outputs": ["5\n"], "source_document_id": "p03426", "source_text": "Score : 400 points\n\nProblem Statement\n\nWe have a grid with H rows and W columns. The square at the i-th row and the j-th column will be called Square (i,j).\n\nThe integers from 1 through H×W are written throughout the grid, and the integer written in Square (i,j) is A_{i,j}.\n\nYou, a magical girl, can teleport a piece placed on Square (i,j) to Square (x,y) by consuming |x-i|+|y-j| magic points.\n\nYou now have to take Q practical tests of your ability as a magical girl.\n\nThe i-th test will be conducted as follows:\n\nInitially, a piece is placed on the square where the integer L_i is written.\n\nLet x be the integer written in the square occupied by the piece. Repeatedly move the piece to the square where the integer x+D is written, as long as x is not R_i. The test ends when x=R_i.\n\nHere, it is guaranteed that R_i-L_i is a multiple of D.\n\nFor each test, find the sum of magic points consumed during that test.\n\nConstraints\n\n1 \\leq H,W \\leq 300\n\n1 \\leq D \\leq H×W\n\n1 \\leq A_{i,j} \\leq H×W\n\nA_{i,j} \\neq A_{x,y} ((i,j) \\neq (x,y))\n\n1 \\leq Q \\leq 10^5\n\n1 \\leq L_i \\leq R_i \\leq H×W\n\n(R_i-L_i) is a multiple of D.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W D\nA_{1,1} A_{1,2} ... A_{1,W}\n:\nA_{H,1} A_{H,2} ... A_{H,W}\nQ\nL_1 R_1\n:\nL_Q R_Q\n\nOutput\n\nFor each test, print the sum of magic points consumed during that test.\n\nOutput should be in the order the tests are conducted.\n\nSample Input 1\n\n3 3 2\n1 4 3\n2 5 7\n8 9 6\n1\n4 8\n\nSample Output 1\n\n5\n\n4 is written in Square (1,2).\n\n6 is written in Square (3,3).\n\n8 is written in Square (3,1).\n\nThus, the sum of magic points consumed during the first test is (|3-1|+|3-2|)+(|3-3|+|1-3|)=5.\n\nSample Input 2\n\n4 2 3\n3 7\n1 4\n5 2\n6 8\n2\n2 2\n2 2\n\nSample Output 2\n\n0\n0\n\nNote that there may be a test where the piece is not moved at all, and there may be multiple identical tests.\n\nSample Input 3\n\n5 5 4\n13 25 7 15 17\n16 22 20 2 9\n14 11 12 1 19\n10 6 23 8 18\n3 21 5 24 4\n3\n13 13\n2 10\n13 13\n\nSample Output 3\n\n0\n5\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": 560, "cpu_time_ms": 2103, "memory_kb": 1536}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s278474525", "group_id": "codeNet:p03434", "input_text": "#include<stdint.h>\n#include<stdbool.h>\n#include<limits.h>\n#include<inttypes.h>\n#include<stdio.h>\n#include<string.h>\n#include<stdlib.h>\n#include<math.h>\n#include<stdint.h>\n#include<stdbool.h>\n\nint compare(const void * a, const void * b){\n\treturn *(int *)b - *(int *)a;\n}\nint main(){\n  int n;\n  scanf(\"%d\\n\", &n);\n  int *a = (int *)calloc(n, sizeof(int));\n  char buff[400] = {0};\n  fgets(buff, 401, stdin);\n  a[0] = atoi(strtok(buff, \" \"));\n  for(int i =1; i < n; ++i)\n\t  a[i] = atoi(strtok(NULL, \" \"));\n  qsort(a, n, sizeof(int),compare);\n  int alice=0;int bob=0;\n  for(int i = 0; i< n; ++i){\n\t  if(i%2)\n\t\t  bob += a[i];\n\t  else\n\t\t  alice += a[i];\n  }\n  printf(\"%d\", alice - bob);\n  free(a);\n  return 0;\n}\n", "language": "C", "metadata": {"date": 1591226492, "filename_ext": "c", "original_language": "C (Clang 3.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/C/s278474525.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s278474525", "user_id": "u510994418"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "#include<stdint.h>\n#include<stdbool.h>\n#include<limits.h>\n#include<inttypes.h>\n#include<stdio.h>\n#include<string.h>\n#include<stdlib.h>\n#include<math.h>\n#include<stdint.h>\n#include<stdbool.h>\n\nint compare(const void * a, const void * b){\n\treturn *(int *)b - *(int *)a;\n}\nint main(){\n  int n;\n  scanf(\"%d\\n\", &n);\n  int *a = (int *)calloc(n, sizeof(int));\n  char buff[400] = {0};\n  fgets(buff, 401, stdin);\n  a[0] = atoi(strtok(buff, \" \"));\n  for(int i =1; i < n; ++i)\n\t  a[i] = atoi(strtok(NULL, \" \"));\n  qsort(a, n, sizeof(int),compare);\n  int alice=0;int bob=0;\n  for(int i = 0; i< n; ++i){\n\t  if(i%2)\n\t\t  bob += a[i];\n\t  else\n\t\t  alice += a[i];\n  }\n  printf(\"%d\", alice - bob);\n  free(a);\n  return 0;\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": 705, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s639823520", "group_id": "codeNet:p03438", "input_text": "#include <stdio.h>\n#include <stdlib.h>\n\nint main() {\n\tint n;\n\tint a[10240], b[10240];\n\tint i, j, t, d;\n\tscanf(\"%d\", &n);\n\n\tfor (i = 0; i < n; i ++) {\n\t\tscanf(\"%d \", &a[i]);\n\t}\n\n\tfor (i = 0; i < n; i ++) {\n\t\tscanf(\"%d \", &b[i]);\n\t}\n\n\tfor (i = 0; i < n-1; i++) {\n\t\tfor (j = n-1; j > i; j --) {\n\t\t\tif (a[j-1] < a[j]) {\n\t\t\t\tt = a[j-1];\n\t\t\t\ta[j-1] = a[j];\n\t\t\t\ta[j] = t;\n\t\t\t}\n\t\t}\n\t}\n\n\tfor (i = 0; i < n-1; i++) {\n\t\tfor (j = n-1; j > i; j --) {\n\t\t\tif (b[j-1] < b[j]) {\n\t\t\t\tt = b[j-1];\n\t\t\t\tb[j-1] = b[j];\n\t\t\t\tb[j] = t;\n\t\t\t}\n\t\t}\n\t}\n\n\tfor (i = n; i > 0; i --) {\n\t\tif (a[i] > b[i]) {\n\t\t\tif (b[i-1] - a[i-1] > (a[i] - b[i]) * 2) {\n\t\t\t\tt = a[i] - b[i];\n\t\t\t\tb[i] += t;\n\t\t\t\ta[i-1] += t * 2;\n\t\t\t}\n\t\t}\n\t}\n\td = 1;\n\tfor (i = 0; i < n; i ++) {\n\t\tif (a[i] > b[i]) {\n\t\t\td = 0;\n\t\t}\n\t}\n\n\tprintf (\"%s\", (d==1 ? \"Yes\" : \"No\"));\n\n\t/*\n\tprintf(\"%d\\n\", n);\n\tfor (i = 0; i < n; i ++) {\n\t\tprintf(\"%d \", a[i]);\n\t}\n\tprintf(\"\\n\", a[i]);\n\tfor (i = 0; i < n; i ++) {\n\t\tprintf(\"%d \", b[i]);\n\t}\n\tprintf(\"\\n\", a[i]);\n\t*/\n\treturn 0;\n}\n", "language": "C", "metadata": {"date": 1533588680, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "problem_description_relpath": "problem_descriptions/p03438.html", "problem_id": "p03438", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03438/input.txt", "sample_output_relpath": "derived/input_output/data/p03438/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03438/C/s639823520.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s639823520", "user_id": "u570891521"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "#include <stdio.h>\n#include <stdlib.h>\n\nint main() {\n\tint n;\n\tint a[10240], b[10240];\n\tint i, j, t, d;\n\tscanf(\"%d\", &n);\n\n\tfor (i = 0; i < n; i ++) {\n\t\tscanf(\"%d \", &a[i]);\n\t}\n\n\tfor (i = 0; i < n; i ++) {\n\t\tscanf(\"%d \", &b[i]);\n\t}\n\n\tfor (i = 0; i < n-1; i++) {\n\t\tfor (j = n-1; j > i; j --) {\n\t\t\tif (a[j-1] < a[j]) {\n\t\t\t\tt = a[j-1];\n\t\t\t\ta[j-1] = a[j];\n\t\t\t\ta[j] = t;\n\t\t\t}\n\t\t}\n\t}\n\n\tfor (i = 0; i < n-1; i++) {\n\t\tfor (j = n-1; j > i; j --) {\n\t\t\tif (b[j-1] < b[j]) {\n\t\t\t\tt = b[j-1];\n\t\t\t\tb[j-1] = b[j];\n\t\t\t\tb[j] = t;\n\t\t\t}\n\t\t}\n\t}\n\n\tfor (i = n; i > 0; i --) {\n\t\tif (a[i] > b[i]) {\n\t\t\tif (b[i-1] - a[i-1] > (a[i] - b[i]) * 2) {\n\t\t\t\tt = a[i] - b[i];\n\t\t\t\tb[i] += t;\n\t\t\t\ta[i-1] += t * 2;\n\t\t\t}\n\t\t}\n\t}\n\td = 1;\n\tfor (i = 0; i < n; i ++) {\n\t\tif (a[i] > b[i]) {\n\t\t\td = 0;\n\t\t}\n\t}\n\n\tprintf (\"%s\", (d==1 ? \"Yes\" : \"No\"));\n\n\t/*\n\tprintf(\"%d\\n\", n);\n\tfor (i = 0; i < n; i ++) {\n\t\tprintf(\"%d \", a[i]);\n\t}\n\tprintf(\"\\n\", a[i]);\n\tfor (i = 0; i < n; i ++) {\n\t\tprintf(\"%d \", b[i]);\n\t}\n\tprintf(\"\\n\", a[i]);\n\t*/\n\treturn 0;\n}\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nYou are given two integer sequences of length N: a_1,a_2,..,a_N and b_1,b_2,..,b_N.\nDetermine if we can repeat the following operation zero or more times so that the sequences a and b become equal.\n\nOperation: Choose two integers i and j (possibly the same) between 1 and N (inclusive), then perform the following two actions simultaneously:\n\nAdd 2 to a_i.\n\nAdd 1 to b_j.\n\nConstraints\n\n1 ≤ N ≤ 10 000\n\n0 ≤ a_i,b_i ≤ 10^9 (1 ≤ i ≤ 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_2 .. a_N\nb_1 b_2 .. b_N\n\nOutput\n\nIf we can repeat the operation zero or more times so that the sequences a and b become equal, print Yes; otherwise, print No.\n\nSample Input 1\n\n3\n1 2 3\n5 2 2\n\nSample Output 1\n\nYes\n\nFor example, we can perform three operations as follows to do our job:\n\nFirst operation: i=1 and j=2. Now we have a = \\{3,2,3\\}, b = \\{5,3,2\\}.\n\nSecond operation: i=1 and j=2. Now we have a = \\{5,2,3\\}, b = \\{5,4,2\\}.\n\nThird operation: i=2 and j=3. Now we have a = \\{5,4,3\\}, b = \\{5,4,3\\}.\n\nSample Input 2\n\n5\n3 1 4 1 5\n2 7 1 8 2\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n5\n2 7 1 8 2\n3 1 4 1 5\n\nSample Output 3\n\nNo", "sample_input": "3\n1 2 3\n5 2 2\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p03438", "source_text": "Score : 300 points\n\nProblem Statement\n\nYou are given two integer sequences of length N: a_1,a_2,..,a_N and b_1,b_2,..,b_N.\nDetermine if we can repeat the following operation zero or more times so that the sequences a and b become equal.\n\nOperation: Choose two integers i and j (possibly the same) between 1 and N (inclusive), then perform the following two actions simultaneously:\n\nAdd 2 to a_i.\n\nAdd 1 to b_j.\n\nConstraints\n\n1 ≤ N ≤ 10 000\n\n0 ≤ a_i,b_i ≤ 10^9 (1 ≤ i ≤ 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_2 .. a_N\nb_1 b_2 .. b_N\n\nOutput\n\nIf we can repeat the operation zero or more times so that the sequences a and b become equal, print Yes; otherwise, print No.\n\nSample Input 1\n\n3\n1 2 3\n5 2 2\n\nSample Output 1\n\nYes\n\nFor example, we can perform three operations as follows to do our job:\n\nFirst operation: i=1 and j=2. Now we have a = \\{3,2,3\\}, b = \\{5,3,2\\}.\n\nSecond operation: i=1 and j=2. Now we have a = \\{5,2,3\\}, b = \\{5,4,2\\}.\n\nThird operation: i=2 and j=3. Now we have a = \\{5,4,3\\}, b = \\{5,4,3\\}.\n\nSample Input 2\n\n5\n3 1 4 1 5\n2 7 1 8 2\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n5\n2 7 1 8 2\n3 1 4 1 5\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": 994, "cpu_time_ms": 290, "memory_kb": 256}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s176297722", "group_id": "codeNet:p03449", "input_text": "#include<stdio.h>\nint main()\n{\n\tint N,A[2][101],sum[101],max;\n\tint i,j,k;\n\t\n\t//// Scan\n\tscanf(\"%d\",&N);\n\tfor (i=1;i<=N;i++){scanf(\"%d\",&A[0][i]);}\n\tfor (i=1;i<=N;i++){scanf(\"%d\",&A[1][i]);}\n\t\n\t\n\t\n\t\n\t/// the initial sum is the \"L\" shaped path:\n\tsum[1]=A[0][1];\n\tfor (i=1;i<=N;i++){sum[1]+=A[1][i];}\n\tmax=sum[1];\n\t\n\t\n\t//// the other sums are modification of the previous one:\n\tfor (j=2;j<=N;j++){sum[j]=sum[j-1]+A[0][j]-A[1][j-1];\n\t\tif(max<sum[j]) max=sum[j]; else ;\n\t}\n\t\n\t\n\t//////// answer\n\tprintf(\"%d\",max);\n\t\n\treturn 0;\n}\n\n", "language": "C", "metadata": {"date": 1544420955, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "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/C/s176297722.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s176297722", "user_id": "u587770239"}, "prompt_components": {"gold_output": "14\n", "input_to_evaluate": "#include<stdio.h>\nint main()\n{\n\tint N,A[2][101],sum[101],max;\n\tint i,j,k;\n\t\n\t//// Scan\n\tscanf(\"%d\",&N);\n\tfor (i=1;i<=N;i++){scanf(\"%d\",&A[0][i]);}\n\tfor (i=1;i<=N;i++){scanf(\"%d\",&A[1][i]);}\n\t\n\t\n\t\n\t\n\t/// the initial sum is the \"L\" shaped path:\n\tsum[1]=A[0][1];\n\tfor (i=1;i<=N;i++){sum[1]+=A[1][i];}\n\tmax=sum[1];\n\t\n\t\n\t//// the other sums are modification of the previous one:\n\tfor (j=2;j<=N;j++){sum[j]=sum[j-1]+A[0][j]-A[1][j-1];\n\t\tif(max<sum[j]) max=sum[j]; else ;\n\t}\n\t\n\t\n\t//////// answer\n\tprintf(\"%d\",max);\n\t\n\treturn 0;\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": 524, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s297500834", "group_id": "codeNet:p03452", "input_text": "#include <stdio.h>\nint main(void)\n{\n    long int n,m;\n    scanf(\"%ld %ld\",&n,&m);\n    long int l[200005]={};\n    long int r[200005]={};\n    long int d[200005]={};\n    for(int p=0;p<m;p++)scanf(\"%ld %ld %d\",&l[p],&r[p],&d[p]);\n    long int gr[100005]={0};\n    long long int pl[100005]={};\n    long int rer[100005]={114514};\n    long int rel[100005]={114514};\n    long int c=0;\n    long long int x=0;\n    for(int q=0;q<m;q++)\n    {\n        rer[l[q]]=r[q];\n        rel[r[q]]=l[q];\n        if(gr[l[q]]==gr[r[q]] && gr[r[q]]!=0)\n        {\n            if(pl[r[q]]-pl[l[q]]!=d[q])\n            {\n                printf(\"No\");\n                return 0;\n            }\n        }\n        else if(gr[l[q]]!=0 && gr[r[q]]!=0)\n        {\n            gr[r[q]]=gr[l[q]];\n            long int len=pl[l[q]]+d[q]-pl[r[q]];\n            x=r[q];\n            while(x!=114514)\n            {\n                gr[x]=gr[l[q]];\n                pl[x]=pl[x]+len;\n                x=rer[x];\n            }\n            x=r[q];\n            while(x!=114514)\n            {\n                gr[x]=gr[l[q]];\n                pl[x]=pl[x]+len;\n                x=rel[x];\n            }\n        }\n        else if(gr[l[q]]!=0)\n        {\n            gr[r[q]]=gr[l[q]];\n            pl[r[q]]=pl[l[q]]+d[q];\n        }\n        else if(gr[r[q]]!=0)\n        {\n            gr[l[q]]=gr[r[q]];\n            pl[l[q]]=pl[r[q]]-d[q];\n        }\n        else\n        {\n            pl[l[q]]=0;\n            pl[r[q]]=d[q];\n            c++;\n            gr[l[q]]=c;\n            gr[r[q]]=c;\n        }\n    }\n    long long int max=pl[0];\n    long long int min=pl[0];\n    for(int ppp=0;ppp<n;ppp++)\n    {\n        if(max<pl[ppp])max=pl[ppp];\n        if(min>pl[ppp])min=pl[ppp];\n    }\n    if(max-min>1000000000)\n    {\n        printf(\"No\");\n        return 0;\n    }\n    printf(\"Yes\");\n}\n", "language": "C", "metadata": {"date": 1517196645, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "problem_description_relpath": "problem_descriptions/p03452.html", "problem_id": "p03452", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03452/input.txt", "sample_output_relpath": "derived/input_output/data/p03452/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03452/C/s297500834.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s297500834", "user_id": "u092002408"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "#include <stdio.h>\nint main(void)\n{\n    long int n,m;\n    scanf(\"%ld %ld\",&n,&m);\n    long int l[200005]={};\n    long int r[200005]={};\n    long int d[200005]={};\n    for(int p=0;p<m;p++)scanf(\"%ld %ld %d\",&l[p],&r[p],&d[p]);\n    long int gr[100005]={0};\n    long long int pl[100005]={};\n    long int rer[100005]={114514};\n    long int rel[100005]={114514};\n    long int c=0;\n    long long int x=0;\n    for(int q=0;q<m;q++)\n    {\n        rer[l[q]]=r[q];\n        rel[r[q]]=l[q];\n        if(gr[l[q]]==gr[r[q]] && gr[r[q]]!=0)\n        {\n            if(pl[r[q]]-pl[l[q]]!=d[q])\n            {\n                printf(\"No\");\n                return 0;\n            }\n        }\n        else if(gr[l[q]]!=0 && gr[r[q]]!=0)\n        {\n            gr[r[q]]=gr[l[q]];\n            long int len=pl[l[q]]+d[q]-pl[r[q]];\n            x=r[q];\n            while(x!=114514)\n            {\n                gr[x]=gr[l[q]];\n                pl[x]=pl[x]+len;\n                x=rer[x];\n            }\n            x=r[q];\n            while(x!=114514)\n            {\n                gr[x]=gr[l[q]];\n                pl[x]=pl[x]+len;\n                x=rel[x];\n            }\n        }\n        else if(gr[l[q]]!=0)\n        {\n            gr[r[q]]=gr[l[q]];\n            pl[r[q]]=pl[l[q]]+d[q];\n        }\n        else if(gr[r[q]]!=0)\n        {\n            gr[l[q]]=gr[r[q]];\n            pl[l[q]]=pl[r[q]]-d[q];\n        }\n        else\n        {\n            pl[l[q]]=0;\n            pl[r[q]]=d[q];\n            c++;\n            gr[l[q]]=c;\n            gr[r[q]]=c;\n        }\n    }\n    long long int max=pl[0];\n    long long int min=pl[0];\n    for(int ppp=0;ppp<n;ppp++)\n    {\n        if(max<pl[ppp])max=pl[ppp];\n        if(min>pl[ppp])min=pl[ppp];\n    }\n    if(max-min>1000000000)\n    {\n        printf(\"No\");\n        return 0;\n    }\n    printf(\"Yes\");\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": "p03452", "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": 1808, "cpu_time_ms": 54, "memory_kb": 7936}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s680241544", "group_id": "codeNet:p03456", "input_text": "#include <stdio.h>\n#include <string.h>\n#include <math.h>\nint main(void){\n\n    char a[7],b[4];\n    double n=0,k;\n\n    scanf(\"%s%s\",a,b);\n    strcat(a,b);\n\n    for(int i=0;i<strlen(a);i++){\n        n+=(a[i]-'0')*(pow(10,strlen(a)-i-1));\n    }\n    k=round(sqrt(n));\n    \n    if(n==k*k) printf(\"Yes\\n\");\n    else printf(\"No\\n\");\n\n    return 0;\n}", "language": "C", "metadata": {"date": 1597737618, "filename_ext": "c", "original_language": "C (GCC 9.2.1)", "problem_description_relpath": "problem_descriptions/p03456.html", "problem_id": "p03456", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03456/input.txt", "sample_output_relpath": "derived/input_output/data/p03456/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03456/C/s680241544.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s680241544", "user_id": "u994745046"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "#include <stdio.h>\n#include <string.h>\n#include <math.h>\nint main(void){\n\n    char a[7],b[4];\n    double n=0,k;\n\n    scanf(\"%s%s\",a,b);\n    strcat(a,b);\n\n    for(int i=0;i<strlen(a);i++){\n        n+=(a[i]-'0')*(pow(10,strlen(a)-i-1));\n    }\n    k=round(sqrt(n));\n    \n    if(n==k*k) printf(\"Yes\\n\");\n    else printf(\"No\\n\");\n\n    return 0;\n}", "problem_context": "Score : 200 points\n\nProblem Statement\n\nAtCoDeer the deer has found two positive integers, a and b.\nDetermine whether the concatenation of a and b in this order is a square number.\n\nConstraints\n\n1 ≤ a,b ≤ 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\nIf the concatenation of a and b in this order is a square number, print Yes; otherwise, print No.\n\nSample Input 1\n\n1 21\n\nSample Output 1\n\nYes\n\nAs 121 = 11 × 11, it is a square number.\n\nSample Input 2\n\n100 100\n\nSample Output 2\n\nNo\n\n100100 is not a square number.\n\nSample Input 3\n\n12 10\n\nSample Output 3\n\nNo", "sample_input": "1 21\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p03456", "source_text": "Score : 200 points\n\nProblem Statement\n\nAtCoDeer the deer has found two positive integers, a and b.\nDetermine whether the concatenation of a and b in this order is a square number.\n\nConstraints\n\n1 ≤ a,b ≤ 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\nIf the concatenation of a and b in this order is a square number, print Yes; otherwise, print No.\n\nSample Input 1\n\n1 21\n\nSample Output 1\n\nYes\n\nAs 121 = 11 × 11, it is a square number.\n\nSample Input 2\n\n100 100\n\nSample Output 2\n\nNo\n\n100100 is not a square number.\n\nSample Input 3\n\n12 10\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": 341, "cpu_time_ms": 4, "memory_kb": 2468}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s092774950", "group_id": "codeNet:p03456", "input_text": "#include<stdio.h>\n#include<string.h>\nint main(void) {\n\tint a, b,c,i;\n\tchar A[4] = {\"No\"};\n\n\tscanf(\"%d %d\", &a, &b);\n\n\tif (b >= 10) {\n\t\tc = a * 100 + b;\n\t}\n\telse {\n\tc = a * 10 + b; \n\t}\n\n\tfor (i = 1; i < c; i++) {\n\t\tif (c%i == 0) {\n\t\t\tif (c / i == i) {\n\t\t\t\tstrcpy(A, \"Yes\");\n\t\t\t}\n\t\t}\n\t}\n\n\tprintf(\"%s\", A);\n\treturn 0;\n}", "language": "C", "metadata": {"date": 1554676235, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "problem_description_relpath": "problem_descriptions/p03456.html", "problem_id": "p03456", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03456/input.txt", "sample_output_relpath": "derived/input_output/data/p03456/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03456/C/s092774950.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s092774950", "user_id": "u355495315"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "#include<stdio.h>\n#include<string.h>\nint main(void) {\n\tint a, b,c,i;\n\tchar A[4] = {\"No\"};\n\n\tscanf(\"%d %d\", &a, &b);\n\n\tif (b >= 10) {\n\t\tc = a * 100 + b;\n\t}\n\telse {\n\tc = a * 10 + b; \n\t}\n\n\tfor (i = 1; i < c; i++) {\n\t\tif (c%i == 0) {\n\t\t\tif (c / i == i) {\n\t\t\t\tstrcpy(A, \"Yes\");\n\t\t\t}\n\t\t}\n\t}\n\n\tprintf(\"%s\", A);\n\treturn 0;\n}", "problem_context": "Score : 200 points\n\nProblem Statement\n\nAtCoDeer the deer has found two positive integers, a and b.\nDetermine whether the concatenation of a and b in this order is a square number.\n\nConstraints\n\n1 ≤ a,b ≤ 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\nIf the concatenation of a and b in this order is a square number, print Yes; otherwise, print No.\n\nSample Input 1\n\n1 21\n\nSample Output 1\n\nYes\n\nAs 121 = 11 × 11, it is a square number.\n\nSample Input 2\n\n100 100\n\nSample Output 2\n\nNo\n\n100100 is not a square number.\n\nSample Input 3\n\n12 10\n\nSample Output 3\n\nNo", "sample_input": "1 21\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p03456", "source_text": "Score : 200 points\n\nProblem Statement\n\nAtCoDeer the deer has found two positive integers, a and b.\nDetermine whether the concatenation of a and b in this order is a square number.\n\nConstraints\n\n1 ≤ a,b ≤ 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\nIf the concatenation of a and b in this order is a square number, print Yes; otherwise, print No.\n\nSample Input 1\n\n1 21\n\nSample Output 1\n\nYes\n\nAs 121 = 11 × 11, it is a square number.\n\nSample Input 2\n\n100 100\n\nSample Output 2\n\nNo\n\n100100 is not a square number.\n\nSample Input 3\n\n12 10\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": 316, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s112304183", "group_id": "codeNet:p03456", "input_text": "#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\nint main()\n{\n    int a,b,c,n = 1,d = 1;\n    scanf(\"%d%d\",&a,&b);\n    c = b;\n    while(b!=0){\n        n *= 10;\n        b /= 10;\n    }\n    c = c + a * n;\n    d = (int)sqrt((double)c);\n    if(c == d*d)\n        printf(\"Yes\\n\");\n    else\n        printf(\"No\\n\");\n    return 0;\n}\n", "language": "C", "metadata": {"date": 1517522772, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "problem_description_relpath": "problem_descriptions/p03456.html", "problem_id": "p03456", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03456/input.txt", "sample_output_relpath": "derived/input_output/data/p03456/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03456/C/s112304183.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s112304183", "user_id": "u018679195"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\nint main()\n{\n    int a,b,c,n = 1,d = 1;\n    scanf(\"%d%d\",&a,&b);\n    c = b;\n    while(b!=0){\n        n *= 10;\n        b /= 10;\n    }\n    c = c + a * n;\n    d = (int)sqrt((double)c);\n    if(c == d*d)\n        printf(\"Yes\\n\");\n    else\n        printf(\"No\\n\");\n    return 0;\n}\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nAtCoDeer the deer has found two positive integers, a and b.\nDetermine whether the concatenation of a and b in this order is a square number.\n\nConstraints\n\n1 ≤ a,b ≤ 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\nIf the concatenation of a and b in this order is a square number, print Yes; otherwise, print No.\n\nSample Input 1\n\n1 21\n\nSample Output 1\n\nYes\n\nAs 121 = 11 × 11, it is a square number.\n\nSample Input 2\n\n100 100\n\nSample Output 2\n\nNo\n\n100100 is not a square number.\n\nSample Input 3\n\n12 10\n\nSample Output 3\n\nNo", "sample_input": "1 21\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p03456", "source_text": "Score : 200 points\n\nProblem Statement\n\nAtCoDeer the deer has found two positive integers, a and b.\nDetermine whether the concatenation of a and b in this order is a square number.\n\nConstraints\n\n1 ≤ a,b ≤ 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\nIf the concatenation of a and b in this order is a square number, print Yes; otherwise, print No.\n\nSample Input 1\n\n1 21\n\nSample Output 1\n\nYes\n\nAs 121 = 11 × 11, it is a square number.\n\nSample Input 2\n\n100 100\n\nSample Output 2\n\nNo\n\n100100 is not a square number.\n\nSample Input 3\n\n12 10\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": 330, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s979336320", "group_id": "codeNet:p03457", "input_text": "#include <stdio.h>\n#include <stdlib.h>\n\nint main(){\n  long int n;\n  int check = 0;\n  scanf(\"%ld\",&n);\n  long int x[n+1],y[n+1],t[n+1];\n  x[0]=0;\n  y[0]=0;\n  t[0]=0;\n  for(int i=1;i<=n;++i){\n    scanf(\"%ld %ld %ld\",&t[i],&x[i],&y[i]);\n    long int del_t=t[i]-t[i-1];\n    long int del_x=labs(x[i]-x[i-1]);\n    long int del_y=labs(y[i]-y[i-1]);\n    if(del_t+del_x+del_y % 2 == 1){\n      check = 1;\n      break;\n    }else if(del_t<del_x+del_y){\n      check = 1;\n      break;\n    }\n  }\n  if(check == 0) printf(\"Yes\");\n  else printf(\"No\");\n  return 0;\n}", "language": "C", "metadata": {"date": 1550733924, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "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/C/s979336320.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s979336320", "user_id": "u245851904"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "#include <stdio.h>\n#include <stdlib.h>\n\nint main(){\n  long int n;\n  int check = 0;\n  scanf(\"%ld\",&n);\n  long int x[n+1],y[n+1],t[n+1];\n  x[0]=0;\n  y[0]=0;\n  t[0]=0;\n  for(int i=1;i<=n;++i){\n    scanf(\"%ld %ld %ld\",&t[i],&x[i],&y[i]);\n    long int del_t=t[i]-t[i-1];\n    long int del_x=labs(x[i]-x[i-1]);\n    long int del_y=labs(y[i]-y[i-1]);\n    if(del_t+del_x+del_y % 2 == 1){\n      check = 1;\n      break;\n    }else if(del_t<del_x+del_y){\n      check = 1;\n      break;\n    }\n  }\n  if(check == 0) printf(\"Yes\");\n  else printf(\"No\");\n  return 0;\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": 547, "cpu_time_ms": 23, "memory_kb": 2560}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s690301956", "group_id": "codeNet:p03457", "input_text": "#include <stdio.h>\n\nint main(void){\n  int a;\n  scanf(\"%d\",&a);\n  int t[10000];\n  int x[10000];\n  int y[10000];\n  int xn=0;\n  int yn=0;\n  int flag=0;\n  for(int i=1;i<=a;i++){\n    scanf(\"%d%d%d\",t[i],x[i],y[i]);\n    xn+=1;\n    if(xn==x[i]){\n      for(int k=1;k<=t[i]-i;k++){\n        yn+=1;\n        if(yn==y[i]){\n          flag+=1;\n        }\n      }\n    }\n  }\n  if(flag==a){\n    printf(\"Yes\");\n  }else{\n    printf(\"No\");\n  }\n\n}\n", "language": "C", "metadata": {"date": 1516590099, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "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/C/s690301956.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s690301956", "user_id": "u193889856"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "#include <stdio.h>\n\nint main(void){\n  int a;\n  scanf(\"%d\",&a);\n  int t[10000];\n  int x[10000];\n  int y[10000];\n  int xn=0;\n  int yn=0;\n  int flag=0;\n  for(int i=1;i<=a;i++){\n    scanf(\"%d%d%d\",t[i],x[i],y[i]);\n    xn+=1;\n    if(xn==x[i]){\n      for(int k=1;k<=t[i]-i;k++){\n        yn+=1;\n        if(yn==y[i]){\n          flag+=1;\n        }\n      }\n    }\n  }\n  if(flag==a){\n    printf(\"Yes\");\n  }else{\n    printf(\"No\");\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": 425, "cpu_time_ms": 96, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s363556103", "group_id": "codeNet:p03457", "input_text": "#include <stdio.h>\n\n\nint main()\n{\n\tint n,t[10000],x[10000],y[10000];\n\tint j, k = 0;\n\tscanf(\"%d\",&n);\n\tfor (j = 0; j < n; j++) {\n\t\tscanf(\"%d %d %d\", &t[j], &x[j], &y[j]);\n\t\tif (j > 0) {\n\t\t\tif ((x[j - 1] + 1) == x[j] || (x[j - 1] - 1) == x[j] || (y[j - 1] + 1) == y[j] || (y[j - 1] - 1) == y[j])\n\t\t\t\tk = 1;\n\t\t\telse\n\t\t\t\tk = 0;\n\t\t}\n\t}\n\tif (k == 1)\n\t\tprintf(\"Yes\\n\");\n\telse\n\t\tprintf(\"No\\n\");\n\n    return 0;\n}", "language": "C", "metadata": {"date": 1516590017, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "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/C/s363556103.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s363556103", "user_id": "u374974389"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "#include <stdio.h>\n\n\nint main()\n{\n\tint n,t[10000],x[10000],y[10000];\n\tint j, k = 0;\n\tscanf(\"%d\",&n);\n\tfor (j = 0; j < n; j++) {\n\t\tscanf(\"%d %d %d\", &t[j], &x[j], &y[j]);\n\t\tif (j > 0) {\n\t\t\tif ((x[j - 1] + 1) == x[j] || (x[j - 1] - 1) == x[j] || (y[j - 1] + 1) == y[j] || (y[j - 1] - 1) == y[j])\n\t\t\t\tk = 1;\n\t\t\telse\n\t\t\t\tk = 0;\n\t\t}\n\t}\n\tif (k == 1)\n\t\tprintf(\"Yes\\n\");\n\telse\n\t\tprintf(\"No\\n\");\n\n    return 0;\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": 403, "cpu_time_ms": 101, "memory_kb": 256}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s069079194", "group_id": "codeNet:p03459", "input_text": "#include <stdio.h>\n\nvoid solve(void)\n{\n\tint n;\n\tint x0, y0, t0;\n\tint x1, y1, t1;\n\tint i;\n\tchar ngTxt[] = \"No\", okTxt[] = \"Yes\", *pTxt = okTxt;\n\t\n\tx1 = y1 = t1 = 0;\n\t\n\tscanf(\"%d\", &n);\n\tfor(i=0;i<n;++i){\n\t\tint d;\n\t\tx0 = x1;\n\t\ty0 = y1;\n\t\tt0 = t1;\n\t\t\n\t\tscanf(\"%d %d %d\", &t1, &x1, &y1);\n\t\td = (x1>x0 ? x1-x0 : x0-x1) + (y1>y0 ? y1-y0 : y0-y1);\n\t\tif( d > t1 - t0 ){\n\t\t\tpTxt = ngTxt;\n\t\t\tbreak;\n\t\t}\n\t\tif( (t1-t0-d)%2 == 1 ){\n\t\t\tpTxt = ngTxt;\n\t\t\tbreak;\n\t\t}\n\t}\n\tprintf(\"%s\\n\", pTxt);\n}\nint main(int argc, char **argv)\n{\n\tsolve();\n\treturn 0;\n}\n", "language": "C", "metadata": {"date": 1516588048, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "problem_description_relpath": "problem_descriptions/p03459.html", "problem_id": "p03459", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03459/input.txt", "sample_output_relpath": "derived/input_output/data/p03459/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03459/C/s069079194.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s069079194", "user_id": "u009041760"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "#include <stdio.h>\n\nvoid solve(void)\n{\n\tint n;\n\tint x0, y0, t0;\n\tint x1, y1, t1;\n\tint i;\n\tchar ngTxt[] = \"No\", okTxt[] = \"Yes\", *pTxt = okTxt;\n\t\n\tx1 = y1 = t1 = 0;\n\t\n\tscanf(\"%d\", &n);\n\tfor(i=0;i<n;++i){\n\t\tint d;\n\t\tx0 = x1;\n\t\ty0 = y1;\n\t\tt0 = t1;\n\t\t\n\t\tscanf(\"%d %d %d\", &t1, &x1, &y1);\n\t\td = (x1>x0 ? x1-x0 : x0-x1) + (y1>y0 ? y1-y0 : y0-y1);\n\t\tif( d > t1 - t0 ){\n\t\t\tpTxt = ngTxt;\n\t\t\tbreak;\n\t\t}\n\t\tif( (t1-t0-d)%2 == 1 ){\n\t\t\tpTxt = ngTxt;\n\t\t\tbreak;\n\t\t}\n\t}\n\tprintf(\"%s\\n\", pTxt);\n}\nint main(int argc, char **argv)\n{\n\tsolve();\n\treturn 0;\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": "p03459", "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": 535, "cpu_time_ms": 22, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s673305482", "group_id": "codeNet:p03464", "input_text": "\n#include <stdio.h>\n#include <math.h>\n#include <string.h>\n#include <stdlib.h>\n\nint main(void)\n{\n\t//変数の宣言\n\tint n;\n\tint a[100010];\n\tlong long int min,max;\n\t\n\t//よく使う変数\n\tint i,j,k,l;\n\tint flag=0;\n\tint ans=0;\n\tint count=0;\n\tint temp,temp1,temp2;\n\t//データの読み込み\n\tscanf(\"%d\",&n);\n\t\n\tfor(i=n-1;i>=0;i--){\n\t\tscanf(\"%d\",&a[i]);\n\t}\n\t\n\t\n//\tprintf(\"nは%dです\\n\", n);\n//\tprintf(\"データの読み込み終了\\n\");\n\t//実際の処理\n\t\n\tmin=2;\n\tmax=2;\n\t\n\tfor(i=0;i<n;i++){\n\t\tif((min+a[i]-1)/a[i]>max/a[i]){\n\t\t\tprintf(\"-1\");\n\t\t\treturn 0;\n\t\t}\n\t\tmin=((min+a[i]-1)/a[i])*a[i];\n\t\tmax=(max/a[i])*a[i]+a[i]-1;\n\t\tprintf(\"min=%lld,max=%lld\\n\",min,max);\n\t}\n\t\n\t\n\t\n\t\n//\tprintf(\"計算部分終了\\n\");\n\t//出力\n\t\n\tprintf(\"%d %d\",min,max);\n\t\n//\tprintf(\"結果の出力終了\\n\");\n\t\n\treturn 0;\n\t\n}\n\n", "language": "C", "metadata": {"date": 1542899630, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "problem_description_relpath": "problem_descriptions/p03464.html", "problem_id": "p03464", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03464/input.txt", "sample_output_relpath": "derived/input_output/data/p03464/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03464/C/s673305482.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s673305482", "user_id": "u705931757"}, "prompt_components": {"gold_output": "6 8\n", "input_to_evaluate": "\n#include <stdio.h>\n#include <math.h>\n#include <string.h>\n#include <stdlib.h>\n\nint main(void)\n{\n\t//変数の宣言\n\tint n;\n\tint a[100010];\n\tlong long int min,max;\n\t\n\t//よく使う変数\n\tint i,j,k,l;\n\tint flag=0;\n\tint ans=0;\n\tint count=0;\n\tint temp,temp1,temp2;\n\t//データの読み込み\n\tscanf(\"%d\",&n);\n\t\n\tfor(i=n-1;i>=0;i--){\n\t\tscanf(\"%d\",&a[i]);\n\t}\n\t\n\t\n//\tprintf(\"nは%dです\\n\", n);\n//\tprintf(\"データの読み込み終了\\n\");\n\t//実際の処理\n\t\n\tmin=2;\n\tmax=2;\n\t\n\tfor(i=0;i<n;i++){\n\t\tif((min+a[i]-1)/a[i]>max/a[i]){\n\t\t\tprintf(\"-1\");\n\t\t\treturn 0;\n\t\t}\n\t\tmin=((min+a[i]-1)/a[i])*a[i];\n\t\tmax=(max/a[i])*a[i]+a[i]-1;\n\t\tprintf(\"min=%lld,max=%lld\\n\",min,max);\n\t}\n\t\n\t\n\t\n\t\n//\tprintf(\"計算部分終了\\n\");\n\t//出力\n\t\n\tprintf(\"%d %d\",min,max);\n\t\n//\tprintf(\"結果の出力終了\\n\");\n\t\n\treturn 0;\n\t\n}\n\n", "problem_context": "Score : 500 points\n\nProblem Statement\n\nAn adult game master and N children are playing a game on an ice rink.\nThe game consists of K rounds.\nIn the i-th round, the game master announces:\n\nForm groups consisting of A_i children each!\n\nThen the children who are still in the game form as many groups of A_i children as possible.\nOne child may belong to at most one group.\nThose who are left without a group leave the game. The others proceed to the next round.\nNote that it's possible that nobody leaves the game in some round.\n\nIn the end, after the K-th round, there are exactly two children left, and they are declared the winners.\n\nYou have heard the values of A_1, A_2, ..., A_K. You don't know N, but you want to estimate it.\n\nFind the smallest and the largest possible number of children in the game before the start, or determine that no valid values of N exist.\n\nConstraints\n\n1 \\leq K \\leq 10^5\n\n2 \\leq A_i \\leq 10^9\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nK\nA_1 A_2 ... A_K\n\nOutput\n\nPrint two integers representing the smallest and the largest possible value of N, respectively,\nor a single integer -1 if the described situation is impossible.\n\nSample Input 1\n\n4\n3 4 3 2\n\nSample Output 1\n\n6 8\n\nFor example, if the game starts with 6 children, then it proceeds as follows:\n\nIn the first round, 6 children form 2 groups of 3 children, and nobody leaves the game.\n\nIn the second round, 6 children form 1 group of 4 children, and 2 children leave the game.\n\nIn the third round, 4 children form 1 group of 3 children, and 1 child leaves the game.\n\nIn the fourth round, 3 children form 1 group of 2 children, and 1 child leaves the game.\n\nThe last 2 children are declared the winners.\n\nSample Input 2\n\n5\n3 4 100 3 2\n\nSample Output 2\n\n-1\n\nThis situation is impossible.\nIn particular, if the game starts with less than 100 children, everyone leaves after the third round.\n\nSample Input 3\n\n10\n2 2 2 2 2 2 2 2 2 2\n\nSample Output 3\n\n2 3", "sample_input": "4\n3 4 3 2\n"}, "reference_outputs": ["6 8\n"], "source_document_id": "p03464", "source_text": "Score : 500 points\n\nProblem Statement\n\nAn adult game master and N children are playing a game on an ice rink.\nThe game consists of K rounds.\nIn the i-th round, the game master announces:\n\nForm groups consisting of A_i children each!\n\nThen the children who are still in the game form as many groups of A_i children as possible.\nOne child may belong to at most one group.\nThose who are left without a group leave the game. The others proceed to the next round.\nNote that it's possible that nobody leaves the game in some round.\n\nIn the end, after the K-th round, there are exactly two children left, and they are declared the winners.\n\nYou have heard the values of A_1, A_2, ..., A_K. You don't know N, but you want to estimate it.\n\nFind the smallest and the largest possible number of children in the game before the start, or determine that no valid values of N exist.\n\nConstraints\n\n1 \\leq K \\leq 10^5\n\n2 \\leq A_i \\leq 10^9\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nK\nA_1 A_2 ... A_K\n\nOutput\n\nPrint two integers representing the smallest and the largest possible value of N, respectively,\nor a single integer -1 if the described situation is impossible.\n\nSample Input 1\n\n4\n3 4 3 2\n\nSample Output 1\n\n6 8\n\nFor example, if the game starts with 6 children, then it proceeds as follows:\n\nIn the first round, 6 children form 2 groups of 3 children, and nobody leaves the game.\n\nIn the second round, 6 children form 1 group of 4 children, and 2 children leave the game.\n\nIn the third round, 4 children form 1 group of 3 children, and 1 child leaves the game.\n\nIn the fourth round, 3 children form 1 group of 2 children, and 1 child leaves the game.\n\nThe last 2 children are declared the winners.\n\nSample Input 2\n\n5\n3 4 100 3 2\n\nSample Output 2\n\n-1\n\nThis situation is impossible.\nIn particular, if the game starts with less than 100 children, everyone leaves after the third round.\n\nSample Input 3\n\n10\n2 2 2 2 2 2 2 2 2 2\n\nSample Output 3\n\n2 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": 810, "cpu_time_ms": 34, "memory_kb": 4224}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s870002672", "group_id": "codeNet:p03469", "input_text": "#include<stdio.h>\n\nint main(void)\n{\n\tint a, b, c;\n\n\tscanf(\"%d/%02d/%02d\", &a, &b, &c);\n\n\tif (a != 2018)\n\t\tprintf(\"2018/%02d/%02d\\n\", b, c);\n\telse\n\t\tprintf(\"%d/%02d/%02d\\n\", a, b, c);\n\n\treturn 0;\n\n\n}\n", "language": "C", "metadata": {"date": 1520202007, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "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/C/s870002672.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s870002672", "user_id": "u375541480"}, "prompt_components": {"gold_output": "2018/01/07\n", "input_to_evaluate": "#include<stdio.h>\n\nint main(void)\n{\n\tint a, b, c;\n\n\tscanf(\"%d/%02d/%02d\", &a, &b, &c);\n\n\tif (a != 2018)\n\t\tprintf(\"2018/%02d/%02d\\n\", b, c);\n\telse\n\t\tprintf(\"%d/%02d/%02d\\n\", a, b, c);\n\n\treturn 0;\n\n\n}\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": 199, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s018367130", "group_id": "codeNet:p03470", "input_text": "#include <stdio.h>\n\nvoid quicksort(int number[],int first,int last)\n{\n   int i, j, pivot, temp;\n\n   if(first < last){\n      pivot = first;\n      i = first;\n      j = last;\n\n      while(i < j){\n         while((number[pivot] >= number[i]) && (i < last))\n         {\n            i++;\n         }\n         while(number[pivot] < number[j])\n         {\n            j--;\n         }\n         if(i < j){\n            temp = number[i];\n            number[i] = number[j];\n            number[j] = temp;\n         }\n      }\n\n      temp = number[pivot];\n      number[pivot] = number[j];\n      number[j] = temp;\n      quicksort(number,first,j - 1);\n      quicksort(number,j+1,last);\n\n   }\n}\n\n\nint main()\n{\n    int n,d[100];\n\n    scanf(\"%d\",&n);\n    for (int i = 0; i < n; i++)\n    {\n        scanf(\"%d\",&d[i]);\n    }\n    quicksort(d,0,n - 1);\n\n    int ans = n;\n    for (int i = 0; i < n - 1; i++)\n    {\n        if (d[n - i - 1] == d[n - i - 2])\n        {\n            ans --;\n        }\n    }\n    printf(\"%d\",ans);\n}", "language": "C", "metadata": {"date": 1562576379, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "problem_description_relpath": "problem_descriptions/p03470.html", "problem_id": "p03470", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03470/input.txt", "sample_output_relpath": "derived/input_output/data/p03470/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03470/C/s018367130.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s018367130", "user_id": "u494609869"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "#include <stdio.h>\n\nvoid quicksort(int number[],int first,int last)\n{\n   int i, j, pivot, temp;\n\n   if(first < last){\n      pivot = first;\n      i = first;\n      j = last;\n\n      while(i < j){\n         while((number[pivot] >= number[i]) && (i < last))\n         {\n            i++;\n         }\n         while(number[pivot] < number[j])\n         {\n            j--;\n         }\n         if(i < j){\n            temp = number[i];\n            number[i] = number[j];\n            number[j] = temp;\n         }\n      }\n\n      temp = number[pivot];\n      number[pivot] = number[j];\n      number[j] = temp;\n      quicksort(number,first,j - 1);\n      quicksort(number,j+1,last);\n\n   }\n}\n\n\nint main()\n{\n    int n,d[100];\n\n    scanf(\"%d\",&n);\n    for (int i = 0; i < n; i++)\n    {\n        scanf(\"%d\",&d[i]);\n    }\n    quicksort(d,0,n - 1);\n\n    int ans = n;\n    for (int i = 0; i < n - 1; i++)\n    {\n        if (d[n - i - 1] == d[n - i - 2])\n        {\n            ans --;\n        }\n    }\n    printf(\"%d\",ans);\n}", "problem_context": "Score : 200 points\n\nProblem Statement\n\nAn X-layered kagami mochi (X ≥ 1) is a pile of X round mochi (rice cake) stacked vertically where each mochi (except the bottom one) has a smaller diameter than that of the mochi directly below it. For example, if you stack three mochi with diameters of 10, 8 and 6 centimeters from bottom to top in this order, you have a 3-layered kagami mochi; if you put just one mochi, you have a 1-layered kagami mochi.\n\nLunlun the dachshund has N round mochi, and the diameter of the i-th mochi is d_i centimeters. When we make a kagami mochi using some or all of them, at most how many layers can our kagami mochi have?\n\nConstraints\n\n1 ≤ N ≤ 100\n\n1 ≤ d_i ≤ 100\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nd_1\n:\nd_N\n\nOutput\n\nPrint the maximum number of layers in a kagami mochi that can be made.\n\nSample Input 1\n\n4\n10\n8\n8\n6\n\nSample Output 1\n\n3\n\nIf we stack the mochi with diameters of 10, 8 and 6 centimeters from bottom to top in this order, we have a 3-layered kagami mochi, which is the maximum number of layers.\n\nSample Input 2\n\n3\n15\n15\n15\n\nSample Output 2\n\n1\n\nWhen all the mochi have the same diameter, we can only have a 1-layered kagami mochi.\n\nSample Input 3\n\n7\n50\n30\n50\n100\n50\n80\n30\n\nSample Output 3\n\n4", "sample_input": "4\n10\n8\n8\n6\n"}, "reference_outputs": ["3\n"], "source_document_id": "p03470", "source_text": "Score : 200 points\n\nProblem Statement\n\nAn X-layered kagami mochi (X ≥ 1) is a pile of X round mochi (rice cake) stacked vertically where each mochi (except the bottom one) has a smaller diameter than that of the mochi directly below it. For example, if you stack three mochi with diameters of 10, 8 and 6 centimeters from bottom to top in this order, you have a 3-layered kagami mochi; if you put just one mochi, you have a 1-layered kagami mochi.\n\nLunlun the dachshund has N round mochi, and the diameter of the i-th mochi is d_i centimeters. When we make a kagami mochi using some or all of them, at most how many layers can our kagami mochi have?\n\nConstraints\n\n1 ≤ N ≤ 100\n\n1 ≤ d_i ≤ 100\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nd_1\n:\nd_N\n\nOutput\n\nPrint the maximum number of layers in a kagami mochi that can be made.\n\nSample Input 1\n\n4\n10\n8\n8\n6\n\nSample Output 1\n\n3\n\nIf we stack the mochi with diameters of 10, 8 and 6 centimeters from bottom to top in this order, we have a 3-layered kagami mochi, which is the maximum number of layers.\n\nSample Input 2\n\n3\n15\n15\n15\n\nSample Output 2\n\n1\n\nWhen all the mochi have the same diameter, we can only have a 1-layered kagami mochi.\n\nSample Input 3\n\n7\n50\n30\n50\n100\n50\n80\n30\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": 993, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s708106421", "group_id": "codeNet:p03470", "input_text": "#include <stdio.h>\n\nint main(void){\n  int N,d;\n  int ans = 0;\n  int flag[100];\n  scanf(\"%d\",&N);\n  \n  for(int i= 0;i < 100;i++){\n    flag[i] = 0;\n  }\n\n  for(int i = 0;i < N;i++){\n    scanf(\"%d\",&d);\n    flag[d-1] = 1;\n  }\n\n  for(int i = 0;i < 100;i++){\n    if(flag[i]) ans++;\n  }\n\n  printf(\"%d\\n\",ans);\n  return 0;\n}", "language": "C", "metadata": {"date": 1549492288, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "problem_description_relpath": "problem_descriptions/p03470.html", "problem_id": "p03470", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03470/input.txt", "sample_output_relpath": "derived/input_output/data/p03470/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03470/C/s708106421.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s708106421", "user_id": "u812973725"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "#include <stdio.h>\n\nint main(void){\n  int N,d;\n  int ans = 0;\n  int flag[100];\n  scanf(\"%d\",&N);\n  \n  for(int i= 0;i < 100;i++){\n    flag[i] = 0;\n  }\n\n  for(int i = 0;i < N;i++){\n    scanf(\"%d\",&d);\n    flag[d-1] = 1;\n  }\n\n  for(int i = 0;i < 100;i++){\n    if(flag[i]) ans++;\n  }\n\n  printf(\"%d\\n\",ans);\n  return 0;\n}", "problem_context": "Score : 200 points\n\nProblem Statement\n\nAn X-layered kagami mochi (X ≥ 1) is a pile of X round mochi (rice cake) stacked vertically where each mochi (except the bottom one) has a smaller diameter than that of the mochi directly below it. For example, if you stack three mochi with diameters of 10, 8 and 6 centimeters from bottom to top in this order, you have a 3-layered kagami mochi; if you put just one mochi, you have a 1-layered kagami mochi.\n\nLunlun the dachshund has N round mochi, and the diameter of the i-th mochi is d_i centimeters. When we make a kagami mochi using some or all of them, at most how many layers can our kagami mochi have?\n\nConstraints\n\n1 ≤ N ≤ 100\n\n1 ≤ d_i ≤ 100\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nd_1\n:\nd_N\n\nOutput\n\nPrint the maximum number of layers in a kagami mochi that can be made.\n\nSample Input 1\n\n4\n10\n8\n8\n6\n\nSample Output 1\n\n3\n\nIf we stack the mochi with diameters of 10, 8 and 6 centimeters from bottom to top in this order, we have a 3-layered kagami mochi, which is the maximum number of layers.\n\nSample Input 2\n\n3\n15\n15\n15\n\nSample Output 2\n\n1\n\nWhen all the mochi have the same diameter, we can only have a 1-layered kagami mochi.\n\nSample Input 3\n\n7\n50\n30\n50\n100\n50\n80\n30\n\nSample Output 3\n\n4", "sample_input": "4\n10\n8\n8\n6\n"}, "reference_outputs": ["3\n"], "source_document_id": "p03470", "source_text": "Score : 200 points\n\nProblem Statement\n\nAn X-layered kagami mochi (X ≥ 1) is a pile of X round mochi (rice cake) stacked vertically where each mochi (except the bottom one) has a smaller diameter than that of the mochi directly below it. For example, if you stack three mochi with diameters of 10, 8 and 6 centimeters from bottom to top in this order, you have a 3-layered kagami mochi; if you put just one mochi, you have a 1-layered kagami mochi.\n\nLunlun the dachshund has N round mochi, and the diameter of the i-th mochi is d_i centimeters. When we make a kagami mochi using some or all of them, at most how many layers can our kagami mochi have?\n\nConstraints\n\n1 ≤ N ≤ 100\n\n1 ≤ d_i ≤ 100\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nd_1\n:\nd_N\n\nOutput\n\nPrint the maximum number of layers in a kagami mochi that can be made.\n\nSample Input 1\n\n4\n10\n8\n8\n6\n\nSample Output 1\n\n3\n\nIf we stack the mochi with diameters of 10, 8 and 6 centimeters from bottom to top in this order, we have a 3-layered kagami mochi, which is the maximum number of layers.\n\nSample Input 2\n\n3\n15\n15\n15\n\nSample Output 2\n\n1\n\nWhen all the mochi have the same diameter, we can only have a 1-layered kagami mochi.\n\nSample Input 3\n\n7\n50\n30\n50\n100\n50\n80\n30\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": 316, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s166245951", "group_id": "codeNet:p03473", "input_text": "#include<stdio.h>\n\nint main()\n{\n    int m, n;\n    scanf(\"%d\",&m);\n\n    printf(\"We have %d hours until New Year at 21 o'clock on 30th, December.\\n\",(24 - m) + 24);\n\n    return 0;\n}\n", "language": "C", "metadata": {"date": 1543105817, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "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/C/s166245951.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s166245951", "user_id": "u018679195"}, "prompt_components": {"gold_output": "27\n", "input_to_evaluate": "#include<stdio.h>\n\nint main()\n{\n    int m, n;\n    scanf(\"%d\",&m);\n\n    printf(\"We have %d hours until New Year at 21 o'clock on 30th, December.\\n\",(24 - m) + 24);\n\n    return 0;\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": 180, "cpu_time_ms": 2, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s332251305", "group_id": "codeNet:p03474", "input_text": "#include<stdio.h>\n#include<string.h>\n\nint main(){\n  int A, B, len = 0;\n  char s[12];\n  \n  scanf(\"%d %d\", &A, &B);\n  scanf(\"%s\", s);\n  \n  while(s[len]){\n    if(len == A && s[len] != '-'){\n      break;\n    } else if(len != A && (s[len] < '0' || s[len] > '9')){\n      break;\n    }\n    len++;\n  }\n  \n  if(len == strlen(s)){\n    printf(\"Yes\\n\");\n  } else {\n    printf(\"No\\n\");\n  }\n  \n  return 0;\n}", "language": "C", "metadata": {"date": 1549811834, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "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/C/s332251305.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s332251305", "user_id": "u313578168"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "#include<stdio.h>\n#include<string.h>\n\nint main(){\n  int A, B, len = 0;\n  char s[12];\n  \n  scanf(\"%d %d\", &A, &B);\n  scanf(\"%s\", s);\n  \n  while(s[len]){\n    if(len == A && s[len] != '-'){\n      break;\n    } else if(len != A && (s[len] < '0' || s[len] > '9')){\n      break;\n    }\n    len++;\n  }\n  \n  if(len == strlen(s)){\n    printf(\"Yes\\n\");\n  } else {\n    printf(\"No\\n\");\n  }\n  \n  return 0;\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": 392, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s835415397", "group_id": "codeNet:p03474", "input_text": "#include <stdio.h>\n\nint main(void)\n{\n        int a,b,i;\n        char s[10];\n\n        scanf(\"%d%d\",&a,&b);\n\n        scanf(\"%s\",s);\n\n        if (s[a]!='-'){\n                printf(\"No\\n\");\n                return 1;\n        }\n        \n        for (i=0;i<a;i++){\n                if (s[i]=='-'){\n                        printf(\"No\\n\");\n                        return 1;\n                }\n        }\n        \n        printf(\"Yes\\n\");\nreturn 0;\n\n\n}", "language": "C", "metadata": {"date": 1527172448, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "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/C/s835415397.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s835415397", "user_id": "u162003826"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "#include <stdio.h>\n\nint main(void)\n{\n        int a,b,i;\n        char s[10];\n\n        scanf(\"%d%d\",&a,&b);\n\n        scanf(\"%s\",s);\n\n        if (s[a]!='-'){\n                printf(\"No\\n\");\n                return 1;\n        }\n        \n        for (i=0;i<a;i++){\n                if (s[i]=='-'){\n                        printf(\"No\\n\");\n                        return 1;\n                }\n        }\n        \n        printf(\"Yes\\n\");\nreturn 0;\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": 440, "cpu_time_ms": 2, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s900847192", "group_id": "codeNet:p03476", "input_text": "#include <stdio.h>\n#include <string.h>\n\nint main(){\n  int q,i,j,a;\n  int l[100004],r[100004];\n  int ll,rr;\n  scanf(\"%d\",&q);\n  for(i=0;i<q;i++){\n    scanf(\"%d %d\",&l[i],&r[i]);\n  }\n  int x[100004];\n  x[0]=1;\n  x[1]=1;\n  for(i=2;i<=100002;i++){\n    if(x[i]==0){\n      for(j=2*i;i<=100002-j;j+=i){\n        x[j]=1;\n      }\n    }\n  }\n  int y[100004];\n  y[0]=0;\n  for(i=1;i<100004;i++){\n    if((x[2*i-1]==0)&&(x[i]==0)){\n      y[i]=1;\n    }\n  }\n  for(i=1;i<100004;i++){\n    y[i]+=y[i-1];\n  }\n  for(i=0;i<q;i++){\n    ll=(l[i]+1)/2-1;\n    rr=(r[i]+1)/2;\n    a=y[rr]-y[ll];\n    printf(\"%d\\n\",a);\n  }\n  return 0;\n}\n", "language": "C", "metadata": {"date": 1517089775, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "problem_description_relpath": "problem_descriptions/p03476.html", "problem_id": "p03476", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03476/input.txt", "sample_output_relpath": "derived/input_output/data/p03476/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03476/C/s900847192.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s900847192", "user_id": "u399527088"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "#include <stdio.h>\n#include <string.h>\n\nint main(){\n  int q,i,j,a;\n  int l[100004],r[100004];\n  int ll,rr;\n  scanf(\"%d\",&q);\n  for(i=0;i<q;i++){\n    scanf(\"%d %d\",&l[i],&r[i]);\n  }\n  int x[100004];\n  x[0]=1;\n  x[1]=1;\n  for(i=2;i<=100002;i++){\n    if(x[i]==0){\n      for(j=2*i;i<=100002-j;j+=i){\n        x[j]=1;\n      }\n    }\n  }\n  int y[100004];\n  y[0]=0;\n  for(i=1;i<100004;i++){\n    if((x[2*i-1]==0)&&(x[i]==0)){\n      y[i]=1;\n    }\n  }\n  for(i=1;i<100004;i++){\n    y[i]+=y[i-1];\n  }\n  for(i=0;i<q;i++){\n    ll=(l[i]+1)/2-1;\n    rr=(r[i]+1)/2;\n    a=y[rr]-y[ll];\n    printf(\"%d\\n\",a);\n  }\n  return 0;\n}\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nWe say that a odd number N is similar to 2017 when both N and (N+1)/2 are prime.\n\nYou are given Q queries.\n\nIn the i-th query, given two odd numbers l_i and r_i, find the number of odd numbers x similar to 2017 such that l_i ≤ x ≤ r_i.\n\nConstraints\n\n1≤Q≤10^5\n\n1≤l_i≤r_i≤10^5\n\nl_i and r_i are odd.\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nQ\nl_1 r_1\n:\nl_Q r_Q\n\nOutput\n\nPrint Q lines. The i-th line (1≤i≤Q) should contain the response to the i-th query.\n\nSample Input 1\n\n1\n3 7\n\nSample Output 1\n\n2\n\n3 is similar to 2017, since both 3 and (3+1)/2=2 are prime.\n\n5 is similar to 2017, since both 5 and (5+1)/2=3 are prime.\n\n7 is not similar to 2017, since (7+1)/2=4 is not prime, although 7 is prime.\n\nThus, the response to the first query should be 2.\n\nSample Input 2\n\n4\n13 13\n7 11\n7 11\n2017 2017\n\nSample Output 2\n\n1\n0\n0\n1\n\nNote that 2017 is also similar to 2017.\n\nSample Input 3\n\n6\n1 53\n13 91\n37 55\n19 51\n73 91\n13 49\n\nSample Output 3\n\n4\n4\n1\n1\n1\n2", "sample_input": "1\n3 7\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03476", "source_text": "Score : 400 points\n\nProblem Statement\n\nWe say that a odd number N is similar to 2017 when both N and (N+1)/2 are prime.\n\nYou are given Q queries.\n\nIn the i-th query, given two odd numbers l_i and r_i, find the number of odd numbers x similar to 2017 such that l_i ≤ x ≤ r_i.\n\nConstraints\n\n1≤Q≤10^5\n\n1≤l_i≤r_i≤10^5\n\nl_i and r_i are odd.\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nQ\nl_1 r_1\n:\nl_Q r_Q\n\nOutput\n\nPrint Q lines. The i-th line (1≤i≤Q) should contain the response to the i-th query.\n\nSample Input 1\n\n1\n3 7\n\nSample Output 1\n\n2\n\n3 is similar to 2017, since both 3 and (3+1)/2=2 are prime.\n\n5 is similar to 2017, since both 5 and (5+1)/2=3 are prime.\n\n7 is not similar to 2017, since (7+1)/2=4 is not prime, although 7 is prime.\n\nThus, the response to the first query should be 2.\n\nSample Input 2\n\n4\n13 13\n7 11\n7 11\n2017 2017\n\nSample Output 2\n\n1\n0\n0\n1\n\nNote that 2017 is also similar to 2017.\n\nSample Input 3\n\n6\n1 53\n13 91\n37 55\n19 51\n73 91\n13 49\n\nSample Output 3\n\n4\n4\n1\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": 606, "cpu_time_ms": 28, "memory_kb": 2048}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s240611403", "group_id": "codeNet:p03476", "input_text": "#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\n#define Q_MAX 100000\n\nint main(void) {\n  int Q, *l, *r;\n  int n[Q_MAX+1] = {}, p[Q_MAX+1] = {};\n  scanf(\"%d\", &Q);\n  l = (int*)calloc(Q, sizeof(int));\n  r = (int*)calloc(Q, sizeof(int));\n  for (int i = 0; i < Q; i++) {\n    scanf(\"%d %d\", &l[i], &r[i]);\n  }\n  for (int i = 2; i <= Q_MAX; i++) {\n    p[i] = 1;\n  }\n\n  for (int i = 2; i <= Q_MAX; i++) {\n    if (p[i] && i <= Q_MAX / 2) {\n      for (register int k = 2; i*k <= Q_MAX; k++) {\n        p[i*k] = 0;\n      }\n    }\n    n[i] = n[i-1] + (p[i] && p[(i+1)/2]);\n  }\n\n  for (int i = 0; i < Q; i++) {\n    printf(\"%d\\n\", n[r[i]] - n[l[i]-1]);\n  }\n\n  return 0;\n}\n", "language": "C", "metadata": {"date": 1514748249, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "problem_description_relpath": "problem_descriptions/p03476.html", "problem_id": "p03476", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03476/input.txt", "sample_output_relpath": "derived/input_output/data/p03476/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03476/C/s240611403.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s240611403", "user_id": "u299647642"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\n#define Q_MAX 100000\n\nint main(void) {\n  int Q, *l, *r;\n  int n[Q_MAX+1] = {}, p[Q_MAX+1] = {};\n  scanf(\"%d\", &Q);\n  l = (int*)calloc(Q, sizeof(int));\n  r = (int*)calloc(Q, sizeof(int));\n  for (int i = 0; i < Q; i++) {\n    scanf(\"%d %d\", &l[i], &r[i]);\n  }\n  for (int i = 2; i <= Q_MAX; i++) {\n    p[i] = 1;\n  }\n\n  for (int i = 2; i <= Q_MAX; i++) {\n    if (p[i] && i <= Q_MAX / 2) {\n      for (register int k = 2; i*k <= Q_MAX; k++) {\n        p[i*k] = 0;\n      }\n    }\n    n[i] = n[i-1] + (p[i] && p[(i+1)/2]);\n  }\n\n  for (int i = 0; i < Q; i++) {\n    printf(\"%d\\n\", n[r[i]] - n[l[i]-1]);\n  }\n\n  return 0;\n}\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nWe say that a odd number N is similar to 2017 when both N and (N+1)/2 are prime.\n\nYou are given Q queries.\n\nIn the i-th query, given two odd numbers l_i and r_i, find the number of odd numbers x similar to 2017 such that l_i ≤ x ≤ r_i.\n\nConstraints\n\n1≤Q≤10^5\n\n1≤l_i≤r_i≤10^5\n\nl_i and r_i are odd.\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nQ\nl_1 r_1\n:\nl_Q r_Q\n\nOutput\n\nPrint Q lines. The i-th line (1≤i≤Q) should contain the response to the i-th query.\n\nSample Input 1\n\n1\n3 7\n\nSample Output 1\n\n2\n\n3 is similar to 2017, since both 3 and (3+1)/2=2 are prime.\n\n5 is similar to 2017, since both 5 and (5+1)/2=3 are prime.\n\n7 is not similar to 2017, since (7+1)/2=4 is not prime, although 7 is prime.\n\nThus, the response to the first query should be 2.\n\nSample Input 2\n\n4\n13 13\n7 11\n7 11\n2017 2017\n\nSample Output 2\n\n1\n0\n0\n1\n\nNote that 2017 is also similar to 2017.\n\nSample Input 3\n\n6\n1 53\n13 91\n37 55\n19 51\n73 91\n13 49\n\nSample Output 3\n\n4\n4\n1\n1\n1\n2", "sample_input": "1\n3 7\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03476", "source_text": "Score : 400 points\n\nProblem Statement\n\nWe say that a odd number N is similar to 2017 when both N and (N+1)/2 are prime.\n\nYou are given Q queries.\n\nIn the i-th query, given two odd numbers l_i and r_i, find the number of odd numbers x similar to 2017 such that l_i ≤ x ≤ r_i.\n\nConstraints\n\n1≤Q≤10^5\n\n1≤l_i≤r_i≤10^5\n\nl_i and r_i are odd.\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nQ\nl_1 r_1\n:\nl_Q r_Q\n\nOutput\n\nPrint Q lines. The i-th line (1≤i≤Q) should contain the response to the i-th query.\n\nSample Input 1\n\n1\n3 7\n\nSample Output 1\n\n2\n\n3 is similar to 2017, since both 3 and (3+1)/2=2 are prime.\n\n5 is similar to 2017, since both 5 and (5+1)/2=3 are prime.\n\n7 is not similar to 2017, since (7+1)/2=4 is not prime, although 7 is prime.\n\nThus, the response to the first query should be 2.\n\nSample Input 2\n\n4\n13 13\n7 11\n7 11\n2017 2017\n\nSample Output 2\n\n1\n0\n0\n1\n\nNote that 2017 is also similar to 2017.\n\nSample Input 3\n\n6\n1 53\n13 91\n37 55\n19 51\n73 91\n13 49\n\nSample Output 3\n\n4\n4\n1\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": 666, "cpu_time_ms": 28, "memory_kb": 2048}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s616776184", "group_id": "codeNet:p03477", "input_text": "#include<stdio.h>\nint main()\n{\n    int a,b,c,d,x,y;\n    scanf(\"%d %d %d %d\",&a,&b,&c,&d);\n    x=a+b;\n    y=c+d;\n    if(x>y){\n        printf(\"Left\");\n    }\n    else if(y>x){\n        printf(\"Right\");\n    }\n    else{\n        printf(\"Balanced\");\n    }\n    return 0;\n}\n", "language": "C", "metadata": {"date": 1576478370, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "problem_description_relpath": "problem_descriptions/p03477.html", "problem_id": "p03477", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03477/input.txt", "sample_output_relpath": "derived/input_output/data/p03477/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03477/C/s616776184.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s616776184", "user_id": "u816631826"}, "prompt_components": {"gold_output": "Left\n", "input_to_evaluate": "#include<stdio.h>\nint main()\n{\n    int a,b,c,d,x,y;\n    scanf(\"%d %d %d %d\",&a,&b,&c,&d);\n    x=a+b;\n    y=c+d;\n    if(x>y){\n        printf(\"Left\");\n    }\n    else if(y>x){\n        printf(\"Right\");\n    }\n    else{\n        printf(\"Balanced\");\n    }\n    return 0;\n}\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nA balance scale tips to the left if L>R, where L is the total weight of the masses on the left pan and R is the total weight of the masses on the right pan. Similarly, it balances if L=R, and tips to the right if L<R.\n\nTakahashi placed a mass of weight A and a mass of weight B on the left pan of a balance scale, and placed a mass of weight C and a mass of weight D on the right pan.\n\nPrint Left if the balance scale tips to the left; print Balanced if it balances; print Right if it tips to the right.\n\nConstraints\n\n1\\leq A,B,C,D \\leq 10\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C D\n\nOutput\n\nPrint Left if the balance scale tips to the left; print Balanced if it balances; print Right if it tips to the right.\n\nSample Input 1\n\n3 8 7 1\n\nSample Output 1\n\nLeft\n\nThe total weight of the masses on the left pan is 11, and the total weight of the masses on the right pan is 8. Since 11>8, we should print Left.\n\nSample Input 2\n\n3 4 5 2\n\nSample Output 2\n\nBalanced\n\nThe total weight of the masses on the left pan is 7, and the total weight of the masses on the right pan is 7. Since 7=7, we should print Balanced.\n\nSample Input 3\n\n1 7 6 4\n\nSample Output 3\n\nRight\n\nThe total weight of the masses on the left pan is 8, and the total weight of the masses on the right pan is 10. Since 8<10, we should print Right.", "sample_input": "3 8 7 1\n"}, "reference_outputs": ["Left\n"], "source_document_id": "p03477", "source_text": "Score : 100 points\n\nProblem Statement\n\nA balance scale tips to the left if L>R, where L is the total weight of the masses on the left pan and R is the total weight of the masses on the right pan. Similarly, it balances if L=R, and tips to the right if L<R.\n\nTakahashi placed a mass of weight A and a mass of weight B on the left pan of a balance scale, and placed a mass of weight C and a mass of weight D on the right pan.\n\nPrint Left if the balance scale tips to the left; print Balanced if it balances; print Right if it tips to the right.\n\nConstraints\n\n1\\leq A,B,C,D \\leq 10\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C D\n\nOutput\n\nPrint Left if the balance scale tips to the left; print Balanced if it balances; print Right if it tips to the right.\n\nSample Input 1\n\n3 8 7 1\n\nSample Output 1\n\nLeft\n\nThe total weight of the masses on the left pan is 11, and the total weight of the masses on the right pan is 8. Since 11>8, we should print Left.\n\nSample Input 2\n\n3 4 5 2\n\nSample Output 2\n\nBalanced\n\nThe total weight of the masses on the left pan is 7, and the total weight of the masses on the right pan is 7. Since 7=7, we should print Balanced.\n\nSample Input 3\n\n1 7 6 4\n\nSample Output 3\n\nRight\n\nThe total weight of the masses on the left pan is 8, and the total weight of the masses on the right pan is 10. Since 8<10, we should print Right.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 264, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s666653653", "group_id": "codeNet:p03477", "input_text": "#include <stdio.h>\n#include <stdlib.h>\n#include <string.h>\n#define ll long long\n#define rep(i,l,r)for(ll i=(l);i<(r);i++)\n#define max(p,q)((p)>(q)?(p):(q))\n#define min(p,q)((p)<(q)?(p):(q))\n\nint main(){\n\tint a,b,c,d;\n\tscanf(\"%d%d%d%d\",&a,&b,&c,&d);\n\tputs(a+b==c+d?\"Balanced\":a+b<c+d?\"Right\":\"Left\");\n}", "language": "C", "metadata": {"date": 1546290764, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "problem_description_relpath": "problem_descriptions/p03477.html", "problem_id": "p03477", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03477/input.txt", "sample_output_relpath": "derived/input_output/data/p03477/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03477/C/s666653653.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s666653653", "user_id": "u382163500"}, "prompt_components": {"gold_output": "Left\n", "input_to_evaluate": "#include <stdio.h>\n#include <stdlib.h>\n#include <string.h>\n#define ll long long\n#define rep(i,l,r)for(ll i=(l);i<(r);i++)\n#define max(p,q)((p)>(q)?(p):(q))\n#define min(p,q)((p)<(q)?(p):(q))\n\nint main(){\n\tint a,b,c,d;\n\tscanf(\"%d%d%d%d\",&a,&b,&c,&d);\n\tputs(a+b==c+d?\"Balanced\":a+b<c+d?\"Right\":\"Left\");\n}", "problem_context": "Score : 100 points\n\nProblem Statement\n\nA balance scale tips to the left if L>R, where L is the total weight of the masses on the left pan and R is the total weight of the masses on the right pan. Similarly, it balances if L=R, and tips to the right if L<R.\n\nTakahashi placed a mass of weight A and a mass of weight B on the left pan of a balance scale, and placed a mass of weight C and a mass of weight D on the right pan.\n\nPrint Left if the balance scale tips to the left; print Balanced if it balances; print Right if it tips to the right.\n\nConstraints\n\n1\\leq A,B,C,D \\leq 10\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C D\n\nOutput\n\nPrint Left if the balance scale tips to the left; print Balanced if it balances; print Right if it tips to the right.\n\nSample Input 1\n\n3 8 7 1\n\nSample Output 1\n\nLeft\n\nThe total weight of the masses on the left pan is 11, and the total weight of the masses on the right pan is 8. Since 11>8, we should print Left.\n\nSample Input 2\n\n3 4 5 2\n\nSample Output 2\n\nBalanced\n\nThe total weight of the masses on the left pan is 7, and the total weight of the masses on the right pan is 7. Since 7=7, we should print Balanced.\n\nSample Input 3\n\n1 7 6 4\n\nSample Output 3\n\nRight\n\nThe total weight of the masses on the left pan is 8, and the total weight of the masses on the right pan is 10. Since 8<10, we should print Right.", "sample_input": "3 8 7 1\n"}, "reference_outputs": ["Left\n"], "source_document_id": "p03477", "source_text": "Score : 100 points\n\nProblem Statement\n\nA balance scale tips to the left if L>R, where L is the total weight of the masses on the left pan and R is the total weight of the masses on the right pan. Similarly, it balances if L=R, and tips to the right if L<R.\n\nTakahashi placed a mass of weight A and a mass of weight B on the left pan of a balance scale, and placed a mass of weight C and a mass of weight D on the right pan.\n\nPrint Left if the balance scale tips to the left; print Balanced if it balances; print Right if it tips to the right.\n\nConstraints\n\n1\\leq A,B,C,D \\leq 10\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C D\n\nOutput\n\nPrint Left if the balance scale tips to the left; print Balanced if it balances; print Right if it tips to the right.\n\nSample Input 1\n\n3 8 7 1\n\nSample Output 1\n\nLeft\n\nThe total weight of the masses on the left pan is 11, and the total weight of the masses on the right pan is 8. Since 11>8, we should print Left.\n\nSample Input 2\n\n3 4 5 2\n\nSample Output 2\n\nBalanced\n\nThe total weight of the masses on the left pan is 7, and the total weight of the masses on the right pan is 7. Since 7=7, we should print Balanced.\n\nSample Input 3\n\n1 7 6 4\n\nSample Output 3\n\nRight\n\nThe total weight of the masses on the left pan is 8, and the total weight of the masses on the right pan is 10. Since 8<10, we should print Right.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 301, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s294019977", "group_id": "codeNet:p03485", "input_text": "#include <stdio.h>\n\nint main(void)\n{\n        int a,b;\n        scanf(\"%d%d\",&a,&b);\n        if(a%2==0 && b%2==0)printf(\"%d\\n\",(int)(a+b)/2);\n        else printf(\"%d\\n\",(int)(a+b)/2+1);\n        return 0;\n}\n", "language": "C", "metadata": {"date": 1593786526, "filename_ext": "c", "original_language": "C (GCC 9.2.1)", "problem_description_relpath": "problem_descriptions/p03485.html", "problem_id": "p03485", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03485/input.txt", "sample_output_relpath": "derived/input_output/data/p03485/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03485/C/s294019977.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s294019977", "user_id": "u048036733"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "#include <stdio.h>\n\nint main(void)\n{\n        int a,b;\n        scanf(\"%d%d\",&a,&b);\n        if(a%2==0 && b%2==0)printf(\"%d\\n\",(int)(a+b)/2);\n        else printf(\"%d\\n\",(int)(a+b)/2+1);\n        return 0;\n}\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou are given two positive integers a and b.\nLet x be the average of a and b.\nPrint x rounded up to the nearest integer.\n\nConstraints\n\na and b are integers.\n\n1 \\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 x rounded up to the nearest integer.\n\nSample Input 1\n\n1 3\n\nSample Output 1\n\n2\n\nThe average of 1 and 3 is 2.0, and it will be rounded up to the nearest integer, 2.\n\nSample Input 2\n\n7 4\n\nSample Output 2\n\n6\n\nThe average of 7 and 4 is 5.5, and it will be rounded up to the nearest integer, 6.\n\nSample Input 3\n\n5 5\n\nSample Output 3\n\n5", "sample_input": "1 3\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03485", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou are given two positive integers a and b.\nLet x be the average of a and b.\nPrint x rounded up to the nearest integer.\n\nConstraints\n\na and b are integers.\n\n1 \\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 x rounded up to the nearest integer.\n\nSample Input 1\n\n1 3\n\nSample Output 1\n\n2\n\nThe average of 1 and 3 is 2.0, and it will be rounded up to the nearest integer, 2.\n\nSample Input 2\n\n7 4\n\nSample Output 2\n\n6\n\nThe average of 7 and 4 is 5.5, and it will be rounded up to the nearest integer, 6.\n\nSample Input 3\n\n5 5\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": 204, "cpu_time_ms": 7, "memory_kb": 1724}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s809285878", "group_id": "codeNet:p03485", "input_text": "#include <stdio.h>\n\nint main(void) {\n    int a, b;\n    scanf(\"%d %d\", &a, &b);\n    int sum = a + b;\n    if(sum % 2 != 0){\n        printf(\"%d\\n\", sum / 2 + 1);\n    }else{\n        printf(\"%d\\n\", sum / 2);\n    }\n}\n", "language": "C", "metadata": {"date": 1564902118, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "problem_description_relpath": "problem_descriptions/p03485.html", "problem_id": "p03485", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03485/input.txt", "sample_output_relpath": "derived/input_output/data/p03485/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03485/C/s809285878.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s809285878", "user_id": "u963215078"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "#include <stdio.h>\n\nint main(void) {\n    int a, b;\n    scanf(\"%d %d\", &a, &b);\n    int sum = a + b;\n    if(sum % 2 != 0){\n        printf(\"%d\\n\", sum / 2 + 1);\n    }else{\n        printf(\"%d\\n\", sum / 2);\n    }\n}\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou are given two positive integers a and b.\nLet x be the average of a and b.\nPrint x rounded up to the nearest integer.\n\nConstraints\n\na and b are integers.\n\n1 \\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 x rounded up to the nearest integer.\n\nSample Input 1\n\n1 3\n\nSample Output 1\n\n2\n\nThe average of 1 and 3 is 2.0, and it will be rounded up to the nearest integer, 2.\n\nSample Input 2\n\n7 4\n\nSample Output 2\n\n6\n\nThe average of 7 and 4 is 5.5, and it will be rounded up to the nearest integer, 6.\n\nSample Input 3\n\n5 5\n\nSample Output 3\n\n5", "sample_input": "1 3\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03485", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou are given two positive integers a and b.\nLet x be the average of a and b.\nPrint x rounded up to the nearest integer.\n\nConstraints\n\na and b are integers.\n\n1 \\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 x rounded up to the nearest integer.\n\nSample Input 1\n\n1 3\n\nSample Output 1\n\n2\n\nThe average of 1 and 3 is 2.0, and it will be rounded up to the nearest integer, 2.\n\nSample Input 2\n\n7 4\n\nSample Output 2\n\n6\n\nThe average of 7 and 4 is 5.5, and it will be rounded up to the nearest integer, 6.\n\nSample Input 3\n\n5 5\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": 211, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s758512158", "group_id": "codeNet:p03485", "input_text": "#include <stdio.h>\n\nint main(void){\n    int a,b;\n    scanf(\"%d %d\",&a,&b);\n    printf(\"%d\\n\",(a+b+1)/2);\n    return 0;\n}", "language": "C", "metadata": {"date": 1541118870, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "problem_description_relpath": "problem_descriptions/p03485.html", "problem_id": "p03485", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03485/input.txt", "sample_output_relpath": "derived/input_output/data/p03485/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03485/C/s758512158.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s758512158", "user_id": "u154756110"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "#include <stdio.h>\n\nint main(void){\n    int a,b;\n    scanf(\"%d %d\",&a,&b);\n    printf(\"%d\\n\",(a+b+1)/2);\n    return 0;\n}", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou are given two positive integers a and b.\nLet x be the average of a and b.\nPrint x rounded up to the nearest integer.\n\nConstraints\n\na and b are integers.\n\n1 \\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 x rounded up to the nearest integer.\n\nSample Input 1\n\n1 3\n\nSample Output 1\n\n2\n\nThe average of 1 and 3 is 2.0, and it will be rounded up to the nearest integer, 2.\n\nSample Input 2\n\n7 4\n\nSample Output 2\n\n6\n\nThe average of 7 and 4 is 5.5, and it will be rounded up to the nearest integer, 6.\n\nSample Input 3\n\n5 5\n\nSample Output 3\n\n5", "sample_input": "1 3\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03485", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou are given two positive integers a and b.\nLet x be the average of a and b.\nPrint x rounded up to the nearest integer.\n\nConstraints\n\na and b are integers.\n\n1 \\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 x rounded up to the nearest integer.\n\nSample Input 1\n\n1 3\n\nSample Output 1\n\n2\n\nThe average of 1 and 3 is 2.0, and it will be rounded up to the nearest integer, 2.\n\nSample Input 2\n\n7 4\n\nSample Output 2\n\n6\n\nThe average of 7 and 4 is 5.5, and it will be rounded up to the nearest integer, 6.\n\nSample Input 3\n\n5 5\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": 120, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s498611444", "group_id": "codeNet:p03486", "input_text": "#include <stdio.h>\n#include <string.h>\n#include <math.h>\n#include <stdlib.h>\n#include <limits.h>\n#include <stdbool.h>\n\n#define rep(i, n) for(int i=0; i<(n); ++i)\n#define max  200001\n\n//qsort(str, n, sizeof(int), up_comp);\nint up_comp(const void *a, const void *b){return *(int*)a - *(int*)b;}\nint down_comp(const void *a, const void *b){return *(int*)b - *(int*)a;}\nint int_sort( const void * a , const void * b ) {return strcmp(( char * )a , ( char * )b );}\nint count_digit(int a){int i=0;while(a!=0){a=a/10;i++;}return i;}\nint euclid( int a, int b ){int temp;if(a<b){temp=a;a=b;b=temp;}if(b<1)return -1;if(a%b==0) return b;return euclid(b,a%b);}\n\nint main(void){\n    \n    int lens, lent;\n    char s[max], t[max], tmp;\n    \n    scanf(\"%s%s\", s, t);\n    \n    lens=strlen(s);\n    lent=strlen(t);\n    \n    for (int i=0; i<lens; i++) {\n        for (int j=i+1; j<lens; j++) {\n            if (s[i]>s[j]) {\n                tmp=s[i];\n                s[i]=s[j];\n                s[j]=tmp;\n            }\n        }\n    }\n    \n    for (int i=0; i<lent; i++) {\n        for (int j=i+1; j<lent; j++) {\n            if (t[i]<t[j]) {\n                tmp=t[i];\n                t[i]=t[j];\n                t[j]=tmp;\n            }\n        }\n    }\n\n    if (strcmp(s, t)<0) {\n        printf(\"Yes\");\n    } else {\n        printf(\"No\");\n    }\n\n    return 0;\n}\n", "language": "C", "metadata": {"date": 1597136298, "filename_ext": "c", "original_language": "C (GCC 9.2.1)", "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/C/s498611444.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s498611444", "user_id": "u645174893"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "#include <stdio.h>\n#include <string.h>\n#include <math.h>\n#include <stdlib.h>\n#include <limits.h>\n#include <stdbool.h>\n\n#define rep(i, n) for(int i=0; i<(n); ++i)\n#define max  200001\n\n//qsort(str, n, sizeof(int), up_comp);\nint up_comp(const void *a, const void *b){return *(int*)a - *(int*)b;}\nint down_comp(const void *a, const void *b){return *(int*)b - *(int*)a;}\nint int_sort( const void * a , const void * b ) {return strcmp(( char * )a , ( char * )b );}\nint count_digit(int a){int i=0;while(a!=0){a=a/10;i++;}return i;}\nint euclid( int a, int b ){int temp;if(a<b){temp=a;a=b;b=temp;}if(b<1)return -1;if(a%b==0) return b;return euclid(b,a%b);}\n\nint main(void){\n    \n    int lens, lent;\n    char s[max], t[max], tmp;\n    \n    scanf(\"%s%s\", s, t);\n    \n    lens=strlen(s);\n    lent=strlen(t);\n    \n    for (int i=0; i<lens; i++) {\n        for (int j=i+1; j<lens; j++) {\n            if (s[i]>s[j]) {\n                tmp=s[i];\n                s[i]=s[j];\n                s[j]=tmp;\n            }\n        }\n    }\n    \n    for (int i=0; i<lent; i++) {\n        for (int j=i+1; j<lent; j++) {\n            if (t[i]<t[j]) {\n                tmp=t[i];\n                t[i]=t[j];\n                t[j]=tmp;\n            }\n        }\n    }\n\n    if (strcmp(s, t)<0) {\n        printf(\"Yes\");\n    } else {\n        printf(\"No\");\n    }\n\n    return 0;\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": 1333, "cpu_time_ms": 6, "memory_kb": 1732}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s689845590", "group_id": "codeNet:p03488", "input_text": "#include <stdio.h>\n#include <stdlib.h>\n#include <stdbool.h>\n#include <string.h>\n#include <math.h>\n#include <limits.h>\n#define Max(a, b) ((a) > (b) ? (a) : (b))\n#define Min(a, b) ((a) > (b) ? (b) : (a))\n#define abs(x) ((x) > 0 ? (x) : -(x))\n#define MOD (ll)1000000007 //10^9 + 7\n#define endl printf(\"\\n\")\ntypedef long long ll;\n#define MAX_N (1 << 17)\n\nbool judge(int *a, int n, int x, bool dp[5010][9010]) {\n  dp[0][0] = true;\n  for (int i = 0; i < n; i++) {\n    for (int j = 0; j <= x; j++) {\n      dp[i + 1][j] = dp[i][j];\n      if (j - a[i] >= 0) dp[i + 1][j] |= dp[i][j - a[i]];\n    }\n  }\n  return dp[n][x];\n}\n\nbool dp1[5010][9010], dp2[5010][9010];\n\nint\nmain(int argc, char *argv[])\n{\n  int a[9010], x, y;\n  char s[9010];\n  scanf(\"%s\", s);\n  scanf(\"%d %d\", &x, &y);\n\n  int k = 0, l = 0;\n  int n = strlen(s);\n  while (k < n) {\n    int j = k;\n    while (s[j] == 'F') j++;\n    a[l++] = j - k;\n    k = j + 1;\n  }\n  for (int i = 0; i < l; i++) printf(\"%d \", a[i]); endl;\n\n  int b[9000], c[9000], e = 0, o = 0;\n  int sum1 = 0, sum2 = 0;\n  for (int i = 0; i < l; i++) {\n    if (i % 2 == 0) sum1 += (b[e++] = a[i]);\n    else sum2 += (c[o++] = a[i]);\n  }\n\n  int p = sum1 - x, q = sum2 - y;\n  if (p % 2 == 0 && q % 2 == 0 && p >= 0 && q >= 0) {\n    if (judge(b, e, p / 2, dp1) && judge(c, o, q / 2, dp2)) {\n      printf(\"Yes\\n\");\n      return 0;\n    }\n  }\n\n  printf(\"No\\n\");\n\n  \n\n  return 0;\n}\n", "language": "C", "metadata": {"date": 1567146016, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "problem_description_relpath": "problem_descriptions/p03488.html", "problem_id": "p03488", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03488/input.txt", "sample_output_relpath": "derived/input_output/data/p03488/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03488/C/s689845590.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s689845590", "user_id": "u801102476"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "#include <stdio.h>\n#include <stdlib.h>\n#include <stdbool.h>\n#include <string.h>\n#include <math.h>\n#include <limits.h>\n#define Max(a, b) ((a) > (b) ? (a) : (b))\n#define Min(a, b) ((a) > (b) ? (b) : (a))\n#define abs(x) ((x) > 0 ? (x) : -(x))\n#define MOD (ll)1000000007 //10^9 + 7\n#define endl printf(\"\\n\")\ntypedef long long ll;\n#define MAX_N (1 << 17)\n\nbool judge(int *a, int n, int x, bool dp[5010][9010]) {\n  dp[0][0] = true;\n  for (int i = 0; i < n; i++) {\n    for (int j = 0; j <= x; j++) {\n      dp[i + 1][j] = dp[i][j];\n      if (j - a[i] >= 0) dp[i + 1][j] |= dp[i][j - a[i]];\n    }\n  }\n  return dp[n][x];\n}\n\nbool dp1[5010][9010], dp2[5010][9010];\n\nint\nmain(int argc, char *argv[])\n{\n  int a[9010], x, y;\n  char s[9010];\n  scanf(\"%s\", s);\n  scanf(\"%d %d\", &x, &y);\n\n  int k = 0, l = 0;\n  int n = strlen(s);\n  while (k < n) {\n    int j = k;\n    while (s[j] == 'F') j++;\n    a[l++] = j - k;\n    k = j + 1;\n  }\n  for (int i = 0; i < l; i++) printf(\"%d \", a[i]); endl;\n\n  int b[9000], c[9000], e = 0, o = 0;\n  int sum1 = 0, sum2 = 0;\n  for (int i = 0; i < l; i++) {\n    if (i % 2 == 0) sum1 += (b[e++] = a[i]);\n    else sum2 += (c[o++] = a[i]);\n  }\n\n  int p = sum1 - x, q = sum2 - y;\n  if (p % 2 == 0 && q % 2 == 0 && p >= 0 && q >= 0) {\n    if (judge(b, e, p / 2, dp1) && judge(c, o, q / 2, dp2)) {\n      printf(\"Yes\\n\");\n      return 0;\n    }\n  }\n\n  printf(\"No\\n\");\n\n  \n\n  return 0;\n}\n", "problem_context": "Score : 500 points\n\nProblem Statement\n\nA robot is put at the origin in a two-dimensional plane.\nInitially, the robot is facing in the positive x-axis direction.\n\nThis robot will be given an instruction sequence s.\ns consists of the following two kinds of letters, and will be executed in order from front to back.\n\nF : Move in the current direction by distance 1.\n\nT : Turn 90 degrees, either clockwise or counterclockwise.\n\nThe objective of the robot is to be at coordinates (x, y) after all the instructions are executed.\nDetermine whether this objective is achievable.\n\nConstraints\n\ns consists of F and T.\n\n1 \\leq |s| \\leq 8 000\n\nx and y are integers.\n\n|x|, |y| \\leq |s|\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns\nx y\n\nOutput\n\nIf the objective is achievable, print Yes; if it is not, print No.\n\nSample Input 1\n\nFTFFTFFF\n4 2\n\nSample Output 1\n\nYes\n\nThe objective can be achieved by, for example, turning counterclockwise in the first T and turning clockwise in the second T.\n\nSample Input 2\n\nFTFFTFFF\n-2 -2\n\nSample Output 2\n\nYes\n\nThe objective can be achieved by, for example, turning clockwise in the first T and turning clockwise in the second T.\n\nSample Input 3\n\nFF\n1 0\n\nSample Output 3\n\nNo\n\nSample Input 4\n\nTF\n1 0\n\nSample Output 4\n\nNo\n\nSample Input 5\n\nFFTTFF\n0 0\n\nSample Output 5\n\nYes\n\nThe objective can be achieved by, for example, turning counterclockwise in the first T and turning counterclockwise in the second T.\n\nSample Input 6\n\nTTTT\n1 0\n\nSample Output 6\n\nNo", "sample_input": "FTFFTFFF\n4 2\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p03488", "source_text": "Score : 500 points\n\nProblem Statement\n\nA robot is put at the origin in a two-dimensional plane.\nInitially, the robot is facing in the positive x-axis direction.\n\nThis robot will be given an instruction sequence s.\ns consists of the following two kinds of letters, and will be executed in order from front to back.\n\nF : Move in the current direction by distance 1.\n\nT : Turn 90 degrees, either clockwise or counterclockwise.\n\nThe objective of the robot is to be at coordinates (x, y) after all the instructions are executed.\nDetermine whether this objective is achievable.\n\nConstraints\n\ns consists of F and T.\n\n1 \\leq |s| \\leq 8 000\n\nx and y are integers.\n\n|x|, |y| \\leq |s|\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns\nx y\n\nOutput\n\nIf the objective is achievable, print Yes; if it is not, print No.\n\nSample Input 1\n\nFTFFTFFF\n4 2\n\nSample Output 1\n\nYes\n\nThe objective can be achieved by, for example, turning counterclockwise in the first T and turning clockwise in the second T.\n\nSample Input 2\n\nFTFFTFFF\n-2 -2\n\nSample Output 2\n\nYes\n\nThe objective can be achieved by, for example, turning clockwise in the first T and turning clockwise in the second T.\n\nSample Input 3\n\nFF\n1 0\n\nSample Output 3\n\nNo\n\nSample Input 4\n\nTF\n1 0\n\nSample Output 4\n\nNo\n\nSample Input 5\n\nFFTTFF\n0 0\n\nSample Output 5\n\nYes\n\nThe objective can be achieved by, for example, turning counterclockwise in the first T and turning counterclockwise in the second T.\n\nSample Input 6\n\nTTTT\n1 0\n\nSample Output 6\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": 1388, "cpu_time_ms": 20, "memory_kb": 70784}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s839975657", "group_id": "codeNet:p03494", "input_text": "\n#include<stdio.h>\nint main(void){\n\tint n,a[201],i,cnt=-1,flag=1;\n\tscanf(\"%d\",&n);\n\tfor(i=0;i<n;i++)scanf(\"%d\",&a[i]);\n\twhile(flag==1){\n\t\tfor(i=0;i<n;i++){\n\t\t\tif(a[i]%2==1)flag=0;\n\t\t\ta[i]/=2;\n\t\t}\n\tcnt++;\n\t}\n\tprintf(\"%d\\n\",cnt);\n\treturn 0;\n}\n", "language": "C", "metadata": {"date": 1527708091, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "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/C/s839975657.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s839975657", "user_id": "u505420467"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "\n#include<stdio.h>\nint main(void){\n\tint n,a[201],i,cnt=-1,flag=1;\n\tscanf(\"%d\",&n);\n\tfor(i=0;i<n;i++)scanf(\"%d\",&a[i]);\n\twhile(flag==1){\n\t\tfor(i=0;i<n;i++){\n\t\t\tif(a[i]%2==1)flag=0;\n\t\t\ta[i]/=2;\n\t\t}\n\tcnt++;\n\t}\n\tprintf(\"%d\\n\",cnt);\n\treturn 0;\n}\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": 241, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s219262412", "group_id": "codeNet:p03495", "input_text": "#include <stdio.h>\n#include <stdlib.h>\n#define maxN 200000\n\nint asc(const void *a, const void *b){\n  return *(int *)a - *(int *)b;\n}\n\nint\nmain(int argc, char *argv[])\n{\n  int n, k, a, c[maxN] = {}, max = 0;\n  scanf(\"%d %d\", &n, &k);\n  for(int i = 0; i < n; i++){\n    scanf(\"%d\", &a);\n    max = (max > a ? max : a);\n    c[a - 1]++;\n  }\n  \n\n  qsort(c, max, sizeof(int), asc);\n\n  \n  int i = 0; int l = 0; int z = 0;\n  while(max > k){\n    if(c[i] == 0) max--;\n    else{\n      l += c[i];\n      max--;\n    }\n    i++;\n  }\n\n  printf(\"%d\\n\", l);\n\n  return 0;\n}\n", "language": "C", "metadata": {"date": 1560924697, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "problem_description_relpath": "problem_descriptions/p03495.html", "problem_id": "p03495", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03495/input.txt", "sample_output_relpath": "derived/input_output/data/p03495/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03495/C/s219262412.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s219262412", "user_id": "u801102476"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "#include <stdio.h>\n#include <stdlib.h>\n#define maxN 200000\n\nint asc(const void *a, const void *b){\n  return *(int *)a - *(int *)b;\n}\n\nint\nmain(int argc, char *argv[])\n{\n  int n, k, a, c[maxN] = {}, max = 0;\n  scanf(\"%d %d\", &n, &k);\n  for(int i = 0; i < n; i++){\n    scanf(\"%d\", &a);\n    max = (max > a ? max : a);\n    c[a - 1]++;\n  }\n  \n\n  qsort(c, max, sizeof(int), asc);\n\n  \n  int i = 0; int l = 0; int z = 0;\n  while(max > k){\n    if(c[i] == 0) max--;\n    else{\n      l += c[i];\n      max--;\n    }\n    i++;\n  }\n\n  printf(\"%d\\n\", l);\n\n  return 0;\n}\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nTakahashi has N balls. Initially, an integer A_i is written on the i-th ball.\n\nHe would like to rewrite the integer on some balls so that there are at most K different integers written on the N balls.\n\nFind the minimum number of balls that Takahashi needs to rewrite the integers on them.\n\nConstraints\n\n1 \\leq K \\leq N \\leq 200000\n\n1 \\leq A_i \\leq 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 A_2 ... A_N\n\nOutput\n\nPrint the minimum number of balls that Takahashi needs to rewrite the integers on them.\n\nSample Input 1\n\n5 2\n1 1 2 2 5\n\nSample Output 1\n\n1\n\nFor example, if we rewrite the integer on the fifth ball to 2, there are two different integers written on the balls: 1 and 2.\nOn the other hand, it is not possible to rewrite the integers on zero balls so that there are at most two different integers written on the balls, so we should print 1.\n\nSample Input 2\n\n4 4\n1 1 2 2\n\nSample Output 2\n\n0\n\nAlready in the beginning, there are two different integers written on the balls, so we do not need to rewrite anything.\n\nSample Input 3\n\n10 3\n5 1 3 2 4 1 1 2 3 4\n\nSample Output 3\n\n3", "sample_input": "5 2\n1 1 2 2 5\n"}, "reference_outputs": ["1\n"], "source_document_id": "p03495", "source_text": "Score : 300 points\n\nProblem Statement\n\nTakahashi has N balls. Initially, an integer A_i is written on the i-th ball.\n\nHe would like to rewrite the integer on some balls so that there are at most K different integers written on the N balls.\n\nFind the minimum number of balls that Takahashi needs to rewrite the integers on them.\n\nConstraints\n\n1 \\leq K \\leq N \\leq 200000\n\n1 \\leq A_i \\leq 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 A_2 ... A_N\n\nOutput\n\nPrint the minimum number of balls that Takahashi needs to rewrite the integers on them.\n\nSample Input 1\n\n5 2\n1 1 2 2 5\n\nSample Output 1\n\n1\n\nFor example, if we rewrite the integer on the fifth ball to 2, there are two different integers written on the balls: 1 and 2.\nOn the other hand, it is not possible to rewrite the integers on zero balls so that there are at most two different integers written on the balls, so we should print 1.\n\nSample Input 2\n\n4 4\n1 1 2 2\n\nSample Output 2\n\n0\n\nAlready in the beginning, there are two different integers written on the balls, so we do not need to rewrite anything.\n\nSample Input 3\n\n10 3\n5 1 3 2 4 1 1 2 3 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": 552, "cpu_time_ms": 35, "memory_kb": 1788}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s498167925", "group_id": "codeNet:p03495", "input_text": "#include <stdio.h>\n#define FOR(i,a,b) for(int i=a;i<b;i++)\n#define REP(i,n)  FOR(i,0,n)\n\nint main() {\n\tint n, k, a;\n\tint num[200000], max, arg, sum = 0;\n\tscanf(\"%d%d\",&n,&k);\n\tREP(i,n) num[i] = 0;\n\tREP(i,n) {\n\t\tscanf(\"%d\",&a);\n\t\tnum[a-1]++;\n\t}\n\tint tmp[n];\n\tREP(i,n) tmp[i] = 0;\n\tREP(i,n) tmp[num[i]]++;\n\targ = 0;\n\tREP(i,n) REP(j,tmp[n-1-i]) num[arg++] = n-1-i;\n\tREP(i,k) sum += num[i];\n\tprintf(\"%d\",n - sum);\n\treturn 0;\n}", "language": "C", "metadata": {"date": 1519148812, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "problem_description_relpath": "problem_descriptions/p03495.html", "problem_id": "p03495", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03495/input.txt", "sample_output_relpath": "derived/input_output/data/p03495/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03495/C/s498167925.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s498167925", "user_id": "u480472958"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "#include <stdio.h>\n#define FOR(i,a,b) for(int i=a;i<b;i++)\n#define REP(i,n)  FOR(i,0,n)\n\nint main() {\n\tint n, k, a;\n\tint num[200000], max, arg, sum = 0;\n\tscanf(\"%d%d\",&n,&k);\n\tREP(i,n) num[i] = 0;\n\tREP(i,n) {\n\t\tscanf(\"%d\",&a);\n\t\tnum[a-1]++;\n\t}\n\tint tmp[n];\n\tREP(i,n) tmp[i] = 0;\n\tREP(i,n) tmp[num[i]]++;\n\targ = 0;\n\tREP(i,n) REP(j,tmp[n-1-i]) num[arg++] = n-1-i;\n\tREP(i,k) sum += num[i];\n\tprintf(\"%d\",n - sum);\n\treturn 0;\n}", "problem_context": "Score : 300 points\n\nProblem Statement\n\nTakahashi has N balls. Initially, an integer A_i is written on the i-th ball.\n\nHe would like to rewrite the integer on some balls so that there are at most K different integers written on the N balls.\n\nFind the minimum number of balls that Takahashi needs to rewrite the integers on them.\n\nConstraints\n\n1 \\leq K \\leq N \\leq 200000\n\n1 \\leq A_i \\leq 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 A_2 ... A_N\n\nOutput\n\nPrint the minimum number of balls that Takahashi needs to rewrite the integers on them.\n\nSample Input 1\n\n5 2\n1 1 2 2 5\n\nSample Output 1\n\n1\n\nFor example, if we rewrite the integer on the fifth ball to 2, there are two different integers written on the balls: 1 and 2.\nOn the other hand, it is not possible to rewrite the integers on zero balls so that there are at most two different integers written on the balls, so we should print 1.\n\nSample Input 2\n\n4 4\n1 1 2 2\n\nSample Output 2\n\n0\n\nAlready in the beginning, there are two different integers written on the balls, so we do not need to rewrite anything.\n\nSample Input 3\n\n10 3\n5 1 3 2 4 1 1 2 3 4\n\nSample Output 3\n\n3", "sample_input": "5 2\n1 1 2 2 5\n"}, "reference_outputs": ["1\n"], "source_document_id": "p03495", "source_text": "Score : 300 points\n\nProblem Statement\n\nTakahashi has N balls. Initially, an integer A_i is written on the i-th ball.\n\nHe would like to rewrite the integer on some balls so that there are at most K different integers written on the N balls.\n\nFind the minimum number of balls that Takahashi needs to rewrite the integers on them.\n\nConstraints\n\n1 \\leq K \\leq N \\leq 200000\n\n1 \\leq A_i \\leq 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 A_2 ... A_N\n\nOutput\n\nPrint the minimum number of balls that Takahashi needs to rewrite the integers on them.\n\nSample Input 1\n\n5 2\n1 1 2 2 5\n\nSample Output 1\n\n1\n\nFor example, if we rewrite the integer on the fifth ball to 2, there are two different integers written on the balls: 1 and 2.\nOn the other hand, it is not possible to rewrite the integers on zero balls so that there are at most two different integers written on the balls, so we should print 1.\n\nSample Input 2\n\n4 4\n1 1 2 2\n\nSample Output 2\n\n0\n\nAlready in the beginning, there are two different integers written on the balls, so we do not need to rewrite anything.\n\nSample Input 3\n\n10 3\n5 1 3 2 4 1 1 2 3 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": 422, "cpu_time_ms": 24, "memory_kb": 1664}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s699622831", "group_id": "codeNet:p03502", "input_text": "#include <stdio.h>\n#include <string.h>\n#include <math.h>\nint main(void){\n    \n    int i,a=0,b=0;\n    char s[10];\n    \n    scanf(\"%s\",s);\n    \n    for(i=0;i<strlen(s);i++){\n        a=a+(s[i]-'0')*(int)pow(10,strlen(s)-i);\n        b=b+s[i]-'0';\n    }\n    \n    if(a%b==0) printf(\"Yes\\n\");\n    else printf(\"No\\n\");\n    \n    return 0;\n}", "language": "C", "metadata": {"date": 1595039187, "filename_ext": "c", "original_language": "C (GCC 9.2.1)", "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/C/s699622831.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s699622831", "user_id": "u994745046"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "#include <stdio.h>\n#include <string.h>\n#include <math.h>\nint main(void){\n    \n    int i,a=0,b=0;\n    char s[10];\n    \n    scanf(\"%s\",s);\n    \n    for(i=0;i<strlen(s);i++){\n        a=a+(s[i]-'0')*(int)pow(10,strlen(s)-i);\n        b=b+s[i]-'0';\n    }\n    \n    if(a%b==0) printf(\"Yes\\n\");\n    else printf(\"No\\n\");\n    \n    return 0;\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": 331, "cpu_time_ms": 5, "memory_kb": 2532}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s908120880", "group_id": "codeNet:p03502", "input_text": "#include<stdio.h>\nint main(){\n    int a,b=0,c;\n    scanf(\"%d\",&a);c=a;\n    while(c){\n        b+=(c%10);\n        c=c/10;\n    }\n    b=a%b;\n    if(b==0){\n        printf(\"Yes\\n\");\n    }else{\n        printf(\"No\\n\");\n    }\n    return 0;\n}\n", "language": "C", "metadata": {"date": 1517697544, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "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/C/s908120880.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s908120880", "user_id": "u018679195"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "#include<stdio.h>\nint main(){\n    int a,b=0,c;\n    scanf(\"%d\",&a);c=a;\n    while(c){\n        b+=(c%10);\n        c=c/10;\n    }\n    b=a%b;\n    if(b==0){\n        printf(\"Yes\\n\");\n    }else{\n        printf(\"No\\n\");\n    }\n    return 0;\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": 233, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s770638937", "group_id": "codeNet:p03503", "input_text": "#include <stdio.h>\n#include <stdlib.h>\n#include <string.h>\n#include <math.h>\nint n, c[10], f[100][10], p[100][11];\nlong long int max=-1000000000;\nvoid check(int o){\n  if(o==0) return;\n  int i;\n  long long int sum=0;\n  for(i=0;i<n;i++) sum+=p[i][c[i]];\n  if(max<sum) max=sum;\n}\n\nvoid func(int j, int o){\n  if(j==10){check(o); return;}\n  int i;\n  for(i=0;i<n;i++) if(f[i][j]==1) c[i]++;\n  func(j+1, o+1);\n  for(i=0;i<n;i++) if(f[i][j]==1) c[i]--;\n  func(j+1, o);\n}\n\nint main(void){\n  int i, j;\n  scanf(\"%d\",&n);\n  for(i=0;i<n;i++) for(j=0;j<10;j++) scanf(\"%d\",&f[i][j]);\n  for(i=0;i<n;i++) for(j=0;j<11;j++) scanf(\"%d\",&p[i][j]);\n  for(i=0;i<10;i++) c[i]=0;\n  func(0, 0);\n  printf(\"%lld\\n\",max);\n  return 0;\n}\n", "language": "C", "metadata": {"date": 1512357087, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "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/C/s770638937.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s770638937", "user_id": "u335733930"}, "prompt_components": {"gold_output": "8\n", "input_to_evaluate": "#include <stdio.h>\n#include <stdlib.h>\n#include <string.h>\n#include <math.h>\nint n, c[10], f[100][10], p[100][11];\nlong long int max=-1000000000;\nvoid check(int o){\n  if(o==0) return;\n  int i;\n  long long int sum=0;\n  for(i=0;i<n;i++) sum+=p[i][c[i]];\n  if(max<sum) max=sum;\n}\n\nvoid func(int j, int o){\n  if(j==10){check(o); return;}\n  int i;\n  for(i=0;i<n;i++) if(f[i][j]==1) c[i]++;\n  func(j+1, o+1);\n  for(i=0;i<n;i++) if(f[i][j]==1) c[i]--;\n  func(j+1, o);\n}\n\nint main(void){\n  int i, j;\n  scanf(\"%d\",&n);\n  for(i=0;i<n;i++) for(j=0;j<10;j++) scanf(\"%d\",&f[i][j]);\n  for(i=0;i<n;i++) for(j=0;j<11;j++) scanf(\"%d\",&p[i][j]);\n  for(i=0;i<10;i++) c[i]=0;\n  func(0, 0);\n  printf(\"%lld\\n\",max);\n  return 0;\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": 708, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s413410985", "group_id": "codeNet:p03505", "input_text": "#include<stdio.h>\nint main()\n{\n    unsigned long long int k, a, b;\n    scanf(\"%lld %lld %lld\", &k, &a, &b);\n    if (a <= b)\n    {\n        if (k <= a)\n            printf(\"1\\n\");\n        else\n            printf(\"-1\\n\");\n        return 0;\n    }\n    k -= b;\n    a -= b;\n    printf(\"%lld\\n\", 2 * ((k + a - 1) / a) - 1);\n    return 0;\n}", "language": "C", "metadata": {"date": 1550966383, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "problem_description_relpath": "problem_descriptions/p03505.html", "problem_id": "p03505", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03505/input.txt", "sample_output_relpath": "derived/input_output/data/p03505/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03505/C/s413410985.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s413410985", "user_id": "u600300412"}, "prompt_components": {"gold_output": "5\n", "input_to_evaluate": "#include<stdio.h>\nint main()\n{\n    unsigned long long int k, a, b;\n    scanf(\"%lld %lld %lld\", &k, &a, &b);\n    if (a <= b)\n    {\n        if (k <= a)\n            printf(\"1\\n\");\n        else\n            printf(\"-1\\n\");\n        return 0;\n    }\n    k -= b;\n    a -= b;\n    printf(\"%lld\\n\", 2 * ((k + a - 1) / a) - 1);\n    return 0;\n}", "problem_context": "Score : 100 points\n\nProblem Statement\n\nButCoder Inc. runs a programming competition site called ButCoder. In this site, a user is given an integer value called rating that represents his/her skill, which changes each time he/she participates in a contest. The initial value of a new user's rating is 0, and a user whose rating reaches K or higher is called Kaiden (\"total transmission\"). Note that a user's rating may become negative.\n\nHikuhashi is a new user in ButCoder. It is estimated that, his rating increases by A in each of his odd-numbered contests (first, third, fifth, ...), and decreases by B in each of his even-numbered contests (second, fourth, sixth, ...).\n\nAccording to this estimate, after how many contests will he become Kaiden for the first time, or will he never become Kaiden?\n\nConstraints\n\n1 ≤ K, A, B ≤ 10^{18}\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nK A B\n\nOutput\n\nIf it is estimated that Hikuhashi will never become Kaiden, print -1. Otherwise, print the estimated number of contests before he become Kaiden for the first time.\n\nSample Input 1\n\n4000 2000 500\n\nSample Output 1\n\n5\n\nEach time Hikuhashi participates in a contest, his rating is estimated to change as 0 → 2000 → 1500 → 3500 → 3000 → 5000 → … After his fifth contest, his rating will reach 4000 or higher for the first time.\n\nSample Input 2\n\n4000 500 2000\n\nSample Output 2\n\n-1\n\nEach time Hikuhashi participates in a contest, his rating is estimated to change as 0 → 500 → -1500 → -1000 → -3000 → -2500 → … He will never become Kaiden.\n\nSample Input 3\n\n1000000000000000000 2 1\n\nSample Output 3\n\n1999999999999999997\n\nThe input and output values may not fit into 32-bit integers.", "sample_input": "4000 2000 500\n"}, "reference_outputs": ["5\n"], "source_document_id": "p03505", "source_text": "Score : 100 points\n\nProblem Statement\n\nButCoder Inc. runs a programming competition site called ButCoder. In this site, a user is given an integer value called rating that represents his/her skill, which changes each time he/she participates in a contest. The initial value of a new user's rating is 0, and a user whose rating reaches K or higher is called Kaiden (\"total transmission\"). Note that a user's rating may become negative.\n\nHikuhashi is a new user in ButCoder. It is estimated that, his rating increases by A in each of his odd-numbered contests (first, third, fifth, ...), and decreases by B in each of his even-numbered contests (second, fourth, sixth, ...).\n\nAccording to this estimate, after how many contests will he become Kaiden for the first time, or will he never become Kaiden?\n\nConstraints\n\n1 ≤ K, A, B ≤ 10^{18}\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nK A B\n\nOutput\n\nIf it is estimated that Hikuhashi will never become Kaiden, print -1. Otherwise, print the estimated number of contests before he become Kaiden for the first time.\n\nSample Input 1\n\n4000 2000 500\n\nSample Output 1\n\n5\n\nEach time Hikuhashi participates in a contest, his rating is estimated to change as 0 → 2000 → 1500 → 3500 → 3000 → 5000 → … After his fifth contest, his rating will reach 4000 or higher for the first time.\n\nSample Input 2\n\n4000 500 2000\n\nSample Output 2\n\n-1\n\nEach time Hikuhashi participates in a contest, his rating is estimated to change as 0 → 500 → -1500 → -1000 → -3000 → -2500 → … He will never become Kaiden.\n\nSample Input 3\n\n1000000000000000000 2 1\n\nSample Output 3\n\n1999999999999999997\n\nThe input and output values 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": 330, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s533316637", "group_id": "codeNet:p03523", "input_text": "#include <stdio.h>\n#include <stdlib.h>\n#include <string.h>\nint main(void){\nchar s[100];\nint count,flg=0,counthoji;\nchar tmp;\nchar ans[]=\"KIHBR\";\nscanf(\"%s\",s);\nfor(;;){\nflg=0;\nfor(count=0;s[count]!='\\0';count++){\nif(s[count]=='A'){s[count]='0';flg=1;counthoji=count;break;}\n}\nif(flg==0){break;}\nfor(count=counthoji;;count++){\ns[count]=s[count+1];\nif(s[count]=='\\0'){break;}\n}\n\n}\nif(strcmp(s,ans) == 0){printf(\"YES\");}\nelse{printf(\"NO\");}\n\n\nreturn 0;\n}", "language": "C", "metadata": {"date": 1568940286, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "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/C/s533316637.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s533316637", "user_id": "u932514381"}, "prompt_components": {"gold_output": "YES\n", "input_to_evaluate": "#include <stdio.h>\n#include <stdlib.h>\n#include <string.h>\nint main(void){\nchar s[100];\nint count,flg=0,counthoji;\nchar tmp;\nchar ans[]=\"KIHBR\";\nscanf(\"%s\",s);\nfor(;;){\nflg=0;\nfor(count=0;s[count]!='\\0';count++){\nif(s[count]=='A'){s[count]='0';flg=1;counthoji=count;break;}\n}\nif(flg==0){break;}\nfor(count=counthoji;;count++){\ns[count]=s[count+1];\nif(s[count]=='\\0'){break;}\n}\n\n}\nif(strcmp(s,ans) == 0){printf(\"YES\");}\nelse{printf(\"NO\");}\n\n\nreturn 0;\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": 451, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s671015767", "group_id": "codeNet:p03533", "input_text": "#include <stdio.h>\n#include <string.h>\n\nint main(void)\n{\n\tint i,len,same=0,cor=0,j;\n\tchar s[51],kihbr[]={'K','I','H','B','R'};\n\tchar correct[]={'K','I','H','.','B','.','R'};\n\tscanf(\"%s\",s);len=strlen(s);\n\tif(len>10)\n\t{\n\t\tprintf(\"NO\");\n\t\treturn 0;\n\t}\n\tfor(i=0;i<len;i++)\n\t{\n\t    //printf(\"%c %c (cor=%d same=%d)\\n\",s[i],correct[cor],cor,same);\n\t\tif(s[i]==correct[cor])\n\t\t{\n\t\t    for(j=same;j<5;j++) if(s[i]==kihbr[j]) same++;\n\t\t    cor++;\n\t\t}\n\t\telse if(correct[cor]=='.')\n\t\t{\n\t\t\tcor++;\n\t\t\tfor(j=same;j<5;j++) \n\t\t\t\tif(s[i]==kihbr[j])\n\t\t\t\t{\n\t\t\t\t\ti--;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t}\n\t\telse\n\t\t{\n\t\t    if(same!=0) i--;\n\t\t    same=cor=0;\n\t\t}\n\t\t    \n\t\tif(same==5) break;\n\t}\n\tif(same==5) printf(\"YES\");\n\telse printf(\"NO\");\n\treturn 0;\n}", "language": "C", "metadata": {"date": 1567622175, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "problem_description_relpath": "problem_descriptions/p03533.html", "problem_id": "p03533", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03533/input.txt", "sample_output_relpath": "derived/input_output/data/p03533/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03533/C/s671015767.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s671015767", "user_id": "u763410402"}, "prompt_components": {"gold_output": "YES\n", "input_to_evaluate": "#include <stdio.h>\n#include <string.h>\n\nint main(void)\n{\n\tint i,len,same=0,cor=0,j;\n\tchar s[51],kihbr[]={'K','I','H','B','R'};\n\tchar correct[]={'K','I','H','.','B','.','R'};\n\tscanf(\"%s\",s);len=strlen(s);\n\tif(len>10)\n\t{\n\t\tprintf(\"NO\");\n\t\treturn 0;\n\t}\n\tfor(i=0;i<len;i++)\n\t{\n\t    //printf(\"%c %c (cor=%d same=%d)\\n\",s[i],correct[cor],cor,same);\n\t\tif(s[i]==correct[cor])\n\t\t{\n\t\t    for(j=same;j<5;j++) if(s[i]==kihbr[j]) same++;\n\t\t    cor++;\n\t\t}\n\t\telse if(correct[cor]=='.')\n\t\t{\n\t\t\tcor++;\n\t\t\tfor(j=same;j<5;j++) \n\t\t\t\tif(s[i]==kihbr[j])\n\t\t\t\t{\n\t\t\t\t\ti--;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t}\n\t\telse\n\t\t{\n\t\t    if(same!=0) i--;\n\t\t    same=cor=0;\n\t\t}\n\t\t    \n\t\tif(same==5) break;\n\t}\n\tif(same==5) printf(\"YES\");\n\telse printf(\"NO\");\n\treturn 0;\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": "p03533", "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": 717, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s049093616", "group_id": "codeNet:p03543", "input_text": "#include <stdio.h>\n \nint main()\n{\n    char N[5];\n    int i,yn=1;\n \n    scanf(\"%s\",N);\n \n    for(i=0;i<2;i++){\n        if(N[i]!=N[i+1]){\n            yn = 0;\n            break;\n        }\n        if(i==1){\n            yn = 1;\n            printf(\"Yes\\n\");\n            return 0;\n        }\n    }\n    \n    for(i=3;i>1;i--){\n        if(N[i]!=N[i-1]){\n            yn = 0;\n            break;\n        }        \n        if(i==2){\n            yn = 1;\n            printf(\"Yes\\n\");\n            return 0;\n        }\n    }\n \n    printf(\"No\\n\");\n \n    return 0;\n}", "language": "C", "metadata": {"date": 1517031226, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "problem_description_relpath": "problem_descriptions/p03543.html", "problem_id": "p03543", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03543/input.txt", "sample_output_relpath": "derived/input_output/data/p03543/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03543/C/s049093616.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s049093616", "user_id": "u481526887"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "#include <stdio.h>\n \nint main()\n{\n    char N[5];\n    int i,yn=1;\n \n    scanf(\"%s\",N);\n \n    for(i=0;i<2;i++){\n        if(N[i]!=N[i+1]){\n            yn = 0;\n            break;\n        }\n        if(i==1){\n            yn = 1;\n            printf(\"Yes\\n\");\n            return 0;\n        }\n    }\n    \n    for(i=3;i>1;i--){\n        if(N[i]!=N[i-1]){\n            yn = 0;\n            break;\n        }        \n        if(i==2){\n            yn = 1;\n            printf(\"Yes\\n\");\n            return 0;\n        }\n    }\n \n    printf(\"No\\n\");\n \n    return 0;\n}", "problem_context": "Score : 100 points\n\nProblem Statement\n\nWe call a 4-digit integer with three or more consecutive same digits, such as 1118, good.\n\nYou are given a 4-digit integer N. Answer the question: Is N good?\n\nConstraints\n\n1000 ≤ N ≤ 9999\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 is good, print Yes; otherwise, print No.\n\nSample Input 1\n\n1118\n\nSample Output 1\n\nYes\n\nN is good, since it contains three consecutive 1.\n\nSample Input 2\n\n7777\n\nSample Output 2\n\nYes\n\nAn integer is also good when all the digits are the same.\n\nSample Input 3\n\n1234\n\nSample Output 3\n\nNo", "sample_input": "1118\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p03543", "source_text": "Score : 100 points\n\nProblem Statement\n\nWe call a 4-digit integer with three or more consecutive same digits, such as 1118, good.\n\nYou are given a 4-digit integer N. Answer the question: Is N good?\n\nConstraints\n\n1000 ≤ N ≤ 9999\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 is good, print Yes; otherwise, print No.\n\nSample Input 1\n\n1118\n\nSample Output 1\n\nYes\n\nN is good, since it contains three consecutive 1.\n\nSample Input 2\n\n7777\n\nSample Output 2\n\nYes\n\nAn integer is also good when all the digits are the same.\n\nSample Input 3\n\n1234\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": 544, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s275962606", "group_id": "codeNet:p03544", "input_text": "#include <stdio.h>\n\nint main(void) {\n\tlong long int luc[86];\n\tint N;\n\tint i;\n\tluc[0] = 2;\n\tluc[1] = 1;\n\n\tscanf(\"%d\", &N);\n\tfor(i = 2; i < 86; i++) {\n\t\tluc[i] = luc[i-1] + luc[i-2];\n\t}\n\tprintf(\"%d\", luc[N-1]);\n\n\treturn 0;\n}\t", "language": "C", "metadata": {"date": 1511058262, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "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/C/s275962606.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s275962606", "user_id": "u029915470"}, "prompt_components": {"gold_output": "11\n", "input_to_evaluate": "#include <stdio.h>\n\nint main(void) {\n\tlong long int luc[86];\n\tint N;\n\tint i;\n\tluc[0] = 2;\n\tluc[1] = 1;\n\n\tscanf(\"%d\", &N);\n\tfor(i = 2; i < 86; i++) {\n\t\tluc[i] = luc[i-1] + luc[i-2];\n\t}\n\tprintf(\"%d\", luc[N-1]);\n\n\treturn 0;\n}\t", "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": 223, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s850503943", "group_id": "codeNet:p03545", "input_text": "#include <stdio.h>\n#include <stdlib.h>\n#include <string.h>\n\nvoid Standard_Input(int* a,int* b,int* c,int* d)\n{\n    int x;\n    scanf(\"%d\",&x);\n    while(x>=10000||x<0)\n    {\n        scanf(\"%d\",&x);\n    }\n    *d=x%10;x/=10;\n    *c=x%10;x/=10;\n    *b=x%10;x/=10;\n    *a=x%10;\n}\n\nint main()\n{\n    char op1='0',op2='0',op3='0';\n    int a,b,c,d;\n    while(1)\n    {\n        Standard_Input(&a,&b,&c,&d);\n        if(a+b+c+d==7)\n        {\n            op1=op2=op3='+';\n            printf(\"%d%c%d%c%d%c%d=7\\n\",a,op1,b,op2,c,op3,d);\n        }\n        else if(a+b+c-d==7)\n        {\n            op1=op2='+';\n            op3='-';\n            printf(\"%d%c%d%c%d%c%d=7\\n\",a,op1,b,op2,c,op3,d);\n        }\n        else if(a+b-c+d==7)\n        {\n            op1=op3='+';op2='-';\n            printf(\"%d%c%d%c%d%c%d=7\\n\",a,op1,b,op2,c,op3,d);\n        }\n        else if(a+b-c-d==7)\n        {\n            op1='+';op2=op3='-';\n            printf(\"%d%c%d%c%d%c%d=7\\n\",a,op1,b,op2,c,op3,d);\n        }\n        else if(a-b+c+d==7)\n        {\n            op1='-';op2=op3='+';\n            printf(\"%d%c%d%c%d%c%d=7\\n\",a,op1,b,op2,c,op3,d);\n        }\n        else if(a-b+c-d==7)\n        {\n            op1=op3='+';op2='-';\n            printf(\"%d%c%d%c%d%c%d=7\\n\",a,op1,b,op2,c,op3,d);\n        }\n        else if(a-b-c+d==7)\n        {\n            op1=op2='-';op3='+';\n            printf(\"%d%c%d%c%d%c%d=7\\n\",a,op1,b,op2,c,op3,d);\n        }\n        else if(a-b-c-d==7)\n        {\n            op1=op2=op3='-';\n            printf(\"%d%c%d%c%d%c%d=7\\n\",a,op1,b,op2,c,op3,d);\n        }\n        else\n        {\n            printf(\"no answer!please input another one:\");\n            continue;\n        }\n    }\n    return 0;\n}\n", "language": "C", "metadata": {"date": 1520916486, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "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/C/s850503943.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Output Limit Exceeded", "submission_id": "s850503943", "user_id": "u816631826"}, "prompt_components": {"gold_output": "1+2+2+2=7\n", "input_to_evaluate": "#include <stdio.h>\n#include <stdlib.h>\n#include <string.h>\n\nvoid Standard_Input(int* a,int* b,int* c,int* d)\n{\n    int x;\n    scanf(\"%d\",&x);\n    while(x>=10000||x<0)\n    {\n        scanf(\"%d\",&x);\n    }\n    *d=x%10;x/=10;\n    *c=x%10;x/=10;\n    *b=x%10;x/=10;\n    *a=x%10;\n}\n\nint main()\n{\n    char op1='0',op2='0',op3='0';\n    int a,b,c,d;\n    while(1)\n    {\n        Standard_Input(&a,&b,&c,&d);\n        if(a+b+c+d==7)\n        {\n            op1=op2=op3='+';\n            printf(\"%d%c%d%c%d%c%d=7\\n\",a,op1,b,op2,c,op3,d);\n        }\n        else if(a+b+c-d==7)\n        {\n            op1=op2='+';\n            op3='-';\n            printf(\"%d%c%d%c%d%c%d=7\\n\",a,op1,b,op2,c,op3,d);\n        }\n        else if(a+b-c+d==7)\n        {\n            op1=op3='+';op2='-';\n            printf(\"%d%c%d%c%d%c%d=7\\n\",a,op1,b,op2,c,op3,d);\n        }\n        else if(a+b-c-d==7)\n        {\n            op1='+';op2=op3='-';\n            printf(\"%d%c%d%c%d%c%d=7\\n\",a,op1,b,op2,c,op3,d);\n        }\n        else if(a-b+c+d==7)\n        {\n            op1='-';op2=op3='+';\n            printf(\"%d%c%d%c%d%c%d=7\\n\",a,op1,b,op2,c,op3,d);\n        }\n        else if(a-b+c-d==7)\n        {\n            op1=op3='+';op2='-';\n            printf(\"%d%c%d%c%d%c%d=7\\n\",a,op1,b,op2,c,op3,d);\n        }\n        else if(a-b-c+d==7)\n        {\n            op1=op2='-';op3='+';\n            printf(\"%d%c%d%c%d%c%d=7\\n\",a,op1,b,op2,c,op3,d);\n        }\n        else if(a-b-c-d==7)\n        {\n            op1=op2=op3='-';\n            printf(\"%d%c%d%c%d%c%d=7\\n\",a,op1,b,op2,c,op3,d);\n        }\n        else\n        {\n            printf(\"no answer!please input another one:\");\n            continue;\n        }\n    }\n    return 0;\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": 1676, "cpu_time_ms": 2010, "memory_kb": 131328}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s226762413", "group_id": "codeNet:p03545", "input_text": "#include <stdio.h>\n#include <stdlib.h>\n#include <string.h>\n\nvoid Standard_Input(int* a,int x)\n{\n    int i;\n    for(i=3;i>=0;--i)\n    {\n        *(a+i)=x%10;\n        x/=10;\n    }\n}\n\nint main()\n{\n    char op1='0',op2='0',op3='0';\n    int x,a[4];\n    while(scanf(\"%d\",&x)==1)\n    {\n        Standard_Input(a,x);\n        if(a[0]+a[1]+a[2]+a[3]==7)\n        {\n            op1=op2=op3='+';\n            printf(\"%d%c%d%c%d%c%d=7\\n\",a[0],op1,a[1],op2,a[2],op3,a[3]);\n        }\n        else if(a[0]+a[1]+a[2]-a[3]==7)\n        {\n            op1=op2='+';\n            op3='-';\n            printf(\"%d%c%d%c%d%c%d=7\\n\",a[0],op1,a[1],op2,a[2],op3,a[3]);\n        }\n        else if(a[0]+a[1]-a[2]+a[3]==7)\n        {\n            op1=op3='+';op2='-';\n            printf(\"%d%c%d%c%d%c%d=7\\n\",a[0],op1,a[1],op2,a[2],op3,a[3]);\n        }\n        else if(a[0]+a[1]-a[2]-a[3]==7)\n        {\n            op1='+';op2=op3='-';\n            printf(\"%d%c%d%c%d%c%d=7\\n\",a[0],op1,a[1],op2,a[2],op3,a[3]);\n        }\n        else if(a[0]-a[1]+a[2]+a[3]==7)\n        {\n            op1='-';op2=op3='+';\n            printf(\"%d%c%d%c%d%c%d=7\\n\",a[0],op1,a[1],op2,a[2],op3,a[3]);\n        }\n        else if(a[0]-a[1]+a[2]-a[3]==7)\n        {\n            op1=op3='+';op2='-';\n            printf(\"%d%c%d%c%d%c%d=7\\n\",a[0],op1,a[1],op2,a[2],op3,a[3]);\n        }\n        else if(a[0]-a[1]-a[2]+a[3]==7)\n        {\n            op1=op2='-';op3='+';\n            printf(\"%d%c%d%c%d%c%d=7\\n\",a[0],op1,a[1],op2,a[2],op3,a[3]);\n        }\n        else if(a[0]-a[1]-a[2]-a[3]==7)\n        {\n            op1=op2=op3='-';\n            printf(\"%d%c%d%c%d%c%d=7\\n\",a[0],op1,a[1],op2,a[2],op3,a[3]);\n        }\n        else\n        {\n            printf(\"no answer!please input another one:\");\n        }\n    }\n    return 0;\n}\n", "language": "C", "metadata": {"date": 1520914657, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "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/C/s226762413.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s226762413", "user_id": "u089230684"}, "prompt_components": {"gold_output": "1+2+2+2=7\n", "input_to_evaluate": "#include <stdio.h>\n#include <stdlib.h>\n#include <string.h>\n\nvoid Standard_Input(int* a,int x)\n{\n    int i;\n    for(i=3;i>=0;--i)\n    {\n        *(a+i)=x%10;\n        x/=10;\n    }\n}\n\nint main()\n{\n    char op1='0',op2='0',op3='0';\n    int x,a[4];\n    while(scanf(\"%d\",&x)==1)\n    {\n        Standard_Input(a,x);\n        if(a[0]+a[1]+a[2]+a[3]==7)\n        {\n            op1=op2=op3='+';\n            printf(\"%d%c%d%c%d%c%d=7\\n\",a[0],op1,a[1],op2,a[2],op3,a[3]);\n        }\n        else if(a[0]+a[1]+a[2]-a[3]==7)\n        {\n            op1=op2='+';\n            op3='-';\n            printf(\"%d%c%d%c%d%c%d=7\\n\",a[0],op1,a[1],op2,a[2],op3,a[3]);\n        }\n        else if(a[0]+a[1]-a[2]+a[3]==7)\n        {\n            op1=op3='+';op2='-';\n            printf(\"%d%c%d%c%d%c%d=7\\n\",a[0],op1,a[1],op2,a[2],op3,a[3]);\n        }\n        else if(a[0]+a[1]-a[2]-a[3]==7)\n        {\n            op1='+';op2=op3='-';\n            printf(\"%d%c%d%c%d%c%d=7\\n\",a[0],op1,a[1],op2,a[2],op3,a[3]);\n        }\n        else if(a[0]-a[1]+a[2]+a[3]==7)\n        {\n            op1='-';op2=op3='+';\n            printf(\"%d%c%d%c%d%c%d=7\\n\",a[0],op1,a[1],op2,a[2],op3,a[3]);\n        }\n        else if(a[0]-a[1]+a[2]-a[3]==7)\n        {\n            op1=op3='+';op2='-';\n            printf(\"%d%c%d%c%d%c%d=7\\n\",a[0],op1,a[1],op2,a[2],op3,a[3]);\n        }\n        else if(a[0]-a[1]-a[2]+a[3]==7)\n        {\n            op1=op2='-';op3='+';\n            printf(\"%d%c%d%c%d%c%d=7\\n\",a[0],op1,a[1],op2,a[2],op3,a[3]);\n        }\n        else if(a[0]-a[1]-a[2]-a[3]==7)\n        {\n            op1=op2=op3='-';\n            printf(\"%d%c%d%c%d%c%d=7\\n\",a[0],op1,a[1],op2,a[2],op3,a[3]);\n        }\n        else\n        {\n            printf(\"no answer!please input another one:\");\n        }\n    }\n    return 0;\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": 1757, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s932447356", "group_id": "codeNet:p03545", "input_text": "#include <stdlib.h>\n#include <string.h>\n#include <math.h>\n#include <stdio.h>\nint main()\n{\n    int a,b,c,d,n;\n    while(scanf(\"%d\",&n)!=EOF)\n    {   a=n/1000;\n        b=(n-1000*a)/100;\n        c=n%100/10;\n        d=n%10;\n        if(a+b+c+d==7)printf(\"%d+%d+%d+%d=7\\n\",a,b,c,d);\n        else if(a+b+c-d==7)printf(\"%d+%d+%d-%d=7\\n\",a,b,c,d);\n        else if(a+b-c+d==7)printf(\"%d+%d-%d+%d=7\\n\",a,b,c,d);\n        else if(a-b+c+d==7)printf(\"%d-%d+%d+%d=7\\n\",a,b,c,d);\n        else if(a+b-c-d==7)printf(\"%d+%d-%d-%d=7\\n\",a,b,c,d);\n        else if(a-b-c+d==7)printf(\"%d-%d-%d+%d=7\\n\",a,b,c,d);\n        else if(a-b+c-d==7)printf(\"%d-%d+%d-%d=7\\n\",a,b,c,d);\n    }\n    return 0;\n}\n", "language": "C", "metadata": {"date": 1520817057, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "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/C/s932447356.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s932447356", "user_id": "u018679195"}, "prompt_components": {"gold_output": "1+2+2+2=7\n", "input_to_evaluate": "#include <stdlib.h>\n#include <string.h>\n#include <math.h>\n#include <stdio.h>\nint main()\n{\n    int a,b,c,d,n;\n    while(scanf(\"%d\",&n)!=EOF)\n    {   a=n/1000;\n        b=(n-1000*a)/100;\n        c=n%100/10;\n        d=n%10;\n        if(a+b+c+d==7)printf(\"%d+%d+%d+%d=7\\n\",a,b,c,d);\n        else if(a+b+c-d==7)printf(\"%d+%d+%d-%d=7\\n\",a,b,c,d);\n        else if(a+b-c+d==7)printf(\"%d+%d-%d+%d=7\\n\",a,b,c,d);\n        else if(a-b+c+d==7)printf(\"%d-%d+%d+%d=7\\n\",a,b,c,d);\n        else if(a+b-c-d==7)printf(\"%d+%d-%d-%d=7\\n\",a,b,c,d);\n        else if(a-b-c+d==7)printf(\"%d-%d-%d+%d=7\\n\",a,b,c,d);\n        else if(a-b+c-d==7)printf(\"%d-%d+%d-%d=7\\n\",a,b,c,d);\n    }\n    return 0;\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": 671, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s475272129", "group_id": "codeNet:p03545", "input_text": "A,B,C,D;main(i){scanf(\"%1d%1d%1d%1d\",&A,&B,&C,&D);i=8;while(i--)if(A+(i/4?-B:B)+(i/2%2?-C:C)+(i%2?-D:D)==7){char p[]={'+','-'};printf(\"%d%c%d%c%d%c%d=7\\n\",A,p[i/4],B,p[i/2%2],C,p[i%2],D);break;}}\n", "language": "C", "metadata": {"date": 1511083252, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "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/C/s475272129.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s475272129", "user_id": "u356069145"}, "prompt_components": {"gold_output": "1+2+2+2=7\n", "input_to_evaluate": "A,B,C,D;main(i){scanf(\"%1d%1d%1d%1d\",&A,&B,&C,&D);i=8;while(i--)if(A+(i/4?-B:B)+(i/2%2?-C:C)+(i%2?-D:D)==7){char p[]={'+','-'};printf(\"%d%c%d%c%d%c%d=7\\n\",A,p[i/4],B,p[i/2%2],C,p[i%2],D);break;}}\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": 196, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s013310423", "group_id": "codeNet:p03546", "input_text": "#include <stdio.h>\n//#include <stdlib.h>\n//#include <string.h>\n//#include <stdbool.h>\n//#include <limits.h>\n//#include <math.h>\n\n#define Min(a, b) (a < b ? a : b)\n\nint main() {\n  int h, w;\n  scanf(\"%d%d\", &h, &w);\n  int c[10][10], a[h][w];\n  for (int i=0; i<10; i++)\n    for (int j=0; j<10; j++)\n      scanf(\"%d\", c[i]+j);\n  for (int i=0; i<h; i++)\n    for (int j=0; j<w; j++)\n      scanf(\"%d\", a[i]+j);\n  int cost[10];\n  for (int i=0; i<10; i++)\n    cost[i] = c[i][1];\n  for (int i=0; i<10; i++) {\n    for (int j=0; j<10; j++) {\n      for (int k=0; k<10; k++) {\n        cost[j] = Min(cost[j], cost[k]+c[j][k]);\n      }\n    }\n  }\n  int ans = 0;\n  for (int i=0; i<h; i++) {\n    for (int j=0; j<w; j++) {\n      if (a[i][j] == -1)\n        continue;\n      else\n        ans += cost[a[i][j]];\n    }\n  }\n  printf(\"%d\\n\", ans);\n  return 0;\n}\n", "language": "C", "metadata": {"date": 1582417510, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "problem_description_relpath": "problem_descriptions/p03546.html", "problem_id": "p03546", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03546/input.txt", "sample_output_relpath": "derived/input_output/data/p03546/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03546/C/s013310423.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s013310423", "user_id": "u599895318"}, "prompt_components": {"gold_output": "12\n", "input_to_evaluate": "#include <stdio.h>\n//#include <stdlib.h>\n//#include <string.h>\n//#include <stdbool.h>\n//#include <limits.h>\n//#include <math.h>\n\n#define Min(a, b) (a < b ? a : b)\n\nint main() {\n  int h, w;\n  scanf(\"%d%d\", &h, &w);\n  int c[10][10], a[h][w];\n  for (int i=0; i<10; i++)\n    for (int j=0; j<10; j++)\n      scanf(\"%d\", c[i]+j);\n  for (int i=0; i<h; i++)\n    for (int j=0; j<w; j++)\n      scanf(\"%d\", a[i]+j);\n  int cost[10];\n  for (int i=0; i<10; i++)\n    cost[i] = c[i][1];\n  for (int i=0; i<10; i++) {\n    for (int j=0; j<10; j++) {\n      for (int k=0; k<10; k++) {\n        cost[j] = Min(cost[j], cost[k]+c[j][k]);\n      }\n    }\n  }\n  int ans = 0;\n  for (int i=0; i<h; i++) {\n    for (int j=0; j<w; j++) {\n      if (a[i][j] == -1)\n        continue;\n      else\n        ans += cost[a[i][j]];\n    }\n  }\n  printf(\"%d\\n\", ans);\n  return 0;\n}\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nJoisino the magical girl has decided to turn every single digit that exists on this world into 1.\n\nRewriting a digit i with j (0≤i,j≤9) costs c_{i,j} MP (Magic Points).\n\nShe is now standing before a wall. The wall is divided into HW squares in H rows and W columns, and at least one square contains a digit between 0 and 9 (inclusive).\n\nYou are given A_{i,j} that describes the square at the i-th row from the top and j-th column from the left, as follows:\n\nIf A_{i,j}≠-1, the square contains a digit A_{i,j}.\n\nIf A_{i,j}=-1, the square does not contain a digit.\n\nFind the minimum total amount of MP required to turn every digit on this wall into 1 in the end.\n\nConstraints\n\n1≤H,W≤200\n\n1≤c_{i,j}≤10^3 (i≠j)\n\nc_{i,j}=0 (i=j)\n\n-1≤A_{i,j}≤9\n\nAll input values are integers.\n\nThere is at least one digit on the wall.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W\nc_{0,0} ... c_{0,9}\n:\nc_{9,0} ... c_{9,9}\nA_{1,1} ... A_{1,W}\n:\nA_{H,1} ... A_{H,W}\n\nOutput\n\nPrint the minimum total amount of MP required to turn every digit on the wall into 1 in the end.\n\nSample Input 1\n\n2 4\n0 9 9 9 9 9 9 9 9 9\n9 0 9 9 9 9 9 9 9 9\n9 9 0 9 9 9 9 9 9 9\n9 9 9 0 9 9 9 9 9 9\n9 9 9 9 0 9 9 9 9 2\n9 9 9 9 9 0 9 9 9 9\n9 9 9 9 9 9 0 9 9 9\n9 9 9 9 9 9 9 0 9 9\n9 9 9 9 2 9 9 9 0 9\n9 2 9 9 9 9 9 9 9 0\n-1 -1 -1 -1\n8 1 1 8\n\nSample Output 1\n\n12\n\nTo turn a single 8 into 1, it is optimal to first turn 8 into 4, then turn 4 into 9, and finally turn 9 into 1, costing 6 MP.\n\nThe wall contains two 8s, so the minimum total MP required is 6×2=12.\n\nSample Input 2\n\n5 5\n0 999 999 999 999 999 999 999 999 999\n999 0 999 999 999 999 999 999 999 999\n999 999 0 999 999 999 999 999 999 999\n999 999 999 0 999 999 999 999 999 999\n999 999 999 999 0 999 999 999 999 999\n999 999 999 999 999 0 999 999 999 999\n999 999 999 999 999 999 0 999 999 999\n999 999 999 999 999 999 999 0 999 999\n999 999 999 999 999 999 999 999 0 999\n999 999 999 999 999 999 999 999 999 0\n1 1 1 1 1\n1 1 1 1 1\n1 1 1 1 1\n1 1 1 1 1\n1 1 1 1 1\n\nSample Output 2\n\n0\n\nNote that she may not need to change any digit.\n\nSample Input 3\n\n3 5\n0 4 3 6 2 7 2 5 3 3\n4 0 5 3 7 5 3 7 2 7\n5 7 0 7 2 9 3 2 9 1\n3 6 2 0 2 4 6 4 2 3\n3 5 7 4 0 6 9 7 6 7\n9 8 5 2 2 0 4 7 6 5\n5 4 6 3 2 3 0 5 4 3\n3 6 2 3 4 2 4 0 8 9\n4 6 5 4 3 5 3 2 0 8\n2 1 3 4 5 7 8 6 4 0\n3 5 2 6 1\n2 5 3 2 1\n6 9 2 5 6\n\nSample Output 3\n\n47", "sample_input": "2 4\n0 9 9 9 9 9 9 9 9 9\n9 0 9 9 9 9 9 9 9 9\n9 9 0 9 9 9 9 9 9 9\n9 9 9 0 9 9 9 9 9 9\n9 9 9 9 0 9 9 9 9 2\n9 9 9 9 9 0 9 9 9 9\n9 9 9 9 9 9 0 9 9 9\n9 9 9 9 9 9 9 0 9 9\n9 9 9 9 2 9 9 9 0 9\n9 2 9 9 9 9 9 9 9 0\n-1 -1 -1 -1\n8 1 1 8\n"}, "reference_outputs": ["12\n"], "source_document_id": "p03546", "source_text": "Score : 400 points\n\nProblem Statement\n\nJoisino the magical girl has decided to turn every single digit that exists on this world into 1.\n\nRewriting a digit i with j (0≤i,j≤9) costs c_{i,j} MP (Magic Points).\n\nShe is now standing before a wall. The wall is divided into HW squares in H rows and W columns, and at least one square contains a digit between 0 and 9 (inclusive).\n\nYou are given A_{i,j} that describes the square at the i-th row from the top and j-th column from the left, as follows:\n\nIf A_{i,j}≠-1, the square contains a digit A_{i,j}.\n\nIf A_{i,j}=-1, the square does not contain a digit.\n\nFind the minimum total amount of MP required to turn every digit on this wall into 1 in the end.\n\nConstraints\n\n1≤H,W≤200\n\n1≤c_{i,j}≤10^3 (i≠j)\n\nc_{i,j}=0 (i=j)\n\n-1≤A_{i,j}≤9\n\nAll input values are integers.\n\nThere is at least one digit on the wall.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W\nc_{0,0} ... c_{0,9}\n:\nc_{9,0} ... c_{9,9}\nA_{1,1} ... A_{1,W}\n:\nA_{H,1} ... A_{H,W}\n\nOutput\n\nPrint the minimum total amount of MP required to turn every digit on the wall into 1 in the end.\n\nSample Input 1\n\n2 4\n0 9 9 9 9 9 9 9 9 9\n9 0 9 9 9 9 9 9 9 9\n9 9 0 9 9 9 9 9 9 9\n9 9 9 0 9 9 9 9 9 9\n9 9 9 9 0 9 9 9 9 2\n9 9 9 9 9 0 9 9 9 9\n9 9 9 9 9 9 0 9 9 9\n9 9 9 9 9 9 9 0 9 9\n9 9 9 9 2 9 9 9 0 9\n9 2 9 9 9 9 9 9 9 0\n-1 -1 -1 -1\n8 1 1 8\n\nSample Output 1\n\n12\n\nTo turn a single 8 into 1, it is optimal to first turn 8 into 4, then turn 4 into 9, and finally turn 9 into 1, costing 6 MP.\n\nThe wall contains two 8s, so the minimum total MP required is 6×2=12.\n\nSample Input 2\n\n5 5\n0 999 999 999 999 999 999 999 999 999\n999 0 999 999 999 999 999 999 999 999\n999 999 0 999 999 999 999 999 999 999\n999 999 999 0 999 999 999 999 999 999\n999 999 999 999 0 999 999 999 999 999\n999 999 999 999 999 0 999 999 999 999\n999 999 999 999 999 999 0 999 999 999\n999 999 999 999 999 999 999 0 999 999\n999 999 999 999 999 999 999 999 0 999\n999 999 999 999 999 999 999 999 999 0\n1 1 1 1 1\n1 1 1 1 1\n1 1 1 1 1\n1 1 1 1 1\n1 1 1 1 1\n\nSample Output 2\n\n0\n\nNote that she may not need to change any digit.\n\nSample Input 3\n\n3 5\n0 4 3 6 2 7 2 5 3 3\n4 0 5 3 7 5 3 7 2 7\n5 7 0 7 2 9 3 2 9 1\n3 6 2 0 2 4 6 4 2 3\n3 5 7 4 0 6 9 7 6 7\n9 8 5 2 2 0 4 7 6 5\n5 4 6 3 2 3 0 5 4 3\n3 6 2 3 4 2 4 0 8 9\n4 6 5 4 3 5 3 2 0 8\n2 1 3 4 5 7 8 6 4 0\n3 5 2 6 1\n2 5 3 2 1\n6 9 2 5 6\n\nSample Output 3\n\n47", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 4, "memory_kb": 256}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s074116445", "group_id": "codeNet:p03547", "input_text": "#include <stdio.h>\n\nint main(void){\n\n  char x,y;\n\tscanf(\"%c %c\", &x, &y);\n\tif (x < y) {\n\t\tprintf(\"<\\n\");\n\t} else if (y < x) {\n\t\tprintf(\">\\n\");\n\t} else {\n\t\tprintf(\"=\\n\");\n\t}\n\n  return 0;\n}", "language": "C", "metadata": {"date": 1587180536, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "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/C/s074116445.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s074116445", "user_id": "u581816556"}, "prompt_components": {"gold_output": "<\n", "input_to_evaluate": "#include <stdio.h>\n\nint main(void){\n\n  char x,y;\n\tscanf(\"%c %c\", &x, &y);\n\tif (x < y) {\n\t\tprintf(\"<\\n\");\n\t} else if (y < x) {\n\t\tprintf(\">\\n\");\n\t} else {\n\t\tprintf(\"=\\n\");\n\t}\n\n  return 0;\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": 187, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s128850906", "group_id": "codeNet:p03549", "input_text": "#include <stdio.h>\n#include <string.h>\n\nint main(){\n  int x,y;\n  scanf(\"%d %d\",&x,&y);\n  //printf(\"%d\\n\", (int)pow(2,5));\n  printf(\"%d\\n\",(int)(((x-y)*100+y*1900)*pow(2,y)));\n}\n", "language": "C", "metadata": {"date": 1510452702, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "problem_description_relpath": "problem_descriptions/p03549.html", "problem_id": "p03549", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03549/input.txt", "sample_output_relpath": "derived/input_output/data/p03549/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03549/C/s128850906.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s128850906", "user_id": "u438621426"}, "prompt_components": {"gold_output": "3800\n", "input_to_evaluate": "#include <stdio.h>\n#include <string.h>\n\nint main(){\n  int x,y;\n  scanf(\"%d %d\",&x,&y);\n  //printf(\"%d\\n\", (int)pow(2,5));\n  printf(\"%d\\n\",(int)(((x-y)*100+y*1900)*pow(2,y)));\n}\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nTakahashi is now competing in a programming contest, but he received TLE in a problem where the answer is YES or NO.\n\nWhen he checked the detailed status of the submission, there were N test cases in the problem, and the code received TLE in M of those cases.\n\nThen, he rewrote the code to correctly solve each of those M cases with 1/2 probability in 1900 milliseconds, and correctly solve each of the other N-M cases without fail in 100 milliseconds.\n\nNow, he goes through the following process:\n\nSubmit the code.\n\nWait until the code finishes execution on all the cases.\n\nIf the code fails to correctly solve some of the M cases, submit it again.\n\nRepeat until the code correctly solve all the cases in one submission.\n\nLet the expected value of the total execution time of the code be X milliseconds. Print X (as an integer).\n\nConstraints\n\nAll input values are integers.\n\n1 \\leq N \\leq 100\n\n1 \\leq M \\leq {\\rm min}(N, 5)\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\n\nOutput\n\nPrint X, the expected value of the total execution time of the code, as an integer. It can be proved that, under the constraints in this problem, X is an integer not exceeding 10^9.\n\nSample Input 1\n\n1 1\n\nSample Output 1\n\n3800\n\nIn this input, there is only one case. Takahashi will repeatedly submit the code that correctly solves this case with 1/2 probability in 1900 milliseconds.\n\nThe code will succeed in one attempt with 1/2 probability, in two attempts with 1/4 probability, and in three attempts with 1/8 probability, and so on.\n\nThus, the answer is 1900 \\times 1/2 + (2 \\times 1900) \\times 1/4 + (3 \\times 1900) \\times 1/8 + ... = 3800.\n\nSample Input 2\n\n10 2\n\nSample Output 2\n\n18400\n\nThe code will take 1900 milliseconds in each of the 2 cases, and 100 milliseconds in each of the 10-2=8 cases. The probability of the code correctly solving all the cases is 1/2 \\times 1/2 = 1/4.\n\nSample Input 3\n\n100 5\n\nSample Output 3\n\n608000", "sample_input": "1 1\n"}, "reference_outputs": ["3800\n"], "source_document_id": "p03549", "source_text": "Score : 300 points\n\nProblem Statement\n\nTakahashi is now competing in a programming contest, but he received TLE in a problem where the answer is YES or NO.\n\nWhen he checked the detailed status of the submission, there were N test cases in the problem, and the code received TLE in M of those cases.\n\nThen, he rewrote the code to correctly solve each of those M cases with 1/2 probability in 1900 milliseconds, and correctly solve each of the other N-M cases without fail in 100 milliseconds.\n\nNow, he goes through the following process:\n\nSubmit the code.\n\nWait until the code finishes execution on all the cases.\n\nIf the code fails to correctly solve some of the M cases, submit it again.\n\nRepeat until the code correctly solve all the cases in one submission.\n\nLet the expected value of the total execution time of the code be X milliseconds. Print X (as an integer).\n\nConstraints\n\nAll input values are integers.\n\n1 \\leq N \\leq 100\n\n1 \\leq M \\leq {\\rm min}(N, 5)\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\n\nOutput\n\nPrint X, the expected value of the total execution time of the code, as an integer. It can be proved that, under the constraints in this problem, X is an integer not exceeding 10^9.\n\nSample Input 1\n\n1 1\n\nSample Output 1\n\n3800\n\nIn this input, there is only one case. Takahashi will repeatedly submit the code that correctly solves this case with 1/2 probability in 1900 milliseconds.\n\nThe code will succeed in one attempt with 1/2 probability, in two attempts with 1/4 probability, and in three attempts with 1/8 probability, and so on.\n\nThus, the answer is 1900 \\times 1/2 + (2 \\times 1900) \\times 1/4 + (3 \\times 1900) \\times 1/8 + ... = 3800.\n\nSample Input 2\n\n10 2\n\nSample Output 2\n\n18400\n\nThe code will take 1900 milliseconds in each of the 2 cases, and 100 milliseconds in each of the 10-2=8 cases. The probability of the code correctly solving all the cases is 1/2 \\times 1/2 = 1/4.\n\nSample Input 3\n\n100 5\n\nSample Output 3\n\n608000", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 177, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s260011646", "group_id": "codeNet:p03556", "input_text": "#include<stdio.h>\n\nint main(){\n\n   int n,i;\n\n   scanf(\"%d\",&n);\n\n   for(i = 1; i * i <= n; i++);\n\n   printf(\"%d\\n\",(i - 1) * (i - 1));\n\n   return 0;\n}\n", "language": "C", "metadata": {"date": 1509844561, "filename_ext": "c", "original_language": "C (Clang 3.8.0)", "problem_description_relpath": "problem_descriptions/p03556.html", "problem_id": "p03556", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03556/input.txt", "sample_output_relpath": "derived/input_output/data/p03556/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03556/C/s260011646.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s260011646", "user_id": "u161067211"}, "prompt_components": {"gold_output": "9\n", "input_to_evaluate": "#include<stdio.h>\n\nint main(){\n\n   int n,i;\n\n   scanf(\"%d\",&n);\n\n   for(i = 1; i * i <= n; i++);\n\n   printf(\"%d\\n\",(i - 1) * (i - 1));\n\n   return 0;\n}\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nFind the largest square number not exceeding N. Here, a square number is an integer that can be represented as the square of an integer.\n\nConstraints\n\n1 \\leq N \\leq 10^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 largest square number not exceeding N.\n\nSample Input 1\n\n10\n\nSample Output 1\n\n9\n\n10 is not square, but 9 = 3 × 3 is. Thus, we print 9.\n\nSample Input 2\n\n81\n\nSample Output 2\n\n81\n\nSample Input 3\n\n271828182\n\nSample Output 3\n\n271821169", "sample_input": "10\n"}, "reference_outputs": ["9\n"], "source_document_id": "p03556", "source_text": "Score : 200 points\n\nProblem Statement\n\nFind the largest square number not exceeding N. Here, a square number is an integer that can be represented as the square of an integer.\n\nConstraints\n\n1 \\leq N \\leq 10^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 largest square number not exceeding N.\n\nSample Input 1\n\n10\n\nSample Output 1\n\n9\n\n10 is not square, but 9 = 3 × 3 is. Thus, we print 9.\n\nSample Input 2\n\n81\n\nSample Output 2\n\n81\n\nSample Input 3\n\n271828182\n\nSample Output 3\n\n271821169", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 151, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s134001422", "group_id": "codeNet:p03557", "input_text": "#include<stdio.h>\n#include<stdlib.h>\n#include<string.h>\n\n#define NEW(p,n){p=malloc((n)*sizeof(p[0]));if(p==NULL){printf(\"not enough memory\\n\");exit(1);};}\n//pの型の変数n個の要素分のメモリを確保し、そのアドレスをpに代入するマクロ\n\n#define MAX(a, b) ((a) > (b) ? (a) : (b))\n#define MIN(a, b) ((a) < (b) ? (a) : (b))\n#define SWAP(type, x, y) do { type tmp = x; x = y; y = tmp; } while (0)\n\n#define MOD 1000000007 \n\n//昇順\nint asc(const void* a, const void* b){\n    return *(int*)a-*(int*)b;\n}\n\n//(初めて以上になる添字を0始まりで出力)\n//(もしそういうのがないならNを出力)\nint binary_search_right(int* array, int N, int key){\n    int i=0;\n    int low=0;\n    int high=N-1;\n    int mid;\n    while(low<=high){\n        mid=(low+high)/2;\n        if(array[mid]<key){\n            low=mid+1;\n            i=mid+1;\n        }\n        else{\n            high=mid-1;\n            i=mid;\n        }\n    }\n    return i;\n}\n\n//(以下になる添字の中で一番でかいものを0始まりで出力)\n//(もしそういうのがないなら-1を出力)\nint binary_search_left(int* array, int N, int key){\n    int i=0;\n    int low=0;\n    int high=N-1;\n    int mid;\n    while(low<=high){\n        mid=(low+high)/2;\n        if(array[mid]<=key){\n            low=mid+1;\n            i=mid+1;\n        }\n        else{\n            high=mid-1;\n            i=mid;\n        }\n    }\n    return i-1;\n}\n\nint main(void){\n    int N;\n    scanf(\"%d\",&N);\n\n    int* A;\n    NEW(A,N);\n    for(int i=0;i<N;i++) scanf(\"%d\",&A[i]);\n    qsort(A,N,sizeof(int),asc);\n\n    int* B;\n    NEW(B,N);\n    for(int i=0;i<N;i++) scanf(\"%d\",&B[i]);\n    qsort(B,N,sizeof(int),asc);\n\n    int* C;\n    NEW(C,N);\n    for(int i=0;i<N;i++) scanf(\"%d\",&C[i]);\n    qsort(C,N,sizeof(int),asc);\n\n    long ans=0;\n    for(int i=0;i<N;i++){\n        int a=binary_search_left(A,N,B[i]-1);\n        int c=binary_search_right(C,N,B[i]+1);\n        if(a>=0 && c<N) ans+=(a+1)*(N-c);\n    }\n    printf(\"%ld\\n\",ans);\n\n    return 0;\n}", "language": "C", "metadata": {"date": 1576040254, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "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/C/s134001422.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s134001422", "user_id": "u941434715"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "#include<stdio.h>\n#include<stdlib.h>\n#include<string.h>\n\n#define NEW(p,n){p=malloc((n)*sizeof(p[0]));if(p==NULL){printf(\"not enough memory\\n\");exit(1);};}\n//pの型の変数n個の要素分のメモリを確保し、そのアドレスをpに代入するマクロ\n\n#define MAX(a, b) ((a) > (b) ? (a) : (b))\n#define MIN(a, b) ((a) < (b) ? (a) : (b))\n#define SWAP(type, x, y) do { type tmp = x; x = y; y = tmp; } while (0)\n\n#define MOD 1000000007 \n\n//昇順\nint asc(const void* a, const void* b){\n    return *(int*)a-*(int*)b;\n}\n\n//(初めて以上になる添字を0始まりで出力)\n//(もしそういうのがないならNを出力)\nint binary_search_right(int* array, int N, int key){\n    int i=0;\n    int low=0;\n    int high=N-1;\n    int mid;\n    while(low<=high){\n        mid=(low+high)/2;\n        if(array[mid]<key){\n            low=mid+1;\n            i=mid+1;\n        }\n        else{\n            high=mid-1;\n            i=mid;\n        }\n    }\n    return i;\n}\n\n//(以下になる添字の中で一番でかいものを0始まりで出力)\n//(もしそういうのがないなら-1を出力)\nint binary_search_left(int* array, int N, int key){\n    int i=0;\n    int low=0;\n    int high=N-1;\n    int mid;\n    while(low<=high){\n        mid=(low+high)/2;\n        if(array[mid]<=key){\n            low=mid+1;\n            i=mid+1;\n        }\n        else{\n            high=mid-1;\n            i=mid;\n        }\n    }\n    return i-1;\n}\n\nint main(void){\n    int N;\n    scanf(\"%d\",&N);\n\n    int* A;\n    NEW(A,N);\n    for(int i=0;i<N;i++) scanf(\"%d\",&A[i]);\n    qsort(A,N,sizeof(int),asc);\n\n    int* B;\n    NEW(B,N);\n    for(int i=0;i<N;i++) scanf(\"%d\",&B[i]);\n    qsort(B,N,sizeof(int),asc);\n\n    int* C;\n    NEW(C,N);\n    for(int i=0;i<N;i++) scanf(\"%d\",&C[i]);\n    qsort(C,N,sizeof(int),asc);\n\n    long ans=0;\n    for(int i=0;i<N;i++){\n        int a=binary_search_left(A,N,B[i]-1);\n        int c=binary_search_right(C,N,B[i]+1);\n        if(a>=0 && c<N) ans+=(a+1)*(N-c);\n    }\n    printf(\"%ld\\n\",ans);\n\n    return 0;\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": 2012, "cpu_time_ms": 86, "memory_kb": 1780}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s575988766", "group_id": "codeNet:p03563", "input_text": "#include <stdio.h>\n#include <stdlib.h>\n\n    int main ()\n    {\n            printf (\"Rating System\\n\");\n\n            char d [10];\n            printf (\"Please insert name\\n\",d);\n            gets (d);\n\n            int x,y ;\n            printf (\"Please insert current rating and performance \\n\",x,y);\n            scanf (\"%d %d\",&x,&y);\n\n            fflush (stdin);\n\n            if (x <=4500 && x >= 0 && y <=4500 && y >= 0)\n           {\n\n            printf (\"%d \\n\",x+y);\n            puts (d);\n            printf (\" current rating is %d\\n \",x);\n            printf (\"If his performance in the contest is %d \",y);\n            printf (\", his rating will be the average of %d and %d \",x,y);\n            printf (\", which is equal to the desired rating, %d\",(x+y)/2);\n                }\n                else\n                {\n                    printf (\"Invalid\");\n                }\n            }\n", "language": "C", "metadata": {"date": 1535927444, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "problem_description_relpath": "problem_descriptions/p03563.html", "problem_id": "p03563", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03563/input.txt", "sample_output_relpath": "derived/input_output/data/p03563/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03563/C/s575988766.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s575988766", "user_id": "u089230684"}, "prompt_components": {"gold_output": "2032\n", "input_to_evaluate": "#include <stdio.h>\n#include <stdlib.h>\n\n    int main ()\n    {\n            printf (\"Rating System\\n\");\n\n            char d [10];\n            printf (\"Please insert name\\n\",d);\n            gets (d);\n\n            int x,y ;\n            printf (\"Please insert current rating and performance \\n\",x,y);\n            scanf (\"%d %d\",&x,&y);\n\n            fflush (stdin);\n\n            if (x <=4500 && x >= 0 && y <=4500 && y >= 0)\n           {\n\n            printf (\"%d \\n\",x+y);\n            puts (d);\n            printf (\" current rating is %d\\n \",x);\n            printf (\"If his performance in the contest is %d \",y);\n            printf (\", his rating will be the average of %d and %d \",x,y);\n            printf (\", which is equal to the desired rating, %d\",(x+y)/2);\n                }\n                else\n                {\n                    printf (\"Invalid\");\n                }\n            }\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nTakahashi is a user of a site that hosts programming contests.\n\nWhen a user competes in a contest, the rating of the user (not necessarily an integer) changes according to the performance of the user, as follows:\n\nLet the current rating of the user be a.\n\nSuppose that the performance of the user in the contest is b.\n\nThen, the new rating of the user will be the avarage of a and b.\n\nFor example, if a user with rating 1 competes in a contest and gives performance 1000, his/her new rating will be 500.5, the average of 1 and 1000.\n\nTakahashi's current rating is R, and he wants his rating to be exactly G after the next contest.\n\nFind the performance required to achieve it.\n\nConstraints\n\n0 \\leq R, G \\leq 4500\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nR\nG\n\nOutput\n\nPrint the performance required to achieve the objective.\n\nSample Input 1\n\n2002\n2017\n\nSample Output 1\n\n2032\n\nTakahashi's current rating is 2002.\n\nIf his performance in the contest is 2032, his rating will be the average of 2002 and 2032, which is equal to the desired rating, 2017.\n\nSample Input 2\n\n4500\n0\n\nSample Output 2\n\n-4500\n\nAlthough the current and desired ratings are between 0 and 4500, the performance of a user can be below 0.", "sample_input": "2002\n2017\n"}, "reference_outputs": ["2032\n"], "source_document_id": "p03563", "source_text": "Score : 100 points\n\nProblem Statement\n\nTakahashi is a user of a site that hosts programming contests.\n\nWhen a user competes in a contest, the rating of the user (not necessarily an integer) changes according to the performance of the user, as follows:\n\nLet the current rating of the user be a.\n\nSuppose that the performance of the user in the contest is b.\n\nThen, the new rating of the user will be the avarage of a and b.\n\nFor example, if a user with rating 1 competes in a contest and gives performance 1000, his/her new rating will be 500.5, the average of 1 and 1000.\n\nTakahashi's current rating is R, and he wants his rating to be exactly G after the next contest.\n\nFind the performance required to achieve it.\n\nConstraints\n\n0 \\leq R, G \\leq 4500\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nR\nG\n\nOutput\n\nPrint the performance required to achieve the objective.\n\nSample Input 1\n\n2002\n2017\n\nSample Output 1\n\n2032\n\nTakahashi's current rating is 2002.\n\nIf his performance in the contest is 2032, his rating will be the average of 2002 and 2032, which is equal to the desired rating, 2017.\n\nSample Input 2\n\n4500\n0\n\nSample Output 2\n\n-4500\n\nAlthough the current and desired ratings are between 0 and 4500, the performance of a user can be below 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": 886, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s036190833", "group_id": "codeNet:p03563", "input_text": "#include <stdio.h>\n\nint main(){\n\n\tint R,G;\n\n\tscanf(\"%d\",&R);\n\tscanf(\"%d\",&G);\n\n\tprintf(\"%d\\n\",(2*G)-R);\n\n\treturn 0;\n}", "language": "C", "metadata": {"date": 1530487618, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "problem_description_relpath": "problem_descriptions/p03563.html", "problem_id": "p03563", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03563/input.txt", "sample_output_relpath": "derived/input_output/data/p03563/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03563/C/s036190833.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s036190833", "user_id": "u305950321"}, "prompt_components": {"gold_output": "2032\n", "input_to_evaluate": "#include <stdio.h>\n\nint main(){\n\n\tint R,G;\n\n\tscanf(\"%d\",&R);\n\tscanf(\"%d\",&G);\n\n\tprintf(\"%d\\n\",(2*G)-R);\n\n\treturn 0;\n}", "problem_context": "Score : 100 points\n\nProblem Statement\n\nTakahashi is a user of a site that hosts programming contests.\n\nWhen a user competes in a contest, the rating of the user (not necessarily an integer) changes according to the performance of the user, as follows:\n\nLet the current rating of the user be a.\n\nSuppose that the performance of the user in the contest is b.\n\nThen, the new rating of the user will be the avarage of a and b.\n\nFor example, if a user with rating 1 competes in a contest and gives performance 1000, his/her new rating will be 500.5, the average of 1 and 1000.\n\nTakahashi's current rating is R, and he wants his rating to be exactly G after the next contest.\n\nFind the performance required to achieve it.\n\nConstraints\n\n0 \\leq R, G \\leq 4500\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nR\nG\n\nOutput\n\nPrint the performance required to achieve the objective.\n\nSample Input 1\n\n2002\n2017\n\nSample Output 1\n\n2032\n\nTakahashi's current rating is 2002.\n\nIf his performance in the contest is 2032, his rating will be the average of 2002 and 2032, which is equal to the desired rating, 2017.\n\nSample Input 2\n\n4500\n0\n\nSample Output 2\n\n-4500\n\nAlthough the current and desired ratings are between 0 and 4500, the performance of a user can be below 0.", "sample_input": "2002\n2017\n"}, "reference_outputs": ["2032\n"], "source_document_id": "p03563", "source_text": "Score : 100 points\n\nProblem Statement\n\nTakahashi is a user of a site that hosts programming contests.\n\nWhen a user competes in a contest, the rating of the user (not necessarily an integer) changes according to the performance of the user, as follows:\n\nLet the current rating of the user be a.\n\nSuppose that the performance of the user in the contest is b.\n\nThen, the new rating of the user will be the avarage of a and b.\n\nFor example, if a user with rating 1 competes in a contest and gives performance 1000, his/her new rating will be 500.5, the average of 1 and 1000.\n\nTakahashi's current rating is R, and he wants his rating to be exactly G after the next contest.\n\nFind the performance required to achieve it.\n\nConstraints\n\n0 \\leq R, G \\leq 4500\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nR\nG\n\nOutput\n\nPrint the performance required to achieve the objective.\n\nSample Input 1\n\n2002\n2017\n\nSample Output 1\n\n2032\n\nTakahashi's current rating is 2002.\n\nIf his performance in the contest is 2032, his rating will be the average of 2002 and 2032, which is equal to the desired rating, 2017.\n\nSample Input 2\n\n4500\n0\n\nSample Output 2\n\n-4500\n\nAlthough the current and desired ratings are between 0 and 4500, the performance of a user can be below 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": 117, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s580747998", "group_id": "codeNet:p03570", "input_text": "d[1<<27],i,a,b,c;main(j){for(memset(d+1,9,1<<28);--j?:(c=getchar(d[b]=fmin(d[b],a))-10)?a=d[b^=1<<c-87]+1,j=25:0;)a=fmin(a,d[b^1<<j]+1);printf(\"%d\",a);}", "language": "C", "metadata": {"date": 1508743815, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "problem_description_relpath": "problem_descriptions/p03570.html", "problem_id": "p03570", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03570/input.txt", "sample_output_relpath": "derived/input_output/data/p03570/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03570/C/s580747998.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s580747998", "user_id": "u657913472"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "d[1<<27],i,a,b,c;main(j){for(memset(d+1,9,1<<28);--j?:(c=getchar(d[b]=fmin(d[b],a))-10)?a=d[b^=1<<c-87]+1,j=25:0;)a=fmin(a,d[b^1<<j]+1);printf(\"%d\",a);}", "problem_context": "Score : 700 points\n\nProblem Statement\n\nWe have a string s consisting of lowercase English letters.\nSnuke is partitioning s into some number of non-empty substrings.\nLet the subtrings obtained be s_1, s_2, ..., s_N from left to right. (Here, s = s_1 + s_2 + ... + s_N holds.)\nSnuke wants to satisfy the following condition:\n\nFor each i (1 \\leq i \\leq N), it is possible to permute the characters in s_i and obtain a palindrome.\n\nFind the minimum possible value of N when the partition satisfies the condition.\n\nConstraints\n\n1 \\leq |s| \\leq 2 \\times 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\nPrint the minimum possible value of N when the partition satisfies the condition.\n\nSample Input 1\n\naabxyyzz\n\nSample Output 1\n\n2\n\nThe solution is to partition s as aabxyyzz = aab + xyyzz.\nHere, aab can be permuted to form a palindrome aba, and xyyzz can be permuted to form a palindrome zyxyz.\n\nSample Input 2\n\nbyebye\n\nSample Output 2\n\n1\n\nbyebye can be permuted to form a palindrome byeeyb.\n\nSample Input 3\n\nabcdefghijklmnopqrstuvwxyz\n\nSample Output 3\n\n26\n\nSample Input 4\n\nabcabcxabcx\n\nSample Output 4\n\n3\n\nThe solution is to partition s as abcabcxabcx = a + b + cabcxabcx.", "sample_input": "aabxyyzz\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03570", "source_text": "Score : 700 points\n\nProblem Statement\n\nWe have a string s consisting of lowercase English letters.\nSnuke is partitioning s into some number of non-empty substrings.\nLet the subtrings obtained be s_1, s_2, ..., s_N from left to right. (Here, s = s_1 + s_2 + ... + s_N holds.)\nSnuke wants to satisfy the following condition:\n\nFor each i (1 \\leq i \\leq N), it is possible to permute the characters in s_i and obtain a palindrome.\n\nFind the minimum possible value of N when the partition satisfies the condition.\n\nConstraints\n\n1 \\leq |s| \\leq 2 \\times 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\nPrint the minimum possible value of N when the partition satisfies the condition.\n\nSample Input 1\n\naabxyyzz\n\nSample Output 1\n\n2\n\nThe solution is to partition s as aabxyyzz = aab + xyyzz.\nHere, aab can be permuted to form a palindrome aba, and xyyzz can be permuted to form a palindrome zyxyz.\n\nSample Input 2\n\nbyebye\n\nSample Output 2\n\n1\n\nbyebye can be permuted to form a palindrome byeeyb.\n\nSample Input 3\n\nabcdefghijklmnopqrstuvwxyz\n\nSample Output 3\n\n26\n\nSample Input 4\n\nabcabcxabcx\n\nSample Output 4\n\n3\n\nThe solution is to partition s as abcabcxabcx = a + b + cabcxabcx.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 152, "cpu_time_ms": 222, "memory_kb": 264448}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s742706992", "group_id": "codeNet:p03573", "input_text": "#include <stdio.h>\n\nint a,b,c;\n\nint main() {\n  scanf(\"%d %d %d\",&a,&b,&c);\n if(a!=b&a!=c)\n   {printf(\"%d\",a);}\n   \n   if(b!=a&b!=c)\n     {printf(\"%d\",b);} \n     \n     if(c!=b&c!=a)\n       {printf(\"%d\",c);} \n  \n  \n return 0;\n}", "language": "C", "metadata": {"date": 1588956376, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "problem_description_relpath": "problem_descriptions/p03573.html", "problem_id": "p03573", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03573/input.txt", "sample_output_relpath": "derived/input_output/data/p03573/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03573/C/s742706992.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s742706992", "user_id": "u816631826"}, "prompt_components": {"gold_output": "7\n", "input_to_evaluate": "#include <stdio.h>\n\nint a,b,c;\n\nint main() {\n  scanf(\"%d %d %d\",&a,&b,&c);\n if(a!=b&a!=c)\n   {printf(\"%d\",a);}\n   \n   if(b!=a&b!=c)\n     {printf(\"%d\",b);} \n     \n     if(c!=b&c!=a)\n       {printf(\"%d\",c);} \n  \n  \n return 0;\n}", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou are given three integers, A, B and C.\n\nAmong them, two are the same, but the remaining one is different from the rest.\n\nFor example, when A=5,B=7,C=5, A and C are the same, but B is different.\n\nFind the one that is different from the rest among the given three integers.\n\nConstraints\n\n-100 \\leq A,B,C \\leq 100\n\nA, B and C are integers.\n\nThe input satisfies the condition in the statement.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C\n\nOutput\n\nAmong A, B and C, print the integer that is different from the rest.\n\nSample Input 1\n\n5 7 5\n\nSample Output 1\n\n7\n\nThis is the same case as the one in the statement.\n\nSample Input 2\n\n1 1 7\n\nSample Output 2\n\n7\n\nIn this case, C is the one we seek.\n\nSample Input 3\n\n-100 100 100\n\nSample Output 3\n\n-100", "sample_input": "5 7 5\n"}, "reference_outputs": ["7\n"], "source_document_id": "p03573", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou are given three integers, A, B and C.\n\nAmong them, two are the same, but the remaining one is different from the rest.\n\nFor example, when A=5,B=7,C=5, A and C are the same, but B is different.\n\nFind the one that is different from the rest among the given three integers.\n\nConstraints\n\n-100 \\leq A,B,C \\leq 100\n\nA, B and C are integers.\n\nThe input satisfies the condition in the statement.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C\n\nOutput\n\nAmong A, B and C, print the integer that is different from the rest.\n\nSample Input 1\n\n5 7 5\n\nSample Output 1\n\n7\n\nThis is the same case as the one in the statement.\n\nSample Input 2\n\n1 1 7\n\nSample Output 2\n\n7\n\nIn this case, C is the one we seek.\n\nSample Input 3\n\n-100 100 100\n\nSample Output 3\n\n-100", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 225, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s480570558", "group_id": "codeNet:p03575", "input_text": "#include <limits.h>\n#include <math.h>\n#include <stdio.h>\n#include <stdlib.h>\n#include <string.h>\n#include <time.h>\n\n// 内部定数\n#define D_ON\t\t\t1\t\t\t\t\t\t\t\t\t\t// 汎用フラグ - ON\n#define D_OFF\t\t\t0\t\t\t\t\t\t\t\t\t\t// 汎用フラグ - OFF\n#define D_VTX_MAX\t\t50\t\t\t\t\t\t\t\t\t\t// 最大頂点数\n\n// 内部構造体 - 頂点情報\ntypedef struct Vtx {\n\tint mi1Vtx[D_VTX_MAX + 5];\t\t\t\t\t\t\t\t\t// 接続頂点\n\tint miVCnt;\t\t\t\t\t\t\t\t\t\t\t\t\t// 接続頂点数\n\tint miChk;\t\t\t\t\t\t\t\t\t\t\t\t\t// チェック済フラグ\n} Vtx;\n\n// 内部構造体 - 辺情報\ntypedef struct Edge {\n\tint miVNo1;\t\t\t\t\t\t\t\t\t\t\t\t\t// 頂点１\n\tint miVNo2;\t\t\t\t\t\t\t\t\t\t\t\t\t// 頂点２\n} Edge;\n\n// 内部変数\nstatic Vtx sz1Vtx[D_VTX_MAX + 5];\t\t\t\t\t\t\t\t// 頂点情報\nstatic int siVCnt;\t\t\t\t\t\t\t\t\t\t\t\t// 頂点情報数\nstatic Edge sz1Edge[D_VTX_MAX];\t\t\t\t\t\t\t\t\t// 辺情報\nstatic int siECnt;\t\t\t\t\t\t\t\t\t\t\t\t// 辺情報数\n\n// 内部変数 - テスト用\n#ifdef D_TEST\n\tstatic int siRes;\n\tstatic FILE *szpFpT, *szpFpA;\n#endif\n\n// 頂点情報 - 辺追加\nint\nfVtxEdgeAdd(\n\tint piVNo1\t\t\t\t\t// <I> 頂点１\n\t, int piVNo2\t\t\t\t// <I> 頂点２\n)\n{\n\t// 対象データ\n\tVtx *lzpVtx = &sz1Vtx[piVNo1];\n\n\t// 接続頂点\n\tlzpVtx->mi1Vtx[lzpVtx->miVCnt] = piVNo2;\n\n\t// 接続頂点数\n\tlzpVtx->miVCnt++;\n\n\treturn 0;\n}\n\n// 頂点情報 - 辺削除\nint\nfVtxEdgeDel(\n\tint piVNo1\t\t\t\t\t// <I> 頂点１\n\t, int piVNo2\t\t\t\t// <I> 頂点２\n)\n{\n\tint i;\n\n\t// 対象データ\n\tVtx *lzpVtx = &sz1Vtx[piVNo1];\n\n\t// 接続頂点数\n\tlzpVtx->miVCnt--;\n\tif (lzpVtx->miVCnt < 1) {\n\t\treturn 0;\n\t}\n\n\t// 頂点２を検索\n\tint liNo;\n\tfor (i = 0; i <= lzpVtx->miVCnt; i++) {\n\t\tif (lzpVtx->mi1Vtx[i] == piVNo2) {\n\t\t\tliNo = i;\n\t\t\tbreak;\n\t\t}\n\t}\n\tif (liNo >= lzpVtx->miVCnt) {\t\t// 最終データ\n\t\treturn 0;\n\t}\n\n\t// 接続頂点 - 最終データで上書き\n\tlzpVtx->mi1Vtx[liNo] = lzpVtx->mi1Vtx[lzpVtx->miVCnt];\n\n\treturn 0;\n}\n\n// 頂点情報 - 連結チェック\nint\nfVtxConvChk(\n\tint piVNo1\t\t\t\t\t// <I> 頂点１\n\t, int piVNo2\t\t\t\t// <I> 頂点２\n)\n{\n\tint i, liRet;\n\n\t// 連結チェック\n\tif (piVNo1 == piVNo2) {\n\t\treturn 0;\n\t}\n\n\t// 対象データ\n\tVtx *lzpVtx = &sz1Vtx[piVNo1];\n\n\t// チェック済フラグ\n\tif (lzpVtx->miChk != D_OFF) {\n\t\treturn -1;\n\t}\n\tlzpVtx->miChk = D_ON;\n\n\t// 頂点数でループ\n\tfor (i = 0; i < lzpVtx->miVCnt; i++) {\n\t\tliRet = fVtxConvChk(lzpVtx->mi1Vtx[i], piVNo2);\n\t\tif (liRet == 0) {\n\t\t\treturn 0;\n\t\t}\n\t}\n\n\treturn -1;\n}\n\n// 実行メイン\nint\nfMain(\n\tint piTNo\t\t\t\t\t// <I> テスト番号 1～\n)\n{\n\tint i, j, liRet;\n\tchar lc1Buf[1024], lc1Out[1024];\n\n\t// データ初期化\n\tmemset(sz1Vtx, D_OFF, sizeof(sz1Vtx));\t\t\t\t\t\t// 頂点情報\n\n\t// テストファイルオープン\n#ifdef D_TEST\n\tsprintf(lc1Buf, \".\\\\Test\\\\T%d.txt\", piTNo);\n\tszpFpT = fopen(lc1Buf, \"r\");\n\tsprintf(lc1Buf, \".\\\\Test\\\\A%d.txt\", piTNo);\n\tszpFpA = fopen(lc1Buf, \"r\");\n\tsiRes = 0;\n#endif\n\n\t// 頂点情報数・辺情報数取得\n#ifdef D_TEST\n\tfgets(lc1Buf, sizeof(lc1Buf), szpFpT);\n#else\n\tfgets(lc1Buf, sizeof(lc1Buf), stdin);\n#endif\n\tsscanf(lc1Buf, \"%d%d\", &siVCnt, &siECnt);\n\n\t// 辺情報取得\n\tfor (i = 0; i < siECnt; i++) {\n#ifdef D_TEST\n\t\tfgets(lc1Buf, sizeof(lc1Buf), szpFpT);\n#else\n\t\tfgets(lc1Buf, sizeof(lc1Buf), stdin);\n#endif\n\t\tsscanf(lc1Buf, \"%d%d\", &sz1Edge[i].miVNo1, &sz1Edge[i].miVNo2);\n\n\t\t// 頂点情報 - 辺追加\n\t\tfVtxEdgeAdd(sz1Edge[i].miVNo1, sz1Edge[i].miVNo2);\n\t\tfVtxEdgeAdd(sz1Edge[i].miVNo2, sz1Edge[i].miVNo1);\n\t}\n\n\t// 橋の数取得\n\tint liCnt = 0;\n\tfor (i = 0; i < siECnt; i++) {\n\n\t\t// 頂点情報 - 辺削除\n\t\tfVtxEdgeDel(sz1Edge[i].miVNo1, sz1Edge[i].miVNo2);\n\t\tfVtxEdgeDel(sz1Edge[i].miVNo2, sz1Edge[i].miVNo1);\n\n\t\t// 頂点情報 - チェック済フラグ初期化\n\t\tfor (j = 0; j < siVCnt; j++) {\n\t\t\tsz1Vtx[j].miChk = D_OFF;\n\t\t}\n\n\t\t// 頂点情報 - 連結チェック\n\t\tliRet = fVtxConvChk(sz1Edge[i].miVNo1, sz1Edge[i].miVNo2);\n\t\tif (liRet != 0) {\t\t\t\t\t\t\t\t\t\t\t\t// 非連結\n\t\t\tliCnt++;\n\t\t}\n\n\t\t// 頂点情報 - 辺追加\n\t\tfVtxEdgeAdd(sz1Edge[i].miVNo1, sz1Edge[i].miVNo2);\n\t\tfVtxEdgeAdd(sz1Edge[i].miVNo2, sz1Edge[i].miVNo1);\n\t}\n\n\t// 結果セット\n\tsprintf(lc1Out, \"%d\\n\", liCnt);\n\n\t// 結果表示\n#ifdef D_TEST\n\tfgets(lc1Buf, sizeof(lc1Buf), szpFpA);\n\tif (strcmp(lc1Buf, lc1Out)) {\n\t\tsiRes = -1;\n\t}\n#else\n\tprintf(\"%s\", lc1Out);\n#endif\n\n\t// テストファイルクローズ\n#ifdef D_TEST\n\tfclose(szpFpT);\n\tfclose(szpFpA);\n#endif\n\n\t// テスト結果\n#ifdef D_TEST\n\tif (siRes == 0) {\n\t\tprintf(\"OK %d\\n\", piTNo);\n\t}\n\telse {\n\t\tprintf(\"NG %d\\n\", piTNo);\n\t}\n#endif\n\n\treturn 0;\n}\n\nint\nmain()\n{\n\n#ifdef D_TEST\n\tint i;\n\tfor (i = D_TEST_SNO; i <= D_TEST_ENO; i++) {\n\t\tfMain(i);\n\t}\n#else\n\tfMain(0);\n#endif\n\n\treturn 0;\n}\n\n", "language": "C", "metadata": {"date": 1532547388, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "problem_description_relpath": "problem_descriptions/p03575.html", "problem_id": "p03575", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03575/input.txt", "sample_output_relpath": "derived/input_output/data/p03575/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03575/C/s480570558.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s480570558", "user_id": "u088333128"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "#include <limits.h>\n#include <math.h>\n#include <stdio.h>\n#include <stdlib.h>\n#include <string.h>\n#include <time.h>\n\n// 内部定数\n#define D_ON\t\t\t1\t\t\t\t\t\t\t\t\t\t// 汎用フラグ - ON\n#define D_OFF\t\t\t0\t\t\t\t\t\t\t\t\t\t// 汎用フラグ - OFF\n#define D_VTX_MAX\t\t50\t\t\t\t\t\t\t\t\t\t// 最大頂点数\n\n// 内部構造体 - 頂点情報\ntypedef struct Vtx {\n\tint mi1Vtx[D_VTX_MAX + 5];\t\t\t\t\t\t\t\t\t// 接続頂点\n\tint miVCnt;\t\t\t\t\t\t\t\t\t\t\t\t\t// 接続頂点数\n\tint miChk;\t\t\t\t\t\t\t\t\t\t\t\t\t// チェック済フラグ\n} Vtx;\n\n// 内部構造体 - 辺情報\ntypedef struct Edge {\n\tint miVNo1;\t\t\t\t\t\t\t\t\t\t\t\t\t// 頂点１\n\tint miVNo2;\t\t\t\t\t\t\t\t\t\t\t\t\t// 頂点２\n} Edge;\n\n// 内部変数\nstatic Vtx sz1Vtx[D_VTX_MAX + 5];\t\t\t\t\t\t\t\t// 頂点情報\nstatic int siVCnt;\t\t\t\t\t\t\t\t\t\t\t\t// 頂点情報数\nstatic Edge sz1Edge[D_VTX_MAX];\t\t\t\t\t\t\t\t\t// 辺情報\nstatic int siECnt;\t\t\t\t\t\t\t\t\t\t\t\t// 辺情報数\n\n// 内部変数 - テスト用\n#ifdef D_TEST\n\tstatic int siRes;\n\tstatic FILE *szpFpT, *szpFpA;\n#endif\n\n// 頂点情報 - 辺追加\nint\nfVtxEdgeAdd(\n\tint piVNo1\t\t\t\t\t// <I> 頂点１\n\t, int piVNo2\t\t\t\t// <I> 頂点２\n)\n{\n\t// 対象データ\n\tVtx *lzpVtx = &sz1Vtx[piVNo1];\n\n\t// 接続頂点\n\tlzpVtx->mi1Vtx[lzpVtx->miVCnt] = piVNo2;\n\n\t// 接続頂点数\n\tlzpVtx->miVCnt++;\n\n\treturn 0;\n}\n\n// 頂点情報 - 辺削除\nint\nfVtxEdgeDel(\n\tint piVNo1\t\t\t\t\t// <I> 頂点１\n\t, int piVNo2\t\t\t\t// <I> 頂点２\n)\n{\n\tint i;\n\n\t// 対象データ\n\tVtx *lzpVtx = &sz1Vtx[piVNo1];\n\n\t// 接続頂点数\n\tlzpVtx->miVCnt--;\n\tif (lzpVtx->miVCnt < 1) {\n\t\treturn 0;\n\t}\n\n\t// 頂点２を検索\n\tint liNo;\n\tfor (i = 0; i <= lzpVtx->miVCnt; i++) {\n\t\tif (lzpVtx->mi1Vtx[i] == piVNo2) {\n\t\t\tliNo = i;\n\t\t\tbreak;\n\t\t}\n\t}\n\tif (liNo >= lzpVtx->miVCnt) {\t\t// 最終データ\n\t\treturn 0;\n\t}\n\n\t// 接続頂点 - 最終データで上書き\n\tlzpVtx->mi1Vtx[liNo] = lzpVtx->mi1Vtx[lzpVtx->miVCnt];\n\n\treturn 0;\n}\n\n// 頂点情報 - 連結チェック\nint\nfVtxConvChk(\n\tint piVNo1\t\t\t\t\t// <I> 頂点１\n\t, int piVNo2\t\t\t\t// <I> 頂点２\n)\n{\n\tint i, liRet;\n\n\t// 連結チェック\n\tif (piVNo1 == piVNo2) {\n\t\treturn 0;\n\t}\n\n\t// 対象データ\n\tVtx *lzpVtx = &sz1Vtx[piVNo1];\n\n\t// チェック済フラグ\n\tif (lzpVtx->miChk != D_OFF) {\n\t\treturn -1;\n\t}\n\tlzpVtx->miChk = D_ON;\n\n\t// 頂点数でループ\n\tfor (i = 0; i < lzpVtx->miVCnt; i++) {\n\t\tliRet = fVtxConvChk(lzpVtx->mi1Vtx[i], piVNo2);\n\t\tif (liRet == 0) {\n\t\t\treturn 0;\n\t\t}\n\t}\n\n\treturn -1;\n}\n\n// 実行メイン\nint\nfMain(\n\tint piTNo\t\t\t\t\t// <I> テスト番号 1～\n)\n{\n\tint i, j, liRet;\n\tchar lc1Buf[1024], lc1Out[1024];\n\n\t// データ初期化\n\tmemset(sz1Vtx, D_OFF, sizeof(sz1Vtx));\t\t\t\t\t\t// 頂点情報\n\n\t// テストファイルオープン\n#ifdef D_TEST\n\tsprintf(lc1Buf, \".\\\\Test\\\\T%d.txt\", piTNo);\n\tszpFpT = fopen(lc1Buf, \"r\");\n\tsprintf(lc1Buf, \".\\\\Test\\\\A%d.txt\", piTNo);\n\tszpFpA = fopen(lc1Buf, \"r\");\n\tsiRes = 0;\n#endif\n\n\t// 頂点情報数・辺情報数取得\n#ifdef D_TEST\n\tfgets(lc1Buf, sizeof(lc1Buf), szpFpT);\n#else\n\tfgets(lc1Buf, sizeof(lc1Buf), stdin);\n#endif\n\tsscanf(lc1Buf, \"%d%d\", &siVCnt, &siECnt);\n\n\t// 辺情報取得\n\tfor (i = 0; i < siECnt; i++) {\n#ifdef D_TEST\n\t\tfgets(lc1Buf, sizeof(lc1Buf), szpFpT);\n#else\n\t\tfgets(lc1Buf, sizeof(lc1Buf), stdin);\n#endif\n\t\tsscanf(lc1Buf, \"%d%d\", &sz1Edge[i].miVNo1, &sz1Edge[i].miVNo2);\n\n\t\t// 頂点情報 - 辺追加\n\t\tfVtxEdgeAdd(sz1Edge[i].miVNo1, sz1Edge[i].miVNo2);\n\t\tfVtxEdgeAdd(sz1Edge[i].miVNo2, sz1Edge[i].miVNo1);\n\t}\n\n\t// 橋の数取得\n\tint liCnt = 0;\n\tfor (i = 0; i < siECnt; i++) {\n\n\t\t// 頂点情報 - 辺削除\n\t\tfVtxEdgeDel(sz1Edge[i].miVNo1, sz1Edge[i].miVNo2);\n\t\tfVtxEdgeDel(sz1Edge[i].miVNo2, sz1Edge[i].miVNo1);\n\n\t\t// 頂点情報 - チェック済フラグ初期化\n\t\tfor (j = 0; j < siVCnt; j++) {\n\t\t\tsz1Vtx[j].miChk = D_OFF;\n\t\t}\n\n\t\t// 頂点情報 - 連結チェック\n\t\tliRet = fVtxConvChk(sz1Edge[i].miVNo1, sz1Edge[i].miVNo2);\n\t\tif (liRet != 0) {\t\t\t\t\t\t\t\t\t\t\t\t// 非連結\n\t\t\tliCnt++;\n\t\t}\n\n\t\t// 頂点情報 - 辺追加\n\t\tfVtxEdgeAdd(sz1Edge[i].miVNo1, sz1Edge[i].miVNo2);\n\t\tfVtxEdgeAdd(sz1Edge[i].miVNo2, sz1Edge[i].miVNo1);\n\t}\n\n\t// 結果セット\n\tsprintf(lc1Out, \"%d\\n\", liCnt);\n\n\t// 結果表示\n#ifdef D_TEST\n\tfgets(lc1Buf, sizeof(lc1Buf), szpFpA);\n\tif (strcmp(lc1Buf, lc1Out)) {\n\t\tsiRes = -1;\n\t}\n#else\n\tprintf(\"%s\", lc1Out);\n#endif\n\n\t// テストファイルクローズ\n#ifdef D_TEST\n\tfclose(szpFpT);\n\tfclose(szpFpA);\n#endif\n\n\t// テスト結果\n#ifdef D_TEST\n\tif (siRes == 0) {\n\t\tprintf(\"OK %d\\n\", piTNo);\n\t}\n\telse {\n\t\tprintf(\"NG %d\\n\", piTNo);\n\t}\n#endif\n\n\treturn 0;\n}\n\nint\nmain()\n{\n\n#ifdef D_TEST\n\tint i;\n\tfor (i = D_TEST_SNO; i <= D_TEST_ENO; i++) {\n\t\tfMain(i);\n\t}\n#else\n\tfMain(0);\n#endif\n\n\treturn 0;\n}\n\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nYou are given an undirected connected graph with N vertices and M edges that does not contain self-loops and double edges.\n\nThe i-th edge (1 \\leq i \\leq M) connects Vertex a_i and Vertex b_i.\n\nAn edge whose removal disconnects the graph is called a bridge.\n\nFind the number of the edges that are bridges among the M edges.\n\nNotes\n\nA self-loop is an edge i such that a_i=b_i (1 \\leq i \\leq M).\n\nDouble edges are a pair of edges i,j such that a_i=a_j and b_i=b_j (1 \\leq i<j \\leq M).\n\nAn undirected graph is said to be connected when there exists a path between every pair of vertices.\n\nConstraints\n\n2 \\leq N \\leq 50\n\nN-1 \\leq M \\leq min(N(N−1)⁄2,50)\n\n1 \\leq a_i<b_i \\leq N\n\nThe given graph does not contain self-loops and double edges.\n\nThe given graph is connected.\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\nPrint the number of the edges that are bridges among the M edges.\n\nSample Input 1\n\n7 7\n1 3\n2 7\n3 4\n4 5\n4 6\n5 6\n6 7\n\nSample Output 1\n\n4\n\nThe figure below shows the given graph:\n\nThe edges shown in red are bridges. There are four of them.\n\nSample Input 2\n\n3 3\n1 2\n1 3\n2 3\n\nSample Output 2\n\n0\n\nIt is possible that there is no bridge.\n\nSample Input 3\n\n6 5\n1 2\n2 3\n3 4\n4 5\n5 6\n\nSample Output 3\n\n5\n\nIt is possible that every edge is a bridge.", "sample_input": "7 7\n1 3\n2 7\n3 4\n4 5\n4 6\n5 6\n6 7\n"}, "reference_outputs": ["4\n"], "source_document_id": "p03575", "source_text": "Score : 300 points\n\nProblem Statement\n\nYou are given an undirected connected graph with N vertices and M edges that does not contain self-loops and double edges.\n\nThe i-th edge (1 \\leq i \\leq M) connects Vertex a_i and Vertex b_i.\n\nAn edge whose removal disconnects the graph is called a bridge.\n\nFind the number of the edges that are bridges among the M edges.\n\nNotes\n\nA self-loop is an edge i such that a_i=b_i (1 \\leq i \\leq M).\n\nDouble edges are a pair of edges i,j such that a_i=a_j and b_i=b_j (1 \\leq i<j \\leq M).\n\nAn undirected graph is said to be connected when there exists a path between every pair of vertices.\n\nConstraints\n\n2 \\leq N \\leq 50\n\nN-1 \\leq M \\leq min(N(N−1)⁄2,50)\n\n1 \\leq a_i<b_i \\leq N\n\nThe given graph does not contain self-loops and double edges.\n\nThe given graph is connected.\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\nPrint the number of the edges that are bridges among the M edges.\n\nSample Input 1\n\n7 7\n1 3\n2 7\n3 4\n4 5\n4 6\n5 6\n6 7\n\nSample Output 1\n\n4\n\nThe figure below shows the given graph:\n\nThe edges shown in red are bridges. There are four of them.\n\nSample Input 2\n\n3 3\n1 2\n1 3\n2 3\n\nSample Output 2\n\n0\n\nIt is possible that there is no bridge.\n\nSample Input 3\n\n6 5\n1 2\n2 3\n3 4\n4 5\n5 6\n\nSample Output 3\n\n5\n\nIt is possible that every edge is a bridge.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 4566, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s816531594", "group_id": "codeNet:p03576", "input_text": "#include<stdio.h>\n#include<stdlib.h>\n\nlong long max(long long a,long long b){\n\t\tif(a>b)return a;\n\t\treturn b;\n}\n\nlong long min(long long a,long long b){\n\t\tif(a<b)return a;\n\t\treturn b;\n}\n\nstruct xy{\n\t\tlong long x;\n\t\tlong long y;\n};\n\nint compare_intx(const void *a,const void *b){\n\t\tstruct xy A=*(struct xy*)a,B=*(struct xy*)b;\n\t\tif(A.x>B.x)return 1;\n\t\treturn -1;\n}\n\nint compare_inty(const void *a,const void *b){\n\t\tstruct xy A=*(struct xy*)a,B=*(struct xy*)b;\n\t\tif(A.y>B.y)return 1;\n\t\treturn -1;\n}\n\nint main(){\n\t\tstruct xy xy[51];\n\t\tint n,k,i,j;\n\t\tlong long ans=-1;\n\t\tscanf(\"%d%d\",&n,&k);\n\t\tfor(i=0;i<n;i++)scanf(\"%lld%lld\",&xy[i].x,&xy[i].y);\n\t\tqsort(xy,n,sizeof(struct xy),compare_intx);\n\t\tlong long h=0,w=0;\n\t\tfor(i=0;i+k-1<n;i++){\n\t\t\t\th=xy[i+k-1].x-xy[i].x;\n\t\t\t\tlong long mn=xy[i].y,mx=xy[i].y;\n\t\t\t\tfor(j=1;j<k;j++){\n\t\t\t\t\t\tmn=min(mn,xy[j+i].y);\n\t\t\t\t\t\tmx=max(mx,xy[j+i].y);\n\t\t\t\t}\n\t\t\t\tw=mx-mn;\n\t\t\t\tif(ans==-1)ans=h*w;\n\t\t\t\tans=min(ans,h*w);\n\t\t}\n\t\tqsort(xy,n,sizeof(struct xy),compare_inty);\n\t\tfor(i=0;i+k-1<n;i++){\n\t\t\t\th=xy[i+k-1].y-xy[i].y;\n\t\t\t\tlong long mn=xy[i].x,mx=xy[i].x;\n\t\t\t\tfor(j=0;j<k;j++){\n\t\t\t\t\t\tmn=min(mn,xy[i+j].x);\n\t\t\t\t\t\tmx=max(mx,xy[i+j].x);\n\t\t\t\t}\n\t\t\t\tw=mx-mn;\n\t\t\t\tans=min(ans,h*w);\n\t\t}\n\t\tprintf(\"%lld\\n\",ans);\n\t\treturn 0;\n}\n", "language": "C", "metadata": {"date": 1564519464, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "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/C/s816531594.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s816531594", "user_id": "u946810083"}, "prompt_components": {"gold_output": "21\n", "input_to_evaluate": "#include<stdio.h>\n#include<stdlib.h>\n\nlong long max(long long a,long long b){\n\t\tif(a>b)return a;\n\t\treturn b;\n}\n\nlong long min(long long a,long long b){\n\t\tif(a<b)return a;\n\t\treturn b;\n}\n\nstruct xy{\n\t\tlong long x;\n\t\tlong long y;\n};\n\nint compare_intx(const void *a,const void *b){\n\t\tstruct xy A=*(struct xy*)a,B=*(struct xy*)b;\n\t\tif(A.x>B.x)return 1;\n\t\treturn -1;\n}\n\nint compare_inty(const void *a,const void *b){\n\t\tstruct xy A=*(struct xy*)a,B=*(struct xy*)b;\n\t\tif(A.y>B.y)return 1;\n\t\treturn -1;\n}\n\nint main(){\n\t\tstruct xy xy[51];\n\t\tint n,k,i,j;\n\t\tlong long ans=-1;\n\t\tscanf(\"%d%d\",&n,&k);\n\t\tfor(i=0;i<n;i++)scanf(\"%lld%lld\",&xy[i].x,&xy[i].y);\n\t\tqsort(xy,n,sizeof(struct xy),compare_intx);\n\t\tlong long h=0,w=0;\n\t\tfor(i=0;i+k-1<n;i++){\n\t\t\t\th=xy[i+k-1].x-xy[i].x;\n\t\t\t\tlong long mn=xy[i].y,mx=xy[i].y;\n\t\t\t\tfor(j=1;j<k;j++){\n\t\t\t\t\t\tmn=min(mn,xy[j+i].y);\n\t\t\t\t\t\tmx=max(mx,xy[j+i].y);\n\t\t\t\t}\n\t\t\t\tw=mx-mn;\n\t\t\t\tif(ans==-1)ans=h*w;\n\t\t\t\tans=min(ans,h*w);\n\t\t}\n\t\tqsort(xy,n,sizeof(struct xy),compare_inty);\n\t\tfor(i=0;i+k-1<n;i++){\n\t\t\t\th=xy[i+k-1].y-xy[i].y;\n\t\t\t\tlong long mn=xy[i].x,mx=xy[i].x;\n\t\t\t\tfor(j=0;j<k;j++){\n\t\t\t\t\t\tmn=min(mn,xy[i+j].x);\n\t\t\t\t\t\tmx=max(mx,xy[i+j].x);\n\t\t\t\t}\n\t\t\t\tw=mx-mn;\n\t\t\t\tans=min(ans,h*w);\n\t\t}\n\t\tprintf(\"%lld\\n\",ans);\n\t\treturn 0;\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<j \\leq N)\n\ny_i≠y_j (1 \\leq i<j \\leq N)\n\nAll input values are integers. (Added at 21:50 JST)\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nx_1 y_1\n:\nx_{N} y_{N}\n\nOutput\n\nPrint the minimum possible area of a rectangle that satisfies the condition.\n\nSample Input 1\n\n4 4\n1 4\n3 3\n6 2\n8 1\n\nSample Output 1\n\n21\n\nOne rectangle that satisfies the condition with the minimum possible area has the following vertices: (1,1), (8,1), (1,4) and (8,4).\n\nIts area is (8-1) × (4-1) = 21.\n\nSample Input 2\n\n4 2\n0 0\n1 1\n2 2\n3 3\n\nSample Output 2\n\n1\n\nSample Input 3\n\n4 3\n-1000000000 -1000000000\n1000000000 1000000000\n-999999999 999999999\n999999999 -999999999\n\nSample Output 3\n\n3999999996000000001\n\nWatch out for integer overflows.", "sample_input": "4 4\n1 4\n3 3\n6 2\n8 1\n"}, "reference_outputs": ["21\n"], "source_document_id": "p03576", "source_text": "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<j \\leq N)\n\ny_i≠y_j (1 \\leq i<j \\leq N)\n\nAll input values are integers. (Added at 21:50 JST)\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nx_1 y_1\n:\nx_{N} y_{N}\n\nOutput\n\nPrint the minimum possible area of a rectangle that satisfies the condition.\n\nSample Input 1\n\n4 4\n1 4\n3 3\n6 2\n8 1\n\nSample Output 1\n\n21\n\nOne rectangle that satisfies the condition with the minimum possible area has the following vertices: (1,1), (8,1), (1,4) and (8,4).\n\nIts area is (8-1) × (4-1) = 21.\n\nSample Input 2\n\n4 2\n0 0\n1 1\n2 2\n3 3\n\nSample Output 2\n\n1\n\nSample Input 3\n\n4 3\n-1000000000 -1000000000\n1000000000 1000000000\n-999999999 999999999\n999999999 -999999999\n\nSample Output 3\n\n3999999996000000001\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": 1239, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s315429037", "group_id": "codeNet:p03588", "input_text": "#include <stdio.h>\n#include <stdlib.h>\n\nint cmp(const void*a, const void*b){\n    return *(int*)a - *(int*)b;\n}\n\nint main(){\n    int n,p,q;\n    scanf(\"%d\", &n);\n    int a[n], b[1000000];\n    for(int i=0;i<n;i++){\n        scanf(\"%d %d\", &p, &q);\n        a[i] = p;\n        b[p] = q;\n    }\n    qsort(a, n-1, sizeof(int), cmp);\n    printf(\"%d\", a[n-1]+b[a[n-1]]);\n    return 0;\n}", "language": "C", "metadata": {"date": 1506825389, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "problem_description_relpath": "problem_descriptions/p03588.html", "problem_id": "p03588", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03588/input.txt", "sample_output_relpath": "derived/input_output/data/p03588/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03588/C/s315429037.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s315429037", "user_id": "u580477675"}, "prompt_components": {"gold_output": "8\n", "input_to_evaluate": "#include <stdio.h>\n#include <stdlib.h>\n\nint cmp(const void*a, const void*b){\n    return *(int*)a - *(int*)b;\n}\n\nint main(){\n    int n,p,q;\n    scanf(\"%d\", &n);\n    int a[n], b[1000000];\n    for(int i=0;i<n;i++){\n        scanf(\"%d %d\", &p, &q);\n        a[i] = p;\n        b[p] = q;\n    }\n    qsort(a, n-1, sizeof(int), cmp);\n    printf(\"%d\", a[n-1]+b[a[n-1]]);\n    return 0;\n}", "problem_context": "Score : 200 points\n\nProblem Statement\n\nA group of people played a game. All players had distinct scores, which are positive integers.\n\nTakahashi knows N facts on the players' scores. The i-th fact is as follows: the A_i-th highest score among the players is B_i.\n\nFind the maximum possible number of players in the game.\n\nConstraints\n\n1 \\leq N \\leq 10^5\n\n1 \\leq A_i \\leq 10^9(1\\leq i\\leq N)\n\n0 \\leq B_i \\leq 10^9(1\\leq i\\leq N)\n\nIf i ≠ j, A_i ≠ A_j.\n\nThere exists a possible outcome of the game that are consistent with the facts.\n\nAll input values are integers.\n\nInputs\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 B_1\n:\nA_N B_N\n\nOutputs\n\nPrint the maximum possible number of players in the game.\n\nSample Input 1\n\n3\n4 7\n2 9\n6 2\n\nSample Output 1\n\n8\n\nThe maximum possible number of players is achieved when, for example, the players have the following scores: 12,9,8,7,5,2,1,0.\n\nSample Input 2\n\n5\n1 10\n3 6\n5 2\n4 4\n2 8\n\nSample Output 2\n\n7\n\nSample Input 3\n\n2\n1 1000000000\n1000000000 1\n\nSample Output 3\n\n1000000001", "sample_input": "3\n4 7\n2 9\n6 2\n"}, "reference_outputs": ["8\n"], "source_document_id": "p03588", "source_text": "Score : 200 points\n\nProblem Statement\n\nA group of people played a game. All players had distinct scores, which are positive integers.\n\nTakahashi knows N facts on the players' scores. The i-th fact is as follows: the A_i-th highest score among the players is B_i.\n\nFind the maximum possible number of players in the game.\n\nConstraints\n\n1 \\leq N \\leq 10^5\n\n1 \\leq A_i \\leq 10^9(1\\leq i\\leq N)\n\n0 \\leq B_i \\leq 10^9(1\\leq i\\leq N)\n\nIf i ≠ j, A_i ≠ A_j.\n\nThere exists a possible outcome of the game that are consistent with the facts.\n\nAll input values are integers.\n\nInputs\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 B_1\n:\nA_N B_N\n\nOutputs\n\nPrint the maximum possible number of players in the game.\n\nSample Input 1\n\n3\n4 7\n2 9\n6 2\n\nSample Output 1\n\n8\n\nThe maximum possible number of players is achieved when, for example, the players have the following scores: 12,9,8,7,5,2,1,0.\n\nSample Input 2\n\n5\n1 10\n3 6\n5 2\n4 4\n2 8\n\nSample Output 2\n\n7\n\nSample Input 3\n\n2\n1 1000000000\n1000000000 1\n\nSample Output 3\n\n1000000001", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 97, "memory_kb": 1276}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s631264955", "group_id": "codeNet:p03589", "input_text": "#include <stdio.h>\nint main() {\n\tlong int m, n, w, p, q;\n\tscanf(\"%ld\", &m);\n\tfor (w = 1; w <= 3500; w+=m)\n\t{\n\t\tfor (n = 1; n <= 3500; n++)\n\t\t{\n\t\t\tp = m*n*w;\n\t\t\tq = 4 * n*w - m*w - m*n;\n\t\t\tif (q > 0 && p % q == 0)\n\t\t\t{\n\t\t\t\tprintf(\"%ld %ld %ld\", p / q, n, w);\n\t\t\t\treturn 0;\n\t\t\t}\n\t\t}\n\t}\n\tprintf(\"Cant Solve\");\n\treturn 0;\n}\n", "language": "C", "metadata": {"date": 1506833433, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "problem_description_relpath": "problem_descriptions/p03589.html", "problem_id": "p03589", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03589/input.txt", "sample_output_relpath": "derived/input_output/data/p03589/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03589/C/s631264955.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s631264955", "user_id": "u857484987"}, "prompt_components": {"gold_output": "1 2 2\n", "input_to_evaluate": "#include <stdio.h>\nint main() {\n\tlong int m, n, w, p, q;\n\tscanf(\"%ld\", &m);\n\tfor (w = 1; w <= 3500; w+=m)\n\t{\n\t\tfor (n = 1; n <= 3500; n++)\n\t\t{\n\t\t\tp = m*n*w;\n\t\t\tq = 4 * n*w - m*w - m*n;\n\t\t\tif (q > 0 && p % q == 0)\n\t\t\t{\n\t\t\t\tprintf(\"%ld %ld %ld\", p / q, n, w);\n\t\t\t\treturn 0;\n\t\t\t}\n\t\t}\n\t}\n\tprintf(\"Cant Solve\");\n\treturn 0;\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": "p03589", "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": 320, "cpu_time_ms": 32, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s399214817", "group_id": "codeNet:p03597", "input_text": "/* ex2_3\n   KKOO  */\n\n#include <stdio.h>\n\nint main(void) {\n    int ALL,WHITE;\n  \n    printf(\"ALL=\");\n    //マス目の一辺の入力\n    scanf(\"%d\",&ALL);\n  \n    printf(\"WHITE=\");\n     //白いマスの入力\n    scanf(\"%d\",&WHITE);\n  \n    //黒いマスの入力\n    printf(\"BLACK=%d\\n\",ALL*ALL-WHITE);\n\n    return 0;\n}\n", "language": "C", "metadata": {"date": 1589478669, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "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/C/s399214817.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s399214817", "user_id": "u305182838"}, "prompt_components": {"gold_output": "5\n", "input_to_evaluate": "/* ex2_3\n   KKOO  */\n\n#include <stdio.h>\n\nint main(void) {\n    int ALL,WHITE;\n  \n    printf(\"ALL=\");\n    //マス目の一辺の入力\n    scanf(\"%d\",&ALL);\n  \n    printf(\"WHITE=\");\n     //白いマスの入力\n    scanf(\"%d\",&WHITE);\n  \n    //黒いマスの入力\n    printf(\"BLACK=%d\\n\",ALL*ALL-WHITE);\n\n    return 0;\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": 323, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s981500399", "group_id": "codeNet:p03597", "input_text": "#include<stdio.h>\n#include<math.h>\nint main()\n{\n\tint N,a,b;\n\tscanf(\"%d\\n%d\\n\",&N,&a);\n\tb=N*N-a;\n\tprintf(\"%d\\n\",b);\n\treturn 0;\n  }  \n", "language": "C", "metadata": {"date": 1509586170, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "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/C/s981500399.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s981500399", "user_id": "u863370423"}, "prompt_components": {"gold_output": "5\n", "input_to_evaluate": "#include<stdio.h>\n#include<math.h>\nint main()\n{\n\tint N,a,b;\n\tscanf(\"%d\\n%d\\n\",&N,&a);\n\tb=N*N-a;\n\tprintf(\"%d\\n\",b);\n\treturn 0;\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": 132, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s930791161", "group_id": "codeNet:p03605", "input_text": "#include <stdio.h>\nint main(void){\n    int N;\n    \n    scanf(\"%d\\n\", &N);\n    if(N / 10 == 9 || N % 10 == 9){\n        printf(\"Yes\\n\");\n    }else{\n        printf(\"No\\n\");\n    }\n    \n}\n", "language": "C", "metadata": {"date": 1595086276, "filename_ext": "c", "original_language": "C (GCC 9.2.1)", "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/C/s930791161.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s930791161", "user_id": "u818573308"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "#include <stdio.h>\nint main(void){\n    int N;\n    \n    scanf(\"%d\\n\", &N);\n    if(N / 10 == 9 || N % 10 == 9){\n        printf(\"Yes\\n\");\n    }else{\n        printf(\"No\\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": 183, "cpu_time_ms": 5, "memory_kb": 1640}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s325652692", "group_id": "codeNet:p03607", "input_text": "#include<stdio.h>\n#define MAX 100000\n\nvoid sort(int A[], int N)\n{\n        int i, j, tmp;\n        for(i=0; i<N; i++)\n        {\n                for(j=i; j<N; j++)\n                {\n                        if(A[i] > A[j])\n                        {\n                                tmp = A[i];\n                                A[i] = A[j];\n                                A[j] = tmp;\n                        }\n                }\n        }\n}\n\nint main()\n{\n        int A[MAX];\n        int N;\n        int i, j;\n        int cnt;\n\n        scanf(\"%d\", &N);\n        for(i=0; i<N; i++)scanf(\"%d\", &A[i]);\n\n        sort(A, N);\n\n        //for(i=0; i<N; i++)printf(\"%d \", A[i]);\n\n        cnt = 0;\n        for(i=0; i<N-1; i++)\n        {\n                if(A[i]==A[i+1])i++;\n                else cnt++;\n        }\n\n        printf(\"%d\\n\", cnt);\n\n        return 0;\n}", "language": "C", "metadata": {"date": 1505006952, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "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/C/s325652692.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s325652692", "user_id": "u434107355"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "#include<stdio.h>\n#define MAX 100000\n\nvoid sort(int A[], int N)\n{\n        int i, j, tmp;\n        for(i=0; i<N; i++)\n        {\n                for(j=i; j<N; j++)\n                {\n                        if(A[i] > A[j])\n                        {\n                                tmp = A[i];\n                                A[i] = A[j];\n                                A[j] = tmp;\n                        }\n                }\n        }\n}\n\nint main()\n{\n        int A[MAX];\n        int N;\n        int i, j;\n        int cnt;\n\n        scanf(\"%d\", &N);\n        for(i=0; i<N; i++)scanf(\"%d\", &A[i]);\n\n        sort(A, N);\n\n        //for(i=0; i<N; i++)printf(\"%d \", A[i]);\n\n        cnt = 0;\n        for(i=0; i<N-1; i++)\n        {\n                if(A[i]==A[i+1])i++;\n                else cnt++;\n        }\n\n        printf(\"%d\\n\", cnt);\n\n        return 0;\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": 843, "cpu_time_ms": 2103, "memory_kb": 512}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s873167206", "group_id": "codeNet:p03609", "input_text": "#include <stdio.h>\n\nint main (void)\n{\n    long X,t,ans;\n    scanf(\"%ld\",&X);\n    scanf(\"%ld\",&t);\n    if(X<t){\n        ans=0;\n    }else{\n        ans=X-t;\n    }\n    printf(\"%ld\",ans);\n    return 0;\n}\n", "language": "C", "metadata": {"date": 1591845786, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "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/C/s873167206.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s873167206", "user_id": "u436528803"}, "prompt_components": {"gold_output": "83\n", "input_to_evaluate": "#include <stdio.h>\n\nint main (void)\n{\n    long X,t,ans;\n    scanf(\"%ld\",&X);\n    scanf(\"%ld\",&t);\n    if(X<t){\n        ans=0;\n    }else{\n        ans=X-t;\n    }\n    printf(\"%ld\",ans);\n    return 0;\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": 199, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s703377460", "group_id": "codeNet:p03610", "input_text": "#include <stdio.h>\nint main(void)\n{\n        int i=0;\n        char s[10001000];\n\n        scanf(\"%s\",s);\n        if(s[0]==' ')   return 0;\n\n        while(s[i]!='\\0') {    \n                 printf(\"%c\",s[i]);  i=i+2;\n                 }\n        printf(\"\\n\");\n                return 0;\n}", "language": "C", "metadata": {"date": 1586629032, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "problem_description_relpath": "problem_descriptions/p03610.html", "problem_id": "p03610", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03610/input.txt", "sample_output_relpath": "derived/input_output/data/p03610/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03610/C/s703377460.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s703377460", "user_id": "u708763476"}, "prompt_components": {"gold_output": "acdr\n", "input_to_evaluate": "#include <stdio.h>\nint main(void)\n{\n        int i=0;\n        char s[10001000];\n\n        scanf(\"%s\",s);\n        if(s[0]==' ')   return 0;\n\n        while(s[i]!='\\0') {    \n                 printf(\"%c\",s[i]);  i=i+2;\n                 }\n        printf(\"\\n\");\n                return 0;\n}", "problem_context": "Score : 200 points\n\nProblem Statement\n\nYou are given a string s consisting of lowercase English letters. Extract all the characters in the odd-indexed positions and print the string obtained by concatenating them. Here, the leftmost character is assigned the index 1.\n\nConstraints\n\nEach character in s is a lowercase English letter.\n\n1≤|s|≤10^5\n\nInput\n\nThe input is given from Standard Input in the following format:\n\ns\n\nOutput\n\nPrint the string obtained by concatenating all the characters in the odd-numbered positions.\n\nSample Input 1\n\natcoder\n\nSample Output 1\n\nacdr\n\nExtract the first character a, the third character c, the fifth character d and the seventh character r to obtain acdr.\n\nSample Input 2\n\naaaa\n\nSample Output 2\n\naa\n\nSample Input 3\n\nz\n\nSample Output 3\n\nz\n\nSample Input 4\n\nfukuokayamaguchi\n\nSample Output 4\n\nfkoaaauh", "sample_input": "atcoder\n"}, "reference_outputs": ["acdr\n"], "source_document_id": "p03610", "source_text": "Score : 200 points\n\nProblem Statement\n\nYou are given a string s consisting of lowercase English letters. Extract all the characters in the odd-indexed positions and print the string obtained by concatenating them. Here, the leftmost character is assigned the index 1.\n\nConstraints\n\nEach character in s is a lowercase English letter.\n\n1≤|s|≤10^5\n\nInput\n\nThe input is given from Standard Input in the following format:\n\ns\n\nOutput\n\nPrint the string obtained by concatenating all the characters in the odd-numbered positions.\n\nSample Input 1\n\natcoder\n\nSample Output 1\n\nacdr\n\nExtract the first character a, the third character c, the fifth character d and the seventh character r to obtain acdr.\n\nSample Input 2\n\naaaa\n\nSample Output 2\n\naa\n\nSample Input 3\n\nz\n\nSample Output 3\n\nz\n\nSample Input 4\n\nfukuokayamaguchi\n\nSample Output 4\n\nfkoaaauh", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 282, "cpu_time_ms": 2, "memory_kb": 2304}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s701961075", "group_id": "codeNet:p03610", "input_text": "#include <stdio.h>\nint main(void)\n{\n        int a[30],i=0,j;\n        char s[100];\n\n        scanf(\"%s\",s);\n\n        while(s[i]=='\\0') {printf(\"%s\",s[i]);  i=i+2; }\n\n        printf(\"\\n\");\n                return 0;\n}", "language": "C", "metadata": {"date": 1586623543, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "problem_description_relpath": "problem_descriptions/p03610.html", "problem_id": "p03610", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03610/input.txt", "sample_output_relpath": "derived/input_output/data/p03610/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03610/C/s701961075.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s701961075", "user_id": "u708763476"}, "prompt_components": {"gold_output": "acdr\n", "input_to_evaluate": "#include <stdio.h>\nint main(void)\n{\n        int a[30],i=0,j;\n        char s[100];\n\n        scanf(\"%s\",s);\n\n        while(s[i]=='\\0') {printf(\"%s\",s[i]);  i=i+2; }\n\n        printf(\"\\n\");\n                return 0;\n}", "problem_context": "Score : 200 points\n\nProblem Statement\n\nYou are given a string s consisting of lowercase English letters. Extract all the characters in the odd-indexed positions and print the string obtained by concatenating them. Here, the leftmost character is assigned the index 1.\n\nConstraints\n\nEach character in s is a lowercase English letter.\n\n1≤|s|≤10^5\n\nInput\n\nThe input is given from Standard Input in the following format:\n\ns\n\nOutput\n\nPrint the string obtained by concatenating all the characters in the odd-numbered positions.\n\nSample Input 1\n\natcoder\n\nSample Output 1\n\nacdr\n\nExtract the first character a, the third character c, the fifth character d and the seventh character r to obtain acdr.\n\nSample Input 2\n\naaaa\n\nSample Output 2\n\naa\n\nSample Input 3\n\nz\n\nSample Output 3\n\nz\n\nSample Input 4\n\nfukuokayamaguchi\n\nSample Output 4\n\nfkoaaauh", "sample_input": "atcoder\n"}, "reference_outputs": ["acdr\n"], "source_document_id": "p03610", "source_text": "Score : 200 points\n\nProblem Statement\n\nYou are given a string s consisting of lowercase English letters. Extract all the characters in the odd-indexed positions and print the string obtained by concatenating them. Here, the leftmost character is assigned the index 1.\n\nConstraints\n\nEach character in s is a lowercase English letter.\n\n1≤|s|≤10^5\n\nInput\n\nThe input is given from Standard Input in the following format:\n\ns\n\nOutput\n\nPrint the string obtained by concatenating all the characters in the odd-numbered positions.\n\nSample Input 1\n\natcoder\n\nSample Output 1\n\nacdr\n\nExtract the first character a, the third character c, the fifth character d and the seventh character r to obtain acdr.\n\nSample Input 2\n\naaaa\n\nSample Output 2\n\naa\n\nSample Input 3\n\nz\n\nSample Output 3\n\nz\n\nSample Input 4\n\nfukuokayamaguchi\n\nSample Output 4\n\nfkoaaauh", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 97, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s924236682", "group_id": "codeNet:p03610", "input_text": "#include <stdio.h>\nint main(void)\n{\n  char s[200000];\n  fgets(s, sizeof(s), stdin);\n  for (int i=0; s[i] != '\\n'; i++) {\n    if (i%2 == 0) {\n      printf(\"%c\", s[i]);\n    }\n  }\n      printf(\"\\n\");\n  return 0;\n}\n", "language": "C", "metadata": {"date": 1583439312, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "problem_description_relpath": "problem_descriptions/p03610.html", "problem_id": "p03610", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03610/input.txt", "sample_output_relpath": "derived/input_output/data/p03610/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03610/C/s924236682.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s924236682", "user_id": "u163185262"}, "prompt_components": {"gold_output": "acdr\n", "input_to_evaluate": "#include <stdio.h>\nint main(void)\n{\n  char s[200000];\n  fgets(s, sizeof(s), stdin);\n  for (int i=0; s[i] != '\\n'; i++) {\n    if (i%2 == 0) {\n      printf(\"%c\", s[i]);\n    }\n  }\n      printf(\"\\n\");\n  return 0;\n}\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nYou are given a string s consisting of lowercase English letters. Extract all the characters in the odd-indexed positions and print the string obtained by concatenating them. Here, the leftmost character is assigned the index 1.\n\nConstraints\n\nEach character in s is a lowercase English letter.\n\n1≤|s|≤10^5\n\nInput\n\nThe input is given from Standard Input in the following format:\n\ns\n\nOutput\n\nPrint the string obtained by concatenating all the characters in the odd-numbered positions.\n\nSample Input 1\n\natcoder\n\nSample Output 1\n\nacdr\n\nExtract the first character a, the third character c, the fifth character d and the seventh character r to obtain acdr.\n\nSample Input 2\n\naaaa\n\nSample Output 2\n\naa\n\nSample Input 3\n\nz\n\nSample Output 3\n\nz\n\nSample Input 4\n\nfukuokayamaguchi\n\nSample Output 4\n\nfkoaaauh", "sample_input": "atcoder\n"}, "reference_outputs": ["acdr\n"], "source_document_id": "p03610", "source_text": "Score : 200 points\n\nProblem Statement\n\nYou are given a string s consisting of lowercase English letters. Extract all the characters in the odd-indexed positions and print the string obtained by concatenating them. Here, the leftmost character is assigned the index 1.\n\nConstraints\n\nEach character in s is a lowercase English letter.\n\n1≤|s|≤10^5\n\nInput\n\nThe input is given from Standard Input in the following format:\n\ns\n\nOutput\n\nPrint the string obtained by concatenating all the characters in the odd-numbered positions.\n\nSample Input 1\n\natcoder\n\nSample Output 1\n\nacdr\n\nExtract the first character a, the third character c, the fifth character d and the seventh character r to obtain acdr.\n\nSample Input 2\n\naaaa\n\nSample Output 2\n\naa\n\nSample Input 3\n\nz\n\nSample Output 3\n\nz\n\nSample Input 4\n\nfukuokayamaguchi\n\nSample Output 4\n\nfkoaaauh", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 211, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s663818345", "group_id": "codeNet:p03612", "input_text": "\n//   AtCoder Beginner Contest 072 D\n\n#include<stdio.h>\n\n\n    int p[100005];\n\nint main(void)\n{\n\n    int i, N, a =0, t;\n\n    scanf(\"%d\", &N);\n\n    for(i = 0; i < 100005; i++)\n        p[i] = 0;\n\n    for(i = 1; i <= N; i++){\n        scanf(\"%d\", &p[i]);\n    }\n   \n    for(i = 1; i <= N-1; i++){\n        if (p[i] == i) {\n            t = p[i];\n            p[i] = p[i+1];\n            p[i+1] =t;\n            a++;\n        }\n    }\n   \n    {\n        if (p[i] == i) {\n            t = p[i];\n            p[i] = p[i-1];\n            p[i-1] =t;\n            a++;\n        }\n   }\n    printf(\"%d\\n\", a);\n\n    return 0;\n}", "language": "C", "metadata": {"date": 1504571414, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "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/C/s663818345.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s663818345", "user_id": "u655992433"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "\n//   AtCoder Beginner Contest 072 D\n\n#include<stdio.h>\n\n\n    int p[100005];\n\nint main(void)\n{\n\n    int i, N, a =0, t;\n\n    scanf(\"%d\", &N);\n\n    for(i = 0; i < 100005; i++)\n        p[i] = 0;\n\n    for(i = 1; i <= N; i++){\n        scanf(\"%d\", &p[i]);\n    }\n   \n    for(i = 1; i <= N-1; i++){\n        if (p[i] == i) {\n            t = p[i];\n            p[i] = p[i+1];\n            p[i+1] =t;\n            a++;\n        }\n    }\n   \n    {\n        if (p[i] == i) {\n            t = p[i];\n            p[i] = p[i-1];\n            p[i-1] =t;\n            a++;\n        }\n   }\n    printf(\"%d\\n\", a);\n\n    return 0;\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": 599, "cpu_time_ms": 11, "memory_kb": 512}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s886496458", "group_id": "codeNet:p03617", "input_text": "#include <stdio.h>\nstatic long q, h, s, d, n, sum;\ndouble f(double cost, double size) {\n    return cost / size;\n}\nint main(void) {\n    scanf(\"%ld%ld%ld%ld%ld\", &q, &h, &s, &d, &n);\n    if (f(s, 1) <= f(d, 2))\n        d = 2 * s;\n    if (f(h, 0.5) <= f(s, 1))\n        s = 2 * h;\n    if (f(h, 0.5) <= f(d, 2))\n        d = 4 * h;\n    if (f(q, 0.25) <= f(h, 0.5))\n        h = 2 * q;\n    if (f(q, 0.25) <= f(s, 1))\n        s = 4 * q;\n    if (f(q, 0.25) <= f(d, 2))\n        d = 8 * q;\n    while (n >= 2) {\n        sum += d;\n        n -= 2;\n    }\n    while (n >= 1) {\n        sum += s;\n        n -= 1;\n    }\n    while (n >= 0.5) {\n        sum += h;\n        n -= 0.5;\n    }\n    while (n >= 0.25) {\n        sum += q;\n        n -= 0.25;\n    }\n    printf(\"%ld\\n\", sum);\n    return 0;\n}\n", "language": "C", "metadata": {"date": 1503817183, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "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/C/s886496458.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s886496458", "user_id": "u346443137"}, "prompt_components": {"gold_output": "150\n", "input_to_evaluate": "#include <stdio.h>\nstatic long q, h, s, d, n, sum;\ndouble f(double cost, double size) {\n    return cost / size;\n}\nint main(void) {\n    scanf(\"%ld%ld%ld%ld%ld\", &q, &h, &s, &d, &n);\n    if (f(s, 1) <= f(d, 2))\n        d = 2 * s;\n    if (f(h, 0.5) <= f(s, 1))\n        s = 2 * h;\n    if (f(h, 0.5) <= f(d, 2))\n        d = 4 * h;\n    if (f(q, 0.25) <= f(h, 0.5))\n        h = 2 * q;\n    if (f(q, 0.25) <= f(s, 1))\n        s = 4 * q;\n    if (f(q, 0.25) <= f(d, 2))\n        d = 8 * q;\n    while (n >= 2) {\n        sum += d;\n        n -= 2;\n    }\n    while (n >= 1) {\n        sum += s;\n        n -= 1;\n    }\n    while (n >= 0.5) {\n        sum += h;\n        n -= 0.5;\n    }\n    while (n >= 0.25) {\n        sum += q;\n        n -= 0.25;\n    }\n    printf(\"%ld\\n\", sum);\n    return 0;\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": 774, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s617387180", "group_id": "codeNet:p03623", "input_text": "#include <stdio.h>\nint main()\n{\n   int r, g, b;\n   scanf(\"%d %d\" , &r, &g);\n   b = (g*2)-r;\n   printf(\"%d\", b);\n   return 0;\n}", "language": "C", "metadata": {"date": 1597982000, "filename_ext": "c", "original_language": "C (GCC 9.2.1)", "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/C/s617387180.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s617387180", "user_id": "u018679195"}, "prompt_components": {"gold_output": "B\n", "input_to_evaluate": "#include <stdio.h>\nint main()\n{\n   int r, g, b;\n   scanf(\"%d %d\" , &r, &g);\n   b = (g*2)-r;\n   printf(\"%d\", b);\n   return 0;\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": 126, "cpu_time_ms": 6, "memory_kb": 1732}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s636818715", "group_id": "codeNet:p03623", "input_text": "#include <stdio.h>\n#include <string.h>\n#include <stdlib.h>\n#include <math.h>\n#include <stdlib.h>\n#include <stdbool.h>\n#define MOD 1000000007\n#define INFTY 2147400000\n#define END printf(\"\\n\");return 0;\n#define QS09(how_data,data) qsort(data,how_data,sizeof(long),(int (*)(const void *,const void *))qsort_09);\n#define QS90(how_data,data) qsort(data,how_data,sizeof(long),(int (*)(const void *,const void *))qsort_90);\n#define In(a) long a;scanf(\"%ld\",&a);\n#define Out(a) printf(\"%ld\\n\",a);\n#define MAKE_ARRAY_DATA In(how_data);long data[how_data];input_array(how_data,data);\nvoid input_array(long how_data,long *data);\nvoid output_array(long how_data,long *data);\nvoid input_array2(long first , long second , long data[][2]);\nvoid format_array(long how_data ,long *data,long what);\nlong get_random(long min, long max);\nlong factorial(long n);\nlong fibonacci(long n);\nint qsort_09(const int *sys1 , const int *sys2);\nint qsort_90(const int *sys1 , const int *sys2);\nlong sel_max(long a , long b);\nlong sel_min(long a , long b);\nlong array_max(long how_data,long *data);\nlong array_min(long how_data,long *data);\nlong array_search(long how_data,long *data,long what);\nlong can_DP(long how_data,long *data,long how_can,bool *can);\nlong array_sum(long how_data,long *data);\nlong Leven_dist(char *now , char *target);\nlong get_digit(long target);\nlong rounding(double target);\nlong roundingdown(double target);\nlong roundingup(double target);\nlong ncr(long n , long r);\nlong npr(long n , long r);\nlong nhr(long n , long r);\nint fifw(long add,long *data);\nlong fifr(long *data);\nvoid GRAPH_input(void);\nvoid GRAPH_dfs(long now);\nbool check_prime(long target);\n\n//グローバル変数一覧\nlong fifo[1000]={0};//fifo[0]はデータ件数\nlong loop1,loop2,loop3,loop4,loop5,i_temp;\nlong g_ans=0; //answerグローバル変数用\n\ntypedef struct{\n    long how_vertex;\n    long how_edge;\n    long edge_data[1000][2];\n    bool aleady_searched_vertex[500];\n    bool all_searched;\n} _GD;//GraphData\n\n_GD GRAPH={0,0,{{0}},{0},0};\n\nchar c_temp;\n//loop5 loop4 loop3 loop2 loop1\n//--------------ここから\n\n\nint main(void){\n    In(x);In(a);In(b);\n    if(abs(x-a)>abs(x-b)){\n        printf(\"B\");\n    }else{\n        printf(\"A\");\n    }\nEND;}\n\n//--------------ここまで\n \nvoid input_array(long how_data,long *data){\n    long loop;\n    for(loop=0;loop<how_data;loop++){\n        scanf(\"%ld\",&data[loop]);\n    }\n    return ;\n}\nvoid output_array(long how_data,long *data){\n    long loop;\n    for(loop=0;loop<how_data-1;loop++){\n        printf(\"%ld \",data[loop]);\n    }\n    return ;\n}\nvoid input_array2(long first,long second,long data[][2]){\n    long loopA,loopB;\n    for(loopA=0;loopA<first;loopA++){\n        for(loopB=0;loopB<second;loopB++){\n            scanf(\"%ld\",&data[loopA][loopB]);\n        }\n    }\n    return ;\n}\nvoid format_array(long how_data ,long *data,long what){\n    long loopA;\n    for(loopA=0;loopA<how_data;loopA++){\n        data[loopA]=what;\n    }\n    return ;\n}\nlong get_random(long min, long max){   //指定の範囲から乱数を1つ返すやつ\n    //srand((unsigned int)time(0));   //現在時刻で疑似乱数初期化\n    rand();rand();rand();rand();    //乱数を空打ち\n    return (rand()%(max+1-min))+min;\n}\nlong factorial(long n){//n!のMOD10^9+7を返すやつ\n    unsigned long long int ret=1;\n    for(long i=1;i<=n;i++)ret=(ret*i)%1000000007;\n    return (long)ret;\n}\nint qsort_09(const int *sys1 , const int *sys2){ //小さいのが上にくるやつ\n    //qsort(data,how_data,sizeof(long),(int (*)(const void *,const void *))qsort_09);\n    if(*sys1<*sys2){\n        return -1;\n    }else if(*sys1==*sys2){\n        return 0;\n    }else{\n        return 1;\n    }\n}\nint qsort_90(const int *sys1 , const int *sys2){ //大きいのが上にくるやつ\n    //qsort(data,how_data,sizeof(long),(int (*)(const void *,const void *))qsort_90);\n    if(*sys1<*sys2){\n        return 1;\n    }else if(*sys1==*sys2){\n        return 0;\n    }else{\n        return -1;\n    }\n}\nlong fibonacci(long n){\n    switch(n){\n        case 0:return 0;\n        case 1:return 1;\n        default :return fibonacci(n-1)+fibonacci(n-2);\n    }\n}\nlong sel_max(long a,long b){\n    if(a>b)return a;\n    return b;\n}\nlong sel_min(long a,long b){\n    if(a>b)return b;\n    return a;\n}\nlong can_DP(long how_data,long *data,long how_can,bool *can){//Typical DP Contest A\n    //data内で組み合わせられる和をcanに0 or 1で入れる\n    //返り値はパターン数\n    long loopA,loopB;\n    long ret=0;\n    for(loopA=0;loopA<how_can;loopA++){//初期化\n        can[loopA]=0;\n    }\n    can[0]=1;//絶対にありえる\n    for(loopA=0;loopA<how_data;loopA++){\n        for(loopB=how_can-1;loopB>=0;loopB--){\n            if(can[loopB]==1 && loopB+data[loopA]<how_can){\n                can[loopB+data[loopA]]=1;\n            }\n        }\n    }\n    for(loopA=0;loopA<how_can;loopA++){\n        if(can[loopA]==1){\n            ret++;\n        }\n    }\n    return ret;\n}\nlong array_max(long how_data,long *data){\n    long loop;\n    long ret=data[0];\n    for(loop=0;loop<how_data;loop++){\n        if(ret<data[loop])ret=data[loop];\n    }\n    return ret;\n}\nlong array_min(long how_data,long *data){\n    long loop;\n    long ret=data[0];\n    for(loop=0;loop<how_data;loop++){\n        if(ret>data[loop])ret=data[loop];\n    }\n    return ret;\n}\nlong array_sum(long how_data,long *data){\n    long ret=0;\n    long loop;\n    for(loop=0;loop<how_data;loop++){\n        ret+=data[loop];\n    }\n    return ret;\n}\nlong array_search(long how_data,long *data,long what){\n    long loop;\n    for(loop=0;loop<how_data;loop++){\n        if(data[loop]==what){\n            return loop;\n        }\n    }\n    return -1;\n}\nlong Leven_dist(char *now , char *target){\n    long loopA,loopB;\n    //レーベンシュタイン距離を求める\n    // 参考文献\n    // http://nw.tsuda.ac.jp/class/algoB/c13.html  (アルゴリズム理解)\n    // http://d.hatena.ne.jp/ohnishiakira/20090809/1249845529  (実装)\n    long len_now=strlen(now)+1;\n    long len_target=strlen(target)+1;\n    long d[len_now][len_target]; //計算用\n    for(loopA=0;loopA<len_now;loopA++) d[loopA][0]=loopA;\n    for(loopA=0;loopA<len_target;loopA++) d[0][loopA]=loopA;\n    for(loopA=1;loopA<len_now;loopA++){\n        for(loopB=1;loopB<len_target;loopB++){\n            long cost=(now[loopA-1]==target[loopB-1] ? 0:1);\n            d[loopA][loopB]=sel_min(sel_min(d[loopA-1][loopB]+1,d[loopA][loopB-1]+1),d[loopA-1][loopB-1]+cost);\n        }\n    }\n    return d[len_now-1][len_target-1];\n}\nlong get_digit(long target){\n    return (long)(log10(target)+1);\n}\nlong ncr(long n , long r){\n    //パスカルの三角形\n    long loopA,loopB;\n    long pascal[100][102]={{0}};\n    pascal[1][0]=1;\n    pascal[1][1]=1;\n    for(loopA=2;loopA<100;loopA++){\n        pascal[loopA][0]=1;\n        for(loopB=1;loopB<loopA;loopB++){\n            pascal[loopA][loopB]=pascal[loopA-1][loopB-1]+pascal[loopA-1][loopB];\n        }\n        pascal[loopA][loopA]=1;\n    }\n    return pascal[n][r];\n}\nlong npr(long n, long r){\n    return ncr(n,r)*factorial(r);\n}\nlong nhr(long n , long r){\n    return ncr(n+r-1,r);\n}\nlong rounding(double target){\n    return (long)target+0.50;\n}\nlong roundingup(double target){\n    return (long)ceil(target);\n}\nlong roundingdown(double target){\n    return (long)floor(target);\n}\nint fifw(long add,long *data){\n    data[data[0]+1]=add;\n    data[0]++;\n    return data[0]; //現在のデータ件数を返す\n}\nlong fifr(long *data){\n    long ret=data[1];\n    data[0]--;\n    for(int i=1;i<999;i++){\n        data[i]=data[i+1];\n    }\n    return ret;\n}\nvoid GRAPH_input(void){\n    scanf(\"%ld %ld\\n\",&GRAPH.how_vertex,&GRAPH.how_edge);\n    for(long loopA=0;loopA<GRAPH.how_edge;loopA++){\n        scanf(\"%ld %ld\\n\",&GRAPH.edge_data[loopA][0],&GRAPH.edge_data[loopA][1]);\n    }\n    return;\n}\n\nvoid GRAPH_dfs(long now){\n    GRAPH.aleady_searched_vertex[now]=1;\n    for(int loopA=0;loopA<GRAPH.how_edge;loopA++){\n        if(GRAPH.edge_data[loopA][0]==now && GRAPH.aleady_searched_vertex[GRAPH.edge_data[loopA][1]]==0){\n            GRAPH_dfs(GRAPH.edge_data[loopA][1]);\n        }\n        if(GRAPH.edge_data[loopA][1]==now && GRAPH.aleady_searched_vertex[GRAPH.edge_data[loopA][0]]==0){\n            GRAPH_dfs(GRAPH.edge_data[loopA][0]);\n        }\n    }\n    return ;\n}\n\nbool check_prime(long target){//素数判定、素数なら1\n    if(target==2)return 1;\n    if(target<=1 || target%2==0)return 0;\n    for(int loopA=3;loopA<=sqrt(target)+1;loopA+=2)if(target%loopA==0)return 0;\n    return 1;\n}\n\n\n", "language": "C", "metadata": {"date": 1514923312, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "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/C/s636818715.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s636818715", "user_id": "u926548116"}, "prompt_components": {"gold_output": "B\n", "input_to_evaluate": "#include <stdio.h>\n#include <string.h>\n#include <stdlib.h>\n#include <math.h>\n#include <stdlib.h>\n#include <stdbool.h>\n#define MOD 1000000007\n#define INFTY 2147400000\n#define END printf(\"\\n\");return 0;\n#define QS09(how_data,data) qsort(data,how_data,sizeof(long),(int (*)(const void *,const void *))qsort_09);\n#define QS90(how_data,data) qsort(data,how_data,sizeof(long),(int (*)(const void *,const void *))qsort_90);\n#define In(a) long a;scanf(\"%ld\",&a);\n#define Out(a) printf(\"%ld\\n\",a);\n#define MAKE_ARRAY_DATA In(how_data);long data[how_data];input_array(how_data,data);\nvoid input_array(long how_data,long *data);\nvoid output_array(long how_data,long *data);\nvoid input_array2(long first , long second , long data[][2]);\nvoid format_array(long how_data ,long *data,long what);\nlong get_random(long min, long max);\nlong factorial(long n);\nlong fibonacci(long n);\nint qsort_09(const int *sys1 , const int *sys2);\nint qsort_90(const int *sys1 , const int *sys2);\nlong sel_max(long a , long b);\nlong sel_min(long a , long b);\nlong array_max(long how_data,long *data);\nlong array_min(long how_data,long *data);\nlong array_search(long how_data,long *data,long what);\nlong can_DP(long how_data,long *data,long how_can,bool *can);\nlong array_sum(long how_data,long *data);\nlong Leven_dist(char *now , char *target);\nlong get_digit(long target);\nlong rounding(double target);\nlong roundingdown(double target);\nlong roundingup(double target);\nlong ncr(long n , long r);\nlong npr(long n , long r);\nlong nhr(long n , long r);\nint fifw(long add,long *data);\nlong fifr(long *data);\nvoid GRAPH_input(void);\nvoid GRAPH_dfs(long now);\nbool check_prime(long target);\n\n//グローバル変数一覧\nlong fifo[1000]={0};//fifo[0]はデータ件数\nlong loop1,loop2,loop3,loop4,loop5,i_temp;\nlong g_ans=0; //answerグローバル変数用\n\ntypedef struct{\n    long how_vertex;\n    long how_edge;\n    long edge_data[1000][2];\n    bool aleady_searched_vertex[500];\n    bool all_searched;\n} _GD;//GraphData\n\n_GD GRAPH={0,0,{{0}},{0},0};\n\nchar c_temp;\n//loop5 loop4 loop3 loop2 loop1\n//--------------ここから\n\n\nint main(void){\n    In(x);In(a);In(b);\n    if(abs(x-a)>abs(x-b)){\n        printf(\"B\");\n    }else{\n        printf(\"A\");\n    }\nEND;}\n\n//--------------ここまで\n \nvoid input_array(long how_data,long *data){\n    long loop;\n    for(loop=0;loop<how_data;loop++){\n        scanf(\"%ld\",&data[loop]);\n    }\n    return ;\n}\nvoid output_array(long how_data,long *data){\n    long loop;\n    for(loop=0;loop<how_data-1;loop++){\n        printf(\"%ld \",data[loop]);\n    }\n    return ;\n}\nvoid input_array2(long first,long second,long data[][2]){\n    long loopA,loopB;\n    for(loopA=0;loopA<first;loopA++){\n        for(loopB=0;loopB<second;loopB++){\n            scanf(\"%ld\",&data[loopA][loopB]);\n        }\n    }\n    return ;\n}\nvoid format_array(long how_data ,long *data,long what){\n    long loopA;\n    for(loopA=0;loopA<how_data;loopA++){\n        data[loopA]=what;\n    }\n    return ;\n}\nlong get_random(long min, long max){   //指定の範囲から乱数を1つ返すやつ\n    //srand((unsigned int)time(0));   //現在時刻で疑似乱数初期化\n    rand();rand();rand();rand();    //乱数を空打ち\n    return (rand()%(max+1-min))+min;\n}\nlong factorial(long n){//n!のMOD10^9+7を返すやつ\n    unsigned long long int ret=1;\n    for(long i=1;i<=n;i++)ret=(ret*i)%1000000007;\n    return (long)ret;\n}\nint qsort_09(const int *sys1 , const int *sys2){ //小さいのが上にくるやつ\n    //qsort(data,how_data,sizeof(long),(int (*)(const void *,const void *))qsort_09);\n    if(*sys1<*sys2){\n        return -1;\n    }else if(*sys1==*sys2){\n        return 0;\n    }else{\n        return 1;\n    }\n}\nint qsort_90(const int *sys1 , const int *sys2){ //大きいのが上にくるやつ\n    //qsort(data,how_data,sizeof(long),(int (*)(const void *,const void *))qsort_90);\n    if(*sys1<*sys2){\n        return 1;\n    }else if(*sys1==*sys2){\n        return 0;\n    }else{\n        return -1;\n    }\n}\nlong fibonacci(long n){\n    switch(n){\n        case 0:return 0;\n        case 1:return 1;\n        default :return fibonacci(n-1)+fibonacci(n-2);\n    }\n}\nlong sel_max(long a,long b){\n    if(a>b)return a;\n    return b;\n}\nlong sel_min(long a,long b){\n    if(a>b)return b;\n    return a;\n}\nlong can_DP(long how_data,long *data,long how_can,bool *can){//Typical DP Contest A\n    //data内で組み合わせられる和をcanに0 or 1で入れる\n    //返り値はパターン数\n    long loopA,loopB;\n    long ret=0;\n    for(loopA=0;loopA<how_can;loopA++){//初期化\n        can[loopA]=0;\n    }\n    can[0]=1;//絶対にありえる\n    for(loopA=0;loopA<how_data;loopA++){\n        for(loopB=how_can-1;loopB>=0;loopB--){\n            if(can[loopB]==1 && loopB+data[loopA]<how_can){\n                can[loopB+data[loopA]]=1;\n            }\n        }\n    }\n    for(loopA=0;loopA<how_can;loopA++){\n        if(can[loopA]==1){\n            ret++;\n        }\n    }\n    return ret;\n}\nlong array_max(long how_data,long *data){\n    long loop;\n    long ret=data[0];\n    for(loop=0;loop<how_data;loop++){\n        if(ret<data[loop])ret=data[loop];\n    }\n    return ret;\n}\nlong array_min(long how_data,long *data){\n    long loop;\n    long ret=data[0];\n    for(loop=0;loop<how_data;loop++){\n        if(ret>data[loop])ret=data[loop];\n    }\n    return ret;\n}\nlong array_sum(long how_data,long *data){\n    long ret=0;\n    long loop;\n    for(loop=0;loop<how_data;loop++){\n        ret+=data[loop];\n    }\n    return ret;\n}\nlong array_search(long how_data,long *data,long what){\n    long loop;\n    for(loop=0;loop<how_data;loop++){\n        if(data[loop]==what){\n            return loop;\n        }\n    }\n    return -1;\n}\nlong Leven_dist(char *now , char *target){\n    long loopA,loopB;\n    //レーベンシュタイン距離を求める\n    // 参考文献\n    // http://nw.tsuda.ac.jp/class/algoB/c13.html  (アルゴリズム理解)\n    // http://d.hatena.ne.jp/ohnishiakira/20090809/1249845529  (実装)\n    long len_now=strlen(now)+1;\n    long len_target=strlen(target)+1;\n    long d[len_now][len_target]; //計算用\n    for(loopA=0;loopA<len_now;loopA++) d[loopA][0]=loopA;\n    for(loopA=0;loopA<len_target;loopA++) d[0][loopA]=loopA;\n    for(loopA=1;loopA<len_now;loopA++){\n        for(loopB=1;loopB<len_target;loopB++){\n            long cost=(now[loopA-1]==target[loopB-1] ? 0:1);\n            d[loopA][loopB]=sel_min(sel_min(d[loopA-1][loopB]+1,d[loopA][loopB-1]+1),d[loopA-1][loopB-1]+cost);\n        }\n    }\n    return d[len_now-1][len_target-1];\n}\nlong get_digit(long target){\n    return (long)(log10(target)+1);\n}\nlong ncr(long n , long r){\n    //パスカルの三角形\n    long loopA,loopB;\n    long pascal[100][102]={{0}};\n    pascal[1][0]=1;\n    pascal[1][1]=1;\n    for(loopA=2;loopA<100;loopA++){\n        pascal[loopA][0]=1;\n        for(loopB=1;loopB<loopA;loopB++){\n            pascal[loopA][loopB]=pascal[loopA-1][loopB-1]+pascal[loopA-1][loopB];\n        }\n        pascal[loopA][loopA]=1;\n    }\n    return pascal[n][r];\n}\nlong npr(long n, long r){\n    return ncr(n,r)*factorial(r);\n}\nlong nhr(long n , long r){\n    return ncr(n+r-1,r);\n}\nlong rounding(double target){\n    return (long)target+0.50;\n}\nlong roundingup(double target){\n    return (long)ceil(target);\n}\nlong roundingdown(double target){\n    return (long)floor(target);\n}\nint fifw(long add,long *data){\n    data[data[0]+1]=add;\n    data[0]++;\n    return data[0]; //現在のデータ件数を返す\n}\nlong fifr(long *data){\n    long ret=data[1];\n    data[0]--;\n    for(int i=1;i<999;i++){\n        data[i]=data[i+1];\n    }\n    return ret;\n}\nvoid GRAPH_input(void){\n    scanf(\"%ld %ld\\n\",&GRAPH.how_vertex,&GRAPH.how_edge);\n    for(long loopA=0;loopA<GRAPH.how_edge;loopA++){\n        scanf(\"%ld %ld\\n\",&GRAPH.edge_data[loopA][0],&GRAPH.edge_data[loopA][1]);\n    }\n    return;\n}\n\nvoid GRAPH_dfs(long now){\n    GRAPH.aleady_searched_vertex[now]=1;\n    for(int loopA=0;loopA<GRAPH.how_edge;loopA++){\n        if(GRAPH.edge_data[loopA][0]==now && GRAPH.aleady_searched_vertex[GRAPH.edge_data[loopA][1]]==0){\n            GRAPH_dfs(GRAPH.edge_data[loopA][1]);\n        }\n        if(GRAPH.edge_data[loopA][1]==now && GRAPH.aleady_searched_vertex[GRAPH.edge_data[loopA][0]]==0){\n            GRAPH_dfs(GRAPH.edge_data[loopA][0]);\n        }\n    }\n    return ;\n}\n\nbool check_prime(long target){//素数判定、素数なら1\n    if(target==2)return 1;\n    if(target<=1 || target%2==0)return 0;\n    for(int loopA=3;loopA<=sqrt(target)+1;loopA+=2)if(target%loopA==0)return 0;\n    return 1;\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": 8501, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s195695348", "group_id": "codeNet:p03625", "input_text": "#include<stdio.h>\n#include<stdlib.h>\n#include<string.h>\n \n#define NEW(p,n){p=malloc((n)*sizeof(p[0]));if(p==NULL){printf(\"not enough memory\\n\");exit(1);};}\n//pの型の変数n個の要素分のメモリを確保し、そのアドレスをpに代入するマクロ\n \n#define MAX(a, b) ((a) > (b) ? (a) : (b))\n#define MIN(a, b) ((a) < (b) ? (a) : (b))\n#define SWAP(type, x, y) do { type tmp = x; x = y; y = tmp; } while (0)\n \n#define MOD 1000000007 \n \n//降順\nint desc(const void* a, const void* b){\n    return *(int*)b-*(int*)a;\n}\n \nint main(void){\n    int N;\n    scanf(\"%d\",&N);\n \n    //A[0]~A[N-1]に格納する\n    int* A;\n    NEW(A,N);\n    for(int i=0;i<N;i++){\n        scanf(\"%d\",&A[i]);\n    }\n    qsort(A,N,sizeof(int),desc);\n \n    int H=0;\n    int W=0;\n    for(int i=1;i<N;i++){\n        if(A[i]==A[i-1]){\n            if(H==0) H=A[i];\n            else{\n                W=A[i];\n                break;\n            }\n            i++;\n        }\n    }\n \n    long ans=H*W;\n    printf(\"%ld\\n\",ans);\n \n    return 0;\n}", "language": "C", "metadata": {"date": 1576534475, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "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/C/s195695348.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s195695348", "user_id": "u941434715"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "#include<stdio.h>\n#include<stdlib.h>\n#include<string.h>\n \n#define NEW(p,n){p=malloc((n)*sizeof(p[0]));if(p==NULL){printf(\"not enough memory\\n\");exit(1);};}\n//pの型の変数n個の要素分のメモリを確保し、そのアドレスをpに代入するマクロ\n \n#define MAX(a, b) ((a) > (b) ? (a) : (b))\n#define MIN(a, b) ((a) < (b) ? (a) : (b))\n#define SWAP(type, x, y) do { type tmp = x; x = y; y = tmp; } while (0)\n \n#define MOD 1000000007 \n \n//降順\nint desc(const void* a, const void* b){\n    return *(int*)b-*(int*)a;\n}\n \nint main(void){\n    int N;\n    scanf(\"%d\",&N);\n \n    //A[0]~A[N-1]に格納する\n    int* A;\n    NEW(A,N);\n    for(int i=0;i<N;i++){\n        scanf(\"%d\",&A[i]);\n    }\n    qsort(A,N,sizeof(int),desc);\n \n    int H=0;\n    int W=0;\n    for(int i=1;i<N;i++){\n        if(A[i]==A[i-1]){\n            if(H==0) H=A[i];\n            else{\n                W=A[i];\n                break;\n            }\n            i++;\n        }\n    }\n \n    long ans=H*W;\n    printf(\"%ld\\n\",ans);\n \n    return 0;\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": 1016, "cpu_time_ms": 25, "memory_kb": 892}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s476796307", "group_id": "codeNet:p03626", "input_text": "#include <stdio.h>\n#include <stdlib.h>\n#include <stdbool.h>\n#include <string.h>\n#include <math.h>\n#include <limits.h>\n#define Max(a, b) ((a) > (b) ? (a) : (b))\n#define Min(a, b) ((a) > (b) ? (b) : (a))\n#define abs(x) ((x) > 0 ? (x) : -(x))\n#define MOD (ll)1000000007 //10^9 + 7\n#define endl printf(\"\\n\")\ntypedef long long ll;\n#define MAX_N (1 << 17)\n\nint\nmain(int argc, char *argv[])\n{\n  int n;\n  char s[2][53];\n  scanf(\"%d\", &n);\n  scanf(\"%s\", s[0]);\n  scanf(\"%s\", s[1]);\n\n  int i, f;\n  ll ans = 1;\n  if (s[0][0] == s[1][0]) {\n    i = 1; f = 0;\n    ans *= 3;\n  } else {\n    i = 2; f = 1;\n    ans *= 3;\n  }\n\n  while (i < n) {\n    if (f) {\n      if (s[0][i] != s[1][i]) {\n\tans *= (ll)3;\n\tans %= MOD;\n\ti += 2;\n\tf = 1;\n      } else {\n\ti += 1;\n\tf = 0;\n      }\n    } else {\n      if (s[0][i] != s[1][i]) {\n\tans *= (ll)2;\n\tans %= MOD;\n\ti += 2;\n\tf = 1;\n      } else {\n\tans *= (ll)2;\n\tans %= MOD;\n\ti += 1;\n\tf = 0;\n      }\n    }\n  }\n\n  printf(\"%lld\\n\", ans);\n\n  return 0;\n}\n\t\n", "language": "C", "metadata": {"date": 1566952361, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "problem_description_relpath": "problem_descriptions/p03626.html", "problem_id": "p03626", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03626/input.txt", "sample_output_relpath": "derived/input_output/data/p03626/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03626/C/s476796307.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s476796307", "user_id": "u801102476"}, "prompt_components": {"gold_output": "6\n", "input_to_evaluate": "#include <stdio.h>\n#include <stdlib.h>\n#include <stdbool.h>\n#include <string.h>\n#include <math.h>\n#include <limits.h>\n#define Max(a, b) ((a) > (b) ? (a) : (b))\n#define Min(a, b) ((a) > (b) ? (b) : (a))\n#define abs(x) ((x) > 0 ? (x) : -(x))\n#define MOD (ll)1000000007 //10^9 + 7\n#define endl printf(\"\\n\")\ntypedef long long ll;\n#define MAX_N (1 << 17)\n\nint\nmain(int argc, char *argv[])\n{\n  int n;\n  char s[2][53];\n  scanf(\"%d\", &n);\n  scanf(\"%s\", s[0]);\n  scanf(\"%s\", s[1]);\n\n  int i, f;\n  ll ans = 1;\n  if (s[0][0] == s[1][0]) {\n    i = 1; f = 0;\n    ans *= 3;\n  } else {\n    i = 2; f = 1;\n    ans *= 3;\n  }\n\n  while (i < n) {\n    if (f) {\n      if (s[0][i] != s[1][i]) {\n\tans *= (ll)3;\n\tans %= MOD;\n\ti += 2;\n\tf = 1;\n      } else {\n\ti += 1;\n\tf = 0;\n      }\n    } else {\n      if (s[0][i] != s[1][i]) {\n\tans *= (ll)2;\n\tans %= MOD;\n\ti += 2;\n\tf = 1;\n      } else {\n\tans *= (ll)2;\n\tans %= MOD;\n\ti += 1;\n\tf = 0;\n      }\n    }\n  }\n\n  printf(\"%lld\\n\", ans);\n\n  return 0;\n}\n\t\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nWe have a board with a 2 \\times N grid.\nSnuke covered the board with N dominoes without overlaps.\nHere, a domino can cover a 1 \\times 2 or 2 \\times 1 square.\n\nThen, Snuke decided to paint these dominoes using three colors: red, cyan and green.\nTwo dominoes that are adjacent by side should be painted by different colors.\nHere, it is not always necessary to use all three colors.\n\nFind the number of such ways to paint the dominoes, modulo 1000000007.\n\nThe arrangement of the dominoes is given to you as two strings S_1 and S_2 in the following manner:\n\nEach domino is represented by a different English letter (lowercase or uppercase).\n\nThe j-th character in S_i represents the domino that occupies the square at the i-th row from the top and j-th column from the left.\n\nConstraints\n\n1 \\leq N \\leq 52\n\n|S_1| = |S_2| = N\n\nS_1 and S_2 consist of lowercase and uppercase English letters.\n\nS_1 and S_2 represent a valid arrangement of dominoes.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS_1\nS_2\n\nOutput\n\nPrint the number of such ways to paint the dominoes, modulo 1000000007.\n\nSample Input 1\n\n3\naab\nccb\n\nSample Output 1\n\n6\n\nThere are six ways as shown below:\n\nSample Input 2\n\n1\nZ\nZ\n\nSample Output 2\n\n3\n\nNote that it is not always necessary to use all the colors.\n\nSample Input 3\n\n52\nRvvttdWIyyPPQFFZZssffEEkkaSSDKqcibbeYrhAljCCGGJppHHn\nRLLwwdWIxxNNQUUXXVVMMooBBaggDKqcimmeYrhAljOOTTJuuzzn\n\nSample Output 3\n\n958681902", "sample_input": "3\naab\nccb\n"}, "reference_outputs": ["6\n"], "source_document_id": "p03626", "source_text": "Score : 400 points\n\nProblem Statement\n\nWe have a board with a 2 \\times N grid.\nSnuke covered the board with N dominoes without overlaps.\nHere, a domino can cover a 1 \\times 2 or 2 \\times 1 square.\n\nThen, Snuke decided to paint these dominoes using three colors: red, cyan and green.\nTwo dominoes that are adjacent by side should be painted by different colors.\nHere, it is not always necessary to use all three colors.\n\nFind the number of such ways to paint the dominoes, modulo 1000000007.\n\nThe arrangement of the dominoes is given to you as two strings S_1 and S_2 in the following manner:\n\nEach domino is represented by a different English letter (lowercase or uppercase).\n\nThe j-th character in S_i represents the domino that occupies the square at the i-th row from the top and j-th column from the left.\n\nConstraints\n\n1 \\leq N \\leq 52\n\n|S_1| = |S_2| = N\n\nS_1 and S_2 consist of lowercase and uppercase English letters.\n\nS_1 and S_2 represent a valid arrangement of dominoes.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS_1\nS_2\n\nOutput\n\nPrint the number of such ways to paint the dominoes, modulo 1000000007.\n\nSample Input 1\n\n3\naab\nccb\n\nSample Output 1\n\n6\n\nThere are six ways as shown below:\n\nSample Input 2\n\n1\nZ\nZ\n\nSample Output 2\n\n3\n\nNote that it is not always necessary to use all the colors.\n\nSample Input 3\n\n52\nRvvttdWIyyPPQFFZZssffEEkkaSSDKqcibbeYrhAljCCGGJppHHn\nRLLwwdWIxxNNQUUXXVVMMooBBaggDKqcimmeYrhAljOOTTJuuzzn\n\nSample Output 3\n\n958681902", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s321163398", "group_id": "codeNet:p03631", "input_text": "#include<stdio.h>\n\nint main(void) {\n\tint N;\n\tscanf(\"%d\", &N);\n\tif (N/100==N%10) printf(\"Yes\");\n\telse printf(\"No\");\n\n\treturn 0;\n}\n", "language": "C", "metadata": {"date": 1588014349, "filename_ext": "c", "original_language": "C (Clang 3.8.0)", "problem_description_relpath": "problem_descriptions/p03631.html", "problem_id": "p03631", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03631/input.txt", "sample_output_relpath": "derived/input_output/data/p03631/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03631/C/s321163398.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s321163398", "user_id": "u189521276"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "#include<stdio.h>\n\nint main(void) {\n\tint N;\n\tscanf(\"%d\", &N);\n\tif (N/100==N%10) printf(\"Yes\");\n\telse printf(\"No\");\n\n\treturn 0;\n}\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou are given a three-digit positive integer N.\n\nDetermine whether N is a palindromic number.\n\nHere, a palindromic number is an integer that reads the same backward as forward in decimal notation.\n\nConstraints\n\n100≤N≤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 N is a palindromic number, print Yes; otherwise, print No.\n\nSample Input 1\n\n575\n\nSample Output 1\n\nYes\n\nN=575 is also 575 when read backward, so it is a palindromic number. You should print Yes.\n\nSample Input 2\n\n123\n\nSample Output 2\n\nNo\n\nN=123 becomes 321 when read backward, so it is not a palindromic number. You should print No.\n\nSample Input 3\n\n812\n\nSample Output 3\n\nNo", "sample_input": "575\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p03631", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou are given a three-digit positive integer N.\n\nDetermine whether N is a palindromic number.\n\nHere, a palindromic number is an integer that reads the same backward as forward in decimal notation.\n\nConstraints\n\n100≤N≤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 N is a palindromic number, print Yes; otherwise, print No.\n\nSample Input 1\n\n575\n\nSample Output 1\n\nYes\n\nN=575 is also 575 when read backward, so it is a palindromic number. You should print Yes.\n\nSample Input 2\n\n123\n\nSample Output 2\n\nNo\n\nN=123 becomes 321 when read backward, so it is not a palindromic number. You should print No.\n\nSample Input 3\n\n812\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": 129, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s807119559", "group_id": "codeNet:p03631", "input_text": "#include <stdio.h>\nint main(){\nint n;\nscanf(\"%d\",&n);\n\nint a,b,c;\na=n/100;\nb=(n%100)/10;\nc=(n%100)%10;\n\nif(a==c)  puts(\"Yes\");\nelse\nputs(\"No\");\n\n\nreturn 0;  \n}", "language": "C", "metadata": {"date": 1541187960, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "problem_description_relpath": "problem_descriptions/p03631.html", "problem_id": "p03631", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03631/input.txt", "sample_output_relpath": "derived/input_output/data/p03631/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03631/C/s807119559.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s807119559", "user_id": "u473296729"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "#include <stdio.h>\nint main(){\nint n;\nscanf(\"%d\",&n);\n\nint a,b,c;\na=n/100;\nb=(n%100)/10;\nc=(n%100)%10;\n\nif(a==c)  puts(\"Yes\");\nelse\nputs(\"No\");\n\n\nreturn 0;  \n}", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou are given a three-digit positive integer N.\n\nDetermine whether N is a palindromic number.\n\nHere, a palindromic number is an integer that reads the same backward as forward in decimal notation.\n\nConstraints\n\n100≤N≤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 N is a palindromic number, print Yes; otherwise, print No.\n\nSample Input 1\n\n575\n\nSample Output 1\n\nYes\n\nN=575 is also 575 when read backward, so it is a palindromic number. You should print Yes.\n\nSample Input 2\n\n123\n\nSample Output 2\n\nNo\n\nN=123 becomes 321 when read backward, so it is not a palindromic number. You should print No.\n\nSample Input 3\n\n812\n\nSample Output 3\n\nNo", "sample_input": "575\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p03631", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou are given a three-digit positive integer N.\n\nDetermine whether N is a palindromic number.\n\nHere, a palindromic number is an integer that reads the same backward as forward in decimal notation.\n\nConstraints\n\n100≤N≤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 N is a palindromic number, print Yes; otherwise, print No.\n\nSample Input 1\n\n575\n\nSample Output 1\n\nYes\n\nN=575 is also 575 when read backward, so it is a palindromic number. You should print Yes.\n\nSample Input 2\n\n123\n\nSample Output 2\n\nNo\n\nN=123 becomes 321 when read backward, so it is not a palindromic number. You should print No.\n\nSample Input 3\n\n812\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": 159, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s438212128", "group_id": "codeNet:p03632", "input_text": "#include <stdio.h>\nint main(void)\n{\n    int a,b,c,d,i,s,g,t=0;\n    \n    scanf(\"%d%d%d%d\",&a,&b,&c,&d);\n    if(a<c) s=a;\n    else s=c;\n    if(b>d) g=b;\n    else g=d;\n    for(i=s;i<=g;i++)\n        if(((a<=i)&&(i<b))&&((c<=i)&&(i<d)))\n            t++;\n    printf(\"%d\\n\",t);\n    return 0;\n}", "language": "C", "metadata": {"date": 1587666940, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "problem_description_relpath": "problem_descriptions/p03632.html", "problem_id": "p03632", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03632/input.txt", "sample_output_relpath": "derived/input_output/data/p03632/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03632/C/s438212128.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s438212128", "user_id": "u588556993"}, "prompt_components": {"gold_output": "50\n", "input_to_evaluate": "#include <stdio.h>\nint main(void)\n{\n    int a,b,c,d,i,s,g,t=0;\n    \n    scanf(\"%d%d%d%d\",&a,&b,&c,&d);\n    if(a<c) s=a;\n    else s=c;\n    if(b>d) g=b;\n    else g=d;\n    for(i=s;i<=g;i++)\n        if(((a<=i)&&(i<b))&&((c<=i)&&(i<d)))\n            t++;\n    printf(\"%d\\n\",t);\n    return 0;\n}", "problem_context": "Score : 200 points\n\nProblem Statement\n\nAlice and Bob are controlling a robot. They each have one switch that controls the robot.\n\nAlice started holding down her button A second after the start-up of the robot, and released her button B second after the start-up.\n\nBob started holding down his button C second after the start-up, and released his button D second after the start-up.\n\nFor how many seconds both Alice and Bob were holding down their buttons?\n\nConstraints\n\n0≤A<B≤100\n\n0≤C<D≤100\n\nAll input values 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 length of the duration (in seconds) in which both Alice and Bob were holding down their buttons.\n\nSample Input 1\n\n0 75 25 100\n\nSample Output 1\n\n50\n\nAlice started holding down her button 0 second after the start-up of the robot, and released her button 75 second after the start-up.\n\nBob started holding down his button 25 second after the start-up, and released his button 100 second after the start-up.\n\nTherefore, the time when both of them were holding down their buttons, is the 50 seconds from 25 seconds after the start-up to 75 seconds after the start-up.\n\nSample Input 2\n\n0 33 66 99\n\nSample Output 2\n\n0\n\nAlice and Bob were not holding their buttons at the same time, so the answer is zero seconds.\n\nSample Input 3\n\n10 90 20 80\n\nSample Output 3\n\n60", "sample_input": "0 75 25 100\n"}, "reference_outputs": ["50\n"], "source_document_id": "p03632", "source_text": "Score : 200 points\n\nProblem Statement\n\nAlice and Bob are controlling a robot. They each have one switch that controls the robot.\n\nAlice started holding down her button A second after the start-up of the robot, and released her button B second after the start-up.\n\nBob started holding down his button C second after the start-up, and released his button D second after the start-up.\n\nFor how many seconds both Alice and Bob were holding down their buttons?\n\nConstraints\n\n0≤A<B≤100\n\n0≤C<D≤100\n\nAll input values 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 length of the duration (in seconds) in which both Alice and Bob were holding down their buttons.\n\nSample Input 1\n\n0 75 25 100\n\nSample Output 1\n\n50\n\nAlice started holding down her button 0 second after the start-up of the robot, and released her button 75 second after the start-up.\n\nBob started holding down his button 25 second after the start-up, and released his button 100 second after the start-up.\n\nTherefore, the time when both of them were holding down their buttons, is the 50 seconds from 25 seconds after the start-up to 75 seconds after the start-up.\n\nSample Input 2\n\n0 33 66 99\n\nSample Output 2\n\n0\n\nAlice and Bob were not holding their buttons at the same time, so the answer is zero seconds.\n\nSample Input 3\n\n10 90 20 80\n\nSample Output 3\n\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": 286, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s855697385", "group_id": "codeNet:p03633", "input_text": "#include <stdio.h>\nlong long int yaku(long long int a,long long int b){\n  if(a < b){\n    long long int tmp = a;\n    a = b;\n    b = tmp;\n  }\n  long long int r = a % b;\n  while(r > 0){\n    a = b;\n    b = r;\n    r = a % b;\n  }\n  return b;\n}\nint main(){\n  int n;\n  scanf(\"%d\",&n);\n  long long int a[n];\n  for(int i = 0;i < n;i++){\n    scanf(\"%lld\",&a[i]);\n    if(i > 0){\n      a[i] = a[i] / yaku(a[i],a[i - 1]) * a[i - 1];\n    }\n  }\n  printf(\"%lld\\n\",a[n - 1]);\n  return 0;\n}", "language": "C", "metadata": {"date": 1552113192, "filename_ext": "c", "original_language": "C (Clang 3.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/C/s855697385.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s855697385", "user_id": "u008829811"}, "prompt_components": {"gold_output": "6\n", "input_to_evaluate": "#include <stdio.h>\nlong long int yaku(long long int a,long long int b){\n  if(a < b){\n    long long int tmp = a;\n    a = b;\n    b = tmp;\n  }\n  long long int r = a % b;\n  while(r > 0){\n    a = b;\n    b = r;\n    r = a % b;\n  }\n  return b;\n}\nint main(){\n  int n;\n  scanf(\"%d\",&n);\n  long long int a[n];\n  for(int i = 0;i < n;i++){\n    scanf(\"%lld\",&a[i]);\n    if(i > 0){\n      a[i] = a[i] / yaku(a[i],a[i - 1]) * a[i - 1];\n    }\n  }\n  printf(\"%lld\\n\",a[n - 1]);\n  return 0;\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": 471, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s575029394", "group_id": "codeNet:p03633", "input_text": "long g(a,b)long a,b;{return b?g(b,a%b):1;}\nlong m,a;main(n){for(scanf(\"%d\",&n);~scanf(\"%ld\",&a);m=m/g(m,a)*a)m==0&&(m=a);printf(\"%ld\",m);}", "language": "C", "metadata": {"date": 1502586308, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "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/C/s575029394.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s575029394", "user_id": "u657913472"}, "prompt_components": {"gold_output": "6\n", "input_to_evaluate": "long g(a,b)long a,b;{return b?g(b,a%b):1;}\nlong m,a;main(n){for(scanf(\"%d\",&n);~scanf(\"%ld\",&a);m=m/g(m,a)*a)m==0&&(m=a);printf(\"%ld\",m);}", "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": 138, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s874376063", "group_id": "codeNet:p03635", "input_text": "#include<stdio.h>\n\nint main()\n{\n int n, m, blocks;\n scanf(\"%d %d\",&n,&m);\n blocks = (n-1)*(m-1);\n printf(\"%d\\n\",blocks);\n\nreturn 0;\n}", "language": "C", "metadata": {"date": 1502067882, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "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/C/s874376063.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s874376063", "user_id": "u265756457"}, "prompt_components": {"gold_output": "6\n", "input_to_evaluate": "#include<stdio.h>\n\nint main()\n{\n int n, m, blocks;\n scanf(\"%d %d\",&n,&m);\n blocks = (n-1)*(m-1);\n printf(\"%d\\n\",blocks);\n\nreturn 0;\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": 133, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s633575471", "group_id": "codeNet:p03636", "input_text": "#include<stdio.h>\n#include<string.h>\nint main(){\n  char s[101];\n  scanf(\"%s\",s);\n  printf(\"%c%d%c\",s[0],strlen(s)-2,s[strlen(s)-1]);\n  return 0;}", "language": "C", "metadata": {"date": 1578604873, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "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/C/s633575471.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s633575471", "user_id": "u071680334"}, "prompt_components": {"gold_output": "i18n\n", "input_to_evaluate": "#include<stdio.h>\n#include<string.h>\nint main(){\n  char s[101];\n  scanf(\"%s\",s);\n  printf(\"%c%d%c\",s[0],strlen(s)-2,s[strlen(s)-1]);\n  return 0;}", "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": 145, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s994333150", "group_id": "codeNet:p03644", "input_text": "\n#include<stdio.h>\nint main()\n{\n  int\tn,max=1;\n  \n  scanf(\"%d\", &n);\n  \n  while(max < n){\n    max*=2;\n  }\n  \n  if(max>n) max=max/2;\n  \n  printf(\"%d\", max);\n  return 0;\n}", "language": "C", "metadata": {"date": 1558376689, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "problem_description_relpath": "problem_descriptions/p03644.html", "problem_id": "p03644", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03644/input.txt", "sample_output_relpath": "derived/input_output/data/p03644/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03644/C/s994333150.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s994333150", "user_id": "u011798377"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "\n#include<stdio.h>\nint main()\n{\n  int\tn,max=1;\n  \n  scanf(\"%d\", &n);\n  \n  while(max < n){\n    max*=2;\n  }\n  \n  if(max>n) max=max/2;\n  \n  printf(\"%d\", max);\n  return 0;\n}", "problem_context": "Score : 200 points\n\nProblem Statement\n\nTakahashi loves numbers divisible by 2.\n\nYou are given a positive integer N. Among the integers between 1 and N (inclusive), find the one that can be divisible by 2 for the most number of times. The solution is always unique.\n\nHere, the number of times an integer can be divisible by 2, is how many times the integer can be divided by 2 without remainder.\n\nFor example,\n\n6 can be divided by 2 once: 6 -> 3.\n\n8 can be divided by 2 three times: 8 -> 4 -> 2 -> 1.\n\n3 can be divided by 2 zero times.\n\nConstraints\n\n1 ≤ N ≤ 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\n7\n\nSample Output 1\n\n4\n\n4 can be divided by 2 twice, which is the most number of times among 1, 2, ..., 7.\n\nSample Input 2\n\n32\n\nSample Output 2\n\n32\n\nSample Input 3\n\n1\n\nSample Output 3\n\n1\n\nSample Input 4\n\n100\n\nSample Output 4\n\n64", "sample_input": "7\n"}, "reference_outputs": ["4\n"], "source_document_id": "p03644", "source_text": "Score : 200 points\n\nProblem Statement\n\nTakahashi loves numbers divisible by 2.\n\nYou are given a positive integer N. Among the integers between 1 and N (inclusive), find the one that can be divisible by 2 for the most number of times. The solution is always unique.\n\nHere, the number of times an integer can be divisible by 2, is how many times the integer can be divided by 2 without remainder.\n\nFor example,\n\n6 can be divided by 2 once: 6 -> 3.\n\n8 can be divided by 2 three times: 8 -> 4 -> 2 -> 1.\n\n3 can be divided by 2 zero times.\n\nConstraints\n\n1 ≤ N ≤ 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\n7\n\nSample Output 1\n\n4\n\n4 can be divided by 2 twice, which is the most number of times among 1, 2, ..., 7.\n\nSample Input 2\n\n32\n\nSample Output 2\n\n32\n\nSample Input 3\n\n1\n\nSample Output 3\n\n1\n\nSample Input 4\n\n100\n\nSample Output 4\n\n64", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 169, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s126220507", "group_id": "codeNet:p03645", "input_text": "#include <stdio.h>\n#include <stdlib.h>\n#define MAX_NUM 200000\n#define BIRTHDAY 1009\n\ntypedef struct hash{\n\tint num;\n\tstruct hash *next;\n}hash;\n\nvoid append(hash**, int);\nvoid search(hash**, int);\nvoid possible();\n\nint a_list[MAX_NUM] = {0};\nint a_index = 0;\nhash *hash_list[MAX_NUM/BIRTHDAY] = {NULL};\n\nint main(void){\n\tint N, M;\n\tint a, b;\n\tint i;\n\thash *p;\n\n\tscanf(\"%d %d\", &N, &M);\n\tfor(i = 0; i < M; i++){\n\t\tscanf(\"%d %d\", &a, &b);\n\t\tif(a == 1){\n\t\t\tappend(hash_list, b);\n\t\t}\n\t\tif(b == N){\n\t\t\ta_list[a_index++] = a;\n\t\t}\n\t}\n\n\tfor(i=0; i<a_index; i++){\n\t\t//search(hash_list, a_list[i]);\n\t}\n\n\tprintf(\"IMPOSSIBLE\");\n\treturn 0;\n}\n\nvoid append(hash **list, int num){\n\thash *p, *tmp;\n\thash *item;\n\ttmp = NULL;\n\tfor(p = list[num%BIRTHDAY]; p != NULL && p->num < num; p = p->next)\n\t\ttmp = p;\n\n\titem = (hash*)malloc(sizeof(hash));\n\titem->num = num;\n\titem->next = p;\n\tif(tmp == NULL)\n\t\tlist[num%BIRTHDAY] = item;\n\telse\n\t\ttmp->next = item;\n}\n\nvoid search(hash **list, int num){\n\thash *p;\n\tfor(p = list[num%BIRTHDAY]; p != NULL && p->num <= num; p = p->next){\n\t\tif(p->num == num)\n\t\t\tpossible();\n\t}\n}\n\nvoid possible(){\n\tprintf(\"POSSIBLE\");\n\texit(1);\n}", "language": "C", "metadata": {"date": 1505779994, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "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/C/s126220507.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s126220507", "user_id": "u301043830"}, "prompt_components": {"gold_output": "POSSIBLE\n", "input_to_evaluate": "#include <stdio.h>\n#include <stdlib.h>\n#define MAX_NUM 200000\n#define BIRTHDAY 1009\n\ntypedef struct hash{\n\tint num;\n\tstruct hash *next;\n}hash;\n\nvoid append(hash**, int);\nvoid search(hash**, int);\nvoid possible();\n\nint a_list[MAX_NUM] = {0};\nint a_index = 0;\nhash *hash_list[MAX_NUM/BIRTHDAY] = {NULL};\n\nint main(void){\n\tint N, M;\n\tint a, b;\n\tint i;\n\thash *p;\n\n\tscanf(\"%d %d\", &N, &M);\n\tfor(i = 0; i < M; i++){\n\t\tscanf(\"%d %d\", &a, &b);\n\t\tif(a == 1){\n\t\t\tappend(hash_list, b);\n\t\t}\n\t\tif(b == N){\n\t\t\ta_list[a_index++] = a;\n\t\t}\n\t}\n\n\tfor(i=0; i<a_index; i++){\n\t\t//search(hash_list, a_list[i]);\n\t}\n\n\tprintf(\"IMPOSSIBLE\");\n\treturn 0;\n}\n\nvoid append(hash **list, int num){\n\thash *p, *tmp;\n\thash *item;\n\ttmp = NULL;\n\tfor(p = list[num%BIRTHDAY]; p != NULL && p->num < num; p = p->next)\n\t\ttmp = p;\n\n\titem = (hash*)malloc(sizeof(hash));\n\titem->num = num;\n\titem->next = p;\n\tif(tmp == NULL)\n\t\tlist[num%BIRTHDAY] = item;\n\telse\n\t\ttmp->next = item;\n}\n\nvoid search(hash **list, int num){\n\thash *p;\n\tfor(p = list[num%BIRTHDAY]; p != NULL && p->num <= num; p = p->next){\n\t\tif(p->num == num)\n\t\t\tpossible();\n\t}\n}\n\nvoid possible(){\n\tprintf(\"POSSIBLE\");\n\texit(1);\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": 1140, "cpu_time_ms": 94, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s205492504", "group_id": "codeNet:p03646", "input_text": "#include<stdio.h>\nint main(void){\nlong long int k;\nscanf(\"%lld\",&k);\nprintf(\"4\\n\");\nint a[4]={0,1,2,3},i,m;\nfor(i=0;i<k;i++){\nm=i%4;\na[m]=a[m]+4;\nif(m==0){\na[1]=a[1]-1;\na[2]=a[2]-1;\na[3]=a[3]-1;\n}else if(m==1){\na[0]=a[0]-1;\na[2]=a[2]-1;\na[3]=a[3]-1;\n}else if(m==2){\na[0]=a[0]-1;\na[1]=a[1]-1;\na[3]=a[3]-1;\n}else{\na[0]=a[0]-1;\na[1]=a[1]-1;\na[2]=a[2]-1;\n}\n}\nprintf(\"%d %d %d %d\\n\",a[0],a[1],a[2],a[3]);\nreturn 0;\n}", "language": "C", "metadata": {"date": 1501553180, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "problem_description_relpath": "problem_descriptions/p03646.html", "problem_id": "p03646", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03646/input.txt", "sample_output_relpath": "derived/input_output/data/p03646/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03646/C/s205492504.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s205492504", "user_id": "u182100537"}, "prompt_components": {"gold_output": "4\n3 3 3 3\n", "input_to_evaluate": "#include<stdio.h>\nint main(void){\nlong long int k;\nscanf(\"%lld\",&k);\nprintf(\"4\\n\");\nint a[4]={0,1,2,3},i,m;\nfor(i=0;i<k;i++){\nm=i%4;\na[m]=a[m]+4;\nif(m==0){\na[1]=a[1]-1;\na[2]=a[2]-1;\na[3]=a[3]-1;\n}else if(m==1){\na[0]=a[0]-1;\na[2]=a[2]-1;\na[3]=a[3]-1;\n}else if(m==2){\na[0]=a[0]-1;\na[1]=a[1]-1;\na[3]=a[3]-1;\n}else{\na[0]=a[0]-1;\na[1]=a[1]-1;\na[2]=a[2]-1;\n}\n}\nprintf(\"%d %d %d %d\\n\",a[0],a[1],a[2],a[3]);\nreturn 0;\n}", "problem_context": "Score : 600 points\n\nProblem Statement\n\nWe have a sequence of length N consisting of non-negative integers. Consider performing the following operation on this sequence until the largest element in this sequence becomes N-1 or smaller.\n\nDetermine the largest element in the sequence (if there is more than one, choose one). Decrease the value of this element by N, and increase each of the other elements by 1.\n\nIt can be proved that the largest element in the sequence becomes N-1 or smaller after a finite number of operations.\n\nYou are given an integer K. Find an integer sequence a_i such that the number of times we will perform the above operation is exactly K. It can be shown that there is always such a sequence under the constraints on input and output in this problem.\n\nConstraints\n\n0 ≤ K ≤ 50 \\times 10^{16}\n\nInput\n\nInput is given from Standard Input in the following format:\n\nK\n\nOutput\n\nPrint a solution in the following format:\n\nN\na_1 a_2 ... a_N\n\nHere, 2 ≤ N ≤ 50 and 0 ≤ a_i ≤ 10^{16} + 1000 must hold.\n\nSample Input 1\n\n0\n\nSample Output 1\n\n4\n3 3 3 3\n\nSample Input 2\n\n1\n\nSample Output 2\n\n3\n1 0 3\n\nSample Input 3\n\n2\n\nSample Output 3\n\n2\n2 2\n\nThe operation will be performed twice: [2, 2] -> [0, 3] -> [1, 1].\n\nSample Input 4\n\n3\n\nSample Output 4\n\n7\n27 0 0 0 0 0 0\n\nSample Input 5\n\n1234567894848\n\nSample Output 5\n\n10\n1000 193 256 777 0 1 1192 1234567891011 48 425", "sample_input": "0\n"}, "reference_outputs": ["4\n3 3 3 3\n"], "source_document_id": "p03646", "source_text": "Score : 600 points\n\nProblem Statement\n\nWe have a sequence of length N consisting of non-negative integers. Consider performing the following operation on this sequence until the largest element in this sequence becomes N-1 or smaller.\n\nDetermine the largest element in the sequence (if there is more than one, choose one). Decrease the value of this element by N, and increase each of the other elements by 1.\n\nIt can be proved that the largest element in the sequence becomes N-1 or smaller after a finite number of operations.\n\nYou are given an integer K. Find an integer sequence a_i such that the number of times we will perform the above operation is exactly K. It can be shown that there is always such a sequence under the constraints on input and output in this problem.\n\nConstraints\n\n0 ≤ K ≤ 50 \\times 10^{16}\n\nInput\n\nInput is given from Standard Input in the following format:\n\nK\n\nOutput\n\nPrint a solution in the following format:\n\nN\na_1 a_2 ... a_N\n\nHere, 2 ≤ N ≤ 50 and 0 ≤ a_i ≤ 10^{16} + 1000 must hold.\n\nSample Input 1\n\n0\n\nSample Output 1\n\n4\n3 3 3 3\n\nSample Input 2\n\n1\n\nSample Output 2\n\n3\n1 0 3\n\nSample Input 3\n\n2\n\nSample Output 3\n\n2\n2 2\n\nThe operation will be performed twice: [2, 2] -> [0, 3] -> [1, 1].\n\nSample Input 4\n\n3\n\nSample Output 4\n\n7\n27 0 0 0 0 0 0\n\nSample Input 5\n\n1234567894848\n\nSample Output 5\n\n10\n1000 193 256 777 0 1 1192 1234567891011 48 425", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 2103, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s314148386", "group_id": "codeNet:p03657", "input_text": "#include <stdio.h>\nint main(void){\n    int a,b;\n    scanf(\"%d%d\",&a,&b);\n    if(a%3==0 || b%3==0 || (a+b)%3==0) printf(\"Possible\");\n    else printf(\"Impossible\");\n    return 0;\n}", "language": "C", "metadata": {"date": 1583109718, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "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/C/s314148386.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s314148386", "user_id": "u592248346"}, "prompt_components": {"gold_output": "Possible\n", "input_to_evaluate": "#include <stdio.h>\nint main(void){\n    int a,b;\n    scanf(\"%d%d\",&a,&b);\n    if(a%3==0 || b%3==0 || (a+b)%3==0) printf(\"Possible\");\n    else printf(\"Impossible\");\n    return 0;\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": 178, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s478507507", "group_id": "codeNet:p03657", "input_text": "#include<stdio.h>\nint main(){\n    int a,b,s,i,j;\n    scanf(\"%d%d\",&a,&b);\n    s=a+b;\n    i=s/3;\n    //printf(\"%d\\n\",i);\n    j=i*3;\n    //printf(\"%d\\n\",j);\n    i=s-j;\n    //printf(\"%d\\n\",i);\n    if(s!=0){\n        if(i==0){\n            printf(\"Possible\\n\");\n        }else{\n            printf(\"Impossible\\n\");\n        }\n    }else{\n        printf(\"Impossible\\n\");\n    }\n    return 0;\n}\n", "language": "C", "metadata": {"date": 1517632813, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "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/C/s478507507.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s478507507", "user_id": "u863370423"}, "prompt_components": {"gold_output": "Possible\n", "input_to_evaluate": "#include<stdio.h>\nint main(){\n    int a,b,s,i,j;\n    scanf(\"%d%d\",&a,&b);\n    s=a+b;\n    i=s/3;\n    //printf(\"%d\\n\",i);\n    j=i*3;\n    //printf(\"%d\\n\",j);\n    i=s-j;\n    //printf(\"%d\\n\",i);\n    if(s!=0){\n        if(i==0){\n            printf(\"Possible\\n\");\n        }else{\n            printf(\"Impossible\\n\");\n        }\n    }else{\n        printf(\"Impossible\\n\");\n    }\n    return 0;\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": 382, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s314294474", "group_id": "codeNet:p03657", "input_text": "#include<stdio.h>\n#include<string.h>\nint main(void)\n{\nint a,b;\n\nscanf(\"%d%d\",&a,&b);\n\nif((a+b)%3==0)\n  printf(\"Possible\\n\");\nelse\n   printf(\"Impossible\\n\");\n\nreturn 0;\n}", "language": "C", "metadata": {"date": 1502467135, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "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/C/s314294474.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s314294474", "user_id": "u089230684"}, "prompt_components": {"gold_output": "Possible\n", "input_to_evaluate": "#include<stdio.h>\n#include<string.h>\nint main(void)\n{\nint a,b;\n\nscanf(\"%d%d\",&a,&b);\n\nif((a+b)%3==0)\n  printf(\"Possible\\n\");\nelse\n   printf(\"Impossible\\n\");\n\nreturn 0;\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": 169, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s834427471", "group_id": "codeNet:p03658", "input_text": "#include <stdlib.h>\n\nint compare_int(const void *a, const void *b)\n{\n    return *(int*)a - *(int*)b;\n}\n\nmain()\n{ int K,N;\n\tscanf(\"%d%d\",&N,&K);\n    int l[50];\n    int i,j,k;\n    for(k=0;k<=N-1;k++){\n    \tscanf(\"%d\",&l[k]);\n    }\n    int sum;\n    sum=0;\n\n    qsort(l, N, sizeof(int), compare_int);\n    for (i = N-1; i >=N-K ; i--) {\n    \tsum+=l[i];\n    }\n   printf(\"%d\",sum);\n}", "language": "C", "metadata": {"date": 1520175410, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "problem_description_relpath": "problem_descriptions/p03658.html", "problem_id": "p03658", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03658/input.txt", "sample_output_relpath": "derived/input_output/data/p03658/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03658/C/s834427471.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s834427471", "user_id": "u213156132"}, "prompt_components": {"gold_output": "12\n", "input_to_evaluate": "#include <stdlib.h>\n\nint compare_int(const void *a, const void *b)\n{\n    return *(int*)a - *(int*)b;\n}\n\nmain()\n{ int K,N;\n\tscanf(\"%d%d\",&N,&K);\n    int l[50];\n    int i,j,k;\n    for(k=0;k<=N-1;k++){\n    \tscanf(\"%d\",&l[k]);\n    }\n    int sum;\n    sum=0;\n\n    qsort(l, N, sizeof(int), compare_int);\n    for (i = N-1; i >=N-K ; i--) {\n    \tsum+=l[i];\n    }\n   printf(\"%d\",sum);\n}", "problem_context": "Score : 200 points\n\nProblem Statement\n\nSnuke has N sticks.\nThe length of the i-th stick is l_i.\n\nSnuke is making a snake toy by joining K of the sticks together.\n\nThe length of the toy is represented by the sum of the individual sticks that compose it.\nFind the maximum possible length of the toy.\n\nConstraints\n\n1 \\leq K \\leq N \\leq 50\n\n1 \\leq l_i \\leq 50\n\nl_i is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nl_1 l_2 l_3 ... l_{N}\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n5 3\n1 2 3 4 5\n\nSample Output 1\n\n12\n\nYou can make a toy of length 12 by joining the sticks of lengths 3, 4 and 5, which is the maximum possible length.\n\nSample Input 2\n\n15 14\n50 26 27 21 41 7 42 35 7 5 5 36 39 1 45\n\nSample Output 2\n\n386", "sample_input": "5 3\n1 2 3 4 5\n"}, "reference_outputs": ["12\n"], "source_document_id": "p03658", "source_text": "Score : 200 points\n\nProblem Statement\n\nSnuke has N sticks.\nThe length of the i-th stick is l_i.\n\nSnuke is making a snake toy by joining K of the sticks together.\n\nThe length of the toy is represented by the sum of the individual sticks that compose it.\nFind the maximum possible length of the toy.\n\nConstraints\n\n1 \\leq K \\leq N \\leq 50\n\n1 \\leq l_i \\leq 50\n\nl_i is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nl_1 l_2 l_3 ... l_{N}\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n5 3\n1 2 3 4 5\n\nSample Output 1\n\n12\n\nYou can make a toy of length 12 by joining the sticks of lengths 3, 4 and 5, which is the maximum possible length.\n\nSample Input 2\n\n15 14\n50 26 27 21 41 7 42 35 7 5 5 36 39 1 45\n\nSample Output 2\n\n386", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 376, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s001703444", "group_id": "codeNet:p03658", "input_text": "#include<stdio.h>\n\nint N, K;\nint Snake[1000000];\n\nint main(void){\nint i, j, c, sum;\nscanf(\"%d %d\", &N, &K);\n\n\nfor(i = 0; i < N; i++){\nscanf(\"%d\", &Snake[i]);\n}\n\nfor( i = 0; i < N-1; i++){\nfor(j = i + 1; j < N; j++){\nif(Snake[i] <= Snake[j] ){ \nc = Snake[j]; \nSnake[i] = Snake[j]; \nSnake[j] = c;\n}\n}}\n\nsum = 0;\nfor(i = 0; i < K; i++){\nsum += Snake[i];\n}\nreturn 0;\n}\n\n", "language": "C", "metadata": {"date": 1500170969, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "problem_description_relpath": "problem_descriptions/p03658.html", "problem_id": "p03658", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03658/input.txt", "sample_output_relpath": "derived/input_output/data/p03658/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03658/C/s001703444.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s001703444", "user_id": "u486232694"}, "prompt_components": {"gold_output": "12\n", "input_to_evaluate": "#include<stdio.h>\n\nint N, K;\nint Snake[1000000];\n\nint main(void){\nint i, j, c, sum;\nscanf(\"%d %d\", &N, &K);\n\n\nfor(i = 0; i < N; i++){\nscanf(\"%d\", &Snake[i]);\n}\n\nfor( i = 0; i < N-1; i++){\nfor(j = i + 1; j < N; j++){\nif(Snake[i] <= Snake[j] ){ \nc = Snake[j]; \nSnake[i] = Snake[j]; \nSnake[j] = c;\n}\n}}\n\nsum = 0;\nfor(i = 0; i < K; i++){\nsum += Snake[i];\n}\nreturn 0;\n}\n\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nSnuke has N sticks.\nThe length of the i-th stick is l_i.\n\nSnuke is making a snake toy by joining K of the sticks together.\n\nThe length of the toy is represented by the sum of the individual sticks that compose it.\nFind the maximum possible length of the toy.\n\nConstraints\n\n1 \\leq K \\leq N \\leq 50\n\n1 \\leq l_i \\leq 50\n\nl_i is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nl_1 l_2 l_3 ... l_{N}\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n5 3\n1 2 3 4 5\n\nSample Output 1\n\n12\n\nYou can make a toy of length 12 by joining the sticks of lengths 3, 4 and 5, which is the maximum possible length.\n\nSample Input 2\n\n15 14\n50 26 27 21 41 7 42 35 7 5 5 36 39 1 45\n\nSample Output 2\n\n386", "sample_input": "5 3\n1 2 3 4 5\n"}, "reference_outputs": ["12\n"], "source_document_id": "p03658", "source_text": "Score : 200 points\n\nProblem Statement\n\nSnuke has N sticks.\nThe length of the i-th stick is l_i.\n\nSnuke is making a snake toy by joining K of the sticks together.\n\nThe length of the toy is represented by the sum of the individual sticks that compose it.\nFind the maximum possible length of the toy.\n\nConstraints\n\n1 \\leq K \\leq N \\leq 50\n\n1 \\leq l_i \\leq 50\n\nl_i is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nl_1 l_2 l_3 ... l_{N}\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n5 3\n1 2 3 4 5\n\nSample Output 1\n\n12\n\nYou can make a toy of length 12 by joining the sticks of lengths 3, 4 and 5, which is the maximum possible length.\n\nSample Input 2\n\n15 14\n50 26 27 21 41 7 42 35 7 5 5 36 39 1 45\n\nSample Output 2\n\n386", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 366, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s923685081", "group_id": "codeNet:p03659", "input_text": "#include <stdio.h>\nint main(void){\n     long long int n,a[200000]={0},sum = 0,sunuke = 0,araiguma = 0,min = 10000000000;\n    scanf(\"%lld\", &n);\n    for(int i = 0; i< n; i++){\n        scanf(\"%lld\",&a[i]);\n        sum += a[i];\n    }\n    for(int j = 0; j < n-1; j++){\n        sunuke +=a[j];\n        araiguma = sum - sunuke;\n\n        if(min > sunuke-araiguma && sunuke-araiguma >0){\n            min = sunuke - araiguma;\n        }else if(min > araiguma-sunuke && araiguma-sunuke >0){\n            min = araiguma - sunuke;\n        }else if(sunuke == araiguma){\n            min = 0;\n            break;\n        }\n    }\n    if(min == 10000000000){\n        min = 0;\n    }\n    printf(\"%lld\", min);\n    return 0;\n}", "language": "C", "metadata": {"date": 1500305086, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "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/C/s923685081.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s923685081", "user_id": "u042418462"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "#include <stdio.h>\nint main(void){\n     long long int n,a[200000]={0},sum = 0,sunuke = 0,araiguma = 0,min = 10000000000;\n    scanf(\"%lld\", &n);\n    for(int i = 0; i< n; i++){\n        scanf(\"%lld\",&a[i]);\n        sum += a[i];\n    }\n    for(int j = 0; j < n-1; j++){\n        sunuke +=a[j];\n        araiguma = sum - sunuke;\n\n        if(min > sunuke-araiguma && sunuke-araiguma >0){\n            min = sunuke - araiguma;\n        }else if(min > araiguma-sunuke && araiguma-sunuke >0){\n            min = araiguma - sunuke;\n        }else if(sunuke == araiguma){\n            min = 0;\n            break;\n        }\n    }\n    if(min == 10000000000){\n        min = 0;\n    }\n    printf(\"%lld\", min);\n    return 0;\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": 701, "cpu_time_ms": 23, "memory_kb": 1664}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s538526330", "group_id": "codeNet:p03661", "input_text": "#include<stdio.h>\n#include<math.h>\nint main(void)\n{\n    int n,i,x,num=0,num1=0,num2;\n    scanf(\"%d\",&n);\n    int a[n];\n    for(i=0;i<n;i++)\n    {\n        scanf(\"%d\",&a[i]);\n    }\n    for(i=0;i<n;i++)\n    {\n        num+=a[i];\n    }\n    x=abs(num-2*a[0]);\n    for(i=0;i<n-1;i++)\n    {\n        num1+=a[i];\n        num2=num-num1;\n        if(abs(num1-num2)<x)    x=abs(num1-num2);\n    }\n        printf(\"%d\",x);\n        return 0;\n}\n", "language": "C", "metadata": {"date": 1514493580, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "problem_description_relpath": "problem_descriptions/p03661.html", "problem_id": "p03661", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03661/input.txt", "sample_output_relpath": "derived/input_output/data/p03661/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03661/C/s538526330.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s538526330", "user_id": "u816631826"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "#include<stdio.h>\n#include<math.h>\nint main(void)\n{\n    int n,i,x,num=0,num1=0,num2;\n    scanf(\"%d\",&n);\n    int a[n];\n    for(i=0;i<n;i++)\n    {\n        scanf(\"%d\",&a[i]);\n    }\n    for(i=0;i<n;i++)\n    {\n        num+=a[i];\n    }\n    x=abs(num-2*a[0]);\n    for(i=0;i<n-1;i++)\n    {\n        num1+=a[i];\n        num2=num-num1;\n        if(abs(num1-num2)<x)    x=abs(num1-num2);\n    }\n        printf(\"%d\",x);\n        return 0;\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": "p03661", "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": 426, "cpu_time_ms": 23, "memory_kb": 896}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s465538510", "group_id": "codeNet:p03665", "input_text": "#include <stdio.h>\n#include <math.h>\n\nlong Combination(long n, long r) {\n  long answer = 1;\n  if (n-r < r) {\n    r = n-r;\n  }\n  for (long i = 1; i <= r; i++) {\n    answer *= n+1-i;\n    answer /= i;\n  }\n  return answer;\n}\n\nint main(void) {\n\n  int n,p;\n  scanf(\"%d %d\", &n, &p);\n  int a[n];\n  for (int i = 0; i < n; i++) {\n    scanf(\"%d\", &a[i]);\n  }\n  int odd = 0;\n  for (int i = 0; i < n; i++) {\n    if (a[i]%2 != 0) {\n      odd++;\n    }\n  }\n  int even = n-odd;\n  long answer = 0;\n  for (int i = 0; i <= odd; i += 2) {\n    if (i == 0 && p == 1) {\n      i++;\n    }\n    answer += Combination(odd,i);\n  }\n  answer *= pow(2,even);\n  printf(\"%ld\\n\", answer);\n\n  return 0;\n}", "language": "C", "metadata": {"date": 1587779864, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "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/C/s465538510.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s465538510", "user_id": "u581816556"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "#include <stdio.h>\n#include <math.h>\n\nlong Combination(long n, long r) {\n  long answer = 1;\n  if (n-r < r) {\n    r = n-r;\n  }\n  for (long i = 1; i <= r; i++) {\n    answer *= n+1-i;\n    answer /= i;\n  }\n  return answer;\n}\n\nint main(void) {\n\n  int n,p;\n  scanf(\"%d %d\", &n, &p);\n  int a[n];\n  for (int i = 0; i < n; i++) {\n    scanf(\"%d\", &a[i]);\n  }\n  int odd = 0;\n  for (int i = 0; i < n; i++) {\n    if (a[i]%2 != 0) {\n      odd++;\n    }\n  }\n  int even = n-odd;\n  long answer = 0;\n  for (int i = 0; i <= odd; i += 2) {\n    if (i == 0 && p == 1) {\n      i++;\n    }\n    answer += Combination(odd,i);\n  }\n  answer *= pow(2,even);\n  printf(\"%ld\\n\", answer);\n\n  return 0;\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": 668, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s441968479", "group_id": "codeNet:p03671", "input_text": "#include <stdio.h>\n\nint main(void) {\n\tint a, b, c;\n\tscanf(\"%d %d %d\", &a, &b, &c);\n\tint max = a;\n\tif(b > max) max = b;\n\tif(c > max) max = c;\n\tprintf(\"%d\\n\", a+b+c-max);\n\treturn 0;\n}", "language": "C", "metadata": {"date": 1499801954, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "problem_description_relpath": "problem_descriptions/p03671.html", "problem_id": "p03671", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03671/input.txt", "sample_output_relpath": "derived/input_output/data/p03671/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03671/C/s441968479.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s441968479", "user_id": "u465854348"}, "prompt_components": {"gold_output": "1300\n", "input_to_evaluate": "#include <stdio.h>\n\nint main(void) {\n\tint a, b, c;\n\tscanf(\"%d %d %d\", &a, &b, &c);\n\tint max = a;\n\tif(b > max) max = b;\n\tif(c > max) max = c;\n\tprintf(\"%d\\n\", a+b+c-max);\n\treturn 0;\n}", "problem_context": "Score : 100 points\n\nProblem Statement\n\nSnuke is buying a bicycle.\nThe bicycle of his choice does not come with a bell, so he has to buy one separately.\n\nHe has very high awareness of safety, and decides to buy two bells, one for each hand.\n\nThe store sells three kinds of bells for the price of a, b and c yen (the currency of Japan), respectively.\nFind the minimum total price of two different bells.\n\nConstraints\n\n1 \\leq a,b,c \\leq 10000\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 the minimum total price of two different bells.\n\nSample Input 1\n\n700 600 780\n\nSample Output 1\n\n1300\n\nBuying a 700-yen bell and a 600-yen bell costs 1300 yen.\n\nBuying a 700-yen bell and a 780-yen bell costs 1480 yen.\n\nBuying a 600-yen bell and a 780-yen bell costs 1380 yen.\n\nThe minimum among these is 1300 yen.\n\nSample Input 2\n\n10000 10000 10000\n\nSample Output 2\n\n20000\n\nBuying any two bells costs 20000 yen.", "sample_input": "700 600 780\n"}, "reference_outputs": ["1300\n"], "source_document_id": "p03671", "source_text": "Score : 100 points\n\nProblem Statement\n\nSnuke is buying a bicycle.\nThe bicycle of his choice does not come with a bell, so he has to buy one separately.\n\nHe has very high awareness of safety, and decides to buy two bells, one for each hand.\n\nThe store sells three kinds of bells for the price of a, b and c yen (the currency of Japan), respectively.\nFind the minimum total price of two different bells.\n\nConstraints\n\n1 \\leq a,b,c \\leq 10000\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 the minimum total price of two different bells.\n\nSample Input 1\n\n700 600 780\n\nSample Output 1\n\n1300\n\nBuying a 700-yen bell and a 600-yen bell costs 1300 yen.\n\nBuying a 700-yen bell and a 780-yen bell costs 1480 yen.\n\nBuying a 600-yen bell and a 780-yen bell costs 1380 yen.\n\nThe minimum among these is 1300 yen.\n\nSample Input 2\n\n10000 10000 10000\n\nSample Output 2\n\n20000\n\nBuying any two bells costs 20000 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": 181, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s670910117", "group_id": "codeNet:p03671", "input_text": "#include <stdio.h>\n\nint main(void)\n{\n  int a,b,c;\n\n  scanf(\"%d %d %d\",&a,&b,&c);\n\n  if( (a >= b)&&(a >= c) )\n    {\n      printf(\"%d\\n\",b + c);\n      return 0;\n    }\n  else if( (b >= a)&&(b >= c) )\n    {\n      printf(\"%d/n\",a + c);\n      return 0;\n    }\n  else\n    printf(\"%d\\n\",a + b);\n\n  return 0;\n}\n\n\n\n\n\n\n", "language": "C", "metadata": {"date": 1499032958, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "problem_description_relpath": "problem_descriptions/p03671.html", "problem_id": "p03671", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03671/input.txt", "sample_output_relpath": "derived/input_output/data/p03671/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03671/C/s670910117.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s670910117", "user_id": "u561328499"}, "prompt_components": {"gold_output": "1300\n", "input_to_evaluate": "#include <stdio.h>\n\nint main(void)\n{\n  int a,b,c;\n\n  scanf(\"%d %d %d\",&a,&b,&c);\n\n  if( (a >= b)&&(a >= c) )\n    {\n      printf(\"%d\\n\",b + c);\n      return 0;\n    }\n  else if( (b >= a)&&(b >= c) )\n    {\n      printf(\"%d/n\",a + c);\n      return 0;\n    }\n  else\n    printf(\"%d\\n\",a + b);\n\n  return 0;\n}\n\n\n\n\n\n\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nSnuke is buying a bicycle.\nThe bicycle of his choice does not come with a bell, so he has to buy one separately.\n\nHe has very high awareness of safety, and decides to buy two bells, one for each hand.\n\nThe store sells three kinds of bells for the price of a, b and c yen (the currency of Japan), respectively.\nFind the minimum total price of two different bells.\n\nConstraints\n\n1 \\leq a,b,c \\leq 10000\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 the minimum total price of two different bells.\n\nSample Input 1\n\n700 600 780\n\nSample Output 1\n\n1300\n\nBuying a 700-yen bell and a 600-yen bell costs 1300 yen.\n\nBuying a 700-yen bell and a 780-yen bell costs 1480 yen.\n\nBuying a 600-yen bell and a 780-yen bell costs 1380 yen.\n\nThe minimum among these is 1300 yen.\n\nSample Input 2\n\n10000 10000 10000\n\nSample Output 2\n\n20000\n\nBuying any two bells costs 20000 yen.", "sample_input": "700 600 780\n"}, "reference_outputs": ["1300\n"], "source_document_id": "p03671", "source_text": "Score : 100 points\n\nProblem Statement\n\nSnuke is buying a bicycle.\nThe bicycle of his choice does not come with a bell, so he has to buy one separately.\n\nHe has very high awareness of safety, and decides to buy two bells, one for each hand.\n\nThe store sells three kinds of bells for the price of a, b and c yen (the currency of Japan), respectively.\nFind the minimum total price of two different bells.\n\nConstraints\n\n1 \\leq a,b,c \\leq 10000\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 the minimum total price of two different bells.\n\nSample Input 1\n\n700 600 780\n\nSample Output 1\n\n1300\n\nBuying a 700-yen bell and a 600-yen bell costs 1300 yen.\n\nBuying a 700-yen bell and a 780-yen bell costs 1480 yen.\n\nBuying a 600-yen bell and a 780-yen bell costs 1380 yen.\n\nThe minimum among these is 1300 yen.\n\nSample Input 2\n\n10000 10000 10000\n\nSample Output 2\n\n20000\n\nBuying any two bells costs 20000 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": 307, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s343944496", "group_id": "codeNet:p03673", "input_text": "#include<stdio.h>\nint main()\n{\n\tint n,i,j;\n\tscanf(\"%d\",&n);\n\tint a[200001],t;\n\tfor(i=0;i<n;i++)\n    {\n    \tscanf(\"%d\",&a[i]);\n    \tfor(j=0;j<i/2+1;j++)\n    \t{\n    \t\tt=a[j];\n    \t\ta[j]=a[i-j];\n    \t\ta[i-j]=t;\n    \t}\n\t}\n\tfor(i=0;i<n;i++)\n\t    printf(\"%d \",a[i]);\n}", "language": "C", "metadata": {"date": 1514558493, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "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/C/s343944496.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s343944496", "user_id": "u816631826"}, "prompt_components": {"gold_output": "4 2 1 3\n", "input_to_evaluate": "#include<stdio.h>\nint main()\n{\n\tint n,i,j;\n\tscanf(\"%d\",&n);\n\tint a[200001],t;\n\tfor(i=0;i<n;i++)\n    {\n    \tscanf(\"%d\",&a[i]);\n    \tfor(j=0;j<i/2+1;j++)\n    \t{\n    \t\tt=a[j];\n    \t\ta[j]=a[i-j];\n    \t\ta[i-j]=t;\n    \t}\n\t}\n\tfor(i=0;i<n;i++)\n\t    printf(\"%d \",a[i]);\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": 262, "cpu_time_ms": 2103, "memory_kb": 512}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s087081879", "group_id": "codeNet:p03673", "input_text": "#include<stdio.h>\n#include<stdlib.h>\nint main() {\n\tint n;\n\tscanf(\"%d\", &n);\n\tint *a, *b, *c;\n\ta = (int *)malloc(n*sizeof(int));\n\tb = (int *)malloc(n*sizeof(int));\n\tc = (int *)malloc(n*sizeof(int));\n\tfor (int i = 0; i < n; i++) {\n\t\tint count = 0;\n\t\tscanf(\"%d\", &a[i]);\n\t\tb[i] = a[i];\n\t\tfor (int j = i; j >= 0; j--) {\n\t\t\tc[count] = b[j];\n\t\t\tcount++;\n\t\t}\n\t\tfor (int j = 0; j <= i; j++) {\n\t\t\tb[j] = c[j];\n\t\t}\n\t}\n\tfor (int i = 0; i < n; i++) {\n\t\tprintf(\"%d \", b[i]);\n\t}\n\treturn 0;\n}", "language": "C", "metadata": {"date": 1514399193, "filename_ext": "c", "original_language": "C (Clang 3.8.0)", "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/C/s087081879.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s087081879", "user_id": "u353919145"}, "prompt_components": {"gold_output": "4 2 1 3\n", "input_to_evaluate": "#include<stdio.h>\n#include<stdlib.h>\nint main() {\n\tint n;\n\tscanf(\"%d\", &n);\n\tint *a, *b, *c;\n\ta = (int *)malloc(n*sizeof(int));\n\tb = (int *)malloc(n*sizeof(int));\n\tc = (int *)malloc(n*sizeof(int));\n\tfor (int i = 0; i < n; i++) {\n\t\tint count = 0;\n\t\tscanf(\"%d\", &a[i]);\n\t\tb[i] = a[i];\n\t\tfor (int j = i; j >= 0; j--) {\n\t\t\tc[count] = b[j];\n\t\t\tcount++;\n\t\t}\n\t\tfor (int j = 0; j <= i; j++) {\n\t\t\tb[j] = c[j];\n\t\t}\n\t}\n\tfor (int i = 0; i < n; i++) {\n\t\tprintf(\"%d \", b[i]);\n\t}\n\treturn 0;\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": 477, "cpu_time_ms": 2103, "memory_kb": 1152}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s557770938", "group_id": "codeNet:p03674", "input_text": "#include<stdio.h>\n#include<stdlib.h>\n#include<math.h>\n#include<string.h>\n#include<stdbool.h>\n#include<assert.h>\n#include<ctype.h>\ntypedef long long ll;\ntypedef long double ld;\n#define rep(i,l,r)for(ll i=(l);i<(r);i++)\n#define repp(i,l,r,k)for(ll i=(l);i<(r);i+=(k))\n#define rrep(i,l,r)for(ll i=(l);i>=(r);i--)\n#define INF (1LL<<60)\n#define MOD1 1000000007\n#define MOD2 998244353\n#define MAX_N (1 << 20)\n#define YES printf(\"Yes\\n\")\n#define NO printf(\"No\\n\")\n#define PN printf(\"\\n\")\n#define charsize 100005 //10^5+5\n#define PI 3.141592653589793238\n\nvoid swap(ll *a, ll *b){ll c;c=*b;*b=*a;*a= c;}\nvoid cin(ll *n){ scanf(\"%lld\",&(*n)); }\nll max2(ll a,ll b){return a>=b?a:b;}\nll min2(ll a,ll b){return a>=b?b:a;}\nll min3(ll a, ll b, ll c){return (a<=b && a<=c) ? a : b<=c ? b : c;}\nll max3(ll a, ll b, ll c){return (a>=b && a>=c) ? a : b>=c ? b : c;}\nll minn(ll n, ll a[]){ll b=INF;rep(i,0,n) b=min2(b,a[i]);return b;}\nll maxn(ll n, ll a[]){ll b=-INF;rep(i,0,n) b=max2(b,a[i]);return b;}\nll POW(ll a, ll b){ll c=1;rep(i,0,b) c*=a;return c;}\ndouble POW_d(double a, double b){double c=1;rep(i,0,b) c*=a;return c;}\nll gcd(ll a,ll b){return b?gcd(b,a%b):a;}\nll lcm(ll a,ll b){return a/gcd(a,b)*b;}\nll mod_MOD1(ll n){n+= n<0?((-n)/MOD1+1)*MOD1:0; return n%=MOD1;}\nll mod_p(ll n ,ll p){n+= n<0?((-n)/p+1)*p:0; return n%=p;}\nll change_into_num(char s[] , ll len, ll p){ return !p ? 0 : POW(10,p-1)*(s[len-p]-'0') + change_into_num(s,len,p-1); }\nll digits(ll a, ll b){return a/b?1+digits(a/b,b):1;}\nll base(ll n, ll a, ll i){return i==1?n%a:base(n/a,a,i-1);}\nll is_inArr1(ll x, ll n){ return ( x<0 || x>=n ) ? 0 : 1 ; }\nll is_inArr2(ll y, ll x, ll h, ll w){ return ( y<0 || y>=h || x<0 || x>=w ) ? 0 : 1 ; }\n\n\nvoid lr_lower( int *l, int *r, ll am, ll val , int type ){ (type<3) ? ( am < val ?  ( *l = (*l+*r)/2 ) : ( *r= (*l+*r)/2 ) ) : ( am <= val ? ( *l = (*l+*r)/2 ) : ( *r= (*l+*r)/2 ) ); }\nvoid lr_upper( int *l, int *r, ll am, ll val , int type ){ (type<3) ? ( am <= val ?  ( *l = (*l+*r)/2 ) : ( *r= (*l+*r)/2 ) ) : ( am < val ? ( *l = (*l+*r)/2 ) : ( *r= (*l+*r)/2 ) ); }\nint cmp_lower( ll a, ll b, int type ){ return (type==1) ? ( a==b ? 1 : 0 ) : (type==2) ? ( a>=b ? 1 : 0 ) : ( a>b ? 1 : 0 ) ; }\nint cmp_upper( ll a, ll b, int type ){ return (type==1) ? ( a==b ? 1 : 0 ) : (type==2) ? ( a<=b ? 1 : 0 ) : ( a<b ? 1 : 0 ) ; }\n// return smallest p  which meets  a[p]==val :1  >=:2   >:3\nll lower_bound( ll a[], int l, int r, ll val , int type ){  while(r-l>1) lr_lower(&l,&r,a[ (l+r)/2 ],val,type);  return cmp_lower(a[l],val,type) ? l : cmp_lower(a[r],val,type) ? r : -1;  }\n// return biggest p  which meets   a[p]==val :1  <=:2   <:3\nll upper_bound( ll a[], int l, int r, ll val , int type ){  while(r-l>1) lr_upper(&l,&r,a[ (l+r)/2 ],val,type); return cmp_upper(a[r],val,type) ? r : cmp_upper(a[l],val,type) ? l : -1; }\n// count i  which meets ai==x\nll count(ll a[], int l, int r, ll x){  int p = lower_bound(a,l,r,x,1);  return p==-1 ? 0 : upper_bound(a,p,r,x,1)-p+1; }\n\nll *factors[2] , fac_cnt=0 , is_factor_prepared=0;\nll factor_pre(){  rep(i,0,1){ if(is_factor_prepared++) return 0; }  ll tmp=(1e6)/2+1, fac_tmp[tmp];  rep(i,0,tmp){fac_tmp[i]=i?2*i+1:2;}  rep(i,1,tmp){if(fac_tmp[i]){  repp(j,3,tmp/(2*i+1)+1,2 ){  if( j*(2*i+1)<tmp ) fac_tmp[ (j*(2*i+1)-1)/2 ]=0;  }  }else continue;}  rep(i,0,tmp){if(fac_tmp[i]){  rep(j,0,2){ factors[j] = realloc( factors[j] , sizeof(ll)*( fac_cnt +1 ) );  factors[j][j?fac_cnt++:fac_cnt]=j?0:fac_tmp[i];  }  } }  return 0;  }\nll factor(ll n, ll new_common_plus){ factor_pre();  rep(i,0,fac_cnt){ ll cnt=0; rep(j,0,1){ while( ( cnt+= n %factors[0][i]==0 ? 1 : 0 )  && (n/=factors[0][i]) %factors[0][i]==0 ) continue; } factors[1][i]= new_common_plus==1 ? cnt :  new_common_plus==2 ? max2(factors[1][i],cnt) : factors[1][i]+cnt ;  if( factors[0][i]> n ) break; } return n; }\nll judge_prime(ll n){ factor_pre(); rep(i,0,fac_cnt){ if(n<factors[0][i]*factors[0][i] || n==factors[0][i]) break; else if(n%factors[0][i]==0) n/=n; }  return n==1?0:1; }\n\nll *mf_arr,*inv_arr,*finv_arr,is_minv_made=0,is_mf_made=0,num_of_inv=1e5+10;\nll makeinv(ll n , ll mod){  rep(i,0,1){if(is_minv_made++) return 0;}  inv_arr = realloc(inv_arr, sizeof(ll)*2 );  finv_arr = realloc(finv_arr, sizeof(ll)*2 );  inv_arr[1]=1;finv_arr[0]=finv_arr[1]=1;  rep(i,2,n+1){  inv_arr = realloc(inv_arr, sizeof(ll)*(i+1) );  finv_arr = realloc(finv_arr, sizeof(ll)*(i+1) );  inv_arr[i]= mod - inv_arr[mod%i] * (mod / i) % mod;  finv_arr[i] = finv_arr[i - 1] * inv_arr[i] % mod;  }  return 0; }\nll make_mf(ll n, ll mod){  rep(i,0,1){ if(is_mf_made++) return 0; }  mf_arr = realloc(mf_arr, sizeof(ll)*2 );  ll x=1;  mf_arr[0]=mf_arr[1]=x;  rep(i,2,n+1){   x=x*i%mod;  mf_arr = realloc(mf_arr, sizeof(ll)*(i+1) );  mf_arr[i]=x; }  return 0;  }\nll m_inv(ll x, ll mod, ll is_fac ){ makeinv(num_of_inv,mod);  return is_fac?finv_arr[x]:inv_arr[x]; }\nll m_f(ll x, ll mod){  make_mf(num_of_inv,mod);  return mf_arr[x];  }\nll mod_nck(ll n, ll k, ll mod){\n    return m_f(n,mod)*m_inv(k,mod,1)%mod*m_inv(n-k,mod,1)%mod;\n    // return m_f[n]*finv_arr[k]%mod*finv_arr[n-k]%mod;\n    }\nll m_p(ll r,ll n,ll mod){  ll t=1,s=r;  while(n>0){ t = (n&1) ? t*s%mod : t;  s=s*s%mod; n>>=1; }  return r?t:0;  }\nll m_mul2(ll a, ll b, ll mod){ return a*b%mod; }\nll m_mul3(ll a, ll b, ll c, ll mod){ return m_mul2(a*b%mod,c,mod); }\nll m_mul4(ll a, ll b, ll c, ll d, ll mod){ return m_mul3(a*b%mod,c,d,mod); }\nll m_mul5(ll a, ll b, ll c, ll d, ll e, ll mod){ return m_mul4(a*b%mod,c,d,e,mod); }\n\nint upll(const void*a, const void*b){return*(ll*)a<*(ll*)b?-1:*(ll*)a>*(ll*)b?1:0;}\nint downll(const void*a, const void*b){return*(ll*)a<*(ll*)b?1:*(ll*)a>*(ll*)b?-1:0;}\nint cmp_string( const void * a , const void * b ) {  return strcmp( (char *)a , (char *)b ); }  // qsort((void*)s,n,sizeof(s[0]),int_sort );\nint cmp_char(const void * a, const void * b) { return *(char *)a - *(char *)b;}\nvoid sortup(ll*a,int n){qsort(a,n,sizeof(ll),upll);}\nvoid sortdown(ll*a,int n){qsort(a,n,sizeof(ll),downll);}\nvoid sort_string(int n,int size,char s[][size]){ qsort( (void*)s , n , sizeof(s[0]) , cmp_string ); }\nvoid sort_char(char *s){ qsort( (void *)s , strlen(s) , sizeof(char) , cmp_char ); }\nll unique_string(ll n ,ll size, char s[][size]){ ll ans=1; rep(i,1,n) if( strcmp(s[i],s[i-1]) ) ans++; return ans; }\nll unique_num(ll n , ll a[]){ ll ans=1; rep(i,1,n) if( a[i]!=a[i-1] ) ans++; return ans; }\n\ntypedef struct{ ll a , b;}fr;\nint cmp1( const void *p, const void *q ) { return ((fr*)p) ->a - ((fr*)q)->a;}\nint cmp2( const void *p, const void *q ) { return ((fr*)q) ->a - ((fr*)p)->a;}\nvoid strsortup(fr*a,int n){qsort(a,n,sizeof(fr),cmp1);}\nvoid strsortdown(fr*a,int n){qsort(a,n,sizeof(fr),cmp2);}\n\n\n\n\n// char s[1151154];\nll ans[115115];\nll d[115115];\nint main(void){\n    // fgets(s,sizeof(s),stdin); \n    ll n;\n    // ll ans=0;\n    cin(&n);\n    // scanf(\"%s\",s);\n    ll a[n+1],p;\n    rep(i,0,n){\n        cin(&a[i]);\n        d[a[i]]++;\n        if(d[a[i]]==2) p=a[i];\n    }\n    ll l=-1,r;\n    rep(i,0,n+1){\n        if(a[i]==p){\n            if(l==-1) l=i;\n            else r=i;\n        }\n    }\n    // printf(\"%lld %lld\\n\",l,r);\n    // ans[0]=n;\n    // ans[n]=1;\n    rep(i,0,n+1){\n\n        ans[i]+=mod_nck(n+1,i+1,MOD1);\n        if(n-r+l>=i){\n            ll t=mod_nck(n-r+l,i,MOD1);\n            ans[i]+=mod_MOD1(-t);\n        }\n\n        ans[i]%=MOD1;\n    }\n    rep(i,0,n+1){\n        printf(\"%lld\\n\",ans[i]);\n    }\n    return 0;\n}\n", "language": "C", "metadata": {"date": 1594223478, "filename_ext": "c", "original_language": "C (GCC 9.2.1)", "problem_description_relpath": "problem_descriptions/p03674.html", "problem_id": "p03674", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03674/input.txt", "sample_output_relpath": "derived/input_output/data/p03674/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03674/C/s557770938.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s557770938", "user_id": "u004279520"}, "prompt_components": {"gold_output": "3\n5\n4\n1\n", "input_to_evaluate": "#include<stdio.h>\n#include<stdlib.h>\n#include<math.h>\n#include<string.h>\n#include<stdbool.h>\n#include<assert.h>\n#include<ctype.h>\ntypedef long long ll;\ntypedef long double ld;\n#define rep(i,l,r)for(ll i=(l);i<(r);i++)\n#define repp(i,l,r,k)for(ll i=(l);i<(r);i+=(k))\n#define rrep(i,l,r)for(ll i=(l);i>=(r);i--)\n#define INF (1LL<<60)\n#define MOD1 1000000007\n#define MOD2 998244353\n#define MAX_N (1 << 20)\n#define YES printf(\"Yes\\n\")\n#define NO printf(\"No\\n\")\n#define PN printf(\"\\n\")\n#define charsize 100005 //10^5+5\n#define PI 3.141592653589793238\n\nvoid swap(ll *a, ll *b){ll c;c=*b;*b=*a;*a= c;}\nvoid cin(ll *n){ scanf(\"%lld\",&(*n)); }\nll max2(ll a,ll b){return a>=b?a:b;}\nll min2(ll a,ll b){return a>=b?b:a;}\nll min3(ll a, ll b, ll c){return (a<=b && a<=c) ? a : b<=c ? b : c;}\nll max3(ll a, ll b, ll c){return (a>=b && a>=c) ? a : b>=c ? b : c;}\nll minn(ll n, ll a[]){ll b=INF;rep(i,0,n) b=min2(b,a[i]);return b;}\nll maxn(ll n, ll a[]){ll b=-INF;rep(i,0,n) b=max2(b,a[i]);return b;}\nll POW(ll a, ll b){ll c=1;rep(i,0,b) c*=a;return c;}\ndouble POW_d(double a, double b){double c=1;rep(i,0,b) c*=a;return c;}\nll gcd(ll a,ll b){return b?gcd(b,a%b):a;}\nll lcm(ll a,ll b){return a/gcd(a,b)*b;}\nll mod_MOD1(ll n){n+= n<0?((-n)/MOD1+1)*MOD1:0; return n%=MOD1;}\nll mod_p(ll n ,ll p){n+= n<0?((-n)/p+1)*p:0; return n%=p;}\nll change_into_num(char s[] , ll len, ll p){ return !p ? 0 : POW(10,p-1)*(s[len-p]-'0') + change_into_num(s,len,p-1); }\nll digits(ll a, ll b){return a/b?1+digits(a/b,b):1;}\nll base(ll n, ll a, ll i){return i==1?n%a:base(n/a,a,i-1);}\nll is_inArr1(ll x, ll n){ return ( x<0 || x>=n ) ? 0 : 1 ; }\nll is_inArr2(ll y, ll x, ll h, ll w){ return ( y<0 || y>=h || x<0 || x>=w ) ? 0 : 1 ; }\n\n\nvoid lr_lower( int *l, int *r, ll am, ll val , int type ){ (type<3) ? ( am < val ?  ( *l = (*l+*r)/2 ) : ( *r= (*l+*r)/2 ) ) : ( am <= val ? ( *l = (*l+*r)/2 ) : ( *r= (*l+*r)/2 ) ); }\nvoid lr_upper( int *l, int *r, ll am, ll val , int type ){ (type<3) ? ( am <= val ?  ( *l = (*l+*r)/2 ) : ( *r= (*l+*r)/2 ) ) : ( am < val ? ( *l = (*l+*r)/2 ) : ( *r= (*l+*r)/2 ) ); }\nint cmp_lower( ll a, ll b, int type ){ return (type==1) ? ( a==b ? 1 : 0 ) : (type==2) ? ( a>=b ? 1 : 0 ) : ( a>b ? 1 : 0 ) ; }\nint cmp_upper( ll a, ll b, int type ){ return (type==1) ? ( a==b ? 1 : 0 ) : (type==2) ? ( a<=b ? 1 : 0 ) : ( a<b ? 1 : 0 ) ; }\n// return smallest p  which meets  a[p]==val :1  >=:2   >:3\nll lower_bound( ll a[], int l, int r, ll val , int type ){  while(r-l>1) lr_lower(&l,&r,a[ (l+r)/2 ],val,type);  return cmp_lower(a[l],val,type) ? l : cmp_lower(a[r],val,type) ? r : -1;  }\n// return biggest p  which meets   a[p]==val :1  <=:2   <:3\nll upper_bound( ll a[], int l, int r, ll val , int type ){  while(r-l>1) lr_upper(&l,&r,a[ (l+r)/2 ],val,type); return cmp_upper(a[r],val,type) ? r : cmp_upper(a[l],val,type) ? l : -1; }\n// count i  which meets ai==x\nll count(ll a[], int l, int r, ll x){  int p = lower_bound(a,l,r,x,1);  return p==-1 ? 0 : upper_bound(a,p,r,x,1)-p+1; }\n\nll *factors[2] , fac_cnt=0 , is_factor_prepared=0;\nll factor_pre(){  rep(i,0,1){ if(is_factor_prepared++) return 0; }  ll tmp=(1e6)/2+1, fac_tmp[tmp];  rep(i,0,tmp){fac_tmp[i]=i?2*i+1:2;}  rep(i,1,tmp){if(fac_tmp[i]){  repp(j,3,tmp/(2*i+1)+1,2 ){  if( j*(2*i+1)<tmp ) fac_tmp[ (j*(2*i+1)-1)/2 ]=0;  }  }else continue;}  rep(i,0,tmp){if(fac_tmp[i]){  rep(j,0,2){ factors[j] = realloc( factors[j] , sizeof(ll)*( fac_cnt +1 ) );  factors[j][j?fac_cnt++:fac_cnt]=j?0:fac_tmp[i];  }  } }  return 0;  }\nll factor(ll n, ll new_common_plus){ factor_pre();  rep(i,0,fac_cnt){ ll cnt=0; rep(j,0,1){ while( ( cnt+= n %factors[0][i]==0 ? 1 : 0 )  && (n/=factors[0][i]) %factors[0][i]==0 ) continue; } factors[1][i]= new_common_plus==1 ? cnt :  new_common_plus==2 ? max2(factors[1][i],cnt) : factors[1][i]+cnt ;  if( factors[0][i]> n ) break; } return n; }\nll judge_prime(ll n){ factor_pre(); rep(i,0,fac_cnt){ if(n<factors[0][i]*factors[0][i] || n==factors[0][i]) break; else if(n%factors[0][i]==0) n/=n; }  return n==1?0:1; }\n\nll *mf_arr,*inv_arr,*finv_arr,is_minv_made=0,is_mf_made=0,num_of_inv=1e5+10;\nll makeinv(ll n , ll mod){  rep(i,0,1){if(is_minv_made++) return 0;}  inv_arr = realloc(inv_arr, sizeof(ll)*2 );  finv_arr = realloc(finv_arr, sizeof(ll)*2 );  inv_arr[1]=1;finv_arr[0]=finv_arr[1]=1;  rep(i,2,n+1){  inv_arr = realloc(inv_arr, sizeof(ll)*(i+1) );  finv_arr = realloc(finv_arr, sizeof(ll)*(i+1) );  inv_arr[i]= mod - inv_arr[mod%i] * (mod / i) % mod;  finv_arr[i] = finv_arr[i - 1] * inv_arr[i] % mod;  }  return 0; }\nll make_mf(ll n, ll mod){  rep(i,0,1){ if(is_mf_made++) return 0; }  mf_arr = realloc(mf_arr, sizeof(ll)*2 );  ll x=1;  mf_arr[0]=mf_arr[1]=x;  rep(i,2,n+1){   x=x*i%mod;  mf_arr = realloc(mf_arr, sizeof(ll)*(i+1) );  mf_arr[i]=x; }  return 0;  }\nll m_inv(ll x, ll mod, ll is_fac ){ makeinv(num_of_inv,mod);  return is_fac?finv_arr[x]:inv_arr[x]; }\nll m_f(ll x, ll mod){  make_mf(num_of_inv,mod);  return mf_arr[x];  }\nll mod_nck(ll n, ll k, ll mod){\n    return m_f(n,mod)*m_inv(k,mod,1)%mod*m_inv(n-k,mod,1)%mod;\n    // return m_f[n]*finv_arr[k]%mod*finv_arr[n-k]%mod;\n    }\nll m_p(ll r,ll n,ll mod){  ll t=1,s=r;  while(n>0){ t = (n&1) ? t*s%mod : t;  s=s*s%mod; n>>=1; }  return r?t:0;  }\nll m_mul2(ll a, ll b, ll mod){ return a*b%mod; }\nll m_mul3(ll a, ll b, ll c, ll mod){ return m_mul2(a*b%mod,c,mod); }\nll m_mul4(ll a, ll b, ll c, ll d, ll mod){ return m_mul3(a*b%mod,c,d,mod); }\nll m_mul5(ll a, ll b, ll c, ll d, ll e, ll mod){ return m_mul4(a*b%mod,c,d,e,mod); }\n\nint upll(const void*a, const void*b){return*(ll*)a<*(ll*)b?-1:*(ll*)a>*(ll*)b?1:0;}\nint downll(const void*a, const void*b){return*(ll*)a<*(ll*)b?1:*(ll*)a>*(ll*)b?-1:0;}\nint cmp_string( const void * a , const void * b ) {  return strcmp( (char *)a , (char *)b ); }  // qsort((void*)s,n,sizeof(s[0]),int_sort );\nint cmp_char(const void * a, const void * b) { return *(char *)a - *(char *)b;}\nvoid sortup(ll*a,int n){qsort(a,n,sizeof(ll),upll);}\nvoid sortdown(ll*a,int n){qsort(a,n,sizeof(ll),downll);}\nvoid sort_string(int n,int size,char s[][size]){ qsort( (void*)s , n , sizeof(s[0]) , cmp_string ); }\nvoid sort_char(char *s){ qsort( (void *)s , strlen(s) , sizeof(char) , cmp_char ); }\nll unique_string(ll n ,ll size, char s[][size]){ ll ans=1; rep(i,1,n) if( strcmp(s[i],s[i-1]) ) ans++; return ans; }\nll unique_num(ll n , ll a[]){ ll ans=1; rep(i,1,n) if( a[i]!=a[i-1] ) ans++; return ans; }\n\ntypedef struct{ ll a , b;}fr;\nint cmp1( const void *p, const void *q ) { return ((fr*)p) ->a - ((fr*)q)->a;}\nint cmp2( const void *p, const void *q ) { return ((fr*)q) ->a - ((fr*)p)->a;}\nvoid strsortup(fr*a,int n){qsort(a,n,sizeof(fr),cmp1);}\nvoid strsortdown(fr*a,int n){qsort(a,n,sizeof(fr),cmp2);}\n\n\n\n\n// char s[1151154];\nll ans[115115];\nll d[115115];\nint main(void){\n    // fgets(s,sizeof(s),stdin); \n    ll n;\n    // ll ans=0;\n    cin(&n);\n    // scanf(\"%s\",s);\n    ll a[n+1],p;\n    rep(i,0,n){\n        cin(&a[i]);\n        d[a[i]]++;\n        if(d[a[i]]==2) p=a[i];\n    }\n    ll l=-1,r;\n    rep(i,0,n+1){\n        if(a[i]==p){\n            if(l==-1) l=i;\n            else r=i;\n        }\n    }\n    // printf(\"%lld %lld\\n\",l,r);\n    // ans[0]=n;\n    // ans[n]=1;\n    rep(i,0,n+1){\n\n        ans[i]+=mod_nck(n+1,i+1,MOD1);\n        if(n-r+l>=i){\n            ll t=mod_nck(n-r+l,i,MOD1);\n            ans[i]+=mod_MOD1(-t);\n        }\n\n        ans[i]%=MOD1;\n    }\n    rep(i,0,n+1){\n        printf(\"%lld\\n\",ans[i]);\n    }\n    return 0;\n}\n", "problem_context": "Score : 600 points\n\nProblem Statement\n\nYou are given an integer sequence of length n+1, a_1,a_2,...,a_{n+1}, which consists of the n integers 1,...,n.\nIt is known that each of the n integers 1,...,n appears at least once in this sequence.\n\nFor each integer k=1,...,n+1, find the number of the different subsequences (not necessarily contiguous) of the given sequence with length k, modulo 10^9+7.\n\nNotes\n\nIf the contents of two subsequences are the same, they are not separately counted even if they originate from different positions in the original sequence.\n\nA subsequence of a sequence a with length k is a sequence obtained by selecting k of the elements of a and arranging them without changing their relative order. For example, the sequences 1,3,5 and 1,2,3 are subsequences of 1,2,3,4,5, while 3,1,2 and 1,10,100 are not.\n\nConstraints\n\n1 \\leq n \\leq 10^5\n\n1 \\leq a_i \\leq n\n\nEach of the integers 1,...,n appears in the sequence.\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+1}\n\nOutput\n\nPrint n+1 lines.\nThe k-th line should contain the number of the different subsequences of the given sequence with length k, modulo 10^9+7.\n\nSample Input 1\n\n3\n1 2 1 3\n\nSample Output 1\n\n3\n5\n4\n1\n\nThere are three subsequences with length 1: 1 and 2 and 3.\n\nThere are five subsequences with length 2: 1,1 and 1,2 and 1,3 and 2,1 and 2,3.\n\nThere are four subsequences with length 3: 1,1,3 and 1,2,1 and 1,2,3 and 2,1,3.\n\nThere is one subsequence with length 4: 1,2,1,3.\n\nSample Input 2\n\n1\n1 1\n\nSample Output 2\n\n1\n1\n\nThere is one subsequence with length 1: 1.\n\nThere is one subsequence with length 2: 1,1.\n\nSample Input 3\n\n32\n29 19 7 10 26 32 27 4 11 20 2 8 16 23 5 14 6 12 17 22 18 30 28 24 15 1 25 3 13 21 19 31 9\n\nSample Output 3\n\n32\n525\n5453\n40919\n237336\n1107568\n4272048\n13884156\n38567100\n92561040\n193536720\n354817320\n573166440\n818809200\n37158313\n166803103\n166803103\n37158313\n818809200\n573166440\n354817320\n193536720\n92561040\n38567100\n13884156\n4272048\n1107568\n237336\n40920\n5456\n528\n33\n1\n\nBe sure to print the numbers modulo 10^9+7.", "sample_input": "3\n1 2 1 3\n"}, "reference_outputs": ["3\n5\n4\n1\n"], "source_document_id": "p03674", "source_text": "Score : 600 points\n\nProblem Statement\n\nYou are given an integer sequence of length n+1, a_1,a_2,...,a_{n+1}, which consists of the n integers 1,...,n.\nIt is known that each of the n integers 1,...,n appears at least once in this sequence.\n\nFor each integer k=1,...,n+1, find the number of the different subsequences (not necessarily contiguous) of the given sequence with length k, modulo 10^9+7.\n\nNotes\n\nIf the contents of two subsequences are the same, they are not separately counted even if they originate from different positions in the original sequence.\n\nA subsequence of a sequence a with length k is a sequence obtained by selecting k of the elements of a and arranging them without changing their relative order. For example, the sequences 1,3,5 and 1,2,3 are subsequences of 1,2,3,4,5, while 3,1,2 and 1,10,100 are not.\n\nConstraints\n\n1 \\leq n \\leq 10^5\n\n1 \\leq a_i \\leq n\n\nEach of the integers 1,...,n appears in the sequence.\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+1}\n\nOutput\n\nPrint n+1 lines.\nThe k-th line should contain the number of the different subsequences of the given sequence with length k, modulo 10^9+7.\n\nSample Input 1\n\n3\n1 2 1 3\n\nSample Output 1\n\n3\n5\n4\n1\n\nThere are three subsequences with length 1: 1 and 2 and 3.\n\nThere are five subsequences with length 2: 1,1 and 1,2 and 1,3 and 2,1 and 2,3.\n\nThere are four subsequences with length 3: 1,1,3 and 1,2,1 and 1,2,3 and 2,1,3.\n\nThere is one subsequence with length 4: 1,2,1,3.\n\nSample Input 2\n\n1\n1 1\n\nSample Output 2\n\n1\n1\n\nThere is one subsequence with length 1: 1.\n\nThere is one subsequence with length 2: 1,1.\n\nSample Input 3\n\n32\n29 19 7 10 26 32 27 4 11 20 2 8 16 23 5 14 6 12 17 22 18 30 28 24 15 1 25 3 13 21 19 31 9\n\nSample Output 3\n\n32\n525\n5453\n40919\n237336\n1107568\n4272048\n13884156\n38567100\n92561040\n193536720\n354817320\n573166440\n818809200\n37158313\n166803103\n166803103\n37158313\n818809200\n573166440\n354817320\n193536720\n92561040\n38567100\n13884156\n4272048\n1107568\n237336\n40920\n5456\n528\n33\n1\n\nBe sure to print the numbers 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": 7398, "cpu_time_ms": 48, "memory_kb": 6776}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s054629370", "group_id": "codeNet:p03679", "input_text": "#include <stdio.h>\n#include <stdlib.h>\n\nint main(void)\n{\n    int i;\n    long n, tmp;\n    long *button;\n    int flag = 0;\n    int now = 1;\n    int push_num = 0;\n    int purpose = -1;\n\n    scanf(\"%ld\", &n);\n\n    button = malloc(n * sizeof(long));\n\n    for(i = 0 ; i < n ; i++){\n        scanf(\"%ld\", &tmp);\n        button[i] = tmp;\n        if(tmp == 2){\n            flag = 1;\n        }\n    }\n\n    if(flag == 0){\n        printf(\"-1\\n\");\n        return 0;\n    }\n    flag = 0;\n\n    while(1){\n        push_num++;\n        now = button[now-1];\n        if(now == 2){\n            flag++;\n            break;\n        } else if(now == 1){\n            break;\n        }\n    }\n\n    if(flag == 1){\n        printf(\"%d\\n\", push_num);\n    } else {\n        printf(\"-1\\n\");\n    }\n    free(button);\n    return 0;\n}\n", "language": "C", "metadata": {"date": 1498357884, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "problem_description_relpath": "problem_descriptions/p03679.html", "problem_id": "p03679", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03679/input.txt", "sample_output_relpath": "derived/input_output/data/p03679/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03679/C/s054629370.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s054629370", "user_id": "u847478937"}, "prompt_components": {"gold_output": "safe\n", "input_to_evaluate": "#include <stdio.h>\n#include <stdlib.h>\n\nint main(void)\n{\n    int i;\n    long n, tmp;\n    long *button;\n    int flag = 0;\n    int now = 1;\n    int push_num = 0;\n    int purpose = -1;\n\n    scanf(\"%ld\", &n);\n\n    button = malloc(n * sizeof(long));\n\n    for(i = 0 ; i < n ; i++){\n        scanf(\"%ld\", &tmp);\n        button[i] = tmp;\n        if(tmp == 2){\n            flag = 1;\n        }\n    }\n\n    if(flag == 0){\n        printf(\"-1\\n\");\n        return 0;\n    }\n    flag = 0;\n\n    while(1){\n        push_num++;\n        now = button[now-1];\n        if(now == 2){\n            flag++;\n            break;\n        } else if(now == 1){\n            break;\n        }\n    }\n\n    if(flag == 1){\n        printf(\"%d\\n\", push_num);\n    } else {\n        printf(\"-1\\n\");\n    }\n    free(button);\n    return 0;\n}\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nTakahashi has a strong stomach. He never gets a stomachache from eating something whose \"best-by\" date is at most X days earlier.\nHe gets a stomachache if the \"best-by\" date of the food is X+1 or more days earlier, though.\n\nOther than that, he finds the food delicious if he eats it not later than the \"best-by\" date. Otherwise, he does not find it delicious.\n\nTakahashi bought some food A days before the \"best-by\" date, and ate it B days after he bought it.\n\nWrite a program that outputs delicious if he found it delicious, safe if he did not found it delicious but did not get a stomachache either, and dangerous if he got a stomachache.\n\nConstraints\n\n1 ≤ X,A,B ≤ 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX A B\n\nOutput\n\nPrint delicious if Takahashi found the food delicious; print safe if he neither found it delicious nor got a stomachache; print dangerous if he got a stomachache.\n\nSample Input 1\n\n4 3 6\n\nSample Output 1\n\nsafe\n\nHe ate the food three days after the \"best-by\" date. It was not delicious or harmful for him.\n\nSample Input 2\n\n6 5 1\n\nSample Output 2\n\ndelicious\n\nHe ate the food by the \"best-by\" date. It was delicious for him.\n\nSample Input 3\n\n3 7 12\n\nSample Output 3\n\ndangerous\n\nHe ate the food five days after the \"best-by\" date. It was harmful for him.", "sample_input": "4 3 6\n"}, "reference_outputs": ["safe\n"], "source_document_id": "p03679", "source_text": "Score : 100 points\n\nProblem Statement\n\nTakahashi has a strong stomach. He never gets a stomachache from eating something whose \"best-by\" date is at most X days earlier.\nHe gets a stomachache if the \"best-by\" date of the food is X+1 or more days earlier, though.\n\nOther than that, he finds the food delicious if he eats it not later than the \"best-by\" date. Otherwise, he does not find it delicious.\n\nTakahashi bought some food A days before the \"best-by\" date, and ate it B days after he bought it.\n\nWrite a program that outputs delicious if he found it delicious, safe if he did not found it delicious but did not get a stomachache either, and dangerous if he got a stomachache.\n\nConstraints\n\n1 ≤ X,A,B ≤ 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX A B\n\nOutput\n\nPrint delicious if Takahashi found the food delicious; print safe if he neither found it delicious nor got a stomachache; print dangerous if he got a stomachache.\n\nSample Input 1\n\n4 3 6\n\nSample Output 1\n\nsafe\n\nHe ate the food three days after the \"best-by\" date. It was not delicious or harmful for him.\n\nSample Input 2\n\n6 5 1\n\nSample Output 2\n\ndelicious\n\nHe ate the food by the \"best-by\" date. It was delicious for him.\n\nSample Input 3\n\n3 7 12\n\nSample Output 3\n\ndangerous\n\nHe ate the food five days after the \"best-by\" date. It was harmful for him.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 791, "cpu_time_ms": 2103, "memory_kb": 44928}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s906410554", "group_id": "codeNet:p03680", "input_text": "#include<stdio.h>\n#include<stdbool.h>\n\n\nint main(void) {\n    int n;\n    scanf(\"%d\", &n);\n    int a[n+1];\n    for(int i=1; i<n+1; i++) {\n        scanf(\"%d\", &a[i]);\n    }\n    int memo=1;\n    int counter=0;\n    int result;\n    while(true) {\n        memo = a[memo];\n        counter++;\n        if(memo == 2) {\n            result = counter;\n            break;\n        }\n        if(counter >= n) {\n            result = -1;\n            break;\n        }\n    }\n    printf(\"%d\", result);\n    return 0;\n}\n", "language": "C", "metadata": {"date": 1498370545, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "problem_description_relpath": "problem_descriptions/p03680.html", "problem_id": "p03680", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03680/input.txt", "sample_output_relpath": "derived/input_output/data/p03680/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03680/C/s906410554.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s906410554", "user_id": "u451983180"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "#include<stdio.h>\n#include<stdbool.h>\n\n\nint main(void) {\n    int n;\n    scanf(\"%d\", &n);\n    int a[n+1];\n    for(int i=1; i<n+1; i++) {\n        scanf(\"%d\", &a[i]);\n    }\n    int memo=1;\n    int counter=0;\n    int result;\n    while(true) {\n        memo = a[memo];\n        counter++;\n        if(memo == 2) {\n            result = counter;\n            break;\n        }\n        if(counter >= n) {\n            result = -1;\n            break;\n        }\n    }\n    printf(\"%d\", result);\n    return 0;\n}\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nTakahashi wants to gain muscle, and decides to work out at AtCoder Gym.\n\nThe exercise machine at the gym has N buttons, and exactly one of the buttons is lighten up.\nThese buttons are numbered 1 through N.\nWhen Button i is lighten up and you press it, the light is turned off, and then Button a_i will be lighten up. It is possible that i=a_i.\nWhen Button i is not lighten up, nothing will happen by pressing it.\n\nInitially, Button 1 is lighten up. Takahashi wants to quit pressing buttons when Button 2 is lighten up.\n\nDetermine whether this is possible. If the answer is positive, find the minimum number of times he needs to press buttons.\n\nConstraints\n\n2 ≤ N ≤ 10^5\n\n1 ≤ a_i ≤ N\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\nPrint -1 if it is impossible to lighten up Button 2.\nOtherwise, print the minimum number of times we need to press buttons in order to lighten up Button 2.\n\nSample Input 1\n\n3\n3\n1\n2\n\nSample Output 1\n\n2\n\nPress Button 1, then Button 3.\n\nSample Input 2\n\n4\n3\n4\n1\n2\n\nSample Output 2\n\n-1\n\nPressing Button 1 lightens up Button 3, and vice versa, so Button 2 will never be lighten up.\n\nSample Input 3\n\n5\n3\n3\n4\n2\n4\n\nSample Output 3\n\n3", "sample_input": "3\n3\n1\n2\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03680", "source_text": "Score : 200 points\n\nProblem Statement\n\nTakahashi wants to gain muscle, and decides to work out at AtCoder Gym.\n\nThe exercise machine at the gym has N buttons, and exactly one of the buttons is lighten up.\nThese buttons are numbered 1 through N.\nWhen Button i is lighten up and you press it, the light is turned off, and then Button a_i will be lighten up. It is possible that i=a_i.\nWhen Button i is not lighten up, nothing will happen by pressing it.\n\nInitially, Button 1 is lighten up. Takahashi wants to quit pressing buttons when Button 2 is lighten up.\n\nDetermine whether this is possible. If the answer is positive, find the minimum number of times he needs to press buttons.\n\nConstraints\n\n2 ≤ N ≤ 10^5\n\n1 ≤ a_i ≤ N\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\nPrint -1 if it is impossible to lighten up Button 2.\nOtherwise, print the minimum number of times we need to press buttons in order to lighten up Button 2.\n\nSample Input 1\n\n3\n3\n1\n2\n\nSample Output 1\n\n2\n\nPress Button 1, then Button 3.\n\nSample Input 2\n\n4\n3\n4\n1\n2\n\nSample Output 2\n\n-1\n\nPressing Button 1 lightens up Button 3, and vice versa, so Button 2 will never be lighten up.\n\nSample Input 3\n\n5\n3\n3\n4\n2\n4\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": 494, "cpu_time_ms": 11, "memory_kb": 512}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s116274528", "group_id": "codeNet:p03681", "input_text": "#include <stdio.h>\n#include <stdlib.h>\n#include <string.h>\n#include <math.h>\nint acs(const void *a, const void *b) { \n  return *(int*)a - *(int*)b;\n} /* 1,2,3,4.. */\nint des(const void *a, const void *b) {\n  return *(int*)b - *(int*)a;\n} /* 8,7,6,5.. */\nint cmp_char(const void *a, const void *b) { \n  return *(char*)a - *(char*)b;\n} /* a,b,c,d.. */\nint cmp_str(const void *a, const void *b) {\n  return strcmp(*(const char **)a, *(const char **)b);\n} /* aaa,aab.. */\n#define min(a,b) (a < b ? a : b)\n#define max(a,b) (a > b ? a : b)\n#define rep(i, l, r) for (int i = l; i < r; i++)\n#define MAX 100001\n#define MOD 1000000007\n#define INF 1000000009\ntypedef long long int lli;\n\nlli f[MAX];\nvoid fact(int n) {\n  for (lli i = 1; i <= n; i++ ) \n    f[i] = f[i-1] * i % MOD;\n}\n\nint main(void) {\n  lli N, M;\n  scanf(\"%lld %lld\", &N, &M);\n\n  f[0] = 1;\n  fact(100000);\n  lli dif = llabs(N - M);\n  if ( dif != 0 && dif != 1 ) {\n    printf(\"0\\n\");\n    return 0;\n  }\n  if ( dif == 0 ) {\n    printf(\"%lld\\n\", ((f[N] * f[M]) % MOD) * 2 % MOD);\n    return 0;\n  }\n  printf(\"%lld\\n\", f[N] * f[M] % MOD);\n  return 0;\n}\n", "language": "C", "metadata": {"date": 1585085471, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "problem_description_relpath": "problem_descriptions/p03681.html", "problem_id": "p03681", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03681/input.txt", "sample_output_relpath": "derived/input_output/data/p03681/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03681/C/s116274528.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s116274528", "user_id": "u391667116"}, "prompt_components": {"gold_output": "8\n", "input_to_evaluate": "#include <stdio.h>\n#include <stdlib.h>\n#include <string.h>\n#include <math.h>\nint acs(const void *a, const void *b) { \n  return *(int*)a - *(int*)b;\n} /* 1,2,3,4.. */\nint des(const void *a, const void *b) {\n  return *(int*)b - *(int*)a;\n} /* 8,7,6,5.. */\nint cmp_char(const void *a, const void *b) { \n  return *(char*)a - *(char*)b;\n} /* a,b,c,d.. */\nint cmp_str(const void *a, const void *b) {\n  return strcmp(*(const char **)a, *(const char **)b);\n} /* aaa,aab.. */\n#define min(a,b) (a < b ? a : b)\n#define max(a,b) (a > b ? a : b)\n#define rep(i, l, r) for (int i = l; i < r; i++)\n#define MAX 100001\n#define MOD 1000000007\n#define INF 1000000009\ntypedef long long int lli;\n\nlli f[MAX];\nvoid fact(int n) {\n  for (lli i = 1; i <= n; i++ ) \n    f[i] = f[i-1] * i % MOD;\n}\n\nint main(void) {\n  lli N, M;\n  scanf(\"%lld %lld\", &N, &M);\n\n  f[0] = 1;\n  fact(100000);\n  lli dif = llabs(N - M);\n  if ( dif != 0 && dif != 1 ) {\n    printf(\"0\\n\");\n    return 0;\n  }\n  if ( dif == 0 ) {\n    printf(\"%lld\\n\", ((f[N] * f[M]) % MOD) * 2 % MOD);\n    return 0;\n  }\n  printf(\"%lld\\n\", f[N] * f[M] % MOD);\n  return 0;\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": "p03681", "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": 1100, "cpu_time_ms": 1, "memory_kb": 896}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s274707287", "group_id": "codeNet:p03684", "input_text": "#include<stdio.h>\n#include<stdlib.h>\n#include<string.h>\n\ntypedef struct binaryHeap{\n  void *h;\n  size_t heapSize;\n  size_t maxSize;\n  size_t size;\n  int (*cmp)(const void *,const void *);\n} heap;\n\nheap* newHeap(const size_t size,int (*cmpF)(const void *,const void *)){\n  const size_t maxSize=1;\n  heap *res=(heap *)malloc(sizeof(heap));\n  res->h=malloc(size*(maxSize+1));\n  res->heapSize=0;\n  res->maxSize=maxSize;\n  res->size=size;\n  res->cmp=cmpF;\n  return res;\n}\n\nint isEmpty(const heap *h){\n  return h->heapSize==0;\n}\n\nvoid freeHeap(heap *h){\n  free(h->h);\n  free(h);\n  return;\n}\n\nvoid initHeap(heap *h){\n  h->heapSize=0;\n  return;\n}\n\nstatic inline void heapFunc_swap(void * restrict a,void * restrict b,void * restrict tmp,size_t size){\n  memcpy(tmp,a,size);\n  memcpy(a,b,size);\n  memcpy(b,tmp,size);\n  return;\n}\n\nvoid push(heap *q,const void *p){\n  if(q->heapSize==q->maxSize){\n    q->maxSize*=2;\n    q->h=realloc(q->h,q->size*(q->maxSize+1));\n  }\n  q->heapSize+=1;\n  char *h=(char *)(q->h);\n  int k=q->heapSize;\n  const size_t size=q->size;\n  int (*cmp)(const void *,const void *)=q->cmp;\n  memcpy(h+k*size,p,size);\n  while(k>1){\n    size_t parent=k/2;\n    if(cmp(h+parent*size,h+k*size)<=0) return;\n    heapFunc_swap(h+parent*size,h+k*size,h,size);\n    k=parent;\n  }\n  return;\n}\n\nvoid pop(heap *q,void *res){\n  char *h=(char *)(q->h);\n  const size_t size=q->size;\n  if(res!=NULL) memcpy(res,h+size,size);\n  memcpy(h+size,h+size*q->heapSize,size);\n  q->heapSize-=1;\n  int (*cmp)(const void *,const void *)=q->cmp;\n  const size_t n=q->heapSize;\n  size_t k=1;\n  while(2*k+1<=n){\n    size_t next=cmp(h+2*k*size,h+(2*k+1)*size)<=0?2*k:2*k+1;\n    if(cmp(h+k*size,h+next*size)<=0) return;\n    heapFunc_swap(h+k*size,h+next*size,h,size);\n    k=next;\n  }\n  if(2*k<=n && cmp(h+k*size,h+2*k*size)>0) heapFunc_swap(h+k*size,h+2*k*size,h,size);\n  return;\n}\n\nvoid top(const heap *q,void *res){\n  memcpy(res,(char *)q->h+q->size,q->size);\n  return;\n}\n\ntypedef long long int int64;\n\ntypedef struct edge{\n  int a,b;\n  int c;\n} edge;\n\ntypedef struct indexNode{\n  int index;\n  int val;\n} node;\n\nint cmpNode(const void *a,const void *b){\n  return ((node *)a)->val-((node *)b)->val;\n}\n\nint cmpEdge(const void *a,const void *b){\n  return ((edge *)a)->c-((edge *)b)->c;\n}\n\nint root(int *u,int x){\n  if(u[x]==x) return x;\n  return u[x]=root(u,u[x]);\n}\n\nint same(int *u,int x,int y){\n  return root(u,x)==root(u,y);\n}\n\nvoid unite(int *u,int x,int y){\n  x=root(u,x);\n  y=root(u,y);\n  if(x==y) return;\n  u[x]=y;\n}\n\nvoid run(void){\n  int n;\n  scanf(\"%d\",&n);\n  node *x=(node *)calloc(n,sizeof(node));\n  node *y=(node *)calloc(n,sizeof(node));\n  int i;\n  for(i=0;i<n;i++){\n    int a,b;\n    scanf(\"%d%d\",&a,&b);\n    x[i]=(node){i,a};\n    y[i]=(node){i,b};\n  }\n  qsort(x,n,sizeof(node),cmpNode);\n  qsort(y,n,sizeof(node),cmpNode);\n  heap *h=newHeap(sizeof(edge),cmpEdge);\n  for(i=0;i<n-1;i++){\n    push(h,&((edge){x[i].index,x[i+1].index,x[i+1].val-x[i].val}));\n    push(h,&((edge){y[i].index,y[i+1].index,y[i+1].val-y[i].val}));\n  }\n  int cnt=0;\n  int *u=(int *)calloc(n,sizeof(int));\n  for(i=0;i<n;i++) u[i]=i;\n  int64 ans=0;\n  for(i=0;cnt<n-1;i++){\n    edge e;\n    pop(h,&e);\n    if(same(u,e.a,e.b)) continue;\n    unite(u,e.a,e.b);\n    ans+=e.c;\n    cnt++;\n  }\n  printf(\"%lld\\n\",ans);\n}\n\nint main(void){\n  run();\n  return 0;\n}\n", "language": "C", "metadata": {"date": 1545616147, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "problem_description_relpath": "problem_descriptions/p03684.html", "problem_id": "p03684", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03684/input.txt", "sample_output_relpath": "derived/input_output/data/p03684/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03684/C/s274707287.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s274707287", "user_id": "u425248533"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "#include<stdio.h>\n#include<stdlib.h>\n#include<string.h>\n\ntypedef struct binaryHeap{\n  void *h;\n  size_t heapSize;\n  size_t maxSize;\n  size_t size;\n  int (*cmp)(const void *,const void *);\n} heap;\n\nheap* newHeap(const size_t size,int (*cmpF)(const void *,const void *)){\n  const size_t maxSize=1;\n  heap *res=(heap *)malloc(sizeof(heap));\n  res->h=malloc(size*(maxSize+1));\n  res->heapSize=0;\n  res->maxSize=maxSize;\n  res->size=size;\n  res->cmp=cmpF;\n  return res;\n}\n\nint isEmpty(const heap *h){\n  return h->heapSize==0;\n}\n\nvoid freeHeap(heap *h){\n  free(h->h);\n  free(h);\n  return;\n}\n\nvoid initHeap(heap *h){\n  h->heapSize=0;\n  return;\n}\n\nstatic inline void heapFunc_swap(void * restrict a,void * restrict b,void * restrict tmp,size_t size){\n  memcpy(tmp,a,size);\n  memcpy(a,b,size);\n  memcpy(b,tmp,size);\n  return;\n}\n\nvoid push(heap *q,const void *p){\n  if(q->heapSize==q->maxSize){\n    q->maxSize*=2;\n    q->h=realloc(q->h,q->size*(q->maxSize+1));\n  }\n  q->heapSize+=1;\n  char *h=(char *)(q->h);\n  int k=q->heapSize;\n  const size_t size=q->size;\n  int (*cmp)(const void *,const void *)=q->cmp;\n  memcpy(h+k*size,p,size);\n  while(k>1){\n    size_t parent=k/2;\n    if(cmp(h+parent*size,h+k*size)<=0) return;\n    heapFunc_swap(h+parent*size,h+k*size,h,size);\n    k=parent;\n  }\n  return;\n}\n\nvoid pop(heap *q,void *res){\n  char *h=(char *)(q->h);\n  const size_t size=q->size;\n  if(res!=NULL) memcpy(res,h+size,size);\n  memcpy(h+size,h+size*q->heapSize,size);\n  q->heapSize-=1;\n  int (*cmp)(const void *,const void *)=q->cmp;\n  const size_t n=q->heapSize;\n  size_t k=1;\n  while(2*k+1<=n){\n    size_t next=cmp(h+2*k*size,h+(2*k+1)*size)<=0?2*k:2*k+1;\n    if(cmp(h+k*size,h+next*size)<=0) return;\n    heapFunc_swap(h+k*size,h+next*size,h,size);\n    k=next;\n  }\n  if(2*k<=n && cmp(h+k*size,h+2*k*size)>0) heapFunc_swap(h+k*size,h+2*k*size,h,size);\n  return;\n}\n\nvoid top(const heap *q,void *res){\n  memcpy(res,(char *)q->h+q->size,q->size);\n  return;\n}\n\ntypedef long long int int64;\n\ntypedef struct edge{\n  int a,b;\n  int c;\n} edge;\n\ntypedef struct indexNode{\n  int index;\n  int val;\n} node;\n\nint cmpNode(const void *a,const void *b){\n  return ((node *)a)->val-((node *)b)->val;\n}\n\nint cmpEdge(const void *a,const void *b){\n  return ((edge *)a)->c-((edge *)b)->c;\n}\n\nint root(int *u,int x){\n  if(u[x]==x) return x;\n  return u[x]=root(u,u[x]);\n}\n\nint same(int *u,int x,int y){\n  return root(u,x)==root(u,y);\n}\n\nvoid unite(int *u,int x,int y){\n  x=root(u,x);\n  y=root(u,y);\n  if(x==y) return;\n  u[x]=y;\n}\n\nvoid run(void){\n  int n;\n  scanf(\"%d\",&n);\n  node *x=(node *)calloc(n,sizeof(node));\n  node *y=(node *)calloc(n,sizeof(node));\n  int i;\n  for(i=0;i<n;i++){\n    int a,b;\n    scanf(\"%d%d\",&a,&b);\n    x[i]=(node){i,a};\n    y[i]=(node){i,b};\n  }\n  qsort(x,n,sizeof(node),cmpNode);\n  qsort(y,n,sizeof(node),cmpNode);\n  heap *h=newHeap(sizeof(edge),cmpEdge);\n  for(i=0;i<n-1;i++){\n    push(h,&((edge){x[i].index,x[i+1].index,x[i+1].val-x[i].val}));\n    push(h,&((edge){y[i].index,y[i+1].index,y[i+1].val-y[i].val}));\n  }\n  int cnt=0;\n  int *u=(int *)calloc(n,sizeof(int));\n  for(i=0;i<n;i++) u[i]=i;\n  int64 ans=0;\n  for(i=0;cnt<n-1;i++){\n    edge e;\n    pop(h,&e);\n    if(same(u,e.a,e.b)) continue;\n    unite(u,e.a,e.b);\n    ans+=e.c;\n    cnt++;\n  }\n  printf(\"%lld\\n\",ans);\n}\n\nint main(void){\n  run();\n  return 0;\n}\n", "problem_context": "Score : 500 points\n\nProblem Statement\n\nThere are N towns on a plane. The i-th town is located at the coordinates (x_i,y_i). There may be more than one town at the same coordinates.\n\nYou can build a road between two towns at coordinates (a,b) and (c,d) for a cost of min(|a-c|,|b-d|) yen (the currency of Japan). It is not possible to build other types of roads.\n\nYour objective is to build roads so that it will be possible to travel between every pair of towns by traversing roads. At least how much money is necessary to achieve this?\n\nConstraints\n\n2 ≤ N ≤ 10^5\n\n0 ≤ x_i,y_i ≤ 10^9\n\nAll input values 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 minimum necessary amount of money in order to build roads so that it will be possible to travel between every pair of towns by traversing roads.\n\nSample Input 1\n\n3\n1 5\n3 9\n7 8\n\nSample Output 1\n\n3\n\nBuild a road between Towns 1 and 2, and another between Towns 2 and 3. The total cost is 2+1=3 yen.\n\nSample Input 2\n\n6\n8 3\n4 9\n12 19\n18 1\n13 5\n7 6\n\nSample Output 2\n\n8", "sample_input": "3\n1 5\n3 9\n7 8\n"}, "reference_outputs": ["3\n"], "source_document_id": "p03684", "source_text": "Score : 500 points\n\nProblem Statement\n\nThere are N towns on a plane. The i-th town is located at the coordinates (x_i,y_i). There may be more than one town at the same coordinates.\n\nYou can build a road between two towns at coordinates (a,b) and (c,d) for a cost of min(|a-c|,|b-d|) yen (the currency of Japan). It is not possible to build other types of roads.\n\nYour objective is to build roads so that it will be possible to travel between every pair of towns by traversing roads. At least how much money is necessary to achieve this?\n\nConstraints\n\n2 ≤ N ≤ 10^5\n\n0 ≤ x_i,y_i ≤ 10^9\n\nAll input values 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 minimum necessary amount of money in order to build roads so that it will be possible to travel between every pair of towns by traversing roads.\n\nSample Input 1\n\n3\n1 5\n3 9\n7 8\n\nSample Output 1\n\n3\n\nBuild a road between Towns 1 and 2, and another between Towns 2 and 3. The total cost is 2+1=3 yen.\n\nSample Input 2\n\n6\n8 3\n4 9\n12 19\n18 1\n13 5\n7 6\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": 3307, "cpu_time_ms": 151, "memory_kb": 5356}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s602999287", "group_id": "codeNet:p03693", "input_text": "#include <stdio.h>\n\nint main(void){\n\tint num1;\n\tint num2;\n\tint num3;\n\tscanf(\"%d %d %d\", &num1, &num2, &num3);\n\t\n\tprintf(\"%d\",num1);\n\tprintf(\"%d\",num2);\n\tprintf(\"%d\",num3);\n\t\n\tif((num1*100+num2*10+num3)%4 == 0){\n\t\tprintf(\"YES\");\n\t} else {\n\t\tprintf(\"NO\");\n\t}\n\t\n\treturn 0;\n}", "language": "C", "metadata": {"date": 1499800814, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "problem_description_relpath": "problem_descriptions/p03693.html", "problem_id": "p03693", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03693/input.txt", "sample_output_relpath": "derived/input_output/data/p03693/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03693/C/s602999287.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s602999287", "user_id": "u668208294"}, "prompt_components": {"gold_output": "YES\n", "input_to_evaluate": "#include <stdio.h>\n\nint main(void){\n\tint num1;\n\tint num2;\n\tint num3;\n\tscanf(\"%d %d %d\", &num1, &num2, &num3);\n\t\n\tprintf(\"%d\",num1);\n\tprintf(\"%d\",num2);\n\tprintf(\"%d\",num3);\n\t\n\tif((num1*100+num2*10+num3)%4 == 0){\n\t\tprintf(\"YES\");\n\t} else {\n\t\tprintf(\"NO\");\n\t}\n\t\n\treturn 0;\n}", "problem_context": "Score : 100 points\n\nProblem Statement\n\nAtCoDeer has three cards, one red, one green and one blue.\n\nAn integer between 1 and 9 (inclusive) is written on each card: r on the red card, g on the green card and b on the blue card.\n\nWe will arrange the cards in the order red, green and blue from left to right, and read them as a three-digit integer.\n\nIs this integer a multiple of 4?\n\nConstraints\n\n1 ≤ r, g, b ≤ 9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nr g b\n\nOutput\n\nIf the three-digit integer is a multiple of 4, print YES (case-sensitive); otherwise, print NO.\n\nSample Input 1\n\n4 3 2\n\nSample Output 1\n\nYES\n\n432 is a multiple of 4, and thus YES should be printed.\n\nSample Input 2\n\n2 3 4\n\nSample Output 2\n\nNO\n\n234 is not a multiple of 4, and thus NO should be printed.", "sample_input": "4 3 2\n"}, "reference_outputs": ["YES\n"], "source_document_id": "p03693", "source_text": "Score : 100 points\n\nProblem Statement\n\nAtCoDeer has three cards, one red, one green and one blue.\n\nAn integer between 1 and 9 (inclusive) is written on each card: r on the red card, g on the green card and b on the blue card.\n\nWe will arrange the cards in the order red, green and blue from left to right, and read them as a three-digit integer.\n\nIs this integer a multiple of 4?\n\nConstraints\n\n1 ≤ r, g, b ≤ 9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nr g b\n\nOutput\n\nIf the three-digit integer is a multiple of 4, print YES (case-sensitive); otherwise, print NO.\n\nSample Input 1\n\n4 3 2\n\nSample Output 1\n\nYES\n\n432 is a multiple of 4, and thus YES should be printed.\n\nSample Input 2\n\n2 3 4\n\nSample Output 2\n\nNO\n\n234 is not a multiple of 4, and thus NO should be printed.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 271, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s620370377", "group_id": "codeNet:p03695", "input_text": "#include <stdio.h>\n#include <string.h>\nint main(void){\n    int n;\n    scanf(\"%d\", &n);\n    int rate[9+5]={0};\n    \n    for(int i=0; i<n; i++){\n        int a;\n        scanf(\"%d\", &a);\n        if(a<3200)rate[a/400]=1;\n        else rate[8]+=1;\n    }\n    \n    int min=0;\n    for(int i=0; i<8; i++)min+=rate[i];\n    \n    if(min==0){\n        min++;\n        rate[8]--;\n    }\n    printf(\"%d %d\\n\", min, min+rate[8]);\n    \n    return 0;\n}\n", "language": "C", "metadata": {"date": 1597508399, "filename_ext": "c", "original_language": "C (GCC 9.2.1)", "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/C/s620370377.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s620370377", "user_id": "u972042735"}, "prompt_components": {"gold_output": "2 2\n", "input_to_evaluate": "#include <stdio.h>\n#include <string.h>\nint main(void){\n    int n;\n    scanf(\"%d\", &n);\n    int rate[9+5]={0};\n    \n    for(int i=0; i<n; i++){\n        int a;\n        scanf(\"%d\", &a);\n        if(a<3200)rate[a/400]=1;\n        else rate[8]+=1;\n    }\n    \n    int min=0;\n    for(int i=0; i<8; i++)min+=rate[i];\n    \n    if(min==0){\n        min++;\n        rate[8]--;\n    }\n    printf(\"%d %d\\n\", min, min+rate[8]);\n    \n    return 0;\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": 430, "cpu_time_ms": 7, "memory_kb": 1688}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s186339953", "group_id": "codeNet:p03695", "input_text": "#include<stdio.h>\nint main(){\n  int n,x[9],i,m;\n  scanf(\"%d\",&n);\n  for(i=0;i<9;i++)x[i]=0;\n  for(i=0;i<n;i++){scanf(\"%d\",&m);x[m/400<8?m/400:8]++;}\n  m=0;for(i=0;i<8;i++)if(x[i])m++;\n  printf(\"%d %d\",m?m:1,m+x[8]>8?8:m+x[8]);\n}\n", "language": "C", "metadata": {"date": 1591932489, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "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/C/s186339953.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s186339953", "user_id": "u218346293"}, "prompt_components": {"gold_output": "2 2\n", "input_to_evaluate": "#include<stdio.h>\nint main(){\n  int n,x[9],i,m;\n  scanf(\"%d\",&n);\n  for(i=0;i<9;i++)x[i]=0;\n  for(i=0;i<n;i++){scanf(\"%d\",&m);x[m/400<8?m/400:8]++;}\n  m=0;for(i=0;i<8;i++)if(x[i])m++;\n  printf(\"%d %d\",m?m:1,m+x[8]>8?8:m+x[8]);\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": 229, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s998337739", "group_id": "codeNet:p03695", "input_text": "#include<stdio.h>\nint main(void){\n    int rt[200],coll[8];\n    int n,i,wild,r,min,max;\n    scanf(\"%d\",&n);\n    for(i=0;i<n;i++){\n        scanf(\"%d\",&rt[i]);\n    }\n    wild=0;\n    for(i=0;i<8;i++){\n        coll[i]=0;\n    }\n    for(i=0;i<n;i++){\n        r=rt[i];\n        if(1<=r && r<=399){\n            coll[0]++;\n        }\n        if(400<=r && r<=799){\n            coll[1]++;\n        }\n        if(800<=r && r<=1199){\n            coll[2]++;\n        }\n        if(1200<=r && r<=1599){\n            coll[3]++;\n        }\n        if(1600<=r && r<=1999){\n            coll[4]++;\n        }\n        if(2000<=r && r<=2399){\n            coll[5]++;\n        }\n        if(2400<=r && r<=2799){\n            coll[6]++;\n        }\n        if(2800<=r && r<=3199){\n            coll[7]++;\n        }\n        if(3199<r){\n            wild++;\n        }\n    }\n    min=0;\n    for(i=0;i<8;i++){\n        if(coll[i]!=0){\n            min++;\n        }\n    }\n    max=min+wild;\n    if(max>8){\n        max=8;\n    }\n    if(min==0&&wild!=0){\n        min=1;\n    }\n    printf(\"%d %d\\n\",min,max);\n    return 0;\n}\n\n", "language": "C", "metadata": {"date": 1497555722, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "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/C/s998337739.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s998337739", "user_id": "u699796231"}, "prompt_components": {"gold_output": "2 2\n", "input_to_evaluate": "#include<stdio.h>\nint main(void){\n    int rt[200],coll[8];\n    int n,i,wild,r,min,max;\n    scanf(\"%d\",&n);\n    for(i=0;i<n;i++){\n        scanf(\"%d\",&rt[i]);\n    }\n    wild=0;\n    for(i=0;i<8;i++){\n        coll[i]=0;\n    }\n    for(i=0;i<n;i++){\n        r=rt[i];\n        if(1<=r && r<=399){\n            coll[0]++;\n        }\n        if(400<=r && r<=799){\n            coll[1]++;\n        }\n        if(800<=r && r<=1199){\n            coll[2]++;\n        }\n        if(1200<=r && r<=1599){\n            coll[3]++;\n        }\n        if(1600<=r && r<=1999){\n            coll[4]++;\n        }\n        if(2000<=r && r<=2399){\n            coll[5]++;\n        }\n        if(2400<=r && r<=2799){\n            coll[6]++;\n        }\n        if(2800<=r && r<=3199){\n            coll[7]++;\n        }\n        if(3199<r){\n            wild++;\n        }\n    }\n    min=0;\n    for(i=0;i<8;i++){\n        if(coll[i]!=0){\n            min++;\n        }\n    }\n    max=min+wild;\n    if(max>8){\n        max=8;\n    }\n    if(min==0&&wild!=0){\n        min=1;\n    }\n    printf(\"%d %d\\n\",min,max);\n    return 0;\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": 1070, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s601393220", "group_id": "codeNet:p03696", "input_text": "#include<stdio.h>\nint main(){\n  int n,i,l,r,m;\n  char s[101],t[500];\n  scanf(\"%d%s\",&n,s);\n  l=r=n-1;\n  for(i=0;i<n;i++){if(s[i]-'(')r=i;else if(l==n-1)l=i;}\n  for(i=0;i<l;i++)t[i]='(';\n  for(i=0;i<n;i++)t[i+l]=s[i];\n  for(i=0;i<n-r-1;i++)t[i+l+n]=')';\n  m=l+n*2-r-1;t[m]=0;l=r=0;\n  for(i=0;i<m;i++){if(t[i]-'(')r++;else l++;}\n  for(i=0;i<r-l;i++)printf(\"(\");printf(\"%s\",t);for(i=0;i<l-r;i++)printf(\")\");\n}\n", "language": "C", "metadata": {"date": 1591935415, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "problem_description_relpath": "problem_descriptions/p03696.html", "problem_id": "p03696", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03696/input.txt", "sample_output_relpath": "derived/input_output/data/p03696/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03696/C/s601393220.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s601393220", "user_id": "u218346293"}, "prompt_components": {"gold_output": "(())\n", "input_to_evaluate": "#include<stdio.h>\nint main(){\n  int n,i,l,r,m;\n  char s[101],t[500];\n  scanf(\"%d%s\",&n,s);\n  l=r=n-1;\n  for(i=0;i<n;i++){if(s[i]-'(')r=i;else if(l==n-1)l=i;}\n  for(i=0;i<l;i++)t[i]='(';\n  for(i=0;i<n;i++)t[i+l]=s[i];\n  for(i=0;i<n-r-1;i++)t[i+l+n]=')';\n  m=l+n*2-r-1;t[m]=0;l=r=0;\n  for(i=0;i<m;i++){if(t[i]-'(')r++;else l++;}\n  for(i=0;i<r-l;i++)printf(\"(\");printf(\"%s\",t);for(i=0;i<l-r;i++)printf(\")\");\n}\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nYou are given a string S of length N consisting of ( and ). Your task is to insert some number of ( and ) into S to obtain a correct bracket sequence.\n\nHere, a correct bracket sequence is defined as follows:\n\n() is a correct bracket sequence.\n\nIf X is a correct bracket sequence, the concatenation of (, X and ) in this order is also a correct bracket sequence.\n\nIf X and Y are correct bracket sequences, the concatenation of X and Y in this order is also a correct bracket sequence.\n\nEvery correct bracket sequence can be derived from the rules above.\n\nFind the shortest correct bracket sequence that can be obtained. If there is more than one such sequence, find the lexicographically smallest one.\n\nConstraints\n\nThe length of S is N.\n\n1 ≤ N ≤ 100\n\nS consists of ( and ).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS\n\nOutput\n\nPrint the lexicographically smallest string among the shortest correct bracket sequences that can be obtained by inserting some number of ( and ) into S.\n\nSample Input 1\n\n3\n())\n\nSample Output 1\n\n(())\n\nSample Input 2\n\n6\n)))())\n\nSample Output 2\n\n(((()))())\n\nSample Input 3\n\n8\n))))((((\n\nSample Output 3\n\n(((())))(((())))", "sample_input": "3\n())\n"}, "reference_outputs": ["(())\n"], "source_document_id": "p03696", "source_text": "Score : 400 points\n\nProblem Statement\n\nYou are given a string S of length N consisting of ( and ). Your task is to insert some number of ( and ) into S to obtain a correct bracket sequence.\n\nHere, a correct bracket sequence is defined as follows:\n\n() is a correct bracket sequence.\n\nIf X is a correct bracket sequence, the concatenation of (, X and ) in this order is also a correct bracket sequence.\n\nIf X and Y are correct bracket sequences, the concatenation of X and Y in this order is also a correct bracket sequence.\n\nEvery correct bracket sequence can be derived from the rules above.\n\nFind the shortest correct bracket sequence that can be obtained. If there is more than one such sequence, find the lexicographically smallest one.\n\nConstraints\n\nThe length of S is N.\n\n1 ≤ N ≤ 100\n\nS consists of ( and ).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS\n\nOutput\n\nPrint the lexicographically smallest string among the shortest correct bracket sequences that can be obtained by inserting some number of ( and ) into S.\n\nSample Input 1\n\n3\n())\n\nSample Output 1\n\n(())\n\nSample Input 2\n\n6\n)))())\n\nSample Output 2\n\n(((()))())\n\nSample Input 3\n\n8\n))))((((\n\nSample Output 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": 407, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s726861572", "group_id": "codeNet:p03696", "input_text": "#include <stdio.h>\n#include <string.h>\n\nint test(char *str) {\n    int i, e=0, len=strlen(str);\n    for (i=0; i<len; i++) {\n        if (str[i] == '(')\n            e++;\n        else\n            e--;\n        if (e < 0)\n            return -1;\n    }\n    if (e != 0)\n        return 1;\n    else\n        return 0;\n}\n\nvoid pushfront(char *str) {\n    char abc[128];\n    strcpy(abc, str);\n    str[0] = '(';\n    strcpy(str+1, abc);\n}\nvoid pushback(char *str) {\n    int itr = strlen(str);\n    str[itr] = ')';\n    str[itr+1] = '\\0';\n}\n\nint main() {\n    int n, ret;\n    char str[128];\n    scanf(\"%d\\n\", &n);\n    fgets(str, sizeof(str), stdin);\n    str[n] = '\\0';\n    while ((ret = test(str)) != 0) {\n        if (ret > 0)\n            pushback(str);\n        else\n            pushfront(str);\n    }\n    printf(\"%s\\n\", str);\n    return 0;\n}\n", "language": "C", "metadata": {"date": 1498268665, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "problem_description_relpath": "problem_descriptions/p03696.html", "problem_id": "p03696", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03696/input.txt", "sample_output_relpath": "derived/input_output/data/p03696/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03696/C/s726861572.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s726861572", "user_id": "u672956630"}, "prompt_components": {"gold_output": "(())\n", "input_to_evaluate": "#include <stdio.h>\n#include <string.h>\n\nint test(char *str) {\n    int i, e=0, len=strlen(str);\n    for (i=0; i<len; i++) {\n        if (str[i] == '(')\n            e++;\n        else\n            e--;\n        if (e < 0)\n            return -1;\n    }\n    if (e != 0)\n        return 1;\n    else\n        return 0;\n}\n\nvoid pushfront(char *str) {\n    char abc[128];\n    strcpy(abc, str);\n    str[0] = '(';\n    strcpy(str+1, abc);\n}\nvoid pushback(char *str) {\n    int itr = strlen(str);\n    str[itr] = ')';\n    str[itr+1] = '\\0';\n}\n\nint main() {\n    int n, ret;\n    char str[128];\n    scanf(\"%d\\n\", &n);\n    fgets(str, sizeof(str), stdin);\n    str[n] = '\\0';\n    while ((ret = test(str)) != 0) {\n        if (ret > 0)\n            pushback(str);\n        else\n            pushfront(str);\n    }\n    printf(\"%s\\n\", str);\n    return 0;\n}\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nYou are given a string S of length N consisting of ( and ). Your task is to insert some number of ( and ) into S to obtain a correct bracket sequence.\n\nHere, a correct bracket sequence is defined as follows:\n\n() is a correct bracket sequence.\n\nIf X is a correct bracket sequence, the concatenation of (, X and ) in this order is also a correct bracket sequence.\n\nIf X and Y are correct bracket sequences, the concatenation of X and Y in this order is also a correct bracket sequence.\n\nEvery correct bracket sequence can be derived from the rules above.\n\nFind the shortest correct bracket sequence that can be obtained. If there is more than one such sequence, find the lexicographically smallest one.\n\nConstraints\n\nThe length of S is N.\n\n1 ≤ N ≤ 100\n\nS consists of ( and ).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS\n\nOutput\n\nPrint the lexicographically smallest string among the shortest correct bracket sequences that can be obtained by inserting some number of ( and ) into S.\n\nSample Input 1\n\n3\n())\n\nSample Output 1\n\n(())\n\nSample Input 2\n\n6\n)))())\n\nSample Output 2\n\n(((()))())\n\nSample Input 3\n\n8\n))))((((\n\nSample Output 3\n\n(((())))(((())))", "sample_input": "3\n())\n"}, "reference_outputs": ["(())\n"], "source_document_id": "p03696", "source_text": "Score : 400 points\n\nProblem Statement\n\nYou are given a string S of length N consisting of ( and ). Your task is to insert some number of ( and ) into S to obtain a correct bracket sequence.\n\nHere, a correct bracket sequence is defined as follows:\n\n() is a correct bracket sequence.\n\nIf X is a correct bracket sequence, the concatenation of (, X and ) in this order is also a correct bracket sequence.\n\nIf X and Y are correct bracket sequences, the concatenation of X and Y in this order is also a correct bracket sequence.\n\nEvery correct bracket sequence can be derived from the rules above.\n\nFind the shortest correct bracket sequence that can be obtained. If there is more than one such sequence, find the lexicographically smallest one.\n\nConstraints\n\nThe length of S is N.\n\n1 ≤ N ≤ 100\n\nS consists of ( and ).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS\n\nOutput\n\nPrint the lexicographically smallest string among the shortest correct bracket sequences that can be obtained by inserting some number of ( and ) into S.\n\nSample Input 1\n\n3\n())\n\nSample Output 1\n\n(())\n\nSample Input 2\n\n6\n)))())\n\nSample Output 2\n\n(((()))())\n\nSample Input 3\n\n8\n))))((((\n\nSample Output 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": 821, "cpu_time_ms": 99, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s613283309", "group_id": "codeNet:p03697", "input_text": "#include <stdio.h>\n\nint main(void)\n\n{\n  int a , b;\n\n  scanf(\"%d %d\",&a,&b);\n  \n  if(a + b >= 10){\n  printf(\"error\");\n  } else {\n  a = a + b;\n  printf(\"%d\\n\",a);\n  }\n  return 0;\n}", "language": "C", "metadata": {"date": 1527306184, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "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/C/s613283309.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s613283309", "user_id": "u384161668"}, "prompt_components": {"gold_output": "9\n", "input_to_evaluate": "#include <stdio.h>\n\nint main(void)\n\n{\n  int a , b;\n\n  scanf(\"%d %d\",&a,&b);\n  \n  if(a + b >= 10){\n  printf(\"error\");\n  } else {\n  a = a + b;\n  printf(\"%d\\n\",a);\n  }\n  return 0;\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": 178, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s219068838", "group_id": "codeNet:p03697", "input_text": "#include<stdio.h>\n\nint main()\n{\n    int a,b;\n    scanf(\"%d %d\",&a,&b);\n    int sum=a+b;\n    if(sum>=10){\n        printf(\"error\");\n    }else{\n        printf(\"%d\",sum);\n    }\n    \n    return 0;\n}\n", "language": "C", "metadata": {"date": 1499798433, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "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/C/s219068838.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s219068838", "user_id": "u767591769"}, "prompt_components": {"gold_output": "9\n", "input_to_evaluate": "#include<stdio.h>\n\nint main()\n{\n    int a,b;\n    scanf(\"%d %d\",&a,&b);\n    int sum=a+b;\n    if(sum>=10){\n        printf(\"error\");\n    }else{\n        printf(\"%d\",sum);\n    }\n    \n    return 0;\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": 194, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s451655599", "group_id": "codeNet:p03698", "input_text": "#include <unistd.h>\n#include <stdio.h>\n\nint\tmain(void)\n{\n  char\tstr[27] = {0};\n  int\ti = 0;\n  int\tj = 0;\n  \n  read(0, str, 26);\n  while (str[i])\n  {\n    j = i + 1;\n    while (str[j])\n    {\n      if (str[i] == str[j])\n      {\n        printf(\"no\");\n        return (0);\n      }\n      j++;\n    }\n    i++;\n  }\n  printf(\"yes\");\n  return (0);\n}\n  ", "language": "C", "metadata": {"date": 1598568158, "filename_ext": "c", "original_language": "C (GCC 9.2.1)", "problem_description_relpath": "problem_descriptions/p03698.html", "problem_id": "p03698", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03698/input.txt", "sample_output_relpath": "derived/input_output/data/p03698/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03698/C/s451655599.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s451655599", "user_id": "u359974242"}, "prompt_components": {"gold_output": "yes\n", "input_to_evaluate": "#include <unistd.h>\n#include <stdio.h>\n\nint\tmain(void)\n{\n  char\tstr[27] = {0};\n  int\ti = 0;\n  int\tj = 0;\n  \n  read(0, str, 26);\n  while (str[i])\n  {\n    j = i + 1;\n    while (str[j])\n    {\n      if (str[i] == str[j])\n      {\n        printf(\"no\");\n        return (0);\n      }\n      j++;\n    }\n    i++;\n  }\n  printf(\"yes\");\n  return (0);\n}\n  ", "problem_context": "Score : 200 points\n\nProblem Statement\n\nYou are given a string S consisting of lowercase English letters. Determine whether all the characters in S are different.\n\nConstraints\n\n2 ≤ |S| ≤ 26, where |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\nIf all the characters in S are different, print yes (case-sensitive); otherwise, print no.\n\nSample Input 1\n\nuncopyrightable\n\nSample Output 1\n\nyes\n\nSample Input 2\n\ndifferent\n\nSample Output 2\n\nno\n\nSample Input 3\n\nno\n\nSample Output 3\n\nyes", "sample_input": "uncopyrightable\n"}, "reference_outputs": ["yes\n"], "source_document_id": "p03698", "source_text": "Score : 200 points\n\nProblem Statement\n\nYou are given a string S consisting of lowercase English letters. Determine whether all the characters in S are different.\n\nConstraints\n\n2 ≤ |S| ≤ 26, where |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\nIf all the characters in S are different, print yes (case-sensitive); otherwise, print no.\n\nSample Input 1\n\nuncopyrightable\n\nSample Output 1\n\nyes\n\nSample Input 2\n\ndifferent\n\nSample Output 2\n\nno\n\nSample Input 3\n\nno\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": 340, "cpu_time_ms": 6, "memory_kb": 1604}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s619606267", "group_id": "codeNet:p03698", "input_text": "#include <stdio.h>\n#include <string.h>\n\nint main()\n{\n  char a[27];\n  int i, j, n, flag=0;\n  //入力\n  scanf(\"%s\", &a);\n  n = strlen(a);\n  //処理\n  for(i=0; i<n; i++)\n  {\n    for(j=0; j<n; j++)\n    {\n      if(a[i] == a[j] && i != j)\n      {\n        flag = 1;\n      }\n    }\n  }\n  //出力\n  if(flag == 0)\n  {\n    printf(\"yes\\n\");\n  }\n  else\n  {\n    printf(\"no\\n\");\n  }\n  return 0;\n}\n", "language": "C", "metadata": {"date": 1496977720, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "problem_description_relpath": "problem_descriptions/p03698.html", "problem_id": "p03698", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03698/input.txt", "sample_output_relpath": "derived/input_output/data/p03698/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03698/C/s619606267.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s619606267", "user_id": "u187266709"}, "prompt_components": {"gold_output": "yes\n", "input_to_evaluate": "#include <stdio.h>\n#include <string.h>\n\nint main()\n{\n  char a[27];\n  int i, j, n, flag=0;\n  //入力\n  scanf(\"%s\", &a);\n  n = strlen(a);\n  //処理\n  for(i=0; i<n; i++)\n  {\n    for(j=0; j<n; j++)\n    {\n      if(a[i] == a[j] && i != j)\n      {\n        flag = 1;\n      }\n    }\n  }\n  //出力\n  if(flag == 0)\n  {\n    printf(\"yes\\n\");\n  }\n  else\n  {\n    printf(\"no\\n\");\n  }\n  return 0;\n}\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nYou are given a string S consisting of lowercase English letters. Determine whether all the characters in S are different.\n\nConstraints\n\n2 ≤ |S| ≤ 26, where |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\nIf all the characters in S are different, print yes (case-sensitive); otherwise, print no.\n\nSample Input 1\n\nuncopyrightable\n\nSample Output 1\n\nyes\n\nSample Input 2\n\ndifferent\n\nSample Output 2\n\nno\n\nSample Input 3\n\nno\n\nSample Output 3\n\nyes", "sample_input": "uncopyrightable\n"}, "reference_outputs": ["yes\n"], "source_document_id": "p03698", "source_text": "Score : 200 points\n\nProblem Statement\n\nYou are given a string S consisting of lowercase English letters. Determine whether all the characters in S are different.\n\nConstraints\n\n2 ≤ |S| ≤ 26, where |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\nIf all the characters in S are different, print yes (case-sensitive); otherwise, print no.\n\nSample Input 1\n\nuncopyrightable\n\nSample Output 1\n\nyes\n\nSample Input 2\n\ndifferent\n\nSample Output 2\n\nno\n\nSample Input 3\n\nno\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": 384, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s314806745", "group_id": "codeNet:p03698", "input_text": "#include<stdio.h>\n\nint main()\n{\n\tchar S[26],d[26];\n\tint i,j = 0,c = 'a',a=0;\n\t\n\tscanf(\"%s\", &S);\n\t\n\t\ti = 0;\n\t\tfor(c = 'a';;)\n\t\t{\n\t\t\tif( c == S[i])\n\t\t\t{\n\t\t\t\td[j] = S[i];\n\t\t\t\tc++;\n\t\t\t\tj++;\n\t\t\t\ti = 0;\n\t\t\t}\n\t\t\telse if(S[i] == '\\0')\n\t\t\t{\n\t\t\t\td[i] = '\\0';\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\ti++;\n\t\t\t\t\n\t\t\t}\n\t\t}\n\t\tfor(i = 1; i <= 26; i++)\n\t\t{\n\t\t\tif(d[i] == d[i-1])\n\t\t\t{\n\t\t\t\tprintf(\"no\\n\");\n\t\t\t\ta++;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\telse if(d[i] == '\\0' && a < 1)\n\t\t\t{\n\t\t\t\tprintf(\"yes\\n\");\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\t\n\t\n\t\n\t\n\t\n\treturn 0;\n}\n", "language": "C", "metadata": {"date": 1496547837, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "problem_description_relpath": "problem_descriptions/p03698.html", "problem_id": "p03698", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03698/input.txt", "sample_output_relpath": "derived/input_output/data/p03698/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03698/C/s314806745.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s314806745", "user_id": "u901186392"}, "prompt_components": {"gold_output": "yes\n", "input_to_evaluate": "#include<stdio.h>\n\nint main()\n{\n\tchar S[26],d[26];\n\tint i,j = 0,c = 'a',a=0;\n\t\n\tscanf(\"%s\", &S);\n\t\n\t\ti = 0;\n\t\tfor(c = 'a';;)\n\t\t{\n\t\t\tif( c == S[i])\n\t\t\t{\n\t\t\t\td[j] = S[i];\n\t\t\t\tc++;\n\t\t\t\tj++;\n\t\t\t\ti = 0;\n\t\t\t}\n\t\t\telse if(S[i] == '\\0')\n\t\t\t{\n\t\t\t\td[i] = '\\0';\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\ti++;\n\t\t\t\t\n\t\t\t}\n\t\t}\n\t\tfor(i = 1; i <= 26; i++)\n\t\t{\n\t\t\tif(d[i] == d[i-1])\n\t\t\t{\n\t\t\t\tprintf(\"no\\n\");\n\t\t\t\ta++;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\telse if(d[i] == '\\0' && a < 1)\n\t\t\t{\n\t\t\t\tprintf(\"yes\\n\");\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\t\n\t\n\t\n\t\n\t\n\treturn 0;\n}\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nYou are given a string S consisting of lowercase English letters. Determine whether all the characters in S are different.\n\nConstraints\n\n2 ≤ |S| ≤ 26, where |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\nIf all the characters in S are different, print yes (case-sensitive); otherwise, print no.\n\nSample Input 1\n\nuncopyrightable\n\nSample Output 1\n\nyes\n\nSample Input 2\n\ndifferent\n\nSample Output 2\n\nno\n\nSample Input 3\n\nno\n\nSample Output 3\n\nyes", "sample_input": "uncopyrightable\n"}, "reference_outputs": ["yes\n"], "source_document_id": "p03698", "source_text": "Score : 200 points\n\nProblem Statement\n\nYou are given a string S consisting of lowercase English letters. Determine whether all the characters in S are different.\n\nConstraints\n\n2 ≤ |S| ≤ 26, where |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\nIf all the characters in S are different, print yes (case-sensitive); otherwise, print no.\n\nSample Input 1\n\nuncopyrightable\n\nSample Output 1\n\nyes\n\nSample Input 2\n\ndifferent\n\nSample Output 2\n\nno\n\nSample Input 3\n\nno\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": 507, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s152689311", "group_id": "codeNet:p03698", "input_text": "#include <stdio.h>\n#include <string.h>\n int main()\n {\n     int i,j,k=0;\n\t char str[26];\n     gets(str);\n     for (i = 0; i < strlen(str); i++)\n\t \t{\n         for (j =i + 1; j < strlen(str);j++) \n\t\t \t{\n             if (str[i] == str[j]) \n\t\t\t k=1;\n            }\n        }\n     if(k==1) printf(\"no\");\n     else printf(\"yes\");\n }\n", "language": "C", "metadata": {"date": 1496542830, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "problem_description_relpath": "problem_descriptions/p03698.html", "problem_id": "p03698", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03698/input.txt", "sample_output_relpath": "derived/input_output/data/p03698/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03698/C/s152689311.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s152689311", "user_id": "u331234512"}, "prompt_components": {"gold_output": "yes\n", "input_to_evaluate": "#include <stdio.h>\n#include <string.h>\n int main()\n {\n     int i,j,k=0;\n\t char str[26];\n     gets(str);\n     for (i = 0; i < strlen(str); i++)\n\t \t{\n         for (j =i + 1; j < strlen(str);j++) \n\t\t \t{\n             if (str[i] == str[j]) \n\t\t\t k=1;\n            }\n        }\n     if(k==1) printf(\"no\");\n     else printf(\"yes\");\n }\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nYou are given a string S consisting of lowercase English letters. Determine whether all the characters in S are different.\n\nConstraints\n\n2 ≤ |S| ≤ 26, where |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\nIf all the characters in S are different, print yes (case-sensitive); otherwise, print no.\n\nSample Input 1\n\nuncopyrightable\n\nSample Output 1\n\nyes\n\nSample Input 2\n\ndifferent\n\nSample Output 2\n\nno\n\nSample Input 3\n\nno\n\nSample Output 3\n\nyes", "sample_input": "uncopyrightable\n"}, "reference_outputs": ["yes\n"], "source_document_id": "p03698", "source_text": "Score : 200 points\n\nProblem Statement\n\nYou are given a string S consisting of lowercase English letters. Determine whether all the characters in S are different.\n\nConstraints\n\n2 ≤ |S| ≤ 26, where |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\nIf all the characters in S are different, print yes (case-sensitive); otherwise, print no.\n\nSample Input 1\n\nuncopyrightable\n\nSample Output 1\n\nyes\n\nSample Input 2\n\ndifferent\n\nSample Output 2\n\nno\n\nSample Input 3\n\nno\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": 325, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s009551119", "group_id": "codeNet:p03699", "input_text": "#include <stdio.h>\n#include <stdlib.h>\nvoid qsort(\n  void *base, size_t num, size_t size,\n  int (*compare)(const void *a, const void *b)\n);\nint asc(const void *a, const void *b) {\n  return *(int *)a - *(int *)b;\n}\n\nint main (){\n  int i,a[102]={0},n=0,sum=0;\n  scanf (\"%d\",&n);\n  for (i=0;i<n;i++){\n  scanf (\"%d\",&a[i]);\n   sum=a[i]+sum;\n  }\n qsort(a, n / sizeof(int), sizeof(int), asc);\n  \n  for (i=0;i<n;i++){\n  if (sum%10 == 0){\n    if (a[i]%10 != 0){\n  sum = sum-a[i];\n    }\n    }\n    else {break;}\n  }\n  printf (\"%d\",sum);\nreturn 0;\n}", "language": "C", "metadata": {"date": 1571948982, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "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/C/s009551119.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s009551119", "user_id": "u444555640"}, "prompt_components": {"gold_output": "25\n", "input_to_evaluate": "#include <stdio.h>\n#include <stdlib.h>\nvoid qsort(\n  void *base, size_t num, size_t size,\n  int (*compare)(const void *a, const void *b)\n);\nint asc(const void *a, const void *b) {\n  return *(int *)a - *(int *)b;\n}\n\nint main (){\n  int i,a[102]={0},n=0,sum=0;\n  scanf (\"%d\",&n);\n  for (i=0;i<n;i++){\n  scanf (\"%d\",&a[i]);\n   sum=a[i]+sum;\n  }\n qsort(a, n / sizeof(int), sizeof(int), asc);\n  \n  for (i=0;i<n;i++){\n  if (sum%10 == 0){\n    if (a[i]%10 != 0){\n  sum = sum-a[i];\n    }\n    }\n    else {break;}\n  }\n  printf (\"%d\",sum);\nreturn 0;\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": 538, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s752256552", "group_id": "codeNet:p03699", "input_text": "\n#include <stdio.h>\n\nint main()\n{\nlong int n,sum,c[10000],i;\nscanf(\"%ld\",&n);\nsum=0;\nfor(i=0;i<n;i++)\n{\n    scanf(\"%ld\",&c[i]);\n    \n    \n        sum+=c[i];\n    \n}\nif(sum%10==0)\n{\nfor(i=0;i<n;i++)\n{\n    sum-=c[i];\n    if(sum%10!=0)\n    {\n        break;\n    }\n    else{\n        sum+=c[i];\n    }\n}\n}else{\n    sum=0;\n}\nprintf(\"%ld\",sum);\n    return 0;\n}\n", "language": "C", "metadata": {"date": 1540708357, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "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/C/s752256552.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s752256552", "user_id": "u513506770"}, "prompt_components": {"gold_output": "25\n", "input_to_evaluate": "\n#include <stdio.h>\n\nint main()\n{\nlong int n,sum,c[10000],i;\nscanf(\"%ld\",&n);\nsum=0;\nfor(i=0;i<n;i++)\n{\n    scanf(\"%ld\",&c[i]);\n    \n    \n        sum+=c[i];\n    \n}\nif(sum%10==0)\n{\nfor(i=0;i<n;i++)\n{\n    sum-=c[i];\n    if(sum%10!=0)\n    {\n        break;\n    }\n    else{\n        sum+=c[i];\n    }\n}\n}else{\n    sum=0;\n}\nprintf(\"%ld\",sum);\n    return 0;\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": 351, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s275501212", "group_id": "codeNet:p03699", "input_text": "\n#include <stdlib.h>\n#include <stdio.h>\n#include <string.h>\n#include <math.h>\n\nint main(){\n\tint n;\n\tscanf(\" %d\", &n);\n\tint i, all = 0, s[n];\n\tfor(i = 0; i < n; i++){\n\t\tscanf(\" %d\", &s[i]);\n\t}\n\tfor(i = 0; i < n; i++){\n\t\tall += s[i];\n\t}\n\tint min=999;\n    for(i = 0; i < n; i++){\n\t\tif(s[i] %10 != 0 && s[i] < min){\n\t\t\tmin = s[i];\n\t\t}\n    }\n\tif(min == 999){\n\t\tprintf(\"%d\", 0);\n\t}\n\telse{\n\t\tprintf(\"%d\", all-min);\n\t}\n\treturn 0;\n}\n", "language": "C", "metadata": {"date": 1496539431, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "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/C/s275501212.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s275501212", "user_id": "u956237075"}, "prompt_components": {"gold_output": "25\n", "input_to_evaluate": "\n#include <stdlib.h>\n#include <stdio.h>\n#include <string.h>\n#include <math.h>\n\nint main(){\n\tint n;\n\tscanf(\" %d\", &n);\n\tint i, all = 0, s[n];\n\tfor(i = 0; i < n; i++){\n\t\tscanf(\" %d\", &s[i]);\n\t}\n\tfor(i = 0; i < n; i++){\n\t\tall += s[i];\n\t}\n\tint min=999;\n    for(i = 0; i < n; i++){\n\t\tif(s[i] %10 != 0 && s[i] < min){\n\t\t\tmin = s[i];\n\t\t}\n    }\n\tif(min == 999){\n\t\tprintf(\"%d\", 0);\n\t}\n\telse{\n\t\tprintf(\"%d\", all-min);\n\t}\n\treturn 0;\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": 424, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s275246535", "group_id": "codeNet:p03700", "input_text": "#include <stdio.h>\n\nint po(int n,int h[n],int p)\n{\n\tfor(int i=0;i<n;i++)\n\t\tif(h[i]%p!=0)return 0;\n\treturn 1;\n}\n\nint compact(int N,int A,int B,int h[N])\n{\n\tint x=1;\n\twhile(po(N,h,A*B))\n\t{\n\t\tfor(int i=0;i<N;i++)\n\t\t{\n\t\t\th[i]/=A*B;\n\t\t}\n\t\tx*=A*B;\n\t}\n\treturn x;\n}\n\nint max(int n,int a[n])\n{\n\tint max=-114154;\n\tint maxi;\n\tfor(int i=0;i<n;i++)\n\t{\n\t\tif(max<a[i])\n\t\t{\n\t\t\tmax=a[i];\n\t\t\tmaxi=i;\n\t\t}\n\t}\n\treturn maxi;\n}\n\nint death(int N,int h[N])\n{\n\tfor(int i=0;i<N;i++)\n\t\tif(h[i]>0)return 1;\n\treturn 0;\n}\n\nvoid bomb(int N,int A,int B,int h[N])\n{\n\tint maxi=max(N,h);\n\tfor(int i=0;i<N;i++)\n\t\th[i]+=-B;\n\th[maxi]+=B-A;\n}\n\nint main(void)\n{\n\tint N,A,B;\n\tscanf(\"%d%d%d\",&N,&A,&B);\n\tint h[N];\n\tfor(int i=0;i<N;i++)\n\t\tscanf(\"%d\",&h[i]);\n\tint x=compact(N,A,B,h);\n\tint i=0;\n\tfor(;death(N,h);i++)\n\t\tbomb(N,A,B,h);\n\tprintf(\"%d\\n\",i*x);\n\treturn 0;\n}\n", "language": "C", "metadata": {"date": 1496542321, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "problem_description_relpath": "problem_descriptions/p03700.html", "problem_id": "p03700", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03700/input.txt", "sample_output_relpath": "derived/input_output/data/p03700/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03700/C/s275246535.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s275246535", "user_id": "u697421413"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "#include <stdio.h>\n\nint po(int n,int h[n],int p)\n{\n\tfor(int i=0;i<n;i++)\n\t\tif(h[i]%p!=0)return 0;\n\treturn 1;\n}\n\nint compact(int N,int A,int B,int h[N])\n{\n\tint x=1;\n\twhile(po(N,h,A*B))\n\t{\n\t\tfor(int i=0;i<N;i++)\n\t\t{\n\t\t\th[i]/=A*B;\n\t\t}\n\t\tx*=A*B;\n\t}\n\treturn x;\n}\n\nint max(int n,int a[n])\n{\n\tint max=-114154;\n\tint maxi;\n\tfor(int i=0;i<n;i++)\n\t{\n\t\tif(max<a[i])\n\t\t{\n\t\t\tmax=a[i];\n\t\t\tmaxi=i;\n\t\t}\n\t}\n\treturn maxi;\n}\n\nint death(int N,int h[N])\n{\n\tfor(int i=0;i<N;i++)\n\t\tif(h[i]>0)return 1;\n\treturn 0;\n}\n\nvoid bomb(int N,int A,int B,int h[N])\n{\n\tint maxi=max(N,h);\n\tfor(int i=0;i<N;i++)\n\t\th[i]+=-B;\n\th[maxi]+=B-A;\n}\n\nint main(void)\n{\n\tint N,A,B;\n\tscanf(\"%d%d%d\",&N,&A,&B);\n\tint h[N];\n\tfor(int i=0;i<N;i++)\n\t\tscanf(\"%d\",&h[i]);\n\tint x=compact(N,A,B,h);\n\tint i=0;\n\tfor(;death(N,h);i++)\n\t\tbomb(N,A,B,h);\n\tprintf(\"%d\\n\",i*x);\n\treturn 0;\n}\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nYou are going out for a walk, when you suddenly encounter N monsters. Each monster has a parameter called health, and the health of the i-th monster is h_i at the moment of encounter. A monster will vanish immediately when its health drops to 0 or below.\n\nFortunately, you are a skilled magician, capable of causing explosions that damage monsters. In one explosion, you can damage monsters as follows:\n\nSelect an alive monster, and cause an explosion centered at that monster. The health of the monster at the center of the explosion will decrease by A, and the health of each of the other monsters will decrease by B. Here, A and B are predetermined parameters, and A > B holds.\n\nAt least how many explosions do you need to cause in order to vanish all the monsters?\n\nConstraints\n\nAll input values are integers.\n\n1 ≤ N ≤ 10^5\n\n1 ≤ B < A ≤ 10^9\n\n1 ≤ h_i ≤ 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN A B\nh_1\nh_2\n:\nh_N\n\nOutput\n\nPrint the minimum number of explosions that needs to be caused in order to vanish all the monsters.\n\nSample Input 1\n\n4 5 3\n8\n7\n4\n2\n\nSample Output 1\n\n2\n\nYou can vanish all the monsters in two explosion, as follows:\n\nFirst, cause an explosion centered at the monster with 8 health. The healths of the four monsters become 3, 4, 1 and -1, respectively, and the last monster vanishes.\n\nSecond, cause an explosion centered at the monster with 4 health remaining. The healths of the three remaining monsters become 0, -1 and -2, respectively, and all the monsters are now vanished.\n\nSample Input 2\n\n2 10 4\n20\n20\n\nSample Output 2\n\n4\n\nYou need to cause two explosions centered at each monster, for a total of four.\n\nSample Input 3\n\n5 2 1\n900000000\n900000000\n1000000000\n1000000000\n1000000000\n\nSample Output 3\n\n800000000", "sample_input": "4 5 3\n8\n7\n4\n2\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03700", "source_text": "Score : 400 points\n\nProblem Statement\n\nYou are going out for a walk, when you suddenly encounter N monsters. Each monster has a parameter called health, and the health of the i-th monster is h_i at the moment of encounter. A monster will vanish immediately when its health drops to 0 or below.\n\nFortunately, you are a skilled magician, capable of causing explosions that damage monsters. In one explosion, you can damage monsters as follows:\n\nSelect an alive monster, and cause an explosion centered at that monster. The health of the monster at the center of the explosion will decrease by A, and the health of each of the other monsters will decrease by B. Here, A and B are predetermined parameters, and A > B holds.\n\nAt least how many explosions do you need to cause in order to vanish all the monsters?\n\nConstraints\n\nAll input values are integers.\n\n1 ≤ N ≤ 10^5\n\n1 ≤ B < A ≤ 10^9\n\n1 ≤ h_i ≤ 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN A B\nh_1\nh_2\n:\nh_N\n\nOutput\n\nPrint the minimum number of explosions that needs to be caused in order to vanish all the monsters.\n\nSample Input 1\n\n4 5 3\n8\n7\n4\n2\n\nSample Output 1\n\n2\n\nYou can vanish all the monsters in two explosion, as follows:\n\nFirst, cause an explosion centered at the monster with 8 health. The healths of the four monsters become 3, 4, 1 and -1, respectively, and the last monster vanishes.\n\nSecond, cause an explosion centered at the monster with 4 health remaining. The healths of the three remaining monsters become 0, -1 and -2, respectively, and all the monsters are now vanished.\n\nSample Input 2\n\n2 10 4\n20\n20\n\nSample Output 2\n\n4\n\nYou need to cause two explosions centered at each monster, for a total of four.\n\nSample Input 3\n\n5 2 1\n900000000\n900000000\n1000000000\n1000000000\n1000000000\n\nSample Output 3\n\n800000000", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 2107, "memory_kb": 512}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s405805058", "group_id": "codeNet:p03712", "input_text": "#include<stdio.h>\nint main(void){\n  int i,j,m,n;\n  char a;\n  scanf(\"%d %d\",&m,&n);\n  for(i=0;i<m+2;i++){\n    for(j=0;j<n+2;j++){\n      if(i==0||i==m+2){\n        printf(\"#\");\n      }\n      if(j==0||j==n+2){\n        printf(\"#\");\n      }else{\n        scanf(\"%c\",&a);\n        printf(\"%c\",a);\n      }\n    }\n    printf(\"\\n\");\n  }\n  return 0;\n}", "language": "C", "metadata": {"date": 1584225096, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "problem_description_relpath": "problem_descriptions/p03712.html", "problem_id": "p03712", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03712/input.txt", "sample_output_relpath": "derived/input_output/data/p03712/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03712/C/s405805058.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s405805058", "user_id": "u993037852"}, "prompt_components": {"gold_output": "#####\n#abc#\n#arc#\n#####\n", "input_to_evaluate": "#include<stdio.h>\nint main(void){\n  int i,j,m,n;\n  char a;\n  scanf(\"%d %d\",&m,&n);\n  for(i=0;i<m+2;i++){\n    for(j=0;j<n+2;j++){\n      if(i==0||i==m+2){\n        printf(\"#\");\n      }\n      if(j==0||j==n+2){\n        printf(\"#\");\n      }else{\n        scanf(\"%c\",&a);\n        printf(\"%c\",a);\n      }\n    }\n    printf(\"\\n\");\n  }\n  return 0;\n}", "problem_context": "Score : 200 points\n\nProblem Statement\n\nYou are given a image with a height of H pixels and a width of W pixels.\nEach pixel is represented by a lowercase English letter.\nThe pixel at the i-th row from the top and j-th column from the left is a_{ij}.\n\nPut a box around this image and output the result. The box should consist of # and have a thickness of 1.\n\nConstraints\n\n1 ≤ H, W ≤ 100\n\na_{ij} is a lowercase English letter.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W\na_{11} ... a_{1W}\n:\na_{H1} ... a_{HW}\n\nOutput\n\nPrint the image surrounded by a box that consists of # and has a thickness of 1.\n\nSample Input 1\n\n2 3\nabc\narc\n\nSample Output 1\n\n#####\n#abc#\n#arc#\n#####\n\nSample Input 2\n\n1 1\nz\n\nSample Output 2\n\n###\n#z#\n###", "sample_input": "2 3\nabc\narc\n"}, "reference_outputs": ["#####\n#abc#\n#arc#\n#####\n"], "source_document_id": "p03712", "source_text": "Score : 200 points\n\nProblem Statement\n\nYou are given a image with a height of H pixels and a width of W pixels.\nEach pixel is represented by a lowercase English letter.\nThe pixel at the i-th row from the top and j-th column from the left is a_{ij}.\n\nPut a box around this image and output the result. The box should consist of # and have a thickness of 1.\n\nConstraints\n\n1 ≤ H, W ≤ 100\n\na_{ij} is a lowercase English letter.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W\na_{11} ... a_{1W}\n:\na_{H1} ... a_{HW}\n\nOutput\n\nPrint the image surrounded by a box that consists of # and has a thickness of 1.\n\nSample Input 1\n\n2 3\nabc\narc\n\nSample Output 1\n\n#####\n#abc#\n#arc#\n#####\n\nSample Input 2\n\n1 1\nz\n\nSample Output 2\n\n###\n#z#\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": 337, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s178909432", "group_id": "codeNet:p03712", "input_text": "#include<stdio.h>\n#include<string.h>\nint main()\n{\n\tint m,n,i,j,k;\n\tchar a[10000];\n\tscanf(\"%d%d\",&m,&n);\n\tgetchar();\n\tfor(i=0;i<m;i++)\n    gets(a);\n\tfor(k=0;k<n+2;k++)\n\tprintf(\"#\");\n\tprintf(\"\\n\");\n\tfor(i=0;i<m;i++)\n\tprintf(\"#%s#\",a[i]);\n\tfor(j=0;j<n+2;j++)\n\tprintf(\"#\");\n\tprintf(\"\\n\");\n\treturn 0;\n\t\n\t\n}", "language": "C", "metadata": {"date": 1509501258, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "problem_description_relpath": "problem_descriptions/p03712.html", "problem_id": "p03712", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03712/input.txt", "sample_output_relpath": "derived/input_output/data/p03712/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03712/C/s178909432.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s178909432", "user_id": "u353919145"}, "prompt_components": {"gold_output": "#####\n#abc#\n#arc#\n#####\n", "input_to_evaluate": "#include<stdio.h>\n#include<string.h>\nint main()\n{\n\tint m,n,i,j,k;\n\tchar a[10000];\n\tscanf(\"%d%d\",&m,&n);\n\tgetchar();\n\tfor(i=0;i<m;i++)\n    gets(a);\n\tfor(k=0;k<n+2;k++)\n\tprintf(\"#\");\n\tprintf(\"\\n\");\n\tfor(i=0;i<m;i++)\n\tprintf(\"#%s#\",a[i]);\n\tfor(j=0;j<n+2;j++)\n\tprintf(\"#\");\n\tprintf(\"\\n\");\n\treturn 0;\n\t\n\t\n}", "problem_context": "Score : 200 points\n\nProblem Statement\n\nYou are given a image with a height of H pixels and a width of W pixels.\nEach pixel is represented by a lowercase English letter.\nThe pixel at the i-th row from the top and j-th column from the left is a_{ij}.\n\nPut a box around this image and output the result. The box should consist of # and have a thickness of 1.\n\nConstraints\n\n1 ≤ H, W ≤ 100\n\na_{ij} is a lowercase English letter.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W\na_{11} ... a_{1W}\n:\na_{H1} ... a_{HW}\n\nOutput\n\nPrint the image surrounded by a box that consists of # and has a thickness of 1.\n\nSample Input 1\n\n2 3\nabc\narc\n\nSample Output 1\n\n#####\n#abc#\n#arc#\n#####\n\nSample Input 2\n\n1 1\nz\n\nSample Output 2\n\n###\n#z#\n###", "sample_input": "2 3\nabc\narc\n"}, "reference_outputs": ["#####\n#abc#\n#arc#\n#####\n"], "source_document_id": "p03712", "source_text": "Score : 200 points\n\nProblem Statement\n\nYou are given a image with a height of H pixels and a width of W pixels.\nEach pixel is represented by a lowercase English letter.\nThe pixel at the i-th row from the top and j-th column from the left is a_{ij}.\n\nPut a box around this image and output the result. The box should consist of # and have a thickness of 1.\n\nConstraints\n\n1 ≤ H, W ≤ 100\n\na_{ij} is a lowercase English letter.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W\na_{11} ... a_{1W}\n:\na_{H1} ... a_{HW}\n\nOutput\n\nPrint the image surrounded by a box that consists of # and has a thickness of 1.\n\nSample Input 1\n\n2 3\nabc\narc\n\nSample Output 1\n\n#####\n#abc#\n#arc#\n#####\n\nSample Input 2\n\n1 1\nz\n\nSample Output 2\n\n###\n#z#\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": 301, "cpu_time_ms": 99, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s531713037", "group_id": "codeNet:p03713", "input_text": "#include <stdio.h>\n\nlong long min(long long a, long long b);\nlong long max(long long a, long long b);\nlong long ab(long long a);\n\nint main(void){\n    int H, W;\n    scanf(\"%d %d\", &H, &W);\n    int sh, lo;\n\n    if((unsigned long long)H*(unsigned long long)W%3 == 0){\n        printf(\"0\\n\");\n        return 0;\n    }\n\n    if(H>W){\n        sh = W;\n        lo = H;\n    }\n    else{\n        sh = H;\n        lo = W;\n    }\n\n    int a, b=sh/2;\n    if(sh%2 == 0){\n        a = b;\n    }\n    else{\n        a = b + 1;\n    }\n    \n    int i=lo/2;\n    long long d=H*W;\n\n    while(i<lo){\n        long long S1=a*i, S2=b*i, S3=sh*(lo-i);\n        if(a==b){\n            d=min(d, ab(S3-S1));\n            //printf(\"d = %d\\n\", d);\n        }\n        else{\n            long long la = max(ab(S3-S1), ab(S3-S2));\n            d=min(d, la);\n        }\n        i++;\n    }\n        \n    printf(\"%lld\", d);\n    return 0;\n}\n\nlong long min(long long a, long long b){\n    if(b>a){\n        return a;\n    }\n    else{\n        return b;\n    }\n}\n\nlong long max(long long a, long long b){\n    if(b>a){\n        return b;\n    }\n    else{\n        return a;\n    }\n}\n\nlong long ab(long long a){\n    if(a>=0){\n        return a;\n    }\n    else{\n        return a *(-1);\n    }\n}", "language": "C", "metadata": {"date": 1495334397, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "problem_description_relpath": "problem_descriptions/p03713.html", "problem_id": "p03713", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03713/input.txt", "sample_output_relpath": "derived/input_output/data/p03713/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03713/C/s531713037.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s531713037", "user_id": "u066542384"}, "prompt_components": {"gold_output": "0\n", "input_to_evaluate": "#include <stdio.h>\n\nlong long min(long long a, long long b);\nlong long max(long long a, long long b);\nlong long ab(long long a);\n\nint main(void){\n    int H, W;\n    scanf(\"%d %d\", &H, &W);\n    int sh, lo;\n\n    if((unsigned long long)H*(unsigned long long)W%3 == 0){\n        printf(\"0\\n\");\n        return 0;\n    }\n\n    if(H>W){\n        sh = W;\n        lo = H;\n    }\n    else{\n        sh = H;\n        lo = W;\n    }\n\n    int a, b=sh/2;\n    if(sh%2 == 0){\n        a = b;\n    }\n    else{\n        a = b + 1;\n    }\n    \n    int i=lo/2;\n    long long d=H*W;\n\n    while(i<lo){\n        long long S1=a*i, S2=b*i, S3=sh*(lo-i);\n        if(a==b){\n            d=min(d, ab(S3-S1));\n            //printf(\"d = %d\\n\", d);\n        }\n        else{\n            long long la = max(ab(S3-S1), ab(S3-S2));\n            d=min(d, la);\n        }\n        i++;\n    }\n        \n    printf(\"%lld\", d);\n    return 0;\n}\n\nlong long min(long long a, long long b){\n    if(b>a){\n        return a;\n    }\n    else{\n        return b;\n    }\n}\n\nlong long max(long long a, long long b){\n    if(b>a){\n        return b;\n    }\n    else{\n        return a;\n    }\n}\n\nlong long ab(long long a){\n    if(a>=0){\n        return a;\n    }\n    else{\n        return a *(-1);\n    }\n}", "problem_context": "Score : 400 points\n\nProblem Statement\n\nThere is a bar of chocolate with a height of H blocks and a width of W blocks.\nSnuke is dividing this bar into exactly three pieces.\nHe can only cut the bar along borders of blocks, and the shape of each piece must be a rectangle.\n\nSnuke is trying to divide the bar as evenly as possible.\nMore specifically, he is trying to minimize S_{max} - S_{min}, where S_{max} is the area (the number of blocks contained) of the largest piece, and S_{min} is the area of the smallest piece.\nFind the minimum possible value of S_{max} - S_{min}.\n\nConstraints\n\n2 ≤ H, W ≤ 10^5\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W\n\nOutput\n\nPrint the minimum possible value of S_{max} - S_{min}.\n\nSample Input 1\n\n3 5\n\nSample Output 1\n\n0\n\nIn the division below, S_{max} - S_{min} = 5 - 5 = 0.\n\nSample Input 2\n\n4 5\n\nSample Output 2\n\n2\n\nIn the division below, S_{max} - S_{min} = 8 - 6 = 2.\n\nSample Input 3\n\n5 5\n\nSample Output 3\n\n4\n\nIn the division below, S_{max} - S_{min} = 10 - 6 = 4.\n\nSample Input 4\n\n100000 2\n\nSample Output 4\n\n1\n\nSample Input 5\n\n100000 100000\n\nSample Output 5\n\n50000", "sample_input": "3 5\n"}, "reference_outputs": ["0\n"], "source_document_id": "p03713", "source_text": "Score : 400 points\n\nProblem Statement\n\nThere is a bar of chocolate with a height of H blocks and a width of W blocks.\nSnuke is dividing this bar into exactly three pieces.\nHe can only cut the bar along borders of blocks, and the shape of each piece must be a rectangle.\n\nSnuke is trying to divide the bar as evenly as possible.\nMore specifically, he is trying to minimize S_{max} - S_{min}, where S_{max} is the area (the number of blocks contained) of the largest piece, and S_{min} is the area of the smallest piece.\nFind the minimum possible value of S_{max} - S_{min}.\n\nConstraints\n\n2 ≤ H, W ≤ 10^5\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W\n\nOutput\n\nPrint the minimum possible value of S_{max} - S_{min}.\n\nSample Input 1\n\n3 5\n\nSample Output 1\n\n0\n\nIn the division below, S_{max} - S_{min} = 5 - 5 = 0.\n\nSample Input 2\n\n4 5\n\nSample Output 2\n\n2\n\nIn the division below, S_{max} - S_{min} = 8 - 6 = 2.\n\nSample Input 3\n\n5 5\n\nSample Output 3\n\n4\n\nIn the division below, S_{max} - S_{min} = 10 - 6 = 4.\n\nSample Input 4\n\n100000 2\n\nSample Output 4\n\n1\n\nSample Input 5\n\n100000 100000\n\nSample Output 5\n\n50000", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1221, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s742293095", "group_id": "codeNet:p03715", "input_text": "#include <stdio.h>\n\nlong long int min(long long int a, long long int b) { return a < b ? a : b; }\nlong long int max(long long int a, long long int b) { return a > b ? a : b; }\nlong long int abs(long long int a) { return a > 0 ? a : -a; }\n\nint main(void) {\n\tlong long int H, W, i, tmp, ans;\n\tscanf(\"%lld%lld\", &H, &W);\n\n\tans = H * W;\n\tif (H % 3 == 0 || W % 3 == 0) {\n\t\tans = 0;\n\t}\n\telse if (H == 1 || W == 1) {\n\t\tans = 1;\n\t}\n\telse {\n\t\tfor (i = 1; i < W / 2 + 1; i++) {\n\t\t\tif (H % 2 == 0)\n\t\t\t\ttmp = abs(i * H - H / 2 * (W - i));\n\t\t\telse \n\t\t\t\ttmp = max(abs(i * H - H / 2 * (W - i)), abs(i * H - (H / 2 + 1) * (W - i)));\n\t\t\tans = min(tmp, ans);\n\t\t}\n\t}\n\n\tprintf(\"%lld\\n\", ans);\n\treturn 0;\n}", "language": "C", "metadata": {"date": 1495330172, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "problem_description_relpath": "problem_descriptions/p03715.html", "problem_id": "p03715", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03715/input.txt", "sample_output_relpath": "derived/input_output/data/p03715/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03715/C/s742293095.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s742293095", "user_id": "u472675932"}, "prompt_components": {"gold_output": "0\n", "input_to_evaluate": "#include <stdio.h>\n\nlong long int min(long long int a, long long int b) { return a < b ? a : b; }\nlong long int max(long long int a, long long int b) { return a > b ? a : b; }\nlong long int abs(long long int a) { return a > 0 ? a : -a; }\n\nint main(void) {\n\tlong long int H, W, i, tmp, ans;\n\tscanf(\"%lld%lld\", &H, &W);\n\n\tans = H * W;\n\tif (H % 3 == 0 || W % 3 == 0) {\n\t\tans = 0;\n\t}\n\telse if (H == 1 || W == 1) {\n\t\tans = 1;\n\t}\n\telse {\n\t\tfor (i = 1; i < W / 2 + 1; i++) {\n\t\t\tif (H % 2 == 0)\n\t\t\t\ttmp = abs(i * H - H / 2 * (W - i));\n\t\t\telse \n\t\t\t\ttmp = max(abs(i * H - H / 2 * (W - i)), abs(i * H - (H / 2 + 1) * (W - i)));\n\t\t\tans = min(tmp, ans);\n\t\t}\n\t}\n\n\tprintf(\"%lld\\n\", ans);\n\treturn 0;\n}", "problem_context": "Score : 400 points\n\nProblem Statement\n\nThere is a bar of chocolate with a height of H blocks and a width of W blocks.\nSnuke is dividing this bar into exactly three pieces.\nHe can only cut the bar along borders of blocks, and the shape of each piece must be a rectangle.\n\nSnuke is trying to divide the bar as evenly as possible.\nMore specifically, he is trying to minimize S_{max} - S_{min}, where S_{max} is the area (the number of blocks contained) of the largest piece, and S_{min} is the area of the smallest piece.\nFind the minimum possible value of S_{max} - S_{min}.\n\nConstraints\n\n2 ≤ H, W ≤ 10^5\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W\n\nOutput\n\nPrint the minimum possible value of S_{max} - S_{min}.\n\nSample Input 1\n\n3 5\n\nSample Output 1\n\n0\n\nIn the division below, S_{max} - S_{min} = 5 - 5 = 0.\n\nSample Input 2\n\n4 5\n\nSample Output 2\n\n2\n\nIn the division below, S_{max} - S_{min} = 8 - 6 = 2.\n\nSample Input 3\n\n5 5\n\nSample Output 3\n\n4\n\nIn the division below, S_{max} - S_{min} = 10 - 6 = 4.\n\nSample Input 4\n\n100000 2\n\nSample Output 4\n\n1\n\nSample Input 5\n\n100000 100000\n\nSample Output 5\n\n50000", "sample_input": "3 5\n"}, "reference_outputs": ["0\n"], "source_document_id": "p03715", "source_text": "Score : 400 points\n\nProblem Statement\n\nThere is a bar of chocolate with a height of H blocks and a width of W blocks.\nSnuke is dividing this bar into exactly three pieces.\nHe can only cut the bar along borders of blocks, and the shape of each piece must be a rectangle.\n\nSnuke is trying to divide the bar as evenly as possible.\nMore specifically, he is trying to minimize S_{max} - S_{min}, where S_{max} is the area (the number of blocks contained) of the largest piece, and S_{min} is the area of the smallest piece.\nFind the minimum possible value of S_{max} - S_{min}.\n\nConstraints\n\n2 ≤ H, W ≤ 10^5\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W\n\nOutput\n\nPrint the minimum possible value of S_{max} - S_{min}.\n\nSample Input 1\n\n3 5\n\nSample Output 1\n\n0\n\nIn the division below, S_{max} - S_{min} = 5 - 5 = 0.\n\nSample Input 2\n\n4 5\n\nSample Output 2\n\n2\n\nIn the division below, S_{max} - S_{min} = 8 - 6 = 2.\n\nSample Input 3\n\n5 5\n\nSample Output 3\n\n4\n\nIn the division below, S_{max} - S_{min} = 10 - 6 = 4.\n\nSample Input 4\n\n100000 2\n\nSample Output 4\n\n1\n\nSample Input 5\n\n100000 100000\n\nSample Output 5\n\n50000", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s753217307", "group_id": "codeNet:p03719", "input_text": "int main(void)\n{\n\tint a,b,c;\n\tscanf(\"%d %d %d\",&a,&b,&c);\n\tif(a<=c && c<=b){\n\t\tprintf(\"Yes\\n\");\n\t}\n\telse{\n\t\tprintf(\"No\\n\");\n\t}\n\treturn 0;\n}", "language": "C", "metadata": {"date": 1535919507, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "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/C/s753217307.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s753217307", "user_id": "u490089586"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "int main(void)\n{\n\tint a,b,c;\n\tscanf(\"%d %d %d\",&a,&b,&c);\n\tif(a<=c && c<=b){\n\t\tprintf(\"Yes\\n\");\n\t}\n\telse{\n\t\tprintf(\"No\\n\");\n\t}\n\treturn 0;\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": 139, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s066916921", "group_id": "codeNet:p03719", "input_text": "#include <stdio.h>\n\nint main(void){\n\tint A;\n\tint B;\n\tint C;\n\t\n\tchar buf[3];\n    fgets(buf,3,stdin);\n    sscanf(buf,\"%d %d %d\",&A,&B,&C);\n    \n\twhile(\"%d > 100\", A){\n\t\t\"%d = %d-100\",A,A;\n\t} \n\n\twhile(\"%d > 100\", B){\n\t\t\"%d = %d-100\",B,B;\n\t} \n\n\twhile(\"%d > 100\", C){\n\t\t\"%d = %d-100\",C,B;\n\t}\n\t\n\tif(\"%d >= %d\",C,A){\n\t\tif(\"%d <= %d\",C,B){\n\t\t\tprintf(\"Yes\");\n\t\t}else{\n\t\t\tprintf(\"No\");\n\t\t}\n\t}else{\n\t\tprintf(\"No\");\n\t}\n}\n", "language": "C", "metadata": {"date": 1499801878, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "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/C/s066916921.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s066916921", "user_id": "u449640915"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "#include <stdio.h>\n\nint main(void){\n\tint A;\n\tint B;\n\tint C;\n\t\n\tchar buf[3];\n    fgets(buf,3,stdin);\n    sscanf(buf,\"%d %d %d\",&A,&B,&C);\n    \n\twhile(\"%d > 100\", A){\n\t\t\"%d = %d-100\",A,A;\n\t} \n\n\twhile(\"%d > 100\", B){\n\t\t\"%d = %d-100\",B,B;\n\t} \n\n\twhile(\"%d > 100\", C){\n\t\t\"%d = %d-100\",C,B;\n\t}\n\t\n\tif(\"%d >= %d\",C,A){\n\t\tif(\"%d <= %d\",C,B){\n\t\t\tprintf(\"Yes\");\n\t\t}else{\n\t\t\tprintf(\"No\");\n\t\t}\n\t}else{\n\t\tprintf(\"No\");\n\t}\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": 409, "cpu_time_ms": 2103, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s155660408", "group_id": "codeNet:p03721", "input_text": "#include <stdio.h>\n#include <stdlib.h>\n#include <string.h>\n#include <math.h>\n#include <limits.h>\n\n#define REP(i,n) for(i=0;i<n;i++)\n\nint iin() {\n    int i;\n    scanf(\"%d\", &i);\n    return i;\n}\n\nlong long llin() {\n    long long i;\n    scanf(\"%lld\", &i);\n    return i;\n}\n\ndouble din() {\n    double i;\n    scanf(\"%lf\", &i);\n    return i;\n}\n\nchar cin() {\n    char c;\n    scanf(\"%c\", &c);\n    return c;\n}\n\nvoid stin(char *s) {\n    scanf(\"%s\", s);\n}\n\nvoid iout(int i) {\n    printf(\"%d\\n\", i);\n}\n\nvoid llout(long long i) {\n    printf(\"%lld\\n\", i);\n}\n\nvoid dout(double i) {\n    printf(\"%lf\\n\", i);\n}\n\nvoid cout(char c) {\n    printf(\"%c\\n\", c);\n}\n\nvoid stout(char *s) {\n    printf(\"%s\\n\", s);\n}\n\nint dfs(int v, int n, int *visited, int table[n][n]) {\n    int all_visited = 1, i;\n\n    REP(i,n) {\n        if (!visited[i]) {\n            all_visited = 0;\n            break;\n        }\n    }\n\n    if (all_visited) {\n        return 1;\n    }\n\n    int count = 0;\n\n    REP(i,n) {\n        if (!table[v][i]) continue;\n        if (visited[i]) continue;\n\n        visited[i] = 1;\n        count += dfs(i, n, visited, table);\n        visited[i] = 0;\n    }\n\n    return count;\n}\n\nint main() {\n    int n = iin(), k = iin(), i, a, b;\n    long long c[INT_MAX];\n    memset(c, 0, sizeof c);\n    REP(i, n) {\n        a = iin(), b = iin();\n        c[a] += b;\n    }\n    long long count = 0;\n    i = 0;\n    while(count < k) {\n        i++;\n        count += c[i];\n    }\n    iout(i);\n    return 0;\n}\n", "language": "C", "metadata": {"date": 1555883017, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "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/C/s155660408.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s155660408", "user_id": "u420082791"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "#include <stdio.h>\n#include <stdlib.h>\n#include <string.h>\n#include <math.h>\n#include <limits.h>\n\n#define REP(i,n) for(i=0;i<n;i++)\n\nint iin() {\n    int i;\n    scanf(\"%d\", &i);\n    return i;\n}\n\nlong long llin() {\n    long long i;\n    scanf(\"%lld\", &i);\n    return i;\n}\n\ndouble din() {\n    double i;\n    scanf(\"%lf\", &i);\n    return i;\n}\n\nchar cin() {\n    char c;\n    scanf(\"%c\", &c);\n    return c;\n}\n\nvoid stin(char *s) {\n    scanf(\"%s\", s);\n}\n\nvoid iout(int i) {\n    printf(\"%d\\n\", i);\n}\n\nvoid llout(long long i) {\n    printf(\"%lld\\n\", i);\n}\n\nvoid dout(double i) {\n    printf(\"%lf\\n\", i);\n}\n\nvoid cout(char c) {\n    printf(\"%c\\n\", c);\n}\n\nvoid stout(char *s) {\n    printf(\"%s\\n\", s);\n}\n\nint dfs(int v, int n, int *visited, int table[n][n]) {\n    int all_visited = 1, i;\n\n    REP(i,n) {\n        if (!visited[i]) {\n            all_visited = 0;\n            break;\n        }\n    }\n\n    if (all_visited) {\n        return 1;\n    }\n\n    int count = 0;\n\n    REP(i,n) {\n        if (!table[v][i]) continue;\n        if (visited[i]) continue;\n\n        visited[i] = 1;\n        count += dfs(i, n, visited, table);\n        visited[i] = 0;\n    }\n\n    return count;\n}\n\nint main() {\n    int n = iin(), k = iin(), i, a, b;\n    long long c[INT_MAX];\n    memset(c, 0, sizeof c);\n    REP(i, n) {\n        a = iin(), b = iin();\n        c[a] += b;\n    }\n    long long count = 0;\n    i = 0;\n    while(count < k) {\n        i++;\n        count += c[i];\n    }\n    iout(i);\n    return 0;\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": 1459, "cpu_time_ms": 97, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s169663782", "group_id": "codeNet:p03721", "input_text": "#include <stdio.h>\n\nint main(void){\n    \n    long long int i,n,a,b,k;\n    long long int num[100001]={0};\n    \n    scanf( \"%lld %lld\",&n,&k );\n    \n    for( i = 0; i < n; i++ ){\n        scanf( \"%lld %lld\",&a,&b);\n        num[a] = num[a] + b;\n        \n    }\n    \n    for( i = 1; i < 100001; i++ ){\n        k = k - num[i];\n        if( k <= 0 ){\n            printf( \"%lld\",i );\n            break;\n        }\n    }\n    \n    \n    \n    \n   \n    return 0;\n}", "language": "C", "metadata": {"date": 1498164285, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "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/C/s169663782.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s169663782", "user_id": "u096746675"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "#include <stdio.h>\n\nint main(void){\n    \n    long long int i,n,a,b,k;\n    long long int num[100001]={0};\n    \n    scanf( \"%lld %lld\",&n,&k );\n    \n    for( i = 0; i < n; i++ ){\n        scanf( \"%lld %lld\",&a,&b);\n        num[a] = num[a] + b;\n        \n    }\n    \n    for( i = 1; i < 100001; i++ ){\n        k = k - num[i];\n        if( k <= 0 ){\n            printf( \"%lld\",i );\n            break;\n        }\n    }\n    \n    \n    \n    \n   \n    return 0;\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": 448, "cpu_time_ms": 18, "memory_kb": 896}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s661912587", "group_id": "codeNet:p03721", "input_text": "#include <stdio.h>\n#include<stdlib.h>\nint int_sort( const void * a , const void * b ) {\n  if( *( long long int * )a < *( long long int * )b ) {\n    return -1;\n  }\n  else\n  if( *( long long int * )a == *(long long  int * )b ) {\n    return 0;\n  }\n  return 1;\n}\n\nint main(void){\n    int N,K;\n    scanf(\"%d %d\",&N,&K);\n    long long int a[114514]={};\n      size_t data_cnt=sizeof( a )/sizeof( a[0] );\n    for(int i=0;i<114514;i++)a[i]=2000000000000;\n    for(int i=0;i<N;i++){\n        int s,t;\n        scanf(\"%d %d\",&s,&t);\n        a[i]=1000000*s+t;\n    }\n      qsort(( void * )a, data_cnt , sizeof( a[0] )   , int_sort );\n      int count=0;\n      for(int i=0;i<N;i++){\n          count+=a[i]%1000000;\n          if(count>=K){\n              printf(\"%lld\",a[i]/1000000);\n              break;\n          }\n      }\n    \n    return 0;\n}\n", "language": "C", "metadata": {"date": 1494725224, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "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/C/s661912587.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s661912587", "user_id": "u601717680"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "#include <stdio.h>\n#include<stdlib.h>\nint int_sort( const void * a , const void * b ) {\n  if( *( long long int * )a < *( long long int * )b ) {\n    return -1;\n  }\n  else\n  if( *( long long int * )a == *(long long  int * )b ) {\n    return 0;\n  }\n  return 1;\n}\n\nint main(void){\n    int N,K;\n    scanf(\"%d %d\",&N,&K);\n    long long int a[114514]={};\n      size_t data_cnt=sizeof( a )/sizeof( a[0] );\n    for(int i=0;i<114514;i++)a[i]=2000000000000;\n    for(int i=0;i<N;i++){\n        int s,t;\n        scanf(\"%d %d\",&s,&t);\n        a[i]=1000000*s+t;\n    }\n      qsort(( void * )a, data_cnt , sizeof( a[0] )   , int_sort );\n      int count=0;\n      for(int i=0;i<N;i++){\n          count+=a[i]%1000000;\n          if(count>=K){\n              printf(\"%lld\",a[i]/1000000);\n              break;\n          }\n      }\n    \n    return 0;\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": 33, "memory_kb": 1788}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s817041065", "group_id": "codeNet:p03722", "input_text": "#include<stdio.h>\n#define INF -1000000000000000000\n#define ll long long\n\nint main() {\n  int n, m, f;\n  int i, j;\n  ll score[1010] = {};\n  scanf(\"%d %d\", &n, &m);\n  ll a[2010] = {};\n  ll b[2010] = {};\n  ll c[2010] = {};\n  for (i = 1; i < m+1; i++) {\n    scanf(\"%lld %lld %lld\", &a[i], &b[i], &c[i]);\n  }\n  for (i = 2; i < n+1; i++) {\n    score[i] = INF;\n  }\n  for (i = 1; i < n+2; i++) {\n    f = 0;\n    for (j = 1; j < m+1; j++) {\n      int from = a[j];\n      int to = b[j];\n      /*基本的に、修正が入ったらf=1\n       */\n      if (score[to] < score[from] + c[j]) {\n\tscore[to] = score[from] + c[j];\n\tf = 1;\n      }\n    } \n    /*修正が入らなくなれば(f==0)そこで終わり*/\n    if (f == 0) {\n      break;\n    }\n    /*修正が入り続け、最後も修正が起こればinf*/\n    if (i == n+1) {\n      printf(\"inf\\n\");\n      return 0;\n    }\n  } \n  printf(\"%lld\\n\", score[n]);\n  return 0;\n}\n  \n  ", "language": "C", "metadata": {"date": 1495164379, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "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/C/s817041065.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s817041065", "user_id": "u429843511"}, "prompt_components": {"gold_output": "7\n", "input_to_evaluate": "#include<stdio.h>\n#define INF -1000000000000000000\n#define ll long long\n\nint main() {\n  int n, m, f;\n  int i, j;\n  ll score[1010] = {};\n  scanf(\"%d %d\", &n, &m);\n  ll a[2010] = {};\n  ll b[2010] = {};\n  ll c[2010] = {};\n  for (i = 1; i < m+1; i++) {\n    scanf(\"%lld %lld %lld\", &a[i], &b[i], &c[i]);\n  }\n  for (i = 2; i < n+1; i++) {\n    score[i] = INF;\n  }\n  for (i = 1; i < n+2; i++) {\n    f = 0;\n    for (j = 1; j < m+1; j++) {\n      int from = a[j];\n      int to = b[j];\n      /*基本的に、修正が入ったらf=1\n       */\n      if (score[to] < score[from] + c[j]) {\n\tscore[to] = score[from] + c[j];\n\tf = 1;\n      }\n    } \n    /*修正が入らなくなれば(f==0)そこで終わり*/\n    if (f == 0) {\n      break;\n    }\n    /*修正が入り続け、最後も修正が起こればinf*/\n    if (i == n+1) {\n      printf(\"inf\\n\");\n      return 0;\n    }\n  } \n  printf(\"%lld\\n\", score[n]);\n  return 0;\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<j≤M)\n\n-10^9≤c_i≤10^9 (1≤i≤M)\n\nc_i is an integer.\n\nIn the given graph, there exists a path from vertex 1 to vertex N.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\na_1 b_1 c_1\na_2 b_2 c_2\n:\na_M b_M c_M\n\nOutput\n\nPrint the maximum possible score at the end of the game, if it is finite. If it is possible to increase the score indefinitely, print inf.\n\nSample Input 1\n\n3 3\n1 2 4\n2 3 3\n1 3 5\n\nSample Output 1\n\n7\n\nThere are two ways to move the piece to vertex N=3:\n\nvertex 1 → vertex 2 → vertex 3 : score 4+3=7\n\nvertex 1 → vertex 3 : score 5\n\nThus, the maximum possible score at the end of the game is 7.\n\nSample Input 2\n\n2 2\n1 2 1\n2 1 1\n\nSample Output 2\n\ninf\n\nIt is possible to increase the score indefinitely by alternating between vertex 1 and 2.\n\nSample Input 3\n\n6 5\n1 2 -1000000000\n2 3 -1000000000\n3 4 -1000000000\n4 5 -1000000000\n5 6 -1000000000\n\nSample Output 3\n\n-5000000000", "sample_input": "3 3\n1 2 4\n2 3 3\n1 3 5\n"}, "reference_outputs": ["7\n"], "source_document_id": "p03722", "source_text": "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<j≤M)\n\n-10^9≤c_i≤10^9 (1≤i≤M)\n\nc_i is an integer.\n\nIn the given graph, there exists a path from vertex 1 to vertex N.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\na_1 b_1 c_1\na_2 b_2 c_2\n:\na_M b_M c_M\n\nOutput\n\nPrint the maximum possible score at the end of the game, if it is finite. If it is possible to increase the score indefinitely, print inf.\n\nSample Input 1\n\n3 3\n1 2 4\n2 3 3\n1 3 5\n\nSample Output 1\n\n7\n\nThere are two ways to move the piece to vertex N=3:\n\nvertex 1 → vertex 2 → vertex 3 : score 4+3=7\n\nvertex 1 → vertex 3 : score 5\n\nThus, the maximum possible score at the end of the game is 7.\n\nSample Input 2\n\n2 2\n1 2 1\n2 1 1\n\nSample Output 2\n\ninf\n\nIt is possible to increase the score indefinitely by alternating between vertex 1 and 2.\n\nSample Input 3\n\n6 5\n1 2 -1000000000\n2 3 -1000000000\n3 4 -1000000000\n4 5 -1000000000\n5 6 -1000000000\n\nSample Output 3\n\n-5000000000", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 917, "cpu_time_ms": 4, "memory_kb": 256}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s401846059", "group_id": "codeNet:p03722", "input_text": "#include<stdio.h>\n\nvoid bellman_ford(int num_vertices, int num_edges, int *a, int *b, long long *c, long long *score) {\n  int i, j;\n  for (i = 2; i < num_vertices+1; i++) {\n    score[i] = -1000000000000000000;\n  }\n  score[1] = 0;\n  for (i = 0; i < num_vertices; i++) {\n    for (j = 0; j < num_edges; j++) {\n      int from = a[j];\n      int to = b[j];\n      if (score[to] < score[from] + c[j]) {\n\tscore[to] = score[from] + c[j];\n      }\n    }\n  }\n}\n\nint check(int num_edges, int *a, int *b, long long *c, long long *score) {\n  int j;\n  int flag = 0;\n  for (j = 0; j < num_edges; j++) {\n    int from = a[j];\n    int to = b[j];\n    if (score[to] < score[from] + c[j]) {\n      flag = 1;\n    }\n  }\n  return flag;\n}\n\nint main() {\n  int n, m;\n  int i;\n  long long score[1001] = {};\n  scanf(\"%d %d\", &n, &m);\n  int a[1000000] = {};\n  int b[1000000] = {};\n  long long c[1000000] = {};\n  for (i = 0; i < m; i++) {\n    scanf(\"%d %d %lld\", &a[i], &b[i], &c[i]);\n  }\n  bellman_ford(n, m, a, b, c, score);\n  if (check(m, a, b, c, score) == 1) {\n    printf(\"inf\\n\");\n  } else {\n    printf(\"%lld\\n\", score[n]);\n  }\n  return 0;\n}", "language": "C", "metadata": {"date": 1495153219, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "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/C/s401846059.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s401846059", "user_id": "u429843511"}, "prompt_components": {"gold_output": "7\n", "input_to_evaluate": "#include<stdio.h>\n\nvoid bellman_ford(int num_vertices, int num_edges, int *a, int *b, long long *c, long long *score) {\n  int i, j;\n  for (i = 2; i < num_vertices+1; i++) {\n    score[i] = -1000000000000000000;\n  }\n  score[1] = 0;\n  for (i = 0; i < num_vertices; i++) {\n    for (j = 0; j < num_edges; j++) {\n      int from = a[j];\n      int to = b[j];\n      if (score[to] < score[from] + c[j]) {\n\tscore[to] = score[from] + c[j];\n      }\n    }\n  }\n}\n\nint check(int num_edges, int *a, int *b, long long *c, long long *score) {\n  int j;\n  int flag = 0;\n  for (j = 0; j < num_edges; j++) {\n    int from = a[j];\n    int to = b[j];\n    if (score[to] < score[from] + c[j]) {\n      flag = 1;\n    }\n  }\n  return flag;\n}\n\nint main() {\n  int n, m;\n  int i;\n  long long score[1001] = {};\n  scanf(\"%d %d\", &n, &m);\n  int a[1000000] = {};\n  int b[1000000] = {};\n  long long c[1000000] = {};\n  for (i = 0; i < m; i++) {\n    scanf(\"%d %d %lld\", &a[i], &b[i], &c[i]);\n  }\n  bellman_ford(n, m, a, b, c, score);\n  if (check(m, a, b, c, score) == 1) {\n    printf(\"inf\\n\");\n  } else {\n    printf(\"%lld\\n\", score[n]);\n  }\n  return 0;\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<j≤M)\n\n-10^9≤c_i≤10^9 (1≤i≤M)\n\nc_i is an integer.\n\nIn the given graph, there exists a path from vertex 1 to vertex N.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\na_1 b_1 c_1\na_2 b_2 c_2\n:\na_M b_M c_M\n\nOutput\n\nPrint the maximum possible score at the end of the game, if it is finite. If it is possible to increase the score indefinitely, print inf.\n\nSample Input 1\n\n3 3\n1 2 4\n2 3 3\n1 3 5\n\nSample Output 1\n\n7\n\nThere are two ways to move the piece to vertex N=3:\n\nvertex 1 → vertex 2 → vertex 3 : score 4+3=7\n\nvertex 1 → vertex 3 : score 5\n\nThus, the maximum possible score at the end of the game is 7.\n\nSample Input 2\n\n2 2\n1 2 1\n2 1 1\n\nSample Output 2\n\ninf\n\nIt is possible to increase the score indefinitely by alternating between vertex 1 and 2.\n\nSample Input 3\n\n6 5\n1 2 -1000000000\n2 3 -1000000000\n3 4 -1000000000\n4 5 -1000000000\n5 6 -1000000000\n\nSample Output 3\n\n-5000000000", "sample_input": "3 3\n1 2 4\n2 3 3\n1 3 5\n"}, "reference_outputs": ["7\n"], "source_document_id": "p03722", "source_text": "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<j≤M)\n\n-10^9≤c_i≤10^9 (1≤i≤M)\n\nc_i is an integer.\n\nIn the given graph, there exists a path from vertex 1 to vertex N.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\na_1 b_1 c_1\na_2 b_2 c_2\n:\na_M b_M c_M\n\nOutput\n\nPrint the maximum possible score at the end of the game, if it is finite. If it is possible to increase the score indefinitely, print inf.\n\nSample Input 1\n\n3 3\n1 2 4\n2 3 3\n1 3 5\n\nSample Output 1\n\n7\n\nThere are two ways to move the piece to vertex N=3:\n\nvertex 1 → vertex 2 → vertex 3 : score 4+3=7\n\nvertex 1 → vertex 3 : score 5\n\nThus, the maximum possible score at the end of the game is 7.\n\nSample Input 2\n\n2 2\n1 2 1\n2 1 1\n\nSample Output 2\n\ninf\n\nIt is possible to increase the score indefinitely by alternating between vertex 1 and 2.\n\nSample Input 3\n\n6 5\n1 2 -1000000000\n2 3 -1000000000\n3 4 -1000000000\n4 5 -1000000000\n5 6 -1000000000\n\nSample Output 3\n\n-5000000000", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1112, "cpu_time_ms": 9, "memory_kb": 15744}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s348190520", "group_id": "codeNet:p03722", "input_text": "#pragma GCC optimize(\"O3\")\n#include <stdio.h>\n#define INF 2300000000000000000LL\nlong long dist[1000][1000];\nint main(){\n\tint V,E,i,j;long long k;\n\tint f=rand()%2;\n\tscanf(\"%d%d\",&V,&E);\n\tfor(i=0;i<V;i++){\n\t\tfor(j=0;j<i;j++)dist[i][j]=INF;\n\t\tdist[i][j++]=0;\n\t\tfor(;j<V;j++)dist[i][j]=INF;\n\t}\n\tfor(;E--;)scanf(\"%d%d%lld\",&i,&j,&k),dist[i-1][j-1]=-k;\n\tfor(k=0;k<V;k++)for(i=0;i<V;i++)for(j=0;j<V;j++)\n\t\tif(dist[i][k]!=INF && dist[k][j]!=INF && dist[i][j]>dist[i][k]+dist[k][j])\n\t\t\tdist[i][j]=dist[i][k]+dist[k][j];\n\tfor(i=0;i<V;i++)if(dist[0][i]!=INF&&dist[i][V-1]!=INF&&dist[i][i]<0){puts(\"inf\");return 0;}\n\tprintf(\"%lld\\n\",-dist[0][V-1]);\n\treturn 0;\n}", "language": "C", "metadata": {"date": 1494935367, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "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/C/s348190520.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s348190520", "user_id": "u280667879"}, "prompt_components": {"gold_output": "7\n", "input_to_evaluate": "#pragma GCC optimize(\"O3\")\n#include <stdio.h>\n#define INF 2300000000000000000LL\nlong long dist[1000][1000];\nint main(){\n\tint V,E,i,j;long long k;\n\tint f=rand()%2;\n\tscanf(\"%d%d\",&V,&E);\n\tfor(i=0;i<V;i++){\n\t\tfor(j=0;j<i;j++)dist[i][j]=INF;\n\t\tdist[i][j++]=0;\n\t\tfor(;j<V;j++)dist[i][j]=INF;\n\t}\n\tfor(;E--;)scanf(\"%d%d%lld\",&i,&j,&k),dist[i-1][j-1]=-k;\n\tfor(k=0;k<V;k++)for(i=0;i<V;i++)for(j=0;j<V;j++)\n\t\tif(dist[i][k]!=INF && dist[k][j]!=INF && dist[i][j]>dist[i][k]+dist[k][j])\n\t\t\tdist[i][j]=dist[i][k]+dist[k][j];\n\tfor(i=0;i<V;i++)if(dist[0][i]!=INF&&dist[i][V-1]!=INF&&dist[i][i]<0){puts(\"inf\");return 0;}\n\tprintf(\"%lld\\n\",-dist[0][V-1]);\n\treturn 0;\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<j≤M)\n\n-10^9≤c_i≤10^9 (1≤i≤M)\n\nc_i is an integer.\n\nIn the given graph, there exists a path from vertex 1 to vertex N.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\na_1 b_1 c_1\na_2 b_2 c_2\n:\na_M b_M c_M\n\nOutput\n\nPrint the maximum possible score at the end of the game, if it is finite. If it is possible to increase the score indefinitely, print inf.\n\nSample Input 1\n\n3 3\n1 2 4\n2 3 3\n1 3 5\n\nSample Output 1\n\n7\n\nThere are two ways to move the piece to vertex N=3:\n\nvertex 1 → vertex 2 → vertex 3 : score 4+3=7\n\nvertex 1 → vertex 3 : score 5\n\nThus, the maximum possible score at the end of the game is 7.\n\nSample Input 2\n\n2 2\n1 2 1\n2 1 1\n\nSample Output 2\n\ninf\n\nIt is possible to increase the score indefinitely by alternating between vertex 1 and 2.\n\nSample Input 3\n\n6 5\n1 2 -1000000000\n2 3 -1000000000\n3 4 -1000000000\n4 5 -1000000000\n5 6 -1000000000\n\nSample Output 3\n\n-5000000000", "sample_input": "3 3\n1 2 4\n2 3 3\n1 3 5\n"}, "reference_outputs": ["7\n"], "source_document_id": "p03722", "source_text": "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<j≤M)\n\n-10^9≤c_i≤10^9 (1≤i≤M)\n\nc_i is an integer.\n\nIn the given graph, there exists a path from vertex 1 to vertex N.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\na_1 b_1 c_1\na_2 b_2 c_2\n:\na_M b_M c_M\n\nOutput\n\nPrint the maximum possible score at the end of the game, if it is finite. If it is possible to increase the score indefinitely, print inf.\n\nSample Input 1\n\n3 3\n1 2 4\n2 3 3\n1 3 5\n\nSample Output 1\n\n7\n\nThere are two ways to move the piece to vertex N=3:\n\nvertex 1 → vertex 2 → vertex 3 : score 4+3=7\n\nvertex 1 → vertex 3 : score 5\n\nThus, the maximum possible score at the end of the game is 7.\n\nSample Input 2\n\n2 2\n1 2 1\n2 1 1\n\nSample Output 2\n\ninf\n\nIt is possible to increase the score indefinitely by alternating between vertex 1 and 2.\n\nSample Input 3\n\n6 5\n1 2 -1000000000\n2 3 -1000000000\n3 4 -1000000000\n4 5 -1000000000\n5 6 -1000000000\n\nSample Output 3\n\n-5000000000", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 649, "cpu_time_ms": 1060, "memory_kb": 8064}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s312004175", "group_id": "codeNet:p03723", "input_text": "#include <stdio.h>\n\nint main(void) {\n  unsigned long long a[3];\n  for (int i = 0; i < 3; i++) {\n    scanf(\"%llu\", &a[i]);\n  }\n    \n  for (int i = 0; ; i++) {    \n    for (int j = 0; j < 3; j++) {\n      if (a[j] % 2) {\n        printf(\"%i\\n\", i);\n        return 0;\n      }\n    }\n    \n    if (a[0] == a[1] && a[1] == a[2]) {\n      puts(\"-1\");\n      return 0;\n    }\n    \n    long long b[] = {(a[1] + a[2])/2, (a[0] + a[2])/2, (a[0] + a[1])/2};\n    for (int j = 0; j < 3; j++) {\n      a[j] = b[j];\n    }\n  }\n  \n  return 0;\n}", "language": "C", "metadata": {"date": 1494122194, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "problem_description_relpath": "problem_descriptions/p03723.html", "problem_id": "p03723", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03723/input.txt", "sample_output_relpath": "derived/input_output/data/p03723/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03723/C/s312004175.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s312004175", "user_id": "u790584437"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "#include <stdio.h>\n\nint main(void) {\n  unsigned long long a[3];\n  for (int i = 0; i < 3; i++) {\n    scanf(\"%llu\", &a[i]);\n  }\n    \n  for (int i = 0; ; i++) {    \n    for (int j = 0; j < 3; j++) {\n      if (a[j] % 2) {\n        printf(\"%i\\n\", i);\n        return 0;\n      }\n    }\n    \n    if (a[0] == a[1] && a[1] == a[2]) {\n      puts(\"-1\");\n      return 0;\n    }\n    \n    long long b[] = {(a[1] + a[2])/2, (a[0] + a[2])/2, (a[0] + a[1])/2};\n    for (int j = 0; j < 3; j++) {\n      a[j] = b[j];\n    }\n  }\n  \n  return 0;\n}", "problem_context": "Score : 300 points\n\nProblem Statement\n\nTakahashi, Aoki and Snuke love cookies. They have A, B and C cookies, respectively. Now, they will exchange those cookies by repeating the action below:\n\nEach person simultaneously divides his cookies in half and gives one half to each of the other two persons.\n\nThis action will be repeated until there is a person with odd number of cookies in hand.\n\nHow many times will they repeat this action?\nNote that the answer may not be finite.\n\nConstraints\n\n1 ≤ A,B,C ≤ 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C\n\nOutput\n\nPrint the number of times the action will be performed by the three people, if this number is finite.\nIf it is infinite, print -1 instead.\n\nSample Input 1\n\n4 12 20\n\nSample Output 1\n\n3\n\nInitially, Takahashi, Aoki and Snuke have 4, 12 and 20 cookies. Then,\n\nAfter the first action, they have 16, 12 and 8.\n\nAfter the second action, they have 10, 12 and 14.\n\nAfter the third action, they have 13, 12 and 11.\n\nNow, Takahashi and Snuke have odd number of cookies, and therefore the answer is 3.\n\nSample Input 2\n\n14 14 14\n\nSample Output 2\n\n-1\n\nSample Input 3\n\n454 414 444\n\nSample Output 3\n\n1", "sample_input": "4 12 20\n"}, "reference_outputs": ["3\n"], "source_document_id": "p03723", "source_text": "Score : 300 points\n\nProblem Statement\n\nTakahashi, Aoki and Snuke love cookies. They have A, B and C cookies, respectively. Now, they will exchange those cookies by repeating the action below:\n\nEach person simultaneously divides his cookies in half and gives one half to each of the other two persons.\n\nThis action will be repeated until there is a person with odd number of cookies in hand.\n\nHow many times will they repeat this action?\nNote that the answer may not be finite.\n\nConstraints\n\n1 ≤ A,B,C ≤ 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C\n\nOutput\n\nPrint the number of times the action will be performed by the three people, if this number is finite.\nIf it is infinite, print -1 instead.\n\nSample Input 1\n\n4 12 20\n\nSample Output 1\n\n3\n\nInitially, Takahashi, Aoki and Snuke have 4, 12 and 20 cookies. Then,\n\nAfter the first action, they have 16, 12 and 8.\n\nAfter the second action, they have 10, 12 and 14.\n\nAfter the third action, they have 13, 12 and 11.\n\nNow, Takahashi and Snuke have odd number of cookies, and therefore the answer is 3.\n\nSample Input 2\n\n14 14 14\n\nSample Output 2\n\n-1\n\nSample Input 3\n\n454 414 444\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": 519, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s390665341", "group_id": "codeNet:p03729", "input_text": "#include <stdio.h>\n#include <string.h>\nint main() {\n\t\n\tchar a[20], b[20], c[20];\n\tscanf(\"%s %s %s\", &a, &b, &c);\n\t\n\tint lenA = strlen(a);\n\tint lenB = strlen(b);\n\t\n\tif (a[lenA-1] == b[0] && b[lenB-1] == c[0]){\n\t\tprintf(\"YES\\n\");\n\t}\n\telse printf(\"NO\\n\");\n\t\n\treturn 0;\n}", "language": "C", "metadata": {"date": 1596049916, "filename_ext": "c", "original_language": "C (GCC 9.2.1)", "problem_description_relpath": "problem_descriptions/p03729.html", "problem_id": "p03729", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03729/input.txt", "sample_output_relpath": "derived/input_output/data/p03729/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03729/C/s390665341.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s390665341", "user_id": "u816631826"}, "prompt_components": {"gold_output": "YES\n", "input_to_evaluate": "#include <stdio.h>\n#include <string.h>\nint main() {\n\t\n\tchar a[20], b[20], c[20];\n\tscanf(\"%s %s %s\", &a, &b, &c);\n\t\n\tint lenA = strlen(a);\n\tint lenB = strlen(b);\n\t\n\tif (a[lenA-1] == b[0] && b[lenB-1] == c[0]){\n\t\tprintf(\"YES\\n\");\n\t}\n\telse printf(\"NO\\n\");\n\t\n\treturn 0;\n}", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou are given three strings A, B and C. Check whether they form a word chain.\n\nMore formally, determine whether both of the following are true:\n\nThe last character in A and the initial character in B are the same.\n\nThe last character in B and the initial character in C are the same.\n\nIf both are true, print YES. Otherwise, print NO.\n\nConstraints\n\nA, B and C are all composed of lowercase English letters (a - z).\n\n1 ≤ |A|, |B|, |C| ≤ 10, where |A|, |B| and |C| are the lengths of A, B and C, respectively.\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\nrng gorilla apple\n\nSample Output 1\n\nYES\n\nThey form a word chain.\n\nSample Input 2\n\nyakiniku unagi sushi\n\nSample Output 2\n\nNO\n\nA and B form a word chain, but B and C do not.\n\nSample Input 3\n\na a a\n\nSample Output 3\n\nYES\n\nSample Input 4\n\naaaaaaaaab aaaaaaaaaa aaaaaaaaab\n\nSample Output 4\n\nNO", "sample_input": "rng gorilla apple\n"}, "reference_outputs": ["YES\n"], "source_document_id": "p03729", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou are given three strings A, B and C. Check whether they form a word chain.\n\nMore formally, determine whether both of the following are true:\n\nThe last character in A and the initial character in B are the same.\n\nThe last character in B and the initial character in C are the same.\n\nIf both are true, print YES. Otherwise, print NO.\n\nConstraints\n\nA, B and C are all composed of lowercase English letters (a - z).\n\n1 ≤ |A|, |B|, |C| ≤ 10, where |A|, |B| and |C| are the lengths of A, B and C, respectively.\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\nrng gorilla apple\n\nSample Output 1\n\nYES\n\nThey form a word chain.\n\nSample Input 2\n\nyakiniku unagi sushi\n\nSample Output 2\n\nNO\n\nA and B form a word chain, but B and C do not.\n\nSample Input 3\n\na a a\n\nSample Output 3\n\nYES\n\nSample Input 4\n\naaaaaaaaab aaaaaaaaaa aaaaaaaaab\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": 267, "cpu_time_ms": 5, "memory_kb": 1664}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s838282501", "group_id": "codeNet:p03729", "input_text": "#include<stdio.h>\n#include<string.h>\nint main(void)\n{\n        int x, y;\n        char A[12], B[12], C[12];\n        scanf(\"%s%s%s\", A, B, C);\n\n        x = strlen(A);\n        y = strlen(B);\n\n        if((A[x-1] == B[0])&&(B[y-1] == C[0]))\n                printf(\"Yes\\n\");\n        else printf(\"No\\n\");\n        return 0;\n}\n", "language": "C", "metadata": {"date": 1586274142, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "problem_description_relpath": "problem_descriptions/p03729.html", "problem_id": "p03729", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03729/input.txt", "sample_output_relpath": "derived/input_output/data/p03729/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03729/C/s838282501.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s838282501", "user_id": "u708130429"}, "prompt_components": {"gold_output": "YES\n", "input_to_evaluate": "#include<stdio.h>\n#include<string.h>\nint main(void)\n{\n        int x, y;\n        char A[12], B[12], C[12];\n        scanf(\"%s%s%s\", A, B, C);\n\n        x = strlen(A);\n        y = strlen(B);\n\n        if((A[x-1] == B[0])&&(B[y-1] == C[0]))\n                printf(\"Yes\\n\");\n        else printf(\"No\\n\");\n        return 0;\n}\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou are given three strings A, B and C. Check whether they form a word chain.\n\nMore formally, determine whether both of the following are true:\n\nThe last character in A and the initial character in B are the same.\n\nThe last character in B and the initial character in C are the same.\n\nIf both are true, print YES. Otherwise, print NO.\n\nConstraints\n\nA, B and C are all composed of lowercase English letters (a - z).\n\n1 ≤ |A|, |B|, |C| ≤ 10, where |A|, |B| and |C| are the lengths of A, B and C, respectively.\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\nrng gorilla apple\n\nSample Output 1\n\nYES\n\nThey form a word chain.\n\nSample Input 2\n\nyakiniku unagi sushi\n\nSample Output 2\n\nNO\n\nA and B form a word chain, but B and C do not.\n\nSample Input 3\n\na a a\n\nSample Output 3\n\nYES\n\nSample Input 4\n\naaaaaaaaab aaaaaaaaaa aaaaaaaaab\n\nSample Output 4\n\nNO", "sample_input": "rng gorilla apple\n"}, "reference_outputs": ["YES\n"], "source_document_id": "p03729", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou are given three strings A, B and C. Check whether they form a word chain.\n\nMore formally, determine whether both of the following are true:\n\nThe last character in A and the initial character in B are the same.\n\nThe last character in B and the initial character in C are the same.\n\nIf both are true, print YES. Otherwise, print NO.\n\nConstraints\n\nA, B and C are all composed of lowercase English letters (a - z).\n\n1 ≤ |A|, |B|, |C| ≤ 10, where |A|, |B| and |C| are the lengths of A, B and C, respectively.\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\nrng gorilla apple\n\nSample Output 1\n\nYES\n\nThey form a word chain.\n\nSample Input 2\n\nyakiniku unagi sushi\n\nSample Output 2\n\nNO\n\nA and B form a word chain, but B and C do not.\n\nSample Input 3\n\na a a\n\nSample Output 3\n\nYES\n\nSample Input 4\n\naaaaaaaaab aaaaaaaaaa aaaaaaaaab\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": 317, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s042388472", "group_id": "codeNet:p03730", "input_text": "#include<stdio.h>\n\nint main(){\n  int a,b,c,i,k=0;\n  scanf(\"%d %d %d\",&a,&b,&c);\n  for(i=1;i<=100;i++){\n      if((b*i+c)%a==0){\n        printf(\"YES\");\n        k++;\n        break;\n      }\n  }\n  if(k==0)\n    printf(\"NO\");\n}", "language": "C", "metadata": {"date": 1587922661, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "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/C/s042388472.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s042388472", "user_id": "u078833963"}, "prompt_components": {"gold_output": "YES\n", "input_to_evaluate": "#include<stdio.h>\n\nint main(){\n  int a,b,c,i,k=0;\n  scanf(\"%d %d %d\",&a,&b,&c);\n  for(i=1;i<=100;i++){\n      if((b*i+c)%a==0){\n        printf(\"YES\");\n        k++;\n        break;\n      }\n  }\n  if(k==0)\n    printf(\"NO\");\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": 220, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s305464707", "group_id": "codeNet:p03730", "input_text": "#include<stdio.h>\nint main(){\n  int A,B,C,sum=0;\n  scanf(\"%d %d %d\",&A,&B,&C);\n  for(int i=1;i<B;i++){\n    if((A*i)%B==C){\n      printf(\"Yes\");\n      return 0;\n    }\n  }\n  printf(\"No\");\n}", "language": "C", "metadata": {"date": 1585452988, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "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/C/s305464707.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s305464707", "user_id": "u600480888"}, "prompt_components": {"gold_output": "YES\n", "input_to_evaluate": "#include<stdio.h>\nint main(){\n  int A,B,C,sum=0;\n  scanf(\"%d %d %d\",&A,&B,&C);\n  for(int i=1;i<B;i++){\n    if((A*i)%B==C){\n      printf(\"Yes\");\n      return 0;\n    }\n  }\n  printf(\"No\");\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": 187, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s665492523", "group_id": "codeNet:p03730", "input_text": "#include <stdio.h>\n#include <stdlib.h>\n#include <string.h>\n#define ll long long\n#define rep(i,l,r)for(ll i=(l);i<(r);i++)\n#define max(p,q)((p)>(q)?(p):(q))\n#define min(p,q)((p)<(q)?(p):(q))\nll gcd(ll p,ll q){for(ll t;q;)t=p%q,p=q,q=t;return p;}\n\nint main(){\n\tll a,b,c;\n\tscanf(\"%lld%lld%lld\",&a,&b,&c);\n\tputs(c%gcd(a,b)==0?\"YES\":\"NO\");\n}", "language": "C", "metadata": {"date": 1546286840, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "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/C/s665492523.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s665492523", "user_id": "u382163500"}, "prompt_components": {"gold_output": "YES\n", "input_to_evaluate": "#include <stdio.h>\n#include <stdlib.h>\n#include <string.h>\n#define ll long long\n#define rep(i,l,r)for(ll i=(l);i<(r);i++)\n#define max(p,q)((p)>(q)?(p):(q))\n#define min(p,q)((p)<(q)?(p):(q))\nll gcd(ll p,ll q){for(ll t;q;)t=p%q,p=q,q=t;return p;}\n\nint main(){\n\tll a,b,c;\n\tscanf(\"%lld%lld%lld\",&a,&b,&c);\n\tputs(c%gcd(a,b)==0?\"YES\":\"NO\");\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": 336, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s159689070", "group_id": "codeNet:p03731", "input_text": "    #include <stdio.h>\n     \n    int main(void){\n        long long int n,T,sum=0;\n        long long int tn[200000];\n        long long int i,x;\n        scanf(\"%lld %lld\",&n,&T);\n        for(i=0;i<n;i++){\n            scanf(\"%lld\",&tn[i]);\n        }\n        for(i=0;i<n;i++){\n            x = tn[i+1]-tn[i];\n            if(x<T&&i!=n-1){\n            sum += x;\n            } else {\n            sum += T;\n            }\n        }\n        printf(\"%lld\\n\",sum);\n        return 0;\n    }", "language": "C", "metadata": {"date": 1499824123, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "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/C/s159689070.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s159689070", "user_id": "u217181261"}, "prompt_components": {"gold_output": "7\n", "input_to_evaluate": "    #include <stdio.h>\n     \n    int main(void){\n        long long int n,T,sum=0;\n        long long int tn[200000];\n        long long int i,x;\n        scanf(\"%lld %lld\",&n,&T);\n        for(i=0;i<n;i++){\n            scanf(\"%lld\",&tn[i]);\n        }\n        for(i=0;i<n;i++){\n            x = tn[i+1]-tn[i];\n            if(x<T&&i!=n-1){\n            sum += x;\n            } else {\n            sum += T;\n            }\n        }\n        printf(\"%lld\\n\",sum);\n        return 0;\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": 475, "cpu_time_ms": 24, "memory_kb": 1664}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s313350352", "group_id": "codeNet:p03737", "input_text": " #include <stdio.h>\n   \n   int main(void) {\n       double A, B;\n     \n       scanf(\"%lf %lf\" , &A, &B);\n\n       if(A > B) {\n          printf(\"GREATER\\n\");\n       }else if(A < B){\n          printf(\"LESS\\n\");\n       }else if(A == B){\n          printf(\"EQUAL\\n\");\n       }\n   return 0;\n}", "language": "C", "metadata": {"date": 1500325012, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "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/C/s313350352.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s313350352", "user_id": "u426506117"}, "prompt_components": {"gold_output": "ABC\n", "input_to_evaluate": " #include <stdio.h>\n   \n   int main(void) {\n       double A, B;\n     \n       scanf(\"%lf %lf\" , &A, &B);\n\n       if(A > B) {\n          printf(\"GREATER\\n\");\n       }else if(A < B){\n          printf(\"LESS\\n\");\n       }else if(A == B){\n          printf(\"EQUAL\\n\");\n       }\n   return 0;\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": 284, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s062738406", "group_id": "codeNet:p03738", "input_text": "#include <stdio.h>\n#include <string.h>\n\n\nint main(void)\n{\n\tchar a[101],b[101];\n\tscanf(\"%s%s\",a,b);\n\tint lena,lenb,len;\n\tlena=strlen(a);\n\tlenb=strlen(b);\n\tif(lena>lenb){printf(\"GREATER\");}\n\telse if(lena<lenb){printf(\"LESS\");}\n\t\t\n\tfprintf(stderr,\"A=%s\\nB=%s\\n\",a,b);\t/* case:lena=lenb */\n\tint i;\n\tif(a != b && lena==lenb)\n\t{\n\tfor(i=0;i<=lena-1;i++)\n\t\t{\n\t\tif(a[i]>b[i]){printf(\"GREATER\"); break;}\n\t\telse if(a[i]<b[i]){printf(\"LESS\"); break;}\n\t\tif(i==lena-1 && a[i]==b[i]){printf(\"EQUAL\");}\n\t\t}\n\t}\n\n\treturn 0;\n}\n\n\n\n", "language": "C", "metadata": {"date": 1550263802, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "problem_description_relpath": "problem_descriptions/p03738.html", "problem_id": "p03738", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03738/input.txt", "sample_output_relpath": "derived/input_output/data/p03738/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03738/C/s062738406.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s062738406", "user_id": "u150386598"}, "prompt_components": {"gold_output": "GREATER\n", "input_to_evaluate": "#include <stdio.h>\n#include <string.h>\n\n\nint main(void)\n{\n\tchar a[101],b[101];\n\tscanf(\"%s%s\",a,b);\n\tint lena,lenb,len;\n\tlena=strlen(a);\n\tlenb=strlen(b);\n\tif(lena>lenb){printf(\"GREATER\");}\n\telse if(lena<lenb){printf(\"LESS\");}\n\t\t\n\tfprintf(stderr,\"A=%s\\nB=%s\\n\",a,b);\t/* case:lena=lenb */\n\tint i;\n\tif(a != b && lena==lenb)\n\t{\n\tfor(i=0;i<=lena-1;i++)\n\t\t{\n\t\tif(a[i]>b[i]){printf(\"GREATER\"); break;}\n\t\telse if(a[i]<b[i]){printf(\"LESS\"); break;}\n\t\tif(i==lena-1 && a[i]==b[i]){printf(\"EQUAL\");}\n\t\t}\n\t}\n\n\treturn 0;\n}\n\n\n\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nYou are given two positive integers A and B. Compare the magnitudes of these numbers.\n\nConstraints\n\n1 ≤ A, B ≤ 10^{100}\n\nNeither A nor B begins with a 0.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA\nB\n\nOutput\n\nPrint GREATER if A>B, LESS if A<B and EQUAL if A=B.\n\nSample Input 1\n\n36\n24\n\nSample Output 1\n\nGREATER\n\nSince 36>24, print GREATER.\n\nSample Input 2\n\n850\n3777\n\nSample Output 2\n\nLESS\n\nSample Input 3\n\n9720246\n22516266\n\nSample Output 3\n\nLESS\n\nSample Input 4\n\n123456789012345678901234567890\n234567890123456789012345678901\n\nSample Output 4\n\nLESS", "sample_input": "36\n24\n"}, "reference_outputs": ["GREATER\n"], "source_document_id": "p03738", "source_text": "Score : 200 points\n\nProblem Statement\n\nYou are given two positive integers A and B. Compare the magnitudes of these numbers.\n\nConstraints\n\n1 ≤ A, B ≤ 10^{100}\n\nNeither A nor B begins with a 0.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA\nB\n\nOutput\n\nPrint GREATER if A>B, LESS if A<B and EQUAL if A=B.\n\nSample Input 1\n\n36\n24\n\nSample Output 1\n\nGREATER\n\nSince 36>24, print GREATER.\n\nSample Input 2\n\n850\n3777\n\nSample Output 2\n\nLESS\n\nSample Input 3\n\n9720246\n22516266\n\nSample Output 3\n\nLESS\n\nSample Input 4\n\n123456789012345678901234567890\n234567890123456789012345678901\n\nSample Output 4\n\nLESS", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 511, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s933149662", "group_id": "codeNet:p03738", "input_text": "    #include <stdio.h>\n    #include <stdlib.h>\n    #include <math.h>\n    #include <string.h>\n     \n    int in(void){\n    \tint i;scanf(\"%d\",&i);\n    \treturn i;\n    }\n    long long llin(void){\n    \tlong long i;scanf(\"%lld\",&i);\n    \treturn i;\n    }\n    void print(int a){\n    \tprintf(\"%d\\n\",a);\n    }\n    void llprint(long long a){\n    \tprintf(\"%lld\\n\",a);\n    }\n    void print2(int a,int b){\n    \tprintf(\"%d %d\\n\",a,b);\n    }\n    long long max(long long a,long long b){\n    \treturn a>b?a:b;\n    }\n    long long min(long long a,long long b){\n    \treturn a<b?a:b;\n    }\n     \n    int main(void){\n    \tchar a[102],b[102];\n    \tscanf(\"%s\",a);\n    \tscanf(\"%s\",b);\n    \tif(strlen(a)!=strlen(b)){\n    \t\tputs(strlen(a)>strlen(b)?\"GREATER\":\"LESS\");\n    \t}\n    \telse{\n    \t\tint i;\n    \t\tfor(i=0;i<strlen(a);i++){\n    \t\t\tif(a[i]!=b[i]){\n    \t\t\t\tputs(a[i]>b[i]?\"GREATER\":\"LESS\");\n    \t\t\t\tbreak;\n    \t\t\t}\n    \t\t}if(i==strlen(a))puts(\"EQUAL\");\n    \t}\n    \treturn 0;\n    }", "language": "C", "metadata": {"date": 1492912141, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "problem_description_relpath": "problem_descriptions/p03738.html", "problem_id": "p03738", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03738/input.txt", "sample_output_relpath": "derived/input_output/data/p03738/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03738/C/s933149662.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s933149662", "user_id": "u128527648"}, "prompt_components": {"gold_output": "GREATER\n", "input_to_evaluate": "    #include <stdio.h>\n    #include <stdlib.h>\n    #include <math.h>\n    #include <string.h>\n     \n    int in(void){\n    \tint i;scanf(\"%d\",&i);\n    \treturn i;\n    }\n    long long llin(void){\n    \tlong long i;scanf(\"%lld\",&i);\n    \treturn i;\n    }\n    void print(int a){\n    \tprintf(\"%d\\n\",a);\n    }\n    void llprint(long long a){\n    \tprintf(\"%lld\\n\",a);\n    }\n    void print2(int a,int b){\n    \tprintf(\"%d %d\\n\",a,b);\n    }\n    long long max(long long a,long long b){\n    \treturn a>b?a:b;\n    }\n    long long min(long long a,long long b){\n    \treturn a<b?a:b;\n    }\n     \n    int main(void){\n    \tchar a[102],b[102];\n    \tscanf(\"%s\",a);\n    \tscanf(\"%s\",b);\n    \tif(strlen(a)!=strlen(b)){\n    \t\tputs(strlen(a)>strlen(b)?\"GREATER\":\"LESS\");\n    \t}\n    \telse{\n    \t\tint i;\n    \t\tfor(i=0;i<strlen(a);i++){\n    \t\t\tif(a[i]!=b[i]){\n    \t\t\t\tputs(a[i]>b[i]?\"GREATER\":\"LESS\");\n    \t\t\t\tbreak;\n    \t\t\t}\n    \t\t}if(i==strlen(a))puts(\"EQUAL\");\n    \t}\n    \treturn 0;\n    }", "problem_context": "Score : 200 points\n\nProblem Statement\n\nYou are given two positive integers A and B. Compare the magnitudes of these numbers.\n\nConstraints\n\n1 ≤ A, B ≤ 10^{100}\n\nNeither A nor B begins with a 0.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA\nB\n\nOutput\n\nPrint GREATER if A>B, LESS if A<B and EQUAL if A=B.\n\nSample Input 1\n\n36\n24\n\nSample Output 1\n\nGREATER\n\nSince 36>24, print GREATER.\n\nSample Input 2\n\n850\n3777\n\nSample Output 2\n\nLESS\n\nSample Input 3\n\n9720246\n22516266\n\nSample Output 3\n\nLESS\n\nSample Input 4\n\n123456789012345678901234567890\n234567890123456789012345678901\n\nSample Output 4\n\nLESS", "sample_input": "36\n24\n"}, "reference_outputs": ["GREATER\n"], "source_document_id": "p03738", "source_text": "Score : 200 points\n\nProblem Statement\n\nYou are given two positive integers A and B. Compare the magnitudes of these numbers.\n\nConstraints\n\n1 ≤ A, B ≤ 10^{100}\n\nNeither A nor B begins with a 0.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA\nB\n\nOutput\n\nPrint GREATER if A>B, LESS if A<B and EQUAL if A=B.\n\nSample Input 1\n\n36\n24\n\nSample Output 1\n\nGREATER\n\nSince 36>24, print GREATER.\n\nSample Input 2\n\n850\n3777\n\nSample Output 2\n\nLESS\n\nSample Input 3\n\n9720246\n22516266\n\nSample Output 3\n\nLESS\n\nSample Input 4\n\n123456789012345678901234567890\n234567890123456789012345678901\n\nSample Output 4\n\nLESS", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s441159680", "group_id": "codeNet:p03746", "input_text": "#include<stdio.h>\n#include<stdlib.h>\n#define ll long long\n#define rep(i,l,r)for(ll i=(l);i<(r);i++)\n\ntypedef struct edge{ll s,g;}E;\nE e[200010];\nint vnow[100010];\nint epre[200010];\n\nint check[100010];\nint path1[100010],path2[100010];\n\nint main(){\n\tint n,m;\n\tscanf(\"%d%d\",&n,&m);\n\trep(i,0,n)vnow[i]=-1;\n\t\n\trep(i,0,m){\n\t\tint a,b;\n\t\tscanf(\"%d%d\",&a,&b);\n\t\ta--;b--;\n\t\te[2*i].s=a;\n\t\te[2*i].g=b;\n\t\tepre[2*i]=vnow[a];\n\t\tvnow[a]=2*i;\n\t\t\n\t\te[2*i+1].s=b;\n\t\te[2*i+1].g=a;\n\t\tepre[2*i+1]=vnow[b];\n\t\tvnow[b]=2*i+1;\n\t}\n\t\n\tint p1cnt=1;\n\tpath1[0]=0;\n\tcheck[0]=1;\n\tint flag=1;\n\twhile(flag){\n\t\tflag=0;\n\t\tfor(int t=vnow[path1[p1cnt-1]];t!=-1;t=epre[t])if(!check[e[t].g]){\n\t\t\tflag=1;\n\t\t\tpath1[p1cnt++]=e[t].g;\n\t\t\tcheck[e[t].g]=1;\n\t\t\tbreak;\n\t\t}\n\t}\n\n\tint p2cnt=1;\n\tpath2[0]=0;\n\tflag=1;\n\twhile(flag){\n\t\tflag=0;\n\t\tfor(int t=vnow[path2[p2cnt-1]];t!=-1;t=epre[t])if(!check[e[t].g]){\n\t\t\tflag=1;\n\t\t\tpath2[p2cnt++]=e[t].g;\n\t\t\tcheck[e[t].g]=1;\n\t\t\tbreak;\n\t\t}\n\t}\n\t\n\tprintf(\"%d\\n\",p1cnt+p2cnt-1);\n\tfor(int i=p2cnt-1;i>=0;i--)printf(\"%d \",path2[i]+1);\n\trep(i,1,p1cnt)printf(\"%d \",path1[i]+1);\n\treturn 0;\n}", "language": "C", "metadata": {"date": 1522363705, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "problem_description_relpath": "problem_descriptions/p03746.html", "problem_id": "p03746", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03746/input.txt", "sample_output_relpath": "derived/input_output/data/p03746/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03746/C/s441159680.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s441159680", "user_id": "u382163500"}, "prompt_components": {"gold_output": "4\n2 3 1 4\n", "input_to_evaluate": "#include<stdio.h>\n#include<stdlib.h>\n#define ll long long\n#define rep(i,l,r)for(ll i=(l);i<(r);i++)\n\ntypedef struct edge{ll s,g;}E;\nE e[200010];\nint vnow[100010];\nint epre[200010];\n\nint check[100010];\nint path1[100010],path2[100010];\n\nint main(){\n\tint n,m;\n\tscanf(\"%d%d\",&n,&m);\n\trep(i,0,n)vnow[i]=-1;\n\t\n\trep(i,0,m){\n\t\tint a,b;\n\t\tscanf(\"%d%d\",&a,&b);\n\t\ta--;b--;\n\t\te[2*i].s=a;\n\t\te[2*i].g=b;\n\t\tepre[2*i]=vnow[a];\n\t\tvnow[a]=2*i;\n\t\t\n\t\te[2*i+1].s=b;\n\t\te[2*i+1].g=a;\n\t\tepre[2*i+1]=vnow[b];\n\t\tvnow[b]=2*i+1;\n\t}\n\t\n\tint p1cnt=1;\n\tpath1[0]=0;\n\tcheck[0]=1;\n\tint flag=1;\n\twhile(flag){\n\t\tflag=0;\n\t\tfor(int t=vnow[path1[p1cnt-1]];t!=-1;t=epre[t])if(!check[e[t].g]){\n\t\t\tflag=1;\n\t\t\tpath1[p1cnt++]=e[t].g;\n\t\t\tcheck[e[t].g]=1;\n\t\t\tbreak;\n\t\t}\n\t}\n\n\tint p2cnt=1;\n\tpath2[0]=0;\n\tflag=1;\n\twhile(flag){\n\t\tflag=0;\n\t\tfor(int t=vnow[path2[p2cnt-1]];t!=-1;t=epre[t])if(!check[e[t].g]){\n\t\t\tflag=1;\n\t\t\tpath2[p2cnt++]=e[t].g;\n\t\t\tcheck[e[t].g]=1;\n\t\t\tbreak;\n\t\t}\n\t}\n\t\n\tprintf(\"%d\\n\",p1cnt+p2cnt-1);\n\tfor(int i=p2cnt-1;i>=0;i--)printf(\"%d \",path2[i]+1);\n\trep(i,1,p1cnt)printf(\"%d \",path1[i]+1);\n\treturn 0;\n}", "problem_context": "Score : 500 points\n\nProblem Statement\n\nYou are given a connected undirected simple graph, which has N vertices and M edges.\nThe vertices are numbered 1 through N, and the edges are numbered 1 through M.\nEdge i connects vertices A_i and B_i.\nYour task is to find a path that satisfies the following conditions:\n\nThe path traverses two or more vertices.\n\nThe path does not traverse the same vertex more than once.\n\nA vertex directly connected to at least one of the endpoints of the path, is always contained in the path.\n\nIt can be proved that such a path always exists.\nAlso, if there are more than one solution, any of them will be accepted.\n\nConstraints\n\n2 \\leq N \\leq 10^5\n\n1 \\leq M \\leq 10^5\n\n1 \\leq A_i < B_i \\leq N\n\nThe given graph is connected and simple (that is, for every pair of vertices, there is at most one edge that directly connects them).\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\nFind one path that satisfies the conditions, and print it in the following format.\nIn the first line, print the count of the vertices contained in the path.\nIn the second line, print a space-separated list of the indices of the vertices, in order of appearance in the path.\n\nSample Input 1\n\n5 6\n1 3\n1 4\n2 3\n1 5\n3 5\n2 4\n\nSample Output 1\n\n4\n2 3 1 4\n\nThere are two vertices directly connected to vertex 2: vertices 3 and 4.\nThere are also two vertices directly connected to vertex 4: vertices 1 and 2.\nHence, the path 2 → 3 → 1 → 4 satisfies the conditions.\n\nSample Input 2\n\n7 8\n1 2\n2 3\n3 4\n4 5\n5 6\n6 7\n3 5\n2 6\n\nSample Output 2\n\n7\n1 2 3 4 5 6 7", "sample_input": "5 6\n1 3\n1 4\n2 3\n1 5\n3 5\n2 4\n"}, "reference_outputs": ["4\n2 3 1 4\n"], "source_document_id": "p03746", "source_text": "Score : 500 points\n\nProblem Statement\n\nYou are given a connected undirected simple graph, which has N vertices and M edges.\nThe vertices are numbered 1 through N, and the edges are numbered 1 through M.\nEdge i connects vertices A_i and B_i.\nYour task is to find a path that satisfies the following conditions:\n\nThe path traverses two or more vertices.\n\nThe path does not traverse the same vertex more than once.\n\nA vertex directly connected to at least one of the endpoints of the path, is always contained in the path.\n\nIt can be proved that such a path always exists.\nAlso, if there are more than one solution, any of them will be accepted.\n\nConstraints\n\n2 \\leq N \\leq 10^5\n\n1 \\leq M \\leq 10^5\n\n1 \\leq A_i < B_i \\leq N\n\nThe given graph is connected and simple (that is, for every pair of vertices, there is at most one edge that directly connects them).\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\nFind one path that satisfies the conditions, and print it in the following format.\nIn the first line, print the count of the vertices contained in the path.\nIn the second line, print a space-separated list of the indices of the vertices, in order of appearance in the path.\n\nSample Input 1\n\n5 6\n1 3\n1 4\n2 3\n1 5\n3 5\n2 4\n\nSample Output 1\n\n4\n2 3 1 4\n\nThere are two vertices directly connected to vertex 2: vertices 3 and 4.\nThere are also two vertices directly connected to vertex 4: vertices 1 and 2.\nHence, the path 2 → 3 → 1 → 4 satisfies the conditions.\n\nSample Input 2\n\n7 8\n1 2\n2 3\n3 4\n4 5\n5 6\n6 7\n3 5\n2 6\n\nSample Output 2\n\n7\n1 2 3 4 5 6 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": 1070, "cpu_time_ms": 32, "memory_kb": 5760}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s700582465", "group_id": "codeNet:p03760", "input_text": "#include <stdio.h>\n#include <string.h>\nint main(){\nchar O[50], E[50];\nscanf(\"%s\", O);\nscanf(\"%s\", E);\n \n \nint i;\n \nfor(i=0;i<strlen(O);i++)\nprintf(\"%c%c\", O[i], E[i]);\n \nreturn 0;\n \n}", "language": "C", "metadata": {"date": 1496844441, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "problem_description_relpath": "problem_descriptions/p03760.html", "problem_id": "p03760", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03760/input.txt", "sample_output_relpath": "derived/input_output/data/p03760/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03760/C/s700582465.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s700582465", "user_id": "u554720358"}, "prompt_components": {"gold_output": "xaybzc\n", "input_to_evaluate": "#include <stdio.h>\n#include <string.h>\nint main(){\nchar O[50], E[50];\nscanf(\"%s\", O);\nscanf(\"%s\", E);\n \n \nint i;\n \nfor(i=0;i<strlen(O);i++)\nprintf(\"%c%c\", O[i], E[i]);\n \nreturn 0;\n \n}", "problem_context": "Score : 200 points\n\nProblem Statement\n\nSnuke signed up for a new website which holds programming competitions.\nHe worried that he might forget his password, and he took notes of it.\nSince directly recording his password would cause him trouble if stolen,\nhe took two notes: one contains the characters at the odd-numbered positions, and the other contains the characters at the even-numbered positions.\n\nYou are given two strings O and E. O contains the characters at the odd-numbered positions retaining their relative order, and E contains the characters at the even-numbered positions retaining their relative order.\nRestore the original password.\n\nConstraints\n\nO and E consists of lowercase English letters (a - z).\n\n1 \\leq |O|,|E| \\leq 50\n\n|O| - |E| is either 0 or 1.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nO\nE\n\nOutput\n\nPrint the original password.\n\nSample Input 1\n\nxyz\nabc\n\nSample Output 1\n\nxaybzc\n\nThe original password is xaybzc. Extracting the characters at the odd-numbered positions results in xyz, and extracting the characters at the even-numbered positions results in abc.\n\nSample Input 2\n\natcoderbeginnercontest\natcoderregularcontest\n\nSample Output 2\n\naattccooddeerrbreeggiunlnaerrccoonntteesstt", "sample_input": "xyz\nabc\n"}, "reference_outputs": ["xaybzc\n"], "source_document_id": "p03760", "source_text": "Score : 200 points\n\nProblem Statement\n\nSnuke signed up for a new website which holds programming competitions.\nHe worried that he might forget his password, and he took notes of it.\nSince directly recording his password would cause him trouble if stolen,\nhe took two notes: one contains the characters at the odd-numbered positions, and the other contains the characters at the even-numbered positions.\n\nYou are given two strings O and E. O contains the characters at the odd-numbered positions retaining their relative order, and E contains the characters at the even-numbered positions retaining their relative order.\nRestore the original password.\n\nConstraints\n\nO and E consists of lowercase English letters (a - z).\n\n1 \\leq |O|,|E| \\leq 50\n\n|O| - |E| is either 0 or 1.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nO\nE\n\nOutput\n\nPrint the original password.\n\nSample Input 1\n\nxyz\nabc\n\nSample Output 1\n\nxaybzc\n\nThe original password is xaybzc. Extracting the characters at the odd-numbered positions results in xyz, and extracting the characters at the even-numbered positions results in abc.\n\nSample Input 2\n\natcoderbeginnercontest\natcoderregularcontest\n\nSample Output 2\n\naattccooddeerrbreeggiunlnaerrccoonntteesstt", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 183, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s135109027", "group_id": "codeNet:p03774", "input_text": "#include<stdio.h>\n\nint ab(int x){\n\tif(x<0)return -x;\n\treturn x;\n}\n\n\nint main(){\n\tint N,M,i,j;\n\tscanf(\"%d%d\",&N,&M);\n\tint a[N],b[N],c[M],d[M];\n\tfor(i=0;i<N;i++)scanf(\"%d%d\",&a[i],&b[i]);\n\tfor(i=0;i<M;i++)scanf(\"%d%d\",&c[i],&d[i]);\n\tfor(i=0;i<N;i++){\n\t\tint dist;\n\t\tint min=1000000000;\n\t\tint minj;\n\t\tfor(j=0;j<M;j++){\n\t\t\tdist=ab(a[i]-c[j])+ab(b[i]-d[j]);\n\t\t\tif(dist<min){\n\t\t\t\tmin=dist;\n\t\t\t\tminj=j;\n\t\t\t}\n\t\t}\n\t\tprintf(\"%d\\n\",minj+1);\n\t}\t\n\treturn 0;\n}", "language": "C", "metadata": {"date": 1541629395, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "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/C/s135109027.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s135109027", "user_id": "u573082373"}, "prompt_components": {"gold_output": "2\n1\n", "input_to_evaluate": "#include<stdio.h>\n\nint ab(int x){\n\tif(x<0)return -x;\n\treturn x;\n}\n\n\nint main(){\n\tint N,M,i,j;\n\tscanf(\"%d%d\",&N,&M);\n\tint a[N],b[N],c[M],d[M];\n\tfor(i=0;i<N;i++)scanf(\"%d%d\",&a[i],&b[i]);\n\tfor(i=0;i<M;i++)scanf(\"%d%d\",&c[i],&d[i]);\n\tfor(i=0;i<N;i++){\n\t\tint dist;\n\t\tint min=1000000000;\n\t\tint minj;\n\t\tfor(j=0;j<M;j++){\n\t\t\tdist=ab(a[i]-c[j])+ab(b[i]-d[j]);\n\t\t\tif(dist<min){\n\t\t\t\tmin=dist;\n\t\t\t\tminj=j;\n\t\t\t}\n\t\t}\n\t\tprintf(\"%d\\n\",minj+1);\n\t}\t\n\treturn 0;\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": 445, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s965290592", "group_id": "codeNet:p03776", "input_text": "#include <stdio.h>\n#include <string.h>\n#include <stdlib.h>\n#include <math.h>\n#include <stdlib.h>\n#include <stdbool.h>\n#define MOD 1000000007\n#define END printf(\"\\n\");return 0;\nvoid input_array(long how_data,long *data);\nvoid input_array2(int first , int second , int data[][2]);\nint get_random(int min, int max);\nlong factorial(long n);\nint fibonacci(int n);\nint qsort_09(const int *sys1 , const int *sys2);\nlong qsort_90(const int *sys1 , const int *sys2);\nint sel_max(int a , int b);\nint sel_min(int a , int b);\nint array_max(int how_data,int *data);\nint array_min(int how_data,int *data);\nint can_DP(int how_data,int *data,int how_can,bool *can);\nint array_sum(int how_data,int *data);\nint Leven_dist(char *now , char *target);\nvoid prime_fact(int target, int *data);\nint get_digit(int target);\nlong ncr(long n , long r);\nint loop1,loop2,loop3,loop4,loop5,i_temp;\nchar c_temp;\n\nint main(void){\n    int n,a,b;\n    scanf(\"%d %d %d\",&n,&a,&b);\n    long data[n];\n    input_array(n,data);\n    qsort(data,n,sizeof(long),(int (*)(const void *,const void *))qsort_90);\n    //大きい順にsort\n    //上位A個の平均が最大の平均とできる\n    //A+1個めが、A個目より小さかったら組み合わせ数は「1」で確定\n    long double ave_max=0.00;\n    for(loop1=0;loop1<a;loop1++){\n        ave_max+=data[loop1];\n    }\n    ave_max/=a;\n    printf(\"%.6Lf\\n\",ave_max);\n    if(a!=n && data[a-1]>data[a]){\n        printf(\"1\\n\");\n        return 0;\n    }\n    //A個めと同じ大きさのデータが複数(といってもBまでが限界)あるとめんどい\n    if(data[0]!=data[a-1]){//この場合はA個確定\n        //data[a-1]と同じデータがいくつある？\n        long how_a_sub_1_n=0;\n        long how_a_sub_1_r=0;\n        for(loop1=0;loop1<n;loop1++){\n            if(data[loop1]==data[a-1]){\n                how_a_sub_1_n++;\n                if(loop1<a){\n                    how_a_sub_1_r++;\n                }\n            }\n        }\n        printf(\"%ld\\n\",ncr(how_a_sub_1_n,how_a_sub_1_r));\n        return 0;\n    }else if(data[0]==data[a-1]){\n        //同値であれば、Bまでいける\n        long ans=0;\n        int how_douti=0;\n        for(loop1=0;loop1<n;loop1++){\n            if(data[0]==data[loop1]){\n                how_douti++;\n            }\n        }\n        //printf(\"%d\\n\",how_douti);\n        for(loop1=a;loop1<=(sel_min(b,how_douti));loop1++){\n            ans+=(ncr(how_douti,loop1));\n            //printf(\"%d c %d = %ld\\n\",how_douti,loop1,ans);\n        }\n        printf(\"%ld\\n\",ans);\n        return 0;\n    }\n    \n}\n\n\n//how_data個の配列data[]に標準入力\n//input_array(how_data,data);\nvoid input_array(long how_data,long *data){\n    long loop;\n    for(loop=0;loop<how_data;loop++){\n        scanf(\"%ld\",&data[loop]);\n    }\n    return ;\n}\n\nvoid input_array2(int first,int second,int data[][2]){\n    int loopA,loopB;\n    for(loopA=0;loopA<first;loopA++){\n        for(loopB=0;loopB<second;loopB++){\n            scanf(\"%d\",&data[loopA][loopB]);\n        }\n    }\n    return ;\n}\n\nint get_random(int min, int max){   //指定の範囲から乱数を1つ返すやつ\n    //srand((unsigned int)time(0));   //現在時刻で疑似乱数初期化\n    rand();rand();rand();rand();    //乱数を空打ち\n    return (rand()%(max+1-min))+min;\n}\n\n\nlong factorial(long n){//n!のMOD10^9+7を返すやつ\n    unsigned long long int ret=1;\n    for(int i=1;i<=n;i++)ret=(ret*i)%1000000007;\n    return (long)ret;\n}\n\nint qsort_09(const int *sys1 , const int *sys2){ //小さいのが上にくるやつ\n    //qsort(data,how_data,sizeof(int),(int (*)(const void *,const void *))qsort_09);\n    if(*sys1<*sys2){\n        return -1;\n    }else if(*sys1==*sys2){\n        return 0;\n    }else{\n        return 1;\n    }\n}\n\nlong qsort_90(const int *sys1 , const int *sys2){ //大きいのが上にくるやつ\n    //qsort(data,how_data,sizeof(int),(int (*)(const void *,const void *))qsort_90);\n    if(*sys1<*sys2){\n        return 1;\n    }else if(*sys1==*sys2){\n        return 0;\n    }else{\n        return -1;\n    }\n}\n\nint fibonacci(int n){\n    switch(n){\n        case 0:return 0;\n        case 1:return 1;\n        default :return fibonacci(n-1)+fibonacci(n-2);\n    }\n}\n\nint sel_max(int a,int b){\n    if(a>b)return a;\n    return b;\n}\n\nint sel_min(int a,int b){\n    if(a>b)return b;\n    return a;\n}\n\nint can_DP(int how_data,int *data,int how_can,bool *can){//Typical DP Contest A\n    //data内で組み合わせられる和をcanに0 or 1で入れる\n    //返り値はパターン数\n    int loopA,loopB;\n    int ret=0;\n    for(loopA=0;loopA<how_can;loopA++){//初期化\n        can[loopA]=0;\n    }\n    can[0]=1;//絶対にありえる\n    for(loopA=0;loopA<how_data;loopA++){\n        for(loopB=how_can-1;loopB>=0;loopB--){\n            if(can[loopB]==1 && loopB+data[loopA]<how_can){\n                can[loopB+data[loopA]]=1;\n            }\n        }\n    }\n    for(loopA=0;loopA<how_can;loopA++){\n        if(can[loopA]==1){\n            ret++;\n        }\n    }\n    return ret;\n}\nint array_max(int how_data,int *data){\n    int loop;\n    int ret=data[0];\n    for(loop=0;loop<how_data;loop++){\n        if(ret<data[loop])ret=data[loop];\n    }\n    return ret;\n}\nint array_min(int how_data,int *data){\n    int loop;\n    int ret=data[0];\n    for(loop=0;loop<how_data;loop++){\n        if(ret>data[loop])ret=data[loop];\n    }\n    return ret;\n}\nint array_sum(int how_data,int *data){\n    int ret=0;\n    int loop;\n    for(loop=0;loop<how_data;loop++){\n        ret+=data[loop];\n    }\n    return ret;\n}\nint Leven_dist(char *now , char *target){\n    int loopA,loopB;\n    //レーベンシュタイン距離を求める\n    // 参考文献\n    // http://nw.tsuda.ac.jp/class/algoB/c13.html  (アルゴリズム理解)\n    // http://d.hatena.ne.jp/ohnishiakira/20090809/1249845529  (実装)\n    int len_now=strlen(now)+1;\n    int len_target=strlen(target)+1;\n    int d[len_now][len_target]; //計算用\n    for(loopA=0;loopA<len_now;loopA++) d[loopA][0]=loopA;\n    for(loopA=0;loopA<len_target;loopA++) d[0][loopA]=loopA;\n    for(loopA=1;loopA<len_now;loopA++){\n        for(loopB=1;loopB<len_target;loopB++){\n            int cost=(now[loopA-1]==target[loopB-1] ? 0:1);\n            d[loopA][loopB]=sel_min(sel_min(d[loopA-1][loopB]+1,d[loopA][loopB-1]+1),d[loopA-1][loopB-1]+cost);\n        }\n    }\n    return d[len_now-1][len_target-1];\n}\nvoid prime_fact(int target, int *data){\n    int loopB=0;\n    int loopA=2;\n    long moto_target=target;\n    while(target!=1){\n        loopA-=1;\n        while(1){\n            loopA++;\n            if(loopA>=sqrt(moto_target)+100){\n                data[loopB]=target;\n                target=1;\n                break;\n            }\n            if(target%loopA==0){\n                data[loopB]=loopA;\n                target/=loopA;\n                loopB++;\n                break;\n            }\n        }\n    }\n    return ;\n}\nint get_digit(int target){\n    return (int)(log10(target)+1);\n}\nlong ncr(long n , long r){\n    //パスカルの三角形\n    int loopA,loopB;\n    long pascal[100][102]={{0}};\n    pascal[1][0]=1;\n    pascal[1][1]=1;\n    for(loopA=2;loopA<100;loopA++){\n        pascal[loopA][0]=1;\n        for(loopB=1;loopB<loopA;loopB++){\n            pascal[loopA][loopB]=pascal[loopA-1][loopB-1]+pascal[loopA-1][loopB];\n        }\n        pascal[loopA][loopA]=1;\n    }\n    return pascal[n][r];\n}\n\n\n\n\n\n", "language": "C", "metadata": {"date": 1490656022, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "problem_description_relpath": "problem_descriptions/p03776.html", "problem_id": "p03776", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03776/input.txt", "sample_output_relpath": "derived/input_output/data/p03776/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03776/C/s965290592.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s965290592", "user_id": "u926548116"}, "prompt_components": {"gold_output": "4.500000\n1\n", "input_to_evaluate": "#include <stdio.h>\n#include <string.h>\n#include <stdlib.h>\n#include <math.h>\n#include <stdlib.h>\n#include <stdbool.h>\n#define MOD 1000000007\n#define END printf(\"\\n\");return 0;\nvoid input_array(long how_data,long *data);\nvoid input_array2(int first , int second , int data[][2]);\nint get_random(int min, int max);\nlong factorial(long n);\nint fibonacci(int n);\nint qsort_09(const int *sys1 , const int *sys2);\nlong qsort_90(const int *sys1 , const int *sys2);\nint sel_max(int a , int b);\nint sel_min(int a , int b);\nint array_max(int how_data,int *data);\nint array_min(int how_data,int *data);\nint can_DP(int how_data,int *data,int how_can,bool *can);\nint array_sum(int how_data,int *data);\nint Leven_dist(char *now , char *target);\nvoid prime_fact(int target, int *data);\nint get_digit(int target);\nlong ncr(long n , long r);\nint loop1,loop2,loop3,loop4,loop5,i_temp;\nchar c_temp;\n\nint main(void){\n    int n,a,b;\n    scanf(\"%d %d %d\",&n,&a,&b);\n    long data[n];\n    input_array(n,data);\n    qsort(data,n,sizeof(long),(int (*)(const void *,const void *))qsort_90);\n    //大きい順にsort\n    //上位A個の平均が最大の平均とできる\n    //A+1個めが、A個目より小さかったら組み合わせ数は「1」で確定\n    long double ave_max=0.00;\n    for(loop1=0;loop1<a;loop1++){\n        ave_max+=data[loop1];\n    }\n    ave_max/=a;\n    printf(\"%.6Lf\\n\",ave_max);\n    if(a!=n && data[a-1]>data[a]){\n        printf(\"1\\n\");\n        return 0;\n    }\n    //A個めと同じ大きさのデータが複数(といってもBまでが限界)あるとめんどい\n    if(data[0]!=data[a-1]){//この場合はA個確定\n        //data[a-1]と同じデータがいくつある？\n        long how_a_sub_1_n=0;\n        long how_a_sub_1_r=0;\n        for(loop1=0;loop1<n;loop1++){\n            if(data[loop1]==data[a-1]){\n                how_a_sub_1_n++;\n                if(loop1<a){\n                    how_a_sub_1_r++;\n                }\n            }\n        }\n        printf(\"%ld\\n\",ncr(how_a_sub_1_n,how_a_sub_1_r));\n        return 0;\n    }else if(data[0]==data[a-1]){\n        //同値であれば、Bまでいける\n        long ans=0;\n        int how_douti=0;\n        for(loop1=0;loop1<n;loop1++){\n            if(data[0]==data[loop1]){\n                how_douti++;\n            }\n        }\n        //printf(\"%d\\n\",how_douti);\n        for(loop1=a;loop1<=(sel_min(b,how_douti));loop1++){\n            ans+=(ncr(how_douti,loop1));\n            //printf(\"%d c %d = %ld\\n\",how_douti,loop1,ans);\n        }\n        printf(\"%ld\\n\",ans);\n        return 0;\n    }\n    \n}\n\n\n//how_data個の配列data[]に標準入力\n//input_array(how_data,data);\nvoid input_array(long how_data,long *data){\n    long loop;\n    for(loop=0;loop<how_data;loop++){\n        scanf(\"%ld\",&data[loop]);\n    }\n    return ;\n}\n\nvoid input_array2(int first,int second,int data[][2]){\n    int loopA,loopB;\n    for(loopA=0;loopA<first;loopA++){\n        for(loopB=0;loopB<second;loopB++){\n            scanf(\"%d\",&data[loopA][loopB]);\n        }\n    }\n    return ;\n}\n\nint get_random(int min, int max){   //指定の範囲から乱数を1つ返すやつ\n    //srand((unsigned int)time(0));   //現在時刻で疑似乱数初期化\n    rand();rand();rand();rand();    //乱数を空打ち\n    return (rand()%(max+1-min))+min;\n}\n\n\nlong factorial(long n){//n!のMOD10^9+7を返すやつ\n    unsigned long long int ret=1;\n    for(int i=1;i<=n;i++)ret=(ret*i)%1000000007;\n    return (long)ret;\n}\n\nint qsort_09(const int *sys1 , const int *sys2){ //小さいのが上にくるやつ\n    //qsort(data,how_data,sizeof(int),(int (*)(const void *,const void *))qsort_09);\n    if(*sys1<*sys2){\n        return -1;\n    }else if(*sys1==*sys2){\n        return 0;\n    }else{\n        return 1;\n    }\n}\n\nlong qsort_90(const int *sys1 , const int *sys2){ //大きいのが上にくるやつ\n    //qsort(data,how_data,sizeof(int),(int (*)(const void *,const void *))qsort_90);\n    if(*sys1<*sys2){\n        return 1;\n    }else if(*sys1==*sys2){\n        return 0;\n    }else{\n        return -1;\n    }\n}\n\nint fibonacci(int n){\n    switch(n){\n        case 0:return 0;\n        case 1:return 1;\n        default :return fibonacci(n-1)+fibonacci(n-2);\n    }\n}\n\nint sel_max(int a,int b){\n    if(a>b)return a;\n    return b;\n}\n\nint sel_min(int a,int b){\n    if(a>b)return b;\n    return a;\n}\n\nint can_DP(int how_data,int *data,int how_can,bool *can){//Typical DP Contest A\n    //data内で組み合わせられる和をcanに0 or 1で入れる\n    //返り値はパターン数\n    int loopA,loopB;\n    int ret=0;\n    for(loopA=0;loopA<how_can;loopA++){//初期化\n        can[loopA]=0;\n    }\n    can[0]=1;//絶対にありえる\n    for(loopA=0;loopA<how_data;loopA++){\n        for(loopB=how_can-1;loopB>=0;loopB--){\n            if(can[loopB]==1 && loopB+data[loopA]<how_can){\n                can[loopB+data[loopA]]=1;\n            }\n        }\n    }\n    for(loopA=0;loopA<how_can;loopA++){\n        if(can[loopA]==1){\n            ret++;\n        }\n    }\n    return ret;\n}\nint array_max(int how_data,int *data){\n    int loop;\n    int ret=data[0];\n    for(loop=0;loop<how_data;loop++){\n        if(ret<data[loop])ret=data[loop];\n    }\n    return ret;\n}\nint array_min(int how_data,int *data){\n    int loop;\n    int ret=data[0];\n    for(loop=0;loop<how_data;loop++){\n        if(ret>data[loop])ret=data[loop];\n    }\n    return ret;\n}\nint array_sum(int how_data,int *data){\n    int ret=0;\n    int loop;\n    for(loop=0;loop<how_data;loop++){\n        ret+=data[loop];\n    }\n    return ret;\n}\nint Leven_dist(char *now , char *target){\n    int loopA,loopB;\n    //レーベンシュタイン距離を求める\n    // 参考文献\n    // http://nw.tsuda.ac.jp/class/algoB/c13.html  (アルゴリズム理解)\n    // http://d.hatena.ne.jp/ohnishiakira/20090809/1249845529  (実装)\n    int len_now=strlen(now)+1;\n    int len_target=strlen(target)+1;\n    int d[len_now][len_target]; //計算用\n    for(loopA=0;loopA<len_now;loopA++) d[loopA][0]=loopA;\n    for(loopA=0;loopA<len_target;loopA++) d[0][loopA]=loopA;\n    for(loopA=1;loopA<len_now;loopA++){\n        for(loopB=1;loopB<len_target;loopB++){\n            int cost=(now[loopA-1]==target[loopB-1] ? 0:1);\n            d[loopA][loopB]=sel_min(sel_min(d[loopA-1][loopB]+1,d[loopA][loopB-1]+1),d[loopA-1][loopB-1]+cost);\n        }\n    }\n    return d[len_now-1][len_target-1];\n}\nvoid prime_fact(int target, int *data){\n    int loopB=0;\n    int loopA=2;\n    long moto_target=target;\n    while(target!=1){\n        loopA-=1;\n        while(1){\n            loopA++;\n            if(loopA>=sqrt(moto_target)+100){\n                data[loopB]=target;\n                target=1;\n                break;\n            }\n            if(target%loopA==0){\n                data[loopB]=loopA;\n                target/=loopA;\n                loopB++;\n                break;\n            }\n        }\n    }\n    return ;\n}\nint get_digit(int target){\n    return (int)(log10(target)+1);\n}\nlong ncr(long n , long r){\n    //パスカルの三角形\n    int loopA,loopB;\n    long pascal[100][102]={{0}};\n    pascal[1][0]=1;\n    pascal[1][1]=1;\n    for(loopA=2;loopA<100;loopA++){\n        pascal[loopA][0]=1;\n        for(loopB=1;loopB<loopA;loopB++){\n            pascal[loopA][loopB]=pascal[loopA-1][loopB-1]+pascal[loopA-1][loopB];\n        }\n        pascal[loopA][loopA]=1;\n    }\n    return pascal[n][r];\n}\n\n\n\n\n\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nYou are given N items.\n\nThe value of the i-th item (1 \\leq i \\leq N) is v_i.\n\nYour have to select at least A and at most B of these items.\n\nUnder this condition, find the maximum possible arithmetic mean of the values of selected items.\n\nAdditionally, find the number of ways to select items so that the mean of the values of selected items is maximized.\n\nConstraints\n\n1 \\leq N \\leq 50\n\n1 \\leq A,B \\leq N\n\n1 \\leq v_i \\leq 10^{15}\n\nEach v_i is an integer.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN A B\nv_1\nv_2\n...\nv_N\n\nOutput\n\nPrint two lines.\n\nThe first line should contain the maximum possible arithmetic mean of the values of selected items. The output should be considered correct if the absolute or relative error is at most 10^{-6}.\n\nThe second line should contain the number of ways to select items so that the mean of the values of selected items is maximized.\n\nSample Input 1\n\n5 2 2\n1 2 3 4 5\n\nSample Output 1\n\n4.500000\n1\n\nThe mean of the values of selected items will be maximized when selecting the fourth and fifth items. Hence, the first line of the output should contain 4.5.\n\nThere is no other way to select items so that the mean of the values will be 4.5, and thus the second line of the output should contain 1.\n\nSample Input 2\n\n4 2 3\n10 20 10 10\n\nSample Output 2\n\n15.000000\n3\n\nThere can be multiple ways to select items so that the mean of the values will be maximized.\n\nSample Input 3\n\n5 1 5\n1000000000000000 999999999999999 999999999999998 999999999999997 999999999999996\n\nSample Output 3\n\n1000000000000000.000000\n1", "sample_input": "5 2 2\n1 2 3 4 5\n"}, "reference_outputs": ["4.500000\n1\n"], "source_document_id": "p03776", "source_text": "Score : 400 points\n\nProblem Statement\n\nYou are given N items.\n\nThe value of the i-th item (1 \\leq i \\leq N) is v_i.\n\nYour have to select at least A and at most B of these items.\n\nUnder this condition, find the maximum possible arithmetic mean of the values of selected items.\n\nAdditionally, find the number of ways to select items so that the mean of the values of selected items is maximized.\n\nConstraints\n\n1 \\leq N \\leq 50\n\n1 \\leq A,B \\leq N\n\n1 \\leq v_i \\leq 10^{15}\n\nEach v_i is an integer.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN A B\nv_1\nv_2\n...\nv_N\n\nOutput\n\nPrint two lines.\n\nThe first line should contain the maximum possible arithmetic mean of the values of selected items. The output should be considered correct if the absolute or relative error is at most 10^{-6}.\n\nThe second line should contain the number of ways to select items so that the mean of the values of selected items is maximized.\n\nSample Input 1\n\n5 2 2\n1 2 3 4 5\n\nSample Output 1\n\n4.500000\n1\n\nThe mean of the values of selected items will be maximized when selecting the fourth and fifth items. Hence, the first line of the output should contain 4.5.\n\nThere is no other way to select items so that the mean of the values will be 4.5, and thus the second line of the output should contain 1.\n\nSample Input 2\n\n4 2 3\n10 20 10 10\n\nSample Output 2\n\n15.000000\n3\n\nThere can be multiple ways to select items so that the mean of the values will be maximized.\n\nSample Input 3\n\n5 1 5\n1000000000000000 999999999999999 999999999999998 999999999999997 999999999999996\n\nSample Output 3\n\n1000000000000000.000000\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": 7342, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s725240105", "group_id": "codeNet:p03777", "input_text": "#include <stdio.h>\nint main (){\nchar a,b;\n  int p=0,q=0;\nscanf (\"%c%c\",&a,&b);\n  if(a-'H'==0){\n  p=1;\n  }\n   if(b-'H'==0){\n  q=1;\n  }\n \n  if((p+q)%2==0){\n  printf (\"H\");\n  }\n  else  {\n  printf (\"D\");\n  }\nreturn 0;\n}", "language": "C", "metadata": {"date": 1549316074, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "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/C/s725240105.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s725240105", "user_id": "u444555640"}, "prompt_components": {"gold_output": "H\n", "input_to_evaluate": "#include <stdio.h>\nint main (){\nchar a,b;\n  int p=0,q=0;\nscanf (\"%c%c\",&a,&b);\n  if(a-'H'==0){\n  p=1;\n  }\n   if(b-'H'==0){\n  q=1;\n  }\n \n  if((p+q)%2==0){\n  printf (\"H\");\n  }\n  else  {\n  printf (\"D\");\n  }\nreturn 0;\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": 215, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s487141304", "group_id": "codeNet:p03786", "input_text": "//set many funcs template\n//Ver.20190820\n#include<stdio.h>\n#include<string.h>\n#include<stdlib.h>\n#include<stdbool.h>\n#include<time.h>\n#include<assert.h>\n#define inf 1072114514\n#define llinf 4154118101919364364\n#define mod 1000000007\n#define pi 3.1415926535897932384\n\nint max(int a,int b){if(a>b){return a;}return b;}\nint min(int a,int b){if(a<b){return a;}return b;}\nint zt(int a,int b){return max(a,b)-min(a,b);}\nint round(int a,int b){if((a%b)*2 >= b){return (a/b)+1;}return a/b;}\nint ceil(int a,int b){if(a%b==0){return a/b;}return (a/b)+1;}\nint gcd(int a,int b){int c;while(b!=0){c=a%b;a=b;b=c;}return a;}\nint lcm(int a,int b){int c=gcd(a,b);a/=c;return a*b;}\nint nCr(int a,int b){int i,r=1;for(i=1;i<=b;i++){r*=(a+1-i);r/=i;}return r;}\nint nHr(int a,int b){return nCr(a+b-1,b);}\nint fact(int a){int i,r=1;for(i=1;i<=a;i++){r*=i;}return r;}\nint pow(int a,int b){int i,r=1;for(i=1;i<=b;i++){r*=a;}return r;}\nint dsum(int x){int r=0;while(x){r+=(x%10);x/=10;}return r;}\nint dsumb(int x,int b){int r=0;while(x){r+=(x%b);x/=b;}return r;}\nint sankaku(int x){return ((1+x)*x)/2;}\nvoid swap(int *a,int *b){int c;c=(*a);(*a)=(*b);(*b)=c;}\nlong long llmax(long long a,long long b){if(a>b){return a;}return b;}\nlong long llmin(long long a,long long b){if(a<b){return a;}return b;}\nlong long llzt(long long a,long long b){return llmax(a,b)-llmin(a,b);}\nlong long llround(long long a,long long b){if((a%b)*2 >= b){return (a/b)+1;}return a/b;}\nlong long llceil(long long a,long long b){if(a%b==0){return a/b;}return (a/b)+1;}\nlong long llgcd(long long a,long long b){long long c;while(b!=0){c=a%b;a=b;b=c;}return a;}\nlong long lllcm(long long a,long long b){long long c=llgcd(a,b);a/=c;return a*b;}\nlong long llnCr(long long a,long long b){long long i,r=1;for(i=1;i<=b;i++){r*=(a+1-i);r/=i;}return r;}\nlong long llnHr(long long a,long long b){return llnCr(a+b-1,b);}\nlong long llfact(long long a){long long i,r=1;for(i=1;i<=a;i++){r*=i;}return r;}\nlong long llpow(long long a,long long b){long long i,r=1;for(i=1;i<=b;i++){r*=a;}return r;}\nlong long lldsum(long long x){long long r=0;while(x){r+=(x%10);x/=10;}return r;}\nlong long lldsumb(long long x,long long b){long long r=0;while(x){r+=(x%b);x/=b;}return r;}\nlong long llsankaku(long long x){return ((1+x)*x)/2;}\nvoid llswap(long long *a,long long *b){long long c;c=(*a);(*a)=(*b);(*b)=c;}\ndouble dbmax(double a,double b){if(a>b){return a;}return b;}\ndouble dbmin(double a,double b){if(a<b){return a;}return b;}\ndouble dbzt(double a,double b){return dbmax(a,b)-dbmin(a,b);}\nvoid dbswap(double *a,double *b){double c;c=(*a);(*a)=(*b);(*b)=c;}\nvoid chswap(char *a,char *b){char c;c=(*a);(*a)=(*b);(*b)=c;}\nint sortfncsj(const void *a,const void *b){if(*(int *)a>*(int *)b){return 1;}if(*(int *)a==*(int *)b){return 0;}return -1;}\nint sortfnckj(const void *a,const void *b){if(*(int *)a<*(int *)b){return 1;}if(*(int *)a==*(int *)b){return 0;}return -1;}\nint llsortfncsj(const void *a,const void *b){if(*(long long *)a>*(long long *)b){return 1;}if(*(long long *)a==*(long long *)b){return 0;}return -1;}\nint llsortfnckj(const void *a,const void *b){if(*(long long *)a<*(long long *)b){return 1;}if(*(long long *)a==*(long long *)b){return 0;}return -1;}\nint dbsortfncsj(const void *a,const void *b){if(*(double *)a>*(double *)b){return 1;}if(*(double *)a==*(double *)b){return 0;}return -1;}\nint dbsortfnckj(const void *a,const void *b){if(*(double *)a<*(double *)b){return 1;}if(*(double *)a==*(double *)b){return 0;}return -1;}\nint strsortfncsj(const void *a,const void *b){return strcmp((char *)a,(char *)b);}\nint strsortfnckj(const void *a,const void *b){return strcmp((char *)b,(char *)a);}\nint chsortfncsj(const void *a,const void *b){if(*(char *)a>*(char *)b){return 1;}if(*(char *)a==*(char *)b){return 0;}return -1;}\nint chsortfnckj(const void *a,const void *b){if(*(char *)a<*(char *)b){return 1;}if(*(char *)a==*(char *)b){return 0;}return -1;}\n\nvoid shuffledget(int x[],int n){\n    int i,b[524288],p,c;\n    for(i=0;i<n;i++){\n        b[i]=i;\n    }\n    for(i=n;i>=1;i--){\n        p=rand()%i;\n        c=b[i-1];b[i-1]=b[p];b[p]=c;\n    }\n    for(i=0;i<n;i++){\n        scanf(\"%d\",&x[b[i]]);\n    }\n}\n\nint dx4[4]={1,-1,0,0};\nint dy4[4]={0,0,1,-1};\nint dx8[8]={-1,-1,-1,0,0,1,1,1};\nint dy8[8]={-1,0,1,-1,1,-1,0,1};\n\nint search(int x,int a[],int n){\n    int st=0,fi=n-1,te;\n    while(st<=fi){\n        te=(st+fi)/2;\n        if(a[te]<x){st=te+1;}else{fi=te-1;}\n    }\n    return st;\n}\n\nvoid prarr(int arr[],int n){\n  int i;\n  for(i=0;i<n;i++){\n    if(i){printf(\" \");}\n    printf(\"%d\",arr[i]);\n  }\n  printf(\"\\n\");\n  return;\n}\n\nvoid getperm(int a[],int n){\n  int i,p;\n  for(i=0;i<n;i++){\n    a[i]=i;\n  }\n  for(i=n-1;i>=1;i--){\n    p=rand()%(i+1);\n    swap(&a[p],&a[i]);\n  }\n}\n\ntypedef struct{\nint val;\nint node;\n}sd;\n\nint sdsortfnc(const void *a,const void *b){\nif(((sd*)a)->val < ((sd*)b)->val){return -1;}\nif(((sd*)a)->val > ((sd*)b)->val){return 1;}\nreturn 0;\n}\n\nvoid coordinate_comp(int a[],int n){\n  int i,c=0;\n  sd dat[524288];\n  for(i=0;i<n;i++){\n    dat[i].val=a[i];\n    dat[i].node=i;\n  }\n  qsort(dat,n,sizeof(dat[0]),sdsortfnc);\n  a[dat[0].node]=c;\n  for(i=1;i<n;i++){\n    if(dat[i-1].val!=dat[i].val){c++;}\n    a[dat[i].node]=c;\n  }\n}\n\nint main(void){\n  long long i,j,n,m,k,a[524288],b,c,h,w,r=0,l,t;\n  long long rw[524288]={0};\n  long long st,fi,te;\n  scanf(\"%lld\",&n);\n  for(i=0;i<n;i++){\n    scanf(\"%lld\",&a[i]);\n  }\n  qsort(a,n,sizeof(long long),llsortfncsj);\n  for(i=0;i<n;i++){\n    if(i==0){rw[0]=a[0];}\n    else{rw[i]=rw[i-1]+a[i];}\n  }\n  st=0;fi=n-1;\n  while(st<=fi){\n    te=(st+fi)/2;\n    w=rw[te];\n    //printf(\"%lld %lld\\n\",te,w);\n    for(i=te+1;i<n;i++){\n      if(2*w>=a[i]){\n        w=rw[i];\n      }\n      else{\n        st=te+1;\n        break;\n      }\n      if(i==n-1){\n        fi=te-1;\n      }\n    }\n  }\n  printf(\"%lld\\n\",n-st);\n  return 0;\n}\n", "language": "C", "metadata": {"date": 1578105927, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "problem_description_relpath": "problem_descriptions/p03786.html", "problem_id": "p03786", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03786/input.txt", "sample_output_relpath": "derived/input_output/data/p03786/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03786/C/s487141304.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s487141304", "user_id": "u721060623"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "//set many funcs template\n//Ver.20190820\n#include<stdio.h>\n#include<string.h>\n#include<stdlib.h>\n#include<stdbool.h>\n#include<time.h>\n#include<assert.h>\n#define inf 1072114514\n#define llinf 4154118101919364364\n#define mod 1000000007\n#define pi 3.1415926535897932384\n\nint max(int a,int b){if(a>b){return a;}return b;}\nint min(int a,int b){if(a<b){return a;}return b;}\nint zt(int a,int b){return max(a,b)-min(a,b);}\nint round(int a,int b){if((a%b)*2 >= b){return (a/b)+1;}return a/b;}\nint ceil(int a,int b){if(a%b==0){return a/b;}return (a/b)+1;}\nint gcd(int a,int b){int c;while(b!=0){c=a%b;a=b;b=c;}return a;}\nint lcm(int a,int b){int c=gcd(a,b);a/=c;return a*b;}\nint nCr(int a,int b){int i,r=1;for(i=1;i<=b;i++){r*=(a+1-i);r/=i;}return r;}\nint nHr(int a,int b){return nCr(a+b-1,b);}\nint fact(int a){int i,r=1;for(i=1;i<=a;i++){r*=i;}return r;}\nint pow(int a,int b){int i,r=1;for(i=1;i<=b;i++){r*=a;}return r;}\nint dsum(int x){int r=0;while(x){r+=(x%10);x/=10;}return r;}\nint dsumb(int x,int b){int r=0;while(x){r+=(x%b);x/=b;}return r;}\nint sankaku(int x){return ((1+x)*x)/2;}\nvoid swap(int *a,int *b){int c;c=(*a);(*a)=(*b);(*b)=c;}\nlong long llmax(long long a,long long b){if(a>b){return a;}return b;}\nlong long llmin(long long a,long long b){if(a<b){return a;}return b;}\nlong long llzt(long long a,long long b){return llmax(a,b)-llmin(a,b);}\nlong long llround(long long a,long long b){if((a%b)*2 >= b){return (a/b)+1;}return a/b;}\nlong long llceil(long long a,long long b){if(a%b==0){return a/b;}return (a/b)+1;}\nlong long llgcd(long long a,long long b){long long c;while(b!=0){c=a%b;a=b;b=c;}return a;}\nlong long lllcm(long long a,long long b){long long c=llgcd(a,b);a/=c;return a*b;}\nlong long llnCr(long long a,long long b){long long i,r=1;for(i=1;i<=b;i++){r*=(a+1-i);r/=i;}return r;}\nlong long llnHr(long long a,long long b){return llnCr(a+b-1,b);}\nlong long llfact(long long a){long long i,r=1;for(i=1;i<=a;i++){r*=i;}return r;}\nlong long llpow(long long a,long long b){long long i,r=1;for(i=1;i<=b;i++){r*=a;}return r;}\nlong long lldsum(long long x){long long r=0;while(x){r+=(x%10);x/=10;}return r;}\nlong long lldsumb(long long x,long long b){long long r=0;while(x){r+=(x%b);x/=b;}return r;}\nlong long llsankaku(long long x){return ((1+x)*x)/2;}\nvoid llswap(long long *a,long long *b){long long c;c=(*a);(*a)=(*b);(*b)=c;}\ndouble dbmax(double a,double b){if(a>b){return a;}return b;}\ndouble dbmin(double a,double b){if(a<b){return a;}return b;}\ndouble dbzt(double a,double b){return dbmax(a,b)-dbmin(a,b);}\nvoid dbswap(double *a,double *b){double c;c=(*a);(*a)=(*b);(*b)=c;}\nvoid chswap(char *a,char *b){char c;c=(*a);(*a)=(*b);(*b)=c;}\nint sortfncsj(const void *a,const void *b){if(*(int *)a>*(int *)b){return 1;}if(*(int *)a==*(int *)b){return 0;}return -1;}\nint sortfnckj(const void *a,const void *b){if(*(int *)a<*(int *)b){return 1;}if(*(int *)a==*(int *)b){return 0;}return -1;}\nint llsortfncsj(const void *a,const void *b){if(*(long long *)a>*(long long *)b){return 1;}if(*(long long *)a==*(long long *)b){return 0;}return -1;}\nint llsortfnckj(const void *a,const void *b){if(*(long long *)a<*(long long *)b){return 1;}if(*(long long *)a==*(long long *)b){return 0;}return -1;}\nint dbsortfncsj(const void *a,const void *b){if(*(double *)a>*(double *)b){return 1;}if(*(double *)a==*(double *)b){return 0;}return -1;}\nint dbsortfnckj(const void *a,const void *b){if(*(double *)a<*(double *)b){return 1;}if(*(double *)a==*(double *)b){return 0;}return -1;}\nint strsortfncsj(const void *a,const void *b){return strcmp((char *)a,(char *)b);}\nint strsortfnckj(const void *a,const void *b){return strcmp((char *)b,(char *)a);}\nint chsortfncsj(const void *a,const void *b){if(*(char *)a>*(char *)b){return 1;}if(*(char *)a==*(char *)b){return 0;}return -1;}\nint chsortfnckj(const void *a,const void *b){if(*(char *)a<*(char *)b){return 1;}if(*(char *)a==*(char *)b){return 0;}return -1;}\n\nvoid shuffledget(int x[],int n){\n    int i,b[524288],p,c;\n    for(i=0;i<n;i++){\n        b[i]=i;\n    }\n    for(i=n;i>=1;i--){\n        p=rand()%i;\n        c=b[i-1];b[i-1]=b[p];b[p]=c;\n    }\n    for(i=0;i<n;i++){\n        scanf(\"%d\",&x[b[i]]);\n    }\n}\n\nint dx4[4]={1,-1,0,0};\nint dy4[4]={0,0,1,-1};\nint dx8[8]={-1,-1,-1,0,0,1,1,1};\nint dy8[8]={-1,0,1,-1,1,-1,0,1};\n\nint search(int x,int a[],int n){\n    int st=0,fi=n-1,te;\n    while(st<=fi){\n        te=(st+fi)/2;\n        if(a[te]<x){st=te+1;}else{fi=te-1;}\n    }\n    return st;\n}\n\nvoid prarr(int arr[],int n){\n  int i;\n  for(i=0;i<n;i++){\n    if(i){printf(\" \");}\n    printf(\"%d\",arr[i]);\n  }\n  printf(\"\\n\");\n  return;\n}\n\nvoid getperm(int a[],int n){\n  int i,p;\n  for(i=0;i<n;i++){\n    a[i]=i;\n  }\n  for(i=n-1;i>=1;i--){\n    p=rand()%(i+1);\n    swap(&a[p],&a[i]);\n  }\n}\n\ntypedef struct{\nint val;\nint node;\n}sd;\n\nint sdsortfnc(const void *a,const void *b){\nif(((sd*)a)->val < ((sd*)b)->val){return -1;}\nif(((sd*)a)->val > ((sd*)b)->val){return 1;}\nreturn 0;\n}\n\nvoid coordinate_comp(int a[],int n){\n  int i,c=0;\n  sd dat[524288];\n  for(i=0;i<n;i++){\n    dat[i].val=a[i];\n    dat[i].node=i;\n  }\n  qsort(dat,n,sizeof(dat[0]),sdsortfnc);\n  a[dat[0].node]=c;\n  for(i=1;i<n;i++){\n    if(dat[i-1].val!=dat[i].val){c++;}\n    a[dat[i].node]=c;\n  }\n}\n\nint main(void){\n  long long i,j,n,m,k,a[524288],b,c,h,w,r=0,l,t;\n  long long rw[524288]={0};\n  long long st,fi,te;\n  scanf(\"%lld\",&n);\n  for(i=0;i<n;i++){\n    scanf(\"%lld\",&a[i]);\n  }\n  qsort(a,n,sizeof(long long),llsortfncsj);\n  for(i=0;i<n;i++){\n    if(i==0){rw[0]=a[0];}\n    else{rw[i]=rw[i-1]+a[i];}\n  }\n  st=0;fi=n-1;\n  while(st<=fi){\n    te=(st+fi)/2;\n    w=rw[te];\n    //printf(\"%lld %lld\\n\",te,w);\n    for(i=te+1;i<n;i++){\n      if(2*w>=a[i]){\n        w=rw[i];\n      }\n      else{\n        st=te+1;\n        break;\n      }\n      if(i==n-1){\n        fi=te-1;\n      }\n    }\n  }\n  printf(\"%lld\\n\",n-st);\n  return 0;\n}\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nSnuke found N strange creatures.\nEach creature has a fixed color and size. The color and size of the i-th creature are represented by i and A_i, respectively.\n\nEvery creature can absorb another creature whose size is at most twice the size of itself.\nWhen a creature of size A and color B absorbs another creature of size C and color D (C \\leq 2 \\times A), they will merge into one creature of size A+C and color B.\nHere, depending on the sizes of two creatures, it is possible that both of them can absorb the other.\n\nSnuke has been watching these creatures merge over and over and ultimately become one creature.\nFind the number of the possible colors of this creature.\n\nConstraints\n\n2 \\leq N \\leq 100000\n\n1 \\leq A_i \\leq 10^9\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 number of the possible colors of the last remaining creature after the N creatures repeatedly merge and ultimately become one creature.\n\nSample Input 1\n\n3\n3 1 4\n\nSample Output 1\n\n2\n\nThe possible colors of the last remaining creature are colors 1 and 3.\nFor example, when the creature of color 3 absorbs the creature of color 2, then the creature of color 1 absorbs the creature of color 3, the color of the last remaining creature will be color 1.\n\nSample Input 2\n\n5\n1 1 1 1 1\n\nSample Output 2\n\n5\n\nThere may be multiple creatures of the same size.\n\nSample Input 3\n\n6\n40 1 30 2 7 20\n\nSample Output 3\n\n4", "sample_input": "3\n3 1 4\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03786", "source_text": "Score : 400 points\n\nProblem Statement\n\nSnuke found N strange creatures.\nEach creature has a fixed color and size. The color and size of the i-th creature are represented by i and A_i, respectively.\n\nEvery creature can absorb another creature whose size is at most twice the size of itself.\nWhen a creature of size A and color B absorbs another creature of size C and color D (C \\leq 2 \\times A), they will merge into one creature of size A+C and color B.\nHere, depending on the sizes of two creatures, it is possible that both of them can absorb the other.\n\nSnuke has been watching these creatures merge over and over and ultimately become one creature.\nFind the number of the possible colors of this creature.\n\nConstraints\n\n2 \\leq N \\leq 100000\n\n1 \\leq A_i \\leq 10^9\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 number of the possible colors of the last remaining creature after the N creatures repeatedly merge and ultimately become one creature.\n\nSample Input 1\n\n3\n3 1 4\n\nSample Output 1\n\n2\n\nThe possible colors of the last remaining creature are colors 1 and 3.\nFor example, when the creature of color 3 absorbs the creature of color 2, then the creature of color 1 absorbs the creature of color 3, the color of the last remaining creature will be color 1.\n\nSample Input 2\n\n5\n1 1 1 1 1\n\nSample Output 2\n\n5\n\nThere may be multiple creatures of the same size.\n\nSample Input 3\n\n6\n40 1 30 2 7 20\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": 5808, "cpu_time_ms": 30, "memory_kb": 9084}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s055421937", "group_id": "codeNet:p03795", "input_text": "#include <stdio.h>\n\nint main()\n{\n\tunsigned long long int n;\n\tunsigned long long int m;\n\tscanf( \"%llu %llu\", &n, &m );\n\t\n\tunsigned long long int ans = 0ULL;\n\t\n\tunsigned long long int scc_n = (unsigned long long int)( n / 2ULL );\n\tunsigned long long int r_c_n = (unsigned long long int)( n % 2ULL );\n\t\n\tunsigned long long int scc_m = (unsigned long long int)( m / 4ULL );\n\tunsigned long long int r_c_m = (unsigned long long int)( m % 4ULL );\n\t\n\tunsigned long long int r_scc = (unsigned long long int)( r_c_n * 2ULL + r_c_m );\n\tr_scc = (unsigned long long int)( r_scc / 4ULL );\n\t\n\tans = (unsigned long long int)( scc_n + scc_m + r_scc );\n\t\n\tprintf( \"%llu\\n\", ans );\n\t\n\treturn 0;\n}\n", "language": "C", "metadata": {"date": 1487474905, "filename_ext": "c", "original_language": "C (Clang 3.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/C/s055421937.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s055421937", "user_id": "u189869255"}, "prompt_components": {"gold_output": "15800\n", "input_to_evaluate": "#include <stdio.h>\n\nint main()\n{\n\tunsigned long long int n;\n\tunsigned long long int m;\n\tscanf( \"%llu %llu\", &n, &m );\n\t\n\tunsigned long long int ans = 0ULL;\n\t\n\tunsigned long long int scc_n = (unsigned long long int)( n / 2ULL );\n\tunsigned long long int r_c_n = (unsigned long long int)( n % 2ULL );\n\t\n\tunsigned long long int scc_m = (unsigned long long int)( m / 4ULL );\n\tunsigned long long int r_c_m = (unsigned long long int)( m % 4ULL );\n\t\n\tunsigned long long int r_scc = (unsigned long long int)( r_c_n * 2ULL + r_c_m );\n\tr_scc = (unsigned long long int)( r_scc / 4ULL );\n\t\n\tans = (unsigned long long int)( scc_n + scc_m + r_scc );\n\t\n\tprintf( \"%llu\\n\", ans );\n\t\n\treturn 0;\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": 678, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s345225771", "group_id": "codeNet:p03796", "input_text": "#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n\tint N;\n\tscanf(\"%d\", &N);\n\t\n\tint i;\n\tlong long power;\n\tfor (i = 1, power = 1; i <= N; power = (power * (i++)) % 1000000007);\n\t\n\tprintf(\"%lld\\n\", power);\n\tfflush(stdout);\n\treturn 0;\n}", "language": "C", "metadata": {"date": 1589373463, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "problem_description_relpath": "problem_descriptions/p03796.html", "problem_id": "p03796", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03796/input.txt", "sample_output_relpath": "derived/input_output/data/p03796/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03796/C/s345225771.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s345225771", "user_id": "u943800443"}, "prompt_components": {"gold_output": "6\n", "input_to_evaluate": "#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n\tint N;\n\tscanf(\"%d\", &N);\n\t\n\tint i;\n\tlong long power;\n\tfor (i = 1, power = 1; i <= N; power = (power * (i++)) % 1000000007);\n\t\n\tprintf(\"%lld\\n\", power);\n\tfflush(stdout);\n\treturn 0;\n}", "problem_context": "Score : 200 points\n\nProblem Statement\n\nSnuke loves working out. He is now exercising N times.\n\nBefore he starts exercising, his power is 1. After he exercises for the i-th time, his power gets multiplied by i.\n\nFind Snuke's power after he exercises N times. Since the answer can be extremely large, print the answer modulo 10^{9}+7.\n\nConstraints\n\n1 ≤ N ≤ 10^{5}\n\nInput\n\nThe input 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\n3\n\nSample Output 1\n\n6\n\nAfter Snuke exercises for the first time, his power gets multiplied by 1 and becomes 1.\n\nAfter Snuke exercises for the second time, his power gets multiplied by 2 and becomes 2.\n\nAfter Snuke exercises for the third time, his power gets multiplied by 3 and becomes 6.\n\nSample Input 2\n\n10\n\nSample Output 2\n\n3628800\n\nSample Input 3\n\n100000\n\nSample Output 3\n\n457992974\n\nPrint the answer modulo 10^{9}+7.", "sample_input": "3\n"}, "reference_outputs": ["6\n"], "source_document_id": "p03796", "source_text": "Score : 200 points\n\nProblem Statement\n\nSnuke loves working out. He is now exercising N times.\n\nBefore he starts exercising, his power is 1. After he exercises for the i-th time, his power gets multiplied by i.\n\nFind Snuke's power after he exercises N times. Since the answer can be extremely large, print the answer modulo 10^{9}+7.\n\nConstraints\n\n1 ≤ N ≤ 10^{5}\n\nInput\n\nThe input 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\n3\n\nSample Output 1\n\n6\n\nAfter Snuke exercises for the first time, his power gets multiplied by 1 and becomes 1.\n\nAfter Snuke exercises for the second time, his power gets multiplied by 2 and becomes 2.\n\nAfter Snuke exercises for the third time, his power gets multiplied by 3 and becomes 6.\n\nSample Input 2\n\n10\n\nSample Output 2\n\n3628800\n\nSample Input 3\n\n100000\n\nSample Output 3\n\n457992974\n\nPrint the answer 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": 235, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s776841812", "group_id": "codeNet:p03796", "input_text": "#include <stdio.h>\n#include <math.h>\nint main(void){\nint n;\n  int counter;\n  double ans;\n  scanf(\"%d\",&n);\n  ans=n;\n  for(counter=1;counter!=n;counter++){\n  ans=fmod((ans*counter),100000007);\n  }\n  printf(\"%lf\",ans);\nreturn 0;\n}", "language": "C", "metadata": {"date": 1554753390, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "problem_description_relpath": "problem_descriptions/p03796.html", "problem_id": "p03796", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03796/input.txt", "sample_output_relpath": "derived/input_output/data/p03796/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03796/C/s776841812.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s776841812", "user_id": "u129632905"}, "prompt_components": {"gold_output": "6\n", "input_to_evaluate": "#include <stdio.h>\n#include <math.h>\nint main(void){\nint n;\n  int counter;\n  double ans;\n  scanf(\"%d\",&n);\n  ans=n;\n  for(counter=1;counter!=n;counter++){\n  ans=fmod((ans*counter),100000007);\n  }\n  printf(\"%lf\",ans);\nreturn 0;\n}", "problem_context": "Score : 200 points\n\nProblem Statement\n\nSnuke loves working out. He is now exercising N times.\n\nBefore he starts exercising, his power is 1. After he exercises for the i-th time, his power gets multiplied by i.\n\nFind Snuke's power after he exercises N times. Since the answer can be extremely large, print the answer modulo 10^{9}+7.\n\nConstraints\n\n1 ≤ N ≤ 10^{5}\n\nInput\n\nThe input 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\n3\n\nSample Output 1\n\n6\n\nAfter Snuke exercises for the first time, his power gets multiplied by 1 and becomes 1.\n\nAfter Snuke exercises for the second time, his power gets multiplied by 2 and becomes 2.\n\nAfter Snuke exercises for the third time, his power gets multiplied by 3 and becomes 6.\n\nSample Input 2\n\n10\n\nSample Output 2\n\n3628800\n\nSample Input 3\n\n100000\n\nSample Output 3\n\n457992974\n\nPrint the answer modulo 10^{9}+7.", "sample_input": "3\n"}, "reference_outputs": ["6\n"], "source_document_id": "p03796", "source_text": "Score : 200 points\n\nProblem Statement\n\nSnuke loves working out. He is now exercising N times.\n\nBefore he starts exercising, his power is 1. After he exercises for the i-th time, his power gets multiplied by i.\n\nFind Snuke's power after he exercises N times. Since the answer can be extremely large, print the answer modulo 10^{9}+7.\n\nConstraints\n\n1 ≤ N ≤ 10^{5}\n\nInput\n\nThe input 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\n3\n\nSample Output 1\n\n6\n\nAfter Snuke exercises for the first time, his power gets multiplied by 1 and becomes 1.\n\nAfter Snuke exercises for the second time, his power gets multiplied by 2 and becomes 2.\n\nAfter Snuke exercises for the third time, his power gets multiplied by 3 and becomes 6.\n\nSample Input 2\n\n10\n\nSample Output 2\n\n3628800\n\nSample Input 3\n\n100000\n\nSample Output 3\n\n457992974\n\nPrint the answer 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": 228, "cpu_time_ms": 7, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s210711101", "group_id": "codeNet:p03796", "input_text": "#include<stdio.h>\nint main (void){\n    int n;\n    scanf(\"%d\",&n);\n    unsigned long long int power=1;\n    int loop1;\n    for(loop1=1;loop1<=n;loop1++){\n        power*=loop1;\n        power%=1000000007;\n    }\n    printf(\"%llu\\n\",power);\n    return 0;\n}", "language": "C", "metadata": {"date": 1487469880, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "problem_description_relpath": "problem_descriptions/p03796.html", "problem_id": "p03796", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03796/input.txt", "sample_output_relpath": "derived/input_output/data/p03796/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03796/C/s210711101.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s210711101", "user_id": "u926548116"}, "prompt_components": {"gold_output": "6\n", "input_to_evaluate": "#include<stdio.h>\nint main (void){\n    int n;\n    scanf(\"%d\",&n);\n    unsigned long long int power=1;\n    int loop1;\n    for(loop1=1;loop1<=n;loop1++){\n        power*=loop1;\n        power%=1000000007;\n    }\n    printf(\"%llu\\n\",power);\n    return 0;\n}", "problem_context": "Score : 200 points\n\nProblem Statement\n\nSnuke loves working out. He is now exercising N times.\n\nBefore he starts exercising, his power is 1. After he exercises for the i-th time, his power gets multiplied by i.\n\nFind Snuke's power after he exercises N times. Since the answer can be extremely large, print the answer modulo 10^{9}+7.\n\nConstraints\n\n1 ≤ N ≤ 10^{5}\n\nInput\n\nThe input 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\n3\n\nSample Output 1\n\n6\n\nAfter Snuke exercises for the first time, his power gets multiplied by 1 and becomes 1.\n\nAfter Snuke exercises for the second time, his power gets multiplied by 2 and becomes 2.\n\nAfter Snuke exercises for the third time, his power gets multiplied by 3 and becomes 6.\n\nSample Input 2\n\n10\n\nSample Output 2\n\n3628800\n\nSample Input 3\n\n100000\n\nSample Output 3\n\n457992974\n\nPrint the answer modulo 10^{9}+7.", "sample_input": "3\n"}, "reference_outputs": ["6\n"], "source_document_id": "p03796", "source_text": "Score : 200 points\n\nProblem Statement\n\nSnuke loves working out. He is now exercising N times.\n\nBefore he starts exercising, his power is 1. After he exercises for the i-th time, his power gets multiplied by i.\n\nFind Snuke's power after he exercises N times. Since the answer can be extremely large, print the answer modulo 10^{9}+7.\n\nConstraints\n\n1 ≤ N ≤ 10^{5}\n\nInput\n\nThe input 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\n3\n\nSample Output 1\n\n6\n\nAfter Snuke exercises for the first time, his power gets multiplied by 1 and becomes 1.\n\nAfter Snuke exercises for the second time, his power gets multiplied by 2 and becomes 2.\n\nAfter Snuke exercises for the third time, his power gets multiplied by 3 and becomes 6.\n\nSample Input 2\n\n10\n\nSample Output 2\n\n3628800\n\nSample Input 3\n\n100000\n\nSample Output 3\n\n457992974\n\nPrint the answer 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": 250, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s616972597", "group_id": "codeNet:p03800", "input_text": "W=87,i,n;char a[100001],s[100001];f(x,y){*a=x;a[1]=y;for(i=0;++i<n-1;)a[i+1]=a[i]==W^a[i-1]==W^s[i]=='o'?83:W;*a!=W^*s=='o'^a[n-1]==a[1]&&a[n-1]!=W^s[n-1]=='o'^a[n-2]==*a?puts(a),0:1;}main(){scanf(\"%d%s\",&n,&s);f(83,83)&&f(83,W)&&f(W,83)&&f(W,W)?puts(\"-1\"):0;}", "language": "C", "metadata": {"date": 1487498099, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "problem_description_relpath": "problem_descriptions/p03800.html", "problem_id": "p03800", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03800/input.txt", "sample_output_relpath": "derived/input_output/data/p03800/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03800/C/s616972597.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s616972597", "user_id": "u899220667"}, "prompt_components": {"gold_output": "SSSWWS\n", "input_to_evaluate": "W=87,i,n;char a[100001],s[100001];f(x,y){*a=x;a[1]=y;for(i=0;++i<n-1;)a[i+1]=a[i]==W^a[i-1]==W^s[i]=='o'?83:W;*a!=W^*s=='o'^a[n-1]==a[1]&&a[n-1]!=W^s[n-1]=='o'^a[n-2]==*a?puts(a),0:1;}main(){scanf(\"%d%s\",&n,&s);f(83,83)&&f(83,W)&&f(W,83)&&f(W,W)?puts(\"-1\"):0;}", "problem_context": "Score : 500 points\n\nProblem Statement\n\nSnuke, who loves animals, built a zoo.\n\nThere are N animals in this zoo. They are conveniently numbered 1 through N, and arranged in a circle.\nThe animal numbered i (2≤i≤N-1) is adjacent to the animals numbered i-1 and i+1. Also, the animal numbered 1 is adjacent to the animals numbered 2 and N, and the animal numbered N is adjacent to the animals numbered N-1 and 1.\n\nThere are two kinds of animals in this zoo: honest sheep that only speak the truth, and lying wolves that only tell lies.\n\nSnuke cannot tell the difference between these two species, and asked each animal the following question: \"Are your neighbors of the same species?\" The animal numbered i answered s_i. Here, if s_i is o, the animal said that the two neighboring animals are of the same species, and if s_i is x, the animal said that the two neighboring animals are of different species.\n\nMore formally, a sheep answered o if the two neighboring animals are both sheep or both wolves, and answered x otherwise.\nSimilarly, a wolf answered x if the two neighboring animals are both sheep or both wolves, and answered o otherwise.\n\nSnuke is wondering whether there is a valid assignment of species to the animals that is consistent with these responses. If there is such an assignment, show one such assignment. Otherwise, print -1.\n\nConstraints\n\n3 ≤ N ≤ 10^{5}\n\ns is a string of length N consisting of o and x.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\ns\n\nOutput\n\nIf there does not exist an valid assignment that is consistent with s, print -1.\nOtherwise, print an string t in the following format. The output is considered correct if the assignment described by t is consistent with s.\n\nt is a string of length N consisting of S and W.\n\nIf t_i is S, it indicates that the animal numbered i is a sheep. If t_i is W, it indicates that the animal numbered i is a wolf.\n\nSample Input 1\n\n6\nooxoox\n\nSample Output 1\n\nSSSWWS\n\nFor example, if the animals numbered 1, 2, 3, 4, 5 and 6 are respectively a sheep, sheep, sheep, wolf, wolf, and sheep, it is consistent with their responses. Besides, there is another valid assignment of species: a wolf, sheep, wolf, sheep, wolf and wolf.\n\nLet us remind you: if the neiboring animals are of the same species, a sheep answers o and a wolf answers x. If the neiboring animals are of different species, a sheep answers x and a wolf answers o.\n\nSample Input 2\n\n3\noox\n\nSample Output 2\n\n-1\n\nPrint -1 if there is no valid assignment of species.\n\nSample Input 3\n\n10\noxooxoxoox\n\nSample Output 3\n\nSSWWSSSWWS", "sample_input": "6\nooxoox\n"}, "reference_outputs": ["SSSWWS\n"], "source_document_id": "p03800", "source_text": "Score : 500 points\n\nProblem Statement\n\nSnuke, who loves animals, built a zoo.\n\nThere are N animals in this zoo. They are conveniently numbered 1 through N, and arranged in a circle.\nThe animal numbered i (2≤i≤N-1) is adjacent to the animals numbered i-1 and i+1. Also, the animal numbered 1 is adjacent to the animals numbered 2 and N, and the animal numbered N is adjacent to the animals numbered N-1 and 1.\n\nThere are two kinds of animals in this zoo: honest sheep that only speak the truth, and lying wolves that only tell lies.\n\nSnuke cannot tell the difference between these two species, and asked each animal the following question: \"Are your neighbors of the same species?\" The animal numbered i answered s_i. Here, if s_i is o, the animal said that the two neighboring animals are of the same species, and if s_i is x, the animal said that the two neighboring animals are of different species.\n\nMore formally, a sheep answered o if the two neighboring animals are both sheep or both wolves, and answered x otherwise.\nSimilarly, a wolf answered x if the two neighboring animals are both sheep or both wolves, and answered o otherwise.\n\nSnuke is wondering whether there is a valid assignment of species to the animals that is consistent with these responses. If there is such an assignment, show one such assignment. Otherwise, print -1.\n\nConstraints\n\n3 ≤ N ≤ 10^{5}\n\ns is a string of length N consisting of o and x.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\ns\n\nOutput\n\nIf there does not exist an valid assignment that is consistent with s, print -1.\nOtherwise, print an string t in the following format. The output is considered correct if the assignment described by t is consistent with s.\n\nt is a string of length N consisting of S and W.\n\nIf t_i is S, it indicates that the animal numbered i is a sheep. If t_i is W, it indicates that the animal numbered i is a wolf.\n\nSample Input 1\n\n6\nooxoox\n\nSample Output 1\n\nSSSWWS\n\nFor example, if the animals numbered 1, 2, 3, 4, 5 and 6 are respectively a sheep, sheep, sheep, wolf, wolf, and sheep, it is consistent with their responses. Besides, there is another valid assignment of species: a wolf, sheep, wolf, sheep, wolf and wolf.\n\nLet us remind you: if the neiboring animals are of the same species, a sheep answers o and a wolf answers x. If the neiboring animals are of different species, a sheep answers x and a wolf answers o.\n\nSample Input 2\n\n3\noox\n\nSample Output 2\n\n-1\n\nPrint -1 if there is no valid assignment of species.\n\nSample Input 3\n\n10\noxooxoxoox\n\nSample Output 3\n\nSSWWSSSWWS", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 260, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s444122418", "group_id": "codeNet:p03803", "input_text": "#include <stdio.h>\nint main(void){\n\tint a,b;\n\tscanf(\"%d %d\",&a,&b);\n\tif(a==b){\n\t\tputs(\"Draw\");\n\t}\n\telse if(a==1){\n\t\tputs(\"Alice\");\n\t}\n\telse if(b==1){\n\t\tputs(\"Bob\");\n\t}\n\telse if(a>b){\n\t\tputs(\"Alice\");\n\t}\n\telse{\n\t\tputs(\"Bob\");\n\t}\n\treturn 0;\n}", "language": "C", "metadata": {"date": 1486877700, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "problem_description_relpath": "problem_descriptions/p03803.html", "problem_id": "p03803", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03803/input.txt", "sample_output_relpath": "derived/input_output/data/p03803/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03803/C/s444122418.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s444122418", "user_id": "u128527648"}, "prompt_components": {"gold_output": "Alice\n", "input_to_evaluate": "#include <stdio.h>\nint main(void){\n\tint a,b;\n\tscanf(\"%d %d\",&a,&b);\n\tif(a==b){\n\t\tputs(\"Draw\");\n\t}\n\telse if(a==1){\n\t\tputs(\"Alice\");\n\t}\n\telse if(b==1){\n\t\tputs(\"Bob\");\n\t}\n\telse if(a>b){\n\t\tputs(\"Alice\");\n\t}\n\telse{\n\t\tputs(\"Bob\");\n\t}\n\treturn 0;\n}", "problem_context": "Score : 100 points\n\nProblem Statement\n\nAlice and Bob are playing One Card Poker.\n\nOne Card Poker is a two-player game using playing cards.\n\nEach card in this game shows an integer between 1 and 13, inclusive.\n\nThe strength of a card is determined by the number written on it, as follows:\n\nWeak 2 < 3 < 4 < 5 < 6 < 7 < 8 < 9 < 10 < 11 < 12 < 13 < 1 Strong\n\nOne Card Poker is played as follows:\n\nEach player picks one card from the deck. The chosen card becomes the player's hand.\n\nThe players reveal their hands to each other. The player with the stronger card wins the game.\n\nIf their cards are equally strong, the game is drawn.\n\nYou are watching Alice and Bob playing the game, and can see their hands.\n\nThe number written on Alice's card is A, and the number written on Bob's card is B.\n\nWrite a program to determine the outcome of the game.\n\nConstraints\n\n1≦A≦13\n\n1≦B≦13\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 Alice if Alice will win. Print Bob if Bob will win. Print Draw if the game will be drawn.\n\nSample Input 1\n\n8 6\n\nSample Output 1\n\nAlice\n\n8 is written on Alice's card, and 6 is written on Bob's card.\nAlice has the stronger card, and thus the output should be Alice.\n\nSample Input 2\n\n1 1\n\nSample Output 2\n\nDraw\n\nSince their cards have the same number, the game will be drawn.\n\nSample Input 3\n\n13 1\n\nSample Output 3\n\nBob", "sample_input": "8 6\n"}, "reference_outputs": ["Alice\n"], "source_document_id": "p03803", "source_text": "Score : 100 points\n\nProblem Statement\n\nAlice and Bob are playing One Card Poker.\n\nOne Card Poker is a two-player game using playing cards.\n\nEach card in this game shows an integer between 1 and 13, inclusive.\n\nThe strength of a card is determined by the number written on it, as follows:\n\nWeak 2 < 3 < 4 < 5 < 6 < 7 < 8 < 9 < 10 < 11 < 12 < 13 < 1 Strong\n\nOne Card Poker is played as follows:\n\nEach player picks one card from the deck. The chosen card becomes the player's hand.\n\nThe players reveal their hands to each other. The player with the stronger card wins the game.\n\nIf their cards are equally strong, the game is drawn.\n\nYou are watching Alice and Bob playing the game, and can see their hands.\n\nThe number written on Alice's card is A, and the number written on Bob's card is B.\n\nWrite a program to determine the outcome of the game.\n\nConstraints\n\n1≦A≦13\n\n1≦B≦13\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 Alice if Alice will win. Print Bob if Bob will win. Print Draw if the game will be drawn.\n\nSample Input 1\n\n8 6\n\nSample Output 1\n\nAlice\n\n8 is written on Alice's card, and 6 is written on Bob's card.\nAlice has the stronger card, and thus the output should be Alice.\n\nSample Input 2\n\n1 1\n\nSample Output 2\n\nDraw\n\nSince their cards have the same number, the game will be drawn.\n\nSample Input 3\n\n13 1\n\nSample Output 3\n\nBob", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s848140735", "group_id": "codeNet:p03805", "input_text": "#include<stdio.h>\n#include<stdlib.h>\n#include<math.h>\n#include<string.h>\n#include<stdbool.h>\n#include<assert.h>\n#include<ctype.h>\ntypedef long long ll;\ntypedef long double ld;\n#define rep(i,l,r)for(ll i=(l);i<(r);i++)\n#define repp(i,l,r,k)for(ll i=(l);i<(r);i+=(k))\n#define rrep(i,l,r)for(ll i=(l);i>=(r);i--)\n#define INF (1LL<<60)\n#define MOD1 1000000007\n#define MOD2 998244353\n#define MAX_N (1 << 20)\n#define YES printf(\"Yes\\n\")\n#define NO printf(\"No\\n\")\n#define PN printf(\"\\n\")\n#define charsize 100005 //10^5+5\n#define PI 3.141592653589793238\n\nvoid swap(ll *a, ll *b){ll c;c=*b;*b=*a;*a= c;}\nvoid cin(ll *n){ scanf(\"%lld\",&(*n)); }\nll max2(ll a,ll b){return a>=b?a:b;}\nll min2(ll a,ll b){return a>=b?b:a;}\nll min3(ll a, ll b, ll c){return (a<=b && a<=c) ? a : b<=c ? b : c;}\nll max3(ll a, ll b, ll c){return (a>=b && a>=c) ? a : b>=c ? b : c;}\nll minn(ll n, ll a[]){ll b=INF;rep(i,0,n) b=min2(b,a[i]);return b;}\nll maxn(ll n, ll a[]){ll b=-INF;rep(i,0,n) b=max2(b,a[i]);return b;}\nll POW(ll a, ll b){ll c=1;rep(i,0,b) c*=a;return c;}\ndouble POW_d(double a, double b){double c=1;rep(i,0,b) c*=a;return c;}\nll gcd(ll a,ll b){return b?gcd(b,a%b):a;}\nll lcm(ll a,ll b){return a/gcd(a,b)*b;}\nll mod_MOD1(ll n){n+= n<0?((-n)/MOD1+1)*MOD1:0; return n%=MOD1;}\nll mod_p(ll n ,ll p){n+= n<0?((-n)/p+1)*p:0; return n%=p;}\nll change_into_num(char s[] , ll len, ll p){ return !p ? 0 : POW(10,p-1)*(s[len-p]-'0') + change_into_num(s,len,p-1); }\nll digits(ll a, ll b){return a/b?1+digits(a/b,b):1;}\nll base(ll n, ll a, ll i){return i==1?n%a:base(n/a,a,i-1);}\n\nvoid lr_lower( int *l, int *r, ll am, ll val , int type ){ (type<3) ? ( am < val ?  ( *l = (*l+*r)/2 ) : ( *r= (*l+*r)/2 ) ) : ( am <= val ? ( *l = (*l+*r)/2 ) : ( *r= (*l+*r)/2 ) ); }\nvoid lr_upper( int *l, int *r, ll am, ll val , int type ){ (type<3) ? ( am <= val ?  ( *l = (*l+*r)/2 ) : ( *r= (*l+*r)/2 ) ) : ( am < val ? ( *l = (*l+*r)/2 ) : ( *r= (*l+*r)/2 ) ); }\nint cmp_lower( ll a, ll b, int type ){ return (type==1) ? ( a==b ? 1 : 0 ) : (type==2) ? ( a>=b ? 1 : 0 ) : ( a>b ? 1 : 0 ) ; }\nint cmp_upper( ll a, ll b, int type ){ return (type==1) ? ( a==b ? 1 : 0 ) : (type==2) ? ( a<=b ? 1 : 0 ) : ( a<b ? 1 : 0 ) ; }\n// return smallest p  which meets  a[p]==val :1  >=:2   >:3\nll lower_bound( ll a[], int l, int r, ll val , int type ){  while(r-l>1) lr_lower(&l,&r,a[ (l+r)/2 ],val,type);  return cmp_lower(a[l],val,type) ? l : cmp_lower(a[r],val,type) ? r : -1;  }\n// return biggest p  which meets   a[p]==val :1  <=:2   <:3\nll upper_bound( ll a[], int l, int r, ll val , int type ){  while(r-l>1) lr_upper(&l,&r,a[ (l+r)/2 ],val,type); return cmp_upper(a[r],val,type) ? r : cmp_upper(a[l],val,type) ? l : -1; }\n// count i  which meets ai==x\nll count(ll a[], int l, int r, ll x){  int p = lower_bound(a,l,r,x,1);  return p==-1 ? 0 : upper_bound(a,p,r,x,1)-p+1; }\n\nll *factors[2] , fac_cnt=0 , is_factor_prepared=0;\nll factor_pre(){  rep(i,0,1){ if(is_factor_prepared++) return 0; }  ll tmp=(1e6)/2+1, fac_tmp[tmp];  rep(i,0,tmp){fac_tmp[i]=i?2*i+1:2;}  rep(i,1,tmp){if(fac_tmp[i]){  repp(j,3,tmp/(2*i+1)+1,2 ){  if( j*(2*i+1)<tmp ) fac_tmp[ (j*(2*i+1)-1)/2 ]=0;  }  }else continue;}  rep(i,0,tmp){if(fac_tmp[i]){  rep(j,0,2){ factors[j] = realloc( factors[j] , sizeof(ll)*( fac_cnt +1 ) );  factors[j][j?fac_cnt++:fac_cnt]=j?0:fac_tmp[i];  }  } }  return 0;  }\nll factor(ll n, ll new_common_plus){ factor_pre();  rep(i,0,fac_cnt){ ll cnt=0; rep(j,0,1){ while( ( cnt+= n %factors[0][i]==0 ? 1 : 0 )  && (n/=factors[0][i]) %factors[0][i]==0 ) continue; } factors[1][i]= new_common_plus==1 ? cnt :  new_common_plus==2 ? max2(factors[1][i],cnt) : factors[1][i]+cnt ;  if( factors[0][i]> n ) break; } return n; }\nll judge_prime(ll n){ factor_pre(); rep(i,0,fac_cnt){ if(n<factors[0][i]*factors[0][i] || n==factors[0][i]) break; else if(n%factors[0][i]==0) n/=n; }  return n==1?0:1; }\n\nll *mf_arr,*inv_arr,*finv_arr,is_minv_made=0,is_mf_made=0;\nll makeinv(ll n , ll mod){  rep(i,0,1){if(is_minv_made++) return 0;}  inv_arr = realloc(inv_arr, sizeof(ll)*2 );  finv_arr = realloc(finv_arr, sizeof(ll)*2 );  inv_arr[1]=1;finv_arr[0]=finv_arr[1]=1;  rep(i,2,n+1){  inv_arr = realloc(inv_arr, sizeof(ll)*(i+1) );  finv_arr = realloc(finv_arr, sizeof(ll)*(i+1) );  inv_arr[i]= mod - inv_arr[mod%i] * (mod / i) % mod;  finv_arr[i] = finv_arr[i - 1] * inv_arr[i] % mod;  }  return 0; }\nll make_mf(ll n, ll mod){  rep(i,0,1){ if(is_mf_made++) return 0; }  mf_arr = realloc(mf_arr, sizeof(ll)*2 );  ll x=1;  mf_arr[0]=mf_arr[1]=x;  rep(i,2,n+1){   x=x*i%mod;  mf_arr = realloc(mf_arr, sizeof(ll)*(i+1) );  mf_arr[i]=x; }  return 0;  }\nll m_inv(ll x, ll mod, ll is_fac ){ makeinv(2*1e6+10,mod);  return is_fac?finv_arr[x]:inv_arr[x]; }\nll m_f(ll x, ll mod){  make_mf(2*1e6+10,mod);  return mf_arr[x];  }\n// ll mod_nck(ll n, ll k, ll mod){ return m_f[n]*finv_arr[k]%mod*finv_arr[n-k]%mod; }\nll m_p(ll r,ll n,ll mod){  ll t=1,s=r;  while(n>0){ t = (n&1) ? t*s%mod : t;  s=s*s%mod; n>>=1; }  return r?t:0;  }\nll m_mul2(ll a, ll b, ll mod){ return a*b%mod; }\nll m_mul3(ll a, ll b, ll c, ll mod){ return m_mul2(a*b%mod,c,mod); }\nll m_mul4(ll a, ll b, ll c, ll d, ll mod){ return m_mul3(a*b%mod,c,d,mod); }\nll m_mul5(ll a, ll b, ll c, ll d, ll e, ll mod){ return m_mul4(a*b%mod,c,d,e,mod); }\n\nint upll(const void*a, const void*b){return*(ll*)a<*(ll*)b?-1:*(ll*)a>*(ll*)b?1:0;}\nint downll(const void*a, const void*b){return*(ll*)a<*(ll*)b?1:*(ll*)a>*(ll*)b?-1:0;}\nint cmp_string( const void * a , const void * b ) {  return strcmp( (char *)a , (char *)b ); }  // qsort((void*)s,n,sizeof(s[0]),int_sort );\nint cmp_char(const void * a, const void * b) { return *(char *)a - *(char *)b;}\nvoid sortup(ll*a,int n){qsort(a,n,sizeof(ll),upll);}\nvoid sortdown(ll*a,int n){qsort(a,n,sizeof(ll),downll);}\nvoid sort_string(int n,int size,char s[][size]){ qsort( (void*)s , n , sizeof(s[0]) , cmp_string ); }\nvoid sort_char(char *s){ qsort( (void *)s , strlen(s) , sizeof(char) , cmp_char ); }\nll unique_string(ll n ,ll size, char s[][size]){ ll ans=1; rep(i,1,n) if( strcmp(s[i],s[i-1]) ) ans++; return ans; }\nll unique_num(ll n , ll a[]){ ll ans=1; rep(i,1,n) if( a[i]!=a[i-1] ) ans++; return ans; }\n\ntypedef struct{ ll a , b;}fr;\nint cmp1( const void *p, const void *q ) { return ((fr*)p) ->a - ((fr*)q)->a;}\nint cmp2( const void *p, const void *q ) { return ((fr*)q) ->a - ((fr*)p)->a;}\nvoid strsortup(fr*a,int n){qsort(a,n,sizeof(fr),cmp1);}\nvoid strsortdown(fr*a,int n){qsort(a,n,sizeof(fr),cmp2);}\n\n\nint edge_cnt[114315];\nll* graph[114315];\nll* edge_num[114315];\n// ll ans[114315];\n// freeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeee!!!!!!!!!!!!!!!\n\nvoid pushGraph(ll v1, ll v2, ll weight, ll num , ll is_dir){\n    graph[v1] = realloc( graph[v1] , sizeof(ll)*(edge_cnt[v1]*2+2) );    \n    graph[v1][edge_cnt[v1]*2] = v2;\n    graph[v1][edge_cnt[v1]*2+1] = weight;\n    edge_num[v1] = realloc( edge_num[v1] , sizeof(ll)*(edge_cnt[v1]+1) );\n    edge_num[v1][edge_cnt[v1]] = num;\n    edge_cnt[v1]++;\n\n    if(!is_dir){\n        graph[v2] = realloc( graph[v2] , sizeof(ll)*(edge_cnt[v2]*2+2) );\n        graph[v2][edge_cnt[v2]*2] = v1;\n        graph[v2][edge_cnt[v2]*2+1] = weight;\n        edge_num[v2] = realloc( edge_num[v2] , sizeof(ll)*(edge_cnt[v2]+1) );\n        edge_num[v2][edge_cnt[v2]] = num;\n        edge_cnt[v2]++;\n    }\n}\nll m,ans=0;\n// void dfs(ll n, ll x, ll way[], ll d[]){\n//     // printf(\"||%lld||                %lld\\n\",x+1,ans);\n//     // rep(i,0,m){\n//     //     printf(\"%lld \",way[i]);\n//     // }PN;\n//     // rep(i,0,n){\n//     //     printf(\"%lld \",d[i]);\n//     // }PN;\n\n//     // ll ans=0;\n//     rep(i,0,n){\n//         if(!d[i]) break;\n//         if(d[i]>1) return;\n//         if(i==n-1){\n//             ans++;\n//             // d[x]--;\n//             return;\n//         } \n//     }\n//     rep(i,0,edge_cnt[x]){\n//         if(way[ edge_num[x][i] ]) continue;\n//         d[ graph[x][i*2] ]++;\n//         way[ edge_num[x][i] ]++;\n//         dfs(n,graph[x][i*2],way,d);\n//         d[ graph[x][i*2] ]--;\n//         way[ edge_num[x][i] ]--;\n//     }\n//     // return ans;\n// }\n\nvoid dfs(ll n, ll x, ll d[]){\n    // printf(\"||%lld||                %lld\\n\",x+1,ans);\n    // rep(i,0,m){\n    //     printf(\"%lld \",way[i]);\n    // }PN;\n    // rep(i,0,n){\n    //     printf(\"%lld \",d[i]);\n    // }PN;\n\n    // ll ans=0;\n    rep(i,0,n){\n        if(!d[i]) break;\n        if(d[i]>1) return;\n        if(i==n-1){\n            ans++;\n            // d[x]--;\n            return;\n        } \n    }\n    rep(i,0,edge_cnt[x]){\n        if(d[ graph[x][i*2] ]) continue;\n        d[ graph[x][i*2] ]++;\n        dfs(n,graph[x][i*2],d);\n        d[ graph[x][i*2] ]--;\n    }\n    // return ans;\n}\n\n// char s[1151154];\nint main(void){\n    // fgets(s,sizeof(s),stdin); \n    ll n;\n    // ll ans=0;\n    cin(&n);\n    cin(&m);\n    // scanf(\"%s\",s);\n    ll a,b;\n    ll d[10]={};\n    rep(i,0,m){\n        cin(&a);\n        cin(&b);\n        pushGraph(a-1,b-1,1,i,0);\n    }\n\n    d[0]=1;\n    dfs(n,0,d);\n\n    printf(\"%lld\\n\",ans);\n    return 0;\n}\n", "language": "C", "metadata": {"date": 1593192391, "filename_ext": "c", "original_language": "C (GCC 9.2.1)", "problem_description_relpath": "problem_descriptions/p03805.html", "problem_id": "p03805", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03805/input.txt", "sample_output_relpath": "derived/input_output/data/p03805/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03805/C/s848140735.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s848140735", "user_id": "u004279520"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "#include<stdio.h>\n#include<stdlib.h>\n#include<math.h>\n#include<string.h>\n#include<stdbool.h>\n#include<assert.h>\n#include<ctype.h>\ntypedef long long ll;\ntypedef long double ld;\n#define rep(i,l,r)for(ll i=(l);i<(r);i++)\n#define repp(i,l,r,k)for(ll i=(l);i<(r);i+=(k))\n#define rrep(i,l,r)for(ll i=(l);i>=(r);i--)\n#define INF (1LL<<60)\n#define MOD1 1000000007\n#define MOD2 998244353\n#define MAX_N (1 << 20)\n#define YES printf(\"Yes\\n\")\n#define NO printf(\"No\\n\")\n#define PN printf(\"\\n\")\n#define charsize 100005 //10^5+5\n#define PI 3.141592653589793238\n\nvoid swap(ll *a, ll *b){ll c;c=*b;*b=*a;*a= c;}\nvoid cin(ll *n){ scanf(\"%lld\",&(*n)); }\nll max2(ll a,ll b){return a>=b?a:b;}\nll min2(ll a,ll b){return a>=b?b:a;}\nll min3(ll a, ll b, ll c){return (a<=b && a<=c) ? a : b<=c ? b : c;}\nll max3(ll a, ll b, ll c){return (a>=b && a>=c) ? a : b>=c ? b : c;}\nll minn(ll n, ll a[]){ll b=INF;rep(i,0,n) b=min2(b,a[i]);return b;}\nll maxn(ll n, ll a[]){ll b=-INF;rep(i,0,n) b=max2(b,a[i]);return b;}\nll POW(ll a, ll b){ll c=1;rep(i,0,b) c*=a;return c;}\ndouble POW_d(double a, double b){double c=1;rep(i,0,b) c*=a;return c;}\nll gcd(ll a,ll b){return b?gcd(b,a%b):a;}\nll lcm(ll a,ll b){return a/gcd(a,b)*b;}\nll mod_MOD1(ll n){n+= n<0?((-n)/MOD1+1)*MOD1:0; return n%=MOD1;}\nll mod_p(ll n ,ll p){n+= n<0?((-n)/p+1)*p:0; return n%=p;}\nll change_into_num(char s[] , ll len, ll p){ return !p ? 0 : POW(10,p-1)*(s[len-p]-'0') + change_into_num(s,len,p-1); }\nll digits(ll a, ll b){return a/b?1+digits(a/b,b):1;}\nll base(ll n, ll a, ll i){return i==1?n%a:base(n/a,a,i-1);}\n\nvoid lr_lower( int *l, int *r, ll am, ll val , int type ){ (type<3) ? ( am < val ?  ( *l = (*l+*r)/2 ) : ( *r= (*l+*r)/2 ) ) : ( am <= val ? ( *l = (*l+*r)/2 ) : ( *r= (*l+*r)/2 ) ); }\nvoid lr_upper( int *l, int *r, ll am, ll val , int type ){ (type<3) ? ( am <= val ?  ( *l = (*l+*r)/2 ) : ( *r= (*l+*r)/2 ) ) : ( am < val ? ( *l = (*l+*r)/2 ) : ( *r= (*l+*r)/2 ) ); }\nint cmp_lower( ll a, ll b, int type ){ return (type==1) ? ( a==b ? 1 : 0 ) : (type==2) ? ( a>=b ? 1 : 0 ) : ( a>b ? 1 : 0 ) ; }\nint cmp_upper( ll a, ll b, int type ){ return (type==1) ? ( a==b ? 1 : 0 ) : (type==2) ? ( a<=b ? 1 : 0 ) : ( a<b ? 1 : 0 ) ; }\n// return smallest p  which meets  a[p]==val :1  >=:2   >:3\nll lower_bound( ll a[], int l, int r, ll val , int type ){  while(r-l>1) lr_lower(&l,&r,a[ (l+r)/2 ],val,type);  return cmp_lower(a[l],val,type) ? l : cmp_lower(a[r],val,type) ? r : -1;  }\n// return biggest p  which meets   a[p]==val :1  <=:2   <:3\nll upper_bound( ll a[], int l, int r, ll val , int type ){  while(r-l>1) lr_upper(&l,&r,a[ (l+r)/2 ],val,type); return cmp_upper(a[r],val,type) ? r : cmp_upper(a[l],val,type) ? l : -1; }\n// count i  which meets ai==x\nll count(ll a[], int l, int r, ll x){  int p = lower_bound(a,l,r,x,1);  return p==-1 ? 0 : upper_bound(a,p,r,x,1)-p+1; }\n\nll *factors[2] , fac_cnt=0 , is_factor_prepared=0;\nll factor_pre(){  rep(i,0,1){ if(is_factor_prepared++) return 0; }  ll tmp=(1e6)/2+1, fac_tmp[tmp];  rep(i,0,tmp){fac_tmp[i]=i?2*i+1:2;}  rep(i,1,tmp){if(fac_tmp[i]){  repp(j,3,tmp/(2*i+1)+1,2 ){  if( j*(2*i+1)<tmp ) fac_tmp[ (j*(2*i+1)-1)/2 ]=0;  }  }else continue;}  rep(i,0,tmp){if(fac_tmp[i]){  rep(j,0,2){ factors[j] = realloc( factors[j] , sizeof(ll)*( fac_cnt +1 ) );  factors[j][j?fac_cnt++:fac_cnt]=j?0:fac_tmp[i];  }  } }  return 0;  }\nll factor(ll n, ll new_common_plus){ factor_pre();  rep(i,0,fac_cnt){ ll cnt=0; rep(j,0,1){ while( ( cnt+= n %factors[0][i]==0 ? 1 : 0 )  && (n/=factors[0][i]) %factors[0][i]==0 ) continue; } factors[1][i]= new_common_plus==1 ? cnt :  new_common_plus==2 ? max2(factors[1][i],cnt) : factors[1][i]+cnt ;  if( factors[0][i]> n ) break; } return n; }\nll judge_prime(ll n){ factor_pre(); rep(i,0,fac_cnt){ if(n<factors[0][i]*factors[0][i] || n==factors[0][i]) break; else if(n%factors[0][i]==0) n/=n; }  return n==1?0:1; }\n\nll *mf_arr,*inv_arr,*finv_arr,is_minv_made=0,is_mf_made=0;\nll makeinv(ll n , ll mod){  rep(i,0,1){if(is_minv_made++) return 0;}  inv_arr = realloc(inv_arr, sizeof(ll)*2 );  finv_arr = realloc(finv_arr, sizeof(ll)*2 );  inv_arr[1]=1;finv_arr[0]=finv_arr[1]=1;  rep(i,2,n+1){  inv_arr = realloc(inv_arr, sizeof(ll)*(i+1) );  finv_arr = realloc(finv_arr, sizeof(ll)*(i+1) );  inv_arr[i]= mod - inv_arr[mod%i] * (mod / i) % mod;  finv_arr[i] = finv_arr[i - 1] * inv_arr[i] % mod;  }  return 0; }\nll make_mf(ll n, ll mod){  rep(i,0,1){ if(is_mf_made++) return 0; }  mf_arr = realloc(mf_arr, sizeof(ll)*2 );  ll x=1;  mf_arr[0]=mf_arr[1]=x;  rep(i,2,n+1){   x=x*i%mod;  mf_arr = realloc(mf_arr, sizeof(ll)*(i+1) );  mf_arr[i]=x; }  return 0;  }\nll m_inv(ll x, ll mod, ll is_fac ){ makeinv(2*1e6+10,mod);  return is_fac?finv_arr[x]:inv_arr[x]; }\nll m_f(ll x, ll mod){  make_mf(2*1e6+10,mod);  return mf_arr[x];  }\n// ll mod_nck(ll n, ll k, ll mod){ return m_f[n]*finv_arr[k]%mod*finv_arr[n-k]%mod; }\nll m_p(ll r,ll n,ll mod){  ll t=1,s=r;  while(n>0){ t = (n&1) ? t*s%mod : t;  s=s*s%mod; n>>=1; }  return r?t:0;  }\nll m_mul2(ll a, ll b, ll mod){ return a*b%mod; }\nll m_mul3(ll a, ll b, ll c, ll mod){ return m_mul2(a*b%mod,c,mod); }\nll m_mul4(ll a, ll b, ll c, ll d, ll mod){ return m_mul3(a*b%mod,c,d,mod); }\nll m_mul5(ll a, ll b, ll c, ll d, ll e, ll mod){ return m_mul4(a*b%mod,c,d,e,mod); }\n\nint upll(const void*a, const void*b){return*(ll*)a<*(ll*)b?-1:*(ll*)a>*(ll*)b?1:0;}\nint downll(const void*a, const void*b){return*(ll*)a<*(ll*)b?1:*(ll*)a>*(ll*)b?-1:0;}\nint cmp_string( const void * a , const void * b ) {  return strcmp( (char *)a , (char *)b ); }  // qsort((void*)s,n,sizeof(s[0]),int_sort );\nint cmp_char(const void * a, const void * b) { return *(char *)a - *(char *)b;}\nvoid sortup(ll*a,int n){qsort(a,n,sizeof(ll),upll);}\nvoid sortdown(ll*a,int n){qsort(a,n,sizeof(ll),downll);}\nvoid sort_string(int n,int size,char s[][size]){ qsort( (void*)s , n , sizeof(s[0]) , cmp_string ); }\nvoid sort_char(char *s){ qsort( (void *)s , strlen(s) , sizeof(char) , cmp_char ); }\nll unique_string(ll n ,ll size, char s[][size]){ ll ans=1; rep(i,1,n) if( strcmp(s[i],s[i-1]) ) ans++; return ans; }\nll unique_num(ll n , ll a[]){ ll ans=1; rep(i,1,n) if( a[i]!=a[i-1] ) ans++; return ans; }\n\ntypedef struct{ ll a , b;}fr;\nint cmp1( const void *p, const void *q ) { return ((fr*)p) ->a - ((fr*)q)->a;}\nint cmp2( const void *p, const void *q ) { return ((fr*)q) ->a - ((fr*)p)->a;}\nvoid strsortup(fr*a,int n){qsort(a,n,sizeof(fr),cmp1);}\nvoid strsortdown(fr*a,int n){qsort(a,n,sizeof(fr),cmp2);}\n\n\nint edge_cnt[114315];\nll* graph[114315];\nll* edge_num[114315];\n// ll ans[114315];\n// freeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeee!!!!!!!!!!!!!!!\n\nvoid pushGraph(ll v1, ll v2, ll weight, ll num , ll is_dir){\n    graph[v1] = realloc( graph[v1] , sizeof(ll)*(edge_cnt[v1]*2+2) );    \n    graph[v1][edge_cnt[v1]*2] = v2;\n    graph[v1][edge_cnt[v1]*2+1] = weight;\n    edge_num[v1] = realloc( edge_num[v1] , sizeof(ll)*(edge_cnt[v1]+1) );\n    edge_num[v1][edge_cnt[v1]] = num;\n    edge_cnt[v1]++;\n\n    if(!is_dir){\n        graph[v2] = realloc( graph[v2] , sizeof(ll)*(edge_cnt[v2]*2+2) );\n        graph[v2][edge_cnt[v2]*2] = v1;\n        graph[v2][edge_cnt[v2]*2+1] = weight;\n        edge_num[v2] = realloc( edge_num[v2] , sizeof(ll)*(edge_cnt[v2]+1) );\n        edge_num[v2][edge_cnt[v2]] = num;\n        edge_cnt[v2]++;\n    }\n}\nll m,ans=0;\n// void dfs(ll n, ll x, ll way[], ll d[]){\n//     // printf(\"||%lld||                %lld\\n\",x+1,ans);\n//     // rep(i,0,m){\n//     //     printf(\"%lld \",way[i]);\n//     // }PN;\n//     // rep(i,0,n){\n//     //     printf(\"%lld \",d[i]);\n//     // }PN;\n\n//     // ll ans=0;\n//     rep(i,0,n){\n//         if(!d[i]) break;\n//         if(d[i]>1) return;\n//         if(i==n-1){\n//             ans++;\n//             // d[x]--;\n//             return;\n//         } \n//     }\n//     rep(i,0,edge_cnt[x]){\n//         if(way[ edge_num[x][i] ]) continue;\n//         d[ graph[x][i*2] ]++;\n//         way[ edge_num[x][i] ]++;\n//         dfs(n,graph[x][i*2],way,d);\n//         d[ graph[x][i*2] ]--;\n//         way[ edge_num[x][i] ]--;\n//     }\n//     // return ans;\n// }\n\nvoid dfs(ll n, ll x, ll d[]){\n    // printf(\"||%lld||                %lld\\n\",x+1,ans);\n    // rep(i,0,m){\n    //     printf(\"%lld \",way[i]);\n    // }PN;\n    // rep(i,0,n){\n    //     printf(\"%lld \",d[i]);\n    // }PN;\n\n    // ll ans=0;\n    rep(i,0,n){\n        if(!d[i]) break;\n        if(d[i]>1) return;\n        if(i==n-1){\n            ans++;\n            // d[x]--;\n            return;\n        } \n    }\n    rep(i,0,edge_cnt[x]){\n        if(d[ graph[x][i*2] ]) continue;\n        d[ graph[x][i*2] ]++;\n        dfs(n,graph[x][i*2],d);\n        d[ graph[x][i*2] ]--;\n    }\n    // return ans;\n}\n\n// char s[1151154];\nint main(void){\n    // fgets(s,sizeof(s),stdin); \n    ll n;\n    // ll ans=0;\n    cin(&n);\n    cin(&m);\n    // scanf(\"%s\",s);\n    ll a,b;\n    ll d[10]={};\n    rep(i,0,m){\n        cin(&a);\n        cin(&b);\n        pushGraph(a-1,b-1,1,i,0);\n    }\n\n    d[0]=1;\n    dfs(n,0,d);\n\n    printf(\"%lld\\n\",ans);\n    return 0;\n}\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nYou are given an undirected unweighted graph with N vertices and M edges that contains neither self-loops nor double edges.\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<j≤M).\n\nHow many different paths start from vertex 1 and visit all the vertices exactly once?\n\nHere, the endpoints of a path are considered visited.\n\nFor example, let us assume that the following undirected graph shown in Figure 1 is given.\n\nFigure 1: an example of an undirected graph\n\nThe following path shown in Figure 2 satisfies the condition.\n\nFigure 2: an example of a path that satisfies the condition\n\nHowever, the following path shown in Figure 3 does not satisfy the condition, because it does not visit all the vertices.\n\nFigure 3: an example of a path that does not satisfy the condition\n\nNeither the following path shown in Figure 4, because it does not start from vertex 1.\n\nFigure 4: another example of a path that does not satisfy the condition\n\nConstraints\n\n2≦N≦8\n\n0≦M≦N(N-1)/2\n\n1≦a_i<b_i≦N\n\nThe given graph contains neither self-loops nor double edges.\n\nInput\n\nThe input 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\nPrint the number of the different paths that start from vertex 1 and visit all the vertices exactly once.\n\nSample Input 1\n\n3 3\n1 2\n1 3\n2 3\n\nSample Output 1\n\n2\n\nThe given graph is shown in the following figure:\n\nThe following two paths satisfy the condition:\n\nSample Input 2\n\n7 7\n1 3\n2 7\n3 4\n4 5\n4 6\n5 6\n6 7\n\nSample Output 2\n\n1\n\nThis test case is the same as the one described in the problem statement.", "sample_input": "3 3\n1 2\n1 3\n2 3\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03805", "source_text": "Score : 300 points\n\nProblem Statement\n\nYou are given an undirected unweighted graph with N vertices and M edges that contains neither self-loops nor double edges.\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<j≤M).\n\nHow many different paths start from vertex 1 and visit all the vertices exactly once?\n\nHere, the endpoints of a path are considered visited.\n\nFor example, let us assume that the following undirected graph shown in Figure 1 is given.\n\nFigure 1: an example of an undirected graph\n\nThe following path shown in Figure 2 satisfies the condition.\n\nFigure 2: an example of a path that satisfies the condition\n\nHowever, the following path shown in Figure 3 does not satisfy the condition, because it does not visit all the vertices.\n\nFigure 3: an example of a path that does not satisfy the condition\n\nNeither the following path shown in Figure 4, because it does not start from vertex 1.\n\nFigure 4: another example of a path that does not satisfy the condition\n\nConstraints\n\n2≦N≦8\n\n0≦M≦N(N-1)/2\n\n1≦a_i<b_i≦N\n\nThe given graph contains neither self-loops nor double edges.\n\nInput\n\nThe input 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\nPrint the number of the different paths that start from vertex 1 and visit all the vertices exactly once.\n\nSample Input 1\n\n3 3\n1 2\n1 3\n2 3\n\nSample Output 1\n\n2\n\nThe given graph is shown in the following figure:\n\nThe following two paths satisfy the condition:\n\nSample Input 2\n\n7 7\n1 3\n2 7\n3 4\n4 5\n4 6\n5 6\n6 7\n\nSample Output 2\n\n1\n\nThis test case is the same as the one described in the problem statement.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 8951, "cpu_time_ms": 8, "memory_kb": 1700}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s117820600", "group_id": "codeNet:p03807", "input_text": "#include<stdio.h>\nint main(){\n  int n,a,s=0;\n  scanf(\"%d\",&n);\n  while(n--){\n    scanf(\"%d\",&a);\n    s+=a%2;\n  }\n  printf(\"%s\\n\",s%2?\"NO\":\"YES\");\n  return 0;\n}\n", "language": "C", "metadata": {"date": 1506551020, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "problem_description_relpath": "problem_descriptions/p03807.html", "problem_id": "p03807", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03807/input.txt", "sample_output_relpath": "derived/input_output/data/p03807/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03807/C/s117820600.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s117820600", "user_id": "u244060698"}, "prompt_components": {"gold_output": "YES\n", "input_to_evaluate": "#include<stdio.h>\nint main(){\n  int n,a,s=0;\n  scanf(\"%d\",&n);\n  while(n--){\n    scanf(\"%d\",&a);\n    s+=a%2;\n  }\n  printf(\"%s\\n\",s%2?\"NO\":\"YES\");\n  return 0;\n}\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere are N integers written on a blackboard. The i-th integer is A_i.\n\nTakahashi will repeatedly perform the following operation on these numbers:\n\nSelect a pair of integers, A_i and A_j, that have the same parity (that is, both are even or both are odd) and erase them.\n\nThen, write a new integer on the blackboard that is equal to the sum of those integers, A_i+A_j.\n\nDetermine whether it is possible to have only one integer on the blackboard.\n\nConstraints\n\n2 ≦ N ≦ 10^5\n\n1 ≦ A_i ≦ 10^9\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\nIf it is possible to have only one integer on the blackboard, print YES. Otherwise, print NO.\n\nSample Input 1\n\n3\n1 2 3\n\nSample Output 1\n\nYES\n\nIt is possible to have only one integer on the blackboard, as follows:\n\nErase 1 and 3 from the blackboard, then write 4. Now, there are two integers on the blackboard: 2 and 4.\n\nErase 2 and 4 from the blackboard, then write 6. Now, there is only one integer on the blackboard: 6.\n\nSample Input 2\n\n5\n1 2 3 4 5\n\nSample Output 2\n\nNO", "sample_input": "3\n1 2 3\n"}, "reference_outputs": ["YES\n"], "source_document_id": "p03807", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere are N integers written on a blackboard. The i-th integer is A_i.\n\nTakahashi will repeatedly perform the following operation on these numbers:\n\nSelect a pair of integers, A_i and A_j, that have the same parity (that is, both are even or both are odd) and erase them.\n\nThen, write a new integer on the blackboard that is equal to the sum of those integers, A_i+A_j.\n\nDetermine whether it is possible to have only one integer on the blackboard.\n\nConstraints\n\n2 ≦ N ≦ 10^5\n\n1 ≦ A_i ≦ 10^9\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\nIf it is possible to have only one integer on the blackboard, print YES. Otherwise, print NO.\n\nSample Input 1\n\n3\n1 2 3\n\nSample Output 1\n\nYES\n\nIt is possible to have only one integer on the blackboard, as follows:\n\nErase 1 and 3 from the blackboard, then write 4. Now, there are two integers on the blackboard: 2 and 4.\n\nErase 2 and 4 from the blackboard, then write 6. Now, there is only one integer on the blackboard: 6.\n\nSample Input 2\n\n5\n1 2 3 4 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": 160, "cpu_time_ms": 13, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s968833379", "group_id": "codeNet:p03813", "input_text": "#include<stdio.h>\n\nint main()\n{\n    int x;\n    scanf(\"%d\",&x);\n    if(1<=x && x<=3000)\n    {\n        if(x<1200) printf(\"ABC\");\n        else printf(\"ARC\");\n    }\n\nreturn 0;\n}", "language": "C", "metadata": {"date": 1597726823, "filename_ext": "c", "original_language": "C (GCC 9.2.1)", "problem_description_relpath": "problem_descriptions/p03813.html", "problem_id": "p03813", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03813/input.txt", "sample_output_relpath": "derived/input_output/data/p03813/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03813/C/s968833379.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s968833379", "user_id": "u816631826"}, "prompt_components": {"gold_output": "ABC\n", "input_to_evaluate": "#include<stdio.h>\n\nint main()\n{\n    int x;\n    scanf(\"%d\",&x);\n    if(1<=x && x<=3000)\n    {\n        if(x<1200) printf(\"ABC\");\n        else printf(\"ARC\");\n    }\n\nreturn 0;\n}", "problem_context": "Score : 100 points\n\nProblem Statement\n\nSmeke has decided to participate in AtCoder Beginner Contest (ABC) if his current rating is less than 1200, and participate in AtCoder Regular Contest (ARC) otherwise.\n\nYou are given Smeke's current rating, x. Print ABC if Smeke will participate in ABC, and print ARC otherwise.\n\nConstraints\n\n1 ≦ x ≦ 3{,}000\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\n1000\n\nSample Output 1\n\nABC\n\nSmeke's current rating is less than 1200, thus the output should be ABC.\n\nSample Input 2\n\n2000\n\nSample Output 2\n\nARC\n\nSmeke's current rating is not less than 1200, thus the output should be ARC.", "sample_input": "1000\n"}, "reference_outputs": ["ABC\n"], "source_document_id": "p03813", "source_text": "Score : 100 points\n\nProblem Statement\n\nSmeke has decided to participate in AtCoder Beginner Contest (ABC) if his current rating is less than 1200, and participate in AtCoder Regular Contest (ARC) otherwise.\n\nYou are given Smeke's current rating, x. Print ABC if Smeke will participate in ABC, and print ARC otherwise.\n\nConstraints\n\n1 ≦ x ≦ 3{,}000\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\n1000\n\nSample Output 1\n\nABC\n\nSmeke's current rating is less than 1200, thus the output should be ABC.\n\nSample Input 2\n\n2000\n\nSample Output 2\n\nARC\n\nSmeke's current rating is not less than 1200, thus the output should be ARC.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 173, "cpu_time_ms": 5, "memory_kb": 1728}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s050463570", "group_id": "codeNet:p03815", "input_text": "int main(void){long long int a,b,ans;scanf(\"%lld\",&a);\nans=(((a-5)%11)>5)?a*2/11:(a-5)*2/11+1;\nprintf(\"%lld\\n\",ans);return 0;}", "language": "C", "metadata": {"date": 1485658211, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "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/C/s050463570.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s050463570", "user_id": "u825624694"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "int main(void){long long int a,b,ans;scanf(\"%lld\",&a);\nans=(((a-5)%11)>5)?a*2/11:(a-5)*2/11+1;\nprintf(\"%lld\\n\",ans);return 0;}", "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": 126, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s651577770", "group_id": "codeNet:p03817", "input_text": "#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    long long int x, y;\n\n\n    scanf(\"%lld\", &x);\n\n\n\n    if(x<7)\n    {\n        y=1;\n        printf(\"%d\\n\", y);\n    }\n    else if(x<13)\n    {\n        y=2;\n        printf(\"%d\\n\", y);\n    }\n    else\n    {\n       y=((x/11)*2)+1;\n       printf(\"%lld\\n\", y);\n    }\n\n\n\n    return 0;\n}\n", "language": "C", "metadata": {"date": 1564404381, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "problem_description_relpath": "problem_descriptions/p03817.html", "problem_id": "p03817", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03817/input.txt", "sample_output_relpath": "derived/input_output/data/p03817/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03817/C/s651577770.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s651577770", "user_id": "u089230684"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "#include <stdio.h>\n#include <stdlib.h>\n\nint main()\n{\n    long long int x, y;\n\n\n    scanf(\"%lld\", &x);\n\n\n\n    if(x<7)\n    {\n        y=1;\n        printf(\"%d\\n\", y);\n    }\n    else if(x<13)\n    {\n        y=2;\n        printf(\"%d\\n\", y);\n    }\n    else\n    {\n       y=((x/11)*2)+1;\n       printf(\"%lld\\n\", y);\n    }\n\n\n\n    return 0;\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": "p03817", "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": 330, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s911719334", "group_id": "codeNet:p03821", "input_text": "#include<stdio.h>\n#include<stdlib.h>\n#include<math.h>\n#include<string.h>\n#include<stdbool.h>\n#include<assert.h>\ntypedef long long ll;\ntypedef long double ld;\n#define rep(i,l,r)for(ll i=(l);i<(r);i++)\n#define repp(i,l,r,k)for(ll i=(l);i<(r);i+=(k))\n#define rrep(i,l,r)for(ll i=(l);i>=(r);i--)\n#define INF (1LL<<60)\n#define MOD1 1000000007\n#define MOD2 998244353\n#define MAX_N (1 << 17)\n#define YES printf(\"Yes\\n\")\n#define NO printf(\"No\\n\")\n#define PN printf(\"\\n\")\n#define charsize 100005 //10^5+5\n\nvoid swap(ll *a, ll *b){ll c;c=*b;*b=*a;*a= c;}\nll max2(ll a,ll b){return a>=b?a:b;}\nll min2(ll a,ll b){return a>=b?b:a;}\nll min3(ll a, ll b, ll c){return (a<=b && a<=c) ? a : b<=c ? b : c;}\nll max3(ll a, ll b, ll c){return (a>=b && a>=c) ? a : b>=c ? b : c;}\nll minn(ll n, ll a[n]){ll b=INF;rep(i,0,n) b=min2(b,a[i]);return b;}\nll maxn(ll n, ll a[n]){ll b=-INF;rep(i,0,n) b=max2(b,a[i]);return b;}\nll ABS(ll a){return a>=0?a:(-a);}\nll POW(ll a, ll b){ll c=1;rep(i,0,b) c*=a;return c;}\nll gcd(ll a,ll b){return b?gcd(b,a%b):a;}\nll lcm(ll a,ll b){return a/gcd(a,b)*b;}\nll mod(ll n){n+= n<0?((-n)/MOD1+1)*MOD1:0; return n%=MOD1;}\nint upll(const void*a, const void*b){return*(ll*)a<*(ll*)b?-1:*(ll*)a>*(ll*)b?1:0;}\nint downll(const void*a, const void*b){return*(ll*)a<*(ll*)b?1:*(ll*)a>*(ll*)b?-1:0;}\nvoid sortup(ll*a,int n){qsort(a,n,sizeof(ll),upll);}\nvoid sortdown(ll*a,int n){qsort(a,n,sizeof(ll),downll);}\n\ntypedef struct{ ll a , b;}fr;\nint cmp1( const void *p, const void *q ) { return ((fr*)p) ->a - ((fr*)q)->a;}\nint cmp2( const void *p, const void *q ) { return ((fr*)q) ->a - ((fr*)p)->a;}\nvoid strsortup(fr*a,int n){qsort(a,n,sizeof(fr),cmp1);}\nvoid strsortdown(fr*a,int n){qsort(a,n,sizeof(fr),cmp2);}\n\nint main(void){\n    // char ;\n    ll n;\n    scanf(\"%lld\",&n);\n    ll a[n],b[n];\n    rep(i,0,n){\n        scanf(\"%lld%lld\",&a[i],&b[i]);\n    }\n    ll plus=0;\n    rrep(i,n-1,0){\n        if( (a[i]+plus) %b[i] ){\n            plus+= b[i] - (a[i]+plus) %b[i];\n        }\n    }\n\n    \n    printf(\"%lld\\n\",plus);\n    return 0;\n}\n", "language": "C", "metadata": {"date": 1587555820, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "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/C/s911719334.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s911719334", "user_id": "u004279520"}, "prompt_components": {"gold_output": "7\n", "input_to_evaluate": "#include<stdio.h>\n#include<stdlib.h>\n#include<math.h>\n#include<string.h>\n#include<stdbool.h>\n#include<assert.h>\ntypedef long long ll;\ntypedef long double ld;\n#define rep(i,l,r)for(ll i=(l);i<(r);i++)\n#define repp(i,l,r,k)for(ll i=(l);i<(r);i+=(k))\n#define rrep(i,l,r)for(ll i=(l);i>=(r);i--)\n#define INF (1LL<<60)\n#define MOD1 1000000007\n#define MOD2 998244353\n#define MAX_N (1 << 17)\n#define YES printf(\"Yes\\n\")\n#define NO printf(\"No\\n\")\n#define PN printf(\"\\n\")\n#define charsize 100005 //10^5+5\n\nvoid swap(ll *a, ll *b){ll c;c=*b;*b=*a;*a= c;}\nll max2(ll a,ll b){return a>=b?a:b;}\nll min2(ll a,ll b){return a>=b?b:a;}\nll min3(ll a, ll b, ll c){return (a<=b && a<=c) ? a : b<=c ? b : c;}\nll max3(ll a, ll b, ll c){return (a>=b && a>=c) ? a : b>=c ? b : c;}\nll minn(ll n, ll a[n]){ll b=INF;rep(i,0,n) b=min2(b,a[i]);return b;}\nll maxn(ll n, ll a[n]){ll b=-INF;rep(i,0,n) b=max2(b,a[i]);return b;}\nll ABS(ll a){return a>=0?a:(-a);}\nll POW(ll a, ll b){ll c=1;rep(i,0,b) c*=a;return c;}\nll gcd(ll a,ll b){return b?gcd(b,a%b):a;}\nll lcm(ll a,ll b){return a/gcd(a,b)*b;}\nll mod(ll n){n+= n<0?((-n)/MOD1+1)*MOD1:0; return n%=MOD1;}\nint upll(const void*a, const void*b){return*(ll*)a<*(ll*)b?-1:*(ll*)a>*(ll*)b?1:0;}\nint downll(const void*a, const void*b){return*(ll*)a<*(ll*)b?1:*(ll*)a>*(ll*)b?-1:0;}\nvoid sortup(ll*a,int n){qsort(a,n,sizeof(ll),upll);}\nvoid sortdown(ll*a,int n){qsort(a,n,sizeof(ll),downll);}\n\ntypedef struct{ ll a , b;}fr;\nint cmp1( const void *p, const void *q ) { return ((fr*)p) ->a - ((fr*)q)->a;}\nint cmp2( const void *p, const void *q ) { return ((fr*)q) ->a - ((fr*)p)->a;}\nvoid strsortup(fr*a,int n){qsort(a,n,sizeof(fr),cmp1);}\nvoid strsortdown(fr*a,int n){qsort(a,n,sizeof(fr),cmp2);}\n\nint main(void){\n    // char ;\n    ll n;\n    scanf(\"%lld\",&n);\n    ll a[n],b[n];\n    rep(i,0,n){\n        scanf(\"%lld%lld\",&a[i],&b[i]);\n    }\n    ll plus=0;\n    rrep(i,n-1,0){\n        if( (a[i]+plus) %b[i] ){\n            plus+= b[i] - (a[i]+plus) %b[i];\n        }\n    }\n\n    \n    printf(\"%lld\\n\",plus);\n    return 0;\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": 2027, "cpu_time_ms": 24, "memory_kb": 1664}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s027411277", "group_id": "codeNet:p03826", "input_text": "#include<stdio.h>\nint main()\n{\n    int a,b,c,d;\n    int sum1,sum2;\n    scanf(\"%d %d %d %d\",&a,&b,&c,&d);\n    sum1=a*b;\n    sum2=c*d;\n    if(sum1>=sum2)\n    {\n        printf(\"%d\",sum1);\n    }\n    else\n        printf(\"%d\",sum2);\n    return 0;\n}\n", "language": "C", "metadata": {"date": 1574010613, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "problem_description_relpath": "problem_descriptions/p03826.html", "problem_id": "p03826", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03826/input.txt", "sample_output_relpath": "derived/input_output/data/p03826/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03826/C/s027411277.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s027411277", "user_id": "u863370423"}, "prompt_components": {"gold_output": "15\n", "input_to_evaluate": "#include<stdio.h>\nint main()\n{\n    int a,b,c,d;\n    int sum1,sum2;\n    scanf(\"%d %d %d %d\",&a,&b,&c,&d);\n    sum1=a*b;\n    sum2=c*d;\n    if(sum1>=sum2)\n    {\n        printf(\"%d\",sum1);\n    }\n    else\n        printf(\"%d\",sum2);\n    return 0;\n}\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nThere are two rectangles.\nThe lengths of the vertical sides of the first rectangle are A, and the lengths of the horizontal sides of the first rectangle are B.\nThe lengths of the vertical sides of the second rectangle are C, and the lengths of the horizontal sides of the second rectangle are D.\n\nPrint the area of the rectangle with the larger area.\nIf the two rectangles have equal areas, print that area.\n\nConstraints\n\nAll input values are integers.\n\n1≤A≤10^4\n\n1≤B≤10^4\n\n1≤C≤10^4\n\n1≤D≤10^4\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nA B C D\n\nOutput\n\nPrint the area of the rectangle with the larger area.\nIf the two rectangles have equal areas, print that area.\n\nSample Input 1\n\n3 5 2 7\n\nSample Output 1\n\n15\n\nThe first rectangle has an area of 3×5=15, and the second rectangle has an area of 2×7=14.\nThus, the output should be 15, the larger area.\n\nSample Input 2\n\n100 600 200 300\n\nSample Output 2\n\n60000", "sample_input": "3 5 2 7\n"}, "reference_outputs": ["15\n"], "source_document_id": "p03826", "source_text": "Score : 100 points\n\nProblem Statement\n\nThere are two rectangles.\nThe lengths of the vertical sides of the first rectangle are A, and the lengths of the horizontal sides of the first rectangle are B.\nThe lengths of the vertical sides of the second rectangle are C, and the lengths of the horizontal sides of the second rectangle are D.\n\nPrint the area of the rectangle with the larger area.\nIf the two rectangles have equal areas, print that area.\n\nConstraints\n\nAll input values are integers.\n\n1≤A≤10^4\n\n1≤B≤10^4\n\n1≤C≤10^4\n\n1≤D≤10^4\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nA B C D\n\nOutput\n\nPrint the area of the rectangle with the larger area.\nIf the two rectangles have equal areas, print that area.\n\nSample Input 1\n\n3 5 2 7\n\nSample Output 1\n\n15\n\nThe first rectangle has an area of 3×5=15, and the second rectangle has an area of 2×7=14.\nThus, the output should be 15, the larger area.\n\nSample Input 2\n\n100 600 200 300\n\nSample Output 2\n\n60000", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 243, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s347328082", "group_id": "codeNet:p03828", "input_text": "#include<stdio.h>\n#include<math.h>\nint num_of_factors(int n,int k){\n  int ans=0;\n  int m=k;\n  while(n/k!=0){\n    ans+=n/k;\n    k*=m;\n  }\n  return ans;\n}\n     \nint main(){\n  int n,i,j,flag,a;\n  long ans=1;\n  scanf(\"%d\",&n);\n  for(i=2;i<=n;i++){\n    flag=1;\n    for(j=2;j<=(int)sqrt(i);j++){\n      if(i%j==0) flag=0;\n    }\n    if(flag==1) {\n      a=num_of_factors(n,i);\n      ans=(ans*(a+1))%1000000007;\n    }\n  }\n  printf(\"%ld\\n\",ans);\n  return 0;\n}\n", "language": "C", "metadata": {"date": 1543645205, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "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/C/s347328082.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s347328082", "user_id": "u014847606"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "#include<stdio.h>\n#include<math.h>\nint num_of_factors(int n,int k){\n  int ans=0;\n  int m=k;\n  while(n/k!=0){\n    ans+=n/k;\n    k*=m;\n  }\n  return ans;\n}\n     \nint main(){\n  int n,i,j,flag,a;\n  long ans=1;\n  scanf(\"%d\",&n);\n  for(i=2;i<=n;i++){\n    flag=1;\n    for(j=2;j<=(int)sqrt(i);j++){\n      if(i%j==0) flag=0;\n    }\n    if(flag==1) {\n      a=num_of_factors(n,i);\n      ans=(ans*(a+1))%1000000007;\n    }\n  }\n  printf(\"%ld\\n\",ans);\n  return 0;\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": 449, "cpu_time_ms": 2, "memory_kb": 256}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s551415182", "group_id": "codeNet:p03834", "input_text": "#include<stdio.h>\nint main()\n{\n    char s[19],x=',';\n    int i;\n    scanf(\"%s\",&s);\n    for(i=0;s[i]!='\\0';i++)\n    {\n\n        if(s[i]==',')\n        {\n            s[i]=' ';\n        }\n    }\n    printf(\"%s\\n\",s);\n    return 0;\n}\n", "language": "C", "metadata": {"date": 1559275475, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "problem_description_relpath": "problem_descriptions/p03834.html", "problem_id": "p03834", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03834/input.txt", "sample_output_relpath": "derived/input_output/data/p03834/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03834/C/s551415182.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s551415182", "user_id": "u816631826"}, "prompt_components": {"gold_output": "happy newyear enjoy\n", "input_to_evaluate": "#include<stdio.h>\nint main()\n{\n    char s[19],x=',';\n    int i;\n    scanf(\"%s\",&s);\n    for(i=0;s[i]!='\\0';i++)\n    {\n\n        if(s[i]==',')\n        {\n            s[i]=' ';\n        }\n    }\n    printf(\"%s\\n\",s);\n    return 0;\n}\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nAs a New Year's gift, Dolphin received a string s of length 19.\n\nThe string s has the following format: [five lowercase English letters],[seven lowercase English letters],[five lowercase English letters].\n\nDolphin wants to convert the comma-separated string s into a space-separated string.\n\nWrite a program to perform the conversion for him.\n\nConstraints\n\nThe length of s is 19.\n\nThe sixth and fourteenth characters in s are ,.\n\nThe other characters in s are lowercase English letters.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\ns\n\nOutput\n\nPrint the string after the conversion.\n\nSample Input 1\n\nhappy,newyear,enjoy\n\nSample Output 1\n\nhappy newyear enjoy\n\nReplace all the commas in happy,newyear,enjoy with spaces to obtain happy newyear enjoy.\n\nSample Input 2\n\nhaiku,atcoder,tasks\n\nSample Output 2\n\nhaiku atcoder tasks\n\nSample Input 3\n\nabcde,fghihgf,edcba\n\nSample Output 3\n\nabcde fghihgf edcba", "sample_input": "happy,newyear,enjoy\n"}, "reference_outputs": ["happy newyear enjoy\n"], "source_document_id": "p03834", "source_text": "Score : 100 points\n\nProblem Statement\n\nAs a New Year's gift, Dolphin received a string s of length 19.\n\nThe string s has the following format: [five lowercase English letters],[seven lowercase English letters],[five lowercase English letters].\n\nDolphin wants to convert the comma-separated string s into a space-separated string.\n\nWrite a program to perform the conversion for him.\n\nConstraints\n\nThe length of s is 19.\n\nThe sixth and fourteenth characters in s are ,.\n\nThe other characters in s are lowercase English letters.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\ns\n\nOutput\n\nPrint the string after the conversion.\n\nSample Input 1\n\nhappy,newyear,enjoy\n\nSample Output 1\n\nhappy newyear enjoy\n\nReplace all the commas in happy,newyear,enjoy with spaces to obtain happy newyear enjoy.\n\nSample Input 2\n\nhaiku,atcoder,tasks\n\nSample Output 2\n\nhaiku atcoder tasks\n\nSample Input 3\n\nabcde,fghihgf,edcba\n\nSample Output 3\n\nabcde fghihgf edcba", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 227, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s278385881", "group_id": "codeNet:p03834", "input_text": "#include <stdio.h>\nint main(void){\n    char data[25]={'\\0'};\n    scanf(\"%s\",data);\n    int loop1;\n    for(loop1=0;loop1<5;loop1++){\n        printf(\"%c\",data[loop1]);\n    }\n    printf(\" \");\n    for(loop1=6;loop1<13;loop1++){\n        printf(\"%c\",data[loop1]);\n    }\n    printf(\" \");\n    for(loop1=14;loop1<21;loop1++){\n        printf(\"%c\",data[loop1]);\n    }\n    printf(\"\\n\");\n    return 0;\n}\n", "language": "C", "metadata": {"date": 1483841127, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "problem_description_relpath": "problem_descriptions/p03834.html", "problem_id": "p03834", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03834/input.txt", "sample_output_relpath": "derived/input_output/data/p03834/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03834/C/s278385881.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s278385881", "user_id": "u926548116"}, "prompt_components": {"gold_output": "happy newyear enjoy\n", "input_to_evaluate": "#include <stdio.h>\nint main(void){\n    char data[25]={'\\0'};\n    scanf(\"%s\",data);\n    int loop1;\n    for(loop1=0;loop1<5;loop1++){\n        printf(\"%c\",data[loop1]);\n    }\n    printf(\" \");\n    for(loop1=6;loop1<13;loop1++){\n        printf(\"%c\",data[loop1]);\n    }\n    printf(\" \");\n    for(loop1=14;loop1<21;loop1++){\n        printf(\"%c\",data[loop1]);\n    }\n    printf(\"\\n\");\n    return 0;\n}\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nAs a New Year's gift, Dolphin received a string s of length 19.\n\nThe string s has the following format: [five lowercase English letters],[seven lowercase English letters],[five lowercase English letters].\n\nDolphin wants to convert the comma-separated string s into a space-separated string.\n\nWrite a program to perform the conversion for him.\n\nConstraints\n\nThe length of s is 19.\n\nThe sixth and fourteenth characters in s are ,.\n\nThe other characters in s are lowercase English letters.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\ns\n\nOutput\n\nPrint the string after the conversion.\n\nSample Input 1\n\nhappy,newyear,enjoy\n\nSample Output 1\n\nhappy newyear enjoy\n\nReplace all the commas in happy,newyear,enjoy with spaces to obtain happy newyear enjoy.\n\nSample Input 2\n\nhaiku,atcoder,tasks\n\nSample Output 2\n\nhaiku atcoder tasks\n\nSample Input 3\n\nabcde,fghihgf,edcba\n\nSample Output 3\n\nabcde fghihgf edcba", "sample_input": "happy,newyear,enjoy\n"}, "reference_outputs": ["happy newyear enjoy\n"], "source_document_id": "p03834", "source_text": "Score : 100 points\n\nProblem Statement\n\nAs a New Year's gift, Dolphin received a string s of length 19.\n\nThe string s has the following format: [five lowercase English letters],[seven lowercase English letters],[five lowercase English letters].\n\nDolphin wants to convert the comma-separated string s into a space-separated string.\n\nWrite a program to perform the conversion for him.\n\nConstraints\n\nThe length of s is 19.\n\nThe sixth and fourteenth characters in s are ,.\n\nThe other characters in s are lowercase English letters.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\ns\n\nOutput\n\nPrint the string after the conversion.\n\nSample Input 1\n\nhappy,newyear,enjoy\n\nSample Output 1\n\nhappy newyear enjoy\n\nReplace all the commas in happy,newyear,enjoy with spaces to obtain happy newyear enjoy.\n\nSample Input 2\n\nhaiku,atcoder,tasks\n\nSample Output 2\n\nhaiku atcoder tasks\n\nSample Input 3\n\nabcde,fghihgf,edcba\n\nSample Output 3\n\nabcde fghihgf edcba", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 391, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s023997279", "group_id": "codeNet:p03836", "input_text": "#include <stdio.h>\nint main(void){\n\tint sx,sy,tx,ty,i,j;\n\tscanf(\"%d%d%d%d\",&sx,&sy,&tx,&ty);\n\tfor(i=sy;i<ty;i++)printf(\"U\");\n\tfor(i=sx;i<tx;i++)printf(\"R\");\n\tfor(i=ty;i>sy;i--)printf(\"D\");\n\tfor(i=tx;i>sx-1;i--)printf(\"L\");\n\tfor(i=sy;i<ty+1;i++)printf(\"U\");\n\tfor(i=sx-1;i<tx;i++)printf(\"R\");\n\tprintf(\"D\");\n\tprintf(\"R\");\n\tfor(i=ty;i>tx-1;i--)printf(\"D\");\n\tfor(i=tx+1;i>sx;i--)printf(\"L\");\n\tprintf(\"U\\n\");\n\treturn 0;\n}", "language": "C", "metadata": {"date": 1539718795, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "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/C/s023997279.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s023997279", "user_id": "u853477575"}, "prompt_components": {"gold_output": "UURDDLLUUURRDRDDDLLU\n", "input_to_evaluate": "#include <stdio.h>\nint main(void){\n\tint sx,sy,tx,ty,i,j;\n\tscanf(\"%d%d%d%d\",&sx,&sy,&tx,&ty);\n\tfor(i=sy;i<ty;i++)printf(\"U\");\n\tfor(i=sx;i<tx;i++)printf(\"R\");\n\tfor(i=ty;i>sy;i--)printf(\"D\");\n\tfor(i=tx;i>sx-1;i--)printf(\"L\");\n\tfor(i=sy;i<ty+1;i++)printf(\"U\");\n\tfor(i=sx-1;i<tx;i++)printf(\"R\");\n\tprintf(\"D\");\n\tprintf(\"R\");\n\tfor(i=ty;i>tx-1;i--)printf(\"D\");\n\tfor(i=tx+1;i>sx;i--)printf(\"L\");\n\tprintf(\"U\\n\");\n\treturn 0;\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": 415, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s411143323", "group_id": "codeNet:p03844", "input_text": "#include<stdio.h>\n\nint main()\n\n{\n\n  int a,b,res;\n  char c;\n\n  scanf (\"%d %c %d\",&a, &c, &b);\n  switch(c)\n  {\n    case '+': res=a+b;\n    printf(\"%d\",res);\n    break;\n\n    case '-': res=a-b;\n    printf(\"%d\",res);\n    break;\n\n  }\n\n  return 0;\n}\n", "language": "C", "metadata": {"date": 1597988765, "filename_ext": "c", "original_language": "C (GCC 9.2.1)", "problem_description_relpath": "problem_descriptions/p03844.html", "problem_id": "p03844", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03844/input.txt", "sample_output_relpath": "derived/input_output/data/p03844/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03844/C/s411143323.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s411143323", "user_id": "u353919145"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "#include<stdio.h>\n\nint main()\n\n{\n\n  int a,b,res;\n  char c;\n\n  scanf (\"%d %c %d\",&a, &c, &b);\n  switch(c)\n  {\n    case '+': res=a+b;\n    printf(\"%d\",res);\n    break;\n\n    case '-': res=a-b;\n    printf(\"%d\",res);\n    break;\n\n  }\n\n  return 0;\n}\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nJoisino wants to evaluate the formula \"A op B\".\nHere, A and B are integers, and the binary operator op is either + or -.\nYour task is to evaluate the formula instead of her.\n\nConstraints\n\n1≦A,B≦10^9\n\nop is either + or -.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nA op B\n\nOutput\n\nEvaluate the formula and print the result.\n\nSample Input 1\n\n1 + 2\n\nSample Output 1\n\n3\n\nSince 1 + 2 = 3, the output should be 3.\n\nSample Input 2\n\n5 - 7\n\nSample Output 2\n\n-2", "sample_input": "1 + 2\n"}, "reference_outputs": ["3\n"], "source_document_id": "p03844", "source_text": "Score : 100 points\n\nProblem Statement\n\nJoisino wants to evaluate the formula \"A op B\".\nHere, A and B are integers, and the binary operator op is either + or -.\nYour task is to evaluate the formula instead of her.\n\nConstraints\n\n1≦A,B≦10^9\n\nop is either + or -.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nA op B\n\nOutput\n\nEvaluate the formula and print the result.\n\nSample Input 1\n\n1 + 2\n\nSample Output 1\n\n3\n\nSince 1 + 2 = 3, the output should be 3.\n\nSample Input 2\n\n5 - 7\n\nSample Output 2\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": 242, "cpu_time_ms": 4, "memory_kb": 1684}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s010948914", "group_id": "codeNet:p03844", "input_text": "#include<stdio.h>\n#include<string.h>\nint main(void){\n  int A,B;\n  char op[5];\n  scanf(\"%d %s %d\",&A,op,&B);\n  if(strcmp(op,\"+\")==0){\n    printf(\"%d\",A+B);\n  }else if(strcmp(op,\"-\")==0){\n    printf(\"%d\",A-B);\n  }\n  return 0;\n}", "language": "C", "metadata": {"date": 1585439917, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "problem_description_relpath": "problem_descriptions/p03844.html", "problem_id": "p03844", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03844/input.txt", "sample_output_relpath": "derived/input_output/data/p03844/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03844/C/s010948914.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s010948914", "user_id": "u716903426"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "#include<stdio.h>\n#include<string.h>\nint main(void){\n  int A,B;\n  char op[5];\n  scanf(\"%d %s %d\",&A,op,&B);\n  if(strcmp(op,\"+\")==0){\n    printf(\"%d\",A+B);\n  }else if(strcmp(op,\"-\")==0){\n    printf(\"%d\",A-B);\n  }\n  return 0;\n}", "problem_context": "Score : 100 points\n\nProblem Statement\n\nJoisino wants to evaluate the formula \"A op B\".\nHere, A and B are integers, and the binary operator op is either + or -.\nYour task is to evaluate the formula instead of her.\n\nConstraints\n\n1≦A,B≦10^9\n\nop is either + or -.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nA op B\n\nOutput\n\nEvaluate the formula and print the result.\n\nSample Input 1\n\n1 + 2\n\nSample Output 1\n\n3\n\nSince 1 + 2 = 3, the output should be 3.\n\nSample Input 2\n\n5 - 7\n\nSample Output 2\n\n-2", "sample_input": "1 + 2\n"}, "reference_outputs": ["3\n"], "source_document_id": "p03844", "source_text": "Score : 100 points\n\nProblem Statement\n\nJoisino wants to evaluate the formula \"A op B\".\nHere, A and B are integers, and the binary operator op is either + or -.\nYour task is to evaluate the formula instead of her.\n\nConstraints\n\n1≦A,B≦10^9\n\nop is either + or -.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nA op B\n\nOutput\n\nEvaluate the formula and print the result.\n\nSample Input 1\n\n1 + 2\n\nSample Output 1\n\n3\n\nSince 1 + 2 = 3, the output should be 3.\n\nSample Input 2\n\n5 - 7\n\nSample Output 2\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": 225, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s437931259", "group_id": "codeNet:p03844", "input_text": "#include<stdio.h>\nint main()\n{\n    long long int A,B;\n    char C;\n\n    scanf(\"%lli %c %lli\", &A , &C, &B);\n\n    if(C=='+')\n        printf(\"%d\\n\",A+B);\n    else if(C=='-')\n        printf(\"%d\\n\",A-B);\n        else\n            return;\n}\n", "language": "C", "metadata": {"date": 1571672074, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "problem_description_relpath": "problem_descriptions/p03844.html", "problem_id": "p03844", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03844/input.txt", "sample_output_relpath": "derived/input_output/data/p03844/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03844/C/s437931259.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s437931259", "user_id": "u089230684"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "#include<stdio.h>\nint main()\n{\n    long long int A,B;\n    char C;\n\n    scanf(\"%lli %c %lli\", &A , &C, &B);\n\n    if(C=='+')\n        printf(\"%d\\n\",A+B);\n    else if(C=='-')\n        printf(\"%d\\n\",A-B);\n        else\n            return;\n}\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nJoisino wants to evaluate the formula \"A op B\".\nHere, A and B are integers, and the binary operator op is either + or -.\nYour task is to evaluate the formula instead of her.\n\nConstraints\n\n1≦A,B≦10^9\n\nop is either + or -.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nA op B\n\nOutput\n\nEvaluate the formula and print the result.\n\nSample Input 1\n\n1 + 2\n\nSample Output 1\n\n3\n\nSince 1 + 2 = 3, the output should be 3.\n\nSample Input 2\n\n5 - 7\n\nSample Output 2\n\n-2", "sample_input": "1 + 2\n"}, "reference_outputs": ["3\n"], "source_document_id": "p03844", "source_text": "Score : 100 points\n\nProblem Statement\n\nJoisino wants to evaluate the formula \"A op B\".\nHere, A and B are integers, and the binary operator op is either + or -.\nYour task is to evaluate the formula instead of her.\n\nConstraints\n\n1≦A,B≦10^9\n\nop is either + or -.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nA op B\n\nOutput\n\nEvaluate the formula and print the result.\n\nSample Input 1\n\n1 + 2\n\nSample Output 1\n\n3\n\nSince 1 + 2 = 3, the output should be 3.\n\nSample Input 2\n\n5 - 7\n\nSample Output 2\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": 234, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s835436444", "group_id": "codeNet:p03844", "input_text": "#include <stdio.h>\n\nint main(void)\n{\n    int a,b;\n    char op;\n    scanf(\"%d %c %d\", &a,&op,&b);\n    switch(op) {\n        case'+':printf(\"%d\",a+b);\n                break;\n        case'-':printf(\"%d\",a-b);\n                break;\n    }\n    return 0;\n}\n", "language": "C", "metadata": {"date": 1482112986, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "problem_description_relpath": "problem_descriptions/p03844.html", "problem_id": "p03844", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03844/input.txt", "sample_output_relpath": "derived/input_output/data/p03844/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03844/C/s835436444.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s835436444", "user_id": "u434149288"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "#include <stdio.h>\n\nint main(void)\n{\n    int a,b;\n    char op;\n    scanf(\"%d %c %d\", &a,&op,&b);\n    switch(op) {\n        case'+':printf(\"%d\",a+b);\n                break;\n        case'-':printf(\"%d\",a-b);\n                break;\n    }\n    return 0;\n}\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nJoisino wants to evaluate the formula \"A op B\".\nHere, A and B are integers, and the binary operator op is either + or -.\nYour task is to evaluate the formula instead of her.\n\nConstraints\n\n1≦A,B≦10^9\n\nop is either + or -.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nA op B\n\nOutput\n\nEvaluate the formula and print the result.\n\nSample Input 1\n\n1 + 2\n\nSample Output 1\n\n3\n\nSince 1 + 2 = 3, the output should be 3.\n\nSample Input 2\n\n5 - 7\n\nSample Output 2\n\n-2", "sample_input": "1 + 2\n"}, "reference_outputs": ["3\n"], "source_document_id": "p03844", "source_text": "Score : 100 points\n\nProblem Statement\n\nJoisino wants to evaluate the formula \"A op B\".\nHere, A and B are integers, and the binary operator op is either + or -.\nYour task is to evaluate the formula instead of her.\n\nConstraints\n\n1≦A,B≦10^9\n\nop is either + or -.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nA op B\n\nOutput\n\nEvaluate the formula and print the result.\n\nSample Input 1\n\n1 + 2\n\nSample Output 1\n\n3\n\nSince 1 + 2 = 3, the output should be 3.\n\nSample Input 2\n\n5 - 7\n\nSample Output 2\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": 250, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s787275981", "group_id": "codeNet:p03845", "input_text": "#include <stdio.h>\n\nint main() {\n  int number_of_questions, i, sum = 0, kind_of_drinks, i_th_question, i_th_question_time;\n  scanf(\"%d\", &number_of_questions);\n  int time[number_of_questions];\n  for(i = 0; i < number_of_questions; i++) {\n    scanf(\"%d\", &time[i]);\n    sum += time[i];\n  }\n  scanf(\"%d\", &kind_of_drinks);\n  for(i = 0; i < kind_of_drinks; i++) {\n    scanf(\"%d %d\", &i_th_question, &i_th_question_time);\n    i_th_question--;\n    printf(\"%d\\n\", sum + i_th_question_time - time[i_th_question]);\n  }\n  return 0;\n}\n", "language": "C", "metadata": {"date": 1559263664, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "problem_description_relpath": "problem_descriptions/p03845.html", "problem_id": "p03845", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03845/input.txt", "sample_output_relpath": "derived/input_output/data/p03845/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03845/C/s787275981.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s787275981", "user_id": "u675751622"}, "prompt_components": {"gold_output": "6\n9\n", "input_to_evaluate": "#include <stdio.h>\n\nint main() {\n  int number_of_questions, i, sum = 0, kind_of_drinks, i_th_question, i_th_question_time;\n  scanf(\"%d\", &number_of_questions);\n  int time[number_of_questions];\n  for(i = 0; i < number_of_questions; i++) {\n    scanf(\"%d\", &time[i]);\n    sum += time[i];\n  }\n  scanf(\"%d\", &kind_of_drinks);\n  for(i = 0; i < kind_of_drinks; i++) {\n    scanf(\"%d %d\", &i_th_question, &i_th_question_time);\n    i_th_question--;\n    printf(\"%d\\n\", sum + i_th_question_time - time[i_th_question]);\n  }\n  return 0;\n}\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nJoisino is about to compete in the final round of a certain programming competition.\nIn this contest, there are N problems, numbered 1 through N.\nJoisino knows that it takes her T_i seconds to solve problem i(1≦i≦N).\n\nAlso, there are M kinds of drinks offered to the contestants, numbered 1 through M.\nIf Joisino takes drink i(1≦i≦M), her brain will be stimulated and the time it takes for her to solve problem P_i will become X_i seconds.\nIt does not affect the time to solve the other problems.\n\nA contestant is allowed to take exactly one of the drinks before the start of the contest.\nFor each drink, Joisino wants to know how many seconds it takes her to solve all the problems if she takes that drink.\nHere, assume that the time it takes her to solve all the problems is equal to the sum of the time it takes for her to solve individual problems.\nYour task is to write a program to calculate it instead of her.\n\nConstraints\n\nAll input values are integers.\n\n1≦N≦100\n\n1≦T_i≦10^5\n\n1≦M≦100\n\n1≦P_i≦N\n\n1≦X_i≦10^5\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\nT_1 T_2 ... T_N\nM\nP_1 X_1\nP_2 X_2\n:\nP_M X_M\n\nOutput\n\nFor each drink, calculate how many seconds it takes Joisino to solve all the problems if she takes that drink, and print the results, one per line.\n\nSample Input 1\n\n3\n2 1 4\n2\n1 1\n2 3\n\nSample Output 1\n\n6\n9\n\nIf Joisino takes drink 1, the time it takes her to solve each problem will be 1, 1 and 4 seconds, respectively, totaling 6 seconds.\n\nIf Joisino takes drink 2, the time it takes her to solve each problem will be 2, 3 and 4 seconds, respectively, totaling 9 seconds.\n\nSample Input 2\n\n5\n7 2 3 8 5\n3\n4 2\n1 7\n4 13\n\nSample Output 2\n\n19\n25\n30", "sample_input": "3\n2 1 4\n2\n1 1\n2 3\n"}, "reference_outputs": ["6\n9\n"], "source_document_id": "p03845", "source_text": "Score : 200 points\n\nProblem Statement\n\nJoisino is about to compete in the final round of a certain programming competition.\nIn this contest, there are N problems, numbered 1 through N.\nJoisino knows that it takes her T_i seconds to solve problem i(1≦i≦N).\n\nAlso, there are M kinds of drinks offered to the contestants, numbered 1 through M.\nIf Joisino takes drink i(1≦i≦M), her brain will be stimulated and the time it takes for her to solve problem P_i will become X_i seconds.\nIt does not affect the time to solve the other problems.\n\nA contestant is allowed to take exactly one of the drinks before the start of the contest.\nFor each drink, Joisino wants to know how many seconds it takes her to solve all the problems if she takes that drink.\nHere, assume that the time it takes her to solve all the problems is equal to the sum of the time it takes for her to solve individual problems.\nYour task is to write a program to calculate it instead of her.\n\nConstraints\n\nAll input values are integers.\n\n1≦N≦100\n\n1≦T_i≦10^5\n\n1≦M≦100\n\n1≦P_i≦N\n\n1≦X_i≦10^5\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\nT_1 T_2 ... T_N\nM\nP_1 X_1\nP_2 X_2\n:\nP_M X_M\n\nOutput\n\nFor each drink, calculate how many seconds it takes Joisino to solve all the problems if she takes that drink, and print the results, one per line.\n\nSample Input 1\n\n3\n2 1 4\n2\n1 1\n2 3\n\nSample Output 1\n\n6\n9\n\nIf Joisino takes drink 1, the time it takes her to solve each problem will be 1, 1 and 4 seconds, respectively, totaling 6 seconds.\n\nIf Joisino takes drink 2, the time it takes her to solve each problem will be 2, 3 and 4 seconds, respectively, totaling 9 seconds.\n\nSample Input 2\n\n5\n7 2 3 8 5\n3\n4 2\n1 7\n4 13\n\nSample Output 2\n\n19\n25\n30", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s542864952", "group_id": "codeNet:p03846", "input_text": "#include <stdio.h>\n\n#define MOD 1000000007\n\ntypedef long long ll;\n\n#define MAX_NUM 100\n\nll powLL( ll a, ll b ){\n  ll i;\n  ll count = 1;\n  for( i = 0; i < a; i++ ){\n    count = (count * b)%MOD;\n  }\n  return count;\n}\n\nint main( void ){\n  int i;\n  ll N;\n  int A[MAX_NUM] = {0};\n  int tmp;\n  int flg = 0;\n\n  scanf( \"%lld\", &N );\n  for( i = 0; i < N; i++ ){\n    scanf( \"%d\", &tmp );\n    A[tmp]++;\n  }\n\n  for( i = 0; i < N; i++ ){\n    printf( \"%d\\n\", A[i] );\n  }\n\n\n  if( N%2 == 1 && A[0] == 1 && A[1] == 0 ){\n    for( i = 2; i < N; i+=2 ){\n      if( !(A[i] == 2 && A[i+1] == 0) ){\n        flg = 1;\n        break;\n      }\n    }\n  }else if( N%2 == 0 ){\n    for( i = 1; i < N; i+=2 ){\n      if( !(A[i] == 2 && A[i-1] == 0) ){\n        flg = 1;\n        break;\n      }\n    }\n  }else{\n    flg = 1;\n  }\n\n  printf( \"%lld\\n\", flg == 0 ? powLL(2,N/2) : 0 );\n\n  return 0;\n}\n", "language": "C", "metadata": {"date": 1482118435, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "problem_description_relpath": "problem_descriptions/p03846.html", "problem_id": "p03846", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03846/input.txt", "sample_output_relpath": "derived/input_output/data/p03846/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03846/C/s542864952.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s542864952", "user_id": "u566228044"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "#include <stdio.h>\n\n#define MOD 1000000007\n\ntypedef long long ll;\n\n#define MAX_NUM 100\n\nll powLL( ll a, ll b ){\n  ll i;\n  ll count = 1;\n  for( i = 0; i < a; i++ ){\n    count = (count * b)%MOD;\n  }\n  return count;\n}\n\nint main( void ){\n  int i;\n  ll N;\n  int A[MAX_NUM] = {0};\n  int tmp;\n  int flg = 0;\n\n  scanf( \"%lld\", &N );\n  for( i = 0; i < N; i++ ){\n    scanf( \"%d\", &tmp );\n    A[tmp]++;\n  }\n\n  for( i = 0; i < N; i++ ){\n    printf( \"%d\\n\", A[i] );\n  }\n\n\n  if( N%2 == 1 && A[0] == 1 && A[1] == 0 ){\n    for( i = 2; i < N; i+=2 ){\n      if( !(A[i] == 2 && A[i+1] == 0) ){\n        flg = 1;\n        break;\n      }\n    }\n  }else if( N%2 == 0 ){\n    for( i = 1; i < N; i+=2 ){\n      if( !(A[i] == 2 && A[i-1] == 0) ){\n        flg = 1;\n        break;\n      }\n    }\n  }else{\n    flg = 1;\n  }\n\n  printf( \"%lld\\n\", flg == 0 ? powLL(2,N/2) : 0 );\n\n  return 0;\n}\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere are N people, conveniently numbered 1 through N.\nThey were standing in a row yesterday, but now they are unsure of the order in which they were standing.\nHowever, each person remembered the following fact: the absolute difference of the number of the people who were standing to the left of that person, and the number of the people who were standing to the right of that person.\nAccording to their reports, the difference above for person i is A_i.\n\nBased on these reports, find the number of the possible orders in which they were standing.\nSince it can be extremely large, print the answer modulo 10^9+7.\nNote that the reports may be incorrect and thus there may be no consistent order.\nIn such a case, print 0.\n\nConstraints\n\n1≦N≦10^5\n\n0≦A_i≦N-1\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 number of the possible orders in which they were standing, modulo 10^9+7.\n\nSample Input 1\n\n5\n2 4 4 0 2\n\nSample Output 1\n\n4\n\nThere are four possible orders, as follows:\n\n2,1,4,5,3\n\n2,5,4,1,3\n\n3,1,4,5,2\n\n3,5,4,1,2\n\nSample Input 2\n\n7\n6 4 0 2 4 0 2\n\nSample Output 2\n\n0\n\nAny order would be inconsistent with the reports, thus the answer is 0.\n\nSample Input 3\n\n8\n7 5 1 1 7 3 5 3\n\nSample Output 3\n\n16", "sample_input": "5\n2 4 4 0 2\n"}, "reference_outputs": ["4\n"], "source_document_id": "p03846", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere are N people, conveniently numbered 1 through N.\nThey were standing in a row yesterday, but now they are unsure of the order in which they were standing.\nHowever, each person remembered the following fact: the absolute difference of the number of the people who were standing to the left of that person, and the number of the people who were standing to the right of that person.\nAccording to their reports, the difference above for person i is A_i.\n\nBased on these reports, find the number of the possible orders in which they were standing.\nSince it can be extremely large, print the answer modulo 10^9+7.\nNote that the reports may be incorrect and thus there may be no consistent order.\nIn such a case, print 0.\n\nConstraints\n\n1≦N≦10^5\n\n0≦A_i≦N-1\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 number of the possible orders in which they were standing, modulo 10^9+7.\n\nSample Input 1\n\n5\n2 4 4 0 2\n\nSample Output 1\n\n4\n\nThere are four possible orders, as follows:\n\n2,1,4,5,3\n\n2,5,4,1,3\n\n3,1,4,5,2\n\n3,5,4,1,2\n\nSample Input 2\n\n7\n6 4 0 2 4 0 2\n\nSample Output 2\n\n0\n\nAny order would be inconsistent with the reports, thus the answer is 0.\n\nSample Input 3\n\n8\n7 5 1 1 7 3 5 3\n\nSample Output 3\n\n16", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 671, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s600573804", "group_id": "codeNet:p03852", "input_text": "#include<stdio.h>\nint main()\n{\n   char ch;\n   scanf(\"%c\",&ch);\n   if(ch=='a' || ch=='e' ||ch=='o' || ch=='i' || ch=='u')\n   {\n       printf(\"vowel\\n\");\n   }\n   else\n   {\n       printf(\"consonant\\n\");\n   }\n   return 0;\n}\n", "language": "C", "metadata": {"date": 1541831713, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "problem_description_relpath": "problem_descriptions/p03852.html", "problem_id": "p03852", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03852/input.txt", "sample_output_relpath": "derived/input_output/data/p03852/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03852/C/s600573804.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s600573804", "user_id": "u816631826"}, "prompt_components": {"gold_output": "vowel\n", "input_to_evaluate": "#include<stdio.h>\nint main()\n{\n   char ch;\n   scanf(\"%c\",&ch);\n   if(ch=='a' || ch=='e' ||ch=='o' || ch=='i' || ch=='u')\n   {\n       printf(\"vowel\\n\");\n   }\n   else\n   {\n       printf(\"consonant\\n\");\n   }\n   return 0;\n}\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nGiven a lowercase English letter c, determine whether it is a vowel. Here, there are five vowels in the English alphabet: a, e, i, o and u.\n\nConstraints\n\nc is a lowercase English letter.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nc\n\nOutput\n\nIf c is a vowel, print vowel. Otherwise, print consonant.\n\nSample Input 1\n\na\n\nSample Output 1\n\nvowel\n\nSince a is a vowel, print vowel.\n\nSample Input 2\n\nz\n\nSample Output 2\n\nconsonant\n\nSample Input 3\n\ns\n\nSample Output 3\n\nconsonant", "sample_input": "a\n"}, "reference_outputs": ["vowel\n"], "source_document_id": "p03852", "source_text": "Score : 100 points\n\nProblem Statement\n\nGiven a lowercase English letter c, determine whether it is a vowel. Here, there are five vowels in the English alphabet: a, e, i, o and u.\n\nConstraints\n\nc is a lowercase English letter.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nc\n\nOutput\n\nIf c is a vowel, print vowel. Otherwise, print consonant.\n\nSample Input 1\n\na\n\nSample Output 1\n\nvowel\n\nSince a is a vowel, print vowel.\n\nSample Input 2\n\nz\n\nSample Output 2\n\nconsonant\n\nSample Input 3\n\ns\n\nSample Output 3\n\nconsonant", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s960170787", "group_id": "codeNet:p03853", "input_text": "#include<stdio.h>\n\nint main(){\n  int h, w;\n  scanf(\"%d %d\", &h, &w);\n  char c[h][w];\n  for (int i = 0; i < h; i++){\n    scanf(\"%s\", &c[i]);\n    printf(\"%s\\n\", c[i]);\n    printf(\"%s\\n\", c[i]);\n  }\n  \n  return 0;\n}", "language": "C", "metadata": {"date": 1558938595, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "problem_description_relpath": "problem_descriptions/p03853.html", "problem_id": "p03853", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03853/input.txt", "sample_output_relpath": "derived/input_output/data/p03853/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03853/C/s960170787.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s960170787", "user_id": "u789673251"}, "prompt_components": {"gold_output": "*.\n*.\n.*\n.*\n", "input_to_evaluate": "#include<stdio.h>\n\nint main(){\n  int h, w;\n  scanf(\"%d %d\", &h, &w);\n  char c[h][w];\n  for (int i = 0; i < h; i++){\n    scanf(\"%s\", &c[i]);\n    printf(\"%s\\n\", c[i]);\n    printf(\"%s\\n\", c[i]);\n  }\n  \n  return 0;\n}", "problem_context": "Score : 200 points\n\nProblem Statement\n\nThere is an image with a height of H pixels and a width of W pixels. Each of the pixels is represented by either . or *. The character representing the pixel at the i-th row from the top and the j-th column from the left, is denoted by C_{i,j}.\n\nExtend this image vertically so that its height is doubled. That is, print a image with a height of 2H pixels and a width of W pixels where the pixel at the i-th row and j-th column is equal to C_{(i+1)/2,j} (the result of division is rounded down).\n\nConstraints\n\n1≦H, W≦100\n\nC_{i,j} is either . or *.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nH W\nC_{1,1}...C_{1,W}\n:\nC_{H,1}...C_{H,W}\n\nOutput\n\nPrint the extended image.\n\nSample Input 1\n\n2 2\n*.\n.*\n\nSample Output 1\n\n*.\n*.\n.*\n.*\n\nSample Input 2\n\n1 4\n***.\n\nSample Output 2\n\n***.\n***.\n\nSample Input 3\n\n9 20\n.....***....***.....\n....*...*..*...*....\n...*.....**.....*...\n...*.....*......*...\n....*.....*....*....\n.....**..*...**.....\n.......*..*.*.......\n........**.*........\n.........**.........\n\nSample Output 3\n\n.....***....***.....\n.....***....***.....\n....*...*..*...*....\n....*...*..*...*....\n...*.....**.....*...\n...*.....**.....*...\n...*.....*......*...\n...*.....*......*...\n....*.....*....*....\n....*.....*....*....\n.....**..*...**.....\n.....**..*...**.....\n.......*..*.*.......\n.......*..*.*.......\n........**.*........\n........**.*........\n.........**.........\n.........**.........", "sample_input": "2 2\n*.\n.*\n"}, "reference_outputs": ["*.\n*.\n.*\n.*\n"], "source_document_id": "p03853", "source_text": "Score : 200 points\n\nProblem Statement\n\nThere is an image with a height of H pixels and a width of W pixels. Each of the pixels is represented by either . or *. The character representing the pixel at the i-th row from the top and the j-th column from the left, is denoted by C_{i,j}.\n\nExtend this image vertically so that its height is doubled. That is, print a image with a height of 2H pixels and a width of W pixels where the pixel at the i-th row and j-th column is equal to C_{(i+1)/2,j} (the result of division is rounded down).\n\nConstraints\n\n1≦H, W≦100\n\nC_{i,j} is either . or *.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nH W\nC_{1,1}...C_{1,W}\n:\nC_{H,1}...C_{H,W}\n\nOutput\n\nPrint the extended image.\n\nSample Input 1\n\n2 2\n*.\n.*\n\nSample Output 1\n\n*.\n*.\n.*\n.*\n\nSample Input 2\n\n1 4\n***.\n\nSample Output 2\n\n***.\n***.\n\nSample Input 3\n\n9 20\n.....***....***.....\n....*...*..*...*....\n...*.....**.....*...\n...*.....*......*...\n....*.....*....*....\n.....**..*...**.....\n.......*..*.*.......\n........**.*........\n.........**.........\n\nSample Output 3\n\n.....***....***.....\n.....***....***.....\n....*...*..*...*....\n....*...*..*...*....\n...*.....**.....*...\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": 212, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s134930841", "group_id": "codeNet:p03860", "input_text": "#include <stdio.h>\nint main()\n{\n    char s1[200],s2[200],s3[200];\n    scanf(\"%s%s%s\",s1,s2,s3);\n    printf(\"A%cC\\n\",s2[0]);\n    return 0;\n}", "language": "C", "metadata": {"date": 1565392220, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "problem_description_relpath": "problem_descriptions/p03860.html", "problem_id": "p03860", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03860/input.txt", "sample_output_relpath": "derived/input_output/data/p03860/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03860/C/s134930841.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s134930841", "user_id": "u606393507"}, "prompt_components": {"gold_output": "ABC\n", "input_to_evaluate": "#include <stdio.h>\nint main()\n{\n    char s1[200],s2[200],s3[200];\n    scanf(\"%s%s%s\",s1,s2,s3);\n    printf(\"A%cC\\n\",s2[0]);\n    return 0;\n}", "problem_context": "Score : 100 points\n\nProblem Statement\n\nSnuke is going to open a contest named \"AtCoder s Contest\".\nHere, s is a string of length 1 or greater, where the first character is an uppercase English letter, and the second and subsequent characters are lowercase English letters.\n\nSnuke has decided to abbreviate the name of the contest as \"AxC\".\nHere, x is the uppercase English letter at the beginning of s.\n\nGiven the name of the contest, print the abbreviation of the name.\n\nConstraints\n\nThe length of s is between 1 and 100, inclusive.\n\nThe first character in s is an uppercase English letter.\n\nThe second and subsequent characters in s are lowercase English letters.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nAtCoder s Contest\n\nOutput\n\nPrint the abbreviation of the name of the contest.\n\nSample Input 1\n\nAtCoder Beginner Contest\n\nSample Output 1\n\nABC\n\nThe contest in which you are participating now.\n\nSample Input 2\n\nAtCoder Snuke Contest\n\nSample Output 2\n\nASC\n\nThis contest does not actually exist.\n\nSample Input 3\n\nAtCoder X Contest\n\nSample Output 3\n\nAXC", "sample_input": "AtCoder Beginner Contest\n"}, "reference_outputs": ["ABC\n"], "source_document_id": "p03860", "source_text": "Score : 100 points\n\nProblem Statement\n\nSnuke is going to open a contest named \"AtCoder s Contest\".\nHere, s is a string of length 1 or greater, where the first character is an uppercase English letter, and the second and subsequent characters are lowercase English letters.\n\nSnuke has decided to abbreviate the name of the contest as \"AxC\".\nHere, x is the uppercase English letter at the beginning of s.\n\nGiven the name of the contest, print the abbreviation of the name.\n\nConstraints\n\nThe length of s is between 1 and 100, inclusive.\n\nThe first character in s is an uppercase English letter.\n\nThe second and subsequent characters in s are lowercase English letters.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nAtCoder s Contest\n\nOutput\n\nPrint the abbreviation of the name of the contest.\n\nSample Input 1\n\nAtCoder Beginner Contest\n\nSample Output 1\n\nABC\n\nThe contest in which you are participating now.\n\nSample Input 2\n\nAtCoder Snuke Contest\n\nSample Output 2\n\nASC\n\nThis contest does not actually exist.\n\nSample Input 3\n\nAtCoder X Contest\n\nSample Output 3\n\nAXC", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 139, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s357611077", "group_id": "codeNet:p03860", "input_text": "#include<stdio.h>\n#include<string.h>\n\nint main(void)\n{\n     char a[10];\n     char b[100];\n     char c[10];\n     scanf(\"%s\",a);\n     scanf(\"%s\",b);\n     scanf(\"%s\",c);\n     printf(\"%c%c%c\\n\",a[0],b[0],c[0]);\n     return 0;\n}", "language": "C", "metadata": {"date": 1508187337, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "problem_description_relpath": "problem_descriptions/p03860.html", "problem_id": "p03860", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03860/input.txt", "sample_output_relpath": "derived/input_output/data/p03860/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03860/C/s357611077.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s357611077", "user_id": "u671395265"}, "prompt_components": {"gold_output": "ABC\n", "input_to_evaluate": "#include<stdio.h>\n#include<string.h>\n\nint main(void)\n{\n     char a[10];\n     char b[100];\n     char c[10];\n     scanf(\"%s\",a);\n     scanf(\"%s\",b);\n     scanf(\"%s\",c);\n     printf(\"%c%c%c\\n\",a[0],b[0],c[0]);\n     return 0;\n}", "problem_context": "Score : 100 points\n\nProblem Statement\n\nSnuke is going to open a contest named \"AtCoder s Contest\".\nHere, s is a string of length 1 or greater, where the first character is an uppercase English letter, and the second and subsequent characters are lowercase English letters.\n\nSnuke has decided to abbreviate the name of the contest as \"AxC\".\nHere, x is the uppercase English letter at the beginning of s.\n\nGiven the name of the contest, print the abbreviation of the name.\n\nConstraints\n\nThe length of s is between 1 and 100, inclusive.\n\nThe first character in s is an uppercase English letter.\n\nThe second and subsequent characters in s are lowercase English letters.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nAtCoder s Contest\n\nOutput\n\nPrint the abbreviation of the name of the contest.\n\nSample Input 1\n\nAtCoder Beginner Contest\n\nSample Output 1\n\nABC\n\nThe contest in which you are participating now.\n\nSample Input 2\n\nAtCoder Snuke Contest\n\nSample Output 2\n\nASC\n\nThis contest does not actually exist.\n\nSample Input 3\n\nAtCoder X Contest\n\nSample Output 3\n\nAXC", "sample_input": "AtCoder Beginner Contest\n"}, "reference_outputs": ["ABC\n"], "source_document_id": "p03860", "source_text": "Score : 100 points\n\nProblem Statement\n\nSnuke is going to open a contest named \"AtCoder s Contest\".\nHere, s is a string of length 1 or greater, where the first character is an uppercase English letter, and the second and subsequent characters are lowercase English letters.\n\nSnuke has decided to abbreviate the name of the contest as \"AxC\".\nHere, x is the uppercase English letter at the beginning of s.\n\nGiven the name of the contest, print the abbreviation of the name.\n\nConstraints\n\nThe length of s is between 1 and 100, inclusive.\n\nThe first character in s is an uppercase English letter.\n\nThe second and subsequent characters in s are lowercase English letters.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nAtCoder s Contest\n\nOutput\n\nPrint the abbreviation of the name of the contest.\n\nSample Input 1\n\nAtCoder Beginner Contest\n\nSample Output 1\n\nABC\n\nThe contest in which you are participating now.\n\nSample Input 2\n\nAtCoder Snuke Contest\n\nSample Output 2\n\nASC\n\nThis contest does not actually exist.\n\nSample Input 3\n\nAtCoder X Contest\n\nSample Output 3\n\nAXC", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 223, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s680907901", "group_id": "codeNet:p03860", "input_text": "#include <stdio.h>\n\nint main(void) {\n\tchar str[101];\n\n\tscanf(\"AtCoder %s Contest\", str);\n\n\tprintf(\"A%cC\\n\", str[0]);\n\n\treturn 0;\n}\n", "language": "C", "metadata": {"date": 1488256629, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "problem_description_relpath": "problem_descriptions/p03860.html", "problem_id": "p03860", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03860/input.txt", "sample_output_relpath": "derived/input_output/data/p03860/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03860/C/s680907901.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s680907901", "user_id": "u731412691"}, "prompt_components": {"gold_output": "ABC\n", "input_to_evaluate": "#include <stdio.h>\n\nint main(void) {\n\tchar str[101];\n\n\tscanf(\"AtCoder %s Contest\", str);\n\n\tprintf(\"A%cC\\n\", str[0]);\n\n\treturn 0;\n}\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nSnuke is going to open a contest named \"AtCoder s Contest\".\nHere, s is a string of length 1 or greater, where the first character is an uppercase English letter, and the second and subsequent characters are lowercase English letters.\n\nSnuke has decided to abbreviate the name of the contest as \"AxC\".\nHere, x is the uppercase English letter at the beginning of s.\n\nGiven the name of the contest, print the abbreviation of the name.\n\nConstraints\n\nThe length of s is between 1 and 100, inclusive.\n\nThe first character in s is an uppercase English letter.\n\nThe second and subsequent characters in s are lowercase English letters.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nAtCoder s Contest\n\nOutput\n\nPrint the abbreviation of the name of the contest.\n\nSample Input 1\n\nAtCoder Beginner Contest\n\nSample Output 1\n\nABC\n\nThe contest in which you are participating now.\n\nSample Input 2\n\nAtCoder Snuke Contest\n\nSample Output 2\n\nASC\n\nThis contest does not actually exist.\n\nSample Input 3\n\nAtCoder X Contest\n\nSample Output 3\n\nAXC", "sample_input": "AtCoder Beginner Contest\n"}, "reference_outputs": ["ABC\n"], "source_document_id": "p03860", "source_text": "Score : 100 points\n\nProblem Statement\n\nSnuke is going to open a contest named \"AtCoder s Contest\".\nHere, s is a string of length 1 or greater, where the first character is an uppercase English letter, and the second and subsequent characters are lowercase English letters.\n\nSnuke has decided to abbreviate the name of the contest as \"AxC\".\nHere, x is the uppercase English letter at the beginning of s.\n\nGiven the name of the contest, print the abbreviation of the name.\n\nConstraints\n\nThe length of s is between 1 and 100, inclusive.\n\nThe first character in s is an uppercase English letter.\n\nThe second and subsequent characters in s are lowercase English letters.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nAtCoder s Contest\n\nOutput\n\nPrint the abbreviation of the name of the contest.\n\nSample Input 1\n\nAtCoder Beginner Contest\n\nSample Output 1\n\nABC\n\nThe contest in which you are participating now.\n\nSample Input 2\n\nAtCoder Snuke Contest\n\nSample Output 2\n\nASC\n\nThis contest does not actually exist.\n\nSample Input 3\n\nAtCoder X Contest\n\nSample Output 3\n\nAXC", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 131, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s273265103", "group_id": "codeNet:p03861", "input_text": "#include<stdio.h>\n#include<stdlib.h>\n#include<stdbool.h>\n#include<string.h>\n#include<math.h>\n#include<ctype.h>\n\ntypedef long long ll;\n\nll gcd(ll a, ll b) { if (b == 0) return a; return gcd(b, a % b); }\n\nll lcm(ll a, ll b) { return a / gcd(a, b) * b; }\n\nll max(ll a, ll b) { return (a > b) ? a : b; }\n\nll min(ll a, ll b) { return (a < b) ? a : b; }\n\nll asc(const void* a, const void* b) { return *(ll*)a - *(ll*)b; }\n\nll dsc(const void* a, const void* b) { return *(ll*)b - *(ll*)a; }\n\nbool flag;\n\nll f(ll x,ll y) {\n\tif (x == -1) return -1;\n\telse return x / y;\n}\n\nint main() {\n\tll n,a, b;\n\tscanf(\"%lld%lld%lld\", &a,&b,&n);\n\tprintf(\"%lld\", f(b,n)-f(a-1,n));\n\t\n\treturn 0;\n}", "language": "C", "metadata": {"date": 1595193547, "filename_ext": "c", "original_language": "C (Clang 10.0.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/C/s273265103.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s273265103", "user_id": "u189521276"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "#include<stdio.h>\n#include<stdlib.h>\n#include<stdbool.h>\n#include<string.h>\n#include<math.h>\n#include<ctype.h>\n\ntypedef long long ll;\n\nll gcd(ll a, ll b) { if (b == 0) return a; return gcd(b, a % b); }\n\nll lcm(ll a, ll b) { return a / gcd(a, b) * b; }\n\nll max(ll a, ll b) { return (a > b) ? a : b; }\n\nll min(ll a, ll b) { return (a < b) ? a : b; }\n\nll asc(const void* a, const void* b) { return *(ll*)a - *(ll*)b; }\n\nll dsc(const void* a, const void* b) { return *(ll*)b - *(ll*)a; }\n\nbool flag;\n\nll f(ll x,ll y) {\n\tif (x == -1) return -1;\n\telse return x / y;\n}\n\nint main() {\n\tll n,a, b;\n\tscanf(\"%lld%lld%lld\", &a,&b,&n);\n\tprintf(\"%lld\", f(b,n)-f(a-1,n));\n\t\n\treturn 0;\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": 670, "cpu_time_ms": 8, "memory_kb": 2128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s714902975", "group_id": "codeNet:p03861", "input_text": "#include<stdio.h>\nint main()\n{\n  unsigned long long int a,b,x, i;\n  unsigned long long int c = 0;\n\n    scanf(\"%llu %llu %llu\", &a, &b, &x);\n    for(i = a; i <= b; i ++){\n      if(i % x == 0){\n        c ++;\n      }\n    }\n    printf(\"%llu\\n\", c);\n\n    \n    return 0;\n}", "language": "C", "metadata": {"date": 1480904666, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "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/C/s714902975.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s714902975", "user_id": "u269767135"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "#include<stdio.h>\nint main()\n{\n  unsigned long long int a,b,x, i;\n  unsigned long long int c = 0;\n\n    scanf(\"%llu %llu %llu\", &a, &b, &x);\n    for(i = a; i <= b; i ++){\n      if(i % x == 0){\n        c ++;\n      }\n    }\n    printf(\"%llu\\n\", c);\n\n    \n    return 0;\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": 266, "cpu_time_ms": 2102, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s931475188", "group_id": "codeNet:p03862", "input_text": "#include<stdio.h>\n#include<stdlib.h>\n\nint main(){\n    int i,j;\n    long long x,n,count=0;\n    double *a;\n\n    scanf(\"%lld %lld\",&n,&x);\n\n    a =(double*)malloc(sizeof(double)*n);\n\n    for(i=0;i<n;i++){\n        scanf(\"%lf\",&a[i]);\n    }\n    for(j=0;j<n-1;j++){\n        if(a[j]+a[j+1] <= x){\n            continue;\n        }else{\n            count = count + (a[j]+a[j+1])-x;\n            if(a[j]>a[j+1]){\n                a[j] -= (a[j]+a[j+1])-x;\n            }else if(a[j]<=a[j+1]){\n                a[j+1] -= (a[j]+a[j+1])-x;\n            }\n        }\n    }\n    printf(\"%lld\",count);\n    return 0;\n}", "language": "C", "metadata": {"date": 1549387579, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "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/C/s931475188.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s931475188", "user_id": "u710135612"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "#include<stdio.h>\n#include<stdlib.h>\n\nint main(){\n    int i,j;\n    long long x,n,count=0;\n    double *a;\n\n    scanf(\"%lld %lld\",&n,&x);\n\n    a =(double*)malloc(sizeof(double)*n);\n\n    for(i=0;i<n;i++){\n        scanf(\"%lf\",&a[i]);\n    }\n    for(j=0;j<n-1;j++){\n        if(a[j]+a[j+1] <= x){\n            continue;\n        }else{\n            count = count + (a[j]+a[j+1])-x;\n            if(a[j]>a[j+1]){\n                a[j] -= (a[j]+a[j+1])-x;\n            }else if(a[j]<=a[j+1]){\n                a[j+1] -= (a[j]+a[j+1])-x;\n            }\n        }\n    }\n    printf(\"%lld\",count);\n    return 0;\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": 592, "cpu_time_ms": 20, "memory_kb": 896}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s569348890", "group_id": "codeNet:p03863", "input_text": "#include <stdio.h>\n#include <string.h>\n#include <stdlib.h>\n#include <stdint.h> // int64_t\n\n#define max(a,b) ((a) > (b) ? (a) : (b))\n#define min(a,b) ((a) > (b) ? (b) : (a))\n\nint get_str(char *str, int size)\n{\n    char format[100];\n    if (size == 0)\n        return 0;\n    snprintf(format, sizeof(format), \"%%%ds\", size);\n    scanf(format, str);\n    return 0;\n}\n#define NUM_MAX 100000\n\nint desc(const void *a1, const void *a2) {\n    return *(int*)a2 - *(int*)a1;\n}\n\nint main(void) {\n    static char str[NUM_MAX+5];\n    get_str(str, NUM_MAX+5);\n    int len = strlen(str);\n    // winner => If odd: first, If even: second\n    int win = (len+1)%2; // 0: first, 1: second\n\n    static int map[26];\n    int i;\n    for(i = 0; i < len; i++) {\n        map[str[i] - 'a']++;\n    }\n    static int sorted[26];\n    memcpy(sorted, map, sizeof(int)*26);\n    qsort(sorted, 26, sizeof(int), desc);\n    // if(len==3) {\n    //     if(sorted[0] == 2) win = 1;\n    // } else \n    if(len%2 == 0) {\n        // First player no longer take\n        // if(sorted[0] == len/2 && sorted[1] == len/2) win = 1;\n    } else {\n        // odd\n        // First player no longer take\n        // if(sorted[0] == (len/2 + 1) && sorted[1] == len/2) {\n        //     win = 1;\n        // }\n        if(str[0] == str[len-1]) win = 1;\n        // anyway, First player wins.\n        // else if(sorted[0] == len/2 && sorted[1] == len/2) {\n        //     // abcab\n        //     for(i = 0; i < 26; i++) {\n        //         if(map[i]==1) break;\n        //     }\n        //     char ch = i+'a';\n        //     if(str[0] != ch && str[len-1] != ch) win = 0;\n        // }\n    }\n    printf(\"%s\\n\", win==0 ? \"First\" : \"Second\");\n    return 0;\n}", "language": "C", "metadata": {"date": 1591659516, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "problem_description_relpath": "problem_descriptions/p03863.html", "problem_id": "p03863", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03863/input.txt", "sample_output_relpath": "derived/input_output/data/p03863/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03863/C/s569348890.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s569348890", "user_id": "u866370648"}, "prompt_components": {"gold_output": "Second\n", "input_to_evaluate": "#include <stdio.h>\n#include <string.h>\n#include <stdlib.h>\n#include <stdint.h> // int64_t\n\n#define max(a,b) ((a) > (b) ? (a) : (b))\n#define min(a,b) ((a) > (b) ? (b) : (a))\n\nint get_str(char *str, int size)\n{\n    char format[100];\n    if (size == 0)\n        return 0;\n    snprintf(format, sizeof(format), \"%%%ds\", size);\n    scanf(format, str);\n    return 0;\n}\n#define NUM_MAX 100000\n\nint desc(const void *a1, const void *a2) {\n    return *(int*)a2 - *(int*)a1;\n}\n\nint main(void) {\n    static char str[NUM_MAX+5];\n    get_str(str, NUM_MAX+5);\n    int len = strlen(str);\n    // winner => If odd: first, If even: second\n    int win = (len+1)%2; // 0: first, 1: second\n\n    static int map[26];\n    int i;\n    for(i = 0; i < len; i++) {\n        map[str[i] - 'a']++;\n    }\n    static int sorted[26];\n    memcpy(sorted, map, sizeof(int)*26);\n    qsort(sorted, 26, sizeof(int), desc);\n    // if(len==3) {\n    //     if(sorted[0] == 2) win = 1;\n    // } else \n    if(len%2 == 0) {\n        // First player no longer take\n        // if(sorted[0] == len/2 && sorted[1] == len/2) win = 1;\n    } else {\n        // odd\n        // First player no longer take\n        // if(sorted[0] == (len/2 + 1) && sorted[1] == len/2) {\n        //     win = 1;\n        // }\n        if(str[0] == str[len-1]) win = 1;\n        // anyway, First player wins.\n        // else if(sorted[0] == len/2 && sorted[1] == len/2) {\n        //     // abcab\n        //     for(i = 0; i < 26; i++) {\n        //         if(map[i]==1) break;\n        //     }\n        //     char ch = i+'a';\n        //     if(str[0] != ch && str[len-1] != ch) win = 0;\n        // }\n    }\n    printf(\"%s\\n\", win==0 ? \"First\" : \"Second\");\n    return 0;\n}", "problem_context": "Score : 500 points\n\nProblem Statement\n\nThere is a string s of length 3 or greater.\nNo two neighboring characters in s are equal.\n\nTakahashi and Aoki will play a game against each other.\nThe two players alternately performs the following operation, Takahashi going first:\n\nRemove one of the characters in s, excluding both ends. However, a character cannot be removed if removal of the character would result in two neighboring equal characters in s.\n\nThe player who becomes unable to perform the operation, loses the game. Determine which player will win when the two play optimally.\n\nConstraints\n\n3 ≤ |s| ≤ 10^5\n\ns consists of lowercase English letters.\n\nNo two neighboring characters in s are equal.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\ns\n\nOutput\n\nIf Takahashi will win, print First. If Aoki will win, print Second.\n\nSample Input 1\n\naba\n\nSample Output 1\n\nSecond\n\nTakahashi, who goes first, cannot perform the operation, since removal of the b, which is the only character not at either ends of s, would result in s becoming aa, with two as neighboring.\n\nSample Input 2\n\nabc\n\nSample Output 2\n\nFirst\n\nWhen Takahashi removes b from s, it becomes ac.\nThen, Aoki cannot perform the operation, since there is no character in s, excluding both ends.\n\nSample Input 3\n\nabcab\n\nSample Output 3\n\nFirst", "sample_input": "aba\n"}, "reference_outputs": ["Second\n"], "source_document_id": "p03863", "source_text": "Score : 500 points\n\nProblem Statement\n\nThere is a string s of length 3 or greater.\nNo two neighboring characters in s are equal.\n\nTakahashi and Aoki will play a game against each other.\nThe two players alternately performs the following operation, Takahashi going first:\n\nRemove one of the characters in s, excluding both ends. However, a character cannot be removed if removal of the character would result in two neighboring equal characters in s.\n\nThe player who becomes unable to perform the operation, loses the game. Determine which player will win when the two play optimally.\n\nConstraints\n\n3 ≤ |s| ≤ 10^5\n\ns consists of lowercase English letters.\n\nNo two neighboring characters in s are equal.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\ns\n\nOutput\n\nIf Takahashi will win, print First. If Aoki will win, print Second.\n\nSample Input 1\n\naba\n\nSample Output 1\n\nSecond\n\nTakahashi, who goes first, cannot perform the operation, since removal of the b, which is the only character not at either ends of s, would result in s becoming aa, with two as neighboring.\n\nSample Input 2\n\nabc\n\nSample Output 2\n\nFirst\n\nWhen Takahashi removes b from s, it becomes ac.\nThen, Aoki cannot perform the operation, since there is no character in s, excluding both ends.\n\nSample Input 3\n\nabcab\n\nSample Output 3\n\nFirst", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1686, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s908312695", "group_id": "codeNet:p03866", "input_text": "#include<stdio.h>\n#include<math.h>\ndouble MAX(double a){return a<0?0:a;}\ndouble MIN(double a,double b){return a<b?a:b;}\nint main(){\n  int i,j,k,n,a[1010],b[1010],c[1010]={};\n  double d[1010][1010]={};\n  scanf(\"%d %d %d %d %d\",&a[0],&b[0],&a[1],&b[1],&n);\n  n+=2;\n  for(i=2;i<n;i++)scanf(\"%d %d %d\",&a[i],&b[i],&c[i]);\n  for(i=0;i<n;i++){\n    for(j=0;j<n;j++)d[i][j]=MAX(hypot(a[i]-a[j],b[i]-b[j])-c[i]-c[j]);\n  }\n  for(i=0;i<n;i++){\n    for(j=0;j<n;j++){\n      for(k=0;k<n;k++)d[j][k]=MIN(d[j][k],d[j][i]+d[i][k]);\n    }\n  }\n  printf(\"%.10lf\\n\",d[0][1]);\n  return 0;\n}\n", "language": "C", "metadata": {"date": 1480906544, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "problem_description_relpath": "problem_descriptions/p03866.html", "problem_id": "p03866", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03866/input.txt", "sample_output_relpath": "derived/input_output/data/p03866/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03866/C/s908312695.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s908312695", "user_id": "u121922047"}, "prompt_components": {"gold_output": "3.6568542495\n", "input_to_evaluate": "#include<stdio.h>\n#include<math.h>\ndouble MAX(double a){return a<0?0:a;}\ndouble MIN(double a,double b){return a<b?a:b;}\nint main(){\n  int i,j,k,n,a[1010],b[1010],c[1010]={};\n  double d[1010][1010]={};\n  scanf(\"%d %d %d %d %d\",&a[0],&b[0],&a[1],&b[1],&n);\n  n+=2;\n  for(i=2;i<n;i++)scanf(\"%d %d %d\",&a[i],&b[i],&c[i]);\n  for(i=0;i<n;i++){\n    for(j=0;j<n;j++)d[i][j]=MAX(hypot(a[i]-a[j],b[i]-b[j])-c[i]-c[j]);\n  }\n  for(i=0;i<n;i++){\n    for(j=0;j<n;j++){\n      for(k=0;k<n;k++)d[j][k]=MIN(d[j][k],d[j][i]+d[i][k]);\n    }\n  }\n  printf(\"%.10lf\\n\",d[0][1]);\n  return 0;\n}\n", "problem_context": "Score : 600 points\n\nProblem Statement\n\nOn the xy-plane, Snuke is going to travel from the point (x_s, y_s) to the point (x_t, y_t).\nHe can move in arbitrary directions with speed 1.\nHere, we will consider him as a point without size.\n\nThere are N circular barriers deployed on the plane.\nThe center and the radius of the i-th barrier are (x_i, y_i) and r_i, respectively.\nThe barriers may overlap or contain each other.\n\nA point on the plane is exposed to cosmic rays if the point is not within any of the barriers.\n\nSnuke wants to avoid exposure to cosmic rays as much as possible during the travel.\nFind the minimum possible duration of time he is exposed to cosmic rays during the travel.\n\nConstraints\n\nAll input values are integers.\n\n-10^9 ≤ x_s, y_s, x_t, y_t ≤ 10^9\n\n(x_s, y_s) ≠ (x_t, y_t)\n\n1≤N≤1,000\n\n-10^9 ≤ x_i, y_i ≤ 10^9\n\n1 ≤ r_i ≤ 10^9\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nx_s y_s x_t y_t\nN\nx_1 y_1 r_1\nx_2 y_2 r_2\n:\nx_N y_N r_N\n\nOutput\n\nPrint the minimum possible duration of time Snuke is exposed to cosmic rays during the travel.\nThe output is considered correct if the absolute or relative error is at most 10^{-9}.\n\nSample Input 1\n\n-2 -2 2 2\n1\n0 0 1\n\nSample Output 1\n\n3.6568542495\n\nAn optimal route is as follows:\n\nSample Input 2\n\n-2 0 2 0\n2\n-1 0 2\n1 0 2\n\nSample Output 2\n\n0.0000000000\n\nAn optimal route is as follows:\n\nSample Input 3\n\n4 -2 -2 4\n3\n0 0 2\n4 0 1\n0 4 1\n\nSample Output 3\n\n4.0000000000\n\nAn optimal route is as follows:", "sample_input": "-2 -2 2 2\n1\n0 0 1\n"}, "reference_outputs": ["3.6568542495\n"], "source_document_id": "p03866", "source_text": "Score : 600 points\n\nProblem Statement\n\nOn the xy-plane, Snuke is going to travel from the point (x_s, y_s) to the point (x_t, y_t).\nHe can move in arbitrary directions with speed 1.\nHere, we will consider him as a point without size.\n\nThere are N circular barriers deployed on the plane.\nThe center and the radius of the i-th barrier are (x_i, y_i) and r_i, respectively.\nThe barriers may overlap or contain each other.\n\nA point on the plane is exposed to cosmic rays if the point is not within any of the barriers.\n\nSnuke wants to avoid exposure to cosmic rays as much as possible during the travel.\nFind the minimum possible duration of time he is exposed to cosmic rays during the travel.\n\nConstraints\n\nAll input values are integers.\n\n-10^9 ≤ x_s, y_s, x_t, y_t ≤ 10^9\n\n(x_s, y_s) ≠ (x_t, y_t)\n\n1≤N≤1,000\n\n-10^9 ≤ x_i, y_i ≤ 10^9\n\n1 ≤ r_i ≤ 10^9\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nx_s y_s x_t y_t\nN\nx_1 y_1 r_1\nx_2 y_2 r_2\n:\nx_N y_N r_N\n\nOutput\n\nPrint the minimum possible duration of time Snuke is exposed to cosmic rays during the travel.\nThe output is considered correct if the absolute or relative error is at most 10^{-9}.\n\nSample Input 1\n\n-2 -2 2 2\n1\n0 0 1\n\nSample Output 1\n\n3.6568542495\n\nAn optimal route is as follows:\n\nSample Input 2\n\n-2 0 2 0\n2\n-1 0 2\n1 0 2\n\nSample Output 2\n\n0.0000000000\n\nAn optimal route is as follows:\n\nSample Input 3\n\n4 -2 -2 4\n3\n0 0 2\n4 0 1\n0 4 1\n\nSample Output 3\n\n4.0000000000\n\nAn optimal route is as follows:", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 569, "cpu_time_ms": 1028, "memory_kb": 8320}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s992295297", "group_id": "codeNet:p03870", "input_text": "int check[30];\n\nint c, n, a;\n\nint main() {\n\n  for (int bit = 29; bit >= 0; bit--) {\n    check[bit] = 0;\n  }\n\n  n = 0;\n  while (1) {\n    c = getchar_unlocked();\n    if ('0' <= c && c <= '9')\n      n = n * 10 + c - '0';\n    else\n      break;\n  }\n\n  int xor_sum = 0;\n  for (int i = 0; i < n; i++) {\n    a = 0;\n    while (1) {\n      c = getchar_unlocked();\n      if ('0' <= c && c <= '9')\n        a = a * 10 + c - '0';\n      else\n        break;\n    }\n    xor_sum ^= a;\n    a = a ^ (a - 1);\n\n    switch (a) {\n    case 1073741823:\n      check[29] = 1;\n      break;\n    case 536870911:\n      check[28] = 1;\n      break;\n    case 268435455:\n      check[27] = 1;\n      break;\n    case 134217727:\n      check[26] = 1;\n      break;\n    case 67108863:\n      check[25] = 1;\n      break;\n    case 33554431:\n      check[24] = 1;\n      break;\n    case 16777215:\n      check[23] = 1;\n      break;\n    case 8388607:\n      check[22] = 1;\n      break;\n    case 4194303:\n      check[21] = 1;\n      break;\n    case 2097151:\n      check[20] = 1;\n      break;\n    case 1048575:\n      check[19] = 1;\n      break;\n    case 524287:\n      check[18] = 1;\n      break;\n    case 262143:\n      check[17] = 1;\n      break;\n    case 131071:\n      check[16] = 1;\n      break;\n    case 65535:\n      check[15] = 1;\n      break;\n    case 32767:\n      check[14] = 1;\n      break;\n    case 16383:\n      check[13] = 1;\n      break;\n    case 8191:\n      check[12] = 1;\n      break;\n    case 4095:\n      check[11] = 1;\n      break;\n    case 2047:\n      check[10] = 1;\n      break;\n    case 1023:\n      check[9] = 1;\n      break;\n    case 511:\n      check[8] = 1;\n      break;\n    case 255:\n      check[7] = 1;\n      break;\n    case 127:\n      check[6] = 1;\n      break;\n    case 63:\n      check[5] = 1;\n      break;\n    case 31:\n      check[4] = 1;\n      break;\n    case 15:\n      check[3] = 1;\n      break;\n    case 7:\n      check[2] = 1;\n      break;\n    case 3:\n      check[1] = 1;\n      break;\n    case 1:\n      check[0] = 1;\n      break;\n    }\n  }\n\n  int ans = 0;\n  for (int bit = 29; bit >= 0; bit--) {\n    if (((1 << bit) & xor_sum) == 0) {\n      continue;\n    }\n    int x = (1 << (bit + 1)) - 1;\n\n    if (check[bit] > 0) {\n      xor_sum ^= x;\n      ans += 1;\n    }\n  }\n\n  if (xor_sum != 0) {\n    printf(\"-1\\n\");\n  } else {\n    printf(\"%d\\n\", ans);\n  }\n}", "language": "C", "metadata": {"date": 1529570156, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "problem_description_relpath": "problem_descriptions/p03870.html", "problem_id": "p03870", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03870/input.txt", "sample_output_relpath": "derived/input_output/data/p03870/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03870/C/s992295297.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s992295297", "user_id": "u943624079"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "int check[30];\n\nint c, n, a;\n\nint main() {\n\n  for (int bit = 29; bit >= 0; bit--) {\n    check[bit] = 0;\n  }\n\n  n = 0;\n  while (1) {\n    c = getchar_unlocked();\n    if ('0' <= c && c <= '9')\n      n = n * 10 + c - '0';\n    else\n      break;\n  }\n\n  int xor_sum = 0;\n  for (int i = 0; i < n; i++) {\n    a = 0;\n    while (1) {\n      c = getchar_unlocked();\n      if ('0' <= c && c <= '9')\n        a = a * 10 + c - '0';\n      else\n        break;\n    }\n    xor_sum ^= a;\n    a = a ^ (a - 1);\n\n    switch (a) {\n    case 1073741823:\n      check[29] = 1;\n      break;\n    case 536870911:\n      check[28] = 1;\n      break;\n    case 268435455:\n      check[27] = 1;\n      break;\n    case 134217727:\n      check[26] = 1;\n      break;\n    case 67108863:\n      check[25] = 1;\n      break;\n    case 33554431:\n      check[24] = 1;\n      break;\n    case 16777215:\n      check[23] = 1;\n      break;\n    case 8388607:\n      check[22] = 1;\n      break;\n    case 4194303:\n      check[21] = 1;\n      break;\n    case 2097151:\n      check[20] = 1;\n      break;\n    case 1048575:\n      check[19] = 1;\n      break;\n    case 524287:\n      check[18] = 1;\n      break;\n    case 262143:\n      check[17] = 1;\n      break;\n    case 131071:\n      check[16] = 1;\n      break;\n    case 65535:\n      check[15] = 1;\n      break;\n    case 32767:\n      check[14] = 1;\n      break;\n    case 16383:\n      check[13] = 1;\n      break;\n    case 8191:\n      check[12] = 1;\n      break;\n    case 4095:\n      check[11] = 1;\n      break;\n    case 2047:\n      check[10] = 1;\n      break;\n    case 1023:\n      check[9] = 1;\n      break;\n    case 511:\n      check[8] = 1;\n      break;\n    case 255:\n      check[7] = 1;\n      break;\n    case 127:\n      check[6] = 1;\n      break;\n    case 63:\n      check[5] = 1;\n      break;\n    case 31:\n      check[4] = 1;\n      break;\n    case 15:\n      check[3] = 1;\n      break;\n    case 7:\n      check[2] = 1;\n      break;\n    case 3:\n      check[1] = 1;\n      break;\n    case 1:\n      check[0] = 1;\n      break;\n    }\n  }\n\n  int ans = 0;\n  for (int bit = 29; bit >= 0; bit--) {\n    if (((1 << bit) & xor_sum) == 0) {\n      continue;\n    }\n    int x = (1 << (bit + 1)) - 1;\n\n    if (check[bit] > 0) {\n      xor_sum ^= x;\n      ans += 1;\n    }\n  }\n\n  if (xor_sum != 0) {\n    printf(\"-1\\n\");\n  } else {\n    printf(\"%d\\n\", ans);\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": "p03870", "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": 2318, "cpu_time_ms": 6, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s750468968", "group_id": "codeNet:p03921", "input_text": "#include <stdio.h>\n#include <stdbool.h>\n\nint find(int x);\nvoid f_union(int x, int y);\nint G[1001];\n\n\ntypedef struct {\n    int K;\n    int O;\n    unsigned char other[1001];\n    unsigned char lang[1001];\n}CODER;\n\nCODER player[1001] = {0};\n\nint main(void)\n{\n    int N, M, K, n;\n    int i, j, k, l, m;\n    CODER tmp;\n\n    scanf(\"%d%d\", &N, &M);\n\n    for (i = 0; i < N; i++) {\n        scanf(\"%d\", &K);\n        player[i].K = K;\n        player[i].O = 0;\n        G[i] = i;\n        for (k = 0; k < K; k++) {\n            scanf(\"%d\", &n);\n            player[i].lang[k] = n;\n        }\n    }\n\n    for (i = 0; i < N; i++) {\n        for (j = 0; j < player[i].K; j++) {\n            for (k = i+1; k < N; k++) {\n                for (l = 0; l < player[k].K; l++) {\n                    if (player[i].lang[j] == player[k].lang[l]) {\n                        f_union(G[i], G[k]);\n                        break;\n                    }\n                }\n            }\n        }\n    }\n\n    for (i = 1; i < N; i++) {\n        if (find(G[0]) != find(G[i])) {\n            printf(\"NO\");\n            return 0;\n        }\n    }\n    printf(\"YES\");\n    return 0;\n}\n\nint find(int x)\n{\n    if (G[x] == x) {\n        return x;\n    } else {\n        return G[x] = find(G[x]);\n    }\n}\n\nvoid f_union(int x, int y)\n{\n    x = find(x);\n    y = find(y);\n    if (x == y) return;\n\n    G[x] = y;\n}\n", "language": "C", "metadata": {"date": 1480191395, "filename_ext": "c", "original_language": "C (Clang 3.8.0)", "problem_description_relpath": "problem_descriptions/p03921.html", "problem_id": "p03921", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03921/input.txt", "sample_output_relpath": "derived/input_output/data/p03921/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03921/C/s750468968.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s750468968", "user_id": "u994355615"}, "prompt_components": {"gold_output": "YES\n", "input_to_evaluate": "#include <stdio.h>\n#include <stdbool.h>\n\nint find(int x);\nvoid f_union(int x, int y);\nint G[1001];\n\n\ntypedef struct {\n    int K;\n    int O;\n    unsigned char other[1001];\n    unsigned char lang[1001];\n}CODER;\n\nCODER player[1001] = {0};\n\nint main(void)\n{\n    int N, M, K, n;\n    int i, j, k, l, m;\n    CODER tmp;\n\n    scanf(\"%d%d\", &N, &M);\n\n    for (i = 0; i < N; i++) {\n        scanf(\"%d\", &K);\n        player[i].K = K;\n        player[i].O = 0;\n        G[i] = i;\n        for (k = 0; k < K; k++) {\n            scanf(\"%d\", &n);\n            player[i].lang[k] = n;\n        }\n    }\n\n    for (i = 0; i < N; i++) {\n        for (j = 0; j < player[i].K; j++) {\n            for (k = i+1; k < N; k++) {\n                for (l = 0; l < player[k].K; l++) {\n                    if (player[i].lang[j] == player[k].lang[l]) {\n                        f_union(G[i], G[k]);\n                        break;\n                    }\n                }\n            }\n        }\n    }\n\n    for (i = 1; i < N; i++) {\n        if (find(G[0]) != find(G[i])) {\n            printf(\"NO\");\n            return 0;\n        }\n    }\n    printf(\"YES\");\n    return 0;\n}\n\nint find(int x)\n{\n    if (G[x] == x) {\n        return x;\n    } else {\n        return G[x] = find(G[x]);\n    }\n}\n\nvoid f_union(int x, int y)\n{\n    x = find(x);\n    y = find(y);\n    if (x == y) return;\n\n    G[x] = y;\n}\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nOn a planet far, far away, M languages are spoken. They are conveniently numbered 1 through M.\n\nFor CODE FESTIVAL 20XX held on this planet, N participants gathered from all over the planet.\n\nThe i-th (1≦i≦N) participant can speak K_i languages numbered L_{i,1}, L_{i,2}, ..., L_{i,{}K_i}.\n\nTwo participants A and B can communicate with each other if and only if one of the following conditions is satisfied:\n\nThere exists a language that both A and B can speak.\n\nThere exists a participant X that both A and B can communicate with.\n\nDetermine whether all N participants can communicate with all other participants.\n\nConstraints\n\n2≦N≦10^5\n\n1≦M≦10^5\n\n1≦K_i≦M\n\n(The sum of all K_i)≦10^5\n\n1≦L_{i,j}≦M\n\nL_{i,1}, L_{i,2}, ..., L_{i,{}K_i} are pairwise distinct.\n\nPartial Score\n\n200 points will be awarded for passing the test set satisfying the following: N≦1000, M≦1000 and (The sum of all K_i)≦1000.\n\nAdditional 200 points will be awarded for passing the test set without additional constraints.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN M\nK_1 L_{1,1} L_{1,2} ... L_{1,{}K_1}\nK_2 L_{2,1} L_{2,2} ... L_{2,{}K_2}\n:\nK_N L_{N,1} L_{N,2} ... L_{N,{}K_N}\n\nOutput\n\nIf all N participants can communicate with all other participants, print YES. Otherwise, print NO.\n\nSample Input 1\n\n4 6\n3 1 2 3\n2 4 2\n2 4 6\n1 6\n\nSample Output 1\n\nYES\n\nAny two participants can communicate with each other, as follows:\n\nParticipants 1 and 2: both can speak language 2.\n\nParticipants 2 and 3: both can speak language 4.\n\nParticipants 1 and 3: both can communicate with participant 2.\n\nParticipants 3 and 4: both can speak language 6.\n\nParticipants 2 and 4: both can communicate with participant 3.\n\nParticipants 1 and 4: both can communicate with participant 2.\n\nNote that there can be languages spoken by no participant.\n\nSample Input 2\n\n4 4\n2 1 2\n2 1 2\n1 3\n2 4 3\n\nSample Output 2\n\nNO\n\nFor example, participants 1 and 3 cannot communicate with each other.", "sample_input": "4 6\n3 1 2 3\n2 4 2\n2 4 6\n1 6\n"}, "reference_outputs": ["YES\n"], "source_document_id": "p03921", "source_text": "Score : 400 points\n\nProblem Statement\n\nOn a planet far, far away, M languages are spoken. They are conveniently numbered 1 through M.\n\nFor CODE FESTIVAL 20XX held on this planet, N participants gathered from all over the planet.\n\nThe i-th (1≦i≦N) participant can speak K_i languages numbered L_{i,1}, L_{i,2}, ..., L_{i,{}K_i}.\n\nTwo participants A and B can communicate with each other if and only if one of the following conditions is satisfied:\n\nThere exists a language that both A and B can speak.\n\nThere exists a participant X that both A and B can communicate with.\n\nDetermine whether all N participants can communicate with all other participants.\n\nConstraints\n\n2≦N≦10^5\n\n1≦M≦10^5\n\n1≦K_i≦M\n\n(The sum of all K_i)≦10^5\n\n1≦L_{i,j}≦M\n\nL_{i,1}, L_{i,2}, ..., L_{i,{}K_i} are pairwise distinct.\n\nPartial Score\n\n200 points will be awarded for passing the test set satisfying the following: N≦1000, M≦1000 and (The sum of all K_i)≦1000.\n\nAdditional 200 points will be awarded for passing the test set without additional constraints.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN M\nK_1 L_{1,1} L_{1,2} ... L_{1,{}K_1}\nK_2 L_{2,1} L_{2,2} ... L_{2,{}K_2}\n:\nK_N L_{N,1} L_{N,2} ... L_{N,{}K_N}\n\nOutput\n\nIf all N participants can communicate with all other participants, print YES. Otherwise, print NO.\n\nSample Input 1\n\n4 6\n3 1 2 3\n2 4 2\n2 4 6\n1 6\n\nSample Output 1\n\nYES\n\nAny two participants can communicate with each other, as follows:\n\nParticipants 1 and 2: both can speak language 2.\n\nParticipants 2 and 3: both can speak language 4.\n\nParticipants 1 and 3: both can communicate with participant 2.\n\nParticipants 3 and 4: both can speak language 6.\n\nParticipants 2 and 4: both can communicate with participant 3.\n\nParticipants 1 and 4: both can communicate with participant 2.\n\nNote that there can be languages spoken by no participant.\n\nSample Input 2\n\n4 4\n2 1 2\n2 1 2\n1 3\n2 4 3\n\nSample Output 2\n\nNO\n\nFor example, participants 1 and 3 cannot communicate with each other.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 110, "memory_kb": 2176}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s794139391", "group_id": "codeNet:p03937", "input_text": "#include <stdio.h>\n\nint main(){\n\tint h,w;\n\tscanf(\"%d%d\",&h,&w);\n\tchar c;\n\tint ans=0;\n\twhile(~(c=getchar()))ans+=c=='#';\n\tputs(ans==h+w-1?\"Possible\":\"Impossible\");\n}", "language": "C", "metadata": {"date": 1566790832, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "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/C/s794139391.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s794139391", "user_id": "u382163500"}, "prompt_components": {"gold_output": "Possible\n", "input_to_evaluate": "#include <stdio.h>\n\nint main(){\n\tint h,w;\n\tscanf(\"%d%d\",&h,&w);\n\tchar c;\n\tint ans=0;\n\twhile(~(c=getchar()))ans+=c=='#';\n\tputs(ans==h+w-1?\"Possible\":\"Impossible\");\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": 164, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s108099425", "group_id": "codeNet:p03942", "input_text": "#include<stdio.h>\n\n#define MAX(x,y) (x>y?x:y)\n\nchar S0[1000001];\nchar T[1000001];\nint k[1000001];\nint d[1000001];\n\nint main(){\n\tint N;\n\tint re = 0;\n\tint i = 0, j = 0;\n\tscanf(\"%d\", &N);\n\tscanf(\"%s\", S0);\n\tscanf(\"%s\", T);\n\tk[N] = N-1;\n\tfor( i = N-1; i >= 0; i-- ){\n\t\tfor( j = k[i+1]; j >= 0; j-- ){\n\t\t\tif( T[i] == S0[j] ){\n\t\t\t\tk[i] = j;\n\t\t\t\td[i] = i-j;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tif( j < 0 ){ re = -1; break; }\n\t}\n\t\n\tif( re != -1 ){\n\t\tre = d[N-1];\n\t\tint temp = re;\n\t\tfor( i = N-2; i >= 0; i-- ){\n\t\t\tif( d[i] == 0 ){\n\t\t\t\tif( temp > re ){ re = temp; }\n\t\t\t}else{\n\t\t\t\tif( T[i] == T[i+1] ){\n\t\t\t\t\t//保留。\n\t\t\t\t}else{\n\t\t\t\t\tif( d[i] > temp ){\n\t\t\t\t\t\ttemp = d[i];\n\t\t\t\t\t}else{\n\t\t\t\t\t\ttemp += MAX(d[i+1]+1-d[i], 0);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\t\n\t\t\n\t}\n\t\n\t/*\n\tfor( i = 0; i < N; i++ ){\n\t\tprintf(\"%d \", d[i]);\n\t}\n\tprintf(\"\\n\");\n\t*/\n\tprintf(\"%d\\n\", re);\n\treturn 0;\n}\n", "language": "C", "metadata": {"date": 1479006985, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "problem_description_relpath": "problem_descriptions/p03942.html", "problem_id": "p03942", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03942/input.txt", "sample_output_relpath": "derived/input_output/data/p03942/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03942/C/s108099425.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s108099425", "user_id": "u736339585"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "#include<stdio.h>\n\n#define MAX(x,y) (x>y?x:y)\n\nchar S0[1000001];\nchar T[1000001];\nint k[1000001];\nint d[1000001];\n\nint main(){\n\tint N;\n\tint re = 0;\n\tint i = 0, j = 0;\n\tscanf(\"%d\", &N);\n\tscanf(\"%s\", S0);\n\tscanf(\"%s\", T);\n\tk[N] = N-1;\n\tfor( i = N-1; i >= 0; i-- ){\n\t\tfor( j = k[i+1]; j >= 0; j-- ){\n\t\t\tif( T[i] == S0[j] ){\n\t\t\t\tk[i] = j;\n\t\t\t\td[i] = i-j;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tif( j < 0 ){ re = -1; break; }\n\t}\n\t\n\tif( re != -1 ){\n\t\tre = d[N-1];\n\t\tint temp = re;\n\t\tfor( i = N-2; i >= 0; i-- ){\n\t\t\tif( d[i] == 0 ){\n\t\t\t\tif( temp > re ){ re = temp; }\n\t\t\t}else{\n\t\t\t\tif( T[i] == T[i+1] ){\n\t\t\t\t\t//保留。\n\t\t\t\t}else{\n\t\t\t\t\tif( d[i] > temp ){\n\t\t\t\t\t\ttemp = d[i];\n\t\t\t\t\t}else{\n\t\t\t\t\t\ttemp += MAX(d[i+1]+1-d[i], 0);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\t\n\t\t\n\t}\n\t\n\t/*\n\tfor( i = 0; i < N; i++ ){\n\t\tprintf(\"%d \", d[i]);\n\t}\n\tprintf(\"\\n\");\n\t*/\n\tprintf(\"%d\\n\", re);\n\treturn 0;\n}\n", "problem_context": "Score : 1500 points\n\nProblem Statement\n\n#nck {\nwidth: 30px;\nheight: auto;\n}\n\nShik's job is very boring. At day 0, his boss gives him a string S_0 of length N which consists of only lowercase English letters. In the i-th day after day 0, Shik's job is to copy the string S_{i-1} to a string S_i. We denote the j-th letter of S_i as S_i[j].\n\nShik is inexperienced in this job. In each day, when he is copying letters one by one from the first letter to the last letter, he would make mistakes. That is, he sometimes accidentally writes down the same letter that he wrote previously instead of the correct one. More specifically, S_i[j] is equal to either S_{i-1}[j] or S_{i}[j-1]. (Note that S_i[1] always equals to S_{i-1}[1].)\n\nYou are given the string S_0 and another string T.\nPlease determine the smallest integer i such that S_i could be equal to T. If no such i exists, please print -1.\n\nConstraints\n\n1 \\leq N \\leq 1,000,000\n\nThe lengths of S_0 and T are both N.\n\nBoth S_0 and T consist of lowercase English letters.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\nS_0\nT\n\nOutput\n\nPrint the smallest integer i such that S_i could be equal to T. If no such i exists, print -1 instead.\n\nSample Input 1\n\n5\nabcde\naaacc\n\nSample Output 1\n\n2\n\nS_0 = abcde, S_1 = aaccc and S_2 = aaacc is a possible sequence such that S_2 = T.\n\nSample Input 2\n\n5\nabcde\nabcde\n\nSample Output 2\n\n0\n\nSample Input 3\n\n4\nacaa\naaca\n\nSample Output 3\n\n2\n\nSample Input 4\n\n5\nabcde\nbbbbb\n\nSample Output 4\n\n-1", "sample_input": "5\nabcde\naaacc\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03942", "source_text": "Score : 1500 points\n\nProblem Statement\n\n#nck {\nwidth: 30px;\nheight: auto;\n}\n\nShik's job is very boring. At day 0, his boss gives him a string S_0 of length N which consists of only lowercase English letters. In the i-th day after day 0, Shik's job is to copy the string S_{i-1} to a string S_i. We denote the j-th letter of S_i as S_i[j].\n\nShik is inexperienced in this job. In each day, when he is copying letters one by one from the first letter to the last letter, he would make mistakes. That is, he sometimes accidentally writes down the same letter that he wrote previously instead of the correct one. More specifically, S_i[j] is equal to either S_{i-1}[j] or S_{i}[j-1]. (Note that S_i[1] always equals to S_{i-1}[1].)\n\nYou are given the string S_0 and another string T.\nPlease determine the smallest integer i such that S_i could be equal to T. If no such i exists, please print -1.\n\nConstraints\n\n1 \\leq N \\leq 1,000,000\n\nThe lengths of S_0 and T are both N.\n\nBoth S_0 and T consist of lowercase English letters.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\nS_0\nT\n\nOutput\n\nPrint the smallest integer i such that S_i could be equal to T. If no such i exists, print -1 instead.\n\nSample Input 1\n\n5\nabcde\naaacc\n\nSample Output 1\n\n2\n\nS_0 = abcde, S_1 = aaccc and S_2 = aaacc is a possible sequence such that S_2 = T.\n\nSample Input 2\n\n5\nabcde\nabcde\n\nSample Output 2\n\n0\n\nSample Input 3\n\n4\nacaa\naaca\n\nSample Output 3\n\n2\n\nSample Input 4\n\n5\nabcde\nbbbbb\n\nSample Output 4\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": 842, "cpu_time_ms": 30, "memory_kb": 9984}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s335690655", "group_id": "codeNet:p03943", "input_text": "#include <stdio.h>\n\nint main()\n{\n\tint a, b, c;\n\tscanf(\"%d%d%d\", &a, &b, &c);\n\tif ((a+b+c) % 2 == 0) {\n\t\tprintf(\"Yes\\n\");\n\t} else {\n\t\tprintf(\"No\\n\");\n\t}\n\treturn 0;\n}\n", "language": "C", "metadata": {"date": 1545670853, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "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/C/s335690655.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s335690655", "user_id": "u390581401"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "#include <stdio.h>\n\nint main()\n{\n\tint a, b, c;\n\tscanf(\"%d%d%d\", &a, &b, &c);\n\tif ((a+b+c) % 2 == 0) {\n\t\tprintf(\"Yes\\n\");\n\t} else {\n\t\tprintf(\"No\\n\");\n\t}\n\treturn 0;\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": 165, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s303836370", "group_id": "codeNet:p03943", "input_text": "#include<stdio.h>\n#define MAX 3\n\nint main() {\n    int a[MAX],i,SUM;\n    for(i=0;i<MAX;i++){\n      if(scanf(\"%d\",&a[i]) == 1)\n      SUM=SUM+a[i];\n    }\n    SUM=SUM/2;\n    if(SUM==a[0]||SUM==a[1]||SUM==a[2]){\n      printf(\"Yes\");\n    }else{\n      printf(\"No\");\n    }\n    return 0;\n}\n", "language": "C", "metadata": {"date": 1540508153, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "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/C/s303836370.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s303836370", "user_id": "u825378567"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "#include<stdio.h>\n#define MAX 3\n\nint main() {\n    int a[MAX],i,SUM;\n    for(i=0;i<MAX;i++){\n      if(scanf(\"%d\",&a[i]) == 1)\n      SUM=SUM+a[i];\n    }\n    SUM=SUM/2;\n    if(SUM==a[0]||SUM==a[1]||SUM==a[2]){\n      printf(\"Yes\");\n    }else{\n      printf(\"No\");\n    }\n    return 0;\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": 281, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s080548831", "group_id": "codeNet:p03943", "input_text": "#include<stdio.h>\nint main()\n{\n\tint a,b,c;\n\tscanf(\"%d %d %d\",&a,&b,&c);\n\tif((a+b)%2==0) puts(\"YES\");\n\telse if((b+c)%2==0) puts(\"YES\");\n\telse if((a+c)%2==0) puts(\"YES\");\n\telse puts(\"NO\");\n\treturn 0;\n}", "language": "C", "metadata": {"date": 1538267288, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "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/C/s080548831.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s080548831", "user_id": "u018679195"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "#include<stdio.h>\nint main()\n{\n\tint a,b,c;\n\tscanf(\"%d %d %d\",&a,&b,&c);\n\tif((a+b)%2==0) puts(\"YES\");\n\telse if((b+c)%2==0) puts(\"YES\");\n\telse if((a+c)%2==0) puts(\"YES\");\n\telse puts(\"NO\");\n\treturn 0;\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": 199, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s582641809", "group_id": "codeNet:p03944", "input_text": "#include<stdio.h>\n#include<stdlib.h>\n#include<math.h>\n#include<string.h>\n#include <time.h>\ntypedef long long ll;\ntypedef long double ld;\n#define INF (1LL<<60)\n#define MOD1 1000000007\n/*swap 交換*/\nvoid swap(ll *a, ll *b){ll c;c=*b;*b=*a;*a=c;}\n/*2つのうち大きい数を返す*/\nll max2(ll a,ll b){return a>=b?a:b;}\n/*2つのうち小さい数を返す*/\nll min2(ll a,ll b){return a>=b?b:a;}\n/*絶対値*/\nll ABS(ll a){return a>=0?a:(-a);}\ntypedef struct{\n    ll aa;\n    ll bb;\n}frequent;\n// 小大\nint compare(const void *a, const void *b){return *(ll *)a - *(ll *)b;}\n\nint main(void){\n    ll w,h,n,i,ans=0;\n    scanf(\"%lld%lld%lld\",&w,&h,&n);\n    ll x[n],y[n],a[n],l,r,u,d;\n    for(i=0;i<n;i++){\n        scanf(\"%lld%lld%lld\",&x[i],&y[i],&a[i]);\n    }\n    // for(i=0;i<w;i++){\n    //     for(j=0;j<h;j++){\n    //         color[w][h]=0;\n    //     }\n    // }\n    l=0;\n    r=w;\n    d=0;\n    u=h;\n    for(i=0;i<n;i++){\n        if(a[i]==1){\n            // for(j=0;j<x[i];j++){\n            //     for(k=0;k<h;k++){\n            //         color[j][k]=1;\n            //     }\n            // }\n            l=max2(l,x[i]);\n        }\n        if(a[i]==2){\n            // for(j=x[i]+1;j<w;j++){\n            //     for(k=0;k<h;k++){\n            //         color[j][k]=1;\n            //     }\n            // }\n            r=min2(r,x[i]);\n        }\n        if(a[i]==3){\n            // for(j=0;j<w;j++){\n            //     for(k=0;k<y[i];k++){\n            //         color[j][k]=1;\n            //     }\n            // }\n            d=max2(d,y[i]);\n        }\n        if(a[i]==4){\n            // for(j=0;j<w;j++){\n            //     for(k=y[i]+1;k<h;k++){\n            //         color[j][k]=1;\n            //     }\n            // }\n            u=min2(u,y[i]);\n        }\n    }\n    // for(i=0;i<w;i++){\n    //     for(j=0;j<h;j++){\n    //         if(color[i][j]==0) ans++;\n    //     }\n    // }\n    if(l<r && d<u) ans=(r-l)*(u-d);\n    printf(\"%lld\\n\",ans);\n    return 0;\n}\n", "language": "C", "metadata": {"date": 1581730840, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "problem_description_relpath": "problem_descriptions/p03944.html", "problem_id": "p03944", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03944/input.txt", "sample_output_relpath": "derived/input_output/data/p03944/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03944/C/s582641809.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s582641809", "user_id": "u004279520"}, "prompt_components": {"gold_output": "9\n", "input_to_evaluate": "#include<stdio.h>\n#include<stdlib.h>\n#include<math.h>\n#include<string.h>\n#include <time.h>\ntypedef long long ll;\ntypedef long double ld;\n#define INF (1LL<<60)\n#define MOD1 1000000007\n/*swap 交換*/\nvoid swap(ll *a, ll *b){ll c;c=*b;*b=*a;*a=c;}\n/*2つのうち大きい数を返す*/\nll max2(ll a,ll b){return a>=b?a:b;}\n/*2つのうち小さい数を返す*/\nll min2(ll a,ll b){return a>=b?b:a;}\n/*絶対値*/\nll ABS(ll a){return a>=0?a:(-a);}\ntypedef struct{\n    ll aa;\n    ll bb;\n}frequent;\n// 小大\nint compare(const void *a, const void *b){return *(ll *)a - *(ll *)b;}\n\nint main(void){\n    ll w,h,n,i,ans=0;\n    scanf(\"%lld%lld%lld\",&w,&h,&n);\n    ll x[n],y[n],a[n],l,r,u,d;\n    for(i=0;i<n;i++){\n        scanf(\"%lld%lld%lld\",&x[i],&y[i],&a[i]);\n    }\n    // for(i=0;i<w;i++){\n    //     for(j=0;j<h;j++){\n    //         color[w][h]=0;\n    //     }\n    // }\n    l=0;\n    r=w;\n    d=0;\n    u=h;\n    for(i=0;i<n;i++){\n        if(a[i]==1){\n            // for(j=0;j<x[i];j++){\n            //     for(k=0;k<h;k++){\n            //         color[j][k]=1;\n            //     }\n            // }\n            l=max2(l,x[i]);\n        }\n        if(a[i]==2){\n            // for(j=x[i]+1;j<w;j++){\n            //     for(k=0;k<h;k++){\n            //         color[j][k]=1;\n            //     }\n            // }\n            r=min2(r,x[i]);\n        }\n        if(a[i]==3){\n            // for(j=0;j<w;j++){\n            //     for(k=0;k<y[i];k++){\n            //         color[j][k]=1;\n            //     }\n            // }\n            d=max2(d,y[i]);\n        }\n        if(a[i]==4){\n            // for(j=0;j<w;j++){\n            //     for(k=y[i]+1;k<h;k++){\n            //         color[j][k]=1;\n            //     }\n            // }\n            u=min2(u,y[i]);\n        }\n    }\n    // for(i=0;i<w;i++){\n    //     for(j=0;j<h;j++){\n    //         if(color[i][j]==0) ans++;\n    //     }\n    // }\n    if(l<r && d<u) ans=(r-l)*(u-d);\n    printf(\"%lld\\n\",ans);\n    return 0;\n}\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nThere is a rectangle in the xy-plane, with its lower left corner at (0, 0) and its upper right corner at (W, H). Each of its sides is parallel to the x-axis or y-axis. Initially, the whole region within the rectangle is painted white.\n\nSnuke plotted N points into the rectangle. The coordinate of the i-th (1 ≦ i ≦ N) point was (x_i, y_i).\n\nThen, he created an integer sequence a of length N, and for each 1 ≦ i ≦ N, he painted some region within the rectangle black, as follows:\n\nIf a_i = 1, he painted the region satisfying x < x_i within the rectangle.\n\nIf a_i = 2, he painted the region satisfying x > x_i within the rectangle.\n\nIf a_i = 3, he painted the region satisfying y < y_i within the rectangle.\n\nIf a_i = 4, he painted the region satisfying y > y_i within the rectangle.\n\nFind the area of the white region within the rectangle after he finished painting.\n\nConstraints\n\n1 ≦ W, H ≦ 100\n\n1 ≦ N ≦ 100\n\n0 ≦ x_i ≦ W (1 ≦ i ≦ N)\n\n0 ≦ y_i ≦ H (1 ≦ i ≦ N)\n\nW, H (21:32, added), x_i and y_i are integers.\n\na_i (1 ≦ i ≦ N) is 1, 2, 3 or 4.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nW H N\nx_1 y_1 a_1\nx_2 y_2 a_2\n:\nx_N y_N a_N\n\nOutput\n\nPrint the area of the white region within the rectangle after Snuke finished painting.\n\nSample Input 1\n\n5 4 2\n2 1 1\n3 3 4\n\nSample Output 1\n\n9\n\nThe figure below shows the rectangle before Snuke starts painting.\n\nFirst, as (x_1, y_1) = (2, 1) and a_1 = 1, he paints the region satisfying x < 2 within the rectangle:\n\nThen, as (x_2, y_2) = (3, 3) and a_2 = 4, he paints the region satisfying y > 3 within the rectangle:\n\nNow, the area of the white region within the rectangle is 9.\n\nSample Input 2\n\n5 4 3\n2 1 1\n3 3 4\n1 4 2\n\nSample Output 2\n\n0\n\nIt is possible that the whole region within the rectangle is painted black.\n\nSample Input 3\n\n10 10 5\n1 6 1\n4 1 3\n6 9 4\n9 4 2\n3 1 3\n\nSample Output 3\n\n64", "sample_input": "5 4 2\n2 1 1\n3 3 4\n"}, "reference_outputs": ["9\n"], "source_document_id": "p03944", "source_text": "Score : 200 points\n\nProblem Statement\n\nThere is a rectangle in the xy-plane, with its lower left corner at (0, 0) and its upper right corner at (W, H). Each of its sides is parallel to the x-axis or y-axis. Initially, the whole region within the rectangle is painted white.\n\nSnuke plotted N points into the rectangle. The coordinate of the i-th (1 ≦ i ≦ N) point was (x_i, y_i).\n\nThen, he created an integer sequence a of length N, and for each 1 ≦ i ≦ N, he painted some region within the rectangle black, as follows:\n\nIf a_i = 1, he painted the region satisfying x < x_i within the rectangle.\n\nIf a_i = 2, he painted the region satisfying x > x_i within the rectangle.\n\nIf a_i = 3, he painted the region satisfying y < y_i within the rectangle.\n\nIf a_i = 4, he painted the region satisfying y > y_i within the rectangle.\n\nFind the area of the white region within the rectangle after he finished painting.\n\nConstraints\n\n1 ≦ W, H ≦ 100\n\n1 ≦ N ≦ 100\n\n0 ≦ x_i ≦ W (1 ≦ i ≦ N)\n\n0 ≦ y_i ≦ H (1 ≦ i ≦ N)\n\nW, H (21:32, added), x_i and y_i are integers.\n\na_i (1 ≦ i ≦ N) is 1, 2, 3 or 4.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nW H N\nx_1 y_1 a_1\nx_2 y_2 a_2\n:\nx_N y_N a_N\n\nOutput\n\nPrint the area of the white region within the rectangle after Snuke finished painting.\n\nSample Input 1\n\n5 4 2\n2 1 1\n3 3 4\n\nSample Output 1\n\n9\n\nThe figure below shows the rectangle before Snuke starts painting.\n\nFirst, as (x_1, y_1) = (2, 1) and a_1 = 1, he paints the region satisfying x < 2 within the rectangle:\n\nThen, as (x_2, y_2) = (3, 3) and a_2 = 4, he paints the region satisfying y > 3 within the rectangle:\n\nNow, the area of the white region within the rectangle is 9.\n\nSample Input 2\n\n5 4 3\n2 1 1\n3 3 4\n1 4 2\n\nSample Output 2\n\n0\n\nIt is possible that the whole region within the rectangle is painted black.\n\nSample Input 3\n\n10 10 5\n1 6 1\n4 1 3\n6 9 4\n9 4 2\n3 1 3\n\nSample Output 3\n\n64", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1960, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s676194469", "group_id": "codeNet:p03946", "input_text": "#include<stdio.h>\n\nint main()\n{\n\tint n,t;\n\tint i,j;\n\tint c=0;\n\tint g=0;\n\tint min;\n\t\n\tif(scanf(\"%d %d\",&n,&t) < 2) {\n    fprintf(stderr, \"error: ill-formed fraction.\\n\");\n    exit(1);\n\t}\n\t\n\tint a[n];\n\t\n\tfor(i=0;i<n;i++){\n\t\tif(scanf(\"%d\",&a[i]) < 1) {\n    fprintf(stderr, \"error: ill-formed fraction.\\n\");\n    exit(1);\n\t\t}\n\t}\n\t\n\tmin = a[0];\n\tfor(i=1;i<n;i++){\n\t\tif(min>a[i]){\n\t\t\tmin=a[i];\n\t\t}else if(a[i]-min>g){\n\t\t\tc=1;\n\t\t}else if(a[i]-min==g){\n\t\t\tc++;\n\t\t}\n\t}\n\t\n\tprintf(\"%d\\n\",c);\n\t\n\t\n\treturn 0;\n}", "language": "C", "metadata": {"date": 1478494363, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "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/C/s676194469.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s676194469", "user_id": "u890465662"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "#include<stdio.h>\n\nint main()\n{\n\tint n,t;\n\tint i,j;\n\tint c=0;\n\tint g=0;\n\tint min;\n\t\n\tif(scanf(\"%d %d\",&n,&t) < 2) {\n    fprintf(stderr, \"error: ill-formed fraction.\\n\");\n    exit(1);\n\t}\n\t\n\tint a[n];\n\t\n\tfor(i=0;i<n;i++){\n\t\tif(scanf(\"%d\",&a[i]) < 1) {\n    fprintf(stderr, \"error: ill-formed fraction.\\n\");\n    exit(1);\n\t\t}\n\t}\n\t\n\tmin = a[0];\n\tfor(i=1;i<n;i++){\n\t\tif(min>a[i]){\n\t\t\tmin=a[i];\n\t\t}else if(a[i]-min>g){\n\t\t\tc=1;\n\t\t}else if(a[i]-min==g){\n\t\t\tc++;\n\t\t}\n\t}\n\t\n\tprintf(\"%d\\n\",c);\n\t\n\t\n\treturn 0;\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": 496, "cpu_time_ms": 14, "memory_kb": 512}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s708986735", "group_id": "codeNet:p03949", "input_text": "#include<stdio.h>\n#include<stdlib.h>\n#include<string.h>\n\n#define MIN(a,b) ((a)<(b)?(a):(b))\n#define MAX(a,b) ((a)>(b)?(a):(b))\n\ntypedef struct naiveVector{\n  void *array;\n  size_t size;\n  int maxLen;\n  int len;\n} vector;\n\nvector* newVector(const size_t size){\n  vector *v=(vector *)malloc(sizeof(vector));\n  v->array=NULL;\n  v->size=size;\n  v->maxLen=0;\n  v->len=0;\n  return v;\n}\n\nvoid freeVector(vector *v){\n  free(v->array);\n  free(v);\n  return;\n}\n\nvoid push_back(vector *vec,const void *v){\n  if(vec->len==vec->maxLen){\n    vec->maxLen=vec->maxLen*2+1;\n    vec->array=realloc(vec->array,vec->size*vec->maxLen);\n  }\n  memcpy((char *)vec->array+vec->size*vec->len,v,vec->size);\n  vec->len++;\n  return;\n}\n\nvoid erase_back(vector *vec){\n  if(vec->len==0) return;\n  vec->len--;\n  return;\n}\n\nvoid* getAtRef(const vector *vec,const size_t index){\n  return (char *)vec->array+vec->size*index;\n}\n\nvoid getAt(const vector *vec,const size_t index,void *res){\n  memcpy(res,getAtRef(vec,index),vec->size);\n}\n\nvoid assignAt(vector *vec,const size_t index,const void *val){\n  memcpy(getAtRef(vec,index),val,vec->size);\n}\n\nvoid run(void){\n  int n;\n  scanf(\"%d\",&n);\n  int *parent=(int *)calloc(n,sizeof(int));\n  vector **child=(vector **)calloc(n,sizeof(vector));\n  int i,j;\n  for(i=0;i<n;i++) child[i]=newVector(sizeof(int));\n  for(i=0;i<n-1;i++){\n    int a,b;\n    scanf(\"%d%d\",&a,&b);\n    a--;b--;\n    if(a>b){\n      int t=a;\n      a=b;\n      b=t;\n    }\n    parent[b]=a;\n    push_back(child[a],&b);\n  }\n  int *min=(int *)calloc(n,sizeof(int));\n  int *max=(int *)calloc(n,sizeof(int));\n  int *cond=(int *)calloc(n,sizeof(int));\n  const int ini=-10000000;\n  for(i=0;i<n;i++){\n    min[i]=ini;\n    max[i]=-ini;\n    cond[i]=3;\n  }\n  int k;\n  scanf(\"%d\",&k);\n  for(i=0;i<k;i++){\n    int v,p;\n    scanf(\"%d%d\",&v,&p);\n    v--;\n    min[v]=max[v]=p;\n    cond[v]^=1<<(p&2);\n  }  \n  for(i=n-1;i>0;i--){\n    int u=parent[i];\n    min[u]=MAX(min[u],min[i]-1);\n    max[u]=MIN(max[u],max[i]+1);\n    cond[u]&=(cond[i]>>1)|(cond[i]<<1);\n  }\n  if(cond[0]==0){\n    printf(\"No\\n\");\n    return;\n  }\n  for(i=0;i<n;i++){\n    for(j=0;j<child[i]->len;j++){\n      int u;\n      getAt(child[i],j,&u);\n      min[u]=MAX(min[u],min[i]-1);\n      max[u]=MIN(max[u],max[i]+1);\n    }\n  }\n  for(i=0;i<n;i++){\n    if(max[i]<min[i]){\n      printf(\"No\\n\");\n      return;\n    }\n  }\n  printf(\"Yes\\n\");\n  for(i=0;i<n;i++){\n    printf(\"%d\\n\",min[i]);\n  }\n  return;\n}\n\nint main(void){\n  run();\n  return 0;\n}\n", "language": "C", "metadata": {"date": 1546029404, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "problem_description_relpath": "problem_descriptions/p03949.html", "problem_id": "p03949", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03949/input.txt", "sample_output_relpath": "derived/input_output/data/p03949/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03949/C/s708986735.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s708986735", "user_id": "u425248533"}, "prompt_components": {"gold_output": "Yes\n5\n6\n6\n5\n7\n", "input_to_evaluate": "#include<stdio.h>\n#include<stdlib.h>\n#include<string.h>\n\n#define MIN(a,b) ((a)<(b)?(a):(b))\n#define MAX(a,b) ((a)>(b)?(a):(b))\n\ntypedef struct naiveVector{\n  void *array;\n  size_t size;\n  int maxLen;\n  int len;\n} vector;\n\nvector* newVector(const size_t size){\n  vector *v=(vector *)malloc(sizeof(vector));\n  v->array=NULL;\n  v->size=size;\n  v->maxLen=0;\n  v->len=0;\n  return v;\n}\n\nvoid freeVector(vector *v){\n  free(v->array);\n  free(v);\n  return;\n}\n\nvoid push_back(vector *vec,const void *v){\n  if(vec->len==vec->maxLen){\n    vec->maxLen=vec->maxLen*2+1;\n    vec->array=realloc(vec->array,vec->size*vec->maxLen);\n  }\n  memcpy((char *)vec->array+vec->size*vec->len,v,vec->size);\n  vec->len++;\n  return;\n}\n\nvoid erase_back(vector *vec){\n  if(vec->len==0) return;\n  vec->len--;\n  return;\n}\n\nvoid* getAtRef(const vector *vec,const size_t index){\n  return (char *)vec->array+vec->size*index;\n}\n\nvoid getAt(const vector *vec,const size_t index,void *res){\n  memcpy(res,getAtRef(vec,index),vec->size);\n}\n\nvoid assignAt(vector *vec,const size_t index,const void *val){\n  memcpy(getAtRef(vec,index),val,vec->size);\n}\n\nvoid run(void){\n  int n;\n  scanf(\"%d\",&n);\n  int *parent=(int *)calloc(n,sizeof(int));\n  vector **child=(vector **)calloc(n,sizeof(vector));\n  int i,j;\n  for(i=0;i<n;i++) child[i]=newVector(sizeof(int));\n  for(i=0;i<n-1;i++){\n    int a,b;\n    scanf(\"%d%d\",&a,&b);\n    a--;b--;\n    if(a>b){\n      int t=a;\n      a=b;\n      b=t;\n    }\n    parent[b]=a;\n    push_back(child[a],&b);\n  }\n  int *min=(int *)calloc(n,sizeof(int));\n  int *max=(int *)calloc(n,sizeof(int));\n  int *cond=(int *)calloc(n,sizeof(int));\n  const int ini=-10000000;\n  for(i=0;i<n;i++){\n    min[i]=ini;\n    max[i]=-ini;\n    cond[i]=3;\n  }\n  int k;\n  scanf(\"%d\",&k);\n  for(i=0;i<k;i++){\n    int v,p;\n    scanf(\"%d%d\",&v,&p);\n    v--;\n    min[v]=max[v]=p;\n    cond[v]^=1<<(p&2);\n  }  \n  for(i=n-1;i>0;i--){\n    int u=parent[i];\n    min[u]=MAX(min[u],min[i]-1);\n    max[u]=MIN(max[u],max[i]+1);\n    cond[u]&=(cond[i]>>1)|(cond[i]<<1);\n  }\n  if(cond[0]==0){\n    printf(\"No\\n\");\n    return;\n  }\n  for(i=0;i<n;i++){\n    for(j=0;j<child[i]->len;j++){\n      int u;\n      getAt(child[i],j,&u);\n      min[u]=MAX(min[u],min[i]-1);\n      max[u]=MIN(max[u],max[i]+1);\n    }\n  }\n  for(i=0;i<n;i++){\n    if(max[i]<min[i]){\n      printf(\"No\\n\");\n      return;\n    }\n  }\n  printf(\"Yes\\n\");\n  for(i=0;i<n;i++){\n    printf(\"%d\\n\",min[i]);\n  }\n  return;\n}\n\nint main(void){\n  run();\n  return 0;\n}\n", "problem_context": "Score : 800 points\n\nProblem Statement\n\nWe have a tree with N vertices. The vertices are numbered 1, 2, ..., N. The i-th (1 ≦ i ≦ N - 1) edge connects the two vertices A_i and B_i.\n\nTakahashi wrote integers into K of the vertices. Specifically, for each 1 ≦ j ≦ K, he wrote the integer P_j into vertex V_j. The remaining vertices are left empty. After that, he got tired and fell asleep.\n\nThen, Aoki appeared. He is trying to surprise Takahashi by writing integers into all empty vertices so that the following condition is satisfied:\n\nCondition: For any two vertices directly connected by an edge, the integers written into these vertices differ by exactly 1.\n\nDetermine if it is possible to write integers into all empty vertices so that the condition is satisfied. If the answer is positive, find one specific way to satisfy the condition.\n\nConstraints\n\n1 ≦ N ≦ 10^5\n\n1 ≦ K ≦ N\n\n1 ≦ A_i, B_i ≦ N (1 ≦ i ≦ N - 1)\n\n1 ≦ V_j ≦ N (1 ≦ j ≦ K) (21:18, a mistake in this constraint was corrected)\n\n0 ≦ P_j ≦ 10^5 (1 ≦ j ≦ K)\n\nThe given graph is a tree.\n\nAll v_j are distinct.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\nA_1 B_1\nA_2 B_2\n:\nA_{N-1} B_{N-1}\nK\nV_1 P_1\nV_2 P_2\n:\nV_K P_K\n\nOutput\n\nIf it is possible to write integers into all empty vertices so that the condition is satisfied, print Yes. Otherwise, print No.\n\nIf it is possible to satisfy the condition, print N lines in addition. The v-th (1 ≦ v ≦ N) of these N lines should contain the integer that should be written into vertex v. If there are multiple ways to satisfy the condition, any of those is accepted.\n\nSample Input 1\n\n5\n1 2\n3 1\n4 3\n3 5\n2\n2 6\n5 7\n\nSample Output 1\n\nYes\n5\n6\n6\n5\n7\n\nThe figure below shows the tree when Takahashi fell asleep. For each vertex, the integer written beside it represents the index of the vertex, and the integer written into the vertex is the integer written by Takahashi.\n\nAoki can, for example, satisfy the condition by writing integers into the remaining vertices as follows:\n\nThis corresponds to Sample Output 1. Note that other outputs that satisfy the condition will also be accepted, such as:\n\nYes\n7\n6\n8\n7\n7\n\nSample Input 2\n\n5\n1 2\n3 1\n4 3\n3 5\n3\n2 6\n4 3\n5 7\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n4\n1 2\n2 3\n3 4\n1\n1 0\n\nSample Output 3\n\nYes\n0\n-1\n-2\n-3\n\nThe integers written by Aoki may be negative or exceed 10^6.", "sample_input": "5\n1 2\n3 1\n4 3\n3 5\n2\n2 6\n5 7\n"}, "reference_outputs": ["Yes\n5\n6\n6\n5\n7\n"], "source_document_id": "p03949", "source_text": "Score : 800 points\n\nProblem Statement\n\nWe have a tree with N vertices. The vertices are numbered 1, 2, ..., N. The i-th (1 ≦ i ≦ N - 1) edge connects the two vertices A_i and B_i.\n\nTakahashi wrote integers into K of the vertices. Specifically, for each 1 ≦ j ≦ K, he wrote the integer P_j into vertex V_j. The remaining vertices are left empty. After that, he got tired and fell asleep.\n\nThen, Aoki appeared. He is trying to surprise Takahashi by writing integers into all empty vertices so that the following condition is satisfied:\n\nCondition: For any two vertices directly connected by an edge, the integers written into these vertices differ by exactly 1.\n\nDetermine if it is possible to write integers into all empty vertices so that the condition is satisfied. If the answer is positive, find one specific way to satisfy the condition.\n\nConstraints\n\n1 ≦ N ≦ 10^5\n\n1 ≦ K ≦ N\n\n1 ≦ A_i, B_i ≦ N (1 ≦ i ≦ N - 1)\n\n1 ≦ V_j ≦ N (1 ≦ j ≦ K) (21:18, a mistake in this constraint was corrected)\n\n0 ≦ P_j ≦ 10^5 (1 ≦ j ≦ K)\n\nThe given graph is a tree.\n\nAll v_j are distinct.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\nA_1 B_1\nA_2 B_2\n:\nA_{N-1} B_{N-1}\nK\nV_1 P_1\nV_2 P_2\n:\nV_K P_K\n\nOutput\n\nIf it is possible to write integers into all empty vertices so that the condition is satisfied, print Yes. Otherwise, print No.\n\nIf it is possible to satisfy the condition, print N lines in addition. The v-th (1 ≦ v ≦ N) of these N lines should contain the integer that should be written into vertex v. If there are multiple ways to satisfy the condition, any of those is accepted.\n\nSample Input 1\n\n5\n1 2\n3 1\n4 3\n3 5\n2\n2 6\n5 7\n\nSample Output 1\n\nYes\n5\n6\n6\n5\n7\n\nThe figure below shows the tree when Takahashi fell asleep. For each vertex, the integer written beside it represents the index of the vertex, and the integer written into the vertex is the integer written by Takahashi.\n\nAoki can, for example, satisfy the condition by writing integers into the remaining vertices as follows:\n\nThis corresponds to Sample Output 1. Note that other outputs that satisfy the condition will also be accepted, such as:\n\nYes\n7\n6\n8\n7\n7\n\nSample Input 2\n\n5\n1 2\n3 1\n4 3\n3 5\n3\n2 6\n4 3\n5 7\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n4\n1 2\n2 3\n3 4\n1\n1 0\n\nSample Output 3\n\nYes\n0\n-1\n-2\n-3\n\nThe integers written by Aoki may be negative or exceed 10^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": 2452, "cpu_time_ms": 46, "memory_kb": 10240}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s787697698", "group_id": "codeNet:p03954", "input_text": "#include <stdio.h>\n#include <stdlib.h>\n#include <string.h>\n\nint median(int a, int b, int c) {\n\tif ((a>=b && b>=c) || (c>=b && b>=a)) {\n\t\treturn b;\n\t} else if ((c>=a && a>=b) || (b>=a && a>=c)) {\n\t\treturn a;\n\t} else return c;\n}\n\nint main(void) {\n\tint a[200020], i, j, N;\n\tscanf(\"%d\", &N);\n\tfor (i=0;i<2*N-1;i++) scanf(\"%d\", &a[i]);\n\n\tfor (i=N-1;i>0;i--) {\n\t\tfor (j=0;j<2*i-1;j++) {\n\t\t\ta[j] = median(a[j], a[j+1], a[j+2]);\n\t\t}\n\t}\n\n\tprintf(\"%d\\n\", a[0]);\n\n\treturn 0;\n}\n", "language": "C", "metadata": {"date": 1477793163, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "problem_description_relpath": "problem_descriptions/p03954.html", "problem_id": "p03954", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03954/input.txt", "sample_output_relpath": "derived/input_output/data/p03954/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03954/C/s787697698.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s787697698", "user_id": "u677149117"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "#include <stdio.h>\n#include <stdlib.h>\n#include <string.h>\n\nint median(int a, int b, int c) {\n\tif ((a>=b && b>=c) || (c>=b && b>=a)) {\n\t\treturn b;\n\t} else if ((c>=a && a>=b) || (b>=a && a>=c)) {\n\t\treturn a;\n\t} else return c;\n}\n\nint main(void) {\n\tint a[200020], i, j, N;\n\tscanf(\"%d\", &N);\n\tfor (i=0;i<2*N-1;i++) scanf(\"%d\", &a[i]);\n\n\tfor (i=N-1;i>0;i--) {\n\t\tfor (j=0;j<2*i-1;j++) {\n\t\t\ta[j] = median(a[j], a[j+1], a[j+2]);\n\t\t}\n\t}\n\n\tprintf(\"%d\\n\", a[0]);\n\n\treturn 0;\n}\n", "problem_context": "Score : 1300 points\n\nProblem Statement\n\nWe have a pyramid with N steps, built with blocks.\nThe steps are numbered 1 through N from top to bottom.\nFor each 1≤i≤N, step i consists of 2i-1 blocks aligned horizontally.\nThe pyramid is built so that the blocks at the centers of the steps are aligned vertically.\n\nA pyramid with N=4 steps\n\nSnuke wrote a permutation of (1, 2, ..., 2N-1) into the blocks of step N.\nThen, he wrote integers into all remaining blocks, under the following rule:\n\nThe integer written into a block b must be equal to the median of the three integers written into the three blocks directly under b, or to the lower left or lower right of b.\n\nWriting integers into the blocks\n\nAfterwards, he erased all integers written into the blocks.\nNow, he only remembers that the permutation written into the blocks of step N was (a_1, a_2, ..., a_{2N-1}).\n\nFind the integer written into the block of step 1.\n\nConstraints\n\n2≤N≤10^5\n\n(a_1, a_2, ..., a_{2N-1}) is a permutation of (1, 2, ..., 2N-1).\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 a_2 ... a_{2N-1}\n\nOutput\n\nPrint the integer written into the block of step 1.\n\nSample Input 1\n\n4\n1 6 3 7 4 5 2\n\nSample Output 1\n\n4\n\nThis case corresponds to the figure in the problem statement.\n\nSample Input 2\n\n2\n1 2 3\n\nSample Output 2\n\n2", "sample_input": "4\n1 6 3 7 4 5 2\n"}, "reference_outputs": ["4\n"], "source_document_id": "p03954", "source_text": "Score : 1300 points\n\nProblem Statement\n\nWe have a pyramid with N steps, built with blocks.\nThe steps are numbered 1 through N from top to bottom.\nFor each 1≤i≤N, step i consists of 2i-1 blocks aligned horizontally.\nThe pyramid is built so that the blocks at the centers of the steps are aligned vertically.\n\nA pyramid with N=4 steps\n\nSnuke wrote a permutation of (1, 2, ..., 2N-1) into the blocks of step N.\nThen, he wrote integers into all remaining blocks, under the following rule:\n\nThe integer written into a block b must be equal to the median of the three integers written into the three blocks directly under b, or to the lower left or lower right of b.\n\nWriting integers into the blocks\n\nAfterwards, he erased all integers written into the blocks.\nNow, he only remembers that the permutation written into the blocks of step N was (a_1, a_2, ..., a_{2N-1}).\n\nFind the integer written into the block of step 1.\n\nConstraints\n\n2≤N≤10^5\n\n(a_1, a_2, ..., a_{2N-1}) is a permutation of (1, 2, ..., 2N-1).\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 a_2 ... a_{2N-1}\n\nOutput\n\nPrint the integer written into the block of step 1.\n\nSample Input 1\n\n4\n1 6 3 7 4 5 2\n\nSample Output 1\n\n4\n\nThis case corresponds to the figure in the problem statement.\n\nSample Input 2\n\n2\n1 2 3\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": 466, "cpu_time_ms": 2102, "memory_kb": 896}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s351028548", "group_id": "codeNet:p03963", "input_text": "#include<stdio.h>\n  int main(void){\n  int i,N,K;\n  scanf(\"%d\",&N);\n  scanf(\"%d\",&K);\n  for(i=0; i<=N-1; i=i+1){\n    K=K*(K-1);\n  }\n  printf(\"%d¥n\",K);\n  return 0;\n}\n", "language": "C", "metadata": {"date": 1476742441, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "problem_description_relpath": "problem_descriptions/p03963.html", "problem_id": "p03963", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03963/input.txt", "sample_output_relpath": "derived/input_output/data/p03963/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03963/C/s351028548.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s351028548", "user_id": "u350647370"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "#include<stdio.h>\n  int main(void){\n  int i,N,K;\n  scanf(\"%d\",&N);\n  scanf(\"%d\",&K);\n  for(i=0; i<=N-1; i=i+1){\n    K=K*(K-1);\n  }\n  printf(\"%d¥n\",K);\n  return 0;\n}\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nThere are N balls placed in a row.\nAtCoDeer the deer is painting each of these in one of the K colors of his paint cans.\nFor aesthetic reasons, any two adjacent balls must be painted in different colors.\n\nFind the number of the possible ways to paint the balls.\n\nConstraints\n\n1≦N≦1000\n\n2≦K≦1000\n\nThe correct answer is at most 2^{31}-1.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN K\n\nOutput\n\nPrint the number of the possible ways to paint the balls.\n\nSample Input 1\n\n2 2\n\nSample Output 1\n\n2\n\nWe will denote the colors by 0 and 1. There are two possible ways: we can either paint the left ball in color 0 and the right ball in color 1, or paint the left in color 1 and the right in color 0.\n\nSample Input 2\n\n1 10\n\nSample Output 2\n\n10\n\nSince there is only one ball, we can use any of the ten colors to paint it. Thus, the answer is ten.", "sample_input": "2 2\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03963", "source_text": "Score : 200 points\n\nProblem Statement\n\nThere are N balls placed in a row.\nAtCoDeer the deer is painting each of these in one of the K colors of his paint cans.\nFor aesthetic reasons, any two adjacent balls must be painted in different colors.\n\nFind the number of the possible ways to paint the balls.\n\nConstraints\n\n1≦N≦1000\n\n2≦K≦1000\n\nThe correct answer is at most 2^{31}-1.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN K\n\nOutput\n\nPrint the number of the possible ways to paint the balls.\n\nSample Input 1\n\n2 2\n\nSample Output 1\n\n2\n\nWe will denote the colors by 0 and 1. There are two possible ways: we can either paint the left ball in color 0 and the right ball in color 1, or paint the left in color 1 and the right in color 0.\n\nSample Input 2\n\n1 10\n\nSample Output 2\n\n10\n\nSince there is only one ball, we can use any of the ten colors to paint it. Thus, the answer is ten.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 166, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s931400788", "group_id": "codeNet:p03971", "input_text": "int main()\n{\n\tint n,a,b;\n\tscanf(\"%d %d %d\",n,a,b);\n\tchar string[n];\n\tscanf(\"%s\",string);\n\tint i;\n\tint passed = 0;\n\n\tfor (i=0;i<n;i++){\n\t\tif (string[i] == 'c') printf(\"No\\n\");\n\t\telse if (string[i] == 'a') {\n\t\t\tif (passed < a+b) {\n\t\t\t\tprintf(\"Yes\\n\");\n\t\t\t\tpassed++;\n\t\t\t} \n\t\t\telse printf(\"No\\n\");\n\t\t} else {\n\t\t\tif (passed < a+b && i < b){\n\t\t\t\tprintf(\"Yes\\n\");\n\t\t\t\tpassed++;\n\t\t\t}\n\t\t\telse printf(\"No\\n\");\n\t\t}\n\t}\n\treturn 0;\n}", "language": "C", "metadata": {"date": 1476125784, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "problem_description_relpath": "problem_descriptions/p03971.html", "problem_id": "p03971", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03971/input.txt", "sample_output_relpath": "derived/input_output/data/p03971/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03971/C/s931400788.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s931400788", "user_id": "u757424147"}, "prompt_components": {"gold_output": "Yes\nYes\nNo\nNo\nYes\nYes\nYes\nNo\nNo\nNo\n", "input_to_evaluate": "int main()\n{\n\tint n,a,b;\n\tscanf(\"%d %d %d\",n,a,b);\n\tchar string[n];\n\tscanf(\"%s\",string);\n\tint i;\n\tint passed = 0;\n\n\tfor (i=0;i<n;i++){\n\t\tif (string[i] == 'c') printf(\"No\\n\");\n\t\telse if (string[i] == 'a') {\n\t\t\tif (passed < a+b) {\n\t\t\t\tprintf(\"Yes\\n\");\n\t\t\t\tpassed++;\n\t\t\t} \n\t\t\telse printf(\"No\\n\");\n\t\t} else {\n\t\t\tif (passed < a+b && i < b){\n\t\t\t\tprintf(\"Yes\\n\");\n\t\t\t\tpassed++;\n\t\t\t}\n\t\t\telse printf(\"No\\n\");\n\t\t}\n\t}\n\treturn 0;\n}", "problem_context": "Score : 200 points\n\nProblem Statement\n\nThere are N participants in the CODE FESTIVAL 2016 Qualification contests. The participants are either students in Japan, students from overseas, or neither of these.\n\nOnly Japanese students or overseas students can pass the Qualification contests. The students pass when they satisfy the conditions listed below, from the top rank down. Participants who are not students cannot pass the Qualification contests.\n\nA Japanese student passes the Qualification contests if the number of the participants who have already definitively passed is currently fewer than A+B.\n\nAn overseas student passes the Qualification contests if the number of the participants who have already definitively passed is currently fewer than A+B and the student ranks B-th or above among all overseas students.\n\nA string S is assigned indicating attributes of all participants. If the i-th character of string S is a, this means the participant ranked i-th in the Qualification contests is a Japanese student; b means the participant ranked i-th is an overseas student; and c means the participant ranked i-th is neither of these.\n\nWrite a program that outputs for all the participants in descending rank either Yes if they passed the Qualification contests or No if they did not pass.\n\nConstraints\n\n1≦N,A,B≦100000\n\nA+B≦N\n\nS is N characters long.\n\nS consists only of the letters a, b and c.\n\nInput\n\nInputs are provided from Standard Input in the following form.\n\nN A B\nS\n\nOutput\n\nOutput N lines. On the i-th line, output Yes if the i-th participant passed the Qualification contests or No if that participant did not pass.\n\nSample Input 1\n\n10 2 3\nabccabaabb\n\nSample Output 1\n\nYes\nYes\nNo\nNo\nYes\nYes\nYes\nNo\nNo\nNo\n\nThe first, second, fifth, sixth, and seventh participants pass the Qualification contests.\n\nSample Input 2\n\n12 5 2\ncabbabaacaba\n\nSample Output 2\n\nNo\nYes\nYes\nYes\nYes\nNo\nYes\nYes\nNo\nYes\nNo\nNo\n\nThe sixth participant is third among overseas students and thus does not pass the Qualification contests.\n\nSample Input 3\n\n5 2 2\nccccc\n\nSample Output 3\n\nNo\nNo\nNo\nNo\nNo", "sample_input": "10 2 3\nabccabaabb\n"}, "reference_outputs": ["Yes\nYes\nNo\nNo\nYes\nYes\nYes\nNo\nNo\nNo\n"], "source_document_id": "p03971", "source_text": "Score : 200 points\n\nProblem Statement\n\nThere are N participants in the CODE FESTIVAL 2016 Qualification contests. The participants are either students in Japan, students from overseas, or neither of these.\n\nOnly Japanese students or overseas students can pass the Qualification contests. The students pass when they satisfy the conditions listed below, from the top rank down. Participants who are not students cannot pass the Qualification contests.\n\nA Japanese student passes the Qualification contests if the number of the participants who have already definitively passed is currently fewer than A+B.\n\nAn overseas student passes the Qualification contests if the number of the participants who have already definitively passed is currently fewer than A+B and the student ranks B-th or above among all overseas students.\n\nA string S is assigned indicating attributes of all participants. If the i-th character of string S is a, this means the participant ranked i-th in the Qualification contests is a Japanese student; b means the participant ranked i-th is an overseas student; and c means the participant ranked i-th is neither of these.\n\nWrite a program that outputs for all the participants in descending rank either Yes if they passed the Qualification contests or No if they did not pass.\n\nConstraints\n\n1≦N,A,B≦100000\n\nA+B≦N\n\nS is N characters long.\n\nS consists only of the letters a, b and c.\n\nInput\n\nInputs are provided from Standard Input in the following form.\n\nN A B\nS\n\nOutput\n\nOutput N lines. On the i-th line, output Yes if the i-th participant passed the Qualification contests or No if that participant did not pass.\n\nSample Input 1\n\n10 2 3\nabccabaabb\n\nSample Output 1\n\nYes\nYes\nNo\nNo\nYes\nYes\nYes\nNo\nNo\nNo\n\nThe first, second, fifth, sixth, and seventh participants pass the Qualification contests.\n\nSample Input 2\n\n12 5 2\ncabbabaacaba\n\nSample Output 2\n\nNo\nYes\nYes\nYes\nYes\nNo\nYes\nYes\nNo\nYes\nNo\nNo\n\nThe sixth participant is third among overseas students and thus does not pass the Qualification contests.\n\nSample Input 3\n\n5 2 2\nccccc\n\nSample Output 3\n\nNo\nNo\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": 419, "cpu_time_ms": 113, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s329948215", "group_id": "codeNet:p03971", "input_text": "#include <stdio.h>\n\nint check(int *p,int n){\n    int i = 0;\n    while(1){\n        if(p[i] == n){\n            return i+1;\n        }\n        i++;\n    }\n    return -1;\n}\n\nvoid append(int *p, int n){\n    int i = 0;\n    while(1){\n        if(p[i] == 0){\n            p[i] = n;\n            return;\n        }\n        i++;\n    }\n}\n\nint main (void){\n    int N, A, B;\n    scanf(\"%d %d %d\",&N,&A,&B);\n    char s[N+1];\n    scanf(\"%s\",s);\n    int pass = 0;\n    int listB[] = {0};\n    for(int i = 0; i < N; i++){\n        if(s[i] == 'b'){\n            append(listB,i);\n        }\n    }\n\n            \n    for(int i = 0; i < N; i++){\n        if(s[i] == 'a' && pass < A+B){\n            pass++;\n            printf(\"Yes\\n\");\n        } else if(s[i] == 'b' && pass < A+B && check(listB,i) < B){\n            pass++;\n            printf(\"Yes\\n\");\n        } else {\n            printf(\"No\\n\");\n        }\n    }\n    return 0;\n}", "language": "C", "metadata": {"date": 1476121872, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "problem_description_relpath": "problem_descriptions/p03971.html", "problem_id": "p03971", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03971/input.txt", "sample_output_relpath": "derived/input_output/data/p03971/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03971/C/s329948215.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s329948215", "user_id": "u846552659"}, "prompt_components": {"gold_output": "Yes\nYes\nNo\nNo\nYes\nYes\nYes\nNo\nNo\nNo\n", "input_to_evaluate": "#include <stdio.h>\n\nint check(int *p,int n){\n    int i = 0;\n    while(1){\n        if(p[i] == n){\n            return i+1;\n        }\n        i++;\n    }\n    return -1;\n}\n\nvoid append(int *p, int n){\n    int i = 0;\n    while(1){\n        if(p[i] == 0){\n            p[i] = n;\n            return;\n        }\n        i++;\n    }\n}\n\nint main (void){\n    int N, A, B;\n    scanf(\"%d %d %d\",&N,&A,&B);\n    char s[N+1];\n    scanf(\"%s\",s);\n    int pass = 0;\n    int listB[] = {0};\n    for(int i = 0; i < N; i++){\n        if(s[i] == 'b'){\n            append(listB,i);\n        }\n    }\n\n            \n    for(int i = 0; i < N; i++){\n        if(s[i] == 'a' && pass < A+B){\n            pass++;\n            printf(\"Yes\\n\");\n        } else if(s[i] == 'b' && pass < A+B && check(listB,i) < B){\n            pass++;\n            printf(\"Yes\\n\");\n        } else {\n            printf(\"No\\n\");\n        }\n    }\n    return 0;\n}", "problem_context": "Score : 200 points\n\nProblem Statement\n\nThere are N participants in the CODE FESTIVAL 2016 Qualification contests. The participants are either students in Japan, students from overseas, or neither of these.\n\nOnly Japanese students or overseas students can pass the Qualification contests. The students pass when they satisfy the conditions listed below, from the top rank down. Participants who are not students cannot pass the Qualification contests.\n\nA Japanese student passes the Qualification contests if the number of the participants who have already definitively passed is currently fewer than A+B.\n\nAn overseas student passes the Qualification contests if the number of the participants who have already definitively passed is currently fewer than A+B and the student ranks B-th or above among all overseas students.\n\nA string S is assigned indicating attributes of all participants. If the i-th character of string S is a, this means the participant ranked i-th in the Qualification contests is a Japanese student; b means the participant ranked i-th is an overseas student; and c means the participant ranked i-th is neither of these.\n\nWrite a program that outputs for all the participants in descending rank either Yes if they passed the Qualification contests or No if they did not pass.\n\nConstraints\n\n1≦N,A,B≦100000\n\nA+B≦N\n\nS is N characters long.\n\nS consists only of the letters a, b and c.\n\nInput\n\nInputs are provided from Standard Input in the following form.\n\nN A B\nS\n\nOutput\n\nOutput N lines. On the i-th line, output Yes if the i-th participant passed the Qualification contests or No if that participant did not pass.\n\nSample Input 1\n\n10 2 3\nabccabaabb\n\nSample Output 1\n\nYes\nYes\nNo\nNo\nYes\nYes\nYes\nNo\nNo\nNo\n\nThe first, second, fifth, sixth, and seventh participants pass the Qualification contests.\n\nSample Input 2\n\n12 5 2\ncabbabaacaba\n\nSample Output 2\n\nNo\nYes\nYes\nYes\nYes\nNo\nYes\nYes\nNo\nYes\nNo\nNo\n\nThe sixth participant is third among overseas students and thus does not pass the Qualification contests.\n\nSample Input 3\n\n5 2 2\nccccc\n\nSample Output 3\n\nNo\nNo\nNo\nNo\nNo", "sample_input": "10 2 3\nabccabaabb\n"}, "reference_outputs": ["Yes\nYes\nNo\nNo\nYes\nYes\nYes\nNo\nNo\nNo\n"], "source_document_id": "p03971", "source_text": "Score : 200 points\n\nProblem Statement\n\nThere are N participants in the CODE FESTIVAL 2016 Qualification contests. The participants are either students in Japan, students from overseas, or neither of these.\n\nOnly Japanese students or overseas students can pass the Qualification contests. The students pass when they satisfy the conditions listed below, from the top rank down. Participants who are not students cannot pass the Qualification contests.\n\nA Japanese student passes the Qualification contests if the number of the participants who have already definitively passed is currently fewer than A+B.\n\nAn overseas student passes the Qualification contests if the number of the participants who have already definitively passed is currently fewer than A+B and the student ranks B-th or above among all overseas students.\n\nA string S is assigned indicating attributes of all participants. If the i-th character of string S is a, this means the participant ranked i-th in the Qualification contests is a Japanese student; b means the participant ranked i-th is an overseas student; and c means the participant ranked i-th is neither of these.\n\nWrite a program that outputs for all the participants in descending rank either Yes if they passed the Qualification contests or No if they did not pass.\n\nConstraints\n\n1≦N,A,B≦100000\n\nA+B≦N\n\nS is N characters long.\n\nS consists only of the letters a, b and c.\n\nInput\n\nInputs are provided from Standard Input in the following form.\n\nN A B\nS\n\nOutput\n\nOutput N lines. On the i-th line, output Yes if the i-th participant passed the Qualification contests or No if that participant did not pass.\n\nSample Input 1\n\n10 2 3\nabccabaabb\n\nSample Output 1\n\nYes\nYes\nNo\nNo\nYes\nYes\nYes\nNo\nNo\nNo\n\nThe first, second, fifth, sixth, and seventh participants pass the Qualification contests.\n\nSample Input 2\n\n12 5 2\ncabbabaacaba\n\nSample Output 2\n\nNo\nYes\nYes\nYes\nYes\nNo\nYes\nYes\nNo\nYes\nNo\nNo\n\nThe sixth participant is third among overseas students and thus does not pass the Qualification contests.\n\nSample Input 3\n\n5 2 2\nccccc\n\nSample Output 3\n\nNo\nNo\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": 894, "cpu_time_ms": 112, "memory_kb": 640}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s881491670", "group_id": "codeNet:p03976", "input_text": "#include<stdio.h>\n#include<stdlib.h>\n#include<stdint.h>\n#include<inttypes.h>\n\ntypedef int32_t i32;\n\nint cmp (const void *a, const void *b) {\n  i32 d = *(i32 *)a - *(i32 *)b;\n  return d == 0 ? 0 : d > 0 ? -1 : 1;\n}\n\nvoid run (void) {\n  i32 n, k;\n  scanf (\"%\" SCNi32 \"%\" SCNi32, &n, &k);\n  i32 len = 26;\n  i32*cnt = (i32 *) calloc (len, sizeof (i32));\n  while (n--) {\n    char p[12];\n    scanf (\"%s\", p);\n    cnt[p[0] - 'A']++;\n  }\n  i32 ans = 0;\n  while (1) {\n    qsort (cnt, len, sizeof (i32), cmp);\n    while (len > 0 && cnt[len - 1] == 0) len--;\n    if (len < k) break;\n    ans++;\n    for (i32 i = 0; i < k; ++i) {\n      cnt[i]--;\n    }\n  }\n  printf(\"%\" PRIi32 \"\\n\", ans);\n}\n\nint main (void) {\n  run ();\n  return 0;\n}\n", "language": "C", "metadata": {"date": 1553621615, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "problem_description_relpath": "problem_descriptions/p03976.html", "problem_id": "p03976", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03976/input.txt", "sample_output_relpath": "derived/input_output/data/p03976/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03976/C/s881491670.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s881491670", "user_id": "u425248533"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "#include<stdio.h>\n#include<stdlib.h>\n#include<stdint.h>\n#include<inttypes.h>\n\ntypedef int32_t i32;\n\nint cmp (const void *a, const void *b) {\n  i32 d = *(i32 *)a - *(i32 *)b;\n  return d == 0 ? 0 : d > 0 ? -1 : 1;\n}\n\nvoid run (void) {\n  i32 n, k;\n  scanf (\"%\" SCNi32 \"%\" SCNi32, &n, &k);\n  i32 len = 26;\n  i32*cnt = (i32 *) calloc (len, sizeof (i32));\n  while (n--) {\n    char p[12];\n    scanf (\"%s\", p);\n    cnt[p[0] - 'A']++;\n  }\n  i32 ans = 0;\n  while (1) {\n    qsort (cnt, len, sizeof (i32), cmp);\n    while (len > 0 && cnt[len - 1] == 0) len--;\n    if (len < k) break;\n    ans++;\n    for (i32 i = 0; i < k; ++i) {\n      cnt[i]--;\n    }\n  }\n  printf(\"%\" PRIi32 \"\\n\", ans);\n}\n\nint main (void) {\n  run ();\n  return 0;\n}\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nKyoto University Programming Contest is a programming contest voluntarily held by some Kyoto University students.\nThis contest is abbreviated as Kyoto University Programming Contest and called KUPC.\n\nsource: Kyoto University Programming Contest Information\n\nThe problem-preparing committee met to hold this year's KUPC and N problems were proposed there.\nThe problems are numbered from 1 to N and the name of i-th problem is P_i.\nHowever, since they proposed too many problems, they decided to divide them into some sets for several contests.\n\nThey decided to divide this year's KUPC into several KUPCs by dividing problems under the following conditions.\n\nOne KUPC provides K problems.\n\nEach problem appears at most once among all the KUPCs.\n\nAll the first letters of the problem names in one KUPC must be different.\n\nYou, one of the committee members, want to hold as many KUPCs as possible.\nWrite a program to find the maximum number of KUPCs that can be held this year.\n\nConstraints\n\n1 \\leq N \\leq 10^4\n\n1 \\leq K \\leq 26\n\n1 \\leq |P_i| \\leq 10\n\nAll characters in P_i are capital letters.\n\nNote that, for each i and j (1 \\leq i < j \\leq N),\nP_i \\neq P_j are not necessarily satisfied.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN K\nP_1\n:\nP_N\n\nOutput\n\nPrint the maximum number of KUPCs that can be held on one line.\n\nSample Input 1\n\n9 3\nAPPLE\nANT\nATCODER\nBLOCK\nBULL\nBOSS\nCAT\nDOG\nEGG\n\nFor example, three KUPCs can be held by dividing the problems as follows.\n\nFirst: APPLE, BLOCK, CAT\n\nSecond: ANT, BULL, DOG\n\nThird: ATCODER, BOSS, EGG\n\nSample Output 1\n\n3\n\nSample Input 2\n\n3 2\nKU\nKYOUDAI\nKYOTOUNIV\n\nSample Output 2\n\n0\n\nNo KUPC can be held.", "sample_input": "9 3\nAPPLE\nANT\nATCODER\nBLOCK\nBULL\nBOSS\nCAT\nDOG\nEGG\n"}, "reference_outputs": ["3\n"], "source_document_id": "p03976", "source_text": "Score : 100 points\n\nProblem Statement\n\nKyoto University Programming Contest is a programming contest voluntarily held by some Kyoto University students.\nThis contest is abbreviated as Kyoto University Programming Contest and called KUPC.\n\nsource: Kyoto University Programming Contest Information\n\nThe problem-preparing committee met to hold this year's KUPC and N problems were proposed there.\nThe problems are numbered from 1 to N and the name of i-th problem is P_i.\nHowever, since they proposed too many problems, they decided to divide them into some sets for several contests.\n\nThey decided to divide this year's KUPC into several KUPCs by dividing problems under the following conditions.\n\nOne KUPC provides K problems.\n\nEach problem appears at most once among all the KUPCs.\n\nAll the first letters of the problem names in one KUPC must be different.\n\nYou, one of the committee members, want to hold as many KUPCs as possible.\nWrite a program to find the maximum number of KUPCs that can be held this year.\n\nConstraints\n\n1 \\leq N \\leq 10^4\n\n1 \\leq K \\leq 26\n\n1 \\leq |P_i| \\leq 10\n\nAll characters in P_i are capital letters.\n\nNote that, for each i and j (1 \\leq i < j \\leq N),\nP_i \\neq P_j are not necessarily satisfied.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN K\nP_1\n:\nP_N\n\nOutput\n\nPrint the maximum number of KUPCs that can be held on one line.\n\nSample Input 1\n\n9 3\nAPPLE\nANT\nATCODER\nBLOCK\nBULL\nBOSS\nCAT\nDOG\nEGG\n\nFor example, three KUPCs can be held by dividing the problems as follows.\n\nFirst: APPLE, BLOCK, CAT\n\nSecond: ANT, BULL, DOG\n\nThird: ATCODER, BOSS, EGG\n\nSample Output 1\n\n3\n\nSample Input 2\n\n3 2\nKU\nKYOUDAI\nKYOTOUNIV\n\nSample Output 2\n\n0\n\nNo KUPC can be held.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 7, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s812160974", "group_id": "codeNet:p03986", "input_text": "#include<stdio.h>\nint main() {\n\tchar X[200001];\n\tint i = 0, c = 0, len, tmp = 0, ans = 0;\n\tscanf(\"%s\", &X);\n\tlen = strlen(X);\n\twhile (X[i] != 0)\n\t{\n\t\tif (X[i] == 'S')\n\t\t{\n\t\t\tc++;\n\t\t}\n\t\telse if (X[i] = 'T' && c > 0)\n\t\t{\n\t\t\tc--;\n\t\t\ttmp++;\n\t\t}\n\t\ti++;\n\t}\n\tans = len - tmp * 2;\n\tprintf(\"%d\\n\", ans);\n\n\treturn 0;\n}", "language": "C", "metadata": {"date": 1553910840, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "problem_description_relpath": "problem_descriptions/p03986.html", "problem_id": "p03986", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03986/input.txt", "sample_output_relpath": "derived/input_output/data/p03986/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03986/C/s812160974.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s812160974", "user_id": "u389185410"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "#include<stdio.h>\nint main() {\n\tchar X[200001];\n\tint i = 0, c = 0, len, tmp = 0, ans = 0;\n\tscanf(\"%s\", &X);\n\tlen = strlen(X);\n\twhile (X[i] != 0)\n\t{\n\t\tif (X[i] == 'S')\n\t\t{\n\t\t\tc++;\n\t\t}\n\t\telse if (X[i] = 'T' && c > 0)\n\t\t{\n\t\t\tc--;\n\t\t\ttmp++;\n\t\t}\n\t\ti++;\n\t}\n\tans = len - tmp * 2;\n\tprintf(\"%d\\n\", ans);\n\n\treturn 0;\n}", "problem_context": "Score : 300 points\n\nProblem Statement\n\nWe have a string X, which has an even number of characters. Half the characters are S, and the other half are T.\n\nTakahashi, who hates the string ST, will perform the following operation 10^{10000} times:\n\nAmong the occurrences of ST in X as (contiguous) substrings, remove the leftmost one. If there is no occurrence, do nothing.\n\nFind the eventual length of X.\n\nConstraints\n\n2 ≦ |X| ≦ 200,000\n\nThe length of X is even.\n\nHalf the characters in X are S, and the other half are T.\n\nPartial Scores\n\nIn test cases worth 200 points, |X| ≦ 200.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nX\n\nOutput\n\nPrint the eventual length of X.\n\nSample Input 1\n\nTSTTSS\n\nSample Output 1\n\n4\n\nIn the 1-st operation, the 2-nd and 3-rd characters of TSTTSS are removed.\nX becomes TTSS, and since it does not contain ST anymore, nothing is done in the remaining 10^{10000}-1 operations.\nThus, the answer is 4.\n\nSample Input 2\n\nSSTTST\n\nSample Output 2\n\n0\n\nX will eventually become an empty string: SSTTST ⇒ STST ⇒ ST ⇒ ``.\n\nSample Input 3\n\nTSSTTTSS\n\nSample Output 3\n\n4\n\nX will become: TSSTTTSS ⇒ TSTTSS ⇒ TTSS.", "sample_input": "TSTTSS\n"}, "reference_outputs": ["4\n"], "source_document_id": "p03986", "source_text": "Score : 300 points\n\nProblem Statement\n\nWe have a string X, which has an even number of characters. Half the characters are S, and the other half are T.\n\nTakahashi, who hates the string ST, will perform the following operation 10^{10000} times:\n\nAmong the occurrences of ST in X as (contiguous) substrings, remove the leftmost one. If there is no occurrence, do nothing.\n\nFind the eventual length of X.\n\nConstraints\n\n2 ≦ |X| ≦ 200,000\n\nThe length of X is even.\n\nHalf the characters in X are S, and the other half are T.\n\nPartial Scores\n\nIn test cases worth 200 points, |X| ≦ 200.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nX\n\nOutput\n\nPrint the eventual length of X.\n\nSample Input 1\n\nTSTTSS\n\nSample Output 1\n\n4\n\nIn the 1-st operation, the 2-nd and 3-rd characters of TSTTSS are removed.\nX becomes TTSS, and since it does not contain ST anymore, nothing is done in the remaining 10^{10000}-1 operations.\nThus, the answer is 4.\n\nSample Input 2\n\nSSTTST\n\nSample Output 2\n\n0\n\nX will eventually become an empty string: SSTTST ⇒ STST ⇒ ST ⇒ ``.\n\nSample Input 3\n\nTSSTTTSS\n\nSample Output 3\n\n4\n\nX will become: TSSTTTSS ⇒ TSTTSS ⇒ TTSS.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 308, "cpu_time_ms": 2, "memory_kb": 384}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s469992165", "group_id": "codeNet:p03992", "input_text": "#include <stdio.h>\n#include <string.h>\n\nint main(void){\n    char s[15],t[15];\n    scanf(\"%s\",s);\n    strncpy(t,s,4);\n    t[4]=' ';\n    strncpy(t+5,s+4,8);\n    printf(\"%s\\n\",t);\n\treturn 0 ;\n}", "language": "C", "metadata": {"date": 1531867890, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "problem_description_relpath": "problem_descriptions/p03992.html", "problem_id": "p03992", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03992/input.txt", "sample_output_relpath": "derived/input_output/data/p03992/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03992/C/s469992165.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s469992165", "user_id": "u750028862"}, "prompt_components": {"gold_output": "CODE FESTIVAL\n", "input_to_evaluate": "#include <stdio.h>\n#include <string.h>\n\nint main(void){\n    char s[15],t[15];\n    scanf(\"%s\",s);\n    strncpy(t,s,4);\n    t[4]=' ';\n    strncpy(t+5,s+4,8);\n    printf(\"%s\\n\",t);\n\treturn 0 ;\n}", "problem_context": "Score : 100 points\n\nProblem Statement\n\nThis contest is CODE FESTIVAL.\nHowever, Mr. Takahashi always writes it CODEFESTIVAL, omitting the single space between CODE and FESTIVAL.\n\nSo he has decided to make a program that puts the single space he omitted.\n\nYou are given a string s with 12 letters.\nOutput the string putting a single space between the first 4 letters and last 8 letters in the string s.\n\nConstraints\n\ns contains exactly 12 letters.\n\nAll letters in s are uppercase English letters.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\ns\n\nOutput\n\nPrint the string putting a single space between the first 4 letters and last 8 letters in the string s.\nPut a line break at the end.\n\nSample Input 1\n\nCODEFESTIVAL\n\nSample Output 1\n\nCODE FESTIVAL\n\nPutting a single space between the first 4 letters and last 8 letters in CODEFESTIVAL makes it CODE FESTIVAL.\n\nSample Input 2\n\nPOSTGRADUATE\n\nSample Output 2\n\nPOST GRADUATE\n\nSample Input 3\n\nABCDEFGHIJKL\n\nSample Output 3\n\nABCD EFGHIJKL", "sample_input": "CODEFESTIVAL\n"}, "reference_outputs": ["CODE FESTIVAL\n"], "source_document_id": "p03992", "source_text": "Score : 100 points\n\nProblem Statement\n\nThis contest is CODE FESTIVAL.\nHowever, Mr. Takahashi always writes it CODEFESTIVAL, omitting the single space between CODE and FESTIVAL.\n\nSo he has decided to make a program that puts the single space he omitted.\n\nYou are given a string s with 12 letters.\nOutput the string putting a single space between the first 4 letters and last 8 letters in the string s.\n\nConstraints\n\ns contains exactly 12 letters.\n\nAll letters in s are uppercase English letters.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\ns\n\nOutput\n\nPrint the string putting a single space between the first 4 letters and last 8 letters in the string s.\nPut a line break at the end.\n\nSample Input 1\n\nCODEFESTIVAL\n\nSample Output 1\n\nCODE FESTIVAL\n\nPutting a single space between the first 4 letters and last 8 letters in CODEFESTIVAL makes it CODE FESTIVAL.\n\nSample Input 2\n\nPOSTGRADUATE\n\nSample Output 2\n\nPOST GRADUATE\n\nSample Input 3\n\nABCDEFGHIJKL\n\nSample Output 3\n\nABCD EFGHIJKL", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 190, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s490147476", "group_id": "codeNet:p03993", "input_text": "#include <stdio.h>\n#include <math.h>\n#include <string.h>\n#include <stdlib.h>\n#include <time.h>\n\n#define pai 3.1415926535\n\nint main(void) {\n\t\n\tint N;\n\tscanf(\"%d\", &N);\n\tint a[100000];\n\tfor (int i = 0; i < N; i++) {\n\t\tscanf(\"%d\", &a[i]);\n\t}\n\n\tint va;\n\tint count = 0;\n\tfor (int i = 0; i < N; i++) {\n\t\tva = a[i];\n\t\tif (i + 1 == a[va-1]) {\n\t\t\tcount++;\n\t\t}\n\t}\n\n\tprintf(\"%d\\n\", count / 2);\n\n\treturn 0;\n}", "language": "C", "metadata": {"date": 1577379403, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "problem_description_relpath": "problem_descriptions/p03993.html", "problem_id": "p03993", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03993/input.txt", "sample_output_relpath": "derived/input_output/data/p03993/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03993/C/s490147476.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s490147476", "user_id": "u276980836"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "#include <stdio.h>\n#include <math.h>\n#include <string.h>\n#include <stdlib.h>\n#include <time.h>\n\n#define pai 3.1415926535\n\nint main(void) {\n\t\n\tint N;\n\tscanf(\"%d\", &N);\n\tint a[100000];\n\tfor (int i = 0; i < N; i++) {\n\t\tscanf(\"%d\", &a[i]);\n\t}\n\n\tint va;\n\tint count = 0;\n\tfor (int i = 0; i < N; i++) {\n\t\tva = a[i];\n\t\tif (i + 1 == a[va-1]) {\n\t\t\tcount++;\n\t\t}\n\t}\n\n\tprintf(\"%d\\n\", count / 2);\n\n\treturn 0;\n}", "problem_context": "Score : 200 points\n\nProblem Statement\n\nThere are N rabbits, numbered 1 through N.\n\nThe i-th (1≤i≤N) rabbit likes rabbit a_i.\nNote that no rabbit can like itself, that is, a_i≠i.\n\nFor a pair of rabbits i and j (i＜j), we call the pair (i，j) a friendly pair if the following condition is met.\n\nRabbit i likes rabbit j and rabbit j likes rabbit i.\n\nCalculate the number of the friendly pairs.\n\nConstraints\n\n2≤N≤10^5\n\n1≤a_i≤N\n\na_i≠i\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 number of the friendly pairs.\n\nSample Input 1\n\n4\n2 1 4 3\n\nSample Output 1\n\n2\n\nThere are two friendly pairs: (1，2) and (3，4).\n\nSample Input 2\n\n3\n2 3 1\n\nSample Output 2\n\n0\n\nThere are no friendly pairs.\n\nSample Input 3\n\n5\n5 5 5 5 1\n\nSample Output 3\n\n1\n\nThere is one friendly pair: (1，5).", "sample_input": "4\n2 1 4 3\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03993", "source_text": "Score : 200 points\n\nProblem Statement\n\nThere are N rabbits, numbered 1 through N.\n\nThe i-th (1≤i≤N) rabbit likes rabbit a_i.\nNote that no rabbit can like itself, that is, a_i≠i.\n\nFor a pair of rabbits i and j (i＜j), we call the pair (i，j) a friendly pair if the following condition is met.\n\nRabbit i likes rabbit j and rabbit j likes rabbit i.\n\nCalculate the number of the friendly pairs.\n\nConstraints\n\n2≤N≤10^5\n\n1≤a_i≤N\n\na_i≠i\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 number of the friendly pairs.\n\nSample Input 1\n\n4\n2 1 4 3\n\nSample Output 1\n\n2\n\nThere are two friendly pairs: (1，2) and (3，4).\n\nSample Input 2\n\n3\n2 3 1\n\nSample Output 2\n\n0\n\nThere are no friendly pairs.\n\nSample Input 3\n\n5\n5 5 5 5 1\n\nSample Output 3\n\n1\n\nThere is one friendly pair: (1，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": 396, "cpu_time_ms": 11, "memory_kb": 512}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s138268668", "group_id": "codeNet:p03997", "input_text": "#include <stdio.h>\n\nint main()\n{\n        int a,b,h,ar;\n        scanf(\"%d%d%d\",&a,&b,&h);\n        ar=((a+b)*h)/2;\n        printf(\"%d\\n\",ar);\n        return 0;\n}\n\n", "language": "C", "metadata": {"date": 1589148715, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "problem_description_relpath": "problem_descriptions/p03997.html", "problem_id": "p03997", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03997/input.txt", "sample_output_relpath": "derived/input_output/data/p03997/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03997/C/s138268668.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s138268668", "user_id": "u863370423"}, "prompt_components": {"gold_output": "7\n", "input_to_evaluate": "#include <stdio.h>\n\nint main()\n{\n        int a,b,h,ar;\n        scanf(\"%d%d%d\",&a,&b,&h);\n        ar=((a+b)*h)/2;\n        printf(\"%d\\n\",ar);\n        return 0;\n}\n\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou are given a trapezoid. The lengths of its upper base, lower base, and height are a, b, and h, respectively.\n\nAn example of a trapezoid\n\nFind the area of this trapezoid.\n\nConstraints\n\n1≦a≦100\n\n1≦b≦100\n\n1≦h≦100\n\nAll input values are integers.\n\nh is even.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\na\nb\nh\n\nOutput\n\nPrint the area of the given trapezoid. It is guaranteed that the area is an integer.\n\nSample Input 1\n\n3\n4\n2\n\nSample Output 1\n\n7\n\nWhen the lengths of the upper base, lower base, and height are 3, 4, and 2, respectively, the area of the trapezoid is (3+4)×2/2 = 7.\n\nSample Input 2\n\n4\n4\n4\n\nSample Output 2\n\n16\n\nIn this case, a parallelogram is given, which is also a trapezoid.", "sample_input": "3\n4\n2\n"}, "reference_outputs": ["7\n"], "source_document_id": "p03997", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou are given a trapezoid. The lengths of its upper base, lower base, and height are a, b, and h, respectively.\n\nAn example of a trapezoid\n\nFind the area of this trapezoid.\n\nConstraints\n\n1≦a≦100\n\n1≦b≦100\n\n1≦h≦100\n\nAll input values are integers.\n\nh is even.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\na\nb\nh\n\nOutput\n\nPrint the area of the given trapezoid. It is guaranteed that the area is an integer.\n\nSample Input 1\n\n3\n4\n2\n\nSample Output 1\n\n7\n\nWhen the lengths of the upper base, lower base, and height are 3, 4, and 2, respectively, the area of the trapezoid is (3+4)×2/2 = 7.\n\nSample Input 2\n\n4\n4\n4\n\nSample Output 2\n\n16\n\nIn this case, a parallelogram is given, which is also a trapezoid.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 161, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s916325716", "group_id": "codeNet:p03997", "input_text": "main(h){for(;~scanf(\"%d\",&h););return h<=54;}", "language": "C", "metadata": {"date": 1528181712, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "problem_description_relpath": "problem_descriptions/p03997.html", "problem_id": "p03997", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p03997/input.txt", "sample_output_relpath": "derived/input_output/data/p03997/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03997/C/s916325716.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s916325716", "user_id": "u657913472"}, "prompt_components": {"gold_output": "7\n", "input_to_evaluate": "main(h){for(;~scanf(\"%d\",&h););return h<=54;}", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou are given a trapezoid. The lengths of its upper base, lower base, and height are a, b, and h, respectively.\n\nAn example of a trapezoid\n\nFind the area of this trapezoid.\n\nConstraints\n\n1≦a≦100\n\n1≦b≦100\n\n1≦h≦100\n\nAll input values are integers.\n\nh is even.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\na\nb\nh\n\nOutput\n\nPrint the area of the given trapezoid. It is guaranteed that the area is an integer.\n\nSample Input 1\n\n3\n4\n2\n\nSample Output 1\n\n7\n\nWhen the lengths of the upper base, lower base, and height are 3, 4, and 2, respectively, the area of the trapezoid is (3+4)×2/2 = 7.\n\nSample Input 2\n\n4\n4\n4\n\nSample Output 2\n\n16\n\nIn this case, a parallelogram is given, which is also a trapezoid.", "sample_input": "3\n4\n2\n"}, "reference_outputs": ["7\n"], "source_document_id": "p03997", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou are given a trapezoid. The lengths of its upper base, lower base, and height are a, b, and h, respectively.\n\nAn example of a trapezoid\n\nFind the area of this trapezoid.\n\nConstraints\n\n1≦a≦100\n\n1≦b≦100\n\n1≦h≦100\n\nAll input values are integers.\n\nh is even.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\na\nb\nh\n\nOutput\n\nPrint the area of the given trapezoid. It is guaranteed that the area is an integer.\n\nSample Input 1\n\n3\n4\n2\n\nSample Output 1\n\n7\n\nWhen the lengths of the upper base, lower base, and height are 3, 4, and 2, respectively, the area of the trapezoid is (3+4)×2/2 = 7.\n\nSample Input 2\n\n4\n4\n4\n\nSample Output 2\n\n16\n\nIn this case, a parallelogram is given, which is also a trapezoid.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 45, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s760360087", "group_id": "codeNet:p03998", "input_text": "#include <stdio.h>\n#include <stdlib.h>\n#include <string.h>\n#include <math.h>\n#include <time.h>\n\n#define TLong long long \n\nint main(void){\n\tint player = 0,turn[3] = {0,0,0};\n\tchar card[3][100];\n\tscanf(\"%s %s %s\",card[0],card[1],card[2]);\n\t// printf(\"%d %d %d\\n\", strlen(card[0]),strlen(card[1]),strlen(card[2]));\n\twhile(1){\n\t\tswitch(card[player][turn[player]]){\n\t\t\tcase 'a':\n\t\t\t\tplayer = 0;\n\t\t\t\tbreak;\n\t\t\tcase 'b':\n\t\t\t\tplayer = 1;\n\t\t\t\tbreak;\n\t\t\tcase 'c':\n\t\t\t\tplayer = 2;\n\t\t\t\tbreak;\n\t\t}\n\t\tif(++turn[player] > strlen(card[player])){\n\t\t\tprintf(\"%c\\n\", (player + 0x0041));\n\t\t\treturn 0;\n\t\t}\n\t}\n\n\treturn 0;\n}\n", "language": "C", "metadata": {"date": 1553220204, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "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/C/s760360087.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s760360087", "user_id": "u185464141"}, "prompt_components": {"gold_output": "A\n", "input_to_evaluate": "#include <stdio.h>\n#include <stdlib.h>\n#include <string.h>\n#include <math.h>\n#include <time.h>\n\n#define TLong long long \n\nint main(void){\n\tint player = 0,turn[3] = {0,0,0};\n\tchar card[3][100];\n\tscanf(\"%s %s %s\",card[0],card[1],card[2]);\n\t// printf(\"%d %d %d\\n\", strlen(card[0]),strlen(card[1]),strlen(card[2]));\n\twhile(1){\n\t\tswitch(card[player][turn[player]]){\n\t\t\tcase 'a':\n\t\t\t\tplayer = 0;\n\t\t\t\tbreak;\n\t\t\tcase 'b':\n\t\t\t\tplayer = 1;\n\t\t\t\tbreak;\n\t\t\tcase 'c':\n\t\t\t\tplayer = 2;\n\t\t\t\tbreak;\n\t\t}\n\t\tif(++turn[player] > strlen(card[player])){\n\t\t\tprintf(\"%c\\n\", (player + 0x0041));\n\t\t\treturn 0;\n\t\t}\n\t}\n\n\treturn 0;\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": 602, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s620619156", "group_id": "codeNet:p04005", "input_text": "#include <stdio.h>\n\n#define min(a, b) (a) > (b) ? b : a\n\ntypedef long long ll;\n\nint main(void) {\n  ll a, b, c;\n  scanf(\"%lld %lld %lld\", &a, &b, &c);\n  if (a%2==0||b%2==0||c%2==0) printf(\"0\");\n  else printf(\"%lld\", min(a*b, min(a*c, b*c)));\n  return 0;\n}", "language": "C", "metadata": {"date": 1572611769, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "problem_description_relpath": "problem_descriptions/p04005.html", "problem_id": "p04005", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p04005/input.txt", "sample_output_relpath": "derived/input_output/data/p04005/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p04005/C/s620619156.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s620619156", "user_id": "u535423069"}, "prompt_components": {"gold_output": "9\n", "input_to_evaluate": "#include <stdio.h>\n\n#define min(a, b) (a) > (b) ? b : a\n\ntypedef long long ll;\n\nint main(void) {\n  ll a, b, c;\n  scanf(\"%lld %lld %lld\", &a, &b, &c);\n  if (a%2==0||b%2==0||c%2==0) printf(\"0\");\n  else printf(\"%lld\", min(a*b, min(a*c, b*c)));\n  return 0;\n}", "problem_context": "Score : 200 points\n\nProblem Statement\n\nWe have a rectangular parallelepiped of size A×B×C, built with blocks of size 1×1×1. Snuke will paint each of the A×B×C blocks either red or blue, so that:\n\nThere is at least one red block and at least one blue block.\n\nThe union of all red blocks forms a rectangular parallelepiped.\n\nThe union of all blue blocks forms a rectangular parallelepiped.\n\nSnuke wants to minimize the difference between the number of red blocks and the number of blue blocks. Find the minimum possible difference.\n\nConstraints\n\n2≤A,B,C≤10^9\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nA B C\n\nOutput\n\nPrint the minimum possible difference between the number of red blocks and the number of blue blocks.\n\nSample Input 1\n\n3 3 3\n\nSample Output 1\n\n9\n\nFor example, Snuke can paint the blocks as shown in the diagram below.\nThere are 9 red blocks and 18 blue blocks, thus the difference is 9.\n\nSample Input 2\n\n2 2 4\n\nSample Output 2\n\n0\n\nFor example, Snuke can paint the blocks as shown in the diagram below.\nThere are 8 red blocks and 8 blue blocks, thus the difference is 0.\n\nSample Input 3\n\n5 3 5\n\nSample Output 3\n\n15\n\nFor example, Snuke can paint the blocks as shown in the diagram below.\nThere are 45 red blocks and 30 blue blocks, thus the difference is 9.", "sample_input": "3 3 3\n"}, "reference_outputs": ["9\n"], "source_document_id": "p04005", "source_text": "Score : 200 points\n\nProblem Statement\n\nWe have a rectangular parallelepiped of size A×B×C, built with blocks of size 1×1×1. Snuke will paint each of the A×B×C blocks either red or blue, so that:\n\nThere is at least one red block and at least one blue block.\n\nThe union of all red blocks forms a rectangular parallelepiped.\n\nThe union of all blue blocks forms a rectangular parallelepiped.\n\nSnuke wants to minimize the difference between the number of red blocks and the number of blue blocks. Find the minimum possible difference.\n\nConstraints\n\n2≤A,B,C≤10^9\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nA B C\n\nOutput\n\nPrint the minimum possible difference between the number of red blocks and the number of blue blocks.\n\nSample Input 1\n\n3 3 3\n\nSample Output 1\n\n9\n\nFor example, Snuke can paint the blocks as shown in the diagram below.\nThere are 9 red blocks and 18 blue blocks, thus the difference is 9.\n\nSample Input 2\n\n2 2 4\n\nSample Output 2\n\n0\n\nFor example, Snuke can paint the blocks as shown in the diagram below.\nThere are 8 red blocks and 8 blue blocks, thus the difference is 0.\n\nSample Input 3\n\n5 3 5\n\nSample Output 3\n\n15\n\nFor example, Snuke can paint the blocks as shown in the diagram below.\nThere are 45 red blocks and 30 blue blocks, thus the difference is 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": 254, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s900760618", "group_id": "codeNet:p04011", "input_text": "#include <stdio.h>\nint main(void){\n    \n    int n,k,x,y;\n    int sum = 0;\n\n    scanf(\"%d\\n%d\\n%d\\n%d\",&n,&k,&x,&y);\n\n    \n\n    if(n>k){\n        sum = k*x + (n-k)*y;\n    }else{\n        sum = n*x ;\n    }\n\n    printf(\"%d\\n\",sum);\n    \n\n\n    return 0;\n}", "language": "C", "metadata": {"date": 1599272823, "filename_ext": "c", "original_language": "C (GCC 9.2.1)", "problem_description_relpath": "problem_descriptions/p04011.html", "problem_id": "p04011", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p04011/input.txt", "sample_output_relpath": "derived/input_output/data/p04011/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p04011/C/s900760618.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s900760618", "user_id": "u486519606"}, "prompt_components": {"gold_output": "48000\n", "input_to_evaluate": "#include <stdio.h>\nint main(void){\n    \n    int n,k,x,y;\n    int sum = 0;\n\n    scanf(\"%d\\n%d\\n%d\\n%d\",&n,&k,&x,&y);\n\n    \n\n    if(n>k){\n        sum = k*x + (n-k)*y;\n    }else{\n        sum = n*x ;\n    }\n\n    printf(\"%d\\n\",sum);\n    \n\n\n    return 0;\n}", "problem_context": "Score : 100 points\n\nProblem Statement\n\nThere is a hotel with the following accommodation fee:\n\nX yen (the currency of Japan) per night, for the first K nights\n\nY yen per night, for the (K+1)-th and subsequent nights\n\nTak is staying at this hotel for N consecutive nights.\nFind his total accommodation fee.\n\nConstraints\n\n1 \\leq N, K \\leq 10000\n\n1 \\leq Y < X \\leq 10000\n\nN,\\,K,\\,X,\\,Y are integers.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\nK\nX\nY\n\nOutput\n\nPrint Tak's total accommodation fee.\n\nSample Input 1\n\n5\n3\n10000\n9000\n\nSample Output 1\n\n48000\n\nThe accommodation fee is as follows:\n\n10000 yen for the 1-st night\n\n10000 yen for the 2-nd night\n\n10000 yen for the 3-rd night\n\n9000 yen for the 4-th night\n\n9000 yen for the 5-th night\n\nThus, the total is 48000 yen.\n\nSample Input 2\n\n2\n3\n10000\n9000\n\nSample Output 2\n\n20000", "sample_input": "5\n3\n10000\n9000\n"}, "reference_outputs": ["48000\n"], "source_document_id": "p04011", "source_text": "Score : 100 points\n\nProblem Statement\n\nThere is a hotel with the following accommodation fee:\n\nX yen (the currency of Japan) per night, for the first K nights\n\nY yen per night, for the (K+1)-th and subsequent nights\n\nTak is staying at this hotel for N consecutive nights.\nFind his total accommodation fee.\n\nConstraints\n\n1 \\leq N, K \\leq 10000\n\n1 \\leq Y < X \\leq 10000\n\nN,\\,K,\\,X,\\,Y are integers.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\nK\nX\nY\n\nOutput\n\nPrint Tak's total accommodation fee.\n\nSample Input 1\n\n5\n3\n10000\n9000\n\nSample Output 1\n\n48000\n\nThe accommodation fee is as follows:\n\n10000 yen for the 1-st night\n\n10000 yen for the 2-nd night\n\n10000 yen for the 3-rd night\n\n9000 yen for the 4-th night\n\n9000 yen for the 5-th night\n\nThus, the total is 48000 yen.\n\nSample Input 2\n\n2\n3\n10000\n9000\n\nSample Output 2\n\n20000", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 249, "cpu_time_ms": 6, "memory_kb": 1732}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s171908290", "group_id": "codeNet:p04011", "input_text": "#include<stdio.h>\n\nint main()\n{\n  int n,k,x,y;\n  \n  scanf(\"%d %d %d %d\",&n,&k,&x,&y);\n  \n  int ans;\n  \n  if(n-k>=0)\n  {\n  ans=x*k+y*(n-k);\n  }\n  else\n  {\n    ans=x*n;\n  }\n  \n  printf(\"%d\\n\",ans);\n  \n  return 0;\n}\n", "language": "C", "metadata": {"date": 1584916028, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "problem_description_relpath": "problem_descriptions/p04011.html", "problem_id": "p04011", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p04011/input.txt", "sample_output_relpath": "derived/input_output/data/p04011/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p04011/C/s171908290.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s171908290", "user_id": "u530411589"}, "prompt_components": {"gold_output": "48000\n", "input_to_evaluate": "#include<stdio.h>\n\nint main()\n{\n  int n,k,x,y;\n  \n  scanf(\"%d %d %d %d\",&n,&k,&x,&y);\n  \n  int ans;\n  \n  if(n-k>=0)\n  {\n  ans=x*k+y*(n-k);\n  }\n  else\n  {\n    ans=x*n;\n  }\n  \n  printf(\"%d\\n\",ans);\n  \n  return 0;\n}\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nThere is a hotel with the following accommodation fee:\n\nX yen (the currency of Japan) per night, for the first K nights\n\nY yen per night, for the (K+1)-th and subsequent nights\n\nTak is staying at this hotel for N consecutive nights.\nFind his total accommodation fee.\n\nConstraints\n\n1 \\leq N, K \\leq 10000\n\n1 \\leq Y < X \\leq 10000\n\nN,\\,K,\\,X,\\,Y are integers.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\nK\nX\nY\n\nOutput\n\nPrint Tak's total accommodation fee.\n\nSample Input 1\n\n5\n3\n10000\n9000\n\nSample Output 1\n\n48000\n\nThe accommodation fee is as follows:\n\n10000 yen for the 1-st night\n\n10000 yen for the 2-nd night\n\n10000 yen for the 3-rd night\n\n9000 yen for the 4-th night\n\n9000 yen for the 5-th night\n\nThus, the total is 48000 yen.\n\nSample Input 2\n\n2\n3\n10000\n9000\n\nSample Output 2\n\n20000", "sample_input": "5\n3\n10000\n9000\n"}, "reference_outputs": ["48000\n"], "source_document_id": "p04011", "source_text": "Score : 100 points\n\nProblem Statement\n\nThere is a hotel with the following accommodation fee:\n\nX yen (the currency of Japan) per night, for the first K nights\n\nY yen per night, for the (K+1)-th and subsequent nights\n\nTak is staying at this hotel for N consecutive nights.\nFind his total accommodation fee.\n\nConstraints\n\n1 \\leq N, K \\leq 10000\n\n1 \\leq Y < X \\leq 10000\n\nN,\\,K,\\,X,\\,Y are integers.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\nK\nX\nY\n\nOutput\n\nPrint Tak's total accommodation fee.\n\nSample Input 1\n\n5\n3\n10000\n9000\n\nSample Output 1\n\n48000\n\nThe accommodation fee is as follows:\n\n10000 yen for the 1-st night\n\n10000 yen for the 2-nd night\n\n10000 yen for the 3-rd night\n\n9000 yen for the 4-th night\n\n9000 yen for the 5-th night\n\nThus, the total is 48000 yen.\n\nSample Input 2\n\n2\n3\n10000\n9000\n\nSample Output 2\n\n20000", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s060250115", "group_id": "codeNet:p04011", "input_text": "#include <stdio.h>\n\nint main() {\n    int N,K,X,Y,M=0;\n    scanf(\"%d\\n\",&N);\n    scanf(\"%d\\n\",&K);\n    scanf(\"%d\\n\",&X);\n    scanf(\"%d\\n\",&Y);\n    //1<=N,K<=10000,1<=Y<=X<=10000\n    M=X*K+Y*(N-K);\n    printf(\"%d\",M);\n    return 0;\n}\n", "language": "C", "metadata": {"date": 1538425592, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "problem_description_relpath": "problem_descriptions/p04011.html", "problem_id": "p04011", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p04011/input.txt", "sample_output_relpath": "derived/input_output/data/p04011/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p04011/C/s060250115.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s060250115", "user_id": "u089230684"}, "prompt_components": {"gold_output": "48000\n", "input_to_evaluate": "#include <stdio.h>\n\nint main() {\n    int N,K,X,Y,M=0;\n    scanf(\"%d\\n\",&N);\n    scanf(\"%d\\n\",&K);\n    scanf(\"%d\\n\",&X);\n    scanf(\"%d\\n\",&Y);\n    //1<=N,K<=10000,1<=Y<=X<=10000\n    M=X*K+Y*(N-K);\n    printf(\"%d\",M);\n    return 0;\n}\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nThere is a hotel with the following accommodation fee:\n\nX yen (the currency of Japan) per night, for the first K nights\n\nY yen per night, for the (K+1)-th and subsequent nights\n\nTak is staying at this hotel for N consecutive nights.\nFind his total accommodation fee.\n\nConstraints\n\n1 \\leq N, K \\leq 10000\n\n1 \\leq Y < X \\leq 10000\n\nN,\\,K,\\,X,\\,Y are integers.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\nK\nX\nY\n\nOutput\n\nPrint Tak's total accommodation fee.\n\nSample Input 1\n\n5\n3\n10000\n9000\n\nSample Output 1\n\n48000\n\nThe accommodation fee is as follows:\n\n10000 yen for the 1-st night\n\n10000 yen for the 2-nd night\n\n10000 yen for the 3-rd night\n\n9000 yen for the 4-th night\n\n9000 yen for the 5-th night\n\nThus, the total is 48000 yen.\n\nSample Input 2\n\n2\n3\n10000\n9000\n\nSample Output 2\n\n20000", "sample_input": "5\n3\n10000\n9000\n"}, "reference_outputs": ["48000\n"], "source_document_id": "p04011", "source_text": "Score : 100 points\n\nProblem Statement\n\nThere is a hotel with the following accommodation fee:\n\nX yen (the currency of Japan) per night, for the first K nights\n\nY yen per night, for the (K+1)-th and subsequent nights\n\nTak is staying at this hotel for N consecutive nights.\nFind his total accommodation fee.\n\nConstraints\n\n1 \\leq N, K \\leq 10000\n\n1 \\leq Y < X \\leq 10000\n\nN,\\,K,\\,X,\\,Y are integers.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\nK\nX\nY\n\nOutput\n\nPrint Tak's total accommodation fee.\n\nSample Input 1\n\n5\n3\n10000\n9000\n\nSample Output 1\n\n48000\n\nThe accommodation fee is as follows:\n\n10000 yen for the 1-st night\n\n10000 yen for the 2-nd night\n\n10000 yen for the 3-rd night\n\n9000 yen for the 4-th night\n\n9000 yen for the 5-th night\n\nThus, the total is 48000 yen.\n\nSample Input 2\n\n2\n3\n10000\n9000\n\nSample Output 2\n\n20000", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 232, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s994175177", "group_id": "codeNet:p04013", "input_text": "long d[2][5001];A,x,i,j;main(n){for(scanf(\"%d%d\",&n,&A),d[0][n*=A]=1;~scanf(\"%d\",&x);i=!i)for(x-=A,j=2*n+1;j--;)d[!i][j]=d[i][j]+(j<x|j-x>2*n?0:d[i][j-x]);printf(\"%ld\",d[i][n]-1);}", "language": "C", "metadata": {"date": 1538010841, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "problem_description_relpath": "problem_descriptions/p04013.html", "problem_id": "p04013", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p04013/input.txt", "sample_output_relpath": "derived/input_output/data/p04013/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p04013/C/s994175177.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s994175177", "user_id": "u657913472"}, "prompt_components": {"gold_output": "5\n", "input_to_evaluate": "long d[2][5001];A,x,i,j;main(n){for(scanf(\"%d%d\",&n,&A),d[0][n*=A]=1;~scanf(\"%d\",&x);i=!i)for(x-=A,j=2*n+1;j--;)d[!i][j]=d[i][j]+(j<x|j-x>2*n?0:d[i][j-x]);printf(\"%ld\",d[i][n]-1);}", "problem_context": "Score : 300 points\n\nProblem Statement\n\nTak has N cards. On the i-th (1 \\leq i \\leq N) card is written an integer x_i.\nHe is selecting one or more cards from these N cards, so that the average of the integers written on the selected cards is exactly A.\nIn how many ways can he make his selection?\n\nConstraints\n\n1 \\leq N \\leq 50\n\n1 \\leq A \\leq 50\n\n1 \\leq x_i \\leq 50\n\nN,\\,A,\\,x_i are integers.\n\nPartial Score\n\n200 points will be awarded for passing the test set satisfying 1 \\leq N \\leq 16.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN A\nx_1 x_2 ... x_N\n\nOutput\n\nPrint the number of ways to select cards such that the average of the written integers is exactly A.\n\nSample Input 1\n\n4 8\n7 9 8 9\n\nSample Output 1\n\n5\n\nThe following are the 5 ways to select cards such that the average is 8:\n\nSelect the 3-rd card.\n\nSelect the 1-st and 2-nd cards.\n\nSelect the 1-st and 4-th cards.\n\nSelect the 1-st, 2-nd and 3-rd cards.\n\nSelect the 1-st, 3-rd and 4-th cards.\n\nSample Input 2\n\n3 8\n6 6 9\n\nSample Output 2\n\n0\n\nSample Input 3\n\n8 5\n3 6 2 8 7 6 5 9\n\nSample Output 3\n\n19\n\nSample Input 4\n\n33 3\n3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3\n\nSample Output 4\n\n8589934591\n\nThe answer may not fit into a 32-bit integer.", "sample_input": "4 8\n7 9 8 9\n"}, "reference_outputs": ["5\n"], "source_document_id": "p04013", "source_text": "Score : 300 points\n\nProblem Statement\n\nTak has N cards. On the i-th (1 \\leq i \\leq N) card is written an integer x_i.\nHe is selecting one or more cards from these N cards, so that the average of the integers written on the selected cards is exactly A.\nIn how many ways can he make his selection?\n\nConstraints\n\n1 \\leq N \\leq 50\n\n1 \\leq A \\leq 50\n\n1 \\leq x_i \\leq 50\n\nN,\\,A,\\,x_i are integers.\n\nPartial Score\n\n200 points will be awarded for passing the test set satisfying 1 \\leq N \\leq 16.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN A\nx_1 x_2 ... x_N\n\nOutput\n\nPrint the number of ways to select cards such that the average of the written integers is exactly A.\n\nSample Input 1\n\n4 8\n7 9 8 9\n\nSample Output 1\n\n5\n\nThe following are the 5 ways to select cards such that the average is 8:\n\nSelect the 3-rd card.\n\nSelect the 1-st and 2-nd cards.\n\nSelect the 1-st and 4-th cards.\n\nSelect the 1-st, 2-nd and 3-rd cards.\n\nSelect the 1-st, 3-rd and 4-th cards.\n\nSample Input 2\n\n3 8\n6 6 9\n\nSample Output 2\n\n0\n\nSample Input 3\n\n8 5\n3 6 2 8 7 6 5 9\n\nSample Output 3\n\n19\n\nSample Input 4\n\n33 3\n3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3\n\nSample Output 4\n\n8589934591\n\nThe answer may not fit into a 32-bit integer.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 180, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s605715366", "group_id": "codeNet:p04017", "input_text": "L,x[1<<17];d[21][1<<17];i,k,l,r,m;\nmain(n){\n\tfor(scanf(\"%d\",&n);i<n;)scanf(\"%d\",++i+x);\n\tfor(scanf(\"%d%*d\",&L);k<20;k++)for(i=0;i++<n;d[k+1][i]=l)\n\t\tfor(l=d[k][d[k][i]],r=n+1;!k&r-l>1;)x[m=l+r>>1]>x[i]+L?r=m:(l=m);\n\tfor(;~scanf(\"%d%d\",&l,&r);printf(\"%d\\n\",m))\n\t\tfor(m=l<r||(l^=r^=l^=r),k=21;--k;)d[k][l]<r?m+=1<<k-1,l=d[k][l]:0;\n}", "language": "C", "metadata": {"date": 1564465483, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "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/C/s605715366.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s605715366", "user_id": "u657913472"}, "prompt_components": {"gold_output": "4\n2\n1\n2\n", "input_to_evaluate": "L,x[1<<17];d[21][1<<17];i,k,l,r,m;\nmain(n){\n\tfor(scanf(\"%d\",&n);i<n;)scanf(\"%d\",++i+x);\n\tfor(scanf(\"%d%*d\",&L);k<20;k++)for(i=0;i++<n;d[k+1][i]=l)\n\t\tfor(l=d[k][d[k][i]],r=n+1;!k&r-l>1;)x[m=l+r>>1]>x[i]+L?r=m:(l=m);\n\tfor(;~scanf(\"%d%d\",&l,&r);printf(\"%d\\n\",m))\n\t\tfor(m=l<r||(l^=r^=l^=r),k=21;--k;)d[k][l]<r?m+=1<<k-1,l=d[k][l]:0;\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": 330, "cpu_time_ms": 79, "memory_kb": 10880}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s616352154", "group_id": "codeNet:p04019", "input_text": "#include<stdio.h>\n#include<string.h>\nint main(void){\n\tchar s[1001];\n\tint i=0,j=0;\n\tint x[4]={0,5,0,5};\n\tscanf(\"%s\",s);\n\ti=strlen(s);\n\n\tfor (j= 0; j< i; ++j)\n\t{\n\t\tif (s[i]=='N')\n\t\t{\n\t\t\tx[0]=1;\n\t\t}else if (s[i]=='S')\n\t\t{\n\t\t\tx[1]=1;\n\n\t\t}else if (s[i]=='E')\n\t\t{\n\t\t\tx[2]=1;\n\t\t}else if (s[i]=='W')\n\t\t{\n\t\t\tx[3]=1;\n\t\t}\n\n\t\n\t}\n\tif (x[0]==x[1]&&x[2]==x[3])\n\t{\n\t\tprintf(\"Yes\\n\");\n\t}else{\n\t\tprintf(\"No\\n\");\n\t}\n\treturn 0;\n}\n", "language": "C", "metadata": {"date": 1471829798, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "problem_description_relpath": "problem_descriptions/p04019.html", "problem_id": "p04019", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p04019/input.txt", "sample_output_relpath": "derived/input_output/data/p04019/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p04019/C/s616352154.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s616352154", "user_id": "u163340111"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "#include<stdio.h>\n#include<string.h>\nint main(void){\n\tchar s[1001];\n\tint i=0,j=0;\n\tint x[4]={0,5,0,5};\n\tscanf(\"%s\",s);\n\ti=strlen(s);\n\n\tfor (j= 0; j< i; ++j)\n\t{\n\t\tif (s[i]=='N')\n\t\t{\n\t\t\tx[0]=1;\n\t\t}else if (s[i]=='S')\n\t\t{\n\t\t\tx[1]=1;\n\n\t\t}else if (s[i]=='E')\n\t\t{\n\t\t\tx[2]=1;\n\t\t}else if (s[i]=='W')\n\t\t{\n\t\t\tx[3]=1;\n\t\t}\n\n\t\n\t}\n\tif (x[0]==x[1]&&x[2]==x[3])\n\t{\n\t\tprintf(\"Yes\\n\");\n\t}else{\n\t\tprintf(\"No\\n\");\n\t}\n\treturn 0;\n}\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nSnuke lives on an infinite two-dimensional plane. He is going on an N-day trip.\nAt the beginning of Day 1, he is at home. His plan is described in a string S of length N.\nOn Day i(1 ≦ i ≦ N), he will travel a positive distance in the following direction:\n\nNorth if the i-th letter of S is N\n\nWest if the i-th letter of S is W\n\nSouth if the i-th letter of S is S\n\nEast if the i-th letter of S is E\n\nHe has not decided each day's travel distance. Determine whether it is possible to set each day's travel distance so that he will be back at home at the end of Day N.\n\nConstraints\n\n1 ≦ | S | ≦ 1000\n\nS consists of the letters N, W, S, E.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint Yes if it is possible to set each day's travel distance so that he will be back at home at the end of Day N. Otherwise, print No.\n\nSample Input 1\n\nSENW\n\nSample Output 1\n\nYes\n\nIf Snuke travels a distance of 1 on each day, he will be back at home at the end of day 4.\n\nSample Input 2\n\nNSNNSNSN\n\nSample Output 2\n\nYes\n\nSample Input 3\n\nNNEW\n\nSample Output 3\n\nNo\n\nSample Input 4\n\nW\n\nSample Output 4\n\nNo", "sample_input": "SENW\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p04019", "source_text": "Score : 200 points\n\nProblem Statement\n\nSnuke lives on an infinite two-dimensional plane. He is going on an N-day trip.\nAt the beginning of Day 1, he is at home. His plan is described in a string S of length N.\nOn Day i(1 ≦ i ≦ N), he will travel a positive distance in the following direction:\n\nNorth if the i-th letter of S is N\n\nWest if the i-th letter of S is W\n\nSouth if the i-th letter of S is S\n\nEast if the i-th letter of S is E\n\nHe has not decided each day's travel distance. Determine whether it is possible to set each day's travel distance so that he will be back at home at the end of Day N.\n\nConstraints\n\n1 ≦ | S | ≦ 1000\n\nS consists of the letters N, W, S, E.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint Yes if it is possible to set each day's travel distance so that he will be back at home at the end of Day N. Otherwise, print No.\n\nSample Input 1\n\nSENW\n\nSample Output 1\n\nYes\n\nIf Snuke travels a distance of 1 on each day, he will be back at home at the end of day 4.\n\nSample Input 2\n\nNSNNSNSN\n\nSample Output 2\n\nYes\n\nSample Input 3\n\nNNEW\n\nSample Output 3\n\nNo\n\nSample Input 4\n\nW\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": 410, "cpu_time_ms": 3, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s079709576", "group_id": "codeNet:p04029", "input_text": "#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\n#include <string.h>\n#define ll long long\n#define rep(i,l,r) for(ll i=(l);i<(r);i++)\n#define max(p,q) ((p)>(q)?(p):(q))\n#define min(p,q) ((p)<(q)?(p):(q))\n#define chmax(a,b) ((a)=(a)>(b)?(a):(b))\n#define chmin(a,b) ((a)=(a)<(b)?(a):(b))\n#define abs(p) ((p)>=(0)?(p):(-(p)))\nint cmp(const void *a, const void *b);\n//your code here!\n\nint main(void){\n    ll N;\n    scanf(\"%lld\", &N);\n    printf(\"%lld\\n\", N*(N+1)/2);\n    return 0;\n}\n\nint cmp(const void *a, const void *b){\n    ll A=*(ll *)a, B=*(ll *)b;\n    if(A==B)return 0;\n    else return A>B ? 1:-1;//昇順ソート\n}\n", "language": "C", "metadata": {"date": 1567552787, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "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/C/s079709576.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s079709576", "user_id": "u924527074"}, "prompt_components": {"gold_output": "6\n", "input_to_evaluate": "#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\n#include <string.h>\n#define ll long long\n#define rep(i,l,r) for(ll i=(l);i<(r);i++)\n#define max(p,q) ((p)>(q)?(p):(q))\n#define min(p,q) ((p)<(q)?(p):(q))\n#define chmax(a,b) ((a)=(a)>(b)?(a):(b))\n#define chmin(a,b) ((a)=(a)<(b)?(a):(b))\n#define abs(p) ((p)>=(0)?(p):(-(p)))\nint cmp(const void *a, const void *b);\n//your code here!\n\nint main(void){\n    ll N;\n    scanf(\"%lld\", &N);\n    printf(\"%lld\\n\", N*(N+1)/2);\n    return 0;\n}\n\nint cmp(const void *a, const void *b){\n    ll A=*(ll *)a, B=*(ll *)b;\n    if(A==B)return 0;\n    else return A>B ? 1:-1;//昇順ソート\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": 626, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s908536343", "group_id": "codeNet:p04030", "input_text": "#include<stdio.h>\n#include<string.h>\nint main()\n{\n\tchar input[15],temp[15];\n\tscanf(\"%s\",input);\n\tint len = strlen(input);\n\tint i = 0,j = 0;\n\twhile(len--)\n\t{\n\t\tif(input[j] == 'B')\n\t\t{\n\t\t\tif(i > 0)\n\t\t\t{\n\t\t\t\ti--;\n\t\t\t}\n\t\t\tj++;\n\t\t}\n\t\telse{\n\t\t\ttemp[i] = input[j];\n\t\t\ti++;\n\t\t\tj++;\n\t\t}\n\t}\n\tprintf(\"%s\\n\",temp);\n\treturn 0;\n}", "language": "C", "metadata": {"date": 1597986867, "filename_ext": "c", "original_language": "C (GCC 9.2.1)", "problem_description_relpath": "problem_descriptions/p04030.html", "problem_id": "p04030", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p04030/input.txt", "sample_output_relpath": "derived/input_output/data/p04030/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p04030/C/s908536343.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s908536343", "user_id": "u863370423"}, "prompt_components": {"gold_output": "00\n", "input_to_evaluate": "#include<stdio.h>\n#include<string.h>\nint main()\n{\n\tchar input[15],temp[15];\n\tscanf(\"%s\",input);\n\tint len = strlen(input);\n\tint i = 0,j = 0;\n\twhile(len--)\n\t{\n\t\tif(input[j] == 'B')\n\t\t{\n\t\t\tif(i > 0)\n\t\t\t{\n\t\t\t\ti--;\n\t\t\t}\n\t\t\tj++;\n\t\t}\n\t\telse{\n\t\t\ttemp[i] = input[j];\n\t\t\ti++;\n\t\t\tj++;\n\t\t}\n\t}\n\tprintf(\"%s\\n\",temp);\n\treturn 0;\n}", "problem_context": "Score : 200 points\n\nProblem Statement\n\nSig has built his own keyboard. Designed for ultimate simplicity, this keyboard only has 3 keys on it: the 0 key, the 1 key and the backspace key.\n\nTo begin with, he is using a plain text editor with this keyboard. This editor always displays one string (possibly empty). Just after the editor is launched, this string is empty. When each key on the keyboard is pressed, the following changes occur to the string:\n\nThe 0 key: a letter 0 will be inserted to the right of the string.\n\nThe 1 key: a letter 1 will be inserted to the right of the string.\n\nThe backspace key: if the string is empty, nothing happens. Otherwise, the rightmost letter of the string is deleted.\n\nSig has launched the editor, and pressed these keys several times. You are given a string s, which is a record of his keystrokes in order. In this string, the letter 0 stands for the 0 key, the letter 1 stands for the 1 key and the letter B stands for the backspace key. What string is displayed in the editor now?\n\nConstraints\n\n1 ≦ |s| ≦ 10 (|s| denotes the length of s)\n\ns consists of the letters 0, 1 and B.\n\nThe correct answer is not an empty string.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\ns\n\nOutput\n\nPrint the string displayed in the editor in the end.\n\nSample Input 1\n\n01B0\n\nSample Output 1\n\n00\n\nEach time the key is pressed, the string in the editor will change as follows: 0, 01, 0, 00.\n\nSample Input 2\n\n0BB1\n\nSample Output 2\n\n1\n\nEach time the key is pressed, the string in the editor will change as follows: 0, (empty), (empty), 1.", "sample_input": "01B0\n"}, "reference_outputs": ["00\n"], "source_document_id": "p04030", "source_text": "Score : 200 points\n\nProblem Statement\n\nSig has built his own keyboard. Designed for ultimate simplicity, this keyboard only has 3 keys on it: the 0 key, the 1 key and the backspace key.\n\nTo begin with, he is using a plain text editor with this keyboard. This editor always displays one string (possibly empty). Just after the editor is launched, this string is empty. When each key on the keyboard is pressed, the following changes occur to the string:\n\nThe 0 key: a letter 0 will be inserted to the right of the string.\n\nThe 1 key: a letter 1 will be inserted to the right of the string.\n\nThe backspace key: if the string is empty, nothing happens. Otherwise, the rightmost letter of the string is deleted.\n\nSig has launched the editor, and pressed these keys several times. You are given a string s, which is a record of his keystrokes in order. In this string, the letter 0 stands for the 0 key, the letter 1 stands for the 1 key and the letter B stands for the backspace key. What string is displayed in the editor now?\n\nConstraints\n\n1 ≦ |s| ≦ 10 (|s| denotes the length of s)\n\ns consists of the letters 0, 1 and B.\n\nThe correct answer is not an empty string.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\ns\n\nOutput\n\nPrint the string displayed in the editor in the end.\n\nSample Input 1\n\n01B0\n\nSample Output 1\n\n00\n\nEach time the key is pressed, the string in the editor will change as follows: 0, 01, 0, 00.\n\nSample Input 2\n\n0BB1\n\nSample Output 2\n\n1\n\nEach time the key is pressed, the string in the editor will change as follows: 0, (empty), (empty), 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": 315, "cpu_time_ms": 5, "memory_kb": 1604}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s504013500", "group_id": "codeNet:p04030", "input_text": "#include <stdio.h>\n#include <string.h>\n\nint main() {\n\n    char s[12];\n    char res[12];\n    scanf(\"%s\", s);\n//    size_t l;\n    for (int i = 0; i < strlen(s); i++) {\n        \n        char c = s[i];\n      \n//        l = strlen(res);\n//        //printf(\"%d\\n\",l);\n        if (c == '0') {\n//            res[l] = '0';\n\n            res[i] = c;\n//        } else if (c == '1') {\n//            res[l] = '1';\n//        } \n//        else if (c == 'B') {\n//        //    res[l-1] = '\\0';\n//            res[l] = 'B';\n        }\n//        //printf(\"%s\\n\", res);\n    }\n\n    //puts(\"----\");\n    printf(\"%s\", res);\n\n\n    return 0;\n\n}", "language": "C", "metadata": {"date": 1595542431, "filename_ext": "c", "original_language": "C (GCC 9.2.1)", "problem_description_relpath": "problem_descriptions/p04030.html", "problem_id": "p04030", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p04030/input.txt", "sample_output_relpath": "derived/input_output/data/p04030/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p04030/C/s504013500.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s504013500", "user_id": "u163680061"}, "prompt_components": {"gold_output": "00\n", "input_to_evaluate": "#include <stdio.h>\n#include <string.h>\n\nint main() {\n\n    char s[12];\n    char res[12];\n    scanf(\"%s\", s);\n//    size_t l;\n    for (int i = 0; i < strlen(s); i++) {\n        \n        char c = s[i];\n      \n//        l = strlen(res);\n//        //printf(\"%d\\n\",l);\n        if (c == '0') {\n//            res[l] = '0';\n\n            res[i] = c;\n//        } else if (c == '1') {\n//            res[l] = '1';\n//        } \n//        else if (c == 'B') {\n//        //    res[l-1] = '\\0';\n//            res[l] = 'B';\n        }\n//        //printf(\"%s\\n\", res);\n    }\n\n    //puts(\"----\");\n    printf(\"%s\", res);\n\n\n    return 0;\n\n}", "problem_context": "Score : 200 points\n\nProblem Statement\n\nSig has built his own keyboard. Designed for ultimate simplicity, this keyboard only has 3 keys on it: the 0 key, the 1 key and the backspace key.\n\nTo begin with, he is using a plain text editor with this keyboard. This editor always displays one string (possibly empty). Just after the editor is launched, this string is empty. When each key on the keyboard is pressed, the following changes occur to the string:\n\nThe 0 key: a letter 0 will be inserted to the right of the string.\n\nThe 1 key: a letter 1 will be inserted to the right of the string.\n\nThe backspace key: if the string is empty, nothing happens. Otherwise, the rightmost letter of the string is deleted.\n\nSig has launched the editor, and pressed these keys several times. You are given a string s, which is a record of his keystrokes in order. In this string, the letter 0 stands for the 0 key, the letter 1 stands for the 1 key and the letter B stands for the backspace key. What string is displayed in the editor now?\n\nConstraints\n\n1 ≦ |s| ≦ 10 (|s| denotes the length of s)\n\ns consists of the letters 0, 1 and B.\n\nThe correct answer is not an empty string.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\ns\n\nOutput\n\nPrint the string displayed in the editor in the end.\n\nSample Input 1\n\n01B0\n\nSample Output 1\n\n00\n\nEach time the key is pressed, the string in the editor will change as follows: 0, 01, 0, 00.\n\nSample Input 2\n\n0BB1\n\nSample Output 2\n\n1\n\nEach time the key is pressed, the string in the editor will change as follows: 0, (empty), (empty), 1.", "sample_input": "01B0\n"}, "reference_outputs": ["00\n"], "source_document_id": "p04030", "source_text": "Score : 200 points\n\nProblem Statement\n\nSig has built his own keyboard. Designed for ultimate simplicity, this keyboard only has 3 keys on it: the 0 key, the 1 key and the backspace key.\n\nTo begin with, he is using a plain text editor with this keyboard. This editor always displays one string (possibly empty). Just after the editor is launched, this string is empty. When each key on the keyboard is pressed, the following changes occur to the string:\n\nThe 0 key: a letter 0 will be inserted to the right of the string.\n\nThe 1 key: a letter 1 will be inserted to the right of the string.\n\nThe backspace key: if the string is empty, nothing happens. Otherwise, the rightmost letter of the string is deleted.\n\nSig has launched the editor, and pressed these keys several times. You are given a string s, which is a record of his keystrokes in order. In this string, the letter 0 stands for the 0 key, the letter 1 stands for the 1 key and the letter B stands for the backspace key. What string is displayed in the editor now?\n\nConstraints\n\n1 ≦ |s| ≦ 10 (|s| denotes the length of s)\n\ns consists of the letters 0, 1 and B.\n\nThe correct answer is not an empty string.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\ns\n\nOutput\n\nPrint the string displayed in the editor in the end.\n\nSample Input 1\n\n01B0\n\nSample Output 1\n\n00\n\nEach time the key is pressed, the string in the editor will change as follows: 0, 01, 0, 00.\n\nSample Input 2\n\n0BB1\n\nSample Output 2\n\n1\n\nEach time the key is pressed, the string in the editor will change as follows: 0, (empty), (empty), 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": 616, "cpu_time_ms": 5, "memory_kb": 1732}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s216514853", "group_id": "codeNet:p04030", "input_text": "/*  ex9_1\n    kosaq   */\n\n#include <stdio.h>\n#include <stdlib.h>\n#include <string.h>//strlenを使用するため\n#define SIZE 11\n\ntypedef struct{\n    int size;\n    int count;\n    char data[SIZE];\n    char *top;\n} stack;//構造体を定義\n\nvoid initialize_stack(stack *stk);\nvoid push(stack *stk, char elem);\nchar pop(stack *stk);//プロトタイプ宣言\n\nint main(void){\n    char input[SIZE];//入力のために配列を定義\n    stack sentence;//構造体を定義\n    scanf(\"%s\", input);//0,1,Bからなる配列を入力\n    initialize_stack(&sentence);//スタックの初期化\n\n    for(int i = 0; i < strlen(input); i++){\n        if(input[i] == '0'){\n            push(&sentence, '0');\n        }\n        else if(input[i] == '1'){\n            push(&sentence, '1');\n        }\n        //0,1のときはスタックにデータを追加\n        else if(input[i] == 'B' && sentence.count > 0){\n            pop(&sentence);//Bのときであり、かつ文字がまだあるとき（count>0）はデータを取り出し\n        }\n    }\n    \n    for(int i = 0; i < sentence.count; i++){\n        printf(\"%c\", sentence.data[SIZE - i - 1]);//答えの配列を出力\n    }\n    printf(\"\\n\");\n    return 0;\n\n}\n\n//スタックの初期化\nvoid initialize_stack(stack *stk){\n    stk -> count = 0;\n    stk -> size = SIZE;\n    stk -> top = &(stk -> data[SIZE]);\n}\n\n//データの追加\nvoid push(stack *stk, char elem){\n    if(stk -> count >= stk -> size){\n        fprintf(stderr, \"Error: stack overflow. (x=%c)\\n\", elem);\n        exit(1);\n    }\n    else{\n        stk -> top--;\n        *(stk -> top) = elem;\n        stk -> count++;\n    }\n}\n\n//データの取り出し\nchar pop(stack *stk){\n    char latest;\n    if(stk -> count <= 0){\n        fprintf(stdout, \"Error: stack underflow.\\n\");\n        exit(1);\n    }\n    else{\n        latest = *(stk -> top);\n        stk -> top++;\n        stk -> count--;\n        return latest;\n    }\n}", "language": "C", "metadata": {"date": 1595232176, "filename_ext": "c", "original_language": "C (GCC 9.2.1)", "problem_description_relpath": "problem_descriptions/p04030.html", "problem_id": "p04030", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p04030/input.txt", "sample_output_relpath": "derived/input_output/data/p04030/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p04030/C/s216514853.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s216514853", "user_id": "u126108373"}, "prompt_components": {"gold_output": "00\n", "input_to_evaluate": "/*  ex9_1\n    kosaq   */\n\n#include <stdio.h>\n#include <stdlib.h>\n#include <string.h>//strlenを使用するため\n#define SIZE 11\n\ntypedef struct{\n    int size;\n    int count;\n    char data[SIZE];\n    char *top;\n} stack;//構造体を定義\n\nvoid initialize_stack(stack *stk);\nvoid push(stack *stk, char elem);\nchar pop(stack *stk);//プロトタイプ宣言\n\nint main(void){\n    char input[SIZE];//入力のために配列を定義\n    stack sentence;//構造体を定義\n    scanf(\"%s\", input);//0,1,Bからなる配列を入力\n    initialize_stack(&sentence);//スタックの初期化\n\n    for(int i = 0; i < strlen(input); i++){\n        if(input[i] == '0'){\n            push(&sentence, '0');\n        }\n        else if(input[i] == '1'){\n            push(&sentence, '1');\n        }\n        //0,1のときはスタックにデータを追加\n        else if(input[i] == 'B' && sentence.count > 0){\n            pop(&sentence);//Bのときであり、かつ文字がまだあるとき（count>0）はデータを取り出し\n        }\n    }\n    \n    for(int i = 0; i < sentence.count; i++){\n        printf(\"%c\", sentence.data[SIZE - i - 1]);//答えの配列を出力\n    }\n    printf(\"\\n\");\n    return 0;\n\n}\n\n//スタックの初期化\nvoid initialize_stack(stack *stk){\n    stk -> count = 0;\n    stk -> size = SIZE;\n    stk -> top = &(stk -> data[SIZE]);\n}\n\n//データの追加\nvoid push(stack *stk, char elem){\n    if(stk -> count >= stk -> size){\n        fprintf(stderr, \"Error: stack overflow. (x=%c)\\n\", elem);\n        exit(1);\n    }\n    else{\n        stk -> top--;\n        *(stk -> top) = elem;\n        stk -> count++;\n    }\n}\n\n//データの取り出し\nchar pop(stack *stk){\n    char latest;\n    if(stk -> count <= 0){\n        fprintf(stdout, \"Error: stack underflow.\\n\");\n        exit(1);\n    }\n    else{\n        latest = *(stk -> top);\n        stk -> top++;\n        stk -> count--;\n        return latest;\n    }\n}", "problem_context": "Score : 200 points\n\nProblem Statement\n\nSig has built his own keyboard. Designed for ultimate simplicity, this keyboard only has 3 keys on it: the 0 key, the 1 key and the backspace key.\n\nTo begin with, he is using a plain text editor with this keyboard. This editor always displays one string (possibly empty). Just after the editor is launched, this string is empty. When each key on the keyboard is pressed, the following changes occur to the string:\n\nThe 0 key: a letter 0 will be inserted to the right of the string.\n\nThe 1 key: a letter 1 will be inserted to the right of the string.\n\nThe backspace key: if the string is empty, nothing happens. Otherwise, the rightmost letter of the string is deleted.\n\nSig has launched the editor, and pressed these keys several times. You are given a string s, which is a record of his keystrokes in order. In this string, the letter 0 stands for the 0 key, the letter 1 stands for the 1 key and the letter B stands for the backspace key. What string is displayed in the editor now?\n\nConstraints\n\n1 ≦ |s| ≦ 10 (|s| denotes the length of s)\n\ns consists of the letters 0, 1 and B.\n\nThe correct answer is not an empty string.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\ns\n\nOutput\n\nPrint the string displayed in the editor in the end.\n\nSample Input 1\n\n01B0\n\nSample Output 1\n\n00\n\nEach time the key is pressed, the string in the editor will change as follows: 0, 01, 0, 00.\n\nSample Input 2\n\n0BB1\n\nSample Output 2\n\n1\n\nEach time the key is pressed, the string in the editor will change as follows: 0, (empty), (empty), 1.", "sample_input": "01B0\n"}, "reference_outputs": ["00\n"], "source_document_id": "p04030", "source_text": "Score : 200 points\n\nProblem Statement\n\nSig has built his own keyboard. Designed for ultimate simplicity, this keyboard only has 3 keys on it: the 0 key, the 1 key and the backspace key.\n\nTo begin with, he is using a plain text editor with this keyboard. This editor always displays one string (possibly empty). Just after the editor is launched, this string is empty. When each key on the keyboard is pressed, the following changes occur to the string:\n\nThe 0 key: a letter 0 will be inserted to the right of the string.\n\nThe 1 key: a letter 1 will be inserted to the right of the string.\n\nThe backspace key: if the string is empty, nothing happens. Otherwise, the rightmost letter of the string is deleted.\n\nSig has launched the editor, and pressed these keys several times. You are given a string s, which is a record of his keystrokes in order. In this string, the letter 0 stands for the 0 key, the letter 1 stands for the 1 key and the letter B stands for the backspace key. What string is displayed in the editor now?\n\nConstraints\n\n1 ≦ |s| ≦ 10 (|s| denotes the length of s)\n\ns consists of the letters 0, 1 and B.\n\nThe correct answer is not an empty string.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\ns\n\nOutput\n\nPrint the string displayed in the editor in the end.\n\nSample Input 1\n\n01B0\n\nSample Output 1\n\n00\n\nEach time the key is pressed, the string in the editor will change as follows: 0, 01, 0, 00.\n\nSample Input 2\n\n0BB1\n\nSample Output 2\n\n1\n\nEach time the key is pressed, the string in the editor will change as follows: 0, (empty), (empty), 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": 1925, "cpu_time_ms": 5, "memory_kb": 1600}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s113117449", "group_id": "codeNet:p04030", "input_text": "/* ex 9_1\n   Tarara */\n\n#include <stdio.h>\n#include <stdlib.h>\n//スタックに格納するデータの最大数\n#define SIZE 1000\n\n//スタックの定義\ntypedef struct stack{\n    int size;\n    int count;\n    char data[SIZE];\n    char *top;\n} stack;\n\n//スタックの初期化\nvoid initialize_stack(stack *stk){\n    stk->count = 0;\n    stk->size = SIZE;\n    stk->top = &(stk->data[SIZE]);\n}\n\n//データの追加\nvoid push(stack *stk, char elem){\n    if(stk->count >= stk->size){\n        fprintf(stderr, \"Error: stack overflow. (x=%c)\\n\", elem);\n        exit(1);\n    }\n    else{\n        stk->top--;\n        *(stk->top) = elem;\n        stk->count++;\n    }\n}\n\n//データの取り出し\nchar pop(stack *stk){\n    char latest;\n    if(stk->count <= 0){\n        fprintf(stdout, \"Error: stack underflow.\\n\");\n        exit(1);\n    }\n    else{\n        latest = *(stk->top);\n        stk->top++;\n        stk->count--;\n        return latest;\n    }\n}\n\nint main(void)\n{\n    char input[SIZE];\n    char *po = input;\n    stack stk;\n    initialize_stack(&stk);\n\n    scanf(\"%s\", input);\n    for(; *po; po++)\n    {\n        if (*po == 'B')\n        {\n            if (stk.count > 0)\n            {\n                pop(&stk);\n            }\n        }\n        else\n        {\n            push(&stk, *po);\n        }\n    }\n\n    for (int i = 0; i < stk.count; i++)\n    {\n        printf(\"%c\", stk.data[SIZE - 1 - i]);\n    }\n    printf(\"\\n\");\n    return 0;\n}", "language": "C", "metadata": {"date": 1595194621, "filename_ext": "c", "original_language": "C (GCC 9.2.1)", "problem_description_relpath": "problem_descriptions/p04030.html", "problem_id": "p04030", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p04030/input.txt", "sample_output_relpath": "derived/input_output/data/p04030/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p04030/C/s113117449.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s113117449", "user_id": "u835629653"}, "prompt_components": {"gold_output": "00\n", "input_to_evaluate": "/* ex 9_1\n   Tarara */\n\n#include <stdio.h>\n#include <stdlib.h>\n//スタックに格納するデータの最大数\n#define SIZE 1000\n\n//スタックの定義\ntypedef struct stack{\n    int size;\n    int count;\n    char data[SIZE];\n    char *top;\n} stack;\n\n//スタックの初期化\nvoid initialize_stack(stack *stk){\n    stk->count = 0;\n    stk->size = SIZE;\n    stk->top = &(stk->data[SIZE]);\n}\n\n//データの追加\nvoid push(stack *stk, char elem){\n    if(stk->count >= stk->size){\n        fprintf(stderr, \"Error: stack overflow. (x=%c)\\n\", elem);\n        exit(1);\n    }\n    else{\n        stk->top--;\n        *(stk->top) = elem;\n        stk->count++;\n    }\n}\n\n//データの取り出し\nchar pop(stack *stk){\n    char latest;\n    if(stk->count <= 0){\n        fprintf(stdout, \"Error: stack underflow.\\n\");\n        exit(1);\n    }\n    else{\n        latest = *(stk->top);\n        stk->top++;\n        stk->count--;\n        return latest;\n    }\n}\n\nint main(void)\n{\n    char input[SIZE];\n    char *po = input;\n    stack stk;\n    initialize_stack(&stk);\n\n    scanf(\"%s\", input);\n    for(; *po; po++)\n    {\n        if (*po == 'B')\n        {\n            if (stk.count > 0)\n            {\n                pop(&stk);\n            }\n        }\n        else\n        {\n            push(&stk, *po);\n        }\n    }\n\n    for (int i = 0; i < stk.count; i++)\n    {\n        printf(\"%c\", stk.data[SIZE - 1 - i]);\n    }\n    printf(\"\\n\");\n    return 0;\n}", "problem_context": "Score : 200 points\n\nProblem Statement\n\nSig has built his own keyboard. Designed for ultimate simplicity, this keyboard only has 3 keys on it: the 0 key, the 1 key and the backspace key.\n\nTo begin with, he is using a plain text editor with this keyboard. This editor always displays one string (possibly empty). Just after the editor is launched, this string is empty. When each key on the keyboard is pressed, the following changes occur to the string:\n\nThe 0 key: a letter 0 will be inserted to the right of the string.\n\nThe 1 key: a letter 1 will be inserted to the right of the string.\n\nThe backspace key: if the string is empty, nothing happens. Otherwise, the rightmost letter of the string is deleted.\n\nSig has launched the editor, and pressed these keys several times. You are given a string s, which is a record of his keystrokes in order. In this string, the letter 0 stands for the 0 key, the letter 1 stands for the 1 key and the letter B stands for the backspace key. What string is displayed in the editor now?\n\nConstraints\n\n1 ≦ |s| ≦ 10 (|s| denotes the length of s)\n\ns consists of the letters 0, 1 and B.\n\nThe correct answer is not an empty string.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\ns\n\nOutput\n\nPrint the string displayed in the editor in the end.\n\nSample Input 1\n\n01B0\n\nSample Output 1\n\n00\n\nEach time the key is pressed, the string in the editor will change as follows: 0, 01, 0, 00.\n\nSample Input 2\n\n0BB1\n\nSample Output 2\n\n1\n\nEach time the key is pressed, the string in the editor will change as follows: 0, (empty), (empty), 1.", "sample_input": "01B0\n"}, "reference_outputs": ["00\n"], "source_document_id": "p04030", "source_text": "Score : 200 points\n\nProblem Statement\n\nSig has built his own keyboard. Designed for ultimate simplicity, this keyboard only has 3 keys on it: the 0 key, the 1 key and the backspace key.\n\nTo begin with, he is using a plain text editor with this keyboard. This editor always displays one string (possibly empty). Just after the editor is launched, this string is empty. When each key on the keyboard is pressed, the following changes occur to the string:\n\nThe 0 key: a letter 0 will be inserted to the right of the string.\n\nThe 1 key: a letter 1 will be inserted to the right of the string.\n\nThe backspace key: if the string is empty, nothing happens. Otherwise, the rightmost letter of the string is deleted.\n\nSig has launched the editor, and pressed these keys several times. You are given a string s, which is a record of his keystrokes in order. In this string, the letter 0 stands for the 0 key, the letter 1 stands for the 1 key and the letter B stands for the backspace key. What string is displayed in the editor now?\n\nConstraints\n\n1 ≦ |s| ≦ 10 (|s| denotes the length of s)\n\ns consists of the letters 0, 1 and B.\n\nThe correct answer is not an empty string.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\ns\n\nOutput\n\nPrint the string displayed in the editor in the end.\n\nSample Input 1\n\n01B0\n\nSample Output 1\n\n00\n\nEach time the key is pressed, the string in the editor will change as follows: 0, 01, 0, 00.\n\nSample Input 2\n\n0BB1\n\nSample Output 2\n\n1\n\nEach time the key is pressed, the string in the editor will change as follows: 0, (empty), (empty), 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": 1430, "cpu_time_ms": 5, "memory_kb": 1636}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s509704671", "group_id": "codeNet:p04030", "input_text": "#include<stdio.h>\nint main()\n{\n\tint s[10]={0},i;\n\tscanf(\"%d\",&s[i]);\n\tfor(i=0;i<10;i++)\n\t{\n\t\tif(s[i]!=1||s[i]!=0)\n\t\t\ts[i]=s[0];\n\tprintf(\"%d\",s[i]);\n\t}\n\treturn 0;\n}", "language": "C", "metadata": {"date": 1573525758, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "problem_description_relpath": "problem_descriptions/p04030.html", "problem_id": "p04030", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p04030/input.txt", "sample_output_relpath": "derived/input_output/data/p04030/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p04030/C/s509704671.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s509704671", "user_id": "u863370423"}, "prompt_components": {"gold_output": "00\n", "input_to_evaluate": "#include<stdio.h>\nint main()\n{\n\tint s[10]={0},i;\n\tscanf(\"%d\",&s[i]);\n\tfor(i=0;i<10;i++)\n\t{\n\t\tif(s[i]!=1||s[i]!=0)\n\t\t\ts[i]=s[0];\n\tprintf(\"%d\",s[i]);\n\t}\n\treturn 0;\n}", "problem_context": "Score : 200 points\n\nProblem Statement\n\nSig has built his own keyboard. Designed for ultimate simplicity, this keyboard only has 3 keys on it: the 0 key, the 1 key and the backspace key.\n\nTo begin with, he is using a plain text editor with this keyboard. This editor always displays one string (possibly empty). Just after the editor is launched, this string is empty. When each key on the keyboard is pressed, the following changes occur to the string:\n\nThe 0 key: a letter 0 will be inserted to the right of the string.\n\nThe 1 key: a letter 1 will be inserted to the right of the string.\n\nThe backspace key: if the string is empty, nothing happens. Otherwise, the rightmost letter of the string is deleted.\n\nSig has launched the editor, and pressed these keys several times. You are given a string s, which is a record of his keystrokes in order. In this string, the letter 0 stands for the 0 key, the letter 1 stands for the 1 key and the letter B stands for the backspace key. What string is displayed in the editor now?\n\nConstraints\n\n1 ≦ |s| ≦ 10 (|s| denotes the length of s)\n\ns consists of the letters 0, 1 and B.\n\nThe correct answer is not an empty string.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\ns\n\nOutput\n\nPrint the string displayed in the editor in the end.\n\nSample Input 1\n\n01B0\n\nSample Output 1\n\n00\n\nEach time the key is pressed, the string in the editor will change as follows: 0, 01, 0, 00.\n\nSample Input 2\n\n0BB1\n\nSample Output 2\n\n1\n\nEach time the key is pressed, the string in the editor will change as follows: 0, (empty), (empty), 1.", "sample_input": "01B0\n"}, "reference_outputs": ["00\n"], "source_document_id": "p04030", "source_text": "Score : 200 points\n\nProblem Statement\n\nSig has built his own keyboard. Designed for ultimate simplicity, this keyboard only has 3 keys on it: the 0 key, the 1 key and the backspace key.\n\nTo begin with, he is using a plain text editor with this keyboard. This editor always displays one string (possibly empty). Just after the editor is launched, this string is empty. When each key on the keyboard is pressed, the following changes occur to the string:\n\nThe 0 key: a letter 0 will be inserted to the right of the string.\n\nThe 1 key: a letter 1 will be inserted to the right of the string.\n\nThe backspace key: if the string is empty, nothing happens. Otherwise, the rightmost letter of the string is deleted.\n\nSig has launched the editor, and pressed these keys several times. You are given a string s, which is a record of his keystrokes in order. In this string, the letter 0 stands for the 0 key, the letter 1 stands for the 1 key and the letter B stands for the backspace key. What string is displayed in the editor now?\n\nConstraints\n\n1 ≦ |s| ≦ 10 (|s| denotes the length of s)\n\ns consists of the letters 0, 1 and B.\n\nThe correct answer is not an empty string.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\ns\n\nOutput\n\nPrint the string displayed in the editor in the end.\n\nSample Input 1\n\n01B0\n\nSample Output 1\n\n00\n\nEach time the key is pressed, the string in the editor will change as follows: 0, 01, 0, 00.\n\nSample Input 2\n\n0BB1\n\nSample Output 2\n\n1\n\nEach time the key is pressed, the string in the editor will change as follows: 0, (empty), (empty), 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": 163, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s443444890", "group_id": "codeNet:p04033", "input_text": "#include <stdio.h>\n\nint main(void){\n\n\tlong long int a, b;\n\t\n\tscanf(\"%lld\", &a);\n\tscanf(\"%lld\", &b);\n\n\tif(a <= 0 && b >= 0){\n\t\n\t\tprintf(\"Zero\\n\");\n\t\treturn 0;\n\n\t}else if(a < 0 && b <0){\n\n\t\tif((b - a)%2 == 0){\n\t\t\tprintf(\"Negative\\n\");\n\t\t\treturn 0;\n\t\t}else{\n\t\t\tprintf(\"Positive\\n\");\n\t\t\treturn 0;\n\t\t}\n\t}else if(a > 0 && b > 0){\n\t\n\t\tprintf(\"Positive\\n\");\n\t\treturn 0;\n\n\t}\t\n\n}", "language": "C", "metadata": {"date": 1551405987, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "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/C/s443444890.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s443444890", "user_id": "u372231379"}, "prompt_components": {"gold_output": "Positive\n", "input_to_evaluate": "#include <stdio.h>\n\nint main(void){\n\n\tlong long int a, b;\n\t\n\tscanf(\"%lld\", &a);\n\tscanf(\"%lld\", &b);\n\n\tif(a <= 0 && b >= 0){\n\t\n\t\tprintf(\"Zero\\n\");\n\t\treturn 0;\n\n\t}else if(a < 0 && b <0){\n\n\t\tif((b - a)%2 == 0){\n\t\t\tprintf(\"Negative\\n\");\n\t\t\treturn 0;\n\t\t}else{\n\t\t\tprintf(\"Positive\\n\");\n\t\t\treturn 0;\n\t\t}\n\t}else if(a > 0 && b > 0){\n\t\n\t\tprintf(\"Positive\\n\");\n\t\treturn 0;\n\n\t}\t\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": 369, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s324257423", "group_id": "codeNet:p04043", "input_text": "#include <stdio.h>\n\nint main(void){\n\tint A,B,C;\n\tscanf(\"%d %d %d\",&A,&B,&C);\n\tputs((A*B*C==175)?\"YES\":\"NO\");\n}", "language": "C", "metadata": {"date": 1591565723, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "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/C/s324257423.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s324257423", "user_id": "u031580885"}, "prompt_components": {"gold_output": "YES\n", "input_to_evaluate": "#include <stdio.h>\n\nint main(void){\n\tint A,B,C;\n\tscanf(\"%d %d %d\",&A,&B,&C);\n\tputs((A*B*C==175)?\"YES\":\"NO\");\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": 110, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s871270917", "group_id": "codeNet:p04043", "input_text": "#include<stdio.h>\nint main()\n{\n    int a,b,c;\n    scanf(\"%d%d%d\",&a,&b,&c);\n    if(a==5,b==5,c==7)\n        printf(\"YES\");\n    else\n        printf(\"NO\");\n    return 0;\n}\n\n", "language": "C", "metadata": {"date": 1573348402, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "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/C/s871270917.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s871270917", "user_id": "u353919145"}, "prompt_components": {"gold_output": "YES\n", "input_to_evaluate": "#include<stdio.h>\nint main()\n{\n    int a,b,c;\n    scanf(\"%d%d%d\",&a,&b,&c);\n    if(a==5,b==5,c==7)\n        printf(\"YES\");\n    else\n        printf(\"NO\");\n    return 0;\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": 170, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s001813130", "group_id": "codeNet:p04043", "input_text": "#include <stdio.h>\n\nint main(void)\n{\n  int a;\n  int five = 2, seven = 1;\n  int i;\n  for (i = 0; i < 3; ++i)\n  {\n    scanf(\"%d\", &a);\n    if (a == 5) five--;\n    else if(a == 7) seven--;\n  }\n  if (!five && !seven) printf(\"YES\\n\");\n  else printf(\"NO\\n\");\n  return 0;\n}\n", "language": "C", "metadata": {"date": 1572975453, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "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/C/s001813130.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s001813130", "user_id": "u754102650"}, "prompt_components": {"gold_output": "YES\n", "input_to_evaluate": "#include <stdio.h>\n\nint main(void)\n{\n  int a;\n  int five = 2, seven = 1;\n  int i;\n  for (i = 0; i < 3; ++i)\n  {\n    scanf(\"%d\", &a);\n    if (a == 5) five--;\n    else if(a == 7) seven--;\n  }\n  if (!five && !seven) printf(\"YES\\n\");\n  else printf(\"NO\\n\");\n  return 0;\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": 267, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s574286387", "group_id": "codeNet:p04043", "input_text": "#include<stdio.h>\nint main(){\n  int A,B,C;\n  scanf(\"%d %d %d\",&A,&B,&C);\n  if(A == 5 && B == 5 && C == 7){\n    printf(\"YES\");\n  }else if(A == 5 && B == 7 && C == 5){\n    printf(\"YES\");\n  }else if(A == 7 && B == 5 && C == 5){\n    printf(\"YES\");\n  }else{\n    printf(\"NO\");\n  }\n  return 0;\n}", "language": "C", "metadata": {"date": 1551041506, "filename_ext": "c", "original_language": "C (Clang 3.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/C/s574286387.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s574286387", "user_id": "u008829811"}, "prompt_components": {"gold_output": "YES\n", "input_to_evaluate": "#include<stdio.h>\nint main(){\n  int A,B,C;\n  scanf(\"%d %d %d\",&A,&B,&C);\n  if(A == 5 && B == 5 && C == 7){\n    printf(\"YES\");\n  }else if(A == 5 && B == 7 && C == 5){\n    printf(\"YES\");\n  }else if(A == 7 && B == 5 && C == 5){\n    printf(\"YES\");\n  }else{\n    printf(\"NO\");\n  }\n  return 0;\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": 288, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s748091101", "group_id": "codeNet:p04043", "input_text": "#include <stdio.h>\n\nint main(void){\n  int A,B,C;\n  scanf(\"%d%d%d\",&A,&B,&C);\n  if(A * B * C == 5 * 7 * 5){\n    printf(\"YES\\n\");\n  }else{\n    printf(\"NO\\n\");\n  }\n  return 0;\n}", "language": "C", "metadata": {"date": 1550248142, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "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/C/s748091101.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s748091101", "user_id": "u061674046"}, "prompt_components": {"gold_output": "YES\n", "input_to_evaluate": "#include <stdio.h>\n\nint main(void){\n  int A,B,C;\n  scanf(\"%d%d%d\",&A,&B,&C);\n  if(A * B * C == 5 * 7 * 5){\n    printf(\"YES\\n\");\n  }else{\n    printf(\"NO\\n\");\n  }\n  return 0;\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": 174, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s985805286", "group_id": "codeNet:p04043", "input_text": "#include<stdio.h>\n#include<stdlib.h>\nint main(void)\n{\nint a, b, c;\nscanf(\"%d %d %d\", &a, &b, &c);\n  if((a == 5 && b == 5 && c == 7) || (a == 5 && b == 7 &&\n    c == 5) || (a == 7 && b == 5 && c == 5)){\n      printf(\"Yes\\n\");\n    } else {\n      printf(\"No\\n\");\n    }\n  return 0;\n}\n", "language": "C", "metadata": {"date": 1492400714, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "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/C/s985805286.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s985805286", "user_id": "u200729311"}, "prompt_components": {"gold_output": "YES\n", "input_to_evaluate": "#include<stdio.h>\n#include<stdlib.h>\nint main(void)\n{\nint a, b, c;\nscanf(\"%d %d %d\", &a, &b, &c);\n  if((a == 5 && b == 5 && c == 7) || (a == 5 && b == 7 &&\n    c == 5) || (a == 7 && b == 5 && c == 5)){\n      printf(\"Yes\\n\");\n    } else {\n      printf(\"No\\n\");\n    }\n  return 0;\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": 280, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s761042798", "group_id": "codeNet:p04047", "input_text": "#include<stdio.h>\n#include <stdlib.h>\n#include <string.h>\nint size(const void *x,const void *y);\nint main(){\n  int N;\n  int L[100];// 0 to 99\n  int i = 0;\n  char tmp[512];\n  char *tp;\n  int sum = 0;\n  \n  scanf('%d',&N);\n  \n  scanf('%s',&tmp);\n  tp = strtok(tmp, \"\\t\");\n  L[i] = atoi(tp);\n  i=1;\n  while(tp = strtok(NULL, \"\\t\")){\n    L[i] = atoi(tp);\n    i++;\n  }\n  //ソート\n  qsort(L,i,sizeof(int),size);\n  \n  //\n  for(int j = 0 ; j<(i/2) ;j++){\n    if(L[2*j]<L[2*j +1]){\n      sum += L[2*j];\n    }else{\n      sum += L[2*j +1];\n    }\n  }\n  return sum;\n}\n \nint size(const void *x,const void *y){\n  if(*(int *)x > *(int *)y){\n    return 1;\n  }else if(*(int *)x < *(int *)y){\n    return -1;\n  }else{\n    return 0;\n  }\n}\n", "language": "C", "metadata": {"date": 1586454241, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "problem_description_relpath": "problem_descriptions/p04047.html", "problem_id": "p04047", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p04047/input.txt", "sample_output_relpath": "derived/input_output/data/p04047/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p04047/C/s761042798.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s761042798", "user_id": "u200342683"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "#include<stdio.h>\n#include <stdlib.h>\n#include <string.h>\nint size(const void *x,const void *y);\nint main(){\n  int N;\n  int L[100];// 0 to 99\n  int i = 0;\n  char tmp[512];\n  char *tp;\n  int sum = 0;\n  \n  scanf('%d',&N);\n  \n  scanf('%s',&tmp);\n  tp = strtok(tmp, \"\\t\");\n  L[i] = atoi(tp);\n  i=1;\n  while(tp = strtok(NULL, \"\\t\")){\n    L[i] = atoi(tp);\n    i++;\n  }\n  //ソート\n  qsort(L,i,sizeof(int),size);\n  \n  //\n  for(int j = 0 ; j<(i/2) ;j++){\n    if(L[2*j]<L[2*j +1]){\n      sum += L[2*j];\n    }else{\n      sum += L[2*j +1];\n    }\n  }\n  return sum;\n}\n \nint size(const void *x,const void *y){\n  if(*(int *)x > *(int *)y){\n    return 1;\n  }else if(*(int *)x < *(int *)y){\n    return -1;\n  }else{\n    return 0;\n  }\n}\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nSnuke is having a barbeque party.\n\nAt the party, he will make N servings of Skewer Meal.\n\nExample of a serving of Skewer Meal\n\nHe has a stock of 2N skewers, all of which will be used in Skewer Meal. The length of the i-th skewer is L_i.\nAlso, he has an infinite supply of ingredients.\n\nTo make a serving of Skewer Meal, he picks 2 skewers and threads ingredients onto those skewers.\nLet the length of the shorter skewer be x, then the serving can hold the maximum of x ingredients.\n\nWhat is the maximum total number of ingredients that his N servings of Skewer Meal can hold, if he uses the skewers optimally?\n\nConstraints\n\n1≦N≦100\n\n1≦L_i≦100\n\nFor each i, L_i is an integer.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\nL_1 L_2 ... L_{2N}\n\nOutput\n\nPrint the maximum total number of ingredients that Snuke's N servings of Skewer Meal can hold.\n\nSample Input 1\n\n2\n1 3 1 2\n\nSample Output 1\n\n3\n\nIf he makes a serving using the first and third skewers, and another using the second and fourth skewers, each serving will hold 1 and 2 ingredients, for the total of 3.\n\nSample Input 2\n\n5\n100 1 2 3 14 15 58 58 58 29\n\nSample Output 2\n\n135", "sample_input": "2\n1 3 1 2\n"}, "reference_outputs": ["3\n"], "source_document_id": "p04047", "source_text": "Score : 200 points\n\nProblem Statement\n\nSnuke is having a barbeque party.\n\nAt the party, he will make N servings of Skewer Meal.\n\nExample of a serving of Skewer Meal\n\nHe has a stock of 2N skewers, all of which will be used in Skewer Meal. The length of the i-th skewer is L_i.\nAlso, he has an infinite supply of ingredients.\n\nTo make a serving of Skewer Meal, he picks 2 skewers and threads ingredients onto those skewers.\nLet the length of the shorter skewer be x, then the serving can hold the maximum of x ingredients.\n\nWhat is the maximum total number of ingredients that his N servings of Skewer Meal can hold, if he uses the skewers optimally?\n\nConstraints\n\n1≦N≦100\n\n1≦L_i≦100\n\nFor each i, L_i is an integer.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\nL_1 L_2 ... L_{2N}\n\nOutput\n\nPrint the maximum total number of ingredients that Snuke's N servings of Skewer Meal can hold.\n\nSample Input 1\n\n2\n1 3 1 2\n\nSample Output 1\n\n3\n\nIf he makes a serving using the first and third skewers, and another using the second and fourth skewers, each serving will hold 1 and 2 ingredients, for the total of 3.\n\nSample Input 2\n\n5\n100 1 2 3 14 15 58 58 58 29\n\nSample Output 2\n\n135", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 101, "memory_kb": 128}, "variant": "high_resource"}
{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:C:s899639286", "group_id": "codeNet:p04048", "input_text": "#include <stdio.h>\n#include <stdlib.h>\n#include <string.h>\n#include <math.h>\n#include <limits.h>\n#define swap(type,a,b) do{type t=a;a=b;b=t;}while(0);\n#define MAX(a,b) (((a)>(b))?(a):(b))\n#define MIN(a,b) (((a)<(b))?(a):(b))\n#define ll long long\n#define INF 100000000\n#define FOR(i,a,n) for(i=(a);i<(n);i++)\nint comp(const void* a,const void* b){\n\treturn *(int*)a-*(int*)b;\n}\nvoid fill(int a[],int b,int c){\n\tint i;\n\tFOR(i,0,b) a[i]=c;\n\treturn;\n}\nll gcd(ll a,ll b){\n\treturn a%b==0?b:gcd(b,a%b);\n}\nint main(void)\n{\n\tll n,x;\n\tscanf(\"%lld%lld\",&n,&x);\n\tprintf(\"%lld\\n\",3*(n-gcd(n,x)));\n\treturn 0;\n}", "language": "C", "metadata": {"date": 1500556469, "filename_ext": "c", "original_language": "C (GCC 5.4.1)", "problem_description_relpath": "problem_descriptions/p04048.html", "problem_id": "p04048", "resource_group": "high_resource", "sample_input_relpath": "derived/input_output/data/p04048/input.txt", "sample_output_relpath": "derived/input_output/data/p04048/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p04048/C/s899639286.c", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s899639286", "user_id": "u620644171"}, "prompt_components": {"gold_output": "12\n", "input_to_evaluate": "#include <stdio.h>\n#include <stdlib.h>\n#include <string.h>\n#include <math.h>\n#include <limits.h>\n#define swap(type,a,b) do{type t=a;a=b;b=t;}while(0);\n#define MAX(a,b) (((a)>(b))?(a):(b))\n#define MIN(a,b) (((a)<(b))?(a):(b))\n#define ll long long\n#define INF 100000000\n#define FOR(i,a,n) for(i=(a);i<(n);i++)\nint comp(const void* a,const void* b){\n\treturn *(int*)a-*(int*)b;\n}\nvoid fill(int a[],int b,int c){\n\tint i;\n\tFOR(i,0,b) a[i]=c;\n\treturn;\n}\nll gcd(ll a,ll b){\n\treturn a%b==0?b:gcd(b,a%b);\n}\nint main(void)\n{\n\tll n,x;\n\tscanf(\"%lld%lld\",&n,&x);\n\tprintf(\"%lld\\n\",3*(n-gcd(n,x)));\n\treturn 0;\n}", "problem_context": "Score : 500 points\n\nProblem Statement\n\nSnuke is conducting an optical experiment using mirrors and his new invention, the rifle of Mysterious Light.\n\nThree mirrors of length N are set so that they form an equilateral triangle.\nLet the vertices of the triangle be a, b and c.\n\nInside the triangle, the rifle is placed at the point p on segment ab such that ap = X.\n(The size of the rifle is negligible.)\nNow, the rifle is about to fire a ray of Mysterious Light in the direction of bc.\n\nThe ray of Mysterious Light will travel in a straight line, and will be reflected by mirrors, in the same ways as \"ordinary\" light.\nThere is one major difference, though: it will be also reflected by its own trajectory as if it is a mirror!\nWhen the ray comes back to the rifle, the ray will be absorbed.\n\nThe following image shows the ray's trajectory where N = 5 and X = 2.\n\nIt can be shown that the ray eventually comes back to the rifle and is absorbed, regardless of the values of N and X.\nFind the total length of the ray's trajectory.\n\nConstraints\n\n2≦N≦10^{12}\n\n1≦X≦N-1\n\nN and X are integers.\n\nPartial Points\n\n300 points will be awarded for passing the test set satisfying N≦1000.\n\nAnother 200 points will be awarded for passing the test set without additional constraints.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN X\n\nOutput\n\nPrint the total length of the ray's trajectory.\n\nSample Input 1\n\n5 2\n\nSample Output 1\n\n12\n\nRefer to the image in the Problem Statement section.\nThe total length of the trajectory is 2+3+2+2+1+1+1 = 12.", "sample_input": "5 2\n"}, "reference_outputs": ["12\n"], "source_document_id": "p04048", "source_text": "Score : 500 points\n\nProblem Statement\n\nSnuke is conducting an optical experiment using mirrors and his new invention, the rifle of Mysterious Light.\n\nThree mirrors of length N are set so that they form an equilateral triangle.\nLet the vertices of the triangle be a, b and c.\n\nInside the triangle, the rifle is placed at the point p on segment ab such that ap = X.\n(The size of the rifle is negligible.)\nNow, the rifle is about to fire a ray of Mysterious Light in the direction of bc.\n\nThe ray of Mysterious Light will travel in a straight line, and will be reflected by mirrors, in the same ways as \"ordinary\" light.\nThere is one major difference, though: it will be also reflected by its own trajectory as if it is a mirror!\nWhen the ray comes back to the rifle, the ray will be absorbed.\n\nThe following image shows the ray's trajectory where N = 5 and X = 2.\n\nIt can be shown that the ray eventually comes back to the rifle and is absorbed, regardless of the values of N and X.\nFind the total length of the ray's trajectory.\n\nConstraints\n\n2≦N≦10^{12}\n\n1≦X≦N-1\n\nN and X are integers.\n\nPartial Points\n\n300 points will be awarded for passing the test set satisfying N≦1000.\n\nAnother 200 points will be awarded for passing the test set without additional constraints.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN X\n\nOutput\n\nPrint the total length of the ray's trajectory.\n\nSample Input 1\n\n5 2\n\nSample Output 1\n\n12\n\nRefer to the image in the Problem Statement section.\nThe total length of the trajectory is 2+3+2+2+1+1+1 = 12.", "split": "test_in_distribution", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 1, "memory_kb": 128}, "variant": "high_resource"}