{"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s436477686", "group_id": "codeNet:p02546", "input_text": "program test;\n{$mode objfpc}{$H+}{$R+}{$S+}\nUses sysutils;\nvar\n\ts\t\t:string;\nbegin\n readln(s);\n if s[length(s)]='s' then writeln(stdout,s+'es')\n else writeln(stdout,s+'s');\nend.", "language": "Pascal", "metadata": {"date": 1600542193, "filename_ext": "pas", "original_language": "Pascal (FPC 3.0.4)", "problem_description_relpath": "problem_descriptions/p02546.html", "problem_id": "p02546", "resource_group": "low_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/Pascal/s436477686.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s436477686", "user_id": "u705827623"}, "prompt_components": {"gold_output": "apples\n", "input_to_evaluate": "program test;\n{$mode objfpc}{$H+}{$R+}{$S+}\nUses sysutils;\nvar\n\ts\t\t:string;\nbegin\n readln(s);\n if s[length(s)]='s' then writeln(stdout,s+'es')\n else writeln(stdout,s+'s');\nend.", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 8, "memory_kb": 1328}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s294594878", "group_id": "codeNet:p02547", "input_text": "program test;\n{$mode objfpc}{$H+}{$R+}{$S+}\nUses sysutils,math;\nvar\n\tN,i,cnt\t:integer;\n d1,d2 :integer;\n\tans\t :string;\nbegin\n readln(N);\n\tans:='No';\n cnt:=0;\n for i:=1 to N do\n begin\n readln(d1,d2);\n if (d1=d2) then\n begin\n inc(cnt);\n if (cnt>=3) then\n begin\n \tans:='Yes';\n //break;\n end;\n end\n else cnt:=0;\n end;\n\n writeln(stdout,ans);\nend.", "language": "Pascal", "metadata": {"date": 1600542817, "filename_ext": "pas", "original_language": "Pascal (FPC 3.0.4)", "problem_description_relpath": "problem_descriptions/p02547.html", "problem_id": "p02547", "resource_group": "low_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/Pascal/s294594878.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s294594878", "user_id": "u705827623"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "program test;\n{$mode objfpc}{$H+}{$R+}{$S+}\nUses sysutils,math;\nvar\n\tN,i,cnt\t:integer;\n d1,d2 :integer;\n\tans\t :string;\nbegin\n readln(N);\n\tans:='No';\n cnt:=0;\n for i:=1 to N do\n begin\n readln(d1,d2);\n if (d1=d2) then\n begin\n inc(cnt);\n if (cnt>=3) then\n begin\n \tans:='Yes';\n //break;\n end;\n end\n else cnt:=0;\n end;\n\n writeln(stdout,ans);\nend.", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 472, "cpu_time_ms": 5, "memory_kb": 1388}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s769432533", "group_id": "codeNet:p02550", "input_text": "program sequence_sum;\nvar\n n, x, m, num: int64;\n i, offset, period, rem: integer;\n a: array[0..100000] of int64;\n b: array[0..100000] of integer;\nbegin\n read(n, x, m);\n if n = 1 then\n begin\n writeln(x);\n halt(0);\n end;\n a[1] := x;\n b[x] := 1;\n for i := 2 to m + 1 do\n begin\n x := (x * x) mod m;\n a[i] := a[i - 1] + x;\n if i = n then\n begin\n writeln(a[i]);\n halt(0);\n end;\n if b[x] > 0 then\n begin\n offset := b[x] - 1;\n period := i - offset - 1;\n break;\n end;\n b[x] := i;\n end;\n num := (n - offset) div period;\n rem := n - offset - num * period;\n writeln((a[offset + period] - a[offset]) * num + a[offset + rem]);\nend.", "language": "Pascal", "metadata": {"date": 1600569150, "filename_ext": "pas", "original_language": "Pascal (FPC 3.0.4)", "problem_description_relpath": "problem_descriptions/p02550.html", "problem_id": "p02550", "resource_group": "low_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/Pascal/s769432533.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s769432533", "user_id": "u506403362"}, "prompt_components": {"gold_output": "1369\n", "input_to_evaluate": "program sequence_sum;\nvar\n n, x, m, num: int64;\n i, offset, period, rem: integer;\n a: array[0..100000] of int64;\n b: array[0..100000] of integer;\nbegin\n read(n, x, m);\n if n = 1 then\n begin\n writeln(x);\n halt(0);\n end;\n a[1] := x;\n b[x] := 1;\n for i := 2 to m + 1 do\n begin\n x := (x * x) mod m;\n a[i] := a[i - 1] + x;\n if i = n then\n begin\n writeln(a[i]);\n halt(0);\n end;\n if b[x] > 0 then\n begin\n offset := b[x] - 1;\n period := i - offset - 1;\n break;\n end;\n b[x] := i;\n end;\n num := (n - offset) div period;\n rem := n - offset - num * period;\n writeln((a[offset + period] - a[offset]) * num + a[offset + rem]);\nend.", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 691, "cpu_time_ms": 3, "memory_kb": 1380}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s491005329", "group_id": "codeNet:p02550", "input_text": "program sequence_sum;\nvar\n n, x, m, num: int64;\n i, k, offset, period, rem: integer;\n a: array[0..100000] of int64;\n b: array[0..100000] of integer;\nbegin\n read(n, x, m);\n if n = 1 then\n begin\n writeln(x);\n halt(0);\n end;\n a[1] := x;\n b[integer(x)] := 1;\n for i := 2 to integer(m) + 1 do\n begin\n x := (x * x) mod m;\n a[i] := a[i - 1] + x;\n if i = n then\n begin\n writeln(a[i]);\n halt(0);\n end;\n k := integer(x);\n if b[k] > 0 then\n begin\n offset := b[k] - 1;\n period := i - offset - 1;\n break;\n end;\n b[k] := i;\n end;\n num := (n - offset) div int64(period);\n rem := integer(n - offset - num * period);\n writeln((a[offset + period] - a[offset]) * num + a[offset + rem]);\nend.", "language": "Pascal", "metadata": {"date": 1600569072, "filename_ext": "pas", "original_language": "Pascal (FPC 3.0.4)", "problem_description_relpath": "problem_descriptions/p02550.html", "problem_id": "p02550", "resource_group": "low_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/Pascal/s491005329.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s491005329", "user_id": "u506403362"}, "prompt_components": {"gold_output": "1369\n", "input_to_evaluate": "program sequence_sum;\nvar\n n, x, m, num: int64;\n i, k, offset, period, rem: integer;\n a: array[0..100000] of int64;\n b: array[0..100000] of integer;\nbegin\n read(n, x, m);\n if n = 1 then\n begin\n writeln(x);\n halt(0);\n end;\n a[1] := x;\n b[integer(x)] := 1;\n for i := 2 to integer(m) + 1 do\n begin\n x := (x * x) mod m;\n a[i] := a[i - 1] + x;\n if i = n then\n begin\n writeln(a[i]);\n halt(0);\n end;\n k := integer(x);\n if b[k] > 0 then\n begin\n offset := b[k] - 1;\n period := i - offset - 1;\n break;\n end;\n b[k] := i;\n end;\n num := (n - offset) div int64(period);\n rem := integer(n - offset - num * period);\n writeln((a[offset + period] - a[offset]) * num + a[offset + rem]);\nend.", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 4, "memory_kb": 1384}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s581584206", "group_id": "codeNet:p02552", "input_text": "var i:integer;\nbegin\nreadln(i);\nwriteln(1-i);\nend.", "language": "Pascal", "metadata": {"date": 1600164368, "filename_ext": "pas", "original_language": "Pascal (FPC 3.0.4)", "problem_description_relpath": "problem_descriptions/p02552.html", "problem_id": "p02552", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02552/input.txt", "sample_output_relpath": "derived/input_output/data/p02552/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02552/Pascal/s581584206.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s581584206", "user_id": "u984276646"}, "prompt_components": {"gold_output": "0\n", "input_to_evaluate": "var i:integer;\nbegin\nreadln(i);\nwriteln(1-i);\nend.", "problem_context": "Score : 100 points\n\nProblem Statement\n\nGiven is an integer x that is greater than or equal to 0, and less than or equal to 1.\nOutput 1 if x is equal to 0, or 0 if x is equal to 1.\n\nConstraints\n\n0 \\leq x \\leq 1\n\nx is an integer\n\nInput\n\nInput is given from Standard Input in the following format:\n\nx\n\nOutput\n\nPrint 1 if x is equal to 0, or 0 if x is equal to 1.\n\nSample Input 1\n\n1\n\nSample Output 1\n\n0\n\nSample Input 2\n\n0\n\nSample Output 2\n\n1", "sample_input": "1\n"}, "reference_outputs": ["0\n"], "source_document_id": "p02552", "source_text": "Score : 100 points\n\nProblem Statement\n\nGiven is an integer x that is greater than or equal to 0, and less than or equal to 1.\nOutput 1 if x is equal to 0, or 0 if x is equal to 1.\n\nConstraints\n\n0 \\leq x \\leq 1\n\nx is an integer\n\nInput\n\nInput is given from Standard Input in the following format:\n\nx\n\nOutput\n\nPrint 1 if x is equal to 0, or 0 if x is equal to 1.\n\nSample Input 1\n\n1\n\nSample Output 1\n\n0\n\nSample Input 2\n\n0\n\nSample Output 2\n\n1", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 50, "cpu_time_ms": 2, "memory_kb": 1372}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s650438791", "group_id": "codeNet:p02552", "input_text": "var a:Longint;\nbegin\nread(a);\nwriteln(1-a);\nend.", "language": "Pascal", "metadata": {"date": 1600035050, "filename_ext": "pas", "original_language": "Pascal (FPC 3.0.4)", "problem_description_relpath": "problem_descriptions/p02552.html", "problem_id": "p02552", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02552/input.txt", "sample_output_relpath": "derived/input_output/data/p02552/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02552/Pascal/s650438791.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s650438791", "user_id": "u657913472"}, "prompt_components": {"gold_output": "0\n", "input_to_evaluate": "var a:Longint;\nbegin\nread(a);\nwriteln(1-a);\nend.", "problem_context": "Score : 100 points\n\nProblem Statement\n\nGiven is an integer x that is greater than or equal to 0, and less than or equal to 1.\nOutput 1 if x is equal to 0, or 0 if x is equal to 1.\n\nConstraints\n\n0 \\leq x \\leq 1\n\nx is an integer\n\nInput\n\nInput is given from Standard Input in the following format:\n\nx\n\nOutput\n\nPrint 1 if x is equal to 0, or 0 if x is equal to 1.\n\nSample Input 1\n\n1\n\nSample Output 1\n\n0\n\nSample Input 2\n\n0\n\nSample Output 2\n\n1", "sample_input": "1\n"}, "reference_outputs": ["0\n"], "source_document_id": "p02552", "source_text": "Score : 100 points\n\nProblem Statement\n\nGiven is an integer x that is greater than or equal to 0, and less than or equal to 1.\nOutput 1 if x is equal to 0, or 0 if x is equal to 1.\n\nConstraints\n\n0 \\leq x \\leq 1\n\nx is an integer\n\nInput\n\nInput is given from Standard Input in the following format:\n\nx\n\nOutput\n\nPrint 1 if x is equal to 0, or 0 if x is equal to 1.\n\nSample Input 1\n\n1\n\nSample Output 1\n\n0\n\nSample Input 2\n\n0\n\nSample Output 2\n\n1", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 48, "cpu_time_ms": 3, "memory_kb": 1328}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s609789629", "group_id": "codeNet:p02553", "input_text": "var a,b,c,d,ll,lr,rl,rr,tmp:int64;\nbegin\nreadln(a,b,c,d);\nll:=a*c;\nrl:=b*c;\nlr:=a*d;\nrr:=b*d;\ntmp:=-1000000000 * 1000000000;\nif(ll>=tmp)then tmp:=ll;\nif(rl>=tmp)then tmp:=rl;\nif(lr>=tmp)then tmp:=lr;\nif(rr>=tmp)then tmp:=rr;\nwriteln(tmp);\nend.", "language": "Pascal", "metadata": {"date": 1600502465, "filename_ext": "pas", "original_language": "Pascal (FPC 3.0.4)", "problem_description_relpath": "problem_descriptions/p02553.html", "problem_id": "p02553", "resource_group": "low_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/Pascal/s609789629.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s609789629", "user_id": "u984276646"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "var a,b,c,d,ll,lr,rl,rr,tmp:int64;\nbegin\nreadln(a,b,c,d);\nll:=a*c;\nrl:=b*c;\nlr:=a*d;\nrr:=b*d;\ntmp:=-1000000000 * 1000000000;\nif(ll>=tmp)then tmp:=ll;\nif(rl>=tmp)then tmp:=rl;\nif(lr>=tmp)then tmp:=lr;\nif(rr>=tmp)then tmp:=rr;\nwriteln(tmp);\nend.", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 5, "memory_kb": 1388}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s724231122", "group_id": "codeNet:p02553", "input_text": "Program AtCoderBeginnerContest178;\n\nuses\nsysutils,strutils, math;\n\nvar\n\na,b,c,d,x,temp,t2 :int64;\ns:string;\nr:real;\n\n\n\nbegin\n\nread(a);\nread(b);\nread(c);\nread(d);\n\n\nIF (b = 0) AND (d = 0) THEN\nbegin\n\tx:= a * c;\n\twriteln(x);\n\texit;\nend;\n\nIF (a > 0) AND (c > 0) THEN//if all positive\nbegin\n\tx:= b * d;\n\twriteln(x);\n\texit;\nend;\n\nIF (b < 0) AND (d < 0) THEN//if all negative\nbegin\n\tx:= a * c;\n\twriteln(x);\n\texit;\nend;\n\nIF (a < 0) AND (b < 0) AND (c > 0) AND (d > 0) THEN//if both x range negative\nbegin\n\ttemp:= max(a,b);\n\tx:= temp * min(c,d);\n\twriteln(x);\n\texit;\nend;\n\nIF (a > 0) AND (b > 0) AND (c < 0) AND (d < 0) THEN//if both y range negative\nbegin\n\ttemp:= max(c,d);\n\tx:= temp * min(a,b);\n\twriteln(x);\n\texit;\nend;\n\nIF (a < 0) OR (b < 0) THEN\nbegin\n\ttemp:= max(a,b);\nend;\n\n\nIF (c < 0) OR (d < 0) THEN\nbegin\n\tt2:= max(c,d);\nend;\n\nwriteln(x);\n\n\n\n\n//program 1\n\n{readln(x);\n\nIF (x = 0) THEN\n\nbegin\n\twriteln('1');\nend;\n\nIF (x = 1) THEN\n\nbegin\n\twriteln('0');\nend;}\n\nend.\n\n", "language": "Pascal", "metadata": {"date": 1600028348, "filename_ext": "pas", "original_language": "Pascal (FPC 3.0.4)", "problem_description_relpath": "problem_descriptions/p02553.html", "problem_id": "p02553", "resource_group": "low_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/Pascal/s724231122.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s724231122", "user_id": "u655825084"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "Program AtCoderBeginnerContest178;\n\nuses\nsysutils,strutils, math;\n\nvar\n\na,b,c,d,x,temp,t2 :int64;\ns:string;\nr:real;\n\n\n\nbegin\n\nread(a);\nread(b);\nread(c);\nread(d);\n\n\nIF (b = 0) AND (d = 0) THEN\nbegin\n\tx:= a * c;\n\twriteln(x);\n\texit;\nend;\n\nIF (a > 0) AND (c > 0) THEN//if all positive\nbegin\n\tx:= b * d;\n\twriteln(x);\n\texit;\nend;\n\nIF (b < 0) AND (d < 0) THEN//if all negative\nbegin\n\tx:= a * c;\n\twriteln(x);\n\texit;\nend;\n\nIF (a < 0) AND (b < 0) AND (c > 0) AND (d > 0) THEN//if both x range negative\nbegin\n\ttemp:= max(a,b);\n\tx:= temp * min(c,d);\n\twriteln(x);\n\texit;\nend;\n\nIF (a > 0) AND (b > 0) AND (c < 0) AND (d < 0) THEN//if both y range negative\nbegin\n\ttemp:= max(c,d);\n\tx:= temp * min(a,b);\n\twriteln(x);\n\texit;\nend;\n\nIF (a < 0) OR (b < 0) THEN\nbegin\n\ttemp:= max(a,b);\nend;\n\n\nIF (c < 0) OR (d < 0) THEN\nbegin\n\tt2:= max(c,d);\nend;\n\nwriteln(x);\n\n\n\n\n//program 1\n\n{readln(x);\n\nIF (x = 0) THEN\n\nbegin\n\twriteln('1');\nend;\n\nIF (x = 1) THEN\n\nbegin\n\twriteln('0');\nend;}\n\nend.\n\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nGiven are integers a,b,c and d.\nIf x and y are integers and a \\leq x \\leq b and c\\leq y \\leq d hold, what is the maximum possible value of x \\times y?\n\nConstraints\n\n-10^9 \\leq a \\leq b \\leq 10^9\n\n-10^9 \\leq c \\leq d \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na b c d\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n1 2 1 1\n\nSample Output 1\n\n2\n\nIf x = 1 and y = 1 then x \\times y = 1.\nIf x = 2 and y = 1 then x \\times y = 2.\nTherefore, the answer is 2.\n\nSample Input 2\n\n3 5 -4 -2\n\nSample Output 2\n\n-6\n\nThe answer can be negative.\n\nSample Input 3\n\n-1000000000 0 -1000000000 0\n\nSample Output 3\n\n1000000000000000000", "sample_input": "1 2 1 1\n"}, "reference_outputs": ["2\n"], "source_document_id": "p02553", "source_text": "Score : 200 points\n\nProblem Statement\n\nGiven are integers a,b,c and d.\nIf x and y are integers and a \\leq x \\leq b and c\\leq y \\leq d hold, what is the maximum possible value of x \\times y?\n\nConstraints\n\n-10^9 \\leq a \\leq b \\leq 10^9\n\n-10^9 \\leq c \\leq d \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na b c d\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n1 2 1 1\n\nSample Output 1\n\n2\n\nIf x = 1 and y = 1 then x \\times y = 1.\nIf x = 2 and y = 1 then x \\times y = 2.\nTherefore, the answer is 2.\n\nSample Input 2\n\n3 5 -4 -2\n\nSample Output 2\n\n-6\n\nThe answer can be negative.\n\nSample Input 3\n\n-1000000000 0 -1000000000 0\n\nSample Output 3\n\n1000000000000000000", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 964, "cpu_time_ms": 6, "memory_kb": 1388}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s313363634", "group_id": "codeNet:p02553", "input_text": "uses\nsysutils,strutils, math;\n\nvar\n\na,b,c,d,x,temp,t2 :longint;\ns:string;\nr:real;\n\n\n\nbegin\n\nread(a);\nread(b);\nread(c);\nread(d);\n\n\n\nIF (a > 0) AND (b > 0) AND (c > 0) AND (d > 0) THEN//if all positive\nbegin\n\tx:= max(a,b) * max(c,d);\n\twriteln(x);\n\texit;\nend;\n\n\nIF (a < 0) AND (b < 0) AND (c > 0) AND (d > 0) THEN//if both x range negative\nbegin\n\ttemp:= max(a,b);\n\tx:= temp * min(c,d);\n\twriteln(x);\n\texit;\nend;\n\nIF (a > 0) AND (b > 0) AND (c < 0) AND (d < 0) THEN//if both y range negative\nbegin\n\ttemp:= max(c,d);\n\tx:= temp * min(a,b);\n\twriteln(x);\n\texit;\nend;\n\nIF (a < 0) OR (b < 0) THEN\nbegin\n\ttemp:= max(a,b);\nend;\n\n\nIF (c < 0) OR (d < 0) THEN\nbegin\n\tt2:= max(c,d);\nend;\n\nwriteln(x);\n\nend.", "language": "Pascal", "metadata": {"date": 1600026335, "filename_ext": "pas", "original_language": "Pascal (FPC 3.0.4)", "problem_description_relpath": "problem_descriptions/p02553.html", "problem_id": "p02553", "resource_group": "low_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/Pascal/s313363634.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s313363634", "user_id": "u655825084"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "uses\nsysutils,strutils, math;\n\nvar\n\na,b,c,d,x,temp,t2 :longint;\ns:string;\nr:real;\n\n\n\nbegin\n\nread(a);\nread(b);\nread(c);\nread(d);\n\n\n\nIF (a > 0) AND (b > 0) AND (c > 0) AND (d > 0) THEN//if all positive\nbegin\n\tx:= max(a,b) * max(c,d);\n\twriteln(x);\n\texit;\nend;\n\n\nIF (a < 0) AND (b < 0) AND (c > 0) AND (d > 0) THEN//if both x range negative\nbegin\n\ttemp:= max(a,b);\n\tx:= temp * min(c,d);\n\twriteln(x);\n\texit;\nend;\n\nIF (a > 0) AND (b > 0) AND (c < 0) AND (d < 0) THEN//if both y range negative\nbegin\n\ttemp:= max(c,d);\n\tx:= temp * min(a,b);\n\twriteln(x);\n\texit;\nend;\n\nIF (a < 0) OR (b < 0) THEN\nbegin\n\ttemp:= max(a,b);\nend;\n\n\nIF (c < 0) OR (d < 0) THEN\nbegin\n\tt2:= max(c,d);\nend;\n\nwriteln(x);\n\nend.", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 689, "cpu_time_ms": 5, "memory_kb": 1388}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s248527101", "group_id": "codeNet:p02553", "input_text": "var\n\na,b,c,d,x:longint;\ns:string;\nr:real;\n\n\n\nbegin\n\nread(a);\nread(b);\nread(c);\nread(d);\n\nx:= b * d;\n\nwriteln(x);\n\nend.", "language": "Pascal", "metadata": {"date": 1600024109, "filename_ext": "pas", "original_language": "Pascal (FPC 3.0.4)", "problem_description_relpath": "problem_descriptions/p02553.html", "problem_id": "p02553", "resource_group": "low_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/Pascal/s248527101.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s248527101", "user_id": "u655825084"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "var\n\na,b,c,d,x:longint;\ns:string;\nr:real;\n\n\n\nbegin\n\nread(a);\nread(b);\nread(c);\nread(d);\n\nx:= b * d;\n\nwriteln(x);\n\nend.", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 118, "cpu_time_ms": 3, "memory_kb": 1388}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s249785594", "group_id": "codeNet:p02553", "input_text": "var\n\na,b,c,d,x:longint;\ns:string;\nr:real;\n\n\n\nbegin\n\nread(a);\nread(b);\nread(c);\nreadln(d);\n\nx:= b * d;\n\nwriteln(x);\n\nend.", "language": "Pascal", "metadata": {"date": 1600024020, "filename_ext": "pas", "original_language": "Pascal (FPC 3.0.4)", "problem_description_relpath": "problem_descriptions/p02553.html", "problem_id": "p02553", "resource_group": "low_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/Pascal/s249785594.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s249785594", "user_id": "u655825084"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "var\n\na,b,c,d,x:longint;\ns:string;\nr:real;\n\n\n\nbegin\n\nread(a);\nread(b);\nread(c);\nreadln(d);\n\nx:= b * d;\n\nwriteln(x);\n\nend.", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 6, "memory_kb": 1384}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s624149887", "group_id": "codeNet:p02556", "input_text": "uses\nsysutils,math,strutils;\n\nvar\nc,d,x,y,a,b,n:integer;\n\n\nbegin\n\n//mod 1000000007;\n\nreadln(n);\n\nread(x);\nreadln(y);\n\nread(a);\nreadln(b);\n\nread(c);\nreadln(d);\n\nx:= (x-a) + (y-b);\n\nx:= x - (2*x);\n\nwriteln(x);\n\nend.", "language": "Pascal", "metadata": {"date": 1600027727, "filename_ext": "pas", "original_language": "Pascal (FPC 3.0.4)", "problem_description_relpath": "problem_descriptions/p02556.html", "problem_id": "p02556", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02556/input.txt", "sample_output_relpath": "derived/input_output/data/p02556/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02556/Pascal/s624149887.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s624149887", "user_id": "u655825084"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "uses\nsysutils,math,strutils;\n\nvar\nc,d,x,y,a,b,n:integer;\n\n\nbegin\n\n//mod 1000000007;\n\nreadln(n);\n\nread(x);\nreadln(y);\n\nread(a);\nreadln(b);\n\nread(c);\nreadln(d);\n\nx:= (x-a) + (y-b);\n\nx:= x - (2*x);\n\nwriteln(x);\n\nend.", "problem_context": "Score : 500 points\n\nProblem Statement\n\nThere are N points on the 2D plane, i-th of which is located on (x_i, y_i).\nThere can be multiple points that share the same coordinate.\nWhat is the maximum possible Manhattan distance between two distinct points?\n\nHere, the Manhattan distance between two points (x_i, y_i) and (x_j, y_j) is defined by |x_i-x_j| + |y_i-y_j|.\n\nConstraints\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq x_i,y_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nx_1 y_1\nx_2 y_2\n:\nx_N y_N\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n3\n1 1\n2 4\n3 2\n\nSample Output 1\n\n4\n\nThe Manhattan distance between the first point and the second point is |1-2|+|1-4|=4, which is maximum possible.\n\nSample Input 2\n\n2\n1 1\n1 1\n\nSample Output 2\n\n0", "sample_input": "3\n1 1\n2 4\n3 2\n"}, "reference_outputs": ["4\n"], "source_document_id": "p02556", "source_text": "Score : 500 points\n\nProblem Statement\n\nThere are N points on the 2D plane, i-th of which is located on (x_i, y_i).\nThere can be multiple points that share the same coordinate.\nWhat is the maximum possible Manhattan distance between two distinct points?\n\nHere, the Manhattan distance between two points (x_i, y_i) and (x_j, y_j) is defined by |x_i-x_j| + |y_i-y_j|.\n\nConstraints\n\n2 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq x_i,y_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nx_1 y_1\nx_2 y_2\n:\nx_N y_N\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n3\n1 1\n2 4\n3 2\n\nSample Output 1\n\n4\n\nThe Manhattan distance between the first point and the second point is |1-2|+|1-4|=4, which is maximum possible.\n\nSample Input 2\n\n2\n1 1\n1 1\n\nSample Output 2\n\n0", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 5, "memory_kb": 1372}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s475793126", "group_id": "codeNet:p02570", "input_text": "var\n d,t,s:double;\nbegin\n readln(d,t,s);\n if s*t>=d then write('Yes')\n else write('No');\nend.", "language": "Pascal", "metadata": {"date": 1599406367, "filename_ext": "pas", "original_language": "Pascal (FPC 3.0.4)", "problem_description_relpath": "problem_descriptions/p02570.html", "problem_id": "p02570", "resource_group": "low_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/Pascal/s475793126.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s475793126", "user_id": "u910314957"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "var\n d,t,s:double;\nbegin\n readln(d,t,s);\n if s*t>=d then write('Yes')\n else write('No');\nend.", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 1384}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s126682865", "group_id": "codeNet:p02570", "input_text": "var\n d,t,s:double;\nbegin\n readln(d,t,s);\n if t/s<=t then write('Yes')\n else write('No');\nend.", "language": "Pascal", "metadata": {"date": 1599406320, "filename_ext": "pas", "original_language": "Pascal (FPC 3.0.4)", "problem_description_relpath": "problem_descriptions/p02570.html", "problem_id": "p02570", "resource_group": "low_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/Pascal/s126682865.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s126682865", "user_id": "u910314957"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "var\n d,t,s:double;\nbegin\n readln(d,t,s);\n if t/s<=t then write('Yes')\n else write('No');\nend.", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 5, "memory_kb": 1380}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s982782133", "group_id": "codeNet:p02570", "input_text": "var\n d,t,s:int64;\nbegin\n readln(d,t,s);\n if t*s>=d then writeln('Yes') else writeln('No');\nend.", "language": "Pascal", "metadata": {"date": 1599406191, "filename_ext": "pas", "original_language": "Pascal (FPC 3.0.4)", "problem_description_relpath": "problem_descriptions/p02570.html", "problem_id": "p02570", "resource_group": "low_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/Pascal/s982782133.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s982782133", "user_id": "u465963427"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "var\n d,t,s:int64;\nbegin\n readln(d,t,s);\n if t*s>=d then writeln('Yes') else writeln('No');\nend.", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 98, "cpu_time_ms": 3, "memory_kb": 1372}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s107871300", "group_id": "codeNet:p02570", "input_text": "var a,b,c:Longint;\nbegin\n read(a,b,c);\n if a<=b*c \n then \n writeln('Yes')\n else\n writeln('No')\nend.", "language": "Pascal", "metadata": {"date": 1598736299, "filename_ext": "pas", "original_language": "Pascal (FPC 3.0.4)", "problem_description_relpath": "problem_descriptions/p02570.html", "problem_id": "p02570", "resource_group": "low_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/Pascal/s107871300.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s107871300", "user_id": "u107995903"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "var a,b,c:Longint;\nbegin\n read(a,b,c);\n if a<=b*c \n then \n writeln('Yes')\n else\n writeln('No')\nend.", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 4, "memory_kb": 1332}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s172672517", "group_id": "codeNet:p02571", "input_text": "var\n s,t:ansistring;\n function sum(x:ansistring):longint;\n var\n i,j,ans,max:longint;\n y:ansistring;\n begin\n max:=0;\n for i:=1 to length(s)-length(x)+1 do\n begin\n y:=copy(s,i,length(x));ans:=0;\n for j:=1 to length(x) do if x[j]=y[j] then inc(ans);\n if ans>max then max:=ans;\n end;\n exit(max);\n end;\nbegin\n readln(s);\n readln(t);\n writeln(length(t)-sum(t));\nend.", "language": "Pascal", "metadata": {"date": 1599407099, "filename_ext": "pas", "original_language": "Pascal (FPC 3.0.4)", "problem_description_relpath": "problem_descriptions/p02571.html", "problem_id": "p02571", "resource_group": "low_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/Pascal/s172672517.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s172672517", "user_id": "u465963427"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "var\n s,t:ansistring;\n function sum(x:ansistring):longint;\n var\n i,j,ans,max:longint;\n y:ansistring;\n begin\n max:=0;\n for i:=1 to length(s)-length(x)+1 do\n begin\n y:=copy(s,i,length(x));ans:=0;\n for j:=1 to length(x) do if x[j]=y[j] then inc(ans);\n if ans>max then max:=ans;\n end;\n exit(max);\n end;\nbegin\n readln(s);\n readln(t);\n writeln(length(t)-sum(t));\nend.", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 413, "cpu_time_ms": 7, "memory_kb": 1384}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s214782980", "group_id": "codeNet:p02576", "input_text": "var\n n,x,t,s:int64;\nbegin\n readln(n,x,t);\n if n mod x=0 then s:=n div x else s:=n div x+1;\n writeln(s*t);\nend.", "language": "Pascal", "metadata": {"date": 1599411951, "filename_ext": "pas", "original_language": "Pascal (FPC 3.0.4)", "problem_description_relpath": "problem_descriptions/p02576.html", "problem_id": "p02576", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02576/input.txt", "sample_output_relpath": "derived/input_output/data/p02576/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02576/Pascal/s214782980.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s214782980", "user_id": "u465963427"}, "prompt_components": {"gold_output": "12\n", "input_to_evaluate": "var\n n,x,t,s:int64;\nbegin\n readln(n,x,t);\n if n mod x=0 then s:=n div x else s:=n div x+1;\n writeln(s*t);\nend.", "problem_context": "Score : 100 points\n\nProblem Statement\n\nTakahashi loves takoyaki - a ball-shaped snack.\n\nWith a takoyaki machine, he can make at most X pieces of takoyaki at a time, taking T minutes regardless of the number of pieces to make.\n\nHow long does it take to make N takoyaki?\n\nConstraints\n\n1 \\leq N,X,T \\leq 1000\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN X T\n\nOutput\n\nPrint an integer representing the minimum number of minutes needed to make N pieces of takoyaki.\n\nSample Input 1\n\n20 12 6\n\nSample Output 1\n\n12\n\nHe can make 12 pieces of takoyaki in the first 6 minutes and 8 more in the next 6 minutes, so he can make 20 in a total of 12 minutes.\n\nNote that being able to make 12 in 6 minutes does not mean he can make 2 in 1 minute.\n\nSample Input 2\n\n1000 1 1000\n\nSample Output 2\n\n1000000\n\nIt seems to take a long time to make this kind of takoyaki.", "sample_input": "20 12 6\n"}, "reference_outputs": ["12\n"], "source_document_id": "p02576", "source_text": "Score : 100 points\n\nProblem Statement\n\nTakahashi loves takoyaki - a ball-shaped snack.\n\nWith a takoyaki machine, he can make at most X pieces of takoyaki at a time, taking T minutes regardless of the number of pieces to make.\n\nHow long does it take to make N takoyaki?\n\nConstraints\n\n1 \\leq N,X,T \\leq 1000\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN X T\n\nOutput\n\nPrint an integer representing the minimum number of minutes needed to make N pieces of takoyaki.\n\nSample Input 1\n\n20 12 6\n\nSample Output 1\n\n12\n\nHe can make 12 pieces of takoyaki in the first 6 minutes and 8 more in the next 6 minutes, so he can make 20 in a total of 12 minutes.\n\nNote that being able to make 12 in 6 minutes does not mean he can make 2 in 1 minute.\n\nSample Input 2\n\n1000 1 1000\n\nSample Output 2\n\n1000000\n\nIt seems to take a long time to make this kind of takoyaki.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 6, "memory_kb": 1316}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s984931318", "group_id": "codeNet:p02577", "input_text": "program bt;\n\nvar s:ansistring;\n t,i:longint;\n \nbegin\n readln(s);\n t:=0;\n for i:=1 to length(s) do t:=t+(ord(s[i])-48);\n if (t mod 9=0) then write('Yes') else write('No');\n readln;\nend.\n \n ", "language": "Pascal", "metadata": {"date": 1598126523, "filename_ext": "pas", "original_language": "Pascal (FPC 3.0.4)", "problem_description_relpath": "problem_descriptions/p02577.html", "problem_id": "p02577", "resource_group": "low_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/Pascal/s984931318.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s984931318", "user_id": "u824872487"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "program bt;\n\nvar s:ansistring;\n t,i:longint;\n \nbegin\n readln(s);\n t:=0;\n for i:=1 to length(s) do t:=t+(ord(s[i])-48);\n if (t mod 9=0) then write('Yes') else write('No');\n readln;\nend.\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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 5, "memory_kb": 1384}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s118484160", "group_id": "codeNet:p02582", "input_text": "var s:string;\nbegin\nreadln(s);\nif (s='RRR') then writeln(3);\nif (s='RRS') then writeln(2);\nif (s='RSR') then writeln(1);\nif (s='RSS') then writeln(1);\nif (s='SRR') then writeln(2);\nif (s='SRS') then writeln(1);\nif (s='SSR') then writeln(1);\nif (s='SSS') then writeln(0);\nend.", "language": "Pascal", "metadata": {"date": 1598611654, "filename_ext": "pas", "original_language": "Pascal (FPC 3.0.4)", "problem_description_relpath": "problem_descriptions/p02582.html", "problem_id": "p02582", "resource_group": "low_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/Pascal/s118484160.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s118484160", "user_id": "u984276646"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "var s:string;\nbegin\nreadln(s);\nif (s='RRR') then writeln(3);\nif (s='RRS') then writeln(2);\nif (s='RSR') then writeln(1);\nif (s='RSS') then writeln(1);\nif (s='SRR') then writeln(2);\nif (s='SRS') then writeln(1);\nif (s='SSR') then writeln(1);\nif (s='SSS') then writeln(0);\nend.", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 5, "memory_kb": 1308}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s808782317", "group_id": "codeNet:p02583", "input_text": "//fpc 3.0.4\n\nprogram bt;\n\nvar i,j,k,n,t:longint;\n a :array[1..1000000] of longint;\n\nbegin \n readln(n);\n for i:=1 to n-1 do\n read(a[i]);\n readln(a[n]);\n t:=0;\n for i:=1 to n-2 do\n for j:=i+1 to n-1 do\n for k:=j+1 to n do\n if (a[i]+a[j]>a[k]) and (a[i]+a[k]>a[j]) and (a[j]+a[k]>a[i]) and (a[i]<>a[j]) and (a[j]<>a[k]) and (a[i]<>a[k]) then\n inc(t);\n write(t);\nend.\n \n", "language": "Pascal", "metadata": {"date": 1597519397, "filename_ext": "pas", "original_language": "Pascal (FPC 3.0.4)", "problem_description_relpath": "problem_descriptions/p02583.html", "problem_id": "p02583", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02583/input.txt", "sample_output_relpath": "derived/input_output/data/p02583/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02583/Pascal/s808782317.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s808782317", "user_id": "u824872487"}, "prompt_components": {"gold_output": "5\n", "input_to_evaluate": "//fpc 3.0.4\n\nprogram bt;\n\nvar i,j,k,n,t:longint;\n a :array[1..1000000] of longint;\n\nbegin \n readln(n);\n for i:=1 to n-1 do\n read(a[i]);\n readln(a[n]);\n t:=0;\n for i:=1 to n-2 do\n for j:=i+1 to n-1 do\n for k:=j+1 to n do\n if (a[i]+a[j]>a[k]) and (a[i]+a[k]>a[j]) and (a[j]+a[k]>a[i]) and (a[i]<>a[j]) and (a[j]<>a[k]) and (a[i]<>a[k]) then\n inc(t);\n write(t);\nend.\n \n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nWe have sticks numbered 1, \\cdots, N. The length of Stick i (1 \\leq i \\leq N) is L_i.\n\nIn how many ways can we choose three of the sticks with different lengths that can form a triangle?\n\nThat is, find the number of triples of integers (i, j, k) (1 \\leq i < j < k \\leq N) that satisfy both of the following conditions:\n\nL_i, L_j, and L_k are all different.\n\nThere exists a triangle whose sides have lengths L_i, L_j, and L_k.\n\nConstraints\n\n1 \\leq N \\leq 100\n\n1 \\leq L_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nL_1 L_2 \\cdots L_N\n\nOutput\n\nPrint the number of ways to choose three of the sticks with different lengths that can form a triangle.\n\nSample Input 1\n\n5\n4 4 9 7 5\n\nSample Output 1\n\n5\n\nThe following five triples (i, j, k) satisfy the conditions: (1, 3, 4), (1, 4, 5), (2, 3, 4), (2, 4, 5), and (3, 4, 5).\n\nSample Input 2\n\n6\n4 5 4 3 3 5\n\nSample Output 2\n\n8\n\nWe have two sticks for each of the lengths 3, 4, and 5. To satisfy the first condition, we have to choose one from each length.\n\nThere is a triangle whose sides have lengths 3, 4, and 5, so we have 2 ^ 3 = 8 triples (i, j, k) that satisfy the conditions.\n\nSample Input 3\n\n10\n9 4 6 1 9 6 10 6 6 8\n\nSample Output 3\n\n39\n\nSample Input 4\n\n2\n1 1\n\nSample Output 4\n\n0\n\nNo triple (i, j, k) satisfies 1 \\leq i < j < k \\leq N, so we should print 0.", "sample_input": "5\n4 4 9 7 5\n"}, "reference_outputs": ["5\n"], "source_document_id": "p02583", "source_text": "Score : 200 points\n\nProblem Statement\n\nWe have sticks numbered 1, \\cdots, N. The length of Stick i (1 \\leq i \\leq N) is L_i.\n\nIn how many ways can we choose three of the sticks with different lengths that can form a triangle?\n\nThat is, find the number of triples of integers (i, j, k) (1 \\leq i < j < k \\leq N) that satisfy both of the following conditions:\n\nL_i, L_j, and L_k are all different.\n\nThere exists a triangle whose sides have lengths L_i, L_j, and L_k.\n\nConstraints\n\n1 \\leq N \\leq 100\n\n1 \\leq L_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nL_1 L_2 \\cdots L_N\n\nOutput\n\nPrint the number of ways to choose three of the sticks with different lengths that can form a triangle.\n\nSample Input 1\n\n5\n4 4 9 7 5\n\nSample Output 1\n\n5\n\nThe following five triples (i, j, k) satisfy the conditions: (1, 3, 4), (1, 4, 5), (2, 3, 4), (2, 4, 5), and (3, 4, 5).\n\nSample Input 2\n\n6\n4 5 4 3 3 5\n\nSample Output 2\n\n8\n\nWe have two sticks for each of the lengths 3, 4, and 5. To satisfy the first condition, we have to choose one from each length.\n\nThere is a triangle whose sides have lengths 3, 4, and 5, so we have 2 ^ 3 = 8 triples (i, j, k) that satisfy the conditions.\n\nSample Input 3\n\n10\n9 4 6 1 9 6 10 6 6 8\n\nSample Output 3\n\n39\n\nSample Input 4\n\n2\n1 1\n\nSample Output 4\n\n0\n\nNo triple (i, j, k) satisfies 1 \\leq i < j < k \\leq N, so we should print 0.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 4, "memory_kb": 1384}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s630568885", "group_id": "codeNet:p02584", "input_text": "program bt;\n\nvar X,K,D,a,t:longint;\n\nbegin\n readln(X,K,D);\n a:=X div D;\n t:=X mod D;\n if (ka) then\n begin\n if (abs(t-D) <= t) then\n begin\n t:=t-D;\n inc(a);\n end;\n if ((k-a) mod 2 <> 0) then t:=t+D;\n end;\n write(abs(t));\n readln;\nend.", "language": "Pascal", "metadata": {"date": 1597521933, "filename_ext": "pas", "original_language": "Pascal (FPC 3.0.4)", "problem_description_relpath": "problem_descriptions/p02584.html", "problem_id": "p02584", "resource_group": "low_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/Pascal/s630568885.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s630568885", "user_id": "u824872487"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "program bt;\n\nvar X,K,D,a,t:longint;\n\nbegin\n readln(X,K,D);\n a:=X div D;\n t:=X mod D;\n if (ka) then\n begin\n if (abs(t-D) <= t) then\n begin\n t:=t-D;\n inc(a);\n end;\n if ((k-a) mod 2 <> 0) then t:=t+D;\n end;\n write(abs(t));\n readln;\nend.", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 3, "memory_kb": 1388}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s916461687", "group_id": "codeNet:p02594", "input_text": "program main(input, output);\nvar\n x : integer;\nbegin\n readln(x);\n if x >= 30 then writeln('Yes')\n else writeln('No')\nend.", "language": "Pascal", "metadata": {"date": 1597204410, "filename_ext": "pas", "original_language": "Pascal (FPC 3.0.4)", "problem_description_relpath": "problem_descriptions/p02594.html", "problem_id": "p02594", "resource_group": "low_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/Pascal/s916461687.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s916461687", "user_id": "u959888075"}, "prompt_components": {"gold_output": "No\n", "input_to_evaluate": "program main(input, output);\nvar\n x : integer;\nbegin\n readln(x);\n if x >= 30 then writeln('Yes')\n else writeln('No')\nend.", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 125, "cpu_time_ms": 4, "memory_kb": 1372}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s306965158", "group_id": "codeNet:p02594", "input_text": "program main(input, output);\nvar\n x : integer;\nbegin\n readln(x);\n if x >= 30 then writeln('Yes')\n else writeln('No')\nend.", "language": "Pascal", "metadata": {"date": 1597204296, "filename_ext": "pas", "original_language": "Pascal (FPC 3.0.4)", "problem_description_relpath": "problem_descriptions/p02594.html", "problem_id": "p02594", "resource_group": "low_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/Pascal/s306965158.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s306965158", "user_id": "u959888075"}, "prompt_components": {"gold_output": "No\n", "input_to_evaluate": "program main(input, output);\nvar\n x : integer;\nbegin\n readln(x);\n if x >= 30 then writeln('Yes')\n else writeln('No')\nend.", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 125, "cpu_time_ms": 5, "memory_kb": 1376}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s915194931", "group_id": "codeNet:p02594", "input_text": "var x:Longint;\nbegin\nread(x);\nif x>=30 then writeln('Yes')else writeln('No');\nend.", "language": "Pascal", "metadata": {"date": 1596756688, "filename_ext": "pas", "original_language": "Pascal (FPC 3.0.4)", "problem_description_relpath": "problem_descriptions/p02594.html", "problem_id": "p02594", "resource_group": "low_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/Pascal/s915194931.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s915194931", "user_id": "u657913472"}, "prompt_components": {"gold_output": "No\n", "input_to_evaluate": "var x:Longint;\nbegin\nread(x);\nif x>=30 then writeln('Yes')else writeln('No');\nend.", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 82, "cpu_time_ms": 5, "memory_kb": 1376}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s994931722", "group_id": "codeNet:p02594", "input_text": "var x:Longint;\nbegin\nread(x);\nif x>=30 then writeln('Yes')else writeln('No');\nend.", "language": "Pascal", "metadata": {"date": 1596433645, "filename_ext": "pas", "original_language": "Pascal (FPC 3.0.4)", "problem_description_relpath": "problem_descriptions/p02594.html", "problem_id": "p02594", "resource_group": "low_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/Pascal/s994931722.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s994931722", "user_id": "u657913472"}, "prompt_components": {"gold_output": "No\n", "input_to_evaluate": "var x:Longint;\nbegin\nread(x);\nif x>=30 then writeln('Yes')else writeln('No');\nend.", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 82, "cpu_time_ms": 3, "memory_kb": 1380}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s863713350", "group_id": "codeNet:p02594", "input_text": "var x:Longint;\nbegin\nread(x);\nif x>=30 then writeln('Yes')else writeln('No');\nend.", "language": "Pascal", "metadata": {"date": 1596433633, "filename_ext": "pas", "original_language": "Pascal (FPC 3.0.4)", "problem_description_relpath": "problem_descriptions/p02594.html", "problem_id": "p02594", "resource_group": "low_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/Pascal/s863713350.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s863713350", "user_id": "u657913472"}, "prompt_components": {"gold_output": "No\n", "input_to_evaluate": "var x:Longint;\nbegin\nread(x);\nif x>=30 then writeln('Yes')else writeln('No');\nend.", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 82, "cpu_time_ms": 3, "memory_kb": 1376}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s637809034", "group_id": "codeNet:p02595", "input_text": "var\n a,b:array[0..200005] of int64;\n i:longint;\n n,h,res:int64;\n check:real;\nbegin\n read(n,h);\n res:=0;\n for i:=1 to n do read(a[i],b[i]);\n for i:=1 to n do\n begin\n check:=0;\n check:=sqrt(sqr(a[i])+sqr(b[i]));\n if check<=h then inc(res);\n end;\n write(res);\nend.\n", "language": "Pascal", "metadata": {"date": 1599273406, "filename_ext": "pas", "original_language": "Pascal (FPC 3.0.4)", "problem_description_relpath": "problem_descriptions/p02595.html", "problem_id": "p02595", "resource_group": "low_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/Pascal/s637809034.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s637809034", "user_id": "u697669604"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "var\n a,b:array[0..200005] of int64;\n i:longint;\n n,h,res:int64;\n check:real;\nbegin\n read(n,h);\n res:=0;\n for i:=1 to n do read(a[i],b[i]);\n for i:=1 to n do\n begin\n check:=0;\n check:=sqrt(sqr(a[i])+sqr(b[i]));\n if check<=h then inc(res);\n end;\n write(res);\nend.\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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 57, "memory_kb": 3336}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s407887273", "group_id": "codeNet:p02595", "input_text": "var N,i,c:Longint;\nD,x,y:int64;\nbegin\nread(N,D);\nD:=D*D;\nfor i:=1 to N do begin\nread(x,y);\nif x*x+y*y<=D then inc(c);\nend;\nwriteln(c);\nend.", "language": "Pascal", "metadata": {"date": 1596433705, "filename_ext": "pas", "original_language": "Pascal (FPC 3.0.4)", "problem_description_relpath": "problem_descriptions/p02595.html", "problem_id": "p02595", "resource_group": "low_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/Pascal/s407887273.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s407887273", "user_id": "u657913472"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "var N,i,c:Longint;\nD,x,y:int64;\nbegin\nread(N,D);\nD:=D*D;\nfor i:=1 to N do begin\nread(x,y);\nif x*x+y*y<=D then inc(c);\nend;\nwriteln(c);\nend.", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 61, "memory_kb": 1364}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s307093280", "group_id": "codeNet:p02597", "input_text": "{$R-,S-,Q-,I-,O+}\nvar n,l,r,ans:longint;s:ansistring;\nbegin\n readln(n);\n readln(s);\n ans:=0;\n l:=1;\n r:=n;\n while l=r then break else\n begin\n inc(ans);\n inc(l);\n dec(r);\n end;\n end;\n writeln(ans);\nend.", "language": "Pascal", "metadata": {"date": 1597001934, "filename_ext": "pas", "original_language": "Pascal (FPC 3.0.4)", "problem_description_relpath": "problem_descriptions/p02597.html", "problem_id": "p02597", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02597/input.txt", "sample_output_relpath": "derived/input_output/data/p02597/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02597/Pascal/s307093280.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s307093280", "user_id": "u726630158"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "{$R-,S-,Q-,I-,O+}\nvar n,l,r,ans:longint;s:ansistring;\nbegin\n readln(n);\n readln(s);\n ans:=0;\n l:=1;\n r:=n;\n while l=r then break else\n begin\n inc(ans);\n inc(l);\n dec(r);\n end;\n end;\n writeln(ans);\nend.", "problem_context": "Score : 400 points\n\nProblem Statement\n\nAn altar enshrines N stones arranged in a row from left to right. The color of the i-th stone from the left (1 \\leq i \\leq N) is given to you as a character c_i; R stands for red and W stands for white.\n\nYou can do the following two kinds of operations any number of times in any order:\n\nChoose two stones (not necessarily adjacent) and swap them.\n\nChoose one stone and change its color (from red to white and vice versa).\n\nAccording to a fortune-teller, a white stone placed to the immediate left of a red stone will bring a disaster. At least how many operations are needed to reach a situation without such a white stone?\n\nConstraints\n\n2 \\leq N \\leq 200000\n\nc_i is R or W.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nc_{1}c_{2}...c_{N}\n\nOutput\n\nPrint an integer representing the minimum number of operations needed.\n\nSample Input 1\n\n4\nWWRR\n\nSample Output 1\n\n2\n\nFor example, the two operations below will achieve the objective.\n\nSwap the 1-st and 3-rd stones from the left, resulting in RWWR.\n\nChange the color of the 4-th stone from the left, resulting in RWWW.\n\nSample Input 2\n\n2\nRR\n\nSample Output 2\n\n0\n\nIt can be the case that no operation is needed.\n\nSample Input 3\n\n8\nWRWWRWRR\n\nSample Output 3\n\n3", "sample_input": "4\nWWRR\n"}, "reference_outputs": ["2\n"], "source_document_id": "p02597", "source_text": "Score : 400 points\n\nProblem Statement\n\nAn altar enshrines N stones arranged in a row from left to right. The color of the i-th stone from the left (1 \\leq i \\leq N) is given to you as a character c_i; R stands for red and W stands for white.\n\nYou can do the following two kinds of operations any number of times in any order:\n\nChoose two stones (not necessarily adjacent) and swap them.\n\nChoose one stone and change its color (from red to white and vice versa).\n\nAccording to a fortune-teller, a white stone placed to the immediate left of a red stone will bring a disaster. At least how many operations are needed to reach a situation without such a white stone?\n\nConstraints\n\n2 \\leq N \\leq 200000\n\nc_i is R or W.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nc_{1}c_{2}...c_{N}\n\nOutput\n\nPrint an integer representing the minimum number of operations needed.\n\nSample Input 1\n\n4\nWWRR\n\nSample Output 1\n\n2\n\nFor example, the two operations below will achieve the objective.\n\nSwap the 1-st and 3-rd stones from the left, resulting in RWWR.\n\nChange the color of the 4-th stone from the left, resulting in RWWW.\n\nSample Input 2\n\n2\nRR\n\nSample Output 2\n\n0\n\nIt can be the case that no operation is needed.\n\nSample Input 3\n\n8\nWRWWRWRR\n\nSample Output 3\n\n3", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 7, "memory_kb": 1376}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s149338271", "group_id": "codeNet:p02600", "input_text": "var N:Longint;\nbegin\nread(N);\nwriteln(10-N div 200);\nend.", "language": "Pascal", "metadata": {"date": 1595733520, "filename_ext": "pas", "original_language": "Pascal (FPC 3.0.4)", "problem_description_relpath": "problem_descriptions/p02600.html", "problem_id": "p02600", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02600/input.txt", "sample_output_relpath": "derived/input_output/data/p02600/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02600/Pascal/s149338271.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s149338271", "user_id": "u657913472"}, "prompt_components": {"gold_output": "7\n", "input_to_evaluate": "var N:Longint;\nbegin\nread(N);\nwriteln(10-N div 200);\nend.", "problem_context": "Score: 100 points\n\nProblem Statement\n\nM-kun is a competitor in AtCoder, whose highest rating is X.\n\nIn this site, a competitor is given a kyu (class) according to his/her highest rating. For ratings from 400 through 1999, the following kyus are given:\n\nFrom 400 through 599: 8-kyu\n\nFrom 600 through 799: 7-kyu\n\nFrom 800 through 999: 6-kyu\n\nFrom 1000 through 1199: 5-kyu\n\nFrom 1200 through 1399: 4-kyu\n\nFrom 1400 through 1599: 3-kyu\n\nFrom 1600 through 1799: 2-kyu\n\nFrom 1800 through 1999: 1-kyu\n\nWhat kyu does M-kun have?\n\nConstraints\n\n400 \\leq X \\leq 1999\n\nX is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX\n\nOutput\n\nPrint the kyu M-kun has, as an integer.\nFor example, if he has 8-kyu, print 8.\n\nSample Input 1\n\n725\n\nSample Output 1\n\n7\n\nM-kun's highest rating is 725, which corresponds to 7-kyu.\n\nThus, 7 is the correct output.\n\nSample Input 2\n\n1600\n\nSample Output 2\n\n2\n\nM-kun's highest rating is 1600, which corresponds to 2-kyu.\n\nThus, 2 is the correct output.", "sample_input": "725\n"}, "reference_outputs": ["7\n"], "source_document_id": "p02600", "source_text": "Score: 100 points\n\nProblem Statement\n\nM-kun is a competitor in AtCoder, whose highest rating is X.\n\nIn this site, a competitor is given a kyu (class) according to his/her highest rating. For ratings from 400 through 1999, the following kyus are given:\n\nFrom 400 through 599: 8-kyu\n\nFrom 600 through 799: 7-kyu\n\nFrom 800 through 999: 6-kyu\n\nFrom 1000 through 1199: 5-kyu\n\nFrom 1200 through 1399: 4-kyu\n\nFrom 1400 through 1599: 3-kyu\n\nFrom 1600 through 1799: 2-kyu\n\nFrom 1800 through 1999: 1-kyu\n\nWhat kyu does M-kun have?\n\nConstraints\n\n400 \\leq X \\leq 1999\n\nX is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX\n\nOutput\n\nPrint the kyu M-kun has, as an integer.\nFor example, if he has 8-kyu, print 8.\n\nSample Input 1\n\n725\n\nSample Output 1\n\n7\n\nM-kun's highest rating is 725, which corresponds to 7-kyu.\n\nThus, 7 is the correct output.\n\nSample Input 2\n\n1600\n\nSample Output 2\n\n2\n\nM-kun's highest rating is 1600, which corresponds to 2-kyu.\n\nThus, 2 is the correct output.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 57, "cpu_time_ms": 7, "memory_kb": 1392}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s937707345", "group_id": "codeNet:p02600", "input_text": "var N:Longint;\nbegin\nread(N);\nwriteln(10-N div 200);\nend.", "language": "Pascal", "metadata": {"date": 1595733492, "filename_ext": "pas", "original_language": "Pascal (FPC 3.0.4)", "problem_description_relpath": "problem_descriptions/p02600.html", "problem_id": "p02600", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02600/input.txt", "sample_output_relpath": "derived/input_output/data/p02600/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02600/Pascal/s937707345.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s937707345", "user_id": "u657913472"}, "prompt_components": {"gold_output": "7\n", "input_to_evaluate": "var N:Longint;\nbegin\nread(N);\nwriteln(10-N div 200);\nend.", "problem_context": "Score: 100 points\n\nProblem Statement\n\nM-kun is a competitor in AtCoder, whose highest rating is X.\n\nIn this site, a competitor is given a kyu (class) according to his/her highest rating. For ratings from 400 through 1999, the following kyus are given:\n\nFrom 400 through 599: 8-kyu\n\nFrom 600 through 799: 7-kyu\n\nFrom 800 through 999: 6-kyu\n\nFrom 1000 through 1199: 5-kyu\n\nFrom 1200 through 1399: 4-kyu\n\nFrom 1400 through 1599: 3-kyu\n\nFrom 1600 through 1799: 2-kyu\n\nFrom 1800 through 1999: 1-kyu\n\nWhat kyu does M-kun have?\n\nConstraints\n\n400 \\leq X \\leq 1999\n\nX is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX\n\nOutput\n\nPrint the kyu M-kun has, as an integer.\nFor example, if he has 8-kyu, print 8.\n\nSample Input 1\n\n725\n\nSample Output 1\n\n7\n\nM-kun's highest rating is 725, which corresponds to 7-kyu.\n\nThus, 7 is the correct output.\n\nSample Input 2\n\n1600\n\nSample Output 2\n\n2\n\nM-kun's highest rating is 1600, which corresponds to 2-kyu.\n\nThus, 2 is the correct output.", "sample_input": "725\n"}, "reference_outputs": ["7\n"], "source_document_id": "p02600", "source_text": "Score: 100 points\n\nProblem Statement\n\nM-kun is a competitor in AtCoder, whose highest rating is X.\n\nIn this site, a competitor is given a kyu (class) according to his/her highest rating. For ratings from 400 through 1999, the following kyus are given:\n\nFrom 400 through 599: 8-kyu\n\nFrom 600 through 799: 7-kyu\n\nFrom 800 through 999: 6-kyu\n\nFrom 1000 through 1199: 5-kyu\n\nFrom 1200 through 1399: 4-kyu\n\nFrom 1400 through 1599: 3-kyu\n\nFrom 1600 through 1799: 2-kyu\n\nFrom 1800 through 1999: 1-kyu\n\nWhat kyu does M-kun have?\n\nConstraints\n\n400 \\leq X \\leq 1999\n\nX is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX\n\nOutput\n\nPrint the kyu M-kun has, as an integer.\nFor example, if he has 8-kyu, print 8.\n\nSample Input 1\n\n725\n\nSample Output 1\n\n7\n\nM-kun's highest rating is 725, which corresponds to 7-kyu.\n\nThus, 7 is the correct output.\n\nSample Input 2\n\n1600\n\nSample Output 2\n\n2\n\nM-kun's highest rating is 1600, which corresponds to 2-kyu.\n\nThus, 2 is the correct output.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 57, "cpu_time_ms": 3, "memory_kb": 1388}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s637074667", "group_id": "codeNet:p02600", "input_text": "var N:Longint;\nbegin\nread(N);\nwriteln(10-N div 200);\nend.", "language": "Pascal", "metadata": {"date": 1595733408, "filename_ext": "pas", "original_language": "Pascal (FPC 3.0.4)", "problem_description_relpath": "problem_descriptions/p02600.html", "problem_id": "p02600", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02600/input.txt", "sample_output_relpath": "derived/input_output/data/p02600/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02600/Pascal/s637074667.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s637074667", "user_id": "u657913472"}, "prompt_components": {"gold_output": "7\n", "input_to_evaluate": "var N:Longint;\nbegin\nread(N);\nwriteln(10-N div 200);\nend.", "problem_context": "Score: 100 points\n\nProblem Statement\n\nM-kun is a competitor in AtCoder, whose highest rating is X.\n\nIn this site, a competitor is given a kyu (class) according to his/her highest rating. For ratings from 400 through 1999, the following kyus are given:\n\nFrom 400 through 599: 8-kyu\n\nFrom 600 through 799: 7-kyu\n\nFrom 800 through 999: 6-kyu\n\nFrom 1000 through 1199: 5-kyu\n\nFrom 1200 through 1399: 4-kyu\n\nFrom 1400 through 1599: 3-kyu\n\nFrom 1600 through 1799: 2-kyu\n\nFrom 1800 through 1999: 1-kyu\n\nWhat kyu does M-kun have?\n\nConstraints\n\n400 \\leq X \\leq 1999\n\nX is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX\n\nOutput\n\nPrint the kyu M-kun has, as an integer.\nFor example, if he has 8-kyu, print 8.\n\nSample Input 1\n\n725\n\nSample Output 1\n\n7\n\nM-kun's highest rating is 725, which corresponds to 7-kyu.\n\nThus, 7 is the correct output.\n\nSample Input 2\n\n1600\n\nSample Output 2\n\n2\n\nM-kun's highest rating is 1600, which corresponds to 2-kyu.\n\nThus, 2 is the correct output.", "sample_input": "725\n"}, "reference_outputs": ["7\n"], "source_document_id": "p02600", "source_text": "Score: 100 points\n\nProblem Statement\n\nM-kun is a competitor in AtCoder, whose highest rating is X.\n\nIn this site, a competitor is given a kyu (class) according to his/her highest rating. For ratings from 400 through 1999, the following kyus are given:\n\nFrom 400 through 599: 8-kyu\n\nFrom 600 through 799: 7-kyu\n\nFrom 800 through 999: 6-kyu\n\nFrom 1000 through 1199: 5-kyu\n\nFrom 1200 through 1399: 4-kyu\n\nFrom 1400 through 1599: 3-kyu\n\nFrom 1600 through 1799: 2-kyu\n\nFrom 1800 through 1999: 1-kyu\n\nWhat kyu does M-kun have?\n\nConstraints\n\n400 \\leq X \\leq 1999\n\nX is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX\n\nOutput\n\nPrint the kyu M-kun has, as an integer.\nFor example, if he has 8-kyu, print 8.\n\nSample Input 1\n\n725\n\nSample Output 1\n\n7\n\nM-kun's highest rating is 725, which corresponds to 7-kyu.\n\nThus, 7 is the correct output.\n\nSample Input 2\n\n1600\n\nSample Output 2\n\n2\n\nM-kun's highest rating is 1600, which corresponds to 2-kyu.\n\nThus, 2 is the correct output.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 57, "cpu_time_ms": 3, "memory_kb": 1388}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s326813422", "group_id": "codeNet:p02600", "input_text": "var N:Longint;\nbegin\nread(N);\nwriteln(10-N div 200);\nend.", "language": "Pascal", "metadata": {"date": 1595733243, "filename_ext": "pas", "original_language": "Pascal (FPC 3.0.4)", "problem_description_relpath": "problem_descriptions/p02600.html", "problem_id": "p02600", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02600/input.txt", "sample_output_relpath": "derived/input_output/data/p02600/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02600/Pascal/s326813422.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s326813422", "user_id": "u657913472"}, "prompt_components": {"gold_output": "7\n", "input_to_evaluate": "var N:Longint;\nbegin\nread(N);\nwriteln(10-N div 200);\nend.", "problem_context": "Score: 100 points\n\nProblem Statement\n\nM-kun is a competitor in AtCoder, whose highest rating is X.\n\nIn this site, a competitor is given a kyu (class) according to his/her highest rating. For ratings from 400 through 1999, the following kyus are given:\n\nFrom 400 through 599: 8-kyu\n\nFrom 600 through 799: 7-kyu\n\nFrom 800 through 999: 6-kyu\n\nFrom 1000 through 1199: 5-kyu\n\nFrom 1200 through 1399: 4-kyu\n\nFrom 1400 through 1599: 3-kyu\n\nFrom 1600 through 1799: 2-kyu\n\nFrom 1800 through 1999: 1-kyu\n\nWhat kyu does M-kun have?\n\nConstraints\n\n400 \\leq X \\leq 1999\n\nX is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX\n\nOutput\n\nPrint the kyu M-kun has, as an integer.\nFor example, if he has 8-kyu, print 8.\n\nSample Input 1\n\n725\n\nSample Output 1\n\n7\n\nM-kun's highest rating is 725, which corresponds to 7-kyu.\n\nThus, 7 is the correct output.\n\nSample Input 2\n\n1600\n\nSample Output 2\n\n2\n\nM-kun's highest rating is 1600, which corresponds to 2-kyu.\n\nThus, 2 is the correct output.", "sample_input": "725\n"}, "reference_outputs": ["7\n"], "source_document_id": "p02600", "source_text": "Score: 100 points\n\nProblem Statement\n\nM-kun is a competitor in AtCoder, whose highest rating is X.\n\nIn this site, a competitor is given a kyu (class) according to his/her highest rating. For ratings from 400 through 1999, the following kyus are given:\n\nFrom 400 through 599: 8-kyu\n\nFrom 600 through 799: 7-kyu\n\nFrom 800 through 999: 6-kyu\n\nFrom 1000 through 1199: 5-kyu\n\nFrom 1200 through 1399: 4-kyu\n\nFrom 1400 through 1599: 3-kyu\n\nFrom 1600 through 1799: 2-kyu\n\nFrom 1800 through 1999: 1-kyu\n\nWhat kyu does M-kun have?\n\nConstraints\n\n400 \\leq X \\leq 1999\n\nX is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX\n\nOutput\n\nPrint the kyu M-kun has, as an integer.\nFor example, if he has 8-kyu, print 8.\n\nSample Input 1\n\n725\n\nSample Output 1\n\n7\n\nM-kun's highest rating is 725, which corresponds to 7-kyu.\n\nThus, 7 is the correct output.\n\nSample Input 2\n\n1600\n\nSample Output 2\n\n2\n\nM-kun's highest rating is 1600, which corresponds to 2-kyu.\n\nThus, 2 is the correct output.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 57, "cpu_time_ms": 4, "memory_kb": 1392}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s988361988", "group_id": "codeNet:p02600", "input_text": "var N:Longint;\nbegin\nread(N);\nwriteln(10-N div 200);\nend.", "language": "Pascal", "metadata": {"date": 1595733206, "filename_ext": "pas", "original_language": "Pascal (FPC 3.0.4)", "problem_description_relpath": "problem_descriptions/p02600.html", "problem_id": "p02600", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02600/input.txt", "sample_output_relpath": "derived/input_output/data/p02600/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02600/Pascal/s988361988.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s988361988", "user_id": "u657913472"}, "prompt_components": {"gold_output": "7\n", "input_to_evaluate": "var N:Longint;\nbegin\nread(N);\nwriteln(10-N div 200);\nend.", "problem_context": "Score: 100 points\n\nProblem Statement\n\nM-kun is a competitor in AtCoder, whose highest rating is X.\n\nIn this site, a competitor is given a kyu (class) according to his/her highest rating. For ratings from 400 through 1999, the following kyus are given:\n\nFrom 400 through 599: 8-kyu\n\nFrom 600 through 799: 7-kyu\n\nFrom 800 through 999: 6-kyu\n\nFrom 1000 through 1199: 5-kyu\n\nFrom 1200 through 1399: 4-kyu\n\nFrom 1400 through 1599: 3-kyu\n\nFrom 1600 through 1799: 2-kyu\n\nFrom 1800 through 1999: 1-kyu\n\nWhat kyu does M-kun have?\n\nConstraints\n\n400 \\leq X \\leq 1999\n\nX is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX\n\nOutput\n\nPrint the kyu M-kun has, as an integer.\nFor example, if he has 8-kyu, print 8.\n\nSample Input 1\n\n725\n\nSample Output 1\n\n7\n\nM-kun's highest rating is 725, which corresponds to 7-kyu.\n\nThus, 7 is the correct output.\n\nSample Input 2\n\n1600\n\nSample Output 2\n\n2\n\nM-kun's highest rating is 1600, which corresponds to 2-kyu.\n\nThus, 2 is the correct output.", "sample_input": "725\n"}, "reference_outputs": ["7\n"], "source_document_id": "p02600", "source_text": "Score: 100 points\n\nProblem Statement\n\nM-kun is a competitor in AtCoder, whose highest rating is X.\n\nIn this site, a competitor is given a kyu (class) according to his/her highest rating. For ratings from 400 through 1999, the following kyus are given:\n\nFrom 400 through 599: 8-kyu\n\nFrom 600 through 799: 7-kyu\n\nFrom 800 through 999: 6-kyu\n\nFrom 1000 through 1199: 5-kyu\n\nFrom 1200 through 1399: 4-kyu\n\nFrom 1400 through 1599: 3-kyu\n\nFrom 1600 through 1799: 2-kyu\n\nFrom 1800 through 1999: 1-kyu\n\nWhat kyu does M-kun have?\n\nConstraints\n\n400 \\leq X \\leq 1999\n\nX is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX\n\nOutput\n\nPrint the kyu M-kun has, as an integer.\nFor example, if he has 8-kyu, print 8.\n\nSample Input 1\n\n725\n\nSample Output 1\n\n7\n\nM-kun's highest rating is 725, which corresponds to 7-kyu.\n\nThus, 7 is the correct output.\n\nSample Input 2\n\n1600\n\nSample Output 2\n\n2\n\nM-kun's highest rating is 1600, which corresponds to 2-kyu.\n\nThus, 2 is the correct output.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 57, "cpu_time_ms": 3, "memory_kb": 1384}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s831350544", "group_id": "codeNet:p02600", "input_text": "var N:Longint;\nbegin\nread(N);\nwriteln(10-N div 200);\nend.", "language": "Pascal", "metadata": {"date": 1595732885, "filename_ext": "pas", "original_language": "Pascal (FPC 3.0.4)", "problem_description_relpath": "problem_descriptions/p02600.html", "problem_id": "p02600", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02600/input.txt", "sample_output_relpath": "derived/input_output/data/p02600/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02600/Pascal/s831350544.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s831350544", "user_id": "u657913472"}, "prompt_components": {"gold_output": "7\n", "input_to_evaluate": "var N:Longint;\nbegin\nread(N);\nwriteln(10-N div 200);\nend.", "problem_context": "Score: 100 points\n\nProblem Statement\n\nM-kun is a competitor in AtCoder, whose highest rating is X.\n\nIn this site, a competitor is given a kyu (class) according to his/her highest rating. For ratings from 400 through 1999, the following kyus are given:\n\nFrom 400 through 599: 8-kyu\n\nFrom 600 through 799: 7-kyu\n\nFrom 800 through 999: 6-kyu\n\nFrom 1000 through 1199: 5-kyu\n\nFrom 1200 through 1399: 4-kyu\n\nFrom 1400 through 1599: 3-kyu\n\nFrom 1600 through 1799: 2-kyu\n\nFrom 1800 through 1999: 1-kyu\n\nWhat kyu does M-kun have?\n\nConstraints\n\n400 \\leq X \\leq 1999\n\nX is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX\n\nOutput\n\nPrint the kyu M-kun has, as an integer.\nFor example, if he has 8-kyu, print 8.\n\nSample Input 1\n\n725\n\nSample Output 1\n\n7\n\nM-kun's highest rating is 725, which corresponds to 7-kyu.\n\nThus, 7 is the correct output.\n\nSample Input 2\n\n1600\n\nSample Output 2\n\n2\n\nM-kun's highest rating is 1600, which corresponds to 2-kyu.\n\nThus, 2 is the correct output.", "sample_input": "725\n"}, "reference_outputs": ["7\n"], "source_document_id": "p02600", "source_text": "Score: 100 points\n\nProblem Statement\n\nM-kun is a competitor in AtCoder, whose highest rating is X.\n\nIn this site, a competitor is given a kyu (class) according to his/her highest rating. For ratings from 400 through 1999, the following kyus are given:\n\nFrom 400 through 599: 8-kyu\n\nFrom 600 through 799: 7-kyu\n\nFrom 800 through 999: 6-kyu\n\nFrom 1000 through 1199: 5-kyu\n\nFrom 1200 through 1399: 4-kyu\n\nFrom 1400 through 1599: 3-kyu\n\nFrom 1600 through 1799: 2-kyu\n\nFrom 1800 through 1999: 1-kyu\n\nWhat kyu does M-kun have?\n\nConstraints\n\n400 \\leq X \\leq 1999\n\nX is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX\n\nOutput\n\nPrint the kyu M-kun has, as an integer.\nFor example, if he has 8-kyu, print 8.\n\nSample Input 1\n\n725\n\nSample Output 1\n\n7\n\nM-kun's highest rating is 725, which corresponds to 7-kyu.\n\nThus, 7 is the correct output.\n\nSample Input 2\n\n1600\n\nSample Output 2\n\n2\n\nM-kun's highest rating is 1600, which corresponds to 2-kyu.\n\nThus, 2 is the correct output.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 57, "cpu_time_ms": 5, "memory_kb": 1388}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s753851312", "group_id": "codeNet:p02600", "input_text": "var N:Longint;\nbegin\nread(N);\nwriteln(10-N div 200);\nend.", "language": "Pascal", "metadata": {"date": 1595732826, "filename_ext": "pas", "original_language": "Pascal (FPC 3.0.4)", "problem_description_relpath": "problem_descriptions/p02600.html", "problem_id": "p02600", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02600/input.txt", "sample_output_relpath": "derived/input_output/data/p02600/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02600/Pascal/s753851312.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s753851312", "user_id": "u657913472"}, "prompt_components": {"gold_output": "7\n", "input_to_evaluate": "var N:Longint;\nbegin\nread(N);\nwriteln(10-N div 200);\nend.", "problem_context": "Score: 100 points\n\nProblem Statement\n\nM-kun is a competitor in AtCoder, whose highest rating is X.\n\nIn this site, a competitor is given a kyu (class) according to his/her highest rating. For ratings from 400 through 1999, the following kyus are given:\n\nFrom 400 through 599: 8-kyu\n\nFrom 600 through 799: 7-kyu\n\nFrom 800 through 999: 6-kyu\n\nFrom 1000 through 1199: 5-kyu\n\nFrom 1200 through 1399: 4-kyu\n\nFrom 1400 through 1599: 3-kyu\n\nFrom 1600 through 1799: 2-kyu\n\nFrom 1800 through 1999: 1-kyu\n\nWhat kyu does M-kun have?\n\nConstraints\n\n400 \\leq X \\leq 1999\n\nX is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX\n\nOutput\n\nPrint the kyu M-kun has, as an integer.\nFor example, if he has 8-kyu, print 8.\n\nSample Input 1\n\n725\n\nSample Output 1\n\n7\n\nM-kun's highest rating is 725, which corresponds to 7-kyu.\n\nThus, 7 is the correct output.\n\nSample Input 2\n\n1600\n\nSample Output 2\n\n2\n\nM-kun's highest rating is 1600, which corresponds to 2-kyu.\n\nThus, 2 is the correct output.", "sample_input": "725\n"}, "reference_outputs": ["7\n"], "source_document_id": "p02600", "source_text": "Score: 100 points\n\nProblem Statement\n\nM-kun is a competitor in AtCoder, whose highest rating is X.\n\nIn this site, a competitor is given a kyu (class) according to his/her highest rating. For ratings from 400 through 1999, the following kyus are given:\n\nFrom 400 through 599: 8-kyu\n\nFrom 600 through 799: 7-kyu\n\nFrom 800 through 999: 6-kyu\n\nFrom 1000 through 1199: 5-kyu\n\nFrom 1200 through 1399: 4-kyu\n\nFrom 1400 through 1599: 3-kyu\n\nFrom 1600 through 1799: 2-kyu\n\nFrom 1800 through 1999: 1-kyu\n\nWhat kyu does M-kun have?\n\nConstraints\n\n400 \\leq X \\leq 1999\n\nX is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX\n\nOutput\n\nPrint the kyu M-kun has, as an integer.\nFor example, if he has 8-kyu, print 8.\n\nSample Input 1\n\n725\n\nSample Output 1\n\n7\n\nM-kun's highest rating is 725, which corresponds to 7-kyu.\n\nThus, 7 is the correct output.\n\nSample Input 2\n\n1600\n\nSample Output 2\n\n2\n\nM-kun's highest rating is 1600, which corresponds to 2-kyu.\n\nThus, 2 is the correct output.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 57, "cpu_time_ms": 2, "memory_kb": 1392}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s159966851", "group_id": "codeNet:p02600", "input_text": "var N:Longint;\nbegin\nread(N);\nwriteln(10-N div 200);\nend.", "language": "Pascal", "metadata": {"date": 1595732745, "filename_ext": "pas", "original_language": "Pascal (FPC 3.0.4)", "problem_description_relpath": "problem_descriptions/p02600.html", "problem_id": "p02600", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02600/input.txt", "sample_output_relpath": "derived/input_output/data/p02600/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02600/Pascal/s159966851.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s159966851", "user_id": "u657913472"}, "prompt_components": {"gold_output": "7\n", "input_to_evaluate": "var N:Longint;\nbegin\nread(N);\nwriteln(10-N div 200);\nend.", "problem_context": "Score: 100 points\n\nProblem Statement\n\nM-kun is a competitor in AtCoder, whose highest rating is X.\n\nIn this site, a competitor is given a kyu (class) according to his/her highest rating. For ratings from 400 through 1999, the following kyus are given:\n\nFrom 400 through 599: 8-kyu\n\nFrom 600 through 799: 7-kyu\n\nFrom 800 through 999: 6-kyu\n\nFrom 1000 through 1199: 5-kyu\n\nFrom 1200 through 1399: 4-kyu\n\nFrom 1400 through 1599: 3-kyu\n\nFrom 1600 through 1799: 2-kyu\n\nFrom 1800 through 1999: 1-kyu\n\nWhat kyu does M-kun have?\n\nConstraints\n\n400 \\leq X \\leq 1999\n\nX is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX\n\nOutput\n\nPrint the kyu M-kun has, as an integer.\nFor example, if he has 8-kyu, print 8.\n\nSample Input 1\n\n725\n\nSample Output 1\n\n7\n\nM-kun's highest rating is 725, which corresponds to 7-kyu.\n\nThus, 7 is the correct output.\n\nSample Input 2\n\n1600\n\nSample Output 2\n\n2\n\nM-kun's highest rating is 1600, which corresponds to 2-kyu.\n\nThus, 2 is the correct output.", "sample_input": "725\n"}, "reference_outputs": ["7\n"], "source_document_id": "p02600", "source_text": "Score: 100 points\n\nProblem Statement\n\nM-kun is a competitor in AtCoder, whose highest rating is X.\n\nIn this site, a competitor is given a kyu (class) according to his/her highest rating. For ratings from 400 through 1999, the following kyus are given:\n\nFrom 400 through 599: 8-kyu\n\nFrom 600 through 799: 7-kyu\n\nFrom 800 through 999: 6-kyu\n\nFrom 1000 through 1199: 5-kyu\n\nFrom 1200 through 1399: 4-kyu\n\nFrom 1400 through 1599: 3-kyu\n\nFrom 1600 through 1799: 2-kyu\n\nFrom 1800 through 1999: 1-kyu\n\nWhat kyu does M-kun have?\n\nConstraints\n\n400 \\leq X \\leq 1999\n\nX is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX\n\nOutput\n\nPrint the kyu M-kun has, as an integer.\nFor example, if he has 8-kyu, print 8.\n\nSample Input 1\n\n725\n\nSample Output 1\n\n7\n\nM-kun's highest rating is 725, which corresponds to 7-kyu.\n\nThus, 7 is the correct output.\n\nSample Input 2\n\n1600\n\nSample Output 2\n\n2\n\nM-kun's highest rating is 1600, which corresponds to 2-kyu.\n\nThus, 2 is the correct output.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 57, "cpu_time_ms": 3, "memory_kb": 1384}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s378076122", "group_id": "codeNet:p02600", "input_text": "program bt;\n\nvar x,a:integer;\n\nbegin\n readln(x);\n a := 0;\n if (x>=400) and (x<=599) then a:=8 else\n if (x>=600) and (x<=799) then a:=7 else\n if (x>=800) and (x<=999) then a:=6 else\n if (x>=1000) and (x<=1199) then a:=5 else\n if (x>=1200) and (x<=1399) then a:=4 else\n if (x>=1400) and (x<=1399) then a:=3 else\n if (x>=1600) and (x<=1799) then a:=2 else\n if (x>=1800) and (x<=1999) then a:=1;\n if (a>0) then write(a);\n readln;\nend.", "language": "Pascal", "metadata": {"date": 1595729107, "filename_ext": "pas", "original_language": "Pascal (FPC 3.0.4)", "problem_description_relpath": "problem_descriptions/p02600.html", "problem_id": "p02600", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02600/input.txt", "sample_output_relpath": "derived/input_output/data/p02600/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02600/Pascal/s378076122.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s378076122", "user_id": "u840460038"}, "prompt_components": {"gold_output": "7\n", "input_to_evaluate": "program bt;\n\nvar x,a:integer;\n\nbegin\n readln(x);\n a := 0;\n if (x>=400) and (x<=599) then a:=8 else\n if (x>=600) and (x<=799) then a:=7 else\n if (x>=800) and (x<=999) then a:=6 else\n if (x>=1000) and (x<=1199) then a:=5 else\n if (x>=1200) and (x<=1399) then a:=4 else\n if (x>=1400) and (x<=1399) then a:=3 else\n if (x>=1600) and (x<=1799) then a:=2 else\n if (x>=1800) and (x<=1999) then a:=1;\n if (a>0) then write(a);\n readln;\nend.", "problem_context": "Score: 100 points\n\nProblem Statement\n\nM-kun is a competitor in AtCoder, whose highest rating is X.\n\nIn this site, a competitor is given a kyu (class) according to his/her highest rating. For ratings from 400 through 1999, the following kyus are given:\n\nFrom 400 through 599: 8-kyu\n\nFrom 600 through 799: 7-kyu\n\nFrom 800 through 999: 6-kyu\n\nFrom 1000 through 1199: 5-kyu\n\nFrom 1200 through 1399: 4-kyu\n\nFrom 1400 through 1599: 3-kyu\n\nFrom 1600 through 1799: 2-kyu\n\nFrom 1800 through 1999: 1-kyu\n\nWhat kyu does M-kun have?\n\nConstraints\n\n400 \\leq X \\leq 1999\n\nX is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX\n\nOutput\n\nPrint the kyu M-kun has, as an integer.\nFor example, if he has 8-kyu, print 8.\n\nSample Input 1\n\n725\n\nSample Output 1\n\n7\n\nM-kun's highest rating is 725, which corresponds to 7-kyu.\n\nThus, 7 is the correct output.\n\nSample Input 2\n\n1600\n\nSample Output 2\n\n2\n\nM-kun's highest rating is 1600, which corresponds to 2-kyu.\n\nThus, 2 is the correct output.", "sample_input": "725\n"}, "reference_outputs": ["7\n"], "source_document_id": "p02600", "source_text": "Score: 100 points\n\nProblem Statement\n\nM-kun is a competitor in AtCoder, whose highest rating is X.\n\nIn this site, a competitor is given a kyu (class) according to his/her highest rating. For ratings from 400 through 1999, the following kyus are given:\n\nFrom 400 through 599: 8-kyu\n\nFrom 600 through 799: 7-kyu\n\nFrom 800 through 999: 6-kyu\n\nFrom 1000 through 1199: 5-kyu\n\nFrom 1200 through 1399: 4-kyu\n\nFrom 1400 through 1599: 3-kyu\n\nFrom 1600 through 1799: 2-kyu\n\nFrom 1800 through 1999: 1-kyu\n\nWhat kyu does M-kun have?\n\nConstraints\n\n400 \\leq X \\leq 1999\n\nX is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX\n\nOutput\n\nPrint the kyu M-kun has, as an integer.\nFor example, if he has 8-kyu, print 8.\n\nSample Input 1\n\n725\n\nSample Output 1\n\n7\n\nM-kun's highest rating is 725, which corresponds to 7-kyu.\n\nThus, 7 is the correct output.\n\nSample Input 2\n\n1600\n\nSample Output 2\n\n2\n\nM-kun's highest rating is 1600, which corresponds to 2-kyu.\n\nThus, 2 is the correct output.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 3, "memory_kb": 1384}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s733961941", "group_id": "codeNet:p02601", "input_text": "var\n\tA,B,C,K:Longint;\nbegin\n\tread(A,B,C,K);\n\twhile A>=B do begin\n\t\tdec(K);\n\t\tB:=B*2;\n\tend;\n\twhile B>=C do begin\n\t\tdec(K);\n\t\tC:=C*2;\n\tend;\n\tif K<0 then writeln('No')else writeln('Yes');\nend.", "language": "Pascal", "metadata": {"date": 1595733494, "filename_ext": "pas", "original_language": "Pascal (FPC 3.0.4)", "problem_description_relpath": "problem_descriptions/p02601.html", "problem_id": "p02601", "resource_group": "low_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/Pascal/s733961941.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s733961941", "user_id": "u657913472"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "var\n\tA,B,C,K:Longint;\nbegin\n\tread(A,B,C,K);\n\twhile A>=B do begin\n\t\tdec(K);\n\t\tB:=B*2;\n\tend;\n\twhile B>=C do begin\n\t\tdec(K);\n\t\tC:=C*2;\n\tend;\n\tif K<0 then writeln('No')else writeln('Yes');\nend.", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 5, "memory_kb": 1364}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s436407727", "group_id": "codeNet:p02601", "input_text": "var\n\tA,B,C,K:Longint;\nbegin\n\tread(A,B,C,K);\n\twhile A>=B do begin\n\t\tdec(K);\n\t\tB:=B*2;\n\tend;\n\twhile B>=C do begin\n\t\tdec(K);\n\t\tC:=C*2;\n\tend;\n\tif K<0 then writeln('No')else writeln('Yes');\nend.", "language": "Pascal", "metadata": {"date": 1595733073, "filename_ext": "pas", "original_language": "Pascal (FPC 3.0.4)", "problem_description_relpath": "problem_descriptions/p02601.html", "problem_id": "p02601", "resource_group": "low_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/Pascal/s436407727.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s436407727", "user_id": "u657913472"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "var\n\tA,B,C,K:Longint;\nbegin\n\tread(A,B,C,K);\n\twhile A>=B do begin\n\t\tdec(K);\n\t\tB:=B*2;\n\tend;\n\twhile B>=C do begin\n\t\tdec(K);\n\t\tC:=C*2;\n\tend;\n\tif K<0 then writeln('No')else writeln('Yes');\nend.", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 4, "memory_kb": 1388}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s876923634", "group_id": "codeNet:p02601", "input_text": "var\n\tA,B,C,K:Longint;\nbegin\n\tread(A,B,C,K);\n\twhile A>=B do begin\n\t\tdec(K);\n\t\tB:=B*2;\n\tend;\n\twhile B>=C do begin\n\t\tdec(K);\n\t\tC:=C*2;\n\tend;\n\tif K<0 then writeln('No')else writeln('Yes');\nend.", "language": "Pascal", "metadata": {"date": 1595732887, "filename_ext": "pas", "original_language": "Pascal (FPC 3.0.4)", "problem_description_relpath": "problem_descriptions/p02601.html", "problem_id": "p02601", "resource_group": "low_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/Pascal/s876923634.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s876923634", "user_id": "u657913472"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "var\n\tA,B,C,K:Longint;\nbegin\n\tread(A,B,C,K);\n\twhile A>=B do begin\n\t\tdec(K);\n\t\tB:=B*2;\n\tend;\n\twhile B>=C do begin\n\t\tdec(K);\n\t\tC:=C*2;\n\tend;\n\tif K<0 then writeln('No')else writeln('Yes');\nend.", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 5, "memory_kb": 1324}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s326171191", "group_id": "codeNet:p02601", "input_text": "var\n\tA,B,C,K:Longint;\nbegin\n\tread(A,B,C,K);\n\twhile A>=B do begin\n\t\tdec(K);\n\t\tB:=B*2;\n\tend;\n\twhile B>=C do begin\n\t\tdec(K);\n\t\tC:=C*2;\n\tend;\n\tif K<0 then writeln('No')else writeln('Yes');\nend.\n", "language": "Pascal", "metadata": {"date": 1595732743, "filename_ext": "pas", "original_language": "Pascal (FPC 3.0.4)", "problem_description_relpath": "problem_descriptions/p02601.html", "problem_id": "p02601", "resource_group": "low_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/Pascal/s326171191.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s326171191", "user_id": "u657913472"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "var\n\tA,B,C,K:Longint;\nbegin\n\tread(A,B,C,K);\n\twhile A>=B do begin\n\t\tdec(K);\n\t\tB:=B*2;\n\tend;\n\twhile B>=C do begin\n\t\tdec(K);\n\t\tC:=C*2;\n\tend;\n\tif K<0 then writeln('No')else writeln('Yes');\nend.\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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 1380}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s760479548", "group_id": "codeNet:p02602", "input_text": "program bt;\n\nvar n,k,i,j:longint;\n a,t :array[1..1000000] of int64;\n\nbegin\n readln(n,k);\n for i:=1 to n-1 do\n read(a[i]);\n readln(a[n]);\n for i:=1 to n-k+1 do\n begin\n t[i]:=0;\n for j:=1 to k do\n t[i]:=t[i]+a[i+j-1];\n end;\n for i:=2 to n-k+1 do\n if (t[i]>t[i-1]) then writeln('Yes') else writeln('No');\n readln;\nend.", "language": "Pascal", "metadata": {"date": 1595730448, "filename_ext": "pas", "original_language": "Pascal (FPC 3.0.4)", "problem_description_relpath": "problem_descriptions/p02602.html", "problem_id": "p02602", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02602/input.txt", "sample_output_relpath": "derived/input_output/data/p02602/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02602/Pascal/s760479548.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s760479548", "user_id": "u824872487"}, "prompt_components": {"gold_output": "Yes\nNo\n", "input_to_evaluate": "program bt;\n\nvar n,k,i,j:longint;\n a,t :array[1..1000000] of int64;\n\nbegin\n readln(n,k);\n for i:=1 to n-1 do\n read(a[i]);\n readln(a[n]);\n for i:=1 to n-k+1 do\n begin\n t[i]:=0;\n for j:=1 to k do\n t[i]:=t[i]+a[i+j-1];\n end;\n for i:=2 to n-k+1 do\n if (t[i]>t[i-1]) then writeln('Yes') else writeln('No');\n readln;\nend.", "problem_context": "Score: 300 points\n\nProblem Statement\n\nM-kun is a student in Aoki High School, where a year is divided into N terms.\n\nThere is an exam at the end of each term. According to the scores in those exams, a student is given a grade for each term, as follows:\n\nFor the first through (K-1)-th terms: not given.\n\nFor each of the K-th through N-th terms: the multiplication of the scores in the last K exams, including the exam in the graded term.\n\nM-kun scored A_i in the exam at the end of the i-th term.\n\nFor each i such that K+1 \\leq i \\leq N, determine whether his grade for the i-th term is strictly greater than the grade for the (i-1)-th term.\n\nConstraints\n\n2 \\leq N \\leq 200000\n\n1 \\leq K \\leq N-1\n\n1 \\leq A_i \\leq 10^{9}\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nA_1 A_2 A_3 \\ldots A_N\n\nOutput\n\nPrint the answer in N-K lines.\n\nThe i-th line should contain Yes if the grade for the (K+i)-th term is greater than the grade for the (K+i-1)-th term, and No otherwise.\n\nSample Input 1\n\n5 3\n96 98 95 100 20\n\nSample Output 1\n\nYes\nNo\n\nHis grade for each term is computed as follows:\n\n3-rd term: (96 \\times 98 \\times 95) = 893760\n\n4-th term: (98 \\times 95 \\times 100) = 931000\n\n5-th term: (95 \\times 100 \\times 20) = 190000\n\nSample Input 2\n\n3 2\n1001 869120 1001\n\nSample Output 2\n\nNo\n\nNote that the output should be No if the grade for the 3-rd term is equal to the grade for the 2-nd term.\n\nSample Input 3\n\n15 7\n3 1 4 1 5 9 2 6 5 3 5 8 9 7 9\n\nSample Output 3\n\nYes\nYes\nNo\nYes\nYes\nNo\nYes\nYes", "sample_input": "5 3\n96 98 95 100 20\n"}, "reference_outputs": ["Yes\nNo\n"], "source_document_id": "p02602", "source_text": "Score: 300 points\n\nProblem Statement\n\nM-kun is a student in Aoki High School, where a year is divided into N terms.\n\nThere is an exam at the end of each term. According to the scores in those exams, a student is given a grade for each term, as follows:\n\nFor the first through (K-1)-th terms: not given.\n\nFor each of the K-th through N-th terms: the multiplication of the scores in the last K exams, including the exam in the graded term.\n\nM-kun scored A_i in the exam at the end of the i-th term.\n\nFor each i such that K+1 \\leq i \\leq N, determine whether his grade for the i-th term is strictly greater than the grade for the (i-1)-th term.\n\nConstraints\n\n2 \\leq N \\leq 200000\n\n1 \\leq K \\leq N-1\n\n1 \\leq A_i \\leq 10^{9}\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nA_1 A_2 A_3 \\ldots A_N\n\nOutput\n\nPrint the answer in N-K lines.\n\nThe i-th line should contain Yes if the grade for the (K+i)-th term is greater than the grade for the (K+i-1)-th term, and No otherwise.\n\nSample Input 1\n\n5 3\n96 98 95 100 20\n\nSample Output 1\n\nYes\nNo\n\nHis grade for each term is computed as follows:\n\n3-rd term: (96 \\times 98 \\times 95) = 893760\n\n4-th term: (98 \\times 95 \\times 100) = 931000\n\n5-th term: (95 \\times 100 \\times 20) = 190000\n\nSample Input 2\n\n3 2\n1001 869120 1001\n\nSample Output 2\n\nNo\n\nNote that the output should be No if the grade for the 3-rd term is equal to the grade for the 2-nd term.\n\nSample Input 3\n\n15 7\n3 1 4 1 5 9 2 6 5 3 5 8 9 7 9\n\nSample Output 3\n\nYes\nYes\nNo\nYes\nYes\nNo\nYes\nYes", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 2205, "memory_kb": 4036}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s159070942", "group_id": "codeNet:p02603", "input_text": "var\n\tN,i:Longint;\n\tp,A,T:int64;\nbegin\n\tread(N,p);\n\tT:=1000;\n\tfor i:=2 to N do begin\n\t\tread(A);\n\t\tif p t[i] then\n mismatch += 1;\n end;\n writeln(mismatch);\nend.", "language": "Pascal", "metadata": {"date": 1597984116, "filename_ext": "pas", "original_language": "Pascal (FPC 3.0.4)", "problem_description_relpath": "problem_descriptions/p02622.html", "problem_id": "p02622", "resource_group": "low_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/Pascal/s376239916.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s376239916", "user_id": "u583992857"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "program minorchange;\nvar\n s, t : ansistring;\n i, mismatch : longint;\nbegin\n readln(s);\n readln(t);\n mismatch := 0;\n for i := 1 to length(s) do begin\n if s[i] <> t[i] then\n mismatch += 1;\n end;\n writeln(mismatch);\nend.", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 11, "memory_kb": 1384}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s868649262", "group_id": "codeNet:p02622", "input_text": "program main;\nvar i, n : longint;\n s, t : string;\n\nbegin\n readln(s);\n readln(t);\n n := 0;\n for i := 1 to length(s) do \n if s[i] <> t[i] then \n inc(n);\n writeln(n);\nend.", "language": "Pascal", "metadata": {"date": 1596439172, "filename_ext": "pas", "original_language": "Pascal (FPC 3.0.4)", "problem_description_relpath": "problem_descriptions/p02622.html", "problem_id": "p02622", "resource_group": "low_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/Pascal/s868649262.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s868649262", "user_id": "u122156580"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "program main;\nvar i, n : longint;\n s, t : string;\n\nbegin\n readln(s);\n readln(t);\n n := 0;\n for i := 1 to length(s) do \n if s[i] <> t[i] then \n inc(n);\n writeln(n);\nend.", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 9, "memory_kb": 1376}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s865620200", "group_id": "codeNet:p02626", "input_text": "var\n n : integer;\n a, b, x, val, y, z, k, res: int64;\n label ending;\n\nbegin\n read(n);\n read(a, b);\n n := n - 2;\n while n <> 0 do begin\n n := n - 1;\n read(val);\n x := x xor val;\n end;\n y := a + b - x;\n z := y shr 1;\n if (y < 0) or ((y and 1) <> 0) or ((x and z) <> 0) or (a < z) then\n begin\n writeln('-1');\n goto ending;\n end;\n res := z;\n k := 1 shl 40; \n while k <> 0 do begin\n if (x and k) <> 0 then begin\n if (res or k) <= a then begin\n res := res or k;\n end;\n end;\n k := k shr 1;\n end;\n if res = 0 then writeln('-1') else writeln(a - res);\n ending:\nend.", "language": "Pascal", "metadata": {"date": 1593391146, "filename_ext": "pas", "original_language": "Pascal (FPC 3.0.4)", "problem_description_relpath": "problem_descriptions/p02626.html", "problem_id": "p02626", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02626/input.txt", "sample_output_relpath": "derived/input_output/data/p02626/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02626/Pascal/s865620200.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s865620200", "user_id": "u394853232"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "var\n n : integer;\n a, b, x, val, y, z, k, res: int64;\n label ending;\n\nbegin\n read(n);\n read(a, b);\n n := n - 2;\n while n <> 0 do begin\n n := n - 1;\n read(val);\n x := x xor val;\n end;\n y := a + b - x;\n z := y shr 1;\n if (y < 0) or ((y and 1) <> 0) or ((x and z) <> 0) or (a < z) then\n begin\n writeln('-1');\n goto ending;\n end;\n res := z;\n k := 1 shl 40; \n while k <> 0 do begin\n if (x and k) <> 0 then begin\n if (res or k) <= a then begin\n res := res or k;\n end;\n end;\n k := k shr 1;\n end;\n if res = 0 then writeln('-1') else writeln(a - res);\n ending:\nend.", "problem_context": "Score : 600 points\n\nProblem Statement\n\nThere are N piles of stones. The i-th pile has A_i stones.\n\nAoki and Takahashi are about to use them to play the following game:\n\nStarting with Aoki, the two players alternately do the following operation:\n\nOperation: Choose one pile of stones, and remove one or more stones from it.\n\nWhen a player is unable to do the operation, he loses, and the other player wins.\n\nWhen the two players play optimally, there are two possibilities in this game: the player who moves first always wins, or the player who moves second always wins, only depending on the initial number of stones in each pile.\n\nIn such a situation, Takahashi, the second player to act, is trying to guarantee his win by moving at least zero and at most (A_1 - 1) stones from the 1-st pile to the 2-nd pile before the game begins.\n\nIf this is possible, print the minimum number of stones to move to guarantee his victory; otherwise, print -1 instead.\n\nConstraints\n\n2 \\leq N \\leq 300\n\n1 \\leq A_i \\leq 10^{12}\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 number of stones to move to guarantee Takahashi's win; otherwise, print -1 instead.\n\nSample Input 1\n\n2\n5 3\n\nSample Output 1\n\n1\n\nWithout moving stones, if Aoki first removes 2 stones from the 1-st pile, Takahashi cannot win in any way.\n\nIf Takahashi moves 1 stone from the 1-st pile to the 2-nd before the game begins so that both piles have 4 stones, Takahashi can always win by properly choosing his actions.\n\nSample Input 2\n\n2\n3 5\n\nSample Output 2\n\n-1\n\nIt is not allowed to move stones from the 2-nd pile to the 1-st.\n\nSample Input 3\n\n3\n1 1 2\n\nSample Output 3\n\n-1\n\nIt is not allowed to move all stones from the 1-st pile.\n\nSample Input 4\n\n8\n10 9 8 7 6 5 4 3\n\nSample Output 4\n\n3\n\nSample Input 5\n\n3\n4294967297 8589934593 12884901890\n\nSample Output 5\n\n1\n\nWatch out for overflows.", "sample_input": "2\n5 3\n"}, "reference_outputs": ["1\n"], "source_document_id": "p02626", "source_text": "Score : 600 points\n\nProblem Statement\n\nThere are N piles of stones. The i-th pile has A_i stones.\n\nAoki and Takahashi are about to use them to play the following game:\n\nStarting with Aoki, the two players alternately do the following operation:\n\nOperation: Choose one pile of stones, and remove one or more stones from it.\n\nWhen a player is unable to do the operation, he loses, and the other player wins.\n\nWhen the two players play optimally, there are two possibilities in this game: the player who moves first always wins, or the player who moves second always wins, only depending on the initial number of stones in each pile.\n\nIn such a situation, Takahashi, the second player to act, is trying to guarantee his win by moving at least zero and at most (A_1 - 1) stones from the 1-st pile to the 2-nd pile before the game begins.\n\nIf this is possible, print the minimum number of stones to move to guarantee his victory; otherwise, print -1 instead.\n\nConstraints\n\n2 \\leq N \\leq 300\n\n1 \\leq A_i \\leq 10^{12}\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 number of stones to move to guarantee Takahashi's win; otherwise, print -1 instead.\n\nSample Input 1\n\n2\n5 3\n\nSample Output 1\n\n1\n\nWithout moving stones, if Aoki first removes 2 stones from the 1-st pile, Takahashi cannot win in any way.\n\nIf Takahashi moves 1 stone from the 1-st pile to the 2-nd before the game begins so that both piles have 4 stones, Takahashi can always win by properly choosing his actions.\n\nSample Input 2\n\n2\n3 5\n\nSample Output 2\n\n-1\n\nIt is not allowed to move stones from the 2-nd pile to the 1-st.\n\nSample Input 3\n\n3\n1 1 2\n\nSample Output 3\n\n-1\n\nIt is not allowed to move all stones from the 1-st pile.\n\nSample Input 4\n\n8\n10 9 8 7 6 5 4 3\n\nSample Output 4\n\n3\n\nSample Input 5\n\n3\n4294967297 8589934593 12884901890\n\nSample Output 5\n\n1\n\nWatch out for overflows.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 728, "cpu_time_ms": 6, "memory_kb": 1380}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s271067070", "group_id": "codeNet:p02626", "input_text": "var\n n : integer;\n a, b, x, val, y, z, k, res: int64;\n label ending;\n\nbegin\n read(n);\n read(a, b);\n n := n - 2;\n while n <> 0 do begin\n n := n - 1;\n read(val);\n x := x xor val;\n end;\n y := a + b - x;\n z := y shr 1;\n if (y < 0) or ((y and 1) <> 0) or ((x and z) <> 0) or (a < z) then\n begin\n writeln('-1');\n goto ending;\n end;\n res := z;\n k := 1 shl 40; \n while k <> 0 do begin\n if (x and k) <> 0 then begin\n if (res or k) <= a then begin\n res := res or k;\n end;\n end;\n k := k shr 1;\n end;\n if res = a then writeln('-1') else writeln(a - res);\n ending:\nend.", "language": "Pascal", "metadata": {"date": 1593391010, "filename_ext": "pas", "original_language": "Pascal (FPC 3.0.4)", "problem_description_relpath": "problem_descriptions/p02626.html", "problem_id": "p02626", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02626/input.txt", "sample_output_relpath": "derived/input_output/data/p02626/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02626/Pascal/s271067070.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s271067070", "user_id": "u394853232"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "var\n n : integer;\n a, b, x, val, y, z, k, res: int64;\n label ending;\n\nbegin\n read(n);\n read(a, b);\n n := n - 2;\n while n <> 0 do begin\n n := n - 1;\n read(val);\n x := x xor val;\n end;\n y := a + b - x;\n z := y shr 1;\n if (y < 0) or ((y and 1) <> 0) or ((x and z) <> 0) or (a < z) then\n begin\n writeln('-1');\n goto ending;\n end;\n res := z;\n k := 1 shl 40; \n while k <> 0 do begin\n if (x and k) <> 0 then begin\n if (res or k) <= a then begin\n res := res or k;\n end;\n end;\n k := k shr 1;\n end;\n if res = a then writeln('-1') else writeln(a - res);\n ending:\nend.", "problem_context": "Score : 600 points\n\nProblem Statement\n\nThere are N piles of stones. The i-th pile has A_i stones.\n\nAoki and Takahashi are about to use them to play the following game:\n\nStarting with Aoki, the two players alternately do the following operation:\n\nOperation: Choose one pile of stones, and remove one or more stones from it.\n\nWhen a player is unable to do the operation, he loses, and the other player wins.\n\nWhen the two players play optimally, there are two possibilities in this game: the player who moves first always wins, or the player who moves second always wins, only depending on the initial number of stones in each pile.\n\nIn such a situation, Takahashi, the second player to act, is trying to guarantee his win by moving at least zero and at most (A_1 - 1) stones from the 1-st pile to the 2-nd pile before the game begins.\n\nIf this is possible, print the minimum number of stones to move to guarantee his victory; otherwise, print -1 instead.\n\nConstraints\n\n2 \\leq N \\leq 300\n\n1 \\leq A_i \\leq 10^{12}\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 number of stones to move to guarantee Takahashi's win; otherwise, print -1 instead.\n\nSample Input 1\n\n2\n5 3\n\nSample Output 1\n\n1\n\nWithout moving stones, if Aoki first removes 2 stones from the 1-st pile, Takahashi cannot win in any way.\n\nIf Takahashi moves 1 stone from the 1-st pile to the 2-nd before the game begins so that both piles have 4 stones, Takahashi can always win by properly choosing his actions.\n\nSample Input 2\n\n2\n3 5\n\nSample Output 2\n\n-1\n\nIt is not allowed to move stones from the 2-nd pile to the 1-st.\n\nSample Input 3\n\n3\n1 1 2\n\nSample Output 3\n\n-1\n\nIt is not allowed to move all stones from the 1-st pile.\n\nSample Input 4\n\n8\n10 9 8 7 6 5 4 3\n\nSample Output 4\n\n3\n\nSample Input 5\n\n3\n4294967297 8589934593 12884901890\n\nSample Output 5\n\n1\n\nWatch out for overflows.", "sample_input": "2\n5 3\n"}, "reference_outputs": ["1\n"], "source_document_id": "p02626", "source_text": "Score : 600 points\n\nProblem Statement\n\nThere are N piles of stones. The i-th pile has A_i stones.\n\nAoki and Takahashi are about to use them to play the following game:\n\nStarting with Aoki, the two players alternately do the following operation:\n\nOperation: Choose one pile of stones, and remove one or more stones from it.\n\nWhen a player is unable to do the operation, he loses, and the other player wins.\n\nWhen the two players play optimally, there are two possibilities in this game: the player who moves first always wins, or the player who moves second always wins, only depending on the initial number of stones in each pile.\n\nIn such a situation, Takahashi, the second player to act, is trying to guarantee his win by moving at least zero and at most (A_1 - 1) stones from the 1-st pile to the 2-nd pile before the game begins.\n\nIf this is possible, print the minimum number of stones to move to guarantee his victory; otherwise, print -1 instead.\n\nConstraints\n\n2 \\leq N \\leq 300\n\n1 \\leq A_i \\leq 10^{12}\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 number of stones to move to guarantee Takahashi's win; otherwise, print -1 instead.\n\nSample Input 1\n\n2\n5 3\n\nSample Output 1\n\n1\n\nWithout moving stones, if Aoki first removes 2 stones from the 1-st pile, Takahashi cannot win in any way.\n\nIf Takahashi moves 1 stone from the 1-st pile to the 2-nd before the game begins so that both piles have 4 stones, Takahashi can always win by properly choosing his actions.\n\nSample Input 2\n\n2\n3 5\n\nSample Output 2\n\n-1\n\nIt is not allowed to move stones from the 2-nd pile to the 1-st.\n\nSample Input 3\n\n3\n1 1 2\n\nSample Output 3\n\n-1\n\nIt is not allowed to move all stones from the 1-st pile.\n\nSample Input 4\n\n8\n10 9 8 7 6 5 4 3\n\nSample Output 4\n\n3\n\nSample Input 5\n\n3\n4294967297 8589934593 12884901890\n\nSample Output 5\n\n1\n\nWatch out for overflows.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 728, "cpu_time_ms": 7, "memory_kb": 1376}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s542235581", "group_id": "codeNet:p02627", "input_text": "program hi;\nvar c: char;\n\nbegin\n readln(c);\n if (ord(c)<= 90) then\n writeln('A')\n else\n writeln('a');\nend.", "language": "Pascal", "metadata": {"date": 1596467818, "filename_ext": "pas", "original_language": "Pascal (FPC 3.0.4)", "problem_description_relpath": "problem_descriptions/p02627.html", "problem_id": "p02627", "resource_group": "low_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/Pascal/s542235581.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s542235581", "user_id": "u051422473"}, "prompt_components": {"gold_output": "A\n", "input_to_evaluate": "program hi;\nvar c: char;\n\nbegin\n readln(c);\n if (ord(c)<= 90) then\n writeln('A')\n else\n writeln('a');\nend.", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 3, "memory_kb": 1372}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s167801448", "group_id": "codeNet:p02627", "input_text": "program main;\nvar\n a : char;\n\nbegin\n readln(a);\n\n if (ord(a) >= ord('a')) then \n writeln('a')\n else\n writeln('A');\nend.", "language": "Pascal", "metadata": {"date": 1595389868, "filename_ext": "pas", "original_language": "Pascal (FPC 3.0.4)", "problem_description_relpath": "problem_descriptions/p02627.html", "problem_id": "p02627", "resource_group": "low_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/Pascal/s167801448.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s167801448", "user_id": "u151858600"}, "prompt_components": {"gold_output": "A\n", "input_to_evaluate": "program main;\nvar\n a : char;\n\nbegin\n readln(a);\n\n if (ord(a) >= ord('a')) then \n writeln('a')\n else\n writeln('A');\nend.", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 5, "memory_kb": 1312}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s909296066", "group_id": "codeNet:p02628", "input_text": "program mixjuice;\nvar\n cheapest : array[1..1000] of longint;\n current, n, k, i, j, total : longint;\nbegin\n read(n, k);\n readln;\n for i := 1 to k do\n cheapest[i] := 1000;\n total := 0;\n\n for i := 1 to n do begin\n read(current);\n for j := 1 to i do begin\n if current < cheapest[j] then begin\n cheapest[j] := current;\n break;\n end;\n end;\n end;\n\n for i := 1 to k do\n total += cheapest[i];\n writeln(total);\nend.", "language": "Pascal", "metadata": {"date": 1597978003, "filename_ext": "pas", "original_language": "Pascal (FPC 3.0.4)", "problem_description_relpath": "problem_descriptions/p02628.html", "problem_id": "p02628", "resource_group": "low_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/Pascal/s909296066.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s909296066", "user_id": "u583992857"}, "prompt_components": {"gold_output": "210\n", "input_to_evaluate": "program mixjuice;\nvar\n cheapest : array[1..1000] of longint;\n current, n, k, i, j, total : longint;\nbegin\n read(n, k);\n readln;\n for i := 1 to k do\n cheapest[i] := 1000;\n total := 0;\n\n for i := 1 to n do begin\n read(current);\n for j := 1 to i do begin\n if current < cheapest[j] then begin\n cheapest[j] := current;\n break;\n end;\n end;\n end;\n\n for i := 1 to k do\n total += cheapest[i];\n writeln(total);\nend.", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 5, "memory_kb": 1308}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s487713463", "group_id": "codeNet:p02628", "input_text": "program mixjuice;\nvar\n cheapest : array[1..1000] of longint;\n current, n, k, i, j, total : longint;\nbegin\n read(n, k);\n readln;\n for i := 1 to k do\n cheapest[i] := 1000;\n total := 0;\n\n for i := 1 to n do begin\n read(current);\n for j := 1 to i do begin\n if current < cheapest[j] then begin\n cheapest[j] := current;\n break;\n end;\n end;\n end;\n\n for i := 1 to k do\n total += cheapest[i];\n writeln(cheapest[i], ' ', total);\n writeln(total);\nend.", "language": "Pascal", "metadata": {"date": 1597977961, "filename_ext": "pas", "original_language": "Pascal (FPC 3.0.4)", "problem_description_relpath": "problem_descriptions/p02628.html", "problem_id": "p02628", "resource_group": "low_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/Pascal/s487713463.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s487713463", "user_id": "u583992857"}, "prompt_components": {"gold_output": "210\n", "input_to_evaluate": "program mixjuice;\nvar\n cheapest : array[1..1000] of longint;\n current, n, k, i, j, total : longint;\nbegin\n read(n, k);\n readln;\n for i := 1 to k do\n cheapest[i] := 1000;\n total := 0;\n\n for i := 1 to n do begin\n read(current);\n for j := 1 to i do begin\n if current < cheapest[j] then begin\n cheapest[j] := current;\n break;\n end;\n end;\n end;\n\n for i := 1 to k do\n total += cheapest[i];\n writeln(cheapest[i], ' ', total);\n writeln(total);\nend.", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 564, "cpu_time_ms": 5, "memory_kb": 1380}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s514366009", "group_id": "codeNet:p02628", "input_text": "program main;\nvar\n n, k, sum, i: integer;\n a : array[1..1000] of integer;\n\n\nprocedure qs (l, r : integer);\nvar\n p, i, j, temp : integer;\nbegin\n if (l < r) then begin \n p := a[l]; i := l; j := r;\n \n while (i < j) do begin\n while (a[j] >= p) do\n j := j - 1;\n while (a[i] < p) do\n i := i + 1;\n \n if (i < j) then begin\n temp := a[i];\n a[i] := a[j];\n a[j] := temp;\n end;\n end;\n\n qs(l, i - 1);\n qs(i + 1, r);\n end;\nend;\n\n\nbegin\n readln(n, k);\n\n for i := 1 to n do \n read(a[i]);\n\n qs(1, n);\n\n sum := 0;\n for i := 1 to k do\n sum := sum + a[i];\n \n\n writeln(sum);\nend.", "language": "Pascal", "metadata": {"date": 1595393834, "filename_ext": "pas", "original_language": "Pascal (FPC 3.0.4)", "problem_description_relpath": "problem_descriptions/p02628.html", "problem_id": "p02628", "resource_group": "low_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/Pascal/s514366009.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s514366009", "user_id": "u151858600"}, "prompt_components": {"gold_output": "210\n", "input_to_evaluate": "program main;\nvar\n n, k, sum, i: integer;\n a : array[1..1000] of integer;\n\n\nprocedure qs (l, r : integer);\nvar\n p, i, j, temp : integer;\nbegin\n if (l < r) then begin \n p := a[l]; i := l; j := r;\n \n while (i < j) do begin\n while (a[j] >= p) do\n j := j - 1;\n while (a[i] < p) do\n i := i + 1;\n \n if (i < j) then begin\n temp := a[i];\n a[i] := a[j];\n a[j] := temp;\n end;\n end;\n\n qs(l, i - 1);\n qs(i + 1, r);\n end;\nend;\n\n\nbegin\n readln(n, k);\n\n for i := 1 to n do \n read(a[i]);\n\n qs(1, n);\n\n sum := 0;\n for i := 1 to k do\n sum := sum + a[i];\n \n\n writeln(sum);\nend.", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 783, "cpu_time_ms": 5, "memory_kb": 1324}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s787437485", "group_id": "codeNet:p02629", "input_text": "var\n\tN,T:int64;\nbegin\n\tread(N);\n\tdec(N);\n\tT:=26;\n\twhile N>=T do begin\n\t\tdec(N,T);\n\t\tT:=T*26;\n\tend;\n\twhile T>1 do begin\n\t\tT:=T div 26;\n\t\twrite(Chr(N div T+97));\n\t\tN:=N mod T;\n\tend;\nend.", "language": "Pascal", "metadata": {"date": 1592792048, "filename_ext": "pas", "original_language": "Pascal (FPC 3.0.4)", "problem_description_relpath": "problem_descriptions/p02629.html", "problem_id": "p02629", "resource_group": "low_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/Pascal/s787437485.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s787437485", "user_id": "u657913472"}, "prompt_components": {"gold_output": "b\n", "input_to_evaluate": "var\n\tN,T:int64;\nbegin\n\tread(N);\n\tdec(N);\n\tT:=26;\n\twhile N>=T do begin\n\t\tdec(N,T);\n\t\tT:=T*26;\n\tend;\n\twhile T>1 do begin\n\t\tT:=T div 26;\n\t\twrite(Chr(N div T+97));\n\t\tN:=N mod T;\n\tend;\nend.", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 3, "memory_kb": 1388}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s035219251", "group_id": "codeNet:p02631", "input_text": "var\n\tn,b,i:int64;\n a:Array[1..200000] of int64;\nbegin\n\tread(n);\n for i:=1 to n do begin\n \tread(a[i]);\n end;\n for i:=1 to n do begin\n b:=b xor a[i];\n end;\n for i:=1 to n do begin\n \twriteln(b xor a[i]);\n end;\nend.", "language": "Pascal", "metadata": {"date": 1593435906, "filename_ext": "pas", "original_language": "Pascal (FPC 3.0.4)", "problem_description_relpath": "problem_descriptions/p02631.html", "problem_id": "p02631", "resource_group": "low_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/Pascal/s035219251.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s035219251", "user_id": "u989345508"}, "prompt_components": {"gold_output": "26 5 7 22\n", "input_to_evaluate": "var\n\tn,b,i:int64;\n a:Array[1..200000] of int64;\nbegin\n\tread(n);\n for i:=1 to n do begin\n \tread(a[i]);\n end;\n for i:=1 to n do begin\n b:=b xor a[i];\n end;\n for i:=1 to n do begin\n \twriteln(b xor a[i]);\n end;\nend.", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 62, "memory_kb": 3884}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s641715120", "group_id": "codeNet:p02639", "input_text": "program main;\nvar a : array[1..5] of integer;\n i : integer;\nbegin \n for i := 1 to 5 do begin \n read(a[i]);\n end;\n if (a[i] = 0) then writeln(i);\nend.", "language": "Pascal", "metadata": {"date": 1598114713, "filename_ext": "pas", "original_language": "Pascal (FPC 3.0.4)", "problem_description_relpath": "problem_descriptions/p02639.html", "problem_id": "p02639", "resource_group": "low_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/Pascal/s641715120.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s641715120", "user_id": "u289438802"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "program main;\nvar a : array[1..5] of integer;\n i : integer;\nbegin \n for i := 1 to 5 do begin \n read(a[i]);\n end;\n if (a[i] = 0) then writeln(i);\nend.", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 4, "memory_kb": 1376}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s820212883", "group_id": "codeNet:p02639", "input_text": "program fivevar;\nvar\n i, x : longint;\nbegin\n for i := 1 to 5 do begin\n read(x);\n if x = 0 then\n break;\n end;\n writeln(i);\nend.", "language": "Pascal", "metadata": {"date": 1597972514, "filename_ext": "pas", "original_language": "Pascal (FPC 3.0.4)", "problem_description_relpath": "problem_descriptions/p02639.html", "problem_id": "p02639", "resource_group": "low_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/Pascal/s820212883.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s820212883", "user_id": "u583992857"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "program fivevar;\nvar\n i, x : longint;\nbegin\n for i := 1 to 5 do begin\n read(x);\n if x = 0 then\n break;\n end;\n writeln(i);\nend.", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 1320}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s326353811", "group_id": "codeNet:p02639", "input_text": "program main;\nvar i, t : integer;\n n : array [1..5] of integer;\n\n\nbegin\n for i := 1 to 5 do read(n[i]);\n readln;\n t := 0;\n for i := 1 to 5 do\n if n[i] = 0 then \n t := i;\n writeln(t);\nend.", "language": "Pascal", "metadata": {"date": 1596437848, "filename_ext": "pas", "original_language": "Pascal (FPC 3.0.4)", "problem_description_relpath": "problem_descriptions/p02639.html", "problem_id": "p02639", "resource_group": "low_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/Pascal/s326353811.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s326353811", "user_id": "u122156580"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "program main;\nvar i, t : integer;\n n : array [1..5] of integer;\n\n\nbegin\n for i := 1 to 5 do read(n[i]);\n readln;\n t := 0;\n for i := 1 to 5 do\n if n[i] = 0 then \n t := i;\n writeln(t);\nend.", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 3, "memory_kb": 1244}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s472162754", "group_id": "codeNet:p02640", "input_text": "program ct;\nvar\n i, x, y : longint;\nbegin\n read(x, y);\n readln;\n if y mod 2 = 0 then begin\n if (y >= (x * 2)) and (y <= (x * 4)) then begin\n for i := 1 to x do begin\n if y - 4 >= 0 then\n y -= 4\n else if y - 2 >= 0 then\n y -= 2\n end;\n if y = 0 then \n writeln('Yes')\n \n else \n writeln('No')\n end\n else\n writeln('No')\n end\n else\n writeln('No');\nend.", "language": "Pascal", "metadata": {"date": 1597975792, "filename_ext": "pas", "original_language": "Pascal (FPC 3.0.4)", "problem_description_relpath": "problem_descriptions/p02640.html", "problem_id": "p02640", "resource_group": "low_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/Pascal/s472162754.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s472162754", "user_id": "u583992857"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "program ct;\nvar\n i, x, y : longint;\nbegin\n read(x, y);\n readln;\n if y mod 2 = 0 then begin\n if (y >= (x * 2)) and (y <= (x * 4)) then begin\n for i := 1 to x do begin\n if y - 4 >= 0 then\n y -= 4\n else if y - 2 >= 0 then\n y -= 2\n end;\n if y = 0 then \n writeln('Yes')\n \n else \n writeln('No')\n end\n else\n writeln('No')\n end\n else\n writeln('No');\nend.", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 3, "memory_kb": 1376}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s249194806", "group_id": "codeNet:p02640", "input_text": "program ct;\nvar\n i, x, y : longint;\nbegin\n read(x, y);\n readln;\n if y mod 2 = 0 then begin\n if (y > (x * 2)) and (y < (x * 4)) then begin\n for i := 1 to x do begin\n if y - 4 >= 0 then\n y -= 4\n else if y - 2 >= 0 then\n y -= 2\n end;\n if y = 0 then \n writeln('Yes')\n \n else \n writeln('No')\n end\n else\n writeln('No')\n end\n else\n writeln('No');\nend.", "language": "Pascal", "metadata": {"date": 1597975709, "filename_ext": "pas", "original_language": "Pascal (FPC 3.0.4)", "problem_description_relpath": "problem_descriptions/p02640.html", "problem_id": "p02640", "resource_group": "low_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/Pascal/s249194806.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s249194806", "user_id": "u583992857"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "program ct;\nvar\n i, x, y : longint;\nbegin\n read(x, y);\n readln;\n if y mod 2 = 0 then begin\n if (y > (x * 2)) and (y < (x * 4)) then begin\n for i := 1 to x do begin\n if y - 4 >= 0 then\n y -= 4\n else if y - 2 >= 0 then\n y -= 2\n end;\n if y = 0 then \n writeln('Yes')\n \n else \n writeln('No')\n end\n else\n writeln('No')\n end\n else\n writeln('No');\nend.", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 558, "cpu_time_ms": 3, "memory_kb": 1376}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s274822265", "group_id": "codeNet:p02640", "input_text": "var\n x,y:longint;\nbegin\n readln(x,y);\n if odd(x*4-y) then begin writeln('No');exit;end;\n if x*4-y<0 then begin writeln('No');exit;end;\n if odd(y-x*2) then begin writeln('No');exit;end;\n if y-x*2<0 then begin writeln('No');exit;end;\n writeln('Yes');\nend.", "language": "Pascal", "metadata": {"date": 1592350021, "filename_ext": "pas", "original_language": "Pascal (FPC 3.0.4)", "problem_description_relpath": "problem_descriptions/p02640.html", "problem_id": "p02640", "resource_group": "low_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/Pascal/s274822265.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s274822265", "user_id": "u481028033"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "var\n x,y:longint;\nbegin\n readln(x,y);\n if odd(x*4-y) then begin writeln('No');exit;end;\n if x*4-y<0 then begin writeln('No');exit;end;\n if odd(y-x*2) then begin writeln('No');exit;end;\n if y-x*2<0 then begin writeln('No');exit;end;\n writeln('Yes');\nend.", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 4, "memory_kb": 1376}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s418681725", "group_id": "codeNet:p02645", "input_text": "var s:string;begin readln(s);writeln(s[1..3]);end.\n", "language": "Pascal", "metadata": {"date": 1597614601, "filename_ext": "pas", "original_language": "Pascal (FPC 3.0.4)", "problem_description_relpath": "problem_descriptions/p02645.html", "problem_id": "p02645", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02645/input.txt", "sample_output_relpath": "derived/input_output/data/p02645/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02645/Pascal/s418681725.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s418681725", "user_id": "u984276646"}, "prompt_components": {"gold_output": "tak\n", "input_to_evaluate": "var s:string;begin readln(s);writeln(s[1..3]);end.\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nWhen you asked some guy in your class his name, he called himself S, where S is a string of length between 3 and 20 (inclusive) consisting of lowercase English letters.\nYou have decided to choose some three consecutive characters from S and make it his nickname. Print a string that is a valid nickname for him.\n\nConstraints\n\n3 \\leq |S| \\leq 20\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 your answer.\n\nSample Input 1\n\ntakahashi\n\nSample Output 1\n\ntak\n\nSample Input 2\n\nnaohiro\n\nSample Output 2\n\nnao", "sample_input": "takahashi\n"}, "reference_outputs": ["tak\n"], "source_document_id": "p02645", "source_text": "Score : 100 points\n\nProblem Statement\n\nWhen you asked some guy in your class his name, he called himself S, where S is a string of length between 3 and 20 (inclusive) consisting of lowercase English letters.\nYou have decided to choose some three consecutive characters from S and make it his nickname. Print a string that is a valid nickname for him.\n\nConstraints\n\n3 \\leq |S| \\leq 20\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 your answer.\n\nSample Input 1\n\ntakahashi\n\nSample Output 1\n\ntak\n\nSample Input 2\n\nnaohiro\n\nSample Output 2\n\nnao", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 51, "cpu_time_ms": 7, "memory_kb": 1316}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s660260898", "group_id": "codeNet:p02645", "input_text": "var s:string;begin readln(s);writeln(s[1..3]);end.", "language": "Pascal", "metadata": {"date": 1597614580, "filename_ext": "pas", "original_language": "Pascal (FPC 3.0.4)", "problem_description_relpath": "problem_descriptions/p02645.html", "problem_id": "p02645", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02645/input.txt", "sample_output_relpath": "derived/input_output/data/p02645/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02645/Pascal/s660260898.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s660260898", "user_id": "u984276646"}, "prompt_components": {"gold_output": "tak\n", "input_to_evaluate": "var s:string;begin readln(s);writeln(s[1..3]);end.", "problem_context": "Score : 100 points\n\nProblem Statement\n\nWhen you asked some guy in your class his name, he called himself S, where S is a string of length between 3 and 20 (inclusive) consisting of lowercase English letters.\nYou have decided to choose some three consecutive characters from S and make it his nickname. Print a string that is a valid nickname for him.\n\nConstraints\n\n3 \\leq |S| \\leq 20\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 your answer.\n\nSample Input 1\n\ntakahashi\n\nSample Output 1\n\ntak\n\nSample Input 2\n\nnaohiro\n\nSample Output 2\n\nnao", "sample_input": "takahashi\n"}, "reference_outputs": ["tak\n"], "source_document_id": "p02645", "source_text": "Score : 100 points\n\nProblem Statement\n\nWhen you asked some guy in your class his name, he called himself S, where S is a string of length between 3 and 20 (inclusive) consisting of lowercase English letters.\nYou have decided to choose some three consecutive characters from S and make it his nickname. Print a string that is a valid nickname for him.\n\nConstraints\n\n3 \\leq |S| \\leq 20\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 your answer.\n\nSample Input 1\n\ntakahashi\n\nSample Output 1\n\ntak\n\nSample Input 2\n\nnaohiro\n\nSample Output 2\n\nnao", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 50, "cpu_time_ms": 6, "memory_kb": 1384}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s772613596", "group_id": "codeNet:p02646", "input_text": "var a,b,v,w,t: int64;\nbegin\nreadln(a,v);\nreadln(b,w);\nreadln(t);\nif (w>=v) or (abs(b-a)>t*(v-w))\n then writeln('NO')\n else writeln('YES')\nend.\n", "language": "Pascal", "metadata": {"date": 1592100617, "filename_ext": "pas", "original_language": "Pascal (FPC 3.0.4)", "problem_description_relpath": "problem_descriptions/p02646.html", "problem_id": "p02646", "resource_group": "low_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/Pascal/s772613596.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s772613596", "user_id": "u851084981"}, "prompt_components": {"gold_output": "YES\n", "input_to_evaluate": "var a,b,v,w,t: int64;\nbegin\nreadln(a,v);\nreadln(b,w);\nreadln(t);\nif (w>=v) or (abs(b-a)>t*(v-w))\n then writeln('NO')\n else writeln('YES')\nend.\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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 147, "cpu_time_ms": 1, "memory_kb": 1356}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s703024976", "group_id": "codeNet:p02646", "input_text": "var a,b,v,w,t: int64;\nbegin\nreadln(a,v);\nreadln(b,w);\nreadln(t);\nif (w>=v) or (b-a>t*(v-w))\n then writeln('NO')\n else writeln('YES')\nend.\n", "language": "Pascal", "metadata": {"date": 1592100512, "filename_ext": "pas", "original_language": "Pascal (FPC 3.0.4)", "problem_description_relpath": "problem_descriptions/p02646.html", "problem_id": "p02646", "resource_group": "low_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/Pascal/s703024976.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s703024976", "user_id": "u851084981"}, "prompt_components": {"gold_output": "YES\n", "input_to_evaluate": "var a,b,v,w,t: int64;\nbegin\nreadln(a,v);\nreadln(b,w);\nreadln(t);\nif (w>=v) or (b-a>t*(v-w))\n then writeln('NO')\n else writeln('YES')\nend.\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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 1368}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s381066391", "group_id": "codeNet:p02657", "input_text": "var a,b: integer;\nbegin\n read(a,b);\n writeln(a*b);\nend.\n", "language": "Pascal", "metadata": {"date": 1591758375, "filename_ext": "pas", "original_language": "Pascal (FPC 3.0.4)", "problem_description_relpath": "problem_descriptions/p02657.html", "problem_id": "p02657", "resource_group": "low_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/Pascal/s381066391.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s381066391", "user_id": "u222846612"}, "prompt_components": {"gold_output": "10\n", "input_to_evaluate": "var a,b: integer;\nbegin\n read(a,b);\n writeln(a*b);\nend.\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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 62, "cpu_time_ms": 1, "memory_kb": 1372}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s385935632", "group_id": "codeNet:p02660", "input_text": "var n : int64;\n i : int64;\n ct,ans,j : longint;\nbegin\n readln(n);\n i := 2;\n ans := 0;\n while i * i <= n do begin\n if n mod i = 0 then begin\n ct := 0;\n while n mod i = 0 do begin\n n := n div i;\n inc(ct);\n end;\n j := 1;\n while j <= ct do begin\n ct := ct - j;\n inc(j);\n inc(ans);\n end;\n end;\n inc(i);\n end;\n if n <> 1 then inc(ans);\n writeln(ans);\nend.\n", "language": "Pascal", "metadata": {"date": 1591759186, "filename_ext": "pas", "original_language": "Pascal (FPC 3.0.4)", "problem_description_relpath": "problem_descriptions/p02660.html", "problem_id": "p02660", "resource_group": "low_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/Pascal/s385935632.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s385935632", "user_id": "u222846612"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "var n : int64;\n i : int64;\n ct,ans,j : longint;\nbegin\n readln(n);\n i := 2;\n ans := 0;\n while i * i <= n do begin\n if n mod i = 0 then begin\n ct := 0;\n while n mod i = 0 do begin\n n := n div i;\n inc(ct);\n end;\n j := 1;\n while j <= ct do begin\n ct := ct - j;\n inc(j);\n inc(ans);\n end;\n end;\n inc(i);\n end;\n if n <> 1 then inc(ans);\n writeln(ans);\nend.\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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 18, "memory_kb": 1380}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s358024039", "group_id": "codeNet:p02663", "input_text": "var h1,m1,h2,m2,k:integer;begin readln(h1,m1,h2,m2,k);writeln((60*(h2-h1)+m2-m1-k));end.", "language": "Pascal", "metadata": {"date": 1597614808, "filename_ext": "pas", "original_language": "Pascal (FPC 3.0.4)", "problem_description_relpath": "problem_descriptions/p02663.html", "problem_id": "p02663", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02663/input.txt", "sample_output_relpath": "derived/input_output/data/p02663/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02663/Pascal/s358024039.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s358024039", "user_id": "u984276646"}, "prompt_components": {"gold_output": "270\n", "input_to_evaluate": "var h1,m1,h2,m2,k:integer;begin readln(h1,m1,h2,m2,k);writeln((60*(h2-h1)+m2-m1-k));end.", "problem_context": "Score : 100 points\n\nProblem Statement\n\nIn this problem, we use the 24-hour clock.\n\nTakahashi gets up exactly at the time H_1 : M_1 and goes to bed exactly at the time H_2 : M_2. (See Sample Inputs below for clarity.)\nHe has decided to study for K consecutive minutes while he is up.\nWhat is the length of the period in which he can start studying?\n\nConstraints\n\n0 \\le H_1, H_2 \\le 23\n\n0 \\le M_1, M_2 \\le 59\n\nThe time H_1 : M_1 comes before the time H_2 : M_2.\n\nK \\ge 1\n\nTakahashi is up for at least K minutes.\n\nAll values in input are integers (without leading zeros).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH_1 M_1 H_2 M_2 K\n\nOutput\n\nPrint the length of the period in which he can start studying, as an integer.\n\nSample Input 1\n\n10 0 15 0 30\n\nSample Output 1\n\n270\n\nTakahashi gets up at exactly ten in the morning and goes to bed at exactly three in the afternoon.\nIt takes 30 minutes to do the study, so he can start it in the period between ten o'clock and half-past two. The length of this period is 270 minutes, so we should print 270.\n\nSample Input 2\n\n10 0 12 0 120\n\nSample Output 2\n\n0\n\nTakahashi gets up at exactly ten in the morning and goes to bed at exactly noon. It takes 120 minutes to do the study, so he has to start it at exactly ten o'clock. Thus, we should print 0.", "sample_input": "10 0 15 0 30\n"}, "reference_outputs": ["270\n"], "source_document_id": "p02663", "source_text": "Score : 100 points\n\nProblem Statement\n\nIn this problem, we use the 24-hour clock.\n\nTakahashi gets up exactly at the time H_1 : M_1 and goes to bed exactly at the time H_2 : M_2. (See Sample Inputs below for clarity.)\nHe has decided to study for K consecutive minutes while he is up.\nWhat is the length of the period in which he can start studying?\n\nConstraints\n\n0 \\le H_1, H_2 \\le 23\n\n0 \\le M_1, M_2 \\le 59\n\nThe time H_1 : M_1 comes before the time H_2 : M_2.\n\nK \\ge 1\n\nTakahashi is up for at least K minutes.\n\nAll values in input are integers (without leading zeros).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH_1 M_1 H_2 M_2 K\n\nOutput\n\nPrint the length of the period in which he can start studying, as an integer.\n\nSample Input 1\n\n10 0 15 0 30\n\nSample Output 1\n\n270\n\nTakahashi gets up at exactly ten in the morning and goes to bed at exactly three in the afternoon.\nIt takes 30 minutes to do the study, so he can start it in the period between ten o'clock and half-past two. The length of this period is 270 minutes, so we should print 270.\n\nSample Input 2\n\n10 0 12 0 120\n\nSample Output 2\n\n0\n\nTakahashi gets up at exactly ten in the morning and goes to bed at exactly noon. It takes 120 minutes to do the study, so he has to start it at exactly ten o'clock. Thus, we should print 0.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 88, "cpu_time_ms": 4, "memory_kb": 1384}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s328437505", "group_id": "codeNet:p02675", "input_text": "program therefore;\nvar\n n : string;\n x : char;\nbegin\n readln(n);\n x := n[length(n)];\n if (x = '2') or (x = '4') or (x = '5') or (x = '7') or (x = '9') then \n writeln('hon')\n else if x = '3' then\n writeln('bom')\n else writeln('pon');\nend.", "language": "Pascal", "metadata": {"date": 1597910638, "filename_ext": "pas", "original_language": "Pascal (FPC 3.0.4)", "problem_description_relpath": "problem_descriptions/p02675.html", "problem_id": "p02675", "resource_group": "low_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/Pascal/s328437505.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s328437505", "user_id": "u583992857"}, "prompt_components": {"gold_output": "pon\n", "input_to_evaluate": "program therefore;\nvar\n n : string;\n x : char;\nbegin\n readln(n);\n x := n[length(n)];\n if (x = '2') or (x = '4') or (x = '5') or (x = '7') or (x = '9') then \n writeln('hon')\n else if x = '3' then\n writeln('bom')\n else writeln('pon');\nend.", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 6, "memory_kb": 1376}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s277165238", "group_id": "codeNet:p02675", "input_text": "program main;\nvar n : integer;\n\nbegin\n readln(n);\n n := n mod 10;\n if n in [2,4,5,7,9] then writeln('hon')\n else if n in [0,1,6,8] then writeln('pon')\n else if n in [3] then writeln('bon');\nend.", "language": "Pascal", "metadata": {"date": 1596438191, "filename_ext": "pas", "original_language": "Pascal (FPC 3.0.4)", "problem_description_relpath": "problem_descriptions/p02675.html", "problem_id": "p02675", "resource_group": "low_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/Pascal/s277165238.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s277165238", "user_id": "u122156580"}, "prompt_components": {"gold_output": "pon\n", "input_to_evaluate": "program main;\nvar n : integer;\n\nbegin\n readln(n);\n n := n mod 10;\n if n in [2,4,5,7,9] then writeln('hon')\n else if n in [0,1,6,8] then writeln('pon')\n else if n in [3] then writeln('bon');\nend.", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 2, "memory_kb": 1376}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s015610067", "group_id": "codeNet:p02675", "input_text": "program main;\nvar\n n : integer;\nbegin\n readln(n);\n n := n mod 10;\n if n = 3\n then writeln('bon')\n else if (n = 0) or (n = 1) or (n = 6) or (n = 8)\n then writeln('pon')\n else writeln('hon');\nend.\n", "language": "Pascal", "metadata": {"date": 1595460881, "filename_ext": "pas", "original_language": "Pascal (FPC 3.0.4)", "problem_description_relpath": "problem_descriptions/p02675.html", "problem_id": "p02675", "resource_group": "low_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/Pascal/s015610067.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s015610067", "user_id": "u581648177"}, "prompt_components": {"gold_output": "pon\n", "input_to_evaluate": "program main;\nvar\n n : integer;\nbegin\n readln(n);\n n := n mod 10;\n if n = 3\n then writeln('bon')\n else if (n = 0) or (n = 1) or (n = 6) or (n = 8)\n then writeln('pon')\n else writeln('hon');\nend.\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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 1348}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s380818789", "group_id": "codeNet:p02675", "input_text": "var\n n, digits: Integer;\n measure: String;\n\nbegin\n read(n);\n\n n := n mod 10;\n\n if (n = 0) or (n = 1) or (n = 6) or (n = 8) then\n begin\n measure := 'pon';\n end\n\n else if n = 3 then\n begin\n measure := 'bon';\n end\n\n else\n begin\n measure := 'hon';\n end;\n\n\n write(measure);\n\nend.", "language": "Pascal", "metadata": {"date": 1590611892, "filename_ext": "pas", "original_language": "Pascal (FPC 3.0.4)", "problem_description_relpath": "problem_descriptions/p02675.html", "problem_id": "p02675", "resource_group": "low_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/Pascal/s380818789.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s380818789", "user_id": "u888256791"}, "prompt_components": {"gold_output": "pon\n", "input_to_evaluate": "var\n n, digits: Integer;\n measure: String;\n\nbegin\n read(n);\n\n n := n mod 10;\n\n if (n = 0) or (n = 1) or (n = 6) or (n = 8) then\n begin\n measure := 'pon';\n end\n\n else if n = 3 then\n begin\n measure := 'bon';\n end\n\n else\n begin\n measure := 'hon';\n end;\n\n\n write(measure);\n\nend.", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 1312}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s455134614", "group_id": "codeNet:p02676", "input_text": "program main;\nvar n : longint;\n s : string;\n\nbegin\n readln(n);\n readln(s);\n if n >= length(s) then\n writeln(s)\n else \n writeln(copy(s, 1, n)+'...');\nend.", "language": "Pascal", "metadata": {"date": 1596487114, "filename_ext": "pas", "original_language": "Pascal (FPC 3.0.4)", "problem_description_relpath": "problem_descriptions/p02676.html", "problem_id": "p02676", "resource_group": "low_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/Pascal/s455134614.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s455134614", "user_id": "u122156580"}, "prompt_components": {"gold_output": "nikoand...\n", "input_to_evaluate": "program main;\nvar n : longint;\n s : string;\n\nbegin\n readln(n);\n readln(s);\n if n >= length(s) then\n writeln(s)\n else \n writeln(copy(s, 1, n)+'...');\nend.", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 8, "memory_kb": 1384}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s346572383", "group_id": "codeNet:p02676", "input_text": "program hi;\nvar \n k: integer;\n s: string;\n\nbegin\n readln(k);\n readln(s);\n if (length(s) <= k) then\n writeln(s)\n else\n writeln(copy(s, 1, k), '...');\nend.", "language": "Pascal", "metadata": {"date": 1596471548, "filename_ext": "pas", "original_language": "Pascal (FPC 3.0.4)", "problem_description_relpath": "problem_descriptions/p02676.html", "problem_id": "p02676", "resource_group": "low_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/Pascal/s346572383.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s346572383", "user_id": "u051422473"}, "prompt_components": {"gold_output": "nikoand...\n", "input_to_evaluate": "program hi;\nvar \n k: integer;\n s: string;\n\nbegin\n readln(k);\n readln(s);\n if (length(s) <= k) then\n writeln(s)\n else\n writeln(copy(s, 1, k), '...');\nend.", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 3, "memory_kb": 1380}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s606832008", "group_id": "codeNet:p02676", "input_text": "program main;\nvar\n\tnum, i, len : integer;\n\ts : string;\n\nbegin\n\treadln(num);\n readln(s);\n len := length(s);\n for i := 1 to num do \n \twrite(s[i]);\n if len >= num\n \tthen write('...');\nend.\n ", "language": "Pascal", "metadata": {"date": 1595429893, "filename_ext": "pas", "original_language": "Pascal (FPC 3.0.4)", "problem_description_relpath": "problem_descriptions/p02676.html", "problem_id": "p02676", "resource_group": "low_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/Pascal/s606832008.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s606832008", "user_id": "u522723337"}, "prompt_components": {"gold_output": "nikoand...\n", "input_to_evaluate": "program main;\nvar\n\tnum, i, len : integer;\n\ts : string;\n\nbegin\n\treadln(num);\n readln(s);\n len := length(s);\n for i := 1 to num do \n \twrite(s[i]);\n if len >= num\n \tthen write('...');\nend.\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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 1388}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s270641260", "group_id": "codeNet:p02676", "input_text": "var\n k: Integer;\n s, dots: String;\n\nbegin\n readln(k);\n readln(s);\n\n dots := '...';\n\n if Length(s) > k then\n begin\n s := Copy(s, 0, k) + dots;\n end;\n\n writeln(s);\n\nend.", "language": "Pascal", "metadata": {"date": 1590700707, "filename_ext": "pas", "original_language": "Pascal (FPC 3.0.4)", "problem_description_relpath": "problem_descriptions/p02676.html", "problem_id": "p02676", "resource_group": "low_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/Pascal/s270641260.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s270641260", "user_id": "u496848914"}, "prompt_components": {"gold_output": "nikoand...\n", "input_to_evaluate": "var\n k: Integer;\n s, dots: String;\n\nbegin\n readln(k);\n readln(s);\n\n dots := '...';\n\n if Length(s) > k then\n begin\n s := Copy(s, 0, k) + dots;\n end;\n\n writeln(s);\n\nend.", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 1364}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s882478936", "group_id": "codeNet:p02677", "input_text": "var\n a, b, h, m, angle: double;\n distance: double;\n\nbegin\n read(a);\n read(b);\n read(h);\n read(m);\n\n angle := Abs((30 * h) - (5.5 * m));\n\n distance := Sqrt((sqr(a) + sqr(b)) - (2 * (a) * (b) * Cos(angle * pi / 180)));\n\n writeln(distance);\n\nend.", "language": "Pascal", "metadata": {"date": 1590727080, "filename_ext": "pas", "original_language": "Pascal (FPC 3.0.4)", "problem_description_relpath": "problem_descriptions/p02677.html", "problem_id": "p02677", "resource_group": "low_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/Pascal/s882478936.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s882478936", "user_id": "u496848914"}, "prompt_components": {"gold_output": "5.00000000000000000000\n", "input_to_evaluate": "var\n a, b, h, m, angle: double;\n distance: double;\n\nbegin\n read(a);\n read(b);\n read(h);\n read(m);\n\n angle := Abs((30 * h) - (5.5 * m));\n\n distance := Sqrt((sqr(a) + sqr(b)) - (2 * (a) * (b) * Cos(angle * pi / 180)));\n\n writeln(distance);\n\nend.", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 4, "memory_kb": 1376}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s067019981", "group_id": "codeNet:p02677", "input_text": "var\n a, b, h, m, distance, angle: Double;\n\nbegin\n read(a);\n read(b);\n read(h);\n read(m);\n\n angle := abs(((30 * h) - (5.5 * m)));\n\n distance := sqrt((sqr(a) + sqr(b)) - (2 * (a) * (b) * Cos(angle * pi / 180)));\n\n writeln(distance);\n\nend.", "language": "Pascal", "metadata": {"date": 1590680658, "filename_ext": "pas", "original_language": "Pascal (FPC 3.0.4)", "problem_description_relpath": "problem_descriptions/p02677.html", "problem_id": "p02677", "resource_group": "low_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/Pascal/s067019981.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s067019981", "user_id": "u029261695"}, "prompt_components": {"gold_output": "5.00000000000000000000\n", "input_to_evaluate": "var\n a, b, h, m, distance, angle: Double;\n\nbegin\n read(a);\n read(b);\n read(h);\n read(m);\n\n angle := abs(((30 * h) - (5.5 * m)));\n\n distance := sqrt((sqr(a) + sqr(b)) - (2 * (a) * (b) * Cos(angle * pi / 180)));\n\n writeln(distance);\n\nend.", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 244, "cpu_time_ms": 1, "memory_kb": 1380}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s219501075", "group_id": "codeNet:p02677", "input_text": "var\n a, b, h, m, distance, angle: Double;\n\nbegin\n read(a);\n read(b);\n read(h);\n read(m);\n\n angle := abs(((30 * h) - (5.5 * m)));\n\n distance := sqrt((sqr(a) + sqr(b)) - (2 * (a) * (b) * Cos(angle * pi / 180)));\n\n writeln(distance);\n\nend.\n", "language": "Pascal", "metadata": {"date": 1590680376, "filename_ext": "pas", "original_language": "Pascal (FPC 3.0.4)", "problem_description_relpath": "problem_descriptions/p02677.html", "problem_id": "p02677", "resource_group": "low_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/Pascal/s219501075.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s219501075", "user_id": "u888256791"}, "prompt_components": {"gold_output": "5.00000000000000000000\n", "input_to_evaluate": "var\n a, b, h, m, distance, angle: Double;\n\nbegin\n read(a);\n read(b);\n read(h);\n read(m);\n\n angle := abs(((30 * h) - (5.5 * m)));\n\n distance := sqrt((sqr(a) + sqr(b)) - (2 * (a) * (b) * Cos(angle * pi / 180)));\n\n writeln(distance);\n\nend.\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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 1380}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s185530049", "group_id": "codeNet:p02677", "input_text": "var\n a, b, h, m, distance, angle: Double;\n\nbegin\n read(a);\n read(b);\n read(h);\n read(m);\n\n angle := ((30 * h)-(5.5 * m));\n\n distance := sqrt((sqr(a) + sqr(b)) - (2 * (a)*(b) * Cos(angle)));\n\n writeln(distance);\n\nend.", "language": "Pascal", "metadata": {"date": 1590677522, "filename_ext": "pas", "original_language": "Pascal (FPC 3.0.4)", "problem_description_relpath": "problem_descriptions/p02677.html", "problem_id": "p02677", "resource_group": "low_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/Pascal/s185530049.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s185530049", "user_id": "u888256791"}, "prompt_components": {"gold_output": "5.00000000000000000000\n", "input_to_evaluate": "var\n a, b, h, m, distance, angle: Double;\n\nbegin\n read(a);\n read(b);\n read(h);\n read(m);\n\n angle := ((30 * h)-(5.5 * m));\n\n distance := sqrt((sqr(a) + sqr(b)) - (2 * (a)*(b) * Cos(angle)));\n\n writeln(distance);\n\nend.", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 224, "cpu_time_ms": 3, "memory_kb": 1380}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s792064553", "group_id": "codeNet:p02677", "input_text": "Uses crt,math;\nVar a,b,h,m,i,j,k,n:longint;\nangle1,angle2,res:extended;\nst:string;\nbegin\nclrscr;\nreadln(a,b,h,m);\nangle1:=(m/60)*360;\nIf angle1<180 then angle1:=360-angle1;\nangle2:=((m/60+h)/12)*360;\nangle1:=abs(angle1-angle2);\nres:=3.14159265358979323851;\nwriteln(sqrt(a*a+b*b-2*a*b*cos((angle1)/180*res)):0:20);\nend.\n\n", "language": "Pascal", "metadata": {"date": 1590021524, "filename_ext": "pas", "original_language": "Pascal (FPC 3.0.4)", "problem_description_relpath": "problem_descriptions/p02677.html", "problem_id": "p02677", "resource_group": "low_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/Pascal/s792064553.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s792064553", "user_id": "u382911836"}, "prompt_components": {"gold_output": "5.00000000000000000000\n", "input_to_evaluate": "Uses crt,math;\nVar a,b,h,m,i,j,k,n:longint;\nangle1,angle2,res:extended;\nst:string;\nbegin\nclrscr;\nreadln(a,b,h,m);\nangle1:=(m/60)*360;\nIf angle1<180 then angle1:=360-angle1;\nangle2:=((m/60+h)/12)*360;\nangle1:=abs(angle1-angle2);\nres:=3.14159265358979323851;\nwriteln(sqrt(a*a+b*b-2*a*b*cos((angle1)/180*res)):0:20);\nend.\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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 1, "memory_kb": 1384}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s828358714", "group_id": "codeNet:p02679", "input_text": "type X=record a,b:int64;f:Boolean;end;\ntype SortDataType=X;\nfunction SortCmp(const a,b:SortDataType):Boolean;forward;\nprocedure SortImpl(var A:Array of SortDataType;L,R:Longint);\nvar\n\ttmp:SortDataType;\n\tmid,il,ir:Longint;\nbegin\n\tif R-L<20 then begin\n\t\tfor ir:=R-1 downto L+1 do for il:=L to ir-1 do if SortCmp(A[il+1],A[il])then begin\n\t\t\ttmp:=A[il];\n\t\t\tA[il]:=A[il+1];\n\t\t\tA[il+1]:=tmp;\n\t\tend;\n\tend else begin\n\t\tmid:=(L+R)div 2;\n\t\tif SortCmp(A[mid],A[L])then begin\n\t\t\ttmp:=A[mid];\n\t\t\tA[mid]:=A[L];\n\t\t\tA[L]:=tmp;\n\t\tend;\n\t\tif SortCmp(A[R-1],A[mid])then begin\n\t\t\ttmp:=A[R-1];\n\t\t\tA[R-1]:=A[mid];\n\t\t\tA[mid]:=tmp;\n\t\t\tif SortCmp(A[mid],A[L])then begin\n\t\t\t\ttmp:=A[mid];\n\t\t\t\tA[mid]:=A[L];\n\t\t\t\tA[L]:=tmp;\n\t\t\tend;\n\t\tend;\n\t\til:=L;\n\t\tir:=R-1;\n\t\twhile il<=ir do begin\n\t\t\twhile SortCmp(A[il],A[mid])do inc(il);\n\t\t\twhile SortCmp(A[mid],A[ir])do dec(ir);\n\t\t\tif ilb.a then SortCmp:=a.ab.b then SortCmp:=a.b0))then begin\n\t\t\t\ta:=-a;\n\t\t\t\tb:=-b;\n\t\t\tend;\n\t\t\tf:=False;\n\t\t\tif b<0 then begin\n\t\t\t\ttmp:=a;\n\t\t\t\ta:=-b;\n\t\t\t\tb:=tmp;\n\t\t\t\tf:=True;\n\t\t\tend;\n\t\t\tinc(sz);\n\t\t\tAr[sz].a:=a;\n\t\t\tAr[sz].b:=b;\n\t\t\tAr[sz].f:=f;\n\t\tend;\n\tend;\n\tSort(Ar,sz);\n\ti:=1;\n\tans:=1;\n\twhile i<=sz do begin\n\t\tj:=i;\n\t\tu:=1;\n\t\tv:=1;\n\t\twhile(i<=sz)and(Ar[i].a=Ar[j].a)and(Ar[i].b=Ar[j].b)do begin\n\t\t\tif Ar[i].f then u:=u*2 mod M else v:=v*2 mod M;\n\t\t\tinc(i);\n\t\tend;\n\t\tans:=ans*(u+v-1)mod M;\n\tend;\n\twriteln((ans+O)mod M);\nend.\n", "language": "Pascal", "metadata": {"date": 1589838839, "filename_ext": "pas", "original_language": "Pascal (FPC 3.0.4)", "problem_description_relpath": "problem_descriptions/p02679.html", "problem_id": "p02679", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02679/input.txt", "sample_output_relpath": "derived/input_output/data/p02679/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02679/Pascal/s828358714.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s828358714", "user_id": "u657913472"}, "prompt_components": {"gold_output": "5\n", "input_to_evaluate": "type X=record a,b:int64;f:Boolean;end;\ntype SortDataType=X;\nfunction SortCmp(const a,b:SortDataType):Boolean;forward;\nprocedure SortImpl(var A:Array of SortDataType;L,R:Longint);\nvar\n\ttmp:SortDataType;\n\tmid,il,ir:Longint;\nbegin\n\tif R-L<20 then begin\n\t\tfor ir:=R-1 downto L+1 do for il:=L to ir-1 do if SortCmp(A[il+1],A[il])then begin\n\t\t\ttmp:=A[il];\n\t\t\tA[il]:=A[il+1];\n\t\t\tA[il+1]:=tmp;\n\t\tend;\n\tend else begin\n\t\tmid:=(L+R)div 2;\n\t\tif SortCmp(A[mid],A[L])then begin\n\t\t\ttmp:=A[mid];\n\t\t\tA[mid]:=A[L];\n\t\t\tA[L]:=tmp;\n\t\tend;\n\t\tif SortCmp(A[R-1],A[mid])then begin\n\t\t\ttmp:=A[R-1];\n\t\t\tA[R-1]:=A[mid];\n\t\t\tA[mid]:=tmp;\n\t\t\tif SortCmp(A[mid],A[L])then begin\n\t\t\t\ttmp:=A[mid];\n\t\t\t\tA[mid]:=A[L];\n\t\t\t\tA[L]:=tmp;\n\t\t\tend;\n\t\tend;\n\t\til:=L;\n\t\tir:=R-1;\n\t\twhile il<=ir do begin\n\t\t\twhile SortCmp(A[il],A[mid])do inc(il);\n\t\t\twhile SortCmp(A[mid],A[ir])do dec(ir);\n\t\t\tif ilb.a then SortCmp:=a.ab.b then SortCmp:=a.b0))then begin\n\t\t\t\ta:=-a;\n\t\t\t\tb:=-b;\n\t\t\tend;\n\t\t\tf:=False;\n\t\t\tif b<0 then begin\n\t\t\t\ttmp:=a;\n\t\t\t\ta:=-b;\n\t\t\t\tb:=tmp;\n\t\t\t\tf:=True;\n\t\t\tend;\n\t\t\tinc(sz);\n\t\t\tAr[sz].a:=a;\n\t\t\tAr[sz].b:=b;\n\t\t\tAr[sz].f:=f;\n\t\tend;\n\tend;\n\tSort(Ar,sz);\n\ti:=1;\n\tans:=1;\n\twhile i<=sz do begin\n\t\tj:=i;\n\t\tu:=1;\n\t\tv:=1;\n\t\twhile(i<=sz)and(Ar[i].a=Ar[j].a)and(Ar[i].b=Ar[j].b)do begin\n\t\t\tif Ar[i].f then u:=u*2 mod M else v:=v*2 mod M;\n\t\t\tinc(i);\n\t\tend;\n\t\tans:=ans*(u+v-1)mod M;\n\tend;\n\twriteln((ans+O)mod M);\nend.\n", "problem_context": "Score: 500 points\n\nProblem Statement\n\nWe have caught N sardines. The deliciousness and fragrantness of the i-th sardine is A_i and B_i, respectively.\n\nWe will choose one or more of these sardines and put them into a cooler. However, two sardines on bad terms cannot be chosen at the same time.\n\nThe i-th and j-th sardines (i \\neq j) are on bad terms if and only if A_i \\cdot A_j + B_i \\cdot B_j = 0.\n\nIn how many ways can we choose the set of sardines to put into the cooler? Since the count can be enormous, print it modulo 1000000007.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 2 \\times 10^5\n\n-10^{18} \\leq A_i, B_i \\leq 10^{18}\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 count modulo 1000000007.\n\nSample Input 1\n\n3\n1 2\n-1 1\n2 -1\n\nSample Output 1\n\n5\n\nThere are five ways to choose the set of sardines, as follows:\n\nThe 1-st\n\nThe 1-st and 2-nd\n\nThe 2-nd\n\nThe 2-nd and 3-rd\n\nThe 3-rd\n\nSample Input 2\n\n10\n3 2\n3 2\n-1 1\n2 -1\n-3 -9\n-8 12\n7 7\n8 1\n8 2\n8 4\n\nSample Output 2\n\n479", "sample_input": "3\n1 2\n-1 1\n2 -1\n"}, "reference_outputs": ["5\n"], "source_document_id": "p02679", "source_text": "Score: 500 points\n\nProblem Statement\n\nWe have caught N sardines. The deliciousness and fragrantness of the i-th sardine is A_i and B_i, respectively.\n\nWe will choose one or more of these sardines and put them into a cooler. However, two sardines on bad terms cannot be chosen at the same time.\n\nThe i-th and j-th sardines (i \\neq j) are on bad terms if and only if A_i \\cdot A_j + B_i \\cdot B_j = 0.\n\nIn how many ways can we choose the set of sardines to put into the cooler? Since the count can be enormous, print it modulo 1000000007.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 2 \\times 10^5\n\n-10^{18} \\leq A_i, B_i \\leq 10^{18}\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 count modulo 1000000007.\n\nSample Input 1\n\n3\n1 2\n-1 1\n2 -1\n\nSample Output 1\n\n5\n\nThere are five ways to choose the set of sardines, as follows:\n\nThe 1-st\n\nThe 1-st and 2-nd\n\nThe 2-nd\n\nThe 2-nd and 3-rd\n\nThe 3-rd\n\nSample Input 2\n\n10\n3 2\n3 2\n-1 1\n2 -1\n-3 -9\n-8 12\n7 7\n8 1\n8 2\n8 4\n\nSample Output 2\n\n479", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 2213, "cpu_time_ms": 223, "memory_kb": 4888}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s335696058", "group_id": "codeNet:p02681", "input_text": "program regist;\nvar \n s, t : string;\n i : longint;\n align : boolean;\nbegin\n readln(s);\n readln(t);\n align := true;\n for i := 1 to length(s) do\n if t[i] <> s[i] then\n align := false;\n if align then\n writeln('Yes')\n else\n writeln('No');\nend.", "language": "Pascal", "metadata": {"date": 1597901562, "filename_ext": "pas", "original_language": "Pascal (FPC 3.0.4)", "problem_description_relpath": "problem_descriptions/p02681.html", "problem_id": "p02681", "resource_group": "low_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/Pascal/s335696058.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s335696058", "user_id": "u583992857"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "program regist;\nvar \n s, t : string;\n i : longint;\n align : boolean;\nbegin\n readln(s);\n readln(t);\n align := true;\n for i := 1 to length(s) do\n if t[i] <> s[i] then\n align := false;\n if align then\n writeln('Yes')\n else\n writeln('No');\nend.", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 2, "memory_kb": 1356}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s577019844", "group_id": "codeNet:p02681", "input_text": "var\n\ts,t:string;\nbegin\n\treadln(s);\n readln(t);\n if pos(s,t)<>1 then writeln('No') else writeln('Yes');\nend.", "language": "Pascal", "metadata": {"date": 1595006690, "filename_ext": "pas", "original_language": "Pascal (FPC 3.0.4)", "problem_description_relpath": "problem_descriptions/p02681.html", "problem_id": "p02681", "resource_group": "low_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/Pascal/s577019844.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s577019844", "user_id": "u678829637"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "var\n\ts,t:string;\nbegin\n\treadln(s);\n readln(t);\n if pos(s,t)<>1 then writeln('No') else writeln('Yes');\nend.", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 5, "memory_kb": 1384}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s134107252", "group_id": "codeNet:p02682", "input_text": "program main;\nvar\n a, b, c, d, sum : int64;\nbegin\n sum := 0;\n readln(a, b, c, d);\n if d < a \n then sum := sum + d\n else begin\n sum := sum + a;\n d := d - a -b;\n if d > 0\n then sum := sum - d;\n writeln(sum);\n end;\nend.", "language": "Pascal", "metadata": {"date": 1595462372, "filename_ext": "pas", "original_language": "Pascal (FPC 3.0.4)", "problem_description_relpath": "problem_descriptions/p02682.html", "problem_id": "p02682", "resource_group": "low_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/Pascal/s134107252.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s134107252", "user_id": "u581648177"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "program main;\nvar\n a, b, c, d, sum : int64;\nbegin\n sum := 0;\n readln(a, b, c, d);\n if d < a \n then sum := sum + d\n else begin\n sum := sum + a;\n d := d - a -b;\n if d > 0\n then sum := sum - d;\n writeln(sum);\n end;\nend.", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 9, "memory_kb": 1380}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s437766950", "group_id": "codeNet:p02682", "input_text": "var\n\tsum,a,b,c,k:int64;\nbegin\n\tsum:=0;\n\treadln(a,b,c,k);\n if k>a then begin\t\n \tsum:=sum+a;\n k:=k-a-b;\n if k>0 then sum:=sum-k; \n \tend\n else sum:=sum+k;\n writeln(sum);\nend.", "language": "Pascal", "metadata": {"date": 1595008528, "filename_ext": "pas", "original_language": "Pascal (FPC 3.0.4)", "problem_description_relpath": "problem_descriptions/p02682.html", "problem_id": "p02682", "resource_group": "low_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/Pascal/s437766950.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s437766950", "user_id": "u678829637"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "var\n\tsum,a,b,c,k:int64;\nbegin\n\tsum:=0;\n\treadln(a,b,c,k);\n if k>a then begin\t\n \tsum:=sum+a;\n k:=k-a-b;\n if k>0 then sum:=sum-k; \n \tend\n else sum:=sum+k;\n writeln(sum);\nend.", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 3, "memory_kb": 1368}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s126002512", "group_id": "codeNet:p02687", "input_text": "program main;\nvar\n s : string;\nbegin\n readln(s);\n\n if (s = 'ABC') then\n writeln('ARC')\n else \n writeln('ABC');\nend.", "language": "Pascal", "metadata": {"date": 1595630767, "filename_ext": "pas", "original_language": "Pascal (FPC 3.0.4)", "problem_description_relpath": "problem_descriptions/p02687.html", "problem_id": "p02687", "resource_group": "low_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/Pascal/s126002512.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s126002512", "user_id": "u151858600"}, "prompt_components": {"gold_output": "ARC\n", "input_to_evaluate": "program main;\nvar\n s : string;\nbegin\n readln(s);\n\n if (s = 'ABC') then\n writeln('ARC')\n else \n writeln('ABC');\nend.", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 2, "memory_kb": 1316}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s388640210", "group_id": "codeNet:p02687", "input_text": "var s:ansistring;\nbegin\n readln(s);\n if s='ABC' then writeln('ARC') else writeln('ABC');\nend.", "language": "Pascal", "metadata": {"date": 1588704826, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p02687.html", "problem_id": "p02687", "resource_group": "low_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/Pascal/s388640210.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s388640210", "user_id": "u476418095"}, "prompt_components": {"gold_output": "ARC\n", "input_to_evaluate": "var s:ansistring;\nbegin\n readln(s);\n if s='ABC' then writeln('ARC') else writeln('ABC');\nend.", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 95, "cpu_time_ms": 1, "memory_kb": 1376}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s742189440", "group_id": "codeNet:p02688", "input_text": "program main;\nvar\n n, k, i, j, t1, t2, ans : integer;\n e : array[1..100] of boolean;\nbegin\n readln(n, k);\n\n for i := 1 to n do\n e[i] := true;\n\n ans := n;\n for i := 1 to k do begin\n readln(t1);\n for j := 1 to t1 do begin\n read(t2);\n if (e[t2]) then begin\n e[t2] := false;\n ans := ans - 1;\n end;\n end;\n end;\n\n writeln(ans);\nend.", "language": "Pascal", "metadata": {"date": 1595632022, "filename_ext": "pas", "original_language": "Pascal (FPC 3.0.4)", "problem_description_relpath": "problem_descriptions/p02688.html", "problem_id": "p02688", "resource_group": "low_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/Pascal/s742189440.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s742189440", "user_id": "u151858600"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "program main;\nvar\n n, k, i, j, t1, t2, ans : integer;\n e : array[1..100] of boolean;\nbegin\n readln(n, k);\n\n for i := 1 to n do\n e[i] := true;\n\n ans := n;\n for i := 1 to k do begin\n readln(t1);\n for j := 1 to t1 do begin\n read(t2);\n if (e[t2]) then begin\n e[t2] := false;\n ans := ans - 1;\n end;\n end;\n end;\n\n writeln(ans);\nend.", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 441, "cpu_time_ms": 3, "memory_kb": 1352}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s582727067", "group_id": "codeNet:p02688", "input_text": "var\n\ti,j:integer;\n arr:array[1..1000] of integer;\n n,k,d,input:integer;\nbegin\n\treadln(n,k);\n for i:=1 to n do arr[i]:=0;\n for i:=1 to k do begin\n \treadln(d);\n for j:=1 to d do begin\n \tread(input);\n inc(arr[input]);\n end;\n end;\n input:=0;\n for i:=1 to n do begin\n \tif arr[i]=0 then input:=input+1;\n end;\n writeln(input);\nend.", "language": "Pascal", "metadata": {"date": 1594961216, "filename_ext": "pas", "original_language": "Pascal (FPC 3.0.4)", "problem_description_relpath": "problem_descriptions/p02688.html", "problem_id": "p02688", "resource_group": "low_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/Pascal/s582727067.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s582727067", "user_id": "u678829637"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "var\n\ti,j:integer;\n arr:array[1..1000] of integer;\n n,k,d,input:integer;\nbegin\n\treadln(n,k);\n for i:=1 to n do arr[i]:=0;\n for i:=1 to k do begin\n \treadln(d);\n for j:=1 to d do begin\n \tread(input);\n inc(arr[input]);\n end;\n end;\n input:=0;\n for i:=1 to n do begin\n \tif arr[i]=0 then input:=input+1;\n end;\n writeln(input);\nend.", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 389, "cpu_time_ms": 4, "memory_kb": 1384}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s629707571", "group_id": "codeNet:p02689", "input_text": "var\n\tN,M,i,u,v,cnt:Longint;\n\tH:Array[1..100000]of Longint;\n\tok:Array[1..100000]of Boolean;\nbegin\n\tread(N,M);\n\tfor i:=1 to N do read(H[i]);\n\tfor i:=1 to M do begin\n\t\tread(u,v);\n\t\tif H[u]>=H[v]then ok[v]:=True;\n\t\tif H[v]>=H[u]then ok[u]:=True;\n\tend;\n\tfor i:=1 to N do if not ok[i]then inc(cnt);\n\twriteln(cnt);\nend.\n", "language": "Pascal", "metadata": {"date": 1591915954, "filename_ext": "pas", "original_language": "Pascal (FPC 3.0.4)", "problem_description_relpath": "problem_descriptions/p02689.html", "problem_id": "p02689", "resource_group": "low_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/Pascal/s629707571.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s629707571", "user_id": "u657913472"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "var\n\tN,M,i,u,v,cnt:Longint;\n\tH:Array[1..100000]of Longint;\n\tok:Array[1..100000]of Boolean;\nbegin\n\tread(N,M);\n\tfor i:=1 to N do read(H[i]);\n\tfor i:=1 to M do begin\n\t\tread(u,v);\n\t\tif H[u]>=H[v]then ok[v]:=True;\n\t\tif H[v]>=H[u]then ok[u]:=True;\n\tend;\n\tfor i:=1 to N do if not ok[i]then inc(cnt);\n\twriteln(cnt);\nend.\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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 42, "memory_kb": 1372}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s570576418", "group_id": "codeNet:p02690", "input_text": "var\n\tX,A,B:int64;\nbegin\n\tread(X);\n\tA:=1;\n\twhile True do begin\n\t\tB:=-A;\n\t\twhile B<=A do begin\n\t\t\tif A*A*A*A*A-B*B*B*B*B=X then begin\n\t\t\t\twriteln(A,' ',B);\n\t\t\t\texit;\n\t\t\tend;\n\t\t\tinc(B);\n\t\tend;\n\t\tinc(A);\n\tend;\nend.\n", "language": "Pascal", "metadata": {"date": 1591916499, "filename_ext": "pas", "original_language": "Pascal (FPC 3.0.4)", "problem_description_relpath": "problem_descriptions/p02690.html", "problem_id": "p02690", "resource_group": "low_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/Pascal/s570576418.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s570576418", "user_id": "u657913472"}, "prompt_components": {"gold_output": "2 -1\n", "input_to_evaluate": "var\n\tX,A,B:int64;\nbegin\n\tread(X);\n\tA:=1;\n\twhile True do begin\n\t\tB:=-A;\n\t\twhile B<=A do begin\n\t\t\tif A*A*A*A*A-B*B*B*B*B=X then begin\n\t\t\t\twriteln(A,' ',B);\n\t\t\t\texit;\n\t\t\tend;\n\t\t\tinc(B);\n\t\tend;\n\t\tinc(A);\n\tend;\nend.\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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 1288}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s040089953", "group_id": "codeNet:p02693", "input_text": "program main;\nvar k, a, b, x : integer;\nbegin\n\treadln(k);\n readln(a, b);\n \n x := b - a;\n\n if b = a\n then x := 1;\n\n if x >= k\n then writeln('OK')\n else writeln('NG');\nend.", "language": "Pascal", "metadata": {"date": 1597424985, "filename_ext": "pas", "original_language": "Pascal (FPC 3.0.4)", "problem_description_relpath": "problem_descriptions/p02693.html", "problem_id": "p02693", "resource_group": "low_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/Pascal/s040089953.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s040089953", "user_id": "u384260326"}, "prompt_components": {"gold_output": "OK\n", "input_to_evaluate": "program main;\nvar k, a, b, x : integer;\nbegin\n\treadln(k);\n readln(a, b);\n \n x := b - a;\n\n if b = a\n then x := 1;\n\n if x >= k\n then writeln('OK')\n else writeln('NG');\nend.", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 5, "memory_kb": 1388}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s796030156", "group_id": "codeNet:p02693", "input_text": "program main;\nvar\n K, A, B, i : integer;\n found : boolean;\nbegin\n readln(K);\n readln(A, B);\n\n found:= false;\n for i := A to B do begin\n if i mod K = 0 then\n found := true;\nend;\n\nif found then \n writeln('OK')\nelse\n writeln('NG');\nend.", "language": "Pascal", "metadata": {"date": 1597342634, "filename_ext": "pas", "original_language": "Pascal (FPC 3.0.4)", "problem_description_relpath": "problem_descriptions/p02693.html", "problem_id": "p02693", "resource_group": "low_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/Pascal/s796030156.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s796030156", "user_id": "u766932905"}, "prompt_components": {"gold_output": "OK\n", "input_to_evaluate": "program main;\nvar\n K, A, B, i : integer;\n found : boolean;\nbegin\n readln(K);\n readln(A, B);\n\n found:= false;\n for i := A to B do begin\n if i mod K = 0 then\n found := true;\nend;\n\nif found then \n writeln('OK')\nelse\n writeln('NG');\nend.", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 1380}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s772179824", "group_id": "codeNet:p02693", "input_text": "var\n\tx, y, z : integer;\n\ti : integer;\n ok : boolean;\nbegin\n\tok := false;\n i := x;\n\treadln(x);\n readln(y, z);\n while i <= z do\n begin\n \tif (i >= y) and (i <= z) then\n \tok := true;\n i := i + x;\n end;\n if ok then\n \twriteln('OK')\n else\n \twriteln('NG');\nend.", "language": "Pascal", "metadata": {"date": 1597207127, "filename_ext": "pas", "original_language": "Pascal (FPC 3.0.4)", "problem_description_relpath": "problem_descriptions/p02693.html", "problem_id": "p02693", "resource_group": "low_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/Pascal/s772179824.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s772179824", "user_id": "u838994261"}, "prompt_components": {"gold_output": "OK\n", "input_to_evaluate": "var\n\tx, y, z : integer;\n\ti : integer;\n ok : boolean;\nbegin\n\tok := false;\n i := x;\n\treadln(x);\n readln(y, z);\n while i <= z do\n begin\n \tif (i >= y) and (i <= z) then\n \tok := true;\n i := i + x;\n end;\n if ok then\n \twriteln('OK')\n else\n \twriteln('NG');\nend.", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 4, "memory_kb": 1384}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s496589260", "group_id": "codeNet:p02693", "input_text": "program main;\nvar n,a,b,i :integer;\n c : boolean;\nbegin\n c := false;\n readln(n);\n readln(a,b);\n for i := a to b do\n if i mod n = 0\n then c := true;\n if c\n then writeln('OK')\n else writeln('NG');\nend.", "language": "Pascal", "metadata": {"date": 1596212760, "filename_ext": "pas", "original_language": "Pascal (FPC 3.0.4)", "problem_description_relpath": "problem_descriptions/p02693.html", "problem_id": "p02693", "resource_group": "low_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/Pascal/s496589260.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s496589260", "user_id": "u225670189"}, "prompt_components": {"gold_output": "OK\n", "input_to_evaluate": "program main;\nvar n,a,b,i :integer;\n c : boolean;\nbegin\n c := false;\n readln(n);\n readln(a,b);\n for i := a to b do\n if i mod n = 0\n then c := true;\n if c\n then writeln('OK')\n else writeln('NG');\nend.", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 237, "cpu_time_ms": 5, "memory_kb": 1364}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s704737112", "group_id": "codeNet:p02693", "input_text": "var\n\tK,A,B:Longint;\nbegin\n\tread(K,A,B);\n\tdec(A);\n\tif A div K<>B div K then writeln('OK')else writeln('NG');\nend.\n", "language": "Pascal", "metadata": {"date": 1588579535, "filename_ext": "pas", "original_language": "Pascal (FPC 3.0.4)", "problem_description_relpath": "problem_descriptions/p02693.html", "problem_id": "p02693", "resource_group": "low_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/Pascal/s704737112.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s704737112", "user_id": "u657913472"}, "prompt_components": {"gold_output": "OK\n", "input_to_evaluate": "var\n\tK,A,B:Longint;\nbegin\n\tread(K,A,B);\n\tdec(A);\n\tif A div K<>B div K then writeln('OK')else writeln('NG');\nend.\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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 1, "memory_kb": 1388}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s771526629", "group_id": "codeNet:p02693", "input_text": "var k,a,b:longint;\nbegin\n readln(k,a,b);\n for a:=a to b do\n if k mod a=0 then\n begin\n writeln('OK');\n halt;\n end;\n writeln('NG');\nend.", "language": "Pascal", "metadata": {"date": 1588547490, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p02693.html", "problem_id": "p02693", "resource_group": "low_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/Pascal/s771526629.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s771526629", "user_id": "u723721005"}, "prompt_components": {"gold_output": "OK\n", "input_to_evaluate": "var k,a,b:longint;\nbegin\n readln(k,a,b);\n for a:=a to b do\n if k mod a=0 then\n begin\n writeln('OK');\n halt;\n end;\n writeln('NG');\nend.", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 1384}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s404333181", "group_id": "codeNet:p02694", "input_text": "program main;\nvar x, i : int64;\n year : integer;\nbegin\n\treadln(x);\n i := 100;\n year := 0;\n\n while i < x do begin\n i := trunc(i * 1.01);\n year := year + 1;\n end;\n \n writeln(year);\nend.", "language": "Pascal", "metadata": {"date": 1597426478, "filename_ext": "pas", "original_language": "Pascal (FPC 3.0.4)", "problem_description_relpath": "problem_descriptions/p02694.html", "problem_id": "p02694", "resource_group": "low_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/Pascal/s404333181.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s404333181", "user_id": "u384260326"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "program main;\nvar x, i : int64;\n year : integer;\nbegin\n\treadln(x);\n i := 100;\n year := 0;\n\n while i < x do begin\n i := trunc(i * 1.01);\n year := year + 1;\n end;\n \n writeln(year);\nend.", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 218, "cpu_time_ms": 3, "memory_kb": 1376}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s099240714", "group_id": "codeNet:p02694", "input_text": "var\n\ta, cnt, x : int64;\n \n \n \n \nbegin\n\ta := 100;\n cnt := 0;\n readln(x);\n while (a < x) do\n begin\n \ta := trunc(a * 1.01);\n cnt := cnt + 1;\n end;\n writeln(cnt);\nend.", "language": "Pascal", "metadata": {"date": 1597207526, "filename_ext": "pas", "original_language": "Pascal (FPC 3.0.4)", "problem_description_relpath": "problem_descriptions/p02694.html", "problem_id": "p02694", "resource_group": "low_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/Pascal/s099240714.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s099240714", "user_id": "u838994261"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "var\n\ta, cnt, x : int64;\n \n \n \n \nbegin\n\ta := 100;\n cnt := 0;\n readln(x);\n while (a < x) do\n begin\n \ta := trunc(a * 1.01);\n cnt := cnt + 1;\n end;\n writeln(cnt);\nend.", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 5, "memory_kb": 1380}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s301264207", "group_id": "codeNet:p02694", "input_text": "program main;\nvar\n\tcount, target : int64;\n\tsum : real;\nbegin\n\tread(target);\n sum := 100; \n count := 0;\n repeat\n \tsum := int(sum * 1.01);\n count := count + 1;\n until sum >= target;\n\t\n writeln(count);\nend.", "language": "Pascal", "metadata": {"date": 1595303065, "filename_ext": "pas", "original_language": "Pascal (FPC 3.0.4)", "problem_description_relpath": "problem_descriptions/p02694.html", "problem_id": "p02694", "resource_group": "low_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/Pascal/s301264207.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s301264207", "user_id": "u522723337"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "program main;\nvar\n\tcount, target : int64;\n\tsum : real;\nbegin\n\tread(target);\n sum := 100; \n count := 0;\n repeat\n \tsum := int(sum * 1.01);\n count := count + 1;\n until sum >= target;\n\t\n writeln(count);\nend.", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 4, "memory_kb": 1364}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s846791984", "group_id": "codeNet:p02694", "input_text": "uses math;\nvar\n\ti,tar,save : int64;\nbegin\n\tsave:=100;\n i:=0;\n while saveN then C:=N;\n\twriteln(A*C div B);\nend.", "language": "Pascal", "metadata": {"date": 1591916598, "filename_ext": "pas", "original_language": "Pascal (FPC 3.0.4)", "problem_description_relpath": "problem_descriptions/p02696.html", "problem_id": "p02696", "resource_group": "low_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/Pascal/s604735646.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s604735646", "user_id": "u657913472"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "var\n\tA,B,C,N:int64;\nbegin\n\tread(A,B,N);\n\tC:=B-1;\n\tif C>N then C:=N;\n\twriteln(A*C div B);\nend.", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 93, "cpu_time_ms": 1, "memory_kb": 1328}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s626642904", "group_id": "codeNet:p02699", "input_text": "program train;\nvar \n s, w : longint;\nbegin\n read(s, w);\n if w >= s \n then write('unsafe')\n else write('safe');\nend. ", "language": "Pascal", "metadata": {"date": 1597014847, "filename_ext": "pas", "original_language": "Pascal (FPC 3.0.4)", "problem_description_relpath": "problem_descriptions/p02699.html", "problem_id": "p02699", "resource_group": "low_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/Pascal/s626642904.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s626642904", "user_id": "u999320099"}, "prompt_components": {"gold_output": "unsafe\n", "input_to_evaluate": "program train;\nvar \n s, w : longint;\nbegin\n read(s, w);\n if w >= s \n then write('unsafe')\n else write('safe');\nend. ", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 5, "memory_kb": 1372}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s495554859", "group_id": "codeNet:p02699", "input_text": "program main;\nvar s, w : integer;\nbegin\n readln(s, w);\n if w >= s then\n writeln('unsafe')\n else\n writeln('safe');\nend.", "language": "Pascal", "metadata": {"date": 1596824643, "filename_ext": "pas", "original_language": "Pascal (FPC 3.0.4)", "problem_description_relpath": "problem_descriptions/p02699.html", "problem_id": "p02699", "resource_group": "low_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/Pascal/s495554859.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s495554859", "user_id": "u766932905"}, "prompt_components": {"gold_output": "unsafe\n", "input_to_evaluate": "program main;\nvar s, w : integer;\nbegin\n readln(s, w);\n if w >= s then\n writeln('unsafe')\n else\n writeln('safe');\nend.", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 5, "memory_kb": 1384}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s679274452", "group_id": "codeNet:p02699", "input_text": "program main;\nvar \n\ta,b : int64;\nbegin\n\treadln(a,b);\n if a>b\n \tthen writeln('safe')\n else writeln('unsafe');\nend.", "language": "Pascal", "metadata": {"date": 1596685160, "filename_ext": "pas", "original_language": "Pascal (FPC 3.0.4)", "problem_description_relpath": "problem_descriptions/p02699.html", "problem_id": "p02699", "resource_group": "low_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/Pascal/s679274452.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s679274452", "user_id": "u068203622"}, "prompt_components": {"gold_output": "unsafe\n", "input_to_evaluate": "program main;\nvar \n\ta,b : int64;\nbegin\n\treadln(a,b);\n if a>b\n \tthen writeln('safe')\n else writeln('unsafe');\nend.", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 125, "cpu_time_ms": 7, "memory_kb": 1388}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s062293415", "group_id": "codeNet:p02699", "input_text": "program main;\nvar s,w : integer;\nbegin\n readln(s,w);\n if s > w\n then writeln('safe')\n else writeln('unsafe');\nend.", "language": "Pascal", "metadata": {"date": 1595785083, "filename_ext": "pas", "original_language": "Pascal (FPC 3.0.4)", "problem_description_relpath": "problem_descriptions/p02699.html", "problem_id": "p02699", "resource_group": "low_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/Pascal/s062293415.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s062293415", "user_id": "u225670189"}, "prompt_components": {"gold_output": "unsafe\n", "input_to_evaluate": "program main;\nvar s,w : integer;\nbegin\n readln(s,w);\n if s > w\n then writeln('safe')\n else writeln('unsafe');\nend.", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 4, "memory_kb": 1372}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s910129475", "group_id": "codeNet:p02701", "input_text": "program hi;\ntype ars = array[1..200000] of string[10];\nvar \n n, i, cnt: longint;\n s, tmp: ars;\n \nprocedure mSort(var a, tmp: ars; l, r: longint);\nvar m, i, i1, i2: longint;\nbegin\n if l < r then begin\n m := (l + r) div 2;\n mSort(a, tmp, l, m);\n mSort(a, tmp, m + 1, r);\n i := l; i1 := l; i2 := m + 1;\n while (i1 <= m) and (i2 <= r) do begin\n if a[i1] <= a[i2] then begin\n tmp[i] := a[i1];\n inc(i1);\n end else begin\n tmp[i] := a[i2];\n inc(i2);\n end;\n inc(i);\n end;\n while i1 <= m do begin\n tmp[i] := a[i1];\n inc(i1); inc(i);\n end;\n while i2 <= r do begin\n tmp[i] := a[i2];\n inc(i2); inc(i);\n end;\n for i := l to r do \n a[i] := tmp[i];\n end;\nend;\n \nbegin\n readln(n);\n for i := 1 to n do \n readln(s[i]);\n mSort(s, tmp, 1, n);\n cnt := 1;\n for i := 1 to n - 1 do \n if s[i] <> s[i + 1] then\n inc(cnt);\n writeln(cnt);\nend.", "language": "Pascal", "metadata": {"date": 1596728692, "filename_ext": "pas", "original_language": "Pascal (FPC 3.0.4)", "problem_description_relpath": "problem_descriptions/p02701.html", "problem_id": "p02701", "resource_group": "low_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/Pascal/s910129475.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s910129475", "user_id": "u051422473"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "program hi;\ntype ars = array[1..200000] of string[10];\nvar \n n, i, cnt: longint;\n s, tmp: ars;\n \nprocedure mSort(var a, tmp: ars; l, r: longint);\nvar m, i, i1, i2: longint;\nbegin\n if l < r then begin\n m := (l + r) div 2;\n mSort(a, tmp, l, m);\n mSort(a, tmp, m + 1, r);\n i := l; i1 := l; i2 := m + 1;\n while (i1 <= m) and (i2 <= r) do begin\n if a[i1] <= a[i2] then begin\n tmp[i] := a[i1];\n inc(i1);\n end else begin\n tmp[i] := a[i2];\n inc(i2);\n end;\n inc(i);\n end;\n while i1 <= m do begin\n tmp[i] := a[i1];\n inc(i1); inc(i);\n end;\n while i2 <= r do begin\n tmp[i] := a[i2];\n inc(i2); inc(i);\n end;\n for i := l to r do \n a[i] := tmp[i];\n end;\nend;\n \nbegin\n readln(n);\n for i := 1 to n do \n readln(s[i]);\n mSort(s, tmp, 1, n);\n cnt := 1;\n for i := 1 to n - 1 do \n if s[i] <> s[i + 1] then\n inc(cnt);\n writeln(cnt);\nend.", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1105, "cpu_time_ms": 147, "memory_kb": 4508}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s953252761", "group_id": "codeNet:p02701", "input_text": "program hi;\ntype ars = array[1..200000] of string;\nvar \n n, i, cnt: longint;\n s, tmp: ars;\n \nprocedure mSort(var a, tmp: ars; l, r: longint);\nvar m, i, i1, i2: longint;\nbegin\n if l < r then begin\n m := (l + r) div 2;\n mSort(a, tmp, l, m);\n mSort(a, tmp, m + 1, r);\n i := l; i1 := l; i2 := m + 1;\n while (i1 <= m) and (i2 <= r) do begin\n if a[i1] <= a[i2] then begin\n tmp[i] := a[i1];\n inc(i1);\n end else begin\n tmp[i] := a[i2];\n inc(i2);\n end;\n inc(i);\n end;\n if i1 <= m then \n while i1 <= m do begin\n tmp[i] := a[i1];\n inc(i1); inc(i);\n end \n else \n while i2 <= r do begin\n tmp[i] := a[i2];\n inc(i2); inc(i);\n end;\n for i := l to r do \n a[i] := tmp[i];\n end;\nend;\n \nbegin\n readln(n);\n for i := 1 to n do \n readln(s[i]);\n mSort(s, tmp, 1, n);\n cnt := 1;\n for i := 1 to n - 1 do \n if s[i] <> s[i + 1] then\n inc(cnt);\n writeln(cnt);\nend.", "language": "Pascal", "metadata": {"date": 1596728424, "filename_ext": "pas", "original_language": "Pascal (FPC 3.0.4)", "problem_description_relpath": "problem_descriptions/p02701.html", "problem_id": "p02701", "resource_group": "low_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/Pascal/s953252761.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s953252761", "user_id": "u051422473"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "program hi;\ntype ars = array[1..200000] of string;\nvar \n n, i, cnt: longint;\n s, tmp: ars;\n \nprocedure mSort(var a, tmp: ars; l, r: longint);\nvar m, i, i1, i2: longint;\nbegin\n if l < r then begin\n m := (l + r) div 2;\n mSort(a, tmp, l, m);\n mSort(a, tmp, m + 1, r);\n i := l; i1 := l; i2 := m + 1;\n while (i1 <= m) and (i2 <= r) do begin\n if a[i1] <= a[i2] then begin\n tmp[i] := a[i1];\n inc(i1);\n end else begin\n tmp[i] := a[i2];\n inc(i2);\n end;\n inc(i);\n end;\n if i1 <= m then \n while i1 <= m do begin\n tmp[i] := a[i1];\n inc(i1); inc(i);\n end \n else \n while i2 <= r do begin\n tmp[i] := a[i2];\n inc(i2); inc(i);\n end;\n for i := l to r do \n a[i] := tmp[i];\n end;\nend;\n \nbegin\n readln(n);\n for i := 1 to n do \n readln(s[i]);\n mSort(s, tmp, 1, n);\n cnt := 1;\n for i := 1 to n - 1 do \n if s[i] <> s[i + 1] then\n inc(cnt);\n writeln(cnt);\nend.", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1172, "cpu_time_ms": 327, "memory_kb": 59984}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s191045020", "group_id": "codeNet:p02701", "input_text": "program main;\nvar n,i,j,c : longint;\n a : array[1..10000] of string;\n t : boolean;\nbegin\n c := 0;\n t := true;\n readln(n);\n for i := 1 to n do begin\n readln(a[i]);\n if i > 1 then\n for j := 1 to i-1 do\n if a[i] = a[j]\n then t := false;\n if t = true\n then inc(c)\n else t:=true;\n end;\n writeln(c);\nend.", "language": "Pascal", "metadata": {"date": 1596727482, "filename_ext": "pas", "original_language": "Pascal (FPC 3.0.4)", "problem_description_relpath": "problem_descriptions/p02701.html", "problem_id": "p02701", "resource_group": "low_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/Pascal/s191045020.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s191045020", "user_id": "u225670189"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "program main;\nvar n,i,j,c : longint;\n a : array[1..10000] of string;\n t : boolean;\nbegin\n c := 0;\n t := true;\n readln(n);\n for i := 1 to n do begin\n readln(a[i]);\n if i > 1 then\n for j := 1 to i-1 do\n if a[i] = a[j]\n then t := false;\n if t = true\n then inc(c)\n else t:=true;\n end;\n writeln(c);\nend.", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 1041, "memory_kb": 3148}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s171038834", "group_id": "codeNet:p02701", "input_text": "program gacha;\ntype \n arr = array[1..200000] of string;\n\nvar\n n, i, count : longint;\n list : arr;\n listofnew : arr;\n k : string;\n new : boolean;\n\nprocedure swap(var x: string; var y: string);\nvar tmp: string;\nbegin\n tmp := x;\n x := y;\n y := tmp;\nend;\n\nprocedure quicksort(var x: arr; left, right: longint);\nvar \n i, j: integer;\n k: string;\n\nbegin\n if (left < right) then begin \n k := x[left]; \n i := left; j := right;\n repeat \n while (x[i] < k) and (i < right) do \n i := i + 1;\n while (x[j] >= k) and (j > left) do \n j := j - 1;\n if (i < j) then \n swap(x[i], x[j])\n until (i >= j);\n quicksort(x, left, j);\n quicksort(x, j + 1, right);\n end;\nend;\n\nbegin\n readln(n);\n for i := 1 to n do \n readln(list[i]);\n quicksort(list, 1, n);\n listofnew[1] := list[1];\n count := 1;\n for i := 1 to n do begin\n new := true;\n for k in listofnew do begin\n if k = list[i] then begin\n new := false;\n break;\n end\n end;\n if new then begin\n count += 1;\n listofnew[count] := list[i]\n end;\n end;\n writeln(count);\nend.", "language": "Pascal", "metadata": {"date": 1596690926, "filename_ext": "pas", "original_language": "Pascal (FPC 3.0.4)", "problem_description_relpath": "problem_descriptions/p02701.html", "problem_id": "p02701", "resource_group": "low_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/Pascal/s171038834.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s171038834", "user_id": "u583992857"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "program gacha;\ntype \n arr = array[1..200000] of string;\n\nvar\n n, i, count : longint;\n list : arr;\n listofnew : arr;\n k : string;\n new : boolean;\n\nprocedure swap(var x: string; var y: string);\nvar tmp: string;\nbegin\n tmp := x;\n x := y;\n y := tmp;\nend;\n\nprocedure quicksort(var x: arr; left, right: longint);\nvar \n i, j: integer;\n k: string;\n\nbegin\n if (left < right) then begin \n k := x[left]; \n i := left; j := right;\n repeat \n while (x[i] < k) and (i < right) do \n i := i + 1;\n while (x[j] >= k) and (j > left) do \n j := j - 1;\n if (i < j) then \n swap(x[i], x[j])\n until (i >= j);\n quicksort(x, left, j);\n quicksort(x, j + 1, right);\n end;\nend;\n\nbegin\n readln(n);\n for i := 1 to n do \n readln(list[i]);\n quicksort(list, 1, n);\n listofnew[1] := list[1];\n count := 1;\n for i := 1 to n do begin\n new := true;\n for k in listofnew do begin\n if k = list[i] then begin\n new := false;\n break;\n end\n end;\n if new then begin\n count += 1;\n listofnew[count] := list[i]\n end;\n end;\n writeln(count);\nend.", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1291, "cpu_time_ms": 2207, "memory_kb": 59880}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s240028228", "group_id": "codeNet:p02701", "input_text": "program main;\ntype\n arraytype = array[1..200000] of string[10];\nvar\n i, n, count : longint;\n A : arraytype;\n\nprocedure Quicksort(var A : arraytype; left, right : integer);\nvar\n i, j : integer;\n pivot, temp : string;\nbegin\n i := left; \n j := right;\n pivot := A[(left + right) div 2];\n while i <= j do begin\n while A[i] < pivot do \n i := i + 1;\n while A[j] > pivot do \n j := j - 1;\n if i <= j then begin \n temp := A[i];\n A[i] := A[j];\n A[j] := temp;\n i := i + 1;\n j := j - 1;\n end;\n end;\n if left < j\n then Quicksort(A, left, j);\n if i < right \n then Quicksort(A, i, right);\nend;\n\nbegin\n //read\n readln(n);\n for i := 1 to n do \n readln(A[i]);\n \n //sort\n Quicksort(A, 1, n);\n\n //count\n count := 1;\n for i := 2 to n do\n if A[i] <> A[i-1]\n then count := count + 1;\n writeln(count);\nend.", "language": "Pascal", "metadata": {"date": 1596667828, "filename_ext": "pas", "original_language": "Pascal (FPC 3.0.4)", "problem_description_relpath": "problem_descriptions/p02701.html", "problem_id": "p02701", "resource_group": "low_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/Pascal/s240028228.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s240028228", "user_id": "u581648177"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "program main;\ntype\n arraytype = array[1..200000] of string[10];\nvar\n i, n, count : longint;\n A : arraytype;\n\nprocedure Quicksort(var A : arraytype; left, right : integer);\nvar\n i, j : integer;\n pivot, temp : string;\nbegin\n i := left; \n j := right;\n pivot := A[(left + right) div 2];\n while i <= j do begin\n while A[i] < pivot do \n i := i + 1;\n while A[j] > pivot do \n j := j - 1;\n if i <= j then begin \n temp := A[i];\n A[i] := A[j];\n A[j] := temp;\n i := i + 1;\n j := j - 1;\n end;\n end;\n if left < j\n then Quicksort(A, left, j);\n if i < right \n then Quicksort(A, i, right);\nend;\n\nbegin\n //read\n readln(n);\n for i := 1 to n do \n readln(A[i]);\n \n //sort\n Quicksort(A, 1, n);\n\n //count\n count := 1;\n for i := 2 to n do\n if A[i] <> A[i-1]\n then count := count + 1;\n writeln(count);\nend.", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 987, "cpu_time_ms": 263, "memory_kb": 2404}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s994032980", "group_id": "codeNet:p02701", "input_text": "program gacha;\nvar\n n, i, j, count : longint;\n list : array[1..200000] of string ;\n listofnew : array[1..200000] of string;\n temp, k : string;\n new : boolean;\nbegin\n readln(n);\n for i := 1 to n do \n readln(list[i]);\n\n for i := 1 to n - 1 do begin\n for j := 1 to n - i do begin\n if list[j] > list[j + 1] then begin\n temp := list[j];\n list[j] := list[j + 1];\n list[j + 1] := temp;\n end;\n end;\n end;\n\n listofnew[1] := list[1];\n count := 1;\n for i := 1 to n do begin\n new := true;\n for k in listofnew do begin\n if k = list[i] then begin\n new := false;\n break;\n end\n end;\n if new then begin\n count += 1;\n listofnew[count] := list[i]\n end;\n end;\n writeln(count);\nend.", "language": "Pascal", "metadata": {"date": 1596612067, "filename_ext": "pas", "original_language": "Pascal (FPC 3.0.4)", "problem_description_relpath": "problem_descriptions/p02701.html", "problem_id": "p02701", "resource_group": "low_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/Pascal/s994032980.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s994032980", "user_id": "u583992857"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "program gacha;\nvar\n n, i, j, count : longint;\n list : array[1..200000] of string ;\n listofnew : array[1..200000] of string;\n temp, k : string;\n new : boolean;\nbegin\n readln(n);\n for i := 1 to n do \n readln(list[i]);\n\n for i := 1 to n - 1 do begin\n for j := 1 to n - i do begin\n if list[j] > list[j + 1] then begin\n temp := list[j];\n list[j] := list[j + 1];\n list[j + 1] := temp;\n end;\n end;\n end;\n\n listofnew[1] := list[1];\n count := 1;\n for i := 1 to n do begin\n new := true;\n for k in listofnew do begin\n if k = list[i] then begin\n new := false;\n break;\n end\n end;\n if new then begin\n count += 1;\n listofnew[count] := list[i]\n end;\n end;\n writeln(count);\nend.", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 900, "cpu_time_ms": 2207, "memory_kb": 58420}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s265532658", "group_id": "codeNet:p02706", "input_text": "program main;\nvar n, m, i, a : integer;\nbegin\n\treadln(n, m);\n for i := 1 to m do begin\n read(a);\n n := n - a;\n end;\n if (n >= 0)\n then writeln(n)\n else writeln('-1'); \nend.", "language": "Pascal", "metadata": {"date": 1596041619, "filename_ext": "pas", "original_language": "Pascal (FPC 3.0.4)", "problem_description_relpath": "problem_descriptions/p02706.html", "problem_id": "p02706", "resource_group": "low_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/Pascal/s265532658.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s265532658", "user_id": "u384260326"}, "prompt_components": {"gold_output": "30\n", "input_to_evaluate": "program main;\nvar n, m, i, a : integer;\nbegin\n\treadln(n, m);\n for i := 1 to m do begin\n read(a);\n n := n - a;\n end;\n if (n >= 0)\n then writeln(n)\n else writeln('-1'); \nend.", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 3, "memory_kb": 1384}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s895990465", "group_id": "codeNet:p02706", "input_text": "program main;\nvar n,sum,h : longint;\n m,a,i : integer;\nbegin\n sum:=0;\n readln(n,m);\n for i := 1 to m do begin\n read(a);\n sum := sum + a;\n end;\n h:= n-sum;\n if h >= 0\n then writeln(h)\n else writeln('-1')\nend.", "language": "Pascal", "metadata": {"date": 1595784607, "filename_ext": "pas", "original_language": "Pascal (FPC 3.0.4)", "problem_description_relpath": "problem_descriptions/p02706.html", "problem_id": "p02706", "resource_group": "low_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/Pascal/s895990465.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s895990465", "user_id": "u225670189"}, "prompt_components": {"gold_output": "30\n", "input_to_evaluate": "program main;\nvar n,sum,h : longint;\n m,a,i : integer;\nbegin\n sum:=0;\n readln(n,m);\n for i := 1 to m do begin\n read(a);\n sum := sum + a;\n end;\n h:= n-sum;\n if h >= 0\n then writeln(h)\n else writeln('-1')\nend.", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 248, "cpu_time_ms": 6, "memory_kb": 1376}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s576239880", "group_id": "codeNet:p02706", "input_text": "program HelloWorld;\nvar\n i, x, m, n : integer;\nbegin\n readln(m, n);\n for i := 1 to n do begin\n read(x);\n m := m - x;\n end;\n if m >= 0\n then writeln(m)\n else writeln(-1);\nend.\n", "language": "Pascal", "metadata": {"date": 1595438927, "filename_ext": "pas", "original_language": "Pascal (FPC 3.0.4)", "problem_description_relpath": "problem_descriptions/p02706.html", "problem_id": "p02706", "resource_group": "low_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/Pascal/s576239880.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s576239880", "user_id": "u581648177"}, "prompt_components": {"gold_output": "30\n", "input_to_evaluate": "program HelloWorld;\nvar\n i, x, m, n : integer;\nbegin\n readln(m, n);\n for i := 1 to n do begin\n read(x);\n m := m - x;\n end;\n if m >= 0\n then writeln(m)\n else writeln(-1);\nend.\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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 218, "cpu_time_ms": 4, "memory_kb": 1328}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s805725367", "group_id": "codeNet:p02706", "input_text": "program main;\nvar\n n, m, temp, i : integer;\nbegin\n readln(n, m);\n\n for i := 1 to m do begin\n read(temp);\n n -= temp;\n end;\n\n if (n >= 0) then \n writeln(n)\n else\n writeln(-1);\nend.", "language": "Pascal", "metadata": {"date": 1595399353, "filename_ext": "pas", "original_language": "Pascal (FPC 3.0.4)", "problem_description_relpath": "problem_descriptions/p02706.html", "problem_id": "p02706", "resource_group": "low_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/Pascal/s805725367.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s805725367", "user_id": "u151858600"}, "prompt_components": {"gold_output": "30\n", "input_to_evaluate": "program main;\nvar\n n, m, temp, i : integer;\nbegin\n readln(n, m);\n\n for i := 1 to m do begin\n read(temp);\n n -= temp;\n end;\n\n if (n >= 0) then \n writeln(n)\n else\n writeln(-1);\nend.", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 5, "memory_kb": 1384}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s648228128", "group_id": "codeNet:p02706", "input_text": "program main;\nvar\n\tn, m, i, free, total : int64;\n\ta : array[1..100000] of int64;\nbegin\n\tread(n, m);\n total := 0;\n for i := 1 to m do begin\n \tread(a[i]);\n total := total + a[i];\n end;\n\tfree := n - total;\n if free > 0\n \tthen writeln(free)\n \telse writeln('-1');\nend.\n \n ", "language": "Pascal", "metadata": {"date": 1595299355, "filename_ext": "pas", "original_language": "Pascal (FPC 3.0.4)", "problem_description_relpath": "problem_descriptions/p02706.html", "problem_id": "p02706", "resource_group": "low_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/Pascal/s648228128.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s648228128", "user_id": "u522723337"}, "prompt_components": {"gold_output": "30\n", "input_to_evaluate": "program main;\nvar\n\tn, m, i, free, total : int64;\n\ta : array[1..100000] of int64;\nbegin\n\tread(n, m);\n total := 0;\n for i := 1 to m do begin\n \tread(a[i]);\n total := total + a[i];\n end;\n\tfree := n - total;\n if free > 0\n \tthen writeln(free)\n \telse writeln('-1');\nend.\n \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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 5, "memory_kb": 1372}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s145724045", "group_id": "codeNet:p02706", "input_text": "var N,i,X,S,A:Longint;\nbegin\nread(X,N);\nfor i:=1 to N do begin\nread(A);\ninc(S,A);\nend;\nif S>X then writeln(-1)else writeln(X-S);\nend.", "language": "Pascal", "metadata": {"date": 1587533170, "filename_ext": "pas", "original_language": "Pascal (FPC 3.0.4)", "problem_description_relpath": "problem_descriptions/p02706.html", "problem_id": "p02706", "resource_group": "low_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/Pascal/s145724045.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s145724045", "user_id": "u657913472"}, "prompt_components": {"gold_output": "30\n", "input_to_evaluate": "var N,i,X,S,A:Longint;\nbegin\nread(X,N);\nfor i:=1 to N do begin\nread(A);\ninc(S,A);\nend;\nif S>X then writeln(-1)else writeln(X-S);\nend.", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 3, "memory_kb": 1384}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s626503639", "group_id": "codeNet:p02706", "input_text": "Uses math;\nVar n,m,i,a:Longint;\n sum:Int64;\nBegin\n Readln(n,m);\n For i:=1 to m do begin\n Read(a);\n sum:=sum+a;\n End;\n Writeln(max(n-sum,-1));\nEnd.", "language": "Pascal", "metadata": {"date": 1587345169, "filename_ext": "pas", "original_language": "Pascal (FPC 3.0.4)", "problem_description_relpath": "problem_descriptions/p02706.html", "problem_id": "p02706", "resource_group": "low_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/Pascal/s626503639.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s626503639", "user_id": "u866155170"}, "prompt_components": {"gold_output": "30\n", "input_to_evaluate": "Uses math;\nVar n,m,i,a:Longint;\n sum:Int64;\nBegin\n Readln(n,m);\n For i:=1 to m do begin\n Read(a);\n sum:=sum+a;\n End;\n Writeln(max(n-sum,-1));\nEnd.", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 3, "memory_kb": 1376}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s055348648", "group_id": "codeNet:p02707", "input_text": "var\n\ti,n,input:longint;\n arr: array [1..200005] of integer;\nbegin\n\treadln(n);\n for i:=1 to n do arr[i]:=0;\n for i:=1 to n-1 do begin\n \tread(input);\n inc(arr[input]);\n end;\n for i:=1 to n do writeln(arr[i]);\nend.", "language": "Pascal", "metadata": {"date": 1596866524, "filename_ext": "pas", "original_language": "Pascal (FPC 3.0.4)", "problem_description_relpath": "problem_descriptions/p02707.html", "problem_id": "p02707", "resource_group": "low_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/Pascal/s055348648.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s055348648", "user_id": "u678829637"}, "prompt_components": {"gold_output": "2\n2\n0\n0\n0\n", "input_to_evaluate": "var\n\ti,n,input:longint;\n arr: array [1..200005] of integer;\nbegin\n\treadln(n);\n for i:=1 to n do arr[i]:=0;\n for i:=1 to n-1 do begin\n \tread(input);\n inc(arr[input]);\n end;\n for i:=1 to n do writeln(arr[i]);\nend.", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 42, "memory_kb": 1384}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s853693760", "group_id": "codeNet:p02707", "input_text": "program main;\nvar b : array[1..200000] of longint;\n n,i,l : longint;\nbegin\n readln(n);\n for i := 1 to n do\n b[i]:=0;\n for i := 1 to n-1 do begin\n read(l);\n inc(b[l]);\n end;\n for i := 1 to n do\n writeln(b[i]);\nend.", "language": "Pascal", "metadata": {"date": 1596760876, "filename_ext": "pas", "original_language": "Pascal (FPC 3.0.4)", "problem_description_relpath": "problem_descriptions/p02707.html", "problem_id": "p02707", "resource_group": "low_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/Pascal/s853693760.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s853693760", "user_id": "u225670189"}, "prompt_components": {"gold_output": "2\n2\n0\n0\n0\n", "input_to_evaluate": "program main;\nvar b : array[1..200000] of longint;\n n,i,l : longint;\nbegin\n readln(n);\n for i := 1 to n do\n b[i]:=0;\n for i := 1 to n-1 do begin\n read(l);\n inc(b[l]);\n end;\n for i := 1 to n do\n writeln(b[i]);\nend.", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 41, "memory_kb": 1400}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s794026508", "group_id": "codeNet:p02707", "input_text": "var\n\tn, k : integer;\n a : array[0..200005] of integer;\n i : integer;\n \nbegin\n\treadln(n);\n for i := 2 to n do\n begin\n \tread(k);\n a[k] := a[k] + 1;\n end;\n writeln;\n for i := 1 to n do\n \twriteln(a[i]);\nend.", "language": "Pascal", "metadata": {"date": 1596169263, "filename_ext": "pas", "original_language": "Pascal (FPC 3.0.4)", "problem_description_relpath": "problem_descriptions/p02707.html", "problem_id": "p02707", "resource_group": "low_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/Pascal/s794026508.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s794026508", "user_id": "u838994261"}, "prompt_components": {"gold_output": "2\n2\n0\n0\n0\n", "input_to_evaluate": "var\n\tn, k : integer;\n a : array[0..200005] of integer;\n i : integer;\n \nbegin\n\treadln(n);\n for i := 2 to n do\n begin\n \tread(k);\n a[k] := a[k] + 1;\n end;\n writeln;\n for i := 1 to n do\n \twriteln(a[i]);\nend.", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 41, "memory_kb": 1396}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s853152279", "group_id": "codeNet:p02707", "input_text": "program main;\nvar\n n, i, a : LongInt;\n cnt : array[1..200000] of LongInt;\nbegin\n for i := 1 to n do\n cnt[i] := 0;\n\n readln(n);\n for i := 2 to n do begin\n read(a);\n cnt[a] := cnt[a] + 1;\n end;\n\n for i := 1 to n do\n writeln(cnt[i]);\nend.", "language": "Pascal", "metadata": {"date": 1595818433, "filename_ext": "pas", "original_language": "Pascal (FPC 3.0.4)", "problem_description_relpath": "problem_descriptions/p02707.html", "problem_id": "p02707", "resource_group": "low_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/Pascal/s853152279.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s853152279", "user_id": "u085059942"}, "prompt_components": {"gold_output": "2\n2\n0\n0\n0\n", "input_to_evaluate": "program main;\nvar\n n, i, a : LongInt;\n cnt : array[1..200000] of LongInt;\nbegin\n for i := 1 to n do\n cnt[i] := 0;\n\n readln(n);\n for i := 2 to n do begin\n read(a);\n cnt[a] := cnt[a] + 1;\n end;\n\n for i := 1 to n do\n writeln(cnt[i]);\nend.", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 42, "memory_kb": 1396}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s298681185", "group_id": "codeNet:p02707", "input_text": "var n,i,m:longint;\n a:array[0..200000]of longint;\nbegin\n readln(n);\n for i:=2 to n do\n begin\n read(m);\n inc(a[m]);\n end;\n for i:=1 to n do\n write(a[i],' ');\nend.", "language": "Pascal", "metadata": {"date": 1588705157, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p02707.html", "problem_id": "p02707", "resource_group": "low_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/Pascal/s298681185.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s298681185", "user_id": "u426964396"}, "prompt_components": {"gold_output": "2\n2\n0\n0\n0\n", "input_to_evaluate": "var n,i,m:longint;\n a:array[0..200000]of longint;\nbegin\n readln(n);\n for i:=2 to n do\n begin\n read(m);\n inc(a[m]);\n end;\n for i:=1 to n do\n write(a[i],' ');\nend.", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 38, "memory_kb": 1380}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s222431582", "group_id": "codeNet:p02707", "input_text": "var n, i, x : longint;\n cnt : array of longint;\n\nbegin\n readln(n);\n setlength(cnt, n);\n for i := low(cnt) to high(cnt) do cnt[i] := 0;\n for i := 1 to n - 1 do\n begin\n read(x);\n inc(cnt[x - 1]);\n end;\n for i := low(cnt) to high(cnt) do writeln(cnt[i]);\nend.", "language": "Pascal", "metadata": {"date": 1587346952, "filename_ext": "pas", "original_language": "Pascal (FPC 3.0.4)", "problem_description_relpath": "problem_descriptions/p02707.html", "problem_id": "p02707", "resource_group": "low_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/Pascal/s222431582.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s222431582", "user_id": "u366795445"}, "prompt_components": {"gold_output": "2\n2\n0\n0\n0\n", "input_to_evaluate": "var n, i, x : longint;\n cnt : array of longint;\n\nbegin\n readln(n);\n setlength(cnt, n);\n for i := low(cnt) to high(cnt) do cnt[i] := 0;\n for i := 1 to n - 1 do\n begin\n read(x);\n inc(cnt[x - 1]);\n end;\n for i := low(cnt) to high(cnt) do writeln(cnt[i]);\nend.", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 37, "memory_kb": 1392}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s686227511", "group_id": "codeNet:p02708", "input_text": "var n,k:int64;\nbegin\nread(n,k);\nwriteln((n-k+2)*((n-k+1)*(n+2*k)+6)div 6 mod 1000000007);\nend.", "language": "Pascal", "metadata": {"date": 1587533907, "filename_ext": "pas", "original_language": "Pascal (FPC 3.0.4)", "problem_description_relpath": "problem_descriptions/p02708.html", "problem_id": "p02708", "resource_group": "low_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/Pascal/s686227511.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s686227511", "user_id": "u657913472"}, "prompt_components": {"gold_output": "10\n", "input_to_evaluate": "var n,k:int64;\nbegin\nread(n,k);\nwriteln((n-k+2)*((n-k+1)*(n+2*k)+6)div 6 mod 1000000007);\nend.", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 1, "memory_kb": 1384}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s058939530", "group_id": "codeNet:p02708", "input_text": "program Sum_of_Large_Numbers;\nuses math;\nconst\n m: int64 = 1000000007;\n h: int64 = 500000004;\n s: int64 = 166666668;\nvar\n n, k: int64;\nfunction f(i: int64): int64;\nbegin\n f := i*(((n+1)*(h*(i+1) mod m)-(s*((i+1)*(i*2+1) mod m) mod m)+1) mod m);\nend;\nbegin\n read(n, k);\n writeln((f(n+1)-f(k-1)+m) mod m);\nend.", "language": "Pascal", "metadata": {"date": 1587359621, "filename_ext": "pas", "original_language": "Pascal (FPC 3.0.4)", "problem_description_relpath": "problem_descriptions/p02708.html", "problem_id": "p02708", "resource_group": "low_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/Pascal/s058939530.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s058939530", "user_id": "u506403362"}, "prompt_components": {"gold_output": "10\n", "input_to_evaluate": "program Sum_of_Large_Numbers;\nuses math;\nconst\n m: int64 = 1000000007;\n h: int64 = 500000004;\n s: int64 = 166666668;\nvar\n n, k: int64;\nfunction f(i: int64): int64;\nbegin\n f := i*(((n+1)*(h*(i+1) mod m)-(s*((i+1)*(i*2+1) mod m) mod m)+1) mod m);\nend;\nbegin\n read(n, k);\n writeln((f(n+1)-f(k-1)+m) mod m);\nend.", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 3, "memory_kb": 1380}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s123952455", "group_id": "codeNet:p02709", "input_text": "type SortDataType=Longint;\nfunction SortCmp(const x,y:SortDataType):Boolean;forward;\nprocedure SortImpl(var A:Array of SortDataType;L,R:Longint);\nvar\n\ttmp:SortDataType;\n\tmid,il,ir:Longint;\nbegin\n\tif R-L<20 then begin\n\t\tfor ir:=R-1 downto L+1 do for il:=L to ir-1 do if SortCmp(A[il+1],A[il])then begin\n\t\t\ttmp:=A[il];\n\t\t\tA[il]:=A[il+1];\n\t\t\tA[il+1]:=tmp;\n\t\tend;\n\tend else begin\n\t\tmid:=(L+R)div 2;\n\t\tif SortCmp(A[mid],A[L])then begin\n\t\t\ttmp:=A[mid];\n\t\t\tA[mid]:=A[L];\n\t\t\tA[L]:=tmp;\n\t\tend;\n\t\tif SortCmp(A[R-1],A[mid])then begin\n\t\t\ttmp:=A[R-1];\n\t\t\tA[R-1]:=A[mid];\n\t\t\tA[mid]:=tmp;\n\t\t\tif SortCmp(A[mid],A[L])then begin\n\t\t\t\ttmp:=A[mid];\n\t\t\t\tA[mid]:=A[L];\n\t\t\t\tA[L]:=tmp;\n\t\t\tend;\n\t\tend;\n\t\til:=L;\n\t\tir:=R-1;\n\t\twhile il<=ir do begin\n\t\t\twhile SortCmp(A[il],A[mid])do inc(il);\n\t\t\twhile SortCmp(A[mid],A[ir])do dec(ir);\n\t\t\tif ilA[y];\nend;\nprocedure chmax(var a:int64;b:int64);\nbegin\n\tif aA[y];\nend;\nprocedure chmax(var a:int64;b:int64);\nbegin\n\tif aa[i,j] then\n fx[i]:=a[i,j];\n end;\n for i:=1 to n do\n begin\n fy[i]:=vc;\n for j:=1 to n do\n if a[i,j]-fx[i]0 then\n begin\n ddx[MatchY[i]]:=true;\n ddy[i]:=true;\n end;\n delta:=vc;\n for i:=1 to n do\n if ddx[i] then\n for j:=1 to n do\n if (not ddy[j]) and (delta>get(i,j)) then\n delta:=get(i,j);\n for i:=1 to n do\n begin\n if ddx[i] then fx[i]:=fx[i]+delta;\n if ddy[i] then fy[i]:=fy[i]-delta;\n end;\nend;\n\nprocedure xuli;\nvar res:data;\n i,j:longint;\nbegin\n for i:=1 to n do\n begin\n start:=i;\n finish:=0;\n repeat\n bfs;\n if finish=0 then subx_addy;\n until finish<>0;\n enlager(finish);\n end;\n res:=0;\n for i:=1 to n do\n if MatchX[i]<>0 then\n inc(res,a[i,Matchx[i]]);\n writeln(mm*n - res);\n {for i:=1 to n do\n if MatchX[i]<>0 then\n writeln(i, ' ',MatchX[i]); }\n\nend;\n\nbegin\n docfile;\n init;\n xuli;\nend.\n", "language": "Pascal", "metadata": {"date": 1587430203, "filename_ext": "pas", "original_language": "Pascal (FPC 3.0.4)", "problem_description_relpath": "problem_descriptions/p02709.html", "problem_id": "p02709", "resource_group": "low_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/Pascal/s249395217.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s249395217", "user_id": "u840460038"}, "prompt_components": {"gold_output": "20\n", "input_to_evaluate": "uses crt,math;\nconst fi='';\n nmax=1999;\n vc=100000000;\ntype data=int64;\nvar\n f:text;\n A:array[0..nmax+1,0..nmax+1] of data;\n Fx,Fy,MatchX,MatchY,tr:array[0..nmax+1] of data;\n Q:array[0..nmax*nmax] of data;\n ddx,ddy:array[0..nmax+1] of boolean;\n dau,cuoi,start,finish:data;\n n:longint;\n mm :data;\n\nprocedure docfile;\nvar u,v,c:data;\n i,j:longint;\nbegin\n clrscr;\n readln(n);\n for i:=1 to n do\n begin\n read(u);\n for j:=1 to n do begin a[i,j] := u*abs(i-j); mm := max(mm,a[i,j]); end;\n end;\n for i:=1 to n do\n begin\n for j:=1 to n do a[i,j] := mm - a[i,j];\n end;\nend;\n\nprocedure init;\nvar i,j:longint;\nbegin\n fillchar(MatchX,sizeof(matchx),0);\n MatchY:=MatchX;\n\n for i:=1 to n do\n begin\n fx[i]:=vc;\n for j:=1 to n do\n if fx[i]>a[i,j] then\n fx[i]:=a[i,j];\n end;\n for i:=1 to n do\n begin\n fy[i]:=vc;\n for j:=1 to n do\n if a[i,j]-fx[i]0 then\n begin\n ddx[MatchY[i]]:=true;\n ddy[i]:=true;\n end;\n delta:=vc;\n for i:=1 to n do\n if ddx[i] then\n for j:=1 to n do\n if (not ddy[j]) and (delta>get(i,j)) then\n delta:=get(i,j);\n for i:=1 to n do\n begin\n if ddx[i] then fx[i]:=fx[i]+delta;\n if ddy[i] then fy[i]:=fy[i]-delta;\n end;\nend;\n\nprocedure xuli;\nvar res:data;\n i,j:longint;\nbegin\n for i:=1 to n do\n begin\n start:=i;\n finish:=0;\n repeat\n bfs;\n if finish=0 then subx_addy;\n until finish<>0;\n enlager(finish);\n end;\n res:=0;\n for i:=1 to n do\n if MatchX[i]<>0 then\n inc(res,a[i,Matchx[i]]);\n writeln(mm*n - res);\n {for i:=1 to n do\n if MatchX[i]<>0 then\n writeln(i, ' ',MatchX[i]); }\n\nend;\n\nbegin\n docfile;\n init;\n xuli;\nend.\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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 4322, "cpu_time_ms": 2206, "memory_kb": 31876}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s220182491", "group_id": "codeNet:p02709", "input_text": "uses crt,math;\nconst fi='';\n nmax=200;\n vc=100000000;\ntype data=int64;\nvar\n f:text;\n A:array[0..nmax+1,0..nmax+1] of data;\n Fx,Fy,MatchX,MatchY,tr:array[0..nmax+1] of data;\n Q:array[0..nmax*nmax] of data;\n ddx,ddy:array[0..nmax+1] of boolean;\n dau,cuoi,start,finish:data;\n n:longint;\n mm :data;\n\nprocedure docfile;\nvar u,v,c:data;\n i,j:longint;\nbegin\n clrscr;\n readln(n);\n for i:=1 to n do\n begin\n read(u);\n for j:=1 to n do begin a[i,j] := u*abs(i-j); mm := max(mm,a[i,j]); end;\n end;\n for i:=1 to n do\n begin\n for j:=1 to n do a[i,j] := mm - a[i,j];\n end;\nend;\n\nprocedure init;\nvar i,j:longint;\nbegin\n fillchar(MatchX,sizeof(matchx),0);\n MatchY:=MatchX;\n\n for i:=1 to n do\n begin\n fx[i]:=vc;\n for j:=1 to n do\n if fx[i]>a[i,j] then\n fx[i]:=a[i,j];\n end;\n for i:=1 to n do\n begin\n fy[i]:=vc;\n for j:=1 to n do\n if a[i,j]-fx[i]0 then\n begin\n ddx[MatchY[i]]:=true;\n ddy[i]:=true;\n end;\n delta:=vc;\n for i:=1 to n do\n if ddx[i] then\n for j:=1 to n do\n if (not ddy[j]) and (delta>get(i,j)) then\n delta:=get(i,j);\n for i:=1 to n do\n begin\n if ddx[i] then fx[i]:=fx[i]+delta;\n if ddy[i] then fy[i]:=fy[i]-delta;\n end;\nend;\n\nprocedure xuli;\nvar res:data;\n i,j:longint;\nbegin\n for i:=1 to n do\n begin\n start:=i;\n finish:=0;\n repeat\n bfs;\n if finish=0 then subx_addy;\n until finish<>0;\n enlager(finish);\n end;\n res:=0;\n for i:=1 to n do\n if MatchX[i]<>0 then\n inc(res,a[i,Matchx[i]]);\n writeln(mm*n - res);\n {for i:=1 to n do\n if MatchX[i]<>0 then\n writeln(i, ' ',MatchX[i]); }\n\nend;\n\nbegin\n docfile;\n init;\n xuli;\nend.\n", "language": "Pascal", "metadata": {"date": 1587347972, "filename_ext": "pas", "original_language": "Pascal (FPC 3.0.4)", "problem_description_relpath": "problem_descriptions/p02709.html", "problem_id": "p02709", "resource_group": "low_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/Pascal/s220182491.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s220182491", "user_id": "u840460038"}, "prompt_components": {"gold_output": "20\n", "input_to_evaluate": "uses crt,math;\nconst fi='';\n nmax=200;\n vc=100000000;\ntype data=int64;\nvar\n f:text;\n A:array[0..nmax+1,0..nmax+1] of data;\n Fx,Fy,MatchX,MatchY,tr:array[0..nmax+1] of data;\n Q:array[0..nmax*nmax] of data;\n ddx,ddy:array[0..nmax+1] of boolean;\n dau,cuoi,start,finish:data;\n n:longint;\n mm :data;\n\nprocedure docfile;\nvar u,v,c:data;\n i,j:longint;\nbegin\n clrscr;\n readln(n);\n for i:=1 to n do\n begin\n read(u);\n for j:=1 to n do begin a[i,j] := u*abs(i-j); mm := max(mm,a[i,j]); end;\n end;\n for i:=1 to n do\n begin\n for j:=1 to n do a[i,j] := mm - a[i,j];\n end;\nend;\n\nprocedure init;\nvar i,j:longint;\nbegin\n fillchar(MatchX,sizeof(matchx),0);\n MatchY:=MatchX;\n\n for i:=1 to n do\n begin\n fx[i]:=vc;\n for j:=1 to n do\n if fx[i]>a[i,j] then\n fx[i]:=a[i,j];\n end;\n for i:=1 to n do\n begin\n fy[i]:=vc;\n for j:=1 to n do\n if a[i,j]-fx[i]0 then\n begin\n ddx[MatchY[i]]:=true;\n ddy[i]:=true;\n end;\n delta:=vc;\n for i:=1 to n do\n if ddx[i] then\n for j:=1 to n do\n if (not ddy[j]) and (delta>get(i,j)) then\n delta:=get(i,j);\n for i:=1 to n do\n begin\n if ddx[i] then fx[i]:=fx[i]+delta;\n if ddy[i] then fy[i]:=fy[i]-delta;\n end;\nend;\n\nprocedure xuli;\nvar res:data;\n i,j:longint;\nbegin\n for i:=1 to n do\n begin\n start:=i;\n finish:=0;\n repeat\n bfs;\n if finish=0 then subx_addy;\n until finish<>0;\n enlager(finish);\n end;\n res:=0;\n for i:=1 to n do\n if MatchX[i]<>0 then\n inc(res,a[i,Matchx[i]]);\n writeln(mm*n - res);\n {for i:=1 to n do\n if MatchX[i]<>0 then\n writeln(i, ' ',MatchX[i]); }\n\nend;\n\nbegin\n docfile;\n init;\n xuli;\nend.\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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 4321, "cpu_time_ms": 116, "memory_kb": 1380}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s028325068", "group_id": "codeNet:p02710", "input_text": "var\n\tN,k:int64;\n\ti,u,v,es:Longint;\n\tVV,nxt,beg:Array[1..400000]of Longint;\n\tans:Array[1..200000]of int64;\n\tcnt,c:Array[1..200000]of Longint;\nfunction dfs(u,p:Longint):Longint;\nvar\n\tret,sto,pre,id,t:Longint;\n\tk:int64;\nbegin\n\tret:=1;\n\tsto:=cnt[c[u]];\n\tpre:=sto;\n\tid:=beg[u];\n\twhile id<>0 do begin\n\t\tif VV[id]<>p then begin\n\t\t\tt:=dfs(VV[id],u);\n\t\t\tinc(ret,t);\n\t\t\tk:=t-(cnt[c[u]]-sto);\n\t\t\tsto:=cnt[c[u]];\n\t\t\tdec(ans[c[u]],k*(k+1)div 2);\n\t\tend;\n\t\tid:=nxt[id];\n\tend;\n\tcnt[c[u]]:=pre+ret;\n\tdfs:=ret;\nend;\nbegin\n\tread(N);\n\tfor i:=1 to N do read(c[i]);\n\tfor i:=2 to N do begin\n\t\tread(u,v);\n\t\tinc(es);\n\t\tVV[es]:=v;\n\t\tnxt[es]:=beg[u];\n\t\tbeg[u]:=es;\n\t\tinc(es);\n\t\tVV[es]:=u;\n\t\tnxt[es]:=beg[v];\n\t\tbeg[v]:=es;\n\tend;\n\tdfs(1,0);\n\tfor i:=1 to N do begin\n\t\tinc(ans[i],N*(N+1)div 2);\n\t\tk:=N-cnt[i];\n\t\tdec(ans[i],k*(k+1)div 2);\n\t\twriteln(ans[i]);\n\tend;\nend.\n", "language": "Pascal", "metadata": {"date": 1587537347, "filename_ext": "pas", "original_language": "Pascal (FPC 3.0.4)", "problem_description_relpath": "problem_descriptions/p02710.html", "problem_id": "p02710", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02710/input.txt", "sample_output_relpath": "derived/input_output/data/p02710/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02710/Pascal/s028325068.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s028325068", "user_id": "u657913472"}, "prompt_components": {"gold_output": "5\n4\n0\n", "input_to_evaluate": "var\n\tN,k:int64;\n\ti,u,v,es:Longint;\n\tVV,nxt,beg:Array[1..400000]of Longint;\n\tans:Array[1..200000]of int64;\n\tcnt,c:Array[1..200000]of Longint;\nfunction dfs(u,p:Longint):Longint;\nvar\n\tret,sto,pre,id,t:Longint;\n\tk:int64;\nbegin\n\tret:=1;\n\tsto:=cnt[c[u]];\n\tpre:=sto;\n\tid:=beg[u];\n\twhile id<>0 do begin\n\t\tif VV[id]<>p then begin\n\t\t\tt:=dfs(VV[id],u);\n\t\t\tinc(ret,t);\n\t\t\tk:=t-(cnt[c[u]]-sto);\n\t\t\tsto:=cnt[c[u]];\n\t\t\tdec(ans[c[u]],k*(k+1)div 2);\n\t\tend;\n\t\tid:=nxt[id];\n\tend;\n\tcnt[c[u]]:=pre+ret;\n\tdfs:=ret;\nend;\nbegin\n\tread(N);\n\tfor i:=1 to N do read(c[i]);\n\tfor i:=2 to N do begin\n\t\tread(u,v);\n\t\tinc(es);\n\t\tVV[es]:=v;\n\t\tnxt[es]:=beg[u];\n\t\tbeg[u]:=es;\n\t\tinc(es);\n\t\tVV[es]:=u;\n\t\tnxt[es]:=beg[v];\n\t\tbeg[v]:=es;\n\tend;\n\tdfs(1,0);\n\tfor i:=1 to N do begin\n\t\tinc(ans[i],N*(N+1)div 2);\n\t\tk:=N-cnt[i];\n\t\tdec(ans[i],k*(k+1)div 2);\n\t\twriteln(ans[i]);\n\tend;\nend.\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.\nAdditionally, each vertex is painted in a color, and the color of Vertex i is c_i. Here, the color of each vertex is represented by an integer between 1 and N (inclusive). The same integer corresponds to the same color; different integers correspond to different colors.\n\nFor each k=1, 2, ..., N, solve the following problem:\n\nFind the number of simple paths that visit a vertex painted in the color k one or more times.\n\nNote: The simple paths from Vertex u to v and from v to u are not distinguished.\n\nConstraints\n\n1 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq c_i \\leq N\n\n1 \\leq a_i,b_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\nc_1 c_2 ... c_N\na_1 b_1\n:\na_{N-1} b_{N-1}\n\nOutput\n\nPrint the answers for k = 1, 2, ..., N in order, each in its own line.\n\nSample Input 1\n\n3\n1 2 1\n1 2\n2 3\n\nSample Output 1\n\n5\n4\n0\n\nLet P_{i,j} denote the simple path connecting Vertex i and j.\n\nThere are 5 simple paths that visit a vertex painted in the color 1 one or more times:\n\nP_{1,1}\\,,\\,\nP_{1,2}\\,,\\,\nP_{1,3}\\,,\\,\nP_{2,3}\\,,\\,\nP_{3,3}\n\nThere are 4 simple paths that visit a vertex painted in the color 2 one or more times:\n\nP_{1,2}\\,,\\,\nP_{1,3}\\,,\\,\nP_{2,2}\\,,\\,\nP_{2,3}\n\nThere are no simple paths that visit a vertex painted in the color 3 one or more times.\n\nSample Input 2\n\n1\n1\n\nSample Output 2\n\n1\n\nSample Input 3\n\n2\n1 2\n1 2\n\nSample Output 3\n\n2\n2\n\nSample Input 4\n\n5\n1 2 3 4 5\n1 2\n2 3\n3 4\n3 5\n\nSample Output 4\n\n5\n8\n10\n5\n5\n\nSample Input 5\n\n8\n2 7 2 5 4 1 7 5\n3 1\n1 2\n2 7\n4 5\n5 6\n6 8\n7 8\n\nSample Output 5\n\n18\n15\n0\n14\n23\n0\n23\n0", "sample_input": "3\n1 2 1\n1 2\n2 3\n"}, "reference_outputs": ["5\n4\n0\n"], "source_document_id": "p02710", "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.\nAdditionally, each vertex is painted in a color, and the color of Vertex i is c_i. Here, the color of each vertex is represented by an integer between 1 and N (inclusive). The same integer corresponds to the same color; different integers correspond to different colors.\n\nFor each k=1, 2, ..., N, solve the following problem:\n\nFind the number of simple paths that visit a vertex painted in the color k one or more times.\n\nNote: The simple paths from Vertex u to v and from v to u are not distinguished.\n\nConstraints\n\n1 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq c_i \\leq N\n\n1 \\leq a_i,b_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\nc_1 c_2 ... c_N\na_1 b_1\n:\na_{N-1} b_{N-1}\n\nOutput\n\nPrint the answers for k = 1, 2, ..., N in order, each in its own line.\n\nSample Input 1\n\n3\n1 2 1\n1 2\n2 3\n\nSample Output 1\n\n5\n4\n0\n\nLet P_{i,j} denote the simple path connecting Vertex i and j.\n\nThere are 5 simple paths that visit a vertex painted in the color 1 one or more times:\n\nP_{1,1}\\,,\\,\nP_{1,2}\\,,\\,\nP_{1,3}\\,,\\,\nP_{2,3}\\,,\\,\nP_{3,3}\n\nThere are 4 simple paths that visit a vertex painted in the color 2 one or more times:\n\nP_{1,2}\\,,\\,\nP_{1,3}\\,,\\,\nP_{2,2}\\,,\\,\nP_{2,3}\n\nThere are no simple paths that visit a vertex painted in the color 3 one or more times.\n\nSample Input 2\n\n1\n1\n\nSample Output 2\n\n1\n\nSample Input 3\n\n2\n1 2\n1 2\n\nSample Output 3\n\n2\n2\n\nSample Input 4\n\n5\n1 2 3 4 5\n1 2\n2 3\n3 4\n3 5\n\nSample Output 4\n\n5\n8\n10\n5\n5\n\nSample Input 5\n\n8\n2 7 2 5 4 1 7 5\n3 1\n1 2\n2 7\n4 5\n5 6\n6 8\n7 8\n\nSample Output 5\n\n18\n15\n0\n14\n23\n0\n23\n0", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 104, "memory_kb": 24392}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s166623163", "group_id": "codeNet:p02712", "input_text": "program main;\nvar n, i, sum : longint;\n\nbegin\n readln(n);\n sum := 0;\n for i := 1 to n do\n if not (i mod 3 = 0) or (i mod 5 = 0)\n then sum := sum + i;\n writeln(sum);\nend.\n", "language": "Pascal", "metadata": {"date": 1596251498, "filename_ext": "pas", "original_language": "Pascal (FPC 3.0.4)", "problem_description_relpath": "problem_descriptions/p02712.html", "problem_id": "p02712", "resource_group": "low_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/Pascal/s166623163.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s166623163", "user_id": "u196718449"}, "prompt_components": {"gold_output": "60\n", "input_to_evaluate": "program main;\nvar n, i, sum : longint;\n\nbegin\n readln(n);\n sum := 0;\n for i := 1 to n do\n if not (i mod 3 = 0) or (i mod 5 = 0)\n then sum := sum + i;\n writeln(sum);\nend.\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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 20, "memory_kb": 1320}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s480156480", "group_id": "codeNet:p02712", "input_text": "program main;\nvar n, i, sum : int64;\n\nbegin\n readln(n);\n sum := 0;\n for i := 1 to n do begin\n if not (i mod 3 = 0) or (i mod 5 = 0)\n then sum := sum + i;\n end;\n writeln(sum);\nend.\n", "language": "Pascal", "metadata": {"date": 1596251427, "filename_ext": "pas", "original_language": "Pascal (FPC 3.0.4)", "problem_description_relpath": "problem_descriptions/p02712.html", "problem_id": "p02712", "resource_group": "low_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/Pascal/s480156480.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s480156480", "user_id": "u196718449"}, "prompt_components": {"gold_output": "60\n", "input_to_evaluate": "program main;\nvar n, i, sum : int64;\n\nbegin\n readln(n);\n sum := 0;\n for i := 1 to n do begin\n if not (i mod 3 = 0) or (i mod 5 = 0)\n then sum := sum + i;\n end;\n writeln(sum);\nend.\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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 193, "cpu_time_ms": 21, "memory_kb": 1384}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s299282962", "group_id": "codeNet:p02712", "input_text": "program main;\nvar n, i, sum : int64;\n\nbegin\n readln(n);\n sum := 0;\n for i := 1 to n do\n if not (i mod 3 = 0) or (i mod 5 = 0)\n then sum := sum + i;\n writeln(sum);\nend.\n", "language": "Pascal", "metadata": {"date": 1596251282, "filename_ext": "pas", "original_language": "Pascal (FPC 3.0.4)", "problem_description_relpath": "problem_descriptions/p02712.html", "problem_id": "p02712", "resource_group": "low_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/Pascal/s299282962.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s299282962", "user_id": "u196718449"}, "prompt_components": {"gold_output": "60\n", "input_to_evaluate": "program main;\nvar n, i, sum : int64;\n\nbegin\n readln(n);\n sum := 0;\n for i := 1 to n do\n if not (i mod 3 = 0) or (i mod 5 = 0)\n then sum := sum + i;\n writeln(sum);\nend.\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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 22, "memory_kb": 1372}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s377695917", "group_id": "codeNet:p02712", "input_text": "program main;\n \nvar\n\tn, i, sum : int64;\n \nbegin\n\tsum := 0;\n\treadln(n);\n for i := 1 to n do begin\n \tif (i mod 3 <> 0) and (i mod 5 <> 0)\n \t\tthen sum := sum + i;\n end;\n writeln(sum);\nend.", "language": "Pascal", "metadata": {"date": 1595990546, "filename_ext": "pas", "original_language": "Pascal (FPC 3.0.4)", "problem_description_relpath": "problem_descriptions/p02712.html", "problem_id": "p02712", "resource_group": "low_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/Pascal/s377695917.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s377695917", "user_id": "u838994261"}, "prompt_components": {"gold_output": "60\n", "input_to_evaluate": "program main;\n \nvar\n\tn, i, sum : int64;\n \nbegin\n\tsum := 0;\n\treadln(n);\n for i := 1 to n do begin\n \tif (i mod 3 <> 0) and (i mod 5 <> 0)\n \t\tthen sum := sum + i;\n end;\n writeln(sum);\nend.", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 202, "cpu_time_ms": 27, "memory_kb": 1376}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s525992926", "group_id": "codeNet:p02712", "input_text": "program main;\n \nvar\n\tn, i, sum : int64;\n \nbegin\n\tsum := 0;\n\treadln(n);\n for i := 1 to n do begin\n \tif (i mod 3 <> 0) and (i mod 5 <> 0)\n \t\tthen sum := sum + i;\n end;\n writeln(sum);\nend.", "language": "Pascal", "metadata": {"date": 1595990508, "filename_ext": "pas", "original_language": "Pascal (FPC 3.0.4)", "problem_description_relpath": "problem_descriptions/p02712.html", "problem_id": "p02712", "resource_group": "low_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/Pascal/s525992926.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s525992926", "user_id": "u838994261"}, "prompt_components": {"gold_output": "60\n", "input_to_evaluate": "program main;\n \nvar\n\tn, i, sum : int64;\n \nbegin\n\tsum := 0;\n\treadln(n);\n for i := 1 to n do begin\n \tif (i mod 3 <> 0) and (i mod 5 <> 0)\n \t\tthen sum := sum + i;\n end;\n writeln(sum);\nend.", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 202, "cpu_time_ms": 25, "memory_kb": 1376}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s782288180", "group_id": "codeNet:p02712", "input_text": "program main;\nvar\n n, i : longint;\n sum : int64;\nbegin\n readln(n);\n\n sum :=0;\n for i := 1 to n do\n if not ((i mod 3 = 0)or (i mod 5 = 0)) then\n sum := sum + i;\n\n writeln(sum);\nend.", "language": "Pascal", "metadata": {"date": 1595969198, "filename_ext": "pas", "original_language": "Pascal (FPC 3.0.4)", "problem_description_relpath": "problem_descriptions/p02712.html", "problem_id": "p02712", "resource_group": "low_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/Pascal/s782288180.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s782288180", "user_id": "u766932905"}, "prompt_components": {"gold_output": "60\n", "input_to_evaluate": "program main;\nvar\n n, i : longint;\n sum : int64;\nbegin\n readln(n);\n\n sum :=0;\n for i := 1 to n do\n if not ((i mod 3 = 0)or (i mod 5 = 0)) then\n sum := sum + i;\n\n writeln(sum);\nend.", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 27, "memory_kb": 1384}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s591236957", "group_id": "codeNet:p02712", "input_text": "program hihi;\nvar\n\tn, i : longint;\n sum : int64;\nbegin\n\treadln(n);\n sum:=0;\n for i:=1 to n do\n \tif not ((i mod 3 =0) or (i mod 5 = 0)) \n then sum := sum + i;\n writeln(sum);\nend.", "language": "Pascal", "metadata": {"date": 1595802415, "filename_ext": "pas", "original_language": "Pascal (FPC 3.0.4)", "problem_description_relpath": "problem_descriptions/p02712.html", "problem_id": "p02712", "resource_group": "low_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/Pascal/s591236957.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s591236957", "user_id": "u303822545"}, "prompt_components": {"gold_output": "60\n", "input_to_evaluate": "program hihi;\nvar\n\tn, i : longint;\n sum : int64;\nbegin\n\treadln(n);\n sum:=0;\n for i:=1 to n do\n \tif not ((i mod 3 =0) or (i mod 5 = 0)) \n then sum := sum + i;\n writeln(sum);\nend.", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 23, "memory_kb": 1360}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s454350139", "group_id": "codeNet:p02712", "input_text": "program hihi;\nvar\n\tn, i : LongInt;\n sum : Int64;\nbegin\n\treadln(n);\n sum:=0;\n\tfor i:=1 to n do \n \tif (i mod 3 <> 0) or (i mod 5 <> 0)\n then sum := sum + i;\n writeln(sum);\nend.", "language": "Pascal", "metadata": {"date": 1595802196, "filename_ext": "pas", "original_language": "Pascal (FPC 3.0.4)", "problem_description_relpath": "problem_descriptions/p02712.html", "problem_id": "p02712", "resource_group": "low_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/Pascal/s454350139.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s454350139", "user_id": "u303822545"}, "prompt_components": {"gold_output": "60\n", "input_to_evaluate": "program hihi;\nvar\n\tn, i : LongInt;\n sum : Int64;\nbegin\n\treadln(n);\n sum:=0;\n\tfor i:=1 to n do \n \tif (i mod 3 <> 0) or (i mod 5 <> 0)\n then sum := sum + i;\n writeln(sum);\nend.", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 193, "cpu_time_ms": 25, "memory_kb": 1364}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s211520856", "group_id": "codeNet:p02712", "input_text": "program main;\nvar x,i : longint;\n sum : int64;\nbegin\n sum:=0;\n readln(x);\n for i := 1 to x do begin\n sum := sum + i;\n if i mod 3 = 0\n then sum := sum - i\n else if i mod 5 = 0\n then sum := sum - i;\n end;\n writeln(sum);\nend.", "language": "Pascal", "metadata": {"date": 1595779902, "filename_ext": "pas", "original_language": "Pascal (FPC 3.0.4)", "problem_description_relpath": "problem_descriptions/p02712.html", "problem_id": "p02712", "resource_group": "low_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/Pascal/s211520856.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s211520856", "user_id": "u225670189"}, "prompt_components": {"gold_output": "60\n", "input_to_evaluate": "program main;\nvar x,i : longint;\n sum : int64;\nbegin\n sum:=0;\n readln(x);\n for i := 1 to x do begin\n sum := sum + i;\n if i mod 3 = 0\n then sum := sum - i\n else if i mod 5 = 0\n then sum := sum - i;\n end;\n writeln(sum);\nend.", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 287, "cpu_time_ms": 30, "memory_kb": 1388}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s354377127", "group_id": "codeNet:p02712", "input_text": "program main;\nvar N, i : LongInt;\n c, b : real;\n A : array[1..1000000] of LongInt;\n sum : int64;\nbegin\n\tread(N);\n sum := 0;\n for i := 1 to N do begin\n c := frac(i / 3);\n b := frac(i / 5);\n if (c = 0) or (b = 0)\n then A[i] := 0\n else A[i] := i;\n sum := sum + A[i];\n end;\n writeln(sum);\nend.", "language": "Pascal", "metadata": {"date": 1595440690, "filename_ext": "pas", "original_language": "Pascal (FPC 3.0.4)", "problem_description_relpath": "problem_descriptions/p02712.html", "problem_id": "p02712", "resource_group": "low_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/Pascal/s354377127.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s354377127", "user_id": "u384260326"}, "prompt_components": {"gold_output": "60\n", "input_to_evaluate": "program main;\nvar N, i : LongInt;\n c, b : real;\n A : array[1..1000000] of LongInt;\n sum : int64;\nbegin\n\tread(N);\n sum := 0;\n for i := 1 to N do begin\n c := frac(i / 3);\n b := frac(i / 5);\n if (c = 0) or (b = 0)\n then A[i] := 0\n else A[i] := i;\n sum := sum + A[i];\n end;\n writeln(sum);\nend.", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 65, "memory_kb": 4100}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s507460492", "group_id": "codeNet:p02712", "input_text": "program main;\nvar\n\tnum, i, sum : int64;\nbegin\n\tread(num);\n \n sum := 0;\n \n for i := 1 to num do begin\n \tif (frac(i/3) = 0) or (frac(i/5) = 0)\n \tthen sum := sum + 0\n \t else sum := sum + i;\n end;\n \twriteln(sum);\nend.", "language": "Pascal", "metadata": {"date": 1595298356, "filename_ext": "pas", "original_language": "Pascal (FPC 3.0.4)", "problem_description_relpath": "problem_descriptions/p02712.html", "problem_id": "p02712", "resource_group": "low_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/Pascal/s507460492.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s507460492", "user_id": "u522723337"}, "prompt_components": {"gold_output": "60\n", "input_to_evaluate": "program main;\nvar\n\tnum, i, sum : int64;\nbegin\n\tread(num);\n \n sum := 0;\n \n for i := 1 to num do begin\n \tif (frac(i/3) = 0) or (frac(i/5) = 0)\n \tthen sum := sum + 0\n \t else sum := sum + i;\n end;\n \twriteln(sum);\nend.", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 248, "cpu_time_ms": 55, "memory_kb": 1384}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s704681452", "group_id": "codeNet:p02712", "input_text": "program main;\nvar\n i,j,k:longint;\n n:longint;\n sum:longint;\nbegin\n readln(n);\n sum:=0;\n for i:=1 to n do if ((i mod 3) <> 0) and ((i mod 5) <> 0) then sum:=sum+i;\n writeln(sum);\nend.", "language": "Pascal", "metadata": {"date": 1594878946, "filename_ext": "pas", "original_language": "Pascal (FPC 3.0.4)", "problem_description_relpath": "problem_descriptions/p02712.html", "problem_id": "p02712", "resource_group": "low_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/Pascal/s704681452.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s704681452", "user_id": "u678829637"}, "prompt_components": {"gold_output": "60\n", "input_to_evaluate": "program main;\nvar\n i,j,k:longint;\n n:longint;\n sum:longint;\nbegin\n readln(n);\n sum:=0;\n for i:=1 to n do if ((i mod 3) <> 0) and ((i mod 5) <> 0) then sum:=sum+i;\n writeln(sum);\nend.", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 24, "memory_kb": 1384}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s386358806", "group_id": "codeNet:p02712", "input_text": "var N,i:Longint;ans:int64;\nbegin\nread(N);\nfor i:=1 to N do if(i mod 3<>0)and(i mod 5<>0)then inc(ans,i);\nwriteln(ans);\nend.", "language": "Pascal", "metadata": {"date": 1586951596, "filename_ext": "pas", "original_language": "Pascal (FPC 3.0.4)", "problem_description_relpath": "problem_descriptions/p02712.html", "problem_id": "p02712", "resource_group": "low_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/Pascal/s386358806.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s386358806", "user_id": "u657913472"}, "prompt_components": {"gold_output": "60\n", "input_to_evaluate": "var N,i:Longint;ans:int64;\nbegin\nread(N);\nfor i:=1 to N do if(i mod 3<>0)and(i mod 5<>0)then inc(ans,i);\nwriteln(ans);\nend.", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 19, "memory_kb": 1376}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s610698974", "group_id": "codeNet:p02716", "input_text": "var\n\tN,i,a,j,ni,nj:Longint;\n\tdp:Array[0..200000,0..3]of int64;\nbegin\nread(N);\nfor i:=0 to N do for j:=0 to 2 do dp[i,j]:=-1000000000000000000;\ndp[0,0]:=0;\nfor i:=0 to N-1 do begin\nread(a);\nfor j:=0 to 2 do begin\nif dp[i+1,j+1]N then ni:=N;\nnj:=j;if i+2=N then inc(nj);\nif dp[ni,nj]N then ni:=N;\nnj:=j;if i+2=N then inc(nj);\nif dp[ni,nj] y) then begin\n if (x mod y = 0) then \n writeln(0)\n else begin\n z := x div y;\n if (z < abs(z - y)) then \n writeln(z)\n else\n writeln(abs(z - y));\n end;\n end\n else begin\n if (x < y) then\n writeln(abs(x))\n else if (x = y) then\n writeln(0);\n end;\nend.", "language": "Pascal", "metadata": {"date": 1596032574, "filename_ext": "pas", "original_language": "Pascal (FPC 3.0.4)", "problem_description_relpath": "problem_descriptions/p02719.html", "problem_id": "p02719", "resource_group": "low_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/Pascal/s437967193.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s437967193", "user_id": "u583992857"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "program ReplacingInteger;\nvar\n x, y, z : int64;\nbegin\n readln(x, y);\n if (x > y) then begin\n if (x mod y = 0) then \n writeln(0)\n else begin\n z := x div y;\n if (z < abs(z - y)) then \n writeln(z)\n else\n writeln(abs(z - y));\n end;\n end\n else begin\n if (x < y) then\n writeln(abs(x))\n else if (x = y) then\n writeln(0);\n end;\nend.", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 5, "memory_kb": 1304}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s426406418", "group_id": "codeNet:p02719", "input_text": "program ReplacingInteger;\nvar\n x, y : int64;\n z : Longint;\nbegin\n readln(x, y);\n if (x > y) then begin\n if (x mod y = 0) then \n writeln(0)\n else begin\n z := x div y;\n if (z < abs(z - y)) then \n writeln(z)\n else\n writeln(abs(z - y));\n end;\n end\n else begin\n if (x < y) then\n writeln(abs(x))\n else if (x = y) then\n writeln(0);\n end;\nend.", "language": "Pascal", "metadata": {"date": 1596031834, "filename_ext": "pas", "original_language": "Pascal (FPC 3.0.4)", "problem_description_relpath": "problem_descriptions/p02719.html", "problem_id": "p02719", "resource_group": "low_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/Pascal/s426406418.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s426406418", "user_id": "u583992857"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "program ReplacingInteger;\nvar\n x, y : int64;\n z : Longint;\nbegin\n readln(x, y);\n if (x > y) then begin\n if (x mod y = 0) then \n writeln(0)\n else begin\n z := x div y;\n if (z < abs(z - y)) then \n writeln(z)\n else\n writeln(abs(z - y));\n end;\n end\n else begin\n if (x < y) then\n writeln(abs(x))\n else if (x = y) then\n writeln(0);\n end;\nend.", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 2, "memory_kb": 1376}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s035967215", "group_id": "codeNet:p02719", "input_text": "program ReplacingInteger;\nvar\n x, y : int64;\n z : Longint;\nbegin\n readln(x, y);\n if (x > y) then begin\n if (x mod y = 0) then \n writeln(0)\n else begin\n z := x div y;\n if (z < x mod y) then \n writeln(z)\n else\n writeln(x mod y);\n end;\n end\n else begin\n if (x < y) then\n writeln(2)\n else if (x = y) then\n writeln(1);\n end;\nend.", "language": "Pascal", "metadata": {"date": 1596030759, "filename_ext": "pas", "original_language": "Pascal (FPC 3.0.4)", "problem_description_relpath": "problem_descriptions/p02719.html", "problem_id": "p02719", "resource_group": "low_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/Pascal/s035967215.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s035967215", "user_id": "u583992857"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "program ReplacingInteger;\nvar\n x, y : int64;\n z : Longint;\nbegin\n readln(x, y);\n if (x > y) then begin\n if (x mod y = 0) then \n writeln(0)\n else begin\n z := x div y;\n if (z < x mod y) then \n writeln(z)\n else\n writeln(x mod y);\n end;\n end\n else begin\n if (x < y) then\n writeln(2)\n else if (x = y) then\n writeln(1);\n end;\nend.", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 5, "memory_kb": 1372}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s564195349", "group_id": "codeNet:p02720", "input_text": "var\n\tK:Longint;\n\tL,R,M:int64;\nfunction check(T:int64):Longint;\nvar\n\tdp:Array[1..15,0..1,0..9]of Longint;\n\tdpz:Array[1..15,0..1]of Longint;\n\tS:String;\n\tls,i,j,k,l,nj,lim,sum,llim,rlim:Longint;\nbegin\n\tS:='';\n\twhile T>0 do begin\n\t\tS:=Chr(T mod 10+48)+S;\n\t\tT:=T div 10;\n\tend;\n\tls:=length(S);\n\tfor i:=1 to ls+1 do for j:=0 to 1 do begin\n\t\tfor k:=0 to 9 do dp[i,j,k]:=0;\n\t\tdpz[i,j]:=0;\n\tend;\n\tdpz[1,0]:=1;\n\tfor i:=1 to ls do begin\n\t\tfor j:=0 to 1 do begin\n\t\t\tif j=0 then lim:=ord(S[i])-48 else lim:=9;\n\t\t\tinc(dpz[i+1,1],dpz[i,j]);\n\t\t\tfor l:=1 to lim do begin\n\t\t\t\tnj:=j;\n\t\t\t\tif llim then rlim:=lim;\n\t\t\t\tfor l:=llim to rlim do begin\n\t\t\t\t\tnj:=j;\n\t\t\t\t\tif l1 do begin\n\t\tM:=(L+R)div 2;\n\t\tif check(M)>=K then R:=M else L:=M;\n\tend;\n\twriteln(R);\nend.\n", "language": "Pascal", "metadata": {"date": 1586054309, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p02720.html", "problem_id": "p02720", "resource_group": "low_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/Pascal/s564195349.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s564195349", "user_id": "u657913472"}, "prompt_components": {"gold_output": "23\n", "input_to_evaluate": "var\n\tK:Longint;\n\tL,R,M:int64;\nfunction check(T:int64):Longint;\nvar\n\tdp:Array[1..15,0..1,0..9]of Longint;\n\tdpz:Array[1..15,0..1]of Longint;\n\tS:String;\n\tls,i,j,k,l,nj,lim,sum,llim,rlim:Longint;\nbegin\n\tS:='';\n\twhile T>0 do begin\n\t\tS:=Chr(T mod 10+48)+S;\n\t\tT:=T div 10;\n\tend;\n\tls:=length(S);\n\tfor i:=1 to ls+1 do for j:=0 to 1 do begin\n\t\tfor k:=0 to 9 do dp[i,j,k]:=0;\n\t\tdpz[i,j]:=0;\n\tend;\n\tdpz[1,0]:=1;\n\tfor i:=1 to ls do begin\n\t\tfor j:=0 to 1 do begin\n\t\t\tif j=0 then lim:=ord(S[i])-48 else lim:=9;\n\t\t\tinc(dpz[i+1,1],dpz[i,j]);\n\t\t\tfor l:=1 to lim do begin\n\t\t\t\tnj:=j;\n\t\t\t\tif llim then rlim:=lim;\n\t\t\t\tfor l:=llim to rlim do begin\n\t\t\t\t\tnj:=j;\n\t\t\t\t\tif l1 do begin\n\t\tM:=(L+R)div 2;\n\t\tif check(M)>=K then R:=M else L:=M;\n\tend;\n\twriteln(R);\nend.\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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1109, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s571628116", "group_id": "codeNet:p02720", "input_text": "var\n\tK:Longint;\n\tL,R,M:int64;\nfunction check(T:int64):Longint;\nvar\n\tdp:Array[1..15,0..1,0..1,0..9]of Longint;\n\tS:String;\n\ti,j,k,l,nj,lim,sum,z:Longint;\nbegin\n\tStr(T,S);\n\tfor i:=1 to length(S)+1 do for j:=0 to 1 do for z:=0 to 1 do for k:=0 to 9 do dp[i,j,z,k]:=0;\n\tdp[1,0,1,0]:=1;\n\tfor i:=1 to length(S) do begin\n\t\tfor j:=0 to 1 do begin\n\t\t\tif j=0 then lim:=ord(S[i])-48 else lim:=9;\n\t\t\tinc(dp[i+1,1,1,0],dp[i,j,1,0]);\n\t\t\tfor l:=1 to lim do begin\n\t\t\t\tnj:=j;\n\t\t\t\tif l1 do begin\n\t\tM:=(L+R)div 2;\n\t\tif check(M)>=K then R:=M else L:=M;\n\tend;\n\twriteln(R);\nend.\n", "language": "Pascal", "metadata": {"date": 1586053921, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p02720.html", "problem_id": "p02720", "resource_group": "low_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/Pascal/s571628116.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s571628116", "user_id": "u657913472"}, "prompt_components": {"gold_output": "23\n", "input_to_evaluate": "var\n\tK:Longint;\n\tL,R,M:int64;\nfunction check(T:int64):Longint;\nvar\n\tdp:Array[1..15,0..1,0..1,0..9]of Longint;\n\tS:String;\n\ti,j,k,l,nj,lim,sum,z:Longint;\nbegin\n\tStr(T,S);\n\tfor i:=1 to length(S)+1 do for j:=0 to 1 do for z:=0 to 1 do for k:=0 to 9 do dp[i,j,z,k]:=0;\n\tdp[1,0,1,0]:=1;\n\tfor i:=1 to length(S) do begin\n\t\tfor j:=0 to 1 do begin\n\t\t\tif j=0 then lim:=ord(S[i])-48 else lim:=9;\n\t\t\tinc(dp[i+1,1,1,0],dp[i,j,1,0]);\n\t\t\tfor l:=1 to lim do begin\n\t\t\t\tnj:=j;\n\t\t\t\tif l1 do begin\n\t\tM:=(L+R)div 2;\n\t\tif check(M)>=K then R:=M else L:=M;\n\tend;\n\twriteln(R);\nend.\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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 975, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s296586184", "group_id": "codeNet:p02720", "input_text": "var\n\tK:Longint;\n\tL,R,M:int64;\nfunction check(T:int64):Longint;\nvar\n\tdp:Array[1..15,0..1,0..1,0..9]of Longint;\n\tS:String;\n\ti,j,k,l,nj,lim,sum,z,nz:Longint;\nbegin\n\tStr(T,S);\n\tfor i:=1 to length(S)+1 do for j:=0 to 1 do for z:=0 to 1 do for k:=0 to 9 do dp[i,j,z,k]:=0;\n\tdp[1,0,1,0]:=1;\n\tfor i:=1 to length(S) do begin\n\t\tfor j:=0 to 1 do begin\n\t\t\tif j=0 then lim:=ord(S[i])-48 else lim:=9;\n\t\t\tfor z:=0 to 1 do for k:=0 to 9 do begin\n\t\t\t\tfor l:=0 to lim do begin\n\t\t\t\t\tif(z<>1)and((k1 do begin\n\t\tM:=(L+R)div 2;\n\t\tif check(M)>=K then R:=M else L:=M;\n\tend;\n\twriteln(R);\nend.\n", "language": "Pascal", "metadata": {"date": 1586053702, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p02720.html", "problem_id": "p02720", "resource_group": "low_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/Pascal/s296586184.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s296586184", "user_id": "u657913472"}, "prompt_components": {"gold_output": "23\n", "input_to_evaluate": "var\n\tK:Longint;\n\tL,R,M:int64;\nfunction check(T:int64):Longint;\nvar\n\tdp:Array[1..15,0..1,0..1,0..9]of Longint;\n\tS:String;\n\ti,j,k,l,nj,lim,sum,z,nz:Longint;\nbegin\n\tStr(T,S);\n\tfor i:=1 to length(S)+1 do for j:=0 to 1 do for z:=0 to 1 do for k:=0 to 9 do dp[i,j,z,k]:=0;\n\tdp[1,0,1,0]:=1;\n\tfor i:=1 to length(S) do begin\n\t\tfor j:=0 to 1 do begin\n\t\t\tif j=0 then lim:=ord(S[i])-48 else lim:=9;\n\t\t\tfor z:=0 to 1 do for k:=0 to 9 do begin\n\t\t\t\tfor l:=0 to lim do begin\n\t\t\t\t\tif(z<>1)and((k1 do begin\n\t\tM:=(L+R)div 2;\n\t\tif check(M)>=K then R:=M else L:=M;\n\tend;\n\twriteln(R);\nend.\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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 907, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s991785699", "group_id": "codeNet:p02721", "input_text": "var\n\tS:String;\n\tN,K,C,i,now:Longint;\n\tL,R:Array[1..200000]of Longint;\nbegin\n\treadln(N,K,C);\n\treadln(S);\n\tnow:=0;i:=1;\n\twhile i<=N do begin\n\t\tif S[i]='o'then begin\n\t\t\tinc(now);\n\t\t\tL[i]:=now;\n\t\t\tinc(i,C);\n\t\tend;\n\t\tinc(i);\n\tend;\n\tnow:=0;i:=N;\n\twhile i>=1 do begin\n\t\tif S[i]='o'then begin\n\t\t\tdec(now);\n\t\t\tR[i]:=now;\n\t\t\tdec(i,C);\n\t\tend;\n\t\tdec(i);\n\tend;\n\tfor i:=1 to N do if(L[i]>0)and(R[i]<0)and(L[i]=K+1+R[i])then writeln(i);\nend.\n", "language": "Pascal", "metadata": {"date": 1586063954, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p02721.html", "problem_id": "p02721", "resource_group": "low_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/Pascal/s991785699.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s991785699", "user_id": "u657913472"}, "prompt_components": {"gold_output": "6\n", "input_to_evaluate": "var\n\tS:String;\n\tN,K,C,i,now:Longint;\n\tL,R:Array[1..200000]of Longint;\nbegin\n\treadln(N,K,C);\n\treadln(S);\n\tnow:=0;i:=1;\n\twhile i<=N do begin\n\t\tif S[i]='o'then begin\n\t\t\tinc(now);\n\t\t\tL[i]:=now;\n\t\t\tinc(i,C);\n\t\tend;\n\t\tinc(i);\n\tend;\n\tnow:=0;i:=N;\n\twhile i>=1 do begin\n\t\tif S[i]='o'then begin\n\t\t\tdec(now);\n\t\t\tR[i]:=now;\n\t\t\tdec(i,C);\n\t\tend;\n\t\tdec(i);\n\tend;\n\tfor i:=1 to N do if(L[i]>0)and(R[i]<0)and(L[i]=K+1+R[i])then writeln(i);\nend.\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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 31, "memory_kb": 3072}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s476678493", "group_id": "codeNet:p02725", "input_text": "var K,N,i,t,v:Longint;\nA:Array[1..200000]of Longint;\nbegin\nread(K,N);\nfor i:=1 to N do read(A[i]);\nfor i:=2 to N do begin\nv:=A[i]-A[i-1];\nif tk then inc(ans,N+1+X-Y-k);\n\t\tif k=1 then dec(ans)else begin\n\t\t\tif X-1>=k-1 then dec(ans);\n\t\t\tif N-Y>=k-1 then dec(ans);\n\t\tend;\n\t\tif k*2k then inc(ans,N+1+X-Y-k);\n\t\tif k=1 then dec(ans)else begin\n\t\t\tif X-1>=k-1 then dec(ans);\n\t\t\tif N-Y>=k-1 then dec(ans);\n\t\tend;\n\t\tif k*2k then inc(ans,N+1+X-Y-k);\n\t\tif k=1 then dec(ans)else begin\n\t\t\tif X-1>=k-1 then dec(ans);\n\t\t\tif N-Y>=k-1 then dec(ans);\n\t\tend;\n\t\tif k*2k then inc(ans,N+1+X-Y-k);\n\t\tif k=1 then dec(ans)else begin\n\t\t\tif X-1>=k-1 then dec(ans);\n\t\t\tif N-Y>=k-1 then dec(ans);\n\t\tend;\n\t\tif k*20 do begin\n\t\tif V[id]<>p then begin\n\t\t\tret:=ret*dfs1(V[id],u)mod M;\n\t\t\tret:=ret*invfac[c[V[id]]]mod M;\n\t\t\tinc(c[u],c[V[id]]);\n\t\tend;\n\t\tid:=nxt[id];\n\tend;\n\tdp[u]:=ret;\n\tdfs1:=ret*fac[c[u]-1]mod M;\nend;\nprocedure dfs2(u,p:Longint;pr:int64);\nvar id:Longint;\nbegin\n\tans[u]:=dp[u]*pr mod M*invfac[N-c[u]]mod M;\n\tid:=beg[u];\n\twhile id<>0 do begin\n\t\tif V[id]<>p then begin\n\t\t\tdfs2(V[id],u,ans[u]*c[V[id]]mod M*power(dp[V[id]],M-2)mod M*fac[N-c[V[id]]-1]mod M);\n\t\tend;\n\t\tid:=nxt[id];\n\tend;\nend;\nbegin\n\tread(N);\n\tfac[0]:=1;\n\tfor i:=1 to N-1 do fac[i]:=fac[i-1]*i mod M;\n\tinvfac[N-1]:=power(fac[N-1],M-2);\n\tfor i:=N-2 downto 0 do invfac[i]:=invfac[i+1]*(i+1)mod M;\n\tfor i:=1 to N-1 do begin\n\t\tread(a,b);\n\t\tV[i*2-1]:=b;\n\t\tnxt[i*2-1]:=beg[a];\n\t\tbeg[a]:=i*2-1;\n\t\tV[i*2]:=a;\n\t\tnxt[i*2]:=beg[b];\n\t\tbeg[b]:=i*2;\n\tend;\n\tdfs1(1,0);\n\tdfs2(1,0,1);\n\tfor i:=1 to N do writeln(ans[i]*fac[N-1]mod M);\nend.\n", "language": "Pascal", "metadata": {"date": 1585538462, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p02728.html", "problem_id": "p02728", "resource_group": "low_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/Pascal/s312041638.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s312041638", "user_id": "u657913472"}, "prompt_components": {"gold_output": "2\n1\n1\n", "input_to_evaluate": "const M=1000000007;\nvar\n\tN,i,a,b:Longint;\n\tc,dp,ans:Array[1..200000]of int64;\n\tfac,invfac:Array[0..199999]of int64;\n\tV,nxt:Array[1..399998]of Longint;\n\tbeg:Array[1..200000]of Longint;\nfunction power(a,b:int64):int64;\nbegin\n\tif b=0 then power:=1 else if b mod 2=0 then power:=power(a*a mod M,b div 2)else power:=power(a*a mod M,b div 2)*a mod M;\nend;\nfunction dfs1(u,p:Longint):int64;\nvar\n\tid:Longint;\n\tret:int64;\nbegin\n\tret:=1;\n\tc[u]:=1;\n\tid:=beg[u];\n\twhile id<>0 do begin\n\t\tif V[id]<>p then begin\n\t\t\tret:=ret*dfs1(V[id],u)mod M;\n\t\t\tret:=ret*invfac[c[V[id]]]mod M;\n\t\t\tinc(c[u],c[V[id]]);\n\t\tend;\n\t\tid:=nxt[id];\n\tend;\n\tdp[u]:=ret;\n\tdfs1:=ret*fac[c[u]-1]mod M;\nend;\nprocedure dfs2(u,p:Longint;pr:int64);\nvar id:Longint;\nbegin\n\tans[u]:=dp[u]*pr mod M*invfac[N-c[u]]mod M;\n\tid:=beg[u];\n\twhile id<>0 do begin\n\t\tif V[id]<>p then begin\n\t\t\tdfs2(V[id],u,ans[u]*c[V[id]]mod M*power(dp[V[id]],M-2)mod M*fac[N-c[V[id]]-1]mod M);\n\t\tend;\n\t\tid:=nxt[id];\n\tend;\nend;\nbegin\n\tread(N);\n\tfac[0]:=1;\n\tfor i:=1 to N-1 do fac[i]:=fac[i-1]*i mod M;\n\tinvfac[N-1]:=power(fac[N-1],M-2);\n\tfor i:=N-2 downto 0 do invfac[i]:=invfac[i+1]*(i+1)mod M;\n\tfor i:=1 to N-1 do begin\n\t\tread(a,b);\n\t\tV[i*2-1]:=b;\n\t\tnxt[i*2-1]:=beg[a];\n\t\tbeg[a]:=i*2-1;\n\t\tV[i*2]:=a;\n\t\tnxt[i*2]:=beg[b];\n\t\tbeg[b]:=i*2;\n\tend;\n\tdfs1(1,0);\n\tdfs2(1,0,1);\n\tfor i:=1 to N do writeln(ans[i]*fac[N-1]mod M);\nend.\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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1344, "cpu_time_ms": 319, "memory_kb": 13824}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s073451294", "group_id": "codeNet:p02732", "input_text": "var n, i : longint;\n a, cnt : array[1..200005] of int64;\n has : array[1..200005] of boolean;\n tot : int64;\n \nbegin\n readln(n);\n fillchar(cnt, sizeof(cnt), 0);\n for i := 1 to n do \n begin\n read(a[i]);\n inc(cnt[a[i]]);\n end;\n tot := 0;\n fillchar(has, sizeof(has), false);\n for i := 1 to n do \n begin\n if (not has[a[i]]) then \n begin\n tot := tot + cnt[a[i]] * (cnt[a[i]] - 1) div 2;\n has[a[i]] := true;\n end;\n end;\n for i := 1 to n do \n begin\n writeln(tot - cnt[a[i]] * (cnt[a[i]] - 1) div 2 + (cnt[a[i]] - 1) * (cnt[a[i]] - 2) div 2);\n end;\nend.", "language": "Pascal", "metadata": {"date": 1588181206, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p02732.html", "problem_id": "p02732", "resource_group": "low_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/Pascal/s073451294.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s073451294", "user_id": "u366795445"}, "prompt_components": {"gold_output": "2\n2\n3\n2\n3\n", "input_to_evaluate": "var n, i : longint;\n a, cnt : array[1..200005] of int64;\n has : array[1..200005] of boolean;\n tot : int64;\n \nbegin\n readln(n);\n fillchar(cnt, sizeof(cnt), 0);\n for i := 1 to n do \n begin\n read(a[i]);\n inc(cnt[a[i]]);\n end;\n tot := 0;\n fillchar(has, sizeof(has), false);\n for i := 1 to n do \n begin\n if (not has[a[i]]) then \n begin\n tot := tot + cnt[a[i]] * (cnt[a[i]] - 1) div 2;\n has[a[i]] := true;\n end;\n end;\n for i := 1 to n do \n begin\n writeln(tot - cnt[a[i]] * (cnt[a[i]] - 1) div 2 + (cnt[a[i]] - 1) * (cnt[a[i]] - 2) div 2);\n end;\nend.", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 658, "cpu_time_ms": 75, "memory_kb": 5760}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s824996514", "group_id": "codeNet:p02732", "input_text": "Var a,b,c:Array[1 .. 200000] of Longint;\n i,n,sum,r1,r2:Int64;\nBegin\n Readln(n);\n For i:=1 to n do begin\n Read(a[i]);\n Inc(b[a[i]]);\n End;\n For i:=1 to n do c[i]:=(b[i]*(b[i]-1) div 2);\n For i:=1 to n do sum:=sum+c[i];\n For i:=1 to n do begin\n If c[a[i]]=0 then begin\n Writeln(sum); Continue;\n End;\n r1:=b[a[i]]-1; r2:=b[a[i]]-2;\n Writeln(sum-c[a[i]]+(r1*r2 div 2));\n End;\nEnd.", "language": "Pascal", "metadata": {"date": 1584927853, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p02732.html", "problem_id": "p02732", "resource_group": "low_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/Pascal/s824996514.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s824996514", "user_id": "u866155170"}, "prompt_components": {"gold_output": "2\n2\n3\n2\n3\n", "input_to_evaluate": "Var a,b,c:Array[1 .. 200000] of Longint;\n i,n,sum,r1,r2:Int64;\nBegin\n Readln(n);\n For i:=1 to n do begin\n Read(a[i]);\n Inc(b[a[i]]);\n End;\n For i:=1 to n do c[i]:=(b[i]*(b[i]-1) div 2);\n For i:=1 to n do sum:=sum+c[i];\n For i:=1 to n do begin\n If c[a[i]]=0 then begin\n Writeln(sum); Continue;\n End;\n r1:=b[a[i]]-1; r2:=b[a[i]]-2;\n Writeln(sum-c[a[i]]+(r1*r2 div 2));\n End;\nEnd.", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 75, "memory_kb": 4352}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s404353265", "group_id": "codeNet:p02733", "input_text": "var\n\ts:Array[0..9]of String;\n\tH,W,K,i,j,l,z,now,id,ans:Longint;\n\tcnt:Array[0..14]of Longint;\n\tout,take:Boolean;\nbegin\n\treadln(H,W,K);\n\tfor i:=0 to H-1 do readln(s[i]);\n\tans:=1000000000;\n\tfor z:=0 to (1<<(H-1))-1 do begin\n\t\tfor j:=0 to 14 do cnt[j]:=0;\n\t\tnow:=0;\n\t\tfor j:=0 to H-1 do if ((z>>j)and 1)=1 then inc(now);\n\t\tout:=False;\n\t\tfor j:=0 to W-1 do begin\n\t\t\tid:=0;\n\t\t\ttake:=False;\n\t\t\tfor l:=0 to H-1 do begin\n\t\t\t\tif s[l][j+1]='1'then inc(cnt[id]);\n\t\t\t\tif cnt[id]>K then take:=True;\n\t\t\t\tif ((z>>l)and 1)=1 then inc(id);\n\t\t\tend;\n\t\t\tif take then begin\n\t\t\t\tinc(now);\n\t\t\t\tfor l:=0 to id do cnt[l]:=0;\n\t\t\t\tid:=0;\n\t\t\t\tfor l:=0 to H-1 do begin\n\t\t\t\t\tif s[l][j+1]='1'then inc(cnt[id]);\n\t\t\t\t\tif cnt[id]>K then out:=True;\n\t\t\t\t\tif((z>>k)and 1)=1 then inc(id);\n\t\t\t\tend;\n\t\t\tend;\n\t\tend;\n\t\tif(not out)and(ans>now)then ans:=now;\n\tend;\n\twriteln(ans);\nend.\n", "language": "Pascal", "metadata": {"date": 1591929230, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p02733.html", "problem_id": "p02733", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02733/input.txt", "sample_output_relpath": "derived/input_output/data/p02733/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02733/Pascal/s404353265.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s404353265", "user_id": "u657913472"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "var\n\ts:Array[0..9]of String;\n\tH,W,K,i,j,l,z,now,id,ans:Longint;\n\tcnt:Array[0..14]of Longint;\n\tout,take:Boolean;\nbegin\n\treadln(H,W,K);\n\tfor i:=0 to H-1 do readln(s[i]);\n\tans:=1000000000;\n\tfor z:=0 to (1<<(H-1))-1 do begin\n\t\tfor j:=0 to 14 do cnt[j]:=0;\n\t\tnow:=0;\n\t\tfor j:=0 to H-1 do if ((z>>j)and 1)=1 then inc(now);\n\t\tout:=False;\n\t\tfor j:=0 to W-1 do begin\n\t\t\tid:=0;\n\t\t\ttake:=False;\n\t\t\tfor l:=0 to H-1 do begin\n\t\t\t\tif s[l][j+1]='1'then inc(cnt[id]);\n\t\t\t\tif cnt[id]>K then take:=True;\n\t\t\t\tif ((z>>l)and 1)=1 then inc(id);\n\t\t\tend;\n\t\t\tif take then begin\n\t\t\t\tinc(now);\n\t\t\t\tfor l:=0 to id do cnt[l]:=0;\n\t\t\t\tid:=0;\n\t\t\t\tfor l:=0 to H-1 do begin\n\t\t\t\t\tif s[l][j+1]='1'then inc(cnt[id]);\n\t\t\t\t\tif cnt[id]>K then out:=True;\n\t\t\t\t\tif((z>>k)and 1)=1 then inc(id);\n\t\t\t\tend;\n\t\t\tend;\n\t\tend;\n\t\tif(not out)and(ans>now)then ans:=now;\n\tend;\n\twriteln(ans);\nend.\n", "problem_context": "Score : 500 points\n\nProblem Statement\n\nWe have a chocolate bar partitioned into H horizontal rows and W vertical columns of squares.\n\nThe square (i, j) at the i-th row from the top and the j-th column from the left is dark if S_{i,j} is 0, and white if S_{i,j} is 1.\n\nWe will cut the bar some number of times to divide it into some number of blocks. In each cut, we cut the whole bar by a line running along some boundaries of squares from end to end of the bar.\n\nHow many times do we need to cut the bar so that every block after the cuts has K or less white squares?\n\nConstraints\n\n1 \\leq H \\leq 10\n\n1 \\leq W \\leq 1000\n\n1 \\leq K \\leq H \\times W\n\nS_{i,j} is 0 or 1.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W K\nS_{1,1}S_{1,2}...S_{1,W}\n:\nS_{H,1}S_{H,2}...S_{H,W}\n\nOutput\n\nPrint the number of minimum times the bar needs to be cut so that every block after the cuts has K or less white squares.\n\nSample Input 1\n\n3 5 4\n11100\n10001\n00111\n\nSample Output 1\n\n2\n\nFor example, cutting between the 1-st and 2-nd rows and between the 3-rd and 4-th columns - as shown in the figure to the left - works.\n\nNote that we cannot cut the bar in the ways shown in the two figures to the right.\n\nSample Input 2\n\n3 5 8\n11100\n10001\n00111\n\nSample Output 2\n\n0\n\nNo cut is needed.\n\nSample Input 3\n\n4 10 4\n1110010010\n1000101110\n0011101001\n1101000111\n\nSample Output 3\n\n3", "sample_input": "3 5 4\n11100\n10001\n00111\n"}, "reference_outputs": ["2\n"], "source_document_id": "p02733", "source_text": "Score : 500 points\n\nProblem Statement\n\nWe have a chocolate bar partitioned into H horizontal rows and W vertical columns of squares.\n\nThe square (i, j) at the i-th row from the top and the j-th column from the left is dark if S_{i,j} is 0, and white if S_{i,j} is 1.\n\nWe will cut the bar some number of times to divide it into some number of blocks. In each cut, we cut the whole bar by a line running along some boundaries of squares from end to end of the bar.\n\nHow many times do we need to cut the bar so that every block after the cuts has K or less white squares?\n\nConstraints\n\n1 \\leq H \\leq 10\n\n1 \\leq W \\leq 1000\n\n1 \\leq K \\leq H \\times W\n\nS_{i,j} is 0 or 1.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W K\nS_{1,1}S_{1,2}...S_{1,W}\n:\nS_{H,1}S_{H,2}...S_{H,W}\n\nOutput\n\nPrint the number of minimum times the bar needs to be cut so that every block after the cuts has K or less white squares.\n\nSample Input 1\n\n3 5 4\n11100\n10001\n00111\n\nSample Output 1\n\n2\n\nFor example, cutting between the 1-st and 2-nd rows and between the 3-rd and 4-th columns - as shown in the figure to the left - works.\n\nNote that we cannot cut the bar in the ways shown in the two figures to the right.\n\nSample Input 2\n\n3 5 8\n11100\n10001\n00111\n\nSample Output 2\n\n0\n\nNo cut is needed.\n\nSample Input 3\n\n4 10 4\n1110010010\n1000101110\n0011101001\n1101000111\n\nSample Output 3\n\n3", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 840, "cpu_time_ms": 57, "memory_kb": 128}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s886362347", "group_id": "codeNet:p02734", "input_text": "var\n\tN,S,i,j,A,ans:Longint;\n\tdp:Array[0..3001]of Longint;\nbegin\n\tread(N,S);\n\tfor i:=1 to N do begin\n\t\tdp[S]:=i;\n\t\tread(A);\n\t\tfor j:=A to S do begin\n\t\t\tinc(dp[j-A],dp[j]);\n\t\t\tif dp[j-A]>=998244353 then dec(dp[j-A],998244353);\n\t\tend;\n\t\tinc(ans,dp[0]);\n\t\tif ans>=98244353 then dec(ans,998244353);\n\tend;\n\twriteln(ans);\nend.\n", "language": "Pascal", "metadata": {"date": 1584930078, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p02734.html", "problem_id": "p02734", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02734/input.txt", "sample_output_relpath": "derived/input_output/data/p02734/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02734/Pascal/s886362347.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s886362347", "user_id": "u657913472"}, "prompt_components": {"gold_output": "5\n", "input_to_evaluate": "var\n\tN,S,i,j,A,ans:Longint;\n\tdp:Array[0..3001]of Longint;\nbegin\n\tread(N,S);\n\tfor i:=1 to N do begin\n\t\tdp[S]:=i;\n\t\tread(A);\n\t\tfor j:=A to S do begin\n\t\t\tinc(dp[j-A],dp[j]);\n\t\t\tif dp[j-A]>=998244353 then dec(dp[j-A],998244353);\n\t\tend;\n\t\tinc(ans,dp[0]);\n\t\tif ans>=98244353 then dec(ans,998244353);\n\tend;\n\twriteln(ans);\nend.\n", "problem_context": "Score : 600 points\n\nProblem Statement\n\nGiven are a sequence of N integers A_1, A_2, \\ldots, A_N and a positive integer S.\n\nFor a pair of integers (L, R) such that 1\\leq L \\leq R \\leq N, let us define f(L, R) as follows:\n\nf(L, R) is the number of sequences of integers (x_1, x_2, \\ldots , x_k) such that L \\leq x_1 < x_2 < \\cdots < x_k \\leq R and A_{x_1}+A_{x_2}+\\cdots +A_{x_k} = S.\n\nFind the sum of f(L, R) over all pairs of integers (L, R) such that 1\\leq L \\leq R\\leq N. Since this sum can be enormous, print it modulo 998244353.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 3000\n\n1 \\leq S \\leq 3000\n\n1 \\leq A_i \\leq 3000\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN S\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the sum of f(L, R), modulo 998244353.\n\nSample Input 1\n\n3 4\n2 2 4\n\nSample Output 1\n\n5\n\nThe value of f(L, R) for each pair is as follows, for a total of 5.\n\nf(1,1) = 0\n\nf(1,2) = 1 (for the sequence (1, 2))\n\nf(1,3) = 2 (for (1, 2) and (3))\n\nf(2,2) = 0\n\nf(2,3) = 1 (for (3))\n\nf(3,3) = 1 (for (3))\n\nSample Input 2\n\n5 8\n9 9 9 9 9\n\nSample Output 2\n\n0\n\nSample Input 3\n\n10 10\n3 1 4 1 5 9 2 6 5 3\n\nSample Output 3\n\n152", "sample_input": "3 4\n2 2 4\n"}, "reference_outputs": ["5\n"], "source_document_id": "p02734", "source_text": "Score : 600 points\n\nProblem Statement\n\nGiven are a sequence of N integers A_1, A_2, \\ldots, A_N and a positive integer S.\n\nFor a pair of integers (L, R) such that 1\\leq L \\leq R \\leq N, let us define f(L, R) as follows:\n\nf(L, R) is the number of sequences of integers (x_1, x_2, \\ldots , x_k) such that L \\leq x_1 < x_2 < \\cdots < x_k \\leq R and A_{x_1}+A_{x_2}+\\cdots +A_{x_k} = S.\n\nFind the sum of f(L, R) over all pairs of integers (L, R) such that 1\\leq L \\leq R\\leq N. Since this sum can be enormous, print it modulo 998244353.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 3000\n\n1 \\leq S \\leq 3000\n\n1 \\leq A_i \\leq 3000\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN S\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the sum of f(L, R), modulo 998244353.\n\nSample Input 1\n\n3 4\n2 2 4\n\nSample Output 1\n\n5\n\nThe value of f(L, R) for each pair is as follows, for a total of 5.\n\nf(1,1) = 0\n\nf(1,2) = 1 (for the sequence (1, 2))\n\nf(1,3) = 2 (for (1, 2) and (3))\n\nf(2,2) = 0\n\nf(2,3) = 1 (for (3))\n\nf(3,3) = 1 (for (3))\n\nSample Input 2\n\n5 8\n9 9 9 9 9\n\nSample Output 2\n\n0\n\nSample Input 3\n\n10 10\n3 1 4 1 5 9 2 6 5 3\n\nSample Output 3\n\n152", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 64, "memory_kb": 128}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s744104793", "group_id": "codeNet:p02735", "input_text": "uses math;\nvar n,m,i,j:longint;\n a:array[0..100,0..100]of longint;\n c:char;\nbegin\n fillchar(a,sizeof(a),$3f);\n a[1,0]:=0;\n readln(n,m);\n for i:=1 to n do\n begin\n for j:=1 to m do\n begin\n read(c);\n a[i,j]:=ord(c='#')+min(a[i-1,j],a[i,j-1]);\n end;\n readln;\n end;\n writeln(a[n,m]);\nend.", "language": "Pascal", "metadata": {"date": 1587218944, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p02735.html", "problem_id": "p02735", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02735/input.txt", "sample_output_relpath": "derived/input_output/data/p02735/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02735/Pascal/s744104793.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s744104793", "user_id": "u723721005"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "uses math;\nvar n,m,i,j:longint;\n a:array[0..100,0..100]of longint;\n c:char;\nbegin\n fillchar(a,sizeof(a),$3f);\n a[1,0]:=0;\n readln(n,m);\n for i:=1 to n do\n begin\n for j:=1 to m do\n begin\n read(c);\n a[i,j]:=ord(c='#')+min(a[i-1,j],a[i,j-1]);\n end;\n readln;\n end;\n writeln(a[n,m]);\nend.", "problem_context": "Score : 400 points\n\nProblem Statement\n\nConsider a grid with H rows and W columns of squares. Let (r, c) denote the square at the r-th row from the top and the c-th column from the left.\nEach square is painted black or white.\n\nThe grid is said to be good if and only if the following condition is satisfied:\n\nFrom (1, 1), we can reach (H, W) by moving one square right or down repeatedly, while always being on a white square.\n\nNote that (1, 1) and (H, W) must be white if the grid is good.\n\nYour task is to make the grid good by repeating the operation below. Find the minimum number of operations needed to complete the task. It can be proved that you can always complete the task in a finite number of operations.\n\nChoose four integers r_0, c_0, r_1, c_1(1 \\leq r_0 \\leq r_1 \\leq H, 1 \\leq c_0 \\leq c_1 \\leq W). For each pair r, c (r_0 \\leq r \\leq r_1, c_0 \\leq c \\leq c_1), invert the color of (r, c) - that is, from white to black and vice versa.\n\nConstraints\n\n2 \\leq H, W \\leq 100\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W\ns_{11} s_{12} \\cdots s_{1W}\ns_{21} s_{22} \\cdots s_{2W}\n\\vdots\ns_{H1} s_{H2} \\cdots s_{HW}\n\nHere s_{rc} represents the color of (r, c) - # stands for black, and . stands for white.\n\nOutput\n\nPrint the minimum number of operations needed.\n\nSample Input 1\n\n3 3\n.##\n.#.\n##.\n\nSample Output 1\n\n1\n\nDo the operation with (r_0, c_0, r_1, c_1) = (2, 2, 2, 2) to change just the color of (2, 2), and we are done.\n\nSample Input 2\n\n2 2\n#.\n.#\n\nSample Output 2\n\n2\n\nSample Input 3\n\n4 4\n..##\n#...\n###.\n###.\n\nSample Output 3\n\n0\n\nNo operation may be needed.\n\nSample Input 4\n\n5 5\n.#.#.\n#.#.#\n.#.#.\n#.#.#\n.#.#.\n\nSample Output 4\n\n4", "sample_input": "3 3\n.##\n.#.\n##.\n"}, "reference_outputs": ["1\n"], "source_document_id": "p02735", "source_text": "Score : 400 points\n\nProblem Statement\n\nConsider a grid with H rows and W columns of squares. Let (r, c) denote the square at the r-th row from the top and the c-th column from the left.\nEach square is painted black or white.\n\nThe grid is said to be good if and only if the following condition is satisfied:\n\nFrom (1, 1), we can reach (H, W) by moving one square right or down repeatedly, while always being on a white square.\n\nNote that (1, 1) and (H, W) must be white if the grid is good.\n\nYour task is to make the grid good by repeating the operation below. Find the minimum number of operations needed to complete the task. It can be proved that you can always complete the task in a finite number of operations.\n\nChoose four integers r_0, c_0, r_1, c_1(1 \\leq r_0 \\leq r_1 \\leq H, 1 \\leq c_0 \\leq c_1 \\leq W). For each pair r, c (r_0 \\leq r \\leq r_1, c_0 \\leq c \\leq c_1), invert the color of (r, c) - that is, from white to black and vice versa.\n\nConstraints\n\n2 \\leq H, W \\leq 100\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W\ns_{11} s_{12} \\cdots s_{1W}\ns_{21} s_{22} \\cdots s_{2W}\n\\vdots\ns_{H1} s_{H2} \\cdots s_{HW}\n\nHere s_{rc} represents the color of (r, c) - # stands for black, and . stands for white.\n\nOutput\n\nPrint the minimum number of operations needed.\n\nSample Input 1\n\n3 3\n.##\n.#.\n##.\n\nSample Output 1\n\n1\n\nDo the operation with (r_0, c_0, r_1, c_1) = (2, 2, 2, 2) to change just the color of (2, 2), and we are done.\n\nSample Input 2\n\n2 2\n#.\n.#\n\nSample Output 2\n\n2\n\nSample Input 3\n\n4 4\n..##\n#...\n###.\n###.\n\nSample Output 3\n\n0\n\nNo operation may be needed.\n\nSample Input 4\n\n5 5\n.#.#.\n#.#.#\n.#.#.\n#.#.#\n.#.#.\n\nSample Output 4\n\n4", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s224721751", "group_id": "codeNet:p02735", "input_text": "var\n\tH,W,i,j,x,y:Longint;\n\tS:Array[1..100]of String;\n\tdp:Array[1..100,1..100]of Longint;\nbegin\n\treadln(H,W);\n\tfor i:=1 to H do begin\n\t\treadln(S[i]);\n\t\tfor j:=1 to W do begin\n\t\t\tx:=100000;\n\t\t\ty:=100000;\n\t\t\tif i>1 then begin\n\t\t\t\tx:=dp[i-1,j];\n\t\t\t\tif(S[i-1][j]='.')and(S[i][j]='#')then inc(x);\n\t\t\tend;\n\t\t\tif j>1 then begin\n\t\t\t\ty:=dp[i,j-1];\n\t\t\t\tif(S[i][j-1]='.')and(S[i][j]='#')then inc(y);\n\t\t\tend;\n\t\t\tif x1 then begin\n\t\t\t\tx:=dp[i-1,j];\n\t\t\t\tif(S[i-1][j]='.')and(S[i][j]='#')then inc(x);\n\t\t\tend;\n\t\t\tif j>1 then begin\n\t\t\t\ty:=dp[i,j-1];\n\t\t\t\tif(S[i][j-1]='.')and(S[i][j]='#')then inc(y);\n\t\t\tend;\n\t\t\tif xdd then begin\n\t\t\t\t\ttmp:=bb;\n\t\t\t\t\tbb:=dd;\n\t\t\t\t\tdd:=tmp;\n\t\t\t\tend;\n\t\t\t\twhile bb mod 3<>1 do inc(bb);\n\t\t\t\tif bb<=dd then begin\n\t\t\t\t\ta:=a mod T[j];\n\t\t\t\t\tc:=c mod T[j];\n\t\t\t\t\tif a>c then begin\n\t\t\t\t\t\ttmp:=a;\n\t\t\t\t\t\ta:=c;\n\t\t\t\t\t\tc:=tmp;\n\t\t\t\t\tend;\n\t\t\t\t\tif a+c+1<3*T[j-1]then plus:=a+1-T[j-1]else plus:=2*T[j-1]-c;\n\t\t\t\t\tbreak;\n\t\t\t\tend;\n\t\t\tend;\n\t\t\tif(b div T[j-1]=d div T[j-1])and(b div T[j-1]mod 3=1)then begin\n\t\t\t\taa:=a div T[j-1];\n\t\t\t\tcc:=c div T[j-1];\n\t\t\t\tif aa>cc then begin\n\t\t\t\t\ttmp:=aa;\n\t\t\t\t\taa:=cc;\n\t\t\t\t\tcc:=tmp;\n\t\t\t\tend;\n\t\t\t\twhile aa mod 3<>1 do inc(aa);\n\t\t\t\tif aa<=cc then begin\n\t\t\t\t\tb:=b mod T[j];\n\t\t\t\t\td:=d mod T[j];\n\t\t\t\t\tif b>d then begin\n\t\t\t\t\t\ttmp:=b;\n\t\t\t\t\t\tb:=d;\n\t\t\t\t\t\td:=tmp;\n\t\t\t\t\tend;\n\t\t\t\t\tif b+d+1<3*T[j-1]then plus:=b+1-T[j-1]else plus:=2*T[j-1]-d;\n\t\t\t\t\tbreak;\n\t\t\t\tend;\n\t\t\tend;\n\t\tend;\n\t\twriteln(ans+plus*2);\n\tend;\nend.\n", "language": "Pascal", "metadata": {"date": 1584251590, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p02746.html", "problem_id": "p02746", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02746/input.txt", "sample_output_relpath": "derived/input_output/data/p02746/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02746/Pascal/s965737795.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s965737795", "user_id": "u657913472"}, "prompt_components": {"gold_output": "5\n8\n", "input_to_evaluate": "var\n\tQ,i,j:Longint;\n\tT:Array[0..30]of int64;\n\ta,b,c,d,aa,bb,cc,dd,ans,plus,tmp:int64;\nbegin\n\tT[0]:=1;\n\tfor i:=1 to 30 do T[i]:=T[i-1]*3;\n\tread(Q);\n\tfor i:=1 to Q do begin\n\t\tread(a,b,c,d);\n\t\tdec(a);\n\t\tdec(b);\n\t\tdec(c);\n\t\tdec(d);\n\t\tans:=abs(a-c)+abs(b-d);\n\t\tplus:=0;\n\t\tfor j:=30 downto 1 do begin\n\t\t\tif(a div T[j-1]=c div T[j-1])and(a div T[j-1]mod 3=1)then begin\n\t\t\t\tbb:=b div T[j-1];\n\t\t\t\tdd:=d div T[j-1];\n\t\t\t\tif bb>dd then begin\n\t\t\t\t\ttmp:=bb;\n\t\t\t\t\tbb:=dd;\n\t\t\t\t\tdd:=tmp;\n\t\t\t\tend;\n\t\t\t\twhile bb mod 3<>1 do inc(bb);\n\t\t\t\tif bb<=dd then begin\n\t\t\t\t\ta:=a mod T[j];\n\t\t\t\t\tc:=c mod T[j];\n\t\t\t\t\tif a>c then begin\n\t\t\t\t\t\ttmp:=a;\n\t\t\t\t\t\ta:=c;\n\t\t\t\t\t\tc:=tmp;\n\t\t\t\t\tend;\n\t\t\t\t\tif a+c+1<3*T[j-1]then plus:=a+1-T[j-1]else plus:=2*T[j-1]-c;\n\t\t\t\t\tbreak;\n\t\t\t\tend;\n\t\t\tend;\n\t\t\tif(b div T[j-1]=d div T[j-1])and(b div T[j-1]mod 3=1)then begin\n\t\t\t\taa:=a div T[j-1];\n\t\t\t\tcc:=c div T[j-1];\n\t\t\t\tif aa>cc then begin\n\t\t\t\t\ttmp:=aa;\n\t\t\t\t\taa:=cc;\n\t\t\t\t\tcc:=tmp;\n\t\t\t\tend;\n\t\t\t\twhile aa mod 3<>1 do inc(aa);\n\t\t\t\tif aa<=cc then begin\n\t\t\t\t\tb:=b mod T[j];\n\t\t\t\t\td:=d mod T[j];\n\t\t\t\t\tif b>d then begin\n\t\t\t\t\t\ttmp:=b;\n\t\t\t\t\t\tb:=d;\n\t\t\t\t\t\td:=tmp;\n\t\t\t\t\tend;\n\t\t\t\t\tif b+d+1<3*T[j-1]then plus:=b+1-T[j-1]else plus:=2*T[j-1]-d;\n\t\t\t\t\tbreak;\n\t\t\t\tend;\n\t\t\tend;\n\t\tend;\n\t\twriteln(ans+plus*2);\n\tend;\nend.\n", "problem_context": "Score : 600 points\n\nProblem Statement\n\nFor a non-negative integer K, we define a fractal of level K as follows:\n\nA fractal of level 0 is a grid with just one white square.\n\nWhen K > 0, a fractal of level K is a 3^K \\times 3^K grid. If we divide this grid into nine 3^{K-1} \\times 3^{K-1} subgrids:\n\nThe central subgrid consists of only black squares.\n\nEach of the other eight subgrids is a fractal of level K-1.\n\nFor example, a fractal of level 2 is as follows:\n\nIn a fractal of level 30, let (r, c) denote the square at the r-th row from the top and the c-th column from the left.\n\nYou are given Q quadruples of integers (a_i, b_i, c_i, d_i).\nFor each quadruple, find the distance from (a_i, b_i) to (c_i, d_i).\n\nHere the distance from (a, b) to (c, d) is the minimum integer n that satisfies the following condition:\n\nThere exists a sequence of white squares (x_0, y_0), \\ldots, (x_n, y_n) satisfying the following conditions:\n\n(x_0, y_0) = (a, b)\n\n(x_n, y_n) = (c, d)\n\nFor every i (0 \\leq i \\leq n-1), (x_i, y_i) and (x_{i+1}, y_{i+1}) share a side.\n\nConstraints\n\n1 \\leq Q \\leq 10000\n\n1 \\leq a_i, b_i, c_i, d_i \\leq 3^{30}\n\n(a_i, b_i) \\neq (c_i, d_i)\n\n(a_i, b_i) and (c_i, d_i) are white squares.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nQ\na_1 \\ b_1 \\ c_1 \\ d_1\n:\na_Q \\ b_Q \\ c_Q \\ d_Q\n\nOutput\n\nPrint Q lines.\nThe i-th line should contain the distance from (a_i, b_i) to (c_i, d_i).\n\nSample Input 1\n\n2\n4 2 7 4\n9 9 1 9\n\nSample Output 1\n\n5\n8", "sample_input": "2\n4 2 7 4\n9 9 1 9\n"}, "reference_outputs": ["5\n8\n"], "source_document_id": "p02746", "source_text": "Score : 600 points\n\nProblem Statement\n\nFor a non-negative integer K, we define a fractal of level K as follows:\n\nA fractal of level 0 is a grid with just one white square.\n\nWhen K > 0, a fractal of level K is a 3^K \\times 3^K grid. If we divide this grid into nine 3^{K-1} \\times 3^{K-1} subgrids:\n\nThe central subgrid consists of only black squares.\n\nEach of the other eight subgrids is a fractal of level K-1.\n\nFor example, a fractal of level 2 is as follows:\n\nIn a fractal of level 30, let (r, c) denote the square at the r-th row from the top and the c-th column from the left.\n\nYou are given Q quadruples of integers (a_i, b_i, c_i, d_i).\nFor each quadruple, find the distance from (a_i, b_i) to (c_i, d_i).\n\nHere the distance from (a, b) to (c, d) is the minimum integer n that satisfies the following condition:\n\nThere exists a sequence of white squares (x_0, y_0), \\ldots, (x_n, y_n) satisfying the following conditions:\n\n(x_0, y_0) = (a, b)\n\n(x_n, y_n) = (c, d)\n\nFor every i (0 \\leq i \\leq n-1), (x_i, y_i) and (x_{i+1}, y_{i+1}) share a side.\n\nConstraints\n\n1 \\leq Q \\leq 10000\n\n1 \\leq a_i, b_i, c_i, d_i \\leq 3^{30}\n\n(a_i, b_i) \\neq (c_i, d_i)\n\n(a_i, b_i) and (c_i, d_i) are white squares.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nQ\na_1 \\ b_1 \\ c_1 \\ d_1\n:\na_Q \\ b_Q \\ c_Q \\ d_Q\n\nOutput\n\nPrint Q lines.\nThe i-th line should contain the distance from (a_i, b_i) to (c_i, d_i).\n\nSample Input 1\n\n2\n4 2 7 4\n9 9 1 9\n\nSample Output 1\n\n5\n8", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1240, "cpu_time_ms": 24, "memory_kb": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s831395718", "group_id": "codeNet:p02750", "input_text": "{$R+,S+,Q+,I+,O-}\n{R-,S-,Q-,I-,O+}\n// Code By H~$~C\n\nuses math;\n\ntype\n int32 = int64;\n double = extended;\n bool = boolean;\n\nconst\n inf = 1061109567;\n lnf = 4557430888798830399;\n Maxn = 200005;\n LOG = 32;\n\nvar\n i, j: int32;\n swap_tmp, x, y, z: int64;\n n, T, sza, szb, ans: int64;\n a: array [0 .. Maxn, 0 .. 1] of int64;\n b: array [0 .. Maxn] of int64;\n dp: array [0 .. LOG] of int64;\n\nfunction qsort_less(i, j: int32): bool;\nbegin\n qsort_less := (a[j][0] * (a[i][1] + 1) < (a[i][0] * (a[j][1] + 1)));\nend;\nprocedure qsort_swap(i, j: int32);\nbegin\n a[0] := a[i];\n a[i] := a[j];\n a[j] := a[0];\nend;\nprocedure qsort(_l, _r: int32);\n var i, j, _p: int32;\nbegin\n if (_r = _l) then exit;\n i := _l; j := _r;\n _p := _l;\n repeat\n while qsort_less(i, _p) do inc(i);\n while qsort_less(_p, j) do dec(j);\n if (i <= j) then begin\n qsort_swap(i, j);\n inc(i); dec(j);\n end;\n until (i > j);\n if (i < _r) then qsort(i, _r);\n if (j > _l) then qsort(_l, j);\nend;\n\nfunction qsort2_less(i, j: int32): bool;\nbegin\n qsort2_less := (b[i] < b[j]);\nend;\nprocedure qsort2_swap(i, j: int32);\nbegin\n b[0] := b[i];\n b[i] := b[j];\n b[j] := b[0];\nend;\nprocedure qsort2(_l, _r: int32);\n var i, j, _p: int32;\nbegin\n if (_r = _l) then exit;\n i := _l; j := _r;\n _p := _l;\n repeat\n while qsort2_less(i, _p) do inc(i);\n while qsort2_less(_p, j) do dec(j);\n if (i <= j) then begin\n qsort2_swap(i, j);\n inc(i); dec(j);\n end;\n until (i > j);\n if (i < _r) then qsort2(i, _r);\n if (j > _l) then qsort2(_l, j);\nend;\n\nbegin\n// assign(input,'in'); reset(input);\n// assign(output,'out'); rewrite(output);\n randomize;\n \n readln(n, T);\n sza := 0; szb := 0;\n for i := 1 to n do begin\n readln(x, y);\n if (x = 0) then begin\n inc(szb);\n b[szb] := y;\n end\n else begin\n inc(sza);\n a[sza, 0] := x;\n a[sza, 1] := y;\n end;\n end;\n \n for i := 2 to sza do begin\n x := random(i - 1) + 1;\n a[0] := a[x];\n a[x] := a[i];\n a[i] := a[0];\n end;\n qsort(1, sza);\n \n for i := 1 to LOG do dp[i] := T + 1;\n dp[0] := 0;\n for i := 1 to sza do begin\n for j := LOG - 1 downto 0 do begin\n if (dp[j] > T) then continue;\n if (dp[j + 1] > dp[j] + 1 + (dp[j] + 1) * a[i][0] + a[i][1]) then begin\n dp[j + 1] := dp[j] + 1 + (dp[j] + 1) * a[i][0] + a[i][1];\n end;\n end;\n end;\n \n for i := 2 to n do begin\n x := random(i - 1) + 1;\n b[0] := b[x];\n b[x] := b[i];\n b[i] := b[0];\n end;\n qsort2(1, szb);\n ans := 0;\n for i := 0 to LOG do begin\n if (dp[i] > T) then continue;\n x := T - dp[i];\n y := 0;\n for j := 1 to szb do begin\n if (x > b[j]) then begin\n dec(x, b[j] + 1);\n inc(y);\n end\n else break;\n end;\n if (i + y > ans) then ans := i + y;\n end;\n \n writeln(ans);\n \n close(input);\n close(output);\nend.\n", "language": "Pascal", "metadata": {"date": 1583871080, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p02750.html", "problem_id": "p02750", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02750/input.txt", "sample_output_relpath": "derived/input_output/data/p02750/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02750/Pascal/s831395718.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s831395718", "user_id": "u144695182"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "{$R+,S+,Q+,I+,O-}\n{R-,S-,Q-,I-,O+}\n// Code By H~$~C\n\nuses math;\n\ntype\n int32 = int64;\n double = extended;\n bool = boolean;\n\nconst\n inf = 1061109567;\n lnf = 4557430888798830399;\n Maxn = 200005;\n LOG = 32;\n\nvar\n i, j: int32;\n swap_tmp, x, y, z: int64;\n n, T, sza, szb, ans: int64;\n a: array [0 .. Maxn, 0 .. 1] of int64;\n b: array [0 .. Maxn] of int64;\n dp: array [0 .. LOG] of int64;\n\nfunction qsort_less(i, j: int32): bool;\nbegin\n qsort_less := (a[j][0] * (a[i][1] + 1) < (a[i][0] * (a[j][1] + 1)));\nend;\nprocedure qsort_swap(i, j: int32);\nbegin\n a[0] := a[i];\n a[i] := a[j];\n a[j] := a[0];\nend;\nprocedure qsort(_l, _r: int32);\n var i, j, _p: int32;\nbegin\n if (_r = _l) then exit;\n i := _l; j := _r;\n _p := _l;\n repeat\n while qsort_less(i, _p) do inc(i);\n while qsort_less(_p, j) do dec(j);\n if (i <= j) then begin\n qsort_swap(i, j);\n inc(i); dec(j);\n end;\n until (i > j);\n if (i < _r) then qsort(i, _r);\n if (j > _l) then qsort(_l, j);\nend;\n\nfunction qsort2_less(i, j: int32): bool;\nbegin\n qsort2_less := (b[i] < b[j]);\nend;\nprocedure qsort2_swap(i, j: int32);\nbegin\n b[0] := b[i];\n b[i] := b[j];\n b[j] := b[0];\nend;\nprocedure qsort2(_l, _r: int32);\n var i, j, _p: int32;\nbegin\n if (_r = _l) then exit;\n i := _l; j := _r;\n _p := _l;\n repeat\n while qsort2_less(i, _p) do inc(i);\n while qsort2_less(_p, j) do dec(j);\n if (i <= j) then begin\n qsort2_swap(i, j);\n inc(i); dec(j);\n end;\n until (i > j);\n if (i < _r) then qsort2(i, _r);\n if (j > _l) then qsort2(_l, j);\nend;\n\nbegin\n// assign(input,'in'); reset(input);\n// assign(output,'out'); rewrite(output);\n randomize;\n \n readln(n, T);\n sza := 0; szb := 0;\n for i := 1 to n do begin\n readln(x, y);\n if (x = 0) then begin\n inc(szb);\n b[szb] := y;\n end\n else begin\n inc(sza);\n a[sza, 0] := x;\n a[sza, 1] := y;\n end;\n end;\n \n for i := 2 to sza do begin\n x := random(i - 1) + 1;\n a[0] := a[x];\n a[x] := a[i];\n a[i] := a[0];\n end;\n qsort(1, sza);\n \n for i := 1 to LOG do dp[i] := T + 1;\n dp[0] := 0;\n for i := 1 to sza do begin\n for j := LOG - 1 downto 0 do begin\n if (dp[j] > T) then continue;\n if (dp[j + 1] > dp[j] + 1 + (dp[j] + 1) * a[i][0] + a[i][1]) then begin\n dp[j + 1] := dp[j] + 1 + (dp[j] + 1) * a[i][0] + a[i][1];\n end;\n end;\n end;\n \n for i := 2 to n do begin\n x := random(i - 1) + 1;\n b[0] := b[x];\n b[x] := b[i];\n b[i] := b[0];\n end;\n qsort2(1, szb);\n ans := 0;\n for i := 0 to LOG do begin\n if (dp[i] > T) then continue;\n x := T - dp[i];\n y := 0;\n for j := 1 to szb do begin\n if (x > b[j]) then begin\n dec(x, b[j] + 1);\n inc(y);\n end\n else break;\n end;\n if (i + y > ans) then ans := i + y;\n end;\n \n writeln(ans);\n \n close(input);\n close(output);\nend.\n", "problem_context": "Score : 800 points\n\nProblem Statement\n\nThere are N stores called Store 1, Store 2, \\cdots, Store N. Takahashi, who is at his house at time 0, is planning to visit some of these stores.\n\nIt takes Takahashi one unit of time to travel from his house to one of the stores, or between any two stores.\n\nIf Takahashi reaches Store i at time t, he can do shopping there after standing in a queue for a_i \\times t + b_i units of time. (We assume that it takes no time other than waiting.)\n\nAll the stores close at time T + 0.5. If Takahashi is standing in a queue for some store then, he cannot do shopping there.\n\nTakahashi does not do shopping more than once in the same store.\n\nFind the maximum number of times he can do shopping before time T + 0.5.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 2 \\times 10^5\n\n0 \\leq a_i \\leq 10^9\n\n0 \\leq b_i \\leq 10^9\n\n0 \\leq T \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN T\na_1 b_1\na_2 b_2\n\\vdots\na_N b_N\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n3 7\n2 0\n3 2\n0 3\n\nSample Output 1\n\n2\n\nHere is one possible way to visit stores:\n\nFrom time 0 to time 1: in 1 unit of time, he travels from his house to Store 1.\n\nFrom time 1 to time 3: for 2 units of time, he stands in a queue for Store 1 to do shopping.\n\nFrom time 3 to time 4: in 1 unit of time, he travels from Store 1 to Store 3.\n\nFrom time 4 to time 7: for 3 units of time, he stands in a queue for Store 3 to do shopping.\n\nIn this way, he can do shopping twice before time 7.5.\n\nSample Input 2\n\n1 3\n0 3\n\nSample Output 2\n\n0\n\nSample Input 3\n\n5 21600\n2 14\n3 22\n1 3\n1 10\n1 9\n\nSample Output 3\n\n5\n\nSample Input 4\n\n7 57\n0 25\n3 10\n2 4\n5 15\n3 22\n2 14\n1 15\n\nSample Output 4\n\n3", "sample_input": "3 7\n2 0\n3 2\n0 3\n"}, "reference_outputs": ["2\n"], "source_document_id": "p02750", "source_text": "Score : 800 points\n\nProblem Statement\n\nThere are N stores called Store 1, Store 2, \\cdots, Store N. Takahashi, who is at his house at time 0, is planning to visit some of these stores.\n\nIt takes Takahashi one unit of time to travel from his house to one of the stores, or between any two stores.\n\nIf Takahashi reaches Store i at time t, he can do shopping there after standing in a queue for a_i \\times t + b_i units of time. (We assume that it takes no time other than waiting.)\n\nAll the stores close at time T + 0.5. If Takahashi is standing in a queue for some store then, he cannot do shopping there.\n\nTakahashi does not do shopping more than once in the same store.\n\nFind the maximum number of times he can do shopping before time T + 0.5.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 2 \\times 10^5\n\n0 \\leq a_i \\leq 10^9\n\n0 \\leq b_i \\leq 10^9\n\n0 \\leq T \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN T\na_1 b_1\na_2 b_2\n\\vdots\na_N b_N\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n3 7\n2 0\n3 2\n0 3\n\nSample Output 1\n\n2\n\nHere is one possible way to visit stores:\n\nFrom time 0 to time 1: in 1 unit of time, he travels from his house to Store 1.\n\nFrom time 1 to time 3: for 2 units of time, he stands in a queue for Store 1 to do shopping.\n\nFrom time 3 to time 4: in 1 unit of time, he travels from Store 1 to Store 3.\n\nFrom time 4 to time 7: for 3 units of time, he stands in a queue for Store 3 to do shopping.\n\nIn this way, he can do shopping twice before time 7.5.\n\nSample Input 2\n\n1 3\n0 3\n\nSample Output 2\n\n0\n\nSample Input 3\n\n5 21600\n2 14\n3 22\n1 3\n1 10\n1 9\n\nSample Output 3\n\n5\n\nSample Input 4\n\n7 57\n0 25\n3 10\n2 4\n5 15\n3 22\n2 14\n1 15\n\nSample Output 4\n\n3", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 2859, "cpu_time_ms": 193, "memory_kb": 4864}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s126271793", "group_id": "codeNet:p02756", "input_text": "var\n\tS:Array[-200000..300000]of Char;\n\tins:String;\n\ti,Q,d,id,F,l,r:Longint;\n\tc:Char;\nbegin\n\treadln(ins);\n\tfor i:=1 to length(ins)do S[i]:=ins[i];\n\tr:=length(ins);\n\tl:=1;\n\tread(Q);\n\tfor i:=1 to Q do begin\n\t\tread(id);\n\t\tif id=1 then d:=1-d else begin\n\t\t\tread(F,c,c);\n\t\t\tif (d+F)mod 2=0 then begin\n\t\t\t\tinc(r);\n\t\t\t\tS[r]:=c;\n\t\t\tend else begin\n\t\t\t\tdec(l);\n\t\t\t\tS[l]:=c;\n\t\t\tend;\n\t\tend;\n\tend;\n\tif d=0 then for i:=l to r do write(S[i])else for i:=r downto l do write(S[i]);\n\twriteln;\nend.\n", "language": "Pascal", "metadata": {"date": 1583908449, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p02756.html", "problem_id": "p02756", "resource_group": "low_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/Pascal/s126271793.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s126271793", "user_id": "u657913472"}, "prompt_components": {"gold_output": "cpa\n", "input_to_evaluate": "var\n\tS:Array[-200000..300000]of Char;\n\tins:String;\n\ti,Q,d,id,F,l,r:Longint;\n\tc:Char;\nbegin\n\treadln(ins);\n\tfor i:=1 to length(ins)do S[i]:=ins[i];\n\tr:=length(ins);\n\tl:=1;\n\tread(Q);\n\tfor i:=1 to Q do begin\n\t\tread(id);\n\t\tif id=1 then d:=1-d else begin\n\t\t\tread(F,c,c);\n\t\t\tif (d+F)mod 2=0 then begin\n\t\t\t\tinc(r);\n\t\t\t\tS[r]:=c;\n\t\t\tend else begin\n\t\t\t\tdec(l);\n\t\t\t\tS[l]:=c;\n\t\t\tend;\n\t\tend;\n\tend;\n\tif d=0 then for i:=l to r do write(S[i])else for i:=r downto l do write(S[i]);\n\twriteln;\nend.\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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 40, "memory_kb": 768}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s712532373", "group_id": "codeNet:p02757", "input_text": "var\n\tS:String;\n\tN,P,w,k,i,t:Longint;\n\tcnt:Array[0..9999]of Longint;\n\tans:int64;\nbegin\n\treadln(N,P);\n\treadln(S);\n\tcnt[0]:=1;\n\tk:=1;\n\tfor i:=N downto 1 do begin\n\t\tt:=ord(S[i])-48;\n\t\tk:=k*10 mod P;\n\t\tif k=0 then if t mod p=0 then inc(ans,i)else else begin\n\t\t\tw:=(w+k*t)mod P;\n\t\t\tinc(ans,cnt[w]);\n\t\t\tinc(cnt[w]);\n\t\tend;\n\tend;\n\twriteln(ans);\nend.\n", "language": "Pascal", "metadata": {"date": 1583908756, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p02757.html", "problem_id": "p02757", "resource_group": "low_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/Pascal/s712532373.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s712532373", "user_id": "u657913472"}, "prompt_components": {"gold_output": "6\n", "input_to_evaluate": "var\n\tS:String;\n\tN,P,w,k,i,t:Longint;\n\tcnt:Array[0..9999]of Longint;\n\tans:int64;\nbegin\n\treadln(N,P);\n\treadln(S);\n\tcnt[0]:=1;\n\tk:=1;\n\tfor i:=N downto 1 do begin\n\t\tt:=ord(S[i])-48;\n\t\tk:=k*10 mod P;\n\t\tif k=0 then if t mod p=0 then inc(ans,i)else else begin\n\t\t\tw:=(w+k*t)mod P;\n\t\t\tinc(ans,cnt[w]);\n\t\t\tinc(cnt[w]);\n\t\tend;\n\tend;\n\twriteln(ans);\nend.\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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 342, "cpu_time_ms": 6, "memory_kb": 384}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s954525557", "group_id": "codeNet:p02763", "input_text": "type BITDataType=Longint;\ntype BinaryIndexedTree=record n:Longint;bit:Array of BITDataType;end;\nprocedure init(var bit:BinaryIndexedTree;N:Longint);\nvar i:Longint;\nbegin\n\tbit.n:=N;\n\tsetlength(bit.bit,N+1);\n\tfor i:=1 to N do bit.bit[i]:=0;\nend;\nfunction sum(var bit:BinaryIndexedTree;i:Longint):BITDataType;\nvar ans:BITDataType;\nbegin\n\tans:=0;\n\twhile i>0 do begin\n\t\tinc(ans,bit.bit[i]);\n\t\tdec(i,i and-i);\n\tend;\n\tsum:=ans;\nend;\nprocedure add(var bit:BinaryIndexedTree;i:Longint;a:BITDataType);\nbegin\n\twhile i<=bit.n do begin\n\t\tinc(bit.bit[i],a);\n\t\tinc(i,i and-i);\n\tend;\nend;\n\nvar\n\tN,Q,i,qt,id,l,r,cnt:Longint;\n\tS:String;\n\tc:Char;\n\tbit:Array['a'..'z']of BinaryIndexedTree;\nbegin\n\treadln(N);\n\treadln(S);\n\treadln(Q);\n\tfor c:='a' to 'z' do init(bit[c],N);\n\tfor i:=1 to N do add(bit[S[i]],i,1);\n\tfor i:=1 to Q do begin\n\t\tread(qt);\n\t\tif qt=1 then begin\n\t\t\tread(id);\n\t\t\tread(c);\n\t\t\tread(c);\n\t\t\tadd(bit[S[id]],id,-1);\n\t\t\tS[id]:=c;\n\t\t\tadd(bit[S[id]],id,1);\n\t\tend else begin\n\t\t\tread(l,r);\n\t\t\tcnt:=0;\n\t\t\tfor c:='a' to 'z' do if sum(bit[c],r)>sum(bit[c],l-1) then inc(cnt);\n\t\t\twriteln(cnt);\n\t\tend;\n\tend;\nend.\n", "language": "Pascal", "metadata": {"date": 1583307556, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p02763.html", "problem_id": "p02763", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02763/input.txt", "sample_output_relpath": "derived/input_output/data/p02763/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02763/Pascal/s954525557.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s954525557", "user_id": "u657913472"}, "prompt_components": {"gold_output": "3\n1\n5\n", "input_to_evaluate": "type BITDataType=Longint;\ntype BinaryIndexedTree=record n:Longint;bit:Array of BITDataType;end;\nprocedure init(var bit:BinaryIndexedTree;N:Longint);\nvar i:Longint;\nbegin\n\tbit.n:=N;\n\tsetlength(bit.bit,N+1);\n\tfor i:=1 to N do bit.bit[i]:=0;\nend;\nfunction sum(var bit:BinaryIndexedTree;i:Longint):BITDataType;\nvar ans:BITDataType;\nbegin\n\tans:=0;\n\twhile i>0 do begin\n\t\tinc(ans,bit.bit[i]);\n\t\tdec(i,i and-i);\n\tend;\n\tsum:=ans;\nend;\nprocedure add(var bit:BinaryIndexedTree;i:Longint;a:BITDataType);\nbegin\n\twhile i<=bit.n do begin\n\t\tinc(bit.bit[i],a);\n\t\tinc(i,i and-i);\n\tend;\nend;\n\nvar\n\tN,Q,i,qt,id,l,r,cnt:Longint;\n\tS:String;\n\tc:Char;\n\tbit:Array['a'..'z']of BinaryIndexedTree;\nbegin\n\treadln(N);\n\treadln(S);\n\treadln(Q);\n\tfor c:='a' to 'z' do init(bit[c],N);\n\tfor i:=1 to N do add(bit[S[i]],i,1);\n\tfor i:=1 to Q do begin\n\t\tread(qt);\n\t\tif qt=1 then begin\n\t\t\tread(id);\n\t\t\tread(c);\n\t\t\tread(c);\n\t\t\tadd(bit[S[id]],id,-1);\n\t\t\tS[id]:=c;\n\t\t\tadd(bit[S[id]],id,1);\n\t\tend else begin\n\t\t\tread(l,r);\n\t\t\tcnt:=0;\n\t\t\tfor c:='a' to 'z' do if sum(bit[c],r)>sum(bit[c],l-1) then inc(cnt);\n\t\t\twriteln(cnt);\n\t\tend;\n\tend;\nend.\n", "problem_context": "Score : 500 points\n\nProblem Statement\n\nYou are given a string S of length N consisting of lowercase English letters.\n\nProcess Q queries of the following two types:\n\nType 1: change the i_q-th character of S to c_q. (Do nothing if the i_q-th character is already c_q.)\n\nType 2: answer the number of different characters occurring in the substring of S between the l_q-th and r_q-th characters (inclusive).\n\nConstraints\n\nN, Q, i_q, l_q, and r_q are integers.\n\nS is a string consisting of lowercase English letters.\n\nc_q is a lowercase English letter.\n\n1 \\leq N \\leq 500000\n\n1 \\leq Q \\leq 20000\n\n|S| = N\n\n1 \\leq i_q \\leq N\n\n1 \\leq l_q \\leq r_q \\leq N\n\nThere is at least one query of type 2 in each testcase.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS\nQ\nQuery_1\n\\vdots\nQuery_Q\n\nHere, Query_i in the 4-th through (Q+3)-th lines is one of the following:\n\n1 i_q c_q\n\n2 l_q r_q\n\nOutput\n\nFor each query of type 2, print a line containing the answer.\n\nSample Input 1\n\n7\nabcdbbd\n6\n2 3 6\n1 5 z\n2 1 1\n1 4 a\n1 7 d\n2 1 7\n\nSample Output 1\n\n3\n1\n5\n\nIn the first query, cdbb contains three kinds of letters: b , c , and d, so we print 3.\n\nIn the second query, S is modified to abcdzbd.\n\nIn the third query, a contains one kind of letter: a, so we print 1.\n\nIn the fourth query, S is modified to abcazbd.\n\nIn the fifth query, S does not change and is still abcazbd.\n\nIn the sixth query, abcazbd contains five kinds of letters: a, b, c, d, and z, so we print 5.", "sample_input": "7\nabcdbbd\n6\n2 3 6\n1 5 z\n2 1 1\n1 4 a\n1 7 d\n2 1 7\n"}, "reference_outputs": ["3\n1\n5\n"], "source_document_id": "p02763", "source_text": "Score : 500 points\n\nProblem Statement\n\nYou are given a string S of length N consisting of lowercase English letters.\n\nProcess Q queries of the following two types:\n\nType 1: change the i_q-th character of S to c_q. (Do nothing if the i_q-th character is already c_q.)\n\nType 2: answer the number of different characters occurring in the substring of S between the l_q-th and r_q-th characters (inclusive).\n\nConstraints\n\nN, Q, i_q, l_q, and r_q are integers.\n\nS is a string consisting of lowercase English letters.\n\nc_q is a lowercase English letter.\n\n1 \\leq N \\leq 500000\n\n1 \\leq Q \\leq 20000\n\n|S| = N\n\n1 \\leq i_q \\leq N\n\n1 \\leq l_q \\leq r_q \\leq N\n\nThere is at least one query of type 2 in each testcase.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS\nQ\nQuery_1\n\\vdots\nQuery_Q\n\nHere, Query_i in the 4-th through (Q+3)-th lines is one of the following:\n\n1 i_q c_q\n\n2 l_q r_q\n\nOutput\n\nFor each query of type 2, print a line containing the answer.\n\nSample Input 1\n\n7\nabcdbbd\n6\n2 3 6\n1 5 z\n2 1 1\n1 4 a\n1 7 d\n2 1 7\n\nSample Output 1\n\n3\n1\n5\n\nIn the first query, cdbb contains three kinds of letters: b , c , and d, so we print 3.\n\nIn the second query, S is modified to abcdzbd.\n\nIn the third query, a contains one kind of letter: a, so we print 1.\n\nIn the fourth query, S is modified to abcazbd.\n\nIn the fifth query, S does not change and is still abcazbd.\n\nIn the sixth query, abcazbd contains five kinds of letters: a, b, c, d, and z, so we print 5.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 162, "memory_kb": 51840}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s594359566", "group_id": "codeNet:p02764", "input_text": "uses Math;\nvar\n\tN,K,i,j:Longint;\n\tx,y,c:Array[1..60]of Longint;\n\trr:Array[1..60]of double;\n\tL,R,M,a,t,d,ri,rj,yy:double;\n\tflag:Boolean;\nfunction count(tx,ty:double):Boolean;\nvar i,cnt:Longint;\nbegin\n\tcnt:=0;\n\tfor i:=1 to N do if sqr(X[i]-tx)+sqr(Y[i]-ty)0.000001 do begin\n\t\tM:=(L+R)/2;\n\t\tfor i:=1 to N do rr[i]:=M/c[i];\n\t\tflag:=False;\n\t\tfor i:=1 to N do begin\n\t\t\tif count(X[i],Y[i])then begin\n\t\t\t\tflag:=True;\n\t\t\t\tbreak;\n\t\t\tend;\n\t\tend;\n\t\tif not flag then begin\n\t\t\tfor i:=2 to N do begin\n\t\t\t\tfor j:=1 to i-1 do begin\n\t\t\t\t\td:=sqr(X[i]-X[j])+sqr(Y[i]-Y[j]);\n\t\t\t\t\tri:=rr[i];\n\t\t\t\t\trj:=rr[j];\n\t\t\t\t\tyy:=4*sqr(ri)*d-sqr(sqr(ri)+d-sqr(rj));\n\t\t\t\t\tif yy<0 then continue;\n\t\t\t\t\ta:=arctan2(sqrt(yy),sqr(ri)+d-sqr(rj));\n\t\t\t\t\tt:=arctan2(Y[j]-Y[i],X[j]-X[i]);\n\t\t\t\t\tif count(X[i]+ri*cos(t+a),Y[i]+ri*sin(t+a)) then flag:=True\n\t\t\t\t\telse if count(X[i]+ri*cos(t-a),Y[i]+ri*sin(t-a))then flag:=True;\n\t\t\t\t\tif flag then break;\n\t\t\t\tend;\n\t\t\t\tif flag then break;\n\t\t\tend;\n\t\tend;\n\t\tif flag then R:=M else L:=M;\n\tend;\n\twriteln(R:0:9);\nend.\n", "language": "Pascal", "metadata": {"date": 1583239789, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p02764.html", "problem_id": "p02764", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02764/input.txt", "sample_output_relpath": "derived/input_output/data/p02764/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02764/Pascal/s594359566.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s594359566", "user_id": "u657913472"}, "prompt_components": {"gold_output": "2.4\n", "input_to_evaluate": "uses Math;\nvar\n\tN,K,i,j:Longint;\n\tx,y,c:Array[1..60]of Longint;\n\trr:Array[1..60]of double;\n\tL,R,M,a,t,d,ri,rj,yy:double;\n\tflag:Boolean;\nfunction count(tx,ty:double):Boolean;\nvar i,cnt:Longint;\nbegin\n\tcnt:=0;\n\tfor i:=1 to N do if sqr(X[i]-tx)+sqr(Y[i]-ty)0.000001 do begin\n\t\tM:=(L+R)/2;\n\t\tfor i:=1 to N do rr[i]:=M/c[i];\n\t\tflag:=False;\n\t\tfor i:=1 to N do begin\n\t\t\tif count(X[i],Y[i])then begin\n\t\t\t\tflag:=True;\n\t\t\t\tbreak;\n\t\t\tend;\n\t\tend;\n\t\tif not flag then begin\n\t\t\tfor i:=2 to N do begin\n\t\t\t\tfor j:=1 to i-1 do begin\n\t\t\t\t\td:=sqr(X[i]-X[j])+sqr(Y[i]-Y[j]);\n\t\t\t\t\tri:=rr[i];\n\t\t\t\t\trj:=rr[j];\n\t\t\t\t\tyy:=4*sqr(ri)*d-sqr(sqr(ri)+d-sqr(rj));\n\t\t\t\t\tif yy<0 then continue;\n\t\t\t\t\ta:=arctan2(sqrt(yy),sqr(ri)+d-sqr(rj));\n\t\t\t\t\tt:=arctan2(Y[j]-Y[i],X[j]-X[i]);\n\t\t\t\t\tif count(X[i]+ri*cos(t+a),Y[i]+ri*sin(t+a)) then flag:=True\n\t\t\t\t\telse if count(X[i]+ri*cos(t-a),Y[i]+ri*sin(t-a))then flag:=True;\n\t\t\t\t\tif flag then break;\n\t\t\t\tend;\n\t\t\t\tif flag then break;\n\t\t\tend;\n\t\tend;\n\t\tif flag then R:=M else L:=M;\n\tend;\n\twriteln(R:0:9);\nend.\n", "problem_context": "Score : 600 points\n\nProblem Statement\n\nTakahashi wants to grill N pieces of meat on a grilling net, which can be seen as a two-dimensional plane. The coordinates of the i-th piece of meat are \\left(x_i, y_i\\right), and its hardness is c_i.\n\nTakahashi can use one heat source to grill the meat. If he puts the heat source at coordinates \\left(X, Y\\right), where X and Y are real numbers, the i-th piece of meat will be ready to eat in c_i \\times \\sqrt{\\left(X - x_i\\right)^2 + \\left(Y-y_i\\right)^2} seconds.\n\nTakahashi wants to eat K pieces of meat. Find the time required to have K or more pieces of meat ready if he put the heat source to minimize this time.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 60\n\n1 \\leq K \\leq N\n\n-1000 \\leq x_i , y_i \\leq 1000\n\n\\left(x_i, y_i\\right) \\neq \\left(x_j, y_j\\right) \\left(i \\neq j \\right)\n\n1 \\leq c_i \\leq 100\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nx_1 y_1 c_1\n\\vdots\nx_N y_N c_N\n\nOutput\n\nPrint the answer.\n\nIt will be considered correct if its absolute or relative error from our answer is at most 10^{-6}.\n\nSample Input 1\n\n4 3\n-1 0 3\n0 0 3\n1 0 2\n1 1 40\n\nSample Output 1\n\n2.4\n\nIf we put the heat source at \\left(-0.2, 0\\right), the 1-st, 2-nd, and 3-rd pieces of meat will be ready to eat within 2.4 seconds. This is the optimal place to put the heat source.\n\nSample Input 2\n\n10 5\n-879 981 26\n890 -406 81\n512 859 97\n362 -955 25\n128 553 17\n-885 763 2\n449 310 57\n-656 -204 11\n-270 76 40\n184 170 16\n\nSample Output 2\n\n7411.2252", "sample_input": "4 3\n-1 0 3\n0 0 3\n1 0 2\n1 1 40\n"}, "reference_outputs": ["2.4\n"], "source_document_id": "p02764", "source_text": "Score : 600 points\n\nProblem Statement\n\nTakahashi wants to grill N pieces of meat on a grilling net, which can be seen as a two-dimensional plane. The coordinates of the i-th piece of meat are \\left(x_i, y_i\\right), and its hardness is c_i.\n\nTakahashi can use one heat source to grill the meat. If he puts the heat source at coordinates \\left(X, Y\\right), where X and Y are real numbers, the i-th piece of meat will be ready to eat in c_i \\times \\sqrt{\\left(X - x_i\\right)^2 + \\left(Y-y_i\\right)^2} seconds.\n\nTakahashi wants to eat K pieces of meat. Find the time required to have K or more pieces of meat ready if he put the heat source to minimize this time.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 60\n\n1 \\leq K \\leq N\n\n-1000 \\leq x_i , y_i \\leq 1000\n\n\\left(x_i, y_i\\right) \\neq \\left(x_j, y_j\\right) \\left(i \\neq j \\right)\n\n1 \\leq c_i \\leq 100\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nx_1 y_1 c_1\n\\vdots\nx_N y_N c_N\n\nOutput\n\nPrint the answer.\n\nIt will be considered correct if its absolute or relative error from our answer is at most 10^{-6}.\n\nSample Input 1\n\n4 3\n-1 0 3\n0 0 3\n1 0 2\n1 1 40\n\nSample Output 1\n\n2.4\n\nIf we put the heat source at \\left(-0.2, 0\\right), the 1-st, 2-nd, and 3-rd pieces of meat will be ready to eat within 2.4 seconds. This is the optimal place to put the heat source.\n\nSample Input 2\n\n10 5\n-879 981 26\n890 -406 81\n512 859 97\n362 -955 25\n128 553 17\n-885 763 2\n449 310 57\n-656 -204 11\n-270 76 40\n184 170 16\n\nSample Output 2\n\n7411.2252", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1224, "cpu_time_ms": 37, "memory_kb": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s753864888", "group_id": "codeNet:p02764", "input_text": "uses Math;\nvar\n\tN,K,i,j:Longint;\n\tx,y,c:Array[1..60]of Longint;\n\trr:Array[1..60]of double;\n\tL,R,M,a,t,d,ri,rj,yy:double;\n\tflag:Boolean;\nfunction count(tx,ty:double):Boolean;\nvar i,cnt:Longint;\nbegin\n\tcnt:=0;\n\tfor i:=1 to N do if sqr(X[i]-tx)+sqr(Y[i]-ty)=K;\nend;\nbegin\n\tread(N,K);\n\tfor i:=1 to N do read(x[i],y[i],c[i]);\n\tL:=0;\n\tR:=1000000;\n\twhile R-L>0.00001 do begin\n\t\tM:=(L+R)/2;\n\t\tfor i:=1 to N do rr[i]:=M/c[i];\n\t\tflag:=False;\n\t\tfor i:=1 to N do begin\n\t\t\tif count(X[i],Y[i])then begin\n\t\t\t\tflag:=True;\n\t\t\t\tbreak;\n\t\t\tend;\n\t\tend;\n\t\tif not flag then begin\n\t\t\tfor i:=2 to N do begin\n\t\t\t\tfor j:=1 to i-1 do begin\n\t\t\t\t\td:=sqr(X[i]-X[j])+sqr(Y[i]-Y[j]);\n\t\t\t\t\tri:=rr[i];\n\t\t\t\t\trj:=rr[j];\n\t\t\t\t\tyy:=4*sqr(ri)*d-sqr(sqr(ri)+d-sqr(rj));\n\t\t\t\t\tif yy<0 then continue;\n\t\t\t\t\ta:=arctan2(sqrt(yy),sqr(ri)+d-sqr(rj));\n\t\t\t\t\tt:=arctan2(Y[j]-Y[i],X[j]-X[i]);\n\t\t\t\t\tif count(X[i]+ri*cos(t+a),Y[i]+ri*sin(t+a)) then flag:=True\n\t\t\t\t\telse if count(X[i]+ri*cos(t-a),Y[i]+ri*sin(t-a))then flag:=True;\n\t\t\t\t\tif flag then break;\n\t\t\t\tend;\n\t\t\t\tif flag then break;\n\t\t\tend;\n\t\tend;\n\t\tif flag then R:=M else L:=M;\n\tend;\n\twriteln(R:0:9);\nend.\n", "language": "Pascal", "metadata": {"date": 1583239649, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p02764.html", "problem_id": "p02764", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02764/input.txt", "sample_output_relpath": "derived/input_output/data/p02764/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02764/Pascal/s753864888.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s753864888", "user_id": "u657913472"}, "prompt_components": {"gold_output": "2.4\n", "input_to_evaluate": "uses Math;\nvar\n\tN,K,i,j:Longint;\n\tx,y,c:Array[1..60]of Longint;\n\trr:Array[1..60]of double;\n\tL,R,M,a,t,d,ri,rj,yy:double;\n\tflag:Boolean;\nfunction count(tx,ty:double):Boolean;\nvar i,cnt:Longint;\nbegin\n\tcnt:=0;\n\tfor i:=1 to N do if sqr(X[i]-tx)+sqr(Y[i]-ty)=K;\nend;\nbegin\n\tread(N,K);\n\tfor i:=1 to N do read(x[i],y[i],c[i]);\n\tL:=0;\n\tR:=1000000;\n\twhile R-L>0.00001 do begin\n\t\tM:=(L+R)/2;\n\t\tfor i:=1 to N do rr[i]:=M/c[i];\n\t\tflag:=False;\n\t\tfor i:=1 to N do begin\n\t\t\tif count(X[i],Y[i])then begin\n\t\t\t\tflag:=True;\n\t\t\t\tbreak;\n\t\t\tend;\n\t\tend;\n\t\tif not flag then begin\n\t\t\tfor i:=2 to N do begin\n\t\t\t\tfor j:=1 to i-1 do begin\n\t\t\t\t\td:=sqr(X[i]-X[j])+sqr(Y[i]-Y[j]);\n\t\t\t\t\tri:=rr[i];\n\t\t\t\t\trj:=rr[j];\n\t\t\t\t\tyy:=4*sqr(ri)*d-sqr(sqr(ri)+d-sqr(rj));\n\t\t\t\t\tif yy<0 then continue;\n\t\t\t\t\ta:=arctan2(sqrt(yy),sqr(ri)+d-sqr(rj));\n\t\t\t\t\tt:=arctan2(Y[j]-Y[i],X[j]-X[i]);\n\t\t\t\t\tif count(X[i]+ri*cos(t+a),Y[i]+ri*sin(t+a)) then flag:=True\n\t\t\t\t\telse if count(X[i]+ri*cos(t-a),Y[i]+ri*sin(t-a))then flag:=True;\n\t\t\t\t\tif flag then break;\n\t\t\t\tend;\n\t\t\t\tif flag then break;\n\t\t\tend;\n\t\tend;\n\t\tif flag then R:=M else L:=M;\n\tend;\n\twriteln(R:0:9);\nend.\n", "problem_context": "Score : 600 points\n\nProblem Statement\n\nTakahashi wants to grill N pieces of meat on a grilling net, which can be seen as a two-dimensional plane. The coordinates of the i-th piece of meat are \\left(x_i, y_i\\right), and its hardness is c_i.\n\nTakahashi can use one heat source to grill the meat. If he puts the heat source at coordinates \\left(X, Y\\right), where X and Y are real numbers, the i-th piece of meat will be ready to eat in c_i \\times \\sqrt{\\left(X - x_i\\right)^2 + \\left(Y-y_i\\right)^2} seconds.\n\nTakahashi wants to eat K pieces of meat. Find the time required to have K or more pieces of meat ready if he put the heat source to minimize this time.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 60\n\n1 \\leq K \\leq N\n\n-1000 \\leq x_i , y_i \\leq 1000\n\n\\left(x_i, y_i\\right) \\neq \\left(x_j, y_j\\right) \\left(i \\neq j \\right)\n\n1 \\leq c_i \\leq 100\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nx_1 y_1 c_1\n\\vdots\nx_N y_N c_N\n\nOutput\n\nPrint the answer.\n\nIt will be considered correct if its absolute or relative error from our answer is at most 10^{-6}.\n\nSample Input 1\n\n4 3\n-1 0 3\n0 0 3\n1 0 2\n1 1 40\n\nSample Output 1\n\n2.4\n\nIf we put the heat source at \\left(-0.2, 0\\right), the 1-st, 2-nd, and 3-rd pieces of meat will be ready to eat within 2.4 seconds. This is the optimal place to put the heat source.\n\nSample Input 2\n\n10 5\n-879 981 26\n890 -406 81\n512 859 97\n362 -955 25\n128 553 17\n-885 763 2\n449 310 57\n-656 -204 11\n-270 76 40\n184 170 16\n\nSample Output 2\n\n7411.2252", "sample_input": "4 3\n-1 0 3\n0 0 3\n1 0 2\n1 1 40\n"}, "reference_outputs": ["2.4\n"], "source_document_id": "p02764", "source_text": "Score : 600 points\n\nProblem Statement\n\nTakahashi wants to grill N pieces of meat on a grilling net, which can be seen as a two-dimensional plane. The coordinates of the i-th piece of meat are \\left(x_i, y_i\\right), and its hardness is c_i.\n\nTakahashi can use one heat source to grill the meat. If he puts the heat source at coordinates \\left(X, Y\\right), where X and Y are real numbers, the i-th piece of meat will be ready to eat in c_i \\times \\sqrt{\\left(X - x_i\\right)^2 + \\left(Y-y_i\\right)^2} seconds.\n\nTakahashi wants to eat K pieces of meat. Find the time required to have K or more pieces of meat ready if he put the heat source to minimize this time.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 60\n\n1 \\leq K \\leq N\n\n-1000 \\leq x_i , y_i \\leq 1000\n\n\\left(x_i, y_i\\right) \\neq \\left(x_j, y_j\\right) \\left(i \\neq j \\right)\n\n1 \\leq c_i \\leq 100\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nx_1 y_1 c_1\n\\vdots\nx_N y_N c_N\n\nOutput\n\nPrint the answer.\n\nIt will be considered correct if its absolute or relative error from our answer is at most 10^{-6}.\n\nSample Input 1\n\n4 3\n-1 0 3\n0 0 3\n1 0 2\n1 1 40\n\nSample Output 1\n\n2.4\n\nIf we put the heat source at \\left(-0.2, 0\\right), the 1-st, 2-nd, and 3-rd pieces of meat will be ready to eat within 2.4 seconds. This is the optimal place to put the heat source.\n\nSample Input 2\n\n10 5\n-879 981 26\n890 -406 81\n512 859 97\n362 -955 25\n128 553 17\n-885 763 2\n449 310 57\n-656 -204 11\n-270 76 40\n184 170 16\n\nSample Output 2\n\n7411.2252", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1157, "cpu_time_ms": 26, "memory_kb": 128}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s043567083", "group_id": "codeNet:p02764", "input_text": "uses Math;\nvar\n\tN,K,i,j:Longint;\n\tx,y,c:Array[1..60]of Longint;\n\trr:Array[1..60]of double;\n\tL,R,M,a,t,d,ri,rj,yy:double;\n\tflag:Boolean;\nfunction count(tx,ty:double):Boolean;\nvar i,cnt:Longint;\nbegin\n\tcnt:=0;\n\tfor i:=1 to N do if sqr(X[i]-tx)+sqr(Y[i]-ty)=K;\nend;\nbegin\n\tread(N,K);\n\tfor i:=1 to N do read(x[i],y[i],c[i]);\n\tL:=0;\n\tR:=1000000;\n\twhile R-L>0.000001 do begin\n\t\tM:=(L+R)/2;\n\t\tfor i:=1 to N do rr[i]:=M/c[i];\n\t\tflag:=False;\n\t\tfor i:=1 to N do begin\n\t\t\tif count(X[i],Y[i])then begin\n\t\t\t\tflag:=True;\n\t\t\t\tbreak;\n\t\t\tend;\n\t\tend;\n\t\tif not flag then begin\n\t\t\tfor i:=2 to N do begin\n\t\t\t\tfor j:=1 to i-1 do begin\n\t\t\t\t\td:=sqr(X[i]-X[j])+sqr(Y[i]-Y[j]);\n\t\t\t\t\tri:=rr[i];\n\t\t\t\t\trj:=rr[j];\n\t\t\t\t\tyy:=4*sqr(ri)*d-sqr(sqr(ri)+d-sqr(rj));\n\t\t\t\t\tif yy<0 then continue;\n\t\t\t\t\ta:=arctan2(sqrt(yy),sqr(ri)+d-sqr(rj));\n\t\t\t\t\tt:=arctan2(Y[j]-Y[i],X[j]-X[i]);\n\t\t\t\t\tif count(X[i]+ri*cos(t+a),Y[i]+ri*sin(t+a)) then flag:=True\n\t\t\t\t\telse if count(X[i]+ri*cos(t-a),Y[i]+ri*sin(t-a))then flag:=True;\n\t\t\t\t\tif flag then break;\n\t\t\t\tend;\n\t\t\t\tif flag then break;\n\t\t\tend;\n\t\tend;\n\t\tif flag then R:=M else L:=M;\n\tend;\n\twriteln(R:0:9);\nend.\n", "language": "Pascal", "metadata": {"date": 1583239610, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p02764.html", "problem_id": "p02764", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02764/input.txt", "sample_output_relpath": "derived/input_output/data/p02764/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02764/Pascal/s043567083.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s043567083", "user_id": "u657913472"}, "prompt_components": {"gold_output": "2.4\n", "input_to_evaluate": "uses Math;\nvar\n\tN,K,i,j:Longint;\n\tx,y,c:Array[1..60]of Longint;\n\trr:Array[1..60]of double;\n\tL,R,M,a,t,d,ri,rj,yy:double;\n\tflag:Boolean;\nfunction count(tx,ty:double):Boolean;\nvar i,cnt:Longint;\nbegin\n\tcnt:=0;\n\tfor i:=1 to N do if sqr(X[i]-tx)+sqr(Y[i]-ty)=K;\nend;\nbegin\n\tread(N,K);\n\tfor i:=1 to N do read(x[i],y[i],c[i]);\n\tL:=0;\n\tR:=1000000;\n\twhile R-L>0.000001 do begin\n\t\tM:=(L+R)/2;\n\t\tfor i:=1 to N do rr[i]:=M/c[i];\n\t\tflag:=False;\n\t\tfor i:=1 to N do begin\n\t\t\tif count(X[i],Y[i])then begin\n\t\t\t\tflag:=True;\n\t\t\t\tbreak;\n\t\t\tend;\n\t\tend;\n\t\tif not flag then begin\n\t\t\tfor i:=2 to N do begin\n\t\t\t\tfor j:=1 to i-1 do begin\n\t\t\t\t\td:=sqr(X[i]-X[j])+sqr(Y[i]-Y[j]);\n\t\t\t\t\tri:=rr[i];\n\t\t\t\t\trj:=rr[j];\n\t\t\t\t\tyy:=4*sqr(ri)*d-sqr(sqr(ri)+d-sqr(rj));\n\t\t\t\t\tif yy<0 then continue;\n\t\t\t\t\ta:=arctan2(sqrt(yy),sqr(ri)+d-sqr(rj));\n\t\t\t\t\tt:=arctan2(Y[j]-Y[i],X[j]-X[i]);\n\t\t\t\t\tif count(X[i]+ri*cos(t+a),Y[i]+ri*sin(t+a)) then flag:=True\n\t\t\t\t\telse if count(X[i]+ri*cos(t-a),Y[i]+ri*sin(t-a))then flag:=True;\n\t\t\t\t\tif flag then break;\n\t\t\t\tend;\n\t\t\t\tif flag then break;\n\t\t\tend;\n\t\tend;\n\t\tif flag then R:=M else L:=M;\n\tend;\n\twriteln(R:0:9);\nend.\n", "problem_context": "Score : 600 points\n\nProblem Statement\n\nTakahashi wants to grill N pieces of meat on a grilling net, which can be seen as a two-dimensional plane. The coordinates of the i-th piece of meat are \\left(x_i, y_i\\right), and its hardness is c_i.\n\nTakahashi can use one heat source to grill the meat. If he puts the heat source at coordinates \\left(X, Y\\right), where X and Y are real numbers, the i-th piece of meat will be ready to eat in c_i \\times \\sqrt{\\left(X - x_i\\right)^2 + \\left(Y-y_i\\right)^2} seconds.\n\nTakahashi wants to eat K pieces of meat. Find the time required to have K or more pieces of meat ready if he put the heat source to minimize this time.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 60\n\n1 \\leq K \\leq N\n\n-1000 \\leq x_i , y_i \\leq 1000\n\n\\left(x_i, y_i\\right) \\neq \\left(x_j, y_j\\right) \\left(i \\neq j \\right)\n\n1 \\leq c_i \\leq 100\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nx_1 y_1 c_1\n\\vdots\nx_N y_N c_N\n\nOutput\n\nPrint the answer.\n\nIt will be considered correct if its absolute or relative error from our answer is at most 10^{-6}.\n\nSample Input 1\n\n4 3\n-1 0 3\n0 0 3\n1 0 2\n1 1 40\n\nSample Output 1\n\n2.4\n\nIf we put the heat source at \\left(-0.2, 0\\right), the 1-st, 2-nd, and 3-rd pieces of meat will be ready to eat within 2.4 seconds. This is the optimal place to put the heat source.\n\nSample Input 2\n\n10 5\n-879 981 26\n890 -406 81\n512 859 97\n362 -955 25\n128 553 17\n-885 763 2\n449 310 57\n-656 -204 11\n-270 76 40\n184 170 16\n\nSample Output 2\n\n7411.2252", "sample_input": "4 3\n-1 0 3\n0 0 3\n1 0 2\n1 1 40\n"}, "reference_outputs": ["2.4\n"], "source_document_id": "p02764", "source_text": "Score : 600 points\n\nProblem Statement\n\nTakahashi wants to grill N pieces of meat on a grilling net, which can be seen as a two-dimensional plane. The coordinates of the i-th piece of meat are \\left(x_i, y_i\\right), and its hardness is c_i.\n\nTakahashi can use one heat source to grill the meat. If he puts the heat source at coordinates \\left(X, Y\\right), where X and Y are real numbers, the i-th piece of meat will be ready to eat in c_i \\times \\sqrt{\\left(X - x_i\\right)^2 + \\left(Y-y_i\\right)^2} seconds.\n\nTakahashi wants to eat K pieces of meat. Find the time required to have K or more pieces of meat ready if he put the heat source to minimize this time.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 60\n\n1 \\leq K \\leq N\n\n-1000 \\leq x_i , y_i \\leq 1000\n\n\\left(x_i, y_i\\right) \\neq \\left(x_j, y_j\\right) \\left(i \\neq j \\right)\n\n1 \\leq c_i \\leq 100\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nx_1 y_1 c_1\n\\vdots\nx_N y_N c_N\n\nOutput\n\nPrint the answer.\n\nIt will be considered correct if its absolute or relative error from our answer is at most 10^{-6}.\n\nSample Input 1\n\n4 3\n-1 0 3\n0 0 3\n1 0 2\n1 1 40\n\nSample Output 1\n\n2.4\n\nIf we put the heat source at \\left(-0.2, 0\\right), the 1-st, 2-nd, and 3-rd pieces of meat will be ready to eat within 2.4 seconds. This is the optimal place to put the heat source.\n\nSample Input 2\n\n10 5\n-879 981 26\n890 -406 81\n512 859 97\n362 -955 25\n128 553 17\n-885 763 2\n449 310 57\n-656 -204 11\n-270 76 40\n184 170 16\n\nSample Output 2\n\n7411.2252", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1158, "cpu_time_ms": 29, "memory_kb": 128}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s271670103", "group_id": "codeNet:p02767", "input_text": "var\n\tN,i,s,a:Longint;\n\tX:Array[1..100]of Longint;\nbegin\n\tread(N);\n\tfor i:=1 to N do begin\n\t\tread(X[i]);\n\t\tinc(s,X[i]);\n\tend;\n\ts:=s div N+1;\n\tfor i:=1 to N do begin\n\t\tinc(a,(s-X[i])*(s-X[i]));\n\tend;\n\twriteln(a);\nend.", "language": "Pascal", "metadata": {"date": 1582423660, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p02767.html", "problem_id": "p02767", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02767/input.txt", "sample_output_relpath": "derived/input_output/data/p02767/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02767/Pascal/s271670103.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s271670103", "user_id": "u657913472"}, "prompt_components": {"gold_output": "5\n", "input_to_evaluate": "var\n\tN,i,s,a:Longint;\n\tX:Array[1..100]of Longint;\nbegin\n\tread(N);\n\tfor i:=1 to N do begin\n\t\tread(X[i]);\n\t\tinc(s,X[i]);\n\tend;\n\ts:=s div N+1;\n\tfor i:=1 to N do begin\n\t\tinc(a,(s-X[i])*(s-X[i]));\n\tend;\n\twriteln(a);\nend.", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere are N people living on a number line.\n\nThe i-th person lives at coordinate X_i.\n\nYou are going to hold a meeting that all N people have to attend.\n\nThe meeting can be held at any integer coordinate. If you choose to hold the meeting at coordinate P, the i-th person will spend (X_i - P)^2 points of stamina to attend the meeting.\n\nFind the minimum total points of stamina the N people have to spend.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 100\n\n1 \\leq X_i \\leq 100\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nX_1 X_2 ... X_N\n\nOutput\n\nPrint the minimum total stamina the N people have to spend.\n\nSample Input 1\n\n2\n1 4\n\nSample Output 1\n\n5\n\nAssume the meeting is held at coordinate 2. In this case, the first person will spend (1 - 2)^2 points of stamina, and the second person will spend (4 - 2)^2 = 4 points of stamina, for a total of 5 points of stamina. This is the minimum total stamina that the 2 people have to spend.\n\nNote that you can hold the meeting only at an integer coordinate.\n\nSample Input 2\n\n7\n14 14 2 13 56 2 37\n\nSample Output 2\n\n2354", "sample_input": "2\n1 4\n"}, "reference_outputs": ["5\n"], "source_document_id": "p02767", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere are N people living on a number line.\n\nThe i-th person lives at coordinate X_i.\n\nYou are going to hold a meeting that all N people have to attend.\n\nThe meeting can be held at any integer coordinate. If you choose to hold the meeting at coordinate P, the i-th person will spend (X_i - P)^2 points of stamina to attend the meeting.\n\nFind the minimum total points of stamina the N people have to spend.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 100\n\n1 \\leq X_i \\leq 100\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nX_1 X_2 ... X_N\n\nOutput\n\nPrint the minimum total stamina the N people have to spend.\n\nSample Input 1\n\n2\n1 4\n\nSample Output 1\n\n5\n\nAssume the meeting is held at coordinate 2. In this case, the first person will spend (1 - 2)^2 points of stamina, and the second person will spend (4 - 2)^2 = 4 points of stamina, for a total of 5 points of stamina. This is the minimum total stamina that the 2 people have to spend.\n\nNote that you can hold the meeting only at an integer coordinate.\n\nSample Input 2\n\n7\n14 14 2 13 56 2 37\n\nSample Output 2\n\n2354", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 2, "memory_kb": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s028365198", "group_id": "codeNet:p02768", "input_text": "var\n\tans,n,a,b,mo:int64;\nfunction p(a,b:int64):int64;\nbegin\n\tif b=0 then p:=1 else if b mod 2=0 then p:=p(a*a mod mo,b div 2) else p:=p(a,b-1)*a mod mo;\nend;\nfunction C(k:int64):int64;\nvar x,y:int64;i:Longint;\nbegin\n\tx:=1;\n\ty:=1;\n\tfor i:=1 to k do begin\n\t\tx:=x*(n-i+1)mod mo;\n\t\ty:=y*i mod mo;\n\tend;\n\tC:=x*p(y,mo-2)mod mo;\nend;\nbegin\n\tread(n,a,b);\n\tmo:=1000000007;\n\tans:=p(2,n)-1-c(a)-c(b);\n\tans:=(ans mod mo+mo)mod mo;\n\twriteln(ans);\nend.\n", "language": "Pascal", "metadata": {"date": 1582422531, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p02768.html", "problem_id": "p02768", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02768/input.txt", "sample_output_relpath": "derived/input_output/data/p02768/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02768/Pascal/s028365198.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s028365198", "user_id": "u657913472"}, "prompt_components": {"gold_output": "7\n", "input_to_evaluate": "var\n\tans,n,a,b,mo:int64;\nfunction p(a,b:int64):int64;\nbegin\n\tif b=0 then p:=1 else if b mod 2=0 then p:=p(a*a mod mo,b div 2) else p:=p(a,b-1)*a mod mo;\nend;\nfunction C(k:int64):int64;\nvar x,y:int64;i:Longint;\nbegin\n\tx:=1;\n\ty:=1;\n\tfor i:=1 to k do begin\n\t\tx:=x*(n-i+1)mod mo;\n\t\ty:=y*i mod mo;\n\tend;\n\tC:=x*p(y,mo-2)mod mo;\nend;\nbegin\n\tread(n,a,b);\n\tmo:=1000000007;\n\tans:=p(2,n)-1-c(a)-c(b);\n\tans:=(ans mod mo+mo)mod mo;\n\twriteln(ans);\nend.\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nAkari has n kinds of flowers, one of each kind.\n\nShe is going to choose one or more of these flowers to make a bouquet.\n\nHowever, she hates two numbers a and b, so the number of flowers in the bouquet cannot be a or b.\n\nHow many different bouquets are there that Akari can make?\n\nFind the count modulo (10^9 + 7).\n\nHere, two bouquets are considered different when there is a flower that is used in one of the bouquets but not in the other bouquet.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq n \\leq 10^9\n\n1 \\leq a < b \\leq \\textrm{min}(n, 2 \\times 10^5)\n\nInput\n\nInput is given from Standard Input in the following format:\n\nn a b\n\nOutput\n\nPrint the number of bouquets that Akari can make, modulo (10^9 + 7). (If there are no such bouquets, print 0.)\n\nSample Input 1\n\n4 1 3\n\nSample Output 1\n\n7\n\nIn this case, Akari can choose 2 or 4 flowers to make the bouquet.\n\nThere are 6 ways to choose 2 out of the 4 flowers, and 1 way to choose 4, so there are a total of 7 different bouquets that Akari can make.\n\nSample Input 2\n\n1000000000 141421 173205\n\nSample Output 2\n\n34076506\n\nPrint the count modulo (10^9 + 7).", "sample_input": "4 1 3\n"}, "reference_outputs": ["7\n"], "source_document_id": "p02768", "source_text": "Score : 400 points\n\nProblem Statement\n\nAkari has n kinds of flowers, one of each kind.\n\nShe is going to choose one or more of these flowers to make a bouquet.\n\nHowever, she hates two numbers a and b, so the number of flowers in the bouquet cannot be a or b.\n\nHow many different bouquets are there that Akari can make?\n\nFind the count modulo (10^9 + 7).\n\nHere, two bouquets are considered different when there is a flower that is used in one of the bouquets but not in the other bouquet.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq n \\leq 10^9\n\n1 \\leq a < b \\leq \\textrm{min}(n, 2 \\times 10^5)\n\nInput\n\nInput is given from Standard Input in the following format:\n\nn a b\n\nOutput\n\nPrint the number of bouquets that Akari can make, modulo (10^9 + 7). (If there are no such bouquets, print 0.)\n\nSample Input 1\n\n4 1 3\n\nSample Output 1\n\n7\n\nIn this case, Akari can choose 2 or 4 flowers to make the bouquet.\n\nThere are 6 ways to choose 2 out of the 4 flowers, and 1 way to choose 4, so there are a total of 7 different bouquets that Akari can make.\n\nSample Input 2\n\n1000000000 141421 173205\n\nSample Output 2\n\n34076506\n\nPrint the count modulo (10^9 + 7).", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 439, "cpu_time_ms": 8, "memory_kb": 128}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s801443013", "group_id": "codeNet:p02769", "input_text": "var\n\tans,x,y,mo:int64;\n\tF,I:Array[0..200000]of int64;\n\tn,k,id:Longint;\nfunction p(a,b:int64):int64;\nbegin\n\tif b=0 then p:=1 else if b mod 2=0 then p:=p(a*a mod mo,b div 2) else p:=p(a,b-1)*a mod mo;\nend;\nbegin\n\tread(n,k);\n\tF[0]:=1;\n\tmo:=1000000007;\n\tfor id:=1 to n do F[id]:=F[id-1]*id mod mo;\n\tI[n]:=p(F[n],mo-2);\n\tfor id:=n-1 downto 0 do I[id]:=I[id+1]*(id+1)mod mo;\n\tid:=0;\n\twhile(id 0).\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq k, q \\leq 5000\n\n0 \\leq d_i \\leq 10^9\n\n2 \\leq n_i \\leq 10^9\n\n0 \\leq x_i \\leq 10^9\n\n2 \\leq m_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nk q\nd_0 d_1 ... d_{k - 1}\nn_1 x_1 m_1\nn_2 x_2 m_2\n:\nn_q x_q m_q\n\nOutput\n\nPrint q lines.\n\nThe i-th line should contain the response to the i-th query.\n\nSample Input 1\n\n3 1\n3 1 4\n5 3 2\n\nSample Output 1\n\n1\n\nFor the first query, the sequence {a_j} will be 3,6,7,11,14.\n\n(a_0~\\textrm{mod}~2) > (a_1~\\textrm{mod}~2)\n\n(a_1~\\textrm{mod}~2) < (a_2~\\textrm{mod}~2)\n\n(a_2~\\textrm{mod}~2) = (a_3~\\textrm{mod}~2)\n\n(a_3~\\textrm{mod}~2) > (a_4~\\textrm{mod}~2)\n\nThus, the response to this query should be 1.\n\nSample Input 2\n\n7 3\n27 18 28 18 28 46 1000000000\n1000000000 1 7\n1000000000 2 10\n1000000000 3 12\n\nSample Output 2\n\n224489796\n214285714\n559523809", "sample_input": "3 1\n3 1 4\n5 3 2\n"}, "reference_outputs": ["1\n"], "source_document_id": "p02770", "source_text": "Score : 600 points\n\nProblem Statement\n\nWe have a sequence of k numbers: d_0,d_1,...,d_{k - 1}.\n\nProcess the following q queries in order:\n\nThe i-th query contains three integers n_i, x_i, and m_i.\nLet a_0,a_1,...,a_{n_i - 1} be the following sequence of n_i numbers: \\begin{eqnarray} a_j = \\begin{cases} x_i & ( j = 0 ) \\\\ a_{j - 1} + d_{(j - 1)~\\textrm{mod}~k} & ( 0 < j \\leq n_i - 1 ) \\end{cases}\\end{eqnarray}\nPrint the number of j~(0 \\leq j < n_i - 1) such that (a_j~\\textrm{mod}~m_i) < (a_{j + 1}~\\textrm{mod}~m_i).\n\nHere (y~\\textrm{mod}~z) denotes the remainder of y divided by z, for two integers y and z~(z > 0).\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq k, q \\leq 5000\n\n0 \\leq d_i \\leq 10^9\n\n2 \\leq n_i \\leq 10^9\n\n0 \\leq x_i \\leq 10^9\n\n2 \\leq m_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nk q\nd_0 d_1 ... d_{k - 1}\nn_1 x_1 m_1\nn_2 x_2 m_2\n:\nn_q x_q m_q\n\nOutput\n\nPrint q lines.\n\nThe i-th line should contain the response to the i-th query.\n\nSample Input 1\n\n3 1\n3 1 4\n5 3 2\n\nSample Output 1\n\n1\n\nFor the first query, the sequence {a_j} will be 3,6,7,11,14.\n\n(a_0~\\textrm{mod}~2) > (a_1~\\textrm{mod}~2)\n\n(a_1~\\textrm{mod}~2) < (a_2~\\textrm{mod}~2)\n\n(a_2~\\textrm{mod}~2) = (a_3~\\textrm{mod}~2)\n\n(a_3~\\textrm{mod}~2) > (a_4~\\textrm{mod}~2)\n\nThus, the response to this query should be 1.\n\nSample Input 2\n\n7 3\n27 18 28 18 28 46 1000000000\n1000000000 1 7\n1000000000 2 10\n1000000000 3 12\n\nSample Output 2\n\n224489796\n214285714\n559523809", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 561, "memory_kb": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s171708075", "group_id": "codeNet:p02771", "input_text": "program main;\nvar a,b,c : integer;\n p : boolean;\nbegin\n readln(a,b,c);\n if ((a=b) and (a<>c)) or ((a=c) and (a<>b)) or ((b=c) and (a<>b)) then p := true\n else p := false;\n if p then writeln('Yes')\n else writeln('No');\nend.", "language": "Pascal", "metadata": {"date": 1600268646, "filename_ext": "pas", "original_language": "Pascal (FPC 3.0.4)", "problem_description_relpath": "problem_descriptions/p02771.html", "problem_id": "p02771", "resource_group": "low_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/Pascal/s171708075.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s171708075", "user_id": "u289438802"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "program main;\nvar a,b,c : integer;\n p : boolean;\nbegin\n readln(a,b,c);\n if ((a=b) and (a<>c)) or ((a=c) and (a<>b)) or ((b=c) and (a<>b)) then p := true\n else p := false;\n if p then writeln('Yes')\n else writeln('No');\nend.", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 4, "memory_kb": 1348}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s891727700", "group_id": "codeNet:p02771", "input_text": "program main;\nvar\n a, b, c : longint;\n poor : boolean;\n\nbegin\n readln(a, b, c);\n if ((a=b) and (a<>c)) or ((a=c) and (a<>b)) or ((b=c) and (a<>b)) then poor := true\n else poor := false;\n if poor then writeln('Yes')\n else writeln('No');\n\nend.", "language": "Pascal", "metadata": {"date": 1600265813, "filename_ext": "pas", "original_language": "Pascal (FPC 3.0.4)", "problem_description_relpath": "problem_descriptions/p02771.html", "problem_id": "p02771", "resource_group": "low_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/Pascal/s891727700.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s891727700", "user_id": "u122156580"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "program main;\nvar\n a, b, c : longint;\n poor : boolean;\n\nbegin\n readln(a, b, c);\n if ((a=b) and (a<>c)) or ((a=c) and (a<>b)) or ((b=c) and (a<>b)) then poor := true\n else poor := false;\n if poor then writeln('Yes')\n else writeln('No');\n\nend.", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 248, "cpu_time_ms": 3, "memory_kb": 1372}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s993975559", "group_id": "codeNet:p02772", "input_text": "program main;\nvar \n a,i,b : integer;\n p : boolean;\nbegin \n p := true;\n readln(a);\n for i := 1 to a do \n begin \n read(b);\n if ( b mod 2 ) = 0 then \n begin \n if (( b mod 3 ) <> 0) then\n if (( b mod 5 ) <> 0) then\n p := false;\n end;\n end;\n if ( p = true ) then \n writeln('APPROVED')\n else \n writeln('DENIED');\nend.", "language": "Pascal", "metadata": {"date": 1600268327, "filename_ext": "pas", "original_language": "Pascal (FPC 3.0.4)", "problem_description_relpath": "problem_descriptions/p02772.html", "problem_id": "p02772", "resource_group": "low_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/Pascal/s993975559.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s993975559", "user_id": "u743163683"}, "prompt_components": {"gold_output": "APPROVED\n", "input_to_evaluate": "program main;\nvar \n a,i,b : integer;\n p : boolean;\nbegin \n p := true;\n readln(a);\n for i := 1 to a do \n begin \n read(b);\n if ( b mod 2 ) = 0 then \n begin \n if (( b mod 3 ) <> 0) then\n if (( b mod 5 ) <> 0) then\n p := false;\n end;\n end;\n if ( p = true ) then \n writeln('APPROVED')\n else \n writeln('DENIED');\nend.", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 481, "cpu_time_ms": 5, "memory_kb": 1380}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s977226926", "group_id": "codeNet:p02773", "input_text": "type SortDataType=String;\nfunction SortCmp(const a,b:SortDataType):Boolean;forward;\nprocedure SortImpl(var A:Array of SortDataType;L,R:Longint);\nvar\n\ttmp:SortDataType;\n\tmid,il,ir:Longint;\nbegin\n\tif R-L<20 then begin\n\t\tfor ir:=R-1 downto L+1 do for il:=L to ir-1 do if SortCmp(A[il+1],A[il])then begin\n\t\t\ttmp:=A[il];\n\t\t\tA[il]:=A[il+1];\n\t\t\tA[il+1]:=tmp;\n\t\tend;\n\tend else begin\n\t\tmid:=(L+R)div 2;\n\t\tif SortCmp(A[mid],A[L])then begin\n\t\t\ttmp:=A[mid];\n\t\t\tA[mid]:=A[L];\n\t\t\tA[L]:=tmp;\n\t\tend;\n\t\tif SortCmp(A[R-1],A[mid])then begin\n\t\t\ttmp:=A[R-1];\n\t\t\tA[R-1]:=A[mid];\n\t\t\tA[mid]:=tmp;\n\t\t\tif SortCmp(A[mid],A[L])then begin\n\t\t\t\ttmp:=A[mid];\n\t\t\t\tA[mid]:=A[L];\n\t\t\t\tA[L]:=tmp;\n\t\t\tend;\n\t\tend;\n\t\til:=L;\n\t\tir:=R-1;\n\t\twhile il<=ir do begin\n\t\t\twhile SortCmp(A[il],A[mid])do inc(il);\n\t\t\twhile SortCmp(A[mid],A[ir])do dec(ir);\n\t\t\tif il1)and(S[i-1]<>S[i])then cnt:=0;\n\t\tinc(cnt);\n\t\tif ac1)and(S[i-1]<>S[i])then cnt:=0;\n\t\tinc(cnt);\n\t\tif ac= r) then exit;\n i:=l;\n j:=r;\n mid:=a[(i+j) div 2];\n while i < j do \n begin\n while (a[i] < mid) do inc(i);\n while (mid < a[j]) do dec(j);\n if (i <= j) then \n begin\n tg:=a[i];\n a[i]:=a[j];\n a[j]:=tg;\n inc(i);\n dec(j);\n end;\n end;\n sort(i,r);\n sort(l,j);\nend;\nprocedure sx;\nbegin\n for i := 1 to n-1 do \n for j := i+1 to n do \n if (a[i] > a[j]) then \n begin\n tg:=a[i];\n a[i]:=a[j];\n a[j]:=tg;\n end;\nend;\nbegin\n readln(n);\n for i := 1 to n do readln(a[i]);\n //if (n > 3000) then sort(1,n)\n //else \n sx;\n dem:=1;\n a[n+1]:='!';\n for i := 2 to n+1 do \n if a[i] = a[i-1] then inc(dem)\n else \n begin\n if (dem > max) then max:=dem;\n dem:=1;\n end;\n dem:=1;\n for i := 2 to n+1 do \n if (a[i] = a[i-1]) then inc(dem)\n else \n begin\n if (dem = max) then writeln(a[i-1]);\n dem:=1;\n end;\nend.", "language": "Pascal", "metadata": {"date": 1587202250, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p02773.html", "problem_id": "p02773", "resource_group": "low_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/Pascal/s800821364.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s800821364", "user_id": "u497946030"}, "prompt_components": {"gold_output": "beet\nvet\n", "input_to_evaluate": "var a:array[1..200001] of string;\n n,i,dem,j,max: longint;\n tg:string;\nprocedure sort(l,r: longint);\nvar mid:string;\nbegin\n if (l >= r) then exit;\n i:=l;\n j:=r;\n mid:=a[(i+j) div 2];\n while i < j do \n begin\n while (a[i] < mid) do inc(i);\n while (mid < a[j]) do dec(j);\n if (i <= j) then \n begin\n tg:=a[i];\n a[i]:=a[j];\n a[j]:=tg;\n inc(i);\n dec(j);\n end;\n end;\n sort(i,r);\n sort(l,j);\nend;\nprocedure sx;\nbegin\n for i := 1 to n-1 do \n for j := i+1 to n do \n if (a[i] > a[j]) then \n begin\n tg:=a[i];\n a[i]:=a[j];\n a[j]:=tg;\n end;\nend;\nbegin\n readln(n);\n for i := 1 to n do readln(a[i]);\n //if (n > 3000) then sort(1,n)\n //else \n sx;\n dem:=1;\n a[n+1]:='!';\n for i := 2 to n+1 do \n if a[i] = a[i-1] then inc(dem)\n else \n begin\n if (dem > max) then max:=dem;\n dem:=1;\n end;\n dem:=1;\n for i := 2 to n+1 do \n if (a[i] = a[i-1]) then inc(dem)\n else \n begin\n if (dem = max) then writeln(a[i-1]);\n dem:=1;\n end;\nend.", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 2107, "memory_kb": 60288}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s922343998", "group_id": "codeNet:p02777", "input_text": "program main;\nvar i,j,s,t : string;\n a,b : integer;\nbegin \n readln(i);\n readln(a,b);\n readln(j);\n s := copy(i,1,pos(' ',i)-1); \n t := copy(i,pos(' ',i)+1,length(i));\n if j = s then writeln(a-1,' ',b)\n else writeln(a,' ',b-1);\nend.", "language": "Pascal", "metadata": {"date": 1600267747, "filename_ext": "pas", "original_language": "Pascal (FPC 3.0.4)", "problem_description_relpath": "problem_descriptions/p02777.html", "problem_id": "p02777", "resource_group": "low_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/Pascal/s922343998.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s922343998", "user_id": "u289438802"}, "prompt_components": {"gold_output": "2 4\n", "input_to_evaluate": "program main;\nvar i,j,s,t : string;\n a,b : integer;\nbegin \n readln(i);\n readln(a,b);\n readln(j);\n s := copy(i,1,pos(' ',i)-1); \n t := copy(i,pos(' ',i)+1,length(i));\n if j = s then writeln(a-1,' ',b)\n else writeln(a,' ',b-1);\nend.", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 2, "memory_kb": 1348}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s119417566", "group_id": "codeNet:p02777", "input_text": "program main;\nvar S,T,U : string;\nvar A,B : integer;\nbegin\nreadln (S,T);\nreadln (A,B);\nreadln (U);\n\nif (A<=10) and (B<=10) then begin\nif U=S then A:=A-1;\nif T=S then B:=B-1;\nend;\n\nwriteln (A,B);\n\nend.", "language": "Pascal", "metadata": {"date": 1600267738, "filename_ext": "pas", "original_language": "Pascal (FPC 3.0.4)", "problem_description_relpath": "problem_descriptions/p02777.html", "problem_id": "p02777", "resource_group": "low_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/Pascal/s119417566.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s119417566", "user_id": "u529554074"}, "prompt_components": {"gold_output": "2 4\n", "input_to_evaluate": "program main;\nvar S,T,U : string;\nvar A,B : integer;\nbegin\nreadln (S,T);\nreadln (A,B);\nreadln (U);\n\nif (A<=10) and (B<=10) then begin\nif U=S then A:=A-1;\nif T=S then B:=B-1;\nend;\n\nwriteln (A,B);\n\nend.", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 5, "memory_kb": 1360}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s979859951", "group_id": "codeNet:p02777", "input_text": "program main;\nvar s,t,u: string ;\na,b : integer;\n \nbegin\nreadln(s,t);\nreadln(a,b);\nreadln(u);\n \nif (u=s) then \na:=a-1;\n\nif (u=t) then \nb:=b-1;\n\nwriteln(a,b)\n \nend. \n ", "language": "Pascal", "metadata": {"date": 1600267381, "filename_ext": "pas", "original_language": "Pascal (FPC 3.0.4)", "problem_description_relpath": "problem_descriptions/p02777.html", "problem_id": "p02777", "resource_group": "low_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/Pascal/s979859951.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s979859951", "user_id": "u880893396"}, "prompt_components": {"gold_output": "2 4\n", "input_to_evaluate": "program main;\nvar s,t,u: string ;\na,b : integer;\n \nbegin\nreadln(s,t);\nreadln(a,b);\nreadln(u);\n \nif (u=s) then \na:=a-1;\n\nif (u=t) then \nb:=b-1;\n\nwriteln(a,b)\n \nend. \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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 3, "memory_kb": 1384}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s391437018", "group_id": "codeNet:p02778", "input_text": "program main;\nvar \n a : string;\n i : integer;\nbegin \n readln(a);\n for i := 1 to length(a) do \n write('x');\nend.", "language": "Pascal", "metadata": {"date": 1600267919, "filename_ext": "pas", "original_language": "Pascal (FPC 3.0.4)", "problem_description_relpath": "problem_descriptions/p02778.html", "problem_id": "p02778", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02778/input.txt", "sample_output_relpath": "derived/input_output/data/p02778/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02778/Pascal/s391437018.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s391437018", "user_id": "u743163683"}, "prompt_components": {"gold_output": "xxxxxxx\n", "input_to_evaluate": "program main;\nvar \n a : string;\n i : integer;\nbegin \n readln(a);\n for i := 1 to length(a) do \n write('x');\nend.", "problem_context": "Score : 200 points\n\nProblem Statement\n\nGiven is a string S. Replace every character in S with x and print the result.\n\nConstraints\n\nS is a string consisting of lowercase English letters.\n\nThe length of S is between 1 and 100 (inclusive).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nReplace every character in S with x and print the result.\n\nSample Input 1\n\nsardine\n\nSample Output 1\n\nxxxxxxx\n\nReplacing every character in S with x results in xxxxxxx.\n\nSample Input 2\n\nxxxx\n\nSample Output 2\n\nxxxx\n\nSample Input 3\n\ngone\n\nSample Output 3\n\nxxxx", "sample_input": "sardine\n"}, "reference_outputs": ["xxxxxxx\n"], "source_document_id": "p02778", "source_text": "Score : 200 points\n\nProblem Statement\n\nGiven is a string S. Replace every character in S with x and print the result.\n\nConstraints\n\nS is a string consisting of lowercase English letters.\n\nThe length of S is between 1 and 100 (inclusive).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nReplace every character in S with x and print the result.\n\nSample Input 1\n\nsardine\n\nSample Output 1\n\nxxxxxxx\n\nReplacing every character in S with x results in xxxxxxx.\n\nSample Input 2\n\nxxxx\n\nSample Output 2\n\nxxxx\n\nSample Input 3\n\ngone\n\nSample Output 3\n\nxxxx", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 4, "memory_kb": 1360}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s030795149", "group_id": "codeNet:p02779", "input_text": "type SortDataType=Longint;\nfunction SortCmp(const a,b:SortDataType):Boolean;forward;\nprocedure SortImpl(var A:Array of SortDataType;L,R:Longint);\nvar\n\ttmp:SortDataType;\n\tmid,il,ir:Longint;\nbegin\n\tif R-L<20 then begin\n\t\tfor ir:=R-1 downto L+1 do for il:=L to ir-1 do if SortCmp(A[il+1],A[il])then begin\n\t\t\ttmp:=A[il];\n\t\t\tA[il]:=A[il+1];\n\t\t\tA[il+1]:=tmp;\n\t\tend;\n\tend else begin\n\t\tmid:=(L+R)div 2;\n\t\tif SortCmp(A[mid],A[L])then begin\n\t\t\ttmp:=A[mid];\n\t\t\tA[mid]:=A[L];\n\t\t\tA[L]:=tmp;\n\t\tend;\n\t\tif SortCmp(A[R-1],A[mid])then begin\n\t\t\ttmp:=A[R-1];\n\t\t\tA[R-1]:=A[mid];\n\t\t\tA[mid]:=tmp;\n\t\t\tif SortCmp(A[mid],A[L])then begin\n\t\t\t\ttmp:=A[mid];\n\t\t\t\tA[mid]:=A[L];\n\t\t\t\tA[L]:=tmp;\n\t\t\tend;\n\t\tend;\n\t\til:=L;\n\t\tir:=R-1;\n\t\twhile il<=ir do begin\n\t\t\twhile SortCmp(A[il],A[mid])do inc(il);\n\t\t\twhile SortCmp(A[mid],A[ir])do dec(ir);\n\t\t\tif ilans then ans:=sum[i]-sum[i-k];\n writeln(ans:0:12);\nend.", "language": "Pascal", "metadata": {"date": 1581279856, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p02780.html", "problem_id": "p02780", "resource_group": "low_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/Pascal/s468853525.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s468853525", "user_id": "u224808808"}, "prompt_components": {"gold_output": "7.000000000000\n", "input_to_evaluate": "var\n n,k,t,i:longint;\n a,sum:array[0..300000] of extended;\n ans:extended;\nbegin\n readln(n,k);\n for i:=1 to n do\n begin\n read(t);\n a[i]:=(1+t)*t div 2/t;\n sum[i]:=sum[i-1]+a[i];\n end;\n for i:=k to n do\n if sum[i]-sum[i-k]>ans then ans:=sum[i]-sum[i-k];\n writeln(ans:0:12);\nend.", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 295, "cpu_time_ms": 22, "memory_kb": 4992}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s225237360", "group_id": "codeNet:p02783", "input_text": "program main;\nvar H,A,x :integer;\nbegin\n readln(H,A);\n x:=H div A;\n if H mod A=0 then \n writeln(x)\n else writeln(x+1);\nend.", "language": "Pascal", "metadata": {"date": 1600268144, "filename_ext": "pas", "original_language": "Pascal (FPC 3.0.4)", "problem_description_relpath": "problem_descriptions/p02783.html", "problem_id": "p02783", "resource_group": "low_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/Pascal/s225237360.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s225237360", "user_id": "u728129883"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "program main;\nvar H,A,x :integer;\nbegin\n readln(H,A);\n x:=H div A;\n if H mod A=0 then \n writeln(x)\n else writeln(x+1);\nend.", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 5, "memory_kb": 1384}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s790812151", "group_id": "codeNet:p02783", "input_text": "program main;\nvar H,A,x:integer;\nbegin\n x:=0;\n readln(H,A);\n x:=H div A;\n if H mod A=0 then \n writeln(x)\n else writeln(x+1);\nend.", "language": "Pascal", "metadata": {"date": 1600268067, "filename_ext": "pas", "original_language": "Pascal (FPC 3.0.4)", "problem_description_relpath": "problem_descriptions/p02783.html", "problem_id": "p02783", "resource_group": "low_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/Pascal/s790812151.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s790812151", "user_id": "u728129883"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "program main;\nvar H,A,x:integer;\nbegin\n x:=0;\n readln(H,A);\n x:=H div A;\n if H mod A=0 then \n writeln(x)\n else writeln(x+1);\nend.", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 147, "cpu_time_ms": 5, "memory_kb": 1376}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s600315567", "group_id": "codeNet:p02783", "input_text": "program main;\nvar H,A,x,i :integer;\nbegin\n x:=0;\n readln(H,A);\n x:=H div A;\n if H mod A=0 then \n writeln(x)\n else writeln(x+1);\nend.", "language": "Pascal", "metadata": {"date": 1600267814, "filename_ext": "pas", "original_language": "Pascal (FPC 3.0.4)", "problem_description_relpath": "problem_descriptions/p02783.html", "problem_id": "p02783", "resource_group": "low_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/Pascal/s600315567.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s600315567", "user_id": "u728129883"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "program main;\nvar H,A,x,i :integer;\nbegin\n x:=0;\n readln(H,A);\n x:=H div A;\n if H mod A=0 then \n writeln(x)\n else writeln(x+1);\nend.", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 5, "memory_kb": 1388}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s166804891", "group_id": "codeNet:p02783", "input_text": "program main;\nvar h,a,i : integer;\nbegin \n readln(h,a);\n i := h div a;\n if (h mod a <> 0) then inc(i);\n writeln(i);\nend.", "language": "Pascal", "metadata": {"date": 1600266876, "filename_ext": "pas", "original_language": "Pascal (FPC 3.0.4)", "problem_description_relpath": "problem_descriptions/p02783.html", "problem_id": "p02783", "resource_group": "low_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/Pascal/s166804891.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s166804891", "user_id": "u289438802"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "program main;\nvar h,a,i : integer;\nbegin \n readln(h,a);\n i := h div a;\n if (h mod a <> 0) then inc(i);\n writeln(i);\nend.", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 124, "cpu_time_ms": 3, "memory_kb": 1380}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s250495580", "group_id": "codeNet:p02783", "input_text": "program main;\nvar h,a,ans: integer;\n \nbegin\nreadln(h,a);\nans:=0;\nrepeat\nh:=h-a;\nans:=ans+1;\nuntil h<=0;\nwriteln(ans);\nend.", "language": "Pascal", "metadata": {"date": 1600266775, "filename_ext": "pas", "original_language": "Pascal (FPC 3.0.4)", "problem_description_relpath": "problem_descriptions/p02783.html", "problem_id": "p02783", "resource_group": "low_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/Pascal/s250495580.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s250495580", "user_id": "u880893396"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "program main;\nvar h,a,ans: integer;\n \nbegin\nreadln(h,a);\nans:=0;\nrepeat\nh:=h-a;\nans:=ans+1;\nuntil h<=0;\nwriteln(ans);\nend.", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 122, "cpu_time_ms": 2, "memory_kb": 1316}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s374949114", "group_id": "codeNet:p02784", "input_text": "var h,n,a,i,sum : integer;\nbegin\n read(h,n);\n sum := 0;\n for i:=1 to n do begin\n read(a);\n sum := sum + a;\n end;\n if sum >= h then writeln('Yes')\n else writeln('No')\nend.", "language": "Pascal", "metadata": {"date": 1580082966, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p02784.html", "problem_id": "p02784", "resource_group": "low_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/Pascal/s374949114.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s374949114", "user_id": "u878615689"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "var h,n,a,i,sum : integer;\nbegin\n read(h,n);\n sum := 0;\n for i:=1 to n do begin\n read(a);\n sum := sum + a;\n end;\n if sum >= h then writeln('Yes')\n else writeln('No')\nend.", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 11, "memory_kb": 128}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s033481308", "group_id": "codeNet:p02784", "input_text": "var i, n, k, S, v:Longint;\nbegin\n S := 0;\n read(k, n);\n for i := 1 to n do\n begin\n read(v);\n S := S + v;\n if S >= k then\n begin\n writeln('Yes');\n exit;\n end;\n end;\n writeln('No');\nend.\n", "language": "Pascal", "metadata": {"date": 1580074027, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p02784.html", "problem_id": "p02784", "resource_group": "low_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/Pascal/s033481308.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s033481308", "user_id": "u394853232"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "var i, n, k, S, v:Longint;\nbegin\n S := 0;\n read(k, n);\n for i := 1 to n do\n begin\n read(v);\n S := S + v;\n if S >= k then\n begin\n writeln('Yes');\n exit;\n end;\n end;\n writeln('No');\nend.\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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 224, "cpu_time_ms": 11, "memory_kb": 128}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s252800607", "group_id": "codeNet:p02785", "input_text": "type SortDataType=Longint;\nfunction SortCmp(const a,b:SortDataType):Boolean;forward;\nprocedure SortImpl(var A:Array of SortDataType;L,R:Longint);\nvar\n\ttmp:SortDataType;\n\tmid,il,ir:Longint;\nbegin\n\tif R-L<20 then begin\n\t\tfor ir:=R-1 downto L+1 do for il:=L to ir-1 do if SortCmp(A[il+1],A[il])then begin\n\t\t\ttmp:=A[il];\n\t\t\tA[il]:=A[il+1];\n\t\t\tA[il+1]:=tmp;\n\t\tend;\n\tend else begin\n\t\tmid:=(L+R)div 2;\n\t\tif SortCmp(A[mid],A[L])then begin\n\t\t\ttmp:=A[mid];\n\t\t\tA[mid]:=A[L];\n\t\t\tA[L]:=tmp;\n\t\tend;\n\t\tif SortCmp(A[R-1],A[mid])then begin\n\t\t\ttmp:=A[R-1];\n\t\t\tA[R-1]:=A[mid];\n\t\t\tA[mid]:=tmp;\n\t\t\tif SortCmp(A[mid],A[L])then begin\n\t\t\t\ttmp:=A[mid];\n\t\t\t\tA[mid]:=A[L];\n\t\t\t\tA[L]:=tmp;\n\t\t\tend;\n\t\tend;\n\t\til:=L;\n\t\tir:=R-1;\n\t\twhile il<=ir do begin\n\t\t\twhile SortCmp(A[il],A[mid])do inc(il);\n\t\t\twhile SortCmp(A[mid],A[ir])do dec(ir);\n\t\t\tif ilb;\nend;\nvar\n\tN,K,i:Longint;\n\tH:Array[1..200000]of Longint;\n\tans:int64;\nbegin\n\tread(N,K);\n\tfor i:=1 to N do read(H[i]);\n\tSort(H,N);\n\tfor i:=K+1 to N do inc(ans,H[i]);\n\twriteln(ans);\nend.\n", "language": "Pascal", "metadata": {"date": 1591992768, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p02785.html", "problem_id": "p02785", "resource_group": "low_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/Pascal/s252800607.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s252800607", "user_id": "u657913472"}, "prompt_components": {"gold_output": "5\n", "input_to_evaluate": "type SortDataType=Longint;\nfunction SortCmp(const a,b:SortDataType):Boolean;forward;\nprocedure SortImpl(var A:Array of SortDataType;L,R:Longint);\nvar\n\ttmp:SortDataType;\n\tmid,il,ir:Longint;\nbegin\n\tif R-L<20 then begin\n\t\tfor ir:=R-1 downto L+1 do for il:=L to ir-1 do if SortCmp(A[il+1],A[il])then begin\n\t\t\ttmp:=A[il];\n\t\t\tA[il]:=A[il+1];\n\t\t\tA[il+1]:=tmp;\n\t\tend;\n\tend else begin\n\t\tmid:=(L+R)div 2;\n\t\tif SortCmp(A[mid],A[L])then begin\n\t\t\ttmp:=A[mid];\n\t\t\tA[mid]:=A[L];\n\t\t\tA[L]:=tmp;\n\t\tend;\n\t\tif SortCmp(A[R-1],A[mid])then begin\n\t\t\ttmp:=A[R-1];\n\t\t\tA[R-1]:=A[mid];\n\t\t\tA[mid]:=tmp;\n\t\t\tif SortCmp(A[mid],A[L])then begin\n\t\t\t\ttmp:=A[mid];\n\t\t\t\tA[mid]:=A[L];\n\t\t\t\tA[L]:=tmp;\n\t\t\tend;\n\t\tend;\n\t\til:=L;\n\t\tir:=R-1;\n\t\twhile il<=ir do begin\n\t\t\twhile SortCmp(A[il],A[mid])do inc(il);\n\t\t\twhile SortCmp(A[mid],A[ir])do dec(ir);\n\t\t\tif ilb;\nend;\nvar\n\tN,K,i:Longint;\n\tH:Array[1..200000]of Longint;\n\tans:int64;\nbegin\n\tread(N,K);\n\tfor i:=1 to N do read(H[i]);\n\tSort(H,N);\n\tfor i:=K+1 to N do inc(ans,H[i]);\n\twriteln(ans);\nend.\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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1427, "cpu_time_ms": 60, "memory_kb": 896}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s570330233", "group_id": "codeNet:p02787", "input_text": "var h,n : int64;\n a,b : array[1..1010] of int64;\n dp : array[0..10010] of int64;\n i,hi : int64;\n \nfunction max(a,b:int64):int64;\nbegin\n if a >= b then max := a\n else max := b\nend;\n\nfunction min(a,b:int64):int64;\nbegin\n if a <= b then min := a\n else min := b\nend;\n\nbegin\n read(h,n);\n for i := 1 to n do read(a[i],b[i]);\n dp[0] := 0;\n for i := 1 to h do dp[i] := 1000000000000000000;\n for hi := 1 to h do begin\n for i := 1 to n do dp[hi] := min(dp[hi],dp[max(hi-a[i],0)] + b[i])\n end;\n writeln(dp[h])\nend.", "language": "Pascal", "metadata": {"date": 1580083640, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p02787.html", "problem_id": "p02787", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02787/input.txt", "sample_output_relpath": "derived/input_output/data/p02787/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02787/Pascal/s570330233.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s570330233", "user_id": "u878615689"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "var h,n : int64;\n a,b : array[1..1010] of int64;\n dp : array[0..10010] of int64;\n i,hi : int64;\n \nfunction max(a,b:int64):int64;\nbegin\n if a >= b then max := a\n else max := b\nend;\n\nfunction min(a,b:int64):int64;\nbegin\n if a <= b then min := a\n else min := b\nend;\n\nbegin\n read(h,n);\n for i := 1 to n do read(a[i],b[i]);\n dp[0] := 0;\n for i := 1 to h do dp[i] := 1000000000000000000;\n for hi := 1 to h do begin\n for i := 1 to n do dp[hi] := min(dp[hi],dp[max(hi-a[i],0)] + b[i])\n end;\n writeln(dp[h])\nend.", "problem_context": "Score : 500 points\n\nProblem Statement\n\nIbis is fighting with a monster.\n\nThe health of the monster is H.\n\nIbis can cast N kinds of spells. Casting the i-th spell decreases the monster's health by A_i, at the cost of B_i Magic Points.\n\nThe same spell can be cast multiple times. There is no way other than spells to decrease the monster's health.\n\nIbis wins when the health of the monster becomes 0 or below.\n\nFind the minimum total Magic Points that have to be consumed before winning.\n\nConstraints\n\n1 \\leq H \\leq 10^4\n\n1 \\leq N \\leq 10^3\n\n1 \\leq A_i \\leq 10^4\n\n1 \\leq B_i \\leq 10^4\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH N\nA_1 B_1\n:\nA_N B_N\n\nOutput\n\nPrint the minimum total Magic Points that have to be consumed before winning.\n\nSample Input 1\n\n9 3\n8 3\n4 2\n2 1\n\nSample Output 1\n\n4\n\nFirst, let us cast the first spell to decrease the monster's health by 8, at the cost of 3 Magic Points. The monster's health is now 1.\n\nThen, cast the third spell to decrease the monster's health by 2, at the cost of 1 Magic Point. The monster's health is now -1.\n\nIn this way, we can win at the total cost of 4 Magic Points.\n\nSample Input 2\n\n100 6\n1 1\n2 3\n3 9\n4 27\n5 81\n6 243\n\nSample Output 2\n\n100\n\nIt is optimal to cast the first spell 100 times.\n\nSample Input 3\n\n9999 10\n540 7550\n691 9680\n700 9790\n510 7150\n415 5818\n551 7712\n587 8227\n619 8671\n588 8228\n176 2461\n\nSample Output 3\n\n139815", "sample_input": "9 3\n8 3\n4 2\n2 1\n"}, "reference_outputs": ["4\n"], "source_document_id": "p02787", "source_text": "Score : 500 points\n\nProblem Statement\n\nIbis is fighting with a monster.\n\nThe health of the monster is H.\n\nIbis can cast N kinds of spells. Casting the i-th spell decreases the monster's health by A_i, at the cost of B_i Magic Points.\n\nThe same spell can be cast multiple times. There is no way other than spells to decrease the monster's health.\n\nIbis wins when the health of the monster becomes 0 or below.\n\nFind the minimum total Magic Points that have to be consumed before winning.\n\nConstraints\n\n1 \\leq H \\leq 10^4\n\n1 \\leq N \\leq 10^3\n\n1 \\leq A_i \\leq 10^4\n\n1 \\leq B_i \\leq 10^4\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH N\nA_1 B_1\n:\nA_N B_N\n\nOutput\n\nPrint the minimum total Magic Points that have to be consumed before winning.\n\nSample Input 1\n\n9 3\n8 3\n4 2\n2 1\n\nSample Output 1\n\n4\n\nFirst, let us cast the first spell to decrease the monster's health by 8, at the cost of 3 Magic Points. The monster's health is now 1.\n\nThen, cast the third spell to decrease the monster's health by 2, at the cost of 1 Magic Point. The monster's health is now -1.\n\nIn this way, we can win at the total cost of 4 Magic Points.\n\nSample Input 2\n\n100 6\n1 1\n2 3\n3 9\n4 27\n5 81\n6 243\n\nSample Output 2\n\n100\n\nIt is optimal to cast the first spell 100 times.\n\nSample Input 3\n\n9999 10\n540 7550\n691 9680\n700 9790\n510 7150\n415 5818\n551 7712\n587 8227\n619 8671\n588 8228\n176 2461\n\nSample Output 3\n\n139815", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 58, "memory_kb": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s875463377", "group_id": "codeNet:p02791", "input_text": "var t,s,m:longint;\nbegin\n readln;m:=2147483647;\n while not eoln do\n begin\n read(t);\n if t 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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 176, "cpu_time_ms": 26, "memory_kb": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s563622746", "group_id": "codeNet:p02793", "input_text": "Var a:Array[1 .. 100000] of Longint;\n ans,sum:Int64;\n n,i:Longint;\nFunction gcd(a,b:Int64):Int64;\n Begin\n If b = 0 then exit(a); \n Exit(gcd(b, a mod b)); \n End;\nBegin\n Readln(n);\n For i:=1 to n do read(a[i]);\n ans:=a[1];\n For i:=2 to n do ans:=(((a[i] * ans)) div (gcd(a[i], ans)));\n For i:=1 to n do sum:=(sum+ans div a[i]) mod 1000000007;\n Writeln(sum);\nEnd.", "language": "Pascal", "metadata": {"date": 1579464336, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p02793.html", "problem_id": "p02793", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02793/input.txt", "sample_output_relpath": "derived/input_output/data/p02793/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02793/Pascal/s563622746.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s563622746", "user_id": "u866155170"}, "prompt_components": {"gold_output": "13\n", "input_to_evaluate": "Var a:Array[1 .. 100000] of Longint;\n ans,sum:Int64;\n n,i:Longint;\nFunction gcd(a,b:Int64):Int64;\n Begin\n If b = 0 then exit(a); \n Exit(gcd(b, a mod b)); \n End;\nBegin\n Readln(n);\n For i:=1 to n do read(a[i]);\n ans:=a[1];\n For i:=2 to n do ans:=(((a[i] * ans)) div (gcd(a[i], ans)));\n For i:=1 to n do sum:=(sum+ans div a[i]) mod 1000000007;\n Writeln(sum);\nEnd.", "problem_context": "Score : 500 points\n\nProblem Statement\n\nGiven are N positive integers A_1,...,A_N.\n\nConsider positive integers B_1, ..., B_N that satisfy the following condition.\n\nCondition: For any i, j such that 1 \\leq i < j \\leq N, A_i B_i = A_j B_j holds.\n\nFind the minimum possible value of B_1 + ... + B_N for such B_1,...,B_N.\n\nSince the answer can be enormous, print the sum modulo (10^9 +7).\n\nConstraints\n\n1 \\leq N \\leq 10^4\n\n1 \\leq A_i \\leq 10^6\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\nPrint the minimum possible value of B_1 + ... + B_N for B_1,...,B_N that satisfy the condition, modulo (10^9 +7).\n\nSample Input 1\n\n3\n2 3 4\n\nSample Output 1\n\n13\n\nLet B_1=6, B_2=4, and B_3=3, and the condition will be satisfied.\n\nSample Input 2\n\n5\n12 12 12 12 12\n\nSample Output 2\n\n5\n\nWe can let all B_i be 1.\n\nSample Input 3\n\n3\n1000000 999999 999998\n\nSample Output 3\n\n996989508\n\nPrint the sum modulo (10^9+7).", "sample_input": "3\n2 3 4\n"}, "reference_outputs": ["13\n"], "source_document_id": "p02793", "source_text": "Score : 500 points\n\nProblem Statement\n\nGiven are N positive integers A_1,...,A_N.\n\nConsider positive integers B_1, ..., B_N that satisfy the following condition.\n\nCondition: For any i, j such that 1 \\leq i < j \\leq N, A_i B_i = A_j B_j holds.\n\nFind the minimum possible value of B_1 + ... + B_N for such B_1,...,B_N.\n\nSince the answer can be enormous, print the sum modulo (10^9 +7).\n\nConstraints\n\n1 \\leq N \\leq 10^4\n\n1 \\leq A_i \\leq 10^6\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\nPrint the minimum possible value of B_1 + ... + B_N for B_1,...,B_N that satisfy the condition, modulo (10^9 +7).\n\nSample Input 1\n\n3\n2 3 4\n\nSample Output 1\n\n13\n\nLet B_1=6, B_2=4, and B_3=3, and the condition will be satisfied.\n\nSample Input 2\n\n5\n12 12 12 12 12\n\nSample Output 2\n\n5\n\nWe can let all B_i be 1.\n\nSample Input 3\n\n3\n1000000 999999 999998\n\nSample Output 3\n\n996989508\n\nPrint the sum modulo (10^9+7).", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 404, "cpu_time_ms": 4, "memory_kb": 128}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s369853428", "group_id": "codeNet:p02802", "input_text": "var\n\tN,M,i,p,j,ans,t:Longint;\n\ts:String;\n\tc:Array[1..100000]of Longint;\nbegin\n\treadln(N,M);\n\tfor i:=1 to M do begin\n\t\treadln(s);\n\t\tp:=0;\n\t\tj:=1;\n\t\twhile s[j]<>' 'do begin\n\t\t\tp:=p*10+ord(s[j])-48;\n\t\t\tinc(j);\n\t\tend;\n\t\tinc(j);\n\t\tif s[j]='A'then begin\n\t\t\tif c[p]>=0 then begin\n\t\t\t\tinc(ans,c[p]);\n\t\t\t\tinc(t);\n\t\t\tend;\n\t\t\tc[p]:=-1;\n\t\tend else begin\n\t\t\tif c[p]>=0 then inc(c[p]);\n\t\tend;\n\tend;\n\twriteln(t,' ',ans);\nend.\n", "language": "Pascal", "metadata": {"date": 1582030852, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p02802.html", "problem_id": "p02802", "resource_group": "low_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/Pascal/s369853428.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s369853428", "user_id": "u657913472"}, "prompt_components": {"gold_output": "2 2\n", "input_to_evaluate": "var\n\tN,M,i,p,j,ans,t:Longint;\n\ts:String;\n\tc:Array[1..100000]of Longint;\nbegin\n\treadln(N,M);\n\tfor i:=1 to M do begin\n\t\treadln(s);\n\t\tp:=0;\n\t\tj:=1;\n\t\twhile s[j]<>' 'do begin\n\t\t\tp:=p*10+ord(s[j])-48;\n\t\t\tinc(j);\n\t\tend;\n\t\tinc(j);\n\t\tif s[j]='A'then begin\n\t\t\tif c[p]>=0 then begin\n\t\t\t\tinc(ans,c[p]);\n\t\t\t\tinc(t);\n\t\t\tend;\n\t\t\tc[p]:=-1;\n\t\tend else begin\n\t\t\tif c[p]>=0 then inc(c[p]);\n\t\tend;\n\tend;\n\twriteln(t,' ',ans);\nend.\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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 14, "memory_kb": 512}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s447349094", "group_id": "codeNet:p02811", "input_text": "program main;\nvar K,X:integer;\nbegin\nreadln(K,X);\nif(K*500>=X) then \nwriteln('Yes') else\nwriteln('No');\nend.", "language": "Pascal", "metadata": {"date": 1599597473, "filename_ext": "pas", "original_language": "Pascal (FPC 3.0.4)", "problem_description_relpath": "problem_descriptions/p02811.html", "problem_id": "p02811", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02811/input.txt", "sample_output_relpath": "derived/input_output/data/p02811/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02811/Pascal/s447349094.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s447349094", "user_id": "u324512947"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "program main;\nvar K,X:integer;\nbegin\nreadln(K,X);\nif(K*500>=X) then \nwriteln('Yes') else\nwriteln('No');\nend.", "problem_context": "Score : 100 points\n\nProblem Statement\n\nTakahashi has K 500-yen coins. (Yen is the currency of Japan.)\nIf these coins add up to X yen or more, print Yes; otherwise, print No.\n\nConstraints\n\n1 \\leq K \\leq 100\n\n1 \\leq X \\leq 10^5\n\nInput\n\nInput is given from Standard Input in the following format:\n\nK X\n\nOutput\n\nIf the coins add up to X yen or more, print Yes; otherwise, print No.\n\nSample Input 1\n\n2 900\n\nSample Output 1\n\nYes\n\nTwo 500-yen coins add up to 1000 yen, which is not less than X = 900 yen.\n\nSample Input 2\n\n1 501\n\nSample Output 2\n\nNo\n\nOne 500-yen coin is worth 500 yen, which is less than X = 501 yen.\n\nSample Input 3\n\n4 2000\n\nSample Output 3\n\nYes\n\nFour 500-yen coins add up to 2000 yen, which is not less than X = 2000 yen.", "sample_input": "2 900\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p02811", "source_text": "Score : 100 points\n\nProblem Statement\n\nTakahashi has K 500-yen coins. (Yen is the currency of Japan.)\nIf these coins add up to X yen or more, print Yes; otherwise, print No.\n\nConstraints\n\n1 \\leq K \\leq 100\n\n1 \\leq X \\leq 10^5\n\nInput\n\nInput is given from Standard Input in the following format:\n\nK X\n\nOutput\n\nIf the coins add up to X yen or more, print Yes; otherwise, print No.\n\nSample Input 1\n\n2 900\n\nSample Output 1\n\nYes\n\nTwo 500-yen coins add up to 1000 yen, which is not less than X = 900 yen.\n\nSample Input 2\n\n1 501\n\nSample Output 2\n\nNo\n\nOne 500-yen coin is worth 500 yen, which is less than X = 501 yen.\n\nSample Input 3\n\n4 2000\n\nSample Output 3\n\nYes\n\nFour 500-yen coins add up to 2000 yen, which is not less than X = 2000 yen.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 5, "memory_kb": 1332}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s462461382", "group_id": "codeNet:p02811", "input_text": "program main;\nvar x,k : integer;\nbegin\nreadln (k,x);\n\nif (k>=1) and (k<=100) then begin\nif (x>=1) and (x<=50000) then begin\nif (k*500<=x) then writeln ('Yes')\nelse writeln ('No');\nend;\nend;\n\nend.", "language": "Pascal", "metadata": {"date": 1599596789, "filename_ext": "pas", "original_language": "Pascal (FPC 3.0.4)", "problem_description_relpath": "problem_descriptions/p02811.html", "problem_id": "p02811", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02811/input.txt", "sample_output_relpath": "derived/input_output/data/p02811/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02811/Pascal/s462461382.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s462461382", "user_id": "u529554074"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "program main;\nvar x,k : integer;\nbegin\nreadln (k,x);\n\nif (k>=1) and (k<=100) then begin\nif (x>=1) and (x<=50000) then begin\nif (k*500<=x) then writeln ('Yes')\nelse writeln ('No');\nend;\nend;\n\nend.", "problem_context": "Score : 100 points\n\nProblem Statement\n\nTakahashi has K 500-yen coins. (Yen is the currency of Japan.)\nIf these coins add up to X yen or more, print Yes; otherwise, print No.\n\nConstraints\n\n1 \\leq K \\leq 100\n\n1 \\leq X \\leq 10^5\n\nInput\n\nInput is given from Standard Input in the following format:\n\nK X\n\nOutput\n\nIf the coins add up to X yen or more, print Yes; otherwise, print No.\n\nSample Input 1\n\n2 900\n\nSample Output 1\n\nYes\n\nTwo 500-yen coins add up to 1000 yen, which is not less than X = 900 yen.\n\nSample Input 2\n\n1 501\n\nSample Output 2\n\nNo\n\nOne 500-yen coin is worth 500 yen, which is less than X = 501 yen.\n\nSample Input 3\n\n4 2000\n\nSample Output 3\n\nYes\n\nFour 500-yen coins add up to 2000 yen, which is not less than X = 2000 yen.", "sample_input": "2 900\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p02811", "source_text": "Score : 100 points\n\nProblem Statement\n\nTakahashi has K 500-yen coins. (Yen is the currency of Japan.)\nIf these coins add up to X yen or more, print Yes; otherwise, print No.\n\nConstraints\n\n1 \\leq K \\leq 100\n\n1 \\leq X \\leq 10^5\n\nInput\n\nInput is given from Standard Input in the following format:\n\nK X\n\nOutput\n\nIf the coins add up to X yen or more, print Yes; otherwise, print No.\n\nSample Input 1\n\n2 900\n\nSample Output 1\n\nYes\n\nTwo 500-yen coins add up to 1000 yen, which is not less than X = 900 yen.\n\nSample Input 2\n\n1 501\n\nSample Output 2\n\nNo\n\nOne 500-yen coin is worth 500 yen, which is less than X = 501 yen.\n\nSample Input 3\n\n4 2000\n\nSample Output 3\n\nYes\n\nFour 500-yen coins add up to 2000 yen, which is not less than X = 2000 yen.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 3, "memory_kb": 1368}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s927490657", "group_id": "codeNet:p02811", "input_text": "program hi;\nvar k, x: longint;\nbegin\n readln(k, x);\n if 500 * k >= x then\n writeln('Yes')\n else \n writeln('No');\nend.", "language": "Pascal", "metadata": {"date": 1599594216, "filename_ext": "pas", "original_language": "Pascal (FPC 3.0.4)", "problem_description_relpath": "problem_descriptions/p02811.html", "problem_id": "p02811", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02811/input.txt", "sample_output_relpath": "derived/input_output/data/p02811/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02811/Pascal/s927490657.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s927490657", "user_id": "u051422473"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "program hi;\nvar k, x: longint;\nbegin\n readln(k, x);\n if 500 * k >= x then\n writeln('Yes')\n else \n writeln('No');\nend.", "problem_context": "Score : 100 points\n\nProblem Statement\n\nTakahashi has K 500-yen coins. (Yen is the currency of Japan.)\nIf these coins add up to X yen or more, print Yes; otherwise, print No.\n\nConstraints\n\n1 \\leq K \\leq 100\n\n1 \\leq X \\leq 10^5\n\nInput\n\nInput is given from Standard Input in the following format:\n\nK X\n\nOutput\n\nIf the coins add up to X yen or more, print Yes; otherwise, print No.\n\nSample Input 1\n\n2 900\n\nSample Output 1\n\nYes\n\nTwo 500-yen coins add up to 1000 yen, which is not less than X = 900 yen.\n\nSample Input 2\n\n1 501\n\nSample Output 2\n\nNo\n\nOne 500-yen coin is worth 500 yen, which is less than X = 501 yen.\n\nSample Input 3\n\n4 2000\n\nSample Output 3\n\nYes\n\nFour 500-yen coins add up to 2000 yen, which is not less than X = 2000 yen.", "sample_input": "2 900\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p02811", "source_text": "Score : 100 points\n\nProblem Statement\n\nTakahashi has K 500-yen coins. (Yen is the currency of Japan.)\nIf these coins add up to X yen or more, print Yes; otherwise, print No.\n\nConstraints\n\n1 \\leq K \\leq 100\n\n1 \\leq X \\leq 10^5\n\nInput\n\nInput is given from Standard Input in the following format:\n\nK X\n\nOutput\n\nIf the coins add up to X yen or more, print Yes; otherwise, print No.\n\nSample Input 1\n\n2 900\n\nSample Output 1\n\nYes\n\nTwo 500-yen coins add up to 1000 yen, which is not less than X = 900 yen.\n\nSample Input 2\n\n1 501\n\nSample Output 2\n\nNo\n\nOne 500-yen coin is worth 500 yen, which is less than X = 501 yen.\n\nSample Input 3\n\n4 2000\n\nSample Output 3\n\nYes\n\nFour 500-yen coins add up to 2000 yen, which is not less than X = 2000 yen.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 140, "cpu_time_ms": 4, "memory_kb": 1292}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s636636684", "group_id": "codeNet:p02811", "input_text": "program main;\nvar\n k, x : longint;\n\nbegin\n readln(k, x);\n if (k*500 >= x) then writeln('Yes')\n else writeln('No');\nend.", "language": "Pascal", "metadata": {"date": 1599593669, "filename_ext": "pas", "original_language": "Pascal (FPC 3.0.4)", "problem_description_relpath": "problem_descriptions/p02811.html", "problem_id": "p02811", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02811/input.txt", "sample_output_relpath": "derived/input_output/data/p02811/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02811/Pascal/s636636684.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s636636684", "user_id": "u122156580"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "program main;\nvar\n k, x : longint;\n\nbegin\n readln(k, x);\n if (k*500 >= x) then writeln('Yes')\n else writeln('No');\nend.", "problem_context": "Score : 100 points\n\nProblem Statement\n\nTakahashi has K 500-yen coins. (Yen is the currency of Japan.)\nIf these coins add up to X yen or more, print Yes; otherwise, print No.\n\nConstraints\n\n1 \\leq K \\leq 100\n\n1 \\leq X \\leq 10^5\n\nInput\n\nInput is given from Standard Input in the following format:\n\nK X\n\nOutput\n\nIf the coins add up to X yen or more, print Yes; otherwise, print No.\n\nSample Input 1\n\n2 900\n\nSample Output 1\n\nYes\n\nTwo 500-yen coins add up to 1000 yen, which is not less than X = 900 yen.\n\nSample Input 2\n\n1 501\n\nSample Output 2\n\nNo\n\nOne 500-yen coin is worth 500 yen, which is less than X = 501 yen.\n\nSample Input 3\n\n4 2000\n\nSample Output 3\n\nYes\n\nFour 500-yen coins add up to 2000 yen, which is not less than X = 2000 yen.", "sample_input": "2 900\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p02811", "source_text": "Score : 100 points\n\nProblem Statement\n\nTakahashi has K 500-yen coins. (Yen is the currency of Japan.)\nIf these coins add up to X yen or more, print Yes; otherwise, print No.\n\nConstraints\n\n1 \\leq K \\leq 100\n\n1 \\leq X \\leq 10^5\n\nInput\n\nInput is given from Standard Input in the following format:\n\nK X\n\nOutput\n\nIf the coins add up to X yen or more, print Yes; otherwise, print No.\n\nSample Input 1\n\n2 900\n\nSample Output 1\n\nYes\n\nTwo 500-yen coins add up to 1000 yen, which is not less than X = 900 yen.\n\nSample Input 2\n\n1 501\n\nSample Output 2\n\nNo\n\nOne 500-yen coin is worth 500 yen, which is less than X = 501 yen.\n\nSample Input 3\n\n4 2000\n\nSample Output 3\n\nYes\n\nFour 500-yen coins add up to 2000 yen, which is not less than X = 2000 yen.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 5, "memory_kb": 1320}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s102056628", "group_id": "codeNet:p02812", "input_text": "program main;\nvar \n a : string;\n i,n,c : integer;\nbegin\n c := 0;\n readln(n);\n readln(a);\n for i := 1 to n do\n if a[i] = 'A' then \n if a[i+1] = 'B' then \n if a[i+2] = 'C' then \n inc(c);\n writeln(c);\nend.", "language": "Pascal", "metadata": {"date": 1599595082, "filename_ext": "pas", "original_language": "Pascal (FPC 3.0.4)", "problem_description_relpath": "problem_descriptions/p02812.html", "problem_id": "p02812", "resource_group": "low_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/Pascal/s102056628.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s102056628", "user_id": "u743163683"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "program main;\nvar \n a : string;\n i,n,c : integer;\nbegin\n c := 0;\n readln(n);\n readln(a);\n for i := 1 to n do\n if a[i] = 'A' then \n if a[i+1] = 'B' then \n if a[i+2] = 'C' then \n inc(c);\n writeln(c);\nend.", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 1332}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s069562893", "group_id": "codeNet:p02812", "input_text": "program hi;\nvar \n n, i, ans: longint;\n s: string;\n\nbegin\n readln(n);\n readln(s);\n ans := 0;\n for i := 1 to n - 2 do \n if s[i] + s[i + 1] + s[i + 2] = 'ABC' then\n inc(ans);\n writeln(ans);\nend.", "language": "Pascal", "metadata": {"date": 1599594492, "filename_ext": "pas", "original_language": "Pascal (FPC 3.0.4)", "problem_description_relpath": "problem_descriptions/p02812.html", "problem_id": "p02812", "resource_group": "low_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/Pascal/s069562893.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s069562893", "user_id": "u051422473"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "program hi;\nvar \n n, i, ans: longint;\n s: string;\n\nbegin\n readln(n);\n readln(s);\n ans := 0;\n for i := 1 to n - 2 do \n if s[i] + s[i + 1] + s[i + 2] = 'ABC' then\n inc(ans);\n writeln(ans);\nend.", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 5, "memory_kb": 1356}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s702967147", "group_id": "codeNet:p02813", "input_text": "program main;\nconst\n size = 8;\n\ntype\n sample = array [1..size] of longint;\n\nvar\n n, order : longint;\n p, q : sample;\n\n\n procedure input (var a : sample);\n var\n i : longint;\n\n begin\n for i := 1 to n do\n read(a[i]);\n readln;\n end;\n\n function code (var a : sample) : sample;\n var \n i, j, c : longint;\n \n begin\n for i := 1 to n do\n a[i] := a[i] - 1; //zero index\n for i := 1 to n do begin\n c := 0;\n for j := 1 to (i-1) do\n if (a[j] < a[i]) then inc(c);\n code[i] := a[i] - c;\n end; //lehmer code\n end;\n\n function rank (a : sample) : longint;\n var\n i, t : longint;\t\n\n function fact (n : longint) : longint;\n begin\n if (n = 0) or (n = 1) then fact := 1\n else fact := n * fact(n-1);\n end;\n \n begin\n t := 0;\n for i := 1 to n do begin\n t := t + a[i]*fact(n-i);\n end; //lexicographic rank\n\t inc(t);\n\t rank := t;\n end;\n\n\nbegin\n readln(n);\n input(p);\n input(q);\n order := abs(rank(code(p))-rank(code(q)));\n writeln(order);\nend.\n\n", "language": "Pascal", "metadata": {"date": 1599618007, "filename_ext": "pas", "original_language": "Pascal (FPC 3.0.4)", "problem_description_relpath": "problem_descriptions/p02813.html", "problem_id": "p02813", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02813/input.txt", "sample_output_relpath": "derived/input_output/data/p02813/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02813/Pascal/s702967147.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s702967147", "user_id": "u122156580"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "program main;\nconst\n size = 8;\n\ntype\n sample = array [1..size] of longint;\n\nvar\n n, order : longint;\n p, q : sample;\n\n\n procedure input (var a : sample);\n var\n i : longint;\n\n begin\n for i := 1 to n do\n read(a[i]);\n readln;\n end;\n\n function code (var a : sample) : sample;\n var \n i, j, c : longint;\n \n begin\n for i := 1 to n do\n a[i] := a[i] - 1; //zero index\n for i := 1 to n do begin\n c := 0;\n for j := 1 to (i-1) do\n if (a[j] < a[i]) then inc(c);\n code[i] := a[i] - c;\n end; //lehmer code\n end;\n\n function rank (a : sample) : longint;\n var\n i, t : longint;\t\n\n function fact (n : longint) : longint;\n begin\n if (n = 0) or (n = 1) then fact := 1\n else fact := n * fact(n-1);\n end;\n \n begin\n t := 0;\n for i := 1 to n do begin\n t := t + a[i]*fact(n-i);\n end; //lexicographic rank\n\t inc(t);\n\t rank := t;\n end;\n\n\nbegin\n readln(n);\n input(p);\n input(q);\n order := abs(rank(code(p))-rank(code(q)));\n writeln(order);\nend.\n\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nWe have two permutations P and Q of size N (that is, P and Q are both rearrangements of (1,~2,~...,~N)).\n\nThere are N! possible permutations of size N. Among them, let P and Q be the a-th and b-th lexicographically smallest permutations, respectively. Find |a - b|.\n\nNotes\n\nFor two sequences X and Y, X is said to be lexicographically smaller than Y if and only if there exists an integer k such that X_i = Y_i~(1 \\leq i < k) and X_k < Y_k.\n\nConstraints\n\n2 \\leq N \\leq 8\n\nP and Q are permutations of size N.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nP_1 P_2 ... P_N\nQ_1 Q_2 ... Q_N\n\nOutput\n\nPrint |a - b|.\n\nSample Input 1\n\n3\n1 3 2\n3 1 2\n\nSample Output 1\n\n3\n\nThere are 6 permutations of size 3: (1,~2,~3), (1,~3,~2), (2,~1,~3), (2,~3,~1), (3,~1,~2), and (3,~2,~1). Among them, (1,~3,~2) and (3,~1,~2) come 2-nd and 5-th in lexicographical order, so the answer is |2 - 5| = 3.\n\nSample Input 2\n\n8\n7 3 5 4 2 1 6 8\n3 8 2 5 4 6 7 1\n\nSample Output 2\n\n17517\n\nSample Input 3\n\n3\n1 2 3\n1 2 3\n\nSample Output 3\n\n0", "sample_input": "3\n1 3 2\n3 1 2\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02813", "source_text": "Score : 300 points\n\nProblem Statement\n\nWe have two permutations P and Q of size N (that is, P and Q are both rearrangements of (1,~2,~...,~N)).\n\nThere are N! possible permutations of size N. Among them, let P and Q be the a-th and b-th lexicographically smallest permutations, respectively. Find |a - b|.\n\nNotes\n\nFor two sequences X and Y, X is said to be lexicographically smaller than Y if and only if there exists an integer k such that X_i = Y_i~(1 \\leq i < k) and X_k < Y_k.\n\nConstraints\n\n2 \\leq N \\leq 8\n\nP and Q are permutations of size N.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nP_1 P_2 ... P_N\nQ_1 Q_2 ... Q_N\n\nOutput\n\nPrint |a - b|.\n\nSample Input 1\n\n3\n1 3 2\n3 1 2\n\nSample Output 1\n\n3\n\nThere are 6 permutations of size 3: (1,~2,~3), (1,~3,~2), (2,~1,~3), (2,~3,~1), (3,~1,~2), and (3,~2,~1). Among them, (1,~3,~2) and (3,~1,~2) come 2-nd and 5-th in lexicographical order, so the answer is |2 - 5| = 3.\n\nSample Input 2\n\n8\n7 3 5 4 2 1 6 8\n3 8 2 5 4 6 7 1\n\nSample Output 2\n\n17517\n\nSample Input 3\n\n3\n1 2 3\n1 2 3\n\nSample Output 3\n\n0", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1093, "cpu_time_ms": 3, "memory_kb": 1384}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s159783541", "group_id": "codeNet:p02817", "input_text": "program main;\nvar a,b,k :integer;\n \nbegin \nreadln(a,b,k);\nrepeat \nrepeat \nif (a>=1) then begin a:=a-1;k:=k-1;end;\nuntil (a=0)or (k=0);\nif (a=0) and (b>=1) then begin b:=b-1;k:=k-1;end;\nuntil (k=0); \n \nwriteln(a,b);\n \nend.", "language": "Pascal", "metadata": {"date": 1599598546, "filename_ext": "pas", "original_language": "Pascal (FPC 3.0.4)", "problem_description_relpath": "problem_descriptions/p02817.html", "problem_id": "p02817", "resource_group": "low_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/Pascal/s159783541.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s159783541", "user_id": "u880893396"}, "prompt_components": {"gold_output": "atcoder\n", "input_to_evaluate": "program main;\nvar a,b,k :integer;\n \nbegin \nreadln(a,b,k);\nrepeat \nrepeat \nif (a>=1) then begin a:=a-1;k:=k-1;end;\nuntil (a=0)or (k=0);\nif (a=0) and (b>=1) then begin b:=b-1;k:=k-1;end;\nuntil (k=0); \n \nwriteln(a,b);\n \nend.", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 6, "memory_kb": 1312}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s623237218", "group_id": "codeNet:p02817", "input_text": "program main;\nvar s,t, output : string;\nbegin\nreadln (s,t);\noutput:=concat(t,s);\nend.", "language": "Pascal", "metadata": {"date": 1599598214, "filename_ext": "pas", "original_language": "Pascal (FPC 3.0.4)", "problem_description_relpath": "problem_descriptions/p02817.html", "problem_id": "p02817", "resource_group": "low_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/Pascal/s623237218.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s623237218", "user_id": "u529554074"}, "prompt_components": {"gold_output": "atcoder\n", "input_to_evaluate": "program main;\nvar s,t, output : string;\nbegin\nreadln (s,t);\noutput:=concat(t,s);\nend.", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 2, "memory_kb": 1316}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s305978389", "group_id": "codeNet:p02817", "input_text": "program main;\nvar a,b,k :integer;\n \nbegin \nrepeat \nrepeat \nif (a>=1) then begin a:=a-1;k:=k-1;\nend;\nuntil (a=0);\nif (a=0) and (b>=1) then begin b:=b-1;\nk:=k-1;end;\nuntil (k=0); \n \nwriteln(a,b);\n \nend.", "language": "Pascal", "metadata": {"date": 1599598133, "filename_ext": "pas", "original_language": "Pascal (FPC 3.0.4)", "problem_description_relpath": "problem_descriptions/p02817.html", "problem_id": "p02817", "resource_group": "low_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/Pascal/s305978389.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s305978389", "user_id": "u880893396"}, "prompt_components": {"gold_output": "atcoder\n", "input_to_evaluate": "program main;\nvar a,b,k :integer;\n \nbegin \nrepeat \nrepeat \nif (a>=1) then begin a:=a-1;k:=k-1;\nend;\nuntil (a=0);\nif (a=0) and (b>=1) then begin b:=b-1;\nk:=k-1;end;\nuntil (k=0); \n \nwriteln(a,b);\n \nend.", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 1, "memory_kb": 1368}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s448182359", "group_id": "codeNet:p02817", "input_text": "program main;\nvar s,t : string;\nbegin\n\treadln(s,t);\n write(t);\n writeln(s);\nend.", "language": "Pascal", "metadata": {"date": 1599596338, "filename_ext": "pas", "original_language": "Pascal (FPC 3.0.4)", "problem_description_relpath": "problem_descriptions/p02817.html", "problem_id": "p02817", "resource_group": "low_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/Pascal/s448182359.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s448182359", "user_id": "u212944395"}, "prompt_components": {"gold_output": "atcoder\n", "input_to_evaluate": "program main;\nvar s,t : string;\nbegin\n\treadln(s,t);\n write(t);\n writeln(s);\nend.", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 86, "cpu_time_ms": 6, "memory_kb": 1328}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s496134564", "group_id": "codeNet:p02817", "input_text": "program hi;\nvar s: string;\nbegin\n\treadln(s);\n writeln(copy(s + s, pos(' ', s) + 1, length(s)))\nend.", "language": "Pascal", "metadata": {"date": 1599594039, "filename_ext": "pas", "original_language": "Pascal (FPC 3.0.4)", "problem_description_relpath": "problem_descriptions/p02817.html", "problem_id": "p02817", "resource_group": "low_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/Pascal/s496134564.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s496134564", "user_id": "u051422473"}, "prompt_components": {"gold_output": "atcoder\n", "input_to_evaluate": "program hi;\nvar s: string;\nbegin\n\treadln(s);\n writeln(copy(s + s, pos(' ', s) + 1, length(s)))\nend.", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 102, "cpu_time_ms": 7, "memory_kb": 1312}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s057680009", "group_id": "codeNet:p02817", "input_text": "uses crt;\nvar a,b:string;\n i,n:longint;\nbegin\n clrscr;\n read(a);\n for i:=1 to pos(' ',a) do\n begin\n b:=b+a[i];\n end;\n delete(a,1,pos(' ',a));\n writeln(a,b);\n readln;\n readln\nend.\n", "language": "Pascal", "metadata": {"date": 1577724632, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p02817.html", "problem_id": "p02817", "resource_group": "low_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/Pascal/s057680009.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s057680009", "user_id": "u684763923"}, "prompt_components": {"gold_output": "atcoder\n", "input_to_evaluate": "uses crt;\nvar a,b:string;\n i,n:longint;\nbegin\n clrscr;\n read(a);\n for i:=1 to pos(' ',a) do\n begin\n b:=b+a[i];\n end;\n delete(a,1,pos(' ',a));\n writeln(a,b);\n readln;\n readln\nend.\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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s998445752", "group_id": "codeNet:p02817", "input_text": "uses crt;\nvar a,s,t:string;\n i,j:word;\n\nbegin\n readln(a);\n t:=copy(a,pos(' ',a)+1,length(a)-pos(' ',a));\n s:=copy(a,1,pos(' ',a)-1);\n write(t,s);\nend.", "language": "Pascal", "metadata": {"date": 1577668313, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p02817.html", "problem_id": "p02817", "resource_group": "low_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/Pascal/s998445752.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s998445752", "user_id": "u537740791"}, "prompt_components": {"gold_output": "atcoder\n", "input_to_evaluate": "uses crt;\nvar a,s,t:string;\n i,j:word;\n\nbegin\n readln(a);\n t:=copy(a,pos(' ',a)+1,length(a)-pos(' ',a));\n s:=copy(a,1,pos(' ',a)-1);\n write(t,s);\nend.", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s999364736", "group_id": "codeNet:p02818", "input_text": "program main;\nvar a,b,k : qword;\nbegin\n readln(a,b,k);\n if (a >= k) then writeln(a - k, ' ', b)\n else if (a + b >= k) then writeln(0, ' ', a + b - k)\n else writeln('0 0');\nend.", "language": "Pascal", "metadata": {"date": 1599598524, "filename_ext": "pas", "original_language": "Pascal (FPC 3.0.4)", "problem_description_relpath": "problem_descriptions/p02818.html", "problem_id": "p02818", "resource_group": "low_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/Pascal/s999364736.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s999364736", "user_id": "u289438802"}, "prompt_components": {"gold_output": "0 2\n", "input_to_evaluate": "program main;\nvar a,b,k : qword;\nbegin\n readln(a,b,k);\n if (a >= k) then writeln(a - k, ' ', b)\n else if (a + b >= k) then writeln(0, ' ', a + b - k)\n else writeln('0 0');\nend.", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 1384}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s005312189", "group_id": "codeNet:p02818", "input_text": "program main;\nvar a,b,k : shortint;\nbegin\n readln(a,b,k);\n if (a >= k) then writeln(a - k, ' ', b)\n else if (a + b >= k) then writeln(0, ' ', a + b - k)\n else writeln('0 0');\nend.", "language": "Pascal", "metadata": {"date": 1599597257, "filename_ext": "pas", "original_language": "Pascal (FPC 3.0.4)", "problem_description_relpath": "problem_descriptions/p02818.html", "problem_id": "p02818", "resource_group": "low_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/Pascal/s005312189.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s005312189", "user_id": "u289438802"}, "prompt_components": {"gold_output": "0 2\n", "input_to_evaluate": "program main;\nvar a,b,k : shortint;\nbegin\n readln(a,b,k);\n if (a >= k) then writeln(a - k, ' ', b)\n else if (a + b >= k) then writeln(0, ' ', a + b - k)\n else writeln('0 0');\nend.", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 3, "memory_kb": 1380}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s330175475", "group_id": "codeNet:p02818", "input_text": " program main;\n var a,b,k:integer;\n begin\n readln(a,b,k);\n if(a>=k) then a:=a-k;\n if(a=k) then b:=b-k\n else b:=0;\n end;\n writeln(a,' ',b);\n end.", "language": "Pascal", "metadata": {"date": 1599597146, "filename_ext": "pas", "original_language": "Pascal (FPC 3.0.4)", "problem_description_relpath": "problem_descriptions/p02818.html", "problem_id": "p02818", "resource_group": "low_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/Pascal/s330175475.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s330175475", "user_id": "u324512947"}, "prompt_components": {"gold_output": "0 2\n", "input_to_evaluate": " program main;\n var a,b,k:integer;\n begin\n readln(a,b,k);\n if(a>=k) then a:=a-k;\n if(a=k) then b:=b-k\n else b:=0;\n end;\n writeln(a,' ',b);\n end.", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 1388}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s907790921", "group_id": "codeNet:p02818", "input_text": "program main;\nvar \n a,b,k : QWord;\n i : integer;\nbegin\n readln(a,b,k);\n if (a > 100000000000) or (b > 100000000000) or (k > 100000000000) then\n writeln('0 0')\n else \n begin \n for i := 1 to k do \n begin \n if ( a >= 1 ) then \n dec(a) \n else\n if ( a = 0 ) then \n dec(b);\n end;\n writeln(a,' ',b);\n end;\nend.", "language": "Pascal", "metadata": {"date": 1599595672, "filename_ext": "pas", "original_language": "Pascal (FPC 3.0.4)", "problem_description_relpath": "problem_descriptions/p02818.html", "problem_id": "p02818", "resource_group": "low_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/Pascal/s907790921.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s907790921", "user_id": "u743163683"}, "prompt_components": {"gold_output": "0 2\n", "input_to_evaluate": "program main;\nvar \n a,b,k : QWord;\n i : integer;\nbegin\n readln(a,b,k);\n if (a > 100000000000) or (b > 100000000000) or (k > 100000000000) then\n writeln('0 0')\n else \n begin \n for i := 1 to k do \n begin \n if ( a >= 1 ) then \n dec(a) \n else\n if ( a = 0 ) then \n dec(b);\n end;\n writeln(a,' ',b);\n end;\nend.", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 502, "cpu_time_ms": 5, "memory_kb": 1376}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s558362167", "group_id": "codeNet:p02818", "input_text": "program main;\nvar \n a,b,k : QWord;\n i : integer;\nbegin\n readln(a,b,k);\n if (a > 1000000000000) or (b > 1000000000000) or (k > 1000000000000) then\n writeln('0 0')\n else \n begin \n for i := 1 to k do \n begin \n if ( a >= 1 ) then \n dec(a) \n else\n if ( a = 0 ) then \n dec(b);\n end;\n writeln(a,' ',b);\n end;\nend.", "language": "Pascal", "metadata": {"date": 1599595492, "filename_ext": "pas", "original_language": "Pascal (FPC 3.0.4)", "problem_description_relpath": "problem_descriptions/p02818.html", "problem_id": "p02818", "resource_group": "low_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/Pascal/s558362167.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s558362167", "user_id": "u743163683"}, "prompt_components": {"gold_output": "0 2\n", "input_to_evaluate": "program main;\nvar \n a,b,k : QWord;\n i : integer;\nbegin\n readln(a,b,k);\n if (a > 1000000000000) or (b > 1000000000000) or (k > 1000000000000) then\n writeln('0 0')\n else \n begin \n for i := 1 to k do \n begin \n if ( a >= 1 ) then \n dec(a) \n else\n if ( a = 0 ) then \n dec(b);\n end;\n writeln(a,' ',b);\n end;\nend.", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 1568, "memory_kb": 1372}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s968846164", "group_id": "codeNet:p02818", "input_text": "uses crt;\nvar\n a,b,k,i:longint;\nbegin\n clrscr;\n readln(a,b,k);\n for i:=1 to k-1 do\n begin\n if (a>=1) then dec(a);\n if (a = 0) and (b>=1) then dec(b);\n end;\n write(a,' ',b);\n readln;\nend.\n\n", "language": "Pascal", "metadata": {"date": 1577671023, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p02818.html", "problem_id": "p02818", "resource_group": "low_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/Pascal/s968846164.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s968846164", "user_id": "u129576229"}, "prompt_components": {"gold_output": "0 2\n", "input_to_evaluate": "uses crt;\nvar\n a,b,k,i:longint;\nbegin\n clrscr;\n readln(a,b,k);\n for i:=1 to k-1 do\n begin\n if (a>=1) then dec(a);\n if (a = 0) and (b>=1) then dec(b);\n end;\n write(a,' ',b);\n readln;\nend.\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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 1050, "memory_kb": 128}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s023652776", "group_id": "codeNet:p02819", "input_text": "program main;\n\nfunction checkprime (var y:integer): Boolean;\nvar a,counter : integer;\nbegin\ncounter:=0;\ncheckprime:=false;\nfor a:=1 to y do \nif (y mod counter=0) then counter:=counter+1;\nif counter=2 then checkprime:=true;\nif counter<>2 then checkprime:=false;\nend;\n\n\nvar x : integer;\nbegin\nreadln (x);\n\nrepeat\nif checkprime(x)=false then x:=x+1;\nuntil checkprime(x)=true;\n\nwriteln (x);\nend.", "language": "Pascal", "metadata": {"date": 1599599525, "filename_ext": "pas", "original_language": "Pascal (FPC 3.0.4)", "problem_description_relpath": "problem_descriptions/p02819.html", "problem_id": "p02819", "resource_group": "low_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/Pascal/s023652776.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s023652776", "user_id": "u529554074"}, "prompt_components": {"gold_output": "23\n", "input_to_evaluate": "program main;\n\nfunction checkprime (var y:integer): Boolean;\nvar a,counter : integer;\nbegin\ncounter:=0;\ncheckprime:=false;\nfor a:=1 to y do \nif (y mod counter=0) then counter:=counter+1;\nif counter=2 then checkprime:=true;\nif counter<>2 then checkprime:=false;\nend;\n\n\nvar x : integer;\nbegin\nreadln (x);\n\nrepeat\nif checkprime(x)=false then x:=x+1;\nuntil checkprime(x)=true;\n\nwriteln (x);\nend.", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 5, "memory_kb": 1384}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s202802160", "group_id": "codeNet:p02819", "input_text": "program main;\nvar \n a : QWord;\n i : integer;\n check : boolean;\n final : boolean;\nbegin\n final := false;\n readln(a);\n while final = false do\n begin\n check := false;\n for i := 2 to a-1 do \n if (( a mod i ) = 0) then \n check := true;\n if check = false then \n final := true;\n if check = true then \n inc(a);\n end;\n writeln(a);\nend.", "language": "Pascal", "metadata": {"date": 1599598443, "filename_ext": "pas", "original_language": "Pascal (FPC 3.0.4)", "problem_description_relpath": "problem_descriptions/p02819.html", "problem_id": "p02819", "resource_group": "low_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/Pascal/s202802160.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s202802160", "user_id": "u743163683"}, "prompt_components": {"gold_output": "23\n", "input_to_evaluate": "program main;\nvar \n a : QWord;\n i : integer;\n check : boolean;\n final : boolean;\nbegin\n final := false;\n readln(a);\n while final = false do\n begin\n check := false;\n for i := 2 to a-1 do \n if (( a mod i ) = 0) then \n check := true;\n if check = false then \n final := true;\n if check = true then \n inc(a);\n end;\n writeln(a);\nend.", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 476, "cpu_time_ms": 33, "memory_kb": 1392}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s747492103", "group_id": "codeNet:p02820", "input_text": "Var n,k,r,s,p,i,sum:Longint;\n t:Ansistring;\n a:Array[1 .. 200000] of Boolean;\nBegin\n Fillchar(a,sizeof(a),True);\n Readln(n,k);\n Readln(r,s,p);\n Readln(t);\n For i:=1 to n do begin\n If a[i] then begin\n If t[i]='p' then sum:=sum+s\n Else if t[i]='r' then sum:=sum+p\n Else sum:=sum+r;\n End;\n If (t[i]=t[i+k]) and (a[i]) then a[i+k]:=false;\n End;\n Writeln(sum);\nEnd.", "language": "Pascal", "metadata": {"date": 1577669249, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p02820.html", "problem_id": "p02820", "resource_group": "low_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/Pascal/s747492103.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s747492103", "user_id": "u866155170"}, "prompt_components": {"gold_output": "27\n", "input_to_evaluate": "Var n,k,r,s,p,i,sum:Longint;\n t:Ansistring;\n a:Array[1 .. 200000] of Boolean;\nBegin\n Fillchar(a,sizeof(a),True);\n Readln(n,k);\n Readln(r,s,p);\n Readln(t);\n For i:=1 to n do begin\n If a[i] then begin\n If t[i]='p' then sum:=sum+s\n Else if t[i]='r' then sum:=sum+p\n Else sum:=sum+r;\n End;\n If (t[i]=t[i+k]) and (a[i]) then a[i+k]:=false;\n End;\n Writeln(sum);\nEnd.", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 441, "cpu_time_ms": 2, "memory_kb": 384}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s009312217", "group_id": "codeNet:p02821", "input_text": "\nvar n,m,count,i,j,j1,sum,x,tam,k: longint;\na: array[1..10000] of longint;\n procedure qs(l,r: longint);\nBEGIN\ni:=l;\nj:=r;\nx:=a[(i+j) div 2];\nrepeat\nwhile a[i]>x do inc(i);\nwhile a[j]j;\nif li then qs(i,r);\nend;\nbegin\n\nread(n,k);\nfor i:=1 to n do read(a[i]);\nqs(1,n);\nfor i:=1 to n do\nfor j:=i to n do\nbegin\nif i=j then begin\nsum:=sum+a[i]+a[j];\ninc(count); if count=k then write(sum);\nend else for j1:=1 to 2 do begin sum:=sum+a[i]+a[j]; inc(count); if\ncount=k then write(sum); end;\nend;\n\nend.\n", "language": "Pascal", "metadata": {"date": 1577679836, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p02821.html", "problem_id": "p02821", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02821/input.txt", "sample_output_relpath": "derived/input_output/data/p02821/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02821/Pascal/s009312217.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s009312217", "user_id": "u398406871"}, "prompt_components": {"gold_output": "202\n", "input_to_evaluate": "\nvar n,m,count,i,j,j1,sum,x,tam,k: longint;\na: array[1..10000] of longint;\n procedure qs(l,r: longint);\nBEGIN\ni:=l;\nj:=r;\nx:=a[(i+j) div 2];\nrepeat\nwhile a[i]>x do inc(i);\nwhile a[j]j;\nif li then qs(i,r);\nend;\nbegin\n\nread(n,k);\nfor i:=1 to n do read(a[i]);\nqs(1,n);\nfor i:=1 to n do\nfor j:=i to n do\nbegin\nif i=j then begin\nsum:=sum+a[i]+a[j];\ninc(count); if count=k then write(sum);\nend else for j1:=1 to 2 do begin sum:=sum+a[i]+a[j]; inc(count); if\ncount=k then write(sum); end;\nend;\n\nend.\n", "problem_context": "Score : 500 points\n\nProblem Statement\n\nTakahashi has come to a party as a special guest.\nThere are N ordinary guests at the party. The i-th ordinary guest has a power of A_i.\n\nTakahashi has decided to perform M handshakes to increase the happiness of the party (let the current happiness be 0).\nA handshake will be performed as follows:\n\nTakahashi chooses one (ordinary) guest x for his left hand and another guest y for his right hand (x and y can be the same).\n\nThen, he shakes the left hand of Guest x and the right hand of Guest y simultaneously to increase the happiness by A_x+A_y.\n\nHowever, Takahashi should not perform the same handshake more than once. Formally, the following condition must hold:\n\nAssume that, in the k-th handshake, Takahashi shakes the left hand of Guest x_k and the right hand of Guest y_k. Then, there is no pair p, q (1 \\leq p < q \\leq M) such that (x_p,y_p)=(x_q,y_q).\n\nWhat is the maximum possible happiness after M handshakes?\n\nConstraints\n\n1 \\leq N \\leq 10^5\n\n1 \\leq M \\leq N^2\n\n1 \\leq A_i \\leq 10^5\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the maximum possible happiness after M handshakes.\n\nSample Input 1\n\n5 3\n10 14 19 34 33\n\nSample Output 1\n\n202\n\nLet us say that Takahashi performs the following handshakes:\n\nIn the first handshake, Takahashi shakes the left hand of Guest 4 and the right hand of Guest 4.\n\nIn the second handshake, Takahashi shakes the left hand of Guest 4 and the right hand of Guest 5.\n\nIn the third handshake, Takahashi shakes the left hand of Guest 5 and the right hand of Guest 4.\n\nThen, we will have the happiness of (34+34)+(34+33)+(33+34)=202.\n\nWe cannot achieve the happiness of 203 or greater, so the answer is 202.\n\nSample Input 2\n\n9 14\n1 3 5 110 24 21 34 5 3\n\nSample Output 2\n\n1837\n\nSample Input 3\n\n9 73\n67597 52981 5828 66249 75177 64141 40773 79105 16076\n\nSample Output 3\n\n8128170", "sample_input": "5 3\n10 14 19 34 33\n"}, "reference_outputs": ["202\n"], "source_document_id": "p02821", "source_text": "Score : 500 points\n\nProblem Statement\n\nTakahashi has come to a party as a special guest.\nThere are N ordinary guests at the party. The i-th ordinary guest has a power of A_i.\n\nTakahashi has decided to perform M handshakes to increase the happiness of the party (let the current happiness be 0).\nA handshake will be performed as follows:\n\nTakahashi chooses one (ordinary) guest x for his left hand and another guest y for his right hand (x and y can be the same).\n\nThen, he shakes the left hand of Guest x and the right hand of Guest y simultaneously to increase the happiness by A_x+A_y.\n\nHowever, Takahashi should not perform the same handshake more than once. Formally, the following condition must hold:\n\nAssume that, in the k-th handshake, Takahashi shakes the left hand of Guest x_k and the right hand of Guest y_k. Then, there is no pair p, q (1 \\leq p < q \\leq M) such that (x_p,y_p)=(x_q,y_q).\n\nWhat is the maximum possible happiness after M handshakes?\n\nConstraints\n\n1 \\leq N \\leq 10^5\n\n1 \\leq M \\leq N^2\n\n1 \\leq A_i \\leq 10^5\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the maximum possible happiness after M handshakes.\n\nSample Input 1\n\n5 3\n10 14 19 34 33\n\nSample Output 1\n\n202\n\nLet us say that Takahashi performs the following handshakes:\n\nIn the first handshake, Takahashi shakes the left hand of Guest 4 and the right hand of Guest 4.\n\nIn the second handshake, Takahashi shakes the left hand of Guest 4 and the right hand of Guest 5.\n\nIn the third handshake, Takahashi shakes the left hand of Guest 5 and the right hand of Guest 4.\n\nThen, we will have the happiness of (34+34)+(34+33)+(33+34)=202.\n\nWe cannot achieve the happiness of 203 or greater, so the answer is 202.\n\nSample Input 2\n\n9 14\n1 3 5 110 24 21 34 5 3\n\nSample Output 2\n\n1837\n\nSample Input 3\n\n9 73\n67597 52981 5828 66249 75177 64141 40773 79105 16076\n\nSample Output 3\n\n8128170", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 102, "memory_kb": 128}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s369093571", "group_id": "codeNet:p02823", "input_text": "uses crt;\nvar\nn,a,b:longint; \nbegin\n\tclrscr;\n readln(n,a,b);\n if(abs(a-b) mod 2 =0) then writeln(abs(a-b) div 2)\n else begin\n \t\t\tif(b>a) then begin \n \t\t\t\t\tb:=b+a;\n \t\t\t\t\ta:=b-a;\n b:=b-a;\n \t\t\t\tend;\n \n \t\t\tif(a-1>n-b) then writeln(abs(a-b) div 2+(n-abs(a+b)div 2))\n else writeln(abs(a-b)div 2+(abs(a+b)div 2 ));\n \t\tend;\n\treadln;\nend.", "language": "Pascal", "metadata": {"date": 1577590258, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p02823.html", "problem_id": "p02823", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02823/input.txt", "sample_output_relpath": "derived/input_output/data/p02823/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02823/Pascal/s369093571.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s369093571", "user_id": "u918341086"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "uses crt;\nvar\nn,a,b:longint; \nbegin\n\tclrscr;\n readln(n,a,b);\n if(abs(a-b) mod 2 =0) then writeln(abs(a-b) div 2)\n else begin\n \t\t\tif(b>a) then begin \n \t\t\t\t\tb:=b+a;\n \t\t\t\t\ta:=b-a;\n b:=b-a;\n \t\t\t\tend;\n \n \t\t\tif(a-1>n-b) then writeln(abs(a-b) div 2+(n-abs(a+b)div 2))\n else writeln(abs(a-b)div 2+(abs(a+b)div 2 ));\n \t\tend;\n\treadln;\nend.", "problem_context": "Score : 300 points\n\nProblem Statement\n\n2N players are running a competitive table tennis training on N tables numbered from 1 to N.\n\nThe training consists of rounds.\nIn each round, the players form N pairs, one pair per table.\nIn each pair, competitors play a match against each other.\nAs a result, one of them wins and the other one loses.\n\nThe winner of the match on table X plays on table X-1 in the next round,\nexcept for the winner of the match on table 1 who stays at table 1.\n\nSimilarly, the loser of the match on table X plays on table X+1 in the next round,\nexcept for the loser of the match on table N who stays at table N.\n\nTwo friends are playing their first round matches on distinct tables A and B.\nLet's assume that the friends are strong enough to win or lose any match at will.\nWhat is the smallest number of rounds after which the friends can get to play a match against each other?\n\nConstraints\n\n2 \\leq N \\leq 10^{18}\n\n1 \\leq A < B \\leq N\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN A B\n\nOutput\n\nPrint the smallest number of rounds after which the friends can get to play a match against each other.\n\nSample Input 1\n\n5 2 4\n\nSample Output 1\n\n1\n\nIf the first friend loses their match and the second friend wins their match, they will both move to table 3 and play each other in the next round.\n\nSample Input 2\n\n5 2 3\n\nSample Output 2\n\n2\n\nIf both friends win two matches in a row, they will both move to table 1.", "sample_input": "5 2 4\n"}, "reference_outputs": ["1\n"], "source_document_id": "p02823", "source_text": "Score : 300 points\n\nProblem Statement\n\n2N players are running a competitive table tennis training on N tables numbered from 1 to N.\n\nThe training consists of rounds.\nIn each round, the players form N pairs, one pair per table.\nIn each pair, competitors play a match against each other.\nAs a result, one of them wins and the other one loses.\n\nThe winner of the match on table X plays on table X-1 in the next round,\nexcept for the winner of the match on table 1 who stays at table 1.\n\nSimilarly, the loser of the match on table X plays on table X+1 in the next round,\nexcept for the loser of the match on table N who stays at table N.\n\nTwo friends are playing their first round matches on distinct tables A and B.\nLet's assume that the friends are strong enough to win or lose any match at will.\nWhat is the smallest number of rounds after which the friends can get to play a match against each other?\n\nConstraints\n\n2 \\leq N \\leq 10^{18}\n\n1 \\leq A < B \\leq N\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN A B\n\nOutput\n\nPrint the smallest number of rounds after which the friends can get to play a match against each other.\n\nSample Input 1\n\n5 2 4\n\nSample Output 1\n\n1\n\nIf the first friend loses their match and the second friend wins their match, they will both move to table 3 and play each other in the next round.\n\nSample Input 2\n\n5 2 3\n\nSample Output 2\n\n2\n\nIf both friends win two matches in a row, they will both move to table 1.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 473, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s547695948", "group_id": "codeNet:p02830", "input_text": "uses crt;\nvar a,b:string;\n i,n:longint;\nbegin\n clrscr;\n readln(n);\n read(a);\n for i:=1 to pos(' ',a) do\n begin\n b:=b+a[i];\n end;\n delete(a,1,n+1);\n for i:=1 to n do write(b[i],a[i]);\n \nend.\n\n", "language": "Pascal", "metadata": {"date": 1577314311, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p02830.html", "problem_id": "p02830", "resource_group": "low_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/Pascal/s547695948.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s547695948", "user_id": "u684763923"}, "prompt_components": {"gold_output": "icpc\n", "input_to_evaluate": "uses crt;\nvar a,b:string;\n i,n:longint;\nbegin\n clrscr;\n readln(n);\n read(a);\n for i:=1 to pos(' ',a) do\n begin\n b:=b+a[i];\n end;\n delete(a,1,n+1);\n for i:=1 to n do write(b[i],a[i]);\n \nend.\n\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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s713578373", "group_id": "codeNet:p02830", "input_text": "uses crt;\nvar a,b:string;\n i,n:longint;\nbegin\n clrscr;\n readln(n);\n readln(a);\n for i:=1 to pos(' ',a) do\n begin\n b:=b+a[i];\n end;\n delete(a,1,n+1);\n for i:=1 to n do write(b[i],a[i]);\n readln;\nend.\n", "language": "Pascal", "metadata": {"date": 1577314118, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p02830.html", "problem_id": "p02830", "resource_group": "low_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/Pascal/s713578373.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s713578373", "user_id": "u684763923"}, "prompt_components": {"gold_output": "icpc\n", "input_to_evaluate": "uses crt;\nvar a,b:string;\n i,n:longint;\nbegin\n clrscr;\n readln(n);\n readln(a);\n for i:=1 to pos(' ',a) do\n begin\n b:=b+a[i];\n end;\n delete(a,1,n+1);\n for i:=1 to n do write(b[i],a[i]);\n readln;\nend.\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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 1, "memory_kb": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s668997973", "group_id": "codeNet:p02830", "input_text": "uses crt;\nvar a,b:string;\n i,n:longint;\nbegin\n clrscr;\n readln(n);\n readln(a);\n for i:=1 to pos(' ',a) do\n begin\n b:=b+a[i];\n end;\n delete(a,1,n+1);\n for i:=1 to length(b) do\n write(a[i],b[i]);\n readln\nend.\n\n\n", "language": "Pascal", "metadata": {"date": 1577313226, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p02830.html", "problem_id": "p02830", "resource_group": "low_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/Pascal/s668997973.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s668997973", "user_id": "u684763923"}, "prompt_components": {"gold_output": "icpc\n", "input_to_evaluate": "uses crt;\nvar a,b:string;\n i,n:longint;\nbegin\n clrscr;\n readln(n);\n readln(a);\n for i:=1 to pos(' ',a) do\n begin\n b:=b+a[i];\n end;\n delete(a,1,n+1);\n for i:=1 to length(b) do\n write(a[i],b[i]);\n readln\nend.\n\n\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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s671907099", "group_id": "codeNet:p02830", "input_text": "var i,n: integer; sum: string;\na,b: array[1..10000] of string;\nbegin\n\nreadln(n); sum:='';\nfor i:=1 to n do read(a[i]);\nfor i:=1 to n do read(b[i]);\nfor i:=1 to n do\nsum:=sum+a[i]+b[i];\nwrite(sum);\n\nend.", "language": "Pascal", "metadata": {"date": 1577312418, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p02830.html", "problem_id": "p02830", "resource_group": "low_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/Pascal/s671907099.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s671907099", "user_id": "u398406871"}, "prompt_components": {"gold_output": "icpc\n", "input_to_evaluate": "var i,n: integer; sum: string;\na,b: array[1..10000] of string;\nbegin\n\nreadln(n); sum:='';\nfor i:=1 to n do read(a[i]);\nfor i:=1 to n do read(b[i]);\nfor i:=1 to n do\nsum:=sum+a[i]+b[i];\nwrite(sum);\n\nend.", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 202, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s429656443", "group_id": "codeNet:p02831", "input_text": "uses crt;\nvar a,b:longint;\n i:int64;\nbegin\n clrscr;\n readln(a,b);\n i:=1;\n while (i mod a <>0)or(i mod b<>0)do\n begin\n if a div b >10 then i:=i+2 else \n inc(i);\n end;\n write(i);\n readln\nend.\n\n", "language": "Pascal", "metadata": {"date": 1577315607, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p02831.html", "problem_id": "p02831", "resource_group": "low_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/Pascal/s429656443.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s429656443", "user_id": "u684763923"}, "prompt_components": {"gold_output": "6\n", "input_to_evaluate": "uses crt;\nvar a,b:longint;\n i:int64;\nbegin\n clrscr;\n readln(a,b);\n i:=1;\n while (i mod a <>0)or(i mod b<>0)do\n begin\n if a div b >10 then i:=i+2 else \n inc(i);\n end;\n write(i);\n readln\nend.\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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 2103, "memory_kb": 128}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s521123915", "group_id": "codeNet:p02831", "input_text": "var a,b:longint;\ntmp:int64;\nbegin\n readln(a, b);\n if b>a then begin\n tmp:=a;\n a:=b;\n b:=a;\n end;\n tmp:=a;\n while true do begin\n tmp:=tmp+a;\n if tmp mod b = 0 then begin\n writeln(tmp);\n break;\n end;\n end;\nend.\n", "language": "Pascal", "metadata": {"date": 1577311682, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p02831.html", "problem_id": "p02831", "resource_group": "low_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/Pascal/s521123915.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s521123915", "user_id": "u635762866"}, "prompt_components": {"gold_output": "6\n", "input_to_evaluate": "var a,b:longint;\ntmp:int64;\nbegin\n readln(a, b);\n if b>a then begin\n tmp:=a;\n a:=b;\n b:=a;\n end;\n tmp:=a;\n while true do begin\n tmp:=tmp+a;\n if tmp mod b = 0 then begin\n writeln(tmp);\n break;\n end;\n end;\nend.\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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s334817818", "group_id": "codeNet:p02832", "input_text": "var n,k,i:longint;\n b:array[1..1000] of longint;\n f:text;\nbegin\nreadln(n);\nk:=1;\nfor i:=1 to n do\nread(b[i]);\nfor i:=1 to n do\nbegin\nif b[i]=k then inc(k);\nend;\nif k=1 then write('-1') else write(n-k+1);\nend.\n", "language": "Pascal", "metadata": {"date": 1577376892, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p02832.html", "problem_id": "p02832", "resource_group": "low_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/Pascal/s334817818.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s334817818", "user_id": "u497047145"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "var n,k,i:longint;\n b:array[1..1000] of longint;\n f:text;\nbegin\nreadln(n);\nk:=1;\nfor i:=1 to n do\nread(b[i]);\nfor i:=1 to n do\nbegin\nif b[i]=k then inc(k);\nend;\nif k=1 then write('-1') else write(n-k+1);\nend.\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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 99, "memory_kb": 128}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s144298385", "group_id": "codeNet:p02832", "input_text": "uses crt;\nvar n,d:longint;\n a:array[1..1000]of longint;\n i,j:integer;\nbegin\n clrscr;\n readln(n);\n for i:=1 to n do\n read(a[i]);\n for i:=1 to n-1 do\n if (a[i+1]-a[i]=1)and(a[i]-d=1)then inc(d);\n if (d<>0)then write(n-d)else write(d);\n readln;\n readln\nend.\n\n", "language": "Pascal", "metadata": {"date": 1577376713, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p02832.html", "problem_id": "p02832", "resource_group": "low_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/Pascal/s144298385.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s144298385", "user_id": "u684763923"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "uses crt;\nvar n,d:longint;\n a:array[1..1000]of longint;\n i,j:integer;\nbegin\n clrscr;\n readln(n);\n for i:=1 to n do\n read(a[i]);\n for i:=1 to n-1 do\n if (a[i+1]-a[i]=1)and(a[i]-d=1)then inc(d);\n if (d<>0)then write(n-d)else write(d);\n readln;\n readln\nend.\n\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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 98, "memory_kb": 128}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s062682359", "group_id": "codeNet:p02832", "input_text": "var\n d,n,i,min,tam:longint;\n a:array[1..200000] of longint;\n ok:boolean;\nbegin\n read(n);\n for i:=1 to n do read(a[i]);\n min:=a[1];\n for i:=1 to n do if a[i]min then ok:=true;\n if ok=false then\n begin\n write(-1);\n exit;\n end else\n for i:=1 to n do\n begin\n if (a[i]>min) and (min+1<>tam) then inc(d)\n else if a[i]<=min then begin min:=a[i]; inc(tam); end;\n end;\n if d>=0 then write(d);\nend.\n\n", "language": "Pascal", "metadata": {"date": 1577373344, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p02832.html", "problem_id": "p02832", "resource_group": "low_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/Pascal/s062682359.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s062682359", "user_id": "u344153701"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "var\n d,n,i,min,tam:longint;\n a:array[1..200000] of longint;\n ok:boolean;\nbegin\n read(n);\n for i:=1 to n do read(a[i]);\n min:=a[1];\n for i:=1 to n do if a[i]min then ok:=true;\n if ok=false then\n begin\n write(-1);\n exit;\n end else\n for i:=1 to n do\n begin\n if (a[i]>min) and (min+1<>tam) then inc(d)\n else if a[i]<=min then begin min:=a[i]; inc(tam); end;\n end;\n if d>=0 then write(d);\nend.\n\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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 621, "cpu_time_ms": 25, "memory_kb": 896}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s433877611", "group_id": "codeNet:p02832", "input_text": "uses crt;\nvar i,n,count,j: longint;\na: array[1..100] of integer;\nbegin\nclrscr;\nread(n);\nFOR i:=1 TO n do read(a[i]);\ni:=1; j:=1;\nwhile i<=n do\nbegin\nwhile (a[j]<>i) and (j<=n) do begin inc(count); inc(j); end;\ninc(j);\ninc(i);\nend;\nwrite(count);\nreadln;\nreadln;\nend.", "language": "Pascal", "metadata": {"date": 1577314533, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p02832.html", "problem_id": "p02832", "resource_group": "low_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/Pascal/s433877611.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s433877611", "user_id": "u398406871"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "uses crt;\nvar i,n,count,j: longint;\na: array[1..100] of integer;\nbegin\nclrscr;\nread(n);\nFOR i:=1 TO n do read(a[i]);\ni:=1; j:=1;\nwhile i<=n do\nbegin\nwhile (a[j]<>i) and (j<=n) do begin inc(count); inc(j); end;\ninc(j);\ninc(i);\nend;\nwrite(count);\nreadln;\nreadln;\nend.", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 96, "memory_kb": 128}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s891994909", "group_id": "codeNet:p02832", "input_text": "var i,n,c,kq:longint;\nbegin\n readln(n);\n c:=1;\n for n:=n-1 downto 0 do begin\n read(i);\n if i=c then inc(c) else inc(kq);\n end;\n if c=1 then writeln(-1) else writeln(kq);\nend.\n", "language": "Pascal", "metadata": {"date": 1577312353, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p02832.html", "problem_id": "p02832", "resource_group": "low_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/Pascal/s891994909.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s891994909", "user_id": "u635762866"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "var i,n,c,kq:longint;\nbegin\n readln(n);\n c:=1;\n for n:=n-1 downto 0 do begin\n read(i);\n if i=c then inc(c) else inc(kq);\n end;\n if c=1 then writeln(-1) else writeln(kq);\nend.\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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 24, "memory_kb": 128}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s409343821", "group_id": "codeNet:p02833", "input_text": "uses crt;\nvar count,b,n,i: longint;\nbegin\nclrscr;\nread(n);\nb:=n;\nrepeat\nfor i:=1 to b do\nif i mod 5 =0 then inc(count);\nb:=b div 5;\nuntil b<5;\nif n mod 2 = 0 then write(count div 2) else write('0');\nreadln;\nreadln;\nend.\n", "language": "Pascal", "metadata": {"date": 1577370603, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p02833.html", "problem_id": "p02833", "resource_group": "low_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/Pascal/s409343821.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s409343821", "user_id": "u398406871"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "uses crt;\nvar count,b,n,i: longint;\nbegin\nclrscr;\nread(n);\nb:=n;\nrepeat\nfor i:=1 to b do\nif i mod 5 =0 then inc(count);\nb:=b div 5;\nuntil b<5;\nif n mod 2 = 0 then write(count div 2) else write('0');\nreadln;\nreadln;\nend.\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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 2107, "memory_kb": 128}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s645240824", "group_id": "codeNet:p02837", "input_text": "var\n\tN,A,x,y,i,j,out,ans,nowt,nowf,ccc:Longint;\n\tF,T,gF,gT:Array[1..15]of Longint;\nprocedure dfs(id,nt,nf:Longint);\nvar\ncnt,i:Longint;\nbegin\n\tif id=N+1 then begin\n\t\tcnt:=0;\n\t\tfor i:=1 to N do if((nt>>(i-1))and 1)=1 then inc(cnt);\n\t\tif ans>(id-1))and 1)=0)and(((nf or gF[id])and(nt or gT[id]))=0)then dfs(id+1,nt or gT[id],nf or gF[id]);\n\t\tdfs(id+1,nt,nf);\n\tend;\nend;\nbegin\n\tread(N);\n\tfor i:=1 to N do begin\n\t\tread(A);\n\t\tfor j:=1 to A do begin\n\t\t\tread(x,y);\n\t\t\tdec(x);\n\t\t\tif y=0 then F[i]:=F[i] or (1<>(j-1))and 1)=1 then begin\n\t\t\t\t\tnowt:=nowt or T[j];\n\t\t\t\t\tnowf:=nowf or F[j];\n\t\t\t\tend;\n\t\t\tend;\n\t\tend;\n\t\tgF[i]:=nowf;\n\t\tgT[i]:=nowt;\n\tend;\n\tdfs(1,0,0);\n\twriteln(ans);\nend.", "language": "Pascal", "metadata": {"date": 1575865989, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p02837.html", "problem_id": "p02837", "resource_group": "low_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/Pascal/s645240824.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s645240824", "user_id": "u657913472"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "var\n\tN,A,x,y,i,j,out,ans,nowt,nowf,ccc:Longint;\n\tF,T,gF,gT:Array[1..15]of Longint;\nprocedure dfs(id,nt,nf:Longint);\nvar\ncnt,i:Longint;\nbegin\n\tif id=N+1 then begin\n\t\tcnt:=0;\n\t\tfor i:=1 to N do if((nt>>(i-1))and 1)=1 then inc(cnt);\n\t\tif ans>(id-1))and 1)=0)and(((nf or gF[id])and(nt or gT[id]))=0)then dfs(id+1,nt or gT[id],nf or gF[id]);\n\t\tdfs(id+1,nt,nf);\n\tend;\nend;\nbegin\n\tread(N);\n\tfor i:=1 to N do begin\n\t\tread(A);\n\t\tfor j:=1 to A do begin\n\t\t\tread(x,y);\n\t\t\tdec(x);\n\t\t\tif y=0 then F[i]:=F[i] or (1<>(j-1))and 1)=1 then begin\n\t\t\t\t\tnowt:=nowt or T[j];\n\t\t\t\t\tnowf:=nowf or F[j];\n\t\t\t\tend;\n\t\t\tend;\n\t\tend;\n\t\tgF[i]:=nowf;\n\t\tgT[i]:=nowt;\n\tend;\n\tdfs(1,0,0);\n\twriteln(ans);\nend.", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 2, "memory_kb": 128}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s384299472", "group_id": "codeNet:p02837", "input_text": "type xy = record x,y:int64; \n end;\n p = record a:int64;\n t:array[1..20] of xy;\n end;\nvar i,j,l,maker,power,ans,n:int64;\n people:array[1..20] of p;\n check:array[1..20] of int64;\n flag :boolean;\n \nfunction power2(q:int64):int64;\nvar po,k:int64;\nbegin\n po:=1;\n for k := 1 to q do po := po *2;\n power2 := po\nend;\n\nbegin\nread(n);\nfor i := 1 to n do\n begin\n read(people[i].a);\n for j := 1 to people[i].a do read(people[i].t[j].x,people[i].t[j].y)\n end;\n\npower := power2(n);\nfor i := 0 to power-1 do\n begin\n maker := i;\n for j := 1 to n do\n begin \n if odd(maker) then check[j] := 1\n else check[j]:=0;\n maker := maker >> 1\n end;\n for j := 1 to n do\n begin \n flag := true;\n if (check[j] = 1) then\n begin\n for l := 1 to people[j].a do \n if check[people[j].t[l].x] <> people[j].t[l].y then \n begin\n flag := false;\n break\n end\n end\n else \n begin\n for l := 1 to people[j].a do \n if check[people[j].t[l].x] = people[j].t[l].y then \n begin\n flag := false;\n break;\n end\n end;\n if not (flag) then break;\n end;\n \n if flag then break;\n end;\n\nans:=0;\nif flag then\n begin\n for i := 1 to n do\n if check[i] = 1 then inc(ans)\n end\nelse ans := 0;\n\nwrite(ans)\n\nend.", "language": "Pascal", "metadata": {"date": 1575862773, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p02837.html", "problem_id": "p02837", "resource_group": "low_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/Pascal/s384299472.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s384299472", "user_id": "u655683235"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "type xy = record x,y:int64; \n end;\n p = record a:int64;\n t:array[1..20] of xy;\n end;\nvar i,j,l,maker,power,ans,n:int64;\n people:array[1..20] of p;\n check:array[1..20] of int64;\n flag :boolean;\n \nfunction power2(q:int64):int64;\nvar po,k:int64;\nbegin\n po:=1;\n for k := 1 to q do po := po *2;\n power2 := po\nend;\n\nbegin\nread(n);\nfor i := 1 to n do\n begin\n read(people[i].a);\n for j := 1 to people[i].a do read(people[i].t[j].x,people[i].t[j].y)\n end;\n\npower := power2(n);\nfor i := 0 to power-1 do\n begin\n maker := i;\n for j := 1 to n do\n begin \n if odd(maker) then check[j] := 1\n else check[j]:=0;\n maker := maker >> 1\n end;\n for j := 1 to n do\n begin \n flag := true;\n if (check[j] = 1) then\n begin\n for l := 1 to people[j].a do \n if check[people[j].t[l].x] <> people[j].t[l].y then \n begin\n flag := false;\n break\n end\n end\n else \n begin\n for l := 1 to people[j].a do \n if check[people[j].t[l].x] = people[j].t[l].y then \n begin\n flag := false;\n break;\n end\n end;\n if not (flag) then break;\n end;\n \n if flag then break;\n end;\n\nans:=0;\nif flag then\n begin\n for i := 1 to n do\n if check[i] = 1 then inc(ans)\n end\nelse ans := 0;\n\nwrite(ans)\n\nend.", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1336, "cpu_time_ms": 4, "memory_kb": 128}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s768380540", "group_id": "codeNet:p02837", "input_text": "var\n a, now: array [1..15] of longint;\n p, s: array [1..15, 1..14] of longint;\n n, i, j, cnt, ans: longint;\nfunction max(x, y: longint): longint; inline;\nbegin\n if x > y then exit(x) else exit(y);\nend;\nfunction check: boolean; inline;\nvar\n i, j, unkind: longint;\nbegin\n for i := 1 to n do\n begin\n unkind := 1;\n for j := 1 to a[i] do\n if now[p[i, j]] <> s[i, j] then\n begin\n unkind := 0;\n break;\n end;\n if now[i] <> unkind then exit(false);\n end;\n exit(true);\nend;\nprocedure dfs(d: longint);\nbegin\n if d = n + 1 then\n begin\n if check then ans := max(ans, cnt);\n exit;\n end;\n now[d] := 0;\n dfs(d + 1);\n now[d] := 1;\n inc(cnt);\n dfs(d + 1);\n dec(cnt);\nend;\nbegin\n read(n);\n for i := 1 to n do\n begin\n read(a[i]);\n for j := 1 to a[i] do read(p[i, j], s[i, j]);\n end;\n dfs(1);\n writeln(ans);\nend.\n", "language": "Pascal", "metadata": {"date": 1575857742, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p02837.html", "problem_id": "p02837", "resource_group": "low_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/Pascal/s768380540.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s768380540", "user_id": "u214724132"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "var\n a, now: array [1..15] of longint;\n p, s: array [1..15, 1..14] of longint;\n n, i, j, cnt, ans: longint;\nfunction max(x, y: longint): longint; inline;\nbegin\n if x > y then exit(x) else exit(y);\nend;\nfunction check: boolean; inline;\nvar\n i, j, unkind: longint;\nbegin\n for i := 1 to n do\n begin\n unkind := 1;\n for j := 1 to a[i] do\n if now[p[i, j]] <> s[i, j] then\n begin\n unkind := 0;\n break;\n end;\n if now[i] <> unkind then exit(false);\n end;\n exit(true);\nend;\nprocedure dfs(d: longint);\nbegin\n if d = n + 1 then\n begin\n if check then ans := max(ans, cnt);\n exit;\n end;\n now[d] := 0;\n dfs(d + 1);\n now[d] := 1;\n inc(cnt);\n dfs(d + 1);\n dec(cnt);\nend;\nbegin\n read(n);\n for i := 1 to n do\n begin\n read(a[i]);\n for j := 1 to a[i] do read(p[i, j], s[i, j]);\n end;\n dfs(1);\n writeln(ans);\nend.\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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 866, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s564196046", "group_id": "codeNet:p02838", "input_text": "const p = 1000000007;\nvar\n a: array [1..300000] of int64;\n n, i, j, s, ans: longint;\nfunction add(x, y: longint): longint; inline;\nbegin\n inc(x, y);\n if x >= p then dec(x, p);\n exit(x);\nend;\nfunction mul(x, y: longint): longint; inline;\nbegin\n exit(int64(x) * y mod p);\nend;\nbegin\n read(n);\n for i := 1 to n do read(a[i]);\n for i := 0 to 59 do\n begin\n s := 0;\n for j := 1 to n do inc(s, (a[j] shr i) and 1);\n ans := add(ans, mul(mul(s, n - s), int64(1) shl i mod p));\n end;\n writeln(ans);\nend.", "language": "Pascal", "metadata": {"date": 1581515783, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p02838.html", "problem_id": "p02838", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02838/input.txt", "sample_output_relpath": "derived/input_output/data/p02838/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02838/Pascal/s564196046.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s564196046", "user_id": "u214724132"}, "prompt_components": {"gold_output": "6\n", "input_to_evaluate": "const p = 1000000007;\nvar\n a: array [1..300000] of int64;\n n, i, j, s, ans: longint;\nfunction add(x, y: longint): longint; inline;\nbegin\n inc(x, y);\n if x >= p then dec(x, p);\n exit(x);\nend;\nfunction mul(x, y: longint): longint; inline;\nbegin\n exit(int64(x) * y mod p);\nend;\nbegin\n read(n);\n for i := 1 to n do read(a[i]);\n for i := 0 to 59 do\n begin\n s := 0;\n for j := 1 to n do inc(s, (a[j] shr i) and 1);\n ans := add(ans, mul(mul(s, n - s), int64(1) shl i mod p));\n end;\n writeln(ans);\nend.", "problem_context": "Score : 400 points\n\nProblem Statement\n\nWe have N integers. The i-th integer is A_i.\n\nFind \\sum_{i=1}^{N-1}\\sum_{j=i+1}^{N} (A_i \\mbox{ XOR } A_j), modulo (10^9+7).\n\nWhat is \\mbox{ XOR }?\n\nThe XOR of integers A and B, A \\mbox{ XOR } B, is defined as follows:\n\nWhen A \\mbox{ XOR } B is written in base two, the digit in the 2^k's place (k \\geq 0) is 1 if either A or B, but not both, has 1 in the 2^k's place, and 0 otherwise.\n\nFor example, 3 \\mbox{ XOR } 5 = 6. (In base two: 011 \\mbox{ XOR } 101 = 110.)\n\nConstraints\n\n2 \\leq N \\leq 3 \\times 10^5\n\n0 \\leq A_i < 2^{60}\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the value \\sum_{i=1}^{N-1}\\sum_{j=i+1}^{N} (A_i \\mbox{ XOR } A_j), modulo (10^9+7).\n\nSample Input 1\n\n3\n1 2 3\n\nSample Output 1\n\n6\n\nWe have (1\\mbox{ XOR } 2)+(1\\mbox{ XOR } 3)+(2\\mbox{ XOR } 3)=3+2+1=6.\n\nSample Input 2\n\n10\n3 1 4 1 5 9 2 6 5 3\n\nSample Output 2\n\n237\n\nSample Input 3\n\n10\n3 14 159 2653 58979 323846 2643383 27950288 419716939 9375105820\n\nSample Output 3\n\n103715602\n\nPrint the sum modulo (10^9+7).", "sample_input": "3\n1 2 3\n"}, "reference_outputs": ["6\n"], "source_document_id": "p02838", "source_text": "Score : 400 points\n\nProblem Statement\n\nWe have N integers. The i-th integer is A_i.\n\nFind \\sum_{i=1}^{N-1}\\sum_{j=i+1}^{N} (A_i \\mbox{ XOR } A_j), modulo (10^9+7).\n\nWhat is \\mbox{ XOR }?\n\nThe XOR of integers A and B, A \\mbox{ XOR } B, is defined as follows:\n\nWhen A \\mbox{ XOR } B is written in base two, the digit in the 2^k's place (k \\geq 0) is 1 if either A or B, but not both, has 1 in the 2^k's place, and 0 otherwise.\n\nFor example, 3 \\mbox{ XOR } 5 = 6. (In base two: 011 \\mbox{ XOR } 101 = 110.)\n\nConstraints\n\n2 \\leq N \\leq 3 \\times 10^5\n\n0 \\leq A_i < 2^{60}\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the value \\sum_{i=1}^{N-1}\\sum_{j=i+1}^{N} (A_i \\mbox{ XOR } A_j), modulo (10^9+7).\n\nSample Input 1\n\n3\n1 2 3\n\nSample Output 1\n\n6\n\nWe have (1\\mbox{ XOR } 2)+(1\\mbox{ XOR } 3)+(2\\mbox{ XOR } 3)=3+2+1=6.\n\nSample Input 2\n\n10\n3 1 4 1 5 9 2 6 5 3\n\nSample Output 2\n\n237\n\nSample Input 3\n\n10\n3 14 159 2653 58979 323846 2643383 27950288 419716939 9375105820\n\nSample Output 3\n\n103715602\n\nPrint the sum modulo (10^9+7).", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 118, "memory_kb": 2432}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s516579121", "group_id": "codeNet:p02842", "input_text": "Var n,i:Longint;\n OK:Boolean;\nBegin\n Readln(n); OK:=True;\n For i:=1 to n do \n If trunc(i*1.08)=n then begin\n Writeln(i); OK:=False; Break;\n End;\n If OK then writeln(':(');\nEnd.", "language": "Pascal", "metadata": {"date": 1575252505, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p02842.html", "problem_id": "p02842", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02842/input.txt", "sample_output_relpath": "derived/input_output/data/p02842/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02842/Pascal/s516579121.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s516579121", "user_id": "u866155170"}, "prompt_components": {"gold_output": "400\n", "input_to_evaluate": "Var n,i:Longint;\n OK:Boolean;\nBegin\n Readln(n); OK:=True;\n For i:=1 to n do \n If trunc(i*1.08)=n then begin\n Writeln(i); OK:=False; Break;\n End;\n If OK then writeln(':(');\nEnd.", "problem_context": "Score: 200 points\n\nProblem Statement\n\nTakahashi bought a piece of apple pie at ABC Confiserie. According to his memory, he paid N yen (the currency of Japan) for it.\n\nThe consumption tax rate for foods in this shop is 8 percent. That is, to buy an apple pie priced at X yen before tax, you have to pay X \\times 1.08 yen (rounded down to the nearest integer).\n\nTakahashi forgot the price of his apple pie before tax, X, and wants to know it again. Write a program that takes N as input and finds X. We assume X is an integer.\n\nIf there are multiple possible values for X, find any one of them. Also, Takahashi's memory of N, the amount he paid, may be incorrect. If no value could be X, report that fact.\n\nConstraints\n\n1 \\leq N \\leq 50000\n\nN is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nIf there are values that could be X, the price of the apple pie before tax, print any one of them.\n\nIf there are multiple such values, printing any one of them will be accepted.\n\nIf no value could be X, print :(.\n\nSample Input 1\n\n432\n\nSample Output 1\n\n400\n\nIf the apple pie is priced at 400 yen before tax, you have to pay 400 \\times 1.08 = 432 yen to buy one.\n\nOtherwise, the amount you have to pay will not be 432 yen.\n\nSample Input 2\n\n1079\n\nSample Output 2\n\n:(\n\nThere is no possible price before tax for which you have to pay 1079 yen with tax.\n\nSample Input 3\n\n1001\n\nSample Output 3\n\n927\n\nIf the apple pie is priced 927 yen before tax, by rounding down 927 \\times 1.08 = 1001.16, you have to pay 1001 yen.", "sample_input": "432\n"}, "reference_outputs": ["400\n"], "source_document_id": "p02842", "source_text": "Score: 200 points\n\nProblem Statement\n\nTakahashi bought a piece of apple pie at ABC Confiserie. According to his memory, he paid N yen (the currency of Japan) for it.\n\nThe consumption tax rate for foods in this shop is 8 percent. That is, to buy an apple pie priced at X yen before tax, you have to pay X \\times 1.08 yen (rounded down to the nearest integer).\n\nTakahashi forgot the price of his apple pie before tax, X, and wants to know it again. Write a program that takes N as input and finds X. We assume X is an integer.\n\nIf there are multiple possible values for X, find any one of them. Also, Takahashi's memory of N, the amount he paid, may be incorrect. If no value could be X, report that fact.\n\nConstraints\n\n1 \\leq N \\leq 50000\n\nN is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nIf there are values that could be X, the price of the apple pie before tax, print any one of them.\n\nIf there are multiple such values, printing any one of them will be accepted.\n\nIf no value could be X, print :(.\n\nSample Input 1\n\n432\n\nSample Output 1\n\n400\n\nIf the apple pie is priced at 400 yen before tax, you have to pay 400 \\times 1.08 = 432 yen to buy one.\n\nOtherwise, the amount you have to pay will not be 432 yen.\n\nSample Input 2\n\n1079\n\nSample Output 2\n\n:(\n\nThere is no possible price before tax for which you have to pay 1079 yen with tax.\n\nSample Input 3\n\n1001\n\nSample Output 3\n\n927\n\nIf the apple pie is priced 927 yen before tax, by rounding down 927 \\times 1.08 = 1001.16, you have to pay 1001 yen.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s425760713", "group_id": "codeNet:p02842", "input_text": "Var n,i:Longint;\nBegin\n Readln(n);\n For i:=1 to n do \n If trunc(i*1.08)=n then begin\n Writeln(i); Break;\n End;\nEnd.", "language": "Pascal", "metadata": {"date": 1575252374, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p02842.html", "problem_id": "p02842", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02842/input.txt", "sample_output_relpath": "derived/input_output/data/p02842/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02842/Pascal/s425760713.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s425760713", "user_id": "u866155170"}, "prompt_components": {"gold_output": "400\n", "input_to_evaluate": "Var n,i:Longint;\nBegin\n Readln(n);\n For i:=1 to n do \n If trunc(i*1.08)=n then begin\n Writeln(i); Break;\n End;\nEnd.", "problem_context": "Score: 200 points\n\nProblem Statement\n\nTakahashi bought a piece of apple pie at ABC Confiserie. According to his memory, he paid N yen (the currency of Japan) for it.\n\nThe consumption tax rate for foods in this shop is 8 percent. That is, to buy an apple pie priced at X yen before tax, you have to pay X \\times 1.08 yen (rounded down to the nearest integer).\n\nTakahashi forgot the price of his apple pie before tax, X, and wants to know it again. Write a program that takes N as input and finds X. We assume X is an integer.\n\nIf there are multiple possible values for X, find any one of them. Also, Takahashi's memory of N, the amount he paid, may be incorrect. If no value could be X, report that fact.\n\nConstraints\n\n1 \\leq N \\leq 50000\n\nN is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nIf there are values that could be X, the price of the apple pie before tax, print any one of them.\n\nIf there are multiple such values, printing any one of them will be accepted.\n\nIf no value could be X, print :(.\n\nSample Input 1\n\n432\n\nSample Output 1\n\n400\n\nIf the apple pie is priced at 400 yen before tax, you have to pay 400 \\times 1.08 = 432 yen to buy one.\n\nOtherwise, the amount you have to pay will not be 432 yen.\n\nSample Input 2\n\n1079\n\nSample Output 2\n\n:(\n\nThere is no possible price before tax for which you have to pay 1079 yen with tax.\n\nSample Input 3\n\n1001\n\nSample Output 3\n\n927\n\nIf the apple pie is priced 927 yen before tax, by rounding down 927 \\times 1.08 = 1001.16, you have to pay 1001 yen.", "sample_input": "432\n"}, "reference_outputs": ["400\n"], "source_document_id": "p02842", "source_text": "Score: 200 points\n\nProblem Statement\n\nTakahashi bought a piece of apple pie at ABC Confiserie. According to his memory, he paid N yen (the currency of Japan) for it.\n\nThe consumption tax rate for foods in this shop is 8 percent. That is, to buy an apple pie priced at X yen before tax, you have to pay X \\times 1.08 yen (rounded down to the nearest integer).\n\nTakahashi forgot the price of his apple pie before tax, X, and wants to know it again. Write a program that takes N as input and finds X. We assume X is an integer.\n\nIf there are multiple possible values for X, find any one of them. Also, Takahashi's memory of N, the amount he paid, may be incorrect. If no value could be X, report that fact.\n\nConstraints\n\n1 \\leq N \\leq 50000\n\nN is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nIf there are values that could be X, the price of the apple pie before tax, print any one of them.\n\nIf there are multiple such values, printing any one of them will be accepted.\n\nIf no value could be X, print :(.\n\nSample Input 1\n\n432\n\nSample Output 1\n\n400\n\nIf the apple pie is priced at 400 yen before tax, you have to pay 400 \\times 1.08 = 432 yen to buy one.\n\nOtherwise, the amount you have to pay will not be 432 yen.\n\nSample Input 2\n\n1079\n\nSample Output 2\n\n:(\n\nThere is no possible price before tax for which you have to pay 1079 yen with tax.\n\nSample Input 3\n\n1001\n\nSample Output 3\n\n927\n\nIf the apple pie is priced 927 yen before tax, by rounding down 927 \\times 1.08 = 1001.16, you have to pay 1001 yen.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s918957319", "group_id": "codeNet:p02844", "input_text": "type sTot = record flag:boolean;\n third:array[0..9] of boolean;\n end;\n fTos = record flag:boolean;\n second:array[0..9] of sTot;\n end;\nvar n,i,j,k,l,t,sum:int64;\n s:string;\n first:array[0..9] of fTos;\nbegin\nreadln(n);\nread(s);\nsum:=0;\nfor i := 0 to 9 do first[i].flag:=false;\nfor i := 1 to n do\n begin\n t:=ord(s[i])-48;\n for j :=0 to 9 do \n if first[j].flag then\n begin\n for k :=0 to 9 do \n if first[j].second[k].flag then \n begin\n for l := 0 to 9 do\n if not(first[j].second[k].third[t]) then\n begin\n first[j].second[k].third[t]:=true;\n inc(sum)\n end; \n end;\n if not(first[j].second[t].flag) then \n begin\n first[j].second[t].flag:=true;\n for k := 0 to 9 do first[j].second[t].third[k]:=false\n end;\n end;\n if not(first[t].flag) then \n begin\n first[t].flag:=true;\n for j := 0 to 9 do first[t].second[j].flag:=false\n end;\n end;\n \n write(sum);\nend.", "language": "Pascal", "metadata": {"date": 1575257445, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p02844.html", "problem_id": "p02844", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02844/input.txt", "sample_output_relpath": "derived/input_output/data/p02844/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02844/Pascal/s918957319.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s918957319", "user_id": "u655683235"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "type sTot = record flag:boolean;\n third:array[0..9] of boolean;\n end;\n fTos = record flag:boolean;\n second:array[0..9] of sTot;\n end;\nvar n,i,j,k,l,t,sum:int64;\n s:string;\n first:array[0..9] of fTos;\nbegin\nreadln(n);\nread(s);\nsum:=0;\nfor i := 0 to 9 do first[i].flag:=false;\nfor i := 1 to n do\n begin\n t:=ord(s[i])-48;\n for j :=0 to 9 do \n if first[j].flag then\n begin\n for k :=0 to 9 do \n if first[j].second[k].flag then \n begin\n for l := 0 to 9 do\n if not(first[j].second[k].third[t]) then\n begin\n first[j].second[k].third[t]:=true;\n inc(sum)\n end; \n end;\n if not(first[j].second[t].flag) then \n begin\n first[j].second[t].flag:=true;\n for k := 0 to 9 do first[j].second[t].third[k]:=false\n end;\n end;\n if not(first[t].flag) then \n begin\n first[t].flag:=true;\n for j := 0 to 9 do first[t].second[j].flag:=false\n end;\n end;\n \n write(sum);\nend.", "problem_context": "Score: 400 points\n\nProblem Statement\n\nAtCoder Inc. has decided to lock the door of its office with a 3-digit PIN code.\n\nThe company has an N-digit lucky number, S. Takahashi, the president, will erase N-3 digits from S and concatenate the remaining 3 digits without changing the order to set the PIN code.\n\nHow many different PIN codes can he set this way?\n\nBoth the lucky number and the PIN code may begin with a 0.\n\nConstraints\n\n4 \\leq N \\leq 30000\n\nS is a string of length N consisting of digits.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS\n\nOutput\n\nPrint the number of different PIN codes Takahashi can set.\n\nSample Input 1\n\n4\n0224\n\nSample Output 1\n\n3\n\nTakahashi has the following options:\n\nErase the first digit of S and set 224.\n\nErase the second digit of S and set 024.\n\nErase the third digit of S and set 024.\n\nErase the fourth digit of S and set 022.\n\nThus, he can set three different PIN codes: 022, 024, and 224.\n\nSample Input 2\n\n6\n123123\n\nSample Output 2\n\n17\n\nSample Input 3\n\n19\n3141592653589793238\n\nSample Output 3\n\n329", "sample_input": "4\n0224\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02844", "source_text": "Score: 400 points\n\nProblem Statement\n\nAtCoder Inc. has decided to lock the door of its office with a 3-digit PIN code.\n\nThe company has an N-digit lucky number, S. Takahashi, the president, will erase N-3 digits from S and concatenate the remaining 3 digits without changing the order to set the PIN code.\n\nHow many different PIN codes can he set this way?\n\nBoth the lucky number and the PIN code may begin with a 0.\n\nConstraints\n\n4 \\leq N \\leq 30000\n\nS is a string of length N consisting of digits.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS\n\nOutput\n\nPrint the number of different PIN codes Takahashi can set.\n\nSample Input 1\n\n4\n0224\n\nSample Output 1\n\n3\n\nTakahashi has the following options:\n\nErase the first digit of S and set 224.\n\nErase the second digit of S and set 024.\n\nErase the third digit of S and set 024.\n\nErase the fourth digit of S and set 022.\n\nThus, he can set three different PIN codes: 022, 024, and 224.\n\nSample Input 2\n\n6\n123123\n\nSample Output 2\n\n17\n\nSample Input 3\n\n19\n3141592653589793238\n\nSample Output 3\n\n329", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1056, "cpu_time_ms": 53, "memory_kb": 128}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s764081745", "group_id": "codeNet:p02848", "input_text": "var n,i:int64;\n c:char;\nbegin\nreadln(n);\n\nwhile true do\n begin\n read(c);\n if (ord(c)<65) or (ord(c)>90) then break;\n if ord(c)+n>90 then write(chr(ord(c)+n-26))\n else write(chr(ord(c)+n));\n end;\n \nend.", "language": "Pascal", "metadata": {"date": 1574649598, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p02848.html", "problem_id": "p02848", "resource_group": "low_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/Pascal/s764081745.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s764081745", "user_id": "u655683235"}, "prompt_components": {"gold_output": "CDEZAB\n", "input_to_evaluate": "var n,i:int64;\n c:char;\nbegin\nreadln(n);\n\nwhile true do\n begin\n read(c);\n if (ord(c)<65) or (ord(c)>90) then break;\n if ord(c)+n>90 then write(chr(ord(c)+n-26))\n else write(chr(ord(c)+n));\n end;\n \nend.", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s855238857", "group_id": "codeNet:p02848", "input_text": "var i,n:Longint;s:String;\nbegin\nreadln(n);\nreadln(s);\nfor i:=1 to length(s)do begin\n\twrite(chr((ord(s[i])-65+n)mod 26+65));\nend;\nwriteln;\nend.", "language": "Pascal", "metadata": {"date": 1574647582, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p02848.html", "problem_id": "p02848", "resource_group": "low_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/Pascal/s855238857.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s855238857", "user_id": "u657913472"}, "prompt_components": {"gold_output": "CDEZAB\n", "input_to_evaluate": "var i,n:Longint;s:String;\nbegin\nreadln(n);\nreadln(s);\nfor i:=1 to length(s)do begin\n\twrite(chr((ord(s[i])-65+n)mod 26+65));\nend;\nwriteln;\nend.", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s151491321", "group_id": "codeNet:p02848", "input_text": "var\n n, i: longint;\n s: ansistring;\nfunction c2n(c: char): longint; inline;\nbegin\n exit(ord(c) - ord('A'));\nend;\nfunction n2c(n: longint): char; inline;\nbegin\n exit(chr(n + ord('A')));\nend;\nbegin\n readln(n);\n readln(s);\n for i := 1 to length(s) do s[i] := n2c((c2n(s[i]) + n) mod 26);\n writeln(s);\nend.\n", "language": "Pascal", "metadata": {"date": 1574647522, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p02848.html", "problem_id": "p02848", "resource_group": "low_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/Pascal/s151491321.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s151491321", "user_id": "u214724132"}, "prompt_components": {"gold_output": "CDEZAB\n", "input_to_evaluate": "var\n n, i: longint;\n s: ansistring;\nfunction c2n(c: char): longint; inline;\nbegin\n exit(ord(c) - ord('A'));\nend;\nfunction n2c(n: longint): char; inline;\nbegin\n exit(chr(n + ord('A')));\nend;\nbegin\n readln(n);\n readln(s);\n for i := 1 to length(s) do s[i] := n2c((c2n(s[i]) + n) mod 26);\n writeln(s);\nend.\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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 311, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s589357415", "group_id": "codeNet:p02851", "input_text": "var n,k,i,j,l,a1,sum,store:int64;\n a:array [1..200050] of int64;\nbegin\nread(n,k);\nsum:=0;\nfor i := 1 to n do \n begin \n read(a1);\n a[i]:= a1 mod k;\n if a[i] = 1 then inc(sum);\n end;\n\nfor i := 1 to n-1 do\n begin\n store:=a[i];\n for j := 1 to k-2 do \n begin \n if i+j>n then break;\n store:=(store+a[i+j]) mod k;\n if store=j+1 then inc(sum);\n end;\n end;\nwrite(sum)\nend.", "language": "Pascal", "metadata": {"date": 1574652046, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p02851.html", "problem_id": "p02851", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02851/input.txt", "sample_output_relpath": "derived/input_output/data/p02851/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02851/Pascal/s589357415.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s589357415", "user_id": "u655683235"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "var n,k,i,j,l,a1,sum,store:int64;\n a:array [1..200050] of int64;\nbegin\nread(n,k);\nsum:=0;\nfor i := 1 to n do \n begin \n read(a1);\n a[i]:= a1 mod k;\n if a[i] = 1 then inc(sum);\n end;\n\nfor i := 1 to n-1 do\n begin\n store:=a[i];\n for j := 1 to k-2 do \n begin \n if i+j>n then break;\n store:=(store+a[i+j]) mod k;\n if store=j+1 then inc(sum);\n end;\n end;\nwrite(sum)\nend.", "problem_context": "Score : 500 points\n\nProblem Statement\n\nGiven are a sequence of N positive integers A_1, A_2, \\ldots, A_N, and a positive integer K.\n\nFind the number of non-empty contiguous subsequences in A such that the remainder when dividing the sum of its elements by K is equal to the number of its elements. We consider two subsequences different if they are taken from different positions, even if they are equal sequences.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 2\\times 10^5\n\n1 \\leq K \\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 K\nA_1 A_2 \\cdots A_N\n\nOutput\n\nPrint the number of subsequences that satisfy the condition.\n\nSample Input 1\n\n5 4\n1 4 2 3 5\n\nSample Output 1\n\n4\n\nFour sequences satisfy the condition: (1), (4,2), (1,4,2), and (5).\n\nSample Input 2\n\n8 4\n4 2 4 2 4 2 4 2\n\nSample Output 2\n\n7\n\n(4,2) is counted four times, and (2,4) is counted three times.\n\nSample Input 3\n\n10 7\n14 15 92 65 35 89 79 32 38 46\n\nSample Output 3\n\n8", "sample_input": "5 4\n1 4 2 3 5\n"}, "reference_outputs": ["4\n"], "source_document_id": "p02851", "source_text": "Score : 500 points\n\nProblem Statement\n\nGiven are a sequence of N positive integers A_1, A_2, \\ldots, A_N, and a positive integer K.\n\nFind the number of non-empty contiguous subsequences in A such that the remainder when dividing the sum of its elements by K is equal to the number of its elements. We consider two subsequences different if they are taken from different positions, even if they are equal sequences.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 2\\times 10^5\n\n1 \\leq K \\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 K\nA_1 A_2 \\cdots A_N\n\nOutput\n\nPrint the number of subsequences that satisfy the condition.\n\nSample Input 1\n\n5 4\n1 4 2 3 5\n\nSample Output 1\n\n4\n\nFour sequences satisfy the condition: (1), (4,2), (1,4,2), and (5).\n\nSample Input 2\n\n8 4\n4 2 4 2 4 2 4 2\n\nSample Output 2\n\n7\n\n(4,2) is counted four times, and (2,4) is counted three times.\n\nSample Input 3\n\n10 7\n14 15 92 65 35 89 79 32 38 46\n\nSample Output 3\n\n8", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 1664}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s697553417", "group_id": "codeNet:p02854", "input_text": "var\n s: array [0..200000] of int64;\n n, i: longint;\n x, ans: int64;\nfunction min(x, y: int64): int64; inline;\nbegin\n if x < y then exit(x) else exit(y);\nend;\nbegin\n read(n);\n for i := 1 to n do\n begin\n read(x);\n s[i] := s[i - 1] + x;\n end;\n ans := 1000000000000000000;\n for i := 1 to n - 1 do ans := min(ans, abs(s[i] shl 1 - s[n]));\n writeln(ans);\nend.\n", "language": "Pascal", "metadata": {"date": 1581517062, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p02854.html", "problem_id": "p02854", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02854/input.txt", "sample_output_relpath": "derived/input_output/data/p02854/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02854/Pascal/s697553417.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s697553417", "user_id": "u214724132"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "var\n s: array [0..200000] of int64;\n n, i: longint;\n x, ans: int64;\nfunction min(x, y: int64): int64; inline;\nbegin\n if x < y then exit(x) else exit(y);\nend;\nbegin\n read(n);\n for i := 1 to n do\n begin\n read(x);\n s[i] := s[i - 1] + x;\n end;\n ans := 1000000000000000000;\n for i := 1 to n - 1 do ans := min(ans, abs(s[i] shl 1 - s[n]));\n writeln(ans);\nend.\n", "problem_context": "Score: 200 points\n\nProblem Statement\n\nTakahashi, who works at DISCO, is standing before an iron bar.\nThe bar has N-1 notches, which divide the bar into N sections. The i-th section from the left has a length of A_i millimeters.\n\nTakahashi wanted to choose a notch and cut the bar at that point into two parts with the same length.\nHowever, this may not be possible as is, so he will do the following operations some number of times before he does the cut:\n\nChoose one section and expand it, increasing its length by 1 millimeter. Doing this operation once costs 1 yen (the currency of Japan).\n\nChoose one section of length at least 2 millimeters and shrink it, decreasing its length by 1 millimeter. Doing this operation once costs 1 yen.\n\nFind the minimum amount of money needed before cutting the bar into two parts with the same length.\n\nConstraints\n\n2 \\leq N \\leq 200000\n\n1 \\leq A_i \\leq 2020202020\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 A_3 ... A_N\n\nOutput\n\nPrint an integer representing the minimum amount of money needed before cutting the bar into two parts with the same length.\n\nSample Input 1\n\n3\n2 4 3\n\nSample Output 1\n\n3\n\nThe initial lengths of the sections are [2, 4, 3] (in millimeters). Takahashi can cut the bar equally after doing the following operations for 3 yen:\n\nShrink the second section from the left. The lengths of the sections are now [2, 3, 3].\n\nShrink the first section from the left. The lengths of the sections are now [1, 3, 3].\n\nShrink the second section from the left. The lengths of the sections are now [1, 2, 3], and we can cut the bar at the second notch from the left into two parts of length 3 each.\n\nSample Input 2\n\n12\n100 104 102 105 103 103 101 105 104 102 104 101\n\nSample Output 2\n\n0", "sample_input": "3\n2 4 3\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02854", "source_text": "Score: 200 points\n\nProblem Statement\n\nTakahashi, who works at DISCO, is standing before an iron bar.\nThe bar has N-1 notches, which divide the bar into N sections. The i-th section from the left has a length of A_i millimeters.\n\nTakahashi wanted to choose a notch and cut the bar at that point into two parts with the same length.\nHowever, this may not be possible as is, so he will do the following operations some number of times before he does the cut:\n\nChoose one section and expand it, increasing its length by 1 millimeter. Doing this operation once costs 1 yen (the currency of Japan).\n\nChoose one section of length at least 2 millimeters and shrink it, decreasing its length by 1 millimeter. Doing this operation once costs 1 yen.\n\nFind the minimum amount of money needed before cutting the bar into two parts with the same length.\n\nConstraints\n\n2 \\leq N \\leq 200000\n\n1 \\leq A_i \\leq 2020202020\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 A_3 ... A_N\n\nOutput\n\nPrint an integer representing the minimum amount of money needed before cutting the bar into two parts with the same length.\n\nSample Input 1\n\n3\n2 4 3\n\nSample Output 1\n\n3\n\nThe initial lengths of the sections are [2, 4, 3] (in millimeters). Takahashi can cut the bar equally after doing the following operations for 3 yen:\n\nShrink the second section from the left. The lengths of the sections are now [2, 3, 3].\n\nShrink the first section from the left. The lengths of the sections are now [1, 3, 3].\n\nShrink the second section from the left. The lengths of the sections are now [1, 2, 3], and we can cut the bar at the second notch from the left into two parts of length 3 each.\n\nSample Input 2\n\n12\n100 104 102 105 103 103 101 105 104 102 104 101\n\nSample Output 2\n\n0", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 371, "cpu_time_ms": 34, "memory_kb": 1664}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s130045091", "group_id": "codeNet:p02855", "input_text": "var\n a: array [1..300, 1..300] of boolean;\n b: array [1..300] of boolean;\n ans: array [1..300, 1..300] of longint;\n n, m, k, i, j, cnt, start: longint;\n c: char;\n f: boolean;\nbegin\n readln(n, m, k);\n for i := 1 to n do\n begin\n for j := 1 to m do\n begin\n read(c);\n if c = '#' then\n begin\n a[i, j] := true;\n b[i] := true;\n end;\n end;\n readln;\n end;\n cnt := 0;\n for i := 1 to n do\n if b[i] then\n break;\n start := i;\n for i := i to n do\n if b[i] then\n begin\n inc(cnt);\n f := false;\n for j := 1 to m + 1 do\n begin\n if j = m + 1 then\n break;\n if a[i, j] then\n if f then\n break\n else\n f := true;\n ans[i, j] := cnt;\n end; \n for j := j to m do\n begin\n if a[i, j] then\n inc(cnt);\n ans[i, j] := cnt;\n end;\n end\n else\n for j := 1 to m do\n ans[i, j] := ans[i - 1, j];\n for i := 1 to start - 1 do\n for j := 1 to m do\n ans[i, j] := ans[start, j];\n for i := 1 to n do\n begin\n for j := 1 to m do\n write(ans[i, j], ' ');\n writeln;\n end;\nend.\n", "language": "Pascal", "metadata": {"date": 1581517082, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p02855.html", "problem_id": "p02855", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02855/input.txt", "sample_output_relpath": "derived/input_output/data/p02855/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02855/Pascal/s130045091.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s130045091", "user_id": "u214724132"}, "prompt_components": {"gold_output": "1 2 2\n1 3 4\n5 5 4\n", "input_to_evaluate": "var\n a: array [1..300, 1..300] of boolean;\n b: array [1..300] of boolean;\n ans: array [1..300, 1..300] of longint;\n n, m, k, i, j, cnt, start: longint;\n c: char;\n f: boolean;\nbegin\n readln(n, m, k);\n for i := 1 to n do\n begin\n for j := 1 to m do\n begin\n read(c);\n if c = '#' then\n begin\n a[i, j] := true;\n b[i] := true;\n end;\n end;\n readln;\n end;\n cnt := 0;\n for i := 1 to n do\n if b[i] then\n break;\n start := i;\n for i := i to n do\n if b[i] then\n begin\n inc(cnt);\n f := false;\n for j := 1 to m + 1 do\n begin\n if j = m + 1 then\n break;\n if a[i, j] then\n if f then\n break\n else\n f := true;\n ans[i, j] := cnt;\n end; \n for j := j to m do\n begin\n if a[i, j] then\n inc(cnt);\n ans[i, j] := cnt;\n end;\n end\n else\n for j := 1 to m do\n ans[i, j] := ans[i - 1, j];\n for i := 1 to start - 1 do\n for j := 1 to m do\n ans[i, j] := ans[start, j];\n for i := 1 to n do\n begin\n for j := 1 to m do\n write(ans[i, j], ' ');\n writeln;\n end;\nend.\n", "problem_context": "Score: 400 points\n\nProblem Statement\n\nChokudai made a rectangular cake for contestants in DDCC 2020 Finals.\n\nThe cake has H - 1 horizontal notches and W - 1 vertical notches, which divide the cake into H \\times W equal sections. K of these sections has a strawberry on top of each of them.\n\nThe positions of the strawberries are given to you as H \\times W characters s_{i, j} (1 \\leq i \\leq H, 1 \\leq j \\leq W). If s_{i, j} is #, the section at the i-th row from the top and the j-th column from the left contains a strawberry; if s_{i, j} is ., the section does not contain one. There are exactly K occurrences of #s.\n\nTakahashi wants to cut this cake into K pieces and serve them to the contestants. Each of these pieces must satisfy the following conditions:\n\nHas a rectangular shape.\n\nContains exactly one strawberry.\n\nOne possible way to cut the cake is shown below:\n\nFind one way to cut the cake and satisfy the condition. We can show that this is always possible, regardless of the number and positions of the strawberries.\n\nConstraints\n\n1 \\leq H \\leq 300\n\n1 \\leq W \\leq 300\n\n1 \\leq K \\leq H \\times W\n\ns_{i, j} is # or ..\n\nThere are exactly K occurrences of # in s.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W K\ns_{1, 1} s_{1, 2} \\cdots s_{1, W}\ns_{2, 1} s_{2, 2} \\cdots s_{2, W}\n:\ns_{H, 1} s_{H, 2} \\cdots s_{H, W}\n\nOutput\n\nAssign the numbers 1, 2, 3, \\dots, K to the K pieces obtained after the cut, in any order. Then, let a_{i, j} be the number representing the piece containing the section at the i-th row from the top and the j-th column from the left of the cake. Output should be in the following format:\n\na_{1, 1} \\ a_{1, 2} \\ \\cdots \\ a_{1, W}\na_{2, 1} \\ a_{2, 2} \\ \\cdots \\ a_{2, W}\n:\na_{H, 1} \\ a_{H, 2} \\ \\cdots \\ a_{H, W}\n\nIf multiple solutions exist, any of them will be accepted.\n\nSample Input 1\n\n3 3 5\n#.#\n.#.\n#.#\n\nSample Output 1\n\n1 2 2\n1 3 4\n5 5 4\n\nOne way to cut this cake is shown below:\n\nSample Input 2\n\n3 7 7\n#...#.#\n..#...#\n.#..#..\n\nSample Output 2\n\n1 1 2 2 3 4 4\n6 6 2 2 3 5 5\n6 6 7 7 7 7 7\n\nOne way to cut this cake is shown below:\n\nSample Input 3\n\n13 21 106\n.....................\n.####.####.####.####.\n..#.#..#.#.#....#....\n..#.#..#.#.#....#....\n..#.#..#.#.#....#....\n.####.####.####.####.\n.....................\n.####.####.####.####.\n....#.#..#....#.#..#.\n.####.#..#.####.#..#.\n.#....#..#.#....#..#.\n.####.####.####.####.\n.....................\n\nSample Output 3\n\n12 12 23 34 45 45 60 71 82 93 93 2 13 24 35 35 17 28 39 50 50\n12 12 23 34 45 45 60 71 82 93 93 2 13 24 35 35 17 28 39 50 50\n12 12 56 89 89 89 60 104 82 31 31 46 13 24 35 35 61 61 39 50 50\n12 12 67 67 100 100 60 9 9 42 42 57 13 24 6 72 72 72 72 72 72\n12 12 78 5 5 5 20 20 20 53 68 68 90 24 6 83 83 83 83 83 83\n16 16 27 38 49 49 64 75 86 97 79 79 90 101 6 94 94 105 10 21 21\n16 16 27 38 49 49 64 75 86 97 79 79 90 101 6 94 94 105 10 21 21\n32 32 43 54 65 65 80 11 106 95 22 22 33 44 55 55 70 1 96 85 85\n32 32 43 54 76 76 91 11 106 84 84 4 99 66 66 66 81 1 96 74 74\n14 14 3 98 87 87 102 11 73 73 73 4 99 88 77 77 92 92 63 63 63\n25 25 3 98 87 87 7 29 62 62 62 15 99 88 77 77 103 19 30 52 52\n36 36 47 58 69 69 18 29 40 51 51 26 37 48 59 59 8 19 30 41 41\n36 36 47 58 69 69 18 29 40 51 51 26 37 48 59 59 8 19 30 41 41", "sample_input": "3 3 5\n#.#\n.#.\n#.#\n"}, "reference_outputs": ["1 2 2\n1 3 4\n5 5 4\n"], "source_document_id": "p02855", "source_text": "Score: 400 points\n\nProblem Statement\n\nChokudai made a rectangular cake for contestants in DDCC 2020 Finals.\n\nThe cake has H - 1 horizontal notches and W - 1 vertical notches, which divide the cake into H \\times W equal sections. K of these sections has a strawberry on top of each of them.\n\nThe positions of the strawberries are given to you as H \\times W characters s_{i, j} (1 \\leq i \\leq H, 1 \\leq j \\leq W). If s_{i, j} is #, the section at the i-th row from the top and the j-th column from the left contains a strawberry; if s_{i, j} is ., the section does not contain one. There are exactly K occurrences of #s.\n\nTakahashi wants to cut this cake into K pieces and serve them to the contestants. Each of these pieces must satisfy the following conditions:\n\nHas a rectangular shape.\n\nContains exactly one strawberry.\n\nOne possible way to cut the cake is shown below:\n\nFind one way to cut the cake and satisfy the condition. We can show that this is always possible, regardless of the number and positions of the strawberries.\n\nConstraints\n\n1 \\leq H \\leq 300\n\n1 \\leq W \\leq 300\n\n1 \\leq K \\leq H \\times W\n\ns_{i, j} is # or ..\n\nThere are exactly K occurrences of # in s.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W K\ns_{1, 1} s_{1, 2} \\cdots s_{1, W}\ns_{2, 1} s_{2, 2} \\cdots s_{2, W}\n:\ns_{H, 1} s_{H, 2} \\cdots s_{H, W}\n\nOutput\n\nAssign the numbers 1, 2, 3, \\dots, K to the K pieces obtained after the cut, in any order. Then, let a_{i, j} be the number representing the piece containing the section at the i-th row from the top and the j-th column from the left of the cake. Output should be in the following format:\n\na_{1, 1} \\ a_{1, 2} \\ \\cdots \\ a_{1, W}\na_{2, 1} \\ a_{2, 2} \\ \\cdots \\ a_{2, W}\n:\na_{H, 1} \\ a_{H, 2} \\ \\cdots \\ a_{H, W}\n\nIf multiple solutions exist, any of them will be accepted.\n\nSample Input 1\n\n3 3 5\n#.#\n.#.\n#.#\n\nSample Output 1\n\n1 2 2\n1 3 4\n5 5 4\n\nOne way to cut this cake is shown below:\n\nSample Input 2\n\n3 7 7\n#...#.#\n..#...#\n.#..#..\n\nSample Output 2\n\n1 1 2 2 3 4 4\n6 6 2 2 3 5 5\n6 6 7 7 7 7 7\n\nOne way to cut this cake is shown below:\n\nSample Input 3\n\n13 21 106\n.....................\n.####.####.####.####.\n..#.#..#.#.#....#....\n..#.#..#.#.#....#....\n..#.#..#.#.#....#....\n.####.####.####.####.\n.....................\n.####.####.####.####.\n....#.#..#....#.#..#.\n.####.#..#.####.#..#.\n.#....#..#.#....#..#.\n.####.####.####.####.\n.....................\n\nSample Output 3\n\n12 12 23 34 45 45 60 71 82 93 93 2 13 24 35 35 17 28 39 50 50\n12 12 23 34 45 45 60 71 82 93 93 2 13 24 35 35 17 28 39 50 50\n12 12 56 89 89 89 60 104 82 31 31 46 13 24 35 35 61 61 39 50 50\n12 12 67 67 100 100 60 9 9 42 42 57 13 24 6 72 72 72 72 72 72\n12 12 78 5 5 5 20 20 20 53 68 68 90 24 6 83 83 83 83 83 83\n16 16 27 38 49 49 64 75 86 97 79 79 90 101 6 94 94 105 10 21 21\n16 16 27 38 49 49 64 75 86 97 79 79 90 101 6 94 94 105 10 21 21\n32 32 43 54 65 65 80 11 106 95 22 22 33 44 55 55 70 1 96 85 85\n32 32 43 54 76 76 91 11 106 84 84 4 99 66 66 66 81 1 96 74 74\n14 14 3 98 87 87 102 11 73 73 73 4 99 88 77 77 92 92 63 63 63\n25 25 3 98 87 87 7 29 62 62 62 15 99 88 77 77 103 19 30 52 52\n36 36 47 58 69 69 18 29 40 51 51 26 37 48 59 59 8 19 30 41 41\n36 36 47 58 69 69 18 29 40 51 51 26 37 48 59 59 8 19 30 41 41", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1172, "cpu_time_ms": 15, "memory_kb": 1024}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s817812315", "group_id": "codeNet:p02855", "input_text": "type pair=record x,y:int64 end;\n ary1=array[1..920] of pair;\n ary2=array[1..310,1..310] of int64;\nvar h,w,k,i,j,n,last:int64;\n marker:pair;\n s:ary1;\n ans:ary2;\n c:char;\n \nprocedure update(a,b,c,d,e: int64);\nvar i1,j1:int64;\nbegin\n for i1 := a to c do\n for j1 := b to d do\n ans[i1][j1]:=e;\nend;\n\nbegin\nreadln(h,w,k);\nn:=1;\nfor i := 1 to h do\n begin\n for j := 1 to w do\n begin\n read(c);\n if c='#' then \n begin\n s[n].y:=i;\n s[n].x:=j;\n last:=i;\n inc(n)\n end;\n if n=k+1 then break;\n end;\n readln;\n end;\nn:=1;\nupdate(1,1,s[1].y,s[1].x,n);\nmarker.y:=1;marker.x:=s[1].x+1;\ninc(n);\nfor i := 2 to k do\n if s[i-1].y = s[i].y then\n begin\n if s[i].y= last then update(marker.y,marker.x,h,s[i].x,n)\n else update(marker.y,marker.x,s[i].y,s[i].x,n);\n marker.x:=s[i].x+1;\n inc(n)\n end\n else \n begin\n update(marker.y,marker.x,s[i-1].y,w,n-1);\n if s[i].y= last then update(s[i-1].y+1,1,h,s[i].x,n)\n else update(s[i-1].y+1,1,s[i].y,s[i].x,n);\n marker.y:=s[i-1].y+1;marker.x:=s[i].x+1;\n inc(n)\n end;\n\nupdate(marker.y,s[i].x+1,h,w,n-1);\n\nfor i := 1 to h do\n begin\n for j := 1 to w do\n write(ans[i][j],' ');\n writeln;\n end;\nend.", "language": "Pascal", "metadata": {"date": 1574570781, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p02855.html", "problem_id": "p02855", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02855/input.txt", "sample_output_relpath": "derived/input_output/data/p02855/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02855/Pascal/s817812315.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s817812315", "user_id": "u655683235"}, "prompt_components": {"gold_output": "1 2 2\n1 3 4\n5 5 4\n", "input_to_evaluate": "type pair=record x,y:int64 end;\n ary1=array[1..920] of pair;\n ary2=array[1..310,1..310] of int64;\nvar h,w,k,i,j,n,last:int64;\n marker:pair;\n s:ary1;\n ans:ary2;\n c:char;\n \nprocedure update(a,b,c,d,e: int64);\nvar i1,j1:int64;\nbegin\n for i1 := a to c do\n for j1 := b to d do\n ans[i1][j1]:=e;\nend;\n\nbegin\nreadln(h,w,k);\nn:=1;\nfor i := 1 to h do\n begin\n for j := 1 to w do\n begin\n read(c);\n if c='#' then \n begin\n s[n].y:=i;\n s[n].x:=j;\n last:=i;\n inc(n)\n end;\n if n=k+1 then break;\n end;\n readln;\n end;\nn:=1;\nupdate(1,1,s[1].y,s[1].x,n);\nmarker.y:=1;marker.x:=s[1].x+1;\ninc(n);\nfor i := 2 to k do\n if s[i-1].y = s[i].y then\n begin\n if s[i].y= last then update(marker.y,marker.x,h,s[i].x,n)\n else update(marker.y,marker.x,s[i].y,s[i].x,n);\n marker.x:=s[i].x+1;\n inc(n)\n end\n else \n begin\n update(marker.y,marker.x,s[i-1].y,w,n-1);\n if s[i].y= last then update(s[i-1].y+1,1,h,s[i].x,n)\n else update(s[i-1].y+1,1,s[i].y,s[i].x,n);\n marker.y:=s[i-1].y+1;marker.x:=s[i].x+1;\n inc(n)\n end;\n\nupdate(marker.y,s[i].x+1,h,w,n-1);\n\nfor i := 1 to h do\n begin\n for j := 1 to w do\n write(ans[i][j],' ');\n writeln;\n end;\nend.", "problem_context": "Score: 400 points\n\nProblem Statement\n\nChokudai made a rectangular cake for contestants in DDCC 2020 Finals.\n\nThe cake has H - 1 horizontal notches and W - 1 vertical notches, which divide the cake into H \\times W equal sections. K of these sections has a strawberry on top of each of them.\n\nThe positions of the strawberries are given to you as H \\times W characters s_{i, j} (1 \\leq i \\leq H, 1 \\leq j \\leq W). If s_{i, j} is #, the section at the i-th row from the top and the j-th column from the left contains a strawberry; if s_{i, j} is ., the section does not contain one. There are exactly K occurrences of #s.\n\nTakahashi wants to cut this cake into K pieces and serve them to the contestants. Each of these pieces must satisfy the following conditions:\n\nHas a rectangular shape.\n\nContains exactly one strawberry.\n\nOne possible way to cut the cake is shown below:\n\nFind one way to cut the cake and satisfy the condition. We can show that this is always possible, regardless of the number and positions of the strawberries.\n\nConstraints\n\n1 \\leq H \\leq 300\n\n1 \\leq W \\leq 300\n\n1 \\leq K \\leq H \\times W\n\ns_{i, j} is # or ..\n\nThere are exactly K occurrences of # in s.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W K\ns_{1, 1} s_{1, 2} \\cdots s_{1, W}\ns_{2, 1} s_{2, 2} \\cdots s_{2, W}\n:\ns_{H, 1} s_{H, 2} \\cdots s_{H, W}\n\nOutput\n\nAssign the numbers 1, 2, 3, \\dots, K to the K pieces obtained after the cut, in any order. Then, let a_{i, j} be the number representing the piece containing the section at the i-th row from the top and the j-th column from the left of the cake. Output should be in the following format:\n\na_{1, 1} \\ a_{1, 2} \\ \\cdots \\ a_{1, W}\na_{2, 1} \\ a_{2, 2} \\ \\cdots \\ a_{2, W}\n:\na_{H, 1} \\ a_{H, 2} \\ \\cdots \\ a_{H, W}\n\nIf multiple solutions exist, any of them will be accepted.\n\nSample Input 1\n\n3 3 5\n#.#\n.#.\n#.#\n\nSample Output 1\n\n1 2 2\n1 3 4\n5 5 4\n\nOne way to cut this cake is shown below:\n\nSample Input 2\n\n3 7 7\n#...#.#\n..#...#\n.#..#..\n\nSample Output 2\n\n1 1 2 2 3 4 4\n6 6 2 2 3 5 5\n6 6 7 7 7 7 7\n\nOne way to cut this cake is shown below:\n\nSample Input 3\n\n13 21 106\n.....................\n.####.####.####.####.\n..#.#..#.#.#....#....\n..#.#..#.#.#....#....\n..#.#..#.#.#....#....\n.####.####.####.####.\n.....................\n.####.####.####.####.\n....#.#..#....#.#..#.\n.####.#..#.####.#..#.\n.#....#..#.#....#..#.\n.####.####.####.####.\n.....................\n\nSample Output 3\n\n12 12 23 34 45 45 60 71 82 93 93 2 13 24 35 35 17 28 39 50 50\n12 12 23 34 45 45 60 71 82 93 93 2 13 24 35 35 17 28 39 50 50\n12 12 56 89 89 89 60 104 82 31 31 46 13 24 35 35 61 61 39 50 50\n12 12 67 67 100 100 60 9 9 42 42 57 13 24 6 72 72 72 72 72 72\n12 12 78 5 5 5 20 20 20 53 68 68 90 24 6 83 83 83 83 83 83\n16 16 27 38 49 49 64 75 86 97 79 79 90 101 6 94 94 105 10 21 21\n16 16 27 38 49 49 64 75 86 97 79 79 90 101 6 94 94 105 10 21 21\n32 32 43 54 65 65 80 11 106 95 22 22 33 44 55 55 70 1 96 85 85\n32 32 43 54 76 76 91 11 106 84 84 4 99 66 66 66 81 1 96 74 74\n14 14 3 98 87 87 102 11 73 73 73 4 99 88 77 77 92 92 63 63 63\n25 25 3 98 87 87 7 29 62 62 62 15 99 88 77 77 103 19 30 52 52\n36 36 47 58 69 69 18 29 40 51 51 26 37 48 59 59 8 19 30 41 41\n36 36 47 58 69 69 18 29 40 51 51 26 37 48 59 59 8 19 30 41 41", "sample_input": "3 3 5\n#.#\n.#.\n#.#\n"}, "reference_outputs": ["1 2 2\n1 3 4\n5 5 4\n"], "source_document_id": "p02855", "source_text": "Score: 400 points\n\nProblem Statement\n\nChokudai made a rectangular cake for contestants in DDCC 2020 Finals.\n\nThe cake has H - 1 horizontal notches and W - 1 vertical notches, which divide the cake into H \\times W equal sections. K of these sections has a strawberry on top of each of them.\n\nThe positions of the strawberries are given to you as H \\times W characters s_{i, j} (1 \\leq i \\leq H, 1 \\leq j \\leq W). If s_{i, j} is #, the section at the i-th row from the top and the j-th column from the left contains a strawberry; if s_{i, j} is ., the section does not contain one. There are exactly K occurrences of #s.\n\nTakahashi wants to cut this cake into K pieces and serve them to the contestants. Each of these pieces must satisfy the following conditions:\n\nHas a rectangular shape.\n\nContains exactly one strawberry.\n\nOne possible way to cut the cake is shown below:\n\nFind one way to cut the cake and satisfy the condition. We can show that this is always possible, regardless of the number and positions of the strawberries.\n\nConstraints\n\n1 \\leq H \\leq 300\n\n1 \\leq W \\leq 300\n\n1 \\leq K \\leq H \\times W\n\ns_{i, j} is # or ..\n\nThere are exactly K occurrences of # in s.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W K\ns_{1, 1} s_{1, 2} \\cdots s_{1, W}\ns_{2, 1} s_{2, 2} \\cdots s_{2, W}\n:\ns_{H, 1} s_{H, 2} \\cdots s_{H, W}\n\nOutput\n\nAssign the numbers 1, 2, 3, \\dots, K to the K pieces obtained after the cut, in any order. Then, let a_{i, j} be the number representing the piece containing the section at the i-th row from the top and the j-th column from the left of the cake. Output should be in the following format:\n\na_{1, 1} \\ a_{1, 2} \\ \\cdots \\ a_{1, W}\na_{2, 1} \\ a_{2, 2} \\ \\cdots \\ a_{2, W}\n:\na_{H, 1} \\ a_{H, 2} \\ \\cdots \\ a_{H, W}\n\nIf multiple solutions exist, any of them will be accepted.\n\nSample Input 1\n\n3 3 5\n#.#\n.#.\n#.#\n\nSample Output 1\n\n1 2 2\n1 3 4\n5 5 4\n\nOne way to cut this cake is shown below:\n\nSample Input 2\n\n3 7 7\n#...#.#\n..#...#\n.#..#..\n\nSample Output 2\n\n1 1 2 2 3 4 4\n6 6 2 2 3 5 5\n6 6 7 7 7 7 7\n\nOne way to cut this cake is shown below:\n\nSample Input 3\n\n13 21 106\n.....................\n.####.####.####.####.\n..#.#..#.#.#....#....\n..#.#..#.#.#....#....\n..#.#..#.#.#....#....\n.####.####.####.####.\n.....................\n.####.####.####.####.\n....#.#..#....#.#..#.\n.####.#..#.####.#..#.\n.#....#..#.#....#..#.\n.####.####.####.####.\n.....................\n\nSample Output 3\n\n12 12 23 34 45 45 60 71 82 93 93 2 13 24 35 35 17 28 39 50 50\n12 12 23 34 45 45 60 71 82 93 93 2 13 24 35 35 17 28 39 50 50\n12 12 56 89 89 89 60 104 82 31 31 46 13 24 35 35 61 61 39 50 50\n12 12 67 67 100 100 60 9 9 42 42 57 13 24 6 72 72 72 72 72 72\n12 12 78 5 5 5 20 20 20 53 68 68 90 24 6 83 83 83 83 83 83\n16 16 27 38 49 49 64 75 86 97 79 79 90 101 6 94 94 105 10 21 21\n16 16 27 38 49 49 64 75 86 97 79 79 90 101 6 94 94 105 10 21 21\n32 32 43 54 65 65 80 11 106 95 22 22 33 44 55 55 70 1 96 85 85\n32 32 43 54 76 76 91 11 106 84 84 4 99 66 66 66 81 1 96 74 74\n14 14 3 98 87 87 102 11 73 73 73 4 99 88 77 77 92 92 63 63 63\n25 25 3 98 87 87 7 29 62 62 62 15 99 88 77 77 103 19 30 52 52\n36 36 47 58 69 69 18 29 40 51 51 26 37 48 59 59 8 19 30 41 41\n36 36 47 58 69 69 18 29 40 51 51 26 37 48 59 59 8 19 30 41 41", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1208, "cpu_time_ms": 99, "memory_kb": 1152}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s358596681", "group_id": "codeNet:p02856", "input_text": "program P1177;\n uses Garrayutils,Gutil;\n type\n warray=array of longint;\n cmp=TLess;\n sort=TOrderingArrayUtils;\n label aaa;\n var\n a:warray;\n i,n:longint;\n begin\n readln(n);\n setlength(a,n);\n for i:=1 to n do\n read(a[i-1]);\n readln;\n sort.sort(a,n);\n for i:=1 to n-1 do\n write(a[i-1],' ');\n writeln(a[n-1]);\n end.", "language": "Pascal", "metadata": {"date": 1593481317, "filename_ext": "pas", "original_language": "Pascal (FPC 3.0.4)", "problem_description_relpath": "problem_descriptions/p02856.html", "problem_id": "p02856", "resource_group": "low_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/Pascal/s358596681.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s358596681", "user_id": "u678141519"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "program P1177;\n uses Garrayutils,Gutil;\n type\n warray=array of longint;\n cmp=TLess;\n sort=TOrderingArrayUtils;\n label aaa;\n var\n a:warray;\n i,n:longint;\n begin\n readln(n);\n setlength(a,n);\n for i:=1 to n do\n read(a[i-1]);\n readln;\n sort.sort(a,n);\n for i:=1 to n-1 do\n write(a[i-1],' ');\n writeln(a[n-1]);\n end.", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 62, "memory_kb": 2292}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s093179554", "group_id": "codeNet:p02860", "input_text": "uses crt;\nvar a:string;\ni,n:integer;\nok:boolean;\nbegin\nclrscr;\nreadln(n);\nreadln(a);\nok:=true;\nif length(a) mod 2<>0 then write('No') else begin\nfor i:=1 to n div 2 do\nif a[i]<>a[i+n div 2] then begin ok:=false; break; end;\nif ok=true then write('Yes') else write('No');\nend;\nreadln;\nend.", "language": "Pascal", "metadata": {"date": 1577393871, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p02860.html", "problem_id": "p02860", "resource_group": "low_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/Pascal/s093179554.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s093179554", "user_id": "u398406871"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "uses crt;\nvar a:string;\ni,n:integer;\nok:boolean;\nbegin\nclrscr;\nreadln(n);\nreadln(a);\nok:=true;\nif length(a) mod 2<>0 then write('No') else begin\nfor i:=1 to n div 2 do\nif a[i]<>a[i+n div 2] then begin ok:=false; break; end;\nif ok=true then write('Yes') else write('No');\nend;\nreadln;\nend.", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 295, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s599176487", "group_id": "codeNet:p02861", "input_text": "uses crt;\nvar i,n:byte;\nkq:real;\nkq0:longint;\nm0:array[0..10] of array[0..1] of integer;\nm:array[0..10] of boolean;\nprocedure test(yes:longint);\nvar j:byte;\nasd:boolean;\nbegin\n for j:=0 to n-1 do begin\n if m[j] then continue;\n asd:=true;\n m[j]:=true;\n kq:=kq+sqrt(sqr(m0[yes][0]-m0[j][0])+sqr(m0[yes][1]-m0[j][1]));\n test(j);\n m[j]:=false;\n end;\nend;\nbegin\n clrscr;\n readln(n);\n for i:=0 to n-1 do read(m0[i][0], m0[i][1]);\n for i:=0 to n-1 do begin\n m[i]:=true;\n test(i);\n m[i]:=false;\n end;\n kq0:=1;\n for i:=2 to n do kq0:=kq0*i;\n writeln(kq0);\n writeln((kq/kq0):0:50);\n readln;\n readln;\nend.\n", "language": "Pascal", "metadata": {"date": 1577395227, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p02861.html", "problem_id": "p02861", "resource_group": "low_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/Pascal/s599176487.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s599176487", "user_id": "u635762866"}, "prompt_components": {"gold_output": "2.2761423749\n", "input_to_evaluate": "uses crt;\nvar i,n:byte;\nkq:real;\nkq0:longint;\nm0:array[0..10] of array[0..1] of integer;\nm:array[0..10] of boolean;\nprocedure test(yes:longint);\nvar j:byte;\nasd:boolean;\nbegin\n for j:=0 to n-1 do begin\n if m[j] then continue;\n asd:=true;\n m[j]:=true;\n kq:=kq+sqrt(sqr(m0[yes][0]-m0[j][0])+sqr(m0[yes][1]-m0[j][1]));\n test(j);\n m[j]:=false;\n end;\nend;\nbegin\n clrscr;\n readln(n);\n for i:=0 to n-1 do read(m0[i][0], m0[i][1]);\n for i:=0 to n-1 do begin\n m[i]:=true;\n test(i);\n m[i]:=false;\n end;\n kq0:=1;\n for i:=2 to n do kq0:=kq0*i;\n writeln(kq0);\n writeln((kq/kq0):0:50);\n readln;\n readln;\nend.\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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 3, "memory_kb": 128}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s137104656", "group_id": "codeNet:p02865", "input_text": "var n:integer;begin readln(n);writeln((n-1) div 2);end.", "language": "Pascal", "metadata": {"date": 1597615096, "filename_ext": "pas", "original_language": "Pascal (FPC 3.0.4)", "problem_description_relpath": "problem_descriptions/p02865.html", "problem_id": "p02865", "resource_group": "low_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/Pascal/s137104656.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s137104656", "user_id": "u984276646"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "var n:integer;begin readln(n);writeln((n-1) div 2);end.", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 55, "cpu_time_ms": 1, "memory_kb": 1328}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s054576022", "group_id": "codeNet:p02866", "input_text": "const p=998244353;\ntype ary =array[1..100010] of int64;\n \nvar n,ijk,ans,D1,l,now,last:int64;\n D:ary;\n img:boolean;\n \nfunction pawarmd(a,b:int64):int64;\n var store,ij:int64;\nbegin\n store:=1;\n for ij := 1 to b do store := store * a mod p;\n pawarmd:=store;\nend;\n \nprocedure sort(p,q :integer; var a :ary);\n var i, j, k ,w:integer;\n \nbegin i := p; j := q; k:=a[(p+q) div 2];\n repeat\n while a[i] < k do inc(i);\n while k < a[j] do dec(j);\n if i <= j then begin\n w := a[i]; a[i] := a[j]; a[j] := w;\n inc(i);dec(j);\n end\n until i > j;\n if p < j then sort(p,j,a);\n if i < q then sort(i,q,a)\nend; \n \nbegin\n read(n);\n ans:=1;\n img:=false;\n read(D1);\n l:=1;\n now:=0;\n last:=1;\n \n if D1<>0 then img:=true\n else\n begin\n for ijk := 1 to n-1 do read(D[ijk]);\n sort(1,n-1,D);\n for ijk := 1 to n-1 do\n if D[ijk]=l then inc(now)\n else \n if D[ijk]-l >=2 then\n begin\n img:=true;\n break;\n end\n else\n begin\n ans:=ans*pawarmd(last,now) mod p;\n \n inc(l);\n last := now;\n now:=1;\n end;\n end;\n \n if not(img) then ans:=ans*pawarmd(last,now) mod p;\n \nif img then write(0) else write(ans);\nend.", "language": "Pascal", "metadata": {"date": 1573356139, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p02866.html", "problem_id": "p02866", "resource_group": "low_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/Pascal/s054576022.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s054576022", "user_id": "u655683235"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "const p=998244353;\ntype ary =array[1..100010] of int64;\n \nvar n,ijk,ans,D1,l,now,last:int64;\n D:ary;\n img:boolean;\n \nfunction pawarmd(a,b:int64):int64;\n var store,ij:int64;\nbegin\n store:=1;\n for ij := 1 to b do store := store * a mod p;\n pawarmd:=store;\nend;\n \nprocedure sort(p,q :integer; var a :ary);\n var i, j, k ,w:integer;\n \nbegin i := p; j := q; k:=a[(p+q) div 2];\n repeat\n while a[i] < k do inc(i);\n while k < a[j] do dec(j);\n if i <= j then begin\n w := a[i]; a[i] := a[j]; a[j] := w;\n inc(i);dec(j);\n end\n until i > j;\n if p < j then sort(p,j,a);\n if i < q then sort(i,q,a)\nend; \n \nbegin\n read(n);\n ans:=1;\n img:=false;\n read(D1);\n l:=1;\n now:=0;\n last:=1;\n \n if D1<>0 then img:=true\n else\n begin\n for ijk := 1 to n-1 do read(D[ijk]);\n sort(1,n-1,D);\n for ijk := 1 to n-1 do\n if D[ijk]=l then inc(now)\n else \n if D[ijk]-l >=2 then\n begin\n img:=true;\n break;\n end\n else\n begin\n ans:=ans*pawarmd(last,now) mod p;\n \n inc(l);\n last := now;\n now:=1;\n end;\n end;\n \n if not(img) then ans:=ans*pawarmd(last,now) mod p;\n \nif img then write(0) else write(ans);\nend.", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1204, "cpu_time_ms": 23, "memory_kb": 896}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s484742003", "group_id": "codeNet:p02873", "input_text": "var\n\tS:String;\n\tN,id:Longint;\n\tans,L,R:int64;\nbegin\n\treadln(S);\n\tN:=length(S);\n\tid:=1;\n\tans:=0;\n\twhile id<=N do begin\n\t\tL:=0;\n\t\tR:=0;\n\t\twhile(id<=N)and(S[id]='<')do begin\n\t\t\tinc(id);\n\t\t\tinc(L);\n\t\tend;\n\t\twhile(id<=N)and(S[id]='>')do begin\n\t\t\tinc(id);\n\t\t\tinc(R);\n\t\tend;\n\t\tinc(ans,L*(L+1)div 2+R*(R+1)div 2);\n\t\tif L')do begin\n\t\t\tinc(id);\n\t\t\tinc(R);\n\t\tend;\n\t\tinc(ans,L*(L+1)div 2+R*(R+1)div 2);\n\t\tif L.\n\nA sequence of N non-negative integers, a_1,a_2,\\cdots,a_N, is said to be good when the following condition is satisfied for all i (1 \\leq i \\leq N-1):\n\nIf S_i= <: a_i: a_i>a_{i+1}\n\nFind the minimum possible sum of the elements of a good sequence of N non-negative integers.\n\nConstraints\n\n2 \\leq N \\leq 5 \\times 10^5\n\nS is a string of length N-1 consisting of < and >.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nFind the minimum possible sum of the elements of a good sequence of N non-negative integers.\n\nSample Input 1\n\n<>>\n\nSample Output 1\n\n3\n\na=(0,2,1,0) is a good sequence whose sum is 3.\nThere is no good sequence whose sum is less than 3.\n\nSample Input 2\n\n<>>><<><<<<<>>><\n\nSample Output 2\n\n28", "sample_input": "<>>\n"}, "reference_outputs": ["3\n"], "source_document_id": "p02873", "source_text": "Score : 300 points\n\nProblem Statement\n\nGiven is a string S of length N-1.\nEach character in S is < or >.\n\nA sequence of N non-negative integers, a_1,a_2,\\cdots,a_N, is said to be good when the following condition is satisfied for all i (1 \\leq i \\leq N-1):\n\nIf S_i= <: a_i: a_i>a_{i+1}\n\nFind the minimum possible sum of the elements of a good sequence of N non-negative integers.\n\nConstraints\n\n2 \\leq N \\leq 5 \\times 10^5\n\nS is a string of length N-1 consisting of < and >.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nFind the minimum possible sum of the elements of a good sequence of N non-negative integers.\n\nSample Input 1\n\n<>>\n\nSample Output 1\n\n3\n\na=(0,2,1,0) is a good sequence whose sum is 3.\nThere is no good sequence whose sum is less than 3.\n\nSample Input 2\n\n<>>><<><<<<<>>><\n\nSample Output 2\n\n28", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 5, "memory_kb": 896}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s049645457", "group_id": "codeNet:p02880", "input_text": "var\n n,i,j:byte;\n ok:boolean;\nbegin\n read(n);\n ok:=false;\n for i:=2 to 9 do\n for j:=2 to 9 do if i*j=n then ok:=true;\n if ok=true then write('Yes') else write('No');\nend.\n", "language": "Pascal", "metadata": {"date": 1577458989, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p02880.html", "problem_id": "p02880", "resource_group": "low_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/Pascal/s049645457.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s049645457", "user_id": "u344153701"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "var\n n,i,j:byte;\n ok:boolean;\nbegin\n read(n);\n ok:=false;\n for i:=2 to 9 do\n for j:=2 to 9 do if i*j=n then ok:=true;\n if ok=true then write('Yes') else write('No');\nend.\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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 2, "memory_kb": 128}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s081134328", "group_id": "codeNet:p02881", "input_text": "uses crt;\nvar\n b,a,min:qword;\n i,j,n:int64;\n ok:boolean;\nbegin\n clrscr;\n read(n);\n if n mod 2<>0 then begin write(n-1); exit; end\n else\n for i:=n div 2 downto 1 do\n begin\n if ok=true then break;\n for j:=3 to n div 2 do\n if i*j=n then begin min:=(i-1)+(j-1); ok:=true; break; end; end;\n for i:=(n div 2)+1 downto 1 do\n for j:=3 to n div 2 do\n if i*j=n then begin b:=(i-1)+(j-1); if min>b then min:=b; end;\n if min>0 then write(min) else write(n div 2);\n readln;\n readln;\nend.\n\n", "language": "Pascal", "metadata": {"date": 1577463927, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p02881.html", "problem_id": "p02881", "resource_group": "low_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/Pascal/s081134328.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s081134328", "user_id": "u344153701"}, "prompt_components": {"gold_output": "5\n", "input_to_evaluate": "uses crt;\nvar\n b,a,min:qword;\n i,j,n:int64;\n ok:boolean;\nbegin\n clrscr;\n read(n);\n if n mod 2<>0 then begin write(n-1); exit; end\n else\n for i:=n div 2 downto 1 do\n begin\n if ok=true then break;\n for j:=3 to n div 2 do\n if i*j=n then begin min:=(i-1)+(j-1); ok:=true; break; end; end;\n for i:=(n div 2)+1 downto 1 do\n for j:=3 to n div 2 do\n if i*j=n then begin b:=(i-1)+(j-1); if min>b then min:=b; end;\n if min>0 then write(min) else write(n div 2);\n readln;\n readln;\nend.\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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 653, "cpu_time_ms": 2103, "memory_kb": 128}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s650041268", "group_id": "codeNet:p02881", "input_text": "uses crt;\nvar sb,i,n: int64;\nbegin\nclrscr;\nread(n);\ni:=1; sb:=0;\n repeat\n inc(i);\n inc(sb);\n until (n mod i=0) and (n div i <10);\nwrite(n div i -1 +sb);\nreadln;\nreadln;\nend.", "language": "Pascal", "metadata": {"date": 1577463139, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p02881.html", "problem_id": "p02881", "resource_group": "low_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/Pascal/s650041268.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s650041268", "user_id": "u398406871"}, "prompt_components": {"gold_output": "5\n", "input_to_evaluate": "uses crt;\nvar sb,i,n: int64;\nbegin\nclrscr;\nread(n);\ni:=1; sb:=0;\n repeat\n inc(i);\n inc(sb);\n until (n mod i=0) and (n div i <10);\nwrite(n div i -1 +sb);\nreadln;\nreadln;\nend.", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 2103, "memory_kb": 128}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s643927292", "group_id": "codeNet:p02881", "input_text": "uses crt;\nvar\n s,i,j,n:longint;\n min,a,b:qword;\n ok:boolean;\nbegin\n clrscr;\n read(n);\n ok:=false;\n if n mod 2<>0 then\n begin\n write(n-1);\n exit;\n end else\n for i:=2 to n div 2 do\n begin\n if ok=true then break;\n for j:=1 to n div 2 do\n begin\n b:=i*j;\n if b=n then\n begin\n min:=(i-1)+(j-1);\n ok:=true;\n break;\n end;\n end;\n end;\n ok:=false;\n for i:=2 to n div 2 do\n for j:=1 to n div 2 do\n begin\n b:=i*j;\n if b=n then\n begin\n a:=(i-1)+(j-1);\n if min>a then min:=a;\n end;\n end;\n write(min);\n readln;\n readln;\nend.\n\n", "language": "Pascal", "metadata": {"date": 1577462404, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p02881.html", "problem_id": "p02881", "resource_group": "low_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/Pascal/s643927292.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s643927292", "user_id": "u344153701"}, "prompt_components": {"gold_output": "5\n", "input_to_evaluate": "uses crt;\nvar\n s,i,j,n:longint;\n min,a,b:qword;\n ok:boolean;\nbegin\n clrscr;\n read(n);\n ok:=false;\n if n mod 2<>0 then\n begin\n write(n-1);\n exit;\n end else\n for i:=2 to n div 2 do\n begin\n if ok=true then break;\n for j:=1 to n div 2 do\n begin\n b:=i*j;\n if b=n then\n begin\n min:=(i-1)+(j-1);\n ok:=true;\n break;\n end;\n end;\n end;\n ok:=false;\n for i:=2 to n div 2 do\n for j:=1 to n div 2 do\n begin\n b:=i*j;\n if b=n then\n begin\n a:=(i-1)+(j-1);\n if min>a then min:=a;\n end;\n end;\n write(min);\n readln;\n readln;\nend.\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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1096, "cpu_time_ms": 2103, "memory_kb": 128}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s560968796", "group_id": "codeNet:p02881", "input_text": "uses crt;\nvar n,a:qword;\ni,j:longint;\nbegin\n clrscr;\n readln(n);\n a:=0;\n for i:=2 to n div 2 do\n begin\n for j:=1 to i do\n if i*j= n then begin a:=i+j-2;break;end;\n if a>0 then break;\n end;\n write(a);\n readln\nend.\n", "language": "Pascal", "metadata": {"date": 1577461766, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p02881.html", "problem_id": "p02881", "resource_group": "low_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/Pascal/s560968796.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s560968796", "user_id": "u684763923"}, "prompt_components": {"gold_output": "5\n", "input_to_evaluate": "uses crt;\nvar n,a:qword;\ni,j:longint;\nbegin\n clrscr;\n readln(n);\n a:=0;\n for i:=2 to n div 2 do\n begin\n for j:=1 to i do\n if i*j= n then begin a:=i+j-2;break;end;\n if a>0 then break;\n end;\n write(a);\n readln\nend.\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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 290, "cpu_time_ms": 2103, "memory_kb": 128}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s010328167", "group_id": "codeNet:p02881", "input_text": "var n,t,min:int64;\ni:longword;\nbegin\n read(n);\n for i:=1 to round(sqrt(n)) do\n begin\n if n mod i=0 then\n begin\n t:=n div i;\n min:=i-1+t-1;\n end;\n end;\n write(min);\nend.", "language": "Pascal", "metadata": {"date": 1577459916, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p02881.html", "problem_id": "p02881", "resource_group": "low_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/Pascal/s010328167.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s010328167", "user_id": "u102904647"}, "prompt_components": {"gold_output": "5\n", "input_to_evaluate": "var n,t,min:int64;\ni:longword;\nbegin\n read(n);\n for i:=1 to round(sqrt(n)) do\n begin\n if n mod i=0 then\n begin\n t:=n div i;\n min:=i-1+t-1;\n end;\n end;\n write(min);\nend.", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 11, "memory_kb": 128}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s264515639", "group_id": "codeNet:p02881", "input_text": "var\n\ti,N,q,r,ans: Integer;\n \n \nbegin\n\treadln(N);\n ans := 1;\n i := trunc(sqrt(N));\n \n while ans = 1 do\n begin\n q := N div i;\n r := N mod i;\n if r = 0 then\n ans -= 1\n else\n i -= 1;\n end;\n \n writeln(q+i-2);\n \nend.", "language": "Pascal", "metadata": {"date": 1572988648, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p02881.html", "problem_id": "p02881", "resource_group": "low_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/Pascal/s264515639.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s264515639", "user_id": "u305562584"}, "prompt_components": {"gold_output": "5\n", "input_to_evaluate": "var\n\ti,N,q,r,ans: Integer;\n \n \nbegin\n\treadln(N);\n ans := 1;\n i := trunc(sqrt(N));\n \n while ans = 1 do\n begin\n q := N div i;\n r := N mod i;\n if r = 0 then\n ans -= 1\n else\n i -= 1;\n end;\n \n writeln(q+i-2);\n \nend.", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s613966042", "group_id": "codeNet:p02881", "input_text": "Var n,ans:Qword;\n i:Longint;\nFunction prime(n:Qword):Boolean;\n Var i:Longint;\n OK:Boolean;\n Begin\n OK:=n>=2;\n For i:=2 to trunc(sqrt(n)) do\n If n mod i = 0 then begin\n OK:=False; Break;\n End;\n Exit(OK);\n End;\nBegin\n Readln(n);\n If prime(n) then writeln(n-1)\n Else begin\n For i:=trunc(sqrt(n)) downto 2 do\n If n mod i = 0 then begin\n ans:=(i-1)+(n div i -1); Break;\n End;\n Writeln(ans);\n End;\nEnd.", "language": "Pascal", "metadata": {"date": 1572225007, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p02881.html", "problem_id": "p02881", "resource_group": "low_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/Pascal/s613966042.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s613966042", "user_id": "u866155170"}, "prompt_components": {"gold_output": "5\n", "input_to_evaluate": "Var n,ans:Qword;\n i:Longint;\nFunction prime(n:Qword):Boolean;\n Var i:Longint;\n OK:Boolean;\n Begin\n OK:=n>=2;\n For i:=2 to trunc(sqrt(n)) do\n If n mod i = 0 then begin\n OK:=False; Break;\n End;\n Exit(OK);\n End;\nBegin\n Readln(n);\n If prime(n) then writeln(n-1)\n Else begin\n For i:=trunc(sqrt(n)) downto 2 do\n If n mod i = 0 then begin\n ans:=(i-1)+(n div i -1); Break;\n End;\n Writeln(ans);\n End;\nEnd.", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 11, "memory_kb": 128}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s028899702", "group_id": "codeNet:p02881", "input_text": "var\n\tX,i,ans,now:int64;\nbegin\n\tread(X);\n\ti:=1;\n\tans:=X+1;\n\twhile i*i<=X do begin\n\t\tif X mod i=0 then begin\n\t\t\tnow:=i-1+(X div i)-1;\n\t\t\tif ans>now then ans:=now;\n\t\tend;\n\t\tinc(i);\n\tend;\n\twriteln(ans);\nend.\n", "language": "Pascal", "metadata": {"date": 1572224807, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p02881.html", "problem_id": "p02881", "resource_group": "low_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/Pascal/s028899702.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s028899702", "user_id": "u657913472"}, "prompt_components": {"gold_output": "5\n", "input_to_evaluate": "var\n\tX,i,ans,now:int64;\nbegin\n\tread(X);\n\ti:=1;\n\tans:=X+1;\n\twhile i*i<=X do begin\n\t\tif X mod i=0 then begin\n\t\t\tnow:=i-1+(X div i)-1;\n\t\t\tif ans>now then ans:=now;\n\t\tend;\n\t\tinc(i);\n\tend;\n\twriteln(ans);\nend.\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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 11, "memory_kb": 128}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s747300249", "group_id": "codeNet:p02887", "input_text": "var s:ansistring;\n n,t,i:longint;\nbegin\n readln(n);\n readln(s);\n for t:=2 to n do\n inc(i,ord(s[t]<>s[t-1]));\n writeln(i+1);\nend.", "language": "Pascal", "metadata": {"date": 1588290794, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p02887.html", "problem_id": "p02887", "resource_group": "low_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/Pascal/s747300249.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s747300249", "user_id": "u743614777"}, "prompt_components": {"gold_output": "5\n", "input_to_evaluate": "var s:ansistring;\n n,t,i:longint;\nbegin\n readln(n);\n readln(s);\n for t:=2 to n do\n inc(i,ord(s[t]<>s[t-1]));\n writeln(i+1);\nend.", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s710145096", "group_id": "codeNet:p02887", "input_text": "var\n\tN,i,A:Longint;\n\tS:String;\nbegin\n\treadln(N);\n\treadln(S);\n\tfor i:=1 to N do if S[i-1]<>S[i]then inc(A);\n\twriteln(A);\nend.", "language": "Pascal", "metadata": {"date": 1571559552, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p02887.html", "problem_id": "p02887", "resource_group": "low_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/Pascal/s710145096.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s710145096", "user_id": "u657913472"}, "prompt_components": {"gold_output": "5\n", "input_to_evaluate": "var\n\tN,i,A:Longint;\n\tS:String;\nbegin\n\treadln(N);\n\treadln(S);\n\tfor i:=1 to N do if S[i-1]<>S[i]then inc(A);\n\twriteln(A);\nend.", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 124, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s734990625", "group_id": "codeNet:p02888", "input_text": "var\n n,i,j,k,sum:longint;\n a:array[0..10010] of longint;\nbegin\n readln(n);\nfor i:=1 to n do read(a[i]);\nfor i:=1 to n-2 do\n for j:=i+1 to n-1 do\n if j<>i then\n for k:=j+1 to n do\n if (j<>k) and (a[i]+a[j]>a[k]) and (a[i]+a[k]>a[j]) and (a[j]+a[k]>a[i]) then inc(sum);\n write(sum);\nend.", "language": "Pascal", "metadata": {"date": 1571964654, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p02888.html", "problem_id": "p02888", "resource_group": "low_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/Pascal/s734990625.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s734990625", "user_id": "u929274582"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "var\n n,i,j,k,sum:longint;\n a:array[0..10010] of longint;\nbegin\n readln(n);\nfor i:=1 to n do read(a[i]);\nfor i:=1 to n-2 do\n for j:=i+1 to n-1 do\n if j<>i then\n for k:=j+1 to n do\n if (j<>k) and (a[i]+a[j]>a[k]) and (a[i]+a[k]>a[j]) and (a[j]+a[k]>a[i]) then inc(sum);\n write(sum);\nend.", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 2103, "memory_kb": 128}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s528780483", "group_id": "codeNet:p02890", "input_text": "var\n\tN,i,t,A,acc:Longint;\n\tcnt,ans:Array[1..300000]of Longint;\n\tsum:Array[0..300000]of Longint;\nbegin\n\tread(N);\n\tfor i:=1 to N do begin\n\t\tread(A);\n\t\tinc(sum[cnt[A]]);\n\t\tinc(cnt[A]);\n\tend;\n\ti:=0;\n\tfor t:=N downto 1 do begin\n\t\twhile acc>=i*t do begin\n\t\t\tinc(acc,sum[i]);\n\t\t\tinc(i);\n\t\tend;\n\t\tans[t]:=i-1;\n\tend;\n\tfor i:=1 to N do writeln(ans[i]);\nend.", "language": "Pascal", "metadata": {"date": 1571555726, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p02890.html", "problem_id": "p02890", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02890/input.txt", "sample_output_relpath": "derived/input_output/data/p02890/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02890/Pascal/s528780483.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s528780483", "user_id": "u657913472"}, "prompt_components": {"gold_output": "3\n1\n0\n", "input_to_evaluate": "var\n\tN,i,t,A,acc:Longint;\n\tcnt,ans:Array[1..300000]of Longint;\n\tsum:Array[0..300000]of Longint;\nbegin\n\tread(N);\n\tfor i:=1 to N do begin\n\t\tread(A);\n\t\tinc(sum[cnt[A]]);\n\t\tinc(cnt[A]);\n\tend;\n\ti:=0;\n\tfor t:=N downto 1 do begin\n\t\twhile acc>=i*t do begin\n\t\t\tinc(acc,sum[i]);\n\t\t\tinc(i);\n\t\tend;\n\t\tans[t]:=i-1;\n\tend;\n\tfor i:=1 to N do writeln(ans[i]);\nend.", "problem_context": "Score : 600 points\n\nProblem Statement\n\nTakahashi has N cards. The i-th of these cards has an integer A_i written on it.\n\nTakahashi will choose an integer K, and then repeat the following operation some number of times:\n\nChoose exactly K cards such that the integers written on them are all different, and eat those cards. (The eaten cards disappear.)\n\nFor each K = 1,2, \\ldots, N, find the maximum number of times Takahashi can do the operation.\n\nConstraints\n\n1 \\le N \\le 3 \\times 10^5\n\n1 \\le A_i \\le 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 \\ldots A_N\n\nOutput\n\nPrint N integers.\nThe t-th (1 \\le t \\le N) of them should be the answer for the case K=t.\n\nSample Input 1\n\n3\n2 1 2\n\nSample Output 1\n\n3\n1\n0\n\nFor K = 1, we can do the operation as follows:\n\nChoose the first card to eat.\n\nChoose the second card to eat.\n\nChoose the third card to eat.\n\nFor K = 2, we can do the operation as follows:\n\nChoose the first and second cards to eat.\n\nFor K = 3, we cannot do the operation at all. Note that we cannot choose the first and third cards at the same time.\n\nSample Input 2\n\n5\n1 2 3 4 5\n\nSample Output 2\n\n5\n2\n1\n1\n1\n\nSample Input 3\n\n4\n1 3 3 3\n\nSample Output 3\n\n4\n1\n0\n0", "sample_input": "3\n2 1 2\n"}, "reference_outputs": ["3\n1\n0\n"], "source_document_id": "p02890", "source_text": "Score : 600 points\n\nProblem Statement\n\nTakahashi has N cards. The i-th of these cards has an integer A_i written on it.\n\nTakahashi will choose an integer K, and then repeat the following operation some number of times:\n\nChoose exactly K cards such that the integers written on them are all different, and eat those cards. (The eaten cards disappear.)\n\nFor each K = 1,2, \\ldots, N, find the maximum number of times Takahashi can do the operation.\n\nConstraints\n\n1 \\le N \\le 3 \\times 10^5\n\n1 \\le A_i \\le 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 \\ldots A_N\n\nOutput\n\nPrint N integers.\nThe t-th (1 \\le t \\le N) of them should be the answer for the case K=t.\n\nSample Input 1\n\n3\n2 1 2\n\nSample Output 1\n\n3\n1\n0\n\nFor K = 1, we can do the operation as follows:\n\nChoose the first card to eat.\n\nChoose the second card to eat.\n\nChoose the third card to eat.\n\nFor K = 2, we can do the operation as follows:\n\nChoose the first and second cards to eat.\n\nFor K = 3, we cannot do the operation at all. Note that we cannot choose the first and third cards at the same time.\n\nSample Input 2\n\n5\n1 2 3 4 5\n\nSample Output 2\n\n5\n2\n1\n1\n1\n\nSample Input 3\n\n4\n1 3 3 3\n\nSample Output 3\n\n4\n1\n0\n0", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 347, "cpu_time_ms": 57, "memory_kb": 3072}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s591784845", "group_id": "codeNet:p02897", "input_text": "VAR\n n, le : longint ;\n x, y : real ;\nBEGIN\n readln(n) ;\n if n = 1 then \n begin\n writeln('1.0000000000') ;\n halt ;\n end else\n if ( n mod 2 = 0 ) then le := n div 2 else le := n div 2 + 1 ;\n y := n ;\n x := le ;\n writeln(x/y:0:10) ;\nEND.", "language": "Pascal", "metadata": {"date": 1569724572, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p02897.html", "problem_id": "p02897", "resource_group": "low_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/Pascal/s591784845.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s591784845", "user_id": "u731409129"}, "prompt_components": {"gold_output": "0.5000000000\n", "input_to_evaluate": "VAR\n n, le : longint ;\n x, y : real ;\nBEGIN\n readln(n) ;\n if n = 1 then \n begin\n writeln('1.0000000000') ;\n halt ;\n end else\n if ( n mod 2 = 0 ) then le := n div 2 else le := n div 2 + 1 ;\n y := n ;\n x := le ;\n writeln(x/y:0:10) ;\nEND.", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s348854837", "group_id": "codeNet:p02898", "input_text": "VAR\n n, k, d, x, i : longint ;\nBEGIN\n readln(n,k) ;\n d := 0;\n for i := 1 to n do \n begin\n read(x) ;\n if x >= k then inc(d) ;\n end ;\n writeln(d) ;\nEND.", "language": "Pascal", "metadata": {"date": 1569722215, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p02898.html", "problem_id": "p02898", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02898/input.txt", "sample_output_relpath": "derived/input_output/data/p02898/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02898/Pascal/s348854837.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s348854837", "user_id": "u731409129"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "VAR\n n, k, d, x, i : longint ;\nBEGIN\n readln(n,k) ;\n d := 0;\n for i := 1 to n do \n begin\n read(x) ;\n if x >= k then inc(d) ;\n end ;\n writeln(d) ;\nEND.", "problem_context": "Score : 200 points\n\nProblem Statement\n\nN friends of Takahashi has come to a theme park.\n\nTo ride the most popular roller coaster in the park, you must be at least K centimeters tall.\n\nThe i-th friend is h_i centimeters tall.\n\nHow many of the Takahashi's friends can ride the roller coaster?\n\nConstraints\n\n1 \\le N \\le 10^5\n\n1 \\le K \\le 500\n\n1 \\le h_i \\le 500\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nh_1 h_2 \\ldots h_N\n\nOutput\n\nPrint the number of people among the Takahashi's friends who can ride the roller coaster.\n\nSample Input 1\n\n4 150\n150 140 100 200\n\nSample Output 1\n\n2\n\nTwo of them can ride the roller coaster: the first and fourth friends.\n\nSample Input 2\n\n1 500\n499\n\nSample Output 2\n\n0\n\nSample Input 3\n\n5 1\n100 200 300 400 500\n\nSample Output 3\n\n5", "sample_input": "4 150\n150 140 100 200\n"}, "reference_outputs": ["2\n"], "source_document_id": "p02898", "source_text": "Score : 200 points\n\nProblem Statement\n\nN friends of Takahashi has come to a theme park.\n\nTo ride the most popular roller coaster in the park, you must be at least K centimeters tall.\n\nThe i-th friend is h_i centimeters tall.\n\nHow many of the Takahashi's friends can ride the roller coaster?\n\nConstraints\n\n1 \\le N \\le 10^5\n\n1 \\le K \\le 500\n\n1 \\le h_i \\le 500\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nh_1 h_2 \\ldots h_N\n\nOutput\n\nPrint the number of people among the Takahashi's friends who can ride the roller coaster.\n\nSample Input 1\n\n4 150\n150 140 100 200\n\nSample Output 1\n\n2\n\nTwo of them can ride the roller coaster: the first and fourth friends.\n\nSample Input 2\n\n1 500\n499\n\nSample Output 2\n\n0\n\nSample Input 3\n\n5 1\n100 200 300 400 500\n\nSample Output 3\n\n5", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 171, "cpu_time_ms": 9, "memory_kb": 128}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s203227181", "group_id": "codeNet:p02899", "input_text": "VAR\n b : array [0..100000] of longint ;\n x, i, n : longint ;\nBEGIN\n readln(n) ;\n for i := 1 to n do\n begin\n read(x) ;\n b[x] := i ;\n end ;\n for i := 1 to 100000 do\n if b[i] <> 0 then write(b[i],#32) ;\n writeln ;\nEND.", "language": "Pascal", "metadata": {"date": 1569723876, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p02899.html", "problem_id": "p02899", "resource_group": "low_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/Pascal/s203227181.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s203227181", "user_id": "u731409129"}, "prompt_components": {"gold_output": "3 1 2\n", "input_to_evaluate": "VAR\n b : array [0..100000] of longint ;\n x, i, n : longint ;\nBEGIN\n readln(n) ;\n for i := 1 to n do\n begin\n read(x) ;\n b[x] := i ;\n end ;\n for i := 1 to 100000 do\n if b[i] <> 0 then write(b[i],#32) ;\n writeln ;\nEND.", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 25, "memory_kb": 1024}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s697664771", "group_id": "codeNet:p02902", "input_text": "var\n\tN,M,i,u,v,id:Longint;\n\tGv,Gp:Array[1..2000]of Longint;\n\tGi:Array[1..1000]of Longint;\n\tcnt:Array[1..1000]of Longint;\n\tQ:Array[1..1000]of Longint;\n\tQs:Longint;\nbegin\n\tread(N,M);if (N=1000)and(00 then begin\n\t\t\tGp[i]:=Gi[u];\n\t\tend;\n\t\tGi[u]:=i;\n\t\tinc(cnt[v]);\n\tend;\n\tfor i:=1 to N do begin\n\t\tif cnt[i]=0 then begin\n\t\t\tinc(Qs);\n\t\t\tQ[Qs]:=i;\n\t\tend;\n\tend;\n\tid:=1;\n\twhile id<=Qs do begin\n\t\tu:=Q[id];\n\t\tinc(id);\n\t\ti:=Gi[u];\n\t\twhile i<>0 do begin\n\t\t\tdec(cnt[Gv[i]]);\n\t\t\tif cnt[Gv[i]]=0 then begin\n\t\t\t\tinc(Qs);\n\t\t\t\tQ[Qs]:=Gv[i];\n\t\t\tend;\n\t\t\ti:=Gp[i];\n\t\tend;\n\tend;\n\tif Qs0 then begin\n\t\t\tGp[i]:=Gi[u];\n\t\tend;\n\t\tGi[u]:=i;\n\t\tinc(cnt[v]);\n\tend;\n\tfor i:=1 to N do begin\n\t\tif cnt[i]=0 then begin\n\t\t\tinc(Qs);\n\t\t\tQ[Qs]:=i;\n\t\tend;\n\tend;\n\tid:=1;\n\twhile id<=Qs do begin\n\t\tu:=Q[id];\n\t\tinc(id);\n\t\ti:=Gi[u];\n\t\twhile i<>0 do begin\n\t\t\tdec(cnt[Gv[i]]);\n\t\t\tif cnt[Gv[i]]=0 then begin\n\t\t\t\tinc(Qs);\n\t\t\t\tQ[Qs]:=Gv[i];\n\t\t\tend;\n\t\t\ti:=Gp[i];\n\t\tend;\n\tend;\n\tif Qs0 then begin\n\t\t\tGp[i]:=Gi[u];\n\t\tend;\n\t\tGi[u]:=i;\n\t\tinc(cnt[v]);\n\tend;\n\tfor i:=1 to N do begin\n\t\tif cnt[i]=0 then begin\n\t\t\tinc(Qs);\n\t\t\tQ[Qs]:=i;\n\t\tend;\n\tend;\n\tid:=1;\n\twhile id<=Qs do begin\n\t\tu:=Q[id];\n\t\tinc(id);\n\t\ti:=Gi[u];\n\t\twhile i<>0 do begin\n\t\t\tdec(cnt[Gv[i]]);\n\t\t\tif cnt[Gv[i]]=0 then begin\n\t\t\t\tinc(Qs);\n\t\t\t\tQ[Qs]:=Gv[i];\n\t\t\tend;\n\t\t\ti:=Gp[i];\n\t\tend;\n\tend;\n\tif Qs0 then begin\n\t\t\tGp[i]:=Gi[u];\n\t\tend;\n\t\tGi[u]:=i;\n\t\tinc(cnt[v]);\n\tend;\n\tfor i:=1 to N do begin\n\t\tif cnt[i]=0 then begin\n\t\t\tinc(Qs);\n\t\t\tQ[Qs]:=i;\n\t\tend;\n\tend;\n\tid:=1;\n\twhile id<=Qs do begin\n\t\tu:=Q[id];\n\t\tinc(id);\n\t\ti:=Gi[u];\n\t\twhile i<>0 do begin\n\t\t\tdec(cnt[Gv[i]]);\n\t\t\tif cnt[Gv[i]]=0 then begin\n\t\t\t\tinc(Qs);\n\t\t\t\tQ[Qs]:=Gv[i];\n\t\t\tend;\n\t\t\ti:=Gp[i];\n\t\tend;\n\tend;\n\tif Qs0 then begin\n\t\t\tGp[i]:=Gi[u];\n\t\tend;\n\t\tGi[u]:=i;\n\t\tinc(cnt[v]);\n\tend;\n\tfor i:=1 to N do begin\n\t\tif cnt[i]=0 then begin\n\t\t\tinc(Qs);\n\t\t\tQ[Qs]:=i;\n\t\tend;\n\tend;\n\tid:=1;\n\twhile id<=Qs do begin\n\t\tu:=Q[id];\n\t\tinc(id);\n\t\ti:=Gi[u];\n\t\twhile i<>0 do begin\n\t\t\tdec(cnt[Gv[i]]);\n\t\t\tif cnt[Gv[i]]=0 then begin\n\t\t\t\tinc(Qs);\n\t\t\t\tQ[Qs]:=Gv[i];\n\t\t\tend;\n\t\t\ti:=Gp[i];\n\t\tend;\n\tend;\n\tif Qs0 then begin\n\t\t\tGp[i]:=Gi[u];\n\t\tend;\n\t\tGi[u]:=i;\n\t\tinc(cnt[v]);\n\tend;\n\tfor i:=1 to N do begin\n\t\tif cnt[i]=0 then begin\n\t\t\tinc(Qs);\n\t\t\tQ[Qs]:=i;\n\t\tend;\n\tend;\n\tid:=1;\n\twhile id<=Qs do begin\n\t\tu:=Q[id];\n\t\tinc(id);\n\t\ti:=Gi[u];\n\t\twhile i<>0 do begin\n\t\t\tdec(cnt[Gv[i]]);\n\t\t\tif cnt[Gv[i]]=0 then begin\n\t\t\t\tinc(Qs);\n\t\t\t\tQ[Qs]:=Gv[i];\n\t\t\tend;\n\t\t\ti:=Gp[i];\n\t\tend;\n\tend;\n\tif Qs=h[y])and(y<=n) do\n begin\n a[i]:=a[i]+1;x:=y;y:=y+1;\n end;\n end;\n x:=0;\n for i:=1 to n do\n if a[i]>x then x:=a[i];\n writeln(x);\nend.", "language": "Pascal", "metadata": {"date": 1570225775, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p02923.html", "problem_id": "p02923", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02923/input.txt", "sample_output_relpath": "derived/input_output/data/p02923/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02923/Pascal/s577247835.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s577247835", "user_id": "u018679195"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "var\n n,i,x,y:longint;\n h,a:array[1..100000]of longint;\nbegin\n readln(n);\n for i:=1 to n do\n begin\n read(h[i]);a[i]:=0;\n end;\n for i:=1 to n-1 do\n begin\n x:=i;y:=i+1;\n while (h[x]>=h[y])and(y<=n) do\n begin\n a[i]:=a[i]+1;x:=y;y:=y+1;\n end;\n end;\n x:=0;\n for i:=1 to n do\n if a[i]>x then x:=a[i];\n writeln(x);\nend.", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere are N squares arranged in a row from left to right.\n\nThe height of the i-th square from the left is H_i.\n\nYou will land on a square of your choice, then repeat moving to the adjacent square on the right as long as the height of the next square is not greater than that of the current square.\n\nFind the maximum number of times you can move.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 10^5\n\n1 \\leq H_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nH_1 H_2 ... H_N\n\nOutput\n\nPrint the maximum number of times you can move.\n\nSample Input 1\n\n5\n10 4 8 7 3\n\nSample Output 1\n\n2\n\nBy landing on the third square from the left, you can move to the right twice.\n\nSample Input 2\n\n7\n4 4 5 6 6 5 5\n\nSample Output 2\n\n3\n\nBy landing on the fourth square from the left, you can move to the right three times.\n\nSample Input 3\n\n4\n1 2 3 4\n\nSample Output 3\n\n0", "sample_input": "5\n10 4 8 7 3\n"}, "reference_outputs": ["2\n"], "source_document_id": "p02923", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere are N squares arranged in a row from left to right.\n\nThe height of the i-th square from the left is H_i.\n\nYou will land on a square of your choice, then repeat moving to the adjacent square on the right as long as the height of the next square is not greater than that of the current square.\n\nFind the maximum number of times you can move.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 10^5\n\n1 \\leq H_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nH_1 H_2 ... H_N\n\nOutput\n\nPrint the maximum number of times you can move.\n\nSample Input 1\n\n5\n10 4 8 7 3\n\nSample Output 1\n\n2\n\nBy landing on the third square from the left, you can move to the right twice.\n\nSample Input 2\n\n7\n4 4 5 6 6 5 5\n\nSample Output 2\n\n3\n\nBy landing on the fourth square from the left, you can move to the right three times.\n\nSample Input 3\n\n4\n1 2 3 4\n\nSample Output 3\n\n0", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 2103, "memory_kb": 896}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s320109647", "group_id": "codeNet:p02923", "input_text": "var\n n,i,j:longint;\n h,a:array[1..100000]of longint;\nbegin\n readln(n);\n for i:=1 to n do\n begin\n read(h[i]);a[i]:=0;\n end;\n for i:=1 to n-1 do\n for j:=i+1 to n do\n if h[i]>=h[j] then a[i]:=a[i]+1\n else break;\n j:=0;\n for i:=1 to n do\n if a[i]>j then j:=a[i];\n writeln(j);\nend.", "language": "Pascal", "metadata": {"date": 1570220218, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p02923.html", "problem_id": "p02923", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02923/input.txt", "sample_output_relpath": "derived/input_output/data/p02923/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02923/Pascal/s320109647.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s320109647", "user_id": "u863370423"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "var\n n,i,j:longint;\n h,a:array[1..100000]of longint;\nbegin\n readln(n);\n for i:=1 to n do\n begin\n read(h[i]);a[i]:=0;\n end;\n for i:=1 to n-1 do\n for j:=i+1 to n do\n if h[i]>=h[j] then a[i]:=a[i]+1\n else break;\n j:=0;\n for i:=1 to n do\n if a[i]>j then j:=a[i];\n writeln(j);\nend.", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere are N squares arranged in a row from left to right.\n\nThe height of the i-th square from the left is H_i.\n\nYou will land on a square of your choice, then repeat moving to the adjacent square on the right as long as the height of the next square is not greater than that of the current square.\n\nFind the maximum number of times you can move.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 10^5\n\n1 \\leq H_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nH_1 H_2 ... H_N\n\nOutput\n\nPrint the maximum number of times you can move.\n\nSample Input 1\n\n5\n10 4 8 7 3\n\nSample Output 1\n\n2\n\nBy landing on the third square from the left, you can move to the right twice.\n\nSample Input 2\n\n7\n4 4 5 6 6 5 5\n\nSample Output 2\n\n3\n\nBy landing on the fourth square from the left, you can move to the right three times.\n\nSample Input 3\n\n4\n1 2 3 4\n\nSample Output 3\n\n0", "sample_input": "5\n10 4 8 7 3\n"}, "reference_outputs": ["2\n"], "source_document_id": "p02923", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere are N squares arranged in a row from left to right.\n\nThe height of the i-th square from the left is H_i.\n\nYou will land on a square of your choice, then repeat moving to the adjacent square on the right as long as the height of the next square is not greater than that of the current square.\n\nFind the maximum number of times you can move.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 10^5\n\n1 \\leq H_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nH_1 H_2 ... H_N\n\nOutput\n\nPrint the maximum number of times you can move.\n\nSample Input 1\n\n5\n10 4 8 7 3\n\nSample Output 1\n\n2\n\nBy landing on the third square from the left, you can move to the right twice.\n\nSample Input 2\n\n7\n4 4 5 6 6 5 5\n\nSample Output 2\n\n3\n\nBy landing on the fourth square from the left, you can move to the right three times.\n\nSample Input 3\n\n4\n1 2 3 4\n\nSample Output 3\n\n0", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 295, "cpu_time_ms": 2103, "memory_kb": 896}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s098813851", "group_id": "codeNet:p02927", "input_text": "var m,d,i,j,ans,one,ten:integer;\nbegin\n readln(m,d);\n ans:=0;\n for i:=4 to m do\n begin\n for j:=22 to d do\n begin\n one:=j mod 10;\n ten:=j div 10;\n if m=one*ten then inc(ans);\n end;\n end;\n writeln(ans);\nend.\n", "language": "Pascal", "metadata": {"date": 1566699652, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p02927.html", "problem_id": "p02927", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02927/input.txt", "sample_output_relpath": "derived/input_output/data/p02927/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02927/Pascal/s098813851.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s098813851", "user_id": "u805277811"}, "prompt_components": {"gold_output": "10\n", "input_to_evaluate": "var m,d,i,j,ans,one,ten:integer;\nbegin\n readln(m,d);\n ans:=0;\n for i:=4 to m do\n begin\n for j:=22 to d do\n begin\n one:=j mod 10;\n ten:=j div 10;\n if m=one*ten then inc(ans);\n end;\n end;\n writeln(ans);\nend.\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nToday is August 24, one of the five Product Days in a year.\n\nA date m-d (m is the month, d is the date) is called a Product Day when d is a two-digit number, and all of the following conditions are satisfied (here d_{10} is the tens digit of the day and d_1 is the ones digit of the day):\n\nd_1 \\geq 2\n\nd_{10} \\geq 2\n\nd_1 \\times d_{10} = m\n\nTakahashi wants more Product Days, and he made a new calendar called Takahashi Calendar where a year consists of M month from Month 1 to Month M, and each month consists of D days from Day 1 to Day D.\n\nIn Takahashi Calendar, how many Product Days does a year have?\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq M \\leq 100\n\n1 \\leq D \\leq 99\n\nInput\n\nInput is given from Standard Input in the following format:\n\nM D\n\nOutput\n\nPrint the number of Product Days in a year in Takahashi Calender.\n\nSample Input 1\n\n15 40\n\nSample Output 1\n\n10\n\nThere are 10 Product Days in a year, as follows (m-d denotes Month m, Day d):\n\n4-22\n\n6-23\n\n6-32\n\n8-24\n\n9-33\n\n10-25\n\n12-26\n\n12-34\n\n14-27\n\n15-35\n\nSample Input 2\n\n12 31\n\nSample Output 2\n\n5\n\nSample Input 3\n\n1 1\n\nSample Output 3\n\n0", "sample_input": "15 40\n"}, "reference_outputs": ["10\n"], "source_document_id": "p02927", "source_text": "Score : 200 points\n\nProblem Statement\n\nToday is August 24, one of the five Product Days in a year.\n\nA date m-d (m is the month, d is the date) is called a Product Day when d is a two-digit number, and all of the following conditions are satisfied (here d_{10} is the tens digit of the day and d_1 is the ones digit of the day):\n\nd_1 \\geq 2\n\nd_{10} \\geq 2\n\nd_1 \\times d_{10} = m\n\nTakahashi wants more Product Days, and he made a new calendar called Takahashi Calendar where a year consists of M month from Month 1 to Month M, and each month consists of D days from Day 1 to Day D.\n\nIn Takahashi Calendar, how many Product Days does a year have?\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq M \\leq 100\n\n1 \\leq D \\leq 99\n\nInput\n\nInput is given from Standard Input in the following format:\n\nM D\n\nOutput\n\nPrint the number of Product Days in a year in Takahashi Calender.\n\nSample Input 1\n\n15 40\n\nSample Output 1\n\n10\n\nThere are 10 Product Days in a year, as follows (m-d denotes Month m, Day d):\n\n4-22\n\n6-23\n\n6-32\n\n8-24\n\n9-33\n\n10-25\n\n12-26\n\n12-34\n\n14-27\n\n15-35\n\nSample Input 2\n\n12 31\n\nSample Output 2\n\n5\n\nSample Input 3\n\n1 1\n\nSample Output 3\n\n0", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s979981291", "group_id": "codeNet:p02927", "input_text": "var m,d,i,j,ans,one,ten:integer;\nbegin\n readln(m,d);\n ans:=0;\n for i:=1 to m do\n begin\n for j:=1 to d do\n begin\n one:=j mod 10;\n ten:=j div 10;\n if i=one*ten then inc(ans);\n end;\n end;\n writeln(ans);\nend.\n", "language": "Pascal", "metadata": {"date": 1566699528, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p02927.html", "problem_id": "p02927", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02927/input.txt", "sample_output_relpath": "derived/input_output/data/p02927/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02927/Pascal/s979981291.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s979981291", "user_id": "u805277811"}, "prompt_components": {"gold_output": "10\n", "input_to_evaluate": "var m,d,i,j,ans,one,ten:integer;\nbegin\n readln(m,d);\n ans:=0;\n for i:=1 to m do\n begin\n for j:=1 to d do\n begin\n one:=j mod 10;\n ten:=j div 10;\n if i=one*ten then inc(ans);\n end;\n end;\n writeln(ans);\nend.\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nToday is August 24, one of the five Product Days in a year.\n\nA date m-d (m is the month, d is the date) is called a Product Day when d is a two-digit number, and all of the following conditions are satisfied (here d_{10} is the tens digit of the day and d_1 is the ones digit of the day):\n\nd_1 \\geq 2\n\nd_{10} \\geq 2\n\nd_1 \\times d_{10} = m\n\nTakahashi wants more Product Days, and he made a new calendar called Takahashi Calendar where a year consists of M month from Month 1 to Month M, and each month consists of D days from Day 1 to Day D.\n\nIn Takahashi Calendar, how many Product Days does a year have?\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq M \\leq 100\n\n1 \\leq D \\leq 99\n\nInput\n\nInput is given from Standard Input in the following format:\n\nM D\n\nOutput\n\nPrint the number of Product Days in a year in Takahashi Calender.\n\nSample Input 1\n\n15 40\n\nSample Output 1\n\n10\n\nThere are 10 Product Days in a year, as follows (m-d denotes Month m, Day d):\n\n4-22\n\n6-23\n\n6-32\n\n8-24\n\n9-33\n\n10-25\n\n12-26\n\n12-34\n\n14-27\n\n15-35\n\nSample Input 2\n\n12 31\n\nSample Output 2\n\n5\n\nSample Input 3\n\n1 1\n\nSample Output 3\n\n0", "sample_input": "15 40\n"}, "reference_outputs": ["10\n"], "source_document_id": "p02927", "source_text": "Score : 200 points\n\nProblem Statement\n\nToday is August 24, one of the five Product Days in a year.\n\nA date m-d (m is the month, d is the date) is called a Product Day when d is a two-digit number, and all of the following conditions are satisfied (here d_{10} is the tens digit of the day and d_1 is the ones digit of the day):\n\nd_1 \\geq 2\n\nd_{10} \\geq 2\n\nd_1 \\times d_{10} = m\n\nTakahashi wants more Product Days, and he made a new calendar called Takahashi Calendar where a year consists of M month from Month 1 to Month M, and each month consists of D days from Day 1 to Day D.\n\nIn Takahashi Calendar, how many Product Days does a year have?\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq M \\leq 100\n\n1 \\leq D \\leq 99\n\nInput\n\nInput is given from Standard Input in the following format:\n\nM D\n\nOutput\n\nPrint the number of Product Days in a year in Takahashi Calender.\n\nSample Input 1\n\n15 40\n\nSample Output 1\n\n10\n\nThere are 10 Product Days in a year, as follows (m-d denotes Month m, Day d):\n\n4-22\n\n6-23\n\n6-32\n\n8-24\n\n9-33\n\n10-25\n\n12-26\n\n12-34\n\n14-27\n\n15-35\n\nSample Input 2\n\n12 31\n\nSample Output 2\n\n5\n\nSample Input 3\n\n1 1\n\nSample Output 3\n\n0", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s063280763", "group_id": "codeNet:p02927", "input_text": "var m,d,i,j,ans,one,ten:integer;\nbegin\n readln(m,d);\n ans:=0;\n for i:=1 to m do\n begin\n for j:=1 to d do\n begin\n one:=j mod 10;\n ten:=j div 10;\n if m=one*ten then inc(ans);\n end;\n end;\n writeln(ans);\nend.\n", "language": "Pascal", "metadata": {"date": 1566699487, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p02927.html", "problem_id": "p02927", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02927/input.txt", "sample_output_relpath": "derived/input_output/data/p02927/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02927/Pascal/s063280763.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s063280763", "user_id": "u805277811"}, "prompt_components": {"gold_output": "10\n", "input_to_evaluate": "var m,d,i,j,ans,one,ten:integer;\nbegin\n readln(m,d);\n ans:=0;\n for i:=1 to m do\n begin\n for j:=1 to d do\n begin\n one:=j mod 10;\n ten:=j div 10;\n if m=one*ten then inc(ans);\n end;\n end;\n writeln(ans);\nend.\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nToday is August 24, one of the five Product Days in a year.\n\nA date m-d (m is the month, d is the date) is called a Product Day when d is a two-digit number, and all of the following conditions are satisfied (here d_{10} is the tens digit of the day and d_1 is the ones digit of the day):\n\nd_1 \\geq 2\n\nd_{10} \\geq 2\n\nd_1 \\times d_{10} = m\n\nTakahashi wants more Product Days, and he made a new calendar called Takahashi Calendar where a year consists of M month from Month 1 to Month M, and each month consists of D days from Day 1 to Day D.\n\nIn Takahashi Calendar, how many Product Days does a year have?\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq M \\leq 100\n\n1 \\leq D \\leq 99\n\nInput\n\nInput is given from Standard Input in the following format:\n\nM D\n\nOutput\n\nPrint the number of Product Days in a year in Takahashi Calender.\n\nSample Input 1\n\n15 40\n\nSample Output 1\n\n10\n\nThere are 10 Product Days in a year, as follows (m-d denotes Month m, Day d):\n\n4-22\n\n6-23\n\n6-32\n\n8-24\n\n9-33\n\n10-25\n\n12-26\n\n12-34\n\n14-27\n\n15-35\n\nSample Input 2\n\n12 31\n\nSample Output 2\n\n5\n\nSample Input 3\n\n1 1\n\nSample Output 3\n\n0", "sample_input": "15 40\n"}, "reference_outputs": ["10\n"], "source_document_id": "p02927", "source_text": "Score : 200 points\n\nProblem Statement\n\nToday is August 24, one of the five Product Days in a year.\n\nA date m-d (m is the month, d is the date) is called a Product Day when d is a two-digit number, and all of the following conditions are satisfied (here d_{10} is the tens digit of the day and d_1 is the ones digit of the day):\n\nd_1 \\geq 2\n\nd_{10} \\geq 2\n\nd_1 \\times d_{10} = m\n\nTakahashi wants more Product Days, and he made a new calendar called Takahashi Calendar where a year consists of M month from Month 1 to Month M, and each month consists of D days from Day 1 to Day D.\n\nIn Takahashi Calendar, how many Product Days does a year have?\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq M \\leq 100\n\n1 \\leq D \\leq 99\n\nInput\n\nInput is given from Standard Input in the following format:\n\nM D\n\nOutput\n\nPrint the number of Product Days in a year in Takahashi Calender.\n\nSample Input 1\n\n15 40\n\nSample Output 1\n\n10\n\nThere are 10 Product Days in a year, as follows (m-d denotes Month m, Day d):\n\n4-22\n\n6-23\n\n6-32\n\n8-24\n\n9-33\n\n10-25\n\n12-26\n\n12-34\n\n14-27\n\n15-35\n\nSample Input 2\n\n12 31\n\nSample Output 2\n\n5\n\nSample Input 3\n\n1 1\n\nSample Output 3\n\n0", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s581030331", "group_id": "codeNet:p02927", "input_text": "Uses math;\nvar m,d,d1,d10,i,j,k,count:int64;\nbegin\nread(m,d);\ncount:=0;\nd1:=d mod 10;\nd10:= d div 10;\nfor i := 4 to min(m,81) do\nbegin\n for j:= 2 to d10-1 do\n for k:= 2 to 9 do\n if i=j*k then inc(count);\n for k:= 2 to d1 do\n if i=k*d10 then inc(count);\nend;\n\nwrite(count)\nend.", "language": "Pascal", "metadata": {"date": 1566695698, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p02927.html", "problem_id": "p02927", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02927/input.txt", "sample_output_relpath": "derived/input_output/data/p02927/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02927/Pascal/s581030331.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s581030331", "user_id": "u655683235"}, "prompt_components": {"gold_output": "10\n", "input_to_evaluate": "Uses math;\nvar m,d,d1,d10,i,j,k,count:int64;\nbegin\nread(m,d);\ncount:=0;\nd1:=d mod 10;\nd10:= d div 10;\nfor i := 4 to min(m,81) do\nbegin\n for j:= 2 to d10-1 do\n for k:= 2 to 9 do\n if i=j*k then inc(count);\n for k:= 2 to d1 do\n if i=k*d10 then inc(count);\nend;\n\nwrite(count)\nend.", "problem_context": "Score : 200 points\n\nProblem Statement\n\nToday is August 24, one of the five Product Days in a year.\n\nA date m-d (m is the month, d is the date) is called a Product Day when d is a two-digit number, and all of the following conditions are satisfied (here d_{10} is the tens digit of the day and d_1 is the ones digit of the day):\n\nd_1 \\geq 2\n\nd_{10} \\geq 2\n\nd_1 \\times d_{10} = m\n\nTakahashi wants more Product Days, and he made a new calendar called Takahashi Calendar where a year consists of M month from Month 1 to Month M, and each month consists of D days from Day 1 to Day D.\n\nIn Takahashi Calendar, how many Product Days does a year have?\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq M \\leq 100\n\n1 \\leq D \\leq 99\n\nInput\n\nInput is given from Standard Input in the following format:\n\nM D\n\nOutput\n\nPrint the number of Product Days in a year in Takahashi Calender.\n\nSample Input 1\n\n15 40\n\nSample Output 1\n\n10\n\nThere are 10 Product Days in a year, as follows (m-d denotes Month m, Day d):\n\n4-22\n\n6-23\n\n6-32\n\n8-24\n\n9-33\n\n10-25\n\n12-26\n\n12-34\n\n14-27\n\n15-35\n\nSample Input 2\n\n12 31\n\nSample Output 2\n\n5\n\nSample Input 3\n\n1 1\n\nSample Output 3\n\n0", "sample_input": "15 40\n"}, "reference_outputs": ["10\n"], "source_document_id": "p02927", "source_text": "Score : 200 points\n\nProblem Statement\n\nToday is August 24, one of the five Product Days in a year.\n\nA date m-d (m is the month, d is the date) is called a Product Day when d is a two-digit number, and all of the following conditions are satisfied (here d_{10} is the tens digit of the day and d_1 is the ones digit of the day):\n\nd_1 \\geq 2\n\nd_{10} \\geq 2\n\nd_1 \\times d_{10} = m\n\nTakahashi wants more Product Days, and he made a new calendar called Takahashi Calendar where a year consists of M month from Month 1 to Month M, and each month consists of D days from Day 1 to Day D.\n\nIn Takahashi Calendar, how many Product Days does a year have?\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq M \\leq 100\n\n1 \\leq D \\leq 99\n\nInput\n\nInput is given from Standard Input in the following format:\n\nM D\n\nOutput\n\nPrint the number of Product Days in a year in Takahashi Calender.\n\nSample Input 1\n\n15 40\n\nSample Output 1\n\n10\n\nThere are 10 Product Days in a year, as follows (m-d denotes Month m, Day d):\n\n4-22\n\n6-23\n\n6-32\n\n8-24\n\n9-33\n\n10-25\n\n12-26\n\n12-34\n\n14-27\n\n15-35\n\nSample Input 2\n\n12 31\n\nSample Output 2\n\n5\n\nSample Input 3\n\n1 1\n\nSample Output 3\n\n0", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s964619110", "group_id": "codeNet:p02930", "input_text": "var\n\tN,i:Longint;\n\tS:String='1 2 1 3 1 2 1 4 1 2 1 3 1 2 1 5 1 2 1 3 1 2 1 4 1 2 1 3 1 2 1 6 1 2 1 3 1 2 1 4 1 2 1 3 1 2 1 5 1 2 1 3 1 2 1 4 1 2 1 3 1 2 1 7 1 2 1 3 1 2 1 4 1 2 1 3 1 2 1 5 1 2 1 3 1 2 1 4 1 2 1 3 1 2 1 6 1 2 1 3 1 2 1 4 1 2 1 3 1 2 1 5 1 2 1 3 1 2 1 4 1 2 1 3 1 2 1 8 1 2 1 3 1 2 1 4 1 2 1 3 1 2 1 5 1 2 1 3 1 2 1 4 1 2 1 3 1 2 1 6 1 2 1 3 1 2 1 4 1 2 1 3 1 2 1 5 1 2 1 3 1 2 1 4 1 2 1 3 1 2 1 7 1 2 1 3 1 2 1 4 1 2 1 3 1 2 1 5 1 2 1 3 1 2 1 4 1 2 1 3 1 2 1 6 1 2 1 3 1 2 1 4 1 2 1 3 1 2 1 5 1 2 1 3 1 2 1 4 1 2 1 3 1 2 1 9 1 2 1 3 1 2 1 4 1 2 1 3 1 2 1 5 1 2 1 3 1 2 1 4 1 2 1 3 1 2 1 6 1 2 1 3 1 2 1 4 1 2 1 3 1 2 1 5 1 2 1 3 1 2 1 4 1 2 1 3 1 2 1 7 1 2 1 3 1 2 1 4 1 2 1 3 1 2 1 5 1 2 1 3 1 2 1 4 1 2 1 3 1 2 1 6 1 2 1 3 1 2 1 4 1 2 1 3 1 2 1 5 1 2 1 3 1 2 1 4 1 2 1 3 1 2 1 8 1 2 1 3 1 2 1 4 1 2 1 3 1 2 1 5 1 2 1 3 1 2 1 4 1 2 1 3 1 2 1 6 1 2 1 3 1 2 1 4 1 2 1 3 1 2 1 5 1 2 1 3 1 2 1 4 1 2 1 3 1 2 1 7 1 2 1 3 1 2 1 4 1 2 1 3 1 2 1 5 1 2 1 3 1 2 1 4 1 2 1 3 1 2 1 6 1 2 1 3 1 2 1 4 1 2 1 3 1 2 1 5 1 2 1 ';\nbegin\n\tread(N);\n\tfor i:=N-1 downto 1 do write(copy(S,1,i*2));\nend.", "language": "Pascal", "metadata": {"date": 1576751777, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p02930.html", "problem_id": "p02930", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02930/input.txt", "sample_output_relpath": "derived/input_output/data/p02930/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02930/Pascal/s964619110.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s964619110", "user_id": "u657913472"}, "prompt_components": {"gold_output": "1 2\n1\n", "input_to_evaluate": "var\n\tN,i:Longint;\n\tS:String='1 2 1 3 1 2 1 4 1 2 1 3 1 2 1 5 1 2 1 3 1 2 1 4 1 2 1 3 1 2 1 6 1 2 1 3 1 2 1 4 1 2 1 3 1 2 1 5 1 2 1 3 1 2 1 4 1 2 1 3 1 2 1 7 1 2 1 3 1 2 1 4 1 2 1 3 1 2 1 5 1 2 1 3 1 2 1 4 1 2 1 3 1 2 1 6 1 2 1 3 1 2 1 4 1 2 1 3 1 2 1 5 1 2 1 3 1 2 1 4 1 2 1 3 1 2 1 8 1 2 1 3 1 2 1 4 1 2 1 3 1 2 1 5 1 2 1 3 1 2 1 4 1 2 1 3 1 2 1 6 1 2 1 3 1 2 1 4 1 2 1 3 1 2 1 5 1 2 1 3 1 2 1 4 1 2 1 3 1 2 1 7 1 2 1 3 1 2 1 4 1 2 1 3 1 2 1 5 1 2 1 3 1 2 1 4 1 2 1 3 1 2 1 6 1 2 1 3 1 2 1 4 1 2 1 3 1 2 1 5 1 2 1 3 1 2 1 4 1 2 1 3 1 2 1 9 1 2 1 3 1 2 1 4 1 2 1 3 1 2 1 5 1 2 1 3 1 2 1 4 1 2 1 3 1 2 1 6 1 2 1 3 1 2 1 4 1 2 1 3 1 2 1 5 1 2 1 3 1 2 1 4 1 2 1 3 1 2 1 7 1 2 1 3 1 2 1 4 1 2 1 3 1 2 1 5 1 2 1 3 1 2 1 4 1 2 1 3 1 2 1 6 1 2 1 3 1 2 1 4 1 2 1 3 1 2 1 5 1 2 1 3 1 2 1 4 1 2 1 3 1 2 1 8 1 2 1 3 1 2 1 4 1 2 1 3 1 2 1 5 1 2 1 3 1 2 1 4 1 2 1 3 1 2 1 6 1 2 1 3 1 2 1 4 1 2 1 3 1 2 1 5 1 2 1 3 1 2 1 4 1 2 1 3 1 2 1 7 1 2 1 3 1 2 1 4 1 2 1 3 1 2 1 5 1 2 1 3 1 2 1 4 1 2 1 3 1 2 1 6 1 2 1 3 1 2 1 4 1 2 1 3 1 2 1 5 1 2 1 ';\nbegin\n\tread(N);\n\tfor i:=N-1 downto 1 do write(copy(S,1,i*2));\nend.", "problem_context": "Score: 600 points\n\nProblem Statement\n\nAtCoder's head office consists of N rooms numbered 1 to N. For any two rooms, there is a direct passage connecting these rooms.\n\nFor security reasons, Takahashi the president asked you to set a level for every passage, which is a positive integer and must satisfy the following condition:\n\nFor each room i\\ (1 \\leq i \\leq N), if we leave Room i, pass through some passages whose levels are all equal and get back to Room i, the number of times we pass through a passage is always even.\n\nYour task is to set levels to the passages so that the highest level of a passage is minimized.\n\nConstraints\n\nN is an integer between 2 and 500 (inclusive).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint one way to set levels to the passages so that the objective is achieved, as follows:\n\na_{1,2} a_{1,3} ... a_{1,N}\na_{2,3} ... a_{2,N}\n.\n.\n.\na_{N-1,N}\n\nHere a_{i,j} is the level of the passage connecting Room i and Room j.\n\nIf there are multiple solutions, any of them will be accepted.\n\nSample Input 1\n\n3\n\nSample Output 1\n\n1 2\n1\n\nThe following image describes this output:\n\nFor example, if we leave Room 2, traverse the path 2 \\to 3 \\to 2 \\to 3 \\to 2 \\to 1 \\to 2 while only passing passages of level 1 and get back to Room 2, we pass through a passage six times.", "sample_input": "3\n"}, "reference_outputs": ["1 2\n1\n"], "source_document_id": "p02930", "source_text": "Score: 600 points\n\nProblem Statement\n\nAtCoder's head office consists of N rooms numbered 1 to N. For any two rooms, there is a direct passage connecting these rooms.\n\nFor security reasons, Takahashi the president asked you to set a level for every passage, which is a positive integer and must satisfy the following condition:\n\nFor each room i\\ (1 \\leq i \\leq N), if we leave Room i, pass through some passages whose levels are all equal and get back to Room i, the number of times we pass through a passage is always even.\n\nYour task is to set levels to the passages so that the highest level of a passage is minimized.\n\nConstraints\n\nN is an integer between 2 and 500 (inclusive).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint one way to set levels to the passages so that the objective is achieved, as follows:\n\na_{1,2} a_{1,3} ... a_{1,N}\na_{2,3} ... a_{2,N}\n.\n.\n.\na_{N-1,N}\n\nHere a_{i,j} is the level of the passage connecting Room i and Room j.\n\nIf there are multiple solutions, any of them will be accepted.\n\nSample Input 1\n\n3\n\nSample Output 1\n\n1 2\n1\n\nThe following image describes this output:\n\nFor example, if we leave Room 2, traverse the path 2 \\to 3 \\to 2 \\to 3 \\to 2 \\to 1 \\to 2 while only passing passages of level 1 and get back to Room 2, we pass through a passage six times.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1096, "cpu_time_ms": 2, "memory_kb": 640}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s391321410", "group_id": "codeNet:p02935", "input_text": "var n,i,j,tmp:Longint;\nA:array[1..50]of Longint;\nans:real;\nbegin\nread(n);\nfor i:=1 to n do begin\nread(A[i]);\nfor j:=i-1 downto 1 do begin\nif A[j]>A[j+1]then begin\ntmp:=A[j];\nA[j]:=A[j+1];\nA[j+1]:=tmp;\nend else break;\nend;\nend;\nans:=A[1];\nfor i:=2 to n do begin\nans:=(ans+A[i])/2;\nend;\nwriteln(ans:0:9);\nend.", "language": "Pascal", "metadata": {"date": 1566176875, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p02935.html", "problem_id": "p02935", "resource_group": "low_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/Pascal/s391321410.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s391321410", "user_id": "u657913472"}, "prompt_components": {"gold_output": "3.5\n", "input_to_evaluate": "var n,i,j,tmp:Longint;\nA:array[1..50]of Longint;\nans:real;\nbegin\nread(n);\nfor i:=1 to n do begin\nread(A[i]);\nfor j:=i-1 downto 1 do begin\nif A[j]>A[j+1]then begin\ntmp:=A[j];\nA[j]:=A[j+1];\nA[j+1]:=tmp;\nend else break;\nend;\nend;\nans:=A[1];\nfor i:=2 to n do begin\nans:=(ans+A[i])/2;\nend;\nwriteln(ans:0:9);\nend.", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 3, "memory_kb": 128}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s358247963", "group_id": "codeNet:p02938", "input_text": "var\n\tM,L,R,ans,ll,rr:int64;\n k,i,x,y,xl,yl,limx,limy,xx,yy,id,ie:Longint;\n dp:array[1..60,1..2,1..2]of int64;\nbegin\n\tread(L,R);\n if(L=1)and(R=1000000000000000000)then begin\n \twriteln(68038601);\n exit;\n end;\n M:=1000000007;\n ll:=1;\n rr:=2;\n for k:=1 to 60 do begin\n \tif(rr<=L)or(R>(k-1-i))mod 2;\n y:=(R>>(k-1-i))mod 2;\n for xl:=1 to 2 do begin\n \tif xl=1 then limx:=x else limx:=0;\n for yl:=1 to 2 do begin\n \tif dp[i,xl,yl]=0 then continue;\n \tif yl=1 then limy:=y else limy:=1;\n for yy:=0 to limy do begin\n \tfor xx:=limx to yy do begin\n \tif(xl=2)or(xx>limx)then id:=2 else id:=1;\n if(yl=2)or(yy>(k-1-i))mod 2;\n y:=(R>>(k-1-i))mod 2;\n for xl:=1 to 2 do begin\n \tif xl=1 then limx:=x else limx:=0;\n for yl:=1 to 2 do begin\n \tif dp[i,xl,yl]=0 then continue;\n \tif yl=1 then limy:=y else limy:=1;\n for yy:=0 to limy do begin\n \tfor xx:=limx to yy do begin\n \tif(xl=2)or(xx>limx)then id:=2 else id:=1;\n if(yl=2)or(yy c then\n begin inc(count);\n i:=1 end\nelse inc(i);\n save[i]:=c;\n\nuntil ord(c) in [26,32,10];\n\n\nwrite(count)\nend.", "language": "Pascal", "metadata": {"date": 1566096971, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p02939.html", "problem_id": "p02939", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02939/input.txt", "sample_output_relpath": "derived/input_output/data/p02939/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02939/Pascal/s278667561.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s278667561", "user_id": "u655683235"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "const nmax=200010;\nvar save:array[1..100010] of char;\n c:char;\n i,count:int64;\nbegin\nread(save[1]);\ni:=1;\ncount:=1;\nrepeat \nread(c);\nif save[i] <> c then\n begin inc(count);\n i:=1 end\nelse inc(i);\n save[i]:=c;\n\nuntil ord(c) in [26,32,10];\n\n\nwrite(count)\nend.", "problem_context": "Score : 300 points\n\nProblem Statement\n\nGiven is a string S consisting of lowercase English letters. Find the maximum positive integer K that satisfies the following condition:\n\nThere exists a partition of S into K non-empty strings S=S_1S_2...S_K such that S_i \\neq S_{i+1} (1 \\leq i \\leq K-1).\n\nHere S_1S_2...S_K represents the concatenation of S_1,S_2,...,S_K in this order.\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 maximum positive integer K that satisfies the condition.\n\nSample Input 1\n\naabbaa\n\nSample Output 1\n\n4\n\nWe can, for example, divide S into four strings aa, b, ba, and a.\n\nSample Input 2\n\naaaccacabaababc\n\nSample Output 2\n\n12", "sample_input": "aabbaa\n"}, "reference_outputs": ["4\n"], "source_document_id": "p02939", "source_text": "Score : 300 points\n\nProblem Statement\n\nGiven is a string S consisting of lowercase English letters. Find the maximum positive integer K that satisfies the following condition:\n\nThere exists a partition of S into K non-empty strings S=S_1S_2...S_K such that S_i \\neq S_{i+1} (1 \\leq i \\leq K-1).\n\nHere S_1S_2...S_K represents the concatenation of S_1,S_2,...,S_K in this order.\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 maximum positive integer K that satisfies the condition.\n\nSample Input 1\n\naabbaa\n\nSample Output 1\n\n4\n\nWe can, for example, divide S into four strings aa, b, ba, and a.\n\nSample Input 2\n\naaaccacabaababc\n\nSample Output 2\n\n12", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 99, "memory_kb": 128}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s372124099", "group_id": "codeNet:p02939", "input_text": "program A;\nvar n: longint;\n s: ansistring;\nbegin\n readln(s);\n n:=length(s);\n writeln(n);\nend.", "language": "Pascal", "metadata": {"date": 1566091707, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p02939.html", "problem_id": "p02939", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02939/input.txt", "sample_output_relpath": "derived/input_output/data/p02939/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02939/Pascal/s372124099.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s372124099", "user_id": "u163924554"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "program A;\nvar n: longint;\n s: ansistring;\nbegin\n readln(s);\n n:=length(s);\n writeln(n);\nend.", "problem_context": "Score : 300 points\n\nProblem Statement\n\nGiven is a string S consisting of lowercase English letters. Find the maximum positive integer K that satisfies the following condition:\n\nThere exists a partition of S into K non-empty strings S=S_1S_2...S_K such that S_i \\neq S_{i+1} (1 \\leq i \\leq K-1).\n\nHere S_1S_2...S_K represents the concatenation of S_1,S_2,...,S_K in this order.\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 maximum positive integer K that satisfies the condition.\n\nSample Input 1\n\naabbaa\n\nSample Output 1\n\n4\n\nWe can, for example, divide S into four strings aa, b, ba, and a.\n\nSample Input 2\n\naaaccacabaababc\n\nSample Output 2\n\n12", "sample_input": "aabbaa\n"}, "reference_outputs": ["4\n"], "source_document_id": "p02939", "source_text": "Score : 300 points\n\nProblem Statement\n\nGiven is a string S consisting of lowercase English letters. Find the maximum positive integer K that satisfies the following condition:\n\nThere exists a partition of S into K non-empty strings S=S_1S_2...S_K such that S_i \\neq S_{i+1} (1 \\leq i \\leq K-1).\n\nHere S_1S_2...S_K represents the concatenation of S_1,S_2,...,S_K in this order.\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 maximum positive integer K that satisfies the condition.\n\nSample Input 1\n\naabbaa\n\nSample Output 1\n\n4\n\nWe can, for example, divide S into four strings aa, b, ba, and a.\n\nSample Input 2\n\naaaccacabaababc\n\nSample Output 2\n\n12", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 384}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s996105768", "group_id": "codeNet:p02940", "input_text": "program A;\nbegin\n\twriteln(1);\nend.", "language": "Pascal", "metadata": {"date": 1566091564, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p02940.html", "problem_id": "p02940", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02940/input.txt", "sample_output_relpath": "derived/input_output/data/p02940/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02940/Pascal/s996105768.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s996105768", "user_id": "u163924554"}, "prompt_components": {"gold_output": "216\n", "input_to_evaluate": "program A;\nbegin\n\twriteln(1);\nend.", "problem_context": "Score : 800 points\n\nProblem Statement\n\nWe have 3N colored balls with IDs from 1 to 3N.\nA string S of length 3N represents the colors of the balls. The color of Ball i is red if S_i is R, green if S_i is G, and blue if S_i is B. There are N red balls, N green balls, and N blue balls.\n\nTakahashi will distribute these 3N balls to N people so that each person gets one red ball, one blue ball, and one green ball.\nThe people want balls with IDs close to each other, so he will additionally satisfy the following condition:\n\nLet a_j < b_j < c_j be the IDs of the balls received by the j-th person in ascending order.\n\nThen, \\sum_j (c_j-a_j) should be as small as possible.\n\nFind the number of ways in which Takahashi can distribute the balls. Since the answer can be enormous, compute it modulo 998244353.\nWe consider two ways to distribute the balls different if and only if there is a person who receives different sets of balls.\n\nConstraints\n\n1 \\leq N \\leq 10^5\n\n|S|=3N\n\nS consists of R, G, and B, and each of these characters occurs N times in S.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS\n\nOutput\n\nPrint the number of ways in which Takahashi can distribute the balls, modulo 998244353.\n\nSample Input 1\n\n3\nRRRGGGBBB\n\nSample Output 1\n\n216\n\nThe minimum value of \\sum_j (c_j-a_j) is 18 when the balls are, for example, distributed as follows:\n\nThe first person gets Ball 1, 5, and 9.\n\nThe second person gets Ball 2, 4, and 8.\n\nThe third person gets Ball 3, 6, and 7.\n\nSample Input 2\n\n5\nBBRGRRGRGGRBBGB\n\nSample Output 2\n\n960", "sample_input": "3\nRRRGGGBBB\n"}, "reference_outputs": ["216\n"], "source_document_id": "p02940", "source_text": "Score : 800 points\n\nProblem Statement\n\nWe have 3N colored balls with IDs from 1 to 3N.\nA string S of length 3N represents the colors of the balls. The color of Ball i is red if S_i is R, green if S_i is G, and blue if S_i is B. There are N red balls, N green balls, and N blue balls.\n\nTakahashi will distribute these 3N balls to N people so that each person gets one red ball, one blue ball, and one green ball.\nThe people want balls with IDs close to each other, so he will additionally satisfy the following condition:\n\nLet a_j < b_j < c_j be the IDs of the balls received by the j-th person in ascending order.\n\nThen, \\sum_j (c_j-a_j) should be as small as possible.\n\nFind the number of ways in which Takahashi can distribute the balls. Since the answer can be enormous, compute it modulo 998244353.\nWe consider two ways to distribute the balls different if and only if there is a person who receives different sets of balls.\n\nConstraints\n\n1 \\leq N \\leq 10^5\n\n|S|=3N\n\nS consists of R, G, and B, and each of these characters occurs N times in S.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS\n\nOutput\n\nPrint the number of ways in which Takahashi can distribute the balls, modulo 998244353.\n\nSample Input 1\n\n3\nRRRGGGBBB\n\nSample Output 1\n\n216\n\nThe minimum value of \\sum_j (c_j-a_j) is 18 when the balls are, for example, distributed as follows:\n\nThe first person gets Ball 1, 5, and 9.\n\nThe second person gets Ball 2, 4, and 8.\n\nThe third person gets Ball 3, 6, and 7.\n\nSample Input 2\n\n5\nBBRGRRGRGGRBBGB\n\nSample Output 2\n\n960", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 34, "cpu_time_ms": 4, "memory_kb": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s119376620", "group_id": "codeNet:p02946", "input_text": "var k,x,i:longint;\nbegin\n read(k,x);\n for i:=0 to 2000000 do\n if (i-1000000-xk) then write(i-1000000,' ')\nend.\n", "language": "Pascal", "metadata": {"date": 1566316907, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p02946.html", "problem_id": "p02946", "resource_group": "low_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/Pascal/s119376620.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s119376620", "user_id": "u805277811"}, "prompt_components": {"gold_output": "5 6 7 8 9\n", "input_to_evaluate": "var k,x,i:longint;\nbegin\n read(k,x);\n for i:=0 to 2000000 do\n if (i-1000000-xk) then write(i-1000000,' ')\nend.\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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 307, "memory_kb": 14464}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s226178481", "group_id": "codeNet:p02947", "input_text": "const maxn = 100000;\nvar a:array[1..maxn] of string;\n cnt,i,n:longint;\n re:int64;\n\nprocedure sort(l,r:longint; var s:string);\nvar tmp,x:char;\n i,j:longint;\nbegin\n\tif l >= r then exit;\n\ti:=l; j:=r; x:=s[(l + r) shr 1];\n\trepeat\n\t while s[i] < x do inc(i);\n\t while s[j] > x do dec(j);\n\t if i <= j then\n\t begin\n\t tmp:=s[i]; s[i]:=s[j]; s[j]:=tmp;\n\t inc(i); dec(j);\n\t end;\n\tuntil i > j;\n\tsort(l,j,s); sort(i,r,s);\nend;\n\nprocedure arrange(l,r:longint);\nvar tmp,x:string;\n i,j:longint;\nbegin\n\tif l >= r then exit;\n\ti:=l; j:=r; x:=a[(l + r) shr 1];\n\trepeat\n\t while a[i] < x do inc(i);\n\t while a[j] > x do dec(j);\n\t if i <= j then \n begin\n tmp:=a[i]; a[i]:=a[j]; a[j]:=tmp;\n inc(i); dec(j);\n end;\n\tuntil i > j;\n\tarrange(l,j); arrange(i,r);\nend;\n\nfunction calc(x:longint):int64;\nvar ans,tmp:int64;\nbegin\n\ttmp:=x;\n\tans:= (tmp * (tmp - 1)) shr 1;\n\tcalc:=ans;\nend;\n\nbegin\n\treadln(n);\n\tfor i:=1 to n do readln(a[i]);\n\tfor i:=1 to n do sort(1,10,a[i]);\n\tarrange(1,n);\n\tcnt:=1; re:=0;\n\tfor i:=2 to n do\n\t begin\n\t if a[i] = a[i-1] then inc(cnt)\n\t else if cnt >= 2 then \n\t begin\n\t re:= re + calc(cnt);\n\t cnt:=1;\n\t end;\n\t if (i = n) and (cnt >= 2) then re:= re + calc(cnt);\n\t end;\n\twriteln(re);\nend.", "language": "Pascal", "metadata": {"date": 1565487491, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p02947.html", "problem_id": "p02947", "resource_group": "low_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/Pascal/s226178481.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s226178481", "user_id": "u017143931"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "const maxn = 100000;\nvar a:array[1..maxn] of string;\n cnt,i,n:longint;\n re:int64;\n\nprocedure sort(l,r:longint; var s:string);\nvar tmp,x:char;\n i,j:longint;\nbegin\n\tif l >= r then exit;\n\ti:=l; j:=r; x:=s[(l + r) shr 1];\n\trepeat\n\t while s[i] < x do inc(i);\n\t while s[j] > x do dec(j);\n\t if i <= j then\n\t begin\n\t tmp:=s[i]; s[i]:=s[j]; s[j]:=tmp;\n\t inc(i); dec(j);\n\t end;\n\tuntil i > j;\n\tsort(l,j,s); sort(i,r,s);\nend;\n\nprocedure arrange(l,r:longint);\nvar tmp,x:string;\n i,j:longint;\nbegin\n\tif l >= r then exit;\n\ti:=l; j:=r; x:=a[(l + r) shr 1];\n\trepeat\n\t while a[i] < x do inc(i);\n\t while a[j] > x do dec(j);\n\t if i <= j then \n begin\n tmp:=a[i]; a[i]:=a[j]; a[j]:=tmp;\n inc(i); dec(j);\n end;\n\tuntil i > j;\n\tarrange(l,j); arrange(i,r);\nend;\n\nfunction calc(x:longint):int64;\nvar ans,tmp:int64;\nbegin\n\ttmp:=x;\n\tans:= (tmp * (tmp - 1)) shr 1;\n\tcalc:=ans;\nend;\n\nbegin\n\treadln(n);\n\tfor i:=1 to n do readln(a[i]);\n\tfor i:=1 to n do sort(1,10,a[i]);\n\tarrange(1,n);\n\tcnt:=1; re:=0;\n\tfor i:=2 to n do\n\t begin\n\t if a[i] = a[i-1] then inc(cnt)\n\t else if cnt >= 2 then \n\t begin\n\t re:= re + calc(cnt);\n\t cnt:=1;\n\t end;\n\t if (i = n) and (cnt >= 2) then re:= re + calc(cnt);\n\t end;\n\twriteln(re);\nend.", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1273, "cpu_time_ms": 154, "memory_kb": 29184}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s269552305", "group_id": "codeNet:p02948", "input_text": "type\n pair = record\n a : longint;\n b : longint;\n end;\n\tpairArray = array[1..100000] of pair;\n\nvar i,j,n,m:longint;\n ans:int64;\n input:pairArray;\n heap:array[0..100000] of longint;\n f, g: text;\n\nprocedure swap(var X, Y: longint);\nbegin\n\tif X <> Y then begin\n\t\tX := X xor Y;\n\t\tY := X xor Y;\n\t\tX := X xor Y\n\tend\nend;\n\nprocedure\tpswap(var a,b:pair);\nvar tmp:pair;\nbegin\n\ttmp:=a;\n\ta:=b;\n\tb:=tmp\nend;\n\nprocedure QuickSort(var a:pairArray;start_index,end_index:longint);\nvar i,j,x:int64;\nbegin\n\tx:=a[(start_index+end_index)div 2].a;\n\ti:=start_index;\n\tj:=end_index;\n\twhile(true)do\n\tbegin\n\t\twhile(a[i].a1) and (heap[p]>heap[p div 2]) do begin\n swap(heap[p],heap[p div 2]);\n p := p div 2\n end\nend;\n\nfunction downheap:longint;\nvar p:integer;\nbegin\n downheap:=heap[1];\n heap[1] := heap[heap[0]];\n heap[0] := heap[0] - 1;\n p := 1;\n while (p*2 <= heap[0]) and (heap[p]0 then ans := ans + downheap\n end;\n writeln(ans);\nend.\n", "language": "Pascal", "metadata": {"date": 1579469632, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p02948.html", "problem_id": "p02948", "resource_group": "low_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/Pascal/s269552305.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s269552305", "user_id": "u146231039"}, "prompt_components": {"gold_output": "5\n", "input_to_evaluate": "type\n pair = record\n a : longint;\n b : longint;\n end;\n\tpairArray = array[1..100000] of pair;\n\nvar i,j,n,m:longint;\n ans:int64;\n input:pairArray;\n heap:array[0..100000] of longint;\n f, g: text;\n\nprocedure swap(var X, Y: longint);\nbegin\n\tif X <> Y then begin\n\t\tX := X xor Y;\n\t\tY := X xor Y;\n\t\tX := X xor Y\n\tend\nend;\n\nprocedure\tpswap(var a,b:pair);\nvar tmp:pair;\nbegin\n\ttmp:=a;\n\ta:=b;\n\tb:=tmp\nend;\n\nprocedure QuickSort(var a:pairArray;start_index,end_index:longint);\nvar i,j,x:int64;\nbegin\n\tx:=a[(start_index+end_index)div 2].a;\n\ti:=start_index;\n\tj:=end_index;\n\twhile(true)do\n\tbegin\n\t\twhile(a[i].a1) and (heap[p]>heap[p div 2]) do begin\n swap(heap[p],heap[p div 2]);\n p := p div 2\n end\nend;\n\nfunction downheap:longint;\nvar p:integer;\nbegin\n downheap:=heap[1];\n heap[1] := heap[heap[0]];\n heap[0] := heap[0] - 1;\n p := 1;\n while (p*2 <= heap[0]) and (heap[p]0 then ans := ans + downheap\n end;\n writeln(ans);\nend.\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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1829, "cpu_time_ms": 40, "memory_kb": 1280}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s816344576", "group_id": "codeNet:p02948", "input_text": "type\n pair = record\n a : longint;\n b : longint;\n end;\n\tpairArray = array[1..100000] of pair;\n\nvar i,j,n,m:longint;\n ans:int64;\n input:pairArray;\n heap:array[0..100000] of longint;\n\nprocedure swap(var X, Y: longint);\nbegin\n\tif X <> Y then begin\n\t\tX := X xor Y;\n\t\tY := X xor Y;\n\t\tX := X xor Y\n\tend\nend;\n\nprocedure\tpswap(var a,b:pair);\nvar tmp:pair;\nbegin\n\ttmp:=a;\n\ta:=b;\n\tb:=tmp\nend;\n\nprocedure QuickSort(var a:pairArray;start_index,end_index:longint);\nvar i,j,x:int64;\nbegin\n\tx:=a[(start_index+end_index)div 2].a;\n\ti:=start_index;\n\tj:=end_index;\n\twhile(true)do\n\tbegin\n\t\twhile(a[i].a1) and (heap[p]>heap[p div 2]) do begin\n swap(heap[p],heap[p div 2]);\n p := p div 2\n end\nend;\n\nfunction downheap:longint;\nvar p:integer;\nbegin\n downheap:=heap[1];\n heap[1] := heap[heap[0]];\n heap[0] := heap[0] - 1;\n p := 1;\n while (p*2 <= heap[0]) and (heap[p]0 then ans := ans + downheap\n end;\n writeln(ans)\nend.", "language": "Pascal", "metadata": {"date": 1565587648, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p02948.html", "problem_id": "p02948", "resource_group": "low_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/Pascal/s816344576.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s816344576", "user_id": "u492212770"}, "prompt_components": {"gold_output": "5\n", "input_to_evaluate": "type\n pair = record\n a : longint;\n b : longint;\n end;\n\tpairArray = array[1..100000] of pair;\n\nvar i,j,n,m:longint;\n ans:int64;\n input:pairArray;\n heap:array[0..100000] of longint;\n\nprocedure swap(var X, Y: longint);\nbegin\n\tif X <> Y then begin\n\t\tX := X xor Y;\n\t\tY := X xor Y;\n\t\tX := X xor Y\n\tend\nend;\n\nprocedure\tpswap(var a,b:pair);\nvar tmp:pair;\nbegin\n\ttmp:=a;\n\ta:=b;\n\tb:=tmp\nend;\n\nprocedure QuickSort(var a:pairArray;start_index,end_index:longint);\nvar i,j,x:int64;\nbegin\n\tx:=a[(start_index+end_index)div 2].a;\n\ti:=start_index;\n\tj:=end_index;\n\twhile(true)do\n\tbegin\n\t\twhile(a[i].a1) and (heap[p]>heap[p div 2]) do begin\n swap(heap[p],heap[p div 2]);\n p := p div 2\n end\nend;\n\nfunction downheap:longint;\nvar p:integer;\nbegin\n downheap:=heap[1];\n heap[1] := heap[heap[0]];\n heap[0] := heap[0] - 1;\n p := 1;\n while (p*2 <= heap[0]) and (heap[p]0 then ans := ans + downheap\n end;\n writeln(ans)\nend.", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1810, "cpu_time_ms": 40, "memory_kb": 1280}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s461250792", "group_id": "codeNet:p02948", "input_text": "type\n pair = record\n a : int64;\n b : int64;\n end;\n\tpairArray = array[1..100000] of pair;\n\nvar ans,i,j,n,m:int64;\n input:pairArray;\n heap:array[0..100000] of int64;\n\nprocedure swap(var X, Y: int64);\nbegin\n\tif X <> Y then begin\n\t\tX := X xor Y;\n\t\tY := X xor Y;\n\t\tX := X xor Y\n\tend\nend;\n\nprocedure\tpswap(var a,b:pair);\nvar tmp:pair;\nbegin\n\ttmp:=a;\n\ta:=b;\n\tb:=tmp\nend;\n\nprocedure QuickSort(var a:pairArray;start_index,end_index:int64);\nvar i,j,x:int64;\nbegin\n\tx:=a[(start_index+end_index)div 2].a;\n\ti:=start_index;\n\tj:=end_index;\n\twhile(true)do\n\tbegin\n\t\twhile(a[i].a1) and (heap[p]>heap[p div 2]) do begin\n swap(heap[p],heap[p div 2]);\n p := p div 2\n end\nend;\n\nfunction downheap:int64;\nvar p:integer;\nbegin\n downheap:=heap[1];\n heap[1] := heap[heap[0]];\n heap[0] := heap[0] - 1;\n p := 1;\n while (p*2 <= heap[0]) and (heap[p]0 then ans := ans + downheap\n end;\n writeln(ans)\nend.", "language": "Pascal", "metadata": {"date": 1565587344, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p02948.html", "problem_id": "p02948", "resource_group": "low_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/Pascal/s461250792.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s461250792", "user_id": "u492212770"}, "prompt_components": {"gold_output": "5\n", "input_to_evaluate": "type\n pair = record\n a : int64;\n b : int64;\n end;\n\tpairArray = array[1..100000] of pair;\n\nvar ans,i,j,n,m:int64;\n input:pairArray;\n heap:array[0..100000] of int64;\n\nprocedure swap(var X, Y: int64);\nbegin\n\tif X <> Y then begin\n\t\tX := X xor Y;\n\t\tY := X xor Y;\n\t\tX := X xor Y\n\tend\nend;\n\nprocedure\tpswap(var a,b:pair);\nvar tmp:pair;\nbegin\n\ttmp:=a;\n\ta:=b;\n\tb:=tmp\nend;\n\nprocedure QuickSort(var a:pairArray;start_index,end_index:int64);\nvar i,j,x:int64;\nbegin\n\tx:=a[(start_index+end_index)div 2].a;\n\ti:=start_index;\n\tj:=end_index;\n\twhile(true)do\n\tbegin\n\t\twhile(a[i].a1) and (heap[p]>heap[p div 2]) do begin\n swap(heap[p],heap[p div 2]);\n p := p div 2\n end\nend;\n\nfunction downheap:int64;\nvar p:integer;\nbegin\n downheap:=heap[1];\n heap[1] := heap[heap[0]];\n heap[0] := heap[0] - 1;\n p := 1;\n while (p*2 <= heap[0]) and (heap[p]0 then ans := ans + downheap\n end;\n writeln(ans)\nend.", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1781, "cpu_time_ms": 41, "memory_kb": 2432}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s810093214", "group_id": "codeNet:p02948", "input_text": "type\n pair = record\n a : longint;\n b : longint;\n end;\n\tpairArray = array[1..100000] of pair;\n\nvar ans,i,j,n,m:longint;\n input:pairArray;\n heap:array[0..100000] of longint;\n\nprocedure swap(var X, Y: longint);\nbegin\n\tif X <> Y then begin\n\t\tX := X xor Y;\n\t\tY := X xor Y;\n\t\tX := X xor Y\n\tend\nend;\n\nprocedure\tpswap(var a,b:pair);\nvar tmp:pair;\nbegin\n\ttmp:=a;\n\ta:=b;\n\tb:=tmp\nend;\n\nprocedure QuickSort(var a:pairArray;start_index,end_index:longint);\nvar i,j,x:int64;\nbegin\n\tx:=a[(start_index+end_index)div 2].a;\n\ti:=start_index;\n\tj:=end_index;\n\twhile(true)do\n\tbegin\n\t\twhile(a[i].a1) and (heap[p]>heap[p div 2]) do begin\n swap(heap[p],heap[p div 2]);\n p := p div 2\n end\nend;\n\nfunction downheap:longint;\nvar p:integer;\nbegin\n downheap:=heap[1];\n heap[1] := heap[heap[0]];\n heap[heap[0]] := 0;\n heap[0] := heap[0] - 1;\n if heap[0]>1 then begin\n p := 1;\n while (p*2 <= heap[0]) and (heap[p]0 then ans := ans + downheap\n end;\n writeln(ans)\nend.", "language": "Pascal", "metadata": {"date": 1565584202, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p02948.html", "problem_id": "p02948", "resource_group": "low_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/Pascal/s810093214.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s810093214", "user_id": "u492212770"}, "prompt_components": {"gold_output": "5\n", "input_to_evaluate": "type\n pair = record\n a : longint;\n b : longint;\n end;\n\tpairArray = array[1..100000] of pair;\n\nvar ans,i,j,n,m:longint;\n input:pairArray;\n heap:array[0..100000] of longint;\n\nprocedure swap(var X, Y: longint);\nbegin\n\tif X <> Y then begin\n\t\tX := X xor Y;\n\t\tY := X xor Y;\n\t\tX := X xor Y\n\tend\nend;\n\nprocedure\tpswap(var a,b:pair);\nvar tmp:pair;\nbegin\n\ttmp:=a;\n\ta:=b;\n\tb:=tmp\nend;\n\nprocedure QuickSort(var a:pairArray;start_index,end_index:longint);\nvar i,j,x:int64;\nbegin\n\tx:=a[(start_index+end_index)div 2].a;\n\ti:=start_index;\n\tj:=end_index;\n\twhile(true)do\n\tbegin\n\t\twhile(a[i].a1) and (heap[p]>heap[p div 2]) do begin\n swap(heap[p],heap[p div 2]);\n p := p div 2\n end\nend;\n\nfunction downheap:longint;\nvar p:integer;\nbegin\n downheap:=heap[1];\n heap[1] := heap[heap[0]];\n heap[heap[0]] := 0;\n heap[0] := heap[0] - 1;\n if heap[0]>1 then begin\n p := 1;\n while (p*2 <= heap[0]) and (heap[p]0 then ans := ans + downheap\n end;\n writeln(ans)\nend.", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 39, "memory_kb": 1280}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s165172388", "group_id": "codeNet:p02948", "input_text": "type\n pair = record\n a : longint;\n b : longint;\n end;\n\tpairArray = array[1..100000] of pair;\n\nvar ans,i,j,n,m:longint;\n input:pairArray;\n heap:array[0..100000] of longint;\n\nprocedure swap(var X, Y: longint);\nbegin\n\tif X <> Y then begin\n\t\tX := X xor Y;\n\t\tY := X xor Y;\n\t\tX := X xor Y\n\tend\nend;\n\nprocedure\tpswap(var a,b:pair);\nvar tmp:pair;\nbegin\n\ttmp:=a;\n\ta:=b;\n\tb:=tmp\nend;\n\nprocedure QuickSort(var a:pairArray;start_index,end_index:longint);\nvar i,j,x:int64;\nbegin\n\tx:=a[(start_index+end_index)div 2].a;\n\ti:=start_index;\n\tj:=end_index;\n\twhile(true)do\n\tbegin\n\t\twhile(a[i].a1) and (heap[p]>heap[p div 2]) do begin\n swap(heap[p],heap[p div 2]);\n p := p div 2\n end\nend;\n\nfunction downheap:longint;\nvar p:integer;\nbegin\n downheap:=heap[1];\n heap[1] := heap[heap[0]];\n heap[0] := heap[0] - 1;\n p := 1;\n while (p*2 <= heap[0]) and ((heap[p]0 then ans := ans + downheap\n end;\n writeln(ans)\nend.", "language": "Pascal", "metadata": {"date": 1565538340, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p02948.html", "problem_id": "p02948", "resource_group": "low_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/Pascal/s165172388.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s165172388", "user_id": "u492212770"}, "prompt_components": {"gold_output": "5\n", "input_to_evaluate": "type\n pair = record\n a : longint;\n b : longint;\n end;\n\tpairArray = array[1..100000] of pair;\n\nvar ans,i,j,n,m:longint;\n input:pairArray;\n heap:array[0..100000] of longint;\n\nprocedure swap(var X, Y: longint);\nbegin\n\tif X <> Y then begin\n\t\tX := X xor Y;\n\t\tY := X xor Y;\n\t\tX := X xor Y\n\tend\nend;\n\nprocedure\tpswap(var a,b:pair);\nvar tmp:pair;\nbegin\n\ttmp:=a;\n\ta:=b;\n\tb:=tmp\nend;\n\nprocedure QuickSort(var a:pairArray;start_index,end_index:longint);\nvar i,j,x:int64;\nbegin\n\tx:=a[(start_index+end_index)div 2].a;\n\ti:=start_index;\n\tj:=end_index;\n\twhile(true)do\n\tbegin\n\t\twhile(a[i].a1) and (heap[p]>heap[p div 2]) do begin\n swap(heap[p],heap[p div 2]);\n p := p div 2\n end\nend;\n\nfunction downheap:longint;\nvar p:integer;\nbegin\n downheap:=heap[1];\n heap[1] := heap[heap[0]];\n heap[0] := heap[0] - 1;\n p := 1;\n while (p*2 <= heap[0]) and ((heap[p]0 then ans := ans + downheap\n end;\n writeln(ans)\nend.", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1764, "cpu_time_ms": 39, "memory_kb": 1280}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s106004026", "group_id": "codeNet:p02952", "input_text": "var n,i,ans :integer;\nbegin\n ans:=0;\n read(n);\n for i:=1 to n do\n if (i<10)or((i div 100>0)and(i div 100<10))or((i div 10000>0)and(i div 10000<10))\n then inc(ans);\n write(ans);\nend.", "language": "Pascal", "metadata": {"date": 1564972313, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p02952.html", "problem_id": "p02952", "resource_group": "low_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/Pascal/s106004026.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s106004026", "user_id": "u805277811"}, "prompt_components": {"gold_output": "9\n", "input_to_evaluate": "var n,i,ans :integer;\nbegin\n ans:=0;\n read(n);\n for i:=1 to n do\n if (i<10)or((i div 100>0)and(i div 100<10))or((i div 10000>0)and(i div 10000<10))\n then inc(ans);\n write(ans);\nend.", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 3, "memory_kb": 128}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s467644341", "group_id": "codeNet:p02957", "input_text": "var a,b,i:int64;\nbegin\n read(a,b);\n for i:=1 to 1000000001 do\n if abs(a-i)=abs(b-i) then\n begin\n write(i);\n break;\n end;\n if i=1000000001 then write('IMPOSSIBLE');\nend.", "language": "Pascal", "metadata": {"date": 1566381918, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p02957.html", "problem_id": "p02957", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02957/input.txt", "sample_output_relpath": "derived/input_output/data/p02957/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02957/Pascal/s467644341.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s467644341", "user_id": "u805277811"}, "prompt_components": {"gold_output": "9\n", "input_to_evaluate": "var a,b,i:int64;\nbegin\n read(a,b);\n for i:=1 to 1000000001 do\n if abs(a-i)=abs(b-i) then\n begin\n write(i);\n break;\n end;\n if i=1000000001 then write('IMPOSSIBLE');\nend.", "problem_context": "Score: 100 points\n\nProblem Statement\n\nWe have two distinct integers A and B.\n\nPrint the integer K such that |A - K| = |B - K|.\n\nIf such an integer does not exist, print IMPOSSIBLE instead.\n\nConstraints\n\nAll values in input are integers.\n\n0 \\leq A,\\ B \\leq 10^9\n\nA and B are distinct.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the integer K satisfying the condition.\n\nIf such an integer does not exist, print IMPOSSIBLE instead.\n\nSample Input 1\n\n2 16\n\nSample Output 1\n\n9\n\n|2 - 9| = 7 and |16 - 9| = 7, so 9 satisfies the condition.\n\nSample Input 2\n\n0 3\n\nSample Output 2\n\nIMPOSSIBLE\n\nNo integer satisfies the condition.\n\nSample Input 3\n\n998244353 99824435\n\nSample Output 3\n\n549034394", "sample_input": "2 16\n"}, "reference_outputs": ["9\n"], "source_document_id": "p02957", "source_text": "Score: 100 points\n\nProblem Statement\n\nWe have two distinct integers A and B.\n\nPrint the integer K such that |A - K| = |B - K|.\n\nIf such an integer does not exist, print IMPOSSIBLE instead.\n\nConstraints\n\nAll values in input are integers.\n\n0 \\leq A,\\ B \\leq 10^9\n\nA and B are distinct.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nPrint the integer K satisfying the condition.\n\nIf such an integer does not exist, print IMPOSSIBLE instead.\n\nSample Input 1\n\n2 16\n\nSample Output 1\n\n9\n\n|2 - 9| = 7 and |16 - 9| = 7, so 9 satisfies the condition.\n\nSample Input 2\n\n0 3\n\nSample Output 2\n\nIMPOSSIBLE\n\nNo integer satisfies the condition.\n\nSample Input 3\n\n998244353 99824435\n\nSample Output 3\n\n549034394", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 1946, "memory_kb": 128}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s938812108", "group_id": "codeNet:p02959", "input_text": "Uses math;\nvar n,i,b,count:int64;\n a:array[1..100010]of int64; \nbegin\nread(n);count:=0;\nfor i := 1 to n+1 do read(a[i]);\nfor i := 1 to n do begin\nread(b);\nif a[i]>b then begin count:=count+b;continue end;\ncount:=count+a[i]+min(b-a[i],a[i+1]);\na[i+1]:=max(a[i+1]-b+a[i],0)\n end;\nwrite(count);\nend.", "language": "Pascal", "metadata": {"date": 1564278369, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p02959.html", "problem_id": "p02959", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02959/input.txt", "sample_output_relpath": "derived/input_output/data/p02959/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02959/Pascal/s938812108.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s938812108", "user_id": "u655683235"}, "prompt_components": {"gold_output": "9\n", "input_to_evaluate": "Uses math;\nvar n,i,b,count:int64;\n a:array[1..100010]of int64; \nbegin\nread(n);count:=0;\nfor i := 1 to n+1 do read(a[i]);\nfor i := 1 to n do begin\nread(b);\nif a[i]>b then begin count:=count+b;continue end;\ncount:=count+a[i]+min(b-a[i],a[i+1]);\na[i+1]:=max(a[i+1]-b+a[i],0)\n end;\nwrite(count);\nend.", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere are N+1 towns. The i-th town is being attacked by A_i monsters.\n\nWe have N heroes. The i-th hero can defeat monsters attacking the i-th or (i+1)-th town, for a total of at most B_i monsters.\n\nWhat is the maximum total number of monsters the heroes can cooperate to defeat?\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 10^5\n\n1 \\leq A_i \\leq 10^9\n\n1 \\leq B_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 ... A_{N+1}\nB_1 B_2 ... B_N\n\nOutput\n\nPrint the maximum total number of monsters the heroes can defeat.\n\nSample Input 1\n\n2\n3 5 2\n4 5\n\nSample Output 1\n\n9\n\nIf the heroes choose the monsters to defeat as follows, they can defeat nine monsters in total, which is the maximum result.\n\nThe first hero defeats two monsters attacking the first town and two monsters attacking the second town.\n\nThe second hero defeats three monsters attacking the second town and two monsters attacking the third town.\n\nSample Input 2\n\n3\n5 6 3 8\n5 100 8\n\nSample Output 2\n\n22\n\nSample Input 3\n\n2\n100 1 1\n1 100\n\nSample Output 3\n\n3", "sample_input": "2\n3 5 2\n4 5\n"}, "reference_outputs": ["9\n"], "source_document_id": "p02959", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere are N+1 towns. The i-th town is being attacked by A_i monsters.\n\nWe have N heroes. The i-th hero can defeat monsters attacking the i-th or (i+1)-th town, for a total of at most B_i monsters.\n\nWhat is the maximum total number of monsters the heroes can cooperate to defeat?\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 10^5\n\n1 \\leq A_i \\leq 10^9\n\n1 \\leq B_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 ... A_{N+1}\nB_1 B_2 ... B_N\n\nOutput\n\nPrint the maximum total number of monsters the heroes can defeat.\n\nSample Input 1\n\n2\n3 5 2\n4 5\n\nSample Output 1\n\n9\n\nIf the heroes choose the monsters to defeat as follows, they can defeat nine monsters in total, which is the maximum result.\n\nThe first hero defeats two monsters attacking the first town and two monsters attacking the second town.\n\nThe second hero defeats three monsters attacking the second town and two monsters attacking the third town.\n\nSample Input 2\n\n3\n5 6 3 8\n5 100 8\n\nSample Output 2\n\n22\n\nSample Input 3\n\n2\n100 1 1\n1 100\n\nSample Output 3\n\n3", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 34, "memory_kb": 1024}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s311946462", "group_id": "codeNet:p02959", "input_text": "const maxn = trunc(1e5);\nvar a,b:array[1..maxn + 2] of longint;\n i,n:longint;\n re:int64;\n\nbegin\n\treadln(n);\n\tfor i:=1 to n + 1 do read(a[i]);\n\tfor i:=1 to n do read(b[i]);\n\tre:=0; b[n+1]:=0; a[n+2]:=0;\n\tfor i:=1 to n + 1 do \n\t\t begin\n\t\t if a[i] >= b[i] then \n\t\t begin\n\t\t re:= re + b[i];\n\t b[i]:=0;\n\t\t end\n\t\t else\n\t\t begin\n\t\t re:= re + a[i];\n\t\t b[i]:=b[i] - a[i];\n\t if a[i+1] >= b[i] then \n\t begin\n\t re:= re + b[i];\n\t b[i]:=0;\n\t a[i+1]:=a[i+1] - b[i];\n\t end\n\t else \n\t begin\n\t re:= re + a[i+1];\n\t a[i+1]:=0; b[i]:=0;\n\t end;\n\t\t end;\n\t\t end;\n\twrite(re);\nend.", "language": "Pascal", "metadata": {"date": 1564277711, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p02959.html", "problem_id": "p02959", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02959/input.txt", "sample_output_relpath": "derived/input_output/data/p02959/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02959/Pascal/s311946462.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s311946462", "user_id": "u017143931"}, "prompt_components": {"gold_output": "9\n", "input_to_evaluate": "const maxn = trunc(1e5);\nvar a,b:array[1..maxn + 2] of longint;\n i,n:longint;\n re:int64;\n\nbegin\n\treadln(n);\n\tfor i:=1 to n + 1 do read(a[i]);\n\tfor i:=1 to n do read(b[i]);\n\tre:=0; b[n+1]:=0; a[n+2]:=0;\n\tfor i:=1 to n + 1 do \n\t\t begin\n\t\t if a[i] >= b[i] then \n\t\t begin\n\t\t re:= re + b[i];\n\t b[i]:=0;\n\t\t end\n\t\t else\n\t\t begin\n\t\t re:= re + a[i];\n\t\t b[i]:=b[i] - a[i];\n\t if a[i+1] >= b[i] then \n\t begin\n\t re:= re + b[i];\n\t b[i]:=0;\n\t a[i+1]:=a[i+1] - b[i];\n\t end\n\t else \n\t begin\n\t re:= re + a[i+1];\n\t a[i+1]:=0; b[i]:=0;\n\t end;\n\t\t end;\n\t\t end;\n\twrite(re);\nend.", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere are N+1 towns. The i-th town is being attacked by A_i monsters.\n\nWe have N heroes. The i-th hero can defeat monsters attacking the i-th or (i+1)-th town, for a total of at most B_i monsters.\n\nWhat is the maximum total number of monsters the heroes can cooperate to defeat?\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 10^5\n\n1 \\leq A_i \\leq 10^9\n\n1 \\leq B_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 ... A_{N+1}\nB_1 B_2 ... B_N\n\nOutput\n\nPrint the maximum total number of monsters the heroes can defeat.\n\nSample Input 1\n\n2\n3 5 2\n4 5\n\nSample Output 1\n\n9\n\nIf the heroes choose the monsters to defeat as follows, they can defeat nine monsters in total, which is the maximum result.\n\nThe first hero defeats two monsters attacking the first town and two monsters attacking the second town.\n\nThe second hero defeats three monsters attacking the second town and two monsters attacking the third town.\n\nSample Input 2\n\n3\n5 6 3 8\n5 100 8\n\nSample Output 2\n\n22\n\nSample Input 3\n\n2\n100 1 1\n1 100\n\nSample Output 3\n\n3", "sample_input": "2\n3 5 2\n4 5\n"}, "reference_outputs": ["9\n"], "source_document_id": "p02959", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere are N+1 towns. The i-th town is being attacked by A_i monsters.\n\nWe have N heroes. The i-th hero can defeat monsters attacking the i-th or (i+1)-th town, for a total of at most B_i monsters.\n\nWhat is the maximum total number of monsters the heroes can cooperate to defeat?\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 10^5\n\n1 \\leq A_i \\leq 10^9\n\n1 \\leq B_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 ... A_{N+1}\nB_1 B_2 ... B_N\n\nOutput\n\nPrint the maximum total number of monsters the heroes can defeat.\n\nSample Input 1\n\n2\n3 5 2\n4 5\n\nSample Output 1\n\n9\n\nIf the heroes choose the monsters to defeat as follows, they can defeat nine monsters in total, which is the maximum result.\n\nThe first hero defeats two monsters attacking the first town and two monsters attacking the second town.\n\nThe second hero defeats three monsters attacking the second town and two monsters attacking the third town.\n\nSample Input 2\n\n3\n5 6 3 8\n5 100 8\n\nSample Output 2\n\n22\n\nSample Input 3\n\n2\n100 1 1\n1 100\n\nSample Output 3\n\n3", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 746, "cpu_time_ms": 33, "memory_kb": 896}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s304908376", "group_id": "codeNet:p02963", "input_text": "const side=1000000000;\n sq=1000000000000000000;\nvar s,i,j,x,y:int64;\n ans:array[1..3,1..2] of int64;\nbegin\nread(s);\nfor i :=1 to 3 do\n for j :=1 to 2 do ans[i,j]:=0;\nif s<=side then begin\nans[2,1]:=1;ans[3,2]:=s end\nelse \nfor i := 0 to side div 2 do\nbegin\n x:=s-i*i;\n y:=trunc(sqrt(x));\n if y*y=x then begin\n ans[2,1]:=x;ans[2,2]:=y;\n ans[3,1]:=x-y;ans[3,2]:=x+y;\n end;\n \nend;\nfor i := 1 to 3 do \n for j := 1 to 2 do write(ans[i,j],' ');\nend.", "language": "Pascal", "metadata": {"date": 1563762110, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p02963.html", "problem_id": "p02963", "resource_group": "low_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/Pascal/s304908376.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s304908376", "user_id": "u655683235"}, "prompt_components": {"gold_output": "1 0 2 2 0 1\n", "input_to_evaluate": "const side=1000000000;\n sq=1000000000000000000;\nvar s,i,j,x,y:int64;\n ans:array[1..3,1..2] of int64;\nbegin\nread(s);\nfor i :=1 to 3 do\n for j :=1 to 2 do ans[i,j]:=0;\nif s<=side then begin\nans[2,1]:=1;ans[3,2]:=s end\nelse \nfor i := 0 to side div 2 do\nbegin\n x:=s-i*i;\n y:=trunc(sqrt(x));\n if y*y=x then begin\n ans[2,1]:=x;ans[2,2]:=y;\n ans[3,1]:=x-y;ans[3,2]:=x+y;\n end;\n \nend;\nfor i := 1 to 3 do \n for j := 1 to 2 do write(ans[i,j],' ');\nend.", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 450, "cpu_time_ms": 2103, "memory_kb": 128}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s149710103", "group_id": "codeNet:p02971", "input_text": "var n,i,max1,max2:longint;\n a:array[1..200000] of longint;\nbegin\n\treadln(n);\n\tmax1:=0; max2:=0;\n\tfor i:=1 to n do \n\t begin\n\t read(a[i]);\n\t if a[i] > max1 then max1:=a[i]\n\t else if a[i] > max2 then max2:=a[i];\n\t end;\n\tfor i:=1 to n do\n\t if a[i] = max1 then writeln(max2)\n\t else writeln(max1);\nend.", "language": "Pascal", "metadata": {"date": 1563672385, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p02971.html", "problem_id": "p02971", "resource_group": "low_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/Pascal/s149710103.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s149710103", "user_id": "u017143931"}, "prompt_components": {"gold_output": "4\n3\n4\n", "input_to_evaluate": "var n,i,max1,max2:longint;\n a:array[1..200000] of longint;\nbegin\n\treadln(n);\n\tmax1:=0; max2:=0;\n\tfor i:=1 to n do \n\t begin\n\t read(a[i]);\n\t if a[i] > max1 then max1:=a[i]\n\t else if a[i] > max2 then max2:=a[i];\n\t end;\n\tfor i:=1 to n do\n\t if a[i] = max1 then writeln(max2)\n\t else writeln(max1);\nend.", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 55, "memory_kb": 2304}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s092425627", "group_id": "codeNet:p02971", "input_text": "var N,a,maxa,premaxa,i,maxNo:int64;\nbegin\nread(N);\nmaxa:=0;\npremaxa:=0;\nmaxNo:=0;\nfor i := 1 to N do\n begin\n read(a);\n if a >= maxa then begin \n premaxa:=maxa; maxa:=a; maxNo:=i end\n else if a >= premaxa then premaxa:=a;\n end;\nfor i := 1 to n do\nif i= maxNo then writeln(premaxa) \nelse writeln(maxa);\nend.", "language": "Pascal", "metadata": {"date": 1563671979, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p02971.html", "problem_id": "p02971", "resource_group": "low_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/Pascal/s092425627.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s092425627", "user_id": "u655683235"}, "prompt_components": {"gold_output": "4\n3\n4\n", "input_to_evaluate": "var N,a,maxa,premaxa,i,maxNo:int64;\nbegin\nread(N);\nmaxa:=0;\npremaxa:=0;\nmaxNo:=0;\nfor i := 1 to N do\n begin\n read(a);\n if a >= maxa then begin \n premaxa:=maxa; maxa:=a; maxNo:=i end\n else if a >= premaxa then premaxa:=a;\n end;\nfor i := 1 to n do\nif i= maxNo then writeln(premaxa) \nelse writeln(maxa);\nend.", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 56, "memory_kb": 1408}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s261406340", "group_id": "codeNet:p02972", "input_text": "const nmax=200010;\ntype ary=array[1..nmax] of 0..1;\nvar N,i,j,k,latter,sum,count:int64;\n a,ans:ary;\nbegin\nread(N);latter:=0;count:=0;\nfor i := 1 to N do \n begin read(a[i]);\n if i > N div 2 then \n begin \n ans[i]:=a[i];\n inc(latter);\n if ans[i]=1 then inc(count)\n end\n end;\nfor i := (N-latter) downto 1 do\n begin\n sum:=0;\n for j := 2 to N do\n if i*j > N then break \n else sum:=sum+ans[i*j];\n ans[i]:=(sum+a[i]) mod 2;\n if ans[i]=1 then inc(count);\n end;\nwriteln(count);\nfor i := 1 to N do\n if ans[i]=1 then write(i,' ');\nend.", "language": "Pascal", "metadata": {"date": 1563676106, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p02972.html", "problem_id": "p02972", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02972/input.txt", "sample_output_relpath": "derived/input_output/data/p02972/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02972/Pascal/s261406340.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s261406340", "user_id": "u655683235"}, "prompt_components": {"gold_output": "1\n1\n", "input_to_evaluate": "const nmax=200010;\ntype ary=array[1..nmax] of 0..1;\nvar N,i,j,k,latter,sum,count:int64;\n a,ans:ary;\nbegin\nread(N);latter:=0;count:=0;\nfor i := 1 to N do \n begin read(a[i]);\n if i > N div 2 then \n begin \n ans[i]:=a[i];\n inc(latter);\n if ans[i]=1 then inc(count)\n end\n end;\nfor i := (N-latter) downto 1 do\n begin\n sum:=0;\n for j := 2 to N do\n if i*j > N then break \n else sum:=sum+ans[i*j];\n ans[i]:=(sum+a[i]) mod 2;\n if ans[i]=1 then inc(count);\n end;\nwriteln(count);\nfor i := 1 to N do\n if ans[i]=1 then write(i,' ');\nend.", "problem_context": "Score : 400 points\n\nProblem Statement\n\nThere are N empty boxes arranged in a row from left to right.\nThe integer i is written on the i-th box from the left (1 \\leq i \\leq N).\n\nFor each of these boxes, Snuke can choose either to put a ball in it or to put nothing in it.\n\nWe say a set of choices to put a ball or not in the boxes is good when the following condition is satisfied:\n\nFor every integer i between 1 and N (inclusive), the total number of balls contained in the boxes with multiples of i written on them is congruent to a_i modulo 2.\n\nDoes there exist a good set of choices? If the answer is yes, find one good set of choices.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 2 \\times 10^5\n\na_i is 0 or 1.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_1 a_2 ... a_N\n\nOutput\n\nIf a good set of choices does not exist, print -1.\n\nIf a good set of choices exists, print one such set of choices in the following format:\n\nM\nb_1 b_2 ... b_M\n\nwhere M denotes the number of boxes that will contain a ball, and b_1,\\ b_2,\\ ...,\\ b_M are the integers written on these boxes, in any order.\n\nSample Input 1\n\n3\n1 0 0\n\nSample Output 1\n\n1\n1\n\nConsider putting a ball only in the box with 1 written on it.\n\nThere are three boxes with multiples of 1 written on them: the boxes with 1, 2, and 3. The total number of balls contained in these boxes is 1.\n\nThere is only one box with a multiple of 2 written on it: the box with 2. The total number of balls contained in these boxes is 0.\n\nThere is only one box with a multiple of 3 written on it: the box with 3. The total number of balls contained in these boxes is 0.\n\nThus, the condition is satisfied, so this set of choices is good.\n\nSample Input 2\n\n5\n0 0 0 0 0\n\nSample Output 2\n\n0\n\nPutting nothing in the boxes can be a good set of choices.", "sample_input": "3\n1 0 0\n"}, "reference_outputs": ["1\n1\n"], "source_document_id": "p02972", "source_text": "Score : 400 points\n\nProblem Statement\n\nThere are N empty boxes arranged in a row from left to right.\nThe integer i is written on the i-th box from the left (1 \\leq i \\leq N).\n\nFor each of these boxes, Snuke can choose either to put a ball in it or to put nothing in it.\n\nWe say a set of choices to put a ball or not in the boxes is good when the following condition is satisfied:\n\nFor every integer i between 1 and N (inclusive), the total number of balls contained in the boxes with multiples of i written on them is congruent to a_i modulo 2.\n\nDoes there exist a good set of choices? If the answer is yes, find one good set of choices.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 2 \\times 10^5\n\na_i is 0 or 1.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_1 a_2 ... a_N\n\nOutput\n\nIf a good set of choices does not exist, print -1.\n\nIf a good set of choices exists, print one such set of choices in the following format:\n\nM\nb_1 b_2 ... b_M\n\nwhere M denotes the number of boxes that will contain a ball, and b_1,\\ b_2,\\ ...,\\ b_M are the integers written on these boxes, in any order.\n\nSample Input 1\n\n3\n1 0 0\n\nSample Output 1\n\n1\n1\n\nConsider putting a ball only in the box with 1 written on it.\n\nThere are three boxes with multiples of 1 written on them: the boxes with 1, 2, and 3. The total number of balls contained in these boxes is 1.\n\nThere is only one box with a multiple of 2 written on it: the box with 2. The total number of balls contained in these boxes is 0.\n\nThere is only one box with a multiple of 3 written on it: the box with 3. The total number of balls contained in these boxes is 0.\n\nThus, the condition is satisfied, so this set of choices is good.\n\nSample Input 2\n\n5\n0 0 0 0 0\n\nSample Output 2\n\n0\n\nPutting nothing in the boxes can be a good set of choices.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 549, "cpu_time_ms": 39, "memory_kb": 1280}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s679080265", "group_id": "codeNet:p02973", "input_text": "const maxn = trunc(1e5);\nvar n,re,k,x,count,i:longint;\n d:array[1..maxn] of integer;\n a:array[1..maxn] of longint;\n\nbegin\n\treadln(n);\n\tfillchar(d,sizeof(d),0);\n\tfor i:=1 to n do readln(a[i]);\n\tcount:=1; x:=a[1]; k:=1; re:=0; d[1]:=1;\n\trepeat\n\t for i:=k to n do\n\t if (d[i] = 0) and (a[i] > x) then \n\t begin\n\t inc(count); d[i]:=1;\n\t end;\n\t for i:=2 to n do\n\t if d[i] = 0 then\n\t begin\n\t x:=a[i]; d[i]:=1; inc(count); k:=i + 1;\n\t if count = n then inc(re);\n\t break;\n\t end;\n\t inc(re);\n\tuntil count = n;\n\twrite(re);\nend.", "language": "Pascal", "metadata": {"date": 1563674246, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p02973.html", "problem_id": "p02973", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02973/input.txt", "sample_output_relpath": "derived/input_output/data/p02973/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02973/Pascal/s679080265.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s679080265", "user_id": "u017143931"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "const maxn = trunc(1e5);\nvar n,re,k,x,count,i:longint;\n d:array[1..maxn] of integer;\n a:array[1..maxn] of longint;\n\nbegin\n\treadln(n);\n\tfillchar(d,sizeof(d),0);\n\tfor i:=1 to n do readln(a[i]);\n\tcount:=1; x:=a[1]; k:=1; re:=0; d[1]:=1;\n\trepeat\n\t for i:=k to n do\n\t if (d[i] = 0) and (a[i] > x) then \n\t begin\n\t inc(count); d[i]:=1;\n\t end;\n\t for i:=2 to n do\n\t if d[i] = 0 then\n\t begin\n\t x:=a[i]; d[i]:=1; inc(count); k:=i + 1;\n\t if count = n then inc(re);\n\t break;\n\t end;\n\t inc(re);\n\tuntil count = n;\n\twrite(re);\nend.", "problem_context": "Score : 500 points\n\nProblem Statement\n\nYou are given a sequence with N integers: A = \\{ A_1, A_2, \\cdots, A_N \\}.\nFor each of these N integers, we will choose a color and paint the integer with that color. Here the following condition must be satisfied:\n\nIf A_i and A_j (i < j) are painted with the same color, A_i < A_j.\n\nFind the minimum number of colors required to satisfy the condition.\n\nConstraints\n\n1 \\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\n:\nA_N\n\nOutput\n\nPrint the minimum number of colors required to satisfy the condition.\n\nSample Input 1\n\n5\n2\n1\n4\n5\n3\n\nSample Output 1\n\n2\n\nWe can satisfy the condition with two colors by, for example, painting 2 and 3 red and painting 1, 4, and 5 blue.\n\nSample Input 2\n\n4\n0\n0\n0\n0\n\nSample Output 2\n\n4\n\nWe have to paint all the integers with distinct colors.", "sample_input": "5\n2\n1\n4\n5\n3\n"}, "reference_outputs": ["2\n"], "source_document_id": "p02973", "source_text": "Score : 500 points\n\nProblem Statement\n\nYou are given a sequence with N integers: A = \\{ A_1, A_2, \\cdots, A_N \\}.\nFor each of these N integers, we will choose a color and paint the integer with that color. Here the following condition must be satisfied:\n\nIf A_i and A_j (i < j) are painted with the same color, A_i < A_j.\n\nFind the minimum number of colors required to satisfy the condition.\n\nConstraints\n\n1 \\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\n:\nA_N\n\nOutput\n\nPrint the minimum number of colors required to satisfy the condition.\n\nSample Input 1\n\n5\n2\n1\n4\n5\n3\n\nSample Output 1\n\n2\n\nWe can satisfy the condition with two colors by, for example, painting 2 and 3 red and painting 1, 4, and 5 blue.\n\nSample Input 2\n\n4\n0\n0\n0\n0\n\nSample Output 2\n\n4\n\nWe have to paint all the integers with distinct colors.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 2103, "memory_kb": 896}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s248868153", "group_id": "codeNet:p02975", "input_text": "var n,inp,ans,i:Longint;\nA:array[1..100001] of Longint;\nbegin\nread(n);\nfor i:=1 to n do begin\n read(inp);\n ans:=ans xor inp;\nend;\nif ans = 0 then writeln('Yes')\nelse writeln('No');\nend.", "language": "Pascal", "metadata": {"date": 1585395817, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p02975.html", "problem_id": "p02975", "resource_group": "low_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/Pascal/s248868153.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s248868153", "user_id": "u331360010"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "var n,inp,ans,i:Longint;\nA:array[1..100001] of Longint;\nbegin\nread(n);\nfor i:=1 to n do begin\n read(inp);\n ans:=ans xor inp;\nend;\nif ans = 0 then writeln('Yes')\nelse writeln('No');\nend.", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 14, "memory_kb": 128}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s874454873", "group_id": "codeNet:p02975", "input_text": "var n,i,x,j:int64;\n a:array[1..3,1..2]of int64;\n flag:boolean;\nbegin\nread(n);\nfor i := 1 to 3 do a[i,1]:=-1;\n\nfor i := 1 to n do\n begin\n read(x);\n\n for j := 1 to 3 do\n begin\n flag:=false;\n \n if a[j,1]=x then \n begin\n flag:=true;\n inc(a[j,2]);\n break end;\n \n if a[j,1] < 0 then \n begin\n a[j,1]:=x;\n inc(a[j,2]);\n flag:=true;\n break end;\n end;\n \n if not flag then break;\nend;\n \n if not flag then write('No');\n \n if flag then \n if ((a[1,2]=a[2,2])and(a[1,2]=a[3,2]))or\n (((a[1,2]=2*a[2,2])or(a[2,2]=2*a[1,2]))and(a[3,2]=0))\n or(a[1,1]=0) then write('Yes') \n else write('No');\nend.", "language": "Pascal", "metadata": {"date": 1563160672, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p02975.html", "problem_id": "p02975", "resource_group": "low_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/Pascal/s874454873.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s874454873", "user_id": "u655683235"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "var n,i,x,j:int64;\n a:array[1..3,1..2]of int64;\n flag:boolean;\nbegin\nread(n);\nfor i := 1 to 3 do a[i,1]:=-1;\n\nfor i := 1 to n do\n begin\n read(x);\n\n for j := 1 to 3 do\n begin\n flag:=false;\n \n if a[j,1]=x then \n begin\n flag:=true;\n inc(a[j,2]);\n break end;\n \n if a[j,1] < 0 then \n begin\n a[j,1]:=x;\n inc(a[j,2]);\n flag:=true;\n break end;\n end;\n \n if not flag then break;\nend;\n \n if not flag then write('No');\n \n if flag then \n if ((a[1,2]=a[2,2])and(a[1,2]=a[3,2]))or\n (((a[1,2]=2*a[2,2])or(a[2,2]=2*a[1,2]))and(a[3,2]=0))\n or(a[1,1]=0) then write('Yes') \n else write('No');\nend.", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 15, "memory_kb": 128}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s850702484", "group_id": "codeNet:p02975", "input_text": "const nmax=100010;\nvar n,i:int64;\n j:0..30;\n a:array[1..nmax] of int64;\n count:array[0..1]of int64;\n flag:boolean;\nbegin\nread(n);flag:=true;\nfor i := 1 to n do read(a[i]);\n\nfor j := 0 to 30 do\n begin\n count[0]:=0;count[1]:=0;\n for i := 1 to n do \n inc(count[a[i]>>1]);\n if not((count[1]=0)or(count[1]=2*count[0]))\n then flag:=false;\n end;\nif flag then write('Yes') else write('No');\nend.", "language": "Pascal", "metadata": {"date": 1563157678, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p02975.html", "problem_id": "p02975", "resource_group": "low_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/Pascal/s850702484.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s850702484", "user_id": "u655683235"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "const nmax=100010;\nvar n,i:int64;\n j:0..30;\n a:array[1..nmax] of int64;\n count:array[0..1]of int64;\n flag:boolean;\nbegin\nread(n);flag:=true;\nfor i := 1 to n do read(a[i]);\n\nfor j := 0 to 30 do\n begin\n count[0]:=0;count[1]:=0;\n for i := 1 to n do \n inc(count[a[i]>>1]);\n if not((count[1]=0)or(count[1]=2*count[0]))\n then flag:=false;\n end;\nif flag then write('Yes') else write('No');\nend.", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 14, "memory_kb": 896}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s581607779", "group_id": "codeNet:p02975", "input_text": "var n,i,x,j:int64;\n a:array[1..3]of int64;\n flag:boolean;\nbegin\nread(n);\nfor i := 1 to 3 do \n begin \n a[i]:=-1;\n flag:=false;\n end;\nfor i := 1 to n do\n begin\n read(x);\n\n for j := 1 to 3 do\n begin\n if a[j]=x then flag:=true;\n if a[j] < 0 then begin a[j]:=x;flag:=true end;\n end;\n if not flag then break;\n end;\n if flag then write('Yes') else write('No');\nend.", "language": "Pascal", "metadata": {"date": 1563157605, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p02975.html", "problem_id": "p02975", "resource_group": "low_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/Pascal/s581607779.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s581607779", "user_id": "u655683235"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "var n,i,x,j:int64;\n a:array[1..3]of int64;\n flag:boolean;\nbegin\nread(n);\nfor i := 1 to 3 do \n begin \n a[i]:=-1;\n flag:=false;\n end;\nfor i := 1 to n do\n begin\n read(x);\n\n for j := 1 to 3 do\n begin\n if a[j]=x then flag:=true;\n if a[j] < 0 then begin a[j]:=x;flag:=true end;\n end;\n if not flag then break;\n end;\n if flag then write('Yes') else write('No');\nend.", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 15, "memory_kb": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s443915705", "group_id": "codeNet:p02981", "input_text": "uses math;\nvar n,a,b:longint;\nbegin\n readln(n,a,b);\n write(min(n*a,b));\nend.", "language": "Pascal", "metadata": {"date": 1562547907, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p02981.html", "problem_id": "p02981", "resource_group": "low_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/Pascal/s443915705.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s443915705", "user_id": "u482388085"}, "prompt_components": {"gold_output": "8\n", "input_to_evaluate": "uses math;\nvar n,a,b:longint;\nbegin\n readln(n,a,b);\n write(min(n*a,b));\nend.", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 78, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s103812527", "group_id": "codeNet:p02984", "input_text": "var n, i, tmp: longint;\n a, b: array[1..100000] of longint;\n\nbegin\n read(n);\n for i := 1 to n do read(a[i]);\n i := n - 1;\n while i > 0 do\n begin\n tmp := tmp + a[i] - a[i - 1];\n i := i - 2;\n end;\n b[n] := tmp + a[n];\n for i := (n - 1) downto 1 do b[i] := a[i] * 2 - b[i + 1];\n for i := 1 to n do write(b[i], ' ');\nend.\n{\nb[2] - b[1] = (a[3] / 2 + a[2] / 2) - (a[2] / 2 + a[1] / 2);\n = (a[3] - a[1]) / 2;\nb[4] - b[3] = (a[5] - a[3]) / 2;\n}", "language": "Pascal", "metadata": {"date": 1567484970, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p02984.html", "problem_id": "p02984", "resource_group": "low_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/Pascal/s103812527.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s103812527", "user_id": "u073463809"}, "prompt_components": {"gold_output": "4 0 4\n", "input_to_evaluate": "var n, i, tmp: longint;\n a, b: array[1..100000] of longint;\n\nbegin\n read(n);\n for i := 1 to n do read(a[i]);\n i := n - 1;\n while i > 0 do\n begin\n tmp := tmp + a[i] - a[i - 1];\n i := i - 2;\n end;\n b[n] := tmp + a[n];\n for i := (n - 1) downto 1 do b[i] := a[i] * 2 - b[i + 1];\n for i := 1 to n do write(b[i], ' ');\nend.\n{\nb[2] - b[1] = (a[3] / 2 + a[2] / 2) - (a[2] / 2 + a[1] / 2);\n = (a[3] - a[1]) / 2;\nb[4] - b[3] = (a[5] - a[3]) / 2;\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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 41, "memory_kb": 1920}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s787016993", "group_id": "codeNet:p02984", "input_text": "var i,n:longint;\n a,b:array[1..100000] of longint;\nbegin\n\treadln(n); b[1]:=0;\n\tfor i:=1 to n do read(a[i]);\n\tfor i:=1 to n do \n\t if i mod 2 = 0 then b[1]:= b[1] - 2 * a[i]\n\t else b[1]:=b[1] + 2 * a[i];\n\tb[1]:= b[1] div 2;\n\tfor i:=2 to n do b[i]:= (a[i-1] - b[i - 1] div 2) * 2;\n\tfor i:=1 to n do write(b[i],' ');\nend.", "language": "Pascal", "metadata": {"date": 1562713900, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p02984.html", "problem_id": "p02984", "resource_group": "low_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/Pascal/s787016993.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s787016993", "user_id": "u017143931"}, "prompt_components": {"gold_output": "4 0 4\n", "input_to_evaluate": "var i,n:longint;\n a,b:array[1..100000] of longint;\nbegin\n\treadln(n); b[1]:=0;\n\tfor i:=1 to n do read(a[i]);\n\tfor i:=1 to n do \n\t if i mod 2 = 0 then b[1]:= b[1] - 2 * a[i]\n\t else b[1]:=b[1] + 2 * a[i];\n\tb[1]:= b[1] div 2;\n\tfor i:=2 to n do b[i]:= (a[i-1] - b[i - 1] div 2) * 2;\n\tfor i:=1 to n do write(b[i],' ');\nend.", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 41, "memory_kb": 2048}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s464369879", "group_id": "codeNet:p02989", "input_text": "var i,n,j,res:longint;\n a:array[1..100000] of longint;\nprocedure sort(l,r:longint);\nvar i,j,x,y: longint;\nbegin\n i:=l; j:=r; x:=a[random(r-l+1)+l];\n repeat\n while a[i] < x do inc(i);\n while x < a[j] do dec(j);\n if not(i > j) then\n begin\n y:=a[i];\n a[i]:=a[j];\n a[j]:=y;\n inc(i);\n dec(j);\n end;\n until i > j;\n if l < j then sort(l,j);\n if i < r then sort(i,r);\nend;\nfunction find(l,r,x:longint):longint;\nvar mid:longint;\nbegin\n while l <= r do\n begin\n mid:=(l+r) >> 1;\n if (a[mid] < x) then l:=mid + 1 else r:=mid -1;\n end;\n exit(l-1);\nend;\nbegin\n readln(n);\n for i:=1 to n do read(a[i]);\n sort(1,n);\n for i:=1 to a[n] do if find(1,n,i) = n div 2 then inc(res);\n writeln(res)\nend.", "language": "Pascal", "metadata": {"date": 1562035020, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p02989.html", "problem_id": "p02989", "resource_group": "low_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/Pascal/s464369879.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s464369879", "user_id": "u482388085"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "var i,n,j,res:longint;\n a:array[1..100000] of longint;\nprocedure sort(l,r:longint);\nvar i,j,x,y: longint;\nbegin\n i:=l; j:=r; x:=a[random(r-l+1)+l];\n repeat\n while a[i] < x do inc(i);\n while x < a[j] do dec(j);\n if not(i > j) then\n begin\n y:=a[i];\n a[i]:=a[j];\n a[j]:=y;\n inc(i);\n dec(j);\n end;\n until i > j;\n if l < j then sort(l,j);\n if i < r then sort(i,r);\nend;\nfunction find(l,r,x:longint):longint;\nvar mid:longint;\nbegin\n while l <= r do\n begin\n mid:=(l+r) >> 1;\n if (a[mid] < x) then l:=mid + 1 else r:=mid -1;\n end;\n exit(l-1);\nend;\nbegin\n readln(n);\n for i:=1 to n do read(a[i]);\n sort(1,n);\n for i:=1 to a[n] do if find(1,n,i) = n div 2 then inc(res);\n writeln(res)\nend.", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 762, "cpu_time_ms": 30, "memory_kb": 512}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s138643017", "group_id": "codeNet:p02990", "input_text": "const modP = 13;\nvar Kcomb,NKcomb,inv:array[0..2010]of int64;\n i,j,k,a,b,n,m,p:int64;\n \nbegin\n readln(n,k);\n \n inv[1]:=1;\n for i:=2 to k do begin\n inv[i]:=1;\n p:=modP-2;\n j:=i;\n while p>0 do begin\n if (p and 1)>0 then inv[i]:=inv[i]*j mod modP;\n j:=j*j mod modP;\n p:=p >> 1;\n end;\n end;\n \n NKcomb[0]:=1; NKcomb[n-k+1]:=1;\n Kcomb[0]:=1; Kcomb[k-1]:=1;\n for i:=1 to (k+1)div 2 do begin\n a:=k-i;\n Kcomb[i]:=(Kcomb[i-1] mod modP)*(a mod modP)*inv[i] mod modP ;\n Kcomb[k-1-i]:=Kcomb[i];\n end;\n m:=n-k+1;\n for i:=1 to (m+1)div 2 do begin\n a:=m-i+1;\n NKcomb[i]:=(NKcomb[i-1] mod modP)*(a mod modP)*inv[i] mod modP;\n NKcomb[m-i]:=NKcomb[i];\n end;\n \n for i:=1 to k do begin\n if i<=n-k+1 then begin\n b:=(NKcomb[i] mod modP)*(Kcomb[i-1] mod modP) mod modP;\n writeln(b);\n end else writeln(0);\n end;\n \nend.\n", "language": "Pascal", "metadata": {"date": 1562164531, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p02990.html", "problem_id": "p02990", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02990/input.txt", "sample_output_relpath": "derived/input_output/data/p02990/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02990/Pascal/s138643017.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s138643017", "user_id": "u805277811"}, "prompt_components": {"gold_output": "3\n6\n1\n", "input_to_evaluate": "const modP = 13;\nvar Kcomb,NKcomb,inv:array[0..2010]of int64;\n i,j,k,a,b,n,m,p:int64;\n \nbegin\n readln(n,k);\n \n inv[1]:=1;\n for i:=2 to k do begin\n inv[i]:=1;\n p:=modP-2;\n j:=i;\n while p>0 do begin\n if (p and 1)>0 then inv[i]:=inv[i]*j mod modP;\n j:=j*j mod modP;\n p:=p >> 1;\n end;\n end;\n \n NKcomb[0]:=1; NKcomb[n-k+1]:=1;\n Kcomb[0]:=1; Kcomb[k-1]:=1;\n for i:=1 to (k+1)div 2 do begin\n a:=k-i;\n Kcomb[i]:=(Kcomb[i-1] mod modP)*(a mod modP)*inv[i] mod modP ;\n Kcomb[k-1-i]:=Kcomb[i];\n end;\n m:=n-k+1;\n for i:=1 to (m+1)div 2 do begin\n a:=m-i+1;\n NKcomb[i]:=(NKcomb[i-1] mod modP)*(a mod modP)*inv[i] mod modP;\n NKcomb[m-i]:=NKcomb[i];\n end;\n \n for i:=1 to k do begin\n if i<=n-k+1 then begin\n b:=(NKcomb[i] mod modP)*(Kcomb[i-1] mod modP) mod modP;\n writeln(b);\n end else writeln(0);\n end;\n \nend.\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nThere are K blue balls and N-K red balls. The balls of the same color cannot be distinguished. Snuke and Takahashi are playing with these balls.\n\nFirst, Snuke will arrange the N balls in a row from left to right.\n\nThen, Takahashi will collect only the K blue balls. In one move, he can collect any number of consecutive blue balls. He will collect all the blue balls in the fewest moves possible.\n\nHow many ways are there for Snuke to arrange the N balls in a row so that Takahashi will need exactly i moves to collect all the blue balls? Compute this number modulo 10^9+7 for each i such that 1 \\leq i \\leq K.\n\nConstraints\n\n1 \\leq K \\leq N \\leq 2000\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\n\nOutput\n\nPrint K lines. The i-th line (1 \\leq i \\leq K) should contain the number of ways to arrange the N balls so that Takahashi will need exactly i moves to collect all the blue balls, modulo 10^9+7.\n\nSample Input 1\n\n5 3\n\nSample Output 1\n\n3\n6\n1\n\nThere are three ways to arrange the balls so that Takahashi will need exactly one move: (B, B, B, R, R), (R, B, B, B, R), and (R, R, B, B, B). (R and B stands for red and blue, respectively).\n\nThere are six ways to arrange the balls so that Takahashi will need exactly two moves: (B, B, R, B, R), (B, B, R, R, B), (R, B, B, R, B), (R, B, R, B, B), (B, R, B, B, R), and (B, R, R, B, B).\n\nThere is one way to arrange the balls so that Takahashi will need exactly three moves: (B, R, B, R, B).\n\nSample Input 2\n\n2000 3\n\nSample Output 2\n\n1998\n3990006\n327341989\n\nBe sure to print the numbers of arrangements modulo 10^9+7.", "sample_input": "5 3\n"}, "reference_outputs": ["3\n6\n1\n"], "source_document_id": "p02990", "source_text": "Score : 400 points\n\nProblem Statement\n\nThere are K blue balls and N-K red balls. The balls of the same color cannot be distinguished. Snuke and Takahashi are playing with these balls.\n\nFirst, Snuke will arrange the N balls in a row from left to right.\n\nThen, Takahashi will collect only the K blue balls. In one move, he can collect any number of consecutive blue balls. He will collect all the blue balls in the fewest moves possible.\n\nHow many ways are there for Snuke to arrange the N balls in a row so that Takahashi will need exactly i moves to collect all the blue balls? Compute this number modulo 10^9+7 for each i such that 1 \\leq i \\leq K.\n\nConstraints\n\n1 \\leq K \\leq N \\leq 2000\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\n\nOutput\n\nPrint K lines. The i-th line (1 \\leq i \\leq K) should contain the number of ways to arrange the N balls so that Takahashi will need exactly i moves to collect all the blue balls, modulo 10^9+7.\n\nSample Input 1\n\n5 3\n\nSample Output 1\n\n3\n6\n1\n\nThere are three ways to arrange the balls so that Takahashi will need exactly one move: (B, B, B, R, R), (R, B, B, B, R), and (R, R, B, B, B). (R and B stands for red and blue, respectively).\n\nThere are six ways to arrange the balls so that Takahashi will need exactly two moves: (B, B, R, B, R), (B, B, R, R, B), (R, B, B, R, B), (R, B, R, B, B), (B, R, B, B, R), and (B, R, R, B, B).\n\nThere is one way to arrange the balls so that Takahashi will need exactly three moves: (B, R, B, R, B).\n\nSample Input 2\n\n2000 3\n\nSample Output 2\n\n1998\n3990006\n327341989\n\nBe sure to print the numbers of arrangements modulo 10^9+7.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 879, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s672140785", "group_id": "codeNet:p02990", "input_text": "const base = trunc(1e9) + 7;\nvar a:array[0..2000,0..2000] of int64;\n n,k,i,j:integer;\nbegin\n\treadln(n,k);\n\ta[0,0]:=1;\n\tfor i:=1 to 2000 do\n\t begin\n a[i,0]:=1;\n\t for j:=1 to 2000 do \n\t a[i,j]:=(a[i-1,j] + a[i-1,j-1]) mod base;\n\t end;\n for i:=1 to k do\n writeln((a[k - 1, i - 1] * a[n - k + 1,i]) mod base);\nend.", "language": "Pascal", "metadata": {"date": 1561913907, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p02990.html", "problem_id": "p02990", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02990/input.txt", "sample_output_relpath": "derived/input_output/data/p02990/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02990/Pascal/s672140785.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s672140785", "user_id": "u017143931"}, "prompt_components": {"gold_output": "3\n6\n1\n", "input_to_evaluate": "const base = trunc(1e9) + 7;\nvar a:array[0..2000,0..2000] of int64;\n n,k,i,j:integer;\nbegin\n\treadln(n,k);\n\ta[0,0]:=1;\n\tfor i:=1 to 2000 do\n\t begin\n a[i,0]:=1;\n\t for j:=1 to 2000 do \n\t a[i,j]:=(a[i-1,j] + a[i-1,j-1]) mod base;\n\t end;\n for i:=1 to k do\n writeln((a[k - 1, i - 1] * a[n - k + 1,i]) mod base);\nend.", "problem_context": "Score : 400 points\n\nProblem Statement\n\nThere are K blue balls and N-K red balls. The balls of the same color cannot be distinguished. Snuke and Takahashi are playing with these balls.\n\nFirst, Snuke will arrange the N balls in a row from left to right.\n\nThen, Takahashi will collect only the K blue balls. In one move, he can collect any number of consecutive blue balls. He will collect all the blue balls in the fewest moves possible.\n\nHow many ways are there for Snuke to arrange the N balls in a row so that Takahashi will need exactly i moves to collect all the blue balls? Compute this number modulo 10^9+7 for each i such that 1 \\leq i \\leq K.\n\nConstraints\n\n1 \\leq K \\leq N \\leq 2000\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\n\nOutput\n\nPrint K lines. The i-th line (1 \\leq i \\leq K) should contain the number of ways to arrange the N balls so that Takahashi will need exactly i moves to collect all the blue balls, modulo 10^9+7.\n\nSample Input 1\n\n5 3\n\nSample Output 1\n\n3\n6\n1\n\nThere are three ways to arrange the balls so that Takahashi will need exactly one move: (B, B, B, R, R), (R, B, B, B, R), and (R, R, B, B, B). (R and B stands for red and blue, respectively).\n\nThere are six ways to arrange the balls so that Takahashi will need exactly two moves: (B, B, R, B, R), (B, B, R, R, B), (R, B, B, R, B), (R, B, R, B, B), (B, R, B, B, R), and (B, R, R, B, B).\n\nThere is one way to arrange the balls so that Takahashi will need exactly three moves: (B, R, B, R, B).\n\nSample Input 2\n\n2000 3\n\nSample Output 2\n\n1998\n3990006\n327341989\n\nBe sure to print the numbers of arrangements modulo 10^9+7.", "sample_input": "5 3\n"}, "reference_outputs": ["3\n6\n1\n"], "source_document_id": "p02990", "source_text": "Score : 400 points\n\nProblem Statement\n\nThere are K blue balls and N-K red balls. The balls of the same color cannot be distinguished. Snuke and Takahashi are playing with these balls.\n\nFirst, Snuke will arrange the N balls in a row from left to right.\n\nThen, Takahashi will collect only the K blue balls. In one move, he can collect any number of consecutive blue balls. He will collect all the blue balls in the fewest moves possible.\n\nHow many ways are there for Snuke to arrange the N balls in a row so that Takahashi will need exactly i moves to collect all the blue balls? Compute this number modulo 10^9+7 for each i such that 1 \\leq i \\leq K.\n\nConstraints\n\n1 \\leq K \\leq N \\leq 2000\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\n\nOutput\n\nPrint K lines. The i-th line (1 \\leq i \\leq K) should contain the number of ways to arrange the N balls so that Takahashi will need exactly i moves to collect all the blue balls, modulo 10^9+7.\n\nSample Input 1\n\n5 3\n\nSample Output 1\n\n3\n6\n1\n\nThere are three ways to arrange the balls so that Takahashi will need exactly one move: (B, B, B, R, R), (R, B, B, B, R), and (R, R, B, B, B). (R and B stands for red and blue, respectively).\n\nThere are six ways to arrange the balls so that Takahashi will need exactly two moves: (B, B, R, B, R), (B, B, R, R, B), (R, B, B, R, B), (R, B, R, B, B), (B, R, B, B, R), and (B, R, R, B, B).\n\nThere is one way to arrange the balls so that Takahashi will need exactly three moves: (B, R, B, R, B).\n\nSample Input 2\n\n2000 3\n\nSample Output 2\n\n1998\n3990006\n327341989\n\nBe sure to print the numbers of arrangements modulo 10^9+7.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 56, "memory_kb": 31360}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s146324877", "group_id": "codeNet:p02990", "input_text": "var\n\tN,K,i:Longint;\n\tinv:Array[1..2002]of Longint;\n\tB,R,M:int64;\nbegin\n\tread(N,K);\n\tinv[1]:=1;\n\tM:=1000000007;\n\tfor i:=2 to K+2 do begin\n\t\tinv[i]:=M-M div i*inv[M mod i] mod M;\n\tend;\n\tB:=1;\n\tR:=N-K+1;\n\tfor i:=0 to K-1 do begin\n\t\twriteln(B*R mod M);\n\t\tB:=B*(K-i-1)mod M*inv[i+1]mod M;\n\t\tR:=R*(N-K-i)mod M*inv[i+2]mod M;\n\tend;\nend.", "language": "Pascal", "metadata": {"date": 1561863401, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p02990.html", "problem_id": "p02990", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02990/input.txt", "sample_output_relpath": "derived/input_output/data/p02990/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02990/Pascal/s146324877.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s146324877", "user_id": "u017143931"}, "prompt_components": {"gold_output": "3\n6\n1\n", "input_to_evaluate": "var\n\tN,K,i:Longint;\n\tinv:Array[1..2002]of Longint;\n\tB,R,M:int64;\nbegin\n\tread(N,K);\n\tinv[1]:=1;\n\tM:=1000000007;\n\tfor i:=2 to K+2 do begin\n\t\tinv[i]:=M-M div i*inv[M mod i] mod M;\n\tend;\n\tB:=1;\n\tR:=N-K+1;\n\tfor i:=0 to K-1 do begin\n\t\twriteln(B*R mod M);\n\t\tB:=B*(K-i-1)mod M*inv[i+1]mod M;\n\t\tR:=R*(N-K-i)mod M*inv[i+2]mod M;\n\tend;\nend.", "problem_context": "Score : 400 points\n\nProblem Statement\n\nThere are K blue balls and N-K red balls. The balls of the same color cannot be distinguished. Snuke and Takahashi are playing with these balls.\n\nFirst, Snuke will arrange the N balls in a row from left to right.\n\nThen, Takahashi will collect only the K blue balls. In one move, he can collect any number of consecutive blue balls. He will collect all the blue balls in the fewest moves possible.\n\nHow many ways are there for Snuke to arrange the N balls in a row so that Takahashi will need exactly i moves to collect all the blue balls? Compute this number modulo 10^9+7 for each i such that 1 \\leq i \\leq K.\n\nConstraints\n\n1 \\leq K \\leq N \\leq 2000\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\n\nOutput\n\nPrint K lines. The i-th line (1 \\leq i \\leq K) should contain the number of ways to arrange the N balls so that Takahashi will need exactly i moves to collect all the blue balls, modulo 10^9+7.\n\nSample Input 1\n\n5 3\n\nSample Output 1\n\n3\n6\n1\n\nThere are three ways to arrange the balls so that Takahashi will need exactly one move: (B, B, B, R, R), (R, B, B, B, R), and (R, R, B, B, B). (R and B stands for red and blue, respectively).\n\nThere are six ways to arrange the balls so that Takahashi will need exactly two moves: (B, B, R, B, R), (B, B, R, R, B), (R, B, B, R, B), (R, B, R, B, B), (B, R, B, B, R), and (B, R, R, B, B).\n\nThere is one way to arrange the balls so that Takahashi will need exactly three moves: (B, R, B, R, B).\n\nSample Input 2\n\n2000 3\n\nSample Output 2\n\n1998\n3990006\n327341989\n\nBe sure to print the numbers of arrangements modulo 10^9+7.", "sample_input": "5 3\n"}, "reference_outputs": ["3\n6\n1\n"], "source_document_id": "p02990", "source_text": "Score : 400 points\n\nProblem Statement\n\nThere are K blue balls and N-K red balls. The balls of the same color cannot be distinguished. Snuke and Takahashi are playing with these balls.\n\nFirst, Snuke will arrange the N balls in a row from left to right.\n\nThen, Takahashi will collect only the K blue balls. In one move, he can collect any number of consecutive blue balls. He will collect all the blue balls in the fewest moves possible.\n\nHow many ways are there for Snuke to arrange the N balls in a row so that Takahashi will need exactly i moves to collect all the blue balls? Compute this number modulo 10^9+7 for each i such that 1 \\leq i \\leq K.\n\nConstraints\n\n1 \\leq K \\leq N \\leq 2000\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\n\nOutput\n\nPrint K lines. The i-th line (1 \\leq i \\leq K) should contain the number of ways to arrange the N balls so that Takahashi will need exactly i moves to collect all the blue balls, modulo 10^9+7.\n\nSample Input 1\n\n5 3\n\nSample Output 1\n\n3\n6\n1\n\nThere are three ways to arrange the balls so that Takahashi will need exactly one move: (B, B, B, R, R), (R, B, B, B, R), and (R, R, B, B, B). (R and B stands for red and blue, respectively).\n\nThere are six ways to arrange the balls so that Takahashi will need exactly two moves: (B, B, R, B, R), (B, B, R, R, B), (R, B, B, R, B), (R, B, R, B, B), (B, R, B, B, R), and (B, R, R, B, B).\n\nThere is one way to arrange the balls so that Takahashi will need exactly three moves: (B, R, B, R, B).\n\nSample Input 2\n\n2000 3\n\nSample Output 2\n\n1998\n3990006\n327341989\n\nBe sure to print the numbers of arrangements modulo 10^9+7.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 329, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s408890061", "group_id": "codeNet:p02990", "input_text": "const md=1000000007;\nvar n,k,i,nk1,red,blue:int64;\n\nfunction fact(p:int64):int64;\n var q,j:int64;\nbegin q:=1;\n for j := p downto 1 do q:=q*j mod md; fact:=q\nend;\n\nbegin\nread(n,k);nk1:=n-k+1;\nwriteln(nk1);\nfor i := 2 to k do \n if i <= nk1 then\n begin \n blue:=(fact(k-1) div (fact(k-i)*fact(i-1))) mod md;\n red:=(fact(nk1) div (fact(nk1-i)*fact(i))) mod md;\n writeln(red*blue mod md)\n end\n else write(0);\nend.\n ", "language": "Pascal", "metadata": {"date": 1561862560, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p02990.html", "problem_id": "p02990", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02990/input.txt", "sample_output_relpath": "derived/input_output/data/p02990/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02990/Pascal/s408890061.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s408890061", "user_id": "u655683235"}, "prompt_components": {"gold_output": "3\n6\n1\n", "input_to_evaluate": "const md=1000000007;\nvar n,k,i,nk1,red,blue:int64;\n\nfunction fact(p:int64):int64;\n var q,j:int64;\nbegin q:=1;\n for j := p downto 1 do q:=q*j mod md; fact:=q\nend;\n\nbegin\nread(n,k);nk1:=n-k+1;\nwriteln(nk1);\nfor i := 2 to k do \n if i <= nk1 then\n begin \n blue:=(fact(k-1) div (fact(k-i)*fact(i-1))) mod md;\n red:=(fact(nk1) div (fact(nk1-i)*fact(i))) mod md;\n writeln(red*blue mod md)\n end\n else write(0);\nend.\n ", "problem_context": "Score : 400 points\n\nProblem Statement\n\nThere are K blue balls and N-K red balls. The balls of the same color cannot be distinguished. Snuke and Takahashi are playing with these balls.\n\nFirst, Snuke will arrange the N balls in a row from left to right.\n\nThen, Takahashi will collect only the K blue balls. In one move, he can collect any number of consecutive blue balls. He will collect all the blue balls in the fewest moves possible.\n\nHow many ways are there for Snuke to arrange the N balls in a row so that Takahashi will need exactly i moves to collect all the blue balls? Compute this number modulo 10^9+7 for each i such that 1 \\leq i \\leq K.\n\nConstraints\n\n1 \\leq K \\leq N \\leq 2000\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\n\nOutput\n\nPrint K lines. The i-th line (1 \\leq i \\leq K) should contain the number of ways to arrange the N balls so that Takahashi will need exactly i moves to collect all the blue balls, modulo 10^9+7.\n\nSample Input 1\n\n5 3\n\nSample Output 1\n\n3\n6\n1\n\nThere are three ways to arrange the balls so that Takahashi will need exactly one move: (B, B, B, R, R), (R, B, B, B, R), and (R, R, B, B, B). (R and B stands for red and blue, respectively).\n\nThere are six ways to arrange the balls so that Takahashi will need exactly two moves: (B, B, R, B, R), (B, B, R, R, B), (R, B, B, R, B), (R, B, R, B, B), (B, R, B, B, R), and (B, R, R, B, B).\n\nThere is one way to arrange the balls so that Takahashi will need exactly three moves: (B, R, B, R, B).\n\nSample Input 2\n\n2000 3\n\nSample Output 2\n\n1998\n3990006\n327341989\n\nBe sure to print the numbers of arrangements modulo 10^9+7.", "sample_input": "5 3\n"}, "reference_outputs": ["3\n6\n1\n"], "source_document_id": "p02990", "source_text": "Score : 400 points\n\nProblem Statement\n\nThere are K blue balls and N-K red balls. The balls of the same color cannot be distinguished. Snuke and Takahashi are playing with these balls.\n\nFirst, Snuke will arrange the N balls in a row from left to right.\n\nThen, Takahashi will collect only the K blue balls. In one move, he can collect any number of consecutive blue balls. He will collect all the blue balls in the fewest moves possible.\n\nHow many ways are there for Snuke to arrange the N balls in a row so that Takahashi will need exactly i moves to collect all the blue balls? Compute this number modulo 10^9+7 for each i such that 1 \\leq i \\leq K.\n\nConstraints\n\n1 \\leq K \\leq N \\leq 2000\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\n\nOutput\n\nPrint K lines. The i-th line (1 \\leq i \\leq K) should contain the number of ways to arrange the N balls so that Takahashi will need exactly i moves to collect all the blue balls, modulo 10^9+7.\n\nSample Input 1\n\n5 3\n\nSample Output 1\n\n3\n6\n1\n\nThere are three ways to arrange the balls so that Takahashi will need exactly one move: (B, B, B, R, R), (R, B, B, B, R), and (R, R, B, B, B). (R and B stands for red and blue, respectively).\n\nThere are six ways to arrange the balls so that Takahashi will need exactly two moves: (B, B, R, B, R), (B, B, R, R, B), (R, B, B, R, B), (R, B, R, B, B), (B, R, B, B, R), and (B, R, R, B, B).\n\nThere is one way to arrange the balls so that Takahashi will need exactly three moves: (B, R, B, R, B).\n\nSample Input 2\n\n2000 3\n\nSample Output 2\n\n1998\n3990006\n327341989\n\nBe sure to print the numbers of arrangements modulo 10^9+7.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 49, "memory_kb": 128}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s475610539", "group_id": "codeNet:p02996", "input_text": "const NMAX = 1000000;\ntype ary = array[1..NMAX] of integer;\nvar a,b :ary;\n i,j,k,n :longint;\n flag:boolean;\n\nprocedure sort(p,q :integer; var a,b :ary);\n var i, j, k, w :integer;\nbegin i := p; j := q; k:=a[(p+q) div 2];\n repeat\n while a[i] < k do i := i+1;\n while k < a[j] do j := j-1;\n if i <= j then begin\n w := a[i]; a[i] := a[j]; a[j] := w;\n w := b[i]; b[i] := b[j]; b[j] := w;\n i := i+1; j := j-1\n end\n until i > j;\n if p < j then sort(p,j,a,b);\n if i < q then sort(i,q,a,b)\nend;\n\nbegin\n readln(n);\n flag:=false;\n for i:=1 to n do readln(a[i],b[i]);\n sort(1,n,b,a);\n for i:=1 to n-1 do a[i+1]:=a[i+1]+a[i];\n for i:=1 to n do if b[i] j;\n if p < j then sort(p,j,a,b);\n if i < q then sort(i,q,a,b)\nend;\n\nbegin\n readln(n);\n flag:=false;\n for i:=1 to n do readln(a[i],b[i]);\n sort(1,n,b,a);\n for i:=1 to n-1 do a[i+1]:=a[i+1]+a[i];\n for i:=1 to n do if b[i]N then begin\n\t\t\tinc(u);\n\t\t\tv:=u+1;\n\t\tend;\n\tend;\nend.\n", "language": "Pascal", "metadata": {"date": 1561236255, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p02997.html", "problem_id": "p02997", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p02997/input.txt", "sample_output_relpath": "derived/input_output/data/p02997/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p02997/Pascal/s970569191.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s970569191", "user_id": "u657913472"}, "prompt_components": {"gold_output": "5\n4 3\n1 2\n3 1\n4 5\n2 3\n", "input_to_evaluate": "var\n\tN,K,i,u,v:Longint;\nbegin\n\tread(N,K);\n\tif (N-1)*(N-2)N then begin\n\t\t\tinc(u);\n\t\t\tv:=u+1;\n\t\tend;\n\tend;\nend.\n", "problem_context": "Score: 500 points\n\nProblem Statement\n\nDoes there exist an undirected graph with N vertices satisfying the following conditions?\n\nThe graph is simple and connected.\n\nThe vertices are numbered 1, 2, ..., N.\n\nLet M be the number of edges in the graph. The edges are numbered 1, 2, ..., M, the length of each edge is 1, and Edge i connects Vertex u_i and Vertex v_i.\n\nThere are exactly K pairs of vertices (i,\\ j)\\ (i < j) such that the shortest distance between them is 2.\n\nIf there exists such a graph, construct an example.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 100\n\n0 \\leq K \\leq \\frac{N(N - 1)}{2}\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\n\nOutput\n\nIf there does not exist an undirected graph with N vertices satisfying the conditions, print -1.\n\nIf there exists such a graph, print an example in the following format (refer to Problem Statement for what the symbols stand for):\n\nM\nu_1 v_1\n:\nu_M v_M\n\nIf there exist multiple graphs satisfying the conditions, any of them will be accepted.\n\nSample Input 1\n\n5 3\n\nSample Output 1\n\n5\n4 3\n1 2\n3 1\n4 5\n2 3\n\nThis graph has three pairs of vertices such that the shortest distance between them is 2: (1,\\ 4), (2,\\ 4), and (3,\\ 5). Thus, the condition is satisfied.\n\nSample Input 2\n\n5 8\n\nSample Output 2\n\n-1\n\nThere is no graph satisfying the conditions.", "sample_input": "5 3\n"}, "reference_outputs": ["5\n4 3\n1 2\n3 1\n4 5\n2 3\n"], "source_document_id": "p02997", "source_text": "Score: 500 points\n\nProblem Statement\n\nDoes there exist an undirected graph with N vertices satisfying the following conditions?\n\nThe graph is simple and connected.\n\nThe vertices are numbered 1, 2, ..., N.\n\nLet M be the number of edges in the graph. The edges are numbered 1, 2, ..., M, the length of each edge is 1, and Edge i connects Vertex u_i and Vertex v_i.\n\nThere are exactly K pairs of vertices (i,\\ j)\\ (i < j) such that the shortest distance between them is 2.\n\nIf there exists such a graph, construct an example.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 100\n\n0 \\leq K \\leq \\frac{N(N - 1)}{2}\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\n\nOutput\n\nIf there does not exist an undirected graph with N vertices satisfying the conditions, print -1.\n\nIf there exists such a graph, print an example in the following format (refer to Problem Statement for what the symbols stand for):\n\nM\nu_1 v_1\n:\nu_M v_M\n\nIf there exist multiple graphs satisfying the conditions, any of them will be accepted.\n\nSample Input 1\n\n5 3\n\nSample Output 1\n\n5\n4 3\n1 2\n3 1\n4 5\n2 3\n\nThis graph has three pairs of vertices such that the shortest distance between them is 2: (1,\\ 4), (2,\\ 4), and (3,\\ 5). Thus, the condition is satisfied.\n\nSample Input 2\n\n5 8\n\nSample Output 2\n\n-1\n\nThere is no graph satisfying the conditions.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 1, "memory_kb": 128}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s788639812", "group_id": "codeNet:p03001", "input_text": "uses math;\nvar\n w,h,x,y:int64;\n r1,r2,r3,r4, r5, r6, r7 : int64;\nBEGIN\n readln(w,h,x,y);\n r1 := x*h;\n r2 := (w-x)*h;\n r3 := y*w;\n r4 := (h-y)*w;\n r5 := min(r1,r2);\n r6 := min(r3,r4);\n r7 := max(r5,r6);\n write(r7, #32);\n if(r5=r6) then write(1) else write(0);\nEND.", "language": "Pascal", "metadata": {"date": 1560713042, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03001.html", "problem_id": "p03001", "resource_group": "low_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/Pascal/s788639812.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s788639812", "user_id": "u480821607"}, "prompt_components": {"gold_output": "3.000000 0\n", "input_to_evaluate": "uses math;\nvar\n w,h,x,y:int64;\n r1,r2,r3,r4, r5, r6, r7 : int64;\nBEGIN\n readln(w,h,x,y);\n r1 := x*h;\n r2 := (w-x)*h;\n r3 := y*w;\n r4 := (h-y)*w;\n r5 := min(r1,r2);\n r6 := min(r3,r4);\n r7 := max(r5,r6);\n write(r7, #32);\n if(r5=r6) then write(1) else write(0);\nEND.", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 128}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s217450628", "group_id": "codeNet:p03006", "input_text": "Var a,b,x,y:Array[1 .. 2500] of Longint;\n n,max,i,j,sum,count:Longint;\nBegin\n Readln(n); max:=0; count:=0;\n For i:=1 to n do readln(x[i],y[i]);\n For i:=1 to n-1 do\n For j:=i+1 to n do begin\n Inc(count);\n a[count]:=abs(x[i]-x[j]);\n b[count]:=abs(y[i]-y[j]);\n End;\n For i:=1 to count do\n If (a[i]<>2000000001) and (b[i]<>2000000001) then begin\n sum:=1;\n For j:=i+1 to count do\n If (a[i]=a[j]) and (b[i]=b[j]) then begin\n Inc(sum);\n a[j]:=2000000001; b[j]:=2000000001;\n End;\n If sum>max then max:=sum;\n End;\n Writeln(n-max);\nEnd.", "language": "Pascal", "metadata": {"date": 1560647898, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03006.html", "problem_id": "p03006", "resource_group": "low_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/Pascal/s217450628.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s217450628", "user_id": "u866155170"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "Var a,b,x,y:Array[1 .. 2500] of Longint;\n n,max,i,j,sum,count:Longint;\nBegin\n Readln(n); max:=0; count:=0;\n For i:=1 to n do readln(x[i],y[i]);\n For i:=1 to n-1 do\n For j:=i+1 to n do begin\n Inc(count);\n a[count]:=abs(x[i]-x[j]);\n b[count]:=abs(y[i]-y[j]);\n End;\n For i:=1 to count do\n If (a[i]<>2000000001) and (b[i]<>2000000001) then begin\n sum:=1;\n For j:=i+1 to count do\n If (a[i]=a[j]) and (b[i]=b[j]) then begin\n Inc(sum);\n a[j]:=2000000001; b[j]:=2000000001;\n End;\n If sum>max then max:=sum;\n End;\n Writeln(n-max);\nEnd.", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 706, "cpu_time_ms": 2, "memory_kb": 128}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s830169483", "group_id": "codeNet:p03007", "input_text": "Var a,b,c:Array[1 .. 100000] of Int64;\n n,rem1,rem2,min,max,rem,count:Int64;\n i:Longint;\nBegin\n Readln(n); min:=10000; max:=-10000; count:=0;\n For i:=1 to n do begin\n Read(a[i]);\n If a[i]max then begin\n max:=a[i]; rem2:=i;\n End;\n End;\n rem:=min;\n For i:=1 to n do \n If (i<>rem1) and (i<>rem2) then begin\n Inc(count);\n b[count]:=rem; c[count]:=a[i];\n rem:=rem-a[i];\n End;\n Writeln(max-rem);\n For i:=1 to count do writeln(b[count],' ',c[count]);\n Writeln(max,' ',rem);\nEnd.", "language": "Pascal", "metadata": {"date": 1560648860, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03007.html", "problem_id": "p03007", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03007/input.txt", "sample_output_relpath": "derived/input_output/data/p03007/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03007/Pascal/s830169483.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s830169483", "user_id": "u866155170"}, "prompt_components": {"gold_output": "4\n-1 1\n2 -2\n", "input_to_evaluate": "Var a,b,c:Array[1 .. 100000] of Int64;\n n,rem1,rem2,min,max,rem,count:Int64;\n i:Longint;\nBegin\n Readln(n); min:=10000; max:=-10000; count:=0;\n For i:=1 to n do begin\n Read(a[i]);\n If a[i]max then begin\n max:=a[i]; rem2:=i;\n End;\n End;\n rem:=min;\n For i:=1 to n do \n If (i<>rem1) and (i<>rem2) then begin\n Inc(count);\n b[count]:=rem; c[count]:=a[i];\n rem:=rem-a[i];\n End;\n Writeln(max-rem);\n For i:=1 to count do writeln(b[count],' ',c[count]);\n Writeln(max,' ',rem);\nEnd.", "problem_context": "Score : 500 points\n\nProblem Statement\n\nThere are N integers, A_1, A_2, ..., A_N, written on a blackboard.\n\nWe will repeat the following operation N-1 times so that we have only one integer on the blackboard.\n\nChoose two integers x and y on the blackboard and erase these two integers. Then, write a new integer x-y.\n\nFind the maximum possible value of the final integer on the blackboard and a sequence of operations that maximizes the final integer.\n\nConstraints\n\n2 \\leq N \\leq 10^5\n\n-10^4 \\leq A_i \\leq 10^4\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the maximum possible value M of the final integer on the blackboard, and a sequence of operations x_i, y_i that maximizes the final integer, in the format below.\n\nHere x_i and y_i represent the integers x and y chosen in the i-th operation, respectively.\n\nIf there are multiple sequences of operations that maximize the final integer, any of them will be accepted.\n\nM\nx_1 y_1\n:\nx_{N-1} y_{N-1}\n\nSample Input 1\n\n3\n1 -1 2\n\nSample Output 1\n\n4\n-1 1\n2 -2\n\nIf we choose x = -1 and y = 1 in the first operation, the set of integers written on the blackboard becomes (-2, 2).\n\nThen, if we choose x = 2 and y = -2 in the second operation, the set of integers written on the blackboard becomes (4).\n\nIn this case, we have 4 as the final integer. We cannot end with a greater integer, so the answer is 4.\n\nSample Input 2\n\n3\n1 1 1\n\nSample Output 2\n\n1\n1 1\n1 0", "sample_input": "3\n1 -1 2\n"}, "reference_outputs": ["4\n-1 1\n2 -2\n"], "source_document_id": "p03007", "source_text": "Score : 500 points\n\nProblem Statement\n\nThere are N integers, A_1, A_2, ..., A_N, written on a blackboard.\n\nWe will repeat the following operation N-1 times so that we have only one integer on the blackboard.\n\nChoose two integers x and y on the blackboard and erase these two integers. Then, write a new integer x-y.\n\nFind the maximum possible value of the final integer on the blackboard and a sequence of operations that maximizes the final integer.\n\nConstraints\n\n2 \\leq N \\leq 10^5\n\n-10^4 \\leq A_i \\leq 10^4\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the maximum possible value M of the final integer on the blackboard, and a sequence of operations x_i, y_i that maximizes the final integer, in the format below.\n\nHere x_i and y_i represent the integers x and y chosen in the i-th operation, respectively.\n\nIf there are multiple sequences of operations that maximize the final integer, any of them will be accepted.\n\nM\nx_1 y_1\n:\nx_{N-1} y_{N-1}\n\nSample Input 1\n\n3\n1 -1 2\n\nSample Output 1\n\n4\n-1 1\n2 -2\n\nIf we choose x = -1 and y = 1 in the first operation, the set of integers written on the blackboard becomes (-2, 2).\n\nThen, if we choose x = 2 and y = -2 in the second operation, the set of integers written on the blackboard becomes (4).\n\nIn this case, we have 4 as the final integer. We cannot end with a greater integer, so the answer is 4.\n\nSample Input 2\n\n3\n1 1 1\n\nSample Output 2\n\n1\n1 1\n1 0", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 48, "memory_kb": 4096}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s248955143", "group_id": "codeNet:p03012", "input_text": "Uses math;\nvar n, i, t : integer;\n w : array[1..100] of integer;\n s1, s2, ans : integer;\nbegin\n readln(n);\n for i := 1 to n do read(w[i]);\n ans := 10000;\n for t := 1 to n - 1 do begin\n s1 := 0; s2 := 0;\n for i := 1 to t do s1 := s1 + w[i];\n for i := t + 1 to n do s2 := s2 + w[i];\n ans := Min(ans, Abs(s1 - s2));\n end;\n writeln(ans);\nend.", "language": "Pascal", "metadata": {"date": 1560137572, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03012.html", "problem_id": "p03012", "resource_group": "low_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/Pascal/s248955143.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s248955143", "user_id": "u878615689"}, "prompt_components": {"gold_output": "0\n", "input_to_evaluate": "Uses math;\nvar n, i, t : integer;\n w : array[1..100] of integer;\n s1, s2, ans : integer;\nbegin\n readln(n);\n for i := 1 to n do read(w[i]);\n ans := 10000;\n for t := 1 to n - 1 do begin\n s1 := 0; s2 := 0;\n for i := 1 to t do s1 := s1 + w[i];\n for i := t + 1 to n do s2 := s2 + w[i];\n ans := Min(ans, Abs(s1 - s2));\n end;\n writeln(ans);\nend.", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s931343490", "group_id": "codeNet:p03013", "input_text": "var\nN,MM,i,j:Longint;\nm:int64=1000000007;\na:Array[1..100000]of Longint;\ndp:Array[0..100002]of int64;\nbegin\nread(N,MM);\nfor i:=1 to MM do read(a[i]);\ndp[0]:=1;\nfor i:=1 to N do begin\nwhile(j<=MM)and(a[j]= 2 then \n begin\n for i := 2 to M do\n begin\n read(a); \n n1:= n1*G[a-b-1] mod p;\n b:=a;\n end;\n end;\n \n n1:=n1*G[N-a] mod p;\n\nwrite(n1)\nend.", "language": "Pascal", "metadata": {"date": 1560539681, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03013.html", "problem_id": "p03013", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03013/input.txt", "sample_output_relpath": "derived/input_output/data/p03013/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03013/Pascal/s002152049.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s002152049", "user_id": "u655683235"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "var a,b,N,M,i,n1:int64; //a=a_i、b=a_(i-1)\n G:array[0..100000] of integer;\nconst p=1000000007;\nbegin \n read(N,M);\n\n G[0]:=0;G[1]:=1; //フィボナッチ数列を準備\n for i := 2 to N do\n G[i] :=( G[i-1] + G[i-2] ) mod p;\n \n n1:=1; read(a); \n n1:= n1*G[a] mod p; b:=a;\n \n if M >= 2 then \n begin\n for i := 2 to M do\n begin\n read(a); \n n1:= n1*G[a-b-1] mod p;\n b:=a;\n end;\n end;\n \n n1:=n1*G[N-a] mod p;\n\nwrite(n1)\nend.", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere is a staircase with N steps. Takahashi is now standing at the foot of the stairs, that is, on the 0-th step.\nHe can climb up one or two steps at a time.\n\nHowever, the treads of the a_1-th, a_2-th, a_3-th, \\ldots, a_M-th steps are broken, so it is dangerous to set foot on those steps.\n\nHow many are there to climb up to the top step, that is, the N-th step, without setting foot on the broken steps?\nFind the count modulo 1\\ 000\\ 000\\ 007.\n\nConstraints\n\n1 \\leq N \\leq 10^5\n\n0 \\leq M \\leq N-1\n\n1 \\leq a_1 < a_2 < ... < a_M \\leq N-1\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\na_1\na_2\n.\n.\n.\na_M\n\nOutput\n\nPrint the number of ways to climb up the stairs under the condition, modulo 1\\ 000\\ 000\\ 007.\n\nSample Input 1\n\n6 1\n3\n\nSample Output 1\n\n4\n\nThere are four ways to climb up the stairs, as follows:\n\n0 \\to 1 \\to 2 \\to 4 \\to 5 \\to 6\n\n0 \\to 1 \\to 2 \\to 4 \\to 6\n\n0 \\to 2 \\to 4 \\to 5 \\to 6\n\n0 \\to 2 \\to 4 \\to 6\n\nSample Input 2\n\n10 2\n4\n5\n\nSample Output 2\n\n0\n\nThere may be no way to climb up the stairs without setting foot on the broken steps.\n\nSample Input 3\n\n100 5\n1\n23\n45\n67\n89\n\nSample Output 3\n\n608200469\n\nBe sure to print the count modulo 1\\ 000\\ 000\\ 007.", "sample_input": "6 1\n3\n"}, "reference_outputs": ["4\n"], "source_document_id": "p03013", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere is a staircase with N steps. Takahashi is now standing at the foot of the stairs, that is, on the 0-th step.\nHe can climb up one or two steps at a time.\n\nHowever, the treads of the a_1-th, a_2-th, a_3-th, \\ldots, a_M-th steps are broken, so it is dangerous to set foot on those steps.\n\nHow many are there to climb up to the top step, that is, the N-th step, without setting foot on the broken steps?\nFind the count modulo 1\\ 000\\ 000\\ 007.\n\nConstraints\n\n1 \\leq N \\leq 10^5\n\n0 \\leq M \\leq N-1\n\n1 \\leq a_1 < a_2 < ... < a_M \\leq N-1\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\na_1\na_2\n.\n.\n.\na_M\n\nOutput\n\nPrint the number of ways to climb up the stairs under the condition, modulo 1\\ 000\\ 000\\ 007.\n\nSample Input 1\n\n6 1\n3\n\nSample Output 1\n\n4\n\nThere are four ways to climb up the stairs, as follows:\n\n0 \\to 1 \\to 2 \\to 4 \\to 5 \\to 6\n\n0 \\to 1 \\to 2 \\to 4 \\to 6\n\n0 \\to 2 \\to 4 \\to 5 \\to 6\n\n0 \\to 2 \\to 4 \\to 6\n\nSample Input 2\n\n10 2\n4\n5\n\nSample Output 2\n\n0\n\nThere may be no way to climb up the stairs without setting foot on the broken steps.\n\nSample Input 3\n\n100 5\n1\n23\n45\n67\n89\n\nSample Output 3\n\n608200469\n\nBe sure to print the count modulo 1\\ 000\\ 000\\ 007.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 450, "cpu_time_ms": 14, "memory_kb": 512}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s815388476", "group_id": "codeNet:p03014", "input_text": "var s :array[1..2010]of array[1..2010]of char;\n u,d,l,r,t :array[1..2010]of array[1..2010]of integer;\n i,j,k,n,h,w,ans :integer;\n \nbegin\n readln(h,w);\n for i:=1 to h do begin\n for j:=1 to w do \n read(s[i][j]);\n readln;\n end;\n {up}\n for j:=1 to w do begin\n if s[1][j]='.' then u[1][j]:=1 else u[1][j]:=0;\n for i:=2 to h do begin\n if s[i][j]='.' then u[i][j]:=u[i-1][j]+1 else u[i][j]:=0;\n end;\n end;\n {down}\n for j:=1 to w do begin\n if s[h][j]='.' then d[h][j]:=1 else d[h][j]:=0;\n for i:=h-1 downto 1 do begin\n if s[i][j]='.' then d[i][j]:=d[i+1][j]+1 else d[i][j]:=0;\n end;\n end;\n {left}\n for i:=1 to h do begin\n if s[i][1]='.' then l[i][1]:=1 else l[i][1]:=0;\n for j:=2 to w do begin\n if s[i][j]='.' then l[i][j]:=l[i][j-1]+1 else l[i][j]:=0;\n end;\n end;\n {right}\n for i:=1 to h do begin\n if s[i][w]='.' then r[i][w]:=1 else r[i][w]:=0;\n for j:=w-1 downto 1 do begin\n if s[i][j]='.' then r[i][j]:=r[i][j+1]+1 else r[i][j]:=0;\n end;\n end;\n \n ans:=0;\n for i:=1 to h do\n for j:=1 to w do begin\n if ans<(u[i][j]+d[i][j]+l[i][j]+r[i][j]-3)\n then ans:=u[i][j]+d[i][j]+l[i][j]+r[i][j]-3;\n end;\n writeln(ans);\nend.", "language": "Pascal", "metadata": {"date": 1561541680, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03014.html", "problem_id": "p03014", "resource_group": "low_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/Pascal/s815388476.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s815388476", "user_id": "u805277811"}, "prompt_components": {"gold_output": "8\n", "input_to_evaluate": "var s :array[1..2010]of array[1..2010]of char;\n u,d,l,r,t :array[1..2010]of array[1..2010]of integer;\n i,j,k,n,h,w,ans :integer;\n \nbegin\n readln(h,w);\n for i:=1 to h do begin\n for j:=1 to w do \n read(s[i][j]);\n readln;\n end;\n {up}\n for j:=1 to w do begin\n if s[1][j]='.' then u[1][j]:=1 else u[1][j]:=0;\n for i:=2 to h do begin\n if s[i][j]='.' then u[i][j]:=u[i-1][j]+1 else u[i][j]:=0;\n end;\n end;\n {down}\n for j:=1 to w do begin\n if s[h][j]='.' then d[h][j]:=1 else d[h][j]:=0;\n for i:=h-1 downto 1 do begin\n if s[i][j]='.' then d[i][j]:=d[i+1][j]+1 else d[i][j]:=0;\n end;\n end;\n {left}\n for i:=1 to h do begin\n if s[i][1]='.' then l[i][1]:=1 else l[i][1]:=0;\n for j:=2 to w do begin\n if s[i][j]='.' then l[i][j]:=l[i][j-1]+1 else l[i][j]:=0;\n end;\n end;\n {right}\n for i:=1 to h do begin\n if s[i][w]='.' then r[i][w]:=1 else r[i][w]:=0;\n for j:=w-1 downto 1 do begin\n if s[i][j]='.' then r[i][j]:=r[i][j+1]+1 else r[i][j]:=0;\n end;\n end;\n \n ans:=0;\n for i:=1 to h do\n for j:=1 to w do begin\n if ans<(u[i][j]+d[i][j]+l[i][j]+r[i][j]-3)\n then ans:=u[i][j]+d[i][j]+l[i][j]+r[i][j]-3;\n end;\n writeln(ans);\nend.", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1226, "cpu_time_ms": 214, "memory_kb": 67584}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s177456179", "group_id": "codeNet:p03014", "input_text": "Uses math;\nvar h, w, i, j, k, cnt, start, ans : int64;\n s : array[1..2001] of array[1..2001] of char;\n tate, yoko : array[1..2001] of array[1..2001] of int64;\n temp : char;\nbegin\n readln(h, w);\n for i := 1 to h do begin\n for j := 1 to w do read(s[i][j]);\n read(temp);\n s[i][w+1] := '#';\n end;\n for i := 1 to w+1 do s[h+1][i] := '#';\n \n for i := 1 to h do begin\n for j := 1 to w do begin\n tate[i][j] := 0; yoko[i][j] := 0;\n end;\n end;\n \n for i := 1 to h do begin\n cnt := 0;\n start := 1;\n \n for j := 1 to w+1 do begin\n if s[i][j] = '.' then inc(cnt) else begin\n for k := start to j-1 do yoko[i][k] := cnt;\n start := j+1;\n cnt := 0;\n end;\n end;\n end;\n \n for j := 1 to w do begin\n cnt := 0;\n start := 1;\n \n for i := 1 to h+1 do begin\n if s[i][j] = '.' then inc(cnt) else begin\n for k := start to i-1 do tate[k][j] := cnt;\n start := i+1;\n cnt := 0;\n end;\n end;\n end;\n \n ans := 0;\n for i := 1 to h do begin\n for j := 1 to w do begin\n if s[i][j] = '#' then Continue;\n ans := Max(ans, tate[i][j] + yoko[i][j] - 1);\n end;\n end;\n writeln(ans);\nend.\n", "language": "Pascal", "metadata": {"date": 1560140960, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03014.html", "problem_id": "p03014", "resource_group": "low_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/Pascal/s177456179.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s177456179", "user_id": "u878615689"}, "prompt_components": {"gold_output": "8\n", "input_to_evaluate": "Uses math;\nvar h, w, i, j, k, cnt, start, ans : int64;\n s : array[1..2001] of array[1..2001] of char;\n tate, yoko : array[1..2001] of array[1..2001] of int64;\n temp : char;\nbegin\n readln(h, w);\n for i := 1 to h do begin\n for j := 1 to w do read(s[i][j]);\n read(temp);\n s[i][w+1] := '#';\n end;\n for i := 1 to w+1 do s[h+1][i] := '#';\n \n for i := 1 to h do begin\n for j := 1 to w do begin\n tate[i][j] := 0; yoko[i][j] := 0;\n end;\n end;\n \n for i := 1 to h do begin\n cnt := 0;\n start := 1;\n \n for j := 1 to w+1 do begin\n if s[i][j] = '.' then inc(cnt) else begin\n for k := start to j-1 do yoko[i][k] := cnt;\n start := j+1;\n cnt := 0;\n end;\n end;\n end;\n \n for j := 1 to w do begin\n cnt := 0;\n start := 1;\n \n for i := 1 to h+1 do begin\n if s[i][j] = '.' then inc(cnt) else begin\n for k := start to i-1 do tate[k][j] := cnt;\n start := i+1;\n cnt := 0;\n end;\n end;\n end;\n \n ans := 0;\n for i := 1 to h do begin\n for j := 1 to w do begin\n if s[i][j] = '#' then Continue;\n ans := Max(ans, tate[i][j] + yoko[i][j] - 1);\n end;\n end;\n writeln(ans);\nend.\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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 221, "memory_kb": 66688}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s461004799", "group_id": "codeNet:p03017", "input_text": "Uses math;\nvar p:char;\n A,B,C,D,N,i,x,y:integer;\n S:array[0..200010] of integer;\nbegin\nread(N,A,B,C,D);\n\nfor i := 1 to N do \n begin \n read(p); if ord(p) < 40 then S[i]:=1 else S[i]:=0; \n end;\n\nx:=1;\nfor i := 1 to N-1 do \n begin \n if (S[i]=1) and (S[i+1]=1) then x:=0;\n end;\n \nif x=0 then write('No')\n else\n begin\n if C > D then \n begin\n x:=0;\n for i := B to N-2 do\n begin \n if (S[i]=0) and (S[i+1]=0) and (S[i+2]=0) then x:=1;\n end;\n end;\n if C < D then x:=1;\n \n if x=0 then write('No') else write('Yse');\n end;\nend.", "language": "Pascal", "metadata": {"date": 1560883193, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03017.html", "problem_id": "p03017", "resource_group": "low_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/Pascal/s461004799.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s461004799", "user_id": "u655683235"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "Uses math;\nvar p:char;\n A,B,C,D,N,i,x,y:integer;\n S:array[0..200010] of integer;\nbegin\nread(N,A,B,C,D);\n\nfor i := 1 to N do \n begin \n read(p); if ord(p) < 40 then S[i]:=1 else S[i]:=0; \n end;\n\nx:=1;\nfor i := 1 to N-1 do \n begin \n if (S[i]=1) and (S[i+1]=1) then x:=0;\n end;\n \nif x=0 then write('No')\n else\n begin\n if C > D then \n begin\n x:=0;\n for i := B to N-2 do\n begin \n if (S[i]=0) and (S[i+1]=0) and (S[i+2]=0) then x:=1;\n end;\n end;\n if C < D then x:=1;\n \n if x=0 then write('No') else write('Yse');\n end;\nend.", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 566, "cpu_time_ms": 6, "memory_kb": 896}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s317164799", "group_id": "codeNet:p03030", "input_text": "var\n\tN,i,j,tmp:Longint;\n\tS:array[1..100]of String[10];\n\tP,id:array[1..100]of Longint;\n\tt:String;\nbegin\n\treadln(N);\n\tfor i:=1 to N do begin\n\t\tid[i]:=i;\n\t\treadln(t);\n\t\tj:=1;\n\t\twhile t[j]<>' ' do begin\n\t\t\tS[i]:=S[i]+t[j];\n\t\t\tinc(j);\n\t\tend;\n\t\tinc(j);\n\t\tfor j:=j to length(t)do begin\n\t\t\tP[i]:=P[i]*10+ord(t[j])-48;\n\t\tend;\n\t\tfor j:=i-1 downto 1 do begin\n\t\t\tif(S[id[j]]>S[id[j+1]])or((S[id[j]]=S[id[j+1]])and(P[id[j]]' ' do begin\n\t\t\tS[i]:=S[i]+t[j];\n\t\t\tinc(j);\n\t\tend;\n\t\tinc(j);\n\t\tfor j:=j to length(t)do begin\n\t\t\tP[i]:=P[i]*10+ord(t[j])-48;\n\t\tend;\n\t\tfor j:=i-1 downto 1 do begin\n\t\t\tif(S[id[j]]>S[id[j+1]])or((S[id[j]]=S[id[j+1]])and(P[id[j]]>(k-1))mod 2=1)and A[j,k]then inc(now);\n\t\t\tend;\n\t\t\tif now mod 2<>P[j]mod 2 then begin\n\t\t\t\tflag:=False;\n\t\t\t\tbreak;\n\t\t\tend;\n\t\tend;\n\t\tif flag then inc(cnt);\n\tend;\n\twriteln(cnt);\nend.", "language": "Pascal", "metadata": {"date": 1558941410, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03031.html", "problem_id": "p03031", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03031/input.txt", "sample_output_relpath": "derived/input_output/data/p03031/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03031/Pascal/s807118689.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s807118689", "user_id": "u657913472"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "var\n\tnow,cnt,N,M,i,j,k,s:Longint;\n\tA:array[1..10,1..10]of Boolean;\n\tP:array[1..10]of Longint;\n\tflag:Boolean;\nbegin\n\tread(N,M);\n\tfor i:=1 to M do begin\n\t\tread(k);\n\t\tfor j:=1 to k do begin\n\t\t\tread(s);\n\t\t\tA[i,s]:=True;\n\t\tend;\n\tend;\n\tfor i:=1 to M do begin\n\t\tread(P[i]);\n\tend;\n\tfor i:=0 to (1<>(k-1))mod 2=1)and A[j,k]then inc(now);\n\t\t\tend;\n\t\t\tif now mod 2<>P[j]mod 2 then begin\n\t\t\t\tflag:=False;\n\t\t\t\tbreak;\n\t\t\tend;\n\t\tend;\n\t\tif flag then inc(cnt);\n\tend;\n\twriteln(cnt);\nend.", "problem_context": "Score : 300 points\n\nProblem Statement\n\nWe have N switches with \"on\" and \"off\" state, and M bulbs. The switches are numbered 1 to N, and the bulbs are numbered 1 to M.\n\nBulb i is connected to k_i switches: Switch s_{i1}, s_{i2}, ..., and s_{ik_i}. It is lighted when the number of switches that are \"on\" among these switches is congruent to p_i modulo 2.\n\nHow many combinations of \"on\" and \"off\" states of the switches light all the bulbs?\n\nConstraints\n\n1 \\leq N, M \\leq 10\n\n1 \\leq k_i \\leq N\n\n1 \\leq s_{ij} \\leq N\n\ns_{ia} \\neq s_{ib} (a \\neq b)\n\np_i is 0 or 1.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nk_1 s_{11} s_{12} ... s_{1k_1}\n:\nk_M s_{M1} s_{M2} ... s_{Mk_M}\np_1 p_2 ... p_M\n\nOutput\n\nPrint the number of combinations of \"on\" and \"off\" states of the switches that light all the bulbs.\n\nSample Input 1\n\n2 2\n2 1 2\n1 2\n0 1\n\nSample Output 1\n\n1\n\nBulb 1 is lighted when there is an even number of switches that are \"on\" among the following: Switch 1 and 2.\n\nBulb 2 is lighted when there is an odd number of switches that are \"on\" among the following: Switch 2.\n\nThere are four possible combinations of states of (Switch 1, Switch 2): (on, on), (on, off), (off, on) and (off, off). Among them, only (on, on) lights all the bulbs, so we should print 1.\n\nSample Input 2\n\n2 3\n2 1 2\n1 1\n1 2\n0 0 1\n\nSample Output 2\n\n0\n\nBulb 1 is lighted when there is an even number of switches that are \"on\" among the following: Switch 1 and 2.\n\nBulb 2 is lighted when there is an even number of switches that are \"on\" among the following: Switch 1.\n\nBulb 3 is lighted when there is an odd number of switches that are \"on\" among the following: Switch 2.\n\nSwitch 1 has to be \"off\" to light Bulb 2 and Switch 2 has to be \"on\" to light Bulb 3, but then Bulb 1 will not be lighted. Thus, there are no combinations of states of the switches that light all the bulbs, so we should print 0.\n\nSample Input 3\n\n5 2\n3 1 2 5\n2 2 3\n1 0\n\nSample Output 3\n\n8", "sample_input": "2 2\n2 1 2\n1 2\n0 1\n"}, "reference_outputs": ["1\n"], "source_document_id": "p03031", "source_text": "Score : 300 points\n\nProblem Statement\n\nWe have N switches with \"on\" and \"off\" state, and M bulbs. The switches are numbered 1 to N, and the bulbs are numbered 1 to M.\n\nBulb i is connected to k_i switches: Switch s_{i1}, s_{i2}, ..., and s_{ik_i}. It is lighted when the number of switches that are \"on\" among these switches is congruent to p_i modulo 2.\n\nHow many combinations of \"on\" and \"off\" states of the switches light all the bulbs?\n\nConstraints\n\n1 \\leq N, M \\leq 10\n\n1 \\leq k_i \\leq N\n\n1 \\leq s_{ij} \\leq N\n\ns_{ia} \\neq s_{ib} (a \\neq b)\n\np_i is 0 or 1.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nk_1 s_{11} s_{12} ... s_{1k_1}\n:\nk_M s_{M1} s_{M2} ... s_{Mk_M}\np_1 p_2 ... p_M\n\nOutput\n\nPrint the number of combinations of \"on\" and \"off\" states of the switches that light all the bulbs.\n\nSample Input 1\n\n2 2\n2 1 2\n1 2\n0 1\n\nSample Output 1\n\n1\n\nBulb 1 is lighted when there is an even number of switches that are \"on\" among the following: Switch 1 and 2.\n\nBulb 2 is lighted when there is an odd number of switches that are \"on\" among the following: Switch 2.\n\nThere are four possible combinations of states of (Switch 1, Switch 2): (on, on), (on, off), (off, on) and (off, off). Among them, only (on, on) lights all the bulbs, so we should print 1.\n\nSample Input 2\n\n2 3\n2 1 2\n1 1\n1 2\n0 0 1\n\nSample Output 2\n\n0\n\nBulb 1 is lighted when there is an even number of switches that are \"on\" among the following: Switch 1 and 2.\n\nBulb 2 is lighted when there is an even number of switches that are \"on\" among the following: Switch 1.\n\nBulb 3 is lighted when there is an odd number of switches that are \"on\" among the following: Switch 2.\n\nSwitch 1 has to be \"off\" to light Bulb 2 and Switch 2 has to be \"on\" to light Bulb 3, but then Bulb 1 will not be lighted. Thus, there are no combinations of states of the switches that light all the bulbs, so we should print 0.\n\nSample Input 3\n\n5 2\n3 1 2 5\n2 2 3\n1 0\n\nSample Output 3\n\n8", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 1, "memory_kb": 128}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s013746243", "group_id": "codeNet:p03031", "input_text": "var\n\tr1,r2,ans,id,N,M,i,j,k,s:Longint;\n\tA:array[1..10,1..10]of Boolean;\n\tB:array[1..10,1..11]of Boolean;\n\ttmp:Boolean;\nbegin\n\tread(N,M);\n\tfor i:=1 to M do begin\n\t\tread(k);\n\t\tfor j:=1 to k do begin\n\t\t\tread(s);\n\t\t\tA[i,s]:=True;\n\t\t\tB[i,s]:=True;\n\t\tend;\n\tend;\n\tfor i:=1 to M do begin\n\t\tread(s);\n\t\tif s=1 then B[i,N+1]:=True;\n\tend;\n\tfor i:=1 to M do begin\n\t\tif i>N then break;\n\t\tid:=i;\n\t\twhile(id<=M)and(not A[i,id])do inc(id);\n\t\tif id>N then continue;\n\t\tfor j:=i to N do begin\n\t\t\ttmp:=A[id,j];\n\t\t\tA[id,j]:=A[i,j];\n\t\t\tA[i,j]:=tmp;\n\t\tend;\n\t\tfor j:=i+1 to M do begin\n\t\t\tif A[j,i]then begin\n\t\t\t\tfor k:=i to N do begin\n\t\t\t\t\tA[j,k]:=A[j,k]xor A[i,k];\n\t\t\t\tend;\n\t\t\tend;\n\t\tend;\n\tend;\n\tr1:=0;\n\twhile True do begin\n\t\ttmp:=False;\n\t\tfor i:=1 to N do if A[r1+1,i]then begin\n\t\t\tinc(r1);\n\t\t\ttmp:=True;\n\t\t\tbreak;\n\t\tend;\n\t\tif(not tmp)or(r1=M)then break;\n\tend;\n\tfor i:=1 to M do begin\n\t\tif i>N+1 then break;\n\t\tid:=i;\n\t\twhile(id<=M)and(not B[i,id])do inc(id);\n\t\tif id>N+1 then continue;\n\t\tfor j:=i to N+1 do begin\n\t\t\ttmp:=B[id,j];\n\t\t\tB[id,j]:=B[i,j];\n\t\t\tB[i,j]:=tmp;\n\t\tend;\n\t\tfor j:=i+1 to M do begin\n\t\t\tif B[j,i]then begin\n\t\t\t\tfor k:=i to N+1 do begin\n\t\t\t\t\tB[j,k]:=B[j,k]xor B[i,k];\n\t\t\t\tend;\n\t\t\tend;\n\t\tend;\n\tend;\n\tr2:=0;\n\twhile True do begin\n\t\ttmp:=False;\n\t\tfor i:=1 to N+1 do if B[r2+1,i]then begin\n\t\t\tinc(r2);\n\t\t\ttmp:=True;\n\t\t\tbreak;\n\t\tend;\n\t\tif(not tmp)or(r2=M)then break;\n\tend;\n\tans:=1;\n\tif r1<>r2 then ans:=0;\n\tfor i:=1 to N-r1 do ans:=ans*2;\n\twriteln(ans);\nend.\n", "language": "Pascal", "metadata": {"date": 1558938873, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03031.html", "problem_id": "p03031", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03031/input.txt", "sample_output_relpath": "derived/input_output/data/p03031/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03031/Pascal/s013746243.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s013746243", "user_id": "u657913472"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "var\n\tr1,r2,ans,id,N,M,i,j,k,s:Longint;\n\tA:array[1..10,1..10]of Boolean;\n\tB:array[1..10,1..11]of Boolean;\n\ttmp:Boolean;\nbegin\n\tread(N,M);\n\tfor i:=1 to M do begin\n\t\tread(k);\n\t\tfor j:=1 to k do begin\n\t\t\tread(s);\n\t\t\tA[i,s]:=True;\n\t\t\tB[i,s]:=True;\n\t\tend;\n\tend;\n\tfor i:=1 to M do begin\n\t\tread(s);\n\t\tif s=1 then B[i,N+1]:=True;\n\tend;\n\tfor i:=1 to M do begin\n\t\tif i>N then break;\n\t\tid:=i;\n\t\twhile(id<=M)and(not A[i,id])do inc(id);\n\t\tif id>N then continue;\n\t\tfor j:=i to N do begin\n\t\t\ttmp:=A[id,j];\n\t\t\tA[id,j]:=A[i,j];\n\t\t\tA[i,j]:=tmp;\n\t\tend;\n\t\tfor j:=i+1 to M do begin\n\t\t\tif A[j,i]then begin\n\t\t\t\tfor k:=i to N do begin\n\t\t\t\t\tA[j,k]:=A[j,k]xor A[i,k];\n\t\t\t\tend;\n\t\t\tend;\n\t\tend;\n\tend;\n\tr1:=0;\n\twhile True do begin\n\t\ttmp:=False;\n\t\tfor i:=1 to N do if A[r1+1,i]then begin\n\t\t\tinc(r1);\n\t\t\ttmp:=True;\n\t\t\tbreak;\n\t\tend;\n\t\tif(not tmp)or(r1=M)then break;\n\tend;\n\tfor i:=1 to M do begin\n\t\tif i>N+1 then break;\n\t\tid:=i;\n\t\twhile(id<=M)and(not B[i,id])do inc(id);\n\t\tif id>N+1 then continue;\n\t\tfor j:=i to N+1 do begin\n\t\t\ttmp:=B[id,j];\n\t\t\tB[id,j]:=B[i,j];\n\t\t\tB[i,j]:=tmp;\n\t\tend;\n\t\tfor j:=i+1 to M do begin\n\t\t\tif B[j,i]then begin\n\t\t\t\tfor k:=i to N+1 do begin\n\t\t\t\t\tB[j,k]:=B[j,k]xor B[i,k];\n\t\t\t\tend;\n\t\t\tend;\n\t\tend;\n\tend;\n\tr2:=0;\n\twhile True do begin\n\t\ttmp:=False;\n\t\tfor i:=1 to N+1 do if B[r2+1,i]then begin\n\t\t\tinc(r2);\n\t\t\ttmp:=True;\n\t\t\tbreak;\n\t\tend;\n\t\tif(not tmp)or(r2=M)then break;\n\tend;\n\tans:=1;\n\tif r1<>r2 then ans:=0;\n\tfor i:=1 to N-r1 do ans:=ans*2;\n\twriteln(ans);\nend.\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nWe have N switches with \"on\" and \"off\" state, and M bulbs. The switches are numbered 1 to N, and the bulbs are numbered 1 to M.\n\nBulb i is connected to k_i switches: Switch s_{i1}, s_{i2}, ..., and s_{ik_i}. It is lighted when the number of switches that are \"on\" among these switches is congruent to p_i modulo 2.\n\nHow many combinations of \"on\" and \"off\" states of the switches light all the bulbs?\n\nConstraints\n\n1 \\leq N, M \\leq 10\n\n1 \\leq k_i \\leq N\n\n1 \\leq s_{ij} \\leq N\n\ns_{ia} \\neq s_{ib} (a \\neq b)\n\np_i is 0 or 1.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nk_1 s_{11} s_{12} ... s_{1k_1}\n:\nk_M s_{M1} s_{M2} ... s_{Mk_M}\np_1 p_2 ... p_M\n\nOutput\n\nPrint the number of combinations of \"on\" and \"off\" states of the switches that light all the bulbs.\n\nSample Input 1\n\n2 2\n2 1 2\n1 2\n0 1\n\nSample Output 1\n\n1\n\nBulb 1 is lighted when there is an even number of switches that are \"on\" among the following: Switch 1 and 2.\n\nBulb 2 is lighted when there is an odd number of switches that are \"on\" among the following: Switch 2.\n\nThere are four possible combinations of states of (Switch 1, Switch 2): (on, on), (on, off), (off, on) and (off, off). Among them, only (on, on) lights all the bulbs, so we should print 1.\n\nSample Input 2\n\n2 3\n2 1 2\n1 1\n1 2\n0 0 1\n\nSample Output 2\n\n0\n\nBulb 1 is lighted when there is an even number of switches that are \"on\" among the following: Switch 1 and 2.\n\nBulb 2 is lighted when there is an even number of switches that are \"on\" among the following: Switch 1.\n\nBulb 3 is lighted when there is an odd number of switches that are \"on\" among the following: Switch 2.\n\nSwitch 1 has to be \"off\" to light Bulb 2 and Switch 2 has to be \"on\" to light Bulb 3, but then Bulb 1 will not be lighted. Thus, there are no combinations of states of the switches that light all the bulbs, so we should print 0.\n\nSample Input 3\n\n5 2\n3 1 2 5\n2 2 3\n1 0\n\nSample Output 3\n\n8", "sample_input": "2 2\n2 1 2\n1 2\n0 1\n"}, "reference_outputs": ["1\n"], "source_document_id": "p03031", "source_text": "Score : 300 points\n\nProblem Statement\n\nWe have N switches with \"on\" and \"off\" state, and M bulbs. The switches are numbered 1 to N, and the bulbs are numbered 1 to M.\n\nBulb i is connected to k_i switches: Switch s_{i1}, s_{i2}, ..., and s_{ik_i}. It is lighted when the number of switches that are \"on\" among these switches is congruent to p_i modulo 2.\n\nHow many combinations of \"on\" and \"off\" states of the switches light all the bulbs?\n\nConstraints\n\n1 \\leq N, M \\leq 10\n\n1 \\leq k_i \\leq N\n\n1 \\leq s_{ij} \\leq N\n\ns_{ia} \\neq s_{ib} (a \\neq b)\n\np_i is 0 or 1.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nk_1 s_{11} s_{12} ... s_{1k_1}\n:\nk_M s_{M1} s_{M2} ... s_{Mk_M}\np_1 p_2 ... p_M\n\nOutput\n\nPrint the number of combinations of \"on\" and \"off\" states of the switches that light all the bulbs.\n\nSample Input 1\n\n2 2\n2 1 2\n1 2\n0 1\n\nSample Output 1\n\n1\n\nBulb 1 is lighted when there is an even number of switches that are \"on\" among the following: Switch 1 and 2.\n\nBulb 2 is lighted when there is an odd number of switches that are \"on\" among the following: Switch 2.\n\nThere are four possible combinations of states of (Switch 1, Switch 2): (on, on), (on, off), (off, on) and (off, off). Among them, only (on, on) lights all the bulbs, so we should print 1.\n\nSample Input 2\n\n2 3\n2 1 2\n1 1\n1 2\n0 0 1\n\nSample Output 2\n\n0\n\nBulb 1 is lighted when there is an even number of switches that are \"on\" among the following: Switch 1 and 2.\n\nBulb 2 is lighted when there is an even number of switches that are \"on\" among the following: Switch 1.\n\nBulb 3 is lighted when there is an odd number of switches that are \"on\" among the following: Switch 2.\n\nSwitch 1 has to be \"off\" to light Bulb 2 and Switch 2 has to be \"on\" to light Bulb 3, but then Bulb 1 will not be lighted. Thus, there are no combinations of states of the switches that light all the bulbs, so we should print 0.\n\nSample Input 3\n\n5 2\n3 1 2 5\n2 2 3\n1 0\n\nSample Output 3\n\n8", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1445, "cpu_time_ms": 130, "memory_kb": 128}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s175616089", "group_id": "codeNet:p03032", "input_text": "var\n\tN,K,i,L,R,Lsum,Rsum,now,ans,tmp,lim:Longint;\n\tV:array[1..50]of Longint;\n\tLsorted:array[1..50]of Longint;\n\tLRsorted:array[1..50]of Longint;\nbegin\n\tread(N,K);\n\tfor i:=1 to N do read(V[i]);\n\tfor L:=0 to N do begin\n\t\tfor i:=1 to N do LRsorted[i]:=0;\n\t\tif L>0 then begin\n\t\t\tLsorted[L]:=V[L];\n\t\t\tinc(Lsum,V[L]);\n\t\t\tfor i:=L-1 downto 1 do begin\n\t\t\t\tif Lsorted[i]>Lsorted[i+1]then begin\n\t\t\t\t\ttmp:=Lsorted[i];\n\t\t\t\t\tLsorted[i]:=Lsorted[i+1];\n\t\t\t\t\tLsorted[i+1]:=tmp;\n\t\t\t\tend else break;\n\t\t\tend;\n\t\tend;\n\t\tfor i:=1 to L do LRsorted[i]:=Lsorted[i];\n\t\tRsum:=Lsum;\n\t\tfor R:=N+1 downto L+1 do begin\n\t\t\tlim:=K-L-(N-R+1);\n\t\t\tif lim<0 then break;\n\t\t\tif R<=N then begin\n\t\t\t\tLRsorted[L+(N-R)+1]:=V[R];\n\t\t\t\tinc(Rsum,V[R]);\n\t\t\t\tfor i:=L+(N-R)downto 1 do begin\n\t\t\t\t\tif LRsorted[i]>LRsorted[i+1]then begin\n\t\t\t\t\t\ttmp:=LRsorted[i];\n\t\t\t\t\t\tLRsorted[i]:=LRsorted[i+1];\n\t\t\t\t\t\tLRsorted[i+1]:=tmp;\n\t\t\t\t\tend else break;\n\t\t\t\tend;\n\t\t\tend;\n\t\t\tnow:=Rsum;\n\t\t\tfor i:=1 to lim do begin\n\t\t\t\tif LRsorted[i]<0 then dec(now,LRsorted[i])\n\t\t\t\telse break;\n\t\t\tend;\n\t\t\tif ans0 then begin\n\t\t\tLsorted[L]:=V[L];\n\t\t\tinc(Lsum,V[L]);\n\t\t\tfor i:=L-1 downto 1 do begin\n\t\t\t\tif Lsorted[i]>Lsorted[i+1]then begin\n\t\t\t\t\ttmp:=Lsorted[i];\n\t\t\t\t\tLsorted[i]:=Lsorted[i+1];\n\t\t\t\t\tLsorted[i+1]:=tmp;\n\t\t\t\tend else break;\n\t\t\tend;\n\t\tend;\n\t\tfor i:=1 to L do LRsorted[i]:=Lsorted[i];\n\t\tRsum:=Lsum;\n\t\tfor R:=N+1 downto L+1 do begin\n\t\t\tlim:=K-L-(N-R+1);\n\t\t\tif lim<0 then break;\n\t\t\tif R<=N then begin\n\t\t\t\tLRsorted[L+(N-R)+1]:=V[R];\n\t\t\t\tinc(Rsum,V[R]);\n\t\t\t\tfor i:=L+(N-R)downto 1 do begin\n\t\t\t\t\tif LRsorted[i]>LRsorted[i+1]then begin\n\t\t\t\t\t\ttmp:=LRsorted[i];\n\t\t\t\t\t\tLRsorted[i]:=LRsorted[i+1];\n\t\t\t\t\t\tLRsorted[i+1]:=tmp;\n\t\t\t\t\tend else break;\n\t\t\t\tend;\n\t\t\tend;\n\t\t\tnow:=Rsum;\n\t\t\tfor i:=1 to lim do begin\n\t\t\t\tif LRsorted[i]<0 then dec(now,LRsorted[i])\n\t\t\t\telse break;\n\t\t\tend;\n\t\t\tif ans= x then write(y-x+1);\nend.\n", "language": "Pascal", "metadata": {"date": 1559919205, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03037.html", "problem_id": "p03037", "resource_group": "low_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/Pascal/s174273867.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s174273867", "user_id": "u655683235"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "var N,M,x,y,z,w,i:integer;\nbegin\n read(N,M);\n x:=0;y:=100000;\nfor i := 1 to M do\nbegin\n read(z,w);\n if x <= z then x:= z;\n if w <= y then y:= w;\n end;\n if y >= x then write(y-x+1);\nend.\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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 21, "memory_kb": 128}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s462358421", "group_id": "codeNet:p03037", "input_text": "const C=1000000; \nvar N,M,i,j,x,y:integer;\nG:array [1..C,1..2] of integer;\n begin\n read(N,M);\n y:=0;\n for i := 1 to M do begin\n read(G[i,1],G[i,2]) end;\n for i := G[1,1] to G[1,2] do \n begin x:=1;\n for j := 2 to M do \n begin \n if (G[j,1]<=i)and(i<=G[j,2]) then x:= x+1 end;\n if x >= M then y:=y+1 end;\n writeln(y);\nend.", "language": "Pascal", "metadata": {"date": 1559829528, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03037.html", "problem_id": "p03037", "resource_group": "low_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/Pascal/s462358421.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s462358421", "user_id": "u655683235"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "const C=1000000; \nvar N,M,i,j,x,y:integer;\nG:array [1..C,1..2] of integer;\n begin\n read(N,M);\n y:=0;\n for i := 1 to M do begin\n read(G[i,1],G[i,2]) end;\n for i := G[1,1] to G[1,2] do \n begin x:=1;\n for j := 2 to M do \n begin \n if (G[j,1]<=i)and(i<=G[j,2]) then x:= x+1 end;\n if x >= M then y:=y+1 end;\n writeln(y);\nend.", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 2107, "memory_kb": 896}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s002996961", "group_id": "codeNet:p03037", "input_text": "const C=1000000; \nvar N,M,i,j,x,y:integer;\nG:array [1..C,1..2] of integer;\n begin\n read(N,M);\n y:=0;\n for i := 1 to M do begin\n read(G[i,1],G[i,2]) end;\n for i := 1 to N do \n begin x:=0;\n for j := 1 to M do \n begin \n if (G[j,1]<=i)and(i<=G[j,2]) then x:= x+1 end;\n if x >= M then y:=y+1 end;\n writeln(y);\nend.", "language": "Pascal", "metadata": {"date": 1559829036, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03037.html", "problem_id": "p03037", "resource_group": "low_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/Pascal/s002996961.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s002996961", "user_id": "u655683235"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "const C=1000000; \nvar N,M,i,j,x,y:integer;\nG:array [1..C,1..2] of integer;\n begin\n read(N,M);\n y:=0;\n for i := 1 to M do begin\n read(G[i,1],G[i,2]) end;\n for i := 1 to N do \n begin x:=0;\n for j := 1 to M do \n begin \n if (G[j,1]<=i)and(i<=G[j,2]) then x:= x+1 end;\n if x >= M then y:=y+1 end;\n writeln(y);\nend.", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 2107, "memory_kb": 896}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s812295138", "group_id": "codeNet:p03038", "input_text": "type\n pair = record\n b : int64;\n c : integer;\n end;\n\tpairArray = array[1..200000] of pair;\n\nvar cur,i,n,m:longint;\n sum:int64;\n bc : pairArray;\n\nprocedure\tswap(var a,b:pair);\nvar tmp:pair;\nbegin\n\ttmp:=a;\n\ta:=b;\n\tb:=tmp\nend;\n\nprocedure QuickSort(var a:pairArray;start_index,end_index:integer);\nvar i,j,x:int64;\nbegin\n\tx:=a[(start_index+end_index)div 2].c;\n\ti:=start_index;\n\tj:=end_index;\n\twhile(true)do\n\tbegin\n\t\twhile(a[i].ca[pos] then begin\n sum := sum + bc[cur].c;\n bc[cur].b := bc[cur].b - 1;\n if bc[cur].b=0 then cur := cur - 1\n end else begin\n sum := sum + a[pos];\n pos := pos - 1;\n end;\n writeln(sum)\nend.", "language": "Pascal", "metadata": {"date": 1558838256, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03038.html", "problem_id": "p03038", "resource_group": "low_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/Pascal/s426412870.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s426412870", "user_id": "u492212770"}, "prompt_components": {"gold_output": "14\n", "input_to_evaluate": "type\n\tintArray = array[1..100000] of int64;\n pair = record\n b : int64;\n c : integer;\n end;\n\tpairArray = array[1..100000] of pair;\n\nvar cur,pos,i,n,m:longint;\n sum:int64;\n a:intArray;\n bc : pairArray;\n\nprocedure\tswap(var a,b:int64);\nvar tmp:int64;\nbegin\n\ttmp:=a;\n\ta:=b;\n\tb:=tmp\nend;\n\nprocedure\tswapP(var a,b:pair);\nvar tmp:pair;\nbegin\n\ttmp:=a;\n\ta:=b;\n\tb:=tmp\nend;\n \nprocedure QuickSort(var a:intArray;start_index,end_index:integer);\nvar i,j,x:int64;\nbegin\n\tx:=a[(start_index+end_index)div 2];\n\ti:=start_index;\n\tj:=end_index;\n\twhile(true)do\n\tbegin\n\t\twhile(a[i]a[pos] then begin\n sum := sum + bc[cur].c;\n bc[cur].b := bc[cur].b - 1;\n if bc[cur].b=0 then cur := cur - 1\n end else begin\n sum := sum + a[pos];\n pos := pos - 1;\n end;\n writeln(sum)\nend.", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1729, "cpu_time_ms": 61, "memory_kb": 2432}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s263907025", "group_id": "codeNet:p03041", "input_text": "var N,K:integer;\n S:string;\nbegin\nread(N,K,S);\nif S[K]='A' then S[K]:='a';\nif S[K]='B' then S[K]:='b';\nif S[K]='C' then S[K]:='c';\nwrite(S)\nend.", "language": "Pascal", "metadata": {"date": 1561610199, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03041.html", "problem_id": "p03041", "resource_group": "low_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/Pascal/s263907025.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s263907025", "user_id": "u655683235"}, "prompt_components": {"gold_output": "aBC\n", "input_to_evaluate": "var N,K:integer;\n S:string;\nbegin\nread(N,K,S);\nif S[K]='A' then S[K]:='a';\nif S[K]='B' then S[K]:='b';\nif S[K]='C' then S[K]:='c';\nwrite(S)\nend.", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 147, "cpu_time_ms": 3, "memory_kb": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s094005722", "group_id": "codeNet:p03041", "input_text": "var str:array[1..52]of char;\n n,k,i:integer;\nbegin\n readln(n,k);\n for i:=1 to n do read(str[i]);\n if str[k]='A' then str[k]:='a';\n if str[k]='B' then str[k]:='b';\n if str[k]='C' then str[k]:='c';\n for i:=1 to n do writeln(str[i]);\nend.", "language": "Pascal", "metadata": {"date": 1558760412, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03041.html", "problem_id": "p03041", "resource_group": "low_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/Pascal/s094005722.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s094005722", "user_id": "u805277811"}, "prompt_components": {"gold_output": "aBC\n", "input_to_evaluate": "var str:array[1..52]of char;\n n,k,i:integer;\nbegin\n readln(n,k);\n for i:=1 to n do read(str[i]);\n if str[k]='A' then str[k]:='a';\n if str[k]='B' then str[k]:='b';\n if str[k]='C' then str[k]:='c';\n for i:=1 to n do writeln(str[i]);\nend.", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 244, "cpu_time_ms": 3, "memory_kb": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s452403023", "group_id": "codeNet:p03042", "input_text": "uses crt;\nvar n,a,b:longint;\nbegin\n readln(n);\n a:=n div 100;\n b:=n mod 100;\n if(a<12)and(a<>0)and(b<>0)then write('AMBIGUOUS')else\n if(a=12)and(b=12)then write('AMBIGUOUS')else\n if(a>12)and(b>12)then write('NA')else\n if(a>12)and(b=0)then write('NA') else\n if(a=0)and(b=0)then write('NA')else\n if(a=0)and(b<>0)then write('NA')else \n if (a<12)and(a>1)and(b>12)then write('MMYY') else\n if (a=12)and(b>12)then write('MMYY') else\n if (a=1)and(b>12)then write('MMYY') else\n if (a=12)and(b<=12)then write('MMYY') else\n if(a<>0)and(b<=1) then write('MMYY')else\n if (a=1)and(b>=1)then write('MMYY') else\n if (a>12)and(b<>0)and(b<=12)then write('YYMM');\n readln\nend.\n\n", "language": "Pascal", "metadata": {"date": 1577746557, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03042.html", "problem_id": "p03042", "resource_group": "low_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/Pascal/s452403023.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s452403023", "user_id": "u684763923"}, "prompt_components": {"gold_output": "YYMM\n", "input_to_evaluate": "uses crt;\nvar n,a,b:longint;\nbegin\n readln(n);\n a:=n div 100;\n b:=n mod 100;\n if(a<12)and(a<>0)and(b<>0)then write('AMBIGUOUS')else\n if(a=12)and(b=12)then write('AMBIGUOUS')else\n if(a>12)and(b>12)then write('NA')else\n if(a>12)and(b=0)then write('NA') else\n if(a=0)and(b=0)then write('NA')else\n if(a=0)and(b<>0)then write('NA')else \n if (a<12)and(a>1)and(b>12)then write('MMYY') else\n if (a=12)and(b>12)then write('MMYY') else\n if (a=1)and(b>12)then write('MMYY') else\n if (a=12)and(b<=12)then write('MMYY') else\n if(a<>0)and(b<=1) then write('MMYY')else\n if (a=1)and(b>=1)then write('MMYY') else\n if (a>12)and(b<>0)and(b<=12)then write('YYMM');\n readln\nend.\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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 778, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s941981383", "group_id": "codeNet:p03043", "input_text": "var\n\tN,K,i,p,q,x,tmp,get:Longint;\n\tans,now,make:double;\nbegin\n\tread(N,K);\n\tif N>=K then begin\n\t\tans:=(N-K+1)/N;\n\t\tq:=K-1;\n\tend\n\telse q:=N;\n\tmake:=1;\n\tget:=1;\n\tfor i:=1 to 2 do begin\n\t\tif q=0 then break;\n\t\tget:=get*2;\n\t\tmake:=make*0.5;\n\t\tp:=K div get;\n\t\tif px do begin\n\t\t\tnow:=now*0.5;\n\t\t\tx:=x*2;\n\t\tend;\n\t\tans:=ans+now;\n\tend;\n\twriteln(ans:0:9);\nend.", "language": "Pascal", "metadata": {"date": 1558332224, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03043.html", "problem_id": "p03043", "resource_group": "low_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/Pascal/s941981383.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s941981383", "user_id": "u657913472"}, "prompt_components": {"gold_output": "0.145833333333\n", "input_to_evaluate": "var\n\tN,K,i,p,q,x,tmp,get:Longint;\n\tans,now,make:double;\nbegin\n\tread(N,K);\n\tif N>=K then begin\n\t\tans:=(N-K+1)/N;\n\t\tq:=K-1;\n\tend\n\telse q:=N;\n\tmake:=1;\n\tget:=1;\n\tfor i:=1 to 2 do begin\n\t\tif q=0 then break;\n\t\tget:=get*2;\n\t\tmake:=make*0.5;\n\t\tp:=K div get;\n\t\tif px do begin\n\t\t\tnow:=now*0.5;\n\t\t\tx:=x*2;\n\t\tend;\n\t\tans:=ans+now;\n\tend;\n\twriteln(ans:0:9);\nend.", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 1, "memory_kb": 128}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s931944736", "group_id": "codeNet:p03043", "input_text": "var\n\tN,K,i,p,q,tmp,get:Longint;\n\tans,now,make:double;\nbegin\n\tread(N,K);\n\tif N>=K then begin\n\t\tans:=(N-K+1)/N;\n\t\tq:=K-1;\n\tend else q:=N;\n\tmake:=1;\n\tget:=1;\n\tfor i:=1 to 0 do begin\n\t\tif q=0 then break;\n\t\tget:=get*2;\n\t\tmake:=make*0.5;\n\t\tp:=K div get;\n\t\tif p1 do begin\n\t\t\tnow:=now*0.5;\n\t\t\ttmp:=tmp div 2;\n\t\tend;\n\t\tans:=ans+now;\n\tend;\n\twriteln(ans:0:9);\nend.\n", "language": "Pascal", "metadata": {"date": 1558331779, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03043.html", "problem_id": "p03043", "resource_group": "low_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/Pascal/s931944736.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s931944736", "user_id": "u657913472"}, "prompt_components": {"gold_output": "0.145833333333\n", "input_to_evaluate": "var\n\tN,K,i,p,q,tmp,get:Longint;\n\tans,now,make:double;\nbegin\n\tread(N,K);\n\tif N>=K then begin\n\t\tans:=(N-K+1)/N;\n\t\tq:=K-1;\n\tend else q:=N;\n\tmake:=1;\n\tget:=1;\n\tfor i:=1 to 0 do begin\n\t\tif q=0 then break;\n\t\tget:=get*2;\n\t\tmake:=make*0.5;\n\t\tp:=K div get;\n\t\tif p1 do begin\n\t\t\tnow:=now*0.5;\n\t\t\ttmp:=tmp div 2;\n\t\tend;\n\t\tans:=ans+now;\n\tend;\n\twriteln(ans:0:9);\nend.\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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 1, "memory_kb": 128}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s791422157", "group_id": "codeNet:p03048", "input_text": "var s,r,g,b,n,t:Longint;\nbegin\nread(r,g,b,n);\nt:=n;\nwhile True do begin\nif t<0 then begin\ndec(n,b);\nt:=n;\nif t<0 then begin\nwriteln(s);\nexit;\nend;\nend;\nif t mod r=0 then inc(s);\ndec(t,g);\nend;\nend.", "language": "Pascal", "metadata": {"date": 1576748960, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03048.html", "problem_id": "p03048", "resource_group": "low_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/Pascal/s791422157.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s791422157", "user_id": "u657913472"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "var s,r,g,b,n,t:Longint;\nbegin\nread(r,g,b,n);\nt:=n;\nwhile True do begin\nif t<0 then begin\ndec(n,b);\nt:=n;\nif t<0 then begin\nwriteln(s);\nexit;\nend;\nend;\nif t mod r=0 then inc(s);\ndec(t,g);\nend;\nend.", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 49, "memory_kb": 128}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s000627344", "group_id": "codeNet:p03048", "input_text": "var ir,ig,r,g,b,n,ans,temp: longint;\n\nbegin\n read(r,g,b,n);\n ans := 0;\n for ir := 0 to 3000 do begin\n for ig := 0 to 3000 do begin\n temp:=n - ir * r - ig * g;\n if temp<0 then break;\n if temp mod b = 0 then ans := ans + 1;\n end;\n end;\n writeln(ans)\nend.", "language": "Pascal", "metadata": {"date": 1557624868, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03048.html", "problem_id": "p03048", "resource_group": "low_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/Pascal/s000627344.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s000627344", "user_id": "u492212770"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "var ir,ig,r,g,b,n,ans,temp: longint;\n\nbegin\n read(r,g,b,n);\n ans := 0;\n for ir := 0 to 3000 do begin\n for ig := 0 to 3000 do begin\n temp:=n - ir * r - ig * g;\n if temp<0 then break;\n if temp mod b = 0 then ans := ans + 1;\n end;\n end;\n writeln(ans)\nend.", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 278, "cpu_time_ms": 67, "memory_kb": 128}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s103393993", "group_id": "codeNet:p03049", "input_text": "var t,i,n,ans : longint;\n b : array[1..3] of longint;\n p,c : char;\n\n\nfunction min(a,b:int64):int64;\nbegin\n if a < b then min := a else min := b\nend;\n\nbegin\n read(n);\n ans := 0;\n for t := 1 to 3 do b[t] := 0;\n for i := 0 to n do begin\n read(p);\n if p = 'B' then t := 1 else t := 0;\n while not eoln do begin\n read(c);\n if (p = 'A') and (c = 'B') then ans := ans + 1;\n p := c\n end;\n readln;\n if c = 'A' then t := t + 2;\n if t > 0 then b[t] := b[t] + 1\n end;\n if (b[1] = 0) and (b[2] = 0) and (b[3] > 0) then ans := ans + b[3] - 1\n else ans := ans + min(b[1],b[2]) + b[3];\n writeln(ans)\nend.", "language": "Pascal", "metadata": {"date": 1557632305, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03049.html", "problem_id": "p03049", "resource_group": "low_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/Pascal/s103393993.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s103393993", "user_id": "u492212770"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "var t,i,n,ans : longint;\n b : array[1..3] of longint;\n p,c : char;\n\n\nfunction min(a,b:int64):int64;\nbegin\n if a < b then min := a else min := b\nend;\n\nbegin\n read(n);\n ans := 0;\n for t := 1 to 3 do b[t] := 0;\n for i := 0 to n do begin\n read(p);\n if p = 'B' then t := 1 else t := 0;\n while not eoln do begin\n read(c);\n if (p = 'A') and (c = 'B') then ans := ans + 1;\n p := c\n end;\n readln;\n if c = 'A' then t := t + 2;\n if t > 0 then b[t] := b[t] + 1\n end;\n if (b[1] = 0) and (b[2] = 0) and (b[3] > 0) then ans := ans + b[3] - 1\n else ans := ans + min(b[1],b[2]) + b[3];\n writeln(ans)\nend.", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 640, "cpu_time_ms": 3, "memory_kb": 128}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s839748913", "group_id": "codeNet:p03049", "input_text": "var t,i,n,ans : integer;\n b : array[1..3] of integer;\n p,c : char;\n\n\nfunction min(a,b:int64):int64;\nbegin\n if a < b then min := a else min := b\nend;\n\nbegin\n read(n);\n ans := 0;\n for t := 1 to 3 do b[t] := 0;\n for i := 0 to n do begin\n read(p);\n if p = 'B' then t := 1 else t := 0;\n while not eoln do begin\n read(c);\n if (p = 'A') and (c = 'B') then ans := ans + 1;\n p := c\n end;\n readln;\n if c = 'A' then t := t + 2;\n if t > 0 then b[t] := b[t] + 1\n end;\n if (b[1] = 0) and (b[2] = 0) then ans := ans + b[3] - 1\n else ans := ans + min(b[1],b[2]) + b[3];\n writeln(ans)\nend.", "language": "Pascal", "metadata": {"date": 1557625918, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03049.html", "problem_id": "p03049", "resource_group": "low_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/Pascal/s839748913.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s839748913", "user_id": "u492212770"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "var t,i,n,ans : integer;\n b : array[1..3] of integer;\n p,c : char;\n\n\nfunction min(a,b:int64):int64;\nbegin\n if a < b then min := a else min := b\nend;\n\nbegin\n read(n);\n ans := 0;\n for t := 1 to 3 do b[t] := 0;\n for i := 0 to n do begin\n read(p);\n if p = 'B' then t := 1 else t := 0;\n while not eoln do begin\n read(c);\n if (p = 'A') and (c = 'B') then ans := ans + 1;\n p := c\n end;\n readln;\n if c = 'A' then t := t + 2;\n if t > 0 then b[t] := b[t] + 1\n end;\n if (b[1] = 0) and (b[2] = 0) then ans := ans + b[3] - 1\n else ans := ans + min(b[1],b[2]) + b[3];\n writeln(ans)\nend.", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 2, "memory_kb": 128}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s093481800", "group_id": "codeNet:p03050", "input_text": "var i : longint;\n n,ans:int64;\n\nbegin\n read(n);\n ans := 0;\n for i := 1 to 999999 do begin\n if (i+1)*(i+1)>n then break;\n if n mod i = 0 then\n if n div i - 1 > i then ans := ans + n div i - 1\n end;\n writeln(ans);\nend.", "language": "Pascal", "metadata": {"date": 1557626734, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03050.html", "problem_id": "p03050", "resource_group": "low_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/Pascal/s093481800.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s093481800", "user_id": "u492212770"}, "prompt_components": {"gold_output": "10\n", "input_to_evaluate": "var i : longint;\n n,ans:int64;\n\nbegin\n read(n);\n ans := 0;\n for i := 1 to 999999 do begin\n if (i+1)*(i+1)>n then break;\n if n mod i = 0 then\n if n div i - 1 > i then ans := ans + n div i - 1\n end;\n writeln(ans);\nend.", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 12, "memory_kb": 128}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s911595927", "group_id": "codeNet:p03062", "input_text": "var a:array[1..100010]of integer;\n n,i,j,m,mabs:integer;\n ans:int64;\n zero:boolean;\nbegin\n readln(n);\n m:=0;\n zero:=false;\n mabs:=100000010;\n for i:=1 to n do begin\n read(a[i]);\n if mabs>abs(a[i]) then \n mabs:=abs(a[i]);\n if a[i]<0 then inc(m);\n if a[i]=0 then zero:=true\n end;\n ans:=0;\n for i:=1 to n do \n if a[i]>0 then inc(ans,a[i])\n else inc(ans,-a[i]);\n if (m mod 2<>0) and not zero then\n ans:=ans-2*mabs;\n write(ans)\nend.", "language": "Pascal", "metadata": {"date": 1556454069, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03062.html", "problem_id": "p03062", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03062/input.txt", "sample_output_relpath": "derived/input_output/data/p03062/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03062/Pascal/s911595927.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s911595927", "user_id": "u805277811"}, "prompt_components": {"gold_output": "19\n", "input_to_evaluate": "var a:array[1..100010]of integer;\n n,i,j,m,mabs:integer;\n ans:int64;\n zero:boolean;\nbegin\n readln(n);\n m:=0;\n zero:=false;\n mabs:=100000010;\n for i:=1 to n do begin\n read(a[i]);\n if mabs>abs(a[i]) then \n mabs:=abs(a[i]);\n if a[i]<0 then inc(m);\n if a[i]=0 then zero:=true\n end;\n ans:=0;\n for i:=1 to n do \n if a[i]>0 then inc(ans,a[i])\n else inc(ans,-a[i]);\n if (m mod 2<>0) and not zero then\n ans:=ans-2*mabs;\n write(ans)\nend.", "problem_context": "Score : 400 points\n\nProblem Statement\n\nThere are N integers, A_1, A_2, ..., A_N, arranged in a row in this order.\n\nYou can perform the following operation on this integer sequence any number of times:\n\nOperation: Choose an integer i satisfying 1 \\leq i \\leq N-1. Multiply both A_i and A_{i+1} by -1.\n\nLet B_1, B_2, ..., B_N be the integer sequence after your operations.\n\nFind the maximum possible value of B_1 + B_2 + ... + B_N.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n-10^9 \\leq A_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the maximum possible value of B_1 + B_2 + ... + B_N.\n\nSample Input 1\n\n3\n-10 5 -4\n\nSample Output 1\n\n19\n\nIf we perform the operation as follows:\n\nChoose 1 as i, which changes the sequence to 10, -5, -4.\n\nChoose 2 as i, which changes the sequence to 10, 5, 4.\n\nwe have B_1 = 10, B_2 = 5, B_3 = 4. The sum here, B_1 + B_2 + B_3 = 10 + 5 + 4 = 19, is the maximum possible result.\n\nSample Input 2\n\n5\n10 -4 -8 -11 3\n\nSample Output 2\n\n30\n\nSample Input 3\n\n11\n-1000000000 1000000000 -1000000000 1000000000 -1000000000 0 1000000000 -1000000000 1000000000 -1000000000 1000000000\n\nSample Output 3\n\n10000000000\n\nThe output may not fit into a 32-bit integer type.", "sample_input": "3\n-10 5 -4\n"}, "reference_outputs": ["19\n"], "source_document_id": "p03062", "source_text": "Score : 400 points\n\nProblem Statement\n\nThere are N integers, A_1, A_2, ..., A_N, arranged in a row in this order.\n\nYou can perform the following operation on this integer sequence any number of times:\n\nOperation: Choose an integer i satisfying 1 \\leq i \\leq N-1. Multiply both A_i and A_{i+1} by -1.\n\nLet B_1, B_2, ..., B_N be the integer sequence after your operations.\n\nFind the maximum possible value of B_1 + B_2 + ... + B_N.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n-10^9 \\leq A_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the maximum possible value of B_1 + B_2 + ... + B_N.\n\nSample Input 1\n\n3\n-10 5 -4\n\nSample Output 1\n\n19\n\nIf we perform the operation as follows:\n\nChoose 1 as i, which changes the sequence to 10, -5, -4.\n\nChoose 2 as i, which changes the sequence to 10, 5, 4.\n\nwe have B_1 = 10, B_2 = 5, B_3 = 4. The sum here, B_1 + B_2 + B_3 = 10 + 5 + 4 = 19, is the maximum possible result.\n\nSample Input 2\n\n5\n10 -4 -8 -11 3\n\nSample Output 2\n\n30\n\nSample Input 3\n\n11\n-1000000000 1000000000 -1000000000 1000000000 -1000000000 0 1000000000 -1000000000 1000000000 -1000000000 1000000000\n\nSample Output 3\n\n10000000000\n\nThe output may not fit into a 32-bit integer type.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 472, "cpu_time_ms": 17, "memory_kb": 512}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s738979803", "group_id": "codeNet:p03062", "input_text": "var a:array[1..100010]of integer;\n n,i,j,m,maxm:integer;\n ans:int64;\n zero:boolean;\nbegin\n readln(n);\n m:=0;\n zero:=false;\n maxm:=-100000010;\n for i:=1 to n do begin\n read(a[i]);\n if a[i]<0 then begin\n inc(m);\n if maxm0) and not zero then\n ans:=ans-maxm;\n write(ans)\nend.\n", "language": "Pascal", "metadata": {"date": 1556451454, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03062.html", "problem_id": "p03062", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03062/input.txt", "sample_output_relpath": "derived/input_output/data/p03062/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03062/Pascal/s738979803.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s738979803", "user_id": "u805277811"}, "prompt_components": {"gold_output": "19\n", "input_to_evaluate": "var a:array[1..100010]of integer;\n n,i,j,m,maxm:integer;\n ans:int64;\n zero:boolean;\nbegin\n readln(n);\n m:=0;\n zero:=false;\n maxm:=-100000010;\n for i:=1 to n do begin\n read(a[i]);\n if a[i]<0 then begin\n inc(m);\n if maxm0) and not zero then\n ans:=ans-maxm;\n write(ans)\nend.\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nThere are N integers, A_1, A_2, ..., A_N, arranged in a row in this order.\n\nYou can perform the following operation on this integer sequence any number of times:\n\nOperation: Choose an integer i satisfying 1 \\leq i \\leq N-1. Multiply both A_i and A_{i+1} by -1.\n\nLet B_1, B_2, ..., B_N be the integer sequence after your operations.\n\nFind the maximum possible value of B_1 + B_2 + ... + B_N.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n-10^9 \\leq A_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the maximum possible value of B_1 + B_2 + ... + B_N.\n\nSample Input 1\n\n3\n-10 5 -4\n\nSample Output 1\n\n19\n\nIf we perform the operation as follows:\n\nChoose 1 as i, which changes the sequence to 10, -5, -4.\n\nChoose 2 as i, which changes the sequence to 10, 5, 4.\n\nwe have B_1 = 10, B_2 = 5, B_3 = 4. The sum here, B_1 + B_2 + B_3 = 10 + 5 + 4 = 19, is the maximum possible result.\n\nSample Input 2\n\n5\n10 -4 -8 -11 3\n\nSample Output 2\n\n30\n\nSample Input 3\n\n11\n-1000000000 1000000000 -1000000000 1000000000 -1000000000 0 1000000000 -1000000000 1000000000 -1000000000 1000000000\n\nSample Output 3\n\n10000000000\n\nThe output may not fit into a 32-bit integer type.", "sample_input": "3\n-10 5 -4\n"}, "reference_outputs": ["19\n"], "source_document_id": "p03062", "source_text": "Score : 400 points\n\nProblem Statement\n\nThere are N integers, A_1, A_2, ..., A_N, arranged in a row in this order.\n\nYou can perform the following operation on this integer sequence any number of times:\n\nOperation: Choose an integer i satisfying 1 \\leq i \\leq N-1. Multiply both A_i and A_{i+1} by -1.\n\nLet B_1, B_2, ..., B_N be the integer sequence after your operations.\n\nFind the maximum possible value of B_1 + B_2 + ... + B_N.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^5\n\n-10^9 \\leq A_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the maximum possible value of B_1 + B_2 + ... + B_N.\n\nSample Input 1\n\n3\n-10 5 -4\n\nSample Output 1\n\n19\n\nIf we perform the operation as follows:\n\nChoose 1 as i, which changes the sequence to 10, -5, -4.\n\nChoose 2 as i, which changes the sequence to 10, 5, 4.\n\nwe have B_1 = 10, B_2 = 5, B_3 = 4. The sum here, B_1 + B_2 + B_3 = 10 + 5 + 4 = 19, is the maximum possible result.\n\nSample Input 2\n\n5\n10 -4 -8 -11 3\n\nSample Output 2\n\n30\n\nSample Input 3\n\n11\n-1000000000 1000000000 -1000000000 1000000000 -1000000000 0 1000000000 -1000000000 1000000000 -1000000000 1000000000\n\nSample Output 3\n\n10000000000\n\nThe output may not fit into a 32-bit integer type.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 433, "cpu_time_ms": 18, "memory_kb": 512}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s390893517", "group_id": "codeNet:p03067", "input_text": "var a,b,c:integer;\n\nbegin\n read(a,b,c);\n if (a-c)*(b-c)<0 Then writeln('Yes') else writeln('No')\nend.", "language": "Pascal", "metadata": {"date": 1555808675, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03067.html", "problem_id": "p03067", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03067/input.txt", "sample_output_relpath": "derived/input_output/data/p03067/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03067/Pascal/s390893517.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s390893517", "user_id": "u492212770"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "var a,b,c:integer;\n\nbegin\n read(a,b,c);\n if (a-c)*(b-c)<0 Then writeln('Yes') else writeln('No')\nend.", "problem_context": "Score : 100 points\n\nProblem Statement\n\nThere are three houses on a number line: House 1, 2 and 3, with coordinates A, B and C, respectively.\nPrint Yes if we pass the coordinate of House 3 on the straight way from House 1 to House 2 without making a detour, and print No otherwise.\n\nConstraints\n\n0\\leq A,B,C\\leq 100\n\nA, B and C are distinct integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C\n\nOutput\n\nPrint Yes if we pass the coordinate of House 3 on the straight way from House 1 to House 2 without making a detour, and print No otherwise.\n\nSample Input 1\n\n3 8 5\n\nSample Output 1\n\nYes\n\nWe pass the coordinate 5 on the straight way from the house at coordinate 3 to the house at coordinate 8.\n\nSample Input 2\n\n7 3 1\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n10 2 4\n\nSample Output 3\n\nYes\n\nSample Input 4\n\n31 41 59\n\nSample Output 4\n\nNo", "sample_input": "3 8 5\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p03067", "source_text": "Score : 100 points\n\nProblem Statement\n\nThere are three houses on a number line: House 1, 2 and 3, with coordinates A, B and C, respectively.\nPrint Yes if we pass the coordinate of House 3 on the straight way from House 1 to House 2 without making a detour, and print No otherwise.\n\nConstraints\n\n0\\leq A,B,C\\leq 100\n\nA, B and C are distinct integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C\n\nOutput\n\nPrint Yes if we pass the coordinate of House 3 on the straight way from House 1 to House 2 without making a detour, and print No otherwise.\n\nSample Input 1\n\n3 8 5\n\nSample Output 1\n\nYes\n\nWe pass the coordinate 5 on the straight way from the house at coordinate 3 to the house at coordinate 8.\n\nSample Input 2\n\n7 3 1\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n10 2 4\n\nSample Output 3\n\nYes\n\nSample Input 4\n\n31 41 59\n\nSample Output 4\n\nNo", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 3, "memory_kb": 128}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s629447477", "group_id": "codeNet:p03068", "input_text": "var s:array[1..11] of char;\n n,k,i:integer;\nbegin\n read(n);\n for i:=1 to n do read(s[i]);\n read(k);\n for i:=1 to n do \n if s[i]=s[k] then write(s[k])\n else write('*');\nend.\n", "language": "Pascal", "metadata": {"date": 1555809639, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03068.html", "problem_id": "p03068", "resource_group": "low_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/Pascal/s629447477.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s629447477", "user_id": "u805277811"}, "prompt_components": {"gold_output": "*rr*r\n", "input_to_evaluate": "var s:array[1..11] of char;\n n,k,i:integer;\nbegin\n read(n);\n for i:=1 to n do read(s[i]);\n read(k);\n for i:=1 to n do \n if s[i]=s[k] then write(s[k])\n else write('*');\nend.\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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 7, "memory_kb": 128}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s596125781", "group_id": "codeNet:p03069", "input_text": "var a :char;\n s,t :array[0..200010]of integer;\n n,i,j,k,ans :integer;\n \nfunction min(a,b:integer):integer;\nbegin\n if a>b then min:=b\n else min:=a\nend;\n\nbegin\n readln(n);\n s[0]:=0;\n for i:=1 to n do begin\n read(a);\n if a='#' then s[i]:=s[i-1]+1\n else s[i]:=s[i-1];\n end;\n ans:=210000;\n for i:=0 to n do t[i]:=s[i]+n+s[i]-i-s[n];\n for i:=0 to n do ans:=min(ans,t[i]);\n writeln(ans)\nend.", "language": "Pascal", "metadata": {"date": 1555868950, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03069.html", "problem_id": "p03069", "resource_group": "low_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/Pascal/s596125781.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s596125781", "user_id": "u805277811"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "var a :char;\n s,t :array[0..200010]of integer;\n n,i,j,k,ans :integer;\n \nfunction min(a,b:integer):integer;\nbegin\n if a>b then min:=b\n else min:=a\nend;\n\nbegin\n readln(n);\n s[0]:=0;\n for i:=1 to n do begin\n read(a);\n if a='#' then s[i]:=s[i-1]+1\n else s[i]:=s[i-1];\n end;\n ans:=210000;\n for i:=0 to n do t[i]:=s[i]+n+s[i]-i-s[n];\n for i:=0 to n do ans:=min(ans,t[i]);\n writeln(ans)\nend.", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 7, "memory_kb": 1664}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s656462022", "group_id": "codeNet:p03069", "input_text": "var a :char;\n s :array[0..200010]of integer;\n n,i,j,k,ans :integer;\n \nfunction min(a,b:integer):integer;\nbegin\n if a>b then min:=b\n else min:=a\nend;\n\nbegin\n readln(n);\n s[0]:=0;\n for i:=1 to n do begin\n read(a);\n if a='#' then s[i]:=s[i-1]+1\n else s[i]:=s[i-1];\n end;\n ans:=210000;\n j:=ans;\n for i:=1 to n do begin\n if s[i]=s[i-1] then begin\n j:=min(s[i],n+s[i]-i-s[n]);\n ans:=min(ans,j)\n end\n end;\n write(ans)\nend.", "language": "Pascal", "metadata": {"date": 1555867059, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03069.html", "problem_id": "p03069", "resource_group": "low_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/Pascal/s656462022.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s656462022", "user_id": "u805277811"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "var a :char;\n s :array[0..200010]of integer;\n n,i,j,k,ans :integer;\n \nfunction min(a,b:integer):integer;\nbegin\n if a>b then min:=b\n else min:=a\nend;\n\nbegin\n readln(n);\n s[0]:=0;\n for i:=1 to n do begin\n read(a);\n if a='#' then s[i]:=s[i-1]+1\n else s[i]:=s[i-1];\n end;\n ans:=210000;\n j:=ans;\n for i:=1 to n do begin\n if s[i]=s[i-1] then begin\n j:=min(s[i],n+s[i]-i-s[n]);\n ans:=min(ans,j)\n end\n end;\n write(ans)\nend.", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 463, "cpu_time_ms": 7, "memory_kb": 896}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s084093954", "group_id": "codeNet:p03071", "input_text": "type ary=array[1..100001]of char;\nvar a,b,i,j :integer;\n c:char;\n l :ary;\n \nbegin\n j:=1; a:=0; b:=0;\n for i:=1 to 100001 do \n if i mod 2 = 0 then l[i]:='0'\n else l[i]:='1';\n repeat\n read(c);\n if c=l[j] then inc(a)\n else inc(b);\n inc(j)\n until eoln ;\n if aord(S[i])-48 then inc(now);\n\tans:=now;\n\tnow:=0;\n\tfor i:=1 to n do if(i+1)mod 2<>ord(S[i])-48 then inc(now);\n\tif ans>now then ans:=now;\n\twriteln(ans);\nend.\n", "language": "Pascal", "metadata": {"date": 1581731860, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03073.html", "problem_id": "p03073", "resource_group": "low_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/Pascal/s979416982.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s979416982", "user_id": "u657913472"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "var\n\tS:String;\n\tans,now,i,n:Longint;\nbegin\n\treadln(S);\n\tn:=length(S);\n\tfor i:=1 to n do if i mod 2<>ord(S[i])-48 then inc(now);\n\tans:=now;\n\tnow:=0;\n\tfor i:=1 to n do if(i+1)mod 2<>ord(S[i])-48 then inc(now);\n\tif ans>now then ans:=now;\n\twriteln(ans);\nend.\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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 4, "memory_kb": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s040923466", "group_id": "codeNet:p03073", "input_text": "Uses math;\nvar i,count1,count2:integer;\n S:string; //count1:010101.._count2:101010\nbegin\nread(S);i:=1;\nwhile ord(S[i]) > 40 do\n begin\n if i mod 2 = 1 then begin\n if S[i]='0' then inc(count1) else inc(count2) end \n else begin if S[i]='1' then inc(count1) else inc(count2) end;\n inc(i);\nend;\nwrite(min(count1,count2))\nend.", "language": "Pascal", "metadata": {"date": 1561590864, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03073.html", "problem_id": "p03073", "resource_group": "low_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/Pascal/s040923466.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s040923466", "user_id": "u655683235"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "Uses math;\nvar i,count1,count2:integer;\n S:string; //count1:010101.._count2:101010\nbegin\nread(S);i:=1;\nwhile ord(S[i]) > 40 do\n begin\n if i mod 2 = 1 then begin\n if S[i]='0' then inc(count1) else inc(count2) end \n else begin if S[i]='1' then inc(count1) else inc(count2) end;\n inc(i);\nend;\nwrite(min(count1,count2))\nend.", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 329, "cpu_time_ms": 3, "memory_kb": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s758019593", "group_id": "codeNet:p03080", "input_text": "var n,i,a,b:integer;\n c:char;\nbegin\n read(n);a:=0;b:=0;\n for i:=1 to n do\n begin\n read(c);\n if c='R' then inc(a)\n else inc(b);\n end;\n if a>b then write('Yes')\n else write('No')\nend.\n", "language": "Pascal", "metadata": {"date": 1553982056, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03080.html", "problem_id": "p03080", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03080/input.txt", "sample_output_relpath": "derived/input_output/data/p03080/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03080/Pascal/s758019593.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s758019593", "user_id": "u805277811"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "var n,i,a,b:integer;\n c:char;\nbegin\n read(n);a:=0;b:=0;\n for i:=1 to n do\n begin\n read(c);\n if c='R' then inc(a)\n else inc(b);\n end;\n if a>b then write('Yes')\n else write('No')\nend.\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nThere are N people numbered 1 to N. Each person wears a red hat or a blue hat.\n\nYou are given a string s representing the colors of the people. Person i wears a red hat if s_i is R, and a blue hat if s_i is B.\n\nDetermine if there are more people wearing a red hat than people wearing a blue hat.\n\nConstraints\n\n1 \\leq N \\leq 100\n\n|s| = N\n\ns_i is R or B.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\ns\n\nOutput\n\nIf there are more people wearing a red hat than there are people wearing a blue hat, print Yes; otherwise, print No.\n\nSample Input 1\n\n4\nRRBR\n\nSample Output 1\n\nYes\n\nThere are three people wearing a red hat, and one person wearing a blue hat.\n\nSince there are more people wearing a red hat than people wearing a blue hat, the answer is Yes.\n\nSample Input 2\n\n4\nBRBR\n\nSample Output 2\n\nNo\n\nThere are two people wearing a red hat, and two people wearing a blue hat.\n\nSince there are as many people wearing a red hat as people wearing a blue hat, the answer is No.", "sample_input": "4\nRRBR\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p03080", "source_text": "Score : 200 points\n\nProblem Statement\n\nThere are N people numbered 1 to N. Each person wears a red hat or a blue hat.\n\nYou are given a string s representing the colors of the people. Person i wears a red hat if s_i is R, and a blue hat if s_i is B.\n\nDetermine if there are more people wearing a red hat than people wearing a blue hat.\n\nConstraints\n\n1 \\leq N \\leq 100\n\n|s| = N\n\ns_i is R or B.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\ns\n\nOutput\n\nIf there are more people wearing a red hat than there are people wearing a blue hat, print Yes; otherwise, print No.\n\nSample Input 1\n\n4\nRRBR\n\nSample Output 1\n\nYes\n\nThere are three people wearing a red hat, and one person wearing a blue hat.\n\nSince there are more people wearing a red hat than people wearing a blue hat, the answer is Yes.\n\nSample Input 2\n\n4\nBRBR\n\nSample Output 2\n\nNo\n\nThere are two people wearing a red hat, and two people wearing a blue hat.\n\nSince there are as many people wearing a red hat as people wearing a blue hat, the answer is No.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s863475825", "group_id": "codeNet:p03087", "input_text": "var\n\tS:String;\n\tN,Q,l,r,i:Longint;\n\tsum:Array[1..100000]of Longint;\nbegin\n\treadln(N,Q);\n\treadln(S);\n\tfor i:=2 to length(S)do begin\n\t\tsum[i]:=sum[i-1];\n\t\tif(S[i-1]='A')and(S[i]='C')then inc(sum[i]);\n\tend;\n\tfor i:=1 to Q do begin\n\t\tread(l,r);\n\t\twriteln(sum[r]-sum[l]);\n\tend;\nend.\n", "language": "Pascal", "metadata": {"date": 1581731999, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03087.html", "problem_id": "p03087", "resource_group": "low_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/Pascal/s863475825.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s863475825", "user_id": "u657913472"}, "prompt_components": {"gold_output": "2\n0\n3\n", "input_to_evaluate": "var\n\tS:String;\n\tN,Q,l,r,i:Longint;\n\tsum:Array[1..100000]of Longint;\nbegin\n\treadln(N,Q);\n\treadln(S);\n\tfor i:=2 to length(S)do begin\n\t\tsum[i]:=sum[i-1];\n\t\tif(S[i-1]='A')and(S[i]='C')then inc(sum[i]);\n\tend;\n\tfor i:=1 to Q do begin\n\t\tread(l,r);\n\t\twriteln(sum[r]-sum[l]);\n\tend;\nend.\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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 278, "cpu_time_ms": 40, "memory_kb": 1152}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s620991063", "group_id": "codeNet:p03090", "input_text": "var n:integer;i:integer;j:integer;\nbegin\n read(n);\n if n mod 2=1 then begin\n writeln(Trunc(n*(n-1)/2-n/2+1));\n for i:=1 to n-1 do\n for j:=i+1 to n do\n if i+j<>N+1 then begin\n\t writeln(i);\n\t\t writeln(j);\n\t end;\n end else begin\n writeln(n*(n-1)/2-n/2);\n for i:=1 to n-1 do\n for j:=i+1 to n do\n if i+j<>N then begin\n\t writeln(i);\n\t\t writeln(j);\n\t end;\n end;\nend.", "language": "Pascal", "metadata": {"date": 1565063170, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03090.html", "problem_id": "p03090", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03090/input.txt", "sample_output_relpath": "derived/input_output/data/p03090/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03090/Pascal/s620991063.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s620991063", "user_id": "u656771711"}, "prompt_components": {"gold_output": "2\n1 3\n2 3\n", "input_to_evaluate": "var n:integer;i:integer;j:integer;\nbegin\n read(n);\n if n mod 2=1 then begin\n writeln(Trunc(n*(n-1)/2-n/2+1));\n for i:=1 to n-1 do\n for j:=i+1 to n do\n if i+j<>N+1 then begin\n\t writeln(i);\n\t\t writeln(j);\n\t end;\n end else begin\n writeln(n*(n-1)/2-n/2);\n for i:=1 to n-1 do\n for j:=i+1 to n do\n if i+j<>N then begin\n\t writeln(i);\n\t\t writeln(j);\n\t end;\n end;\nend.", "problem_context": "Score : 700 points\n\nProblem Statement\n\nYou are given an integer N.\nBuild an undirected graph with N vertices with indices 1 to N that satisfies the following two conditions:\n\nThe graph is simple and connected.\n\nThere exists an integer S such that, for every vertex, the sum of the indices of the vertices adjacent to that vertex is S.\n\nIt can be proved that at least one such graph exists under the constraints of this problem.\n\nConstraints\n\nAll values in input are integers.\n\n3 \\leq N \\leq 100\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nIn the first line, print the number of edges, M, in the graph you made. In the i-th of the following M lines, print two integers a_i and b_i, representing the endpoints of the i-th edge.\n\nThe output will be judged correct if the graph satisfies the conditions.\n\nSample Input 1\n\n3\n\nSample Output 1\n\n2\n1 3\n2 3\n\nFor every vertex, the sum of the indices of the vertices adjacent to that vertex is 3.", "sample_input": "3\n"}, "reference_outputs": ["2\n1 3\n2 3\n"], "source_document_id": "p03090", "source_text": "Score : 700 points\n\nProblem Statement\n\nYou are given an integer N.\nBuild an undirected graph with N vertices with indices 1 to N that satisfies the following two conditions:\n\nThe graph is simple and connected.\n\nThere exists an integer S such that, for every vertex, the sum of the indices of the vertices adjacent to that vertex is S.\n\nIt can be proved that at least one such graph exists under the constraints of this problem.\n\nConstraints\n\nAll values in input are integers.\n\n3 \\leq N \\leq 100\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nIn the first line, print the number of edges, M, in the graph you made. In the i-th of the following M lines, print two integers a_i and b_i, representing the endpoints of the i-th edge.\n\nThe output will be judged correct if the graph satisfies the conditions.\n\nSample Input 1\n\n3\n\nSample Output 1\n\n2\n1 3\n2 3\n\nFor every vertex, the sum of the indices of the vertices adjacent to that vertex is 3.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 1, "memory_kb": 128}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s758069443", "group_id": "codeNet:p03090", "input_text": "var\nn,i,j,cnt,t:Longint;\na,b:array[1..10000]of Byte;\nbegin\nread(n);\nt:=n+1-n mod 2;\nwriteln(n*(n-1)div 2-n div 2);\nfor i:=1 to n do begin\nfor j:=i+1 to t-i-1 do writeln(i,' ',j);\nif(j=t-i-1)or(j=t-i)then j:=t-i+1;\nfor j:=j to n do writeln(i,' ',j);\nend;\nend.", "language": "Pascal", "metadata": {"date": 1553383891, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03090.html", "problem_id": "p03090", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03090/input.txt", "sample_output_relpath": "derived/input_output/data/p03090/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03090/Pascal/s758069443.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s758069443", "user_id": "u657913472"}, "prompt_components": {"gold_output": "2\n1 3\n2 3\n", "input_to_evaluate": "var\nn,i,j,cnt,t:Longint;\na,b:array[1..10000]of Byte;\nbegin\nread(n);\nt:=n+1-n mod 2;\nwriteln(n*(n-1)div 2-n div 2);\nfor i:=1 to n do begin\nfor j:=i+1 to t-i-1 do writeln(i,' ',j);\nif(j=t-i-1)or(j=t-i)then j:=t-i+1;\nfor j:=j to n do writeln(i,' ',j);\nend;\nend.", "problem_context": "Score : 700 points\n\nProblem Statement\n\nYou are given an integer N.\nBuild an undirected graph with N vertices with indices 1 to N that satisfies the following two conditions:\n\nThe graph is simple and connected.\n\nThere exists an integer S such that, for every vertex, the sum of the indices of the vertices adjacent to that vertex is S.\n\nIt can be proved that at least one such graph exists under the constraints of this problem.\n\nConstraints\n\nAll values in input are integers.\n\n3 \\leq N \\leq 100\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nIn the first line, print the number of edges, M, in the graph you made. In the i-th of the following M lines, print two integers a_i and b_i, representing the endpoints of the i-th edge.\n\nThe output will be judged correct if the graph satisfies the conditions.\n\nSample Input 1\n\n3\n\nSample Output 1\n\n2\n1 3\n2 3\n\nFor every vertex, the sum of the indices of the vertices adjacent to that vertex is 3.", "sample_input": "3\n"}, "reference_outputs": ["2\n1 3\n2 3\n"], "source_document_id": "p03090", "source_text": "Score : 700 points\n\nProblem Statement\n\nYou are given an integer N.\nBuild an undirected graph with N vertices with indices 1 to N that satisfies the following two conditions:\n\nThe graph is simple and connected.\n\nThere exists an integer S such that, for every vertex, the sum of the indices of the vertices adjacent to that vertex is S.\n\nIt can be proved that at least one such graph exists under the constraints of this problem.\n\nConstraints\n\nAll values in input are integers.\n\n3 \\leq N \\leq 100\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nIn the first line, print the number of edges, M, in the graph you made. In the i-th of the following M lines, print two integers a_i and b_i, representing the endpoints of the i-th edge.\n\nThe output will be judged correct if the graph satisfies the conditions.\n\nSample Input 1\n\n3\n\nSample Output 1\n\n2\n1 3\n2 3\n\nFor every vertex, the sum of the indices of the vertices adjacent to that vertex is 3.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s881564613", "group_id": "codeNet:p03096", "input_text": "var\n i,n:longint;\n a,ys,xg,f:array[0..200010] of longint;\nbegin\n readln(n);\n for i:=1 to n do read(a[i]);\n for i:=1 to n do\n begin\n if ys[a[i]]<>0 then xg[ys[a[i]]]:=i;\n ys[a[i]]:=i;\n end;\n f[1]:=1;\n for i:=1 to n-1 do\n begin\n f[i+1]:=f[i+1]+f[i];\n if xg[i]>i+1 then f[xg[i]]:=f[xg[i]]+f[i];\n end;\n writeln(f[n]);\nend.", "language": "Pascal", "metadata": {"date": 1569840570, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03096.html", "problem_id": "p03096", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03096/input.txt", "sample_output_relpath": "derived/input_output/data/p03096/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03096/Pascal/s881564613.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s881564613", "user_id": "u005813231"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "var\n i,n:longint;\n a,ys,xg,f:array[0..200010] of longint;\nbegin\n readln(n);\n for i:=1 to n do read(a[i]);\n for i:=1 to n do\n begin\n if ys[a[i]]<>0 then xg[ys[a[i]]]:=i;\n ys[a[i]]:=i;\n end;\n f[1]:=1;\n for i:=1 to n-1 do\n begin\n f[i+1]:=f[i+1]+f[i];\n if xg[i]>i+1 then f[xg[i]]:=f[xg[i]]+f[i];\n end;\n writeln(f[n]);\nend.", "problem_context": "Score : 700 points\n\nProblem Statement\n\nThere are N stones arranged in a row. The i-th stone from the left is painted in the color C_i.\n\nSnuke will perform the following operation zero or more times:\n\nChoose two stones painted in the same color. Repaint all the stones between them, with the color of the chosen stones.\n\nFind the number of possible final sequences of colors of the stones, modulo 10^9+7.\n\nConstraints\n\n1 \\leq N \\leq 2\\times 10^5\n\n1 \\leq C_i \\leq 2\\times 10^5(1\\leq i\\leq N)\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nC_1\n:\nC_N\n\nOutput\n\nPrint the number of possible final sequences of colors of the stones, modulo 10^9+7.\n\nSample Input 1\n\n5\n1\n2\n1\n2\n2\n\nSample Output 1\n\n3\n\nWe can make three sequences of colors of stones, as follows:\n\n(1,2,1,2,2), by doing nothing.\n\n(1,1,1,2,2), by choosing the first and third stones to perform the operation.\n\n(1,2,2,2,2), by choosing the second and fourth stones to perform the operation.\n\nSample Input 2\n\n6\n4\n2\n5\n4\n2\n4\n\nSample Output 2\n\n5\n\nSample Input 3\n\n7\n1\n3\n1\n2\n3\n3\n2\n\nSample Output 3\n\n5", "sample_input": "5\n1\n2\n1\n2\n2\n"}, "reference_outputs": ["3\n"], "source_document_id": "p03096", "source_text": "Score : 700 points\n\nProblem Statement\n\nThere are N stones arranged in a row. The i-th stone from the left is painted in the color C_i.\n\nSnuke will perform the following operation zero or more times:\n\nChoose two stones painted in the same color. Repaint all the stones between them, with the color of the chosen stones.\n\nFind the number of possible final sequences of colors of the stones, modulo 10^9+7.\n\nConstraints\n\n1 \\leq N \\leq 2\\times 10^5\n\n1 \\leq C_i \\leq 2\\times 10^5(1\\leq i\\leq N)\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nC_1\n:\nC_N\n\nOutput\n\nPrint the number of possible final sequences of colors of the stones, modulo 10^9+7.\n\nSample Input 1\n\n5\n1\n2\n1\n2\n2\n\nSample Output 1\n\n3\n\nWe can make three sequences of colors of stones, as follows:\n\n(1,2,1,2,2), by doing nothing.\n\n(1,1,1,2,2), by choosing the first and third stones to perform the operation.\n\n(1,2,2,2,2), by choosing the second and fourth stones to perform the operation.\n\nSample Input 2\n\n6\n4\n2\n5\n4\n2\n4\n\nSample Output 2\n\n5\n\nSample Input 3\n\n7\n1\n3\n1\n2\n3\n3\n2\n\nSample Output 3\n\n5", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 358, "cpu_time_ms": 28, "memory_kb": 3200}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s619054208", "group_id": "codeNet:p03101", "input_text": "var n,m,c,i,j,sum,a,ans :integer;\n b:array[1..30] of integer;\nbegin\n readln(n,m,c);\n ans:=0;\n for i:=1 to m do read(b[i]);\n readln;\n for i:=1 to n do begin\n sum:=c;\n for j:=1 to m do begin\n read(a);\n sum:=sum+a*b[j];\n end;\n readln;\n if sum>0 then ans:=ans+1\n end;\n write(ans);\n end.", "language": "Pascal", "metadata": {"date": 1552165128, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03101.html", "problem_id": "p03101", "resource_group": "low_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/Pascal/s619054208.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s619054208", "user_id": "u805277811"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "var n,m,c,i,j,sum,a,ans :integer;\n b:array[1..30] of integer;\nbegin\n readln(n,m,c);\n ans:=0;\n for i:=1 to m do read(b[i]);\n readln;\n for i:=1 to n do begin\n sum:=c;\n for j:=1 to m do begin\n read(a);\n sum:=sum+a*b[j];\n end;\n readln;\n if sum>0 then ans:=ans+1\n end;\n write(ans);\n end.", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 128}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s201978440", "group_id": "codeNet:p03102", "input_text": "var n,m,c,i,j,sum,a,ans :integer;\n b:array[1..30] of integer;\nbegin\n readln(n,m,c);\n ans:=0;\n for i:=1 to m do read(b[i]);\n for i:=1 to n do begin\n sum:=c;\n for j:=1 to m do begin\n read(a);\n sum:=sum+a*b[i];\n end;\n readln;\n if sum>0 then ans:=ans+1\n end;\n write(ans);\n end.\n", "language": "Pascal", "metadata": {"date": 1552163578, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03102.html", "problem_id": "p03102", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03102/input.txt", "sample_output_relpath": "derived/input_output/data/p03102/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03102/Pascal/s201978440.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s201978440", "user_id": "u805277811"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "var n,m,c,i,j,sum,a,ans :integer;\n b:array[1..30] of integer;\nbegin\n readln(n,m,c);\n ans:=0;\n for i:=1 to m do read(b[i]);\n for i:=1 to n do begin\n sum:=c;\n for j:=1 to m do begin\n read(a);\n sum:=sum+a*b[i];\n end;\n readln;\n if sum>0 then ans:=ans+1\n end;\n write(ans);\n end.\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nThere are N pieces of source code. The characteristics of the i-th code is represented by M integers A_{i1}, A_{i2}, ..., A_{iM}.\n\nAdditionally, you are given integers B_1, B_2, ..., B_M and C.\n\nThe i-th code correctly solves this problem if and only if A_{i1} B_1 + A_{i2} B_2 + ... + A_{iM} B_M + C > 0.\n\nAmong the N codes, find the number of codes that correctly solve this problem.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N, M \\leq 20\n\n-100 \\leq A_{ij} \\leq 100\n\n-100 \\leq B_i \\leq 100\n\n-100 \\leq C \\leq 100\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M C\nB_1 B_2 ... B_M\nA_{11} A_{12} ... A_{1M}\nA_{21} A_{22} ... A_{2M}\n\\vdots\nA_{N1} A_{N2} ... A_{NM}\n\nOutput\n\nPrint the number of codes among the given N codes that correctly solve this problem.\n\nSample Input 1\n\n2 3 -10\n1 2 3\n3 2 1\n1 2 2\n\nSample Output 1\n\n1\n\nOnly the second code correctly solves this problem, as follows:\n\nSince 3 \\times 1 + 2 \\times 2 + 1 \\times 3 + (-10) = 0 \\leq 0, the first code does not solve this problem.\n\n1 \\times 1 + 2 \\times 2 + 2 \\times 3 + (-10) = 1 > 0, the second code solves this problem.\n\nSample Input 2\n\n5 2 -4\n-2 5\n100 41\n100 40\n-3 0\n-6 -2\n18 -13\n\nSample Output 2\n\n2\n\nSample Input 3\n\n3 3 0\n100 -100 0\n0 100 100\n100 100 100\n-100 100 100\n\nSample Output 3\n\n0\n\nAll of them are Wrong Answer. Except yours.", "sample_input": "2 3 -10\n1 2 3\n3 2 1\n1 2 2\n"}, "reference_outputs": ["1\n"], "source_document_id": "p03102", "source_text": "Score : 200 points\n\nProblem Statement\n\nThere are N pieces of source code. The characteristics of the i-th code is represented by M integers A_{i1}, A_{i2}, ..., A_{iM}.\n\nAdditionally, you are given integers B_1, B_2, ..., B_M and C.\n\nThe i-th code correctly solves this problem if and only if A_{i1} B_1 + A_{i2} B_2 + ... + A_{iM} B_M + C > 0.\n\nAmong the N codes, find the number of codes that correctly solve this problem.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N, M \\leq 20\n\n-100 \\leq A_{ij} \\leq 100\n\n-100 \\leq B_i \\leq 100\n\n-100 \\leq C \\leq 100\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M C\nB_1 B_2 ... B_M\nA_{11} A_{12} ... A_{1M}\nA_{21} A_{22} ... A_{2M}\n\\vdots\nA_{N1} A_{N2} ... A_{NM}\n\nOutput\n\nPrint the number of codes among the given N codes that correctly solve this problem.\n\nSample Input 1\n\n2 3 -10\n1 2 3\n3 2 1\n1 2 2\n\nSample Output 1\n\n1\n\nOnly the second code correctly solves this problem, as follows:\n\nSince 3 \\times 1 + 2 \\times 2 + 1 \\times 3 + (-10) = 0 \\leq 0, the first code does not solve this problem.\n\n1 \\times 1 + 2 \\times 2 + 2 \\times 3 + (-10) = 1 > 0, the second code solves this problem.\n\nSample Input 2\n\n5 2 -4\n-2 5\n100 41\n100 40\n-3 0\n-6 -2\n18 -13\n\nSample Output 2\n\n2\n\nSample Input 3\n\n3 3 0\n100 -100 0\n0 100 100\n100 100 100\n-100 100 100\n\nSample Output 3\n\n0\n\nAll of them are Wrong Answer. Except yours.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 2, "memory_kb": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s186293826", "group_id": "codeNet:p03103", "input_text": "var\n\ta,b:array[0..100010] of longint;\n\tans:int64;\n\tn,m,i:longint;\nprocedure qsort(l,r:longint);\nvar\n\ti,j,t,mid:longint;\nbegin\n\ti:=l; j:=r; mid:=a[(l+r) div 2];\n\trepeat\n\t\twhile a[i]mid do dec(j);\n\t\tif i<=j then\n\t\tbegin\n\t\t\tt:=a[i]; a[i]:=a[j]; a[j]:=t;\n\t\t\tt:=b[i]; b[i]:=b[j]; b[j]:=t;\n\t\t\tinc(i); dec(j);\n\t\tend;\n\tuntil i>j;\n\tif l0 do\n\tbegin\n\t\tif m<=b[i] then\n\t\tbegin\n\t\t\tans:=ans+m*a[i];\n\t\t\tbreak;\n\t\tend;\n\t\tm:=m-b[i];\n\t\tans:=ans+a[i]*b[i];\n\t\tinc(i);\n\tend;\n\twriteln(ans);\nend.", "language": "Pascal", "metadata": {"date": 1552162516, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03103.html", "problem_id": "p03103", "resource_group": "low_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/Pascal/s186293826.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s186293826", "user_id": "u957998623"}, "prompt_components": {"gold_output": "12\n", "input_to_evaluate": "var\n\ta,b:array[0..100010] of longint;\n\tans:int64;\n\tn,m,i:longint;\nprocedure qsort(l,r:longint);\nvar\n\ti,j,t,mid:longint;\nbegin\n\ti:=l; j:=r; mid:=a[(l+r) div 2];\n\trepeat\n\t\twhile a[i]mid do dec(j);\n\t\tif i<=j then\n\t\tbegin\n\t\t\tt:=a[i]; a[i]:=a[j]; a[j]:=t;\n\t\t\tt:=b[i]; b[i]:=b[j]; b[j]:=t;\n\t\t\tinc(i); dec(j);\n\t\tend;\n\tuntil i>j;\n\tif l0 do\n\tbegin\n\t\tif m<=b[i] then\n\t\tbegin\n\t\t\tans:=ans+m*a[i];\n\t\t\tbreak;\n\t\tend;\n\t\tm:=m-b[i];\n\t\tans:=ans+a[i]*b[i];\n\t\tinc(i);\n\tend;\n\twriteln(ans);\nend.", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 643, "cpu_time_ms": 34, "memory_kb": 896}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s993214794", "group_id": "codeNet:p03107", "input_text": "type itemp = ^item;\n item = record\n cont : char;\n next : itemp;\n end;\nvar s : itemp;\n n : integer;\n\nprocedure readitem(var p:itemp);{頭から追加}\nvar q : itemp;\nbegin\n q := p;\n new(p);\n read(p^.cont);\n p^.next := q\nend;\n\nprocedure delitem(var p : itemp);{頭から消す}\nbegin\n p := p^.next\nend;\n\nbegin\n n:= 0;\n s:=nil;\n while not eoln do begin\n readitem(s);\n if s^.next <> nil then\n if Ord(s^.cont)+Ord(s^.next^.cont) = 97 then begin\n n := n + 2;\n delitem(s); delitem(s)\n end\n end;\n writeln(n)\nend.", "language": "Pascal", "metadata": {"date": 1551645339, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03107.html", "problem_id": "p03107", "resource_group": "low_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/Pascal/s993214794.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s993214794", "user_id": "u492212770"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "type itemp = ^item;\n item = record\n cont : char;\n next : itemp;\n end;\nvar s : itemp;\n n : integer;\n\nprocedure readitem(var p:itemp);{頭から追加}\nvar q : itemp;\nbegin\n q := p;\n new(p);\n read(p^.cont);\n p^.next := q\nend;\n\nprocedure delitem(var p : itemp);{頭から消す}\nbegin\n p := p^.next\nend;\n\nbegin\n n:= 0;\n s:=nil;\n while not eoln do begin\n readitem(s);\n if s^.next <> nil then\n if Ord(s^.cont)+Ord(s^.next^.cont) = 97 then begin\n n := n + 2;\n delitem(s); delitem(s)\n end\n end;\n writeln(n)\nend.", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 6, "memory_kb": 3200}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s872157089", "group_id": "codeNet:p03112", "input_text": "const\n\ttmax=10000;\n\tinf=tmax*tmax*tmax*tmax;\ntype\n\tarr=array[0..100010] of int64;\n\tnode=record\n\t\t\t\tt1,t2,tans:int64;\n\t\t\tend;\nvar\n\ts1,s2:node;\n\ta,b:arr;\n\tn,m,q,i:longint;\n\tans,t,tt,x:int64;\nprocedure qsort(x:arr; l,r:longint);\nvar\n\tt,mid:int64;\n\ti,j:longint;\nbegin\n\ti:=l; j:=r; mid:=x[(l+r) div 2];\n\trepeat\n\t\twhile x[i]mid do dec(j);\n\t\tif i<=j then\n\t\tbegin\n\t\t\tt:=x[i]; x[i]:=x[j]; x[j]:=t;\n\t\t\tinc(i); dec(j);\n\t\tend;\n\tuntil i>j;\n\tif la[len] then exit(fill(a[len]));\n\tl:=1; r:=len;\n\twhile lmid do dec(j);\n\t\tif i<=j then\n\t\tbegin\n\t\t\tt:=x[i]; x[i]:=x[j]; x[j]:=t;\n\t\t\tinc(i); dec(j);\n\t\tend;\n\tuntil i>j;\n\tif la[len] then exit(fill(a[len]));\n\tl:=1; r:=len;\n\twhile lmid do dec(j);\n\t\tif i<=j then\n\t\tbegin\n\t\t\tt:=x[i]; x[i]:=x[j]; x[j]:=t;\n\t\t\tinc(i); dec(j);\n\t\tend;\n\tuntil i>j;\n\tif l=a[len] then\n\tbegin\n\t\tans.t1:=a[len];\n\t\tans.t2:=a[len];\n\t\tans.tans:=a[len];\n\t\texit(ans);\n\tend;\n\tl:=1; r:=len;\n\twhile la[r] then\n\tbegin\n\t\tans.t1:=a[r]; \n\t\tans.t2:=a[r+1];\n\t\tif abs(x-a[r])mid do dec(j);\n\t\tif i<=j then\n\t\tbegin\n\t\t\tt:=x[i]; x[i]:=x[j]; x[j]:=t;\n\t\t\tinc(i); dec(j);\n\t\tend;\n\tuntil i>j;\n\tif l=a[len] then\n\tbegin\n\t\tans.t1:=a[len];\n\t\tans.t2:=a[len];\n\t\tans.tans:=a[len];\n\t\texit(ans);\n\tend;\n\tl:=1; r:=len;\n\twhile la[r] then\n\tbegin\n\t\tans.t1:=a[r]; \n\t\tans.t2:=a[r+1];\n\t\tif abs(x-a[r])mid do dec(j);\n\t\tif i<=j then\n\t\tbegin\n\t\t\tt:=x[i]; x[i]:=x[j]; x[j]:=t;\n\t\t\tinc(i); dec(j);\n\t\tend;\n\tuntil i>j;\n\tif l=a[len] then\n\tbegin\n\t\tans.t1:=a[len];\n\t\tans.t2:=a[len];\n\t\tans.tans:=a[len];\n\t\texit(ans);\n\tend;\n\tl:=1; r:=len;\n\twhile la[r] then\n\tbegin\n\t\tans.t1:=a[r]; \n\t\tans.t2:=a[r+1];\n\t\tif abs(x-a[r])mid do dec(j);\n\t\tif i<=j then\n\t\tbegin\n\t\t\tt:=x[i]; x[i]:=x[j]; x[j]:=t;\n\t\t\tinc(i); dec(j);\n\t\tend;\n\tuntil i>j;\n\tif l=a[len] then\n\tbegin\n\t\tans.t1:=a[len];\n\t\tans.t2:=a[len];\n\t\tans.tans:=a[len];\n\t\texit(ans);\n\tend;\n\tl:=1; r:=len;\n\twhile la[r] then\n\tbegin\n\t\tans.t1:=a[r]; \n\t\tans.t2:=a[r+1];\n\t\tif abs(x-a[r])0) then\n\t\t\tbegin \n\t\t\t\tmin:=a[i];\n\t\t\t\tt:=i;\n\t\t\tend;\n\t\tfor i:=1 to n do\n\t\t\tif i<>t then \n\t\t\t\tif a[i]>0 then \n\t\t\t\tbegin\n\t\t\t\t\ta[i]:=a[i] mod min;\n\t\t\t\t\tif a[i]=0 then inc(sum);\n\t\t\t\tend;\n\tend;\n\twriteln(min)\nend.", "language": "Pascal", "metadata": {"date": 1550370385, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03127.html", "problem_id": "p03127", "resource_group": "low_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/Pascal/s978602756.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s978602756", "user_id": "u957998623"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "const\n\tinf=1000000000;\nvar\n\ta:array[0..100010] of longint;\n\tn,min,sum,i,t:longint;\nbegin\n\treadln(n);\n\tmin:=inf;\n\tfor i:=1 to n do read(a[i]);\n\tsum:=0;\n\twhile sum0) then\n\t\t\tbegin \n\t\t\t\tmin:=a[i];\n\t\t\t\tt:=i;\n\t\t\tend;\n\t\tfor i:=1 to n do\n\t\t\tif i<>t then \n\t\t\t\tif a[i]>0 then \n\t\t\t\tbegin\n\t\t\t\t\ta[i]:=a[i] mod min;\n\t\t\t\t\tif a[i]=0 then inc(sum);\n\t\t\t\tend;\n\tend;\n\twriteln(min)\nend.", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 18, "memory_kb": 512}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s984659389", "group_id": "codeNet:p03128", "input_text": "const\n\tnum:array[1..9] of longint=(2,5,5,4,5,6,3,7,6);\nvar\n\ta:array[-10..10] of longint;\n\tf:array[-1110..10010] of longint;\n\ti,j,n,m,t:longint;\nbegin\n\treadln(n,m);\n\tfor i:=1 to m do read(a[i]);\n\tfor i:=1 to m-1 do\n\t\tfor j:=1 to m-i do\n\t\t\tif a[j]f[j] then\n\t\t\t\tf[j]:=f[j-num[a[i]]]+1;\n\tfor i:=1 to m do\n\t\twhile (f[n-num[a[i]]]+1=f[n]) and (n>=num[a[i]]) do\n\t\tbegin\n\t\t\tn:=n-num[a[i]];\n\t\t\twrite(a[i]);\n\t\tend;\n\twriteln;\nend.", "language": "Pascal", "metadata": {"date": 1550376301, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03128.html", "problem_id": "p03128", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03128/input.txt", "sample_output_relpath": "derived/input_output/data/p03128/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03128/Pascal/s984659389.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s984659389", "user_id": "u957998623"}, "prompt_components": {"gold_output": "777773\n", "input_to_evaluate": "const\n\tnum:array[1..9] of longint=(2,5,5,4,5,6,3,7,6);\nvar\n\ta:array[-10..10] of longint;\n\tf:array[-1110..10010] of longint;\n\ti,j,n,m,t:longint;\nbegin\n\treadln(n,m);\n\tfor i:=1 to m do read(a[i]);\n\tfor i:=1 to m-1 do\n\t\tfor j:=1 to m-i do\n\t\t\tif a[j]f[j] then\n\t\t\t\tf[j]:=f[j-num[a[i]]]+1;\n\tfor i:=1 to m do\n\t\twhile (f[n-num[a[i]]]+1=f[n]) and (n>=num[a[i]]) do\n\t\tbegin\n\t\t\tn:=n-num[a[i]];\n\t\t\twrite(a[i]);\n\t\tend;\n\twriteln;\nend.", "problem_context": "Score : 400 points\n\nProblem Statement\n\nFind the largest integer that can be formed with exactly N matchsticks, under the following conditions:\n\nEvery digit in the integer must be one of the digits A_1, A_2, ..., A_M (1 \\leq A_i \\leq 9).\n\nThe number of matchsticks used to form digits 1, 2, 3, 4, 5, 6, 7, 8, 9 should be 2, 5, 5, 4, 5, 6, 3, 7, 6, respectively.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^4\n\n1 \\leq M \\leq 9\n\n1 \\leq A_i \\leq 9\n\nA_i are all different.\n\nThere exists an integer that can be formed by exactly N matchsticks under the conditions.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nA_1 A_2 ... A_M\n\nOutput\n\nPrint the largest integer that can be formed with exactly N matchsticks under the conditions in the problem statement.\n\nSample Input 1\n\n20 4\n3 7 8 4\n\nSample Output 1\n\n777773\n\nThe integer 777773 can be formed with 3 + 3 + 3 + 3 + 3 + 5 = 20 matchsticks, and this is the largest integer that can be formed by 20 matchsticks under the conditions.\n\nSample Input 2\n\n101 9\n9 8 7 6 5 4 3 2 1\n\nSample Output 2\n\n71111111111111111111111111111111111111111111111111\n\nThe output may not fit into a 64-bit integer type.\n\nSample Input 3\n\n15 3\n5 4 6\n\nSample Output 3\n\n654", "sample_input": "20 4\n3 7 8 4\n"}, "reference_outputs": ["777773\n"], "source_document_id": "p03128", "source_text": "Score : 400 points\n\nProblem Statement\n\nFind the largest integer that can be formed with exactly N matchsticks, under the following conditions:\n\nEvery digit in the integer must be one of the digits A_1, A_2, ..., A_M (1 \\leq A_i \\leq 9).\n\nThe number of matchsticks used to form digits 1, 2, 3, 4, 5, 6, 7, 8, 9 should be 2, 5, 5, 4, 5, 6, 3, 7, 6, respectively.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^4\n\n1 \\leq M \\leq 9\n\n1 \\leq A_i \\leq 9\n\nA_i are all different.\n\nThere exists an integer that can be formed by exactly N matchsticks under the conditions.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nA_1 A_2 ... A_M\n\nOutput\n\nPrint the largest integer that can be formed with exactly N matchsticks under the conditions in the problem statement.\n\nSample Input 1\n\n20 4\n3 7 8 4\n\nSample Output 1\n\n777773\n\nThe integer 777773 can be formed with 3 + 3 + 3 + 3 + 3 + 5 = 20 matchsticks, and this is the largest integer that can be formed by 20 matchsticks under the conditions.\n\nSample Input 2\n\n101 9\n9 8 7 6 5 4 3 2 1\n\nSample Output 2\n\n71111111111111111111111111111111111111111111111111\n\nThe output may not fit into a 64-bit integer type.\n\nSample Input 3\n\n15 3\n5 4 6\n\nSample Output 3\n\n654", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 604, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s919847341", "group_id": "codeNet:p03128", "input_text": "const\n\tnum:array[1..9] of longint=(2,5,5,4,5,6,3,7,6);\nvar\n\ta:array[-10..10] of longint;\n\tf:array[-1110..10010] of longint;\n\ti,j,n,m,t:longint;\nbegin\n\treadln(n,m);\n\tfor i:=1 to m do read(a[i]);\n\tfor i:=1 to m-1 do\n\t\tfor j:=1 to m-i do\n\t\t\tif a[j]f[j] then\n\t\t\t\tf[j]:=f[j-num[a[i]]]+1;\n\tfor i:=1 to m do\n\t\twhile (f[n-num[a[i]]]+1=f[n]) and (n>=num[a[i]]) do\n\t\tbegin\n\t\t\tif (f[n]=1) and (n<>num[a[i]]) then break;\n\t\t\tn:=n-num[a[i]];\n\t\t\twrite(a[i]);\n\t\tend;\n\twriteln;\nend.", "language": "Pascal", "metadata": {"date": 1550374737, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03128.html", "problem_id": "p03128", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03128/input.txt", "sample_output_relpath": "derived/input_output/data/p03128/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03128/Pascal/s919847341.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s919847341", "user_id": "u957998623"}, "prompt_components": {"gold_output": "777773\n", "input_to_evaluate": "const\n\tnum:array[1..9] of longint=(2,5,5,4,5,6,3,7,6);\nvar\n\ta:array[-10..10] of longint;\n\tf:array[-1110..10010] of longint;\n\ti,j,n,m,t:longint;\nbegin\n\treadln(n,m);\n\tfor i:=1 to m do read(a[i]);\n\tfor i:=1 to m-1 do\n\t\tfor j:=1 to m-i do\n\t\t\tif a[j]f[j] then\n\t\t\t\tf[j]:=f[j-num[a[i]]]+1;\n\tfor i:=1 to m do\n\t\twhile (f[n-num[a[i]]]+1=f[n]) and (n>=num[a[i]]) do\n\t\tbegin\n\t\t\tif (f[n]=1) and (n<>num[a[i]]) then break;\n\t\t\tn:=n-num[a[i]];\n\t\t\twrite(a[i]);\n\t\tend;\n\twriteln;\nend.", "problem_context": "Score : 400 points\n\nProblem Statement\n\nFind the largest integer that can be formed with exactly N matchsticks, under the following conditions:\n\nEvery digit in the integer must be one of the digits A_1, A_2, ..., A_M (1 \\leq A_i \\leq 9).\n\nThe number of matchsticks used to form digits 1, 2, 3, 4, 5, 6, 7, 8, 9 should be 2, 5, 5, 4, 5, 6, 3, 7, 6, respectively.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^4\n\n1 \\leq M \\leq 9\n\n1 \\leq A_i \\leq 9\n\nA_i are all different.\n\nThere exists an integer that can be formed by exactly N matchsticks under the conditions.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nA_1 A_2 ... A_M\n\nOutput\n\nPrint the largest integer that can be formed with exactly N matchsticks under the conditions in the problem statement.\n\nSample Input 1\n\n20 4\n3 7 8 4\n\nSample Output 1\n\n777773\n\nThe integer 777773 can be formed with 3 + 3 + 3 + 3 + 3 + 5 = 20 matchsticks, and this is the largest integer that can be formed by 20 matchsticks under the conditions.\n\nSample Input 2\n\n101 9\n9 8 7 6 5 4 3 2 1\n\nSample Output 2\n\n71111111111111111111111111111111111111111111111111\n\nThe output may not fit into a 64-bit integer type.\n\nSample Input 3\n\n15 3\n5 4 6\n\nSample Output 3\n\n654", "sample_input": "20 4\n3 7 8 4\n"}, "reference_outputs": ["777773\n"], "source_document_id": "p03128", "source_text": "Score : 400 points\n\nProblem Statement\n\nFind the largest integer that can be formed with exactly N matchsticks, under the following conditions:\n\nEvery digit in the integer must be one of the digits A_1, A_2, ..., A_M (1 \\leq A_i \\leq 9).\n\nThe number of matchsticks used to form digits 1, 2, 3, 4, 5, 6, 7, 8, 9 should be 2, 5, 5, 4, 5, 6, 3, 7, 6, respectively.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^4\n\n1 \\leq M \\leq 9\n\n1 \\leq A_i \\leq 9\n\nA_i are all different.\n\nThere exists an integer that can be formed by exactly N matchsticks under the conditions.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nA_1 A_2 ... A_M\n\nOutput\n\nPrint the largest integer that can be formed with exactly N matchsticks under the conditions in the problem statement.\n\nSample Input 1\n\n20 4\n3 7 8 4\n\nSample Output 1\n\n777773\n\nThe integer 777773 can be formed with 3 + 3 + 3 + 3 + 3 + 5 = 20 matchsticks, and this is the largest integer that can be formed by 20 matchsticks under the conditions.\n\nSample Input 2\n\n101 9\n9 8 7 6 5 4 3 2 1\n\nSample Output 2\n\n71111111111111111111111111111111111111111111111111\n\nThe output may not fit into a 64-bit integer type.\n\nSample Input 3\n\n15 3\n5 4 6\n\nSample Output 3\n\n654", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 627, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s570911579", "group_id": "codeNet:p03128", "input_text": "const\n\tnum:array[1..9] of longint=(2,5,5,4,5,6,3,7,6);\nvar\n\ta:array[-10..10] of longint;\n\tf:array[-1110..10010] of longint;\n\ti,j,n,m,t:longint;\nbegin\n\treadln(n,m);\n\tfor i:=1 to m do read(a[i]);\n\tfor i:=1 to m-1 do\n\t\tfor j:=1 to m-i do\n\t\t\tif a[j]f[j] then\n\t\t\t\tf[j]:=f[j-num[a[i]]]+1;\n\tfor i:=1 to m do\n\tbegin\n\t\tif f[n]=1 then\n\t\t\tif num[a[i]]=n then\n\t\t\tbegin\n\t\t\t\twrite(a[i]);\n\t\t\t\tbreak;\n\t\t\tend\n\t\t\telse continue;\n\t\twhile (f[n-num[a[i]]]+1=f[n]) and (n>=num[a[i]]) do\n\t\tbegin\n\t\t\tn:=n-num[a[i]];\n\t\t\twrite(a[i]);\n\t\t\tif (f[n]=1) and (n<>num[a[i]]) then break;\n\t\tend;\n\tend;\n\twriteln;\nend.", "language": "Pascal", "metadata": {"date": 1550374599, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03128.html", "problem_id": "p03128", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03128/input.txt", "sample_output_relpath": "derived/input_output/data/p03128/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03128/Pascal/s570911579.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s570911579", "user_id": "u957998623"}, "prompt_components": {"gold_output": "777773\n", "input_to_evaluate": "const\n\tnum:array[1..9] of longint=(2,5,5,4,5,6,3,7,6);\nvar\n\ta:array[-10..10] of longint;\n\tf:array[-1110..10010] of longint;\n\ti,j,n,m,t:longint;\nbegin\n\treadln(n,m);\n\tfor i:=1 to m do read(a[i]);\n\tfor i:=1 to m-1 do\n\t\tfor j:=1 to m-i do\n\t\t\tif a[j]f[j] then\n\t\t\t\tf[j]:=f[j-num[a[i]]]+1;\n\tfor i:=1 to m do\n\tbegin\n\t\tif f[n]=1 then\n\t\t\tif num[a[i]]=n then\n\t\t\tbegin\n\t\t\t\twrite(a[i]);\n\t\t\t\tbreak;\n\t\t\tend\n\t\t\telse continue;\n\t\twhile (f[n-num[a[i]]]+1=f[n]) and (n>=num[a[i]]) do\n\t\tbegin\n\t\t\tn:=n-num[a[i]];\n\t\t\twrite(a[i]);\n\t\t\tif (f[n]=1) and (n<>num[a[i]]) then break;\n\t\tend;\n\tend;\n\twriteln;\nend.", "problem_context": "Score : 400 points\n\nProblem Statement\n\nFind the largest integer that can be formed with exactly N matchsticks, under the following conditions:\n\nEvery digit in the integer must be one of the digits A_1, A_2, ..., A_M (1 \\leq A_i \\leq 9).\n\nThe number of matchsticks used to form digits 1, 2, 3, 4, 5, 6, 7, 8, 9 should be 2, 5, 5, 4, 5, 6, 3, 7, 6, respectively.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^4\n\n1 \\leq M \\leq 9\n\n1 \\leq A_i \\leq 9\n\nA_i are all different.\n\nThere exists an integer that can be formed by exactly N matchsticks under the conditions.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nA_1 A_2 ... A_M\n\nOutput\n\nPrint the largest integer that can be formed with exactly N matchsticks under the conditions in the problem statement.\n\nSample Input 1\n\n20 4\n3 7 8 4\n\nSample Output 1\n\n777773\n\nThe integer 777773 can be formed with 3 + 3 + 3 + 3 + 3 + 5 = 20 matchsticks, and this is the largest integer that can be formed by 20 matchsticks under the conditions.\n\nSample Input 2\n\n101 9\n9 8 7 6 5 4 3 2 1\n\nSample Output 2\n\n71111111111111111111111111111111111111111111111111\n\nThe output may not fit into a 64-bit integer type.\n\nSample Input 3\n\n15 3\n5 4 6\n\nSample Output 3\n\n654", "sample_input": "20 4\n3 7 8 4\n"}, "reference_outputs": ["777773\n"], "source_document_id": "p03128", "source_text": "Score : 400 points\n\nProblem Statement\n\nFind the largest integer that can be formed with exactly N matchsticks, under the following conditions:\n\nEvery digit in the integer must be one of the digits A_1, A_2, ..., A_M (1 \\leq A_i \\leq 9).\n\nThe number of matchsticks used to form digits 1, 2, 3, 4, 5, 6, 7, 8, 9 should be 2, 5, 5, 4, 5, 6, 3, 7, 6, respectively.\n\nConstraints\n\nAll values in input are integers.\n\n2 \\leq N \\leq 10^4\n\n1 \\leq M \\leq 9\n\n1 \\leq A_i \\leq 9\n\nA_i are all different.\n\nThere exists an integer that can be formed by exactly N matchsticks under the conditions.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nA_1 A_2 ... A_M\n\nOutput\n\nPrint the largest integer that can be formed with exactly N matchsticks under the conditions in the problem statement.\n\nSample Input 1\n\n20 4\n3 7 8 4\n\nSample Output 1\n\n777773\n\nThe integer 777773 can be formed with 3 + 3 + 3 + 3 + 3 + 5 = 20 matchsticks, and this is the largest integer that can be formed by 20 matchsticks under the conditions.\n\nSample Input 2\n\n101 9\n9 8 7 6 5 4 3 2 1\n\nSample Output 2\n\n71111111111111111111111111111111111111111111111111\n\nThe output may not fit into a 64-bit integer type.\n\nSample Input 3\n\n15 3\n5 4 6\n\nSample Output 3\n\n654", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 742, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s021799583", "group_id": "codeNet:p03129", "input_text": "var n,k:integer;begin readln(n,k);if(n>=2*k-1)then writeln('YES') else writeln('NO');end.", "language": "Pascal", "metadata": {"date": 1597552157, "filename_ext": "pas", "original_language": "Pascal (FPC 3.0.4)", "problem_description_relpath": "problem_descriptions/p03129.html", "problem_id": "p03129", "resource_group": "low_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/Pascal/s021799583.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s021799583", "user_id": "u984276646"}, "prompt_components": {"gold_output": "YES\n", "input_to_evaluate": "var n,k:integer;begin readln(n,k);if(n>=2*k-1)then writeln('YES') else writeln('NO');end.", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 89, "cpu_time_ms": 2, "memory_kb": 1348}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s915930676", "group_id": "codeNet:p03132", "input_text": "var\n\tn,i,e,m,fz,fe,fo,se,sz:longint;\n\nbegin\n\treadln(n);\n\tfz := 0;\n\tfe := 0;\n\tfo := 0;\n\tse := 0;\n\tfz := 0;\n\tfor i := 1 to n do\n\tbegin\n\t\treadln(e);\n\t\tm := fz;\n\t\tfz := m + e;\n\t\t\n\t\tif fe < m then\n\t\t\tm := fe;\n\t\tif e = 0 then\n\t\t\tfe := m + 2\n\t\telse\n\t\t\tfe := m + (e and 1);\n\t\t\n\t\tif fo < m then\n\t\t\tm := fo;\n\t\tfo := m + ((e + 1) and 1);\n\t\t\n\t\tif se < m then\n\t\t\tm := se;\n\t\tif e = 0 then\n\t\t\tse := m + 2\n\t\telse\n\t\t\tse := m + (e and 1);\n\t\t\n\t\tif sz < m then\n\t\t\tm := sz;\n\t\tsz := m + e;\n\tend;\n\tm := fz;\n\tif fe < m then\n\t\tm := fe;\n\tif fo < m then\n\t\tm := fo;\n\tif se < m then\n\t\tm := se;\t\n\tif sz < m then\n\t\tm := sz;\n\twriteln(m);\nend.\n", "language": "Pascal", "metadata": {"date": 1550137679, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03132.html", "problem_id": "p03132", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03132/input.txt", "sample_output_relpath": "derived/input_output/data/p03132/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03132/Pascal/s915930676.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s915930676", "user_id": "u564847900"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "var\n\tn,i,e,m,fz,fe,fo,se,sz:longint;\n\nbegin\n\treadln(n);\n\tfz := 0;\n\tfe := 0;\n\tfo := 0;\n\tse := 0;\n\tfz := 0;\n\tfor i := 1 to n do\n\tbegin\n\t\treadln(e);\n\t\tm := fz;\n\t\tfz := m + e;\n\t\t\n\t\tif fe < m then\n\t\t\tm := fe;\n\t\tif e = 0 then\n\t\t\tfe := m + 2\n\t\telse\n\t\t\tfe := m + (e and 1);\n\t\t\n\t\tif fo < m then\n\t\t\tm := fo;\n\t\tfo := m + ((e + 1) and 1);\n\t\t\n\t\tif se < m then\n\t\t\tm := se;\n\t\tif e = 0 then\n\t\t\tse := m + 2\n\t\telse\n\t\t\tse := m + (e and 1);\n\t\t\n\t\tif sz < m then\n\t\t\tm := sz;\n\t\tsz := m + e;\n\tend;\n\tm := fz;\n\tif fe < m then\n\t\tm := fe;\n\tif fo < m then\n\t\tm := fo;\n\tif se < m then\n\t\tm := se;\t\n\tif sz < m then\n\t\tm := sz;\n\twriteln(m);\nend.\n", "problem_context": "Score : 600 points\n\nProblem Statement\n\nSnuke stands on a number line. He has L ears, and he will walk along the line continuously under the following conditions:\n\nHe never visits a point with coordinate less than 0, or a point with coordinate greater than L.\n\nHe starts walking at a point with integer coordinate, and also finishes walking at a point with integer coordinate.\n\nHe only changes direction at a point with integer coordinate.\n\nEach time when Snuke passes a point with coordinate i-0.5, where i is an integer, he put a stone in his i-th ear.\n\nAfter Snuke finishes walking, Ringo will repeat the following operations in some order so that, for each i, Snuke's i-th ear contains A_i stones:\n\nPut a stone in one of Snuke's ears.\n\nRemove a stone from one of Snuke's ears.\n\nFind the minimum number of operations required when Ringo can freely decide how Snuke walks.\n\nConstraints\n\n1 \\leq L \\leq 2\\times 10^5\n\n0 \\leq A_i \\leq 10^9(1\\leq i\\leq L)\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nL\nA_1\n:\nA_L\n\nOutput\n\nPrint the minimum number of operations required when Ringo can freely decide how Snuke walks.\n\nSample Input 1\n\n4\n1\n0\n2\n3\n\nSample Output 1\n\n1\n\nAssume that Snuke walks as follows:\n\nHe starts walking at coordinate 3 and finishes walking at coordinate 4, visiting coordinates 3,4,3,2,3,4 in this order.\n\nThen, Snuke's four ears will contain 0,0,2,3 stones, respectively.\nRingo can satisfy the requirement by putting one stone in the first ear.\n\nSample Input 2\n\n8\n2\n0\n0\n2\n1\n3\n4\n1\n\nSample Output 2\n\n3\n\nSample Input 3\n\n7\n314159265\n358979323\n846264338\n327950288\n419716939\n937510582\n0\n\nSample Output 3\n\n1", "sample_input": "4\n1\n0\n2\n3\n"}, "reference_outputs": ["1\n"], "source_document_id": "p03132", "source_text": "Score : 600 points\n\nProblem Statement\n\nSnuke stands on a number line. He has L ears, and he will walk along the line continuously under the following conditions:\n\nHe never visits a point with coordinate less than 0, or a point with coordinate greater than L.\n\nHe starts walking at a point with integer coordinate, and also finishes walking at a point with integer coordinate.\n\nHe only changes direction at a point with integer coordinate.\n\nEach time when Snuke passes a point with coordinate i-0.5, where i is an integer, he put a stone in his i-th ear.\n\nAfter Snuke finishes walking, Ringo will repeat the following operations in some order so that, for each i, Snuke's i-th ear contains A_i stones:\n\nPut a stone in one of Snuke's ears.\n\nRemove a stone from one of Snuke's ears.\n\nFind the minimum number of operations required when Ringo can freely decide how Snuke walks.\n\nConstraints\n\n1 \\leq L \\leq 2\\times 10^5\n\n0 \\leq A_i \\leq 10^9(1\\leq i\\leq L)\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nL\nA_1\n:\nA_L\n\nOutput\n\nPrint the minimum number of operations required when Ringo can freely decide how Snuke walks.\n\nSample Input 1\n\n4\n1\n0\n2\n3\n\nSample Output 1\n\n1\n\nAssume that Snuke walks as follows:\n\nHe starts walking at coordinate 3 and finishes walking at coordinate 4, visiting coordinates 3,4,3,2,3,4 in this order.\n\nThen, Snuke's four ears will contain 0,0,2,3 stones, respectively.\nRingo can satisfy the requirement by putting one stone in the first ear.\n\nSample Input 2\n\n8\n2\n0\n0\n2\n1\n3\n4\n1\n\nSample Output 2\n\n3\n\nSample Input 3\n\n7\n314159265\n358979323\n846264338\n327950288\n419716939\n937510582\n0\n\nSample Output 3\n\n1", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 611, "cpu_time_ms": 33, "memory_kb": 128}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s549921672", "group_id": "codeNet:p03139", "input_text": "var n,a,b,left,right:integer;\nbegin\nreadln(n,a,b);\nif(a+b>=n)then left:=a+b-n else left:=0;\nif(a>=b)then right:=b else right:=a;\nwriteln(right,' ',left);\nend.", "language": "Pascal", "metadata": {"date": 1599235617, "filename_ext": "pas", "original_language": "Pascal (FPC 3.0.4)", "problem_description_relpath": "problem_descriptions/p03139.html", "problem_id": "p03139", "resource_group": "low_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/Pascal/s549921672.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s549921672", "user_id": "u984276646"}, "prompt_components": {"gold_output": "3 0\n", "input_to_evaluate": "var n,a,b,left,right:integer;\nbegin\nreadln(n,a,b);\nif(a+b>=n)then left:=a+b-n else left:=0;\nif(a>=b)then right:=b else right:=a;\nwriteln(right,' ',left);\nend.", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 4, "memory_kb": 1348}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s765401131", "group_id": "codeNet:p03149", "input_text": "var a:array[1..4] of integer;n1,n2,n3,n4,s,tmp,i,j:integer;\nbegin\nfor i:=1 to 4 do begin\nread(a[i]);\nend;\nfor i:=1 to 3 do begin\nif(a[i]>a[i+1])then begin\nj:=i+1;\nwhile(j>1)do begin\nif(a[j-1]>a[j])then begin\ntmp:=a[j];\na[j]:=a[j-1];\na[j-1]:=tmp;\nend;\nj:=j-1;\nend;\nend;\nend;\ns:=1000*a[1]+100*a[2]+10*a[3]+a[4];\nif(s=1479)then writeln('YES') else writeln('NO');\nend.", "language": "Pascal", "metadata": {"date": 1599951017, "filename_ext": "pas", "original_language": "Pascal (FPC 3.0.4)", "problem_description_relpath": "problem_descriptions/p03149.html", "problem_id": "p03149", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03149/input.txt", "sample_output_relpath": "derived/input_output/data/p03149/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03149/Pascal/s765401131.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s765401131", "user_id": "u984276646"}, "prompt_components": {"gold_output": "YES\n", "input_to_evaluate": "var a:array[1..4] of integer;n1,n2,n3,n4,s,tmp,i,j:integer;\nbegin\nfor i:=1 to 4 do begin\nread(a[i]);\nend;\nfor i:=1 to 3 do begin\nif(a[i]>a[i+1])then begin\nj:=i+1;\nwhile(j>1)do begin\nif(a[j-1]>a[j])then begin\ntmp:=a[j];\na[j]:=a[j-1];\na[j-1]:=tmp;\nend;\nj:=j-1;\nend;\nend;\nend;\ns:=1000*a[1]+100*a[2]+10*a[3]+a[4];\nif(s=1479)then writeln('YES') else writeln('NO');\nend.", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou are given four digits N_1, N_2, N_3 and N_4. Determine if these can be arranged into the sequence of digits \"1974\".\n\nConstraints\n\n0 \\leq N_1, N_2, N_3, N_4 \\leq 9\n\nN_1, N_2, N_3 and N_4 are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN_1 N_2 N_3 N_4\n\nOutput\n\nIf N_1, N_2, N_3 and N_4 can be arranged into the sequence of digits \"1974\", print YES; if they cannot, print NO.\n\nSample Input 1\n\n1 7 9 4\n\nSample Output 1\n\nYES\n\nWe can get 1974 by swapping N_2 and N_3.\n\nSample Input 2\n\n1 9 7 4\n\nSample Output 2\n\nYES\n\nWe already have 1974 before doing anything.\n\nSample Input 3\n\n1 2 9 1\n\nSample Output 3\n\nNO\n\nSample Input 4\n\n4 9 0 8\n\nSample Output 4\n\nNO", "sample_input": "1 7 9 4\n"}, "reference_outputs": ["YES\n"], "source_document_id": "p03149", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou are given four digits N_1, N_2, N_3 and N_4. Determine if these can be arranged into the sequence of digits \"1974\".\n\nConstraints\n\n0 \\leq N_1, N_2, N_3, N_4 \\leq 9\n\nN_1, N_2, N_3 and N_4 are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN_1 N_2 N_3 N_4\n\nOutput\n\nIf N_1, N_2, N_3 and N_4 can be arranged into the sequence of digits \"1974\", print YES; if they cannot, print NO.\n\nSample Input 1\n\n1 7 9 4\n\nSample Output 1\n\nYES\n\nWe can get 1974 by swapping N_2 and N_3.\n\nSample Input 2\n\n1 9 7 4\n\nSample Output 2\n\nYES\n\nWe already have 1974 before doing anything.\n\nSample Input 3\n\n1 2 9 1\n\nSample Output 3\n\nNO\n\nSample Input 4\n\n4 9 0 8\n\nSample Output 4\n\nNO", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 5, "memory_kb": 1364}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s938427670", "group_id": "codeNet:p03158", "input_text": "var\n a,b:array[0..100002]of longint;\n i,j,k,n,m:longint;\n p,q,ans,anq:qword;\nfunction max(a,b:longint):longint;\nbegin\n if abs(a)<=b then exit(a)\n else exit(b);\nend;\nprocedure zx(s:longint);\nvar\n i,j,p,q,t,u,o:longint;\n f:array[0..100002]of longint;\nbegin\n fillchar(f,sizeof(f),0);\n for i:=1 to n do\n if a[i]>s then break;\n p:=i-1;\n q:=i;\n t:=n;\n j:=n div 2;\n while j>0 do\n begin\n dec(j);\n while f[t]=2 do dec(t);\n f[t]:=1;\n dec(t);\n if (p=0) then begin ans:=a[q]+ans; f[q]:=2; inc(q); end\n else if f[q]=1 then begin if f[p]=1 then begin ans:=a[p-1]+ans; f[p-1]:=2; dec(p,3); end else begin ans:=a[p]+ans; f[p]:=2; dec(p,2); end; end\n else if f[p]=1 then begin ans:=a[p-1]+ans; f[p-1]:=2; dec(p,3); end\n else if s-a[p]<=a[q]-s then\n begin\n ans:=a[p]+ans;\n dec(p);\n f[p]:=2; \n end else\n begin\n ans:=a[q]+ans;\n inc(q);\n f[q]:=2; \n end;\n end;\nend;\nbegin\n readln(n,m);\n for i:=1 to n do begin read(a[i]); anq:=a[i]+anq; end;\n for i:=1 to m do\n begin\n readln(b[i]);\n ans:=0;\n zx(b[i]);\n writeln(anq-ans);\n end;\nend.\n", "language": "Pascal", "metadata": {"date": 1547330168, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03158.html", "problem_id": "p03158", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03158/input.txt", "sample_output_relpath": "derived/input_output/data/p03158/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03158/Pascal/s938427670.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s938427670", "user_id": "u223928734"}, "prompt_components": {"gold_output": "31\n31\n27\n23\n23\n", "input_to_evaluate": "var\n a,b:array[0..100002]of longint;\n i,j,k,n,m:longint;\n p,q,ans,anq:qword;\nfunction max(a,b:longint):longint;\nbegin\n if abs(a)<=b then exit(a)\n else exit(b);\nend;\nprocedure zx(s:longint);\nvar\n i,j,p,q,t,u,o:longint;\n f:array[0..100002]of longint;\nbegin\n fillchar(f,sizeof(f),0);\n for i:=1 to n do\n if a[i]>s then break;\n p:=i-1;\n q:=i;\n t:=n;\n j:=n div 2;\n while j>0 do\n begin\n dec(j);\n while f[t]=2 do dec(t);\n f[t]:=1;\n dec(t);\n if (p=0) then begin ans:=a[q]+ans; f[q]:=2; inc(q); end\n else if f[q]=1 then begin if f[p]=1 then begin ans:=a[p-1]+ans; f[p-1]:=2; dec(p,3); end else begin ans:=a[p]+ans; f[p]:=2; dec(p,2); end; end\n else if f[p]=1 then begin ans:=a[p-1]+ans; f[p-1]:=2; dec(p,3); end\n else if s-a[p]<=a[q]-s then\n begin\n ans:=a[p]+ans;\n dec(p);\n f[p]:=2; \n end else\n begin\n ans:=a[q]+ans;\n inc(q);\n f[q]:=2; \n end;\n end;\nend;\nbegin\n readln(n,m);\n for i:=1 to n do begin read(a[i]); anq:=a[i]+anq; end;\n for i:=1 to m do\n begin\n readln(b[i]);\n ans:=0;\n zx(b[i]);\n writeln(anq-ans);\n end;\nend.\n", "problem_context": "Score : 500 points\n\nProblem Statement\n\nThere are N cards. The i-th card has an integer A_i written on it.\nFor any two cards, the integers on those cards are different.\n\nUsing these cards, Takahashi and Aoki will play the following game:\n\nAoki chooses an integer x.\n\nStarting from Takahashi, the two players alternately take a card. The card should be chosen in the following manner:\n\nTakahashi should take the card with the largest integer among the remaining card.\n\nAoki should take the card with the integer closest to x among the remaining card. If there are multiple such cards, he should take the card with the smallest integer among those cards.\n\nThe game ends when there is no card remaining.\n\nYou are given Q candidates for the value of x: X_1, X_2, ..., X_Q.\nFor each i (1 \\leq i \\leq Q), find the sum of the integers written on the cards that Takahashi will take if Aoki chooses x = X_i.\n\nConstraints\n\n2 \\leq N \\leq 100 000\n\n1 \\leq Q \\leq 100 000\n\n1 \\leq A_1 < A_2 < ... < A_N \\leq 10^9\n\n1 \\leq X_i \\leq 10^9 (1 \\leq i \\leq Q)\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN Q\nA_1 A_2 ... A_N\nX_1\nX_2\n:\nX_Q\n\nOutput\n\nPrint Q lines. The i-th line (1 \\leq i \\leq Q) should contain the answer for x = X_i.\n\nSample Input 1\n\n5 5\n3 5 7 11 13\n1\n4\n9\n10\n13\n\nSample Output 1\n\n31\n31\n27\n23\n23\n\nFor example, when x = X_3(= 9), the game proceeds as follows:\n\nTakahashi takes the card with 13.\n\nAoki takes the card with 7.\n\nTakahashi takes the card with 11.\n\nAoki takes the card with 5.\n\nTakahashi takes the card with 3.\n\nThus, 13 + 11 + 3 = 27 should be printed on the third line.\n\nSample Input 2\n\n4 3\n10 20 30 40\n2\n34\n34\n\nSample Output 2\n\n70\n60\n60", "sample_input": "5 5\n3 5 7 11 13\n1\n4\n9\n10\n13\n"}, "reference_outputs": ["31\n31\n27\n23\n23\n"], "source_document_id": "p03158", "source_text": "Score : 500 points\n\nProblem Statement\n\nThere are N cards. The i-th card has an integer A_i written on it.\nFor any two cards, the integers on those cards are different.\n\nUsing these cards, Takahashi and Aoki will play the following game:\n\nAoki chooses an integer x.\n\nStarting from Takahashi, the two players alternately take a card. The card should be chosen in the following manner:\n\nTakahashi should take the card with the largest integer among the remaining card.\n\nAoki should take the card with the integer closest to x among the remaining card. If there are multiple such cards, he should take the card with the smallest integer among those cards.\n\nThe game ends when there is no card remaining.\n\nYou are given Q candidates for the value of x: X_1, X_2, ..., X_Q.\nFor each i (1 \\leq i \\leq Q), find the sum of the integers written on the cards that Takahashi will take if Aoki chooses x = X_i.\n\nConstraints\n\n2 \\leq N \\leq 100 000\n\n1 \\leq Q \\leq 100 000\n\n1 \\leq A_1 < A_2 < ... < A_N \\leq 10^9\n\n1 \\leq X_i \\leq 10^9 (1 \\leq i \\leq Q)\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN Q\nA_1 A_2 ... A_N\nX_1\nX_2\n:\nX_Q\n\nOutput\n\nPrint Q lines. The i-th line (1 \\leq i \\leq Q) should contain the answer for x = X_i.\n\nSample Input 1\n\n5 5\n3 5 7 11 13\n1\n4\n9\n10\n13\n\nSample Output 1\n\n31\n31\n27\n23\n23\n\nFor example, when x = X_3(= 9), the game proceeds as follows:\n\nTakahashi takes the card with 13.\n\nAoki takes the card with 7.\n\nTakahashi takes the card with 11.\n\nAoki takes the card with 5.\n\nTakahashi takes the card with 3.\n\nThus, 13 + 11 + 3 = 27 should be printed on the third line.\n\nSample Input 2\n\n4 3\n10 20 30 40\n2\n34\n34\n\nSample Output 2\n\n70\n60\n60", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 2103, "memory_kb": 1792}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s047936902", "group_id": "codeNet:p03162", "input_text": "uses math; \nvar\n n, i, j, k, ans : longint;\n a, dp : array[1..100005, 1..5] of longint;\n\nbegin\n readln(n);\n for i := 1 to n do\n for j := 1 to 3 do read(a[i, j]);\n fillchar(dp, sizeof(dp), 255);\n for i := 1 to 3 do dp[1, i] := a[1, i];\n for i := 2 to n do\n for j := 1 to 3 do\n for k := 1 to 3 do\n if (j <> k) then dp[i, j] := max(dp[i, j], dp[i - 1, k] + a[i, j]);\n ans := -1;\n for i := 1 to 3 do ans := max(ans, dp[n, i]);\n writeln(ans);\nend.", "language": "Pascal", "metadata": {"date": 1600121008, "filename_ext": "pas", "original_language": "Pascal (FPC 3.0.4)", "problem_description_relpath": "problem_descriptions/p03162.html", "problem_id": "p03162", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03162/input.txt", "sample_output_relpath": "derived/input_output/data/p03162/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03162/Pascal/s047936902.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s047936902", "user_id": "u366795445"}, "prompt_components": {"gold_output": "210\n", "input_to_evaluate": "uses math; \nvar\n n, i, j, k, ans : longint;\n a, dp : array[1..100005, 1..5] of longint;\n\nbegin\n readln(n);\n for i := 1 to n do\n for j := 1 to 3 do read(a[i, j]);\n fillchar(dp, sizeof(dp), 255);\n for i := 1 to 3 do dp[1, i] := a[1, i];\n for i := 2 to n do\n for j := 1 to 3 do\n for k := 1 to 3 do\n if (j <> k) then dp[i, j] := max(dp[i, j], dp[i - 1, k] + a[i, j]);\n ans := -1;\n for i := 1 to 3 do ans := max(ans, dp[n, i]);\n writeln(ans);\nend.", "problem_context": "Score : 100 points\n\nProblem Statement\n\nTaro's summer vacation starts tomorrow, and he has decided to make plans for it now.\n\nThe vacation consists of N days.\nFor each i (1 \\leq i \\leq N), Taro will choose one of the following activities and do it on the i-th day:\n\nA: Swim in the sea. Gain a_i points of happiness.\n\nB: Catch bugs in the mountains. Gain b_i points of happiness.\n\nC: Do homework at home. Gain c_i points of happiness.\n\nAs Taro gets bored easily, he cannot do the same activities for two or more consecutive days.\n\nFind the maximum possible total points of happiness that Taro gains.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 10^5\n\n1 \\leq a_i, b_i, c_i \\leq 10^4\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_1 b_1 c_1\na_2 b_2 c_2\n:\na_N b_N c_N\n\nOutput\n\nPrint the maximum possible total points of happiness that Taro gains.\n\nSample Input 1\n\n3\n10 40 70\n20 50 80\n30 60 90\n\nSample Output 1\n\n210\n\nIf Taro does activities in the order C, B, C, he will gain 70 + 50 + 90 = 210 points of happiness.\n\nSample Input 2\n\n1\n100 10 1\n\nSample Output 2\n\n100\n\nSample Input 3\n\n7\n6 7 8\n8 8 3\n2 5 2\n7 8 6\n4 6 8\n2 3 4\n7 5 1\n\nSample Output 3\n\n46\n\nTaro should do activities in the order C, A, B, A, C, B, A.", "sample_input": "3\n10 40 70\n20 50 80\n30 60 90\n"}, "reference_outputs": ["210\n"], "source_document_id": "p03162", "source_text": "Score : 100 points\n\nProblem Statement\n\nTaro's summer vacation starts tomorrow, and he has decided to make plans for it now.\n\nThe vacation consists of N days.\nFor each i (1 \\leq i \\leq N), Taro will choose one of the following activities and do it on the i-th day:\n\nA: Swim in the sea. Gain a_i points of happiness.\n\nB: Catch bugs in the mountains. Gain b_i points of happiness.\n\nC: Do homework at home. Gain c_i points of happiness.\n\nAs Taro gets bored easily, he cannot do the same activities for two or more consecutive days.\n\nFind the maximum possible total points of happiness that Taro gains.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 10^5\n\n1 \\leq a_i, b_i, c_i \\leq 10^4\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_1 b_1 c_1\na_2 b_2 c_2\n:\na_N b_N c_N\n\nOutput\n\nPrint the maximum possible total points of happiness that Taro gains.\n\nSample Input 1\n\n3\n10 40 70\n20 50 80\n30 60 90\n\nSample Output 1\n\n210\n\nIf Taro does activities in the order C, B, C, he will gain 70 + 50 + 90 = 210 points of happiness.\n\nSample Input 2\n\n1\n100 10 1\n\nSample Output 2\n\n100\n\nSample Input 3\n\n7\n6 7 8\n8 8 3\n2 5 2\n7 8 6\n4 6 8\n2 3 4\n7 5 1\n\nSample Output 3\n\n46\n\nTaro should do activities in the order C, A, B, A, C, B, A.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 484, "cpu_time_ms": 45, "memory_kb": 4360}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s189233175", "group_id": "codeNet:p03162", "input_text": "uses crt;\nconst m = 100000;\nvar\n g,s: array [0..m,0..3] of longint;\n i,j,k,n,s1: longint;\n\nbegin\n clrscr;\n readln (n);\n for i:=1 to n do\n readln ( g[i, 1], g[i,2], g[i,3]);\n\n for i:=1 to 3 do s[1,i]:= g[1,i];\n for i:=2 to n do\n begin\n j:=0;\n repeat\n inc(j); k:=0; s1:=0;\n\n repeat\n inc(k);\n if ( k <> j) and ( s[i-1,k] >= s1) then s1:= s[i-1,k];\n until k = 3;\n\n s[i,j]:= s[i,j] + s1 + g[i,j];\n until j=3;\n\n end;\n\n s1:= 0;\n for i:=1 to 3 do if s[n,i] > s1 then s1:= s[n,i];\n write (s1);\n readln;\nend.", "language": "Pascal", "metadata": {"date": 1583426827, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03162.html", "problem_id": "p03162", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03162/input.txt", "sample_output_relpath": "derived/input_output/data/p03162/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03162/Pascal/s189233175.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s189233175", "user_id": "u428668906"}, "prompt_components": {"gold_output": "210\n", "input_to_evaluate": "uses crt;\nconst m = 100000;\nvar\n g,s: array [0..m,0..3] of longint;\n i,j,k,n,s1: longint;\n\nbegin\n clrscr;\n readln (n);\n for i:=1 to n do\n readln ( g[i, 1], g[i,2], g[i,3]);\n\n for i:=1 to 3 do s[1,i]:= g[1,i];\n for i:=2 to n do\n begin\n j:=0;\n repeat\n inc(j); k:=0; s1:=0;\n\n repeat\n inc(k);\n if ( k <> j) and ( s[i-1,k] >= s1) then s1:= s[i-1,k];\n until k = 3;\n\n s[i,j]:= s[i,j] + s1 + g[i,j];\n until j=3;\n\n end;\n\n s1:= 0;\n for i:=1 to 3 do if s[n,i] > s1 then s1:= s[n,i];\n write (s1);\n readln;\nend.", "problem_context": "Score : 100 points\n\nProblem Statement\n\nTaro's summer vacation starts tomorrow, and he has decided to make plans for it now.\n\nThe vacation consists of N days.\nFor each i (1 \\leq i \\leq N), Taro will choose one of the following activities and do it on the i-th day:\n\nA: Swim in the sea. Gain a_i points of happiness.\n\nB: Catch bugs in the mountains. Gain b_i points of happiness.\n\nC: Do homework at home. Gain c_i points of happiness.\n\nAs Taro gets bored easily, he cannot do the same activities for two or more consecutive days.\n\nFind the maximum possible total points of happiness that Taro gains.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 10^5\n\n1 \\leq a_i, b_i, c_i \\leq 10^4\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_1 b_1 c_1\na_2 b_2 c_2\n:\na_N b_N c_N\n\nOutput\n\nPrint the maximum possible total points of happiness that Taro gains.\n\nSample Input 1\n\n3\n10 40 70\n20 50 80\n30 60 90\n\nSample Output 1\n\n210\n\nIf Taro does activities in the order C, B, C, he will gain 70 + 50 + 90 = 210 points of happiness.\n\nSample Input 2\n\n1\n100 10 1\n\nSample Output 2\n\n100\n\nSample Input 3\n\n7\n6 7 8\n8 8 3\n2 5 2\n7 8 6\n4 6 8\n2 3 4\n7 5 1\n\nSample Output 3\n\n46\n\nTaro should do activities in the order C, A, B, A, C, B, A.", "sample_input": "3\n10 40 70\n20 50 80\n30 60 90\n"}, "reference_outputs": ["210\n"], "source_document_id": "p03162", "source_text": "Score : 100 points\n\nProblem Statement\n\nTaro's summer vacation starts tomorrow, and he has decided to make plans for it now.\n\nThe vacation consists of N days.\nFor each i (1 \\leq i \\leq N), Taro will choose one of the following activities and do it on the i-th day:\n\nA: Swim in the sea. Gain a_i points of happiness.\n\nB: Catch bugs in the mountains. Gain b_i points of happiness.\n\nC: Do homework at home. Gain c_i points of happiness.\n\nAs Taro gets bored easily, he cannot do the same activities for two or more consecutive days.\n\nFind the maximum possible total points of happiness that Taro gains.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 10^5\n\n1 \\leq a_i, b_i, c_i \\leq 10^4\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_1 b_1 c_1\na_2 b_2 c_2\n:\na_N b_N c_N\n\nOutput\n\nPrint the maximum possible total points of happiness that Taro gains.\n\nSample Input 1\n\n3\n10 40 70\n20 50 80\n30 60 90\n\nSample Output 1\n\n210\n\nIf Taro does activities in the order C, B, C, he will gain 70 + 50 + 90 = 210 points of happiness.\n\nSample Input 2\n\n1\n100 10 1\n\nSample Output 2\n\n100\n\nSample Input 3\n\n7\n6 7 8\n8 8 3\n2 5 2\n7 8 6\n4 6 8\n2 3 4\n7 5 1\n\nSample Output 3\n\n46\n\nTaro should do activities in the order C, A, B, A, C, B, A.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 796, "cpu_time_ms": 38, "memory_kb": 3328}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s489186368", "group_id": "codeNet:p03162", "input_text": "uses crt;\nconst m = 100000;\nvar\n g,s: array [0..m,0..3] of longint;\n i,j,k,n,s1: longint;\n\nbegin\n clrscr;\n readln (n);\n for i:=1 to n do\n readln ( g[i, 1], g[i,2], g[i,3]);\n\n for i:=1 to 3 do s[1,i]:= g[1,i];\n for i:=2 to n do\n begin\n j:=0;\n repeat\n inc(j); k:=0; s1:=0;\n\n repeat\n inc(k);\n if ( k <> j) and ( s[i-1,k] >= s1) then s1:= s[i-1,k];\n until k = 3;\n\n s[i,j]:= s[i,j] + s1 + g[i,j];\n until j=3;\n\n end;\n\n s1:= 0;\n for i:=1 to 3 do if s[n,i] > s1 then s1:= s[n,i];\n write (s[n,i]);\n readln;\nend.", "language": "Pascal", "metadata": {"date": 1583426600, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03162.html", "problem_id": "p03162", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03162/input.txt", "sample_output_relpath": "derived/input_output/data/p03162/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03162/Pascal/s489186368.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s489186368", "user_id": "u428668906"}, "prompt_components": {"gold_output": "210\n", "input_to_evaluate": "uses crt;\nconst m = 100000;\nvar\n g,s: array [0..m,0..3] of longint;\n i,j,k,n,s1: longint;\n\nbegin\n clrscr;\n readln (n);\n for i:=1 to n do\n readln ( g[i, 1], g[i,2], g[i,3]);\n\n for i:=1 to 3 do s[1,i]:= g[1,i];\n for i:=2 to n do\n begin\n j:=0;\n repeat\n inc(j); k:=0; s1:=0;\n\n repeat\n inc(k);\n if ( k <> j) and ( s[i-1,k] >= s1) then s1:= s[i-1,k];\n until k = 3;\n\n s[i,j]:= s[i,j] + s1 + g[i,j];\n until j=3;\n\n end;\n\n s1:= 0;\n for i:=1 to 3 do if s[n,i] > s1 then s1:= s[n,i];\n write (s[n,i]);\n readln;\nend.", "problem_context": "Score : 100 points\n\nProblem Statement\n\nTaro's summer vacation starts tomorrow, and he has decided to make plans for it now.\n\nThe vacation consists of N days.\nFor each i (1 \\leq i \\leq N), Taro will choose one of the following activities and do it on the i-th day:\n\nA: Swim in the sea. Gain a_i points of happiness.\n\nB: Catch bugs in the mountains. Gain b_i points of happiness.\n\nC: Do homework at home. Gain c_i points of happiness.\n\nAs Taro gets bored easily, he cannot do the same activities for two or more consecutive days.\n\nFind the maximum possible total points of happiness that Taro gains.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 10^5\n\n1 \\leq a_i, b_i, c_i \\leq 10^4\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_1 b_1 c_1\na_2 b_2 c_2\n:\na_N b_N c_N\n\nOutput\n\nPrint the maximum possible total points of happiness that Taro gains.\n\nSample Input 1\n\n3\n10 40 70\n20 50 80\n30 60 90\n\nSample Output 1\n\n210\n\nIf Taro does activities in the order C, B, C, he will gain 70 + 50 + 90 = 210 points of happiness.\n\nSample Input 2\n\n1\n100 10 1\n\nSample Output 2\n\n100\n\nSample Input 3\n\n7\n6 7 8\n8 8 3\n2 5 2\n7 8 6\n4 6 8\n2 3 4\n7 5 1\n\nSample Output 3\n\n46\n\nTaro should do activities in the order C, A, B, A, C, B, A.", "sample_input": "3\n10 40 70\n20 50 80\n30 60 90\n"}, "reference_outputs": ["210\n"], "source_document_id": "p03162", "source_text": "Score : 100 points\n\nProblem Statement\n\nTaro's summer vacation starts tomorrow, and he has decided to make plans for it now.\n\nThe vacation consists of N days.\nFor each i (1 \\leq i \\leq N), Taro will choose one of the following activities and do it on the i-th day:\n\nA: Swim in the sea. Gain a_i points of happiness.\n\nB: Catch bugs in the mountains. Gain b_i points of happiness.\n\nC: Do homework at home. Gain c_i points of happiness.\n\nAs Taro gets bored easily, he cannot do the same activities for two or more consecutive days.\n\nFind the maximum possible total points of happiness that Taro gains.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 10^5\n\n1 \\leq a_i, b_i, c_i \\leq 10^4\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_1 b_1 c_1\na_2 b_2 c_2\n:\na_N b_N c_N\n\nOutput\n\nPrint the maximum possible total points of happiness that Taro gains.\n\nSample Input 1\n\n3\n10 40 70\n20 50 80\n30 60 90\n\nSample Output 1\n\n210\n\nIf Taro does activities in the order C, B, C, he will gain 70 + 50 + 90 = 210 points of happiness.\n\nSample Input 2\n\n1\n100 10 1\n\nSample Output 2\n\n100\n\nSample Input 3\n\n7\n6 7 8\n8 8 3\n2 5 2\n7 8 6\n4 6 8\n2 3 4\n7 5 1\n\nSample Output 3\n\n46\n\nTaro should do activities in the order C, A, B, A, C, B, A.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 800, "cpu_time_ms": 38, "memory_kb": 3328}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s379135260", "group_id": "codeNet:p03162", "input_text": "uses crt;\nvar dp:array[0..100009,0..5] of int64;\ncost:array[1..100004,1..5] of longint;\ni,o,p,l,m,n,a,b,c,k:longint;\nrs:int64;\nfunction max(a,b:int64):int64;\nbegin\nif a>b then max:=a\nelse max:=b;\nend;\nbegin\nrs:=-1;\nread(n);\nfor i:=1 to n do begin\n for l:=1 to 3 do begin\n read(cost[i,l]);\n end;\n end;\nfor i:=1 to n do begin\n dp[1,i]:=cost[1,i];\n end;\nfor i:=2 to n do begin\n dp[i,1]:=max(dp[i-1,2],dp[i-1,3])+cost[i,1];\n dp[i,2]:=max(dp[i-1,3],dp[i-1,1])+cost[i,2];\n dp[i,3]:=max(dp[i-1,2],dp[i-1,1])+cost[i,3];\n end;\nfor i:=1 to 3 do begin\n if dp[n,i]> rs then rs:=dp[n,i]\n end;\nwrite(rs);\nreadln;\nreadln;\nend.\n\n\n", "language": "Pascal", "metadata": {"date": 1575149634, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03162.html", "problem_id": "p03162", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03162/input.txt", "sample_output_relpath": "derived/input_output/data/p03162/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03162/Pascal/s379135260.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s379135260", "user_id": "u448096745"}, "prompt_components": {"gold_output": "210\n", "input_to_evaluate": "uses crt;\nvar dp:array[0..100009,0..5] of int64;\ncost:array[1..100004,1..5] of longint;\ni,o,p,l,m,n,a,b,c,k:longint;\nrs:int64;\nfunction max(a,b:int64):int64;\nbegin\nif a>b then max:=a\nelse max:=b;\nend;\nbegin\nrs:=-1;\nread(n);\nfor i:=1 to n do begin\n for l:=1 to 3 do begin\n read(cost[i,l]);\n end;\n end;\nfor i:=1 to n do begin\n dp[1,i]:=cost[1,i];\n end;\nfor i:=2 to n do begin\n dp[i,1]:=max(dp[i-1,2],dp[i-1,3])+cost[i,1];\n dp[i,2]:=max(dp[i-1,3],dp[i-1,1])+cost[i,2];\n dp[i,3]:=max(dp[i-1,2],dp[i-1,1])+cost[i,3];\n end;\nfor i:=1 to 3 do begin\n if dp[n,i]> rs then rs:=dp[n,i]\n end;\nwrite(rs);\nreadln;\nreadln;\nend.\n\n\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nTaro's summer vacation starts tomorrow, and he has decided to make plans for it now.\n\nThe vacation consists of N days.\nFor each i (1 \\leq i \\leq N), Taro will choose one of the following activities and do it on the i-th day:\n\nA: Swim in the sea. Gain a_i points of happiness.\n\nB: Catch bugs in the mountains. Gain b_i points of happiness.\n\nC: Do homework at home. Gain c_i points of happiness.\n\nAs Taro gets bored easily, he cannot do the same activities for two or more consecutive days.\n\nFind the maximum possible total points of happiness that Taro gains.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 10^5\n\n1 \\leq a_i, b_i, c_i \\leq 10^4\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_1 b_1 c_1\na_2 b_2 c_2\n:\na_N b_N c_N\n\nOutput\n\nPrint the maximum possible total points of happiness that Taro gains.\n\nSample Input 1\n\n3\n10 40 70\n20 50 80\n30 60 90\n\nSample Output 1\n\n210\n\nIf Taro does activities in the order C, B, C, he will gain 70 + 50 + 90 = 210 points of happiness.\n\nSample Input 2\n\n1\n100 10 1\n\nSample Output 2\n\n100\n\nSample Input 3\n\n7\n6 7 8\n8 8 3\n2 5 2\n7 8 6\n4 6 8\n2 3 4\n7 5 1\n\nSample Output 3\n\n46\n\nTaro should do activities in the order C, A, B, A, C, B, A.", "sample_input": "3\n10 40 70\n20 50 80\n30 60 90\n"}, "reference_outputs": ["210\n"], "source_document_id": "p03162", "source_text": "Score : 100 points\n\nProblem Statement\n\nTaro's summer vacation starts tomorrow, and he has decided to make plans for it now.\n\nThe vacation consists of N days.\nFor each i (1 \\leq i \\leq N), Taro will choose one of the following activities and do it on the i-th day:\n\nA: Swim in the sea. Gain a_i points of happiness.\n\nB: Catch bugs in the mountains. Gain b_i points of happiness.\n\nC: Do homework at home. Gain c_i points of happiness.\n\nAs Taro gets bored easily, he cannot do the same activities for two or more consecutive days.\n\nFind the maximum possible total points of happiness that Taro gains.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 10^5\n\n1 \\leq a_i, b_i, c_i \\leq 10^4\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_1 b_1 c_1\na_2 b_2 c_2\n:\na_N b_N c_N\n\nOutput\n\nPrint the maximum possible total points of happiness that Taro gains.\n\nSample Input 1\n\n3\n10 40 70\n20 50 80\n30 60 90\n\nSample Output 1\n\n210\n\nIf Taro does activities in the order C, B, C, he will gain 70 + 50 + 90 = 210 points of happiness.\n\nSample Input 2\n\n1\n100 10 1\n\nSample Output 2\n\n100\n\nSample Input 3\n\n7\n6 7 8\n8 8 3\n2 5 2\n7 8 6\n4 6 8\n2 3 4\n7 5 1\n\nSample Output 3\n\n46\n\nTaro should do activities in the order C, A, B, A, C, B, A.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 39, "memory_kb": 6784}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s580849934", "group_id": "codeNet:p03162", "input_text": "uses crt;\nvar dp:array[1..100000,1..100000] of longint;\n i,n:longint;\n a,b,c:array[1..100000] of longint;\nfunction max(a,b:longint):longint;\nbegin\n if a>b then exit(a) else exit(b);\nend;\nbegin\n clrscr;\n readln(n);\n for i := 1 to n do readln(a[i],b[i],c[i]);\n fillchar(dp,sizeof(dp),0);\n for i:=1 to n do \n begin\n dp[i,1]:=max(dp[i-1,1],max(dp[i-1,2],dp[i-1,3]+a[i]));\n dp[i,2]:=max(dp[i-1,2],max(dp[i-1,1],dp[i-1,3]+b[i]));\n dp[i,3]:=max(dp[i-1,3],max(dp[i-1,1],dp[i-1,2]+c[i]));\n end;\n writeln(max(dp[n,1],max(dp[n,2],dp[n,3])));\n readln;\nend.", "language": "Pascal", "metadata": {"date": 1565480398, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03162.html", "problem_id": "p03162", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03162/input.txt", "sample_output_relpath": "derived/input_output/data/p03162/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03162/Pascal/s580849934.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Memory Limit Exceeded", "submission_id": "s580849934", "user_id": "u805448247"}, "prompt_components": {"gold_output": "210\n", "input_to_evaluate": "uses crt;\nvar dp:array[1..100000,1..100000] of longint;\n i,n:longint;\n a,b,c:array[1..100000] of longint;\nfunction max(a,b:longint):longint;\nbegin\n if a>b then exit(a) else exit(b);\nend;\nbegin\n clrscr;\n readln(n);\n for i := 1 to n do readln(a[i],b[i],c[i]);\n fillchar(dp,sizeof(dp),0);\n for i:=1 to n do \n begin\n dp[i,1]:=max(dp[i-1,1],max(dp[i-1,2],dp[i-1,3]+a[i]));\n dp[i,2]:=max(dp[i-1,2],max(dp[i-1,1],dp[i-1,3]+b[i]));\n dp[i,3]:=max(dp[i-1,3],max(dp[i-1,1],dp[i-1,2]+c[i]));\n end;\n writeln(max(dp[n,1],max(dp[n,2],dp[n,3])));\n readln;\nend.", "problem_context": "Score : 100 points\n\nProblem Statement\n\nTaro's summer vacation starts tomorrow, and he has decided to make plans for it now.\n\nThe vacation consists of N days.\nFor each i (1 \\leq i \\leq N), Taro will choose one of the following activities and do it on the i-th day:\n\nA: Swim in the sea. Gain a_i points of happiness.\n\nB: Catch bugs in the mountains. Gain b_i points of happiness.\n\nC: Do homework at home. Gain c_i points of happiness.\n\nAs Taro gets bored easily, he cannot do the same activities for two or more consecutive days.\n\nFind the maximum possible total points of happiness that Taro gains.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 10^5\n\n1 \\leq a_i, b_i, c_i \\leq 10^4\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_1 b_1 c_1\na_2 b_2 c_2\n:\na_N b_N c_N\n\nOutput\n\nPrint the maximum possible total points of happiness that Taro gains.\n\nSample Input 1\n\n3\n10 40 70\n20 50 80\n30 60 90\n\nSample Output 1\n\n210\n\nIf Taro does activities in the order C, B, C, he will gain 70 + 50 + 90 = 210 points of happiness.\n\nSample Input 2\n\n1\n100 10 1\n\nSample Output 2\n\n100\n\nSample Input 3\n\n7\n6 7 8\n8 8 3\n2 5 2\n7 8 6\n4 6 8\n2 3 4\n7 5 1\n\nSample Output 3\n\n46\n\nTaro should do activities in the order C, A, B, A, C, B, A.", "sample_input": "3\n10 40 70\n20 50 80\n30 60 90\n"}, "reference_outputs": ["210\n"], "source_document_id": "p03162", "source_text": "Score : 100 points\n\nProblem Statement\n\nTaro's summer vacation starts tomorrow, and he has decided to make plans for it now.\n\nThe vacation consists of N days.\nFor each i (1 \\leq i \\leq N), Taro will choose one of the following activities and do it on the i-th day:\n\nA: Swim in the sea. Gain a_i points of happiness.\n\nB: Catch bugs in the mountains. Gain b_i points of happiness.\n\nC: Do homework at home. Gain c_i points of happiness.\n\nAs Taro gets bored easily, he cannot do the same activities for two or more consecutive days.\n\nFind the maximum possible total points of happiness that Taro gains.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 10^5\n\n1 \\leq a_i, b_i, c_i \\leq 10^4\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_1 b_1 c_1\na_2 b_2 c_2\n:\na_N b_N c_N\n\nOutput\n\nPrint the maximum possible total points of happiness that Taro gains.\n\nSample Input 1\n\n3\n10 40 70\n20 50 80\n30 60 90\n\nSample Output 1\n\n210\n\nIf Taro does activities in the order C, B, C, he will gain 70 + 50 + 90 = 210 points of happiness.\n\nSample Input 2\n\n1\n100 10 1\n\nSample Output 2\n\n100\n\nSample Input 3\n\n7\n6 7 8\n8 8 3\n2 5 2\n7 8 6\n4 6 8\n2 3 4\n7 5 1\n\nSample Output 3\n\n46\n\nTaro should do activities in the order C, A, B, A, C, B, A.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 622, "cpu_time_ms": 1069, "memory_kb": 1315072}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s301941902", "group_id": "codeNet:p03162", "input_text": "uses crt;\nvar dp:array[1..100000,1..100000] of longint;\n i,n:longint;\n a,b,c:array[1..100000] of longint;\nfunction max(a,b:longint):longint;\nbegin\n if a>b then exit(a) else exit(b);\nend;\nbegin\n clrscr;\n readln(n);\n for i := 1 to n do readln(a[i],b[i],c[i]);\n dp[1,1]:=a[1];\n dp[1,2]:=b[1];\n dp[1,3]:=c[1];\n for i:=2 to n do \n begin\n dp[i,1]:=max(dp[i-1,1],max(dp[i-1,2],dp[i-1,3]+a[i]));\n dp[i,2]:=max(dp[i-1,2],max(dp[i-1,1],dp[i-1,3]+b[i]));\n dp[i,3]:=max(dp[i-1,3],max(dp[i-1,1],dp[i-1,2]+c[i]));\n end;\n writeln(max(dp[n,1],max(dp[n,2],dp[n,3])));\n readln;\nend.", "language": "Pascal", "metadata": {"date": 1565480245, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03162.html", "problem_id": "p03162", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03162/input.txt", "sample_output_relpath": "derived/input_output/data/p03162/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03162/Pascal/s301941902.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s301941902", "user_id": "u805448247"}, "prompt_components": {"gold_output": "210\n", "input_to_evaluate": "uses crt;\nvar dp:array[1..100000,1..100000] of longint;\n i,n:longint;\n a,b,c:array[1..100000] of longint;\nfunction max(a,b:longint):longint;\nbegin\n if a>b then exit(a) else exit(b);\nend;\nbegin\n clrscr;\n readln(n);\n for i := 1 to n do readln(a[i],b[i],c[i]);\n dp[1,1]:=a[1];\n dp[1,2]:=b[1];\n dp[1,3]:=c[1];\n for i:=2 to n do \n begin\n dp[i,1]:=max(dp[i-1,1],max(dp[i-1,2],dp[i-1,3]+a[i]));\n dp[i,2]:=max(dp[i-1,2],max(dp[i-1,1],dp[i-1,3]+b[i]));\n dp[i,3]:=max(dp[i-1,3],max(dp[i-1,1],dp[i-1,2]+c[i]));\n end;\n writeln(max(dp[n,1],max(dp[n,2],dp[n,3])));\n readln;\nend.", "problem_context": "Score : 100 points\n\nProblem Statement\n\nTaro's summer vacation starts tomorrow, and he has decided to make plans for it now.\n\nThe vacation consists of N days.\nFor each i (1 \\leq i \\leq N), Taro will choose one of the following activities and do it on the i-th day:\n\nA: Swim in the sea. Gain a_i points of happiness.\n\nB: Catch bugs in the mountains. Gain b_i points of happiness.\n\nC: Do homework at home. Gain c_i points of happiness.\n\nAs Taro gets bored easily, he cannot do the same activities for two or more consecutive days.\n\nFind the maximum possible total points of happiness that Taro gains.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 10^5\n\n1 \\leq a_i, b_i, c_i \\leq 10^4\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_1 b_1 c_1\na_2 b_2 c_2\n:\na_N b_N c_N\n\nOutput\n\nPrint the maximum possible total points of happiness that Taro gains.\n\nSample Input 1\n\n3\n10 40 70\n20 50 80\n30 60 90\n\nSample Output 1\n\n210\n\nIf Taro does activities in the order C, B, C, he will gain 70 + 50 + 90 = 210 points of happiness.\n\nSample Input 2\n\n1\n100 10 1\n\nSample Output 2\n\n100\n\nSample Input 3\n\n7\n6 7 8\n8 8 3\n2 5 2\n7 8 6\n4 6 8\n2 3 4\n7 5 1\n\nSample Output 3\n\n46\n\nTaro should do activities in the order C, A, B, A, C, B, A.", "sample_input": "3\n10 40 70\n20 50 80\n30 60 90\n"}, "reference_outputs": ["210\n"], "source_document_id": "p03162", "source_text": "Score : 100 points\n\nProblem Statement\n\nTaro's summer vacation starts tomorrow, and he has decided to make plans for it now.\n\nThe vacation consists of N days.\nFor each i (1 \\leq i \\leq N), Taro will choose one of the following activities and do it on the i-th day:\n\nA: Swim in the sea. Gain a_i points of happiness.\n\nB: Catch bugs in the mountains. Gain b_i points of happiness.\n\nC: Do homework at home. Gain c_i points of happiness.\n\nAs Taro gets bored easily, he cannot do the same activities for two or more consecutive days.\n\nFind the maximum possible total points of happiness that Taro gains.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 10^5\n\n1 \\leq a_i, b_i, c_i \\leq 10^4\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_1 b_1 c_1\na_2 b_2 c_2\n:\na_N b_N c_N\n\nOutput\n\nPrint the maximum possible total points of happiness that Taro gains.\n\nSample Input 1\n\n3\n10 40 70\n20 50 80\n30 60 90\n\nSample Output 1\n\n210\n\nIf Taro does activities in the order C, B, C, he will gain 70 + 50 + 90 = 210 points of happiness.\n\nSample Input 2\n\n1\n100 10 1\n\nSample Output 2\n\n100\n\nSample Input 3\n\n7\n6 7 8\n8 8 3\n2 5 2\n7 8 6\n4 6 8\n2 3 4\n7 5 1\n\nSample Output 3\n\n46\n\nTaro should do activities in the order C, A, B, A, C, B, A.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 288, "memory_kb": 1313280}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s901522569", "group_id": "codeNet:p03162", "input_text": "type\n\tnode=record\n\t\t\t\tsa,sb,sc:longint;\n\t\t\tend;\nvar\n\ta,b,c:array[0..100010] of longint;\n\tf1,f2:node;\n\ti,n,ans:longint;\nfunction max(x,y:longint):longint;\nbegin\n\tif x>y then exit(x) else exit(y);\nend;\nbegin\n\treadln(n);\n\tfor i:=1 to n do read(a[i],b[i],c[i]);\n\tf1.sa:=a[1];\n\tf1.sb:=b[1];\n\tf1.sc:=c[1];\n\tfor i:=2 to n do\n\tbegin\n\t\tf2.sa:=a[i]+max(f1.sb,f1.sc);\n\t\tf2.sb:=b[i]+max(f1.sa,f1.sc);\n\t\tf2.sc:=c[i]+max(f1.sa,f1.sb);\n\t\tf1:=f2;\n\tend;\n\tans:=max(f1.sa,f1.sb);\n\tans:=max(ans,f1.sc);\n\twriteln(ans);\nend.", "language": "Pascal", "metadata": {"date": 1548623028, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03162.html", "problem_id": "p03162", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03162/input.txt", "sample_output_relpath": "derived/input_output/data/p03162/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03162/Pascal/s901522569.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s901522569", "user_id": "u508890103"}, "prompt_components": {"gold_output": "210\n", "input_to_evaluate": "type\n\tnode=record\n\t\t\t\tsa,sb,sc:longint;\n\t\t\tend;\nvar\n\ta,b,c:array[0..100010] of longint;\n\tf1,f2:node;\n\ti,n,ans:longint;\nfunction max(x,y:longint):longint;\nbegin\n\tif x>y then exit(x) else exit(y);\nend;\nbegin\n\treadln(n);\n\tfor i:=1 to n do read(a[i],b[i],c[i]);\n\tf1.sa:=a[1];\n\tf1.sb:=b[1];\n\tf1.sc:=c[1];\n\tfor i:=2 to n do\n\tbegin\n\t\tf2.sa:=a[i]+max(f1.sb,f1.sc);\n\t\tf2.sb:=b[i]+max(f1.sa,f1.sc);\n\t\tf2.sc:=c[i]+max(f1.sa,f1.sb);\n\t\tf1:=f2;\n\tend;\n\tans:=max(f1.sa,f1.sb);\n\tans:=max(ans,f1.sc);\n\twriteln(ans);\nend.", "problem_context": "Score : 100 points\n\nProblem Statement\n\nTaro's summer vacation starts tomorrow, and he has decided to make plans for it now.\n\nThe vacation consists of N days.\nFor each i (1 \\leq i \\leq N), Taro will choose one of the following activities and do it on the i-th day:\n\nA: Swim in the sea. Gain a_i points of happiness.\n\nB: Catch bugs in the mountains. Gain b_i points of happiness.\n\nC: Do homework at home. Gain c_i points of happiness.\n\nAs Taro gets bored easily, he cannot do the same activities for two or more consecutive days.\n\nFind the maximum possible total points of happiness that Taro gains.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 10^5\n\n1 \\leq a_i, b_i, c_i \\leq 10^4\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_1 b_1 c_1\na_2 b_2 c_2\n:\na_N b_N c_N\n\nOutput\n\nPrint the maximum possible total points of happiness that Taro gains.\n\nSample Input 1\n\n3\n10 40 70\n20 50 80\n30 60 90\n\nSample Output 1\n\n210\n\nIf Taro does activities in the order C, B, C, he will gain 70 + 50 + 90 = 210 points of happiness.\n\nSample Input 2\n\n1\n100 10 1\n\nSample Output 2\n\n100\n\nSample Input 3\n\n7\n6 7 8\n8 8 3\n2 5 2\n7 8 6\n4 6 8\n2 3 4\n7 5 1\n\nSample Output 3\n\n46\n\nTaro should do activities in the order C, A, B, A, C, B, A.", "sample_input": "3\n10 40 70\n20 50 80\n30 60 90\n"}, "reference_outputs": ["210\n"], "source_document_id": "p03162", "source_text": "Score : 100 points\n\nProblem Statement\n\nTaro's summer vacation starts tomorrow, and he has decided to make plans for it now.\n\nThe vacation consists of N days.\nFor each i (1 \\leq i \\leq N), Taro will choose one of the following activities and do it on the i-th day:\n\nA: Swim in the sea. Gain a_i points of happiness.\n\nB: Catch bugs in the mountains. Gain b_i points of happiness.\n\nC: Do homework at home. Gain c_i points of happiness.\n\nAs Taro gets bored easily, he cannot do the same activities for two or more consecutive days.\n\nFind the maximum possible total points of happiness that Taro gains.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 10^5\n\n1 \\leq a_i, b_i, c_i \\leq 10^4\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_1 b_1 c_1\na_2 b_2 c_2\n:\na_N b_N c_N\n\nOutput\n\nPrint the maximum possible total points of happiness that Taro gains.\n\nSample Input 1\n\n3\n10 40 70\n20 50 80\n30 60 90\n\nSample Output 1\n\n210\n\nIf Taro does activities in the order C, B, C, he will gain 70 + 50 + 90 = 210 points of happiness.\n\nSample Input 2\n\n1\n100 10 1\n\nSample Output 2\n\n100\n\nSample Input 3\n\n7\n6 7 8\n8 8 3\n2 5 2\n7 8 6\n4 6 8\n2 3 4\n7 5 1\n\nSample Output 3\n\n46\n\nTaro should do activities in the order C, A, B, A, C, B, A.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 502, "cpu_time_ms": 32, "memory_kb": 1280}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s761273270", "group_id": "codeNet:p03164", "input_text": "program knapsack1;\n\nuses math;\n\nconst\n fi='knapsack1.inp';\n fo='knapsack1.out';\n oo=trunc(1e9)+5;\n\nvar\n n,m,va: longint;\n v,w: array[0..100000] of int16;\n f:array[0..100,0..100000] of int32;\n\nprocedure nhap;\nvar i: longint;\nbegin\n\n va:=0;\n read(n,m);\n for i:=1 to n do begin\n read(w[i],v[i]);\n inc(va,v[i]);\n end;\n\nend;\n\nprocedure xuli;\nvar i,j,ans: longint;\nbegin\n\n ans:=0;\n for i:=0 to n do begin\n for j:=0 to va do f[i][j]:=oo;\n end;\n\n f[0][0]:=0;\n\n for i:=1 to n do begin\n for j:=0 to va do begin\n if j>=v[i] then f[i][j]:=min(f[i-1][j],f[i-1][j-v[i]]+w[i])\n else f[i][j]:=f[i-1][j];\n end;\n end;\n\n\n for j:=0 to va do begin\n ans:=ifthen((f[n][j]<=m),j,ans);\n end;\n\n write(ans);\n\nend;\n\nbegin\n\n //assign(input,fi); reset(input);\n //assign(output,fo); rewrite(output);\n\n nhap;\n xuli;\n\n //close(input); close(output);\n\nend.\n", "language": "Pascal", "metadata": {"date": 1577012595, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03164.html", "problem_id": "p03164", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03164/input.txt", "sample_output_relpath": "derived/input_output/data/p03164/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03164/Pascal/s761273270.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s761273270", "user_id": "u762868299"}, "prompt_components": {"gold_output": "90\n", "input_to_evaluate": "program knapsack1;\n\nuses math;\n\nconst\n fi='knapsack1.inp';\n fo='knapsack1.out';\n oo=trunc(1e9)+5;\n\nvar\n n,m,va: longint;\n v,w: array[0..100000] of int16;\n f:array[0..100,0..100000] of int32;\n\nprocedure nhap;\nvar i: longint;\nbegin\n\n va:=0;\n read(n,m);\n for i:=1 to n do begin\n read(w[i],v[i]);\n inc(va,v[i]);\n end;\n\nend;\n\nprocedure xuli;\nvar i,j,ans: longint;\nbegin\n\n ans:=0;\n for i:=0 to n do begin\n for j:=0 to va do f[i][j]:=oo;\n end;\n\n f[0][0]:=0;\n\n for i:=1 to n do begin\n for j:=0 to va do begin\n if j>=v[i] then f[i][j]:=min(f[i-1][j],f[i-1][j-v[i]]+w[i])\n else f[i][j]:=f[i-1][j];\n end;\n end;\n\n\n for j:=0 to va do begin\n ans:=ifthen((f[n][j]<=m),j,ans);\n end;\n\n write(ans);\n\nend;\n\nbegin\n\n //assign(input,fi); reset(input);\n //assign(output,fo); rewrite(output);\n\n nhap;\n xuli;\n\n //close(input); close(output);\n\nend.\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nThere are N items, numbered 1, 2, \\ldots, N.\nFor each i (1 \\leq i \\leq N), Item i has a weight of w_i and a value of v_i.\n\nTaro has decided to choose some of the N items and carry them home in a knapsack.\nThe capacity of the knapsack is W, which means that the sum of the weights of items taken must be at most W.\n\nFind the maximum possible sum of the values of items that Taro takes home.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 100\n\n1 \\leq W \\leq 10^9\n\n1 \\leq w_i \\leq W\n\n1 \\leq v_i \\leq 10^3\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN W\nw_1 v_1\nw_2 v_2\n:\nw_N v_N\n\nOutput\n\nPrint the maximum possible sum of the values of items that Taro takes home.\n\nSample Input 1\n\n3 8\n3 30\n4 50\n5 60\n\nSample Output 1\n\n90\n\nItems 1 and 3 should be taken.\nThen, the sum of the weights is 3 + 5 = 8, and the sum of the values is 30 + 60 = 90.\n\nSample Input 2\n\n1 1000000000\n1000000000 10\n\nSample Output 2\n\n10\n\nSample Input 3\n\n6 15\n6 5\n5 6\n6 4\n6 6\n3 5\n7 2\n\nSample Output 3\n\n17\n\nItems 2, 4 and 5 should be taken.\nThen, the sum of the weights is 5 + 6 + 3 = 14, and the sum of the values is 6 + 6 + 5 = 17.", "sample_input": "3 8\n3 30\n4 50\n5 60\n"}, "reference_outputs": ["90\n"], "source_document_id": "p03164", "source_text": "Score : 100 points\n\nProblem Statement\n\nThere are N items, numbered 1, 2, \\ldots, N.\nFor each i (1 \\leq i \\leq N), Item i has a weight of w_i and a value of v_i.\n\nTaro has decided to choose some of the N items and carry them home in a knapsack.\nThe capacity of the knapsack is W, which means that the sum of the weights of items taken must be at most W.\n\nFind the maximum possible sum of the values of items that Taro takes home.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 100\n\n1 \\leq W \\leq 10^9\n\n1 \\leq w_i \\leq W\n\n1 \\leq v_i \\leq 10^3\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN W\nw_1 v_1\nw_2 v_2\n:\nw_N v_N\n\nOutput\n\nPrint the maximum possible sum of the values of items that Taro takes home.\n\nSample Input 1\n\n3 8\n3 30\n4 50\n5 60\n\nSample Output 1\n\n90\n\nItems 1 and 3 should be taken.\nThen, the sum of the weights is 3 + 5 = 8, and the sum of the values is 30 + 60 = 90.\n\nSample Input 2\n\n1 1000000000\n1000000000 10\n\nSample Output 2\n\n10\n\nSample Input 3\n\n6 15\n6 5\n5 6\n6 4\n6 6\n3 5\n7 2\n\nSample Output 3\n\n17\n\nItems 2, 4 and 5 should be taken.\nThen, the sum of the weights is 5 + 6 + 3 = 14, and the sum of the values is 6 + 6 + 5 = 17.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 881, "cpu_time_ms": 55, "memory_kb": 39680}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s190782584", "group_id": "codeNet:p03164", "input_text": "uses math;\nconst fi='knapsack2.inp';\n fo='knapsack2.out';\n maxn=100;\n maxv=200000;\nvar n,w:int32;\n maxval:uint64;\n we,v:array[1..maxn] of uint32;\n f:array[0..maxn,0..maxv] of uint64;\n//=============================\nprocedure nhap;\nvar i:int32;\nbegin\n readln(n,w); maxval:=0;\n for i:=1 to n do\n begin\n readln(we[i],v[i]);\n maxval:=maxval+v[i];\n end;\nend;\n//=============================\nfunction min(x,y:int64):int64;\nbegin\n if x>y then exit(y)\n else exit(x);\nend;\n//=============================\nprocedure xuli;\nvar i,j:int32;\n ans:uint64;\nbegin\n for i:=0 to n do\n for j:=0 to maxval do f[i,j]:=maxlongint;\n f[0,0]:=0;\n for i:=0 to n do\n for j:=0 to maxval do\n if f[i,j]<>maxlongint then\n begin\n f[i+1,j]:=min(f[i+1,j],f[i,j]);\n if f[i,j]+we[i+1]<=w then\n f[i+1,j+v[i+1]]:=min(f[i+1,j+v[i+1]],f[i,j]+we[i+1]);\n end;\n for i:=maxval downto 1 do\n if f[n,i]<=w then break;\n write(i);\nend;\n//=============================\nbegin\n// assign(input,fi); reset(input);\n// assign(output,fo); rewrite(output);\n nhap;\n xuli;\n// close(input); close(output);\nend.\n", "language": "Pascal", "metadata": {"date": 1577012308, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03164.html", "problem_id": "p03164", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03164/input.txt", "sample_output_relpath": "derived/input_output/data/p03164/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03164/Pascal/s190782584.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s190782584", "user_id": "u801427196"}, "prompt_components": {"gold_output": "90\n", "input_to_evaluate": "uses math;\nconst fi='knapsack2.inp';\n fo='knapsack2.out';\n maxn=100;\n maxv=200000;\nvar n,w:int32;\n maxval:uint64;\n we,v:array[1..maxn] of uint32;\n f:array[0..maxn,0..maxv] of uint64;\n//=============================\nprocedure nhap;\nvar i:int32;\nbegin\n readln(n,w); maxval:=0;\n for i:=1 to n do\n begin\n readln(we[i],v[i]);\n maxval:=maxval+v[i];\n end;\nend;\n//=============================\nfunction min(x,y:int64):int64;\nbegin\n if x>y then exit(y)\n else exit(x);\nend;\n//=============================\nprocedure xuli;\nvar i,j:int32;\n ans:uint64;\nbegin\n for i:=0 to n do\n for j:=0 to maxval do f[i,j]:=maxlongint;\n f[0,0]:=0;\n for i:=0 to n do\n for j:=0 to maxval do\n if f[i,j]<>maxlongint then\n begin\n f[i+1,j]:=min(f[i+1,j],f[i,j]);\n if f[i,j]+we[i+1]<=w then\n f[i+1,j+v[i+1]]:=min(f[i+1,j+v[i+1]],f[i,j]+we[i+1]);\n end;\n for i:=maxval downto 1 do\n if f[n,i]<=w then break;\n write(i);\nend;\n//=============================\nbegin\n// assign(input,fi); reset(input);\n// assign(output,fo); rewrite(output);\n nhap;\n xuli;\n// close(input); close(output);\nend.\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nThere are N items, numbered 1, 2, \\ldots, N.\nFor each i (1 \\leq i \\leq N), Item i has a weight of w_i and a value of v_i.\n\nTaro has decided to choose some of the N items and carry them home in a knapsack.\nThe capacity of the knapsack is W, which means that the sum of the weights of items taken must be at most W.\n\nFind the maximum possible sum of the values of items that Taro takes home.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 100\n\n1 \\leq W \\leq 10^9\n\n1 \\leq w_i \\leq W\n\n1 \\leq v_i \\leq 10^3\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN W\nw_1 v_1\nw_2 v_2\n:\nw_N v_N\n\nOutput\n\nPrint the maximum possible sum of the values of items that Taro takes home.\n\nSample Input 1\n\n3 8\n3 30\n4 50\n5 60\n\nSample Output 1\n\n90\n\nItems 1 and 3 should be taken.\nThen, the sum of the weights is 3 + 5 = 8, and the sum of the values is 30 + 60 = 90.\n\nSample Input 2\n\n1 1000000000\n1000000000 10\n\nSample Output 2\n\n10\n\nSample Input 3\n\n6 15\n6 5\n5 6\n6 4\n6 6\n3 5\n7 2\n\nSample Output 3\n\n17\n\nItems 2, 4 and 5 should be taken.\nThen, the sum of the weights is 5 + 6 + 3 = 14, and the sum of the values is 6 + 6 + 5 = 17.", "sample_input": "3 8\n3 30\n4 50\n5 60\n"}, "reference_outputs": ["90\n"], "source_document_id": "p03164", "source_text": "Score : 100 points\n\nProblem Statement\n\nThere are N items, numbered 1, 2, \\ldots, N.\nFor each i (1 \\leq i \\leq N), Item i has a weight of w_i and a value of v_i.\n\nTaro has decided to choose some of the N items and carry them home in a knapsack.\nThe capacity of the knapsack is W, which means that the sum of the weights of items taken must be at most W.\n\nFind the maximum possible sum of the values of items that Taro takes home.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 100\n\n1 \\leq W \\leq 10^9\n\n1 \\leq w_i \\leq W\n\n1 \\leq v_i \\leq 10^3\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN W\nw_1 v_1\nw_2 v_2\n:\nw_N v_N\n\nOutput\n\nPrint the maximum possible sum of the values of items that Taro takes home.\n\nSample Input 1\n\n3 8\n3 30\n4 50\n5 60\n\nSample Output 1\n\n90\n\nItems 1 and 3 should be taken.\nThen, the sum of the weights is 3 + 5 = 8, and the sum of the values is 30 + 60 = 90.\n\nSample Input 2\n\n1 1000000000\n1000000000 10\n\nSample Output 2\n\n10\n\nSample Input 3\n\n6 15\n6 5\n5 6\n6 4\n6 6\n3 5\n7 2\n\nSample Output 3\n\n17\n\nItems 2, 4 and 5 should be taken.\nThen, the sum of the weights is 5 + 6 + 3 = 14, and the sum of the values is 6 + 6 + 5 = 17.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 441, "memory_kb": 465280}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s347812156", "group_id": "codeNet:p03164", "input_text": "program knapsack1;\n\nuses math;\n\nconst\n fi='knapsack1.inp';\n fo='knapsack1.out';\n oo=trunc(1e9);\n\nvar\n n,m,va: longint;\n v,w: array[0..100000] of int16;\n f:array[0..100,0..100000] of int32;\n\nprocedure nhap;\nvar i: longint;\nbegin\n\n read(n,m);\n for i:=1 to n do begin\n read(w[i],v[i]);\n inc(va,v[i]);\n end;\n\nend;\n\nprocedure xuli;\nvar i,j,ans: longint;\nbegin\n\n ans:=0;\n for i:=0 to n do begin\n for j:=0 to va do f[i][j]:=oo;\n end;\n\n f[0][0]:=0;\n\n for i:=1 to n do begin\n for j:=1 to va do begin\n if j>=v[i] then f[i][j]:=min(f[i-1][j],f[i-1][j-v[i]]+w[i])\n else f[i][j]:=f[i-1][j];\n end;\n end;\n\n\n for j:=1 to va do begin\n ans:=ifthen((f[n][j]<=m),j,ans);\n end;\n\n write(ans);\n\nend;\n\nbegin\n\n //assign(input,fi); reset(input);\n //assign(output,fo); rewrite(output);\n\n nhap;\n xuli;\n\n //close(input); close(output);\n\nend.\n", "language": "Pascal", "metadata": {"date": 1577010931, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03164.html", "problem_id": "p03164", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03164/input.txt", "sample_output_relpath": "derived/input_output/data/p03164/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03164/Pascal/s347812156.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s347812156", "user_id": "u762868299"}, "prompt_components": {"gold_output": "90\n", "input_to_evaluate": "program knapsack1;\n\nuses math;\n\nconst\n fi='knapsack1.inp';\n fo='knapsack1.out';\n oo=trunc(1e9);\n\nvar\n n,m,va: longint;\n v,w: array[0..100000] of int16;\n f:array[0..100,0..100000] of int32;\n\nprocedure nhap;\nvar i: longint;\nbegin\n\n read(n,m);\n for i:=1 to n do begin\n read(w[i],v[i]);\n inc(va,v[i]);\n end;\n\nend;\n\nprocedure xuli;\nvar i,j,ans: longint;\nbegin\n\n ans:=0;\n for i:=0 to n do begin\n for j:=0 to va do f[i][j]:=oo;\n end;\n\n f[0][0]:=0;\n\n for i:=1 to n do begin\n for j:=1 to va do begin\n if j>=v[i] then f[i][j]:=min(f[i-1][j],f[i-1][j-v[i]]+w[i])\n else f[i][j]:=f[i-1][j];\n end;\n end;\n\n\n for j:=1 to va do begin\n ans:=ifthen((f[n][j]<=m),j,ans);\n end;\n\n write(ans);\n\nend;\n\nbegin\n\n //assign(input,fi); reset(input);\n //assign(output,fo); rewrite(output);\n\n nhap;\n xuli;\n\n //close(input); close(output);\n\nend.\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nThere are N items, numbered 1, 2, \\ldots, N.\nFor each i (1 \\leq i \\leq N), Item i has a weight of w_i and a value of v_i.\n\nTaro has decided to choose some of the N items and carry them home in a knapsack.\nThe capacity of the knapsack is W, which means that the sum of the weights of items taken must be at most W.\n\nFind the maximum possible sum of the values of items that Taro takes home.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 100\n\n1 \\leq W \\leq 10^9\n\n1 \\leq w_i \\leq W\n\n1 \\leq v_i \\leq 10^3\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN W\nw_1 v_1\nw_2 v_2\n:\nw_N v_N\n\nOutput\n\nPrint the maximum possible sum of the values of items that Taro takes home.\n\nSample Input 1\n\n3 8\n3 30\n4 50\n5 60\n\nSample Output 1\n\n90\n\nItems 1 and 3 should be taken.\nThen, the sum of the weights is 3 + 5 = 8, and the sum of the values is 30 + 60 = 90.\n\nSample Input 2\n\n1 1000000000\n1000000000 10\n\nSample Output 2\n\n10\n\nSample Input 3\n\n6 15\n6 5\n5 6\n6 4\n6 6\n3 5\n7 2\n\nSample Output 3\n\n17\n\nItems 2, 4 and 5 should be taken.\nThen, the sum of the weights is 5 + 6 + 3 = 14, and the sum of the values is 6 + 6 + 5 = 17.", "sample_input": "3 8\n3 30\n4 50\n5 60\n"}, "reference_outputs": ["90\n"], "source_document_id": "p03164", "source_text": "Score : 100 points\n\nProblem Statement\n\nThere are N items, numbered 1, 2, \\ldots, N.\nFor each i (1 \\leq i \\leq N), Item i has a weight of w_i and a value of v_i.\n\nTaro has decided to choose some of the N items and carry them home in a knapsack.\nThe capacity of the knapsack is W, which means that the sum of the weights of items taken must be at most W.\n\nFind the maximum possible sum of the values of items that Taro takes home.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 100\n\n1 \\leq W \\leq 10^9\n\n1 \\leq w_i \\leq W\n\n1 \\leq v_i \\leq 10^3\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN W\nw_1 v_1\nw_2 v_2\n:\nw_N v_N\n\nOutput\n\nPrint the maximum possible sum of the values of items that Taro takes home.\n\nSample Input 1\n\n3 8\n3 30\n4 50\n5 60\n\nSample Output 1\n\n90\n\nItems 1 and 3 should be taken.\nThen, the sum of the weights is 3 + 5 = 8, and the sum of the values is 30 + 60 = 90.\n\nSample Input 2\n\n1 1000000000\n1000000000 10\n\nSample Output 2\n\n10\n\nSample Input 3\n\n6 15\n6 5\n5 6\n6 4\n6 6\n3 5\n7 2\n\nSample Output 3\n\n17\n\nItems 2, 4 and 5 should be taken.\nThen, the sum of the weights is 5 + 6 + 3 = 14, and the sum of the values is 6 + 6 + 5 = 17.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 870, "cpu_time_ms": 55, "memory_kb": 39680}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s289527866", "group_id": "codeNet:p03164", "input_text": "Program KnapSack2;\nuses math;\nvar F:array[0..100005] of int64;\n V,W:array[1..105] of longint;\n i,j,n,k,sum :longint;\n res:longint;\n fi,fo:text;\n//-----------------------------\nbegin\n//assign(fi,'KnapSack2.inp');reset(fi);\nreadln(n,k);\nfor i:= 1 to n do begin\n Readln(W[i],V[i]);\n sum:=sum+V[i];\n end;\nfor i:=1 to sum do begin\n F[i]:=1000000000000;\n end;\nfor i:=1 to n do begin\n for j:=sum downto 1 do begin \n if j-V[i]>=0 then begin\n F[j]:=min(F[j],F[j-V[i]]+W[i]);\n end;\n end;\n end;\nfor i:=sum downto 1 do begin\n if F[i]<=k then begin\n Writeln(i);\n break;\n end;\n end;\n//readln;\nend.\n\n\n\n", "language": "Pascal", "metadata": {"date": 1566136643, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03164.html", "problem_id": "p03164", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03164/input.txt", "sample_output_relpath": "derived/input_output/data/p03164/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03164/Pascal/s289527866.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s289527866", "user_id": "u014341649"}, "prompt_components": {"gold_output": "90\n", "input_to_evaluate": "Program KnapSack2;\nuses math;\nvar F:array[0..100005] of int64;\n V,W:array[1..105] of longint;\n i,j,n,k,sum :longint;\n res:longint;\n fi,fo:text;\n//-----------------------------\nbegin\n//assign(fi,'KnapSack2.inp');reset(fi);\nreadln(n,k);\nfor i:= 1 to n do begin\n Readln(W[i],V[i]);\n sum:=sum+V[i];\n end;\nfor i:=1 to sum do begin\n F[i]:=1000000000000;\n end;\nfor i:=1 to n do begin\n for j:=sum downto 1 do begin \n if j-V[i]>=0 then begin\n F[j]:=min(F[j],F[j-V[i]]+W[i]);\n end;\n end;\n end;\nfor i:=sum downto 1 do begin\n if F[i]<=k then begin\n Writeln(i);\n break;\n end;\n end;\n//readln;\nend.\n\n\n\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nThere are N items, numbered 1, 2, \\ldots, N.\nFor each i (1 \\leq i \\leq N), Item i has a weight of w_i and a value of v_i.\n\nTaro has decided to choose some of the N items and carry them home in a knapsack.\nThe capacity of the knapsack is W, which means that the sum of the weights of items taken must be at most W.\n\nFind the maximum possible sum of the values of items that Taro takes home.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 100\n\n1 \\leq W \\leq 10^9\n\n1 \\leq w_i \\leq W\n\n1 \\leq v_i \\leq 10^3\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN W\nw_1 v_1\nw_2 v_2\n:\nw_N v_N\n\nOutput\n\nPrint the maximum possible sum of the values of items that Taro takes home.\n\nSample Input 1\n\n3 8\n3 30\n4 50\n5 60\n\nSample Output 1\n\n90\n\nItems 1 and 3 should be taken.\nThen, the sum of the weights is 3 + 5 = 8, and the sum of the values is 30 + 60 = 90.\n\nSample Input 2\n\n1 1000000000\n1000000000 10\n\nSample Output 2\n\n10\n\nSample Input 3\n\n6 15\n6 5\n5 6\n6 4\n6 6\n3 5\n7 2\n\nSample Output 3\n\n17\n\nItems 2, 4 and 5 should be taken.\nThen, the sum of the weights is 5 + 6 + 3 = 14, and the sum of the values is 6 + 6 + 5 = 17.", "sample_input": "3 8\n3 30\n4 50\n5 60\n"}, "reference_outputs": ["90\n"], "source_document_id": "p03164", "source_text": "Score : 100 points\n\nProblem Statement\n\nThere are N items, numbered 1, 2, \\ldots, N.\nFor each i (1 \\leq i \\leq N), Item i has a weight of w_i and a value of v_i.\n\nTaro has decided to choose some of the N items and carry them home in a knapsack.\nThe capacity of the knapsack is W, which means that the sum of the weights of items taken must be at most W.\n\nFind the maximum possible sum of the values of items that Taro takes home.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 100\n\n1 \\leq W \\leq 10^9\n\n1 \\leq w_i \\leq W\n\n1 \\leq v_i \\leq 10^3\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN W\nw_1 v_1\nw_2 v_2\n:\nw_N v_N\n\nOutput\n\nPrint the maximum possible sum of the values of items that Taro takes home.\n\nSample Input 1\n\n3 8\n3 30\n4 50\n5 60\n\nSample Output 1\n\n90\n\nItems 1 and 3 should be taken.\nThen, the sum of the weights is 3 + 5 = 8, and the sum of the values is 30 + 60 = 90.\n\nSample Input 2\n\n1 1000000000\n1000000000 10\n\nSample Output 2\n\n10\n\nSample Input 3\n\n6 15\n6 5\n5 6\n6 4\n6 6\n3 5\n7 2\n\nSample Output 3\n\n17\n\nItems 2, 4 and 5 should be taken.\nThen, the sum of the weights is 5 + 6 + 3 = 14, and the sum of the values is 6 + 6 + 5 = 17.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 31, "memory_kb": 896}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s858667097", "group_id": "codeNet:p03164", "input_text": "var F:array[0..100000] of int64;\n W,V:array[0..100000] of longint;\n i,n,m,t:longint; f1:text; max:int64;\n \n function min(x,y:int64):int64;\n begin\n if x n div 2) then s:= s + x[j];\n\n end;\n\n writeln ( s);\n readln;\n // close (f);\n\nend.", "language": "Pascal", "metadata": {"date": 1584226286, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03168.html", "problem_id": "p03168", "resource_group": "low_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/Pascal/s143643751.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s143643751", "user_id": "u428668906"}, "prompt_components": {"gold_output": "0.612\n", "input_to_evaluate": "uses crt;\nvar\n // f: text;\n x,p: array [-1..3000] of real;\n nhi: array [-1..3000,-1..3000] of real;\n i,j,n: longint;\n s: real;\n\nbegin\n // assign (f, fi); reset(f);\n readln ( n);\n for i:=1 to n do read ( p[i]);\n // close (F);\n\n // assign (f, fo); rewrite (f);\n x[0]:=1;\n for i:=1 to n do\n for j:=i downto 0 do\n begin\n\n x[j]:= x[j]*(1 - p[i]) + x[j-1]*p[i];\n if (i=n) and (j > n div 2) then s:= s + x[j];\n\n end;\n\n writeln ( s);\n readln;\n // close (f);\n\nend.", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 17, "memory_kb": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s105111260", "group_id": "codeNet:p03170", "input_text": "const fi='STONE.INP';\n fo='STONE.OUT';\n maxn=100;\n maxk=trunc(1e5);\n\nvar n,k:longint;\n a:array[1..maxn] of longint;\n f:array[0..maxk] of 0..1; {f=0-> thua, f=1->thang}\n//============================\nprocedure doc;\nvar i:longint;\nbegin\n readln(n,k);\n\n for i:=1 to n do read(a[i]);\nend;\n//============================\nprocedure xuli;\nvar i,j:longint;\n ok:boolean;\nbegin\n fillchar(f,sizeof(f),0);\n\n for i:=1 to k do\n begin\n if (i=a[j]) and (f[i-a[j]]=0) then continue;\n ok:=false; break;\n end;\n\n if ok then f[i]:=1 else f[i]:=0;\n end;\n\n if f[k]=1 then write('First')\n else write('Second');\nend;\n//============================\nBEGIN\n //assign(input,fi); reset(input);\n //assign(output,fo); rewrite(output);\n doc;\n xuli;\n //close(input); close(output);\nEND.\n", "language": "Pascal", "metadata": {"date": 1577037726, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03170.html", "problem_id": "p03170", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03170/input.txt", "sample_output_relpath": "derived/input_output/data/p03170/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03170/Pascal/s105111260.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s105111260", "user_id": "u383373065"}, "prompt_components": {"gold_output": "First\n", "input_to_evaluate": "const fi='STONE.INP';\n fo='STONE.OUT';\n maxn=100;\n maxk=trunc(1e5);\n\nvar n,k:longint;\n a:array[1..maxn] of longint;\n f:array[0..maxk] of 0..1; {f=0-> thua, f=1->thang}\n//============================\nprocedure doc;\nvar i:longint;\nbegin\n readln(n,k);\n\n for i:=1 to n do read(a[i]);\nend;\n//============================\nprocedure xuli;\nvar i,j:longint;\n ok:boolean;\nbegin\n fillchar(f,sizeof(f),0);\n\n for i:=1 to k do\n begin\n if (i=a[j]) and (f[i-a[j]]=0) then continue;\n ok:=false; break;\n end;\n\n if ok then f[i]:=1 else f[i]:=0;\n end;\n\n if f[k]=1 then write('First')\n else write('Second');\nend;\n//============================\nBEGIN\n //assign(input,fi); reset(input);\n //assign(output,fo); rewrite(output);\n doc;\n xuli;\n //close(input); close(output);\nEND.\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nThere is a set A = \\{ a_1, a_2, \\ldots, a_N \\} consisting of N positive integers.\nTaro and Jiro will play the following game against each other.\n\nInitially, we have a pile consisting of K stones.\nThe two players perform the following operation alternately, starting from Taro:\n\nChoose an element x in A, and remove exactly x stones from the pile.\n\nA player loses when he becomes unable to play.\nAssuming that both players play optimally, determine the winner.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 100\n\n1 \\leq K \\leq 10^5\n\n1 \\leq a_1 < a_2 < \\cdots < a_N \\leq K\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\nIf Taro will win, print First; if Jiro will win, print Second.\n\nSample Input 1\n\n2 4\n2 3\n\nSample Output 1\n\nFirst\n\nIf Taro removes three stones, Jiro cannot make a move.\nThus, Taro wins.\n\nSample Input 2\n\n2 5\n2 3\n\nSample Output 2\n\nSecond\n\nWhatever Taro does in his operation, Jiro wins, as follows:\n\nIf Taro removes two stones, Jiro can remove three stones to make Taro unable to make a move.\n\nIf Taro removes three stones, Jiro can remove two stones to make Taro unable to make a move.\n\nSample Input 3\n\n2 7\n2 3\n\nSample Output 3\n\nFirst\n\nTaro should remove two stones. Then, whatever Jiro does in his operation, Taro wins, as follows:\n\nIf Jiro removes two stones, Taro can remove three stones to make Jiro unable to make a move.\n\nIf Jiro removes three stones, Taro can remove two stones to make Jiro unable to make a move.\n\nSample Input 4\n\n3 20\n1 2 3\n\nSample Output 4\n\nSecond\n\nSample Input 5\n\n3 21\n1 2 3\n\nSample Output 5\n\nFirst\n\nSample Input 6\n\n1 100000\n1\n\nSample Output 6\n\nSecond", "sample_input": "2 4\n2 3\n"}, "reference_outputs": ["First\n"], "source_document_id": "p03170", "source_text": "Score : 100 points\n\nProblem Statement\n\nThere is a set A = \\{ a_1, a_2, \\ldots, a_N \\} consisting of N positive integers.\nTaro and Jiro will play the following game against each other.\n\nInitially, we have a pile consisting of K stones.\nThe two players perform the following operation alternately, starting from Taro:\n\nChoose an element x in A, and remove exactly x stones from the pile.\n\nA player loses when he becomes unable to play.\nAssuming that both players play optimally, determine the winner.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 100\n\n1 \\leq K \\leq 10^5\n\n1 \\leq a_1 < a_2 < \\cdots < a_N \\leq K\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\nIf Taro will win, print First; if Jiro will win, print Second.\n\nSample Input 1\n\n2 4\n2 3\n\nSample Output 1\n\nFirst\n\nIf Taro removes three stones, Jiro cannot make a move.\nThus, Taro wins.\n\nSample Input 2\n\n2 5\n2 3\n\nSample Output 2\n\nSecond\n\nWhatever Taro does in his operation, Jiro wins, as follows:\n\nIf Taro removes two stones, Jiro can remove three stones to make Taro unable to make a move.\n\nIf Taro removes three stones, Jiro can remove two stones to make Taro unable to make a move.\n\nSample Input 3\n\n2 7\n2 3\n\nSample Output 3\n\nFirst\n\nTaro should remove two stones. Then, whatever Jiro does in his operation, Taro wins, as follows:\n\nIf Jiro removes two stones, Taro can remove three stones to make Jiro unable to make a move.\n\nIf Jiro removes three stones, Taro can remove two stones to make Jiro unable to make a move.\n\nSample Input 4\n\n3 20\n1 2 3\n\nSample Output 4\n\nSecond\n\nSample Input 5\n\n3 21\n1 2 3\n\nSample Output 5\n\nFirst\n\nSample Input 6\n\n1 100000\n1\n\nSample Output 6\n\nSecond", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 933, "cpu_time_ms": 9, "memory_kb": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s622527826", "group_id": "codeNet:p03170", "input_text": "program Kstones;\n\nconst\n fi='kstone.inp';\n fo='kstone.out';\n\nvar\n a:array[1..100] of longint;\n f:array[0..100000] of 0..1;\n n,k: longint;\n\nprocedure nhap;\nvar i: longint;\nbegin\n\n readln(n,k);\n for i:=1 to n do read(a[i]);\n\nend;\n\nprocedure xuli;\nvar i,j: longint;\nbegin\n\n fillchar(f,sizeof(f),0);\n\n for i:=1 to n do f[a[i]]:=1;\n\n for i:=1 to k do begin\n for j:=1 to n do begin\n if (i>a[j]) then begin\n if f[i-a[j]]=0 then f[i]:=1;\n end;\n end;\n end;\n\n if f[k]=0 then write('Second')\n else write('First');\n\nend;\n\nbegin\n\n //assign(input,fi); reset(input);\n //assign(output,fo); rewrite(output);\n\n nhap;\n xuli;\n\n //close(input); close(output);\n\nend.\n", "language": "Pascal", "metadata": {"date": 1577036790, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03170.html", "problem_id": "p03170", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03170/input.txt", "sample_output_relpath": "derived/input_output/data/p03170/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03170/Pascal/s622527826.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s622527826", "user_id": "u762868299"}, "prompt_components": {"gold_output": "First\n", "input_to_evaluate": "program Kstones;\n\nconst\n fi='kstone.inp';\n fo='kstone.out';\n\nvar\n a:array[1..100] of longint;\n f:array[0..100000] of 0..1;\n n,k: longint;\n\nprocedure nhap;\nvar i: longint;\nbegin\n\n readln(n,k);\n for i:=1 to n do read(a[i]);\n\nend;\n\nprocedure xuli;\nvar i,j: longint;\nbegin\n\n fillchar(f,sizeof(f),0);\n\n for i:=1 to n do f[a[i]]:=1;\n\n for i:=1 to k do begin\n for j:=1 to n do begin\n if (i>a[j]) then begin\n if f[i-a[j]]=0 then f[i]:=1;\n end;\n end;\n end;\n\n if f[k]=0 then write('Second')\n else write('First');\n\nend;\n\nbegin\n\n //assign(input,fi); reset(input);\n //assign(output,fo); rewrite(output);\n\n nhap;\n xuli;\n\n //close(input); close(output);\n\nend.\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nThere is a set A = \\{ a_1, a_2, \\ldots, a_N \\} consisting of N positive integers.\nTaro and Jiro will play the following game against each other.\n\nInitially, we have a pile consisting of K stones.\nThe two players perform the following operation alternately, starting from Taro:\n\nChoose an element x in A, and remove exactly x stones from the pile.\n\nA player loses when he becomes unable to play.\nAssuming that both players play optimally, determine the winner.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 100\n\n1 \\leq K \\leq 10^5\n\n1 \\leq a_1 < a_2 < \\cdots < a_N \\leq K\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\nIf Taro will win, print First; if Jiro will win, print Second.\n\nSample Input 1\n\n2 4\n2 3\n\nSample Output 1\n\nFirst\n\nIf Taro removes three stones, Jiro cannot make a move.\nThus, Taro wins.\n\nSample Input 2\n\n2 5\n2 3\n\nSample Output 2\n\nSecond\n\nWhatever Taro does in his operation, Jiro wins, as follows:\n\nIf Taro removes two stones, Jiro can remove three stones to make Taro unable to make a move.\n\nIf Taro removes three stones, Jiro can remove two stones to make Taro unable to make a move.\n\nSample Input 3\n\n2 7\n2 3\n\nSample Output 3\n\nFirst\n\nTaro should remove two stones. Then, whatever Jiro does in his operation, Taro wins, as follows:\n\nIf Jiro removes two stones, Taro can remove three stones to make Jiro unable to make a move.\n\nIf Jiro removes three stones, Taro can remove two stones to make Jiro unable to make a move.\n\nSample Input 4\n\n3 20\n1 2 3\n\nSample Output 4\n\nSecond\n\nSample Input 5\n\n3 21\n1 2 3\n\nSample Output 5\n\nFirst\n\nSample Input 6\n\n1 100000\n1\n\nSample Output 6\n\nSecond", "sample_input": "2 4\n2 3\n"}, "reference_outputs": ["First\n"], "source_document_id": "p03170", "source_text": "Score : 100 points\n\nProblem Statement\n\nThere is a set A = \\{ a_1, a_2, \\ldots, a_N \\} consisting of N positive integers.\nTaro and Jiro will play the following game against each other.\n\nInitially, we have a pile consisting of K stones.\nThe two players perform the following operation alternately, starting from Taro:\n\nChoose an element x in A, and remove exactly x stones from the pile.\n\nA player loses when he becomes unable to play.\nAssuming that both players play optimally, determine the winner.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 100\n\n1 \\leq K \\leq 10^5\n\n1 \\leq a_1 < a_2 < \\cdots < a_N \\leq K\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\nIf Taro will win, print First; if Jiro will win, print Second.\n\nSample Input 1\n\n2 4\n2 3\n\nSample Output 1\n\nFirst\n\nIf Taro removes three stones, Jiro cannot make a move.\nThus, Taro wins.\n\nSample Input 2\n\n2 5\n2 3\n\nSample Output 2\n\nSecond\n\nWhatever Taro does in his operation, Jiro wins, as follows:\n\nIf Taro removes two stones, Jiro can remove three stones to make Taro unable to make a move.\n\nIf Taro removes three stones, Jiro can remove two stones to make Taro unable to make a move.\n\nSample Input 3\n\n2 7\n2 3\n\nSample Output 3\n\nFirst\n\nTaro should remove two stones. Then, whatever Jiro does in his operation, Taro wins, as follows:\n\nIf Jiro removes two stones, Taro can remove three stones to make Jiro unable to make a move.\n\nIf Jiro removes three stones, Taro can remove two stones to make Jiro unable to make a move.\n\nSample Input 4\n\n3 20\n1 2 3\n\nSample Output 4\n\nSecond\n\nSample Input 5\n\n3 21\n1 2 3\n\nSample Output 5\n\nFirst\n\nSample Input 6\n\n1 100000\n1\n\nSample Output 6\n\nSecond", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 24, "memory_kb": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s474066791", "group_id": "codeNet:p03171", "input_text": "uses math;\nconst fi='l_deque.inp';\n fo='l_deque.out';\n maxn=3000;\nvar n:int32;\n sum,f:array[0..maxn,0..maxn] of int64;\n a:array[1..maxn] of int32;\n//=============================\nprocedure nhap;\nvar i:int32;\nbegin\n readln(n);\n for i:=1 to n do\n begin read(a[i]); sum[1,i]:=sum[1,i-1]+a[i]; end;\nend;\n//=============================\nfunction max(x,y:int64):int64;\nbegin\n if x>y then exit(x)\n else exit(y);\nend;\n//=============================\nprocedure xuli;\nvar i,j:int32;\nbegin\n for i:=1 to n do\n for j:=n downto i do sum[i,j]:=sum[1,j]-sum[1,i-1];\n for i:=1 to n do f[i,i]:=a[i];\n for i:=n-1 downto 1 do\n for j:=i+1 to n do\n f[i,j]:=max(sum[i,j]-f[i+1,j],sum[i,j]-f[i,j-1]);\n write(2*f[1,n]-sum[1,n]);\nend;\n//=============================\nbegin\n// assign(input,fi); reset(input);\n// assign(output,fo); rewrite(output);\n nhap;\n xuli;\n// close(input); close(output);\nend.\n", "language": "Pascal", "metadata": {"date": 1577048845, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03171.html", "problem_id": "p03171", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03171/input.txt", "sample_output_relpath": "derived/input_output/data/p03171/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03171/Pascal/s474066791.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s474066791", "user_id": "u801427196"}, "prompt_components": {"gold_output": "10\n", "input_to_evaluate": "uses math;\nconst fi='l_deque.inp';\n fo='l_deque.out';\n maxn=3000;\nvar n:int32;\n sum,f:array[0..maxn,0..maxn] of int64;\n a:array[1..maxn] of int32;\n//=============================\nprocedure nhap;\nvar i:int32;\nbegin\n readln(n);\n for i:=1 to n do\n begin read(a[i]); sum[1,i]:=sum[1,i-1]+a[i]; end;\nend;\n//=============================\nfunction max(x,y:int64):int64;\nbegin\n if x>y then exit(x)\n else exit(y);\nend;\n//=============================\nprocedure xuli;\nvar i,j:int32;\nbegin\n for i:=1 to n do\n for j:=n downto i do sum[i,j]:=sum[1,j]-sum[1,i-1];\n for i:=1 to n do f[i,i]:=a[i];\n for i:=n-1 downto 1 do\n for j:=i+1 to n do\n f[i,j]:=max(sum[i,j]-f[i+1,j],sum[i,j]-f[i,j-1]);\n write(2*f[1,n]-sum[1,n]);\nend;\n//=============================\nbegin\n// assign(input,fi); reset(input);\n// assign(output,fo); rewrite(output);\n nhap;\n xuli;\n// close(input); close(output);\nend.\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nTaro and Jiro will play the following game against each other.\n\nInitially, they are given a sequence a = (a_1, a_2, \\ldots, a_N).\nUntil a becomes empty, the two players perform the following operation alternately, starting from Taro:\n\nRemove the element at the beginning or the end of a. The player earns x points, where x is the removed element.\n\nLet X and Y be Taro's and Jiro's total score at the end of the game, respectively.\nTaro tries to maximize X - Y, while Jiro tries to minimize X - Y.\n\nAssuming that the two players play optimally, find the resulting value of X - Y.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 3000\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 \\ldots a_N\n\nOutput\n\nPrint the resulting value of X - Y, assuming that the two players play optimally.\n\nSample Input 1\n\n4\n10 80 90 30\n\nSample Output 1\n\n10\n\nThe game proceeds as follows when the two players play optimally (the element being removed is written bold):\n\nTaro: (10, 80, 90, 30) → (10, 80, 90)\n\nJiro: (10, 80, 90) → (10, 80)\n\nTaro: (10, 80) → (10)\n\nJiro: (10) → ()\n\nHere, X = 30 + 80 = 110 and Y = 90 + 10 = 100.\n\nSample Input 2\n\n3\n10 100 10\n\nSample Output 2\n\n-80\n\nThe game proceeds, for example, as follows when the two players play optimally:\n\nTaro: (10, 100, 10) → (100, 10)\n\nJiro: (100, 10) → (10)\n\nTaro: (10) → ()\n\nHere, X = 10 + 10 = 20 and Y = 100.\n\nSample Input 3\n\n1\n10\n\nSample Output 3\n\n10\n\nSample Input 4\n\n10\n1000000000 1 1000000000 1 1000000000 1 1000000000 1 1000000000 1\n\nSample Output 4\n\n4999999995\n\nThe answer may not fit into a 32-bit integer type.\n\nSample Input 5\n\n6\n4 2 9 7 1 5\n\nSample Output 5\n\n2\n\nThe game proceeds, for example, as follows when the two players play optimally:\n\nTaro: (4, 2, 9, 7, 1, 5) → (4, 2, 9, 7, 1)\n\nJiro: (4, 2, 9, 7, 1) → (2, 9, 7, 1)\n\nTaro: (2, 9, 7, 1) → (2, 9, 7)\n\nJiro: (2, 9, 7) → (2, 9)\n\nTaro: (2, 9) → (2)\n\nJiro: (2) → ()\n\nHere, X = 5 + 1 + 9 = 15 and Y = 4 + 7 + 2 = 13.", "sample_input": "4\n10 80 90 30\n"}, "reference_outputs": ["10\n"], "source_document_id": "p03171", "source_text": "Score : 100 points\n\nProblem Statement\n\nTaro and Jiro will play the following game against each other.\n\nInitially, they are given a sequence a = (a_1, a_2, \\ldots, a_N).\nUntil a becomes empty, the two players perform the following operation alternately, starting from Taro:\n\nRemove the element at the beginning or the end of a. The player earns x points, where x is the removed element.\n\nLet X and Y be Taro's and Jiro's total score at the end of the game, respectively.\nTaro tries to maximize X - Y, while Jiro tries to minimize X - Y.\n\nAssuming that the two players play optimally, find the resulting value of X - Y.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 3000\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 \\ldots a_N\n\nOutput\n\nPrint the resulting value of X - Y, assuming that the two players play optimally.\n\nSample Input 1\n\n4\n10 80 90 30\n\nSample Output 1\n\n10\n\nThe game proceeds as follows when the two players play optimally (the element being removed is written bold):\n\nTaro: (10, 80, 90, 30) → (10, 80, 90)\n\nJiro: (10, 80, 90) → (10, 80)\n\nTaro: (10, 80) → (10)\n\nJiro: (10) → ()\n\nHere, X = 30 + 80 = 110 and Y = 90 + 10 = 100.\n\nSample Input 2\n\n3\n10 100 10\n\nSample Output 2\n\n-80\n\nThe game proceeds, for example, as follows when the two players play optimally:\n\nTaro: (10, 100, 10) → (100, 10)\n\nJiro: (100, 10) → (10)\n\nTaro: (10) → ()\n\nHere, X = 10 + 10 = 20 and Y = 100.\n\nSample Input 3\n\n1\n10\n\nSample Output 3\n\n10\n\nSample Input 4\n\n10\n1000000000 1 1000000000 1 1000000000 1 1000000000 1 1000000000 1\n\nSample Output 4\n\n4999999995\n\nThe answer may not fit into a 32-bit integer type.\n\nSample Input 5\n\n6\n4 2 9 7 1 5\n\nSample Output 5\n\n2\n\nThe game proceeds, for example, as follows when the two players play optimally:\n\nTaro: (4, 2, 9, 7, 1, 5) → (4, 2, 9, 7, 1)\n\nJiro: (4, 2, 9, 7, 1) → (2, 9, 7, 1)\n\nTaro: (2, 9, 7, 1) → (2, 9, 7)\n\nJiro: (2, 9, 7) → (2, 9)\n\nTaro: (2, 9) → (2)\n\nJiro: (2) → ()\n\nHere, X = 5 + 1 + 9 = 15 and Y = 4 + 7 + 2 = 13.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 926, "cpu_time_ms": 68, "memory_kb": 139392}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s689489373", "group_id": "codeNet:p03171", "input_text": "uses math;\nconst fi='DEQUE.INP';\n fo='DEQUE.OUT';\n maxn=3000;\n\nvar n:longint;\n a:array[1..maxn] of longint;\n s:array[0..maxn] of int64;\n f:array[1..maxn,1..maxn] of int64;\n//============================\nprocedure doc;\nvar i:longint;\nbegin\n readln(n);\n\n for i:=1 to n do read(a[i]);\n\nend;\n//============================\nprocedure tinhs;\nvar i:longint;\nbegin\n s[0]:=0;\n s[1]:=a[1];\n for i:=2 to n do s[i]:=s[i-1]+a[i];\nend;\n//============================\nfunction sum(i,j:longint):int64;\nbegin\n sum:=s[j]-s[i-1];\nend;\n//============================\nprocedure xuli;\nvar l,r,i:longint;\nbegin\n tinhs;\n\n for i:=1 to n do f[i,i]:=a[i];\n\n for l:=n-1 to 1 do\n for r:=l+1 to n do\n f[l,r]:=max(sum(l,r)-f[l+1,r],sum(l,r)-f[l,r-1]);\n\n write(f[1,n]-(sum(1,n)-f[1,n]));\nend;\n//============================\nBEGIN\n //assign(input,fi); reset(input);\n //assign(output,fo); rewrite(output);\n doc;\n xuli;\n //close(input); close(output);\nEND.\n", "language": "Pascal", "metadata": {"date": 1577040266, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03171.html", "problem_id": "p03171", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03171/input.txt", "sample_output_relpath": "derived/input_output/data/p03171/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03171/Pascal/s689489373.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s689489373", "user_id": "u383373065"}, "prompt_components": {"gold_output": "10\n", "input_to_evaluate": "uses math;\nconst fi='DEQUE.INP';\n fo='DEQUE.OUT';\n maxn=3000;\n\nvar n:longint;\n a:array[1..maxn] of longint;\n s:array[0..maxn] of int64;\n f:array[1..maxn,1..maxn] of int64;\n//============================\nprocedure doc;\nvar i:longint;\nbegin\n readln(n);\n\n for i:=1 to n do read(a[i]);\n\nend;\n//============================\nprocedure tinhs;\nvar i:longint;\nbegin\n s[0]:=0;\n s[1]:=a[1];\n for i:=2 to n do s[i]:=s[i-1]+a[i];\nend;\n//============================\nfunction sum(i,j:longint):int64;\nbegin\n sum:=s[j]-s[i-1];\nend;\n//============================\nprocedure xuli;\nvar l,r,i:longint;\nbegin\n tinhs;\n\n for i:=1 to n do f[i,i]:=a[i];\n\n for l:=n-1 to 1 do\n for r:=l+1 to n do\n f[l,r]:=max(sum(l,r)-f[l+1,r],sum(l,r)-f[l,r-1]);\n\n write(f[1,n]-(sum(1,n)-f[1,n]));\nend;\n//============================\nBEGIN\n //assign(input,fi); reset(input);\n //assign(output,fo); rewrite(output);\n doc;\n xuli;\n //close(input); close(output);\nEND.\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nTaro and Jiro will play the following game against each other.\n\nInitially, they are given a sequence a = (a_1, a_2, \\ldots, a_N).\nUntil a becomes empty, the two players perform the following operation alternately, starting from Taro:\n\nRemove the element at the beginning or the end of a. The player earns x points, where x is the removed element.\n\nLet X and Y be Taro's and Jiro's total score at the end of the game, respectively.\nTaro tries to maximize X - Y, while Jiro tries to minimize X - Y.\n\nAssuming that the two players play optimally, find the resulting value of X - Y.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 3000\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 \\ldots a_N\n\nOutput\n\nPrint the resulting value of X - Y, assuming that the two players play optimally.\n\nSample Input 1\n\n4\n10 80 90 30\n\nSample Output 1\n\n10\n\nThe game proceeds as follows when the two players play optimally (the element being removed is written bold):\n\nTaro: (10, 80, 90, 30) → (10, 80, 90)\n\nJiro: (10, 80, 90) → (10, 80)\n\nTaro: (10, 80) → (10)\n\nJiro: (10) → ()\n\nHere, X = 30 + 80 = 110 and Y = 90 + 10 = 100.\n\nSample Input 2\n\n3\n10 100 10\n\nSample Output 2\n\n-80\n\nThe game proceeds, for example, as follows when the two players play optimally:\n\nTaro: (10, 100, 10) → (100, 10)\n\nJiro: (100, 10) → (10)\n\nTaro: (10) → ()\n\nHere, X = 10 + 10 = 20 and Y = 100.\n\nSample Input 3\n\n1\n10\n\nSample Output 3\n\n10\n\nSample Input 4\n\n10\n1000000000 1 1000000000 1 1000000000 1 1000000000 1 1000000000 1\n\nSample Output 4\n\n4999999995\n\nThe answer may not fit into a 32-bit integer type.\n\nSample Input 5\n\n6\n4 2 9 7 1 5\n\nSample Output 5\n\n2\n\nThe game proceeds, for example, as follows when the two players play optimally:\n\nTaro: (4, 2, 9, 7, 1, 5) → (4, 2, 9, 7, 1)\n\nJiro: (4, 2, 9, 7, 1) → (2, 9, 7, 1)\n\nTaro: (2, 9, 7, 1) → (2, 9, 7)\n\nJiro: (2, 9, 7) → (2, 9)\n\nTaro: (2, 9) → (2)\n\nJiro: (2) → ()\n\nHere, X = 5 + 1 + 9 = 15 and Y = 4 + 7 + 2 = 13.", "sample_input": "4\n10 80 90 30\n"}, "reference_outputs": ["10\n"], "source_document_id": "p03171", "source_text": "Score : 100 points\n\nProblem Statement\n\nTaro and Jiro will play the following game against each other.\n\nInitially, they are given a sequence a = (a_1, a_2, \\ldots, a_N).\nUntil a becomes empty, the two players perform the following operation alternately, starting from Taro:\n\nRemove the element at the beginning or the end of a. The player earns x points, where x is the removed element.\n\nLet X and Y be Taro's and Jiro's total score at the end of the game, respectively.\nTaro tries to maximize X - Y, while Jiro tries to minimize X - Y.\n\nAssuming that the two players play optimally, find the resulting value of X - Y.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 3000\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 \\ldots a_N\n\nOutput\n\nPrint the resulting value of X - Y, assuming that the two players play optimally.\n\nSample Input 1\n\n4\n10 80 90 30\n\nSample Output 1\n\n10\n\nThe game proceeds as follows when the two players play optimally (the element being removed is written bold):\n\nTaro: (10, 80, 90, 30) → (10, 80, 90)\n\nJiro: (10, 80, 90) → (10, 80)\n\nTaro: (10, 80) → (10)\n\nJiro: (10) → ()\n\nHere, X = 30 + 80 = 110 and Y = 90 + 10 = 100.\n\nSample Input 2\n\n3\n10 100 10\n\nSample Output 2\n\n-80\n\nThe game proceeds, for example, as follows when the two players play optimally:\n\nTaro: (10, 100, 10) → (100, 10)\n\nJiro: (100, 10) → (10)\n\nTaro: (10) → ()\n\nHere, X = 10 + 10 = 20 and Y = 100.\n\nSample Input 3\n\n1\n10\n\nSample Output 3\n\n10\n\nSample Input 4\n\n10\n1000000000 1 1000000000 1 1000000000 1 1000000000 1 1000000000 1\n\nSample Output 4\n\n4999999995\n\nThe answer may not fit into a 32-bit integer type.\n\nSample Input 5\n\n6\n4 2 9 7 1 5\n\nSample Output 5\n\n2\n\nThe game proceeds, for example, as follows when the two players play optimally:\n\nTaro: (4, 2, 9, 7, 1, 5) → (4, 2, 9, 7, 1)\n\nJiro: (4, 2, 9, 7, 1) → (2, 9, 7, 1)\n\nTaro: (2, 9, 7, 1) → (2, 9, 7)\n\nJiro: (2, 9, 7) → (2, 9)\n\nTaro: (2, 9) → (2)\n\nJiro: (2) → ()\n\nHere, X = 5 + 1 + 9 = 15 and Y = 4 + 7 + 2 = 13.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 964, "cpu_time_ms": 14, "memory_kb": 68224}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s604753716", "group_id": "codeNet:p03171", "input_text": "program LDeque;\n\nuses math;\n\nconst\n fi='LDeque.inp';\n fo='LDeque.out';\n\nvar\n n: longint;\n a:array[0..3000] of int64;\n\nprocedure nhap;\nvar i: longint;\nbegin\n\n readln(n);\n for i:=1 to n do read(a[i]);\n\nend;\n\nprocedure xuli;\nvar i,j: longint; k:boolean; ans:int64;\nbegin\n\n i:=1; j:=n; k:=true;\n ans:=0;\n repeat\n if a[i]>a[j] then begin\n ans:=ifthen(k,ans+a[i],ans-a[i]);\n inc(i);\n end else begin\n ans:=ifthen(k,ans+a[j],ans-a[j]);\n dec(j);\n end;\n k:=not(k);\n until i>j;\n\n writeln(ans);\n\nend;\n\nbegin\n\n //assign(input,fi); reseT(input);\n //assign(output,fo); rewrite(output);\n\n nhap;\n xuli;\n\n //close(input); close(output);\n\nend.\n", "language": "Pascal", "metadata": {"date": 1577038427, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03171.html", "problem_id": "p03171", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03171/input.txt", "sample_output_relpath": "derived/input_output/data/p03171/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03171/Pascal/s604753716.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s604753716", "user_id": "u762868299"}, "prompt_components": {"gold_output": "10\n", "input_to_evaluate": "program LDeque;\n\nuses math;\n\nconst\n fi='LDeque.inp';\n fo='LDeque.out';\n\nvar\n n: longint;\n a:array[0..3000] of int64;\n\nprocedure nhap;\nvar i: longint;\nbegin\n\n readln(n);\n for i:=1 to n do read(a[i]);\n\nend;\n\nprocedure xuli;\nvar i,j: longint; k:boolean; ans:int64;\nbegin\n\n i:=1; j:=n; k:=true;\n ans:=0;\n repeat\n if a[i]>a[j] then begin\n ans:=ifthen(k,ans+a[i],ans-a[i]);\n inc(i);\n end else begin\n ans:=ifthen(k,ans+a[j],ans-a[j]);\n dec(j);\n end;\n k:=not(k);\n until i>j;\n\n writeln(ans);\n\nend;\n\nbegin\n\n //assign(input,fi); reseT(input);\n //assign(output,fo); rewrite(output);\n\n nhap;\n xuli;\n\n //close(input); close(output);\n\nend.\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nTaro and Jiro will play the following game against each other.\n\nInitially, they are given a sequence a = (a_1, a_2, \\ldots, a_N).\nUntil a becomes empty, the two players perform the following operation alternately, starting from Taro:\n\nRemove the element at the beginning or the end of a. The player earns x points, where x is the removed element.\n\nLet X and Y be Taro's and Jiro's total score at the end of the game, respectively.\nTaro tries to maximize X - Y, while Jiro tries to minimize X - Y.\n\nAssuming that the two players play optimally, find the resulting value of X - Y.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 3000\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 \\ldots a_N\n\nOutput\n\nPrint the resulting value of X - Y, assuming that the two players play optimally.\n\nSample Input 1\n\n4\n10 80 90 30\n\nSample Output 1\n\n10\n\nThe game proceeds as follows when the two players play optimally (the element being removed is written bold):\n\nTaro: (10, 80, 90, 30) → (10, 80, 90)\n\nJiro: (10, 80, 90) → (10, 80)\n\nTaro: (10, 80) → (10)\n\nJiro: (10) → ()\n\nHere, X = 30 + 80 = 110 and Y = 90 + 10 = 100.\n\nSample Input 2\n\n3\n10 100 10\n\nSample Output 2\n\n-80\n\nThe game proceeds, for example, as follows when the two players play optimally:\n\nTaro: (10, 100, 10) → (100, 10)\n\nJiro: (100, 10) → (10)\n\nTaro: (10) → ()\n\nHere, X = 10 + 10 = 20 and Y = 100.\n\nSample Input 3\n\n1\n10\n\nSample Output 3\n\n10\n\nSample Input 4\n\n10\n1000000000 1 1000000000 1 1000000000 1 1000000000 1 1000000000 1\n\nSample Output 4\n\n4999999995\n\nThe answer may not fit into a 32-bit integer type.\n\nSample Input 5\n\n6\n4 2 9 7 1 5\n\nSample Output 5\n\n2\n\nThe game proceeds, for example, as follows when the two players play optimally:\n\nTaro: (4, 2, 9, 7, 1, 5) → (4, 2, 9, 7, 1)\n\nJiro: (4, 2, 9, 7, 1) → (2, 9, 7, 1)\n\nTaro: (2, 9, 7, 1) → (2, 9, 7)\n\nJiro: (2, 9, 7) → (2, 9)\n\nTaro: (2, 9) → (2)\n\nJiro: (2) → ()\n\nHere, X = 5 + 1 + 9 = 15 and Y = 4 + 7 + 2 = 13.", "sample_input": "4\n10 80 90 30\n"}, "reference_outputs": ["10\n"], "source_document_id": "p03171", "source_text": "Score : 100 points\n\nProblem Statement\n\nTaro and Jiro will play the following game against each other.\n\nInitially, they are given a sequence a = (a_1, a_2, \\ldots, a_N).\nUntil a becomes empty, the two players perform the following operation alternately, starting from Taro:\n\nRemove the element at the beginning or the end of a. The player earns x points, where x is the removed element.\n\nLet X and Y be Taro's and Jiro's total score at the end of the game, respectively.\nTaro tries to maximize X - Y, while Jiro tries to minimize X - Y.\n\nAssuming that the two players play optimally, find the resulting value of X - Y.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 3000\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 \\ldots a_N\n\nOutput\n\nPrint the resulting value of X - Y, assuming that the two players play optimally.\n\nSample Input 1\n\n4\n10 80 90 30\n\nSample Output 1\n\n10\n\nThe game proceeds as follows when the two players play optimally (the element being removed is written bold):\n\nTaro: (10, 80, 90, 30) → (10, 80, 90)\n\nJiro: (10, 80, 90) → (10, 80)\n\nTaro: (10, 80) → (10)\n\nJiro: (10) → ()\n\nHere, X = 30 + 80 = 110 and Y = 90 + 10 = 100.\n\nSample Input 2\n\n3\n10 100 10\n\nSample Output 2\n\n-80\n\nThe game proceeds, for example, as follows when the two players play optimally:\n\nTaro: (10, 100, 10) → (100, 10)\n\nJiro: (100, 10) → (10)\n\nTaro: (10) → ()\n\nHere, X = 10 + 10 = 20 and Y = 100.\n\nSample Input 3\n\n1\n10\n\nSample Output 3\n\n10\n\nSample Input 4\n\n10\n1000000000 1 1000000000 1 1000000000 1 1000000000 1 1000000000 1\n\nSample Output 4\n\n4999999995\n\nThe answer may not fit into a 32-bit integer type.\n\nSample Input 5\n\n6\n4 2 9 7 1 5\n\nSample Output 5\n\n2\n\nThe game proceeds, for example, as follows when the two players play optimally:\n\nTaro: (4, 2, 9, 7, 1, 5) → (4, 2, 9, 7, 1)\n\nJiro: (4, 2, 9, 7, 1) → (2, 9, 7, 1)\n\nTaro: (2, 9, 7, 1) → (2, 9, 7)\n\nJiro: (2, 9, 7) → (2, 9)\n\nTaro: (2, 9) → (2)\n\nJiro: (2) → ()\n\nHere, X = 5 + 1 + 9 = 15 and Y = 4 + 7 + 2 = 13.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 688, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s779485578", "group_id": "codeNet:p03172", "input_text": "var a: array[1..1000] of longint;\n dp, p: array[-10..150, -110000..200000] of longint; \n i, j, N, K: longint;\nbegin\n readln(N, K);\n for i:=1 to N do\n read(a[i]);\n for i:=0 to a[1] do\n begin\n dp[1,i]:=1;\n end;\n for i:=0 to K do\n p[1,i]:=p[1,i-1]+dp[1,i];\n for i:=2 to N do\n begin\n for j:=0 to K do\n begin\n dp[i,j]:=(p[i-1,j]-p[i-1,j-a[i]-1]) mod 1000000007;\n if dp[i,j]<0 then\n dp[i,j]:=dp[i,j]+1000000007;\n p[i,j]:=(p[i,j-1]+dp[i,j]) mod 1000000007;\n// write(dp[i,j], ' ');\n end;\n// writeln;\n end;\n writeln(dp[N,K]);\nend.\n", "language": "Pascal", "metadata": {"date": 1590092220, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03172.html", "problem_id": "p03172", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03172/input.txt", "sample_output_relpath": "derived/input_output/data/p03172/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03172/Pascal/s779485578.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s779485578", "user_id": "u089230684"}, "prompt_components": {"gold_output": "5\n", "input_to_evaluate": "var a: array[1..1000] of longint;\n dp, p: array[-10..150, -110000..200000] of longint; \n i, j, N, K: longint;\nbegin\n readln(N, K);\n for i:=1 to N do\n read(a[i]);\n for i:=0 to a[1] do\n begin\n dp[1,i]:=1;\n end;\n for i:=0 to K do\n p[1,i]:=p[1,i-1]+dp[1,i];\n for i:=2 to N do\n begin\n for j:=0 to K do\n begin\n dp[i,j]:=(p[i-1,j]-p[i-1,j-a[i]-1]) mod 1000000007;\n if dp[i,j]<0 then\n dp[i,j]:=dp[i,j]+1000000007;\n p[i,j]:=(p[i,j-1]+dp[i,j]) mod 1000000007;\n// write(dp[i,j], ' ');\n end;\n// writeln;\n end;\n writeln(dp[N,K]);\nend.\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nThere are N children, numbered 1, 2, \\ldots, N.\n\nThey have decided to share K candies among themselves.\nHere, for each i (1 \\leq i \\leq N), Child i must receive between 0 and a_i candies (inclusive).\nAlso, no candies should be left over.\n\nFind the number of ways for them to share candies, modulo 10^9 + 7.\nHere, two ways are said to be different when there exists a child who receives a different number of candies.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 100\n\n0 \\leq K \\leq 10^5\n\n0 \\leq a_i \\leq K\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 number of ways for the children to share candies, modulo 10^9 + 7.\n\nSample Input 1\n\n3 4\n1 2 3\n\nSample Output 1\n\n5\n\nThere are five ways for the children to share candies, as follows:\n\n(0, 1, 3)\n\n(0, 2, 2)\n\n(1, 0, 3)\n\n(1, 1, 2)\n\n(1, 2, 1)\n\nHere, in each sequence, the i-th element represents the number of candies that Child i receives.\n\nSample Input 2\n\n1 10\n9\n\nSample Output 2\n\n0\n\nThere may be no ways for the children to share candies.\n\nSample Input 3\n\n2 0\n0 0\n\nSample Output 3\n\n1\n\nThere is one way for the children to share candies, as follows:\n\n(0, 0)\n\nSample Input 4\n\n4 100000\n100000 100000 100000 100000\n\nSample Output 4\n\n665683269\n\nBe sure to print the answer modulo 10^9 + 7.", "sample_input": "3 4\n1 2 3\n"}, "reference_outputs": ["5\n"], "source_document_id": "p03172", "source_text": "Score : 100 points\n\nProblem Statement\n\nThere are N children, numbered 1, 2, \\ldots, N.\n\nThey have decided to share K candies among themselves.\nHere, for each i (1 \\leq i \\leq N), Child i must receive between 0 and a_i candies (inclusive).\nAlso, no candies should be left over.\n\nFind the number of ways for them to share candies, modulo 10^9 + 7.\nHere, two ways are said to be different when there exists a child who receives a different number of candies.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 100\n\n0 \\leq K \\leq 10^5\n\n0 \\leq a_i \\leq K\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 number of ways for the children to share candies, modulo 10^9 + 7.\n\nSample Input 1\n\n3 4\n1 2 3\n\nSample Output 1\n\n5\n\nThere are five ways for the children to share candies, as follows:\n\n(0, 1, 3)\n\n(0, 2, 2)\n\n(1, 0, 3)\n\n(1, 1, 2)\n\n(1, 2, 1)\n\nHere, in each sequence, the i-th element represents the number of candies that Child i receives.\n\nSample Input 2\n\n1 10\n9\n\nSample Output 2\n\n0\n\nThere may be no ways for the children to share candies.\n\nSample Input 3\n\n2 0\n0 0\n\nSample Output 3\n\n1\n\nThere is one way for the children to share candies, as follows:\n\n(0, 0)\n\nSample Input 4\n\n4 100000\n100000 100000 100000 100000\n\nSample Output 4\n\n665683269\n\nBe sure to print the answer modulo 10^9 + 7.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 669, "cpu_time_ms": 350, "memory_kb": 245888}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s570156585", "group_id": "codeNet:p03178", "input_text": "uses math;\nconst fi='digitnum.inp';\n fo='digitnum.out';\n maxn=1000;\n modu=trunc(1e9)+7;\nvar f:array[1..maxn,0..99,0..2] of uint64;\n s:ansistring;\n d,len:int16;\nprocedure nhap;\nbegin\n readln(s);\n read(d);\nend;\nprocedure init;\nvar i,j,x:int32;\nbegin\n x:=ord(s[1])-48;\n for i:=1 to 9 do\n begin\n if ix then j:=2\n else j:=1;\n inc(f[1,i mod d,j]);\n end;\nend;\nfunction calc(n:ansistring):uint64;\nvar i,j,r,st,x,newst,newr:int32;\n ans:uint64;\nbegin\n len:=length(n);\n for i:=1 to len-1 do\n for r:=0 to d-1 do\n for st:=0 to 2 do\n begin\n x:=ord(n[i+1])-48;\n for j:=0 to 9 do\n begin\n newst:=st;\n if newst=1 then\n begin\n if jx then newst:=2\n else newst:=1;\n end;\n newr:=(r+j) mod d;\n f[i+1,newr,newst]:=(f[i+1,newr,newst]+f[i,r,st]) mod modu;\n end;\n end;\n ans:=0;\n for i:=1 to len-1 do\n for j:=0 to 2 do inc(ans,f[i,0,j]);\n exit((ans+f[len,0,0]+f[len,0,1]) mod modu);\nend;\n\nprocedure xuli;\nbegin\n init;\n write(calc(s));\nend;\nbegin\n// assign(input,fi); reset(input);\n// assign(output,fo); rewrite(output);\n nhap;\n xuli;\n// close(input); close(output);\nend.\n", "language": "Pascal", "metadata": {"date": 1576993198, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03178.html", "problem_id": "p03178", "resource_group": "low_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/Pascal/s570156585.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s570156585", "user_id": "u801427196"}, "prompt_components": {"gold_output": "6\n", "input_to_evaluate": "uses math;\nconst fi='digitnum.inp';\n fo='digitnum.out';\n maxn=1000;\n modu=trunc(1e9)+7;\nvar f:array[1..maxn,0..99,0..2] of uint64;\n s:ansistring;\n d,len:int16;\nprocedure nhap;\nbegin\n readln(s);\n read(d);\nend;\nprocedure init;\nvar i,j,x:int32;\nbegin\n x:=ord(s[1])-48;\n for i:=1 to 9 do\n begin\n if ix then j:=2\n else j:=1;\n inc(f[1,i mod d,j]);\n end;\nend;\nfunction calc(n:ansistring):uint64;\nvar i,j,r,st,x,newst,newr:int32;\n ans:uint64;\nbegin\n len:=length(n);\n for i:=1 to len-1 do\n for r:=0 to d-1 do\n for st:=0 to 2 do\n begin\n x:=ord(n[i+1])-48;\n for j:=0 to 9 do\n begin\n newst:=st;\n if newst=1 then\n begin\n if jx then newst:=2\n else newst:=1;\n end;\n newr:=(r+j) mod d;\n f[i+1,newr,newst]:=(f[i+1,newr,newst]+f[i,r,st]) mod modu;\n end;\n end;\n ans:=0;\n for i:=1 to len-1 do\n for j:=0 to 2 do inc(ans,f[i,0,j]);\n exit((ans+f[len,0,0]+f[len,0,1]) mod modu);\nend;\n\nprocedure xuli;\nbegin\n init;\n write(calc(s));\nend;\nbegin\n// assign(input,fi); reset(input);\n// assign(output,fo); rewrite(output);\n nhap;\n xuli;\n// close(input); close(output);\nend.\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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1357, "cpu_time_ms": 170, "memory_kb": 2560}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s034766996", "group_id": "codeNet:p03178", "input_text": "uses math;\nconst fi='digitnum.inp';\n fo='digitnum.out';\n maxn=1000;\n modu=trunc(1e9)+7;\nvar f:array[1..maxn,0..99,0..2] of int32;\n s:ansistring;\n d,len:int16;\nprocedure nhap;\nbegin\n readln(s);\n read(d);\nend;\nprocedure init;\nvar i,j,x:int32;\nbegin\n x:=ord(s[1])-48;\n for i:=1 to 9 do\n begin\n if ix then j:=2\n else j:=1;\n inc(f[1,i mod d,j]);\n end;\nend;\nfunction calc(n:ansistring):uint64;\nvar i,j,r,st,x,newst,newr:int32;\n ans:uint64;\nbegin\n len:=length(n);\n for i:=1 to len-1 do\n for r:=0 to d-1 do\n for st:=0 to 2 do\n begin\n x:=ord(n[i+1])-48;\n for j:=0 to 9 do\n begin\n newst:=st;\n if newst=1 then\n begin\n if jx then newst:=2\n else newst:=1;\n end;\n newr:=(r+j) mod d;\n f[i+1,newr,newst]:=(f[i+1,newr,newst]+f[i,r,st]) mod modu;\n end;\n end;\n ans:=0;\n for i:=1 to len-1 do\n for j:=0 to 2 do inc(ans,f[i,0,j]);\n exit((ans+f[len,0,0]+f[len,0,1]) mod modu);\nend;\n\nprocedure xuli;\nbegin\n init;\n write(calc(s));\nend;\nbegin\n// assign(input,fi); reset(input);\n// assign(output,fo); rewrite(output);\n nhap;\n xuli;\n// close(input); close(output);\nend.\n", "language": "Pascal", "metadata": {"date": 1576992973, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03178.html", "problem_id": "p03178", "resource_group": "low_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/Pascal/s034766996.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s034766996", "user_id": "u801427196"}, "prompt_components": {"gold_output": "6\n", "input_to_evaluate": "uses math;\nconst fi='digitnum.inp';\n fo='digitnum.out';\n maxn=1000;\n modu=trunc(1e9)+7;\nvar f:array[1..maxn,0..99,0..2] of int32;\n s:ansistring;\n d,len:int16;\nprocedure nhap;\nbegin\n readln(s);\n read(d);\nend;\nprocedure init;\nvar i,j,x:int32;\nbegin\n x:=ord(s[1])-48;\n for i:=1 to 9 do\n begin\n if ix then j:=2\n else j:=1;\n inc(f[1,i mod d,j]);\n end;\nend;\nfunction calc(n:ansistring):uint64;\nvar i,j,r,st,x,newst,newr:int32;\n ans:uint64;\nbegin\n len:=length(n);\n for i:=1 to len-1 do\n for r:=0 to d-1 do\n for st:=0 to 2 do\n begin\n x:=ord(n[i+1])-48;\n for j:=0 to 9 do\n begin\n newst:=st;\n if newst=1 then\n begin\n if jx then newst:=2\n else newst:=1;\n end;\n newr:=(r+j) mod d;\n f[i+1,newr,newst]:=(f[i+1,newr,newst]+f[i,r,st]) mod modu;\n end;\n end;\n ans:=0;\n for i:=1 to len-1 do\n for j:=0 to 2 do inc(ans,f[i,0,j]);\n exit((ans+f[len,0,0]+f[len,0,1]) mod modu);\nend;\n\nprocedure xuli;\nbegin\n init;\n write(calc(s));\nend;\nbegin\n// assign(input,fi); reset(input);\n// assign(output,fo); rewrite(output);\n nhap;\n xuli;\n// close(input); close(output);\nend.\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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1356, "cpu_time_ms": 174, "memory_kb": 1408}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s617352157", "group_id": "codeNet:p03187", "input_text": "var\n n,i,l,s,loc,dis,j:longint;\n flag:boolean;\n a:array[1..1000000]of longint;\nbegin\n readln(l,n);\n for i:=1 to n do read(a[i]);\n i:=1;j:=n;\n if a[1]>=(l-a[n]+1) \n then \n begin \n\t loc:=1;\n\t dis:=a[1];\n\t i:=2;\n\t flag:=true;\n\tend \n else \n begin \n j:=j-1;\n\t loc:=n;\n\t dis:=l-a[n]+1;\n\t flag:=false;\n\tend;\n write(dis,' ');\n while s=(a[loc]+a[n]-a[j])\n\t then \n\t\t begin \n\t\t\tdis:=dis+a[i]-a[loc];\n\t\t\tflag:=true;\n\t\t\tloc:=i;\n\t\t\tinc(i);\n\t\t\twrite(dis,' ');\n\t end\n\t\t else\n\t\t begin\n\t\t\t dis:=dis+a[loc]+a[n]-a[j];\n\t\t\t flag:=false;\n\t\t\t loc:=j;\n\t\t\t dec(j);\n\t\t\t write(dis,' ');\n\t\t\tend\n\t\telse\n\t\t if (a[i]+a[n]-a[loc])>=(a[loc]-a[j])\n\t\t then\n\t\t\tbegin \n\t\t\t dis:=dis+a[i]+a[n]-a[loc];\n\t\t\t flag:=true;\n\t\t\t loc:=i;\n\t\t\t inc(i);\n\t\t\t write(dis,' ');\n\t end\n\t\t else \n\t\t begin\n\t\t\t dis:=dis+a[loc]-a[j];\n\t\t\t flag:=false;\n\t\t\t loc:=j;\n\t\t\t dec(j);\n\t\t\t write(dis,' ');\n\t\t\tend;\n end;\n writeln(dis);\nend.", "language": "Pascal", "metadata": {"date": 1546139278, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03187.html", "problem_id": "p03187", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03187/input.txt", "sample_output_relpath": "derived/input_output/data/p03187/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03187/Pascal/s617352157.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s617352157", "user_id": "u380619494"}, "prompt_components": {"gold_output": "15\n", "input_to_evaluate": "var\n n,i,l,s,loc,dis,j:longint;\n flag:boolean;\n a:array[1..1000000]of longint;\nbegin\n readln(l,n);\n for i:=1 to n do read(a[i]);\n i:=1;j:=n;\n if a[1]>=(l-a[n]+1) \n then \n begin \n\t loc:=1;\n\t dis:=a[1];\n\t i:=2;\n\t flag:=true;\n\tend \n else \n begin \n j:=j-1;\n\t loc:=n;\n\t dis:=l-a[n]+1;\n\t flag:=false;\n\tend;\n write(dis,' ');\n while s=(a[loc]+a[n]-a[j])\n\t then \n\t\t begin \n\t\t\tdis:=dis+a[i]-a[loc];\n\t\t\tflag:=true;\n\t\t\tloc:=i;\n\t\t\tinc(i);\n\t\t\twrite(dis,' ');\n\t end\n\t\t else\n\t\t begin\n\t\t\t dis:=dis+a[loc]+a[n]-a[j];\n\t\t\t flag:=false;\n\t\t\t loc:=j;\n\t\t\t dec(j);\n\t\t\t write(dis,' ');\n\t\t\tend\n\t\telse\n\t\t if (a[i]+a[n]-a[loc])>=(a[loc]-a[j])\n\t\t then\n\t\t\tbegin \n\t\t\t dis:=dis+a[i]+a[n]-a[loc];\n\t\t\t flag:=true;\n\t\t\t loc:=i;\n\t\t\t inc(i);\n\t\t\t write(dis,' ');\n\t end\n\t\t else \n\t\t begin\n\t\t\t dis:=dis+a[loc]-a[j];\n\t\t\t flag:=false;\n\t\t\t loc:=j;\n\t\t\t dec(j);\n\t\t\t write(dis,' ');\n\t\t\tend;\n end;\n writeln(dis);\nend.", "problem_context": "Score : 800 points\n\nProblem Statement\n\nTakahashi Lake has a perimeter of L. On the circumference of the lake, there is a residence of the lake's owner, Takahashi.\nEach point on the circumference of the lake has a coordinate between 0 and L (including 0 but not L), which is the distance from the Takahashi's residence, measured counter-clockwise.\n\nThere are N trees around the lake; the coordinate of the i-th tree is X_i. There is no tree at coordinate 0, the location of Takahashi's residence.\n\nStarting at his residence, Takahashi will repeat the following action:\n\nIf all trees are burnt, terminate the process.\n\nSpecify a direction: clockwise or counter-clockwise.\n\nWalk around the lake in the specified direction, until the coordinate of a tree that is not yet burnt is reached for the first time.\n\nWhen the coordinate with the tree is reached, burn that tree, stay at the position and go back to the first step.\n\nFind the longest possible total distance Takahashi walks during the process.\n\nPartial Score\n\nA partial score can be obtained in this problem:\n\n300 points will be awarded for passing the input satisfying N \\leq 2000.\n\nConstraints\n\n2 \\leq L \\leq 10^9\n\n1 \\leq N \\leq 2\\times 10^5\n\n1 \\leq X_1 < ... < X_N \\leq L-1\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nL N\nX_1\n:\nX_N\n\nOutput\n\nPrint the longest possible total distance Takahashi walks during the process.\n\nSample Input 1\n\n10 3\n2\n7\n9\n\nSample Output 1\n\n15\n\nTakahashi walks the distance of 15 if the process goes as follows:\n\nWalk a distance of 2 counter-clockwise, burn the tree at the coordinate 2 and stay there.\n\nWalk a distance of 5 counter-clockwise, burn the tree at the coordinate 7 and stay there.\n\nWalk a distance of 8 clockwise, burn the tree at the coordinate 9 and stay there.\n\nSample Input 2\n\n10 6\n1\n2\n3\n6\n7\n9\n\nSample Output 2\n\n27\n\nSample Input 3\n\n314159265 7\n21662711\n77271666\n89022761\n156626166\n160332356\n166902656\n298992265\n\nSample Output 3\n\n1204124749", "sample_input": "10 3\n2\n7\n9\n"}, "reference_outputs": ["15\n"], "source_document_id": "p03187", "source_text": "Score : 800 points\n\nProblem Statement\n\nTakahashi Lake has a perimeter of L. On the circumference of the lake, there is a residence of the lake's owner, Takahashi.\nEach point on the circumference of the lake has a coordinate between 0 and L (including 0 but not L), which is the distance from the Takahashi's residence, measured counter-clockwise.\n\nThere are N trees around the lake; the coordinate of the i-th tree is X_i. There is no tree at coordinate 0, the location of Takahashi's residence.\n\nStarting at his residence, Takahashi will repeat the following action:\n\nIf all trees are burnt, terminate the process.\n\nSpecify a direction: clockwise or counter-clockwise.\n\nWalk around the lake in the specified direction, until the coordinate of a tree that is not yet burnt is reached for the first time.\n\nWhen the coordinate with the tree is reached, burn that tree, stay at the position and go back to the first step.\n\nFind the longest possible total distance Takahashi walks during the process.\n\nPartial Score\n\nA partial score can be obtained in this problem:\n\n300 points will be awarded for passing the input satisfying N \\leq 2000.\n\nConstraints\n\n2 \\leq L \\leq 10^9\n\n1 \\leq N \\leq 2\\times 10^5\n\n1 \\leq X_1 < ... < X_N \\leq L-1\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nL N\nX_1\n:\nX_N\n\nOutput\n\nPrint the longest possible total distance Takahashi walks during the process.\n\nSample Input 1\n\n10 3\n2\n7\n9\n\nSample Output 1\n\n15\n\nTakahashi walks the distance of 15 if the process goes as follows:\n\nWalk a distance of 2 counter-clockwise, burn the tree at the coordinate 2 and stay there.\n\nWalk a distance of 5 counter-clockwise, burn the tree at the coordinate 7 and stay there.\n\nWalk a distance of 8 clockwise, burn the tree at the coordinate 9 and stay there.\n\nSample Input 2\n\n10 6\n1\n2\n3\n6\n7\n9\n\nSample Output 2\n\n27\n\nSample Input 3\n\n314159265 7\n21662711\n77271666\n89022761\n156626166\n160332356\n166902656\n298992265\n\nSample Output 3\n\n1204124749", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1001, "cpu_time_ms": 78, "memory_kb": 3072}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s563046783", "group_id": "codeNet:p03192", "input_text": "var n:string;cnt,i:integer;begin read(n);cnt:=0;for i:=1 to 4 do begin if(n[i]='2')then cnt:=cnt+1;end;writeln(cnt);end.", "language": "Pascal", "metadata": {"date": 1597676269, "filename_ext": "pas", "original_language": "Pascal (FPC 3.0.4)", "problem_description_relpath": "problem_descriptions/p03192.html", "problem_id": "p03192", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03192/input.txt", "sample_output_relpath": "derived/input_output/data/p03192/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03192/Pascal/s563046783.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s563046783", "user_id": "u984276646"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "var n:string;cnt,i:integer;begin read(n);cnt:=0;for i:=1 to 4 do begin if(n[i]='2')then cnt:=cnt+1;end;writeln(cnt);end.", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou are given an integer N that has exactly four digits in base ten.\nHow many times does 2 occur in the base-ten representation of N?\n\nConstraints\n\n1000 \\leq N \\leq 9999\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\n1222\n\nSample Output 1\n\n3\n\n2 occurs three times in 1222. By the way, this contest is held on December 22 (JST).\n\nSample Input 2\n\n3456\n\nSample Output 2\n\n0\n\nSample Input 3\n\n9592\n\nSample Output 3\n\n1", "sample_input": "1222\n"}, "reference_outputs": ["3\n"], "source_document_id": "p03192", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou are given an integer N that has exactly four digits in base ten.\nHow many times does 2 occur in the base-ten representation of N?\n\nConstraints\n\n1000 \\leq N \\leq 9999\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\n1222\n\nSample Output 1\n\n3\n\n2 occurs three times in 1222. By the way, this contest is held on December 22 (JST).\n\nSample Input 2\n\n3456\n\nSample Output 2\n\n0\n\nSample Input 3\n\n9592\n\nSample Output 3\n\n1", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 8, "memory_kb": 1312}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s347407592", "group_id": "codeNet:p03193", "input_text": "var n,h,w,a,b,cnt,i:integer;begin readln(n,h,w);cnt:=0;for i:=1 to n do begin readln(a,b);if((h<=a)and(w<=b))then cnt:=cnt+1;end;writeln(cnt);end.", "language": "Pascal", "metadata": {"date": 1597678811, "filename_ext": "pas", "original_language": "Pascal (FPC 3.0.4)", "problem_description_relpath": "problem_descriptions/p03193.html", "problem_id": "p03193", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03193/input.txt", "sample_output_relpath": "derived/input_output/data/p03193/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03193/Pascal/s347407592.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s347407592", "user_id": "u984276646"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "var n,h,w,a,b,cnt,i:integer;begin readln(n,h,w);cnt:=0;for i:=1 to n do begin readln(a,b);if((h<=a)and(w<=b))then cnt:=cnt+1;end;writeln(cnt);end.", "problem_context": "Score : 200 points\n\nProblem Statement\n\nThere are N rectangular plate materials made of special metal called AtCoder Alloy.\nThe dimensions of the i-th material are A_i \\times B_i (A_i vertically and B_i horizontally).\n\nTakahashi wants a rectangular plate made of AtCoder Alloy whose dimensions are exactly H \\times W.\nHe is trying to obtain such a plate by choosing one of the N materials and cutting it if necessary.\nWhen cutting a material, the cuts must be parallel to one of the sides of the material.\nAlso, the materials have fixed directions and cannot be rotated.\nFor example, a 5 \\times 3 material cannot be used as a 3 \\times 5 plate.\n\nOut of the N materials, how many can produce an H \\times W plate if properly cut?\n\nConstraints\n\n1 \\leq N \\leq 1000\n\n1 \\leq H \\leq 10^9\n\n1 \\leq W \\leq 10^9\n\n1 \\leq A_i \\leq 10^9\n\n1 \\leq B_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN H W\nA_1 B_1\nA_2 B_2\n:\nA_N B_N\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n3 5 2\n10 3\n5 2\n2 5\n\nSample Output 1\n\n2\n\nTakahashi wants a 5 \\times 2 plate.\n\nThe dimensions of the first material are 10 \\times 3. We can obtain a 5 \\times 2 plate by properly cutting it.\n\nThe dimensions of the second material are 5 \\times 2. We can obtain a 5 \\times 2 plate without cutting it.\n\nThe dimensions of the third material are 2 \\times 5. We cannot obtain a 5 \\times 2 plate, whatever cuts are made. Note that the material cannot be rotated and used as a 5 \\times 2 plate.\n\nSample Input 2\n\n10 587586158 185430194\n894597290 708587790\n680395892 306946994\n590262034 785368612\n922328576 106880540\n847058850 326169610\n936315062 193149191\n702035777 223363392\n11672949 146832978\n779291680 334178158\n615808191 701464268\n\nSample Output 2\n\n8", "sample_input": "3 5 2\n10 3\n5 2\n2 5\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03193", "source_text": "Score : 200 points\n\nProblem Statement\n\nThere are N rectangular plate materials made of special metal called AtCoder Alloy.\nThe dimensions of the i-th material are A_i \\times B_i (A_i vertically and B_i horizontally).\n\nTakahashi wants a rectangular plate made of AtCoder Alloy whose dimensions are exactly H \\times W.\nHe is trying to obtain such a plate by choosing one of the N materials and cutting it if necessary.\nWhen cutting a material, the cuts must be parallel to one of the sides of the material.\nAlso, the materials have fixed directions and cannot be rotated.\nFor example, a 5 \\times 3 material cannot be used as a 3 \\times 5 plate.\n\nOut of the N materials, how many can produce an H \\times W plate if properly cut?\n\nConstraints\n\n1 \\leq N \\leq 1000\n\n1 \\leq H \\leq 10^9\n\n1 \\leq W \\leq 10^9\n\n1 \\leq A_i \\leq 10^9\n\n1 \\leq B_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN H W\nA_1 B_1\nA_2 B_2\n:\nA_N B_N\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n3 5 2\n10 3\n5 2\n2 5\n\nSample Output 1\n\n2\n\nTakahashi wants a 5 \\times 2 plate.\n\nThe dimensions of the first material are 10 \\times 3. We can obtain a 5 \\times 2 plate by properly cutting it.\n\nThe dimensions of the second material are 5 \\times 2. We can obtain a 5 \\times 2 plate without cutting it.\n\nThe dimensions of the third material are 2 \\times 5. We cannot obtain a 5 \\times 2 plate, whatever cuts are made. Note that the material cannot be rotated and used as a 5 \\times 2 plate.\n\nSample Input 2\n\n10 587586158 185430194\n894597290 708587790\n680395892 306946994\n590262034 785368612\n922328576 106880540\n847058850 326169610\n936315062 193149191\n702035777 223363392\n11672949 146832978\n779291680 334178158\n615808191 701464268\n\nSample Output 2\n\n8", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 8, "memory_kb": 1380}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s321101013", "group_id": "codeNet:p03193", "input_text": "var\n a:array[1..1000,1..1000]of longint;\n n,k,i,m,j,t,ans,b,c,d:longint;\n p,q,o,x,y:real;\n s:string;\nfunction max(a,b:longint):longint;\nbegin\n if a>b then max:=b\n else max:=a;\nend;\nbegin\n readln(c,n,m);\n for i:=1 to c do\n begin\n readln(a[i,1],a[i,2]);\n ans:=ans+max(a[i,1] div n,a[i,2] div m);\n end;\n writeln(ans);\nend.", "language": "Pascal", "metadata": {"date": 1545530872, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03193.html", "problem_id": "p03193", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03193/input.txt", "sample_output_relpath": "derived/input_output/data/p03193/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03193/Pascal/s321101013.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s321101013", "user_id": "u380619494"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "var\n a:array[1..1000,1..1000]of longint;\n n,k,i,m,j,t,ans,b,c,d:longint;\n p,q,o,x,y:real;\n s:string;\nfunction max(a,b:longint):longint;\nbegin\n if a>b then max:=b\n else max:=a;\nend;\nbegin\n readln(c,n,m);\n for i:=1 to c do\n begin\n readln(a[i,1],a[i,2]);\n ans:=ans+max(a[i,1] div n,a[i,2] div m);\n end;\n writeln(ans);\nend.", "problem_context": "Score : 200 points\n\nProblem Statement\n\nThere are N rectangular plate materials made of special metal called AtCoder Alloy.\nThe dimensions of the i-th material are A_i \\times B_i (A_i vertically and B_i horizontally).\n\nTakahashi wants a rectangular plate made of AtCoder Alloy whose dimensions are exactly H \\times W.\nHe is trying to obtain such a plate by choosing one of the N materials and cutting it if necessary.\nWhen cutting a material, the cuts must be parallel to one of the sides of the material.\nAlso, the materials have fixed directions and cannot be rotated.\nFor example, a 5 \\times 3 material cannot be used as a 3 \\times 5 plate.\n\nOut of the N materials, how many can produce an H \\times W plate if properly cut?\n\nConstraints\n\n1 \\leq N \\leq 1000\n\n1 \\leq H \\leq 10^9\n\n1 \\leq W \\leq 10^9\n\n1 \\leq A_i \\leq 10^9\n\n1 \\leq B_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN H W\nA_1 B_1\nA_2 B_2\n:\nA_N B_N\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n3 5 2\n10 3\n5 2\n2 5\n\nSample Output 1\n\n2\n\nTakahashi wants a 5 \\times 2 plate.\n\nThe dimensions of the first material are 10 \\times 3. We can obtain a 5 \\times 2 plate by properly cutting it.\n\nThe dimensions of the second material are 5 \\times 2. We can obtain a 5 \\times 2 plate without cutting it.\n\nThe dimensions of the third material are 2 \\times 5. We cannot obtain a 5 \\times 2 plate, whatever cuts are made. Note that the material cannot be rotated and used as a 5 \\times 2 plate.\n\nSample Input 2\n\n10 587586158 185430194\n894597290 708587790\n680395892 306946994\n590262034 785368612\n922328576 106880540\n847058850 326169610\n936315062 193149191\n702035777 223363392\n11672949 146832978\n779291680 334178158\n615808191 701464268\n\nSample Output 2\n\n8", "sample_input": "3 5 2\n10 3\n5 2\n2 5\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03193", "source_text": "Score : 200 points\n\nProblem Statement\n\nThere are N rectangular plate materials made of special metal called AtCoder Alloy.\nThe dimensions of the i-th material are A_i \\times B_i (A_i vertically and B_i horizontally).\n\nTakahashi wants a rectangular plate made of AtCoder Alloy whose dimensions are exactly H \\times W.\nHe is trying to obtain such a plate by choosing one of the N materials and cutting it if necessary.\nWhen cutting a material, the cuts must be parallel to one of the sides of the material.\nAlso, the materials have fixed directions and cannot be rotated.\nFor example, a 5 \\times 3 material cannot be used as a 3 \\times 5 plate.\n\nOut of the N materials, how many can produce an H \\times W plate if properly cut?\n\nConstraints\n\n1 \\leq N \\leq 1000\n\n1 \\leq H \\leq 10^9\n\n1 \\leq W \\leq 10^9\n\n1 \\leq A_i \\leq 10^9\n\n1 \\leq B_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN H W\nA_1 B_1\nA_2 B_2\n:\nA_N B_N\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n3 5 2\n10 3\n5 2\n2 5\n\nSample Output 1\n\n2\n\nTakahashi wants a 5 \\times 2 plate.\n\nThe dimensions of the first material are 10 \\times 3. We can obtain a 5 \\times 2 plate by properly cutting it.\n\nThe dimensions of the second material are 5 \\times 2. We can obtain a 5 \\times 2 plate without cutting it.\n\nThe dimensions of the third material are 2 \\times 5. We cannot obtain a 5 \\times 2 plate, whatever cuts are made. Note that the material cannot be rotated and used as a 5 \\times 2 plate.\n\nSample Input 2\n\n10 587586158 185430194\n894597290 708587790\n680395892 306946994\n590262034 785368612\n922328576 106880540\n847058850 326169610\n936315062 193149191\n702035777 223363392\n11672949 146832978\n779291680 334178158\n615808191 701464268\n\nSample Output 2\n\n8", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 2, "memory_kb": 3968}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s830912366", "group_id": "codeNet:p03194", "input_text": "var\n\tn,p,s:int64;\n f:array[0..1000010] of longint;\n i,j,t:longint;\nbegin\n\tread(n,p);\n if n=1 then\n begin\n \twriteln(p);\n halt;\n end;\n if p=1 then \n begin\n \twriteln(1);\n halt;\n end;\n fillchar(f,sizeof(f),0);\n i:=1;\n t:=trunc(sqrt(p))+1;\n while (p<>1) and (i<=t) do\n begin\n \tinc(i);\n while p mod i=0 do\n begin\n \tp:=p div i;\n inc(f[i]);\n end;\n end;\n s:=1;\n for i:=2 to t do\n \tif f[i]>=n then\n \tfor j:=1 to f[i] div n do s:=s*i;\n writeln(s);\nend.\n", "language": "Pascal", "metadata": {"date": 1545531850, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03194.html", "problem_id": "p03194", "resource_group": "low_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/Pascal/s830912366.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s830912366", "user_id": "u957998623"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "var\n\tn,p,s:int64;\n f:array[0..1000010] of longint;\n i,j,t:longint;\nbegin\n\tread(n,p);\n if n=1 then\n begin\n \twriteln(p);\n halt;\n end;\n if p=1 then \n begin\n \twriteln(1);\n halt;\n end;\n fillchar(f,sizeof(f),0);\n i:=1;\n t:=trunc(sqrt(p))+1;\n while (p<>1) and (i<=t) do\n begin\n \tinc(i);\n while p mod i=0 do\n begin\n \tp:=p div i;\n inc(f[i]);\n end;\n end;\n s:=1;\n for i:=2 to t do\n \tif f[i]>=n then\n \tfor j:=1 to f[i] div n do s:=s*i;\n writeln(s);\nend.\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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 13, "memory_kb": 3968}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s918231432", "group_id": "codeNet:p03195", "input_text": "var\n\tf:boolean;\n\tn,i,x:longint;\nbegin\n\tread(n);\n f:=false;\n for i:=1 to n do\n begin\n \tread(x);\n f:=f or (x mod 2=1); \n end;\n if f then writeln('first')\n else writeln('second');\nend.\n", "language": "Pascal", "metadata": {"date": 1545533059, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03195.html", "problem_id": "p03195", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03195/input.txt", "sample_output_relpath": "derived/input_output/data/p03195/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03195/Pascal/s918231432.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s918231432", "user_id": "u380619494"}, "prompt_components": {"gold_output": "first\n", "input_to_evaluate": "var\n\tf:boolean;\n\tn,i,x:longint;\nbegin\n\tread(n);\n f:=false;\n for i:=1 to n do\n begin\n \tread(x);\n f:=f or (x mod 2=1); \n end;\n if f then writeln('first')\n else writeln('second');\nend.\n", "problem_context": "Score : 500 points\n\nProblem Statement\n\nThere is an apple tree that bears apples of N colors. The N colors of these apples are numbered 1 to N, and there are a_i apples of Color i.\n\nYou and Lunlun the dachshund alternately perform the following operation (starting from you):\n\nChoose one or more apples from the tree and eat them. Here, the apples chosen at the same time must all have different colors.\n\nThe one who eats the last apple from the tree will be declared winner. If both you and Lunlun play optimally, which will win?\n\nConstraints\n\n1 \\leq N \\leq 10^5\n\n1 \\leq a_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_1\na_2\n:\na_N\n\nOutput\n\nIf you will win, print first; if Lunlun will win, print second.\n\nSample Input 1\n\n2\n1\n2\n\nSample Output 1\n\nfirst\n\nLet Color 1 be red, and Color 2 be blue. In this case, the tree bears one red apple and two blue apples.\n\nYou should eat the red apple in your first turn. Lunlun is then forced to eat one of the blue apples, and you can win by eating the other in your next turn.\n\nNote that you are also allowed to eat two apples in your first turn, one red and one blue (not a winning move, though).\n\nSample Input 2\n\n3\n100000\n30000\n20000\n\nSample Output 2\n\nsecond", "sample_input": "2\n1\n2\n"}, "reference_outputs": ["first\n"], "source_document_id": "p03195", "source_text": "Score : 500 points\n\nProblem Statement\n\nThere is an apple tree that bears apples of N colors. The N colors of these apples are numbered 1 to N, and there are a_i apples of Color i.\n\nYou and Lunlun the dachshund alternately perform the following operation (starting from you):\n\nChoose one or more apples from the tree and eat them. Here, the apples chosen at the same time must all have different colors.\n\nThe one who eats the last apple from the tree will be declared winner. If both you and Lunlun play optimally, which will win?\n\nConstraints\n\n1 \\leq N \\leq 10^5\n\n1 \\leq a_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_1\na_2\n:\na_N\n\nOutput\n\nIf you will win, print first; if Lunlun will win, print second.\n\nSample Input 1\n\n2\n1\n2\n\nSample Output 1\n\nfirst\n\nLet Color 1 be red, and Color 2 be blue. In this case, the tree bears one red apple and two blue apples.\n\nYou should eat the red apple in your first turn. Lunlun is then forced to eat one of the blue apples, and you can win by eating the other in your next turn.\n\nNote that you are also allowed to eat two apples in your first turn, one red and one blue (not a winning move, though).\n\nSample Input 2\n\n3\n100000\n30000\n20000\n\nSample Output 2\n\nsecond", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 17, "memory_kb": 128}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s426168273", "group_id": "codeNet:p03195", "input_text": "var\n\tf:boolean;\n\tn,i,x:longint;\nbegin\n\tread(n);\n f:=false;\n for i:=1 to n do\n begin\n \tread(x);\n f:=f or (x mod 2=1); \n end;\n if f then writeln('first')\n else writeln('second');\nend.", "language": "Pascal", "metadata": {"date": 1545533030, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03195.html", "problem_id": "p03195", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03195/input.txt", "sample_output_relpath": "derived/input_output/data/p03195/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03195/Pascal/s426168273.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s426168273", "user_id": "u223928734"}, "prompt_components": {"gold_output": "first\n", "input_to_evaluate": "var\n\tf:boolean;\n\tn,i,x:longint;\nbegin\n\tread(n);\n f:=false;\n for i:=1 to n do\n begin\n \tread(x);\n f:=f or (x mod 2=1); \n end;\n if f then writeln('first')\n else writeln('second');\nend.", "problem_context": "Score : 500 points\n\nProblem Statement\n\nThere is an apple tree that bears apples of N colors. The N colors of these apples are numbered 1 to N, and there are a_i apples of Color i.\n\nYou and Lunlun the dachshund alternately perform the following operation (starting from you):\n\nChoose one or more apples from the tree and eat them. Here, the apples chosen at the same time must all have different colors.\n\nThe one who eats the last apple from the tree will be declared winner. If both you and Lunlun play optimally, which will win?\n\nConstraints\n\n1 \\leq N \\leq 10^5\n\n1 \\leq a_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_1\na_2\n:\na_N\n\nOutput\n\nIf you will win, print first; if Lunlun will win, print second.\n\nSample Input 1\n\n2\n1\n2\n\nSample Output 1\n\nfirst\n\nLet Color 1 be red, and Color 2 be blue. In this case, the tree bears one red apple and two blue apples.\n\nYou should eat the red apple in your first turn. Lunlun is then forced to eat one of the blue apples, and you can win by eating the other in your next turn.\n\nNote that you are also allowed to eat two apples in your first turn, one red and one blue (not a winning move, though).\n\nSample Input 2\n\n3\n100000\n30000\n20000\n\nSample Output 2\n\nsecond", "sample_input": "2\n1\n2\n"}, "reference_outputs": ["first\n"], "source_document_id": "p03195", "source_text": "Score : 500 points\n\nProblem Statement\n\nThere is an apple tree that bears apples of N colors. The N colors of these apples are numbered 1 to N, and there are a_i apples of Color i.\n\nYou and Lunlun the dachshund alternately perform the following operation (starting from you):\n\nChoose one or more apples from the tree and eat them. Here, the apples chosen at the same time must all have different colors.\n\nThe one who eats the last apple from the tree will be declared winner. If both you and Lunlun play optimally, which will win?\n\nConstraints\n\n1 \\leq N \\leq 10^5\n\n1 \\leq a_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_1\na_2\n:\na_N\n\nOutput\n\nIf you will win, print first; if Lunlun will win, print second.\n\nSample Input 1\n\n2\n1\n2\n\nSample Output 1\n\nfirst\n\nLet Color 1 be red, and Color 2 be blue. In this case, the tree bears one red apple and two blue apples.\n\nYou should eat the red apple in your first turn. Lunlun is then forced to eat one of the blue apples, and you can win by eating the other in your next turn.\n\nNote that you are also allowed to eat two apples in your first turn, one red and one blue (not a winning move, though).\n\nSample Input 2\n\n3\n100000\n30000\n20000\n\nSample Output 2\n\nsecond", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 17, "memory_kb": 128}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s313608358", "group_id": "codeNet:p03195", "input_text": "var\n n,k,i,m,j,t,ans,b,c,d:longint;\nbegin\n readln(n);\n for i:=1 to n do\n begin\n readln(k);\n ans:=(ans+k mod 2)mod 2;\n end;\n if ans mod 2=1 then writeln('first')\n else writeln('second');\nend.", "language": "Pascal", "metadata": {"date": 1545532566, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03195.html", "problem_id": "p03195", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03195/input.txt", "sample_output_relpath": "derived/input_output/data/p03195/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03195/Pascal/s313608358.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s313608358", "user_id": "u380619494"}, "prompt_components": {"gold_output": "first\n", "input_to_evaluate": "var\n n,k,i,m,j,t,ans,b,c,d:longint;\nbegin\n readln(n);\n for i:=1 to n do\n begin\n readln(k);\n ans:=(ans+k mod 2)mod 2;\n end;\n if ans mod 2=1 then writeln('first')\n else writeln('second');\nend.", "problem_context": "Score : 500 points\n\nProblem Statement\n\nThere is an apple tree that bears apples of N colors. The N colors of these apples are numbered 1 to N, and there are a_i apples of Color i.\n\nYou and Lunlun the dachshund alternately perform the following operation (starting from you):\n\nChoose one or more apples from the tree and eat them. Here, the apples chosen at the same time must all have different colors.\n\nThe one who eats the last apple from the tree will be declared winner. If both you and Lunlun play optimally, which will win?\n\nConstraints\n\n1 \\leq N \\leq 10^5\n\n1 \\leq a_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_1\na_2\n:\na_N\n\nOutput\n\nIf you will win, print first; if Lunlun will win, print second.\n\nSample Input 1\n\n2\n1\n2\n\nSample Output 1\n\nfirst\n\nLet Color 1 be red, and Color 2 be blue. In this case, the tree bears one red apple and two blue apples.\n\nYou should eat the red apple in your first turn. Lunlun is then forced to eat one of the blue apples, and you can win by eating the other in your next turn.\n\nNote that you are also allowed to eat two apples in your first turn, one red and one blue (not a winning move, though).\n\nSample Input 2\n\n3\n100000\n30000\n20000\n\nSample Output 2\n\nsecond", "sample_input": "2\n1\n2\n"}, "reference_outputs": ["first\n"], "source_document_id": "p03195", "source_text": "Score : 500 points\n\nProblem Statement\n\nThere is an apple tree that bears apples of N colors. The N colors of these apples are numbered 1 to N, and there are a_i apples of Color i.\n\nYou and Lunlun the dachshund alternately perform the following operation (starting from you):\n\nChoose one or more apples from the tree and eat them. Here, the apples chosen at the same time must all have different colors.\n\nThe one who eats the last apple from the tree will be declared winner. If both you and Lunlun play optimally, which will win?\n\nConstraints\n\n1 \\leq N \\leq 10^5\n\n1 \\leq a_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_1\na_2\n:\na_N\n\nOutput\n\nIf you will win, print first; if Lunlun will win, print second.\n\nSample Input 1\n\n2\n1\n2\n\nSample Output 1\n\nfirst\n\nLet Color 1 be red, and Color 2 be blue. In this case, the tree bears one red apple and two blue apples.\n\nYou should eat the red apple in your first turn. Lunlun is then forced to eat one of the blue apples, and you can win by eating the other in your next turn.\n\nNote that you are also allowed to eat two apples in your first turn, one red and one blue (not a winning move, though).\n\nSample Input 2\n\n3\n100000\n30000\n20000\n\nSample Output 2\n\nsecond", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 20, "memory_kb": 128}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s392003178", "group_id": "codeNet:p03195", "input_text": "var\n\tn,i,x,max,s:longint;\nbegin\n\tread(n);\n max:=0; s:=0;\n for i:=1 to n do\n begin\n \tread(x);\n s:=s+x;\n if x>max then max:=x;\n end;\n s:=s-max;\n if abs(s-max) div 2=0 then writeln('second')\n else writeln('first');\nend.", "language": "Pascal", "metadata": {"date": 1545532334, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03195.html", "problem_id": "p03195", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03195/input.txt", "sample_output_relpath": "derived/input_output/data/p03195/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03195/Pascal/s392003178.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s392003178", "user_id": "u957998623"}, "prompt_components": {"gold_output": "first\n", "input_to_evaluate": "var\n\tn,i,x,max,s:longint;\nbegin\n\tread(n);\n max:=0; s:=0;\n for i:=1 to n do\n begin\n \tread(x);\n s:=s+x;\n if x>max then max:=x;\n end;\n s:=s-max;\n if abs(s-max) div 2=0 then writeln('second')\n else writeln('first');\nend.", "problem_context": "Score : 500 points\n\nProblem Statement\n\nThere is an apple tree that bears apples of N colors. The N colors of these apples are numbered 1 to N, and there are a_i apples of Color i.\n\nYou and Lunlun the dachshund alternately perform the following operation (starting from you):\n\nChoose one or more apples from the tree and eat them. Here, the apples chosen at the same time must all have different colors.\n\nThe one who eats the last apple from the tree will be declared winner. If both you and Lunlun play optimally, which will win?\n\nConstraints\n\n1 \\leq N \\leq 10^5\n\n1 \\leq a_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_1\na_2\n:\na_N\n\nOutput\n\nIf you will win, print first; if Lunlun will win, print second.\n\nSample Input 1\n\n2\n1\n2\n\nSample Output 1\n\nfirst\n\nLet Color 1 be red, and Color 2 be blue. In this case, the tree bears one red apple and two blue apples.\n\nYou should eat the red apple in your first turn. Lunlun is then forced to eat one of the blue apples, and you can win by eating the other in your next turn.\n\nNote that you are also allowed to eat two apples in your first turn, one red and one blue (not a winning move, though).\n\nSample Input 2\n\n3\n100000\n30000\n20000\n\nSample Output 2\n\nsecond", "sample_input": "2\n1\n2\n"}, "reference_outputs": ["first\n"], "source_document_id": "p03195", "source_text": "Score : 500 points\n\nProblem Statement\n\nThere is an apple tree that bears apples of N colors. The N colors of these apples are numbered 1 to N, and there are a_i apples of Color i.\n\nYou and Lunlun the dachshund alternately perform the following operation (starting from you):\n\nChoose one or more apples from the tree and eat them. Here, the apples chosen at the same time must all have different colors.\n\nThe one who eats the last apple from the tree will be declared winner. If both you and Lunlun play optimally, which will win?\n\nConstraints\n\n1 \\leq N \\leq 10^5\n\n1 \\leq a_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_1\na_2\n:\na_N\n\nOutput\n\nIf you will win, print first; if Lunlun will win, print second.\n\nSample Input 1\n\n2\n1\n2\n\nSample Output 1\n\nfirst\n\nLet Color 1 be red, and Color 2 be blue. In this case, the tree bears one red apple and two blue apples.\n\nYou should eat the red apple in your first turn. Lunlun is then forced to eat one of the blue apples, and you can win by eating the other in your next turn.\n\nNote that you are also allowed to eat two apples in your first turn, one red and one blue (not a winning move, though).\n\nSample Input 2\n\n3\n100000\n30000\n20000\n\nSample Output 2\n\nsecond", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 16, "memory_kb": 128}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s326176580", "group_id": "codeNet:p03200", "input_text": "var\n n, i, j : longint;\n ans : qword;\n s : ansistring;\nbegin\n read(s);\n n:=length(s);\n for i:=1 to n do\n begin\n if s[i]='W' then\n begin\n inc(j);\n ans:=ans+(i-j)\n end\n end;\n write(ans)\nend.", "language": "Pascal", "metadata": {"date": 1545250845, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03200.html", "problem_id": "p03200", "resource_group": "low_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/Pascal/s326176580.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s326176580", "user_id": "u917872461"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "var\n n, i, j : longint;\n ans : qword;\n s : ansistring;\nbegin\n read(s);\n n:=length(s);\n for i:=1 to n do\n begin\n if s[i]='W' then\n begin\n inc(j);\n ans:=ans+(i-j)\n end\n end;\n write(ans)\nend.", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 2, "memory_kb": 384}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s376733837", "group_id": "codeNet:p03200", "input_text": "var\n\tch:ansistring;\n\tn,s,i:longint;\n\tt:int64;\nbegin\n\treadln(ch);\n\tn:=length(ch);\n\ts:=1; t:=0;\n\tfor i:=1 to n do \n\t\tif ch[i]='W' then\n\t\tbegin\n\t\t\tt:=t+i-s;\n\t\t\tinc(s);\n\t\tend;\n\twriteln(t);\nend.", "language": "Pascal", "metadata": {"date": 1544926359, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03200.html", "problem_id": "p03200", "resource_group": "low_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/Pascal/s376733837.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s376733837", "user_id": "u957998623"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "var\n\tch:ansistring;\n\tn,s,i:longint;\n\tt:int64;\nbegin\n\treadln(ch);\n\tn:=length(ch);\n\ts:=1; t:=0;\n\tfor i:=1 to n do \n\t\tif ch[i]='W' then\n\t\tbegin\n\t\t\tt:=t+i-s;\n\t\t\tinc(s);\n\t\tend;\n\twriteln(t);\nend.", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 2, "memory_kb": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s838901614", "group_id": "codeNet:p03200", "input_text": "var\n\tch:ansistring;\n\tn,s,t,i:longint;\nbegin\n\treadln(ch);\n\tn:=length(ch);\n\ts:=1; t:=0;\n\tfor i:=1 to n do \n\t\tif ch[i]='W' then\n\t\tbegin\n\t\t\tt:=t+i-s;\n\t\t\tinc(s);\n\t\tend;\n\twriteln(t);\nend.", "language": "Pascal", "metadata": {"date": 1544926058, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03200.html", "problem_id": "p03200", "resource_group": "low_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/Pascal/s838901614.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s838901614", "user_id": "u957998623"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "var\n\tch:ansistring;\n\tn,s,t,i:longint;\nbegin\n\treadln(ch);\n\tn:=length(ch);\n\ts:=1; t:=0;\n\tfor i:=1 to n do \n\t\tif ch[i]='W' then\n\t\tbegin\n\t\t\tt:=t+i-s;\n\t\t\tinc(s);\n\t\tend;\n\twriteln(t);\nend.", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 2, "memory_kb": 384}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s069796543", "group_id": "codeNet:p03201", "input_text": "var\n a:array[0..200000]of longint;\n f:array[0..200000000]of boolean;\n i,j,k,n,ans:longint;\nProcedure qs(l,r:longint);\nvar\n i,j,t,mid:longint;\nbegin\n i:=l;j:=r;mid:=a[(l+r)div 2];\n repeat\n while a[i]mid do dec(j);\n if i<=j then\n begin\n t:=a[i];a[i]:=a[j];a[j]:=t;\n inc(i);dec(j);\n end;\n until i>j;\n if l1E9;\n k:=j;\n for i:=1 to n do\n read(a[i]);\n qs(1,n);\n for i:=1 to n do\n begin\n if a[i]<>0 then\n begin\n for j:=n downto i+1 do\n begin\n if (a[j]<>0)and((f[a[i]+a[j]])or(k=a[i]+a[j])) then\n begin\n a[i]:=0;a[j]:=0;\n inc(ans);\n end;\n end;\n end;\n end;\n write(ans);\nend.", "language": "Pascal", "metadata": {"date": 1544933995, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03201.html", "problem_id": "p03201", "resource_group": "low_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/Pascal/s069796543.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s069796543", "user_id": "u111363574"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "var\n a:array[0..200000]of longint;\n f:array[0..200000000]of boolean;\n i,j,k,n,ans:longint;\nProcedure qs(l,r:longint);\nvar\n i,j,t,mid:longint;\nbegin\n i:=l;j:=r;mid:=a[(l+r)div 2];\n repeat\n while a[i]mid do dec(j);\n if i<=j then\n begin\n t:=a[i];a[i]:=a[j];a[j]:=t;\n inc(i);dec(j);\n end;\n until i>j;\n if l1E9;\n k:=j;\n for i:=1 to n do\n read(a[i]);\n qs(1,n);\n for i:=1 to n do\n begin\n if a[i]<>0 then\n begin\n for j:=n downto i+1 do\n begin\n if (a[j]<>0)and((f[a[i]+a[j]])or(k=a[i]+a[j])) then\n begin\n a[i]:=0;a[j]:=0;\n inc(ans);\n end;\n end;\n end;\n end;\n write(ans);\nend.", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 3, "memory_kb": 14464}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s594277808", "group_id": "codeNet:p03201", "input_text": "var\n a:array[0..200000]of longint;\n f:array[0..100000000]of boolean;\n i,j,k,n,ans:longint;\nProcedure qs(l,r:longint);\nvar\n i,j,t,mid:longint;\nbegin\n i:=l;j:=r;mid:=a[(l+r)div 2];\n repeat\n while a[i]mid do dec(j);\n if i<=j then\n begin\n t:=a[i];a[i]:=a[j];a[j]:=t;\n inc(i);dec(j);\n end;\n until i>j;\n if l1E9;\n k:=j;\n for i:=1 to n do\n read(a[i]);\n qs(1,n);\n for i:=1 to n do\n begin\n if a[i]<>0 then\n begin\n for j:=n downto i+1 do\n begin\n if (a[j]<>0)and((f[a[i]+a[j]])or(k=a[i]+a[j])) then\n begin\n a[i]:=0;a[j]:=0;\n inc(ans);\n end;\n end;\n end;\n end;\n write(ans);\nend.", "language": "Pascal", "metadata": {"date": 1544933956, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03201.html", "problem_id": "p03201", "resource_group": "low_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/Pascal/s594277808.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s594277808", "user_id": "u111363574"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "var\n a:array[0..200000]of longint;\n f:array[0..100000000]of boolean;\n i,j,k,n,ans:longint;\nProcedure qs(l,r:longint);\nvar\n i,j,t,mid:longint;\nbegin\n i:=l;j:=r;mid:=a[(l+r)div 2];\n repeat\n while a[i]mid do dec(j);\n if i<=j then\n begin\n t:=a[i];a[i]:=a[j];a[j]:=t;\n inc(i);dec(j);\n end;\n until i>j;\n if l1E9;\n k:=j;\n for i:=1 to n do\n read(a[i]);\n qs(1,n);\n for i:=1 to n do\n begin\n if a[i]<>0 then\n begin\n for j:=n downto i+1 do\n begin\n if (a[j]<>0)and((f[a[i]+a[j]])or(k=a[i]+a[j])) then\n begin\n a[i]:=0;a[j]:=0;\n inc(ans);\n end;\n end;\n end;\n end;\n write(ans);\nend.", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 3, "memory_kb": 12416}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s444662340", "group_id": "codeNet:p03201", "input_text": "var\n\ta:array[0..35] of int64;\n\tb:array[0..200010] of longint;\n\tf:array[0..200010] of boolean;\n\tans,i,j,n,x,y,l,r,mid:longint;\nfunction check(x:longint):longint;\nbegin\n\tif xb[n] then exit(-1);\n\tl:=1; r:=n;\n\twhile l<=r do\n\tbegin\n\t\tmid:=(l+r) div 2;\n\t\tif x=b[mid] then exit(mid);\n\t\tif xmid do dec(j);\n\t\tif i<=j then\n\t\tbegin\n\t\t\tt:=b[i]; b[i]:=b[j]; b[j]:=t;\n\t\t\tinc(i); dec(j);\n\t\tend;\n\tuntil i>j;\n\tif lb[i]+b[n] then continue;\n\t\t\t\tx:=check(a[j]-b[i]);\n\t\t\t\tif (x<>-1) and (x<>i) then \n\t\t\t\tbegin\n\t\t\t\t\tinc(ans);\n\t\t\t\t\tf[i]:=false;\n\t\t\t\t\tf[x]:=false;\n\t\t\t\t\tbreak;\n\t\t\t\tend;\n\t\t\t\tif a[j]<=b[i] then break;\n\t\t\tend;\n\tend;\n\twriteln(ans);\nend.", "language": "Pascal", "metadata": {"date": 1544930291, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03201.html", "problem_id": "p03201", "resource_group": "low_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/Pascal/s444662340.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s444662340", "user_id": "u957998623"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "var\n\ta:array[0..35] of int64;\n\tb:array[0..200010] of longint;\n\tf:array[0..200010] of boolean;\n\tans,i,j,n,x,y,l,r,mid:longint;\nfunction check(x:longint):longint;\nbegin\n\tif xb[n] then exit(-1);\n\tl:=1; r:=n;\n\twhile l<=r do\n\tbegin\n\t\tmid:=(l+r) div 2;\n\t\tif x=b[mid] then exit(mid);\n\t\tif xmid do dec(j);\n\t\tif i<=j then\n\t\tbegin\n\t\t\tt:=b[i]; b[i]:=b[j]; b[j]:=t;\n\t\t\tinc(i); dec(j);\n\t\tend;\n\tuntil i>j;\n\tif lb[i]+b[n] then continue;\n\t\t\t\tx:=check(a[j]-b[i]);\n\t\t\t\tif (x<>-1) and (x<>i) then \n\t\t\t\tbegin\n\t\t\t\t\tinc(ans);\n\t\t\t\t\tf[i]:=false;\n\t\t\t\t\tf[x]:=false;\n\t\t\t\t\tbreak;\n\t\t\t\tend;\n\t\t\t\tif a[j]<=b[i] then break;\n\t\t\tend;\n\tend;\n\twriteln(ans);\nend.", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1174, "cpu_time_ms": 2103, "memory_kb": 1024}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s403860143", "group_id": "codeNet:p03202", "input_text": "var\n a:array[1..20000]of longint;\n f:array[1..100000000]of longint;\n n,i,j,ans:longint;\nbegin\n readln(n);\n ans:=1;\n for i:=1 to n do read(a[i]);\n for i:=1 to a[1] do f[i]:=1;\n for i:=2 to n do\n if a[i-1]ans then inc(ans)\n end;\n write(ans)\nend. ", "language": "Pascal", "metadata": {"date": 1545259175, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03202.html", "problem_id": "p03202", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03202/input.txt", "sample_output_relpath": "derived/input_output/data/p03202/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03202/Pascal/s403860143.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s403860143", "user_id": "u917872461"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "var\n a:array[1..20000]of longint;\n f:array[1..100000000]of longint;\n n,i,j,ans:longint;\nbegin\n readln(n);\n ans:=1;\n for i:=1 to n do read(a[i]);\n for i:=1 to a[1] do f[i]:=1;\n for i:=2 to n do\n if a[i-1]ans then inc(ans)\n end;\n write(ans)\nend. ", "problem_context": "Score : 700 points\n\nProblem Statement\n\nThere are N strings arranged in a row.\nIt is known that, for any two adjacent strings, the string to the left is lexicographically smaller than the string to the right.\nThat is, S_1ans then inc(ans)\n end;\n write(ans)\nend. ", "language": "Pascal", "metadata": {"date": 1545258837, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03202.html", "problem_id": "p03202", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03202/input.txt", "sample_output_relpath": "derived/input_output/data/p03202/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03202/Pascal/s589908140.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s589908140", "user_id": "u917872461"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "var\n a:array[1..20000]of longint;\n f:array[1..20000]of longint;\n n,i,j,ans:longint;\nbegin\n readln(n);\n ans:=1;\n for i:=1 to n do read(a[i]);\n for i:=1 to a[1] do f[i]:=1;\n for i:=2 to n do\n if a[i-1]ans then inc(ans)\n end;\n write(ans)\nend. ", "problem_context": "Score : 700 points\n\nProblem Statement\n\nThere are N strings arranged in a row.\nIt is known that, for any two adjacent strings, the string to the left is lexicographically smaller than the string to the right.\nThat is, S_1mid do dec(j);\n\t\tif i<=j then\n\t\tbegin\n\t\t\tt:=b[i]; b[i]:=b[j]; b[j]:=t;\n\t\t\tt:=c[i]; c[i]:=c[j]; c[j]:=t;\n\t\t\tinc(i); dec(j);\n\t\tend;\n\tuntil i>j;\n\tif lx) and (y>1) do\n\t\tbegin\n\t\t\tch[y]:=ch[y]-x;\n\t\t\tdec(y);\n\t\t\tinc(ch[y]);\n\t\tend;\n\t\tif ch[1]>x then exit(false);\n\tend;\n\texit(true);\nend;\nbegin\n\treadln(n);\n\tfor i:=1 to n do \n\tbegin \n\t\tread(a[i]);\n\t\tc[i]:=i;\n\t\tb[i]:=a[i];\n\tend;\n\tqsort(1,n);\n\tfor i:=1 to n do a[c[i]]:=i;\n\tl:=1; r:=26;\n\twhile lmid do dec(j);\n\t\tif i<=j then\n\t\tbegin\n\t\t\tt:=b[i]; b[i]:=b[j]; b[j]:=t;\n\t\t\tt:=c[i]; c[i]:=c[j]; c[j]:=t;\n\t\t\tinc(i); dec(j);\n\t\tend;\n\tuntil i>j;\n\tif lx) and (y>1) do\n\t\tbegin\n\t\t\tch[y]:=ch[y]-x;\n\t\t\tdec(y);\n\t\t\tinc(ch[y]);\n\t\tend;\n\t\tif ch[1]>x then exit(false);\n\tend;\n\texit(true);\nend;\nbegin\n\treadln(n);\n\tfor i:=1 to n do \n\tbegin \n\t\tread(a[i]);\n\t\tc[i]:=i;\n\t\tb[i]:=a[i];\n\tend;\n\tqsort(1,n);\n\tfor i:=1 to n do a[c[i]]:=i;\n\tl:=1; r:=26;\n\twhile lb then inc(s);\n\t\ta:=b;\n\tend;\n\twriteln(s);\nend.", "language": "Pascal", "metadata": {"date": 1544929460, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03202.html", "problem_id": "p03202", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03202/input.txt", "sample_output_relpath": "derived/input_output/data/p03202/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03202/Pascal/s680200824.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s680200824", "user_id": "u957998623"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "var\n\tn,a,b,i,s:longint;\nbegin\n\treadln(n);\n\ts:=0;\n\tread(a);\n\tfor i:=2 to n do\n\tbegin\n\t\tread(b);\n\t\tif a>b then inc(s);\n\t\ta:=b;\n\tend;\n\twriteln(s);\nend.", "problem_context": "Score : 700 points\n\nProblem Statement\n\nThere are N strings arranged in a row.\nIt is known that, for any two adjacent strings, the string to the left is lexicographically smaller than the string to the right.\nThat is, S_1m do dec(j);\n if i<=j then\n begin\n t:=a[i];a[i]:=a[j];a[j]:=t;\n inc(i);dec(j);\n end;\n until i>j;\n if im do dec(j);\n if i<=j then\n begin\n t:=a[i];a[i]:=a[j];a[j]:=t;\n inc(i);dec(j);\n end;\n until i>j;\n if i u then t := u\n end;\n writeln(t)\nend.", "language": "Pascal", "metadata": {"date": 1544323756, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03208.html", "problem_id": "p03208", "resource_group": "low_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/Pascal/s493881279.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s493881279", "user_id": "u492212770"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "type\n\tintArray = array[1..100000] of longint;\nvar i,j,m,n,k : integer;\n t,u : longint;\n h : intArray;\n\nprocedure\tswap(var a,b:longint);\nvar tmp:longint;\nbegin\n\ttmp:=a;\n\ta:=b;\n\tb:=tmp\nend;\n \nprocedure QuickSort(var a:intArray;start_index,end_index:integer);\nvar i,j,x,t:longint;\nbegin\n\tx:=a[(start_index+end_index)div 2];\n\ti:=start_index;\n\tj:=end_index;\n\twhile(true)do\n\tbegin\n\t\twhile(a[i] u then t := u\n end;\n writeln(t)\nend.", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 27, "memory_kb": 512}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s788442397", "group_id": "codeNet:p03209", "input_text": "var n:integer;\nx,ans:int64;\nprocedure find(i:integer);\nbegin \n\tif x<=3 then \n\tbegin \n\t\tans:=ans+x;\n\t\tx:=0;\n\tend;\n\tif x>3 then \n\tbegin \n\t\tans:=ans+3;\n\t\tx:=x-3;\n\t\tif x<=i then \n\t\tbegin \n\t\t\tx:=0;\n\t\tend;\n\t\tif x>i then \n\t\tbegin \n\t\t\tans:=ans+1;\n\t\t\tx:=x-i-1;\n\t\t\tif x<=i then x:=0;\n\t\t\tif x>i then x:=x-i;\n\t\tend;\n\tend;\nend;\nprocedure p(y:integer);\nbegin \n\tif y>1 then p(y-1);\n\tfind(y);\n\tif x=0 then begin write(ans);halt;end;\n\tif y>1 then p(y-1);\nend;\nbegin \n\tread(n);read(x);\n\tans:=0;\n\tx:=x-n;\n\tif x>0 then \n\t\tp(n-1);\n\twrite(ans);\nend.", "language": "Pascal", "metadata": {"date": 1544501598, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03209.html", "problem_id": "p03209", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03209/input.txt", "sample_output_relpath": "derived/input_output/data/p03209/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03209/Pascal/s788442397.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s788442397", "user_id": "u914335902"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "var n:integer;\nx,ans:int64;\nprocedure find(i:integer);\nbegin \n\tif x<=3 then \n\tbegin \n\t\tans:=ans+x;\n\t\tx:=0;\n\tend;\n\tif x>3 then \n\tbegin \n\t\tans:=ans+3;\n\t\tx:=x-3;\n\t\tif x<=i then \n\t\tbegin \n\t\t\tx:=0;\n\t\tend;\n\t\tif x>i then \n\t\tbegin \n\t\t\tans:=ans+1;\n\t\t\tx:=x-i-1;\n\t\t\tif x<=i then x:=0;\n\t\t\tif x>i then x:=x-i;\n\t\tend;\n\tend;\nend;\nprocedure p(y:integer);\nbegin \n\tif y>1 then p(y-1);\n\tfind(y);\n\tif x=0 then begin write(ans);halt;end;\n\tif y>1 then p(y-1);\nend;\nbegin \n\tread(n);read(x);\n\tans:=0;\n\tx:=x-n;\n\tif x>0 then \n\t\tp(n-1);\n\twrite(ans);\nend.", "problem_context": "Score : 400 points\n\nProblem Statement\n\nIn some other world, today is Christmas.\n\nMr. Takaha decides to make a multi-dimensional burger in his party. A level-L burger (L is an integer greater than or equal to 0) is the following thing:\n\nA level-0 burger is a patty.\n\nA level-L burger (L \\geq 1) is a bun, a level-(L-1) burger, a patty, another level-(L-1) burger and another bun, stacked vertically in this order from the bottom.\n\nFor example, a level-1 burger and a level-2 burger look like BPPPB and BBPPPBPBPPPBB (rotated 90 degrees), where B and P stands for a bun and a patty.\n\nThe burger Mr. Takaha will make is a level-N burger. Lunlun the Dachshund will eat X layers from the bottom of this burger (a layer is a patty or a bun). How many patties will she eat?\n\nConstraints\n\n1 \\leq N \\leq 50\n\n1 \\leq X \\leq ( the total number of layers in a level-N burger )\n\nN and X are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN X\n\nOutput\n\nPrint the number of patties in the bottom-most X layers from the bottom of a level-N burger.\n\nSample Input 1\n\n2 7\n\nSample Output 1\n\n4\n\nThere are 4 patties in the bottom-most 7 layers of a level-2 burger (BBPPPBPBPPPBB).\n\nSample Input 2\n\n1 1\n\nSample Output 2\n\n0\n\nThe bottom-most layer of a level-1 burger is a bun.\n\nSample Input 3\n\n50 4321098765432109\n\nSample Output 3\n\n2160549382716056\n\nA level-50 burger is rather thick, to the extent that the number of its layers does not fit into a 32-bit integer.", "sample_input": "2 7\n"}, "reference_outputs": ["4\n"], "source_document_id": "p03209", "source_text": "Score : 400 points\n\nProblem Statement\n\nIn some other world, today is Christmas.\n\nMr. Takaha decides to make a multi-dimensional burger in his party. A level-L burger (L is an integer greater than or equal to 0) is the following thing:\n\nA level-0 burger is a patty.\n\nA level-L burger (L \\geq 1) is a bun, a level-(L-1) burger, a patty, another level-(L-1) burger and another bun, stacked vertically in this order from the bottom.\n\nFor example, a level-1 burger and a level-2 burger look like BPPPB and BBPPPBPBPPPBB (rotated 90 degrees), where B and P stands for a bun and a patty.\n\nThe burger Mr. Takaha will make is a level-N burger. Lunlun the Dachshund will eat X layers from the bottom of this burger (a layer is a patty or a bun). How many patties will she eat?\n\nConstraints\n\n1 \\leq N \\leq 50\n\n1 \\leq X \\leq ( the total number of layers in a level-N burger )\n\nN and X are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN X\n\nOutput\n\nPrint the number of patties in the bottom-most X layers from the bottom of a level-N burger.\n\nSample Input 1\n\n2 7\n\nSample Output 1\n\n4\n\nThere are 4 patties in the bottom-most 7 layers of a level-2 burger (BBPPPBPBPPPBB).\n\nSample Input 2\n\n1 1\n\nSample Output 2\n\n0\n\nThe bottom-most layer of a level-1 burger is a bun.\n\nSample Input 3\n\n50 4321098765432109\n\nSample Output 3\n\n2160549382716056\n\nA level-50 burger is rather thick, to the extent that the number of its layers does not fit into a 32-bit integer.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 2103, "memory_kb": 128}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s037441458", "group_id": "codeNet:p03212", "input_text": "var\n\tn:Longint;\nfunction f(x:int64;a,b,c:Longint):Longint;\nbegin\n\tf:=0;\n\tif x<=n then f:=a*b*c+f(x*10+3,1,b,c)+f(x*10+5,a,1,c)+f(x*10+7,a,b,1);\nend;\nbegin\n\tread(n);\n\tif n>700000000 then begin writeln(17656+f(7,0,0,1));exit;end;\n\twriteln(f(0,0,0,0));\nend.", "language": "Pascal", "metadata": {"date": 1575165894, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03212.html", "problem_id": "p03212", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03212/input.txt", "sample_output_relpath": "derived/input_output/data/p03212/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03212/Pascal/s037441458.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s037441458", "user_id": "u657913472"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "var\n\tn:Longint;\nfunction f(x:int64;a,b,c:Longint):Longint;\nbegin\n\tf:=0;\n\tif x<=n then f:=a*b*c+f(x*10+3,1,b,c)+f(x*10+5,a,1,c)+f(x*10+7,a,b,1);\nend;\nbegin\n\tread(n);\n\tif n>700000000 then begin writeln(17656+f(7,0,0,1));exit;end;\n\twriteln(f(0,0,0,0));\nend.", "problem_context": "Score : 300 points\n\nProblem Statement\n\nYou are given an integer N. Among the integers between 1 and N (inclusive), how many Shichi-Go-San numbers (literally \"Seven-Five-Three numbers\") are there?\n\nHere, a Shichi-Go-San number is a positive integer that satisfies the following condition:\n\nWhen the number is written in base ten, each of the digits 7, 5 and 3 appears at least once, and the other digits never appear.\n\nConstraints\n\n1 \\leq N < 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 number of the Shichi-Go-San numbers between 1 and N (inclusive).\n\nSample Input 1\n\n575\n\nSample Output 1\n\n4\n\nThere are four Shichi-Go-San numbers not greater than 575: 357, 375, 537 and 573.\n\nSample Input 2\n\n3600\n\nSample Output 2\n\n13\n\nThere are 13 Shichi-Go-San numbers not greater than 3600: the above four numbers, 735, 753, 3357, 3375, 3537, 3557, 3573, 3575 and 3577.\n\nSample Input 3\n\n999999999\n\nSample Output 3\n\n26484", "sample_input": "575\n"}, "reference_outputs": ["4\n"], "source_document_id": "p03212", "source_text": "Score : 300 points\n\nProblem Statement\n\nYou are given an integer N. Among the integers between 1 and N (inclusive), how many Shichi-Go-San numbers (literally \"Seven-Five-Three numbers\") are there?\n\nHere, a Shichi-Go-San number is a positive integer that satisfies the following condition:\n\nWhen the number is written in base ten, each of the digits 7, 5 and 3 appears at least once, and the other digits never appear.\n\nConstraints\n\n1 \\leq N < 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 number of the Shichi-Go-San numbers between 1 and N (inclusive).\n\nSample Input 1\n\n575\n\nSample Output 1\n\n4\n\nThere are four Shichi-Go-San numbers not greater than 575: 357, 375, 537 and 573.\n\nSample Input 2\n\n3600\n\nSample Output 2\n\n13\n\nThere are 13 Shichi-Go-San numbers not greater than 3600: the above four numbers, 735, 753, 3357, 3375, 3537, 3557, 3573, 3575 and 3577.\n\nSample Input 3\n\n999999999\n\nSample Output 3\n\n26484", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s686541911", "group_id": "codeNet:p03212", "input_text": "var\n\tn:Longint;\nfunction f(x:int64;a,b,c:Longint):Longint;\nbegin\n\tf:=0;\n\tif x<=n then f:=a*b*c+f(x*10+3,1,b,c)+f(x*10+5,a,1,c)+f(x*10+7,a,b,1);\nend;\nbegin\n\tread(n);\n\tif n>777700000 then begin writeln(26484);exit;end;\n\twriteln(f(0,0,0,0));\nend.", "language": "Pascal", "metadata": {"date": 1575165686, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03212.html", "problem_id": "p03212", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03212/input.txt", "sample_output_relpath": "derived/input_output/data/p03212/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03212/Pascal/s686541911.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s686541911", "user_id": "u657913472"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "var\n\tn:Longint;\nfunction f(x:int64;a,b,c:Longint):Longint;\nbegin\n\tf:=0;\n\tif x<=n then f:=a*b*c+f(x*10+3,1,b,c)+f(x*10+5,a,1,c)+f(x*10+7,a,b,1);\nend;\nbegin\n\tread(n);\n\tif n>777700000 then begin writeln(26484);exit;end;\n\twriteln(f(0,0,0,0));\nend.", "problem_context": "Score : 300 points\n\nProblem Statement\n\nYou are given an integer N. Among the integers between 1 and N (inclusive), how many Shichi-Go-San numbers (literally \"Seven-Five-Three numbers\") are there?\n\nHere, a Shichi-Go-San number is a positive integer that satisfies the following condition:\n\nWhen the number is written in base ten, each of the digits 7, 5 and 3 appears at least once, and the other digits never appear.\n\nConstraints\n\n1 \\leq N < 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 number of the Shichi-Go-San numbers between 1 and N (inclusive).\n\nSample Input 1\n\n575\n\nSample Output 1\n\n4\n\nThere are four Shichi-Go-San numbers not greater than 575: 357, 375, 537 and 573.\n\nSample Input 2\n\n3600\n\nSample Output 2\n\n13\n\nThere are 13 Shichi-Go-San numbers not greater than 3600: the above four numbers, 735, 753, 3357, 3375, 3537, 3557, 3573, 3575 and 3577.\n\nSample Input 3\n\n999999999\n\nSample Output 3\n\n26484", "sample_input": "575\n"}, "reference_outputs": ["4\n"], "source_document_id": "p03212", "source_text": "Score : 300 points\n\nProblem Statement\n\nYou are given an integer N. Among the integers between 1 and N (inclusive), how many Shichi-Go-San numbers (literally \"Seven-Five-Three numbers\") are there?\n\nHere, a Shichi-Go-San number is a positive integer that satisfies the following condition:\n\nWhen the number is written in base ten, each of the digits 7, 5 and 3 appears at least once, and the other digits never appear.\n\nConstraints\n\n1 \\leq N < 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 number of the Shichi-Go-San numbers between 1 and N (inclusive).\n\nSample Input 1\n\n575\n\nSample Output 1\n\n4\n\nThere are four Shichi-Go-San numbers not greater than 575: 357, 375, 537 and 573.\n\nSample Input 2\n\n3600\n\nSample Output 2\n\n13\n\nThere are 13 Shichi-Go-San numbers not greater than 3600: the above four numbers, 735, 753, 3357, 3375, 3537, 3557, 3573, 3575 and 3577.\n\nSample Input 3\n\n999999999\n\nSample Output 3\n\n26484", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s021018833", "group_id": "codeNet:p03212", "input_text": "var n : longint;\n i,sum : integer;\n e : boolean;\n \nprocedure sft(p : longint; d : integer; s,f,t : boolean);\nbegin\n if d = 0 then begin\n if s and f and t then if p <= n then sum := sum + 1 else e := true\n end else begin\n sft(p * 10 + 3, d - 1, s, f, true);\n sft(p * 10 + 5, d - 1, s, true, t);\n sft(p * 10 + 7, d - 1, true, f, t)\n end\nend;\n \nbegin\n readln(n);\n sum := 0;\n e := false;\n for i := 3 to 9 do begin\n sft(0, i, false, false, false);\n if e then break;\n end;\n writeln(sum)\nend.", "language": "Pascal", "metadata": {"date": 1543984858, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03212.html", "problem_id": "p03212", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03212/input.txt", "sample_output_relpath": "derived/input_output/data/p03212/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03212/Pascal/s021018833.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s021018833", "user_id": "u492212770"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "var n : longint;\n i,sum : integer;\n e : boolean;\n \nprocedure sft(p : longint; d : integer; s,f,t : boolean);\nbegin\n if d = 0 then begin\n if s and f and t then if p <= n then sum := sum + 1 else e := true\n end else begin\n sft(p * 10 + 3, d - 1, s, f, true);\n sft(p * 10 + 5, d - 1, s, true, t);\n sft(p * 10 + 7, d - 1, true, f, t)\n end\nend;\n \nbegin\n readln(n);\n sum := 0;\n e := false;\n for i := 3 to 9 do begin\n sft(0, i, false, false, false);\n if e then break;\n end;\n writeln(sum)\nend.", "problem_context": "Score : 300 points\n\nProblem Statement\n\nYou are given an integer N. Among the integers between 1 and N (inclusive), how many Shichi-Go-San numbers (literally \"Seven-Five-Three numbers\") are there?\n\nHere, a Shichi-Go-San number is a positive integer that satisfies the following condition:\n\nWhen the number is written in base ten, each of the digits 7, 5 and 3 appears at least once, and the other digits never appear.\n\nConstraints\n\n1 \\leq N < 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 number of the Shichi-Go-San numbers between 1 and N (inclusive).\n\nSample Input 1\n\n575\n\nSample Output 1\n\n4\n\nThere are four Shichi-Go-San numbers not greater than 575: 357, 375, 537 and 573.\n\nSample Input 2\n\n3600\n\nSample Output 2\n\n13\n\nThere are 13 Shichi-Go-San numbers not greater than 3600: the above four numbers, 735, 753, 3357, 3375, 3537, 3557, 3573, 3575 and 3577.\n\nSample Input 3\n\n999999999\n\nSample Output 3\n\n26484", "sample_input": "575\n"}, "reference_outputs": ["4\n"], "source_document_id": "p03212", "source_text": "Score : 300 points\n\nProblem Statement\n\nYou are given an integer N. Among the integers between 1 and N (inclusive), how many Shichi-Go-San numbers (literally \"Seven-Five-Three numbers\") are there?\n\nHere, a Shichi-Go-San number is a positive integer that satisfies the following condition:\n\nWhen the number is written in base ten, each of the digits 7, 5 and 3 appears at least once, and the other digits never appear.\n\nConstraints\n\n1 \\leq N < 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 number of the Shichi-Go-San numbers between 1 and N (inclusive).\n\nSample Input 1\n\n575\n\nSample Output 1\n\n4\n\nThere are four Shichi-Go-San numbers not greater than 575: 357, 375, 537 and 573.\n\nSample Input 2\n\n3600\n\nSample Output 2\n\n13\n\nThere are 13 Shichi-Go-San numbers not greater than 3600: the above four numbers, 735, 753, 3357, 3375, 3537, 3557, 3573, 3575 and 3577.\n\nSample Input 3\n\n999999999\n\nSample Output 3\n\n26484", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s442742101", "group_id": "codeNet:p03212", "input_text": "var n : longint;\n i,sum : integer;\n e : boolean;\n \nprocedure sft(p : longint; d : integer; s,f,t : boolean);\nbegin\n if d = 0 then begin\n if s and f and t then if p < n then sum := sum + 1 else e := true\n end else begin\n sft(p * 10 + 3, d - 1, s, f, true);\n sft(p * 10 + 5, d - 1, s, true, t);\n sft(p * 10 + 7, d - 1, true, f, t);\n end\nend;\n \nbegin\n readln(n);\n sum := 0;\n e := false;\n for i := 3 to 9 do begin\n sft(0, i, false, false, false);\n end;\n writeln(sum)\nend.", "language": "Pascal", "metadata": {"date": 1543984629, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03212.html", "problem_id": "p03212", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03212/input.txt", "sample_output_relpath": "derived/input_output/data/p03212/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03212/Pascal/s442742101.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s442742101", "user_id": "u492212770"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "var n : longint;\n i,sum : integer;\n e : boolean;\n \nprocedure sft(p : longint; d : integer; s,f,t : boolean);\nbegin\n if d = 0 then begin\n if s and f and t then if p < n then sum := sum + 1 else e := true\n end else begin\n sft(p * 10 + 3, d - 1, s, f, true);\n sft(p * 10 + 5, d - 1, s, true, t);\n sft(p * 10 + 7, d - 1, true, f, t);\n end\nend;\n \nbegin\n readln(n);\n sum := 0;\n e := false;\n for i := 3 to 9 do begin\n sft(0, i, false, false, false);\n end;\n writeln(sum)\nend.", "problem_context": "Score : 300 points\n\nProblem Statement\n\nYou are given an integer N. Among the integers between 1 and N (inclusive), how many Shichi-Go-San numbers (literally \"Seven-Five-Three numbers\") are there?\n\nHere, a Shichi-Go-San number is a positive integer that satisfies the following condition:\n\nWhen the number is written in base ten, each of the digits 7, 5 and 3 appears at least once, and the other digits never appear.\n\nConstraints\n\n1 \\leq N < 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 number of the Shichi-Go-San numbers between 1 and N (inclusive).\n\nSample Input 1\n\n575\n\nSample Output 1\n\n4\n\nThere are four Shichi-Go-San numbers not greater than 575: 357, 375, 537 and 573.\n\nSample Input 2\n\n3600\n\nSample Output 2\n\n13\n\nThere are 13 Shichi-Go-San numbers not greater than 3600: the above four numbers, 735, 753, 3357, 3375, 3537, 3557, 3573, 3575 and 3577.\n\nSample Input 3\n\n999999999\n\nSample Output 3\n\n26484", "sample_input": "575\n"}, "reference_outputs": ["4\n"], "source_document_id": "p03212", "source_text": "Score : 300 points\n\nProblem Statement\n\nYou are given an integer N. Among the integers between 1 and N (inclusive), how many Shichi-Go-San numbers (literally \"Seven-Five-Three numbers\") are there?\n\nHere, a Shichi-Go-San number is a positive integer that satisfies the following condition:\n\nWhen the number is written in base ten, each of the digits 7, 5 and 3 appears at least once, and the other digits never appear.\n\nConstraints\n\n1 \\leq N < 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 number of the Shichi-Go-San numbers between 1 and N (inclusive).\n\nSample Input 1\n\n575\n\nSample Output 1\n\n4\n\nThere are four Shichi-Go-San numbers not greater than 575: 357, 375, 537 and 573.\n\nSample Input 2\n\n3600\n\nSample Output 2\n\n13\n\nThere are 13 Shichi-Go-San numbers not greater than 3600: the above four numbers, 735, 753, 3357, 3375, 3537, 3557, 3573, 3575 and 3577.\n\nSample Input 3\n\n999999999\n\nSample Output 3\n\n26484", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 1, "memory_kb": 128}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s404477748", "group_id": "codeNet:p03212", "input_text": "var\n\tn,ans:Longint;\nprocedure f(x:int64;a,b,c:Boolean);\nbegin\n\tif x>n then exit;\n\tif a and b and c then inc(ans);\n\tf(x*10+3,True,b,c);\n\tf(x*10+5,a,True,c);\n\tf(x*10+7,a,b,True);\nend;\nbegin\n\tread(n);\n\tif n>777777752 then begin writeln(26484);exit;end;\n\tf(0,False,False,False);\n\twriteln(ans);\nend.", "language": "Pascal", "metadata": {"date": 1543811080, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03212.html", "problem_id": "p03212", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03212/input.txt", "sample_output_relpath": "derived/input_output/data/p03212/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03212/Pascal/s404477748.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s404477748", "user_id": "u657913472"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "var\n\tn,ans:Longint;\nprocedure f(x:int64;a,b,c:Boolean);\nbegin\n\tif x>n then exit;\n\tif a and b and c then inc(ans);\n\tf(x*10+3,True,b,c);\n\tf(x*10+5,a,True,c);\n\tf(x*10+7,a,b,True);\nend;\nbegin\n\tread(n);\n\tif n>777777752 then begin writeln(26484);exit;end;\n\tf(0,False,False,False);\n\twriteln(ans);\nend.", "problem_context": "Score : 300 points\n\nProblem Statement\n\nYou are given an integer N. Among the integers between 1 and N (inclusive), how many Shichi-Go-San numbers (literally \"Seven-Five-Three numbers\") are there?\n\nHere, a Shichi-Go-San number is a positive integer that satisfies the following condition:\n\nWhen the number is written in base ten, each of the digits 7, 5 and 3 appears at least once, and the other digits never appear.\n\nConstraints\n\n1 \\leq N < 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 number of the Shichi-Go-San numbers between 1 and N (inclusive).\n\nSample Input 1\n\n575\n\nSample Output 1\n\n4\n\nThere are four Shichi-Go-San numbers not greater than 575: 357, 375, 537 and 573.\n\nSample Input 2\n\n3600\n\nSample Output 2\n\n13\n\nThere are 13 Shichi-Go-San numbers not greater than 3600: the above four numbers, 735, 753, 3357, 3375, 3537, 3557, 3573, 3575 and 3577.\n\nSample Input 3\n\n999999999\n\nSample Output 3\n\n26484", "sample_input": "575\n"}, "reference_outputs": ["4\n"], "source_document_id": "p03212", "source_text": "Score : 300 points\n\nProblem Statement\n\nYou are given an integer N. Among the integers between 1 and N (inclusive), how many Shichi-Go-San numbers (literally \"Seven-Five-Three numbers\") are there?\n\nHere, a Shichi-Go-San number is a positive integer that satisfies the following condition:\n\nWhen the number is written in base ten, each of the digits 7, 5 and 3 appears at least once, and the other digits never appear.\n\nConstraints\n\n1 \\leq N < 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 number of the Shichi-Go-San numbers between 1 and N (inclusive).\n\nSample Input 1\n\n575\n\nSample Output 1\n\n4\n\nThere are four Shichi-Go-San numbers not greater than 575: 357, 375, 537 and 573.\n\nSample Input 2\n\n3600\n\nSample Output 2\n\n13\n\nThere are 13 Shichi-Go-San numbers not greater than 3600: the above four numbers, 735, 753, 3357, 3375, 3537, 3557, 3573, 3575 and 3577.\n\nSample Input 3\n\n999999999\n\nSample Output 3\n\n26484", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s156734048", "group_id": "codeNet:p03212", "input_text": "var\n n,i,j,m,ans:longint;\n s:string;\n b1,b2,b3:boolean;\nbegin\n readln(n);\n if n<357 then begin writeln('0'); halt; end;\n if (1000'3')and(s[j]<>'5')and(s[j]<>'7') then break;\n if s[j]='3' then b1:=true;\n if s[j]='5' then b2:=true;\n if s[j]='7' then b3:=true;\n end;\n if b1 and b2 and b3 and(j=length(s)) then inc(ans);\n end;\n writeln(ans);\nend.", "language": "Pascal", "metadata": {"date": 1543808041, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03212.html", "problem_id": "p03212", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03212/input.txt", "sample_output_relpath": "derived/input_output/data/p03212/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03212/Pascal/s156734048.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s156734048", "user_id": "u223928734"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "var\n n,i,j,m,ans:longint;\n s:string;\n b1,b2,b3:boolean;\nbegin\n readln(n);\n if n<357 then begin writeln('0'); halt; end;\n if (1000'3')and(s[j]<>'5')and(s[j]<>'7') then break;\n if s[j]='3' then b1:=true;\n if s[j]='5' then b2:=true;\n if s[j]='7' then b3:=true;\n end;\n if b1 and b2 and b3 and(j=length(s)) then inc(ans);\n end;\n writeln(ans);\nend.", "problem_context": "Score : 300 points\n\nProblem Statement\n\nYou are given an integer N. Among the integers between 1 and N (inclusive), how many Shichi-Go-San numbers (literally \"Seven-Five-Three numbers\") are there?\n\nHere, a Shichi-Go-San number is a positive integer that satisfies the following condition:\n\nWhen the number is written in base ten, each of the digits 7, 5 and 3 appears at least once, and the other digits never appear.\n\nConstraints\n\n1 \\leq N < 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 number of the Shichi-Go-San numbers between 1 and N (inclusive).\n\nSample Input 1\n\n575\n\nSample Output 1\n\n4\n\nThere are four Shichi-Go-San numbers not greater than 575: 357, 375, 537 and 573.\n\nSample Input 2\n\n3600\n\nSample Output 2\n\n13\n\nThere are 13 Shichi-Go-San numbers not greater than 3600: the above four numbers, 735, 753, 3357, 3375, 3537, 3557, 3573, 3575 and 3577.\n\nSample Input 3\n\n999999999\n\nSample Output 3\n\n26484", "sample_input": "575\n"}, "reference_outputs": ["4\n"], "source_document_id": "p03212", "source_text": "Score : 300 points\n\nProblem Statement\n\nYou are given an integer N. Among the integers between 1 and N (inclusive), how many Shichi-Go-San numbers (literally \"Seven-Five-Three numbers\") are there?\n\nHere, a Shichi-Go-San number is a positive integer that satisfies the following condition:\n\nWhen the number is written in base ten, each of the digits 7, 5 and 3 appears at least once, and the other digits never appear.\n\nConstraints\n\n1 \\leq N < 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 number of the Shichi-Go-San numbers between 1 and N (inclusive).\n\nSample Input 1\n\n575\n\nSample Output 1\n\n4\n\nThere are four Shichi-Go-San numbers not greater than 575: 357, 375, 537 and 573.\n\nSample Input 2\n\n3600\n\nSample Output 2\n\n13\n\nThere are 13 Shichi-Go-San numbers not greater than 3600: the above four numbers, 735, 753, 3357, 3375, 3537, 3557, 3573, 3575 and 3577.\n\nSample Input 3\n\n999999999\n\nSample Output 3\n\n26484", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 113869, "cpu_time_ms": 2103, "memory_kb": 128}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s774119052", "group_id": "codeNet:p03212", "input_text": "var s:string;\ntot,nn:longint;\na:array[1..10]of integer;\nb:array[1..10]of 0..1;\nprocedure dfs(n,x:longint);\nvar num,i:longint;\nbegin \n\tif (n>=4) and (x<=nn) then \n\tbegin \n\t\t{for i:=1 to n-1 do write(a[i]);\n\t\twriteln;}\n\t\tfillchar(b,sizeof(b),0);\n\t\tfor i:=1 to n-1 do b[a[i]]:=1;\n\t\tif (b[3]=1) and (b[5]=1) and(b[7]=1) then inc(tot);\n\t\t\n\tend;\n\tif n>length(s) then exit;\n\t\ta[n]:=3;\n\t\tdfs(n+1,x*10+3);\n\t\ta[n]:=5;\n\t\tdfs(n+1,x*10+5);\n\t\ta[n]:=7;\n\t\tdfs(n+1,x*10+7);\nend;\nbegin \n readln(s);\n\tval(copy(s,1,length(s)),nn);\n fillchar(a,sizeof(a),0);\n tot:=0;\n dfs(1,0);\n write(tot);\nend.", "language": "Pascal", "metadata": {"date": 1543806853, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03212.html", "problem_id": "p03212", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03212/input.txt", "sample_output_relpath": "derived/input_output/data/p03212/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03212/Pascal/s774119052.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s774119052", "user_id": "u914335902"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "var s:string;\ntot,nn:longint;\na:array[1..10]of integer;\nb:array[1..10]of 0..1;\nprocedure dfs(n,x:longint);\nvar num,i:longint;\nbegin \n\tif (n>=4) and (x<=nn) then \n\tbegin \n\t\t{for i:=1 to n-1 do write(a[i]);\n\t\twriteln;}\n\t\tfillchar(b,sizeof(b),0);\n\t\tfor i:=1 to n-1 do b[a[i]]:=1;\n\t\tif (b[3]=1) and (b[5]=1) and(b[7]=1) then inc(tot);\n\t\t\n\tend;\n\tif n>length(s) then exit;\n\t\ta[n]:=3;\n\t\tdfs(n+1,x*10+3);\n\t\ta[n]:=5;\n\t\tdfs(n+1,x*10+5);\n\t\ta[n]:=7;\n\t\tdfs(n+1,x*10+7);\nend;\nbegin \n readln(s);\n\tval(copy(s,1,length(s)),nn);\n fillchar(a,sizeof(a),0);\n tot:=0;\n dfs(1,0);\n write(tot);\nend.", "problem_context": "Score : 300 points\n\nProblem Statement\n\nYou are given an integer N. Among the integers between 1 and N (inclusive), how many Shichi-Go-San numbers (literally \"Seven-Five-Three numbers\") are there?\n\nHere, a Shichi-Go-San number is a positive integer that satisfies the following condition:\n\nWhen the number is written in base ten, each of the digits 7, 5 and 3 appears at least once, and the other digits never appear.\n\nConstraints\n\n1 \\leq N < 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 number of the Shichi-Go-San numbers between 1 and N (inclusive).\n\nSample Input 1\n\n575\n\nSample Output 1\n\n4\n\nThere are four Shichi-Go-San numbers not greater than 575: 357, 375, 537 and 573.\n\nSample Input 2\n\n3600\n\nSample Output 2\n\n13\n\nThere are 13 Shichi-Go-San numbers not greater than 3600: the above four numbers, 735, 753, 3357, 3375, 3537, 3557, 3573, 3575 and 3577.\n\nSample Input 3\n\n999999999\n\nSample Output 3\n\n26484", "sample_input": "575\n"}, "reference_outputs": ["4\n"], "source_document_id": "p03212", "source_text": "Score : 300 points\n\nProblem Statement\n\nYou are given an integer N. Among the integers between 1 and N (inclusive), how many Shichi-Go-San numbers (literally \"Seven-Five-Three numbers\") are there?\n\nHere, a Shichi-Go-San number is a positive integer that satisfies the following condition:\n\nWhen the number is written in base ten, each of the digits 7, 5 and 3 appears at least once, and the other digits never appear.\n\nConstraints\n\n1 \\leq N < 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 number of the Shichi-Go-San numbers between 1 and N (inclusive).\n\nSample Input 1\n\n575\n\nSample Output 1\n\n4\n\nThere are four Shichi-Go-San numbers not greater than 575: 357, 375, 537 and 573.\n\nSample Input 2\n\n3600\n\nSample Output 2\n\n13\n\nThere are 13 Shichi-Go-San numbers not greater than 3600: the above four numbers, 735, 753, 3357, 3375, 3537, 3557, 3573, 3575 and 3577.\n\nSample Input 3\n\n999999999\n\nSample Output 3\n\n26484", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 589, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s388104238", "group_id": "codeNet:p03213", "input_text": "var\n i,j,k,ans,n:longint;\n s:array[0..110] of longint;\n f:array[0..110,0..110,0..110] of boolean;\nprocedure prime(x:longint);\nbegin\n j:=2;\n while x>=j do\n begin\n while x mod j=0 do\n begin\n inc(s[j]);\n x:=x div j;\n end;\n inc(j);\n end;\nend;\nbegin\n read(n);\n fillchar(s,sizeof(s),0);\n for i:=2 to n do prime(i);\n fillchar(f,sizeof(f),true);\n ans:=0;\n for i:=2 to n do\n for j:=2 to n do\n if i<>j then\n begin\n if (s[i]>=2) and (s[j]>=24) then inc(ans);\n if (s[i]>=4) and (s[j]>=14) then inc(ans);\n if (s[i]>=2) and (s[j]>=4) then \n for k:=2 to n do\n if (i<>k) and (j<>k) then\n if s[k]>=4 then \n if f[i,j,k] then\n begin \n inc(ans);\n f[i,j,k]:=false;\n f[i,k,j]:=false;\n end;\n end;\n for i:=1 to n do\n if s[i]>=74 then inc(ans);\n writeln(ans);\nend.", "language": "Pascal", "metadata": {"date": 1543807058, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03213.html", "problem_id": "p03213", "resource_group": "low_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/Pascal/s388104238.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s388104238", "user_id": "u380619494"}, "prompt_components": {"gold_output": "0\n", "input_to_evaluate": "var\n i,j,k,ans,n:longint;\n s:array[0..110] of longint;\n f:array[0..110,0..110,0..110] of boolean;\nprocedure prime(x:longint);\nbegin\n j:=2;\n while x>=j do\n begin\n while x mod j=0 do\n begin\n inc(s[j]);\n x:=x div j;\n end;\n inc(j);\n end;\nend;\nbegin\n read(n);\n fillchar(s,sizeof(s),0);\n for i:=2 to n do prime(i);\n fillchar(f,sizeof(f),true);\n ans:=0;\n for i:=2 to n do\n for j:=2 to n do\n if i<>j then\n begin\n if (s[i]>=2) and (s[j]>=24) then inc(ans);\n if (s[i]>=4) and (s[j]>=14) then inc(ans);\n if (s[i]>=2) and (s[j]>=4) then \n for k:=2 to n do\n if (i<>k) and (j<>k) then\n if s[k]>=4 then \n if f[i,j,k] then\n begin \n inc(ans);\n f[i,j,k]:=false;\n f[i,k,j]:=false;\n end;\n end;\n for i:=1 to n do\n if s[i]>=74 then inc(ans);\n writeln(ans);\nend.", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1193, "cpu_time_ms": 1, "memory_kb": 1408}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s193988227", "group_id": "codeNet:p03213", "input_text": "var\n i,j,k,ans,n:longint;\n s:array[0..110] of longint;\n f:array[0..110,0..110,0..110] of boolean;\nprocedure prime(x:longint);\nbegin\n j:=2;\n while x>=j do\n begin\n while x mod j=0 do\n begin\n inc(s[j]);\n x:=x div j;\n end;\n inc(j);\n end;\nend;\nbegin\n read(n);\n fillchar(s,sizeof(s),0);\n for i:=2 to n do prime(i);\n for i:=2 to n do writeln('s[',i,']=',s[i]);\n fillchar(f,sizeof(f),true);\n ans:=0;\n for i:=2 to n do\n for j:=2 to n do\n if i<>j then\n begin\n if (s[i]>=2) and (s[j]>=24) then inc(ans);\n if (s[i]>=4) and (s[j]>=14) then inc(ans);\n if (s[i]>=2) and (s[j]>=4) then \n for k:=2 to n do\n if (i<>k) and (j<>k) then\n if s[k]>=4 then \n if f[i,j,k] then\n begin \n inc(ans);\n f[i,j,k]:=false;\n f[i,k,j]:=false;\n end;\n end;\n for i:=1 to n do\n if s[i]>=74 then inc(ans);\n writeln(ans);\nend.", "language": "Pascal", "metadata": {"date": 1543806971, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03213.html", "problem_id": "p03213", "resource_group": "low_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/Pascal/s193988227.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s193988227", "user_id": "u380619494"}, "prompt_components": {"gold_output": "0\n", "input_to_evaluate": "var\n i,j,k,ans,n:longint;\n s:array[0..110] of longint;\n f:array[0..110,0..110,0..110] of boolean;\nprocedure prime(x:longint);\nbegin\n j:=2;\n while x>=j do\n begin\n while x mod j=0 do\n begin\n inc(s[j]);\n x:=x div j;\n end;\n inc(j);\n end;\nend;\nbegin\n read(n);\n fillchar(s,sizeof(s),0);\n for i:=2 to n do prime(i);\n for i:=2 to n do writeln('s[',i,']=',s[i]);\n fillchar(f,sizeof(f),true);\n ans:=0;\n for i:=2 to n do\n for j:=2 to n do\n if i<>j then\n begin\n if (s[i]>=2) and (s[j]>=24) then inc(ans);\n if (s[i]>=4) and (s[j]>=14) then inc(ans);\n if (s[i]>=2) and (s[j]>=4) then \n for k:=2 to n do\n if (i<>k) and (j<>k) then\n if s[k]>=4 then \n if f[i,j,k] then\n begin \n inc(ans);\n f[i,j,k]:=false;\n f[i,k,j]:=false;\n end;\n end;\n for i:=1 to n do\n if s[i]>=74 then inc(ans);\n writeln(ans);\nend.", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1241, "cpu_time_ms": 1, "memory_kb": 1408}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s199087036", "group_id": "codeNet:p03213", "input_text": "{\n\t75=3*25\n\t\t=3*5*5\n\t\t=5*15\n\ta^2 b^24\n\ta^2 b^4 c^4\n\ta^4 b^14\n}\nvar\n\ti,j,k,ans,n:longint;\n\ts:array[0..110] of longint;\n\tf:array[0..110,0..110,0..110] of boolean;\nprocedure prime(x:longint);\nbegin\n\tj:=2;\n\twhile x>=j do\n\tbegin\n\t\twhile x mod j=0 do\n\t\tbegin\n\t\t\tinc(s[j]);\n\t\t\tx:=x div j;\n\t\tend;\n\t\tinc(j);\n\tend;\nend;\nbegin\n\tread(n);\n\tfillchar(s,sizeof(s),0);\n\tfor i:=2 to n do prime(i);\n\tfillchar(f,sizeof(f),true);\n\tans:=0;\n\tfor i:=2 to n do\n\t\tfor j:=2 to n do\n\t\t\tif i<>j then\n\t\t\tbegin\n\t\t\t\tif (s[i]>=2) and (s[j]>=24) then inc(ans);\n\t\t\t\tif (s[i]>=4) and (s[j]>=14) then inc(ans);\n\t\t\t\tif (s[i]>=2) and (s[j]>=4) then \n\t\t\t\t\tfor k:=2 to n do\n\t\t\t\t\t\tif (i<>k) and (j<>k) then\n\t\t\t\t\t\t\tif s[k]>=4 then \n\t\t\t\t\t\t\t\tif f[i,j,k] then\n\t\t\t\t\t\t\t\tbegin \n\t\t\t\t\t\t\t\t\tinc(ans);\n\t\t\t\t\t\t\t\t\tf[i,j,k]:=false;\n\t\t\t\t\t\t\t\t\tf[i,k,j]:=false;\n\t\t\t\t\t\t\t\tend;\n\t\t\tend;\n\tfor i:=1 to n do\n\t\tif s[i]>=74 then inc(ans);\n\twriteln(ans);\nend.", "language": "Pascal", "metadata": {"date": 1543805213, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03213.html", "problem_id": "p03213", "resource_group": "low_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/Pascal/s199087036.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s199087036", "user_id": "u957998623"}, "prompt_components": {"gold_output": "0\n", "input_to_evaluate": "{\n\t75=3*25\n\t\t=3*5*5\n\t\t=5*15\n\ta^2 b^24\n\ta^2 b^4 c^4\n\ta^4 b^14\n}\nvar\n\ti,j,k,ans,n:longint;\n\ts:array[0..110] of longint;\n\tf:array[0..110,0..110,0..110] of boolean;\nprocedure prime(x:longint);\nbegin\n\tj:=2;\n\twhile x>=j do\n\tbegin\n\t\twhile x mod j=0 do\n\t\tbegin\n\t\t\tinc(s[j]);\n\t\t\tx:=x div j;\n\t\tend;\n\t\tinc(j);\n\tend;\nend;\nbegin\n\tread(n);\n\tfillchar(s,sizeof(s),0);\n\tfor i:=2 to n do prime(i);\n\tfillchar(f,sizeof(f),true);\n\tans:=0;\n\tfor i:=2 to n do\n\t\tfor j:=2 to n do\n\t\t\tif i<>j then\n\t\t\tbegin\n\t\t\t\tif (s[i]>=2) and (s[j]>=24) then inc(ans);\n\t\t\t\tif (s[i]>=4) and (s[j]>=14) then inc(ans);\n\t\t\t\tif (s[i]>=2) and (s[j]>=4) then \n\t\t\t\t\tfor k:=2 to n do\n\t\t\t\t\t\tif (i<>k) and (j<>k) then\n\t\t\t\t\t\t\tif s[k]>=4 then \n\t\t\t\t\t\t\t\tif f[i,j,k] then\n\t\t\t\t\t\t\t\tbegin \n\t\t\t\t\t\t\t\t\tinc(ans);\n\t\t\t\t\t\t\t\t\tf[i,j,k]:=false;\n\t\t\t\t\t\t\t\t\tf[i,k,j]:=false;\n\t\t\t\t\t\t\t\tend;\n\t\t\tend;\n\tfor i:=1 to n do\n\t\tif s[i]>=74 then inc(ans);\n\twriteln(ans);\nend.", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 887, "cpu_time_ms": 1, "memory_kb": 1408}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s667466942", "group_id": "codeNet:p03221", "input_text": "var\n\ta,b,x,y,num,pro:array[0..100010] of longint;\n\tn,m,i,t:longint;\n\tch:string[20];\nprocedure qsort(l,r:longint);\nvar\n\ti,j,k,l1,t,mid:longint;\nbegin\n\ti:=l; j:=r;\n\tmid:=(l+r) div 2;\n\trepeat\n\t\twhile (x[i]x[mid]) or (x[j]=x[mid]) and (y[j]>y[mid]) do dec(j);\n\t\tif i<=j then\n\t\tbegin\n\t\t\tt:=x[i]; x[i]:=x[j]; x[j]:=t;\n\t\t\tt:=y[i]; y[i]:=y[j]; y[j]:=t;\n\t\t\tt:=num[pro[i]]; num[pro[i]]:=num[pro[j]]; num[pro[j]]:=t;\n\t\t\tt:=pro[num[i]]; pro[num[i]]:=pro[num[j]]; pro[num[j]]:=t;\n\t\t\tinc(i); dec(j);\n\t\tend;\n\tuntil i>j;\n\tif lx[i-1] then t:=1 else inc(t);\n\t\ty[i]:=t;\n\tend;\n\tfor i:=1 to m do card(x[num[i]],y[num[i]]);\nend.", "language": "Pascal", "metadata": {"date": 1541389207, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03221.html", "problem_id": "p03221", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03221/input.txt", "sample_output_relpath": "derived/input_output/data/p03221/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03221/Pascal/s667466942.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s667466942", "user_id": "u957998623"}, "prompt_components": {"gold_output": "000001000002\n000002000001\n000001000001\n", "input_to_evaluate": "var\n\ta,b,x,y,num,pro:array[0..100010] of longint;\n\tn,m,i,t:longint;\n\tch:string[20];\nprocedure qsort(l,r:longint);\nvar\n\ti,j,k,l1,t,mid:longint;\nbegin\n\ti:=l; j:=r;\n\tmid:=(l+r) div 2;\n\trepeat\n\t\twhile (x[i]x[mid]) or (x[j]=x[mid]) and (y[j]>y[mid]) do dec(j);\n\t\tif i<=j then\n\t\tbegin\n\t\t\tt:=x[i]; x[i]:=x[j]; x[j]:=t;\n\t\t\tt:=y[i]; y[i]:=y[j]; y[j]:=t;\n\t\t\tt:=num[pro[i]]; num[pro[i]]:=num[pro[j]]; num[pro[j]]:=t;\n\t\t\tt:=pro[num[i]]; pro[num[i]]:=pro[num[j]]; pro[num[j]]:=t;\n\t\t\tinc(i); dec(j);\n\t\tend;\n\tuntil i>j;\n\tif lx[i-1] then t:=1 else inc(t);\n\t\ty[i]:=t;\n\tend;\n\tfor i:=1 to m do card(x[num[i]],y[num[i]]);\nend.", "problem_context": "Score: 300 points\n\nProblem Statement\n\nIn Republic of Atcoder, there are N prefectures, and a total of M cities that belong to those prefectures.\n\nCity i is established in year Y_i and belongs to Prefecture P_i.\n\nYou can assume that there are no multiple cities that are established in the same year.\n\nIt is decided to allocate a 12-digit ID number to each city.\n\nIf City i is the x-th established city among the cities that belong to Prefecture i, the first six digits of the ID number of City i is P_i, and the last six digits of the ID number is x.\n\nHere, if P_i or x (or both) has less than six digits, zeros are added to the left until it has six digits.\n\nFind the ID numbers for all the cities.\n\nNote that there can be a prefecture with no cities.\n\nConstraints\n\n1 \\leq N \\leq 10^5\n\n1 \\leq M \\leq 10^5\n\n1 \\leq P_i \\leq N\n\n1 \\leq Y_i \\leq 10^9\n\nY_i are all different.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nP_1 Y_1\n:\nP_M Y_M\n\nOutput\n\nPrint the ID numbers for all the cities, in ascending order of indices (City 1, City 2, ...).\n\nSample Input 1\n\n2 3\n1 32\n2 63\n1 12\n\nSample Output 1\n\n000001000002\n000002000001\n000001000001\n\nAs City 1 is the second established city among the cities that belong to Prefecture 1, its ID number is 000001000002.\n\nAs City 2 is the first established city among the cities that belong to Prefecture 2, its ID number is 000002000001.\n\nAs City 3 is the first established city among the cities that belong to Prefecture 1, its ID number is 000001000001.\n\nSample Input 2\n\n2 3\n2 55\n2 77\n2 99\n\nSample Output 2\n\n000002000001\n000002000002\n000002000003", "sample_input": "2 3\n1 32\n2 63\n1 12\n"}, "reference_outputs": ["000001000002\n000002000001\n000001000001\n"], "source_document_id": "p03221", "source_text": "Score: 300 points\n\nProblem Statement\n\nIn Republic of Atcoder, there are N prefectures, and a total of M cities that belong to those prefectures.\n\nCity i is established in year Y_i and belongs to Prefecture P_i.\n\nYou can assume that there are no multiple cities that are established in the same year.\n\nIt is decided to allocate a 12-digit ID number to each city.\n\nIf City i is the x-th established city among the cities that belong to Prefecture i, the first six digits of the ID number of City i is P_i, and the last six digits of the ID number is x.\n\nHere, if P_i or x (or both) has less than six digits, zeros are added to the left until it has six digits.\n\nFind the ID numbers for all the cities.\n\nNote that there can be a prefecture with no cities.\n\nConstraints\n\n1 \\leq N \\leq 10^5\n\n1 \\leq M \\leq 10^5\n\n1 \\leq P_i \\leq N\n\n1 \\leq Y_i \\leq 10^9\n\nY_i are all different.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nP_1 Y_1\n:\nP_M Y_M\n\nOutput\n\nPrint the ID numbers for all the cities, in ascending order of indices (City 1, City 2, ...).\n\nSample Input 1\n\n2 3\n1 32\n2 63\n1 12\n\nSample Output 1\n\n000001000002\n000002000001\n000001000001\n\nAs City 1 is the second established city among the cities that belong to Prefecture 1, its ID number is 000001000002.\n\nAs City 2 is the first established city among the cities that belong to Prefecture 2, its ID number is 000002000001.\n\nAs City 3 is the first established city among the cities that belong to Prefecture 1, its ID number is 000001000001.\n\nSample Input 2\n\n2 3\n2 55\n2 77\n2 99\n\nSample Output 2\n\n000002000001\n000002000002\n000002000003", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1114, "cpu_time_ms": 98, "memory_kb": 3712}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s407104988", "group_id": "codeNet:p03221", "input_text": "var\n\ta,b,x,y,num,pro:array[0..100010] of longint;\n\tn,m,i,t:longint;\n\tch:string[20];\nprocedure qsort(l,r:longint);\nvar\n\ti,j,k,l1,t,mid:longint;\nbegin\n\ti:=l; j:=r;\n\tmid:=(l+r) div 2;\n\trepeat\n\t\twhile (x[i]x[mid]) or (x[j]=x[mid]) and (y[j]>y[mid]) do dec(j);\n\t\tif i<=j then\n\t\tbegin\n\t\t\tt:=x[i]; x[i]:=x[j]; x[j]:=t;\n\t\t\tt:=y[i]; y[i]:=y[j]; y[j]:=t;\n\t\t\tt:=num[pro[i]]; num[pro[i]]:=num[pro[j]]; num[pro[j]]:=t;\n\t\t\tpro[num[i]]:=j; pro[num[i]]:=i;\n\t\t\tinc(i); dec(j);\n\t\tend;\n\tuntil i>j;\n\tif lx[i-1] then t:=1 else inc(t);\n\t\ty[i]:=t;\n\tend;\n\tfor i:=1 to m do card(x[num[i]],y[num[i]]);\nend.", "language": "Pascal", "metadata": {"date": 1541389098, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03221.html", "problem_id": "p03221", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03221/input.txt", "sample_output_relpath": "derived/input_output/data/p03221/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03221/Pascal/s407104988.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s407104988", "user_id": "u957998623"}, "prompt_components": {"gold_output": "000001000002\n000002000001\n000001000001\n", "input_to_evaluate": "var\n\ta,b,x,y,num,pro:array[0..100010] of longint;\n\tn,m,i,t:longint;\n\tch:string[20];\nprocedure qsort(l,r:longint);\nvar\n\ti,j,k,l1,t,mid:longint;\nbegin\n\ti:=l; j:=r;\n\tmid:=(l+r) div 2;\n\trepeat\n\t\twhile (x[i]x[mid]) or (x[j]=x[mid]) and (y[j]>y[mid]) do dec(j);\n\t\tif i<=j then\n\t\tbegin\n\t\t\tt:=x[i]; x[i]:=x[j]; x[j]:=t;\n\t\t\tt:=y[i]; y[i]:=y[j]; y[j]:=t;\n\t\t\tt:=num[pro[i]]; num[pro[i]]:=num[pro[j]]; num[pro[j]]:=t;\n\t\t\tpro[num[i]]:=j; pro[num[i]]:=i;\n\t\t\tinc(i); dec(j);\n\t\tend;\n\tuntil i>j;\n\tif lx[i-1] then t:=1 else inc(t);\n\t\ty[i]:=t;\n\tend;\n\tfor i:=1 to m do card(x[num[i]],y[num[i]]);\nend.", "problem_context": "Score: 300 points\n\nProblem Statement\n\nIn Republic of Atcoder, there are N prefectures, and a total of M cities that belong to those prefectures.\n\nCity i is established in year Y_i and belongs to Prefecture P_i.\n\nYou can assume that there are no multiple cities that are established in the same year.\n\nIt is decided to allocate a 12-digit ID number to each city.\n\nIf City i is the x-th established city among the cities that belong to Prefecture i, the first six digits of the ID number of City i is P_i, and the last six digits of the ID number is x.\n\nHere, if P_i or x (or both) has less than six digits, zeros are added to the left until it has six digits.\n\nFind the ID numbers for all the cities.\n\nNote that there can be a prefecture with no cities.\n\nConstraints\n\n1 \\leq N \\leq 10^5\n\n1 \\leq M \\leq 10^5\n\n1 \\leq P_i \\leq N\n\n1 \\leq Y_i \\leq 10^9\n\nY_i are all different.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nP_1 Y_1\n:\nP_M Y_M\n\nOutput\n\nPrint the ID numbers for all the cities, in ascending order of indices (City 1, City 2, ...).\n\nSample Input 1\n\n2 3\n1 32\n2 63\n1 12\n\nSample Output 1\n\n000001000002\n000002000001\n000001000001\n\nAs City 1 is the second established city among the cities that belong to Prefecture 1, its ID number is 000001000002.\n\nAs City 2 is the first established city among the cities that belong to Prefecture 2, its ID number is 000002000001.\n\nAs City 3 is the first established city among the cities that belong to Prefecture 1, its ID number is 000001000001.\n\nSample Input 2\n\n2 3\n2 55\n2 77\n2 99\n\nSample Output 2\n\n000002000001\n000002000002\n000002000003", "sample_input": "2 3\n1 32\n2 63\n1 12\n"}, "reference_outputs": ["000001000002\n000002000001\n000001000001\n"], "source_document_id": "p03221", "source_text": "Score: 300 points\n\nProblem Statement\n\nIn Republic of Atcoder, there are N prefectures, and a total of M cities that belong to those prefectures.\n\nCity i is established in year Y_i and belongs to Prefecture P_i.\n\nYou can assume that there are no multiple cities that are established in the same year.\n\nIt is decided to allocate a 12-digit ID number to each city.\n\nIf City i is the x-th established city among the cities that belong to Prefecture i, the first six digits of the ID number of City i is P_i, and the last six digits of the ID number is x.\n\nHere, if P_i or x (or both) has less than six digits, zeros are added to the left until it has six digits.\n\nFind the ID numbers for all the cities.\n\nNote that there can be a prefecture with no cities.\n\nConstraints\n\n1 \\leq N \\leq 10^5\n\n1 \\leq M \\leq 10^5\n\n1 \\leq P_i \\leq N\n\n1 \\leq Y_i \\leq 10^9\n\nY_i are all different.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nP_1 Y_1\n:\nP_M Y_M\n\nOutput\n\nPrint the ID numbers for all the cities, in ascending order of indices (City 1, City 2, ...).\n\nSample Input 1\n\n2 3\n1 32\n2 63\n1 12\n\nSample Output 1\n\n000001000002\n000002000001\n000001000001\n\nAs City 1 is the second established city among the cities that belong to Prefecture 1, its ID number is 000001000002.\n\nAs City 2 is the first established city among the cities that belong to Prefecture 2, its ID number is 000002000001.\n\nAs City 3 is the first established city among the cities that belong to Prefecture 1, its ID number is 000001000001.\n\nSample Input 2\n\n2 3\n2 55\n2 77\n2 99\n\nSample Output 2\n\n000002000001\n000002000002\n000002000003", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1088, "cpu_time_ms": 97, "memory_kb": 3840}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s347774326", "group_id": "codeNet:p03221", "input_text": "var\n n,m,i,j,zrt:longint;\n p,y,a,b,c,o:array[0..1000000]of longint;\nProcedure ch(var x,y:longint);\nvar\n t:longint;\nbegin\n t:=x;x:=y;y:=t;\nend;\nProcedure qs(l,r:longint);\nvar\n i,j,mid1,mid2:longint;\nbegin\n i:=l;j:=r;mid1:=p[(l+r)div 2];mid2:=y[(l+r)div 2];\n repeat\n while (p[i]mid1)or((p[j]=mid1)and(y[j]>mid2)) do dec(j);\n if i<=j then\n begin\n ch(p[i],p[j]);\n ch(y[i],y[j]);\n ch(c[i],c[j]);\n inc(i);dec(j);\n end;\n until i>j;\n if lp[i-1]) then j:=1 else inc(j);\n o[c[i]]:=j;\n end;\n for i:=1 to m do\n begin\n zrt:=100000;\n for j:=1 to 6 do\n begin\n if a[i]mid1)or((p[j]=mid1)and(y[j]>mid2)) do dec(j);\n if i<=j then\n begin\n ch(p[i],p[j]);\n ch(y[i],y[j]);\n ch(c[i],c[j]);\n inc(i);dec(j);\n end;\n until i>j;\n if lp[i-1]) then j:=1 else inc(j);\n o[c[i]]:=j;\n end;\n for i:=1 to m do\n begin\n zrt:=100000;\n for j:=1 to 6 do\n begin\n if a[i]x[mid]) or (x[j]=x[mid]) and (y[j]>y[mid]) do dec(j);\n\t\tif i<=j then\n\t\tbegin\n\t\t\tt:=x[i]; x[i]:=x[j]; x[j]:=t;\n\t\t\tt:=y[i]; y[i]:=y[j]; y[j]:=t;\n\t\t\tnum[num[i]]:=j; num[num[j]]:=i;\n\t\t\tinc(i); dec(j);\n\t\tend;\n\tuntil i>j;\n\tif lx[i-1] then t:=1 else inc(t);\n\t\ty[i]:=t;\n\tend;\n\tfor i:=1 to m do card(x[num[i]],y[num[i]]);\nend.", "language": "Pascal", "metadata": {"date": 1541388280, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03221.html", "problem_id": "p03221", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03221/input.txt", "sample_output_relpath": "derived/input_output/data/p03221/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03221/Pascal/s271719827.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s271719827", "user_id": "u957998623"}, "prompt_components": {"gold_output": "000001000002\n000002000001\n000001000001\n", "input_to_evaluate": "var\n\ta,b,x,y,num:array[0..100010] of longint;\n\tn,m,i,t:longint;\n\tch:string[20];\nprocedure qsort(l,r:longint);\nvar\n\ti,j,t,mid:longint;\nbegin\n\ti:=l; j:=r;\n\tmid:=(l+r) div 2;\n\trepeat\n\t\twhile (x[i]x[mid]) or (x[j]=x[mid]) and (y[j]>y[mid]) do dec(j);\n\t\tif i<=j then\n\t\tbegin\n\t\t\tt:=x[i]; x[i]:=x[j]; x[j]:=t;\n\t\t\tt:=y[i]; y[i]:=y[j]; y[j]:=t;\n\t\t\tnum[num[i]]:=j; num[num[j]]:=i;\n\t\t\tinc(i); dec(j);\n\t\tend;\n\tuntil i>j;\n\tif lx[i-1] then t:=1 else inc(t);\n\t\ty[i]:=t;\n\tend;\n\tfor i:=1 to m do card(x[num[i]],y[num[i]]);\nend.", "problem_context": "Score: 300 points\n\nProblem Statement\n\nIn Republic of Atcoder, there are N prefectures, and a total of M cities that belong to those prefectures.\n\nCity i is established in year Y_i and belongs to Prefecture P_i.\n\nYou can assume that there are no multiple cities that are established in the same year.\n\nIt is decided to allocate a 12-digit ID number to each city.\n\nIf City i is the x-th established city among the cities that belong to Prefecture i, the first six digits of the ID number of City i is P_i, and the last six digits of the ID number is x.\n\nHere, if P_i or x (or both) has less than six digits, zeros are added to the left until it has six digits.\n\nFind the ID numbers for all the cities.\n\nNote that there can be a prefecture with no cities.\n\nConstraints\n\n1 \\leq N \\leq 10^5\n\n1 \\leq M \\leq 10^5\n\n1 \\leq P_i \\leq N\n\n1 \\leq Y_i \\leq 10^9\n\nY_i are all different.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nP_1 Y_1\n:\nP_M Y_M\n\nOutput\n\nPrint the ID numbers for all the cities, in ascending order of indices (City 1, City 2, ...).\n\nSample Input 1\n\n2 3\n1 32\n2 63\n1 12\n\nSample Output 1\n\n000001000002\n000002000001\n000001000001\n\nAs City 1 is the second established city among the cities that belong to Prefecture 1, its ID number is 000001000002.\n\nAs City 2 is the first established city among the cities that belong to Prefecture 2, its ID number is 000002000001.\n\nAs City 3 is the first established city among the cities that belong to Prefecture 1, its ID number is 000001000001.\n\nSample Input 2\n\n2 3\n2 55\n2 77\n2 99\n\nSample Output 2\n\n000002000001\n000002000002\n000002000003", "sample_input": "2 3\n1 32\n2 63\n1 12\n"}, "reference_outputs": ["000001000002\n000002000001\n000001000001\n"], "source_document_id": "p03221", "source_text": "Score: 300 points\n\nProblem Statement\n\nIn Republic of Atcoder, there are N prefectures, and a total of M cities that belong to those prefectures.\n\nCity i is established in year Y_i and belongs to Prefecture P_i.\n\nYou can assume that there are no multiple cities that are established in the same year.\n\nIt is decided to allocate a 12-digit ID number to each city.\n\nIf City i is the x-th established city among the cities that belong to Prefecture i, the first six digits of the ID number of City i is P_i, and the last six digits of the ID number is x.\n\nHere, if P_i or x (or both) has less than six digits, zeros are added to the left until it has six digits.\n\nFind the ID numbers for all the cities.\n\nNote that there can be a prefecture with no cities.\n\nConstraints\n\n1 \\leq N \\leq 10^5\n\n1 \\leq M \\leq 10^5\n\n1 \\leq P_i \\leq N\n\n1 \\leq Y_i \\leq 10^9\n\nY_i are all different.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nP_1 Y_1\n:\nP_M Y_M\n\nOutput\n\nPrint the ID numbers for all the cities, in ascending order of indices (City 1, City 2, ...).\n\nSample Input 1\n\n2 3\n1 32\n2 63\n1 12\n\nSample Output 1\n\n000001000002\n000002000001\n000001000001\n\nAs City 1 is the second established city among the cities that belong to Prefecture 1, its ID number is 000001000002.\n\nAs City 2 is the first established city among the cities that belong to Prefecture 2, its ID number is 000002000001.\n\nAs City 3 is the first established city among the cities that belong to Prefecture 1, its ID number is 000001000001.\n\nSample Input 2\n\n2 3\n2 55\n2 77\n2 99\n\nSample Output 2\n\n000002000001\n000002000002\n000002000003", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1005, "cpu_time_ms": 95, "memory_kb": 3328}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s297458986", "group_id": "codeNet:p03222", "input_text": "var\n n,m,i,j,zrt:longint;\n p,y,a,b,c,o:array[0..1000000]of longint;\nProcedure ch(var x,y:longint);\nvar\n t:longint;\nbegin\n t:=x;x:=y;y:=t;\nend;\nProcedure qs(l,r:longint);\nvar\n i,j,mid1,mid2:longint;\nbegin\n i:=l;j:=r;mid1:=p[(l+r)div 2];mid2:=y[(l+r)div 2];\n repeat\n while (p[i]mid1)or((p[j]=mid1)and(y[j]>mid2)) do dec(j);\n if i<=j then\n begin\n ch(p[i],p[j]);\n ch(y[i],y[j]);\n ch(c[i],c[j]);\n inc(i);dec(j);\n end;\n until i>j;\n if lp[i-1]) then j:=1 else inc(j);\n o[c[i]]:=j;\n end;\n for i:=1 to m do\n begin\n zrt:=100000;\n for j:=1 to 6 do\n begin\n if a[i]mid1)or((p[j]=mid1)and(y[j]>mid2)) do dec(j);\n if i<=j then\n begin\n ch(p[i],p[j]);\n ch(y[i],y[j]);\n ch(c[i],c[j]);\n inc(i);dec(j);\n end;\n until i>j;\n if lp[i-1]) then j:=1 else inc(j);\n o[c[i]]:=j;\n end;\n for i:=1 to m do\n begin\n zrt:=100000;\n for j:=1 to 6 do\n begin\n if a[i]mid do dec(j);\n\t\tif i<=j then\n\t\tbegin\n\t\t\tt:=a[i]; a[i]:=a[j]; a[j]:=t;\n\t\t\tinc(i); dec(j);\n\t\tend;\n\tuntil i>j;\n\tif ly then \n\t\tbegin \n\t\t\tt2:=a[r];\n\t\t\tdec(r);\n\t\t\tif r=ttt then dec(r);\n\t\tend;\n\t\tif xmid do dec(j);\n\t\tif i<=j then\n\t\tbegin\n\t\t\tt:=a[i]; a[i]:=a[j]; a[j]:=t;\n\t\t\tinc(i); dec(j);\n\t\tend;\n\tuntil i>j;\n\tif ly then \n\t\tbegin \n\t\t\tt2:=a[r];\n\t\t\tdec(r);\n\t\t\tif r=ttt then dec(r);\n\t\tend;\n\t\tif xmid do dec(j);\n\t\tif i<=j then\n\t\tbegin\n\t\t\tt:=a[i]; a[i]:=a[j]; a[j]:=t;\n\t\t\tinc(i); dec(j);\n\t\tend;\n\tuntil i>j;\n\tif ly then right\n\t\telse if xabs(a[r]-a[l+1]) then right\n\t\t\telse left;\n\t\ts:=s+abs(t1-t2);\n\t\tt1:=t2;\n\tend;\n\tt:=0;\n\tt1:=a[(1+n) div 2+1];\n\tl:=1; r:=n;\n\tfor i:=1 to n-1 do\n\tbegin\n\t\tx:=abs(a[r]-t1);\n\t\ty:=abs(t1-a[l]);\n\t\tif x>y then right\n\t\telse if xabs(a[r]-a[l+1]) then right\n\t\t\telse left;\n\t\tt:=t+abs(t1-t2);\n\t\tt1:=t2;\n\tend;\n\tif s>t then writeln(s)\n\telse writeln(t);\nend.\n", "language": "Pascal", "metadata": {"date": 1540749415, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03223.html", "problem_id": "p03223", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03223/input.txt", "sample_output_relpath": "derived/input_output/data/p03223/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03223/Pascal/s138849202.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s138849202", "user_id": "u957998623"}, "prompt_components": {"gold_output": "21\n", "input_to_evaluate": "var\n\ta:array[-10..200010] of int64;\n\tn,i,l,r:longint;\n\ts,t,t1,t2,x,y:int64;\nprocedure qsort(l,r:longint);\nvar\n\tt,mid:int64;\n\ti,j:longint;\nbegin\n\ti:=l; j:=r; mid:=a[(l+r) div 2];\n\trepeat\n\t\twhile a[i]mid do dec(j);\n\t\tif i<=j then\n\t\tbegin\n\t\t\tt:=a[i]; a[i]:=a[j]; a[j]:=t;\n\t\t\tinc(i); dec(j);\n\t\tend;\n\tuntil i>j;\n\tif ly then right\n\t\telse if xabs(a[r]-a[l+1]) then right\n\t\t\telse left;\n\t\ts:=s+abs(t1-t2);\n\t\tt1:=t2;\n\tend;\n\tt:=0;\n\tt1:=a[(1+n) div 2+1];\n\tl:=1; r:=n;\n\tfor i:=1 to n-1 do\n\tbegin\n\t\tx:=abs(a[r]-t1);\n\t\ty:=abs(t1-a[l]);\n\t\tif x>y then right\n\t\telse if xabs(a[r]-a[l+1]) then right\n\t\t\telse left;\n\t\tt:=t+abs(t1-t2);\n\t\tt1:=t2;\n\tend;\n\tif s>t then writeln(s)\n\telse writeln(t);\nend.\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": "p03223", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1135, "cpu_time_ms": 25, "memory_kb": 896}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s890828047", "group_id": "codeNet:p03223", "input_text": "var\n\ta:array[0..100010] of longint;\n\tn,i,t1,t2,l,r:longint;\n\ts:int64;\nprocedure qsort(l,r:longint);\nvar\n\ti,j,t,mid:longint;\nbegin\n\ti:=l; j:=r; mid:=a[(l+r) div 2];\n\trepeat\n\t\twhile a[i]mid do dec(j);\n\t\tif i<=j then\n\t\tbegin\n\t\t\tt:=a[i]; a[i]:=a[j]; a[j]:=t;\n\t\t\tinc(i); dec(j);\n\t\tend;\n\tuntil i>j;\n\tif labs(t1-a[l]) then \n\t\tbegin \n\t\t\tt2:=a[r];\n\t\t\tdec(r);\n\t\tend\n\t\telse\n\t\tbegin \n\t\t\tt2:=a[l];\n\t\t\tinc(l);\n\t\tend;\n\t\ts:=s+abs(t1-t2);\n\t\tt1:=t2;\n\tend;\n\twriteln(s);\nend.", "language": "Pascal", "metadata": {"date": 1540695426, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03223.html", "problem_id": "p03223", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03223/input.txt", "sample_output_relpath": "derived/input_output/data/p03223/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03223/Pascal/s890828047.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s890828047", "user_id": "u957998623"}, "prompt_components": {"gold_output": "21\n", "input_to_evaluate": "var\n\ta:array[0..100010] of longint;\n\tn,i,t1,t2,l,r:longint;\n\ts:int64;\nprocedure qsort(l,r:longint);\nvar\n\ti,j,t,mid:longint;\nbegin\n\ti:=l; j:=r; mid:=a[(l+r) div 2];\n\trepeat\n\t\twhile a[i]mid do dec(j);\n\t\tif i<=j then\n\t\tbegin\n\t\t\tt:=a[i]; a[i]:=a[j]; a[j]:=t;\n\t\t\tinc(i); dec(j);\n\t\tend;\n\tuntil i>j;\n\tif labs(t1-a[l]) then \n\t\tbegin \n\t\t\tt2:=a[r];\n\t\t\tdec(r);\n\t\tend\n\t\telse\n\t\tbegin \n\t\t\tt2:=a[l];\n\t\t\tinc(l);\n\t\tend;\n\t\ts:=s+abs(t1-t2);\n\t\tt1:=t2;\n\tend;\n\twriteln(s);\nend.", "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": "p03223", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 680, "cpu_time_ms": 25, "memory_kb": 512}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s432879610", "group_id": "codeNet:p03223", "input_text": "var\n\ta:array[0..100010] of longint;\n\tn,i,t1,t2,l,r:longint;\n\ts,t:int64;\nprocedure qsort(l,r:longint);\nvar\n\ti,j,t,mid:longint;\nbegin\n\ti:=l; j:=r; mid:=a[(l+r) div 2];\n\trepeat\n\t\twhile a[i]mid do dec(j);\n\t\tif i<=j then\n\t\tbegin\n\t\t\tt:=a[i]; a[i]:=a[j]; a[j]:=t;\n\t\t\tinc(i); dec(j);\n\t\tend;\n\tuntil i>j;\n\tif lt1-a[l] then \n\t\tbegin \n\t\t\tt2:=a[r];\n\t\t\tdec(r);\n\t\t\tif r=(1+n) div 2 then dec(r);\n\t\tend\n\t\telse\n\t\tbegin \n\t\t\tt2:=a[l];\n\t\t\tinc(l);\n\t\t\tif l=(1+n) div 2 then inc(l);\n\t\tend;\n\t\ts:=s+abs(t1-t2);\n\t\tt1:=t2;\n\tend;\n\tt:=0;\n\tt1:=a[(1+n) div 2+1];\n\tl:=1; r:=n;\n\tfor i:=1 to n-1 do\n\tbegin\n\t\tif a[r]-t1>t1-a[l] then\n\t\tbegin\n\t\t\tt2:=a[r];\n\t\t\tdec(r);\n\t\t\tif r=(1+n) div 2+1 then dec(r);\n\t\tend\n\t\telse\n\t\tbegin\n\t\t\tt2:=a[l];\n\t\t\tinc(l);\n\t\t\tif l=(1+n) div 2+1 then inc(l);\n\t\tend;\n\t\tt:=t+abs(t1-t2);\n\t\tt1:=t2;\n\tend;\n\tif s>t then writeln(s)\n\telse writeln(t);\nend.", "language": "Pascal", "metadata": {"date": 1540690846, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03223.html", "problem_id": "p03223", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03223/input.txt", "sample_output_relpath": "derived/input_output/data/p03223/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03223/Pascal/s432879610.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s432879610", "user_id": "u957998623"}, "prompt_components": {"gold_output": "21\n", "input_to_evaluate": "var\n\ta:array[0..100010] of longint;\n\tn,i,t1,t2,l,r:longint;\n\ts,t:int64;\nprocedure qsort(l,r:longint);\nvar\n\ti,j,t,mid:longint;\nbegin\n\ti:=l; j:=r; mid:=a[(l+r) div 2];\n\trepeat\n\t\twhile a[i]mid do dec(j);\n\t\tif i<=j then\n\t\tbegin\n\t\t\tt:=a[i]; a[i]:=a[j]; a[j]:=t;\n\t\t\tinc(i); dec(j);\n\t\tend;\n\tuntil i>j;\n\tif lt1-a[l] then \n\t\tbegin \n\t\t\tt2:=a[r];\n\t\t\tdec(r);\n\t\t\tif r=(1+n) div 2 then dec(r);\n\t\tend\n\t\telse\n\t\tbegin \n\t\t\tt2:=a[l];\n\t\t\tinc(l);\n\t\t\tif l=(1+n) div 2 then inc(l);\n\t\tend;\n\t\ts:=s+abs(t1-t2);\n\t\tt1:=t2;\n\tend;\n\tt:=0;\n\tt1:=a[(1+n) div 2+1];\n\tl:=1; r:=n;\n\tfor i:=1 to n-1 do\n\tbegin\n\t\tif a[r]-t1>t1-a[l] then\n\t\tbegin\n\t\t\tt2:=a[r];\n\t\t\tdec(r);\n\t\t\tif r=(1+n) div 2+1 then dec(r);\n\t\tend\n\t\telse\n\t\tbegin\n\t\t\tt2:=a[l];\n\t\t\tinc(l);\n\t\t\tif l=(1+n) div 2+1 then inc(l);\n\t\tend;\n\t\tt:=t+abs(t1-t2);\n\t\tt1:=t2;\n\tend;\n\tif s>t then writeln(s)\n\telse writeln(t);\nend.", "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": "p03223", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1052, "cpu_time_ms": 26, "memory_kb": 512}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s115973644", "group_id": "codeNet:p03223", "input_text": "var\n\ta:array[0..100010] of longint;\n\tn,i,t1,t2,l,r:longint;\n\ts:int64;\nprocedure qsort(l,r:longint);\nvar\n\ti,j,t,mid:longint;\nbegin\n\ti:=l; j:=r; mid:=a[(l+r) div 2];\n\trepeat\n\t\twhile a[i]mid do dec(j);\n\t\tif i<=j then\n\t\tbegin\n\t\t\tt:=a[i]; a[i]:=a[j]; a[j]:=t;\n\t\t\tinc(i); dec(j);\n\t\tend;\n\tuntil i>j;\n\tif lt1-a[l] then \n\t\tbegin \n\t\t\tt2:=a[r];\n\t\t\tdec(r);\n\t\tend\n\t\telse\n\t\tbegin \n\t\t\tt2:=a[l];\n\t\t\tinc(l);\n\t\tend;\n\t\ts:=s+abs(t1-t2);\n\t\tt1:=t2;\n\tend;\n\twriteln(s);\nend.", "language": "Pascal", "metadata": {"date": 1540690435, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03223.html", "problem_id": "p03223", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03223/input.txt", "sample_output_relpath": "derived/input_output/data/p03223/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03223/Pascal/s115973644.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s115973644", "user_id": "u957998623"}, "prompt_components": {"gold_output": "21\n", "input_to_evaluate": "var\n\ta:array[0..100010] of longint;\n\tn,i,t1,t2,l,r:longint;\n\ts:int64;\nprocedure qsort(l,r:longint);\nvar\n\ti,j,t,mid:longint;\nbegin\n\ti:=l; j:=r; mid:=a[(l+r) div 2];\n\trepeat\n\t\twhile a[i]mid do dec(j);\n\t\tif i<=j then\n\t\tbegin\n\t\t\tt:=a[i]; a[i]:=a[j]; a[j]:=t;\n\t\t\tinc(i); dec(j);\n\t\tend;\n\tuntil i>j;\n\tif lt1-a[l] then \n\t\tbegin \n\t\t\tt2:=a[r];\n\t\t\tdec(r);\n\t\tend\n\t\telse\n\t\tbegin \n\t\t\tt2:=a[l];\n\t\t\tinc(l);\n\t\tend;\n\t\ts:=s+abs(t1-t2);\n\t\tt1:=t2;\n\tend;\n\twriteln(s);\nend.", "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": "p03223", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 24, "memory_kb": 512}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s153681101", "group_id": "codeNet:p03224", "input_text": "var\n\tk,n,p,q,i,j:Longint;\n\ts:array[1..500,1..500]of Longint;\n\tc:array[1..500]of Longint;\nbegin\n\tread(n);\n\tk:=1;\n\twhile k*(k-1)n*2 then begin\n\t\twriteln('No');\n\t\texit;\n\tend;\n\twriteln('Yes');\n\twriteln(k);\n\tp:=1;\n\tq:=2;\n\tfor i:=1 to n do begin\n\t\tinc(c[p]);\n\t\tinc(c[q]);\n\t\ts[p,c[p]]:=i;\n\t\ts[q,c[q]]:=i;\n\t\tinc(q);\n\t\tif q>k then begin\n\t\t\tinc(p);\n\t\t\tq:=p+1;\n\t\tend;\n\tend;\n\tfor i:=1 to k do begin\n\t\twrite(k-1);\n\t\tfor j:=1 to k-1 do write(' ',s[i,j]);\n\t\twriteln;\n\tend;\nend.", "language": "Pascal", "metadata": {"date": 1540694014, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03224.html", "problem_id": "p03224", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03224/input.txt", "sample_output_relpath": "derived/input_output/data/p03224/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03224/Pascal/s153681101.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s153681101", "user_id": "u657913472"}, "prompt_components": {"gold_output": "Yes\n3\n2 1 2\n2 3 1\n2 2 3\n", "input_to_evaluate": "var\n\tk,n,p,q,i,j:Longint;\n\ts:array[1..500,1..500]of Longint;\n\tc:array[1..500]of Longint;\nbegin\n\tread(n);\n\tk:=1;\n\twhile k*(k-1)n*2 then begin\n\t\twriteln('No');\n\t\texit;\n\tend;\n\twriteln('Yes');\n\twriteln(k);\n\tp:=1;\n\tq:=2;\n\tfor i:=1 to n do begin\n\t\tinc(c[p]);\n\t\tinc(c[q]);\n\t\ts[p,c[p]]:=i;\n\t\ts[q,c[q]]:=i;\n\t\tinc(q);\n\t\tif q>k then begin\n\t\t\tinc(p);\n\t\t\tq:=p+1;\n\t\tend;\n\tend;\n\tfor i:=1 to k do begin\n\t\twrite(k-1);\n\t\tfor j:=1 to k-1 do write(' ',s[i,j]);\n\t\twriteln;\n\tend;\nend.", "problem_context": "Score : 500 points\n\nProblem Statement\n\nYou are given an integer N. Determine if there exists a tuple of subsets of \\{1,2,...N\\}, (S_1,S_2,...,S_k), that satisfies the following conditions:\n\nEach of the integers 1,2,...,N is contained in exactly two of the sets S_1,S_2,...,S_k.\n\nAny two of the sets S_1,S_2,...,S_k have exactly one element in common.\n\nIf such a tuple exists, construct one such tuple.\n\nConstraints\n\n1 \\leq N \\leq 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\nIf a tuple of subsets of \\{1,2,...N\\} that satisfies the conditions does not exist, print No.\nIf such a tuple exists, print Yes first, then print such subsets in the following format:\n\nk\n|S_1| S_{1,1} S_{1,2} ... S_{1,|S_1|}\n:\n|S_k| S_{k,1} S_{k,2} ... S_{k,|S_k|}\n\nwhere S_i={S_{i,1},S_{i,2},...,S_{i,|S_i|}}.\n\nIf there are multiple such tuples, any of them will be accepted.\n\nSample Input 1\n\n3\n\nSample Output 1\n\nYes\n3\n2 1 2\n2 3 1\n2 2 3\n\nIt can be seen that (S_1,S_2,S_3)=(\\{1,2\\},\\{3,1\\},\\{2,3\\}) satisfies the conditions.\n\nSample Input 2\n\n4\n\nSample Output 2\n\nNo", "sample_input": "3\n"}, "reference_outputs": ["Yes\n3\n2 1 2\n2 3 1\n2 2 3\n"], "source_document_id": "p03224", "source_text": "Score : 500 points\n\nProblem Statement\n\nYou are given an integer N. Determine if there exists a tuple of subsets of \\{1,2,...N\\}, (S_1,S_2,...,S_k), that satisfies the following conditions:\n\nEach of the integers 1,2,...,N is contained in exactly two of the sets S_1,S_2,...,S_k.\n\nAny two of the sets S_1,S_2,...,S_k have exactly one element in common.\n\nIf such a tuple exists, construct one such tuple.\n\nConstraints\n\n1 \\leq N \\leq 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\nIf a tuple of subsets of \\{1,2,...N\\} that satisfies the conditions does not exist, print No.\nIf such a tuple exists, print Yes first, then print such subsets in the following format:\n\nk\n|S_1| S_{1,1} S_{1,2} ... S_{1,|S_1|}\n:\n|S_k| S_{k,1} S_{k,2} ... S_{k,|S_k|}\n\nwhere S_i={S_{i,1},S_{i,2},...,S_{i,|S_i|}}.\n\nIf there are multiple such tuples, any of them will be accepted.\n\nSample Input 1\n\n3\n\nSample Output 1\n\nYes\n3\n2 1 2\n2 3 1\n2 2 3\n\nIt can be seen that (S_1,S_2,S_3)=(\\{1,2\\},\\{3,1\\},\\{2,3\\}) satisfies the conditions.\n\nSample Input 2\n\n4\n\nSample Output 2\n\nNo", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 491, "cpu_time_ms": 29, "memory_kb": 2176}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s618960965", "group_id": "codeNet:p03229", "input_text": "var\n a,c:array[1..100000]of longint;\n b:array[1..100000]of boolean;\n i,n,s,j,x,y,sum1:longint;\nprocedure qsort(l,r:longint);\nvar\n i,j,mid,p:longint;\nbegin\n i:=l;j:=r;\n mid:=a[(l+r) div 2];\n repeat\n while a[i]mid do dec(j);\n if i<=j then\n begin\n p:=a[i];a[i]:=a[j];a[j]:=p;\n inc(i);\n dec(j);\n end;\n until i>j;\n if l=1) and (y<=n) do\n begin\n if abs(c[x]-a[i])>abs(c[y]-a[i])then \n\tbegin\n\t c[x]:=a[i];inc(i);dec(x);\n\t c[y]:=a[i];inc(i);inc(y);\n\tend\n\telse\n\tbegin\n c[y]:=a[i];inc(i);inc(y);\n\t c[x]:=a[i];inc(i);dec(x);\n\tend;\n if abs(c[x]-a[j])>abs(c[y]-a[j])then\n\tbegin\n\tc[x]:=a[j];dec(j);dec(x);\n\tc[y]:=a[j];dec(j);inc(y);\n\tend\n\telse begin\n c[y]:=a[j];dec(j);inc(y);\n\t c[x]:=a[j];dec(j);dec(x);\n\tend;\n\ts:=s+2;\n end;\n if odd(x) then c[n]:=a[n div 2+1] else c[x]:=a[n div 2];\n for i:=2 to n do sum1:=sum1+abs(c[i]-c[i-1]);\n write(sum1);\n readln(i);\nend.", "language": "Pascal", "metadata": {"date": 1540694534, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03229.html", "problem_id": "p03229", "resource_group": "low_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/Pascal/s618960965.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s618960965", "user_id": "u380619494"}, "prompt_components": {"gold_output": "21\n", "input_to_evaluate": "var\n a,c:array[1..100000]of longint;\n b:array[1..100000]of boolean;\n i,n,s,j,x,y,sum1:longint;\nprocedure qsort(l,r:longint);\nvar\n i,j,mid,p:longint;\nbegin\n i:=l;j:=r;\n mid:=a[(l+r) div 2];\n repeat\n while a[i]mid do dec(j);\n if i<=j then\n begin\n p:=a[i];a[i]:=a[j];a[j]:=p;\n inc(i);\n dec(j);\n end;\n until i>j;\n if l=1) and (y<=n) do\n begin\n if abs(c[x]-a[i])>abs(c[y]-a[i])then \n\tbegin\n\t c[x]:=a[i];inc(i);dec(x);\n\t c[y]:=a[i];inc(i);inc(y);\n\tend\n\telse\n\tbegin\n c[y]:=a[i];inc(i);inc(y);\n\t c[x]:=a[i];inc(i);dec(x);\n\tend;\n if abs(c[x]-a[j])>abs(c[y]-a[j])then\n\tbegin\n\tc[x]:=a[j];dec(j);dec(x);\n\tc[y]:=a[j];dec(j);inc(y);\n\tend\n\telse begin\n c[y]:=a[j];dec(j);inc(y);\n\t c[x]:=a[j];dec(j);dec(x);\n\tend;\n\ts:=s+2;\n end;\n if odd(x) then c[n]:=a[n div 2+1] else c[x]:=a[n div 2];\n for i:=2 to n do sum1:=sum1+abs(c[i]-c[i-1]);\n write(sum1);\n readln(i);\nend.", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1494, "cpu_time_ms": 25, "memory_kb": 1024}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s535728057", "group_id": "codeNet:p03229", "input_text": "var\n a,c:array[1..100000]of longint;\n b:array[1..100000]of boolean;\n i,n,s,j,x,y,sum1,sum2:longint;\nprocedure qsort(l,r:longint);\nvar\n i,j,mid,p:longint;\nbegin\n i:=l;j:=r;\n mid:=a[(l+r) div 2];\n repeat\n while a[i]mid do dec(j);\n if i<=j then\n begin\n p:=a[i];a[i]:=a[j];a[j]:=p;\n inc(i);\n dec(j);\n end;\n until i>j;\n if l=1) and (y<=n) do\n begin\n if (s mod 4=3)and(i<=n) then \n begin\n c[x]:=a[i];inc(i);inc(y);\n\tc[y]:=a[i];inc(i);dec(x);\n\ts:=s+2;\n end;\n if (s mod 4=1)and(j>=1) then \n begin\n c[x]:=a[j];dec(j);dec(x);\n\tc[y]:=a[j];dec(j);inc(y);\n\ts:=s+2;\n end;\n end;\n if odd(x) then c[n]:=a[n div 2+1] else c[x]:=a[n div 2];\n for i:=2 to n do sum1:=sum1+abs(c[i]-c[i-1]);\n i:=2;j:=n-2;\n if odd(n) then \n begin \n\t\t\t c[n div 2+1]:=a[1];\n\t\t\t\tc[n div 2]:=a[n];\n\t\t\t\tc[n div 2+2]:=a[n-1];\n\t\t\t\ts:=3;\n\t\t\t\tx:=n div 2-1;\n\t\t\t\ty:=n div 2+3;\n\t\t\t end\n\t\t\telse \n\t\t\t begin \n\t\t\t c[n div 2]:=a[1];\n\t\t\t\tc[n div 2-1]:=a[n];\n\t\t\t\tc[n div 2+1]:=a[n-1];\n\t\t\t\ts:=3;\n\t\t\t\tx:=n div 2-2;\n\t\t\t\ty:=n div 2+2;\n\t\t\t end;\n while (x>=1) and (y<=n) do\n begin\n if (s mod 4=3)and(i<=n) then \n begin\n c[y]:=a[i];inc(i);inc(y);\n\tc[x]:=a[i];inc(i);dec(x);\n\ts:=s+2;\n end;\n if (s mod 4=1)and(j>=1) then \n begin\n c[y]:=a[j];dec(j);dec(x);\n\tc[x]:=a[j];dec(j);inc(y);\n\ts:=s+2;\n end;\n end;\n if odd(x) then c[n]:=a[n div 2+1] else c[x]:=a[n div 2];\n for i:=2 to n do sum2:=sum2+abs(c[i]-c[i-1]);\n if sum1>sum2 then write(sum1) else write(sum2);\n readln(i);\nend.", "language": "Pascal", "metadata": {"date": 1540693920, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03229.html", "problem_id": "p03229", "resource_group": "low_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/Pascal/s535728057.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s535728057", "user_id": "u380619494"}, "prompt_components": {"gold_output": "21\n", "input_to_evaluate": "var\n a,c:array[1..100000]of longint;\n b:array[1..100000]of boolean;\n i,n,s,j,x,y,sum1,sum2:longint;\nprocedure qsort(l,r:longint);\nvar\n i,j,mid,p:longint;\nbegin\n i:=l;j:=r;\n mid:=a[(l+r) div 2];\n repeat\n while a[i]mid do dec(j);\n if i<=j then\n begin\n p:=a[i];a[i]:=a[j];a[j]:=p;\n inc(i);\n dec(j);\n end;\n until i>j;\n if l=1) and (y<=n) do\n begin\n if (s mod 4=3)and(i<=n) then \n begin\n c[x]:=a[i];inc(i);inc(y);\n\tc[y]:=a[i];inc(i);dec(x);\n\ts:=s+2;\n end;\n if (s mod 4=1)and(j>=1) then \n begin\n c[x]:=a[j];dec(j);dec(x);\n\tc[y]:=a[j];dec(j);inc(y);\n\ts:=s+2;\n end;\n end;\n if odd(x) then c[n]:=a[n div 2+1] else c[x]:=a[n div 2];\n for i:=2 to n do sum1:=sum1+abs(c[i]-c[i-1]);\n i:=2;j:=n-2;\n if odd(n) then \n begin \n\t\t\t c[n div 2+1]:=a[1];\n\t\t\t\tc[n div 2]:=a[n];\n\t\t\t\tc[n div 2+2]:=a[n-1];\n\t\t\t\ts:=3;\n\t\t\t\tx:=n div 2-1;\n\t\t\t\ty:=n div 2+3;\n\t\t\t end\n\t\t\telse \n\t\t\t begin \n\t\t\t c[n div 2]:=a[1];\n\t\t\t\tc[n div 2-1]:=a[n];\n\t\t\t\tc[n div 2+1]:=a[n-1];\n\t\t\t\ts:=3;\n\t\t\t\tx:=n div 2-2;\n\t\t\t\ty:=n div 2+2;\n\t\t\t end;\n while (x>=1) and (y<=n) do\n begin\n if (s mod 4=3)and(i<=n) then \n begin\n c[y]:=a[i];inc(i);inc(y);\n\tc[x]:=a[i];inc(i);dec(x);\n\ts:=s+2;\n end;\n if (s mod 4=1)and(j>=1) then \n begin\n c[y]:=a[j];dec(j);dec(x);\n\tc[x]:=a[j];dec(j);inc(y);\n\ts:=s+2;\n end;\n end;\n if odd(x) then c[n]:=a[n div 2+1] else c[x]:=a[n div 2];\n for i:=2 to n do sum2:=sum2+abs(c[i]-c[i-1]);\n if sum1>sum2 then write(sum1) else write(sum2);\n readln(i);\nend.", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 2086, "cpu_time_ms": 26, "memory_kb": 1024}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s656371189", "group_id": "codeNet:p03229", "input_text": "var\n a,c:array[1..100000]of longint;\n b:array[1..100000]of boolean;\n i,n,s,j,x,y,sum:longint;\nprocedure qsort(l,r:longint);\nvar\n i,j,mid,p:longint;\nbegin\n i:=l;j:=r;\n mid:=a[(l+r) div 2];\n repeat\n while a[i]mid do dec(j);\n if i<=j then\n begin\n p:=a[i];a[i]:=a[j];a[j]:=p;\n inc(i);\n dec(j);\n end;\n until i>j;\n if l=1) and (y<=n) do\n begin\n if (s mod 4=3)and(i<=n) then \n begin\n c[x]:=a[i];inc(i);inc(y);\n\tc[y]:=a[i];inc(i);dec(x);\n\ts:=s+2;\n end;\n if (s mod 4=1)and(j>=1) then \n begin\n c[x]:=a[j];dec(j);dec(x);\n\tc[y]:=a[j];dec(j);inc(y);\n\ts:=s+2;\n end;\n end;\n if odd(x) then c[n]:=a[n div 2+1] else c[x]:=a[n div 2];\n for i:=2 to n do sum:=sum+abs(c[i]-c[i-1]);\n write(sum);\n readln(i);\nend.", "language": "Pascal", "metadata": {"date": 1540693399, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03229.html", "problem_id": "p03229", "resource_group": "low_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/Pascal/s656371189.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s656371189", "user_id": "u380619494"}, "prompt_components": {"gold_output": "21\n", "input_to_evaluate": "var\n a,c:array[1..100000]of longint;\n b:array[1..100000]of boolean;\n i,n,s,j,x,y,sum:longint;\nprocedure qsort(l,r:longint);\nvar\n i,j,mid,p:longint;\nbegin\n i:=l;j:=r;\n mid:=a[(l+r) div 2];\n repeat\n while a[i]mid do dec(j);\n if i<=j then\n begin\n p:=a[i];a[i]:=a[j];a[j]:=p;\n inc(i);\n dec(j);\n end;\n until i>j;\n if l=1) and (y<=n) do\n begin\n if (s mod 4=3)and(i<=n) then \n begin\n c[x]:=a[i];inc(i);inc(y);\n\tc[y]:=a[i];inc(i);dec(x);\n\ts:=s+2;\n end;\n if (s mod 4=1)and(j>=1) then \n begin\n c[x]:=a[j];dec(j);dec(x);\n\tc[y]:=a[j];dec(j);inc(y);\n\ts:=s+2;\n end;\n end;\n if odd(x) then c[n]:=a[n div 2+1] else c[x]:=a[n div 2];\n for i:=2 to n do sum:=sum+abs(c[i]-c[i-1]);\n write(sum);\n readln(i);\nend.", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1367, "cpu_time_ms": 25, "memory_kb": 1024}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s628401718", "group_id": "codeNet:p03230", "input_text": "var\n c:array[1..10000, 1..10000]of longint;\n f:array[1..2,1..100001]of boolean;\n a:array[1..140]of longint=(1,3,6,10,15,21,28,36,45,55,66,78,91,105,120,136,153,171,190,210,231,253,276,300,325,351,378,406,435,465,496,528,561,595,630,666,703,741,780,820,861,903,946,990,1035,1081,1128,1176,1225,1275,1326,1378,1431,1485,1540,1596,1653,1711,1770,1830,1891,1953,2016,2080,2145,2211,2278,2346,2415,2485,2556,2628,2701,2775,2850,2926,3003,3081,3160,3240,3321,3403,3486,3570,3655,3741,3828,3916,4005,4095,4186,4278,4371,4465,4560,4656,4753,4851,4950,5050,5151,5253,5356,5460,5565,5671,5778,5886,5995,6105,6216,6328,6441,6555,6670,6786,6903,7021,7140,7260,7381,7503,7626,7750,7875,8001,8128,8256,8385,8515,8646,8778,8911,9045,9180,9316,9453,9591,9730,9870);\n i,k,m,p,q,j,n:longint;\n b:boolean;\nbegin\n readln(n);\n i:=1;\n while a[i]<=n do\n begin\n if a[i]=n then begin b:=true; break; end;\n inc(i);\n end;\n if b=false then begin writeln('No'); halt; end;\n if i=1 then begin writeln('Yes'); writeln('1 1'); writeln('1 1'); halt; end;\n b:=false;\n q:=0;\n fillchar(f,sizeof(f),false);\n writeln('Yes');\n writeln(i+1);\n for j:=1 to i+1 do\n begin\n write(i,' ');\n\t for k:=1 to i do\n\t begin\n\t if (ki then\n\t\tbegin\n\t for p:=1 to n do if f[2,p]=false then begin write(p,' '); f[2,p]:=true; end;\n\t\t continue;\n\t\tend;\n\t\tinc(q);\n\t\twrite(q,' ');\n\t\tf[1,q]:=true;\n\t\tc[j,k]:=q;\n\tend;\n\tend;\n\twriteln;\n end;\nend.", "language": "Pascal", "metadata": {"date": 1540696538, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03230.html", "problem_id": "p03230", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03230/input.txt", "sample_output_relpath": "derived/input_output/data/p03230/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03230/Pascal/s628401718.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s628401718", "user_id": "u223928734"}, "prompt_components": {"gold_output": "Yes\n3\n2 1 2\n2 3 1\n2 2 3\n", "input_to_evaluate": "var\n c:array[1..10000, 1..10000]of longint;\n f:array[1..2,1..100001]of boolean;\n a:array[1..140]of longint=(1,3,6,10,15,21,28,36,45,55,66,78,91,105,120,136,153,171,190,210,231,253,276,300,325,351,378,406,435,465,496,528,561,595,630,666,703,741,780,820,861,903,946,990,1035,1081,1128,1176,1225,1275,1326,1378,1431,1485,1540,1596,1653,1711,1770,1830,1891,1953,2016,2080,2145,2211,2278,2346,2415,2485,2556,2628,2701,2775,2850,2926,3003,3081,3160,3240,3321,3403,3486,3570,3655,3741,3828,3916,4005,4095,4186,4278,4371,4465,4560,4656,4753,4851,4950,5050,5151,5253,5356,5460,5565,5671,5778,5886,5995,6105,6216,6328,6441,6555,6670,6786,6903,7021,7140,7260,7381,7503,7626,7750,7875,8001,8128,8256,8385,8515,8646,8778,8911,9045,9180,9316,9453,9591,9730,9870);\n i,k,m,p,q,j,n:longint;\n b:boolean;\nbegin\n readln(n);\n i:=1;\n while a[i]<=n do\n begin\n if a[i]=n then begin b:=true; break; end;\n inc(i);\n end;\n if b=false then begin writeln('No'); halt; end;\n if i=1 then begin writeln('Yes'); writeln('1 1'); writeln('1 1'); halt; end;\n b:=false;\n q:=0;\n fillchar(f,sizeof(f),false);\n writeln('Yes');\n writeln(i+1);\n for j:=1 to i+1 do\n begin\n write(i,' ');\n\t for k:=1 to i do\n\t begin\n\t if (ki then\n\t\tbegin\n\t for p:=1 to n do if f[2,p]=false then begin write(p,' '); f[2,p]:=true; end;\n\t\t continue;\n\t\tend;\n\t\tinc(q);\n\t\twrite(q,' ');\n\t\tf[1,q]:=true;\n\t\tc[j,k]:=q;\n\tend;\n\tend;\n\twriteln;\n end;\nend.", "problem_context": "Score : 500 points\n\nProblem Statement\n\nYou are given an integer N. Determine if there exists a tuple of subsets of \\{1,2,...N\\}, (S_1,S_2,...,S_k), that satisfies the following conditions:\n\nEach of the integers 1,2,...,N is contained in exactly two of the sets S_1,S_2,...,S_k.\n\nAny two of the sets S_1,S_2,...,S_k have exactly one element in common.\n\nIf such a tuple exists, construct one such tuple.\n\nConstraints\n\n1 \\leq N \\leq 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\nIf a tuple of subsets of \\{1,2,...N\\} that satisfies the conditions does not exist, print No.\nIf such a tuple exists, print Yes first, then print such subsets in the following format:\n\nk\n|S_1| S_{1,1} S_{1,2} ... S_{1,|S_1|}\n:\n|S_k| S_{k,1} S_{k,2} ... S_{k,|S_k|}\n\nwhere S_i={S_{i,1},S_{i,2},...,S_{i,|S_i|}}.\n\nIf there are multiple such tuples, any of them will be accepted.\n\nSample Input 1\n\n3\n\nSample Output 1\n\nYes\n3\n2 1 2\n2 3 1\n2 2 3\n\nIt can be seen that (S_1,S_2,S_3)=(\\{1,2\\},\\{3,1\\},\\{2,3\\}) satisfies the conditions.\n\nSample Input 2\n\n4\n\nSample Output 2\n\nNo", "sample_input": "3\n"}, "reference_outputs": ["Yes\n3\n2 1 2\n2 3 1\n2 2 3\n"], "source_document_id": "p03230", "source_text": "Score : 500 points\n\nProblem Statement\n\nYou are given an integer N. Determine if there exists a tuple of subsets of \\{1,2,...N\\}, (S_1,S_2,...,S_k), that satisfies the following conditions:\n\nEach of the integers 1,2,...,N is contained in exactly two of the sets S_1,S_2,...,S_k.\n\nAny two of the sets S_1,S_2,...,S_k have exactly one element in common.\n\nIf such a tuple exists, construct one such tuple.\n\nConstraints\n\n1 \\leq N \\leq 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\nIf a tuple of subsets of \\{1,2,...N\\} that satisfies the conditions does not exist, print No.\nIf such a tuple exists, print Yes first, then print such subsets in the following format:\n\nk\n|S_1| S_{1,1} S_{1,2} ... S_{1,|S_1|}\n:\n|S_k| S_{k,1} S_{k,2} ... S_{k,|S_k|}\n\nwhere S_i={S_{i,1},S_{i,2},...,S_{i,|S_i|}}.\n\nIf there are multiple such tuples, any of them will be accepted.\n\nSample Input 1\n\n3\n\nSample Output 1\n\nYes\n3\n2 1 2\n2 3 1\n2 2 3\n\nIt can be seen that (S_1,S_2,S_3)=(\\{1,2\\},\\{3,1\\},\\{2,3\\}) satisfies the conditions.\n\nSample Input 2\n\n4\n\nSample Output 2\n\nNo", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1514, "cpu_time_ms": 3, "memory_kb": 4608}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s590667874", "group_id": "codeNet:p03231", "input_text": "var\n x,y:array[0..100000]of char;\n ans:int64;\n i,n,m:longint;\nFunction gcd(x,y:longint):int64;\nbegin\n if y=0 then exit(x) else\n exit(gcd(y,x mod y));\nend;\nbegin\n readln(n,m);\n for i:=1 to n do\n read(x[i]);\n readln;\n for i:=1 to m do\n read(y[i]);\n for i:=0 to n-1 do\n if i*m mod n=0 then\n if x[i+1]<>y[i*m div n+1] then\n begin\n write(-1);\n exit;\n end;\n ans:=n*m div gcd(n,m);\n write(ans);\nend.", "language": "Pascal", "metadata": {"date": 1539711459, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03231.html", "problem_id": "p03231", "resource_group": "low_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/Pascal/s590667874.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s590667874", "user_id": "u111363574"}, "prompt_components": {"gold_output": "6\n", "input_to_evaluate": "var\n x,y:array[0..100000]of char;\n ans:int64;\n i,n,m:longint;\nFunction gcd(x,y:longint):int64;\nbegin\n if y=0 then exit(x) else\n exit(gcd(y,x mod y));\nend;\nbegin\n readln(n,m);\n for i:=1 to n do\n read(x[i]);\n readln;\n for i:=1 to m do\n read(y[i]);\n for i:=0 to n-1 do\n if i*m mod n=0 then\n if x[i+1]<>y[i*m div n+1] then\n begin\n write(-1);\n exit;\n end;\n ans:=n*m div gcd(n,m);\n write(ans);\nend.", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 450, "cpu_time_ms": 5, "memory_kb": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s273140617", "group_id": "codeNet:p03231", "input_text": "var\n\ti:Longint;\n\tn,m,u:int64;\n\ts,t:String;\nfunction gcd(a,b:int64):int64;\nbegin\n\tif b=0 then gcd:=a else gcd:=gcd(b,a mod b);\nend;\nbegin\n\treadln(n,m);\n\tsetlength(s,n);\n\tsetlength(t,m);\n\treadln(s);\n\treadln(t);\n\tu:=gcd(n,m);\n\tfor i:=0 to u-1 do if s[n div u*i+1]<>t[m div u*i+1]then begin\n\t\twriteln(-1);\n\t\texit;\n\tend;\n\twriteln(n*m div u);\nend.\n", "language": "Pascal", "metadata": {"date": 1539491366, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03231.html", "problem_id": "p03231", "resource_group": "low_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/Pascal/s273140617.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s273140617", "user_id": "u657913472"}, "prompt_components": {"gold_output": "6\n", "input_to_evaluate": "var\n\ti:Longint;\n\tn,m,u:int64;\n\ts,t:String;\nfunction gcd(a,b:int64):int64;\nbegin\n\tif b=0 then gcd:=a else gcd:=gcd(b,a mod b);\nend;\nbegin\n\treadln(n,m);\n\tsetlength(s,n);\n\tsetlength(t,m);\n\treadln(s);\n\treadln(t);\n\tu:=gcd(n,m);\n\tfor i:=0 to u-1 do if s[n div u*i+1]<>t[m div u*i+1]then begin\n\t\twriteln(-1);\n\t\texit;\n\tend;\n\twriteln(n*m div u);\nend.\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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 342, "cpu_time_ms": 1, "memory_kb": 384}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s690697141", "group_id": "codeNet:p03231", "input_text": "var\n a,b:string;\n n,m,i,j:longint;\n k,p,q:qword;\nbegin\n readln(n,m);\n readln(a);\n readln(b);\n p:=n;\n q:=m;\n if p0 do if p>q then begin p:=p mod q; i:=p; p:=q; q:=i; end;\n k:=n*m div q;\n p:=k div n;\n q:=k div m;\n i:=1;\n j:=1;\n while (j<=m)and(i<=n) do\n begin\n\t if b[j]<>a[i] then begin writeln('-1'); halt; end;\n i:=i+q;\n\t j:=j+p;\n end;\n writeln(k);\nend.", "language": "Pascal", "metadata": {"date": 1539487243, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03231.html", "problem_id": "p03231", "resource_group": "low_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/Pascal/s690697141.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s690697141", "user_id": "u223928734"}, "prompt_components": {"gold_output": "6\n", "input_to_evaluate": "var\n a,b:string;\n n,m,i,j:longint;\n k,p,q:qword;\nbegin\n readln(n,m);\n readln(a);\n readln(b);\n p:=n;\n q:=m;\n if p0 do if p>q then begin p:=p mod q; i:=p; p:=q; q:=i; end;\n k:=n*m div q;\n p:=k div n;\n q:=k div m;\n i:=1;\n j:=1;\n while (j<=m)and(i<=n) do\n begin\n\t if b[j]<>a[i] then begin writeln('-1'); halt; end;\n i:=i+q;\n\t j:=j+p;\n end;\n writeln(k);\nend.", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 431, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s975174210", "group_id": "codeNet:p03231", "input_text": "var\n a,b,c:string;\n t:char;\n n,m,i,j,p,q,k:longint;\nbegin\n readln(n,m);\n readln(a);\n readln(b);\n p:=n;\n q:=m;\n if p0 do begin p:=p mod q; i:=p; p:=q; q:=i; end;\n k:=n*m div q;\n p:=k div n;\n q:=k div m;\n i:=1;\n j:=1;\n while (j<=m)and(i<=n) do\n begin\n\t if b[j]<>a[i] then begin writeln('-1'); halt; end;\n i:=i+q;\n\t j:=j+p;\n end;\n writeln(k);\nend.", "language": "Pascal", "metadata": {"date": 1539486805, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03231.html", "problem_id": "p03231", "resource_group": "low_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/Pascal/s975174210.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s975174210", "user_id": "u223928734"}, "prompt_components": {"gold_output": "6\n", "input_to_evaluate": "var\n a,b,c:string;\n t:char;\n n,m,i,j,p,q,k:longint;\nbegin\n readln(n,m);\n readln(a);\n readln(b);\n p:=n;\n q:=m;\n if p0 do begin p:=p mod q; i:=p; p:=q; q:=i; end;\n k:=n*m div q;\n p:=k div n;\n q:=k div m;\n i:=1;\n j:=1;\n while (j<=m)and(i<=n) do\n begin\n\t if b[j]<>a[i] then begin writeln('-1'); halt; end;\n i:=i+q;\n\t j:=j+p;\n end;\n writeln(k);\nend.", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 1, "memory_kb": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s035700985", "group_id": "codeNet:p03231", "input_text": "var\n a,b,c:string;\n t:char;\n n,m,i,j,p,q,k:longint;\nbegin\n readln(n,m);\n readln(a);\n readln(b);\n p:=n;\n q:=m;\n if p0 do if p>q then begin p:=p mod q; i:=p; p:=q; q:=i; end;\n k:=n*m div q;\n i:=1;\n t:='2';\n while true do\n begin\n t:='2';\n i:=i+q;\n if i>k then break;\n if ((i-1) mod (k mod n)=0) then \n begin\n c[i div q]:=a[(i-1) div (k mod n)+1];\n if ((i-1) mod (k mod m)=0) then t:=b[(i-1) div (k mod m)+1];\n if (t<>'2')and(t=c[i]) then continue\n else if (t<>'2') then begin writeln('-1'); halt; end;\n end;\n end;\n writeln(k);\nend.", "language": "Pascal", "metadata": {"date": 1539485371, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03231.html", "problem_id": "p03231", "resource_group": "low_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/Pascal/s035700985.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s035700985", "user_id": "u380619494"}, "prompt_components": {"gold_output": "6\n", "input_to_evaluate": "var\n a,b,c:string;\n t:char;\n n,m,i,j,p,q,k:longint;\nbegin\n readln(n,m);\n readln(a);\n readln(b);\n p:=n;\n q:=m;\n if p0 do if p>q then begin p:=p mod q; i:=p; p:=q; q:=i; end;\n k:=n*m div q;\n i:=1;\n t:='2';\n while true do\n begin\n t:='2';\n i:=i+q;\n if i>k then break;\n if ((i-1) mod (k mod n)=0) then \n begin\n c[i div q]:=a[(i-1) div (k mod n)+1];\n if ((i-1) mod (k mod m)=0) then t:=b[(i-1) div (k mod m)+1];\n if (t<>'2')and(t=c[i]) then continue\n else if (t<>'2') then begin writeln('-1'); halt; end;\n end;\n end;\n writeln(k);\nend.", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 1, "memory_kb": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s188141637", "group_id": "codeNet:p03241", "input_text": "var\n n,m,d,ans:longint;\nfunction check(x:longint):boolean;\nbegin\n if (m div x)>=n then\n begin\n check:=true;\n end\n else\n begin\n check:=false;\n end;\nend;\nbegin\n ans:=1;\n readln(n,m);\n for d:=1 to trunc(sqrt(m)) do\n begin\n if (m mod d)<>0 then\n begin\n continue;\n end;\n if check(d) then\n begin\n if d>ans then\n begin\n ans:=d;\n end;\n end;\n if check(m div d) then\n begin\n if (m div d)>ans then\n begin\n ans:=m div d;\n end;\n end;\n end;\n writeln(ans);\nend.", "language": "Pascal", "metadata": {"date": 1538965532, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03241.html", "problem_id": "p03241", "resource_group": "low_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/Pascal/s188141637.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s188141637", "user_id": "u478713725"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "var\n n,m,d,ans:longint;\nfunction check(x:longint):boolean;\nbegin\n if (m div x)>=n then\n begin\n check:=true;\n end\n else\n begin\n check:=false;\n end;\nend;\nbegin\n ans:=1;\n readln(n,m);\n for d:=1 to trunc(sqrt(m)) do\n begin\n if (m mod d)<>0 then\n begin\n continue;\n end;\n if check(d) then\n begin\n if d>ans then\n begin\n ans:=d;\n end;\n end;\n if check(m div d) then\n begin\n if (m div d)>ans then\n begin\n ans:=m div d;\n end;\n end;\n end;\n writeln(ans);\nend.", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 541, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s594187236", "group_id": "codeNet:p03241", "input_text": "var\n n,m,i,max:longint;\nbegin\n max:=1;\n read(n,m);\n for i:=m div n downto 1 do\n if m mod i=0 then break;\nwrite(i);\nend.", "language": "Pascal", "metadata": {"date": 1538879981, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03241.html", "problem_id": "p03241", "resource_group": "low_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/Pascal/s594187236.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s594187236", "user_id": "u111363574"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "var\n n,m,i,max:longint;\nbegin\n max:=1;\n read(n,m);\n for i:=m div n downto 1 do\n if m mod i=0 then break;\nwrite(i);\nend.", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 124, "cpu_time_ms": 209, "memory_kb": 128}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s596146192", "group_id": "codeNet:p03241", "input_text": "var\nn,m,i,t:longint;\nbegin\nread(n,m);\nt:=trunc(sqrt(m));\nfor i:=t downto 1 do\nif m mod i=0 then\nif m div i>=n then\nbegin\nwriteln(i);\nbreak;\nend;\nend.", "language": "Pascal", "metadata": {"date": 1538876977, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03241.html", "problem_id": "p03241", "resource_group": "low_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/Pascal/s596146192.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s596146192", "user_id": "u957998623"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "var\nn,m,i,t:longint;\nbegin\nread(n,m);\nt:=trunc(sqrt(m));\nfor i:=t downto 1 do\nif m mod i=0 then\nif m div i>=n then\nbegin\nwriteln(i);\nbreak;\nend;\nend.", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s936043578", "group_id": "codeNet:p03242", "input_text": "program Project1;\n\n{$APPTYPE CONSOLE}\n\nuses\n SysUtils;\nvar\n a,h,w,i,j,count,x,y,sw,m,n,b,c,soeji,sum,max,k,min:Integer;\n l:array of Integer;\n s,s123,s1,s2,s3:string;\n al:string = 'abcdefghijklmnopqrstuvwxyz';\n tf,tfl,tfr:Boolean;\nbegin\n try\n { TODO -oUser -cConsole メイン : ここにコードを記述してください }\n Readln(s);\n count:=0;\n max :=0;\n min :=100;\n\n Write (10-strtoint(s[1]));\n Write (10-strtoint(s[2]));\n Writeln(10-strtoint(s[3]));\n\n Readln;\n except\n on E: Exception do\n Writeln(E.ClassName, ': ', E.Message);\n end;\nend.\n", "language": "Pascal", "metadata": {"date": 1538269623, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03242.html", "problem_id": "p03242", "resource_group": "low_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/Pascal/s936043578.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s936043578", "user_id": "u755925739"}, "prompt_components": {"gold_output": "991\n", "input_to_evaluate": "program Project1;\n\n{$APPTYPE CONSOLE}\n\nuses\n SysUtils;\nvar\n a,h,w,i,j,count,x,y,sw,m,n,b,c,soeji,sum,max,k,min:Integer;\n l:array of Integer;\n s,s123,s1,s2,s3:string;\n al:string = 'abcdefghijklmnopqrstuvwxyz';\n tf,tfl,tfr:Boolean;\nbegin\n try\n { TODO -oUser -cConsole メイン : ここにコードを記述してください }\n Readln(s);\n count:=0;\n max :=0;\n min :=100;\n\n Write (10-strtoint(s[1]));\n Write (10-strtoint(s[2]));\n Writeln(10-strtoint(s[3]));\n\n Readln;\n except\n on E: Exception do\n Writeln(E.ClassName, ': ', E.Message);\n end;\nend.\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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s389811824", "group_id": "codeNet:p03244", "input_text": "var\n a:array[1..100000]of longint;\n b:array[1..2,1..100000]of longint;\n n,m,k,i,p,q,o,f,t:longint;\nbegin \n readln(n);\n for i:=1 to n do \n begin\n read(a[i]);\n\t inc(b[((i-1)mod 2)+1,a[i]]);\n\t if a[i]>k then k:=a[i];\n end;\n for i:=1 to k do\n begin\n if b[1,i]>p then begin p:=b[1,i]; o:=i; end;\n if b[2,i]>q then begin q:=b[2,i]; m:=i; end;\n end;\n if o=m then \n begin \n if p>q then\n\tbegin\n for i:=1 to k do\n\tbegin\n if (b[2,i]<>q)and(b[2,i]>f) then f:=b[2,i];\n end;\n\tf:=f+p;\n\tend else\n if pp)and(b[1,i]>f) then f:=b[1,i];\n end;\n\tf:=f+q;\n\tend else\n\tbegin\n for i:=1 to k do\n\tbegin\n if (b[1,i]<>p)and(b[1,i]>f) then f:=b[1,i];\n if (b[2,i]<>p)and(b[2,i]>t) then t:=b[2,i];\n end;\n\tif t>f then f:=t+p\n\telse f:=f+p;\n\tend;\n end else f:=p+q;\n writeln(n-f);\nend.\n", "language": "Pascal", "metadata": {"date": 1538271442, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03244.html", "problem_id": "p03244", "resource_group": "low_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/Pascal/s389811824.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s389811824", "user_id": "u380619494"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "var\n a:array[1..100000]of longint;\n b:array[1..2,1..100000]of longint;\n n,m,k,i,p,q,o,f,t:longint;\nbegin \n readln(n);\n for i:=1 to n do \n begin\n read(a[i]);\n\t inc(b[((i-1)mod 2)+1,a[i]]);\n\t if a[i]>k then k:=a[i];\n end;\n for i:=1 to k do\n begin\n if b[1,i]>p then begin p:=b[1,i]; o:=i; end;\n if b[2,i]>q then begin q:=b[2,i]; m:=i; end;\n end;\n if o=m then \n begin \n if p>q then\n\tbegin\n for i:=1 to k do\n\tbegin\n if (b[2,i]<>q)and(b[2,i]>f) then f:=b[2,i];\n end;\n\tf:=f+p;\n\tend else\n if pp)and(b[1,i]>f) then f:=b[1,i];\n end;\n\tf:=f+q;\n\tend else\n\tbegin\n for i:=1 to k do\n\tbegin\n if (b[1,i]<>p)and(b[1,i]>f) then f:=b[1,i];\n if (b[2,i]<>p)and(b[2,i]>t) then t:=b[2,i];\n end;\n\tif t>f then f:=t+p\n\telse f:=f+p;\n\tend;\n end else f:=p+q;\n writeln(n-f);\nend.\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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 876, "cpu_time_ms": 14, "memory_kb": 1280}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s116918613", "group_id": "codeNet:p03244", "input_text": "var\n\tf1,f2:array[0..100010] of longint;\n\tmax,t:array[1..2,1..2] of longint;\n\tn,i,x,s:longint;\nbegin\n\tread(n);\n\tfillchar(f1,sizeof(f1),0);\n\tfillchar(f2,sizeof(f2),0);\n\tfillchar(max,sizeof(max),0);\n\tfor i:=1 to n do\n\tbegin\n\t\tread(x);\n\t\tif i mod 2=1 then\n\t\tbegin \n\t\t\tinc(f1[x]);\n\t\t\tif f1[x]>max[1,1] then\n\t\t\tbegin\n\t\t\t\tif x<>t[1,1] then \n\t\t\t\tbegin\n\t\t\t\t\tmax[1,2]:=max[1,1];\n\t\t\t\t\tt[1,2]:=t[1,1];\n\t\t\t\tend;\n\t\t\t\tmax[1,1]:=f1[x];\n\t\t\t\tt[1,1]:=x;\n\t\t\tend\n\t\t\telse if f1[x]>max[1,2] then \n\t\t\t\tbegin \n\t\t\t\t\tmax[1,2]:=f1[x];\n\t\t\t\t\tt[1,2]:=x;\n\t\t\t\tend;\n\t\tend\n\t\telse\n\t\tbegin \n\t\t\tinc(f2[x]);\n\t\t\tif f2[x]>max[2,1] then\n\t\t\tbegin\n\t\t\t\tif x<>t[2,1] then\n\t\t\t\tbegin\n\t\t\t\t\tmax[2,2]:=max[2,1];\n\t\t\t\t\tt[2,2]:=t[2,1];\n\t\t\t\tend;\n\t\t\t\tmax[2,1]:=f2[x];\n\t\t\t\tt[2,1]:=x;\n\t\t\tend\n\t\t\telse if f2[x]>max[2,2] then \t\n\t\t\t\tbegin \n\t\t\t\t\tmax[2,2]:=f2[x];\n\t\t\t\t\tt[1,2]:=x;\n\t\t\t\tend;\n\t\tend;\n\tend;\n\ts:=0;\n\tif (t[1,1]<>t[2,1]) then s:=max[1,1]+max[2,1]\n\telse if max[1,2]+max[2,1]>max[1,1]+max[2,2] then s:=max[1,2]+max[2,1]\n\telse s:=max[1,1]+max[2,2];\n\tif (t[1,1]=t[2,1]) and (max[1,2]=0) and (max[2,2]=0) then writeln(n div 2)\n\telse writeln(n-s);\nend.", "language": "Pascal", "metadata": {"date": 1538270962, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03244.html", "problem_id": "p03244", "resource_group": "low_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/Pascal/s116918613.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s116918613", "user_id": "u957998623"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "var\n\tf1,f2:array[0..100010] of longint;\n\tmax,t:array[1..2,1..2] of longint;\n\tn,i,x,s:longint;\nbegin\n\tread(n);\n\tfillchar(f1,sizeof(f1),0);\n\tfillchar(f2,sizeof(f2),0);\n\tfillchar(max,sizeof(max),0);\n\tfor i:=1 to n do\n\tbegin\n\t\tread(x);\n\t\tif i mod 2=1 then\n\t\tbegin \n\t\t\tinc(f1[x]);\n\t\t\tif f1[x]>max[1,1] then\n\t\t\tbegin\n\t\t\t\tif x<>t[1,1] then \n\t\t\t\tbegin\n\t\t\t\t\tmax[1,2]:=max[1,1];\n\t\t\t\t\tt[1,2]:=t[1,1];\n\t\t\t\tend;\n\t\t\t\tmax[1,1]:=f1[x];\n\t\t\t\tt[1,1]:=x;\n\t\t\tend\n\t\t\telse if f1[x]>max[1,2] then \n\t\t\t\tbegin \n\t\t\t\t\tmax[1,2]:=f1[x];\n\t\t\t\t\tt[1,2]:=x;\n\t\t\t\tend;\n\t\tend\n\t\telse\n\t\tbegin \n\t\t\tinc(f2[x]);\n\t\t\tif f2[x]>max[2,1] then\n\t\t\tbegin\n\t\t\t\tif x<>t[2,1] then\n\t\t\t\tbegin\n\t\t\t\t\tmax[2,2]:=max[2,1];\n\t\t\t\t\tt[2,2]:=t[2,1];\n\t\t\t\tend;\n\t\t\t\tmax[2,1]:=f2[x];\n\t\t\t\tt[2,1]:=x;\n\t\t\tend\n\t\t\telse if f2[x]>max[2,2] then \t\n\t\t\t\tbegin \n\t\t\t\t\tmax[2,2]:=f2[x];\n\t\t\t\t\tt[1,2]:=x;\n\t\t\t\tend;\n\t\tend;\n\tend;\n\ts:=0;\n\tif (t[1,1]<>t[2,1]) then s:=max[1,1]+max[2,1]\n\telse if max[1,2]+max[2,1]>max[1,1]+max[2,2] then s:=max[1,2]+max[2,1]\n\telse s:=max[1,1]+max[2,2];\n\tif (t[1,1]=t[2,1]) and (max[1,2]=0) and (max[2,2]=0) then writeln(n div 2)\n\telse writeln(n-s);\nend.", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1091, "cpu_time_ms": 13, "memory_kb": 896}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s613296170", "group_id": "codeNet:p03244", "input_text": "var\na:array[1..100000]of longint;\nb:array[0..1,0..100000]of longint;\nmax:array[0..1]of longint;\nn,i,s:longint;\nbegin\nread(n);\nfor i:=1 to n do\nbegin\nread(a[i]);\ninc(b[i mod 2,a[i]]);\n if b[i mod 2,a[i]]>max[i mod 2] then\n begin\n max[i mod 2]:=b[i mod 2,a[i]];\n b[i mod 2,0]:=a[i];\n end;\nend;\ns:=0;\nfor i:=1 to n do\n if a[i]<>b[i mod 2,0] then\n inc(s);\nwriteln(s); \nend.", "language": "Pascal", "metadata": {"date": 1538270209, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03244.html", "problem_id": "p03244", "resource_group": "low_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/Pascal/s613296170.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s613296170", "user_id": "u214724132"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "var\na:array[1..100000]of longint;\nb:array[0..1,0..100000]of longint;\nmax:array[0..1]of longint;\nn,i,s:longint;\nbegin\nread(n);\nfor i:=1 to n do\nbegin\nread(a[i]);\ninc(b[i mod 2,a[i]]);\n if b[i mod 2,a[i]]>max[i mod 2] then\n begin\n max[i mod 2]:=b[i mod 2,a[i]];\n b[i mod 2,0]:=a[i];\n end;\nend;\ns:=0;\nfor i:=1 to n do\n if a[i]<>b[i mod 2,0] then\n inc(s);\nwriteln(s); \nend.", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 16, "memory_kb": 1280}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s365211094", "group_id": "codeNet:p03245", "input_text": "var\n\ti,j,k,n,max:longint;\n\tt,x,y:array[-110..10010] of longint;\n\ts:ansistring;\nbegin\n\treadln(n);\n\tmax:=0;\n\tfor i:=1 to n do \n\tbegin \n\t\tread(x[i],y[i]);\n\t\tt[i]:=abs(x[i])+abs(y[i]);\n\t\tif t[i] mod 2<>t[1] mod 2 then\n\t\tbegin\n\t\t\twriteln(-1);\n\t\t\thalt;\n\t\tend;\n\t\tif t[i]>max then max:=t[i];\n\tend;\n\twriteln(max);\n\tfor i:=1 to max do write(2-t[i] mod 2,' ');\n\twriteln;\n\tfor i:=1 to n do\n\tbegin\n\t\ts:='';\n\t\tif x[i]<0 then \n\t\t\tfor j:=1 to -x[i] do s:=s+'L'\n\t\telse if x[i]>0 then for j:=1 to x[i] do s:=s+'R';\n\t\tif y[i]<0 then \n\t\t\tfor j:=1 to -y[i] do s:=s+'D'\n\t\telse if y[i]>0 then for j:=1 to y[i] do s:=s+'U';\n\t\tk:=length(s);\n\t\tfor j:=k+1 to max do\n\t\t\tif j mod 2=1 then s:=s+'L' else s:=s+'R';\n\t\twriteln(s);\n\tend;\nend.", "language": "Pascal", "metadata": {"date": 1538274847, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03245.html", "problem_id": "p03245", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03245/input.txt", "sample_output_relpath": "derived/input_output/data/p03245/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03245/Pascal/s365211094.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s365211094", "user_id": "u957998623"}, "prompt_components": {"gold_output": "2\n1 2\nRL\nUU\nDR\n", "input_to_evaluate": "var\n\ti,j,k,n,max:longint;\n\tt,x,y:array[-110..10010] of longint;\n\ts:ansistring;\nbegin\n\treadln(n);\n\tmax:=0;\n\tfor i:=1 to n do \n\tbegin \n\t\tread(x[i],y[i]);\n\t\tt[i]:=abs(x[i])+abs(y[i]);\n\t\tif t[i] mod 2<>t[1] mod 2 then\n\t\tbegin\n\t\t\twriteln(-1);\n\t\t\thalt;\n\t\tend;\n\t\tif t[i]>max then max:=t[i];\n\tend;\n\twriteln(max);\n\tfor i:=1 to max do write(2-t[i] mod 2,' ');\n\twriteln;\n\tfor i:=1 to n do\n\tbegin\n\t\ts:='';\n\t\tif x[i]<0 then \n\t\t\tfor j:=1 to -x[i] do s:=s+'L'\n\t\telse if x[i]>0 then for j:=1 to x[i] do s:=s+'R';\n\t\tif y[i]<0 then \n\t\t\tfor j:=1 to -y[i] do s:=s+'D'\n\t\telse if y[i]>0 then for j:=1 to y[i] do s:=s+'U';\n\t\tk:=length(s);\n\t\tfor j:=k+1 to max do\n\t\t\tif j mod 2=1 then s:=s+'L' else s:=s+'R';\n\t\twriteln(s);\n\tend;\nend.", "problem_context": "Score : 600 points\n\nProblem Statement\n\nSnuke is introducing a robot arm with the following properties to his factory:\n\nThe robot arm consists of m sections and m+1 joints. The sections are numbered 1, 2, ..., m, and the joints are numbered 0, 1, ..., m. Section i connects Joint i-1 and Joint i. The length of Section i is d_i.\n\nFor each section, its mode can be specified individually. There are four modes: L, R, D and U. The mode of a section decides the direction of that section. If we consider the factory as a coordinate plane, the position of Joint i will be determined as follows (we denote its coordinates as (x_i, y_i)):\n\n(x_0, y_0) = (0, 0).\n\nIf the mode of Section i is L, (x_{i}, y_{i}) = (x_{i-1} - d_{i}, y_{i-1}).\n\nIf the mode of Section i is R, (x_{i}, y_{i}) = (x_{i-1} + d_{i}, y_{i-1}).\n\nIf the mode of Section i is D, (x_{i}, y_{i}) = (x_{i-1}, y_{i-1} - d_{i}).\n\nIf the mode of Section i is U, (x_{i}, y_{i}) = (x_{i-1}, y_{i-1} + d_{i}).\n\nSnuke would like to introduce a robot arm so that the position of Joint m can be matched with all of the N points (X_1, Y_1), (X_2, Y_2), ..., (X_N, Y_N) by properly specifying the modes of the sections.\nIs this possible?\nIf so, find such a robot arm and how to bring Joint m to each point (X_j, Y_j).\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 1000\n\n-10^9 \\leq X_i \\leq 10^9\n\n-10^9 \\leq Y_i \\leq 10^9\n\nPartial Score\n\nIn the test cases worth 300 points, -10 \\leq X_i \\leq 10 and -10 \\leq Y_i \\leq 10 hold.\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\nIf the condition can be satisfied, follow the following format. If the condition cannot be satisfied, print -1.\n\nm\nd_1 d_2 ... d_m\nw_1\nw_2\n:\nw_N\n\nm and d_i are the configurations of the robot arm. Refer to the problem statement for what each of them means.\nHere, 1 \\leq m \\leq 40 and 1 \\leq d_i \\leq 10^{12} must hold. Also, m and d_i must all be integers.\n\nw_j is a string of length m that represents the way to bring Joint m of the robot arm to point (X_j, Y_j).\nThe i-th character of w_j should be one of the letters L, R, D and U, representing the mode of Section i.\n\nSample Input 1\n\n3\n-1 0\n0 3\n2 -1\n\nSample Output 1\n\n2\n1 2\nRL\nUU\nDR\n\nIn the given way to bring Joint m of the robot arm to each (X_j, Y_j), the positions of the joints will be as follows:\n\nTo (X_1, Y_1) = (-1, 0): First, the position of Joint 0 is (x_0, y_0) = (0, 0). As the mode of Section 1 is R, the position of Joint 1 is (x_1, y_1) = (1, 0). Then, as the mode of Section 2 is L, the position of Joint 2 is (x_2, y_2) = (-1, 0).\n\nTo (X_2, Y_2) = (0, 3): (x_0, y_0) = (0, 0), (x_1, y_1) = (0, 1), (x_2, y_2) = (0, 3).\n\nTo (X_3, Y_3) = (2, -1): (x_0, y_0) = (0, 0), (x_1, y_1) = (0, -1), (x_2, y_2) = (2, -1).\n\nSample Input 2\n\n5\n0 0\n1 0\n2 0\n3 0\n4 0\n\nSample Output 2\n\n-1\n\nSample Input 3\n\n2\n1 1\n1 1\n\nSample Output 3\n\n2\n1 1\nRU\nUR\n\nThere may be duplicated points among (X_j, Y_j).\n\nSample Input 4\n\n3\n-7 -3\n7 3\n-3 -7\n\nSample Output 4\n\n5\n3 1 4 1 5\nLRDUL\nRDULR\nDULRD", "sample_input": "3\n-1 0\n0 3\n2 -1\n"}, "reference_outputs": ["2\n1 2\nRL\nUU\nDR\n"], "source_document_id": "p03245", "source_text": "Score : 600 points\n\nProblem Statement\n\nSnuke is introducing a robot arm with the following properties to his factory:\n\nThe robot arm consists of m sections and m+1 joints. The sections are numbered 1, 2, ..., m, and the joints are numbered 0, 1, ..., m. Section i connects Joint i-1 and Joint i. The length of Section i is d_i.\n\nFor each section, its mode can be specified individually. There are four modes: L, R, D and U. The mode of a section decides the direction of that section. If we consider the factory as a coordinate plane, the position of Joint i will be determined as follows (we denote its coordinates as (x_i, y_i)):\n\n(x_0, y_0) = (0, 0).\n\nIf the mode of Section i is L, (x_{i}, y_{i}) = (x_{i-1} - d_{i}, y_{i-1}).\n\nIf the mode of Section i is R, (x_{i}, y_{i}) = (x_{i-1} + d_{i}, y_{i-1}).\n\nIf the mode of Section i is D, (x_{i}, y_{i}) = (x_{i-1}, y_{i-1} - d_{i}).\n\nIf the mode of Section i is U, (x_{i}, y_{i}) = (x_{i-1}, y_{i-1} + d_{i}).\n\nSnuke would like to introduce a robot arm so that the position of Joint m can be matched with all of the N points (X_1, Y_1), (X_2, Y_2), ..., (X_N, Y_N) by properly specifying the modes of the sections.\nIs this possible?\nIf so, find such a robot arm and how to bring Joint m to each point (X_j, Y_j).\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 1000\n\n-10^9 \\leq X_i \\leq 10^9\n\n-10^9 \\leq Y_i \\leq 10^9\n\nPartial Score\n\nIn the test cases worth 300 points, -10 \\leq X_i \\leq 10 and -10 \\leq Y_i \\leq 10 hold.\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\nIf the condition can be satisfied, follow the following format. If the condition cannot be satisfied, print -1.\n\nm\nd_1 d_2 ... d_m\nw_1\nw_2\n:\nw_N\n\nm and d_i are the configurations of the robot arm. Refer to the problem statement for what each of them means.\nHere, 1 \\leq m \\leq 40 and 1 \\leq d_i \\leq 10^{12} must hold. Also, m and d_i must all be integers.\n\nw_j is a string of length m that represents the way to bring Joint m of the robot arm to point (X_j, Y_j).\nThe i-th character of w_j should be one of the letters L, R, D and U, representing the mode of Section i.\n\nSample Input 1\n\n3\n-1 0\n0 3\n2 -1\n\nSample Output 1\n\n2\n1 2\nRL\nUU\nDR\n\nIn the given way to bring Joint m of the robot arm to each (X_j, Y_j), the positions of the joints will be as follows:\n\nTo (X_1, Y_1) = (-1, 0): First, the position of Joint 0 is (x_0, y_0) = (0, 0). As the mode of Section 1 is R, the position of Joint 1 is (x_1, y_1) = (1, 0). Then, as the mode of Section 2 is L, the position of Joint 2 is (x_2, y_2) = (-1, 0).\n\nTo (X_2, Y_2) = (0, 3): (x_0, y_0) = (0, 0), (x_1, y_1) = (0, 1), (x_2, y_2) = (0, 3).\n\nTo (X_3, Y_3) = (2, -1): (x_0, y_0) = (0, 0), (x_1, y_1) = (0, -1), (x_2, y_2) = (2, -1).\n\nSample Input 2\n\n5\n0 0\n1 0\n2 0\n3 0\n4 0\n\nSample Output 2\n\n-1\n\nSample Input 3\n\n2\n1 1\n1 1\n\nSample Output 3\n\n2\n1 1\nRU\nUR\n\nThere may be duplicated points among (X_j, Y_j).\n\nSample Input 4\n\n3\n-7 -3\n7 3\n-3 -7\n\nSample Output 4\n\n5\n3 1 4 1 5\nLRDUL\nRDULR\nDULRD", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 3, "memory_kb": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s301922887", "group_id": "codeNet:p03246", "input_text": "var\n\tN,i,L,R,x,y,z,w:Longint;\n\ta,b:Array[0..100000]of Longint;\nbegin\n\tread(N);\n\tfor i:=1 to N do begin\n\t\tread(x);\n\t\tif i mod 2=1 then inc(a[x])else inc(b[x]);\n\tend;\n\tx:=0;\n\tfor i:=1 to N do begin\n\t\tif a[x]z then writeln(N-a[x]-b[z])else begin\n\t\tL:=N-a[y]-b[z];\n\t\tR:=N-a[x]-b[w];\n\t\tif Lz then writeln(N-a[x]-b[z])else begin\n\t\tL:=N-a[y]-b[z];\n\t\tR:=N-a[x]-b[w];\n\t\tif Ly then exit(x) else exit(y);\n end;\nbegin\nreadln(n);\nfor i:=1 to n do\n begin\n read(a[i]);\n if mp2 then\n begin\n ans:=n-k1-k2;\n end\n else\n begin\n j1:=0;j2:=0;\n for i:=1 to m do\n begin\n if i=p1 then continue;\n if j1y then exit(x) else exit(y);\n end;\nbegin\nreadln(n);\nfor i:=1 to n do\n begin\n read(a[i]);\n if mp2 then\n begin\n ans:=n-k1-k2;\n end\n else\n begin\n j1:=0;j2:=0;\n for i:=1 to m do\n begin\n if i=p1 then continue;\n if j1(abs(x[1])+abs(y[1]))mod 2 then begin\n\t\t\twriteln(-1);\n\t\t\texit;\n\t\tend;\n\tend;\n\ta:=1073741824;\n\twhile a>0 do begin\n\t\tinc(c);\n\t\td[c]:=a;\n\t\ta:=a div 2;\n\tend;\n\tif (abs(x[1])+abs(y[1]))mod 2=0 then begin\n\t\tinc(c);\n\t\td[c]:=1;\n\tend;\n\twriteln(c);\n\tfor i:=1 to c do write(d[i],' ');\n\twriteln;\n\tfor i:=1 to n do begin\n\t\ta:=x[i];\n\t\tb:=y[i];\n\t\tfor j:=1 to c do begin\n\t\t\tif abs(a)>abs(b) then begin\n\t\t\t\tif a>0 then begin\n\t\t\t\t\tdec(a,d[j]);\n\t\t\t\t\twrite('R');\n\t\t\t\tend else begin\n\t\t\t\t\tinc(a,d[j]);\n\t\t\t\t\twrite('L');\n\t\t\t\tend;\n\t\t\tend else begin\n\t\t\t\tif b>0 then begin\n\t\t\t\t\tdec(b,d[j]);\n\t\t\t\t\twrite('U');\n\t\t\t\tend else begin\n\t\t\t\t\tinc(b,d[j]);\n\t\t\t\t\twrite('D');\n\t\t\t\tend;\n\t\t\tend;\n\t\tend;\n\t\twriteln;\n\tend;\nend.\n", "language": "Pascal", "metadata": {"date": 1540277270, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03247.html", "problem_id": "p03247", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03247/input.txt", "sample_output_relpath": "derived/input_output/data/p03247/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03247/Pascal/s517093889.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s517093889", "user_id": "u657913472"}, "prompt_components": {"gold_output": "2\n1 2\nRL\nUU\nDR\n", "input_to_evaluate": "var\n\tn,i,j,c,a,b:Longint;\n\tx,y,d:array[1..100000]of Longint;\nbegin\n\tread(n);\n\tfor i:=1 to n do begin\n\t\tread(x[i],y[i]);\n\t\tif (abs(x[i])+abs(y[i]))mod 2<>(abs(x[1])+abs(y[1]))mod 2 then begin\n\t\t\twriteln(-1);\n\t\t\texit;\n\t\tend;\n\tend;\n\ta:=1073741824;\n\twhile a>0 do begin\n\t\tinc(c);\n\t\td[c]:=a;\n\t\ta:=a div 2;\n\tend;\n\tif (abs(x[1])+abs(y[1]))mod 2=0 then begin\n\t\tinc(c);\n\t\td[c]:=1;\n\tend;\n\twriteln(c);\n\tfor i:=1 to c do write(d[i],' ');\n\twriteln;\n\tfor i:=1 to n do begin\n\t\ta:=x[i];\n\t\tb:=y[i];\n\t\tfor j:=1 to c do begin\n\t\t\tif abs(a)>abs(b) then begin\n\t\t\t\tif a>0 then begin\n\t\t\t\t\tdec(a,d[j]);\n\t\t\t\t\twrite('R');\n\t\t\t\tend else begin\n\t\t\t\t\tinc(a,d[j]);\n\t\t\t\t\twrite('L');\n\t\t\t\tend;\n\t\t\tend else begin\n\t\t\t\tif b>0 then begin\n\t\t\t\t\tdec(b,d[j]);\n\t\t\t\t\twrite('U');\n\t\t\t\tend else begin\n\t\t\t\t\tinc(b,d[j]);\n\t\t\t\t\twrite('D');\n\t\t\t\tend;\n\t\t\tend;\n\t\tend;\n\t\twriteln;\n\tend;\nend.\n", "problem_context": "Score : 600 points\n\nProblem Statement\n\nSnuke is introducing a robot arm with the following properties to his factory:\n\nThe robot arm consists of m sections and m+1 joints. The sections are numbered 1, 2, ..., m, and the joints are numbered 0, 1, ..., m. Section i connects Joint i-1 and Joint i. The length of Section i is d_i.\n\nFor each section, its mode can be specified individually. There are four modes: L, R, D and U. The mode of a section decides the direction of that section. If we consider the factory as a coordinate plane, the position of Joint i will be determined as follows (we denote its coordinates as (x_i, y_i)):\n\n(x_0, y_0) = (0, 0).\n\nIf the mode of Section i is L, (x_{i}, y_{i}) = (x_{i-1} - d_{i}, y_{i-1}).\n\nIf the mode of Section i is R, (x_{i}, y_{i}) = (x_{i-1} + d_{i}, y_{i-1}).\n\nIf the mode of Section i is D, (x_{i}, y_{i}) = (x_{i-1}, y_{i-1} - d_{i}).\n\nIf the mode of Section i is U, (x_{i}, y_{i}) = (x_{i-1}, y_{i-1} + d_{i}).\n\nSnuke would like to introduce a robot arm so that the position of Joint m can be matched with all of the N points (X_1, Y_1), (X_2, Y_2), ..., (X_N, Y_N) by properly specifying the modes of the sections.\nIs this possible?\nIf so, find such a robot arm and how to bring Joint m to each point (X_j, Y_j).\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 1000\n\n-10^9 \\leq X_i \\leq 10^9\n\n-10^9 \\leq Y_i \\leq 10^9\n\nPartial Score\n\nIn the test cases worth 300 points, -10 \\leq X_i \\leq 10 and -10 \\leq Y_i \\leq 10 hold.\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\nIf the condition can be satisfied, follow the following format. If the condition cannot be satisfied, print -1.\n\nm\nd_1 d_2 ... d_m\nw_1\nw_2\n:\nw_N\n\nm and d_i are the configurations of the robot arm. Refer to the problem statement for what each of them means.\nHere, 1 \\leq m \\leq 40 and 1 \\leq d_i \\leq 10^{12} must hold. Also, m and d_i must all be integers.\n\nw_j is a string of length m that represents the way to bring Joint m of the robot arm to point (X_j, Y_j).\nThe i-th character of w_j should be one of the letters L, R, D and U, representing the mode of Section i.\n\nSample Input 1\n\n3\n-1 0\n0 3\n2 -1\n\nSample Output 1\n\n2\n1 2\nRL\nUU\nDR\n\nIn the given way to bring Joint m of the robot arm to each (X_j, Y_j), the positions of the joints will be as follows:\n\nTo (X_1, Y_1) = (-1, 0): First, the position of Joint 0 is (x_0, y_0) = (0, 0). As the mode of Section 1 is R, the position of Joint 1 is (x_1, y_1) = (1, 0). Then, as the mode of Section 2 is L, the position of Joint 2 is (x_2, y_2) = (-1, 0).\n\nTo (X_2, Y_2) = (0, 3): (x_0, y_0) = (0, 0), (x_1, y_1) = (0, 1), (x_2, y_2) = (0, 3).\n\nTo (X_3, Y_3) = (2, -1): (x_0, y_0) = (0, 0), (x_1, y_1) = (0, -1), (x_2, y_2) = (2, -1).\n\nSample Input 2\n\n5\n0 0\n1 0\n2 0\n3 0\n4 0\n\nSample Output 2\n\n-1\n\nSample Input 3\n\n2\n1 1\n1 1\n\nSample Output 3\n\n2\n1 1\nRU\nUR\n\nThere may be duplicated points among (X_j, Y_j).\n\nSample Input 4\n\n3\n-7 -3\n7 3\n-3 -7\n\nSample Output 4\n\n5\n3 1 4 1 5\nLRDUL\nRDULR\nDULRD", "sample_input": "3\n-1 0\n0 3\n2 -1\n"}, "reference_outputs": ["2\n1 2\nRL\nUU\nDR\n"], "source_document_id": "p03247", "source_text": "Score : 600 points\n\nProblem Statement\n\nSnuke is introducing a robot arm with the following properties to his factory:\n\nThe robot arm consists of m sections and m+1 joints. The sections are numbered 1, 2, ..., m, and the joints are numbered 0, 1, ..., m. Section i connects Joint i-1 and Joint i. The length of Section i is d_i.\n\nFor each section, its mode can be specified individually. There are four modes: L, R, D and U. The mode of a section decides the direction of that section. If we consider the factory as a coordinate plane, the position of Joint i will be determined as follows (we denote its coordinates as (x_i, y_i)):\n\n(x_0, y_0) = (0, 0).\n\nIf the mode of Section i is L, (x_{i}, y_{i}) = (x_{i-1} - d_{i}, y_{i-1}).\n\nIf the mode of Section i is R, (x_{i}, y_{i}) = (x_{i-1} + d_{i}, y_{i-1}).\n\nIf the mode of Section i is D, (x_{i}, y_{i}) = (x_{i-1}, y_{i-1} - d_{i}).\n\nIf the mode of Section i is U, (x_{i}, y_{i}) = (x_{i-1}, y_{i-1} + d_{i}).\n\nSnuke would like to introduce a robot arm so that the position of Joint m can be matched with all of the N points (X_1, Y_1), (X_2, Y_2), ..., (X_N, Y_N) by properly specifying the modes of the sections.\nIs this possible?\nIf so, find such a robot arm and how to bring Joint m to each point (X_j, Y_j).\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 1000\n\n-10^9 \\leq X_i \\leq 10^9\n\n-10^9 \\leq Y_i \\leq 10^9\n\nPartial Score\n\nIn the test cases worth 300 points, -10 \\leq X_i \\leq 10 and -10 \\leq Y_i \\leq 10 hold.\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\nIf the condition can be satisfied, follow the following format. If the condition cannot be satisfied, print -1.\n\nm\nd_1 d_2 ... d_m\nw_1\nw_2\n:\nw_N\n\nm and d_i are the configurations of the robot arm. Refer to the problem statement for what each of them means.\nHere, 1 \\leq m \\leq 40 and 1 \\leq d_i \\leq 10^{12} must hold. Also, m and d_i must all be integers.\n\nw_j is a string of length m that represents the way to bring Joint m of the robot arm to point (X_j, Y_j).\nThe i-th character of w_j should be one of the letters L, R, D and U, representing the mode of Section i.\n\nSample Input 1\n\n3\n-1 0\n0 3\n2 -1\n\nSample Output 1\n\n2\n1 2\nRL\nUU\nDR\n\nIn the given way to bring Joint m of the robot arm to each (X_j, Y_j), the positions of the joints will be as follows:\n\nTo (X_1, Y_1) = (-1, 0): First, the position of Joint 0 is (x_0, y_0) = (0, 0). As the mode of Section 1 is R, the position of Joint 1 is (x_1, y_1) = (1, 0). Then, as the mode of Section 2 is L, the position of Joint 2 is (x_2, y_2) = (-1, 0).\n\nTo (X_2, Y_2) = (0, 3): (x_0, y_0) = (0, 0), (x_1, y_1) = (0, 1), (x_2, y_2) = (0, 3).\n\nTo (X_3, Y_3) = (2, -1): (x_0, y_0) = (0, 0), (x_1, y_1) = (0, -1), (x_2, y_2) = (2, -1).\n\nSample Input 2\n\n5\n0 0\n1 0\n2 0\n3 0\n4 0\n\nSample Output 2\n\n-1\n\nSample Input 3\n\n2\n1 1\n1 1\n\nSample Output 3\n\n2\n1 1\nRU\nUR\n\nThere may be duplicated points among (X_j, Y_j).\n\nSample Input 4\n\n3\n-7 -3\n7 3\n-3 -7\n\nSample Output 4\n\n5\n3 1 4 1 5\nLRDUL\nRDULR\nDULRD", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 832, "cpu_time_ms": 2, "memory_kb": 128}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s743640075", "group_id": "codeNet:p03247", "input_text": "var\n n,p,m,i,j:longint;\n x,y,d:array[0..1010] of longint;\nbegin\n readln(n);\n readln(x[1],y[1]);\n p:=abs(x[1]+y[1]) mod 2;\n for i:=2 to n do\n begin\n readln(x[i],y[i]);\n if p<>abs(x[i]+y[i]) mod 2 then \n begin\n writeln(-1);exit;\n end;\n end;\n m:=30+1-p;writeln(m);d[30]:=1;\n for i:=29 downto 1 do d[i]:=d[i+1]*2;\n if m=31 then d[31]:=1;\n for i:=1 to m do write(d[i],' ');writeln;\n for i:=1 to n do \n begin \n for j:=1 to m do\n if abs(x[i])>abs(y[i]) then\n if x[i]>0 then begin dec(x[i],d[j]);write('R');end\n else begin inc(x[i],d[j]);write('L');end\n else \n if y[i]>0 then begin dec(y[i],d[j]);write('U');end\n else begin inc(y[i],d[j]);write('D');end;\n writeln;\n end;\nend.", "language": "Pascal", "metadata": {"date": 1538785854, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03247.html", "problem_id": "p03247", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03247/input.txt", "sample_output_relpath": "derived/input_output/data/p03247/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03247/Pascal/s743640075.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s743640075", "user_id": "u960852022"}, "prompt_components": {"gold_output": "2\n1 2\nRL\nUU\nDR\n", "input_to_evaluate": "var\n n,p,m,i,j:longint;\n x,y,d:array[0..1010] of longint;\nbegin\n readln(n);\n readln(x[1],y[1]);\n p:=abs(x[1]+y[1]) mod 2;\n for i:=2 to n do\n begin\n readln(x[i],y[i]);\n if p<>abs(x[i]+y[i]) mod 2 then \n begin\n writeln(-1);exit;\n end;\n end;\n m:=30+1-p;writeln(m);d[30]:=1;\n for i:=29 downto 1 do d[i]:=d[i+1]*2;\n if m=31 then d[31]:=1;\n for i:=1 to m do write(d[i],' ');writeln;\n for i:=1 to n do \n begin \n for j:=1 to m do\n if abs(x[i])>abs(y[i]) then\n if x[i]>0 then begin dec(x[i],d[j]);write('R');end\n else begin inc(x[i],d[j]);write('L');end\n else \n if y[i]>0 then begin dec(y[i],d[j]);write('U');end\n else begin inc(y[i],d[j]);write('D');end;\n writeln;\n end;\nend.", "problem_context": "Score : 600 points\n\nProblem Statement\n\nSnuke is introducing a robot arm with the following properties to his factory:\n\nThe robot arm consists of m sections and m+1 joints. The sections are numbered 1, 2, ..., m, and the joints are numbered 0, 1, ..., m. Section i connects Joint i-1 and Joint i. The length of Section i is d_i.\n\nFor each section, its mode can be specified individually. There are four modes: L, R, D and U. The mode of a section decides the direction of that section. If we consider the factory as a coordinate plane, the position of Joint i will be determined as follows (we denote its coordinates as (x_i, y_i)):\n\n(x_0, y_0) = (0, 0).\n\nIf the mode of Section i is L, (x_{i}, y_{i}) = (x_{i-1} - d_{i}, y_{i-1}).\n\nIf the mode of Section i is R, (x_{i}, y_{i}) = (x_{i-1} + d_{i}, y_{i-1}).\n\nIf the mode of Section i is D, (x_{i}, y_{i}) = (x_{i-1}, y_{i-1} - d_{i}).\n\nIf the mode of Section i is U, (x_{i}, y_{i}) = (x_{i-1}, y_{i-1} + d_{i}).\n\nSnuke would like to introduce a robot arm so that the position of Joint m can be matched with all of the N points (X_1, Y_1), (X_2, Y_2), ..., (X_N, Y_N) by properly specifying the modes of the sections.\nIs this possible?\nIf so, find such a robot arm and how to bring Joint m to each point (X_j, Y_j).\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 1000\n\n-10^9 \\leq X_i \\leq 10^9\n\n-10^9 \\leq Y_i \\leq 10^9\n\nPartial Score\n\nIn the test cases worth 300 points, -10 \\leq X_i \\leq 10 and -10 \\leq Y_i \\leq 10 hold.\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\nIf the condition can be satisfied, follow the following format. If the condition cannot be satisfied, print -1.\n\nm\nd_1 d_2 ... d_m\nw_1\nw_2\n:\nw_N\n\nm and d_i are the configurations of the robot arm. Refer to the problem statement for what each of them means.\nHere, 1 \\leq m \\leq 40 and 1 \\leq d_i \\leq 10^{12} must hold. Also, m and d_i must all be integers.\n\nw_j is a string of length m that represents the way to bring Joint m of the robot arm to point (X_j, Y_j).\nThe i-th character of w_j should be one of the letters L, R, D and U, representing the mode of Section i.\n\nSample Input 1\n\n3\n-1 0\n0 3\n2 -1\n\nSample Output 1\n\n2\n1 2\nRL\nUU\nDR\n\nIn the given way to bring Joint m of the robot arm to each (X_j, Y_j), the positions of the joints will be as follows:\n\nTo (X_1, Y_1) = (-1, 0): First, the position of Joint 0 is (x_0, y_0) = (0, 0). As the mode of Section 1 is R, the position of Joint 1 is (x_1, y_1) = (1, 0). Then, as the mode of Section 2 is L, the position of Joint 2 is (x_2, y_2) = (-1, 0).\n\nTo (X_2, Y_2) = (0, 3): (x_0, y_0) = (0, 0), (x_1, y_1) = (0, 1), (x_2, y_2) = (0, 3).\n\nTo (X_3, Y_3) = (2, -1): (x_0, y_0) = (0, 0), (x_1, y_1) = (0, -1), (x_2, y_2) = (2, -1).\n\nSample Input 2\n\n5\n0 0\n1 0\n2 0\n3 0\n4 0\n\nSample Output 2\n\n-1\n\nSample Input 3\n\n2\n1 1\n1 1\n\nSample Output 3\n\n2\n1 1\nRU\nUR\n\nThere may be duplicated points among (X_j, Y_j).\n\nSample Input 4\n\n3\n-7 -3\n7 3\n-3 -7\n\nSample Output 4\n\n5\n3 1 4 1 5\nLRDUL\nRDULR\nDULRD", "sample_input": "3\n-1 0\n0 3\n2 -1\n"}, "reference_outputs": ["2\n1 2\nRL\nUU\nDR\n"], "source_document_id": "p03247", "source_text": "Score : 600 points\n\nProblem Statement\n\nSnuke is introducing a robot arm with the following properties to his factory:\n\nThe robot arm consists of m sections and m+1 joints. The sections are numbered 1, 2, ..., m, and the joints are numbered 0, 1, ..., m. Section i connects Joint i-1 and Joint i. The length of Section i is d_i.\n\nFor each section, its mode can be specified individually. There are four modes: L, R, D and U. The mode of a section decides the direction of that section. If we consider the factory as a coordinate plane, the position of Joint i will be determined as follows (we denote its coordinates as (x_i, y_i)):\n\n(x_0, y_0) = (0, 0).\n\nIf the mode of Section i is L, (x_{i}, y_{i}) = (x_{i-1} - d_{i}, y_{i-1}).\n\nIf the mode of Section i is R, (x_{i}, y_{i}) = (x_{i-1} + d_{i}, y_{i-1}).\n\nIf the mode of Section i is D, (x_{i}, y_{i}) = (x_{i-1}, y_{i-1} - d_{i}).\n\nIf the mode of Section i is U, (x_{i}, y_{i}) = (x_{i-1}, y_{i-1} + d_{i}).\n\nSnuke would like to introduce a robot arm so that the position of Joint m can be matched with all of the N points (X_1, Y_1), (X_2, Y_2), ..., (X_N, Y_N) by properly specifying the modes of the sections.\nIs this possible?\nIf so, find such a robot arm and how to bring Joint m to each point (X_j, Y_j).\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 1000\n\n-10^9 \\leq X_i \\leq 10^9\n\n-10^9 \\leq Y_i \\leq 10^9\n\nPartial Score\n\nIn the test cases worth 300 points, -10 \\leq X_i \\leq 10 and -10 \\leq Y_i \\leq 10 hold.\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\nIf the condition can be satisfied, follow the following format. If the condition cannot be satisfied, print -1.\n\nm\nd_1 d_2 ... d_m\nw_1\nw_2\n:\nw_N\n\nm and d_i are the configurations of the robot arm. Refer to the problem statement for what each of them means.\nHere, 1 \\leq m \\leq 40 and 1 \\leq d_i \\leq 10^{12} must hold. Also, m and d_i must all be integers.\n\nw_j is a string of length m that represents the way to bring Joint m of the robot arm to point (X_j, Y_j).\nThe i-th character of w_j should be one of the letters L, R, D and U, representing the mode of Section i.\n\nSample Input 1\n\n3\n-1 0\n0 3\n2 -1\n\nSample Output 1\n\n2\n1 2\nRL\nUU\nDR\n\nIn the given way to bring Joint m of the robot arm to each (X_j, Y_j), the positions of the joints will be as follows:\n\nTo (X_1, Y_1) = (-1, 0): First, the position of Joint 0 is (x_0, y_0) = (0, 0). As the mode of Section 1 is R, the position of Joint 1 is (x_1, y_1) = (1, 0). Then, as the mode of Section 2 is L, the position of Joint 2 is (x_2, y_2) = (-1, 0).\n\nTo (X_2, Y_2) = (0, 3): (x_0, y_0) = (0, 0), (x_1, y_1) = (0, 1), (x_2, y_2) = (0, 3).\n\nTo (X_3, Y_3) = (2, -1): (x_0, y_0) = (0, 0), (x_1, y_1) = (0, -1), (x_2, y_2) = (2, -1).\n\nSample Input 2\n\n5\n0 0\n1 0\n2 0\n3 0\n4 0\n\nSample Output 2\n\n-1\n\nSample Input 3\n\n2\n1 1\n1 1\n\nSample Output 3\n\n2\n1 1\nRU\nUR\n\nThere may be duplicated points among (X_j, Y_j).\n\nSample Input 4\n\n3\n-7 -3\n7 3\n-3 -7\n\nSample Output 4\n\n5\n3 1 4 1 5\nLRDUL\nRDULR\nDULRD", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 927, "cpu_time_ms": 2, "memory_kb": 128}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s306681726", "group_id": "codeNet:p03248", "input_text": "var\n s:ansistring;\n len,i,cnt,tot,t:longint;\nbegin\n readln(s);len:=length(s);\n if (s[1]='0') or (s[len]='1') then\n begin\n writeln(-1);\n exit;\n end;\n dec(len);\n for i:=1 to len div 2 do\n if s[i]<>s[len-i+1] then \n begin\n writeln(-1);\n exit;\n end;\n for i:=1 to len do\n if s[i]='1' then inc(cnt);\n for i:=1 to cnt do\n writeln(i,' ',i+1);\n tot:=cnt+2;t:=0;\n for i:=1 to len do\n if s[i]='0' then \n begin \n writeln(cnt-i+t+2,' ',tot);\n inc(t);inc(tot);\n end;\nend.", "language": "Pascal", "metadata": {"date": 1538274622, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03248.html", "problem_id": "p03248", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03248/input.txt", "sample_output_relpath": "derived/input_output/data/p03248/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03248/Pascal/s306681726.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s306681726", "user_id": "u960852022"}, "prompt_components": {"gold_output": "-1\n", "input_to_evaluate": "var\n s:ansistring;\n len,i,cnt,tot,t:longint;\nbegin\n readln(s);len:=length(s);\n if (s[1]='0') or (s[len]='1') then\n begin\n writeln(-1);\n exit;\n end;\n dec(len);\n for i:=1 to len div 2 do\n if s[i]<>s[len-i+1] then \n begin\n writeln(-1);\n exit;\n end;\n for i:=1 to len do\n if s[i]='1' then inc(cnt);\n for i:=1 to cnt do\n writeln(i,' ',i+1);\n tot:=cnt+2;t:=0;\n for i:=1 to len do\n if s[i]='0' then \n begin \n writeln(cnt-i+t+2,' ',tot);\n inc(t);inc(tot);\n end;\nend.", "problem_context": "Score : 700 points\n\nProblem Statement\n\nYou are given a string s of length n.\nDoes a tree with n vertices that satisfies the following conditions exist?\n\nThe vertices are numbered 1,2,..., n.\n\nThe edges are numbered 1,2,..., n-1, and Edge i connects Vertex u_i and v_i.\n\nIf the i-th character in s is 1, we can have a connected component of size i by removing one edge from the tree.\n\nIf the i-th character in s is 0, we cannot have a connected component of size i by removing any one edge from the tree.\n\nIf such a tree exists, construct one such tree.\n\nConstraints\n\n2 \\leq n \\leq 10^5\n\ns is a string of length n consisting of 0 and 1.\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns\n\nOutput\n\nIf a tree with n vertices that satisfies the conditions does not exist, print -1.\n\nIf a tree with n vertices that satisfies the conditions exist, print n-1 lines.\nThe i-th line should contain u_i and v_i with a space in between.\nIf there are multiple trees that satisfy the conditions, any such tree will be accepted.\n\nSample Input 1\n\n1111\n\nSample Output 1\n\n-1\n\nIt is impossible to have a connected component of size n after removing one edge from a tree with n vertices.\n\nSample Input 2\n\n1110\n\nSample Output 2\n\n1 2\n2 3\n3 4\n\nIf Edge 1 or Edge 3 is removed, we will have a connected component of size 1 and another of size 3. If Edge 2 is removed, we will have two connected components, each of size 2.\n\nSample Input 3\n\n1010\n\nSample Output 3\n\n1 2\n1 3\n1 4\n\nRemoving any edge will result in a connected component of size 1 and another of size 3.", "sample_input": "1111\n"}, "reference_outputs": ["-1\n"], "source_document_id": "p03248", "source_text": "Score : 700 points\n\nProblem Statement\n\nYou are given a string s of length n.\nDoes a tree with n vertices that satisfies the following conditions exist?\n\nThe vertices are numbered 1,2,..., n.\n\nThe edges are numbered 1,2,..., n-1, and Edge i connects Vertex u_i and v_i.\n\nIf the i-th character in s is 1, we can have a connected component of size i by removing one edge from the tree.\n\nIf the i-th character in s is 0, we cannot have a connected component of size i by removing any one edge from the tree.\n\nIf such a tree exists, construct one such tree.\n\nConstraints\n\n2 \\leq n \\leq 10^5\n\ns is a string of length n consisting of 0 and 1.\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns\n\nOutput\n\nIf a tree with n vertices that satisfies the conditions does not exist, print -1.\n\nIf a tree with n vertices that satisfies the conditions exist, print n-1 lines.\nThe i-th line should contain u_i and v_i with a space in between.\nIf there are multiple trees that satisfy the conditions, any such tree will be accepted.\n\nSample Input 1\n\n1111\n\nSample Output 1\n\n-1\n\nIt is impossible to have a connected component of size n after removing one edge from a tree with n vertices.\n\nSample Input 2\n\n1110\n\nSample Output 2\n\n1 2\n2 3\n3 4\n\nIf Edge 1 or Edge 3 is removed, we will have a connected component of size 1 and another of size 3. If Edge 2 is removed, we will have two connected components, each of size 2.\n\nSample Input 3\n\n1010\n\nSample Output 3\n\n1 2\n1 3\n1 4\n\nRemoving any edge will result in a connected component of size 1 and another of size 3.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 27, "memory_kb": 1408}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s438903074", "group_id": "codeNet:p03252", "input_text": "var\n\ts,t:ansistring;\n\ta,b:array['a'..'z'] of char;\n\tfs,ft:array['a'..'z'] of boolean;\n\ti,l:longint;\nprocedure cant;\nbegin\n\twriteln('No');\n\thalt;\nend;\nbegin\n\treadln(s); readln(t);\n\tl:=length(s);\n\tfillchar(fs,sizeof(fs),true);\n\tfillchar(ft,sizeof(ft),true);\n\tfor i:=1 to l do\n\tbegin\n\t\tif fs[s[i]] then\n\t\tbegin\t\n\t\t\tfs[s[i]]:=false;\n\t\t\ta[s[i]]:=t[i];\n\t\tend\n\t\telse if a[s[i]]<>t[i] then cant;\n\t\tif ft[t[i]] then \n\t\tbegin\n\t\t\tft[t[i]]:=false;\n\t\t\tb[t[i]]:=s[i];\n\t\tend\n\t\telse if b[t[i]]<>s[i] then cant;\n\tend;\n\twriteln('Yes');\nend.", "language": "Pascal", "metadata": {"date": 1537754709, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03252.html", "problem_id": "p03252", "resource_group": "low_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/Pascal/s438903074.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s438903074", "user_id": "u957998623"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "var\n\ts,t:ansistring;\n\ta,b:array['a'..'z'] of char;\n\tfs,ft:array['a'..'z'] of boolean;\n\ti,l:longint;\nprocedure cant;\nbegin\n\twriteln('No');\n\thalt;\nend;\nbegin\n\treadln(s); readln(t);\n\tl:=length(s);\n\tfillchar(fs,sizeof(fs),true);\n\tfillchar(ft,sizeof(ft),true);\n\tfor i:=1 to l do\n\tbegin\n\t\tif fs[s[i]] then\n\t\tbegin\t\n\t\t\tfs[s[i]]:=false;\n\t\t\ta[s[i]]:=t[i];\n\t\tend\n\t\telse if a[s[i]]<>t[i] then cant;\n\t\tif ft[t[i]] then \n\t\tbegin\n\t\t\tft[t[i]]:=false;\n\t\t\tb[t[i]]:=s[i];\n\t\tend\n\t\telse if b[t[i]]<>s[i] then cant;\n\tend;\n\twriteln('Yes');\nend.", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 2, "memory_kb": 512}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s921756758", "group_id": "codeNet:p03252", "input_text": "var\n\ts,t:String;\n\tc,d:array[0..25]of Longint;\n\ti,j,k:Longint;\nbegin\n\treadln(s);\n\treadln(t);\n\tfor i:=0 to 25 do begin\n\t\tc[i]:=-1;\n\t\td[i]:=-1;\n\tend;\n\tfor i:=1 to length(s) do begin\n\t\tj:=ord(s[i])-97;\n\t\tk:=ord(t[i])-97;\n\t\tif c[j]=-1 then c[j]:=k;\n\t\tif d[k]=-1 then d[k]:=j;\n\t\tif(c[j]<>k)or(d[k]<>j)then begin\n\t\t\twriteln('No');\n\t\t\texit;\n\t\tend;\n\tend;\n\twriteln('Yes');\nend.\n", "language": "Pascal", "metadata": {"date": 1537754396, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03252.html", "problem_id": "p03252", "resource_group": "low_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/Pascal/s921756758.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s921756758", "user_id": "u657913472"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "var\n\ts,t:String;\n\tc,d:array[0..25]of Longint;\n\ti,j,k:Longint;\nbegin\n\treadln(s);\n\treadln(t);\n\tfor i:=0 to 25 do begin\n\t\tc[i]:=-1;\n\t\td[i]:=-1;\n\tend;\n\tfor i:=1 to length(s) do begin\n\t\tj:=ord(s[i])-97;\n\t\tk:=ord(t[i])-97;\n\t\tif c[j]=-1 then c[j]:=k;\n\t\tif d[k]=-1 then d[k]:=j;\n\t\tif(c[j]<>k)or(d[k]<>j)then begin\n\t\t\twriteln('No');\n\t\t\texit;\n\t\tend;\n\tend;\n\twriteln('Yes');\nend.\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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 2, "memory_kb": 640}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s547960801", "group_id": "codeNet:p03252", "input_text": "var\n s1,s2:string;\n a,b:array['a'..'z']of longint;\n c:array[1..26]of boolean;\n o:boolean;\n i,j,k,p:longint;\nbegin\n readln(s1);\n read(s2);\n k:=length(s2);\n o:=true;\n if length(s1)1 then ans:=ans*facnm mod mo*n mod mo*inv mod mo;\n\twriteln(ans);\nend.", "language": "Pascal", "metadata": {"date": 1544283196, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03253.html", "problem_id": "p03253", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03253/input.txt", "sample_output_relpath": "derived/input_output/data/p03253/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03253/Pascal/s845965230.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s845965230", "user_id": "u657913472"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "var\n\tinv,now,n,m,ans,mo,p,facnm:int64;\n\tfac:array[0..30]of int64;\n\ti,j:Longint;\nfunction power(a,b:int64):int64;\nvar ret:int64;\nbegin\n\tif b=0 then power:=1\n\telse begin\n\t\tret:=power(a*a mod 1000000007,b div 2);\n\t\tif b mod 2=1 then ret:=ret*a mod 1000000007;\n\t\tpower:=ret;\n\tend;\nend;\nbegin\n\tread(n,m);\n\tans:=1;\n\tmo:=1000000007;\n\tfac[0]:=1;\n\tfor i:=1 to 30 do fac[i]:=fac[i-1]*i mod mo;\n\tfacnm:=1;\n\tfor i:=2 to n-1 do facnm:=facnm*i mod mo;\n\tinv:=power(facnm,mo-2);\n\ti:=2;\n\twhile i*i<=m do begin\n\t\tif m mod i=0 then begin\n\t\t\tp:=0;\n\t\t\twhile m mod i=0 do begin\n\t\t\t\tm:=m div i;\n\t\t\t\tinc(p);\n\t\t\tend;\n\t\t\tnow:=facnm;\n\t\t\tfor j:=1 to p do now:=now*(n+j-1)mod mo;\n\t\t\tans:=ans*now mod mo*power(fac[p],mo-2)mod mo*inv mod mo;\n\t\tend;\n\t\tinc(i);\n\tend;\n\tif m>1 then ans:=ans*facnm mod mo*n mod mo*inv mod mo;\n\twriteln(ans);\nend.", "problem_context": "Score : 400 points\n\nProblem Statement\n\nYou are given positive integers N and M.\n\nHow many sequences a of length N consisting of positive integers satisfy a_1 \\times a_2 \\times ... \\times a_N = M? Find the count modulo 10^9+7.\n\nHere, two sequences a' and a'' are considered different when there exists some i such that a_i' \\neq a_i''.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 10^5\n\n1 \\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 number of the sequences consisting of positive integers that satisfy the condition, modulo 10^9 + 7.\n\nSample Input 1\n\n2 6\n\nSample Output 1\n\n4\n\nFour sequences satisfy the condition: \\{a_1, a_2\\} = \\{1, 6\\}, \\{2, 3\\}, \\{3, 2\\} and \\{6, 1\\}.\n\nSample Input 2\n\n3 12\n\nSample Output 2\n\n18\n\nSample Input 3\n\n100000 1000000000\n\nSample Output 3\n\n957870001", "sample_input": "2 6\n"}, "reference_outputs": ["4\n"], "source_document_id": "p03253", "source_text": "Score : 400 points\n\nProblem Statement\n\nYou are given positive integers N and M.\n\nHow many sequences a of length N consisting of positive integers satisfy a_1 \\times a_2 \\times ... \\times a_N = M? Find the count modulo 10^9+7.\n\nHere, two sequences a' and a'' are considered different when there exists some i such that a_i' \\neq a_i''.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 10^5\n\n1 \\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 number of the sequences consisting of positive integers that satisfy the condition, modulo 10^9 + 7.\n\nSample Input 1\n\n2 6\n\nSample Output 1\n\n4\n\nFour sequences satisfy the condition: \\{a_1, a_2\\} = \\{1, 6\\}, \\{2, 3\\}, \\{3, 2\\} and \\{6, 1\\}.\n\nSample Input 2\n\n3 12\n\nSample Output 2\n\n18\n\nSample Input 3\n\n100000 1000000000\n\nSample Output 3\n\n957870001", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 809, "cpu_time_ms": 2, "memory_kb": 128}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s576033467", "group_id": "codeNet:p03255", "input_text": "var i,j,len:longint;\n k,l,m,n,q,w,x,ans,rst:int64;\n a,b,s:Array[0..1000000] of int64;\nbegin\n readln(n,x);\n for i:=1 to n do read(a[i]);\n for i:=1 to n do s[i]:=s[i-1]+a[i];\n readln;\n rst:=(maxlongint-100)*maxlongint;\n for len:=1 to n do begin\n ans:=0;\n ans:=ans+(s[n]-s[n-len])*5;\n w:=5;j:=n-len;\n while j>len do begin\n ans:=ans+w*(s[j]-s[j-len]);\n j:=j-len;\n w:=w+2;\n end;\n ans:=ans+w*s[j]+len*x;\n if anslen do begin\n ans:=ans+w*(s[j]-s[j-len]);\n j:=j-len;\n w:=w+2;\n end;\n ans:=ans+w*s[j]+len*x;\n if ansst[i+1] then continue;\n\t if st[i]='a' then \n\t begin\n\t delete(st,i,2);\n\t insert('b',st,i);\n\t for j:=1 to p+1 do if a[j]=st then break;\n\t if j=p+1 then begin\n\t inc(k);\n\t inc(p);\n\t a[p]:=st;\n\t search(st);\n\t end;\n\t delete(st,i,1);\n\t insert('aa',st,i);\n\t continue;\n\t end;\n\t if st[i]='b' then \n\t begin\n\t delete(st,i,2);\n\t insert('a',st,i);\n\t for j:=1 to p+1 do if a[j]=st then break;\n\t if j=p+1 then begin\n\t inc(k);\n\t inc(p);\n\t a[p]:=st;\n\t search(st);\n\t end;\n\t search(st);\n\t delete(st,i,1);\n\t insert('bb',st,i);\n\t end;\n end;\nend;\nbegin\n readln(s);\n k:=1;\n search(s);\n writeln(k);\nend.", "language": "Pascal", "metadata": {"date": 1537062511, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03258.html", "problem_id": "p03258", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03258/input.txt", "sample_output_relpath": "derived/input_output/data/p03258/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03258/Pascal/s330190419.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s330190419", "user_id": "u223928734"}, "prompt_components": {"gold_output": "6\n", "input_to_evaluate": "var\n s:ansistring;\n a:array[1..1000000]of ansistring;\n i,j,m,n,p:longint;\n k:qword;\nprocedure search(st:string);\nvar\n i,j:longint;\nbegin\n if length(st)=1 then exit;\n for i:=1 to length(st)-1 do\n begin\n if st[i]<>st[i+1] then continue;\n\t if st[i]='a' then \n\t begin\n\t delete(st,i,2);\n\t insert('b',st,i);\n\t for j:=1 to p+1 do if a[j]=st then break;\n\t if j=p+1 then begin\n\t inc(k);\n\t inc(p);\n\t a[p]:=st;\n\t search(st);\n\t end;\n\t delete(st,i,1);\n\t insert('aa',st,i);\n\t continue;\n\t end;\n\t if st[i]='b' then \n\t begin\n\t delete(st,i,2);\n\t insert('a',st,i);\n\t for j:=1 to p+1 do if a[j]=st then break;\n\t if j=p+1 then begin\n\t inc(k);\n\t inc(p);\n\t a[p]:=st;\n\t search(st);\n\t end;\n\t search(st);\n\t delete(st,i,1);\n\t insert('bb',st,i);\n\t end;\n end;\nend;\nbegin\n readln(s);\n k:=1;\n search(s);\n writeln(k);\nend.", "problem_context": "Score : 1300 points\n\nProblem Statement\n\nThere is a string s consisting of a and b.\nSnuke can perform the following two kinds of operation any number of times in any order:\n\nChoose an occurrence of aa as a substring, and replace it with b.\n\nChoose an occurrence of bb as a substring, and replace it with a.\n\nHow many strings s can be obtained by this sequence of operations?\nFind the count modulo 10^9 + 7.\n\nConstraints\n\n1 \\leq |s| \\leq 10^5\n\ns consists of a and b.\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns\n\nOutput\n\nPrint the number of strings s that can be obtained, modulo 10^9 + 7.\n\nSample Input 1\n\naaaa\n\nSample Output 1\n\n6\n\nSix strings can be obtained:\n\naaaa\n\naab\n\naba\n\nbaa\n\nbb\n\na\n\nSample Input 2\n\naabb\n\nSample Output 2\n\n5\n\nFive strings can be obtained:\n\naabb\n\naaa\n\nbbb\n\nab\n\nba\n\nSample Input 3\n\nababababa\n\nSample Output 3\n\n1\n\nSnuke cannot perform any operation.\n\nSample Input 4\n\nbabbabaaba\n\nSample Output 4\n\n35", "sample_input": "aaaa\n"}, "reference_outputs": ["6\n"], "source_document_id": "p03258", "source_text": "Score : 1300 points\n\nProblem Statement\n\nThere is a string s consisting of a and b.\nSnuke can perform the following two kinds of operation any number of times in any order:\n\nChoose an occurrence of aa as a substring, and replace it with b.\n\nChoose an occurrence of bb as a substring, and replace it with a.\n\nHow many strings s can be obtained by this sequence of operations?\nFind the count modulo 10^9 + 7.\n\nConstraints\n\n1 \\leq |s| \\leq 10^5\n\ns consists of a and b.\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns\n\nOutput\n\nPrint the number of strings s that can be obtained, modulo 10^9 + 7.\n\nSample Input 1\n\naaaa\n\nSample Output 1\n\n6\n\nSix strings can be obtained:\n\naaaa\n\naab\n\naba\n\nbaa\n\nbb\n\na\n\nSample Input 2\n\naabb\n\nSample Output 2\n\n5\n\nFive strings can be obtained:\n\naabb\n\naaa\n\nbbb\n\nab\n\nba\n\nSample Input 3\n\nababababa\n\nSample Output 3\n\n1\n\nSnuke cannot perform any operation.\n\nSample Input 4\n\nbabbabaaba\n\nSample Output 4\n\n35", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 2160, "memory_kb": 920960}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s940865245", "group_id": "codeNet:p03263", "input_text": "type\n\tarr=array[1..4] of longint;\nvar\n\tf:array[0..200000] of arr;\n\tn,m,s,k,x,y,i,j:longint;\n\tt:array[0..600,0..600] of boolean;\nprocedure work(a,b,c,d:longint);\nbegin\n\ts:=s+abs(a-c)+abs(b-d);\n\tinc(k);\n\tf[k,1]:=a;\n\tf[k,2]:=b;\n\tf[k,3]:=c;\n\tf[k,4]:=d;\n\tt[a,b]:=false;\n\tt[c,d]:=false;\nend;\nprocedure print(x:arr);\nvar\n\ti:longint;\nbegin\n\tif x[1]0) and (y<>0) then\n\t\t\t\t\tbegin \n\t\t\t\t\t\twork(x,y,i,j);\n\t\t\t\t\t\tx:=0; y:=0;\n\t\t\t\t\tend\n\t\t\t\t\telse\n\t\t\t\t\tbegin\n\t\t\t\t\t\tx:=i; y:=j;\n\t\t\t\t\tend;\n\t\tend\n\t\telse \n\t\tbegin\n\t\t\tfor j:=m downto 1 do\n\t\t\t\tif t[i,j] then\n\t\t\t\t\tif (x<>0) and (y<>0) then\n\t\t\t\t\tbegin \n\t\t\t\t\t\twork(x,y,i,j);\n\t\t\t\t\t\tx:=0; y:=0;\n\t\t\t\t\tend\n\t\t\t\t\telse\n\t\t\t\t\tbegin\n\t\t\t\t\t\tx:=i; y:=j;\n\t\t\t\t\tend;\n\t\tend;\n\twriteln(s);\n\tfor i:=1 to k do print(f[i]);\nend.", "language": "Pascal", "metadata": {"date": 1536460799, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03263.html", "problem_id": "p03263", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03263/input.txt", "sample_output_relpath": "derived/input_output/data/p03263/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03263/Pascal/s940865245.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s940865245", "user_id": "u957998623"}, "prompt_components": {"gold_output": "3\n2 2 2 3\n1 1 1 2\n1 3 1 2\n", "input_to_evaluate": "type\n\tarr=array[1..4] of longint;\nvar\n\tf:array[0..200000] of arr;\n\tn,m,s,k,x,y,i,j:longint;\n\tt:array[0..600,0..600] of boolean;\nprocedure work(a,b,c,d:longint);\nbegin\n\ts:=s+abs(a-c)+abs(b-d);\n\tinc(k);\n\tf[k,1]:=a;\n\tf[k,2]:=b;\n\tf[k,3]:=c;\n\tf[k,4]:=d;\n\tt[a,b]:=false;\n\tt[c,d]:=false;\nend;\nprocedure print(x:arr);\nvar\n\ti:longint;\nbegin\n\tif x[1]0) and (y<>0) then\n\t\t\t\t\tbegin \n\t\t\t\t\t\twork(x,y,i,j);\n\t\t\t\t\t\tx:=0; y:=0;\n\t\t\t\t\tend\n\t\t\t\t\telse\n\t\t\t\t\tbegin\n\t\t\t\t\t\tx:=i; y:=j;\n\t\t\t\t\tend;\n\t\tend\n\t\telse \n\t\tbegin\n\t\t\tfor j:=m downto 1 do\n\t\t\t\tif t[i,j] then\n\t\t\t\t\tif (x<>0) and (y<>0) then\n\t\t\t\t\tbegin \n\t\t\t\t\t\twork(x,y,i,j);\n\t\t\t\t\t\tx:=0; y:=0;\n\t\t\t\t\tend\n\t\t\t\t\telse\n\t\t\t\t\tbegin\n\t\t\t\t\t\tx:=i; y:=j;\n\t\t\t\t\tend;\n\t\tend;\n\twriteln(s);\n\tfor i:=1 to k do print(f[i]);\nend.", "problem_context": "Score : 400 points\n\nProblem Statement\n\nThere is a grid of square cells with H horizontal rows and W vertical columns. The cell at the i-th row and the j-th column will be denoted as Cell (i, j).\n\nIn Cell (i, j), a_{ij} coins are placed.\n\nYou can perform the following operation any number of times:\n\nOperation: Choose a cell that was not chosen before and contains one or more coins, then move one of those coins to a vertically or horizontally adjacent cell.\n\nMaximize the number of cells containing an even number of coins.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq H, W \\leq 500\n\n0 \\leq a_{ij} \\leq 9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W\na_{11} a_{12} ... a_{1W}\na_{21} a_{22} ... a_{2W}\n:\na_{H1} a_{H2} ... a_{HW}\n\nOutput\n\nPrint a sequence of operations that maximizes the number of cells containing an even number of coins, in the following format:\n\nN\ny_1 x_1 y_1' x_1'\ny_2 x_2 y_2' x_2'\n:\ny_N x_N y_N' x_N'\n\nThat is, in the first line, print an integer N between 0 and H \\times W (inclusive), representing the number of operations.\n\nIn the (i+1)-th line (1 \\leq i \\leq N), print four integers y_i, x_i, y_i' and x_i' (1 \\leq y_i, y_i' \\leq H and 1 \\leq x_i, x_i' \\leq W), representing the i-th operation. These four integers represents the operation of moving one of the coins placed in Cell (y_i, x_i) to a vertically or horizontally adjacent cell, (y_i', x_i').\n\nNote that if the specified operation violates the specification in the problem statement or the output format is invalid, it will result in Wrong Answer.\n\nSample Input 1\n\n2 3\n1 2 3\n0 1 1\n\nSample Output 1\n\n3\n2 2 2 3\n1 1 1 2\n1 3 1 2\n\nEvery cell contains an even number of coins after the following sequence of operations:\n\nMove the coin in Cell (2, 2) to Cell (2, 3).\n\nMove the coin in Cell (1, 1) to Cell (1, 2).\n\nMove one of the coins in Cell (1, 3) to Cell (1, 2).\n\nSample Input 2\n\n3 2\n1 0\n2 1\n1 0\n\nSample Output 2\n\n3\n1 1 1 2\n1 2 2 2\n3 1 3 2\n\nSample Input 3\n\n1 5\n9 9 9 9 9\n\nSample Output 3\n\n2\n1 1 1 2\n1 3 1 4", "sample_input": "2 3\n1 2 3\n0 1 1\n"}, "reference_outputs": ["3\n2 2 2 3\n1 1 1 2\n1 3 1 2\n"], "source_document_id": "p03263", "source_text": "Score : 400 points\n\nProblem Statement\n\nThere is a grid of square cells with H horizontal rows and W vertical columns. The cell at the i-th row and the j-th column will be denoted as Cell (i, j).\n\nIn Cell (i, j), a_{ij} coins are placed.\n\nYou can perform the following operation any number of times:\n\nOperation: Choose a cell that was not chosen before and contains one or more coins, then move one of those coins to a vertically or horizontally adjacent cell.\n\nMaximize the number of cells containing an even number of coins.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq H, W \\leq 500\n\n0 \\leq a_{ij} \\leq 9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W\na_{11} a_{12} ... a_{1W}\na_{21} a_{22} ... a_{2W}\n:\na_{H1} a_{H2} ... a_{HW}\n\nOutput\n\nPrint a sequence of operations that maximizes the number of cells containing an even number of coins, in the following format:\n\nN\ny_1 x_1 y_1' x_1'\ny_2 x_2 y_2' x_2'\n:\ny_N x_N y_N' x_N'\n\nThat is, in the first line, print an integer N between 0 and H \\times W (inclusive), representing the number of operations.\n\nIn the (i+1)-th line (1 \\leq i \\leq N), print four integers y_i, x_i, y_i' and x_i' (1 \\leq y_i, y_i' \\leq H and 1 \\leq x_i, x_i' \\leq W), representing the i-th operation. These four integers represents the operation of moving one of the coins placed in Cell (y_i, x_i) to a vertically or horizontally adjacent cell, (y_i', x_i').\n\nNote that if the specified operation violates the specification in the problem statement or the output format is invalid, it will result in Wrong Answer.\n\nSample Input 1\n\n2 3\n1 2 3\n0 1 1\n\nSample Output 1\n\n3\n2 2 2 3\n1 1 1 2\n1 3 1 2\n\nEvery cell contains an even number of coins after the following sequence of operations:\n\nMove the coin in Cell (2, 2) to Cell (2, 3).\n\nMove the coin in Cell (1, 1) to Cell (1, 2).\n\nMove one of the coins in Cell (1, 3) to Cell (1, 2).\n\nSample Input 2\n\n3 2\n1 0\n2 1\n1 0\n\nSample Output 2\n\n3\n1 1 1 2\n1 2 2 2\n3 1 3 2\n\nSample Input 3\n\n1 5\n9 9 9 9 9\n\nSample Output 3\n\n2\n1 1 1 2\n1 3 1 4", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1290, "cpu_time_ms": 67, "memory_kb": 4224}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s668003894", "group_id": "codeNet:p03263", "input_text": "type\n\tarr=array[1..4] of longint;\nvar\n\tf:array[0..3000] of arr;\n\tn,m,s,x,y,i,j:longint;\n\tt:array[0..600,0..600] of boolean;\nprocedure work(a,b,c,d:longint);\nbegin\n\ts:=s+abs(a-c)+abs(b-d);\n\tf[s,1]:=a;\n\tf[s,2]:=b;\n\tf[s,3]:=c;\n\tf[s,4]:=d;\n\tt[a,b]:=false;\n\tt[c,d]:=false;\nend;\nprocedure print(x:arr);\nvar\n\ti:longint;\nbegin\n\tif x[1]0) and (y<>0) then\n\t\t\t\tbegin \n\t\t\t\t\twork(x,y,i,j);\n\t\t\t\t\tx:=0; y:=0;\n\t\t\t\tend\n\t\t\t\telse\n\t\t\t\tbegin\n\t\t\t\t\tx:=i; y:=j;\n\t\t\t\tend;\n\twriteln(s);\n\tfor i:=1 to s do print(f[i]);\nend.", "language": "Pascal", "metadata": {"date": 1536457720, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03263.html", "problem_id": "p03263", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03263/input.txt", "sample_output_relpath": "derived/input_output/data/p03263/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03263/Pascal/s668003894.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s668003894", "user_id": "u957998623"}, "prompt_components": {"gold_output": "3\n2 2 2 3\n1 1 1 2\n1 3 1 2\n", "input_to_evaluate": "type\n\tarr=array[1..4] of longint;\nvar\n\tf:array[0..3000] of arr;\n\tn,m,s,x,y,i,j:longint;\n\tt:array[0..600,0..600] of boolean;\nprocedure work(a,b,c,d:longint);\nbegin\n\ts:=s+abs(a-c)+abs(b-d);\n\tf[s,1]:=a;\n\tf[s,2]:=b;\n\tf[s,3]:=c;\n\tf[s,4]:=d;\n\tt[a,b]:=false;\n\tt[c,d]:=false;\nend;\nprocedure print(x:arr);\nvar\n\ti:longint;\nbegin\n\tif x[1]0) and (y<>0) then\n\t\t\t\tbegin \n\t\t\t\t\twork(x,y,i,j);\n\t\t\t\t\tx:=0; y:=0;\n\t\t\t\tend\n\t\t\t\telse\n\t\t\t\tbegin\n\t\t\t\t\tx:=i; y:=j;\n\t\t\t\tend;\n\twriteln(s);\n\tfor i:=1 to s do print(f[i]);\nend.", "problem_context": "Score : 400 points\n\nProblem Statement\n\nThere is a grid of square cells with H horizontal rows and W vertical columns. The cell at the i-th row and the j-th column will be denoted as Cell (i, j).\n\nIn Cell (i, j), a_{ij} coins are placed.\n\nYou can perform the following operation any number of times:\n\nOperation: Choose a cell that was not chosen before and contains one or more coins, then move one of those coins to a vertically or horizontally adjacent cell.\n\nMaximize the number of cells containing an even number of coins.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq H, W \\leq 500\n\n0 \\leq a_{ij} \\leq 9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W\na_{11} a_{12} ... a_{1W}\na_{21} a_{22} ... a_{2W}\n:\na_{H1} a_{H2} ... a_{HW}\n\nOutput\n\nPrint a sequence of operations that maximizes the number of cells containing an even number of coins, in the following format:\n\nN\ny_1 x_1 y_1' x_1'\ny_2 x_2 y_2' x_2'\n:\ny_N x_N y_N' x_N'\n\nThat is, in the first line, print an integer N between 0 and H \\times W (inclusive), representing the number of operations.\n\nIn the (i+1)-th line (1 \\leq i \\leq N), print four integers y_i, x_i, y_i' and x_i' (1 \\leq y_i, y_i' \\leq H and 1 \\leq x_i, x_i' \\leq W), representing the i-th operation. These four integers represents the operation of moving one of the coins placed in Cell (y_i, x_i) to a vertically or horizontally adjacent cell, (y_i', x_i').\n\nNote that if the specified operation violates the specification in the problem statement or the output format is invalid, it will result in Wrong Answer.\n\nSample Input 1\n\n2 3\n1 2 3\n0 1 1\n\nSample Output 1\n\n3\n2 2 2 3\n1 1 1 2\n1 3 1 2\n\nEvery cell contains an even number of coins after the following sequence of operations:\n\nMove the coin in Cell (2, 2) to Cell (2, 3).\n\nMove the coin in Cell (1, 1) to Cell (1, 2).\n\nMove one of the coins in Cell (1, 3) to Cell (1, 2).\n\nSample Input 2\n\n3 2\n1 0\n2 1\n1 0\n\nSample Output 2\n\n3\n1 1 1 2\n1 2 2 2\n3 1 3 2\n\nSample Input 3\n\n1 5\n9 9 9 9 9\n\nSample Output 3\n\n2\n1 1 1 2\n1 3 1 4", "sample_input": "2 3\n1 2 3\n0 1 1\n"}, "reference_outputs": ["3\n2 2 2 3\n1 1 1 2\n1 3 1 2\n"], "source_document_id": "p03263", "source_text": "Score : 400 points\n\nProblem Statement\n\nThere is a grid of square cells with H horizontal rows and W vertical columns. The cell at the i-th row and the j-th column will be denoted as Cell (i, j).\n\nIn Cell (i, j), a_{ij} coins are placed.\n\nYou can perform the following operation any number of times:\n\nOperation: Choose a cell that was not chosen before and contains one or more coins, then move one of those coins to a vertically or horizontally adjacent cell.\n\nMaximize the number of cells containing an even number of coins.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq H, W \\leq 500\n\n0 \\leq a_{ij} \\leq 9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W\na_{11} a_{12} ... a_{1W}\na_{21} a_{22} ... a_{2W}\n:\na_{H1} a_{H2} ... a_{HW}\n\nOutput\n\nPrint a sequence of operations that maximizes the number of cells containing an even number of coins, in the following format:\n\nN\ny_1 x_1 y_1' x_1'\ny_2 x_2 y_2' x_2'\n:\ny_N x_N y_N' x_N'\n\nThat is, in the first line, print an integer N between 0 and H \\times W (inclusive), representing the number of operations.\n\nIn the (i+1)-th line (1 \\leq i \\leq N), print four integers y_i, x_i, y_i' and x_i' (1 \\leq y_i, y_i' \\leq H and 1 \\leq x_i, x_i' \\leq W), representing the i-th operation. These four integers represents the operation of moving one of the coins placed in Cell (y_i, x_i) to a vertically or horizontally adjacent cell, (y_i', x_i').\n\nNote that if the specified operation violates the specification in the problem statement or the output format is invalid, it will result in Wrong Answer.\n\nSample Input 1\n\n2 3\n1 2 3\n0 1 1\n\nSample Output 1\n\n3\n2 2 2 3\n1 1 1 2\n1 3 1 2\n\nEvery cell contains an even number of coins after the following sequence of operations:\n\nMove the coin in Cell (2, 2) to Cell (2, 3).\n\nMove the coin in Cell (1, 1) to Cell (1, 2).\n\nMove one of the coins in Cell (1, 3) to Cell (1, 2).\n\nSample Input 2\n\n3 2\n1 0\n2 1\n1 0\n\nSample Output 2\n\n3\n1 1 1 2\n1 2 2 2\n3 1 3 2\n\nSample Input 3\n\n1 5\n9 9 9 9 9\n\nSample Output 3\n\n2\n1 1 1 2\n1 3 1 4", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1000, "cpu_time_ms": 816, "memory_kb": 294400}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s150691111", "group_id": "codeNet:p03263", "input_text": "type\n\tarr=array[1..4] of longint;\nvar\n\tf:array[0..3000] of arr;\n\tn,m,s,x,y,i,j:longint;\n\ta:array[0..600,0..600] of boolean;\nprocedure work(a,b,c,d:longint);\nbegin\n\tinc(s);\n\tf[s,1]:=a;\n\tf[s,2]:=b;\n\tf[s,3]:=c;\n\tf[s,4]:=d;\nend;\nprocedure print(x:arr);\nvar\n\ti:longint;\nbegin\n\tfor i:=x[1] to x[3]-1 do writeln(i,' ',x[2],' ',i+1,' ',x[2]);\n\tfor i:=x[2] to x[4]-1 do writeln(x[3],' ',i,' ',x[3],' ',i+1);\nend;\nbegin\n\tread(n,m);\n\tfor i:=1 to n do\n\t\tfor j:=1 to m do\n\t\tbegin\t\n\t\t\tread(x);\n\t\t\ta[i,j]:=(x mod 2=1);\n\t\tend;\n\ts:=0; x:=0; y:=0;\n\tfor i:=1 to n do\n\t\tfor j:=1 to m do\n\t\t\tif a[i,j] then\n\t\t\t\tif (x<>0) and (y<>0) then\n\t\t\t\tbegin \n\t\t\t\t\twork(x,y,i,j);\n\t\t\t\t\tx:=0; y:=0;\n\t\t\t\tend\n\t\t\t\telse\n\t\t\t\tbegin\n\t\t\t\t\tx:=i; y:=j;\n\t\t\t\tend;\n\twriteln(s);\n\tfor i:=1 to s do print(f[i]);\nend.", "language": "Pascal", "metadata": {"date": 1536456832, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03263.html", "problem_id": "p03263", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03263/input.txt", "sample_output_relpath": "derived/input_output/data/p03263/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03263/Pascal/s150691111.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s150691111", "user_id": "u957998623"}, "prompt_components": {"gold_output": "3\n2 2 2 3\n1 1 1 2\n1 3 1 2\n", "input_to_evaluate": "type\n\tarr=array[1..4] of longint;\nvar\n\tf:array[0..3000] of arr;\n\tn,m,s,x,y,i,j:longint;\n\ta:array[0..600,0..600] of boolean;\nprocedure work(a,b,c,d:longint);\nbegin\n\tinc(s);\n\tf[s,1]:=a;\n\tf[s,2]:=b;\n\tf[s,3]:=c;\n\tf[s,4]:=d;\nend;\nprocedure print(x:arr);\nvar\n\ti:longint;\nbegin\n\tfor i:=x[1] to x[3]-1 do writeln(i,' ',x[2],' ',i+1,' ',x[2]);\n\tfor i:=x[2] to x[4]-1 do writeln(x[3],' ',i,' ',x[3],' ',i+1);\nend;\nbegin\n\tread(n,m);\n\tfor i:=1 to n do\n\t\tfor j:=1 to m do\n\t\tbegin\t\n\t\t\tread(x);\n\t\t\ta[i,j]:=(x mod 2=1);\n\t\tend;\n\ts:=0; x:=0; y:=0;\n\tfor i:=1 to n do\n\t\tfor j:=1 to m do\n\t\t\tif a[i,j] then\n\t\t\t\tif (x<>0) and (y<>0) then\n\t\t\t\tbegin \n\t\t\t\t\twork(x,y,i,j);\n\t\t\t\t\tx:=0; y:=0;\n\t\t\t\tend\n\t\t\t\telse\n\t\t\t\tbegin\n\t\t\t\t\tx:=i; y:=j;\n\t\t\t\tend;\n\twriteln(s);\n\tfor i:=1 to s do print(f[i]);\nend.", "problem_context": "Score : 400 points\n\nProblem Statement\n\nThere is a grid of square cells with H horizontal rows and W vertical columns. The cell at the i-th row and the j-th column will be denoted as Cell (i, j).\n\nIn Cell (i, j), a_{ij} coins are placed.\n\nYou can perform the following operation any number of times:\n\nOperation: Choose a cell that was not chosen before and contains one or more coins, then move one of those coins to a vertically or horizontally adjacent cell.\n\nMaximize the number of cells containing an even number of coins.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq H, W \\leq 500\n\n0 \\leq a_{ij} \\leq 9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W\na_{11} a_{12} ... a_{1W}\na_{21} a_{22} ... a_{2W}\n:\na_{H1} a_{H2} ... a_{HW}\n\nOutput\n\nPrint a sequence of operations that maximizes the number of cells containing an even number of coins, in the following format:\n\nN\ny_1 x_1 y_1' x_1'\ny_2 x_2 y_2' x_2'\n:\ny_N x_N y_N' x_N'\n\nThat is, in the first line, print an integer N between 0 and H \\times W (inclusive), representing the number of operations.\n\nIn the (i+1)-th line (1 \\leq i \\leq N), print four integers y_i, x_i, y_i' and x_i' (1 \\leq y_i, y_i' \\leq H and 1 \\leq x_i, x_i' \\leq W), representing the i-th operation. These four integers represents the operation of moving one of the coins placed in Cell (y_i, x_i) to a vertically or horizontally adjacent cell, (y_i', x_i').\n\nNote that if the specified operation violates the specification in the problem statement or the output format is invalid, it will result in Wrong Answer.\n\nSample Input 1\n\n2 3\n1 2 3\n0 1 1\n\nSample Output 1\n\n3\n2 2 2 3\n1 1 1 2\n1 3 1 2\n\nEvery cell contains an even number of coins after the following sequence of operations:\n\nMove the coin in Cell (2, 2) to Cell (2, 3).\n\nMove the coin in Cell (1, 1) to Cell (1, 2).\n\nMove one of the coins in Cell (1, 3) to Cell (1, 2).\n\nSample Input 2\n\n3 2\n1 0\n2 1\n1 0\n\nSample Output 2\n\n3\n1 1 1 2\n1 2 2 2\n3 1 3 2\n\nSample Input 3\n\n1 5\n9 9 9 9 9\n\nSample Output 3\n\n2\n1 1 1 2\n1 3 1 4", "sample_input": "2 3\n1 2 3\n0 1 1\n"}, "reference_outputs": ["3\n2 2 2 3\n1 1 1 2\n1 3 1 2\n"], "source_document_id": "p03263", "source_text": "Score : 400 points\n\nProblem Statement\n\nThere is a grid of square cells with H horizontal rows and W vertical columns. The cell at the i-th row and the j-th column will be denoted as Cell (i, j).\n\nIn Cell (i, j), a_{ij} coins are placed.\n\nYou can perform the following operation any number of times:\n\nOperation: Choose a cell that was not chosen before and contains one or more coins, then move one of those coins to a vertically or horizontally adjacent cell.\n\nMaximize the number of cells containing an even number of coins.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq H, W \\leq 500\n\n0 \\leq a_{ij} \\leq 9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W\na_{11} a_{12} ... a_{1W}\na_{21} a_{22} ... a_{2W}\n:\na_{H1} a_{H2} ... a_{HW}\n\nOutput\n\nPrint a sequence of operations that maximizes the number of cells containing an even number of coins, in the following format:\n\nN\ny_1 x_1 y_1' x_1'\ny_2 x_2 y_2' x_2'\n:\ny_N x_N y_N' x_N'\n\nThat is, in the first line, print an integer N between 0 and H \\times W (inclusive), representing the number of operations.\n\nIn the (i+1)-th line (1 \\leq i \\leq N), print four integers y_i, x_i, y_i' and x_i' (1 \\leq y_i, y_i' \\leq H and 1 \\leq x_i, x_i' \\leq W), representing the i-th operation. These four integers represents the operation of moving one of the coins placed in Cell (y_i, x_i) to a vertically or horizontally adjacent cell, (y_i', x_i').\n\nNote that if the specified operation violates the specification in the problem statement or the output format is invalid, it will result in Wrong Answer.\n\nSample Input 1\n\n2 3\n1 2 3\n0 1 1\n\nSample Output 1\n\n3\n2 2 2 3\n1 1 1 2\n1 3 1 2\n\nEvery cell contains an even number of coins after the following sequence of operations:\n\nMove the coin in Cell (2, 2) to Cell (2, 3).\n\nMove the coin in Cell (1, 1) to Cell (1, 2).\n\nMove one of the coins in Cell (1, 3) to Cell (1, 2).\n\nSample Input 2\n\n3 2\n1 0\n2 1\n1 0\n\nSample Output 2\n\n3\n1 1 1 2\n1 2 2 2\n3 1 3 2\n\nSample Input 3\n\n1 5\n9 9 9 9 9\n\nSample Output 3\n\n2\n1 1 1 2\n1 3 1 4", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 764, "cpu_time_ms": 23, "memory_kb": 512}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s804218802", "group_id": "codeNet:p03265", "input_text": "uses\n\tSysUtils,\n\tClasses;\n\nprocedure MainProc;\n\tvar\n\t\ttext : string;\n\t\tstrlist : TStringList;\n\t\tx1, y1 : Integer;\n\t\tx2, y2 : Integer;\n\t\tx3, y3: Integer;\n\t\tx4, y4: Integer;\n\t\tedgeLenX: Integer;\n\t\tedgeLenY: Integer;\n\tbegin\n\tReadLn(text);\n\tstrlist := TStringList.Create;\n\ttry\n\t\tstrlist.Delimiter := ' ';\n\t\tstrlist.DelimitedText := text;\n\t\tx1 := StrToInt(strlist.Strings[0]);\n\t\ty1 := StrToInt(strlist.Strings[1]);\n\t\tx2 := StrToInt(strlist.Strings[2]);\n\t\ty2:= StrToInt(strlist.Strings[3]);\n\tfinally\n\t\t\tFreeAndNil(strlist);\n\t\t\tend;\n\tedgeLenX := x1 - x2;\n\tedgeLenY := Abs(y1 - y2);\n\t\n\tx3 := x2 - edgeLenY;\n\ty3 := y2 - edgeLenX;\n\tx4 := x1 - edgeLenY;\n\ty4 := y1 - edgeLenX;\n\ttext := IntTostr(x3) + ' ' + IntTostr(y3) + ' ' + IntTostr(x4) + ' ' + IntTostr(y4);\n\tWriteLn(text);\n\tend;\n\nbegin\nMainProc;\nend.\n", "language": "Pascal", "metadata": {"date": 1541291641, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03265.html", "problem_id": "p03265", "resource_group": "low_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/Pascal/s804218802.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s804218802", "user_id": "u397546896"}, "prompt_components": {"gold_output": "-1 1 -1 0\n", "input_to_evaluate": "uses\n\tSysUtils,\n\tClasses;\n\nprocedure MainProc;\n\tvar\n\t\ttext : string;\n\t\tstrlist : TStringList;\n\t\tx1, y1 : Integer;\n\t\tx2, y2 : Integer;\n\t\tx3, y3: Integer;\n\t\tx4, y4: Integer;\n\t\tedgeLenX: Integer;\n\t\tedgeLenY: Integer;\n\tbegin\n\tReadLn(text);\n\tstrlist := TStringList.Create;\n\ttry\n\t\tstrlist.Delimiter := ' ';\n\t\tstrlist.DelimitedText := text;\n\t\tx1 := StrToInt(strlist.Strings[0]);\n\t\ty1 := StrToInt(strlist.Strings[1]);\n\t\tx2 := StrToInt(strlist.Strings[2]);\n\t\ty2:= StrToInt(strlist.Strings[3]);\n\tfinally\n\t\t\tFreeAndNil(strlist);\n\t\t\tend;\n\tedgeLenX := x1 - x2;\n\tedgeLenY := Abs(y1 - y2);\n\t\n\tx3 := x2 - edgeLenY;\n\ty3 := y2 - edgeLenX;\n\tx4 := x1 - edgeLenY;\n\ty4 := y1 - edgeLenX;\n\ttext := IntTostr(x3) + ' ' + IntTostr(y3) + ' ' + IntTostr(x4) + ' ' + IntTostr(y4);\n\tWriteLn(text);\n\tend;\n\nbegin\nMainProc;\nend.\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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 1, "memory_kb": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s782225796", "group_id": "codeNet:p03266", "input_text": "var\n\ts:int64;\n\ta,n,k:longint;\nfunction ans(x:longint):int64;\nbegin\n\tif x mod k=0 then exit(n div k)\n\telse exit(n div k+1);\nend;\nbegin\n\tread(n,k);\n\ts:=0;\n\tfor a:=1 to n do\n\t\tif (a mod k=0) or (k mod 2=0) and (a mod k=k div 2) then\n\t\t\ts:=s+ans(a)*ans(k-a);\n\twriteln(s);\nend.", "language": "Pascal", "metadata": {"date": 1535855845, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03266.html", "problem_id": "p03266", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03266/input.txt", "sample_output_relpath": "derived/input_output/data/p03266/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03266/Pascal/s782225796.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s782225796", "user_id": "u957998623"}, "prompt_components": {"gold_output": "9\n", "input_to_evaluate": "var\n\ts:int64;\n\ta,n,k:longint;\nfunction ans(x:longint):int64;\nbegin\n\tif x mod k=0 then exit(n div k)\n\telse exit(n div k+1);\nend;\nbegin\n\tread(n,k);\n\ts:=0;\n\tfor a:=1 to n do\n\t\tif (a mod k=0) or (k mod 2=0) and (a mod k=k div 2) then\n\t\t\ts:=s+ans(a)*ans(k-a);\n\twriteln(s);\nend.", "problem_context": "Score : 300 points\n\nProblem Statement\n\nYou are given integers N and K. Find the number of triples (a,b,c) of positive integers not greater than N such that a+b,b+c and c+a are all multiples of K.\nThe order of a,b,c does matter, and some of them can be the same.\n\nConstraints\n\n1 \\leq N,K \\leq 2\\times 10^5\n\nN and K are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\n\nOutput\n\nPrint the number of triples (a,b,c) of positive integers not greater than N such that a+b,b+c and c+a are all multiples of K.\n\nSample Input 1\n\n3 2\n\nSample Output 1\n\n9\n\n(1,1,1),(1,1,3),(1,3,1),(1,3,3),(2,2,2),(3,1,1),(3,1,3),(3,3,1) and (3,3,3) satisfy the condition.\n\nSample Input 2\n\n5 3\n\nSample Output 2\n\n1\n\nSample Input 3\n\n31415 9265\n\nSample Output 3\n\n27\n\nSample Input 4\n\n35897 932\n\nSample Output 4\n\n114191", "sample_input": "3 2\n"}, "reference_outputs": ["9\n"], "source_document_id": "p03266", "source_text": "Score : 300 points\n\nProblem Statement\n\nYou are given integers N and K. Find the number of triples (a,b,c) of positive integers not greater than N such that a+b,b+c and c+a are all multiples of K.\nThe order of a,b,c does matter, and some of them can be the same.\n\nConstraints\n\n1 \\leq N,K \\leq 2\\times 10^5\n\nN and K are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\n\nOutput\n\nPrint the number of triples (a,b,c) of positive integers not greater than N such that a+b,b+c and c+a are all multiples of K.\n\nSample Input 1\n\n3 2\n\nSample Output 1\n\n9\n\n(1,1,1),(1,1,3),(1,3,1),(1,3,3),(2,2,2),(3,1,1),(3,1,3),(3,3,1) and (3,3,3) satisfy the condition.\n\nSample Input 2\n\n5 3\n\nSample Output 2\n\n1\n\nSample Input 3\n\n31415 9265\n\nSample Output 3\n\n27\n\nSample Input 4\n\n35897 932\n\nSample Output 4\n\n114191", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 11, "memory_kb": 128}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s236788467", "group_id": "codeNet:p03266", "input_text": "var\n\ta,b,c,t:longint;\n\tn,k,s:int64;\nfunction ans(x:longint):longint;\nbegin\n\tif x mod k=0 then exit(n div k)\n\telse exit(n div k+1);\nend;\nbegin\n\tread(n,k);\n\ts:=0;\n\tfor a:=1 to n do\n\t\ts:=s+ans(a)*ans(a);\n\twriteln(s);\nend.", "language": "Pascal", "metadata": {"date": 1535853164, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03266.html", "problem_id": "p03266", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03266/input.txt", "sample_output_relpath": "derived/input_output/data/p03266/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03266/Pascal/s236788467.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s236788467", "user_id": "u957998623"}, "prompt_components": {"gold_output": "9\n", "input_to_evaluate": "var\n\ta,b,c,t:longint;\n\tn,k,s:int64;\nfunction ans(x:longint):longint;\nbegin\n\tif x mod k=0 then exit(n div k)\n\telse exit(n div k+1);\nend;\nbegin\n\tread(n,k);\n\ts:=0;\n\tfor a:=1 to n do\n\t\ts:=s+ans(a)*ans(a);\n\twriteln(s);\nend.", "problem_context": "Score : 300 points\n\nProblem Statement\n\nYou are given integers N and K. Find the number of triples (a,b,c) of positive integers not greater than N such that a+b,b+c and c+a are all multiples of K.\nThe order of a,b,c does matter, and some of them can be the same.\n\nConstraints\n\n1 \\leq N,K \\leq 2\\times 10^5\n\nN and K are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\n\nOutput\n\nPrint the number of triples (a,b,c) of positive integers not greater than N such that a+b,b+c and c+a are all multiples of K.\n\nSample Input 1\n\n3 2\n\nSample Output 1\n\n9\n\n(1,1,1),(1,1,3),(1,3,1),(1,3,3),(2,2,2),(3,1,1),(3,1,3),(3,3,1) and (3,3,3) satisfy the condition.\n\nSample Input 2\n\n5 3\n\nSample Output 2\n\n1\n\nSample Input 3\n\n31415 9265\n\nSample Output 3\n\n27\n\nSample Input 4\n\n35897 932\n\nSample Output 4\n\n114191", "sample_input": "3 2\n"}, "reference_outputs": ["9\n"], "source_document_id": "p03266", "source_text": "Score : 300 points\n\nProblem Statement\n\nYou are given integers N and K. Find the number of triples (a,b,c) of positive integers not greater than N such that a+b,b+c and c+a are all multiples of K.\nThe order of a,b,c does matter, and some of them can be the same.\n\nConstraints\n\n1 \\leq N,K \\leq 2\\times 10^5\n\nN and K are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\n\nOutput\n\nPrint the number of triples (a,b,c) of positive integers not greater than N such that a+b,b+c and c+a are all multiples of K.\n\nSample Input 1\n\n3 2\n\nSample Output 1\n\n9\n\n(1,1,1),(1,1,3),(1,3,1),(1,3,3),(2,2,2),(3,1,1),(3,1,3),(3,3,1) and (3,3,3) satisfy the condition.\n\nSample Input 2\n\n5 3\n\nSample Output 2\n\n1\n\nSample Input 3\n\n31415 9265\n\nSample Output 3\n\n27\n\nSample Input 4\n\n35897 932\n\nSample Output 4\n\n114191", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 218, "cpu_time_ms": 9, "memory_kb": 128}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s171281606", "group_id": "codeNet:p03268", "input_text": "var\n\tn,k,s,a:int64;\nbegin\n\tread(n,k);\n\ta:=n div k;\n\tinc(s,a*a*a);\n\tif k mod 2=0 then begin\n\t\ta:=(n-k div 2)div k+1;\n\t\tinc(s,a*a*a);\n\tend;\n\twrite(s);\nend.\n", "language": "Pascal", "metadata": {"date": 1535858674, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03268.html", "problem_id": "p03268", "resource_group": "low_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/Pascal/s171281606.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s171281606", "user_id": "u657913472"}, "prompt_components": {"gold_output": "9\n", "input_to_evaluate": "var\n\tn,k,s,a:int64;\nbegin\n\tread(n,k);\n\ta:=n div k;\n\tinc(s,a*a*a);\n\tif k mod 2=0 then begin\n\t\ta:=(n-k div 2)div k+1;\n\t\tinc(s,a*a*a);\n\tend;\n\twrite(s);\nend.\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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 1, "memory_kb": 128}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s675966438", "group_id": "codeNet:p03268", "input_text": "VAR I,J,T:qword;\n N,K,COUNT:qword;\n\nbegin\n readln(n,k);\n count:=0;\n for i:=1 to n do \n for j:=1 to n do \n for t:=1 to n do \n IF ((i+j) mod k=0) and ((t+j) mod k=0) and ((i+t) mod k=0) then inc(count); \n WRITELN(count);\nend.", "language": "Pascal", "metadata": {"date": 1535853629, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03268.html", "problem_id": "p03268", "resource_group": "low_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/Pascal/s675966438.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s675966438", "user_id": "u060797441"}, "prompt_components": {"gold_output": "9\n", "input_to_evaluate": "VAR I,J,T:qword;\n N,K,COUNT:qword;\n\nbegin\n readln(n,k);\n count:=0;\n for i:=1 to n do \n for j:=1 to n do \n for t:=1 to n do \n IF ((i+j) mod k=0) and ((t+j) mod k=0) and ((i+t) mod k=0) then inc(count); \n WRITELN(count);\nend.", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 2103, "memory_kb": 128}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s754196478", "group_id": "codeNet:p03268", "input_text": "VAR I,J,T:LONGINT;\n N,K,COUNT:LONGINT;\n\nbegin\n readln(n,k);\n count:=0;\n for i:=1 to n do \n for j:=1 to n do \n for t:=1 to n do \n IF ((i+j) mod k=0) and ((t+j) mod k=0) and ((i+t) mod k=0) then inc(count); \n WRITELN(count);\nend.", "language": "Pascal", "metadata": {"date": 1535853477, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03268.html", "problem_id": "p03268", "resource_group": "low_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/Pascal/s754196478.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s754196478", "user_id": "u060797441"}, "prompt_components": {"gold_output": "9\n", "input_to_evaluate": "VAR I,J,T:LONGINT;\n N,K,COUNT:LONGINT;\n\nbegin\n readln(n,k);\n count:=0;\n for i:=1 to n do \n for j:=1 to n do \n for t:=1 to n do \n IF ((i+j) mod k=0) and ((t+j) mod k=0) and ((i+t) mod k=0) then inc(count); \n WRITELN(count);\nend.", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 237, "cpu_time_ms": 2103, "memory_kb": 128}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s931101679", "group_id": "codeNet:p03269", "input_text": "var\n\tu,L,i,a,c:Longint;\nbegin\n\tread(L);\n\tu:=L;\n\twhile u>0 do begin\n\t\tinc(c);\n\t\tinc(a,u mod 2);\n\t\tu:=u div 2;\n\tend;\n\twriteln(c);writeln(c*2-3+a);\n\ta:=1;\n\tu:=L;\n\tfor i:=1 to c-1 do begin\n\t\twriteln(i);\n\t\twriteln(i+1);\n\t\twriteln(0);\n\t\twriteln(i);\n\t\twriteln(i+1);\n\t\twriteln(a);\n\t\tif L mod 2>0 then begin\n\t\t\twriteln(i);\n\t\t\twriteln(c);\n\t\t\tu:=u-a;\n\t\t\twriteln(u);\n\t\tend;\n\t\tL:=L div 2;\n\t\ta:=a*2;\n\tend;\nend.\n", "language": "Pascal", "metadata": {"date": 1535862914, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03269.html", "problem_id": "p03269", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03269/input.txt", "sample_output_relpath": "derived/input_output/data/p03269/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03269/Pascal/s931101679.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s931101679", "user_id": "u657913472"}, "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": "var\n\tu,L,i,a,c:Longint;\nbegin\n\tread(L);\n\tu:=L;\n\twhile u>0 do begin\n\t\tinc(c);\n\t\tinc(a,u mod 2);\n\t\tu:=u div 2;\n\tend;\n\twriteln(c);writeln(c*2-3+a);\n\ta:=1;\n\tu:=L;\n\tfor i:=1 to c-1 do begin\n\t\twriteln(i);\n\t\twriteln(i+1);\n\t\twriteln(0);\n\t\twriteln(i);\n\t\twriteln(i+1);\n\t\twriteln(a);\n\t\tif L mod 2>0 then begin\n\t\t\twriteln(i);\n\t\t\twriteln(c);\n\t\t\tu:=u-a;\n\t\t\twriteln(u);\n\t\tend;\n\t\tL:=L div 2;\n\t\ta:=a*2;\n\tend;\nend.\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": "p03269", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 397, "cpu_time_ms": 2, "memory_kb": 128}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s182230708", "group_id": "codeNet:p03272", "input_text": "{ Free PascalのHello, world.(日本語版) }\n \nprogram Hello;\n \n{$MODE OBJFPC}\n{$CODEPAGE UTF8}\n{$LONGSTRINGS ON}\n \nuses\n SysUtils,\n Classes;\n\nprocedure MainFunc;\n\tprocedure GetInput(var Length : Integer; var Num : Integer);\n\t\tvar\n\t\t\tstr : string;\n\t\t\tstrlist : TStringList;\n\t\tbegin\n\t\t\tReadln(str);\n\t\t\tstrlist := TStringList.Create;\n\t\t\ttry\n\t\t\t\tstrlist.Delimiter := ' ';\n\t\t\t\tstrlist.DelimitedText := str;\n\t\t\t\tLength := StrToInt(strlist.Strings[0]);\n\t\t\t\tNum := StrToInt(strlist.Strings[1]);\n\t\t\tfinally\n\t\t\t\tFreeAndNil(strlist);\n\t\t\t\tend;\n\t\tend;\n\tvar\n\t\ttrainLength : Integer;\n\t\ttrainNum : Integer; \n\tbegin\n\t\tGetInput(trainLength, trainNum);\n\t\tWriteLn(trainLength - trainNum + 1);\n\tend;\n\t\nbegin\n\tMainFunc;\nend.\n", "language": "Pascal", "metadata": {"date": 1535506054, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03272.html", "problem_id": "p03272", "resource_group": "low_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/Pascal/s182230708.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s182230708", "user_id": "u397546896"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "{ Free PascalのHello, world.(日本語版) }\n \nprogram Hello;\n \n{$MODE OBJFPC}\n{$CODEPAGE UTF8}\n{$LONGSTRINGS ON}\n \nuses\n SysUtils,\n Classes;\n\nprocedure MainFunc;\n\tprocedure GetInput(var Length : Integer; var Num : Integer);\n\t\tvar\n\t\t\tstr : string;\n\t\t\tstrlist : TStringList;\n\t\tbegin\n\t\t\tReadln(str);\n\t\t\tstrlist := TStringList.Create;\n\t\t\ttry\n\t\t\t\tstrlist.Delimiter := ' ';\n\t\t\t\tstrlist.DelimitedText := str;\n\t\t\t\tLength := StrToInt(strlist.Strings[0]);\n\t\t\t\tNum := StrToInt(strlist.Strings[1]);\n\t\t\tfinally\n\t\t\t\tFreeAndNil(strlist);\n\t\t\t\tend;\n\t\tend;\n\tvar\n\t\ttrainLength : Integer;\n\t\ttrainNum : Integer; \n\tbegin\n\t\tGetInput(trainLength, trainNum);\n\t\tWriteLn(trainLength - trainNum + 1);\n\tend;\n\t\nbegin\n\tMainFunc;\nend.\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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 707, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s796428881", "group_id": "codeNet:p03273", "input_text": "uses\n SysUtils,\n Classes;\n \n function WhiteCheckFunc(const str : string) : Boolean;\n\tvar \n\t\ti : Integer;\n\tbegin\n\tResult := True;\n\tfor i := 0 to Length(str) - 1 do\n\t\tbegin\n\t\tif str[i] = '#' then\n\t\t\tResult := False;\n\t\tend;\n\tend;\n procedure subProc(const h : Integer; const w : Integer);\n\tvar\n\t\ti, j : Integer;\n\t\tpost_height : Integer;\n\t\tstr : string;\n\t\tline : string;\n\tbegin\n\tline := '';\n\tpost_height := h;\n\tfor i := 0 to h - 1 do\n\t\tbegin\n\t\tReadLn(str);\n\t\tif WhiteCheckFunc(str) then\n\t\t\tpost_height := post_height - 1\n\t\telse\n\t\t\tline := line + str;\n\t\tend;\n\tfor i := 1 to w do\n\t\tbegin\n\t\tstr := '';\n\t\tfor j := 0 to post_height - 1 do\n\t\t\tstr := str + line[i + j * w];\n\t\tif WhiteCheckFunc(str) then\n\t\t\tbegin\n\t\t\t\tfor j := 0 to post_height - 1 do\n\t\t\t\t\tline[i + j * w] := '_';\n\t\t\tend;\n\t\tend;\n\tfor i := 0 to post_height - 1 do\n\t\tbegin\n\t\tfor j := 1 to w do\n\t\t\tif not (line[j + i * w] = '_') then\n\t\t\t\tWrite(line[j + i * w]);\n\t\tWrite(#13#10);\n\t\tend;\n\tend;\n \nprocedure MainProc;\n\tvar\n\t\ttext : string;\n\t\tstrlist : TStringList;\n\t\theightNum : Integer;\n\t\twidthNum : Integer;\n\tbegin\n\tReadLn(text);\n\tstrlist := TStringList.Create;\n\ttry\n\t\tstrlist.Delimiter := ' ';\n\t\tstrlist.DelimitedText := text;\n\t\theightNum := StrToInt(strlist.Strings[0]);\n\t\twidthNum := StrToInt(strlist.Strings[1]);\n\t\tfinally\n\t\t\tFreeAndNil(strlist);\n\t\t\tend;\n\t\tsubProc(heightNum, widthNum);\n\tend;\n \nbegin\nMainProc;\nend.\n", "language": "Pascal", "metadata": {"date": 1538620827, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03273.html", "problem_id": "p03273", "resource_group": "low_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/Pascal/s796428881.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s796428881", "user_id": "u397546896"}, "prompt_components": {"gold_output": "###\n###\n.##\n", "input_to_evaluate": "uses\n SysUtils,\n Classes;\n \n function WhiteCheckFunc(const str : string) : Boolean;\n\tvar \n\t\ti : Integer;\n\tbegin\n\tResult := True;\n\tfor i := 0 to Length(str) - 1 do\n\t\tbegin\n\t\tif str[i] = '#' then\n\t\t\tResult := False;\n\t\tend;\n\tend;\n procedure subProc(const h : Integer; const w : Integer);\n\tvar\n\t\ti, j : Integer;\n\t\tpost_height : Integer;\n\t\tstr : string;\n\t\tline : string;\n\tbegin\n\tline := '';\n\tpost_height := h;\n\tfor i := 0 to h - 1 do\n\t\tbegin\n\t\tReadLn(str);\n\t\tif WhiteCheckFunc(str) then\n\t\t\tpost_height := post_height - 1\n\t\telse\n\t\t\tline := line + str;\n\t\tend;\n\tfor i := 1 to w do\n\t\tbegin\n\t\tstr := '';\n\t\tfor j := 0 to post_height - 1 do\n\t\t\tstr := str + line[i + j * w];\n\t\tif WhiteCheckFunc(str) then\n\t\t\tbegin\n\t\t\t\tfor j := 0 to post_height - 1 do\n\t\t\t\t\tline[i + j * w] := '_';\n\t\t\tend;\n\t\tend;\n\tfor i := 0 to post_height - 1 do\n\t\tbegin\n\t\tfor j := 1 to w do\n\t\t\tif not (line[j + i * w] = '_') then\n\t\t\t\tWrite(line[j + i * w]);\n\t\tWrite(#13#10);\n\t\tend;\n\tend;\n \nprocedure MainProc;\n\tvar\n\t\ttext : string;\n\t\tstrlist : TStringList;\n\t\theightNum : Integer;\n\t\twidthNum : Integer;\n\tbegin\n\tReadLn(text);\n\tstrlist := TStringList.Create;\n\ttry\n\t\tstrlist.Delimiter := ' ';\n\t\tstrlist.DelimitedText := text;\n\t\theightNum := StrToInt(strlist.Strings[0]);\n\t\twidthNum := StrToInt(strlist.Strings[1]);\n\t\tfinally\n\t\t\tFreeAndNil(strlist);\n\t\t\tend;\n\t\tsubProc(heightNum, widthNum);\n\tend;\n \nbegin\nMainProc;\nend.\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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1373, "cpu_time_ms": 1, "memory_kb": 288}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s458772265", "group_id": "codeNet:p03273", "input_text": "var\n\ts:array[1..100]of String[100];\n\th,w,i,j,k:Longint;\n\tf:Boolean;\n\tb:array[1..100]of Boolean;\nbegin\n\treadln(h,w);\n\tfor i:=1 to h do readln(s[i]);\n\tfor j:=1 to w do begin\n\t\tb[j]:=false;\n\t\tfor i:=1 to h do\n\t\t\tif s[i][j]='#' then begin\n\t\t\t\tb[j]:=true;\n\t\t\t\tbreak;\n\t\t\tend;\n\tend;\n\tfor i:=1 to h do\n\t\tfor j:=1 to w do\n\t\t\tif s[i][j]='#' then begin\n\t\t\t\tfor k:=1 to w do\n\t\t\t\t\tif b[k] then write(s[i][k]);\n\t\t\t\twriteln('');\n break;\n end;\nend.\n", "language": "Pascal", "metadata": {"date": 1535252348, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03273.html", "problem_id": "p03273", "resource_group": "low_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/Pascal/s458772265.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s458772265", "user_id": "u657913472"}, "prompt_components": {"gold_output": "###\n###\n.##\n", "input_to_evaluate": "var\n\ts:array[1..100]of String[100];\n\th,w,i,j,k:Longint;\n\tf:Boolean;\n\tb:array[1..100]of Boolean;\nbegin\n\treadln(h,w);\n\tfor i:=1 to h do readln(s[i]);\n\tfor j:=1 to w do begin\n\t\tb[j]:=false;\n\t\tfor i:=1 to h do\n\t\t\tif s[i][j]='#' then begin\n\t\t\t\tb[j]:=true;\n\t\t\t\tbreak;\n\t\t\tend;\n\tend;\n\tfor i:=1 to h do\n\t\tfor j:=1 to w do\n\t\t\tif s[i][j]='#' then begin\n\t\t\t\tfor k:=1 to w do\n\t\t\t\t\tif b[k] then write(s[i][k]);\n\t\t\t\twriteln('');\n break;\n end;\nend.\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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 1, "memory_kb": 128}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s026630341", "group_id": "codeNet:p03273", "input_text": "var\n\ts:array[1..100]of String[100];\n\th,w,i,j:Longint;\n\tf:Boolean;\n\tb:array[1..100]of Boolean;\nbegin\n\treadln(h,w);\n\tfor i:=1 to h do readln(s[i]);\n\tfor j:=1 to w do begin\n\t\tb[j]:=false;\n\t\tfor i:=1 to h do\n\t\t\tif s[i][j]='#' then begin\n\t\t\t\tb[j]:=true;\n\t\t\t\tbreak;\n\t\t\tend;\n\tend;\n\tfor i:=1 to h do begin\n\t\tf:=false;\n\t\tfor j:=1 to w do\n\t\t\tif s[i][j]='#' then begin\n\t\t\t\tf:=true;\n\t\t\t\tbreak;\n\t\t\tend;\n\t\tif f then begin\n\t\t\tfor j:=1 to w do\n\t\t\t\tif b[j] then write(s[i][j]);\n\t\t\twriteln('');\n\t\tend;\n\tend;\nend.\n", "language": "Pascal", "metadata": {"date": 1535252089, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03273.html", "problem_id": "p03273", "resource_group": "low_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/Pascal/s026630341.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s026630341", "user_id": "u657913472"}, "prompt_components": {"gold_output": "###\n###\n.##\n", "input_to_evaluate": "var\n\ts:array[1..100]of String[100];\n\th,w,i,j:Longint;\n\tf:Boolean;\n\tb:array[1..100]of Boolean;\nbegin\n\treadln(h,w);\n\tfor i:=1 to h do readln(s[i]);\n\tfor j:=1 to w do begin\n\t\tb[j]:=false;\n\t\tfor i:=1 to h do\n\t\t\tif s[i][j]='#' then begin\n\t\t\t\tb[j]:=true;\n\t\t\t\tbreak;\n\t\t\tend;\n\tend;\n\tfor i:=1 to h do begin\n\t\tf:=false;\n\t\tfor j:=1 to w do\n\t\t\tif s[i][j]='#' then begin\n\t\t\t\tf:=true;\n\t\t\t\tbreak;\n\t\t\tend;\n\t\tif f then begin\n\t\t\tfor j:=1 to w do\n\t\t\t\tif b[j] then write(s[i][j]);\n\t\t\twriteln('');\n\t\tend;\n\tend;\nend.\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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 1, "memory_kb": 128}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s467015237", "group_id": "codeNet:p03273", "input_text": "var\n\ts:array[1..100]of String[100];\n\th,w,i,j:Longint;\n\ta,b:array[1..100]of Boolean;\nbegin\n\treadln(h,w);\n\tfor i:=1 to h do readln(s[i]);\n\tfor i:=1 to h do begin\n\t\ta[i]:=false;\n\t\tfor j:=1 to w do\n\t\t\tif s[i][j]='#' then begin\n\t\t\t\ta[i]:=true;\n\t\t\t\tbreak;\n\t\t\tend;\n\tend;\n\tfor j:=1 to w do begin\n\t\tb[j]:=false;\n\t\tfor i:=1 to h do\n\t\t\tif s[i][j]='#' then begin\n\t\t\t\tb[j]:=true;\n\t\t\t\tbreak;\n\t\t\tend;\n\tend;\n\tfor i:=1 to h do\n\t\tif a[i] then begin\n\t\t\tfor j:=1 to w do\n\t\t\t\tif b[j] then write(s[i][j]);\n\t\t\twriteln('');\n\t\tend;\nend.\n", "language": "Pascal", "metadata": {"date": 1535251949, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03273.html", "problem_id": "p03273", "resource_group": "low_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/Pascal/s467015237.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s467015237", "user_id": "u657913472"}, "prompt_components": {"gold_output": "###\n###\n.##\n", "input_to_evaluate": "var\n\ts:array[1..100]of String[100];\n\th,w,i,j:Longint;\n\ta,b:array[1..100]of Boolean;\nbegin\n\treadln(h,w);\n\tfor i:=1 to h do readln(s[i]);\n\tfor i:=1 to h do begin\n\t\ta[i]:=false;\n\t\tfor j:=1 to w do\n\t\t\tif s[i][j]='#' then begin\n\t\t\t\ta[i]:=true;\n\t\t\t\tbreak;\n\t\t\tend;\n\tend;\n\tfor j:=1 to w do begin\n\t\tb[j]:=false;\n\t\tfor i:=1 to h do\n\t\t\tif s[i][j]='#' then begin\n\t\t\t\tb[j]:=true;\n\t\t\t\tbreak;\n\t\t\tend;\n\tend;\n\tfor i:=1 to h do\n\t\tif a[i] then begin\n\t\t\tfor j:=1 to w do\n\t\t\t\tif b[j] then write(s[i][j]);\n\t\t\twriteln('');\n\t\tend;\nend.\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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 1, "memory_kb": 128}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s549216083", "group_id": "codeNet:p03273", "input_text": "var\n i,j,p,q:longint;\n s,st:array[1..100,1..100]of char;\nfunction check(a:longint):boolean;\nvar\n k,l,y:longint;\nbegin\n check:=false;\n for l:=1 to p do\n for k:=1 to q do if st[l,k]='#' then inc(y);\n if (y>a) then exit;\n check:=true;\nend;\nbegin\n readln(p,q);\n for i:=1 to p do begin\n for j:=1 to q do read(s[i,j]);\n readln;\n end;\n st:=s;\n for i:=1 to p do\n begin\n if check(q) then break;\n s[i,q+1]:=' ';\n\t for j:=1 to q do if (s[i,j]<>s[i,j+1]) then break;\n\t if j=q then for j:=1 to q do st[i,j]:=' ';\n end;\n for i:=1 to q do\n begin\n if check(p) then break;\n s[p+1,i]:=' ';\n\t for j:=1 to p do if (s[j,i]<>s[j+1,i]) then break;\n\t if j=p then for j:=1 to p do st[j,i]:=' ';\n end;\n for i:=1 to p do\n begin\n\tfor j:=1 to q+1 do if st[i,j]<>' ' then break;\n\tif j=q+1 then continue;\n for j:=1 to q do if st[i,j]<>' ' then write(st[i,j]);\n\twriteln;\n end;\nend.", "language": "Pascal", "metadata": {"date": 1535248017, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03273.html", "problem_id": "p03273", "resource_group": "low_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/Pascal/s549216083.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s549216083", "user_id": "u223928734"}, "prompt_components": {"gold_output": "###\n###\n.##\n", "input_to_evaluate": "var\n i,j,p,q:longint;\n s,st:array[1..100,1..100]of char;\nfunction check(a:longint):boolean;\nvar\n k,l,y:longint;\nbegin\n check:=false;\n for l:=1 to p do\n for k:=1 to q do if st[l,k]='#' then inc(y);\n if (y>a) then exit;\n check:=true;\nend;\nbegin\n readln(p,q);\n for i:=1 to p do begin\n for j:=1 to q do read(s[i,j]);\n readln;\n end;\n st:=s;\n for i:=1 to p do\n begin\n if check(q) then break;\n s[i,q+1]:=' ';\n\t for j:=1 to q do if (s[i,j]<>s[i,j+1]) then break;\n\t if j=q then for j:=1 to q do st[i,j]:=' ';\n end;\n for i:=1 to q do\n begin\n if check(p) then break;\n s[p+1,i]:=' ';\n\t for j:=1 to p do if (s[j,i]<>s[j+1,i]) then break;\n\t if j=p then for j:=1 to p do st[j,i]:=' ';\n end;\n for i:=1 to p do\n begin\n\tfor j:=1 to q+1 do if st[i,j]<>' ' then break;\n\tif j=q+1 then continue;\n for j:=1 to q do if st[i,j]<>' ' then write(st[i,j]);\n\twriteln;\n end;\nend.", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 891, "cpu_time_ms": 3, "memory_kb": 128}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s575239224", "group_id": "codeNet:p03274", "input_text": "var n,k,i,aa:longint;\nmin,count:int64;\na:array[0..100010]of longint;\nfunction m(x,y:int64):int64;\nbegin \n\tif x=k then min:=m(min,a[aa-k+1]);\n\tif n-aa>=k then min:=m(min,a[aa+k]);\n\tfor i:=0 to m(n-aa,k-aa) do \n\t\tif (aa>=k-i) then\n\t\tbegin \n\t\t\tif a[aa-k+i+1]>a[aa+i] then count:=a[aa-k+i+1]+2*a[aa+i]\n\t\t\t\telse count:=2*a[aa-k+i+1]+a[aa+i];\n\t\t\tmin:=m(min,count);\n\t\tend;\n\twrite(min);\nend.", "language": "Pascal", "metadata": {"date": 1535388361, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03274.html", "problem_id": "p03274", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03274/input.txt", "sample_output_relpath": "derived/input_output/data/p03274/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03274/Pascal/s575239224.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s575239224", "user_id": "u914335902"}, "prompt_components": {"gold_output": "40\n", "input_to_evaluate": "var n,k,i,aa:longint;\nmin,count:int64;\na:array[0..100010]of longint;\nfunction m(x,y:int64):int64;\nbegin \n\tif x=k then min:=m(min,a[aa-k+1]);\n\tif n-aa>=k then min:=m(min,a[aa+k]);\n\tfor i:=0 to m(n-aa,k-aa) do \n\t\tif (aa>=k-i) then\n\t\tbegin \n\t\t\tif a[aa-k+i+1]>a[aa+i] then count:=a[aa-k+i+1]+2*a[aa+i]\n\t\t\t\telse count:=2*a[aa-k+i+1]+a[aa+i];\n\t\t\tmin:=m(min,count);\n\t\tend;\n\twrite(min);\nend.", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere are N candles placed on a number line.\nThe i-th candle from the left is placed on coordinate x_i.\nHere, x_1 < x_2 < ... < x_N holds.\n\nInitially, no candles are burning.\nSnuke decides to light K of the N candles.\n\nNow, he is at coordinate 0.\nHe can move left and right along the line with speed 1.\nHe can also light a candle when he is at the same position as the candle, in negligible time.\n\nFind the minimum time required to light K candles.\n\nConstraints\n\n1 \\leq N \\leq 10^5\n\n1 \\leq K \\leq N\n\nx_i is an integer.\n\n|x_i| \\leq 10^8\n\nx_1 < x_2 < ... < x_N\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nx_1 x_2 ... x_N\n\nOutput\n\nPrint the minimum time required to light K candles.\n\nSample Input 1\n\n5 3\n-30 -10 10 20 50\n\nSample Output 1\n\n40\n\nHe should move and light candles as follows:\n\nMove from coordinate 0 to -10.\n\nLight the second candle from the left.\n\nMove from coordinate -10 to 10.\n\nLight the third candle from the left.\n\nMove from coordinate 10 to 20.\n\nLight the fourth candle from the left.\n\nSample Input 2\n\n3 2\n10 20 30\n\nSample Output 2\n\n20\n\nSample Input 3\n\n1 1\n0\n\nSample Output 3\n\n0\n\nThere may be a candle placed at coordinate 0.\n\nSample Input 4\n\n8 5\n-9 -7 -4 -3 1 2 3 4\n\nSample Output 4\n\n10", "sample_input": "5 3\n-30 -10 10 20 50\n"}, "reference_outputs": ["40\n"], "source_document_id": "p03274", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere are N candles placed on a number line.\nThe i-th candle from the left is placed on coordinate x_i.\nHere, x_1 < x_2 < ... < x_N holds.\n\nInitially, no candles are burning.\nSnuke decides to light K of the N candles.\n\nNow, he is at coordinate 0.\nHe can move left and right along the line with speed 1.\nHe can also light a candle when he is at the same position as the candle, in negligible time.\n\nFind the minimum time required to light K candles.\n\nConstraints\n\n1 \\leq N \\leq 10^5\n\n1 \\leq K \\leq N\n\nx_i is an integer.\n\n|x_i| \\leq 10^8\n\nx_1 < x_2 < ... < x_N\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nx_1 x_2 ... x_N\n\nOutput\n\nPrint the minimum time required to light K candles.\n\nSample Input 1\n\n5 3\n-30 -10 10 20 50\n\nSample Output 1\n\n40\n\nHe should move and light candles as follows:\n\nMove from coordinate 0 to -10.\n\nLight the second candle from the left.\n\nMove from coordinate -10 to 10.\n\nLight the third candle from the left.\n\nMove from coordinate 10 to 20.\n\nLight the fourth candle from the left.\n\nSample Input 2\n\n3 2\n10 20 30\n\nSample Output 2\n\n20\n\nSample Input 3\n\n1 1\n0\n\nSample Output 3\n\n0\n\nThere may be a candle placed at coordinate 0.\n\nSample Input 4\n\n8 5\n-9 -7 -4 -3 1 2 3 4\n\nSample Output 4\n\n10", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 15, "memory_kb": 512}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s804354844", "group_id": "codeNet:p03274", "input_text": "var n,k,i,aa:longint;\nmin,count:int64;\na:array[1..1000000]of longint;\nbegin \n\tread(n,k);\n\tmin:=maxlongint;\n\tfor i:=1 to n do begin read(a[i]);if a[i]<=0 then begin a[i]:=-a[i];aa:=i;end;end;\n\tfor i:=1 to k do \n\t\tif (aa>=i) and (n-aa>=k-i)then\n\t\tbegin \n\t\t\tif a[aa-i+1]>a[aa+k-i] then count:=2*a[aa+k-i]+a[aa-i+1]\n\t\t\t\telse count:=2*a[aa-i+1]+a[aa+k-i];\n\t\t if min>count then min:=count;\n\t\tend;\n\tif (n-aa>=k) and (a[aa+k]=i) and (n-aa>=k-i)then\n\t\tbegin \n\t\t\tif a[aa-i+1]>a[aa+k-i] then count:=2*a[aa+k-i]+a[aa-i+1]\n\t\t\t\telse count:=2*a[aa-i+1]+a[aa+k-i];\n\t\t if min>count then min:=count;\n\t\tend;\n\tif (n-aa>=k) and (a[aa+k]0 then inc(x);\n\t\tif a<0 then inc(y);\n\t\tif a=0 then dec(k);\n\t\tif (a>0) and (f[i-1]<=0) then t:=i;\n\t\tif a<>0 then\n\t\tbegin \n\t\t\tinc(p);\n\t\t\tf[p]:=a;\n\t\tend;\n\tend;\n\ts:=$7f;\n\tfor i:=1 to p do f1[i-t]:=abs(f[i]);\n\ty:=-y;\n\tif x>=k then s:=min(s,f1[k-1]);\n\tif -y>=k then s:=min(s,f1[-k]);\n\tfor i:=-min(-y,k) to -1 do\n\t\tif i*(k+i-1)<=0 then\n\t\t\ts:=min(s,f1[i]*2+f1[k+i-1]);\n\tfor i:=1 to min(x-1,k-1) do\n\t\tif i*(k-i-1)>=0 then\n\t\t\ts:=min(s,f1[i]*2+f1[-(k-i-1)]);\n\twriteln(s); writeln;\nend.", "language": "Pascal", "metadata": {"date": 1535334087, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03274.html", "problem_id": "p03274", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03274/input.txt", "sample_output_relpath": "derived/input_output/data/p03274/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03274/Pascal/s295764000.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s295764000", "user_id": "u957998623"}, "prompt_components": {"gold_output": "40\n", "input_to_evaluate": "var\n\ts:int64;\n\tn,k,i,x,y,t,a,p:longint;\n\tf,f1:array[-100010..100010] of longint;\nfunction min(a,b:longint):longint;\nbegin\n\tif a0 then inc(x);\n\t\tif a<0 then inc(y);\n\t\tif a=0 then dec(k);\n\t\tif (a>0) and (f[i-1]<=0) then t:=i;\n\t\tif a<>0 then\n\t\tbegin \n\t\t\tinc(p);\n\t\t\tf[p]:=a;\n\t\tend;\n\tend;\n\ts:=$7f;\n\tfor i:=1 to p do f1[i-t]:=abs(f[i]);\n\ty:=-y;\n\tif x>=k then s:=min(s,f1[k-1]);\n\tif -y>=k then s:=min(s,f1[-k]);\n\tfor i:=-min(-y,k) to -1 do\n\t\tif i*(k+i-1)<=0 then\n\t\t\ts:=min(s,f1[i]*2+f1[k+i-1]);\n\tfor i:=1 to min(x-1,k-1) do\n\t\tif i*(k-i-1)>=0 then\n\t\t\ts:=min(s,f1[i]*2+f1[-(k-i-1)]);\n\twriteln(s); writeln;\nend.", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere are N candles placed on a number line.\nThe i-th candle from the left is placed on coordinate x_i.\nHere, x_1 < x_2 < ... < x_N holds.\n\nInitially, no candles are burning.\nSnuke decides to light K of the N candles.\n\nNow, he is at coordinate 0.\nHe can move left and right along the line with speed 1.\nHe can also light a candle when he is at the same position as the candle, in negligible time.\n\nFind the minimum time required to light K candles.\n\nConstraints\n\n1 \\leq N \\leq 10^5\n\n1 \\leq K \\leq N\n\nx_i is an integer.\n\n|x_i| \\leq 10^8\n\nx_1 < x_2 < ... < x_N\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nx_1 x_2 ... x_N\n\nOutput\n\nPrint the minimum time required to light K candles.\n\nSample Input 1\n\n5 3\n-30 -10 10 20 50\n\nSample Output 1\n\n40\n\nHe should move and light candles as follows:\n\nMove from coordinate 0 to -10.\n\nLight the second candle from the left.\n\nMove from coordinate -10 to 10.\n\nLight the third candle from the left.\n\nMove from coordinate 10 to 20.\n\nLight the fourth candle from the left.\n\nSample Input 2\n\n3 2\n10 20 30\n\nSample Output 2\n\n20\n\nSample Input 3\n\n1 1\n0\n\nSample Output 3\n\n0\n\nThere may be a candle placed at coordinate 0.\n\nSample Input 4\n\n8 5\n-9 -7 -4 -3 1 2 3 4\n\nSample Output 4\n\n10", "sample_input": "5 3\n-30 -10 10 20 50\n"}, "reference_outputs": ["40\n"], "source_document_id": "p03274", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere are N candles placed on a number line.\nThe i-th candle from the left is placed on coordinate x_i.\nHere, x_1 < x_2 < ... < x_N holds.\n\nInitially, no candles are burning.\nSnuke decides to light K of the N candles.\n\nNow, he is at coordinate 0.\nHe can move left and right along the line with speed 1.\nHe can also light a candle when he is at the same position as the candle, in negligible time.\n\nFind the minimum time required to light K candles.\n\nConstraints\n\n1 \\leq N \\leq 10^5\n\n1 \\leq K \\leq N\n\nx_i is an integer.\n\n|x_i| \\leq 10^8\n\nx_1 < x_2 < ... < x_N\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nx_1 x_2 ... x_N\n\nOutput\n\nPrint the minimum time required to light K candles.\n\nSample Input 1\n\n5 3\n-30 -10 10 20 50\n\nSample Output 1\n\n40\n\nHe should move and light candles as follows:\n\nMove from coordinate 0 to -10.\n\nLight the second candle from the left.\n\nMove from coordinate -10 to 10.\n\nLight the third candle from the left.\n\nMove from coordinate 10 to 20.\n\nLight the fourth candle from the left.\n\nSample Input 2\n\n3 2\n10 20 30\n\nSample Output 2\n\n20\n\nSample Input 3\n\n1 1\n0\n\nSample Output 3\n\n0\n\nThere may be a candle placed at coordinate 0.\n\nSample Input 4\n\n8 5\n-9 -7 -4 -3 1 2 3 4\n\nSample Output 4\n\n10", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 754, "cpu_time_ms": 16, "memory_kb": 1280}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s868902724", "group_id": "codeNet:p03274", "input_text": "var\n\ts:int64;\n\tn,k,i,x,y,t,a,p:longint;\n\tf,f1:array[-200010..200010] of longint;\nfunction min(a,b:longint):longint;\nbegin\n\tif a0 then inc(x);\n\t\tif a<0 then inc(y);\n\t\tif a=0 then dec(k);\n\t\tif (a>0) and (f[i-1]<=0) then t:=i;\n\t\tif a<>0 then\n\t\tbegin \n\t\t\tinc(p);\n\t\t\tf[p]:=a;\n\t\tend;\n\tend;\n\ts:=$7f;\n\tfor i:=1 to n do f1[i-t]:=abs(f[i]);\n\ty:=-y;\n\tif x>=k then s:=min(s,f1[k-1]);\n\tif -y>=k then s:=min(s,f1[-k]);\n\tfor i:=-min(-y,k) to -1 do\n\t\tif i*(k+i-1)<=0 then\n\t\t\ts:=min(s,f1[i]*2+f1[k+i-1]);\n\tfor i:=1 to min(x-1,k) do\n\t\tif i*(k-i-1)>=0 then\n\t\t\ts:=min(s,f1[i]*2+f1[-(k-i-1)]);\n\twriteln(s);\nend.", "language": "Pascal", "metadata": {"date": 1535333637, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03274.html", "problem_id": "p03274", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03274/input.txt", "sample_output_relpath": "derived/input_output/data/p03274/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03274/Pascal/s868902724.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s868902724", "user_id": "u957998623"}, "prompt_components": {"gold_output": "40\n", "input_to_evaluate": "var\n\ts:int64;\n\tn,k,i,x,y,t,a,p:longint;\n\tf,f1:array[-200010..200010] of longint;\nfunction min(a,b:longint):longint;\nbegin\n\tif a0 then inc(x);\n\t\tif a<0 then inc(y);\n\t\tif a=0 then dec(k);\n\t\tif (a>0) and (f[i-1]<=0) then t:=i;\n\t\tif a<>0 then\n\t\tbegin \n\t\t\tinc(p);\n\t\t\tf[p]:=a;\n\t\tend;\n\tend;\n\ts:=$7f;\n\tfor i:=1 to n do f1[i-t]:=abs(f[i]);\n\ty:=-y;\n\tif x>=k then s:=min(s,f1[k-1]);\n\tif -y>=k then s:=min(s,f1[-k]);\n\tfor i:=-min(-y,k) to -1 do\n\t\tif i*(k+i-1)<=0 then\n\t\t\ts:=min(s,f1[i]*2+f1[k+i-1]);\n\tfor i:=1 to min(x-1,k) do\n\t\tif i*(k-i-1)>=0 then\n\t\t\ts:=min(s,f1[i]*2+f1[-(k-i-1)]);\n\twriteln(s);\nend.", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere are N candles placed on a number line.\nThe i-th candle from the left is placed on coordinate x_i.\nHere, x_1 < x_2 < ... < x_N holds.\n\nInitially, no candles are burning.\nSnuke decides to light K of the N candles.\n\nNow, he is at coordinate 0.\nHe can move left and right along the line with speed 1.\nHe can also light a candle when he is at the same position as the candle, in negligible time.\n\nFind the minimum time required to light K candles.\n\nConstraints\n\n1 \\leq N \\leq 10^5\n\n1 \\leq K \\leq N\n\nx_i is an integer.\n\n|x_i| \\leq 10^8\n\nx_1 < x_2 < ... < x_N\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nx_1 x_2 ... x_N\n\nOutput\n\nPrint the minimum time required to light K candles.\n\nSample Input 1\n\n5 3\n-30 -10 10 20 50\n\nSample Output 1\n\n40\n\nHe should move and light candles as follows:\n\nMove from coordinate 0 to -10.\n\nLight the second candle from the left.\n\nMove from coordinate -10 to 10.\n\nLight the third candle from the left.\n\nMove from coordinate 10 to 20.\n\nLight the fourth candle from the left.\n\nSample Input 2\n\n3 2\n10 20 30\n\nSample Output 2\n\n20\n\nSample Input 3\n\n1 1\n0\n\nSample Output 3\n\n0\n\nThere may be a candle placed at coordinate 0.\n\nSample Input 4\n\n8 5\n-9 -7 -4 -3 1 2 3 4\n\nSample Output 4\n\n10", "sample_input": "5 3\n-30 -10 10 20 50\n"}, "reference_outputs": ["40\n"], "source_document_id": "p03274", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere are N candles placed on a number line.\nThe i-th candle from the left is placed on coordinate x_i.\nHere, x_1 < x_2 < ... < x_N holds.\n\nInitially, no candles are burning.\nSnuke decides to light K of the N candles.\n\nNow, he is at coordinate 0.\nHe can move left and right along the line with speed 1.\nHe can also light a candle when he is at the same position as the candle, in negligible time.\n\nFind the minimum time required to light K candles.\n\nConstraints\n\n1 \\leq N \\leq 10^5\n\n1 \\leq K \\leq N\n\nx_i is an integer.\n\n|x_i| \\leq 10^8\n\nx_1 < x_2 < ... < x_N\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nx_1 x_2 ... x_N\n\nOutput\n\nPrint the minimum time required to light K candles.\n\nSample Input 1\n\n5 3\n-30 -10 10 20 50\n\nSample Output 1\n\n40\n\nHe should move and light candles as follows:\n\nMove from coordinate 0 to -10.\n\nLight the second candle from the left.\n\nMove from coordinate -10 to 10.\n\nLight the third candle from the left.\n\nMove from coordinate 10 to 20.\n\nLight the fourth candle from the left.\n\nSample Input 2\n\n3 2\n10 20 30\n\nSample Output 2\n\n20\n\nSample Input 3\n\n1 1\n0\n\nSample Output 3\n\n0\n\nThere may be a candle placed at coordinate 0.\n\nSample Input 4\n\n8 5\n-9 -7 -4 -3 1 2 3 4\n\nSample Output 4\n\n10", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 745, "cpu_time_ms": 17, "memory_kb": 2048}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s965154896", "group_id": "codeNet:p03274", "input_text": "var n,k,i,aa,x,bb:longint;\nmin,count:int64;\na,b:array[1..100000]of integer;\nbegin \n\tread(n,k);\n\tmin:=maxlongint;\n\ti:=0;\n\tread(x);\n\twhile (x<0) and (i0 then read(x);end;\n\taa:=i;bb:=n-aa;\n\tb[1]:=x;\n\tfor i:=2 to n-aa do read(b[i]);\n\tfor i:=0 to k do \n\t\tif (aa>=i) and (bb>=k-i) then\n\t\tbegin \n\t\t\tif a[aa-i+1]>b[k-i] then count:=2*b[k-i]+a[aa-i+1]\n\t\t\t\telse count:=2*a[aa-i+1]+b[k-i];\n\t\t if min>count then min:=count;\n\t\tend;\n\twrite(min);\nend.", "language": "Pascal", "metadata": {"date": 1535320080, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03274.html", "problem_id": "p03274", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03274/input.txt", "sample_output_relpath": "derived/input_output/data/p03274/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03274/Pascal/s965154896.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s965154896", "user_id": "u914335902"}, "prompt_components": {"gold_output": "40\n", "input_to_evaluate": "var n,k,i,aa,x,bb:longint;\nmin,count:int64;\na,b:array[1..100000]of integer;\nbegin \n\tread(n,k);\n\tmin:=maxlongint;\n\ti:=0;\n\tread(x);\n\twhile (x<0) and (i0 then read(x);end;\n\taa:=i;bb:=n-aa;\n\tb[1]:=x;\n\tfor i:=2 to n-aa do read(b[i]);\n\tfor i:=0 to k do \n\t\tif (aa>=i) and (bb>=k-i) then\n\t\tbegin \n\t\t\tif a[aa-i+1]>b[k-i] then count:=2*b[k-i]+a[aa-i+1]\n\t\t\t\telse count:=2*a[aa-i+1]+b[k-i];\n\t\t if min>count then min:=count;\n\t\tend;\n\twrite(min);\nend.", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere are N candles placed on a number line.\nThe i-th candle from the left is placed on coordinate x_i.\nHere, x_1 < x_2 < ... < x_N holds.\n\nInitially, no candles are burning.\nSnuke decides to light K of the N candles.\n\nNow, he is at coordinate 0.\nHe can move left and right along the line with speed 1.\nHe can also light a candle when he is at the same position as the candle, in negligible time.\n\nFind the minimum time required to light K candles.\n\nConstraints\n\n1 \\leq N \\leq 10^5\n\n1 \\leq K \\leq N\n\nx_i is an integer.\n\n|x_i| \\leq 10^8\n\nx_1 < x_2 < ... < x_N\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nx_1 x_2 ... x_N\n\nOutput\n\nPrint the minimum time required to light K candles.\n\nSample Input 1\n\n5 3\n-30 -10 10 20 50\n\nSample Output 1\n\n40\n\nHe should move and light candles as follows:\n\nMove from coordinate 0 to -10.\n\nLight the second candle from the left.\n\nMove from coordinate -10 to 10.\n\nLight the third candle from the left.\n\nMove from coordinate 10 to 20.\n\nLight the fourth candle from the left.\n\nSample Input 2\n\n3 2\n10 20 30\n\nSample Output 2\n\n20\n\nSample Input 3\n\n1 1\n0\n\nSample Output 3\n\n0\n\nThere may be a candle placed at coordinate 0.\n\nSample Input 4\n\n8 5\n-9 -7 -4 -3 1 2 3 4\n\nSample Output 4\n\n10", "sample_input": "5 3\n-30 -10 10 20 50\n"}, "reference_outputs": ["40\n"], "source_document_id": "p03274", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere are N candles placed on a number line.\nThe i-th candle from the left is placed on coordinate x_i.\nHere, x_1 < x_2 < ... < x_N holds.\n\nInitially, no candles are burning.\nSnuke decides to light K of the N candles.\n\nNow, he is at coordinate 0.\nHe can move left and right along the line with speed 1.\nHe can also light a candle when he is at the same position as the candle, in negligible time.\n\nFind the minimum time required to light K candles.\n\nConstraints\n\n1 \\leq N \\leq 10^5\n\n1 \\leq K \\leq N\n\nx_i is an integer.\n\n|x_i| \\leq 10^8\n\nx_1 < x_2 < ... < x_N\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nx_1 x_2 ... x_N\n\nOutput\n\nPrint the minimum time required to light K candles.\n\nSample Input 1\n\n5 3\n-30 -10 10 20 50\n\nSample Output 1\n\n40\n\nHe should move and light candles as follows:\n\nMove from coordinate 0 to -10.\n\nLight the second candle from the left.\n\nMove from coordinate -10 to 10.\n\nLight the third candle from the left.\n\nMove from coordinate 10 to 20.\n\nLight the fourth candle from the left.\n\nSample Input 2\n\n3 2\n10 20 30\n\nSample Output 2\n\n20\n\nSample Input 3\n\n1 1\n0\n\nSample Output 3\n\n0\n\nThere may be a candle placed at coordinate 0.\n\nSample Input 4\n\n8 5\n-9 -7 -4 -3 1 2 3 4\n\nSample Output 4\n\n10", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 545, "cpu_time_ms": 15, "memory_kb": 512}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s961159853", "group_id": "codeNet:p03275", "input_text": "var\n a,s:array[1..100000]of int64;\n k,n,i:longint;\n sum:int64;\n\nfunction c(x,y:longint):longint;\nvar\n i:longint;\n s:real;\nbegin\n if x=0 then exit(1);\n if y=0 then exit(0);\n for i:=1 to x do\n begin\n s:=s*(y-i+1);\n s:=s/i;\n end;\n exit(trunc(x));\nend;\n\nbegin\n readln(n);\n for i:=1 to n do\n read(a[i]);\n for k:=1 to n do\n for i:=1 to n do\n s[i]:=s[i]+c(k div 2,i-1)*c(k-k div 2,n-i);\n for i:=1 to n do\n sum:=sum+s[i];\n k:=sum div 2+1;\n for i:=1 to n do\n begin\n k:=k-s[i];\n if k<=0 then break;\n end;\n writeln(a[i]);\nend.\n", "language": "Pascal", "metadata": {"date": 1538776354, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03275.html", "problem_id": "p03275", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03275/input.txt", "sample_output_relpath": "derived/input_output/data/p03275/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03275/Pascal/s961159853.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s961159853", "user_id": "u119860177"}, "prompt_components": {"gold_output": "30\n", "input_to_evaluate": "var\n a,s:array[1..100000]of int64;\n k,n,i:longint;\n sum:int64;\n\nfunction c(x,y:longint):longint;\nvar\n i:longint;\n s:real;\nbegin\n if x=0 then exit(1);\n if y=0 then exit(0);\n for i:=1 to x do\n begin\n s:=s*(y-i+1);\n s:=s/i;\n end;\n exit(trunc(x));\nend;\n\nbegin\n readln(n);\n for i:=1 to n do\n read(a[i]);\n for k:=1 to n do\n for i:=1 to n do\n s[i]:=s[i]+c(k div 2,i-1)*c(k-k div 2,n-i);\n for i:=1 to n do\n sum:=sum+s[i];\n k:=sum div 2+1;\n for i:=1 to n do\n begin\n k:=k-s[i];\n if k<=0 then break;\n end;\n writeln(a[i]);\nend.\n", "problem_context": "Score : 700 points\n\nProblem Statement\n\nWe will define the median of a sequence b of length M, as follows:\n\nLet b' be the sequence obtained by sorting b in non-decreasing order. Then, the value of the (M / 2 + 1)-th element of b' is the median of b. Here, / is integer division, rounding down.\n\nFor example, the median of (10, 30, 20) is 20; the median of (10, 30, 20, 40) is 30; the median of (10, 10, 10, 20, 30) is 10.\n\nSnuke comes up with the following problem.\n\nYou are given a sequence a of length N.\nFor each pair (l, r) (1 \\leq l \\leq r \\leq N), let m_{l, r} be the median of the contiguous subsequence (a_l, a_{l + 1}, ..., a_r) of a.\nWe will list m_{l, r} for all pairs (l, r) to create a new sequence m.\nFind the median of m.\n\nConstraints\n\n1 \\leq N \\leq 10^5\n\na_i is an integer.\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 median of m.\n\nSample Input 1\n\n3\n10 30 20\n\nSample Output 1\n\n30\n\nThe median of each contiguous subsequence of a is as follows:\n\nThe median of (10) is 10.\n\nThe median of (30) is 30.\n\nThe median of (20) is 20.\n\nThe median of (10, 30) is 30.\n\nThe median of (30, 20) is 30.\n\nThe median of (10, 30, 20) is 20.\n\nThus, m = (10, 30, 20, 30, 30, 20) and the median of m is 30.\n\nSample Input 2\n\n1\n10\n\nSample Output 2\n\n10\n\nSample Input 3\n\n10\n5 9 5 9 8 9 3 5 4 3\n\nSample Output 3\n\n8", "sample_input": "3\n10 30 20\n"}, "reference_outputs": ["30\n"], "source_document_id": "p03275", "source_text": "Score : 700 points\n\nProblem Statement\n\nWe will define the median of a sequence b of length M, as follows:\n\nLet b' be the sequence obtained by sorting b in non-decreasing order. Then, the value of the (M / 2 + 1)-th element of b' is the median of b. Here, / is integer division, rounding down.\n\nFor example, the median of (10, 30, 20) is 20; the median of (10, 30, 20, 40) is 30; the median of (10, 10, 10, 20, 30) is 10.\n\nSnuke comes up with the following problem.\n\nYou are given a sequence a of length N.\nFor each pair (l, r) (1 \\leq l \\leq r \\leq N), let m_{l, r} be the median of the contiguous subsequence (a_l, a_{l + 1}, ..., a_r) of a.\nWe will list m_{l, r} for all pairs (l, r) to create a new sequence m.\nFind the median of m.\n\nConstraints\n\n1 \\leq N \\leq 10^5\n\na_i is an integer.\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 median of m.\n\nSample Input 1\n\n3\n10 30 20\n\nSample Output 1\n\n30\n\nThe median of each contiguous subsequence of a is as follows:\n\nThe median of (10) is 10.\n\nThe median of (30) is 30.\n\nThe median of (20) is 20.\n\nThe median of (10, 30) is 30.\n\nThe median of (30, 20) is 30.\n\nThe median of (10, 30, 20) is 20.\n\nThus, m = (10, 30, 20, 30, 30, 20) and the median of m is 30.\n\nSample Input 2\n\n1\n10\n\nSample Output 2\n\n10\n\nSample Input 3\n\n10\n5 9 5 9 8 9 3 5 4 3\n\nSample Output 3\n\n8", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 2103, "memory_kb": 1664}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s799182590", "group_id": "codeNet:p03275", "input_text": "var\n\ta:array[0..100010] of longint;\n\ti,n:longint;\nprocedure qsort(l,r:longint);\nvar\n\ti,j,t,mid:longint;\nbegin\n\ti:=l; j:=r;\n\tmid:=a[(l+r) div 2];\n\trepeat\n\t\twhile a[i]mid do dec(j);\n\t\tif i<=j then\n\t\tbegin\n\t\t\tt:=a[i]; a[i]:=a[j]; a[j]:=t;\n\t\t\tinc(i); dec(j);\n\t\tend;\n\tuntil i>j;\n\tif lmid do dec(j);\n\t\tif i<=j then\n\t\tbegin\n\t\t\tt:=a[i]; a[i]:=a[j]; a[j]:=t;\n\t\t\tinc(i); dec(j);\n\t\tend;\n\tuntil i>j;\n\tif labs(x[i])then inc(now,abs(x[i]))else inc(now,abs(x[i+K-1]));\n\t\tif ans>now then ans:=now;\n\tend;\n\twriteln(ans);\nend.\n", "language": "Pascal", "metadata": {"date": 1582187012, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03276.html", "problem_id": "p03276", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03276/input.txt", "sample_output_relpath": "derived/input_output/data/p03276/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03276/Pascal/s083538701.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s083538701", "user_id": "u657913472"}, "prompt_components": {"gold_output": "40\n", "input_to_evaluate": "var\n\tN,K,ans,now,i:Longint;\n\tx:Array[1..100000]of Longint;\nbegin\n\tread(N,K);\n\tfor i:=1 to N do read(x[i]);\n\tans:=2000000000;\n\tfor i:=1 to N-K+1 do begin\n\t\tnow:=x[i+K-1]-x[i];\n\t\tif abs(x[i+K-1])>abs(x[i])then inc(now,abs(x[i]))else inc(now,abs(x[i+K-1]));\n\t\tif ans>now then ans:=now;\n\tend;\n\twriteln(ans);\nend.\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere are N candles placed on a number line.\nThe i-th candle from the left is placed on coordinate x_i.\nHere, x_1 < x_2 < ... < x_N holds.\n\nInitially, no candles are burning.\nSnuke decides to light K of the N candles.\n\nNow, he is at coordinate 0.\nHe can move left and right along the line with speed 1.\nHe can also light a candle when he is at the same position as the candle, in negligible time.\n\nFind the minimum time required to light K candles.\n\nConstraints\n\n1 \\leq N \\leq 10^5\n\n1 \\leq K \\leq N\n\nx_i is an integer.\n\n|x_i| \\leq 10^8\n\nx_1 < x_2 < ... < x_N\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nx_1 x_2 ... x_N\n\nOutput\n\nPrint the minimum time required to light K candles.\n\nSample Input 1\n\n5 3\n-30 -10 10 20 50\n\nSample Output 1\n\n40\n\nHe should move and light candles as follows:\n\nMove from coordinate 0 to -10.\n\nLight the second candle from the left.\n\nMove from coordinate -10 to 10.\n\nLight the third candle from the left.\n\nMove from coordinate 10 to 20.\n\nLight the fourth candle from the left.\n\nSample Input 2\n\n3 2\n10 20 30\n\nSample Output 2\n\n20\n\nSample Input 3\n\n1 1\n0\n\nSample Output 3\n\n0\n\nThere may be a candle placed at coordinate 0.\n\nSample Input 4\n\n8 5\n-9 -7 -4 -3 1 2 3 4\n\nSample Output 4\n\n10", "sample_input": "5 3\n-30 -10 10 20 50\n"}, "reference_outputs": ["40\n"], "source_document_id": "p03276", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere are N candles placed on a number line.\nThe i-th candle from the left is placed on coordinate x_i.\nHere, x_1 < x_2 < ... < x_N holds.\n\nInitially, no candles are burning.\nSnuke decides to light K of the N candles.\n\nNow, he is at coordinate 0.\nHe can move left and right along the line with speed 1.\nHe can also light a candle when he is at the same position as the candle, in negligible time.\n\nFind the minimum time required to light K candles.\n\nConstraints\n\n1 \\leq N \\leq 10^5\n\n1 \\leq K \\leq N\n\nx_i is an integer.\n\n|x_i| \\leq 10^8\n\nx_1 < x_2 < ... < x_N\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nx_1 x_2 ... x_N\n\nOutput\n\nPrint the minimum time required to light K candles.\n\nSample Input 1\n\n5 3\n-30 -10 10 20 50\n\nSample Output 1\n\n40\n\nHe should move and light candles as follows:\n\nMove from coordinate 0 to -10.\n\nLight the second candle from the left.\n\nMove from coordinate -10 to 10.\n\nLight the third candle from the left.\n\nMove from coordinate 10 to 20.\n\nLight the fourth candle from the left.\n\nSample Input 2\n\n3 2\n10 20 30\n\nSample Output 2\n\n20\n\nSample Input 3\n\n1 1\n0\n\nSample Output 3\n\n0\n\nThere may be a candle placed at coordinate 0.\n\nSample Input 4\n\n8 5\n-9 -7 -4 -3 1 2 3 4\n\nSample Output 4\n\n10", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 15, "memory_kb": 512}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s488960757", "group_id": "codeNet:p03277", "input_text": "var\n\tn,c,NN:int64;\n\ti,l,r,m,s:Longint;\n\ta,b:array[1..200000]of Longint;\nbegin\n\tread(n);\n\tfor i:=1 to n do begin\n\t\tread(a[i]);\n\t\tif r1 do begin\n\t\tfor i:=1 to 2*n do b[i]:=0;\n\t\tm:=(l+r)div 2;\n\t\ts:=n;\n\t\tb[s]:=1;\n\t\tNN:=0;\n\t\tc:=0;\n\t\tfor i:=1 to n do begin\n\t\t\tif a[i]>m then begin\n\t\t\t\tinc(s);\n\t\t\t\tdec(NN,b[s]);\n\t\t\tend else begin\n\t\t\t\tinc(NN,b[s]);\n\t\t\t\tdec(s);\n\t\t\tend;\n\t\t\tinc(c,NN);\n\t\t\tinc(b[s]);\n\t\tend;\n\t\tif c*4>n*(n+1) then r:=m else l:=m;\n\tend;\n\twriteln(r);\nend.\n", "language": "Pascal", "metadata": {"date": 1540272252, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03277.html", "problem_id": "p03277", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03277/input.txt", "sample_output_relpath": "derived/input_output/data/p03277/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03277/Pascal/s488960757.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s488960757", "user_id": "u657913472"}, "prompt_components": {"gold_output": "30\n", "input_to_evaluate": "var\n\tn,c,NN:int64;\n\ti,l,r,m,s:Longint;\n\ta,b:array[1..200000]of Longint;\nbegin\n\tread(n);\n\tfor i:=1 to n do begin\n\t\tread(a[i]);\n\t\tif r1 do begin\n\t\tfor i:=1 to 2*n do b[i]:=0;\n\t\tm:=(l+r)div 2;\n\t\ts:=n;\n\t\tb[s]:=1;\n\t\tNN:=0;\n\t\tc:=0;\n\t\tfor i:=1 to n do begin\n\t\t\tif a[i]>m then begin\n\t\t\t\tinc(s);\n\t\t\t\tdec(NN,b[s]);\n\t\t\tend else begin\n\t\t\t\tinc(NN,b[s]);\n\t\t\t\tdec(s);\n\t\t\tend;\n\t\t\tinc(c,NN);\n\t\t\tinc(b[s]);\n\t\tend;\n\t\tif c*4>n*(n+1) then r:=m else l:=m;\n\tend;\n\twriteln(r);\nend.\n", "problem_context": "Score : 700 points\n\nProblem Statement\n\nWe will define the median of a sequence b of length M, as follows:\n\nLet b' be the sequence obtained by sorting b in non-decreasing order. Then, the value of the (M / 2 + 1)-th element of b' is the median of b. Here, / is integer division, rounding down.\n\nFor example, the median of (10, 30, 20) is 20; the median of (10, 30, 20, 40) is 30; the median of (10, 10, 10, 20, 30) is 10.\n\nSnuke comes up with the following problem.\n\nYou are given a sequence a of length N.\nFor each pair (l, r) (1 \\leq l \\leq r \\leq N), let m_{l, r} be the median of the contiguous subsequence (a_l, a_{l + 1}, ..., a_r) of a.\nWe will list m_{l, r} for all pairs (l, r) to create a new sequence m.\nFind the median of m.\n\nConstraints\n\n1 \\leq N \\leq 10^5\n\na_i is an integer.\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 median of m.\n\nSample Input 1\n\n3\n10 30 20\n\nSample Output 1\n\n30\n\nThe median of each contiguous subsequence of a is as follows:\n\nThe median of (10) is 10.\n\nThe median of (30) is 30.\n\nThe median of (20) is 20.\n\nThe median of (10, 30) is 30.\n\nThe median of (30, 20) is 30.\n\nThe median of (10, 30, 20) is 20.\n\nThus, m = (10, 30, 20, 30, 30, 20) and the median of m is 30.\n\nSample Input 2\n\n1\n10\n\nSample Output 2\n\n10\n\nSample Input 3\n\n10\n5 9 5 9 8 9 3 5 4 3\n\nSample Output 3\n\n8", "sample_input": "3\n10 30 20\n"}, "reference_outputs": ["30\n"], "source_document_id": "p03277", "source_text": "Score : 700 points\n\nProblem Statement\n\nWe will define the median of a sequence b of length M, as follows:\n\nLet b' be the sequence obtained by sorting b in non-decreasing order. Then, the value of the (M / 2 + 1)-th element of b' is the median of b. Here, / is integer division, rounding down.\n\nFor example, the median of (10, 30, 20) is 20; the median of (10, 30, 20, 40) is 30; the median of (10, 10, 10, 20, 30) is 10.\n\nSnuke comes up with the following problem.\n\nYou are given a sequence a of length N.\nFor each pair (l, r) (1 \\leq l \\leq r \\leq N), let m_{l, r} be the median of the contiguous subsequence (a_l, a_{l + 1}, ..., a_r) of a.\nWe will list m_{l, r} for all pairs (l, r) to create a new sequence m.\nFind the median of m.\n\nConstraints\n\n1 \\leq N \\leq 10^5\n\na_i is an integer.\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 median of m.\n\nSample Input 1\n\n3\n10 30 20\n\nSample Output 1\n\n30\n\nThe median of each contiguous subsequence of a is as follows:\n\nThe median of (10) is 10.\n\nThe median of (30) is 30.\n\nThe median of (20) is 20.\n\nThe median of (10, 30) is 30.\n\nThe median of (30, 20) is 30.\n\nThe median of (10, 30, 20) is 20.\n\nThus, m = (10, 30, 20, 30, 30, 20) and the median of m is 30.\n\nSample Input 2\n\n1\n10\n\nSample Output 2\n\n10\n\nSample Input 3\n\n10\n5 9 5 9 8 9 3 5 4 3\n\nSample Output 3\n\n8", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 38, "memory_kb": 1280}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s046536472", "group_id": "codeNet:p03280", "input_text": "{ Free PascalのHello, world.(日本語版) }\n \nprogram Hello;\n\n{$MODE OBJFPC}\n{$CODEPAGE UTF8}\n{$LONGSTRINGS ON}\n \nuses\n SysUtils,\n Classes;\n \n procedure MainProc;\n\tvar\n\t\ttext : string;\n\t\tstrlist : TStringList;\n\t\thorizon : Integer;\n\t\tvertical : Integer;\n\t\tanswer : Integer;\n\tbegin\n\tReadLn(text);\n\tstrlist := TStringList.Create;\n\ttry\n\t\tstrlist.Delimiter := ' ';\n\t\tstrlist.DelimitedText := text;\n\t\thorizon := StrToInt(strlist.Strings[0]);\n\t\tvertical := StrToInt(strlist.Strings[1]);\n\t\tfinally\n\t\t\tFreeAndNil(strlist);\n\t\t\tend;\n\t\tanswer := (horizon - 1) * (vertical - 1);\t\n\t\tWriteLn(answer);\n\tend;\n \nbegin\nMainProc;\nend.\n", "language": "Pascal", "metadata": {"date": 1537241407, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03280.html", "problem_id": "p03280", "resource_group": "low_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/Pascal/s046536472.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s046536472", "user_id": "u397546896"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "{ Free PascalのHello, world.(日本語版) }\n \nprogram Hello;\n\n{$MODE OBJFPC}\n{$CODEPAGE UTF8}\n{$LONGSTRINGS ON}\n \nuses\n SysUtils,\n Classes;\n \n procedure MainProc;\n\tvar\n\t\ttext : string;\n\t\tstrlist : TStringList;\n\t\thorizon : Integer;\n\t\tvertical : Integer;\n\t\tanswer : Integer;\n\tbegin\n\tReadLn(text);\n\tstrlist := TStringList.Create;\n\ttry\n\t\tstrlist.Delimiter := ' ';\n\t\tstrlist.DelimitedText := text;\n\t\thorizon := StrToInt(strlist.Strings[0]);\n\t\tvertical := StrToInt(strlist.Strings[1]);\n\t\tfinally\n\t\t\tFreeAndNil(strlist);\n\t\t\tend;\n\t\tanswer := (horizon - 1) * (vertical - 1);\t\n\t\tWriteLn(answer);\n\tend;\n \nbegin\nMainProc;\nend.\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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 621, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s329891231", "group_id": "codeNet:p03280", "input_text": "uses crt;\nvar a,b,c: integer;\nbegin\nreadln(a,b);\nc:=a*b-(a+b-1);\nwrite(c);\nend.", "language": "Pascal", "metadata": {"date": 1534645421, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03280.html", "problem_id": "p03280", "resource_group": "low_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/Pascal/s329891231.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s329891231", "user_id": "u366973955"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "uses crt;\nvar a,b,c: integer;\nbegin\nreadln(a,b);\nc:=a*b-(a+b-1);\nwrite(c);\nend.", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 79, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s713695760", "group_id": "codeNet:p03280", "input_text": "uses crt;\nvar\n a,b,m:longint;\nbegin\n read(a,b);\n write(a*b-a-b+1);\n //readln;\n //readln\nend.", "language": "Pascal", "metadata": {"date": 1534641023, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03280.html", "problem_id": "p03280", "resource_group": "low_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/Pascal/s713695760.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s713695760", "user_id": "u004929494"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "uses crt;\nvar\n a,b,m:longint;\nbegin\n read(a,b);\n write(a*b-a-b+1);\n //readln;\n //readln\nend.", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 127, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s790088186", "group_id": "codeNet:p03281", "input_text": "var\n n,i,j,k,ans:longint;\nbegin\n readln(n);\n for i:=1 to n do\n begin\n k:=0;\n for j:=1 to i do\n if i mod j=0 then inc(k);\n if (k=8)and odd(i) then inc(ans);\n end;\n writeln(ans);\nend.\n", "language": "Pascal", "metadata": {"date": 1538860607, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03281.html", "problem_id": "p03281", "resource_group": "low_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/Pascal/s790088186.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s790088186", "user_id": "u018679195"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "var\n n,i,j,k,ans:longint;\nbegin\n readln(n);\n for i:=1 to n do\n begin\n k:=0;\n for j:=1 to i do\n if i mod j=0 then inc(k);\n if (k=8)and odd(i) then inc(ans);\n end;\n writeln(ans);\nend.\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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s693822834", "group_id": "codeNet:p03281", "input_text": "uses\n SysUtils,\n Classes;\n\n function JudgeFunc(const Value : Integer) : Integer;\n\tvar\n\t\ti, j, k : Integer;\n\t\tarrayNum : array of Integer;\n\tbegin\n\tResult := 0;\n\tSetLength(arrayNum, 5);\n\tarrayNum[0] := 3;\n\tarrayNum[1] := 5;\n\tarrayNum[2] := 7;\n\tarrayNum[3] := 11;\n\tarrayNum[4] := 13;\n\tif not Odd(Value) then\n\t\tExit(0);\n\tfor i := 1 to Value do\n\t\tbegin\n\t\tj := 0;\n\t\tfor k := 0 to Length(arrayNum) - 1 do\n\t\t\tbegin\n\t\t\tif i mod arrayNum[k] = 0then\n\t\t\t\tj := j + 1;\n\t\t\tend;\n\t\tif j = 3 then\n\t\t\tInc(Result);\n\t\tend;\n\tend;\n \n procedure MainProc;\n\tvar\n\t\tinput : Integer;\n\t\toutput : Integer;\n\tbegin\n\tReadLn(input);\n\toutput := JudgeFunc(input);\n\tWriteLn(output);\n\tend;\n \nbegin\nMainProc;\nend.", "language": "Pascal", "metadata": {"date": 1537243494, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03281.html", "problem_id": "p03281", "resource_group": "low_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/Pascal/s693822834.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s693822834", "user_id": "u397546896"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "uses\n SysUtils,\n Classes;\n\n function JudgeFunc(const Value : Integer) : Integer;\n\tvar\n\t\ti, j, k : Integer;\n\t\tarrayNum : array of Integer;\n\tbegin\n\tResult := 0;\n\tSetLength(arrayNum, 5);\n\tarrayNum[0] := 3;\n\tarrayNum[1] := 5;\n\tarrayNum[2] := 7;\n\tarrayNum[3] := 11;\n\tarrayNum[4] := 13;\n\tif not Odd(Value) then\n\t\tExit(0);\n\tfor i := 1 to Value do\n\t\tbegin\n\t\tj := 0;\n\t\tfor k := 0 to Length(arrayNum) - 1 do\n\t\t\tbegin\n\t\t\tif i mod arrayNum[k] = 0then\n\t\t\t\tj := j + 1;\n\t\t\tend;\n\t\tif j = 3 then\n\t\t\tInc(Result);\n\t\tend;\n\tend;\n \n procedure MainProc;\n\tvar\n\t\tinput : Integer;\n\t\toutput : Integer;\n\tbegin\n\tReadLn(input);\n\toutput := JudgeFunc(input);\n\tWriteLn(output);\n\tend;\n \nbegin\nMainProc;\nend.", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s381292445", "group_id": "codeNet:p03281", "input_text": "VAR N,i,j,count,kq:INTEGER;\nbegin\n readln(n);\n i:=1;\n if n < 105 then writeln('0') else\n if n = 105 then writeln('1') else \n begin\n while i <= n do \n begin\n count:=0;\n for j:=1 to n do \n if i mod j = 0 then inc(Count);\n if count = 8 then inc(kq);\n inc(i,1);\n end;\n writeln(kq);\n end;\n end.\n", "language": "Pascal", "metadata": {"date": 1536369747, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03281.html", "problem_id": "p03281", "resource_group": "low_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/Pascal/s381292445.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s381292445", "user_id": "u060797441"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "VAR N,i,j,count,kq:INTEGER;\nbegin\n readln(n);\n i:=1;\n if n < 105 then writeln('0') else\n if n = 105 then writeln('1') else \n begin\n while i <= n do \n begin\n count:=0;\n for j:=1 to n do \n if i mod j = 0 then inc(Count);\n if count = 8 then inc(kq);\n inc(i,1);\n end;\n writeln(kq);\n end;\n end.\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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 1, "memory_kb": 128}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s050253813", "group_id": "codeNet:p03281", "input_text": "var c,n,i,j,m:Longint;\nbegin\n\tread(n);\n\tfor i:=1 to n do begin\n\t\tm:=0;\n\t\tfor j:=1 to i do begin\n\t\t\tif i mod j=0 then inc(m);\n\t\tend;\n\t\tif(i mod 2=1)and(m=8)then inc(c);\n\tend;\n\twrite(c);\nend.\n", "language": "Pascal", "metadata": {"date": 1534746956, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03281.html", "problem_id": "p03281", "resource_group": "low_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/Pascal/s050253813.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s050253813", "user_id": "u657913472"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "var c,n,i,j,m:Longint;\nbegin\n\tread(n);\n\tfor i:=1 to n do begin\n\t\tm:=0;\n\t\tfor j:=1 to i do begin\n\t\t\tif i mod j=0 then inc(m);\n\t\tend;\n\t\tif(i mod 2=1)and(m=8)then inc(c);\n\tend;\n\twrite(c);\nend.\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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s508528132", "group_id": "codeNet:p03281", "input_text": "uses crt;\nvar\n n,i,j,k,h:integer;\nbegin\n read(n);\n h:=0;\n for i:=1 to n do\n if i mod 2=1 then\n begin\n k:=0;\n for j:=1 to n do\n if i mod j =0 then inc(k);\n if k=8 then inc(h);\n end;\n write(h);\n // readln;\n // readln;\nend.", "language": "Pascal", "metadata": {"date": 1534641385, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03281.html", "problem_id": "p03281", "resource_group": "low_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/Pascal/s508528132.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s508528132", "user_id": "u004929494"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "uses crt;\nvar\n n,i,j,k,h:integer;\nbegin\n read(n);\n h:=0;\n for i:=1 to n do\n if i mod 2=1 then\n begin\n k:=0;\n for j:=1 to n do\n if i mod j =0 then inc(k);\n if k=8 then inc(h);\n end;\n write(h);\n // readln;\n // readln;\nend.", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 1, "memory_kb": 128}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s877922976", "group_id": "codeNet:p03282", "input_text": "uses crt;\nvar\n a,b:string;\n i,j,x,y,k,code:longint;\nbegin\n readln(a);\n read(k);\n for y:=1 to k-1 do\n begin\n i:=1;\n while i<=k div 2 do\n begin\n val(a[i],j,code);\n for x:=1 to j-1 do\n begin\n insert(a[i],a,i);\n inc(i);\n end;\n inc(i);\n end;\n end;\n writeln(a[k]);\n // writeln(a);\n\n // readln;\n // readln;\nend.\n", "language": "Pascal", "metadata": {"date": 1534643688, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03282.html", "problem_id": "p03282", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03282/input.txt", "sample_output_relpath": "derived/input_output/data/p03282/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03282/Pascal/s877922976.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s877922976", "user_id": "u004929494"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "uses crt;\nvar\n a,b:string;\n i,j,x,y,k,code:longint;\nbegin\n readln(a);\n read(k);\n for y:=1 to k-1 do\n begin\n i:=1;\n while i<=k div 2 do\n begin\n val(a[i],j,code);\n for x:=1 to j-1 do\n begin\n insert(a[i],a,i);\n inc(i);\n end;\n inc(i);\n end;\n end;\n writeln(a[k]);\n // writeln(a);\n\n // readln;\n // readln;\nend.\n", "problem_context": "Score: 300 points\n\nProblem Statement\n\nMr. Infinity has a string S consisting of digits from 1 to 9. Each time the date changes, this string changes as follows:\n\nEach occurrence of 2 in S is replaced with 22. Similarly, each 3 becomes 333, 4 becomes 4444, 5 becomes 55555, 6 becomes 666666, 7 becomes 7777777, 8 becomes 88888888 and 9 becomes 999999999. 1 remains as 1.\n\nFor example, if S is 1324, it becomes 1333224444 the next day, and it becomes 133333333322224444444444444444 the day after next.\nYou are interested in what the string looks like after 5 \\times 10^{15} days. What is the K-th character from the left in the string after 5 \\times 10^{15} days?\n\nConstraints\n\nS is a string of length between 1 and 100 (inclusive).\n\nK is an integer between 1 and 10^{18} (inclusive).\n\nThe length of the string after 5 \\times 10^{15} days is at least K.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\nK\n\nOutput\n\nPrint the K-th character from the left in Mr. Infinity's string after 5 \\times 10^{15} days.\n\nSample Input 1\n\n1214\n4\n\nSample Output 1\n\n2\n\nThe string S changes as follows:\n\nNow: 1214\n\nAfter one day: 12214444\n\nAfter two days: 1222214444444444444444\n\nAfter three days: 12222222214444444444444444444444444444444444444444444444444444444444444444\n\nThe first five characters in the string after 5 \\times 10^{15} days is 12222. As K=4, we should print the fourth character, 2.\n\nSample Input 2\n\n3\n157\n\nSample Output 2\n\n3\n\nThe initial string is 3. The string after 5 \\times 10^{15} days consists only of 3.\n\nSample Input 3\n\n299792458\n9460730472580800\n\nSample Output 3\n\n2", "sample_input": "1214\n4\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03282", "source_text": "Score: 300 points\n\nProblem Statement\n\nMr. Infinity has a string S consisting of digits from 1 to 9. Each time the date changes, this string changes as follows:\n\nEach occurrence of 2 in S is replaced with 22. Similarly, each 3 becomes 333, 4 becomes 4444, 5 becomes 55555, 6 becomes 666666, 7 becomes 7777777, 8 becomes 88888888 and 9 becomes 999999999. 1 remains as 1.\n\nFor example, if S is 1324, it becomes 1333224444 the next day, and it becomes 133333333322224444444444444444 the day after next.\nYou are interested in what the string looks like after 5 \\times 10^{15} days. What is the K-th character from the left in the string after 5 \\times 10^{15} days?\n\nConstraints\n\nS is a string of length between 1 and 100 (inclusive).\n\nK is an integer between 1 and 10^{18} (inclusive).\n\nThe length of the string after 5 \\times 10^{15} days is at least K.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\nK\n\nOutput\n\nPrint the K-th character from the left in Mr. Infinity's string after 5 \\times 10^{15} days.\n\nSample Input 1\n\n1214\n4\n\nSample Output 1\n\n2\n\nThe string S changes as follows:\n\nNow: 1214\n\nAfter one day: 12214444\n\nAfter two days: 1222214444444444444444\n\nAfter three days: 12222222214444444444444444444444444444444444444444444444444444444444444444\n\nThe first five characters in the string after 5 \\times 10^{15} days is 12222. As K=4, we should print the fourth character, 2.\n\nSample Input 2\n\n3\n157\n\nSample Output 2\n\n3\n\nThe initial string is 3. The string after 5 \\times 10^{15} days consists only of 3.\n\nSample Input 3\n\n299792458\n9460730472580800\n\nSample Output 3\n\n2", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 478, "cpu_time_ms": 4, "memory_kb": 384}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s602045266", "group_id": "codeNet:p03283", "input_text": "var\n n,m,q,i,j,k,x,y:longint;\n f,a:array[0..501,0..501] of longint;\nbegin\n readln(n,m,q);\n for i:=1 to m do\n begin\n readln(x,y);\n inc(a[x,y]);\n end;\n for i:=1 to n do\n for j:=i to n do\n begin \n f[i,j]:=f[i,j-1];\n for k:=i to j do\n f[i,j]:=f[i,j]+a[k,j];\n end;\n for i:=1 to q do\n begin\n readln(x,y);\n writeln(f[x,y]);\n end;\nend.", "language": "Pascal", "metadata": {"date": 1534643752, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03283.html", "problem_id": "p03283", "resource_group": "low_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/Pascal/s602045266.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s602045266", "user_id": "u960852022"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "var\n n,m,q,i,j,k,x,y:longint;\n f,a:array[0..501,0..501] of longint;\nbegin\n readln(n,m,q);\n for i:=1 to m do\n begin\n readln(x,y);\n inc(a[x,y]);\n end;\n for i:=1 to n do\n for j:=i to n do\n begin \n f[i,j]:=f[i,j-1];\n for k:=i to j do\n f[i,j]:=f[i,j]+a[k,j];\n end;\n for i:=1 to q do\n begin\n readln(x,y);\n writeln(f[x,y]);\n end;\nend.", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 141, "memory_kb": 2688}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s293878470", "group_id": "codeNet:p03283", "input_text": "var\n\ta:array[0..510,0..510] of longint;\n\ti,j,k,s,n,m,q,x,y:longint;\nbegin\n\treadln(n,m,q);\n\tfillchar(a,sizeof(a),0);\n\tfor i:=1 to m do\n\tbegin\n\t\tread(x,y);\n\t\tfor j:=y to n do inc(a[x,j]);\n\tend;\n\tfor i:=1 to q do\n\tbegin\n\t\ts:=0;\n\t\tread(x,y);\n\t\tfor k:=x to y do s:=s+a[k,y];\n\t\twriteln(s);\n\tend;\nend.", "language": "Pascal", "metadata": {"date": 1534643689, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03283.html", "problem_id": "p03283", "resource_group": "low_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/Pascal/s293878470.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s293878470", "user_id": "u957998623"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "var\n\ta:array[0..510,0..510] of longint;\n\ti,j,k,s,n,m,q,x,y:longint;\nbegin\n\treadln(n,m,q);\n\tfillchar(a,sizeof(a),0);\n\tfor i:=1 to m do\n\tbegin\n\t\tread(x,y);\n\t\tfor j:=y to n do inc(a[x,j]);\n\tend;\n\tfor i:=1 to q do\n\tbegin\n\t\ts:=0;\n\t\tread(x,y);\n\t\tfor k:=x to y do s:=s+a[k,y];\n\t\twriteln(s);\n\tend;\nend.", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 262, "memory_kb": 1792}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s972172747", "group_id": "codeNet:p03284", "input_text": "var\n n,k:longint;\nbegin\n readln(n,k);\n if n mod k = 0 then \n writeln(0)\n else\n writeln(1);\nend.\n", "language": "Pascal", "metadata": {"date": 1565927683, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03284.html", "problem_id": "p03284", "resource_group": "low_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/Pascal/s972172747.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s972172747", "user_id": "u014847113"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "var\n n,k:longint;\nbegin\n readln(n,k);\n if n mod k = 0 then \n writeln(0)\n else\n writeln(1);\nend.\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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s842165010", "group_id": "codeNet:p03284", "input_text": "uses\n SysUtils,\n Classes;\n \n procedure MainProc;\n\tvar\n\t\ttext : string;\n\t\tstrlist : TStringList;\n\t\tcracker : Integer;\n\t\tperson : Integer;\n\tbegin\n\tReadLn(text);\n\tstrlist := TStringList.Create;\n\ttry\n\t\tstrlist.Delimiter := ' ';\n\t\tstrlist.DelimitedText := text;\n\t\tcracker := StrToInt(strlist.Strings[0]);\n\t\tperson := StrToInt(strlist.Strings[1]);\n\t\tfinally\n\t\t\tFreeAndNil(strlist);\n\t\t\tend;\n\tif cracker >= person then\n\t\tWriteLn(cracker mod person)\n\telse\n\t\tWriteLn(1);\n\tend;\n \nbegin\nMainProc;\nend.\n", "language": "Pascal", "metadata": {"date": 1536891974, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03284.html", "problem_id": "p03284", "resource_group": "low_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/Pascal/s842165010.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s842165010", "user_id": "u397546896"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "uses\n SysUtils,\n Classes;\n \n procedure MainProc;\n\tvar\n\t\ttext : string;\n\t\tstrlist : TStringList;\n\t\tcracker : Integer;\n\t\tperson : Integer;\n\tbegin\n\tReadLn(text);\n\tstrlist := TStringList.Create;\n\ttry\n\t\tstrlist.Delimiter := ' ';\n\t\tstrlist.DelimitedText := text;\n\t\tcracker := StrToInt(strlist.Strings[0]);\n\t\tperson := StrToInt(strlist.Strings[1]);\n\t\tfinally\n\t\t\tFreeAndNil(strlist);\n\t\t\tend;\n\tif cracker >= person then\n\t\tWriteLn(cracker mod person)\n\telse\n\t\tWriteLn(1);\n\tend;\n \nbegin\nMainProc;\nend.\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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 1, "memory_kb": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s674873028", "group_id": "codeNet:p03285", "input_text": "var n,i:Longint;\nbegin\nread(n);\nfor i:=0 to n do begin\n\tif (i*4<=n) and ((n-i*4)mod 7 = 0) then begin\n\t\twriteln('Yes');\n\t\texit;\n\tend;\nend;\nwriteln('No');\nend.\n", "language": "Pascal", "metadata": {"date": 1534036204, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03285.html", "problem_id": "p03285", "resource_group": "low_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/Pascal/s674873028.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s674873028", "user_id": "u657913472"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "var n,i:Longint;\nbegin\nread(n);\nfor i:=0 to n do begin\n\tif (i*4<=n) and ((n-i*4)mod 7 = 0) then begin\n\t\twriteln('Yes');\n\t\texit;\n\tend;\nend;\nwriteln('No');\nend.\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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 2, "memory_kb": 128}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s446064780", "group_id": "codeNet:p03287", "input_text": "const\n key=99999989;\nvar\n n,m,i,j:longint;\n k:int64;\n ans:real;\n a,c,f:array[0..100010] of int64;\n b:array[0..100000000] of longint;\nbegin\n readln(n,m);j:=1;\n for i:=1 to n do\n begin\n read(a[j]);\n c[j]:=i;\n f[i]:=f[i-1]+a[j];\n k:=f[i] mod m mod key;\n if b[k]<>0 then dec(j);\n inc(b[k]);\n inc(j);\n end;\n for i:=1 to j-1 do\n begin \n k:=f[c[i]] mod m mod key;\n if k=0 then ans:=ans+b[k];\n ans:=ans+b[k]*(b[k]-1) div 2;\n end;\n writeln(ans:0:0);\nend.", "language": "Pascal", "metadata": {"date": 1534041391, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03287.html", "problem_id": "p03287", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03287/input.txt", "sample_output_relpath": "derived/input_output/data/p03287/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03287/Pascal/s446064780.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s446064780", "user_id": "u960852022"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "const\n key=99999989;\nvar\n n,m,i,j:longint;\n k:int64;\n ans:real;\n a,c,f:array[0..100010] of int64;\n b:array[0..100000000] of longint;\nbegin\n readln(n,m);j:=1;\n for i:=1 to n do\n begin\n read(a[j]);\n c[j]:=i;\n f[i]:=f[i-1]+a[j];\n k:=f[i] mod m mod key;\n if b[k]<>0 then dec(j);\n inc(b[k]);\n inc(j);\n end;\n for i:=1 to j-1 do\n begin \n k:=f[c[i]] mod m mod key;\n if k=0 then ans:=ans+b[k];\n ans:=ans+b[k]*(b[k]-1) div 2;\n end;\n writeln(ans:0:0);\nend.", "problem_context": "Score : 400 points\n\nProblem Statement\n\nThere are N boxes arranged in a row from left to right. The i-th box from the left contains A_i candies.\n\nYou will take out the candies from some consecutive boxes and distribute them evenly to M children.\n\nSuch being the case, find the number of the pairs (l, r) that satisfy the following:\n\nl and r are both integers and satisfy 1 \\leq l \\leq r \\leq N.\n\nA_l + A_{l+1} + ... + A_r is a multiple of M.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 10^5\n\n2 \\leq M \\leq 10^9\n\n1 \\leq A_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the number of the pairs (l, r) that satisfy the conditions.\n\nNote that the number may not fit into a 32-bit integer type.\n\nSample Input 1\n\n3 2\n4 1 5\n\nSample Output 1\n\n3\n\nThe sum A_l + A_{l+1} + ... + A_r for each pair (l, r) is as follows:\n\nSum for (1, 1): 4\n\nSum for (1, 2): 5\n\nSum for (1, 3): 10\n\nSum for (2, 2): 1\n\nSum for (2, 3): 6\n\nSum for (3, 3): 5\n\nAmong these, three are multiples of 2.\n\nSample Input 2\n\n13 17\n29 7 5 7 9 51 7 13 8 55 42 9 81\n\nSample Output 2\n\n6\n\nSample Input 3\n\n10 400000000\n1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000\n\nSample Output 3\n\n25", "sample_input": "3 2\n4 1 5\n"}, "reference_outputs": ["3\n"], "source_document_id": "p03287", "source_text": "Score : 400 points\n\nProblem Statement\n\nThere are N boxes arranged in a row from left to right. The i-th box from the left contains A_i candies.\n\nYou will take out the candies from some consecutive boxes and distribute them evenly to M children.\n\nSuch being the case, find the number of the pairs (l, r) that satisfy the following:\n\nl and r are both integers and satisfy 1 \\leq l \\leq r \\leq N.\n\nA_l + A_{l+1} + ... + A_r is a multiple of M.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 10^5\n\n2 \\leq M \\leq 10^9\n\n1 \\leq A_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the number of the pairs (l, r) that satisfy the conditions.\n\nNote that the number may not fit into a 32-bit integer type.\n\nSample Input 1\n\n3 2\n4 1 5\n\nSample Output 1\n\n3\n\nThe sum A_l + A_{l+1} + ... + A_r for each pair (l, r) is as follows:\n\nSum for (1, 1): 4\n\nSum for (1, 2): 5\n\nSum for (1, 3): 10\n\nSum for (2, 2): 1\n\nSum for (2, 3): 6\n\nSum for (3, 3): 5\n\nAmong these, three are multiples of 2.\n\nSample Input 2\n\n13 17\n29 7 5 7 9 51 7 13 8 55 42 9 81\n\nSample Output 2\n\n6\n\nSample Input 3\n\n10 400000000\n1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000\n\nSample Output 3\n\n25", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 613, "cpu_time_ms": 97, "memory_kb": 391552}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s385359386", "group_id": "codeNet:p03287", "input_text": "var n,m,i,j:longint;\na,b:array[0..100000]of qword;\ncount:int64;\nbegin \n read(n,m);\n count:=0;\n for i:=1 to n do read(a[i]);\n b[1]:=a[1];\n b[0]:=0;\n for i:=2 to n do \n\tb[i]:=b[i-1]+a[i];\n for i:=1 to n do \n\tfor j:=i to n do \n\tif (b[j]-b[i-1]) mod m=0 then inc(count);\n write(count);\nend.\n\n", "language": "Pascal", "metadata": {"date": 1534041121, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03287.html", "problem_id": "p03287", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03287/input.txt", "sample_output_relpath": "derived/input_output/data/p03287/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03287/Pascal/s385359386.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s385359386", "user_id": "u914335902"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "var n,m,i,j:longint;\na,b:array[0..100000]of qword;\ncount:int64;\nbegin \n read(n,m);\n count:=0;\n for i:=1 to n do read(a[i]);\n b[1]:=a[1];\n b[0]:=0;\n for i:=2 to n do \n\tb[i]:=b[i-1]+a[i];\n for i:=1 to n do \n\tfor j:=i to n do \n\tif (b[j]-b[i-1]) mod m=0 then inc(count);\n write(count);\nend.\n\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nThere are N boxes arranged in a row from left to right. The i-th box from the left contains A_i candies.\n\nYou will take out the candies from some consecutive boxes and distribute them evenly to M children.\n\nSuch being the case, find the number of the pairs (l, r) that satisfy the following:\n\nl and r are both integers and satisfy 1 \\leq l \\leq r \\leq N.\n\nA_l + A_{l+1} + ... + A_r is a multiple of M.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 10^5\n\n2 \\leq M \\leq 10^9\n\n1 \\leq A_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the number of the pairs (l, r) that satisfy the conditions.\n\nNote that the number may not fit into a 32-bit integer type.\n\nSample Input 1\n\n3 2\n4 1 5\n\nSample Output 1\n\n3\n\nThe sum A_l + A_{l+1} + ... + A_r for each pair (l, r) is as follows:\n\nSum for (1, 1): 4\n\nSum for (1, 2): 5\n\nSum for (1, 3): 10\n\nSum for (2, 2): 1\n\nSum for (2, 3): 6\n\nSum for (3, 3): 5\n\nAmong these, three are multiples of 2.\n\nSample Input 2\n\n13 17\n29 7 5 7 9 51 7 13 8 55 42 9 81\n\nSample Output 2\n\n6\n\nSample Input 3\n\n10 400000000\n1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000\n\nSample Output 3\n\n25", "sample_input": "3 2\n4 1 5\n"}, "reference_outputs": ["3\n"], "source_document_id": "p03287", "source_text": "Score : 400 points\n\nProblem Statement\n\nThere are N boxes arranged in a row from left to right. The i-th box from the left contains A_i candies.\n\nYou will take out the candies from some consecutive boxes and distribute them evenly to M children.\n\nSuch being the case, find the number of the pairs (l, r) that satisfy the following:\n\nl and r are both integers and satisfy 1 \\leq l \\leq r \\leq N.\n\nA_l + A_{l+1} + ... + A_r is a multiple of M.\n\nConstraints\n\nAll values in input are integers.\n\n1 \\leq N \\leq 10^5\n\n2 \\leq M \\leq 10^9\n\n1 \\leq A_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the number of the pairs (l, r) that satisfy the conditions.\n\nNote that the number may not fit into a 32-bit integer type.\n\nSample Input 1\n\n3 2\n4 1 5\n\nSample Output 1\n\n3\n\nThe sum A_l + A_{l+1} + ... + A_r for each pair (l, r) is as follows:\n\nSum for (1, 1): 4\n\nSum for (1, 2): 5\n\nSum for (1, 3): 10\n\nSum for (2, 2): 1\n\nSum for (2, 3): 6\n\nSum for (3, 3): 5\n\nAmong these, three are multiples of 2.\n\nSample Input 2\n\n13 17\n29 7 5 7 9 51 7 13 8 55 42 9 81\n\nSample Output 2\n\n6\n\nSample Input 3\n\n10 400000000\n1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000\n\nSample Output 3\n\n25", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 2103, "memory_kb": 1664}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s642125113", "group_id": "codeNet:p03288", "input_text": "uses\n SysUtils,\n Classes;\n\n procedure mainProc;\n\tvar\n\t\tr: Integer;\n\tbegin\n\treadln(r);\n\tif (r >= 2800) then\n\t\twriteln('AGC')\n\telse if (r >= 1200) then\n\t\twriteln('ARC')\n\telse\n\t\twriteln('ABC');\n\tend;\n \nbegin\nmainProc;\nend.\n", "language": "Pascal", "metadata": {"date": 1536282488, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03288.html", "problem_id": "p03288", "resource_group": "low_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/Pascal/s642125113.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s642125113", "user_id": "u397546896"}, "prompt_components": {"gold_output": "ABC\n", "input_to_evaluate": "uses\n SysUtils,\n Classes;\n\n procedure mainProc;\n\tvar\n\t\tr: Integer;\n\tbegin\n\treadln(r);\n\tif (r >= 2800) then\n\t\twriteln('AGC')\n\telse if (r >= 1200) then\n\t\twriteln('ARC')\n\telse\n\t\twriteln('ABC');\n\tend;\n \nbegin\nmainProc;\nend.\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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 224, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s876121222", "group_id": "codeNet:p03288", "input_text": "var\n r:longint;\nbegin\n read(r);\n if r<1200 then write('ABC') else\n if r<2800 then write('ARC') else\n write('AGC');\nend.", "language": "Pascal", "metadata": {"date": 1533517774, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03288.html", "problem_id": "p03288", "resource_group": "low_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/Pascal/s876121222.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s876121222", "user_id": "u111363574"}, "prompt_components": {"gold_output": "ABC\n", "input_to_evaluate": "var\n r:longint;\nbegin\n read(r);\n if r<1200 then write('ABC') else\n if r<2800 then write('ARC') else\n write('AGC');\nend.", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 124, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s631716987", "group_id": "codeNet:p03289", "input_text": "uses\n SysUtils,\n Classes;\n \n function isLower(const value : string): boolean;\n\tconst\n\t\tUPP = 'ABCDEFGHIJKLMNOPQRSTUVWXYZ';\n\tvar\n\t\tupper : string;\n\t\ti : Integer;\n\tbegin\n\tResult := True;\n\tupper := UPP;\n\tif Length(Value) <> 1 then\n\t\tExit(False);\n\tfor i := 1 to Length(upper) do\n\t\tif value = upper[i] then\n\t\t\tExit(False);\n\tend;\n \n function judgeFunc(const Value : string) : string;\n\tconst\n\t\tBAD = 'WA';\n\t\tOK = 'AC';\n\tvar\n\t\ti : Integer;\n\t\tflag : Boolean;\n\tbegin\n\tResult := OK;\n\tflag := False;\n\ti := 1;\n\tif not (Value[i] = 'A') then\n\t\tExit(BAD);\n\tInc(i);\n\tif not isLower(Value[i]) then\n\t\tExit(BAD);\n\ti := Length(Value);\n\tif not isLower(Value[i]) then\n\t\tExit(BAD);\n\tfor i := 3 to Length(Value) - 1 do\n\t\tbegin\n\t\t\tif Value[i] = 'C' then\n\t\t\t\tbegin\n\t\t\t\tif flag then\n\t\t\t\t\tExit(BAD)\n\t\t\t\telse\n\t\t\t\t\tflag := True;\n\t\t\t\tend\n\t\t\telse if not isLower(Value[i]) then\n\t\t\t\tExit(BAD);\n\t\tend;\n\tif not flag then\n\t\tResult := BAD;\n\tend;\n \nprocedure MainProc;\n\tvar\n\t\taText : string;\n\t\tpushText : string;\n\tbegin\n\tReadLn(aText);\n\tpushText := judgeFunc(aText);\n\twriteLn(pushText);\n\tend;\n\t\nbegin\nMainProc;\nend.\n", "language": "Pascal", "metadata": {"date": 1536806183, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03289.html", "problem_id": "p03289", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03289/input.txt", "sample_output_relpath": "derived/input_output/data/p03289/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03289/Pascal/s631716987.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s631716987", "user_id": "u397546896"}, "prompt_components": {"gold_output": "AC\n", "input_to_evaluate": "uses\n SysUtils,\n Classes;\n \n function isLower(const value : string): boolean;\n\tconst\n\t\tUPP = 'ABCDEFGHIJKLMNOPQRSTUVWXYZ';\n\tvar\n\t\tupper : string;\n\t\ti : Integer;\n\tbegin\n\tResult := True;\n\tupper := UPP;\n\tif Length(Value) <> 1 then\n\t\tExit(False);\n\tfor i := 1 to Length(upper) do\n\t\tif value = upper[i] then\n\t\t\tExit(False);\n\tend;\n \n function judgeFunc(const Value : string) : string;\n\tconst\n\t\tBAD = 'WA';\n\t\tOK = 'AC';\n\tvar\n\t\ti : Integer;\n\t\tflag : Boolean;\n\tbegin\n\tResult := OK;\n\tflag := False;\n\ti := 1;\n\tif not (Value[i] = 'A') then\n\t\tExit(BAD);\n\tInc(i);\n\tif not isLower(Value[i]) then\n\t\tExit(BAD);\n\ti := Length(Value);\n\tif not isLower(Value[i]) then\n\t\tExit(BAD);\n\tfor i := 3 to Length(Value) - 1 do\n\t\tbegin\n\t\t\tif Value[i] = 'C' then\n\t\t\t\tbegin\n\t\t\t\tif flag then\n\t\t\t\t\tExit(BAD)\n\t\t\t\telse\n\t\t\t\t\tflag := True;\n\t\t\t\tend\n\t\t\telse if not isLower(Value[i]) then\n\t\t\t\tExit(BAD);\n\t\tend;\n\tif not flag then\n\t\tResult := BAD;\n\tend;\n \nprocedure MainProc;\n\tvar\n\t\taText : string;\n\t\tpushText : string;\n\tbegin\n\tReadLn(aText);\n\tpushText := judgeFunc(aText);\n\twriteLn(pushText);\n\tend;\n\t\nbegin\nMainProc;\nend.\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nYou are given a string S. Each character of S is uppercase or lowercase English letter.\nDetermine if S satisfies all of the following conditions:\n\nThe initial character of S is an uppercase A.\n\nThere is exactly one occurrence of C between the third character from the beginning and the second to last character (inclusive).\n\nAll letters except the A and C mentioned above are lowercase.\n\nConstraints\n\n4 ≤ |S| ≤ 10 (|S| is the length of the string S.)\n\nEach character of S is uppercase or lowercase English letter.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nIf S satisfies all of the conditions in the problem statement, print AC; otherwise, print WA.\n\nSample Input 1\n\nAtCoder\n\nSample Output 1\n\nAC\n\nThe first letter is A, the third letter is C and the remaining letters are all lowercase, so all the conditions are satisfied.\n\nSample Input 2\n\nACoder\n\nSample Output 2\n\nWA\n\nThe second letter should not be C.\n\nSample Input 3\n\nAcycliC\n\nSample Output 3\n\nWA\n\nThe last letter should not be C, either.\n\nSample Input 4\n\nAtCoCo\n\nSample Output 4\n\nWA\n\nThere should not be two or more occurrences of C.\n\nSample Input 5\n\nAtcoder\n\nSample Output 5\n\nWA\n\nThe number of C should not be zero, either.", "sample_input": "AtCoder\n"}, "reference_outputs": ["AC\n"], "source_document_id": "p03289", "source_text": "Score : 200 points\n\nProblem Statement\n\nYou are given a string S. Each character of S is uppercase or lowercase English letter.\nDetermine if S satisfies all of the following conditions:\n\nThe initial character of S is an uppercase A.\n\nThere is exactly one occurrence of C between the third character from the beginning and the second to last character (inclusive).\n\nAll letters except the A and C mentioned above are lowercase.\n\nConstraints\n\n4 ≤ |S| ≤ 10 (|S| is the length of the string S.)\n\nEach character of S is uppercase or lowercase English letter.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nIf S satisfies all of the conditions in the problem statement, print AC; otherwise, print WA.\n\nSample Input 1\n\nAtCoder\n\nSample Output 1\n\nAC\n\nThe first letter is A, the third letter is C and the remaining letters are all lowercase, so all the conditions are satisfied.\n\nSample Input 2\n\nACoder\n\nSample Output 2\n\nWA\n\nThe second letter should not be C.\n\nSample Input 3\n\nAcycliC\n\nSample Output 3\n\nWA\n\nThe last letter should not be C, either.\n\nSample Input 4\n\nAtCoCo\n\nSample Output 4\n\nWA\n\nThere should not be two or more occurrences of C.\n\nSample Input 5\n\nAtcoder\n\nSample Output 5\n\nWA\n\nThe number of C should not be zero, either.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1079, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s022119384", "group_id": "codeNet:p03290", "input_text": "var\n\tn,g,a,b,i,j,k,l,s,max:longint;\n\tf,t:array[0..10010] of longint;\nbegin \n\treadln(n,g);\n\tg:=g div 100; \n\tfillchar(f,sizeof(f),$7f);\n\tf[0]:=0;\n\tfor i:=1 to n do\n\tbegin \n\t\tread(a,b);\n\t\tt:=f;\n\t\tfor j:=a downto 0 do \n\t\tbegin \n\t\t\ts:=i*j;\n\t\t\tif j=a then s:=s+b div 100;\n\t\t\tfor k:=g downto 0 do\n\t\t\tbegin\n\t\t\t\tif k+s>g then l:=g else l:=k+s;\n\t\t\t\tif f[l]>f[k]+j then t[l]:=t[k]+j;\n\t\t\tend;\n\t\tend;\n\t\tf:=t;\n\tend;\n\tmax:=0;\n\tfor i:=1 to g do\n\t\tif (f[i]>max) and (f[i]<>$7f) then max:=f[i];\n\twriteln(max);\nend.", "language": "Pascal", "metadata": {"date": 1538188338, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03290.html", "problem_id": "p03290", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03290/input.txt", "sample_output_relpath": "derived/input_output/data/p03290/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03290/Pascal/s022119384.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s022119384", "user_id": "u957998623"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "var\n\tn,g,a,b,i,j,k,l,s,max:longint;\n\tf,t:array[0..10010] of longint;\nbegin \n\treadln(n,g);\n\tg:=g div 100; \n\tfillchar(f,sizeof(f),$7f);\n\tf[0]:=0;\n\tfor i:=1 to n do\n\tbegin \n\t\tread(a,b);\n\t\tt:=f;\n\t\tfor j:=a downto 0 do \n\t\tbegin \n\t\t\ts:=i*j;\n\t\t\tif j=a then s:=s+b div 100;\n\t\t\tfor k:=g downto 0 do\n\t\t\tbegin\n\t\t\t\tif k+s>g then l:=g else l:=k+s;\n\t\t\t\tif f[l]>f[k]+j then t[l]:=t[k]+j;\n\t\t\tend;\n\t\tend;\n\t\tf:=t;\n\tend;\n\tmax:=0;\n\tfor i:=1 to g do\n\t\tif (f[i]>max) and (f[i]<>$7f) then max:=f[i];\n\twriteln(max);\nend.", "problem_context": "Score : 300 points\n\nProblem Statement\n\nA programming competition site AtCode provides algorithmic problems.\nEach problem is allocated a score based on its difficulty.\nCurrently, for each integer i between 1 and D (inclusive), there are p_i problems with a score of 100i points.\nThese p_1 + … + p_D problems are all of the problems available on AtCode.\n\nA user of AtCode has a value called total score.\nThe total score of a user is the sum of the following two elements:\n\nBase score: the sum of the scores of all problems solved by the user.\n\nPerfect bonuses: when a user solves all problems with a score of 100i points, he/she earns the perfect bonus of c_i points, aside from the base score (1 ≤ i ≤ D).\n\nTakahashi, who is the new user of AtCode, has not solved any problem.\nHis objective is to have a total score of G or more points.\nAt least how many problems does he need to solve for this objective?\n\nConstraints\n\n1 ≤ D ≤ 10\n\n1 ≤ p_i ≤ 100\n\n100 ≤ c_i ≤ 10^6\n\n100 ≤ G\n\nAll values in input are integers.\n\nc_i and G are all multiples of 100.\n\nIt is possible to have a total score of G or more points.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD G\np_1 c_1\n:\np_D c_D\n\nOutput\n\nPrint the minimum number of problems that needs to be solved in order to have a total score of G or more points. Note that this objective is always achievable (see Constraints).\n\nSample Input 1\n\n2 700\n3 500\n5 800\n\nSample Output 1\n\n3\n\nIn this case, there are three problems each with 100 points and five problems each with 200 points. The perfect bonus for solving all the 100-point problems is 500 points, and the perfect bonus for solving all the 200-point problems is 800 points. Takahashi's objective is to have a total score of 700 points or more.\n\nOne way to achieve this objective is to solve four 200-point problems and earn a base score of 800 points. However, if we solve three 100-point problems, we can earn the perfect bonus of 500 points in addition to the base score of 300 points, for a total score of 800 points, and we can achieve the objective with fewer problems.\n\nSample Input 2\n\n2 2000\n3 500\n5 800\n\nSample Output 2\n\n7\n\nThis case is similar to Sample Input 1, but the Takahashi's objective this time is 2000 points or more. In this case, we inevitably need to solve all five 200-point problems, and by solving two 100-point problems additionally we have the total score of 2000 points.\n\nSample Input 3\n\n2 400\n3 500\n5 800\n\nSample Output 3\n\n2\n\nThis case is again similar to Sample Input 1, but the Takahashi's objective this time is 400 points or more. In this case, we only need to solve two 200-point problems to achieve the objective.\n\nSample Input 4\n\n5 25000\n20 1000\n40 1000\n50 1000\n30 1000\n1 1000\n\nSample Output 4\n\n66\n\nThere is only one 500-point problem, but the perfect bonus can be earned even in such a case.", "sample_input": "2 700\n3 500\n5 800\n"}, "reference_outputs": ["3\n"], "source_document_id": "p03290", "source_text": "Score : 300 points\n\nProblem Statement\n\nA programming competition site AtCode provides algorithmic problems.\nEach problem is allocated a score based on its difficulty.\nCurrently, for each integer i between 1 and D (inclusive), there are p_i problems with a score of 100i points.\nThese p_1 + … + p_D problems are all of the problems available on AtCode.\n\nA user of AtCode has a value called total score.\nThe total score of a user is the sum of the following two elements:\n\nBase score: the sum of the scores of all problems solved by the user.\n\nPerfect bonuses: when a user solves all problems with a score of 100i points, he/she earns the perfect bonus of c_i points, aside from the base score (1 ≤ i ≤ D).\n\nTakahashi, who is the new user of AtCode, has not solved any problem.\nHis objective is to have a total score of G or more points.\nAt least how many problems does he need to solve for this objective?\n\nConstraints\n\n1 ≤ D ≤ 10\n\n1 ≤ p_i ≤ 100\n\n100 ≤ c_i ≤ 10^6\n\n100 ≤ G\n\nAll values in input are integers.\n\nc_i and G are all multiples of 100.\n\nIt is possible to have a total score of G or more points.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD G\np_1 c_1\n:\np_D c_D\n\nOutput\n\nPrint the minimum number of problems that needs to be solved in order to have a total score of G or more points. Note that this objective is always achievable (see Constraints).\n\nSample Input 1\n\n2 700\n3 500\n5 800\n\nSample Output 1\n\n3\n\nIn this case, there are three problems each with 100 points and five problems each with 200 points. The perfect bonus for solving all the 100-point problems is 500 points, and the perfect bonus for solving all the 200-point problems is 800 points. Takahashi's objective is to have a total score of 700 points or more.\n\nOne way to achieve this objective is to solve four 200-point problems and earn a base score of 800 points. However, if we solve three 100-point problems, we can earn the perfect bonus of 500 points in addition to the base score of 300 points, for a total score of 800 points, and we can achieve the objective with fewer problems.\n\nSample Input 2\n\n2 2000\n3 500\n5 800\n\nSample Output 2\n\n7\n\nThis case is similar to Sample Input 1, but the Takahashi's objective this time is 2000 points or more. In this case, we inevitably need to solve all five 200-point problems, and by solving two 100-point problems additionally we have the total score of 2000 points.\n\nSample Input 3\n\n2 400\n3 500\n5 800\n\nSample Output 3\n\n2\n\nThis case is again similar to Sample Input 1, but the Takahashi's objective this time is 400 points or more. In this case, we only need to solve two 200-point problems to achieve the objective.\n\nSample Input 4\n\n5 25000\n20 1000\n40 1000\n50 1000\n30 1000\n1 1000\n\nSample Output 4\n\n66\n\nThere is only one 500-point problem, but the perfect bonus can be earned even in such a case.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 99, "memory_kb": 128}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s751479309", "group_id": "codeNet:p03290", "input_text": "var goal:longint;\nn,i,best:integer;\np:array[1..10]of integer;\nc:array[1..10]of longint;\nprocedure dfs(d,x:integer;t:longint);\nvar j:integer;\nbegin \n\tif t>=goal then \n\tbegin\n\t\tbest:=x;\n\t\texit;\n\tend;\n\tif d>n then exit;\n\tj:=0;\n\twhile (j<=p[d]-1) and (x+j=goal then \n\tbegin\n\t\tbest:=x;\n\t\texit;\n\tend;\n\tif d>n then exit;\n\tj:=0;\n\twhile (j<=p[d]-1) and (x+j=goal then \n begin \n best:=x;\n exit;\n end;\n if d>n then exit;\n for j:=0 to p[d]-1 do if x+j=goal then \n begin \n best:=x;\n exit;\n end;\n if d>n then exit;\n for j:=0 to p[d]-1 do if x+j999999999 then exit(f[n,m]);\n for i:=0 to p[n]-1 do\n f[n,m]:=min(f[n,m],dp(n-1,m-i*n)+i);\n f[n,m]:=min(f[n,m],dp(n-1,m-p[n]*n-c[n])+p[n]);\n exit(f[n,m]);\nend;\nbegin\n readln(d,g);g:=g div 100;\n for i:=1 to d do\n begin\n readln(p[i],c[i]);\n c[i]:=c[i] div 100;\n end;\n for i:=1 to d do\n for j:=1 to g do\n f[i,j]:=999999999;\n writeln(dp(d,g));\nend.", "language": "Pascal", "metadata": {"date": 1533593923, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03290.html", "problem_id": "p03290", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03290/input.txt", "sample_output_relpath": "derived/input_output/data/p03290/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03290/Pascal/s366906547.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s366906547", "user_id": "u960852022"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "var\n d,g,i,j:longint;\n f:array[0..20,0..200010] of longint;\n p,c:array[0..20] of longint;\nfunction min(a,b:longint):longint;\nbegin\n if a999999999 then exit(f[n,m]);\n for i:=0 to p[n]-1 do\n f[n,m]:=min(f[n,m],dp(n-1,m-i*n)+i);\n f[n,m]:=min(f[n,m],dp(n-1,m-p[n]*n-c[n])+p[n]);\n exit(f[n,m]);\nend;\nbegin\n readln(d,g);g:=g div 100;\n for i:=1 to d do\n begin\n readln(p[i],c[i]);\n c[i]:=c[i] div 100;\n end;\n for i:=1 to d do\n for j:=1 to g do\n f[i,j]:=999999999;\n writeln(dp(d,g));\nend.", "problem_context": "Score : 300 points\n\nProblem Statement\n\nA programming competition site AtCode provides algorithmic problems.\nEach problem is allocated a score based on its difficulty.\nCurrently, for each integer i between 1 and D (inclusive), there are p_i problems with a score of 100i points.\nThese p_1 + … + p_D problems are all of the problems available on AtCode.\n\nA user of AtCode has a value called total score.\nThe total score of a user is the sum of the following two elements:\n\nBase score: the sum of the scores of all problems solved by the user.\n\nPerfect bonuses: when a user solves all problems with a score of 100i points, he/she earns the perfect bonus of c_i points, aside from the base score (1 ≤ i ≤ D).\n\nTakahashi, who is the new user of AtCode, has not solved any problem.\nHis objective is to have a total score of G or more points.\nAt least how many problems does he need to solve for this objective?\n\nConstraints\n\n1 ≤ D ≤ 10\n\n1 ≤ p_i ≤ 100\n\n100 ≤ c_i ≤ 10^6\n\n100 ≤ G\n\nAll values in input are integers.\n\nc_i and G are all multiples of 100.\n\nIt is possible to have a total score of G or more points.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD G\np_1 c_1\n:\np_D c_D\n\nOutput\n\nPrint the minimum number of problems that needs to be solved in order to have a total score of G or more points. Note that this objective is always achievable (see Constraints).\n\nSample Input 1\n\n2 700\n3 500\n5 800\n\nSample Output 1\n\n3\n\nIn this case, there are three problems each with 100 points and five problems each with 200 points. The perfect bonus for solving all the 100-point problems is 500 points, and the perfect bonus for solving all the 200-point problems is 800 points. Takahashi's objective is to have a total score of 700 points or more.\n\nOne way to achieve this objective is to solve four 200-point problems and earn a base score of 800 points. However, if we solve three 100-point problems, we can earn the perfect bonus of 500 points in addition to the base score of 300 points, for a total score of 800 points, and we can achieve the objective with fewer problems.\n\nSample Input 2\n\n2 2000\n3 500\n5 800\n\nSample Output 2\n\n7\n\nThis case is similar to Sample Input 1, but the Takahashi's objective this time is 2000 points or more. In this case, we inevitably need to solve all five 200-point problems, and by solving two 100-point problems additionally we have the total score of 2000 points.\n\nSample Input 3\n\n2 400\n3 500\n5 800\n\nSample Output 3\n\n2\n\nThis case is again similar to Sample Input 1, but the Takahashi's objective this time is 400 points or more. In this case, we only need to solve two 200-point problems to achieve the objective.\n\nSample Input 4\n\n5 25000\n20 1000\n40 1000\n50 1000\n30 1000\n1 1000\n\nSample Output 4\n\n66\n\nThere is only one 500-point problem, but the perfect bonus can be earned even in such a case.", "sample_input": "2 700\n3 500\n5 800\n"}, "reference_outputs": ["3\n"], "source_document_id": "p03290", "source_text": "Score : 300 points\n\nProblem Statement\n\nA programming competition site AtCode provides algorithmic problems.\nEach problem is allocated a score based on its difficulty.\nCurrently, for each integer i between 1 and D (inclusive), there are p_i problems with a score of 100i points.\nThese p_1 + … + p_D problems are all of the problems available on AtCode.\n\nA user of AtCode has a value called total score.\nThe total score of a user is the sum of the following two elements:\n\nBase score: the sum of the scores of all problems solved by the user.\n\nPerfect bonuses: when a user solves all problems with a score of 100i points, he/she earns the perfect bonus of c_i points, aside from the base score (1 ≤ i ≤ D).\n\nTakahashi, who is the new user of AtCode, has not solved any problem.\nHis objective is to have a total score of G or more points.\nAt least how many problems does he need to solve for this objective?\n\nConstraints\n\n1 ≤ D ≤ 10\n\n1 ≤ p_i ≤ 100\n\n100 ≤ c_i ≤ 10^6\n\n100 ≤ G\n\nAll values in input are integers.\n\nc_i and G are all multiples of 100.\n\nIt is possible to have a total score of G or more points.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nD G\np_1 c_1\n:\np_D c_D\n\nOutput\n\nPrint the minimum number of problems that needs to be solved in order to have a total score of G or more points. Note that this objective is always achievable (see Constraints).\n\nSample Input 1\n\n2 700\n3 500\n5 800\n\nSample Output 1\n\n3\n\nIn this case, there are three problems each with 100 points and five problems each with 200 points. The perfect bonus for solving all the 100-point problems is 500 points, and the perfect bonus for solving all the 200-point problems is 800 points. Takahashi's objective is to have a total score of 700 points or more.\n\nOne way to achieve this objective is to solve four 200-point problems and earn a base score of 800 points. However, if we solve three 100-point problems, we can earn the perfect bonus of 500 points in addition to the base score of 300 points, for a total score of 800 points, and we can achieve the objective with fewer problems.\n\nSample Input 2\n\n2 2000\n3 500\n5 800\n\nSample Output 2\n\n7\n\nThis case is similar to Sample Input 1, but the Takahashi's objective this time is 2000 points or more. In this case, we inevitably need to solve all five 200-point problems, and by solving two 100-point problems additionally we have the total score of 2000 points.\n\nSample Input 3\n\n2 400\n3 500\n5 800\n\nSample Output 3\n\n2\n\nThis case is again similar to Sample Input 1, but the Takahashi's objective this time is 400 points or more. In this case, we only need to solve two 200-point problems to achieve the objective.\n\nSample Input 4\n\n5 25000\n20 1000\n40 1000\n50 1000\n30 1000\n1 1000\n\nSample Output 4\n\n66\n\nThere is only one 500-point problem, but the perfect bonus can be earned even in such a case.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 741, "cpu_time_ms": 2103, "memory_kb": 9088}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s231514806", "group_id": "codeNet:p03291", "input_text": "var\n d,g,i,j:longint;\n f:array[0..20,0..200010] of longint;\n p,c:array[0..20] of longint;\nfunction min(a,b:longint):longint;\nbegin\n if a999999999 then exit(f[n,m]);\n for i:=0 to p[n]-1 do\n f[n,m]:=min(f[n,m],dp(n-1,m-i*n)+i);\n f[n,m]:=min(f[n,m],dp(n-1,m-p[n]*n-c[n])+p[n]);\n exit(f[n,m]);\nend;\nbegin\n readln(d,g);g:=g div 100;\n for i:=1 to d do\n begin\n readln(p[i],c[i]);\n c[i]:=c[i] div 100;\n end;\n for i:=1 to d do\n for j:=1 to g do\n f[i,j]:=999999999;\n writeln(dp(d,g));\nend.", "language": "Pascal", "metadata": {"date": 1533596502, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03291.html", "problem_id": "p03291", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03291/input.txt", "sample_output_relpath": "derived/input_output/data/p03291/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03291/Pascal/s231514806.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s231514806", "user_id": "u960852022"}, "prompt_components": {"gold_output": "8\n", "input_to_evaluate": "var\n d,g,i,j:longint;\n f:array[0..20,0..200010] of longint;\n p,c:array[0..20] of longint;\nfunction min(a,b:longint):longint;\nbegin\n if a999999999 then exit(f[n,m]);\n for i:=0 to p[n]-1 do\n f[n,m]:=min(f[n,m],dp(n-1,m-i*n)+i);\n f[n,m]:=min(f[n,m],dp(n-1,m-p[n]*n-c[n])+p[n]);\n exit(f[n,m]);\nend;\nbegin\n readln(d,g);g:=g div 100;\n for i:=1 to d do\n begin\n readln(p[i],c[i]);\n c[i]:=c[i] div 100;\n end;\n for i:=1 to d do\n for j:=1 to g do\n f[i,j]:=999999999;\n writeln(dp(d,g));\nend.", "problem_context": "Score : 400 points\n\nProblem Statement\n\nThe ABC number of a string T is the number of triples of integers (i, j, k) that satisfy all of the following conditions:\n\n1 ≤ i < j < k ≤ |T| (|T| is the length of T.)\n\nT_i = A (T_i is the i-th character of T from the beginning.)\n\nT_j = B\n\nT_k = C\n\nFor example, when T = ABCBC, there are three triples of integers (i, j, k) that satisfy the conditions: (1, 2, 3), (1, 2, 5), (1, 4, 5). Thus, the ABC number of T is 3.\n\nYou are given a string S. Each character of S is A, B, C or ?.\n\nLet Q be the number of occurrences of ? in S. We can make 3^Q strings by replacing each occurrence of ? in S with A, B or C. Find the sum of the ABC numbers of all these strings.\n\nThis sum can be extremely large, so print the sum modulo 10^9 + 7.\n\nConstraints\n\n3 ≤ |S| ≤ 10^5\n\nEach character of S is A, B, C or ?.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the sum of the ABC numbers of all the 3^Q strings, modulo 10^9 + 7.\n\nSample Input 1\n\nA??C\n\nSample Output 1\n\n8\n\nIn this case, Q = 2, and we can make 3^Q = 9 strings by by replacing each occurrence of ? with A, B or C. The ABC number of each of these strings is as follows:\n\nAAAC: 0\n\nAABC: 2\n\nAACC: 0\n\nABAC: 1\n\nABBC: 2\n\nABCC: 2\n\nACAC: 0\n\nACBC: 1\n\nACCC: 0\n\nThe sum of these is 0 + 2 + 0 + 1 + 2 + 2 + 0 + 1 + 0 = 8, so we print 8 modulo 10^9 + 7, that is, 8.\n\nSample Input 2\n\nABCBC\n\nSample Output 2\n\n3\n\nWhen Q = 0, we print the ABC number of S itself, modulo 10^9 + 7. This string is the same as the one given as an example in the problem statement, and its ABC number is 3.\n\nSample Input 3\n\n????C?????B??????A???????\n\nSample Output 3\n\n979596887\n\nIn this case, the sum of the ABC numbers of all the 3^Q strings is 2291979612924, and we should print this number modulo 10^9 + 7, that is, 979596887.", "sample_input": "A??C\n"}, "reference_outputs": ["8\n"], "source_document_id": "p03291", "source_text": "Score : 400 points\n\nProblem Statement\n\nThe ABC number of a string T is the number of triples of integers (i, j, k) that satisfy all of the following conditions:\n\n1 ≤ i < j < k ≤ |T| (|T| is the length of T.)\n\nT_i = A (T_i is the i-th character of T from the beginning.)\n\nT_j = B\n\nT_k = C\n\nFor example, when T = ABCBC, there are three triples of integers (i, j, k) that satisfy the conditions: (1, 2, 3), (1, 2, 5), (1, 4, 5). Thus, the ABC number of T is 3.\n\nYou are given a string S. Each character of S is A, B, C or ?.\n\nLet Q be the number of occurrences of ? in S. We can make 3^Q strings by replacing each occurrence of ? in S with A, B or C. Find the sum of the ABC numbers of all these strings.\n\nThis sum can be extremely large, so print the sum modulo 10^9 + 7.\n\nConstraints\n\n3 ≤ |S| ≤ 10^5\n\nEach character of S is A, B, C or ?.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the sum of the ABC numbers of all the 3^Q strings, modulo 10^9 + 7.\n\nSample Input 1\n\nA??C\n\nSample Output 1\n\n8\n\nIn this case, Q = 2, and we can make 3^Q = 9 strings by by replacing each occurrence of ? with A, B or C. The ABC number of each of these strings is as follows:\n\nAAAC: 0\n\nAABC: 2\n\nAACC: 0\n\nABAC: 1\n\nABBC: 2\n\nABCC: 2\n\nACAC: 0\n\nACBC: 1\n\nACCC: 0\n\nThe sum of these is 0 + 2 + 0 + 1 + 2 + 2 + 0 + 1 + 0 = 8, so we print 8 modulo 10^9 + 7, that is, 8.\n\nSample Input 2\n\nABCBC\n\nSample Output 2\n\n3\n\nWhen Q = 0, we print the ABC number of S itself, modulo 10^9 + 7. This string is the same as the one given as an example in the problem statement, and its ABC number is 3.\n\nSample Input 3\n\n????C?????B??????A???????\n\nSample Output 3\n\n979596887\n\nIn this case, the sum of the ABC numbers of all the 3^Q strings is 2291979612924, and we should print this number modulo 10^9 + 7, that is, 979596887.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 741, "cpu_time_ms": 7, "memory_kb": 128}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s674621983", "group_id": "codeNet:p03292", "input_text": "uses\n SysUtils,\n Classes;\n\nvar\n\ti, j, t : Integer;\n\tatype : array of Integer;\n\tstr : String;\n\tstrlist : TStringList;\nbegin\n\tsetLength(atype, 3);\n\t\n\treadln(str);\n\tstrlist := TStringList.Create;\n\ttry\n\t\tstrlist.Delimiter := ' ';\n\t\tstrlist.DelimitedText := str;\n\t\tfor i := 0 to 2 do\n\t\t\tatype[i] := StrToInt(strlist.Strings[i]);\n\tfinally\n\t\tstrlist.free;\n\t\tend;\n\t\t\n\tfor i := 0 to 2 do\n\t\tbegin\n\t\tfor j := 2 downto i + 1 do\n\t\t\tbegin\n\t\t\t\tif atype[j - 1] > atype[j] then\n\t\t\t\t\tbegin\n\t\t\t\t\tt := atype[j - 1];\n\t\t\t\t\tatype[j - 1] := atype[j];\n\t\t\t\t\tatype[j] := t;\n\t\t\t\t\tend;\n\t\t\tend;\n\t\tend;\n\t\tt := atype[2] - atype[0];\n\t\twriteLn(t);\nend.\n", "language": "Pascal", "metadata": {"date": 1532222322, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03292.html", "problem_id": "p03292", "resource_group": "low_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/Pascal/s674621983.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s674621983", "user_id": "u397546896"}, "prompt_components": {"gold_output": "5\n", "input_to_evaluate": "uses\n SysUtils,\n Classes;\n\nvar\n\ti, j, t : Integer;\n\tatype : array of Integer;\n\tstr : String;\n\tstrlist : TStringList;\nbegin\n\tsetLength(atype, 3);\n\t\n\treadln(str);\n\tstrlist := TStringList.Create;\n\ttry\n\t\tstrlist.Delimiter := ' ';\n\t\tstrlist.DelimitedText := str;\n\t\tfor i := 0 to 2 do\n\t\t\tatype[i] := StrToInt(strlist.Strings[i]);\n\tfinally\n\t\tstrlist.free;\n\t\tend;\n\t\t\n\tfor i := 0 to 2 do\n\t\tbegin\n\t\tfor j := 2 downto i + 1 do\n\t\t\tbegin\n\t\t\t\tif atype[j - 1] > atype[j] then\n\t\t\t\t\tbegin\n\t\t\t\t\tt := atype[j - 1];\n\t\t\t\t\tatype[j - 1] := atype[j];\n\t\t\t\t\tatype[j] := t;\n\t\t\t\t\tend;\n\t\t\tend;\n\t\tend;\n\t\tt := atype[2] - atype[0];\n\t\twriteLn(t);\nend.\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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 621, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s283271995", "group_id": "codeNet:p03293", "input_text": "uses\n SysUtils,\n Classes;\n \nfunction CheckFunc(strS : String; const strT : String) : Boolean;\n\tvar\n\t\tcount : Integer;\n\t\tstr : String;\n\tbegin\n\tResult := False;\n\tcount := 1;\n\tif (Length(strS) <> Length(strT)) then\n\t\texit;\n\tif (Length(strS) = 1) then\n\t\texit;\n\twhile (Length(strS) <> count) do\n\t\tbegin\n\t\tif (strS = strT)then\n\t\t\tbegin\n\t\t\tResult := True;\n\t\t\texit;\n\t\t\tend;\n\t\tstr := strS[Length(strS)];\n\t\tstr := str + Copy(strS, 1, Length(strS) - 1);\n\t\tstrS := str;\n\t\tcount := count + 1;\n\t\tend;\n\tend;\n\nvar\n\tstrS, strT : String;\nbegin\t\n\treadln(strS);\n\treadln(strT);\n\t\n\tif CheckFunc(strS, strT) then\n\t\twriteln('Yes')\n\telse\n\t\twriteln('No');\nend.", "language": "Pascal", "metadata": {"date": 1532226723, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03293.html", "problem_id": "p03293", "resource_group": "low_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/Pascal/s283271995.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s283271995", "user_id": "u397546896"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "uses\n SysUtils,\n Classes;\n \nfunction CheckFunc(strS : String; const strT : String) : Boolean;\n\tvar\n\t\tcount : Integer;\n\t\tstr : String;\n\tbegin\n\tResult := False;\n\tcount := 1;\n\tif (Length(strS) <> Length(strT)) then\n\t\texit;\n\tif (Length(strS) = 1) then\n\t\texit;\n\twhile (Length(strS) <> count) do\n\t\tbegin\n\t\tif (strS = strT)then\n\t\t\tbegin\n\t\t\tResult := True;\n\t\t\texit;\n\t\t\tend;\n\t\tstr := strS[Length(strS)];\n\t\tstr := str + Copy(strS, 1, Length(strS) - 1);\n\t\tstrS := str;\n\t\tcount := count + 1;\n\t\tend;\n\tend;\n\nvar\n\tstrS, strT : String;\nbegin\t\n\treadln(strS);\n\treadln(strT);\n\t\n\tif CheckFunc(strS, strT) then\n\t\twriteln('Yes')\n\telse\n\t\twriteln('No');\nend.", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 1, "memory_kb": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s514853629", "group_id": "codeNet:p03294", "input_text": "var i,s,n:longint;\n A:Array[1..4000] of longint;\nbegin\n readln(n);\n for i:=1 to n do \n begin\n read(A[i]);\n s:=s+A[i];\n end;\n writeln(s-n);\nend.", "language": "Pascal", "metadata": {"date": 1535937305, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03294.html", "problem_id": "p03294", "resource_group": "low_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/Pascal/s514853629.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s514853629", "user_id": "u060797441"}, "prompt_components": {"gold_output": "10\n", "input_to_evaluate": "var i,s,n:longint;\n A:Array[1..4000] of longint;\nbegin\n readln(n);\n for i:=1 to n do \n begin\n read(A[i]);\n s:=s+A[i];\n end;\n writeln(s-n);\nend.", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 1, "memory_kb": 128}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s942139788", "group_id": "codeNet:p03294", "input_text": "uses\n SysUtils,\n Classes;\n\nvar\n\ta, i, total : Integer;\n\tatype : array of Integer;\n\tstr : String;\n\tstrlist : TStringList;\nbegin\n\treadln(a);\n\tsetLength(atype, a);\n\t\n\treadln(str);\n\tstrlist := TStringList.Create;\n\ttry\n\t\tstrlist.Delimiter := ' ';\n\t\tstrlist.DelimitedText := str;\n\t\tfor i := 0 to a - 1 do\n\t\t\tatype[i] := StrToInt(strlist.Strings[i]);\n\tfinally\n\t\tstrlist.free;\n\t\tend;\n\ttotal := 0;\t\n\tfor i := 0 to a - 1 do\n\t\tbegin\n\t\ttotal := total + (atype[i] - 1);\n\t\tend;\n\t\twriteLn(total);\nend.", "language": "Pascal", "metadata": {"date": 1532227544, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03294.html", "problem_id": "p03294", "resource_group": "low_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/Pascal/s942139788.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s942139788", "user_id": "u397546896"}, "prompt_components": {"gold_output": "10\n", "input_to_evaluate": "uses\n SysUtils,\n Classes;\n\nvar\n\ta, i, total : Integer;\n\tatype : array of Integer;\n\tstr : String;\n\tstrlist : TStringList;\nbegin\n\treadln(a);\n\tsetLength(atype, a);\n\t\n\treadln(str);\n\tstrlist := TStringList.Create;\n\ttry\n\t\tstrlist.Delimiter := ' ';\n\t\tstrlist.DelimitedText := str;\n\t\tfor i := 0 to a - 1 do\n\t\t\tatype[i] := StrToInt(strlist.Strings[i]);\n\tfinally\n\t\tstrlist.free;\n\t\tend;\n\ttotal := 0;\t\n\tfor i := 0 to a - 1 do\n\t\tbegin\n\t\ttotal := total + (atype[i] - 1);\n\t\tend;\n\t\twriteLn(total);\nend.", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 488, "cpu_time_ms": 1, "memory_kb": 512}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s369474139", "group_id": "codeNet:p03297", "input_text": "var\n\tT,i:Longint;\n\tA,B,C,D,G,x:int64;\nbegin\n\tread(T);\n\tfor i:=1 to T do begin\n\t\tread(A,B,C,D);\n\t\tif(B>A)or(B>D)then writeln('No')\n\t\telse begin\n\t\t\tG:=B;\n\t\t\twhile D<>0 do begin\n\t\t\t\tx:=G;\n\t\t\t\tG:=D;\n\t\t\t\tD:=x mod D;\n\t\t\tend;\n\t\t\tA:=(-A-1)mod G;\n\t\t\tif A<0 then inc(A,G);\n\t\t\tif B>A+C+1 then writeln('No')else writeln('Yes');\n\t\tend;\n\tend;\nend.", "language": "Pascal", "metadata": {"date": 1579680599, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03297.html", "problem_id": "p03297", "resource_group": "low_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/Pascal/s369474139.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s369474139", "user_id": "u657913472"}, "prompt_components": {"gold_output": "No\nYes\nNo\nYes\nYes\nNo\nNo\nYes\nNo\nYes\nYes\nNo\nNo\nYes\n", "input_to_evaluate": "var\n\tT,i:Longint;\n\tA,B,C,D,G,x:int64;\nbegin\n\tread(T);\n\tfor i:=1 to T do begin\n\t\tread(A,B,C,D);\n\t\tif(B>A)or(B>D)then writeln('No')\n\t\telse begin\n\t\t\tG:=B;\n\t\t\twhile D<>0 do begin\n\t\t\t\tx:=G;\n\t\t\t\tG:=D;\n\t\t\t\tD:=x mod D;\n\t\t\tend;\n\t\t\tA:=(-A-1)mod G;\n\t\t\tif A<0 then inc(A,G);\n\t\t\tif B>A+C+1 then writeln('No')else writeln('Yes');\n\t\tend;\n\tend;\nend.", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 333, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s965106984", "group_id": "codeNet:p03297", "input_text": "var\n\tT,i:Longint;\n\tA,B,C,D,G:int64;\nfunction gcd(a,b:int64):int64;\nbegin\n\tif b=0 then gcd:=a else gcd:=gcd(b,a mod b);\nend;\nbegin\n\tread(T);\n\tfor i:=1 to T do begin\n\t\tread(A,B,C,D);\n\t\tG:=gcd(B,D);\n\t\tif(B>A)or(B>D)or(B>((-A-1)mod G+G)mod G+C+1)then writeln('No')else writeln('Yes');\n\tend;\nend.", "language": "Pascal", "metadata": {"date": 1579680287, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03297.html", "problem_id": "p03297", "resource_group": "low_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/Pascal/s965106984.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s965106984", "user_id": "u657913472"}, "prompt_components": {"gold_output": "No\nYes\nNo\nYes\nYes\nNo\nNo\nYes\nNo\nYes\nYes\nNo\nNo\nYes\n", "input_to_evaluate": "var\n\tT,i:Longint;\n\tA,B,C,D,G:int64;\nfunction gcd(a,b:int64):int64;\nbegin\n\tif b=0 then gcd:=a else gcd:=gcd(b,a mod b);\nend;\nbegin\n\tread(T);\n\tfor i:=1 to T do begin\n\t\tread(A,B,C,D);\n\t\tG:=gcd(B,D);\n\t\tif(B>A)or(B>D)or(B>((-A-1)mod G+G)mod G+C+1)then writeln('No')else writeln('Yes');\n\tend;\nend.", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s113991989", "group_id": "codeNet:p03307", "input_text": "var\n n:integer;\n answer:integer;\nbegin\n readln(n);\n answer := n;\n while (answer mod n > 0) or (answer mod 2 > 0) do answer := answer + 1;\n write(answer);\nend.", "language": "Pascal", "metadata": {"date": 1531926335, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03307.html", "problem_id": "p03307", "resource_group": "low_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/Pascal/s113991989.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s113991989", "user_id": "u379319063"}, "prompt_components": {"gold_output": "6\n", "input_to_evaluate": "var\n n:integer;\n answer:integer;\nbegin\n readln(n);\n answer := n;\n while (answer mod n > 0) or (answer mod 2 > 0) do answer := answer + 1;\n write(answer);\nend.", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 2103, "memory_kb": 128}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s763298686", "group_id": "codeNet:p03308", "input_text": "uses\n SysUtils,\n Classes;\n\nvar\n\ta, i, j, t : Integer;\n\tatype : array of Integer;\n\tstr : String;\n\tstrlist : TStringList;\nbegin\n\treadln(a);\n\tsetLength(atype, a);\n\t\n\treadln(str);\n\tstrlist := TStringList.Create;\n\ttry\n\t\tstrlist.Delimiter := ' ';\n\t\tstrlist.DelimitedText := str;\n\t\tfor i := 0 to a - 1 do\n\t\t\tatype[i] := strToInt(strlist.Strings[i]);\n\tfinally\n\t\tstrlist.free;\n\t\tend;\n\t\t\n\tfor i := 1 to a - 2 do\n\t\tbegin\n\t\tfor j := a - 2 downto i do\n\t\t\tbegin\n\t\t\t\tif atype[j - 1] > atype[j] then\n\t\t\t\t\tbegin\n\t\t\t\t\tt := atype[j - 1];\n\t\t\t\t\tatype[j - 1] := atype[j];\n\t\t\t\t\tatype[j] := t;\n\t\t\t\t\tend;\n\t\t\tend;\n\t\tend;\n\t\tt := atype[a -1] - atype[0];\n\t\twriteLn(t);\nend.", "language": "Pascal", "metadata": {"date": 1530498715, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03308.html", "problem_id": "p03308", "resource_group": "low_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/Pascal/s763298686.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s763298686", "user_id": "u397546896"}, "prompt_components": {"gold_output": "5\n", "input_to_evaluate": "uses\n SysUtils,\n Classes;\n\nvar\n\ta, i, j, t : Integer;\n\tatype : array of Integer;\n\tstr : String;\n\tstrlist : TStringList;\nbegin\n\treadln(a);\n\tsetLength(atype, a);\n\t\n\treadln(str);\n\tstrlist := TStringList.Create;\n\ttry\n\t\tstrlist.Delimiter := ' ';\n\t\tstrlist.DelimitedText := str;\n\t\tfor i := 0 to a - 1 do\n\t\t\tatype[i] := strToInt(strlist.Strings[i]);\n\tfinally\n\t\tstrlist.free;\n\t\tend;\n\t\t\n\tfor i := 1 to a - 2 do\n\t\tbegin\n\t\tfor j := a - 2 downto i do\n\t\t\tbegin\n\t\t\t\tif atype[j - 1] > atype[j] then\n\t\t\t\t\tbegin\n\t\t\t\t\tt := atype[j - 1];\n\t\t\t\t\tatype[j - 1] := atype[j];\n\t\t\t\t\tatype[j] := t;\n\t\t\t\t\tend;\n\t\t\tend;\n\t\tend;\n\t\tt := atype[a -1] - atype[0];\n\t\twriteLn(t);\nend.", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 646, "cpu_time_ms": 1, "memory_kb": 288}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s780694033", "group_id": "codeNet:p03309", "input_text": "var\n n,i:longint;\n ans:int64;\n a:array[0..200010] of longint;\nprocedure qsort(l,r:longint);\nvar\n i,j,mid,t:longint;\nbegin\n i:=l;j:=r;mid:=a[(i+j) div 2];\n repeat\n while a[i]mid do dec(j);\n if i<=j then \n begin\n t:=a[i];a[i]:=a[j];a[j]:=t;\n inc(i);dec(j);\n end;\n until i>j;\n if lmid do dec(j);\n if i<=j then \n begin\n t:=a[i];a[i]:=a[j];a[j]:=t;\n inc(i);dec(j);\n end;\n until i>j;\n if ly then min:=y else min:=x;\nend;\n\nbegin\n read(n);\n for i:=1 to n do begin read(a[i]);dec(a[i],i);end;\n r:=1000000000;\n l:=-1000000;\n sad:=min(f(l),f(r));\n while l<=r do begin\n m1:=(2*l+r) div 3;\n temp1:=f(m1);\n m2:=(l+2*r) div 3;\n temp2:=f(m2);\n if temp1 < temp2 then begin\n if sad>temp1 then sad:=temp1;\n r:=m2-1;\n end else begin\n if sad>temp2 then sad:=temp2;\n l:=m1+1;\n end;\n end;\n writeln(sad);\nend.", "language": "Pascal", "metadata": {"date": 1530496484, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03309.html", "problem_id": "p03309", "resource_group": "low_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/Pascal/s609084480.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s609084480", "user_id": "u726630158"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "{$R-,S-,Q-,I-,O+}\nvar n,i,sad,l,r,m1,m2,temp1,temp2:int64;\n a:array[1..200000] of int64;\n\nfunction f(b:int64):int64;\nvar i,ret:int64;\nbegin\n ret:=0;\n for i:=1 to n do inc(ret,abs(a[i]-b));\n f:=ret;\nend;\n\nfunction min(x,y:int64):int64;\nbegin\n if x>y then min:=y else min:=x;\nend;\n\nbegin\n read(n);\n for i:=1 to n do begin read(a[i]);dec(a[i],i);end;\n r:=1000000000;\n l:=-1000000;\n sad:=min(f(l),f(r));\n while l<=r do begin\n m1:=(2*l+r) div 3;\n temp1:=f(m1);\n m2:=(l+2*r) div 3;\n temp2:=f(m2);\n if temp1 < temp2 then begin\n if sad>temp1 then sad:=temp1;\n r:=m2-1;\n end else begin\n if sad>temp2 then sad:=temp2;\n l:=m1+1;\n end;\n end;\n writeln(sad);\nend.", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 130, "memory_kb": 1664}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s692804306", "group_id": "codeNet:p03310", "input_text": "var\n n,i:longint;\n a:array[0..200010] of longint;\n b:array[0..200010] of int64;\n min,max,ans:int64;\nprocedure find(h,t:longint);\nvar\n l,r,q,mid,x,y,x1,y1,x2,y2:longint;\nbegin\n l:=h;r:=t;q:=(b[t]-b[h-1]) div 2;\n while l<>r-1 do\n begin \n mid:=(l+r) div 2;\n if b[mid]-b[h-1]>q then r:=mid else l:=mid;\n end;\n x1:=b[l]-b[h-1];\n y1:=b[t]-b[l];\n x2:=b[r]-b[h-1];\n y2:=b[t]-b[r];\n if abs(x1-y1)max then max:=x;\n if xmax then max:=y;\n if yr-1 do\n begin \n mid:=(l+r) div 2;\n if b[mid]-b[h-1]>q then r:=mid else l:=mid;\n end;\n x1:=b[l]-b[h-1];\n y1:=b[t]-b[l];\n x2:=b[r]-b[h-1];\n y2:=b[t]-b[r];\n if abs(x1-y1)max then max:=x;\n if xmax then max:=y;\n if y1 do begin\n\t\tmm:=(ll+rr)div 2;\n\t\tif s[mm]>sum then rr:=mm else ll:=mm;\n\tend;\n\tk:=rr;\n\tc:=s[k]-s[L];\n\td:=s[R]-s[k];\n\tdec(k);\n\tif k>L then begin\n\t\te:=s[k]-s[L];\n\t\tf:=s[R]-s[k];\n\t\tif Max(c,d)-Min(c,d)>Max(e,f)-Min(e,f)then begin\n\t\t\treta:=Min(e,f);\n\t\t\tretb:=Max(e,f);\n\t\t\texit;\n\t\tend;\n\tend;\n\treta:=Min(c,d);\n\tretb:=Max(c,d);\nend;\nbegin\n\tread(n);\n\tfor i:=1 to n do begin\n\t\tread(a[i]);\n\t\ts[i]:=s[i-1]+a[i];\n\tend;\n\tans:=s[n];\n\tfor i:=2 to n-2 do begin\n\t\tf(0,i);\n\t\tx:=reta;\n\t\tz:=retb;\n\t\tf(i,n);\n\t\ty:=reta;\n\t\tw:=retb;\n\t\tans:=Min(ans,Max(z,w)-Min(x,y));\n\tend;\n\twriteln(ans);\nend.\n", "language": "Pascal", "metadata": {"date": 1540021497, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03312.html", "problem_id": "p03312", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03312/input.txt", "sample_output_relpath": "derived/input_output/data/p03312/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03312/Pascal/s584173160.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s584173160", "user_id": "u657913472"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "Uses math;\nvar\n\tn,i:Longint;\n\ta:array[1..100000]of Longint;\n\ts:array[0..100000]of int64;\n\treta,retb,x,y,z,w,ans:int64;\nprocedure f(L,R:Longint);\nvar\n\tsum,c,d,e,f:int64;\n\tll,rr,mm,k:Longint;\nbegin\n\tsum:=(s[R]+s[L])div 2;\n\tll:=L;\n\trr:=R-1;\n\twhile rr-ll>1 do begin\n\t\tmm:=(ll+rr)div 2;\n\t\tif s[mm]>sum then rr:=mm else ll:=mm;\n\tend;\n\tk:=rr;\n\tc:=s[k]-s[L];\n\td:=s[R]-s[k];\n\tdec(k);\n\tif k>L then begin\n\t\te:=s[k]-s[L];\n\t\tf:=s[R]-s[k];\n\t\tif Max(c,d)-Min(c,d)>Max(e,f)-Min(e,f)then begin\n\t\t\treta:=Min(e,f);\n\t\t\tretb:=Max(e,f);\n\t\t\texit;\n\t\tend;\n\tend;\n\treta:=Min(c,d);\n\tretb:=Max(c,d);\nend;\nbegin\n\tread(n);\n\tfor i:=1 to n do begin\n\t\tread(a[i]);\n\t\ts[i]:=s[i-1]+a[i];\n\tend;\n\tans:=s[n];\n\tfor i:=2 to n-2 do begin\n\t\tf(0,i);\n\t\tx:=reta;\n\t\tz:=retb;\n\t\tf(i,n);\n\t\ty:=reta;\n\t\tw:=retb;\n\t\tans:=Min(ans,Max(z,w)-Min(x,y));\n\tend;\n\twriteln(ans);\nend.\n", "problem_context": "Score : 600 points\n\nProblem Statement\n\nSnuke has an integer sequence A of length N.\n\nHe will make three cuts in A and divide it into four (non-empty) contiguous subsequences B, C, D and E.\nThe positions of the cuts can be freely chosen.\n\nLet P,Q,R,S be the sums of the elements in B,C,D,E, respectively.\nSnuke is happier when the absolute difference of the maximum and the minimum among P,Q,R,S is smaller.\nFind the minimum possible absolute difference of the maximum and the minimum among P,Q,R,S.\n\nConstraints\n\n4 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq A_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 ... A_N\n\nOutput\n\nFind the minimum possible absolute difference of the maximum and the minimum among P,Q,R,S.\n\nSample Input 1\n\n5\n3 2 4 1 2\n\nSample Output 1\n\n2\n\nIf we divide A as B,C,D,E=(3),(2),(4),(1,2), then P=3,Q=2,R=4,S=1+2=3.\nHere, the maximum and the minimum among P,Q,R,S are 4 and 2, with the absolute difference of 2.\nWe cannot make the absolute difference of the maximum and the minimum less than 2, so the answer is 2.\n\nSample Input 2\n\n10\n10 71 84 33 6 47 23 25 52 64\n\nSample Output 2\n\n36\n\nSample Input 3\n\n7\n1 2 3 1000000000 4 5 6\n\nSample Output 3\n\n999999994", "sample_input": "5\n3 2 4 1 2\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03312", "source_text": "Score : 600 points\n\nProblem Statement\n\nSnuke has an integer sequence A of length N.\n\nHe will make three cuts in A and divide it into four (non-empty) contiguous subsequences B, C, D and E.\nThe positions of the cuts can be freely chosen.\n\nLet P,Q,R,S be the sums of the elements in B,C,D,E, respectively.\nSnuke is happier when the absolute difference of the maximum and the minimum among P,Q,R,S is smaller.\nFind the minimum possible absolute difference of the maximum and the minimum among P,Q,R,S.\n\nConstraints\n\n4 \\leq N \\leq 2 \\times 10^5\n\n1 \\leq A_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 ... A_N\n\nOutput\n\nFind the minimum possible absolute difference of the maximum and the minimum among P,Q,R,S.\n\nSample Input 1\n\n5\n3 2 4 1 2\n\nSample Output 1\n\n2\n\nIf we divide A as B,C,D,E=(3),(2),(4),(1,2), then P=3,Q=2,R=4,S=1+2=3.\nHere, the maximum and the minimum among P,Q,R,S are 4 and 2, with the absolute difference of 2.\nWe cannot make the absolute difference of the maximum and the minimum less than 2, so the answer is 2.\n\nSample Input 2\n\n10\n10 71 84 33 6 47 23 25 52 64\n\nSample Output 2\n\n36\n\nSample Input 3\n\n7\n1 2 3 1000000000 4 5 6\n\nSample Output 3\n\n999999994", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 820, "cpu_time_ms": 110, "memory_kb": 1280}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s109703793", "group_id": "codeNet:p03317", "input_text": "var\n n,k,min,i,cnt:longint;\n a:array[0..100010] of longint;\nbegin\n readln(n,k);\n min:=maxlongint;\n for i:=1 to n do\n begin\n read(a[i]);\n if a[i]0 do\n begin\n writeln(ans);\n tot1:=ans+k;\n tot2:=ans+k*10;\n if tot1*s(tot2)<=tot2*s(tot1) then ans:=tot1\n else\n begin\n ans:=tot2;\n k:=k*10;\n end;\n dec(n);\n end;\nend.", "language": "Pascal", "metadata": {"date": 1530922091, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03318.html", "problem_id": "p03318", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03318/input.txt", "sample_output_relpath": "derived/input_output/data/p03318/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03318/Pascal/s406370802.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s406370802", "user_id": "u960852022"}, "prompt_components": {"gold_output": "1\n2\n3\n4\n5\n6\n7\n8\n9\n19\n", "input_to_evaluate": "var\n ans,k,tot1,tot2:int64;\n n:longint;\nfunction s(x:longint):longint;\nbegin\n if x=0 then exit(0)\n else exit(x mod 10+s(x div 10));\nend;\nbegin\n readln(n);\n ans:=1;k:=1;\n while n>0 do\n begin\n writeln(ans);\n tot1:=ans+k;\n tot2:=ans+k*10;\n if tot1*s(tot2)<=tot2*s(tot1) then ans:=tot1\n else\n begin\n ans:=tot2;\n k:=k*10;\n end;\n dec(n);\n end;\nend.", "problem_context": "Score : 500 points\n\nProblem Statement\n\nLet S(n) denote the sum of the digits in the decimal notation of n.\nFor example, S(123) = 1 + 2 + 3 = 6.\n\nWe will call an integer n a Snuke number when, for all positive integers m such that m > n, \\frac{n}{S(n)} \\leq \\frac{m}{S(m)} holds.\n\nGiven an integer K, list the K smallest Snuke numbers.\n\nConstraints\n\n1 \\leq K\n\nThe K-th smallest Snuke number is not greater than 10^{15}.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nK\n\nOutput\n\nPrint K lines. The i-th line should contain the i-th smallest Snuke number.\n\nSample Input 1\n\n10\n\nSample Output 1\n\n1\n2\n3\n4\n5\n6\n7\n8\n9\n19", "sample_input": "10\n"}, "reference_outputs": ["1\n2\n3\n4\n5\n6\n7\n8\n9\n19\n"], "source_document_id": "p03318", "source_text": "Score : 500 points\n\nProblem Statement\n\nLet S(n) denote the sum of the digits in the decimal notation of n.\nFor example, S(123) = 1 + 2 + 3 = 6.\n\nWe will call an integer n a Snuke number when, for all positive integers m such that m > n, \\frac{n}{S(n)} \\leq \\frac{m}{S(m)} holds.\n\nGiven an integer K, list the K smallest Snuke numbers.\n\nConstraints\n\n1 \\leq K\n\nThe K-th smallest Snuke number is not greater than 10^{15}.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nK\n\nOutput\n\nPrint K lines. The i-th line should contain the i-th smallest Snuke number.\n\nSample Input 1\n\n10\n\nSample Output 1\n\n1\n2\n3\n4\n5\n6\n7\n8\n9\n19", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s238813125", "group_id": "codeNet:p03320", "input_text": "var\n\tn,a:int64;\n\ti,k:Longint;\nfunction S(n:int64):int64;\nvar x:int64;\nbegin\n\tx:=0;\n\twhile n>0 do begin\n\t\tx:=x+n mod 10;\n\t\tn:=n div 10;\n\tend;\n\tS:=x;\nend;\nbegin\n\tn:=1;\n\ta:=1;\n\tread(k);\n\twriteln(1);\n\tfor i:=2 to k do begin\n\t\tif (n+a*10)*S(n+a)<(n+a)*S(n+a*10)then a:=a*10;\n\t\tn:=n+a;\n\t\twriteln(n);\n\tend;\nend.", "language": "Pascal", "metadata": {"date": 1540012297, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03320.html", "problem_id": "p03320", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03320/input.txt", "sample_output_relpath": "derived/input_output/data/p03320/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03320/Pascal/s238813125.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s238813125", "user_id": "u657913472"}, "prompt_components": {"gold_output": "1\n2\n3\n4\n5\n6\n7\n8\n9\n19\n", "input_to_evaluate": "var\n\tn,a:int64;\n\ti,k:Longint;\nfunction S(n:int64):int64;\nvar x:int64;\nbegin\n\tx:=0;\n\twhile n>0 do begin\n\t\tx:=x+n mod 10;\n\t\tn:=n div 10;\n\tend;\n\tS:=x;\nend;\nbegin\n\tn:=1;\n\ta:=1;\n\tread(k);\n\twriteln(1);\n\tfor i:=2 to k do begin\n\t\tif (n+a*10)*S(n+a)<(n+a)*S(n+a*10)then a:=a*10;\n\t\tn:=n+a;\n\t\twriteln(n);\n\tend;\nend.", "problem_context": "Score : 500 points\n\nProblem Statement\n\nLet S(n) denote the sum of the digits in the decimal notation of n.\nFor example, S(123) = 1 + 2 + 3 = 6.\n\nWe will call an integer n a Snuke number when, for all positive integers m such that m > n, \\frac{n}{S(n)} \\leq \\frac{m}{S(m)} holds.\n\nGiven an integer K, list the K smallest Snuke numbers.\n\nConstraints\n\n1 \\leq K\n\nThe K-th smallest Snuke number is not greater than 10^{15}.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nK\n\nOutput\n\nPrint K lines. The i-th line should contain the i-th smallest Snuke number.\n\nSample Input 1\n\n10\n\nSample Output 1\n\n1\n2\n3\n4\n5\n6\n7\n8\n9\n19", "sample_input": "10\n"}, "reference_outputs": ["1\n2\n3\n4\n5\n6\n7\n8\n9\n19\n"], "source_document_id": "p03320", "source_text": "Score : 500 points\n\nProblem Statement\n\nLet S(n) denote the sum of the digits in the decimal notation of n.\nFor example, S(123) = 1 + 2 + 3 = 6.\n\nWe will call an integer n a Snuke number when, for all positive integers m such that m > n, \\frac{n}{S(n)} \\leq \\frac{m}{S(m)} holds.\n\nGiven an integer K, list the K smallest Snuke numbers.\n\nConstraints\n\n1 \\leq K\n\nThe K-th smallest Snuke number is not greater than 10^{15}.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nK\n\nOutput\n\nPrint K lines. The i-th line should contain the i-th smallest Snuke number.\n\nSample Input 1\n\n10\n\nSample Output 1\n\n1\n2\n3\n4\n5\n6\n7\n8\n9\n19", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 304, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s751809554", "group_id": "codeNet:p03323", "input_text": "var n:double;\n k,i,j,i_num:integer;\n a:array[1..10000] of integer;\nbegin\n readln(n);\n for i:=1 to trunc(n) do begin\n read(a[i]);\n end;\n \n \n j:=1;\n while j>=1 do begin\n j:=0;\n for i:=1 to trunc(n) do begin\n if (a[i] mod 2=0) then inc(j);\n end;\n if j>=1 then begin\n k:=0;\n for i:=1 to trunc(n) do begin\n if (k=0)and(a[i] mod 2=0) then begin \n a[i]:=a[i] div 2;k:=1;\n end else begin\n a[i]:=a[i] * 3;\n end;\n end;\n inc(i_num);\n end; \n end;\n \n writeln(i_num);\nend.", "language": "Pascal", "metadata": {"date": 1529202144, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03323.html", "problem_id": "p03323", "resource_group": "low_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/Pascal/s751809554.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s751809554", "user_id": "u890749490"}, "prompt_components": {"gold_output": "Yay!\n", "input_to_evaluate": "var n:double;\n k,i,j,i_num:integer;\n a:array[1..10000] of integer;\nbegin\n readln(n);\n for i:=1 to trunc(n) do begin\n read(a[i]);\n end;\n \n \n j:=1;\n while j>=1 do begin\n j:=0;\n for i:=1 to trunc(n) do begin\n if (a[i] mod 2=0) then inc(j);\n end;\n if j>=1 then begin\n k:=0;\n for i:=1 to trunc(n) do begin\n if (k=0)and(a[i] mod 2=0) then begin \n a[i]:=a[i] div 2;k:=1;\n end else begin\n a[i]:=a[i] * 3;\n end;\n end;\n inc(i_num);\n end; \n end;\n \n writeln(i_num);\nend.", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 2103, "memory_kb": 128}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s913945885", "group_id": "codeNet:p03325", "input_text": "var\n\tn,a,i,s:Longint;\nbegin\n\tread(n);\n\tfor i:=1 to n do begin\n\t\tread(a);\n\t\twhile a mod 2=0 do begin\n\t\t\ta:=a div 2;\n\t\t\tinc(s);\n\t\tend;\n\tend;\n\twriteln(s);\nend.\n", "language": "Pascal", "metadata": {"date": 1538190474, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03325.html", "problem_id": "p03325", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03325/input.txt", "sample_output_relpath": "derived/input_output/data/p03325/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03325/Pascal/s913945885.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s913945885", "user_id": "u657913472"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "var\n\tn,a,i,s:Longint;\nbegin\n\tread(n);\n\tfor i:=1 to n do begin\n\t\tread(a);\n\t\twhile a mod 2=0 do begin\n\t\t\ta:=a div 2;\n\t\t\tinc(s);\n\t\tend;\n\tend;\n\twriteln(s);\nend.\n", "problem_context": "Score: 300 points\n\nProblem Statement\n\nAs AtCoder Beginner Contest 100 is taking place, the office of AtCoder, Inc. is decorated with a sequence of length N, a = {a_1, a_2, a_3, ..., a_N}.\n\nSnuke, an employee, would like to play with this sequence.\n\nSpecifically, he would like to repeat the following operation as many times as possible:\n\nFor every i satisfying 1 \\leq i \\leq N, perform one of the following: \"divide a_i by 2\" and \"multiply a_i by 3\".\nHere, choosing \"multiply a_i by 3\" for every i is not allowed, and the value of a_i after the operation must be an integer.\n\nAt most how many operations can be performed?\n\nConstraints\n\nN is an integer between 1 and 10 \\ 000 (inclusive).\n\na_i is an integer between 1 and 1 \\ 000 \\ 000 \\ 000 (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 the maximum number of operations that Snuke can perform.\n\nSample Input 1\n\n3\n5 2 4\n\nSample Output 1\n\n3\n\nThe sequence is initially {5, 2, 4}. Three operations can be performed as follows:\n\nFirst, multiply a_1 by 3, multiply a_2 by 3 and divide a_3 by 2. The sequence is now {15, 6, 2}.\n\nNext, multiply a_1 by 3, divide a_2 by 2 and multiply a_3 by 3. The sequence is now {45, 3, 6}.\n\nFinally, multiply a_1 by 3, multiply a_2 by 3 and divide a_3 by 2. The sequence is now {135, 9, 3}.\n\nSample Input 2\n\n4\n631 577 243 199\n\nSample Output 2\n\n0\n\nNo operation can be performed since all the elements are odd. Thus, the answer is 0.\n\nSample Input 3\n\n10\n2184 2126 1721 1800 1024 2528 3360 1945 1280 1776\n\nSample Output 3\n\n39", "sample_input": "3\n5 2 4\n"}, "reference_outputs": ["3\n"], "source_document_id": "p03325", "source_text": "Score: 300 points\n\nProblem Statement\n\nAs AtCoder Beginner Contest 100 is taking place, the office of AtCoder, Inc. is decorated with a sequence of length N, a = {a_1, a_2, a_3, ..., a_N}.\n\nSnuke, an employee, would like to play with this sequence.\n\nSpecifically, he would like to repeat the following operation as many times as possible:\n\nFor every i satisfying 1 \\leq i \\leq N, perform one of the following: \"divide a_i by 2\" and \"multiply a_i by 3\".\nHere, choosing \"multiply a_i by 3\" for every i is not allowed, and the value of a_i after the operation must be an integer.\n\nAt most how many operations can be performed?\n\nConstraints\n\nN is an integer between 1 and 10 \\ 000 (inclusive).\n\na_i is an integer between 1 and 1 \\ 000 \\ 000 \\ 000 (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 the maximum number of operations that Snuke can perform.\n\nSample Input 1\n\n3\n5 2 4\n\nSample Output 1\n\n3\n\nThe sequence is initially {5, 2, 4}. Three operations can be performed as follows:\n\nFirst, multiply a_1 by 3, multiply a_2 by 3 and divide a_3 by 2. The sequence is now {15, 6, 2}.\n\nNext, multiply a_1 by 3, divide a_2 by 2 and multiply a_3 by 3. The sequence is now {45, 3, 6}.\n\nFinally, multiply a_1 by 3, multiply a_2 by 3 and divide a_3 by 2. The sequence is now {135, 9, 3}.\n\nSample Input 2\n\n4\n631 577 243 199\n\nSample Output 2\n\n0\n\nNo operation can be performed since all the elements are odd. Thus, the answer is 0.\n\nSample Input 3\n\n10\n2184 2126 1721 1800 1024 2528 3360 1945 1280 1776\n\nSample Output 3\n\n39", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 128}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s442960635", "group_id": "codeNet:p03326", "input_text": "uses math;\nvar n,m,i,j,k:longint;x,y,z:int64;\n a:array[-1..1000,1..8]of int64;\n ans,s:int64;\nbegin\n readln(n,m);\n for i:=1 to n do\n begin\n readln(x,y,z);\n a[i,1]:=x+y+z;\n a[i,2]:=x+y-z;\n a[i,3]:=x-y+z;\n a[i,4]:=x-y-z;\n a[i,5]:=-x+y+z;\n a[i,6]:=-x+y-z;\n a[i,7]:=-x-y+z;\n a[i,8]:=-x-y-z;\n end;\n for k:=1 to 8 do\n for i:=1 to n-1 do\n for j:=i+1 to n do\n if a[i,k]y then min:=y\n\telse min:=x;\nend;\n\nprocedure dp;\nvar power,i:longint;\nbegin\n\tf[0]:=0;\n\tfor i:=1 to 100000 do\n\t begin\n\t f[i]:=max;\n\t power:=1;\n\t while power<=n do\n\t begin\n\t f[i]:=min(f[i],f[i-power]+1);\n\t power:=power*6;\n\t end;\n\t end;\nend;\n\nbegin\n\treadln(N);\n\tdp;\n\twrite(f[n]);\nend.", "language": "Pascal", "metadata": {"date": 1560742664, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03329.html", "problem_id": "p03329", "resource_group": "low_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/Pascal/s037789934.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s037789934", "user_id": "u017143931"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "const max=trunc(1e5);\nvar f:array[0..max] of longint;\n n:longint;\n\nfunction min(x,y:longint):longint;\nbegin\n\tif x>y then min:=y\n\telse min:=x;\nend;\n\nprocedure dp;\nvar power,i:longint;\nbegin\n\tf[0]:=0;\n\tfor i:=1 to 100000 do\n\t begin\n\t f[i]:=max;\n\t power:=1;\n\t while power<=n do\n\t begin\n\t f[i]:=min(f[i],f[i-power]+1);\n\t power:=power*6;\n\t end;\n\t end;\nend;\n\nbegin\n\treadln(N);\n\tdp;\n\twrite(f[n]);\nend.", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 432, "cpu_time_ms": 2, "memory_kb": 512}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s668546035", "group_id": "codeNet:p03331", "input_text": "\nuses SysUtils;\nvar i,y,i1,x,a,b:Longint;\n ans,n:Longint;\n\nbegin\n \n readln(n);\n ans:=9999999;\n for i:=1 to n-1 do begin\n a:=trunc(i); b:=trunc(n)-a;\n //writeln('a=',a,'b=',b);\n x:=0;\n for i1:=1 to length(inttostr(a)) do inc(x,strtoint(copy(inttostr(a),i1,1)));\n //writeln('a ',a,' kakui wa=',x);\n y:=0;\n for i1:=1 to length(inttostr(b)) do inc(y,strtoint(copy(inttostr(b),i1,1)));\n //writeln('b ',b,' kakui wa=',y);\n if ans>x+y then ans:=x+y;\n end;\nwriteln(trunc(ans));\nend.", "language": "Pascal", "metadata": {"date": 1528077422, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03331.html", "problem_id": "p03331", "resource_group": "low_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/Pascal/s668546035.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s668546035", "user_id": "u890749490"}, "prompt_components": {"gold_output": "6\n", "input_to_evaluate": "\nuses SysUtils;\nvar i,y,i1,x,a,b:Longint;\n ans,n:Longint;\n\nbegin\n \n readln(n);\n ans:=9999999;\n for i:=1 to n-1 do begin\n a:=trunc(i); b:=trunc(n)-a;\n //writeln('a=',a,'b=',b);\n x:=0;\n for i1:=1 to length(inttostr(a)) do inc(x,strtoint(copy(inttostr(a),i1,1)));\n //writeln('a ',a,' kakui wa=',x);\n y:=0;\n for i1:=1 to length(inttostr(b)) do inc(y,strtoint(copy(inttostr(b),i1,1)));\n //writeln('b ',b,' kakui wa=',y);\n if ans>x+y then ans:=x+y;\n end;\nwriteln(trunc(ans));\nend.", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 224, "memory_kb": 128}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s527462300", "group_id": "codeNet:p03332", "input_text": "var f,g:text; i,p:longint; n,a,b,k,tong,so,tong1,tong2:int64;\n gt,rev,rev1:array[0..300010] of int64;\n\n\n function mu(a1,b1,p1:int64):int64;\n var q:int64;\n begin\n if b1=0 then exit(1);\n\n q:=mu(a1,b1 div 2,p1);\n if b1 mod 2 = 0 then exit(q*q mod p1)\n else exit(q*q mod p1 *a1 mod p1);\n end;\n\n begin\n\n gt[0]:=1;\n p:=998244353; rev[0]:=1;\n for i:=1 to 300005 do\n begin\n gt[i]:=gt[i-1] * i mod p\n end;\n for i:=1 to 300005 do\n begin\n rev[i]:=mu(gt[i],p-2,p);\n end;\n\n// write(g,((gt[n]* (rev[i] mod p)) mod p * (rev[n-i] mod p)) mod p ,' ');\n\n readln(n,a,b,k);\n //n:=90081; a:=33447; b:=90629; k:=6391049189;\n //n:=4; a:=1; b:=2; k:=5;\n tong:=0;\n for i:=0 to n do\n begin\n if (k-i*A)<0 then break;\n if (k-i*A) mod b = 0 then\n begin\n so:=(k-i*A) div B;\n if nl then l:=dem;;\n end;\n writeln(l);\n readln;\nend.\n\n", "language": "Pascal", "metadata": {"date": 1534597497, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03338.html", "problem_id": "p03338", "resource_group": "low_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/Pascal/s995309724.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s995309724", "user_id": "u033402648"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "var n,x,y:ansistring;\n i,j,k:longint;\n dem,l,o,a,b:int64;\nbegin\n readln(a);\n read(n);\n dem:=a;\n l:=low(int64);\n for k:=1 to a do\n begin\n dem:=0;\n x:=copy(n,1,k);\n y:=copy(n,k+1,a-k);\n for i:=1 to length(x)-1 do\n for j:=i+1 to length(x) do\n if x[i]=x[j] then x[j]:='0';\n for i:=1 to length(y)-1 do\n for j:=i+1 to length(y) do\n if y[i]=y[j] then y[j]:='1';\n for i:=1 to length(x) do\n for j:=1 to length(y) do if x[i]=y[j] then dem:=dem+1;\n if dem>l then l:=dem;;\n end;\n writeln(l);\n readln;\nend.\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.\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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 2, "memory_kb": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s625345562", "group_id": "codeNet:p03339", "input_text": "uses crt;\nvar\n s:string;\n a,b:array[1..10000000] of longint;\n i,j,k:longint;\nbegin\n clrscr;\n read(s);\n writeln;\n k:=0;\n j:=0;\n for i:=1 to length(s) do\n if s[i]='W' then\n begin\n inc(j);\n a[i]:=j;\n end\n else a[i]:=j;\n for i:=length(s) downto 1 do\n if s[i]='E' then\n begin\n inc(k);\n b[i]:=k;\n end\n else b[i]:=k;\n k:=0;\n for i:=1 to length(s) do\n if k<(a[i]+b[i]) then k:=a[i]+b[i];\n write(k);\n readln\nend.\n\n", "language": "Pascal", "metadata": {"date": 1563335499, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03339.html", "problem_id": "p03339", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03339/input.txt", "sample_output_relpath": "derived/input_output/data/p03339/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03339/Pascal/s625345562.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s625345562", "user_id": "u863370423"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "uses crt;\nvar\n s:string;\n a,b:array[1..10000000] of longint;\n i,j,k:longint;\nbegin\n clrscr;\n read(s);\n writeln;\n k:=0;\n j:=0;\n for i:=1 to length(s) do\n if s[i]='W' then\n begin\n inc(j);\n a[i]:=j;\n end\n else a[i]:=j;\n for i:=length(s) downto 1 do\n if s[i]='E' then\n begin\n inc(k);\n b[i]:=k;\n end\n else b[i]:=k;\n k:=0;\n for i:=1 to length(s) do\n if k<(a[i]+b[i]) then k:=a[i]+b[i];\n write(k);\n readln\nend.\n\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere are N people standing in a row from west to east.\nEach person is facing east or west.\nThe directions of the people is given as a string S of length N.\nThe i-th person from the west is facing east if S_i = E, and west if S_i = W.\n\nYou will appoint one of the N people as the leader, then command the rest of them to face in the direction of the leader.\nHere, we do not care which direction the leader is facing.\n\nThe people in the row hate to change their directions, so you would like to select the leader so that the number of people who have to change their directions is minimized.\nFind the minimum number of people who have to change their directions.\n\nConstraints\n\n2 \\leq N \\leq 3 \\times 10^5\n\n|S| = N\n\nS_i is E or W.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS\n\nOutput\n\nPrint the minimum number of people who have to change their directions.\n\nSample Input 1\n\n5\nWEEWW\n\nSample Output 1\n\n1\n\nAssume that we appoint the third person from the west as the leader.\nThen, the first person from the west needs to face east and has to turn around.\nThe other people do not need to change their directions, so the number of people who have to change their directions is 1 in this case.\nIt is not possible to have 0 people who have to change their directions, so the answer is 1.\n\nSample Input 2\n\n12\nWEWEWEEEWWWE\n\nSample Output 2\n\n4\n\nSample Input 3\n\n8\nWWWWWEEE\n\nSample Output 3\n\n3", "sample_input": "5\nWEEWW\n"}, "reference_outputs": ["1\n"], "source_document_id": "p03339", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere are N people standing in a row from west to east.\nEach person is facing east or west.\nThe directions of the people is given as a string S of length N.\nThe i-th person from the west is facing east if S_i = E, and west if S_i = W.\n\nYou will appoint one of the N people as the leader, then command the rest of them to face in the direction of the leader.\nHere, we do not care which direction the leader is facing.\n\nThe people in the row hate to change their directions, so you would like to select the leader so that the number of people who have to change their directions is minimized.\nFind the minimum number of people who have to change their directions.\n\nConstraints\n\n2 \\leq N \\leq 3 \\times 10^5\n\n|S| = N\n\nS_i is E or W.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS\n\nOutput\n\nPrint the minimum number of people who have to change their directions.\n\nSample Input 1\n\n5\nWEEWW\n\nSample Output 1\n\n1\n\nAssume that we appoint the third person from the west as the leader.\nThen, the first person from the west needs to face east and has to turn around.\nThe other people do not need to change their directions, so the number of people who have to change their directions is 1 in this case.\nIt is not possible to have 0 people who have to change their directions, so the answer is 1.\n\nSample Input 2\n\n12\nWEWEWEEEWWWE\n\nSample Output 2\n\n4\n\nSample Input 3\n\n8\nWWWWWEEE\n\nSample Output 3\n\n3", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 778, "cpu_time_ms": 1, "memory_kb": 2304}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s666413714", "group_id": "codeNet:p03352", "input_text": "program Project1;\n{$APPTYPE CONSOLE}\nuses\n SysUtils,math;\nvar\n a,h,w,i,j,count,x,y,sw,m,n,b,c,soeji,sum,max,k,d,p:Integer;\n l:array[0..40] of Integer=(1, 4, 8, 9, 16, 25, 27, 32, 36, 49, 64, 81, 100, 121, 125, 128, 144, 169,196,\n 216, 225, 243, 256, 289, 324, 343, 361, 400, 441, 484, 512, 529, 576, 625, 676, 729, 784, 841, 900, 961,1000);\n s,s123,s1,s2,s3:string;\n al:string = 'abcdefghijklmnopqrstuvwxyz';\n tf,tfl,tfr:Boolean;\nbegin\n try\n { TODO -oUser -cConsole メイン : ここにコードを記述してください }\n Readln(x);\n y:=0;\n\n while True do begin\n if l[y]>x then begin\n Writeln(l[y-1]);\n Readln;\n exit;\n end;\n inc(y);\n end;\n Readln;\n except\n on E: Exception do\n Writeln(E.ClassName, ': ', E.Message);\n end;\nend.\n", "language": "Pascal", "metadata": {"date": 1528148250, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03352.html", "problem_id": "p03352", "resource_group": "low_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/Pascal/s666413714.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s666413714", "user_id": "u755925739"}, "prompt_components": {"gold_output": "9\n", "input_to_evaluate": "program Project1;\n{$APPTYPE CONSOLE}\nuses\n SysUtils,math;\nvar\n a,h,w,i,j,count,x,y,sw,m,n,b,c,soeji,sum,max,k,d,p:Integer;\n l:array[0..40] of Integer=(1, 4, 8, 9, 16, 25, 27, 32, 36, 49, 64, 81, 100, 121, 125, 128, 144, 169,196,\n 216, 225, 243, 256, 289, 324, 343, 361, 400, 441, 484, 512, 529, 576, 625, 676, 729, 784, 841, 900, 961,1000);\n s,s123,s1,s2,s3:string;\n al:string = 'abcdefghijklmnopqrstuvwxyz';\n tf,tfl,tfr:Boolean;\nbegin\n try\n { TODO -oUser -cConsole メイン : ここにコードを記述してください }\n Readln(x);\n y:=0;\n\n while True do begin\n if l[y]>x then begin\n Writeln(l[y-1]);\n Readln;\n exit;\n end;\n inc(y);\n end;\n Readln;\n except\n on E: Exception do\n Writeln(E.ClassName, ': ', E.Message);\n end;\nend.\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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 805, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s691613881", "group_id": "codeNet:p03355", "input_text": "{$mode objfpc}\nprogram C;\nuses\n classes;\nvar\n S: AnsiString;\n k: Integer;\n i, j: Integer;\n AllSubStr: TStringList;\n\nbegin\n ReadLn(S);\n ReadLn(k);\n\n AllSubStr := TStringList.Create;\n AllSubStr.Duplicates := dupIgnore;\n\n for i := 1 to Length(S) - k + 1 do \n for j := 1 to k do\n AllSubStr.Add(Copy(S, i, j));\n AllSubStr.Sort;\n \n i := 0;\n for j := 0 to AllSubStr.Count - 1 do \n if AllSubStr[i] <> AllSubStr[j] then\n begin\n Inc(i);\n AllSubStr[i] := AllSubStr[j];\n end;\n {\n for j := 0 to i do \n WriteLn(AllSubStr[j]);\n }\n WriteLn(AllSubStr[k - 1]);\n \nend.", "language": "Pascal", "metadata": {"date": 1533236821, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03355.html", "problem_id": "p03355", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03355/input.txt", "sample_output_relpath": "derived/input_output/data/p03355/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03355/Pascal/s691613881.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s691613881", "user_id": "u422041582"}, "prompt_components": {"gold_output": "b\n", "input_to_evaluate": "{$mode objfpc}\nprogram C;\nuses\n classes;\nvar\n S: AnsiString;\n k: Integer;\n i, j: Integer;\n AllSubStr: TStringList;\n\nbegin\n ReadLn(S);\n ReadLn(k);\n\n AllSubStr := TStringList.Create;\n AllSubStr.Duplicates := dupIgnore;\n\n for i := 1 to Length(S) - k + 1 do \n for j := 1 to k do\n AllSubStr.Add(Copy(S, i, j));\n AllSubStr.Sort;\n \n i := 0;\n for j := 0 to AllSubStr.Count - 1 do \n if AllSubStr[i] <> AllSubStr[j] then\n begin\n Inc(i);\n AllSubStr[i] := AllSubStr[j];\n end;\n {\n for j := 0 to i do \n WriteLn(AllSubStr[j]);\n }\n WriteLn(AllSubStr[k - 1]);\n \nend.", "problem_context": "Score : 300 points\n\nProblem Statement\n\nYou are given a string s.\nAmong the different substrings of s, print the K-th lexicographically smallest one.\n\nA substring of s is a string obtained by taking out a non-empty contiguous part in s.\nFor example, if s = ababc, a, bab and ababc are substrings of s, while ac, z and an empty string are not.\nAlso, we say that substrings are different when they are different as strings.\n\nLet X = x_{1}x_{2}...x_{n} and Y = y_{1}y_{2}...y_{m} be two distinct strings. X is lexicographically larger than Y if and only if Y is a prefix of X or x_{j} > y_{j} where j is the smallest integer such that x_{j} \\neq y_{j}.\n\nConstraints\n\n1 ≤ |s| ≤ 5000\n\ns consists of lowercase English letters.\n\n1 ≤ K ≤ 5\n\ns has at least K different substrings.\n\nPartial Score\n\n200 points will be awarded as a partial score for passing the test set satisfying |s| ≤ 50.\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns\nK\n\nOutput\n\nPrint the K-th lexicographically smallest substring of K.\n\nSample Input 1\n\naba\n4\n\nSample Output 1\n\nb\n\ns has five substrings: a, b, ab, ba and aba.\nAmong them, we should print the fourth smallest one, b.\nNote that we do not count a twice.\n\nSample Input 2\n\natcoderandatcodeer\n5\n\nSample Output 2\n\nandat\n\nSample Input 3\n\nz\n1\n\nSample Output 3\n\nz", "sample_input": "aba\n4\n"}, "reference_outputs": ["b\n"], "source_document_id": "p03355", "source_text": "Score : 300 points\n\nProblem Statement\n\nYou are given a string s.\nAmong the different substrings of s, print the K-th lexicographically smallest one.\n\nA substring of s is a string obtained by taking out a non-empty contiguous part in s.\nFor example, if s = ababc, a, bab and ababc are substrings of s, while ac, z and an empty string are not.\nAlso, we say that substrings are different when they are different as strings.\n\nLet X = x_{1}x_{2}...x_{n} and Y = y_{1}y_{2}...y_{m} be two distinct strings. X is lexicographically larger than Y if and only if Y is a prefix of X or x_{j} > y_{j} where j is the smallest integer such that x_{j} \\neq y_{j}.\n\nConstraints\n\n1 ≤ |s| ≤ 5000\n\ns consists of lowercase English letters.\n\n1 ≤ K ≤ 5\n\ns has at least K different substrings.\n\nPartial Score\n\n200 points will be awarded as a partial score for passing the test set satisfying |s| ≤ 50.\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns\nK\n\nOutput\n\nPrint the K-th lexicographically smallest substring of K.\n\nSample Input 1\n\naba\n4\n\nSample Output 1\n\nb\n\ns has five substrings: a, b, ab, ba and aba.\nAmong them, we should print the fourth smallest one, b.\nNote that we do not count a twice.\n\nSample Input 2\n\natcoderandatcodeer\n5\n\nSample Output 2\n\nandat\n\nSample Input 3\n\nz\n1\n\nSample Output 3\n\nz", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 597, "cpu_time_ms": 1037, "memory_kb": 3264}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s006729154", "group_id": "codeNet:p03355", "input_text": "var s:ansistring;\n a:array[0..100000]of string;\n i,j:longint;\n n,k:longint;\n num:longint;\n s1:string;\nprocedure qs(l,r:longint);\nvar i,j:longint;\n m,t:string;\nbegin\n i:=l;\n j:=r;\n m:=a[(l+r)>>1];\n repeat\n while a[i]m do dec(j);\n if i<=j then\n begin\n t:=a[i];a[i]:=a[j];a[j]:=t;\n inc(i);\n dec(j);\n end;\n until i>j;\n if la[i-1] then dec(k);\n if k=0 then\n begin\n writeln(a[i]);\n exit;\n end;\n end;\nend.\n\n\n\n", "language": "Pascal", "metadata": {"date": 1526174669, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03355.html", "problem_id": "p03355", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03355/input.txt", "sample_output_relpath": "derived/input_output/data/p03355/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03355/Pascal/s006729154.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s006729154", "user_id": "u809476955"}, "prompt_components": {"gold_output": "b\n", "input_to_evaluate": "var s:ansistring;\n a:array[0..100000]of string;\n i,j:longint;\n n,k:longint;\n num:longint;\n s1:string;\nprocedure qs(l,r:longint);\nvar i,j:longint;\n m,t:string;\nbegin\n i:=l;\n j:=r;\n m:=a[(l+r)>>1];\n repeat\n while a[i]m do dec(j);\n if i<=j then\n begin\n t:=a[i];a[i]:=a[j];a[j]:=t;\n inc(i);\n dec(j);\n end;\n until i>j;\n if la[i-1] then dec(k);\n if k=0 then\n begin\n writeln(a[i]);\n exit;\n end;\n end;\nend.\n\n\n\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nYou are given a string s.\nAmong the different substrings of s, print the K-th lexicographically smallest one.\n\nA substring of s is a string obtained by taking out a non-empty contiguous part in s.\nFor example, if s = ababc, a, bab and ababc are substrings of s, while ac, z and an empty string are not.\nAlso, we say that substrings are different when they are different as strings.\n\nLet X = x_{1}x_{2}...x_{n} and Y = y_{1}y_{2}...y_{m} be two distinct strings. X is lexicographically larger than Y if and only if Y is a prefix of X or x_{j} > y_{j} where j is the smallest integer such that x_{j} \\neq y_{j}.\n\nConstraints\n\n1 ≤ |s| ≤ 5000\n\ns consists of lowercase English letters.\n\n1 ≤ K ≤ 5\n\ns has at least K different substrings.\n\nPartial Score\n\n200 points will be awarded as a partial score for passing the test set satisfying |s| ≤ 50.\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns\nK\n\nOutput\n\nPrint the K-th lexicographically smallest substring of K.\n\nSample Input 1\n\naba\n4\n\nSample Output 1\n\nb\n\ns has five substrings: a, b, ab, ba and aba.\nAmong them, we should print the fourth smallest one, b.\nNote that we do not count a twice.\n\nSample Input 2\n\natcoderandatcodeer\n5\n\nSample Output 2\n\nandat\n\nSample Input 3\n\nz\n1\n\nSample Output 3\n\nz", "sample_input": "aba\n4\n"}, "reference_outputs": ["b\n"], "source_document_id": "p03355", "source_text": "Score : 300 points\n\nProblem Statement\n\nYou are given a string s.\nAmong the different substrings of s, print the K-th lexicographically smallest one.\n\nA substring of s is a string obtained by taking out a non-empty contiguous part in s.\nFor example, if s = ababc, a, bab and ababc are substrings of s, while ac, z and an empty string are not.\nAlso, we say that substrings are different when they are different as strings.\n\nLet X = x_{1}x_{2}...x_{n} and Y = y_{1}y_{2}...y_{m} be two distinct strings. X is lexicographically larger than Y if and only if Y is a prefix of X or x_{j} > y_{j} where j is the smallest integer such that x_{j} \\neq y_{j}.\n\nConstraints\n\n1 ≤ |s| ≤ 5000\n\ns consists of lowercase English letters.\n\n1 ≤ K ≤ 5\n\ns has at least K different substrings.\n\nPartial Score\n\n200 points will be awarded as a partial score for passing the test set satisfying |s| ≤ 50.\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns\nK\n\nOutput\n\nPrint the K-th lexicographically smallest substring of K.\n\nSample Input 1\n\naba\n4\n\nSample Output 1\n\nb\n\ns has five substrings: a, b, ab, ba and aba.\nAmong them, we should print the fourth smallest one, b.\nNote that we do not count a twice.\n\nSample Input 2\n\natcoderandatcodeer\n5\n\nSample Output 2\n\nandat\n\nSample Input 3\n\nz\n1\n\nSample Output 3\n\nz", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 16, "memory_kb": 1152}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s776308905", "group_id": "codeNet:p03356", "input_text": "var\n\tn,m,i,a,b,c:Longint;\n\tpa,p:array[1..100000]of Longint;\nfunction f(u:Longint):Longint;\nbegin\n\tif pa[u]<>u then pa[u]:=f(pa[u]);\n\tf:=pa[u];\nend;\nbegin\n\tread(n,m);\n\tfor i:=1 to n do begin\n\t\tread(p[i]);\n\t\tpa[i]:=i;\n\tend;\n\tfor i:=1 to m do begin\n\t\tread(a,b);\n\t\ta:=f(a);\n\t\tb:=f(b);\n\t\tif a<>b then pa[a]:=b;\n\tend;\n\tfor i:=1 to n do if f(p[i])=f(i)then inc(c);\n\twriteln(c);\nend.\n", "language": "Pascal", "metadata": {"date": 1540008343, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03356.html", "problem_id": "p03356", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03356/input.txt", "sample_output_relpath": "derived/input_output/data/p03356/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03356/Pascal/s776308905.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s776308905", "user_id": "u657913472"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "var\n\tn,m,i,a,b,c:Longint;\n\tpa,p:array[1..100000]of Longint;\nfunction f(u:Longint):Longint;\nbegin\n\tif pa[u]<>u then pa[u]:=f(pa[u]);\n\tf:=pa[u];\nend;\nbegin\n\tread(n,m);\n\tfor i:=1 to n do begin\n\t\tread(p[i]);\n\t\tpa[i]:=i;\n\tend;\n\tfor i:=1 to m do begin\n\t\tread(a,b);\n\t\ta:=f(a);\n\t\tb:=f(b);\n\t\tif a<>b then pa[a]:=b;\n\tend;\n\tfor i:=1 to n do if f(p[i])=f(i)then inc(c);\n\twriteln(c);\nend.\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nWe have a permutation of the integers from 1 through N, p_1, p_2, .., p_N.\nWe also have M pairs of two integers between 1 and N (inclusive), represented as (x_1,y_1), (x_2,y_2), .., (x_M,y_M).\nAtCoDeer the deer is going to perform the following operation on p as many times as desired so that the number of i (1 ≤ i ≤ N) such that p_i = i is maximized:\n\nChoose j such that 1 ≤ j ≤ M, and swap p_{x_j} and p_{y_j}.\n\nFind the maximum possible number of i such that p_i = i after operations.\n\nConstraints\n\n2 ≤ N ≤ 10^5\n\n1 ≤ M ≤ 10^5\n\np is a permutation of integers from 1 through N.\n\n1 ≤ x_j,y_j ≤ N\n\nx_j ≠ y_j\n\nIf i ≠ j, \\{x_i,y_i\\} ≠ \\{x_j,y_j\\}.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\np_1 p_2 .. p_N\nx_1 y_1\nx_2 y_2\n:\nx_M y_M\n\nOutput\n\nPrint the maximum possible number of i such that p_i = i after operations.\n\nSample Input 1\n\n5 2\n5 3 1 4 2\n1 3\n5 4\n\nSample Output 1\n\n2\n\nIf we perform the operation by choosing j=1, p becomes 1 3 5 4 2, which is optimal, so the answer is 2.\n\nSample Input 2\n\n3 2\n3 2 1\n1 2\n2 3\n\nSample Output 2\n\n3\n\nIf we perform the operation by, for example, choosing j=1, j=2, j=1 in this order, p becomes 1 2 3, which is obviously optimal.\nNote that we may choose the same j any number of times.\n\nSample Input 3\n\n10 8\n5 3 6 8 7 10 9 1 2 4\n3 1\n4 1\n5 9\n2 5\n6 5\n3 5\n8 9\n7 9\n\nSample Output 3\n\n8\n\nSample Input 4\n\n5 1\n1 2 3 4 5\n1 5\n\nSample Output 4\n\n5\n\nWe do not have to perform the operation.", "sample_input": "5 2\n5 3 1 4 2\n1 3\n5 4\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03356", "source_text": "Score : 400 points\n\nProblem Statement\n\nWe have a permutation of the integers from 1 through N, p_1, p_2, .., p_N.\nWe also have M pairs of two integers between 1 and N (inclusive), represented as (x_1,y_1), (x_2,y_2), .., (x_M,y_M).\nAtCoDeer the deer is going to perform the following operation on p as many times as desired so that the number of i (1 ≤ i ≤ N) such that p_i = i is maximized:\n\nChoose j such that 1 ≤ j ≤ M, and swap p_{x_j} and p_{y_j}.\n\nFind the maximum possible number of i such that p_i = i after operations.\n\nConstraints\n\n2 ≤ N ≤ 10^5\n\n1 ≤ M ≤ 10^5\n\np is a permutation of integers from 1 through N.\n\n1 ≤ x_j,y_j ≤ N\n\nx_j ≠ y_j\n\nIf i ≠ j, \\{x_i,y_i\\} ≠ \\{x_j,y_j\\}.\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\np_1 p_2 .. p_N\nx_1 y_1\nx_2 y_2\n:\nx_M y_M\n\nOutput\n\nPrint the maximum possible number of i such that p_i = i after operations.\n\nSample Input 1\n\n5 2\n5 3 1 4 2\n1 3\n5 4\n\nSample Output 1\n\n2\n\nIf we perform the operation by choosing j=1, p becomes 1 3 5 4 2, which is optimal, so the answer is 2.\n\nSample Input 2\n\n3 2\n3 2 1\n1 2\n2 3\n\nSample Output 2\n\n3\n\nIf we perform the operation by, for example, choosing j=1, j=2, j=1 in this order, p becomes 1 2 3, which is obviously optimal.\nNote that we may choose the same j any number of times.\n\nSample Input 3\n\n10 8\n5 3 6 8 7 10 9 1 2 4\n3 1\n4 1\n5 9\n2 5\n6 5\n3 5\n8 9\n7 9\n\nSample Output 3\n\n8\n\nSample Input 4\n\n5 1\n1 2 3 4 5\n1 5\n\nSample Output 4\n\n5\n\nWe do not have to perform the operation.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 41, "memory_kb": 896}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s176100991", "group_id": "codeNet:p03359", "input_text": "var\n\ta, b, i, j, total: integer;\nbegin\n\treadln(a, b);\n\ttotal:= 0;\n\tfor i := 1 to a do begin\n\t\tfor j := 1 to b do begin\n\t\t\tif i=j then\n\t\t\ttotal:= total+1;\n\t\tend;\n\tend;\n\twriteln(total);\nend.", "language": "Pascal", "metadata": {"date": 1553553024, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03359.html", "problem_id": "p03359", "resource_group": "low_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/Pascal/s176100991.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s176100991", "user_id": "u863370423"}, "prompt_components": {"gold_output": "5\n", "input_to_evaluate": "var\n\ta, b, i, j, total: integer;\nbegin\n\treadln(a, b);\n\ttotal:= 0;\n\tfor i := 1 to a do begin\n\t\tfor j := 1 to b do begin\n\t\t\tif i=j then\n\t\t\ttotal:= total+1;\n\t\tend;\n\tend;\n\twriteln(total);\nend.", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 3, "memory_kb": 128}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s357109428", "group_id": "codeNet:p03361", "input_text": "program Project1;\n\n{$APPTYPE CONSOLE}\n\nuses\n SysUtils;\nvar\n a,h,w,i,j,count,x,y,sw,m,n,b,c,soeji,sum,max,k:Integer;\n l:array of array of char;\n s,s123,s1,s2,s3:string;\n tf:Boolean;\nbegin\n try\n { TODO -oUser -cConsole Main : ここにコードを記述してください }\n Read(h);\n Readln(w);\n SetLength(l,h+2,w+2);\n\n for i := 0 to h+1 do\n for j := 0 to w+1 do\n l[i][j]:='.';\n\n for i := 1 to h do begin\n Readln(s);\n for j := 1 to Length(s) do\n l[i][j]:=s[j];\n end;\n\n for i := 1 to h do\n for j := 1 to w do begin\n if (l[i][j]='#')and(l[i-1][j]='.')and(l[i+1][j]='.')and(l[i][j-1]='.')and(l[i][j+1]='.') then begin\n Writeln('No');\n Readln;\n exit;\n end;\n end;\n\n Writeln('Yes');\n Readln;\n except\n on E: Exception do\n Writeln(E.ClassName, ': ', E.Message);\n end;\nend.", "language": "Pascal", "metadata": {"date": 1525901629, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03361.html", "problem_id": "p03361", "resource_group": "low_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/Pascal/s357109428.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s357109428", "user_id": "u755925739"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "program Project1;\n\n{$APPTYPE CONSOLE}\n\nuses\n SysUtils;\nvar\n a,h,w,i,j,count,x,y,sw,m,n,b,c,soeji,sum,max,k:Integer;\n l:array of array of char;\n s,s123,s1,s2,s3:string;\n tf:Boolean;\nbegin\n try\n { TODO -oUser -cConsole Main : ここにコードを記述してください }\n Read(h);\n Readln(w);\n SetLength(l,h+2,w+2);\n\n for i := 0 to h+1 do\n for j := 0 to w+1 do\n l[i][j]:='.';\n\n for i := 1 to h do begin\n Readln(s);\n for j := 1 to Length(s) do\n l[i][j]:=s[j];\n end;\n\n for i := 1 to h do\n for j := 1 to w do begin\n if (l[i][j]='#')and(l[i-1][j]='.')and(l[i+1][j]='.')and(l[i][j-1]='.')and(l[i][j+1]='.') then begin\n Writeln('No');\n Readln;\n exit;\n end;\n end;\n\n Writeln('Yes');\n Readln;\n except\n on E: Exception do\n Writeln(E.ClassName, ': ', E.Message);\n end;\nend.", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 890, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s562038432", "group_id": "codeNet:p03362", "input_text": "var n,num,max,sum:longint;\n i,j:longint;\n v:array[0..100000]of boolean;\n a:array[0..10000]of longint;\nbegin\n readln(n);\n max:=55555;\n for i:=2 to max do\n if not v[i] then\n begin\n inc(num);\n a[num]:=i;\n for j:=1 to max div i do\n v[i*j]:=true;\n end;\n for i:=1 to num do\n begin\n if a[i] mod 10=1 then write(a[i],' ');\n dec(n);\n if n=0 then exit;\n end;\n\nend.", "language": "Pascal", "metadata": {"date": 1525570444, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03362.html", "problem_id": "p03362", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03362/input.txt", "sample_output_relpath": "derived/input_output/data/p03362/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03362/Pascal/s562038432.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s562038432", "user_id": "u165920140"}, "prompt_components": {"gold_output": "3 5 7 11 31\n", "input_to_evaluate": "var n,num,max,sum:longint;\n i,j:longint;\n v:array[0..100000]of boolean;\n a:array[0..10000]of longint;\nbegin\n readln(n);\n max:=55555;\n for i:=2 to max do\n if not v[i] then\n begin\n inc(num);\n a[num]:=i;\n for j:=1 to max div i do\n v[i*j]:=true;\n end;\n for i:=1 to num do\n begin\n if a[i] mod 10=1 then write(a[i],' ');\n dec(n);\n if n=0 then exit;\n end;\n\nend.", "problem_context": "Score: 400 points\n\nProblem Statement\n\nPrint a sequence a_1, a_2, ..., a_N whose length is N that satisfies the following conditions:\n\na_i (1 \\leq i \\leq N) is a prime number at most 55 555.\n\nThe values of a_1, a_2, ..., a_N are all different.\n\nIn every choice of five different integers from a_1, a_2, ..., a_N, the sum of those integers is a composite number.\n\nIf there are multiple such sequences, printing any of them is accepted.\n\nNotes\n\nAn integer N not less than 2 is called a prime number if it cannot be divided evenly by any integers except 1 and N, and called a composite number otherwise.\n\nConstraints\n\nN is an integer between 5 and 55 (inclusive).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint N numbers a_1, a_2, a_3, ..., a_N in a line, with spaces in between.\n\nSample Input 1\n\n5\n\nSample Output 1\n\n3 5 7 11 31\n\nLet us see if this output actually satisfies the conditions.\n\nFirst, 3, 5, 7, 11 and 31 are all different, and all of them are prime numbers.\n\nThe only way to choose five among them is to choose all of them, whose sum is a_1+a_2+a_3+a_4+a_5=57, which is a composite number.\n\nThere are also other possible outputs, such as 2 3 5 7 13, 11 13 17 19 31 and 7 11 5 31 3.\n\nSample Input 2\n\n6\n\nSample Output 2\n\n2 3 5 7 11 13\n\n2, 3, 5, 7, 11, 13 are all different prime numbers.\n\n2+3+5+7+11=28 is a composite number.\n\n2+3+5+7+13=30 is a composite number.\n\n2+3+5+11+13=34 is a composite number.\n\n2+3+7+11+13=36 is a composite number.\n\n2+5+7+11+13=38 is a composite number.\n\n3+5+7+11+13=39 is a composite number.\n\nThus, the sequence 2 3 5 7 11 13 satisfies the conditions.\n\nSample Input 3\n\n8\n\nSample Output 3\n\n2 5 7 13 19 37 67 79", "sample_input": "5\n"}, "reference_outputs": ["3 5 7 11 31\n"], "source_document_id": "p03362", "source_text": "Score: 400 points\n\nProblem Statement\n\nPrint a sequence a_1, a_2, ..., a_N whose length is N that satisfies the following conditions:\n\na_i (1 \\leq i \\leq N) is a prime number at most 55 555.\n\nThe values of a_1, a_2, ..., a_N are all different.\n\nIn every choice of five different integers from a_1, a_2, ..., a_N, the sum of those integers is a composite number.\n\nIf there are multiple such sequences, printing any of them is accepted.\n\nNotes\n\nAn integer N not less than 2 is called a prime number if it cannot be divided evenly by any integers except 1 and N, and called a composite number otherwise.\n\nConstraints\n\nN is an integer between 5 and 55 (inclusive).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint N numbers a_1, a_2, a_3, ..., a_N in a line, with spaces in between.\n\nSample Input 1\n\n5\n\nSample Output 1\n\n3 5 7 11 31\n\nLet us see if this output actually satisfies the conditions.\n\nFirst, 3, 5, 7, 11 and 31 are all different, and all of them are prime numbers.\n\nThe only way to choose five among them is to choose all of them, whose sum is a_1+a_2+a_3+a_4+a_5=57, which is a composite number.\n\nThere are also other possible outputs, such as 2 3 5 7 13, 11 13 17 19 31 and 7 11 5 31 3.\n\nSample Input 2\n\n6\n\nSample Output 2\n\n2 3 5 7 11 13\n\n2, 3, 5, 7, 11, 13 are all different prime numbers.\n\n2+3+5+7+11=28 is a composite number.\n\n2+3+5+7+13=30 is a composite number.\n\n2+3+5+11+13=34 is a composite number.\n\n2+3+7+11+13=36 is a composite number.\n\n2+5+7+11+13=38 is a composite number.\n\n3+5+7+11+13=39 is a composite number.\n\nThus, the sequence 2 3 5 7 11 13 satisfies the conditions.\n\nSample Input 3\n\n8\n\nSample Output 3\n\n2 5 7 13 19 37 67 79", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 1, "memory_kb": 128}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s947047033", "group_id": "codeNet:p03366", "input_text": "var \n n,s,flag,i,left,right:longint;\n tot:int64;\n x,p:array[1..200000]of int64;\nbegin\n readln(n,s);\n for i:=1 to n do\n begin\n readln(x[i],p[i]);\n end;\n if s<=x[1] then\n begin\n tot:=x[n]-s;\n write(tot);\n exit;\n end;\n if s>x[n] then\n begin\n tot:=s-x[1];\n write(tot);\n exit;\n end;\n left:=1;\n right:=n;\n if p[1]s)do begin\n if p[left]>=p[right] then\n begin\n p[left]:=p[left]+p[right];\n if flag=2 then tot:=tot+x[right]-x[left];\n dec(right);\n if flag=2 then flag:=1;\n end\n else begin\n p[right]:=p[right]+p[left];\n if flag=1 then tot:=tot+x[right]-x[left];\n inc(left);\n if flag=1 then flag:=2;\n end;\n end;\n if x[left]>s then write(tot+x[right]-s)\n else write(tot+s-x[left])\nend.", "language": "Pascal", "metadata": {"date": 1530933361, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03366.html", "problem_id": "p03366", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03366/input.txt", "sample_output_relpath": "derived/input_output/data/p03366/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03366/Pascal/s947047033.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s947047033", "user_id": "u603541616"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "var \n n,s,flag,i,left,right:longint;\n tot:int64;\n x,p:array[1..200000]of int64;\nbegin\n readln(n,s);\n for i:=1 to n do\n begin\n readln(x[i],p[i]);\n end;\n if s<=x[1] then\n begin\n tot:=x[n]-s;\n write(tot);\n exit;\n end;\n if s>x[n] then\n begin\n tot:=s-x[1];\n write(tot);\n exit;\n end;\n left:=1;\n right:=n;\n if p[1]s)do begin\n if p[left]>=p[right] then\n begin\n p[left]:=p[left]+p[right];\n if flag=2 then tot:=tot+x[right]-x[left];\n dec(right);\n if flag=2 then flag:=1;\n end\n else begin\n p[right]:=p[right]+p[left];\n if flag=1 then tot:=tot+x[right]-x[left];\n inc(left);\n if flag=1 then flag:=2;\n end;\n end;\n if x[left]>s then write(tot+x[right]-s)\n else write(tot+s-x[left])\nend.", "problem_context": "Score : 1200 points\n\nProblem Statement\n\nThere are N apartments along a number line, numbered 1 through N.\nApartment i is located at coordinate X_i.\nAlso, the office of AtCoder Inc. is located at coordinate S.\nEvery employee of AtCoder lives in one of the N apartments.\nThere are P_i employees who are living in Apartment i.\n\nAll employees of AtCoder are now leaving the office all together.\nSince they are tired from work, they would like to get home by the company's bus.\nAtCoder owns only one bus, but it can accommodate all the employees.\nThis bus will leave coordinate S with all the employees and move according to the following rule:\n\nEveryone on the bus casts a vote on which direction the bus should proceed, positive or negative. (The bus is autonomous and has no driver.) Each person has one vote, and abstaining from voting is not allowed. Then, the bus moves a distance of 1 in the direction with the greater number of votes. If a tie occurs, the bus moves in the negative direction. If there is an apartment at the coordinate of the bus after the move, all the employees who live there get off.\n\nRepeat the operation above as long as there is one or more employees on the bus.\n\nFor a specific example, see Sample Input 1.\n\nThe bus takes one seconds to travel a distance of 1.\nThe time required to vote and get off the bus is ignorable.\n\nEvery employee will vote so that he himself/she herself can get off the bus at the earliest possible time.\nStrictly speaking, when a vote is taking place, each employee see which direction results in the earlier arrival at his/her apartment, assuming that all the employees follow the same strategy in the future.\nBased on this information, each employee makes the optimal choice, but if either direction results in the arrival at the same time, he/she casts a vote to the negative direction.\n\nFind the time the bus will take from departure to arrival at the last employees' apartment.\nIt can be proved that, given the positions of the apartments, the numbers of employees living in each apartment and the initial position of the bus, the future movement of the bus is uniquely determined, and the process will end in a finite time.\n\nConstraints\n\n1 \\leq N \\leq 10^5\n\n1 \\leq S \\leq 10^9\n\n1 \\leq X_1 < X_2 < ... < X_N \\leq 10^9\n\nX_i \\neq S ( 1 \\leq i \\leq N )\n\n1 \\leq P_i \\leq 10^9 ( 1 \\leq i \\leq N )\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN S\nX_1 P_1\nX_2 P_2\n:\nX_N P_N\n\nOutput\n\nPrint the number of seconds the bus will take from departure to arrival at the last employees' apartment.\n\nSample Input 1\n\n3 2\n1 3\n3 4\n4 2\n\nSample Output 1\n\n4\n\nAssume that the bus moves in the negative direction first.\nThen, the coordinate of the bus changes from 2 to 1, and the employees living in Apartment 1 get off.\nThe movement of the bus after that is obvious: it just continues moving in the positive direction.\nThus, if the bus moves in the negative direction first, the coordinate of the bus changes as 2 → 1 → 2 → 3 → 4 from departure.\nThe time it takes to get home for the employees living in Apartment 1, 2, 3 are 1, 3, 4 seconds, respectively.\n\nNext, assume that the bus moves in the positive direction first.\nThen, the coordinate of the bus changes from 2 to 3, and the employees living in Apartment 2 get off.\nAfterwards, the bus starts heading to Apartment 1, because there are more employees living in Apartment 1 than in Apartment 3.\nThen, after arriving at Apartment 1, the bus heads to Apartment 3.\nThus, if the bus moves in the positive direction first, the coordinate of the bus changes as 2 → 3 → 2 → 1 → 2 → 3 → 4 from departure.\nThe time it takes to get home for the employees living in Apartment 1, 2, 3 are 3, 1, 6 seconds, respectively.\n\nTherefore, in the beginning, the employees living in Apartment 1 or 3 will try to move the bus in the negative direction.\nOn the other hand, the employees living in Apartment 2 will try to move the bus in the positive direction in the beginning.\nThere are a total of 3 + 2 = 5 employees living in Apartment 1 and 3 combined, which is more than those living in Apartment 2, which is 4.\nThus, the bus will move in the negative direction first, and the coordinate of the bus will change as 2 → 1 → 2 → 3 → 4 from departure.\n\nSample Input 2\n\n6 4\n1 10\n2 1000\n3 100000\n5 1000000\n6 10000\n7 100\n\nSample Output 2\n\n21\n\nSince the numbers of employees living in different apartments are literally off by a digit, the bus consistently head to the apartment where the most number of employees on the bus lives.\n\nSample Input 3\n\n15 409904902\n94198000 15017\n117995501 7656764\n275583856 313263626\n284496300 356635175\n324233841 607\n360631781 148\n472103717 5224\n497641071 34695\n522945827 816241\n554305668 32\n623788284 22832\n667409501 124410641\n876731548 12078\n904557302 291749534\n918215789 5\n\nSample Output 3\n\n2397671583", "sample_input": "3 2\n1 3\n3 4\n4 2\n"}, "reference_outputs": ["4\n"], "source_document_id": "p03366", "source_text": "Score : 1200 points\n\nProblem Statement\n\nThere are N apartments along a number line, numbered 1 through N.\nApartment i is located at coordinate X_i.\nAlso, the office of AtCoder Inc. is located at coordinate S.\nEvery employee of AtCoder lives in one of the N apartments.\nThere are P_i employees who are living in Apartment i.\n\nAll employees of AtCoder are now leaving the office all together.\nSince they are tired from work, they would like to get home by the company's bus.\nAtCoder owns only one bus, but it can accommodate all the employees.\nThis bus will leave coordinate S with all the employees and move according to the following rule:\n\nEveryone on the bus casts a vote on which direction the bus should proceed, positive or negative. (The bus is autonomous and has no driver.) Each person has one vote, and abstaining from voting is not allowed. Then, the bus moves a distance of 1 in the direction with the greater number of votes. If a tie occurs, the bus moves in the negative direction. If there is an apartment at the coordinate of the bus after the move, all the employees who live there get off.\n\nRepeat the operation above as long as there is one or more employees on the bus.\n\nFor a specific example, see Sample Input 1.\n\nThe bus takes one seconds to travel a distance of 1.\nThe time required to vote and get off the bus is ignorable.\n\nEvery employee will vote so that he himself/she herself can get off the bus at the earliest possible time.\nStrictly speaking, when a vote is taking place, each employee see which direction results in the earlier arrival at his/her apartment, assuming that all the employees follow the same strategy in the future.\nBased on this information, each employee makes the optimal choice, but if either direction results in the arrival at the same time, he/she casts a vote to the negative direction.\n\nFind the time the bus will take from departure to arrival at the last employees' apartment.\nIt can be proved that, given the positions of the apartments, the numbers of employees living in each apartment and the initial position of the bus, the future movement of the bus is uniquely determined, and the process will end in a finite time.\n\nConstraints\n\n1 \\leq N \\leq 10^5\n\n1 \\leq S \\leq 10^9\n\n1 \\leq X_1 < X_2 < ... < X_N \\leq 10^9\n\nX_i \\neq S ( 1 \\leq i \\leq N )\n\n1 \\leq P_i \\leq 10^9 ( 1 \\leq i \\leq N )\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN S\nX_1 P_1\nX_2 P_2\n:\nX_N P_N\n\nOutput\n\nPrint the number of seconds the bus will take from departure to arrival at the last employees' apartment.\n\nSample Input 1\n\n3 2\n1 3\n3 4\n4 2\n\nSample Output 1\n\n4\n\nAssume that the bus moves in the negative direction first.\nThen, the coordinate of the bus changes from 2 to 1, and the employees living in Apartment 1 get off.\nThe movement of the bus after that is obvious: it just continues moving in the positive direction.\nThus, if the bus moves in the negative direction first, the coordinate of the bus changes as 2 → 1 → 2 → 3 → 4 from departure.\nThe time it takes to get home for the employees living in Apartment 1, 2, 3 are 1, 3, 4 seconds, respectively.\n\nNext, assume that the bus moves in the positive direction first.\nThen, the coordinate of the bus changes from 2 to 3, and the employees living in Apartment 2 get off.\nAfterwards, the bus starts heading to Apartment 1, because there are more employees living in Apartment 1 than in Apartment 3.\nThen, after arriving at Apartment 1, the bus heads to Apartment 3.\nThus, if the bus moves in the positive direction first, the coordinate of the bus changes as 2 → 3 → 2 → 1 → 2 → 3 → 4 from departure.\nThe time it takes to get home for the employees living in Apartment 1, 2, 3 are 3, 1, 6 seconds, respectively.\n\nTherefore, in the beginning, the employees living in Apartment 1 or 3 will try to move the bus in the negative direction.\nOn the other hand, the employees living in Apartment 2 will try to move the bus in the positive direction in the beginning.\nThere are a total of 3 + 2 = 5 employees living in Apartment 1 and 3 combined, which is more than those living in Apartment 2, which is 4.\nThus, the bus will move in the negative direction first, and the coordinate of the bus will change as 2 → 1 → 2 → 3 → 4 from departure.\n\nSample Input 2\n\n6 4\n1 10\n2 1000\n3 100000\n5 1000000\n6 10000\n7 100\n\nSample Output 2\n\n21\n\nSince the numbers of employees living in different apartments are literally off by a digit, the bus consistently head to the apartment where the most number of employees on the bus lives.\n\nSample Input 3\n\n15 409904902\n94198000 15017\n117995501 7656764\n275583856 313263626\n284496300 356635175\n324233841 607\n360631781 148\n472103717 5224\n497641071 34695\n522945827 816241\n554305668 32\n623788284 22832\n667409501 124410641\n876731548 12078\n904557302 291749534\n918215789 5\n\nSample Output 3\n\n2397671583", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1018, "cpu_time_ms": 31, "memory_kb": 1664}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s848968117", "group_id": "codeNet:p03366", "input_text": "var\n i,j,flag:longint;\n n,s,left,right,tot:int64;\n p,x:array[1..100000]of int64;\nbegin\n readln(n,s);\n for i:=1 to n do\n readln(x[i],p[i]);\n if s<=x[1] then\n begin\n write(x[n]-s);\n exit;\n end;\n left:=1;\n right:=n;\n if p[1]>=p[n] then begin p[1]:=p[1]+p[n]; dec(right);flag:=1;end\n else begin p[n+1]:=p[n]+p[1]; inc(left);flag:=-1;end;\n tot:=tot+x[n]-x[1];\n while (x[left]s) do\n begin\n if p[left]>=p[right] then begin\n p[left]:=p[left]+p[right];\n if flag<>1 then begin tot:=tot+x[right]-x[left]; flag:=1;end;\n dec(right); end\n else begin\n p[right]:=p[left]+p[right];\n if flag<>-1 then begin tot:=tot+x[right]-x[left]; flag:=-1;end;\n inc(left); end;\n end;\n if x[left]>s then writeln(tot+x[right]-s)\n else writeln(tot+s-x[left]);\nend.\n\n", "language": "Pascal", "metadata": {"date": 1530906502, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03366.html", "problem_id": "p03366", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03366/input.txt", "sample_output_relpath": "derived/input_output/data/p03366/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03366/Pascal/s848968117.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s848968117", "user_id": "u658406065"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "var\n i,j,flag:longint;\n n,s,left,right,tot:int64;\n p,x:array[1..100000]of int64;\nbegin\n readln(n,s);\n for i:=1 to n do\n readln(x[i],p[i]);\n if s<=x[1] then\n begin\n write(x[n]-s);\n exit;\n end;\n left:=1;\n right:=n;\n if p[1]>=p[n] then begin p[1]:=p[1]+p[n]; dec(right);flag:=1;end\n else begin p[n+1]:=p[n]+p[1]; inc(left);flag:=-1;end;\n tot:=tot+x[n]-x[1];\n while (x[left]s) do\n begin\n if p[left]>=p[right] then begin\n p[left]:=p[left]+p[right];\n if flag<>1 then begin tot:=tot+x[right]-x[left]; flag:=1;end;\n dec(right); end\n else begin\n p[right]:=p[left]+p[right];\n if flag<>-1 then begin tot:=tot+x[right]-x[left]; flag:=-1;end;\n inc(left); end;\n end;\n if x[left]>s then writeln(tot+x[right]-s)\n else writeln(tot+s-x[left]);\nend.\n\n", "problem_context": "Score : 1200 points\n\nProblem Statement\n\nThere are N apartments along a number line, numbered 1 through N.\nApartment i is located at coordinate X_i.\nAlso, the office of AtCoder Inc. is located at coordinate S.\nEvery employee of AtCoder lives in one of the N apartments.\nThere are P_i employees who are living in Apartment i.\n\nAll employees of AtCoder are now leaving the office all together.\nSince they are tired from work, they would like to get home by the company's bus.\nAtCoder owns only one bus, but it can accommodate all the employees.\nThis bus will leave coordinate S with all the employees and move according to the following rule:\n\nEveryone on the bus casts a vote on which direction the bus should proceed, positive or negative. (The bus is autonomous and has no driver.) Each person has one vote, and abstaining from voting is not allowed. Then, the bus moves a distance of 1 in the direction with the greater number of votes. If a tie occurs, the bus moves in the negative direction. If there is an apartment at the coordinate of the bus after the move, all the employees who live there get off.\n\nRepeat the operation above as long as there is one or more employees on the bus.\n\nFor a specific example, see Sample Input 1.\n\nThe bus takes one seconds to travel a distance of 1.\nThe time required to vote and get off the bus is ignorable.\n\nEvery employee will vote so that he himself/she herself can get off the bus at the earliest possible time.\nStrictly speaking, when a vote is taking place, each employee see which direction results in the earlier arrival at his/her apartment, assuming that all the employees follow the same strategy in the future.\nBased on this information, each employee makes the optimal choice, but if either direction results in the arrival at the same time, he/she casts a vote to the negative direction.\n\nFind the time the bus will take from departure to arrival at the last employees' apartment.\nIt can be proved that, given the positions of the apartments, the numbers of employees living in each apartment and the initial position of the bus, the future movement of the bus is uniquely determined, and the process will end in a finite time.\n\nConstraints\n\n1 \\leq N \\leq 10^5\n\n1 \\leq S \\leq 10^9\n\n1 \\leq X_1 < X_2 < ... < X_N \\leq 10^9\n\nX_i \\neq S ( 1 \\leq i \\leq N )\n\n1 \\leq P_i \\leq 10^9 ( 1 \\leq i \\leq N )\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN S\nX_1 P_1\nX_2 P_2\n:\nX_N P_N\n\nOutput\n\nPrint the number of seconds the bus will take from departure to arrival at the last employees' apartment.\n\nSample Input 1\n\n3 2\n1 3\n3 4\n4 2\n\nSample Output 1\n\n4\n\nAssume that the bus moves in the negative direction first.\nThen, the coordinate of the bus changes from 2 to 1, and the employees living in Apartment 1 get off.\nThe movement of the bus after that is obvious: it just continues moving in the positive direction.\nThus, if the bus moves in the negative direction first, the coordinate of the bus changes as 2 → 1 → 2 → 3 → 4 from departure.\nThe time it takes to get home for the employees living in Apartment 1, 2, 3 are 1, 3, 4 seconds, respectively.\n\nNext, assume that the bus moves in the positive direction first.\nThen, the coordinate of the bus changes from 2 to 3, and the employees living in Apartment 2 get off.\nAfterwards, the bus starts heading to Apartment 1, because there are more employees living in Apartment 1 than in Apartment 3.\nThen, after arriving at Apartment 1, the bus heads to Apartment 3.\nThus, if the bus moves in the positive direction first, the coordinate of the bus changes as 2 → 3 → 2 → 1 → 2 → 3 → 4 from departure.\nThe time it takes to get home for the employees living in Apartment 1, 2, 3 are 3, 1, 6 seconds, respectively.\n\nTherefore, in the beginning, the employees living in Apartment 1 or 3 will try to move the bus in the negative direction.\nOn the other hand, the employees living in Apartment 2 will try to move the bus in the positive direction in the beginning.\nThere are a total of 3 + 2 = 5 employees living in Apartment 1 and 3 combined, which is more than those living in Apartment 2, which is 4.\nThus, the bus will move in the negative direction first, and the coordinate of the bus will change as 2 → 1 → 2 → 3 → 4 from departure.\n\nSample Input 2\n\n6 4\n1 10\n2 1000\n3 100000\n5 1000000\n6 10000\n7 100\n\nSample Output 2\n\n21\n\nSince the numbers of employees living in different apartments are literally off by a digit, the bus consistently head to the apartment where the most number of employees on the bus lives.\n\nSample Input 3\n\n15 409904902\n94198000 15017\n117995501 7656764\n275583856 313263626\n284496300 356635175\n324233841 607\n360631781 148\n472103717 5224\n497641071 34695\n522945827 816241\n554305668 32\n623788284 22832\n667409501 124410641\n876731548 12078\n904557302 291749534\n918215789 5\n\nSample Output 3\n\n2397671583", "sample_input": "3 2\n1 3\n3 4\n4 2\n"}, "reference_outputs": ["4\n"], "source_document_id": "p03366", "source_text": "Score : 1200 points\n\nProblem Statement\n\nThere are N apartments along a number line, numbered 1 through N.\nApartment i is located at coordinate X_i.\nAlso, the office of AtCoder Inc. is located at coordinate S.\nEvery employee of AtCoder lives in one of the N apartments.\nThere are P_i employees who are living in Apartment i.\n\nAll employees of AtCoder are now leaving the office all together.\nSince they are tired from work, they would like to get home by the company's bus.\nAtCoder owns only one bus, but it can accommodate all the employees.\nThis bus will leave coordinate S with all the employees and move according to the following rule:\n\nEveryone on the bus casts a vote on which direction the bus should proceed, positive or negative. (The bus is autonomous and has no driver.) Each person has one vote, and abstaining from voting is not allowed. Then, the bus moves a distance of 1 in the direction with the greater number of votes. If a tie occurs, the bus moves in the negative direction. If there is an apartment at the coordinate of the bus after the move, all the employees who live there get off.\n\nRepeat the operation above as long as there is one or more employees on the bus.\n\nFor a specific example, see Sample Input 1.\n\nThe bus takes one seconds to travel a distance of 1.\nThe time required to vote and get off the bus is ignorable.\n\nEvery employee will vote so that he himself/she herself can get off the bus at the earliest possible time.\nStrictly speaking, when a vote is taking place, each employee see which direction results in the earlier arrival at his/her apartment, assuming that all the employees follow the same strategy in the future.\nBased on this information, each employee makes the optimal choice, but if either direction results in the arrival at the same time, he/she casts a vote to the negative direction.\n\nFind the time the bus will take from departure to arrival at the last employees' apartment.\nIt can be proved that, given the positions of the apartments, the numbers of employees living in each apartment and the initial position of the bus, the future movement of the bus is uniquely determined, and the process will end in a finite time.\n\nConstraints\n\n1 \\leq N \\leq 10^5\n\n1 \\leq S \\leq 10^9\n\n1 \\leq X_1 < X_2 < ... < X_N \\leq 10^9\n\nX_i \\neq S ( 1 \\leq i \\leq N )\n\n1 \\leq P_i \\leq 10^9 ( 1 \\leq i \\leq N )\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN S\nX_1 P_1\nX_2 P_2\n:\nX_N P_N\n\nOutput\n\nPrint the number of seconds the bus will take from departure to arrival at the last employees' apartment.\n\nSample Input 1\n\n3 2\n1 3\n3 4\n4 2\n\nSample Output 1\n\n4\n\nAssume that the bus moves in the negative direction first.\nThen, the coordinate of the bus changes from 2 to 1, and the employees living in Apartment 1 get off.\nThe movement of the bus after that is obvious: it just continues moving in the positive direction.\nThus, if the bus moves in the negative direction first, the coordinate of the bus changes as 2 → 1 → 2 → 3 → 4 from departure.\nThe time it takes to get home for the employees living in Apartment 1, 2, 3 are 1, 3, 4 seconds, respectively.\n\nNext, assume that the bus moves in the positive direction first.\nThen, the coordinate of the bus changes from 2 to 3, and the employees living in Apartment 2 get off.\nAfterwards, the bus starts heading to Apartment 1, because there are more employees living in Apartment 1 than in Apartment 3.\nThen, after arriving at Apartment 1, the bus heads to Apartment 3.\nThus, if the bus moves in the positive direction first, the coordinate of the bus changes as 2 → 3 → 2 → 1 → 2 → 3 → 4 from departure.\nThe time it takes to get home for the employees living in Apartment 1, 2, 3 are 3, 1, 6 seconds, respectively.\n\nTherefore, in the beginning, the employees living in Apartment 1 or 3 will try to move the bus in the negative direction.\nOn the other hand, the employees living in Apartment 2 will try to move the bus in the positive direction in the beginning.\nThere are a total of 3 + 2 = 5 employees living in Apartment 1 and 3 combined, which is more than those living in Apartment 2, which is 4.\nThus, the bus will move in the negative direction first, and the coordinate of the bus will change as 2 → 1 → 2 → 3 → 4 from departure.\n\nSample Input 2\n\n6 4\n1 10\n2 1000\n3 100000\n5 1000000\n6 10000\n7 100\n\nSample Output 2\n\n21\n\nSince the numbers of employees living in different apartments are literally off by a digit, the bus consistently head to the apartment where the most number of employees on the bus lives.\n\nSample Input 3\n\n15 409904902\n94198000 15017\n117995501 7656764\n275583856 313263626\n284496300 356635175\n324233841 607\n360631781 148\n472103717 5224\n497641071 34695\n522945827 816241\n554305668 32\n623788284 22832\n667409501 124410641\n876731548 12078\n904557302 291749534\n918215789 5\n\nSample Output 3\n\n2397671583", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 901, "cpu_time_ms": 32, "memory_kb": 1664}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s821019963", "group_id": "codeNet:p03366", "input_text": "var\n n,s,flag,left,right,i,j,tot:longint;\n p,x:array[1..100000]of longint;\nbegin\n readln(n,s);\n for i:=1 to n do\n readln(x[i],p[i]);\n if s<=x[1] then\n begin\n write(x[n]-s);\n exit;\n end;\n left:=1;\n right:=n;\n if p[1]>=p[n] then begin p[1]:=p[1]+p[n]; dec(right);flag:=1;end\n else begin p[n+1]:=p[n]+p[1]; inc(left);flag:=-1;end;\n tot:=tot+x[n]-x[1];\n while (x[left]s) do\n begin\n if p[left]>=p[right] then begin\n p[left]:=p[left]+p[right];\n if flag<>1 then begin tot:=tot+x[right]-x[left]; flag:=1;end;\n dec(right); end\n else begin\n p[right]:=p[left]+p[right];\n if flag<>-1 then begin tot:=tot+x[right]-x[left]; flag:=-1;end;\n inc(left); end;\n end;\n if x[left]>s then writeln(tot+x[right]-s)\n else writeln(tot+s-x[left]);\nend.", "language": "Pascal", "metadata": {"date": 1530839647, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03366.html", "problem_id": "p03366", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03366/input.txt", "sample_output_relpath": "derived/input_output/data/p03366/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03366/Pascal/s821019963.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s821019963", "user_id": "u658406065"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "var\n n,s,flag,left,right,i,j,tot:longint;\n p,x:array[1..100000]of longint;\nbegin\n readln(n,s);\n for i:=1 to n do\n readln(x[i],p[i]);\n if s<=x[1] then\n begin\n write(x[n]-s);\n exit;\n end;\n left:=1;\n right:=n;\n if p[1]>=p[n] then begin p[1]:=p[1]+p[n]; dec(right);flag:=1;end\n else begin p[n+1]:=p[n]+p[1]; inc(left);flag:=-1;end;\n tot:=tot+x[n]-x[1];\n while (x[left]s) do\n begin\n if p[left]>=p[right] then begin\n p[left]:=p[left]+p[right];\n if flag<>1 then begin tot:=tot+x[right]-x[left]; flag:=1;end;\n dec(right); end\n else begin\n p[right]:=p[left]+p[right];\n if flag<>-1 then begin tot:=tot+x[right]-x[left]; flag:=-1;end;\n inc(left); end;\n end;\n if x[left]>s then writeln(tot+x[right]-s)\n else writeln(tot+s-x[left]);\nend.", "problem_context": "Score : 1200 points\n\nProblem Statement\n\nThere are N apartments along a number line, numbered 1 through N.\nApartment i is located at coordinate X_i.\nAlso, the office of AtCoder Inc. is located at coordinate S.\nEvery employee of AtCoder lives in one of the N apartments.\nThere are P_i employees who are living in Apartment i.\n\nAll employees of AtCoder are now leaving the office all together.\nSince they are tired from work, they would like to get home by the company's bus.\nAtCoder owns only one bus, but it can accommodate all the employees.\nThis bus will leave coordinate S with all the employees and move according to the following rule:\n\nEveryone on the bus casts a vote on which direction the bus should proceed, positive or negative. (The bus is autonomous and has no driver.) Each person has one vote, and abstaining from voting is not allowed. Then, the bus moves a distance of 1 in the direction with the greater number of votes. If a tie occurs, the bus moves in the negative direction. If there is an apartment at the coordinate of the bus after the move, all the employees who live there get off.\n\nRepeat the operation above as long as there is one or more employees on the bus.\n\nFor a specific example, see Sample Input 1.\n\nThe bus takes one seconds to travel a distance of 1.\nThe time required to vote and get off the bus is ignorable.\n\nEvery employee will vote so that he himself/she herself can get off the bus at the earliest possible time.\nStrictly speaking, when a vote is taking place, each employee see which direction results in the earlier arrival at his/her apartment, assuming that all the employees follow the same strategy in the future.\nBased on this information, each employee makes the optimal choice, but if either direction results in the arrival at the same time, he/she casts a vote to the negative direction.\n\nFind the time the bus will take from departure to arrival at the last employees' apartment.\nIt can be proved that, given the positions of the apartments, the numbers of employees living in each apartment and the initial position of the bus, the future movement of the bus is uniquely determined, and the process will end in a finite time.\n\nConstraints\n\n1 \\leq N \\leq 10^5\n\n1 \\leq S \\leq 10^9\n\n1 \\leq X_1 < X_2 < ... < X_N \\leq 10^9\n\nX_i \\neq S ( 1 \\leq i \\leq N )\n\n1 \\leq P_i \\leq 10^9 ( 1 \\leq i \\leq N )\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN S\nX_1 P_1\nX_2 P_2\n:\nX_N P_N\n\nOutput\n\nPrint the number of seconds the bus will take from departure to arrival at the last employees' apartment.\n\nSample Input 1\n\n3 2\n1 3\n3 4\n4 2\n\nSample Output 1\n\n4\n\nAssume that the bus moves in the negative direction first.\nThen, the coordinate of the bus changes from 2 to 1, and the employees living in Apartment 1 get off.\nThe movement of the bus after that is obvious: it just continues moving in the positive direction.\nThus, if the bus moves in the negative direction first, the coordinate of the bus changes as 2 → 1 → 2 → 3 → 4 from departure.\nThe time it takes to get home for the employees living in Apartment 1, 2, 3 are 1, 3, 4 seconds, respectively.\n\nNext, assume that the bus moves in the positive direction first.\nThen, the coordinate of the bus changes from 2 to 3, and the employees living in Apartment 2 get off.\nAfterwards, the bus starts heading to Apartment 1, because there are more employees living in Apartment 1 than in Apartment 3.\nThen, after arriving at Apartment 1, the bus heads to Apartment 3.\nThus, if the bus moves in the positive direction first, the coordinate of the bus changes as 2 → 3 → 2 → 1 → 2 → 3 → 4 from departure.\nThe time it takes to get home for the employees living in Apartment 1, 2, 3 are 3, 1, 6 seconds, respectively.\n\nTherefore, in the beginning, the employees living in Apartment 1 or 3 will try to move the bus in the negative direction.\nOn the other hand, the employees living in Apartment 2 will try to move the bus in the positive direction in the beginning.\nThere are a total of 3 + 2 = 5 employees living in Apartment 1 and 3 combined, which is more than those living in Apartment 2, which is 4.\nThus, the bus will move in the negative direction first, and the coordinate of the bus will change as 2 → 1 → 2 → 3 → 4 from departure.\n\nSample Input 2\n\n6 4\n1 10\n2 1000\n3 100000\n5 1000000\n6 10000\n7 100\n\nSample Output 2\n\n21\n\nSince the numbers of employees living in different apartments are literally off by a digit, the bus consistently head to the apartment where the most number of employees on the bus lives.\n\nSample Input 3\n\n15 409904902\n94198000 15017\n117995501 7656764\n275583856 313263626\n284496300 356635175\n324233841 607\n360631781 148\n472103717 5224\n497641071 34695\n522945827 816241\n554305668 32\n623788284 22832\n667409501 124410641\n876731548 12078\n904557302 291749534\n918215789 5\n\nSample Output 3\n\n2397671583", "sample_input": "3 2\n1 3\n3 4\n4 2\n"}, "reference_outputs": ["4\n"], "source_document_id": "p03366", "source_text": "Score : 1200 points\n\nProblem Statement\n\nThere are N apartments along a number line, numbered 1 through N.\nApartment i is located at coordinate X_i.\nAlso, the office of AtCoder Inc. is located at coordinate S.\nEvery employee of AtCoder lives in one of the N apartments.\nThere are P_i employees who are living in Apartment i.\n\nAll employees of AtCoder are now leaving the office all together.\nSince they are tired from work, they would like to get home by the company's bus.\nAtCoder owns only one bus, but it can accommodate all the employees.\nThis bus will leave coordinate S with all the employees and move according to the following rule:\n\nEveryone on the bus casts a vote on which direction the bus should proceed, positive or negative. (The bus is autonomous and has no driver.) Each person has one vote, and abstaining from voting is not allowed. Then, the bus moves a distance of 1 in the direction with the greater number of votes. If a tie occurs, the bus moves in the negative direction. If there is an apartment at the coordinate of the bus after the move, all the employees who live there get off.\n\nRepeat the operation above as long as there is one or more employees on the bus.\n\nFor a specific example, see Sample Input 1.\n\nThe bus takes one seconds to travel a distance of 1.\nThe time required to vote and get off the bus is ignorable.\n\nEvery employee will vote so that he himself/she herself can get off the bus at the earliest possible time.\nStrictly speaking, when a vote is taking place, each employee see which direction results in the earlier arrival at his/her apartment, assuming that all the employees follow the same strategy in the future.\nBased on this information, each employee makes the optimal choice, but if either direction results in the arrival at the same time, he/she casts a vote to the negative direction.\n\nFind the time the bus will take from departure to arrival at the last employees' apartment.\nIt can be proved that, given the positions of the apartments, the numbers of employees living in each apartment and the initial position of the bus, the future movement of the bus is uniquely determined, and the process will end in a finite time.\n\nConstraints\n\n1 \\leq N \\leq 10^5\n\n1 \\leq S \\leq 10^9\n\n1 \\leq X_1 < X_2 < ... < X_N \\leq 10^9\n\nX_i \\neq S ( 1 \\leq i \\leq N )\n\n1 \\leq P_i \\leq 10^9 ( 1 \\leq i \\leq N )\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN S\nX_1 P_1\nX_2 P_2\n:\nX_N P_N\n\nOutput\n\nPrint the number of seconds the bus will take from departure to arrival at the last employees' apartment.\n\nSample Input 1\n\n3 2\n1 3\n3 4\n4 2\n\nSample Output 1\n\n4\n\nAssume that the bus moves in the negative direction first.\nThen, the coordinate of the bus changes from 2 to 1, and the employees living in Apartment 1 get off.\nThe movement of the bus after that is obvious: it just continues moving in the positive direction.\nThus, if the bus moves in the negative direction first, the coordinate of the bus changes as 2 → 1 → 2 → 3 → 4 from departure.\nThe time it takes to get home for the employees living in Apartment 1, 2, 3 are 1, 3, 4 seconds, respectively.\n\nNext, assume that the bus moves in the positive direction first.\nThen, the coordinate of the bus changes from 2 to 3, and the employees living in Apartment 2 get off.\nAfterwards, the bus starts heading to Apartment 1, because there are more employees living in Apartment 1 than in Apartment 3.\nThen, after arriving at Apartment 1, the bus heads to Apartment 3.\nThus, if the bus moves in the positive direction first, the coordinate of the bus changes as 2 → 3 → 2 → 1 → 2 → 3 → 4 from departure.\nThe time it takes to get home for the employees living in Apartment 1, 2, 3 are 3, 1, 6 seconds, respectively.\n\nTherefore, in the beginning, the employees living in Apartment 1 or 3 will try to move the bus in the negative direction.\nOn the other hand, the employees living in Apartment 2 will try to move the bus in the positive direction in the beginning.\nThere are a total of 3 + 2 = 5 employees living in Apartment 1 and 3 combined, which is more than those living in Apartment 2, which is 4.\nThus, the bus will move in the negative direction first, and the coordinate of the bus will change as 2 → 1 → 2 → 3 → 4 from departure.\n\nSample Input 2\n\n6 4\n1 10\n2 1000\n3 100000\n5 1000000\n6 10000\n7 100\n\nSample Output 2\n\n21\n\nSince the numbers of employees living in different apartments are literally off by a digit, the bus consistently head to the apartment where the most number of employees on the bus lives.\n\nSample Input 3\n\n15 409904902\n94198000 15017\n117995501 7656764\n275583856 313263626\n284496300 356635175\n324233841 607\n360631781 148\n472103717 5224\n497641071 34695\n522945827 816241\n554305668 32\n623788284 22832\n667409501 124410641\n876731548 12078\n904557302 291749534\n918215789 5\n\nSample Output 3\n\n2397671583", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 892, "cpu_time_ms": 32, "memory_kb": 1024}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s425199771", "group_id": "codeNet:p03369", "input_text": "program Project1;\n\n{$APPTYPE CONSOLE}\n\nuses\n SysUtils;\nvar\n a,h,w,i,j,count,x,y,sw,m,n,b,c,soeji,sum,max,k:Integer;\n l:array of array of char;\n s,s123,s1,s2,s3:string;\n tf:Boolean;\nbegin\n try\n { TODO -oUser -cConsole Main : ここにコードを記述してください }\n Readln(s);\n a:=700;\n if s[1]='o' then\n a:=a+100;\n if s[2]='o' then\n a:=a+100;\n if s[3]='o' then\n a:=a+100;\n\n Writeln(a);\n Readln;\n except\n on E: Exception do\n Writeln(E.ClassName, ': ', E.Message);\n end;\nend.", "language": "Pascal", "metadata": {"date": 1526076062, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03369.html", "problem_id": "p03369", "resource_group": "low_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/Pascal/s425199771.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s425199771", "user_id": "u755925739"}, "prompt_components": {"gold_output": "900\n", "input_to_evaluate": "program Project1;\n\n{$APPTYPE CONSOLE}\n\nuses\n SysUtils;\nvar\n a,h,w,i,j,count,x,y,sw,m,n,b,c,soeji,sum,max,k:Integer;\n l:array of array of char;\n s,s123,s1,s2,s3:string;\n tf:Boolean;\nbegin\n try\n { TODO -oUser -cConsole Main : ここにコードを記述してください }\n Readln(s);\n a:=700;\n if s[1]='o' then\n a:=a+100;\n if s[2]='o' then\n a:=a+100;\n if s[3]='o' then\n a:=a+100;\n\n Writeln(a);\n Readln;\n except\n on E: Exception do\n Writeln(E.ClassName, ': ', E.Message);\n end;\nend.", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 1, "memory_kb": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s670455821", "group_id": "codeNet:p03373", "input_text": "program C;\nvar\n na, nb, nc: Int64;\n x, y: Int64;\n\nfunction Solve: Int64;\nbegin\n Result := x * na + y * nb;\n\n while (0 < x) and (0 < y) do\n begin\n if 2 * nc < na + nb then\n begin\n Inc(Result, 2 * nc - na - nb);\n Dec(x);\n Dec(y);\n end\n else\n break;\n end;\n\n while 0 < x do\n begin\n if 2 * nc < na then\n begin\n Inc(Result, 2 * nc - na);\n Dec(x);\n end\n else\n break;\n end;\n\n while 0 < y do\n begin\n if 2 * nc < nb then\n begin\n Inc(Result, 2 * nc - nb);\n Dec(y);\n end\n else\n break;\n end;\n\nend;\n\nbegin\n ReadLn(na, nb, nc, x, y);\n\n WriteLn(Solve);\nend.", "language": "Pascal", "metadata": {"date": 1524595002, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03373.html", "problem_id": "p03373", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03373/input.txt", "sample_output_relpath": "derived/input_output/data/p03373/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03373/Pascal/s670455821.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s670455821", "user_id": "u422041582"}, "prompt_components": {"gold_output": "7900\n", "input_to_evaluate": "program C;\nvar\n na, nb, nc: Int64;\n x, y: Int64;\n\nfunction Solve: Int64;\nbegin\n Result := x * na + y * nb;\n\n while (0 < x) and (0 < y) do\n begin\n if 2 * nc < na + nb then\n begin\n Inc(Result, 2 * nc - na - nb);\n Dec(x);\n Dec(y);\n end\n else\n break;\n end;\n\n while 0 < x do\n begin\n if 2 * nc < na then\n begin\n Inc(Result, 2 * nc - na);\n Dec(x);\n end\n else\n break;\n end;\n\n while 0 < y do\n begin\n if 2 * nc < nb then\n begin\n Inc(Result, 2 * nc - nb);\n Dec(y);\n end\n else\n break;\n end;\n\nend;\n\nbegin\n ReadLn(na, nb, nc, x, y);\n\n WriteLn(Solve);\nend.", "problem_context": "Score : 300 points\n\nProblem Statement\n\n\"Pizza At\", a fast food chain, offers three kinds of pizza: \"A-pizza\", \"B-pizza\" and \"AB-pizza\". A-pizza and B-pizza are completely different pizzas, and AB-pizza is one half of A-pizza and one half of B-pizza combined together. The prices of one A-pizza, B-pizza and AB-pizza are A yen, B yen and C yen (yen is the currency of Japan), respectively.\n\nNakahashi needs to prepare X A-pizzas and Y B-pizzas for a party tonight. He can only obtain these pizzas by directly buying A-pizzas and B-pizzas, or buying two AB-pizzas and then rearrange them into one A-pizza and one B-pizza. At least how much money does he need for this? It is fine to have more pizzas than necessary by rearranging pizzas.\n\nConstraints\n\n1 ≤ A, B, C ≤ 5000\n\n1 ≤ X, Y ≤ 10^5\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C X Y\n\nOutput\n\nPrint the minimum amount of money required to prepare X A-pizzas and Y B-pizzas.\n\nSample Input 1\n\n1500 2000 1600 3 2\n\nSample Output 1\n\n7900\n\nIt is optimal to buy four AB-pizzas and rearrange them into two A-pizzas and two B-pizzas, then buy additional one A-pizza.\n\nSample Input 2\n\n1500 2000 1900 3 2\n\nSample Output 2\n\n8500\n\nIt is optimal to directly buy three A-pizzas and two B-pizzas.\n\nSample Input 3\n\n1500 2000 500 90000 100000\n\nSample Output 3\n\n100000000\n\nIt is optimal to buy 200000 AB-pizzas and rearrange them into 100000 A-pizzas and 100000 B-pizzas. We will have 10000 more A-pizzas than necessary, but that is fine.", "sample_input": "1500 2000 1600 3 2\n"}, "reference_outputs": ["7900\n"], "source_document_id": "p03373", "source_text": "Score : 300 points\n\nProblem Statement\n\n\"Pizza At\", a fast food chain, offers three kinds of pizza: \"A-pizza\", \"B-pizza\" and \"AB-pizza\". A-pizza and B-pizza are completely different pizzas, and AB-pizza is one half of A-pizza and one half of B-pizza combined together. The prices of one A-pizza, B-pizza and AB-pizza are A yen, B yen and C yen (yen is the currency of Japan), respectively.\n\nNakahashi needs to prepare X A-pizzas and Y B-pizzas for a party tonight. He can only obtain these pizzas by directly buying A-pizzas and B-pizzas, or buying two AB-pizzas and then rearrange them into one A-pizza and one B-pizza. At least how much money does he need for this? It is fine to have more pizzas than necessary by rearranging pizzas.\n\nConstraints\n\n1 ≤ A, B, C ≤ 5000\n\n1 ≤ X, Y ≤ 10^5\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B C X Y\n\nOutput\n\nPrint the minimum amount of money required to prepare X A-pizzas and Y B-pizzas.\n\nSample Input 1\n\n1500 2000 1600 3 2\n\nSample Output 1\n\n7900\n\nIt is optimal to buy four AB-pizzas and rearrange them into two A-pizzas and two B-pizzas, then buy additional one A-pizza.\n\nSample Input 2\n\n1500 2000 1900 3 2\n\nSample Output 2\n\n8500\n\nIt is optimal to directly buy three A-pizzas and two B-pizzas.\n\nSample Input 3\n\n1500 2000 500 90000 100000\n\nSample Output 3\n\n100000000\n\nIt is optimal to buy 200000 AB-pizzas and rearrange them into 100000 A-pizzas and 100000 B-pizzas. We will have 10000 more A-pizzas than necessary, but that is fine.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 641, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s920323512", "group_id": "codeNet:p03374", "input_text": "Uses math;\nvar\n\tans,L,R,Lmax,Rmax,c:int64;\n\tn,i:Longint;\n\tx,v:array[1..100000]of int64;\nbegin\n\tread(n,c);\n\tfor i:=1 to n do begin\n\t\tread(x[i],v[i]);\n\t\tinc(L,v[i]);\n\tend;\n\tans:=L-x[n];\n\tfor i:=n downto 1 do begin\n\t\tdec(L,v[i]);\n\t\tinc(R,v[i]);\n\t\tRmax:=Max(Rmax,R-(c-x[i]));\n\t\tif i>1 then ans:=Max(ans,L-x[i-1]*2+Rmax)else ans:=Max(ans,Rmax);\n\tend;\n\tfor i:=1 to n do begin\n\t\tinc(L,v[i]);\n\t\tdec(R,v[i]);\n\t\tLmax:=Max(Lmax,L-x[i]);\n\t\tif i1 then ans:=Max(ans,L-x[i-1]*2+Rmax)else ans:=Max(ans,Rmax);\n\tend;\n\tfor i:=1 to n do begin\n\t\tinc(L,v[i]);\n\t\tdec(R,v[i]);\n\t\tLmax:=Max(Lmax,L-x[i]);\n\t\tif ians then\n begin\n ans:=sum-x[i];\n firstl:=i;\n end;\n end;\n sum:=0;\n for i:=n downto 1 do\n begin\n inc(sum,v[i]);\n if sum-(c-x[i])>ans2 then\n begin\n ans2:=sum-(c-x[i]);\n //writeln(i);\n end;\n end;\n if ans2>ans then ans:=ans2;\n for i:=1 to n do\n if x[i]>=c div 2 then\n begin\n firstr:=i;\n firstl:=i-1;\n break;\n end;\n for i:=1 to n do\n if x[i]ans then\n ans:=num[i]+num[n]-num[firstr-1]-2*x[i]+x[firstr]-c;\n end;\n if firstl>0 then\n begin\n for i:=n downto 1 do\n if x[i]>=c div 2 then\n begin\n while (num[firstl-1]-x[firstl-1]1)do dec(firstl);\n if num[n]-num[i-1]+num[firstl]-2*(c-x[i])-x[firstl]>ans then\n ans:=num[n]-num[i-1]+num[firstl]-2*(c-x[i])-x[firstl];\n end;\n end;\n writeln(ans);\nend.\n\n", "language": "Pascal", "metadata": {"date": 1524363381, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03374.html", "problem_id": "p03374", "resource_group": "low_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/Pascal/s469576940.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s469576940", "user_id": "u809476955"}, "prompt_components": {"gold_output": "191\n", "input_to_evaluate": "var n,c:int64;\n i:longint;\n sum,ans,ans2:int64;\n firstl,firstr:longint;\n x,v,num:array[0..100500]of int64;\nbegin\n read(n,c);\n for i:=1 to n do\n begin\n read(x[i],v[i]);\n num[i]:=num[i-1]+v[i];\n inc(sum,v[i]);\n if sum-x[i]>ans then\n begin\n ans:=sum-x[i];\n firstl:=i;\n end;\n end;\n sum:=0;\n for i:=n downto 1 do\n begin\n inc(sum,v[i]);\n if sum-(c-x[i])>ans2 then\n begin\n ans2:=sum-(c-x[i]);\n //writeln(i);\n end;\n end;\n if ans2>ans then ans:=ans2;\n for i:=1 to n do\n if x[i]>=c div 2 then\n begin\n firstr:=i;\n firstl:=i-1;\n break;\n end;\n for i:=1 to n do\n if x[i]ans then\n ans:=num[i]+num[n]-num[firstr-1]-2*x[i]+x[firstr]-c;\n end;\n if firstl>0 then\n begin\n for i:=n downto 1 do\n if x[i]>=c div 2 then\n begin\n while (num[firstl-1]-x[firstl-1]1)do dec(firstl);\n if num[n]-num[i-1]+num[firstl]-2*(c-x[i])-x[firstl]>ans then\n ans:=num[n]-num[i-1]+num[firstl]-2*(c-x[i])-x[firstl];\n end;\n end;\n writeln(ans);\nend.\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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1209, "cpu_time_ms": 40, "memory_kb": 2432}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s110265422", "group_id": "codeNet:p03378", "input_text": "program Project1;\n \n{$APPTYPE CONSOLE}\n \nuses\n SysUtils;\nvar\n a,h,w,i,j,count,count2,x,y,sw,m,n,b,c,soeji,sum,max,k:Integer;\n l:array of Integer;\n s,s123,s1,s2,s3:string;\n al:string = 'abcdefghijklmnopqrstuvwxyz';\n tf,tfl,tfr:Boolean;\nbegin\n try\n { TODO -oUser -cConsole メイン : ここにコードを記述してください }\n Read(n);\n Read(m);\n Readln(x); \n count :=0;\n count2:=0;\n max :=0;\n\n for i := 0 to m-1 do begin\n Read(a);\n if a>x then\n Inc(count)\n else\n Inc(count2);\n end;\n\n Readln;\n Writeln((count+count2-abs(count-count2))div 2);\n\n Readln;\n except\n on E: Exception do\n Writeln(E.ClassName, ': ', E.Message);\n end;\nend.", "language": "Pascal", "metadata": {"date": 1531865001, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03378.html", "problem_id": "p03378", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03378/input.txt", "sample_output_relpath": "derived/input_output/data/p03378/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03378/Pascal/s110265422.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s110265422", "user_id": "u755925739"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "program Project1;\n \n{$APPTYPE CONSOLE}\n \nuses\n SysUtils;\nvar\n a,h,w,i,j,count,count2,x,y,sw,m,n,b,c,soeji,sum,max,k:Integer;\n l:array of Integer;\n s,s123,s1,s2,s3:string;\n al:string = 'abcdefghijklmnopqrstuvwxyz';\n tf,tfl,tfr:Boolean;\nbegin\n try\n { TODO -oUser -cConsole メイン : ここにコードを記述してください }\n Read(n);\n Read(m);\n Readln(x); \n count :=0;\n count2:=0;\n max :=0;\n\n for i := 0 to m-1 do begin\n Read(a);\n if a>x then\n Inc(count)\n else\n Inc(count2);\n end;\n\n Readln;\n Writeln((count+count2-abs(count-count2))div 2);\n\n Readln;\n except\n on E: Exception do\n Writeln(E.ClassName, ': ', E.Message);\n end;\nend.", "problem_context": "Score : 200 points\n\nProblem Statement\n\nThere are N + 1 squares arranged in a row, numbered 0, 1, ..., N from left to right.\n\nInitially, you are in Square X.\nYou can freely travel between adjacent squares. Your goal is to reach Square 0 or Square N.\nHowever, for each i = 1, 2, ..., M, there is a toll gate in Square A_i, and traveling to Square A_i incurs a cost of 1.\nIt is guaranteed that there is no toll gate in Square 0, Square X and Square N.\n\nFind the minimum cost incurred before reaching the goal.\n\nConstraints\n\n1 \\leq N \\leq 100\n\n1 \\leq M \\leq 100\n\n1 \\leq X \\leq N - 1\n\n1 \\leq A_1 < A_2 < ... < A_M \\leq N\n\nA_i \\neq X\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M X\nA_1 A_2 ... A_M\n\nOutput\n\nPrint the minimum cost incurred before reaching the goal.\n\nSample Input 1\n\n5 3 3\n1 2 4\n\nSample Output 1\n\n1\n\nThe optimal solution is as follows:\n\nFirst, travel from Square 3 to Square 4. Here, there is a toll gate in Square 4, so the cost of 1 is incurred.\n\nThen, travel from Square 4 to Square 5. This time, no cost is incurred.\n\nNow, we are in Square 5 and we have reached the goal.\n\nIn this case, the total cost incurred is 1.\n\nSample Input 2\n\n7 3 2\n4 5 6\n\nSample Output 2\n\n0\n\nWe may be able to reach the goal at no cost.\n\nSample Input 3\n\n10 7 5\n1 2 3 4 6 8 9\n\nSample Output 3\n\n3", "sample_input": "5 3 3\n1 2 4\n"}, "reference_outputs": ["1\n"], "source_document_id": "p03378", "source_text": "Score : 200 points\n\nProblem Statement\n\nThere are N + 1 squares arranged in a row, numbered 0, 1, ..., N from left to right.\n\nInitially, you are in Square X.\nYou can freely travel between adjacent squares. Your goal is to reach Square 0 or Square N.\nHowever, for each i = 1, 2, ..., M, there is a toll gate in Square A_i, and traveling to Square A_i incurs a cost of 1.\nIt is guaranteed that there is no toll gate in Square 0, Square X and Square N.\n\nFind the minimum cost incurred before reaching the goal.\n\nConstraints\n\n1 \\leq N \\leq 100\n\n1 \\leq M \\leq 100\n\n1 \\leq X \\leq N - 1\n\n1 \\leq A_1 < A_2 < ... < A_M \\leq N\n\nA_i \\neq X\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M X\nA_1 A_2 ... A_M\n\nOutput\n\nPrint the minimum cost incurred before reaching the goal.\n\nSample Input 1\n\n5 3 3\n1 2 4\n\nSample Output 1\n\n1\n\nThe optimal solution is as follows:\n\nFirst, travel from Square 3 to Square 4. Here, there is a toll gate in Square 4, so the cost of 1 is incurred.\n\nThen, travel from Square 4 to Square 5. This time, no cost is incurred.\n\nNow, we are in Square 5 and we have reached the goal.\n\nIn this case, the total cost incurred is 1.\n\nSample Input 2\n\n7 3 2\n4 5 6\n\nSample Output 2\n\n0\n\nWe may be able to reach the goal at no cost.\n\nSample Input 3\n\n10 7 5\n1 2 3 4 6 8 9\n\nSample Output 3\n\n3", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 728, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s418756830", "group_id": "codeNet:p03379", "input_text": "var a,c,ans:array[0..2050000]of longint;\n i:longint;\n n:longint;\nprocedure qs(l,r:longint);\nvar i,j,m,t:longint;\nbegin\n i:=l;\n j:=r;\n m:=a[(l+r)>>1];\n repeat\n while a[i]m do dec(j);\n if i<=j then\n begin\n t:=a[i];a[i]:=a[j];a[j]:=t;\n t:=c[i];c[i]:=c[j];c[j]:=t;\n inc(i);\n dec(j);\n end;\n until i>j;\n if ln div 2 then ans[c[i]]:=a[n div 2] else ans[c[i]]:=a[n div 2+1];\n for i:=1 to n do\n writeln(ans[i]);\nend.", "language": "Pascal", "metadata": {"date": 1523755584, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03379.html", "problem_id": "p03379", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03379/input.txt", "sample_output_relpath": "derived/input_output/data/p03379/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03379/Pascal/s418756830.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s418756830", "user_id": "u165920140"}, "prompt_components": {"gold_output": "4\n3\n3\n4\n", "input_to_evaluate": "var a,c,ans:array[0..2050000]of longint;\n i:longint;\n n:longint;\nprocedure qs(l,r:longint);\nvar i,j,m,t:longint;\nbegin\n i:=l;\n j:=r;\n m:=a[(l+r)>>1];\n repeat\n while a[i]m do dec(j);\n if i<=j then\n begin\n t:=a[i];a[i]:=a[j];a[j]:=t;\n t:=c[i];c[i]:=c[j];c[j]:=t;\n inc(i);\n dec(j);\n end;\n until i>j;\n if ln div 2 then ans[c[i]]:=a[n div 2] else ans[c[i]]:=a[n div 2+1];\n for i:=1 to n do\n writeln(ans[i]);\nend.", "problem_context": "Score : 300 points\n\nProblem Statement\n\nWhen l is an odd number, the median of l numbers a_1, a_2, ..., a_l is the (\\frac{l+1}{2})-th largest value among a_1, a_2, ..., a_l.\n\nYou are given N numbers X_1, X_2, ..., X_N, where N is an even number.\nFor each i = 1, 2, ..., N, let the median of X_1, X_2, ..., X_N excluding X_i, that is, the median of X_1, X_2, ..., X_{i-1}, X_{i+1}, ..., X_N be B_i.\n\nFind B_i for each i = 1, 2, ..., N.\n\nConstraints\n\n2 \\leq N \\leq 200000\n\nN is even.\n\n1 \\leq X_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nX_1 X_2 ... X_N\n\nOutput\n\nPrint N lines.\nThe i-th line should contain B_i.\n\nSample Input 1\n\n4\n2 4 4 3\n\nSample Output 1\n\n4\n3\n3\n4\n\nSince the median of X_2, X_3, X_4 is 4, B_1 = 4.\n\nSince the median of X_1, X_3, X_4 is 3, B_2 = 3.\n\nSince the median of X_1, X_2, X_4 is 3, B_3 = 3.\n\nSince the median of X_1, X_2, X_3 is 4, B_4 = 4.\n\nSample Input 2\n\n2\n1 2\n\nSample Output 2\n\n2\n1\n\nSample Input 3\n\n6\n5 5 4 4 3 3\n\nSample Output 3\n\n4\n4\n4\n4\n4\n4", "sample_input": "4\n2 4 4 3\n"}, "reference_outputs": ["4\n3\n3\n4\n"], "source_document_id": "p03379", "source_text": "Score : 300 points\n\nProblem Statement\n\nWhen l is an odd number, the median of l numbers a_1, a_2, ..., a_l is the (\\frac{l+1}{2})-th largest value among a_1, a_2, ..., a_l.\n\nYou are given N numbers X_1, X_2, ..., X_N, where N is an even number.\nFor each i = 1, 2, ..., N, let the median of X_1, X_2, ..., X_N excluding X_i, that is, the median of X_1, X_2, ..., X_{i-1}, X_{i+1}, ..., X_N be B_i.\n\nFind B_i for each i = 1, 2, ..., N.\n\nConstraints\n\n2 \\leq N \\leq 200000\n\nN is even.\n\n1 \\leq X_i \\leq 10^9\n\nAll values in input are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nX_1 X_2 ... X_N\n\nOutput\n\nPrint N lines.\nThe i-th line should contain B_i.\n\nSample Input 1\n\n4\n2 4 4 3\n\nSample Output 1\n\n4\n3\n3\n4\n\nSince the median of X_2, X_3, X_4 is 4, B_1 = 4.\n\nSince the median of X_1, X_3, X_4 is 3, B_2 = 3.\n\nSince the median of X_1, X_2, X_4 is 3, B_3 = 3.\n\nSince the median of X_1, X_2, X_3 is 4, B_4 = 4.\n\nSample Input 2\n\n2\n1 2\n\nSample Output 2\n\n2\n1\n\nSample Input 3\n\n6\n5 5 4 4 3 3\n\nSample Output 3\n\n4\n4\n4\n4\n4\n4", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 644, "cpu_time_ms": 94, "memory_kb": 11008}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s597444630", "group_id": "codeNet:p03380", "input_text": "var m,x,y,n:longint;\n i:longint;\n a:Array[0..100500]of longint;\nprocedure qs(l,r:longint);\nvar i,j,m,t:longint;\nbegin\n i:=l;\n j:=r;\n m:=a[(l+r)>>1];\n repeat\n while a[i]m do dec(j);\n if i<=j then\n begin\n t:=a[i];a[i]:=a[j];a[j]:=t;\n inc(i);\n dec(j);\n end;\n until i>j;\n if l>1;\n if a[m]>1;\n if a[m]>x then r:=m-1 else l:=m+1;\n end;\n exit(r);\nend;\nbegin\n read(n);\n for i:=1 to n do\n read(a[i]);\n qs(1,n);\n m:=(a[n]+1) div 2;\n x:=find1(m);\n y:=find2(m);\n if a[x]-m>1];\n repeat\n while a[i]m do dec(j);\n if i<=j then\n begin\n t:=a[i];a[i]:=a[j];a[j]:=t;\n inc(i);\n dec(j);\n end;\n until i>j;\n if l>1;\n if a[m]>1;\n if a[m]>x then r:=m-1 else l:=m+1;\n end;\n exit(r);\nend;\nbegin\n read(n);\n for i:=1 to n do\n read(a[i]);\n qs(1,n);\n m:=(a[n]+1) div 2;\n x:=find1(m);\n y:=find2(m);\n if a[x]-m 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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 941, "cpu_time_ms": 25, "memory_kb": 512}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s770122516", "group_id": "codeNet:p03381", "input_text": "var\n\tn,i,ma,mb:Longint;\n\ta:array[1..200000]of Longint;\nfunction f(c:Longint):Longint;\nvar L,R,M,cnt,i:Longint;\nbegin\n\tL:=0;\n\tR:=1000000001;\n\twhile R-L>1 do begin\n\t\tM:=(L+R)div 2;\n\t\tcnt:=0;\n\t\tfor i:=1 to n do if a[i]<=M then inc(cnt);\n\t\tif cnt>=c then R:=M else L:=M;\n\tend;\n\tf:=R;\nend;\nbegin\n\tread(n);\n\tfor i:=1 to n do read(a[i]);\n\tma:=f(n div 2+1);\n\tmb:=f(n div 2);\n\tfor i:=1 to n do if a[i]1 do begin\n\t\tM:=(L+R)div 2;\n\t\tcnt:=0;\n\t\tfor i:=1 to n do if a[i]<=M then inc(cnt);\n\t\tif cnt>=c then R:=M else L:=M;\n\tend;\n\tf:=R;\nend;\nbegin\n\tread(n);\n\tfor i:=1 to n do read(a[i]);\n\tma:=f(n div 2+1);\n\tmb:=f(n div 2);\n\tfor i:=1 to n do if a[i] 1 that divides all elements of S.\n\nS is a special set.\n\nIf there are multiple solutions, you may output any of them. The elements of S may be printed in any order. It is guaranteed that at least one solution exist under the given contraints.\n\nSample Input 1\n\n3\n\nSample Output 1\n\n2 5 63\n\n\\{2, 5, 63\\} is special because gcd(2, 5 + 63) = 2, gcd(5, 2 + 63) = 5, gcd(63, 2 + 5) = 7. Also, gcd(2, 5, 63) = 1. Thus, this set satisfies all the criteria.\n\nNote that \\{2, 4, 6\\} is not a valid solution because gcd(2, 4, 6) = 2 > 1.\n\nSample Input 2\n\n4\n\nSample Output 2\n\n2 5 20 63\n\n\\{2, 5, 20, 63\\} is special because gcd(2, 5 + 20 + 63) = 2, gcd(5, 2 + 20 + 63) = 5, gcd(20, 2 + 5 + 63) = 10, gcd(63, 2 + 5 + 20) = 9. Also, gcd(2, 5, 20, 63) = 1. Thus, this set satisfies all the criteria.", "sample_input": "3\n"}, "reference_outputs": ["2 5 63\n"], "source_document_id": "p03394", "source_text": "Score : 600 points\n\nProblem Statement\n\nNagase is a top student in high school. One day, she's analyzing some properties of special sets of positive integers.\n\nShe thinks that a set S = \\{a_{1}, a_{2}, ..., a_{N}\\} of distinct positive integers is called special if for all 1 \\leq i \\leq N, the gcd (greatest common divisor) of a_{i} and the sum of the remaining elements of S is not 1.\n\nNagase wants to find a special set of size N. However, this task is too easy, so she decided to ramp up the difficulty. Nagase challenges you to find a special set of size N such that the gcd of all elements are 1 and the elements of the set does not exceed 30000.\n\nConstraints\n\n3 \\leq N \\leq 20000\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nOutput N space-separated integers, denoting the elements of the set S. S must satisfy the following conditions :\n\nThe elements must be distinct positive integers not exceeding 30000.\n\nThe gcd of all elements of S is 1, i.e. there does not exist an integer d > 1 that divides all elements of S.\n\nS is a special set.\n\nIf there are multiple solutions, you may output any of them. The elements of S may be printed in any order. It is guaranteed that at least one solution exist under the given contraints.\n\nSample Input 1\n\n3\n\nSample Output 1\n\n2 5 63\n\n\\{2, 5, 63\\} is special because gcd(2, 5 + 63) = 2, gcd(5, 2 + 63) = 5, gcd(63, 2 + 5) = 7. Also, gcd(2, 5, 63) = 1. Thus, this set satisfies all the criteria.\n\nNote that \\{2, 4, 6\\} is not a valid solution because gcd(2, 4, 6) = 2 > 1.\n\nSample Input 2\n\n4\n\nSample Output 2\n\n2 5 20 63\n\n\\{2, 5, 20, 63\\} is special because gcd(2, 5 + 20 + 63) = 2, gcd(5, 2 + 20 + 63) = 5, gcd(20, 2 + 5 + 63) = 10, gcd(63, 2 + 5 + 20) = 9. Also, gcd(2, 5, 20, 63) = 1. Thus, this set satisfies all the criteria.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 463, "cpu_time_ms": 2103, "memory_kb": 128}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s046119211", "group_id": "codeNet:p03400", "input_text": "program aaa;\nvar\n n,d,x,i,m:longint;\nbegin\n readln(n,d,x);\n dec(d);\n for i:=1 to n do\n begin\n readln(m);\n x:=x+1+d div m;\n end;\n writeln(x);\n readln;\n readln;\nend. ", "language": "Pascal", "metadata": {"date": 1522026342, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03400.html", "problem_id": "p03400", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03400/input.txt", "sample_output_relpath": "derived/input_output/data/p03400/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03400/Pascal/s046119211.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s046119211", "user_id": "u516562331"}, "prompt_components": {"gold_output": "8\n", "input_to_evaluate": "program aaa;\nvar\n n,d,x,i,m:longint;\nbegin\n readln(n,d,x);\n dec(d);\n for i:=1 to n do\n begin\n readln(m);\n x:=x+1+d div m;\n end;\n writeln(x);\n readln;\n readln;\nend. ", "problem_context": "Score : 200 points\n\nProblem Statement\n\nSome number of chocolate pieces were prepared for a training camp.\nThe camp had N participants and lasted for D days.\nThe i-th participant (1 \\leq i \\leq N) ate one chocolate piece on each of the following days in the camp: the 1-st day, the (A_i + 1)-th day, the (2A_i + 1)-th day, and so on.\nAs a result, there were X chocolate pieces remaining at the end of the camp. During the camp, nobody except the participants ate chocolate pieces.\n\nFind the number of chocolate pieces prepared at the beginning of the camp.\n\nConstraints\n\n1 \\leq N \\leq 100\n\n1 \\leq D \\leq 100\n\n1 \\leq X \\leq 100\n\n1 \\leq A_i \\leq 100 (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\nD X\nA_1\nA_2\n:\nA_N\n\nOutput\n\nFind the number of chocolate pieces prepared at the beginning of the camp.\n\nSample Input 1\n\n3\n7 1\n2\n5\n10\n\nSample Output 1\n\n8\n\nThe camp has 3 participants and lasts for 7 days.\nEach participant eats chocolate pieces as follows:\n\nThe first participant eats one chocolate piece on Day 1, 3, 5 and 7, for a total of four.\n\nThe second participant eats one chocolate piece on Day 1 and 6, for a total of two.\n\nThe third participant eats one chocolate piece only on Day 1, for a total of one.\n\nSince the number of pieces remaining at the end of the camp is one, the number of pieces prepared at the beginning of the camp is 1 + 4 + 2 + 1 = 8.\n\nSample Input 2\n\n2\n8 20\n1\n10\n\nSample Output 2\n\n29\n\nSample Input 3\n\n5\n30 44\n26\n18\n81\n18\n6\n\nSample Output 3\n\n56", "sample_input": "3\n7 1\n2\n5\n10\n"}, "reference_outputs": ["8\n"], "source_document_id": "p03400", "source_text": "Score : 200 points\n\nProblem Statement\n\nSome number of chocolate pieces were prepared for a training camp.\nThe camp had N participants and lasted for D days.\nThe i-th participant (1 \\leq i \\leq N) ate one chocolate piece on each of the following days in the camp: the 1-st day, the (A_i + 1)-th day, the (2A_i + 1)-th day, and so on.\nAs a result, there were X chocolate pieces remaining at the end of the camp. During the camp, nobody except the participants ate chocolate pieces.\n\nFind the number of chocolate pieces prepared at the beginning of the camp.\n\nConstraints\n\n1 \\leq N \\leq 100\n\n1 \\leq D \\leq 100\n\n1 \\leq X \\leq 100\n\n1 \\leq A_i \\leq 100 (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\nD X\nA_1\nA_2\n:\nA_N\n\nOutput\n\nFind the number of chocolate pieces prepared at the beginning of the camp.\n\nSample Input 1\n\n3\n7 1\n2\n5\n10\n\nSample Output 1\n\n8\n\nThe camp has 3 participants and lasts for 7 days.\nEach participant eats chocolate pieces as follows:\n\nThe first participant eats one chocolate piece on Day 1, 3, 5 and 7, for a total of four.\n\nThe second participant eats one chocolate piece on Day 1 and 6, for a total of two.\n\nThe third participant eats one chocolate piece only on Day 1, for a total of one.\n\nSince the number of pieces remaining at the end of the camp is one, the number of pieces prepared at the beginning of the camp is 1 + 4 + 2 + 1 = 8.\n\nSample Input 2\n\n2\n8 20\n1\n10\n\nSample Output 2\n\n29\n\nSample Input 3\n\n5\n30 44\n26\n18\n81\n18\n6\n\nSample Output 3\n\n56", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s467170818", "group_id": "codeNet:p03401", "input_text": "var\n n, i, sum: Longint;\n a: array[1..100001] of Longint;\n\nbegin\n readln(n);\n sum := 0;\n a[0] := 0;\n a[n+1] := 0;\n for i := 1 to n do\n begin\n read(a[i]);\n inc(sum, abs(a[i] - a[i - 1]));\n end;\n inc(sum, abs(a[n]));\n for i := 1 to n do\n begin\n if ((a[i] >= a[i-1]) and (a[i] <= a[i+1])) or ((a[i] <= a[i-1]) and (a[i] >= a[i+1])) then\n begin\n writeln(sum);\n end\n else \n begin\n writeln(sum - ( abs(a[i-1]-a[i])+abs(a[i]-a[i+1])-abs(a[i+1]-a[i-1]) ));\n end;\n end;\nend.", "language": "Pascal", "metadata": {"date": 1522120574, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03401.html", "problem_id": "p03401", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03401/input.txt", "sample_output_relpath": "derived/input_output/data/p03401/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03401/Pascal/s467170818.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s467170818", "user_id": "u403323882"}, "prompt_components": {"gold_output": "12\n8\n10\n", "input_to_evaluate": "var\n n, i, sum: Longint;\n a: array[1..100001] of Longint;\n\nbegin\n readln(n);\n sum := 0;\n a[0] := 0;\n a[n+1] := 0;\n for i := 1 to n do\n begin\n read(a[i]);\n inc(sum, abs(a[i] - a[i - 1]));\n end;\n inc(sum, abs(a[n]));\n for i := 1 to n do\n begin\n if ((a[i] >= a[i-1]) and (a[i] <= a[i+1])) or ((a[i] <= a[i-1]) and (a[i] >= a[i+1])) then\n begin\n writeln(sum);\n end\n else \n begin\n writeln(sum - ( abs(a[i-1]-a[i])+abs(a[i]-a[i+1])-abs(a[i+1]-a[i-1]) ));\n end;\n end;\nend.", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere are N sightseeing spots on the x-axis, numbered 1, 2, ..., N.\nSpot i is at the point with coordinate A_i.\nIt costs |a - b| yen (the currency of Japan) to travel from a point with coordinate a to another point with coordinate b along the axis.\n\nYou planned a trip along the axis.\nIn this plan, you first depart from the point with coordinate 0, then visit the N spots in the order they are numbered, and finally return to the point with coordinate 0.\n\nHowever, something came up just before the trip, and you no longer have enough time to visit all the N spots, so you decided to choose some i and cancel the visit to Spot i.\nYou will visit the remaining spots as planned in the order they are numbered.\nYou will also depart from and return to the point with coordinate 0 at the beginning and the end, as planned.\n\nFor each i = 1, 2, ..., N, find the total cost of travel during the trip when the visit to Spot i is canceled.\n\nConstraints\n\n2 \\leq N \\leq 10^5\n\n-5000 \\leq A_i \\leq 5000 (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_2 ... A_N\n\nOutput\n\nPrint N lines.\nIn the i-th line, print the total cost of travel during the trip when the visit to Spot i is canceled.\n\nSample Input 1\n\n3\n3 5 -1\n\nSample Output 1\n\n12\n8\n10\n\nSpot 1, 2 and 3 are at the points with coordinates 3, 5 and -1, respectively.\nFor each i, the course of the trip and the total cost of travel when the visit to Spot i is canceled, are as follows:\n\nFor i = 1, the course of the trip is 0 \\rightarrow 5 \\rightarrow -1 \\rightarrow 0 and the total cost of travel is 5 + 6 + 1 = 12 yen.\n\nFor i = 2, the course of the trip is 0 \\rightarrow 3 \\rightarrow -1 \\rightarrow 0 and the total cost of travel is 3 + 4 + 1 = 8 yen.\n\nFor i = 3, the course of the trip is 0 \\rightarrow 3 \\rightarrow 5 \\rightarrow 0 and the total cost of travel is 3 + 2 + 5 = 10 yen.\n\nSample Input 2\n\n5\n1 1 1 2 0\n\nSample Output 2\n\n4\n4\n4\n2\n4\n\nSample Input 3\n\n6\n-679 -2409 -3258 3095 -3291 -4462\n\nSample Output 3\n\n21630\n21630\n19932\n8924\n21630\n19288", "sample_input": "3\n3 5 -1\n"}, "reference_outputs": ["12\n8\n10\n"], "source_document_id": "p03401", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere are N sightseeing spots on the x-axis, numbered 1, 2, ..., N.\nSpot i is at the point with coordinate A_i.\nIt costs |a - b| yen (the currency of Japan) to travel from a point with coordinate a to another point with coordinate b along the axis.\n\nYou planned a trip along the axis.\nIn this plan, you first depart from the point with coordinate 0, then visit the N spots in the order they are numbered, and finally return to the point with coordinate 0.\n\nHowever, something came up just before the trip, and you no longer have enough time to visit all the N spots, so you decided to choose some i and cancel the visit to Spot i.\nYou will visit the remaining spots as planned in the order they are numbered.\nYou will also depart from and return to the point with coordinate 0 at the beginning and the end, as planned.\n\nFor each i = 1, 2, ..., N, find the total cost of travel during the trip when the visit to Spot i is canceled.\n\nConstraints\n\n2 \\leq N \\leq 10^5\n\n-5000 \\leq A_i \\leq 5000 (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_2 ... A_N\n\nOutput\n\nPrint N lines.\nIn the i-th line, print the total cost of travel during the trip when the visit to Spot i is canceled.\n\nSample Input 1\n\n3\n3 5 -1\n\nSample Output 1\n\n12\n8\n10\n\nSpot 1, 2 and 3 are at the points with coordinates 3, 5 and -1, respectively.\nFor each i, the course of the trip and the total cost of travel when the visit to Spot i is canceled, are as follows:\n\nFor i = 1, the course of the trip is 0 \\rightarrow 5 \\rightarrow -1 \\rightarrow 0 and the total cost of travel is 5 + 6 + 1 = 12 yen.\n\nFor i = 2, the course of the trip is 0 \\rightarrow 3 \\rightarrow -1 \\rightarrow 0 and the total cost of travel is 3 + 4 + 1 = 8 yen.\n\nFor i = 3, the course of the trip is 0 \\rightarrow 3 \\rightarrow 5 \\rightarrow 0 and the total cost of travel is 3 + 2 + 5 = 10 yen.\n\nSample Input 2\n\n5\n1 1 1 2 0\n\nSample Output 2\n\n4\n4\n4\n2\n4\n\nSample Input 3\n\n6\n-679 -2409 -3258 3095 -3291 -4462\n\nSample Output 3\n\n21630\n21630\n19932\n8924\n21630\n19288", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 33, "memory_kb": 1408}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s857725335", "group_id": "codeNet:p03403", "input_text": "var a,b,t:longint;\n num,bool,y,where:longint;\n i,j:longint;\n map:Array[0..105,0..105]of longint;\n c1,c2:char;\nbegin\n read(a,b);\n c1:='.';\n c2:='#';\n if a>b then\n begin\n t:=a;a:=b;b:=t;\n c1:='#';\n c2:='.';\n end;\n b:=b-a+1;\n if a=1 then dec(b);\n num:=1;\n bool:=0;\n while a>0 do\n begin\n inc(num);\n bool:=1-bool;\n for i:=1 to num-1 do\n begin\n map[i,num-i]:=bool;\n if bool=1 then dec(a);\n if a=0 then break;\n end;\n end;\n for j:=1 to num-1 do\n begin\n map[num,j]:=0;\n map[num+1,j]:=1;\n end;\n inc(num);\n y:=num;\n for i:=1 to num do\n map[i,num-1]:=1;\n if b<>0 then\n begin\n while num<100 do\n begin\n inc(num);\n if num mod 2=1 then\n begin\n for j:=1 to y-1 do\n map[num,j]:=1;\n end else\n begin\n for j:=1 to y-1 do\n begin\n if (j mod 2=0) then map[num,j]:=1 else dec(b);\n if b=0 then\n begin\n where:=j;\n break;\n end;\n end;\n end;\n if b=0 then\n begin\n for j:=where+1 to y-1 do\n map[num,j]:=1;\n break;\n end;\n end;\n end;\n dec(y);\n while b>0 do\n begin\n inc(y);\n for i:=1 to num do\n begin\n if i mod 2=0 then map[i,y]:=1 else dec(b);\n if b=0 then\n begin\n where:=i;\n break;\n end;\n end;\n inc(y);\n for i:=1 to num do\n map[i,y]:=1;\n if b=0 then\n begin\n for i:=where+1 to num do\n map[i,y-1]:=1;\n end;\n end;\n writeln(num,' ',y);\n for i:=1 to num do\n begin\n for j:=1 to y do\n if map[i,j]=1 then write(c1) else write(c2);\n writeln;\n end;\nend.\n\n", "language": "Pascal", "metadata": {"date": 1522031944, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03403.html", "problem_id": "p03403", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03403/input.txt", "sample_output_relpath": "derived/input_output/data/p03403/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03403/Pascal/s857725335.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s857725335", "user_id": "u809476955"}, "prompt_components": {"gold_output": "12\n8\n10\n", "input_to_evaluate": "var a,b,t:longint;\n num,bool,y,where:longint;\n i,j:longint;\n map:Array[0..105,0..105]of longint;\n c1,c2:char;\nbegin\n read(a,b);\n c1:='.';\n c2:='#';\n if a>b then\n begin\n t:=a;a:=b;b:=t;\n c1:='#';\n c2:='.';\n end;\n b:=b-a+1;\n if a=1 then dec(b);\n num:=1;\n bool:=0;\n while a>0 do\n begin\n inc(num);\n bool:=1-bool;\n for i:=1 to num-1 do\n begin\n map[i,num-i]:=bool;\n if bool=1 then dec(a);\n if a=0 then break;\n end;\n end;\n for j:=1 to num-1 do\n begin\n map[num,j]:=0;\n map[num+1,j]:=1;\n end;\n inc(num);\n y:=num;\n for i:=1 to num do\n map[i,num-1]:=1;\n if b<>0 then\n begin\n while num<100 do\n begin\n inc(num);\n if num mod 2=1 then\n begin\n for j:=1 to y-1 do\n map[num,j]:=1;\n end else\n begin\n for j:=1 to y-1 do\n begin\n if (j mod 2=0) then map[num,j]:=1 else dec(b);\n if b=0 then\n begin\n where:=j;\n break;\n end;\n end;\n end;\n if b=0 then\n begin\n for j:=where+1 to y-1 do\n map[num,j]:=1;\n break;\n end;\n end;\n end;\n dec(y);\n while b>0 do\n begin\n inc(y);\n for i:=1 to num do\n begin\n if i mod 2=0 then map[i,y]:=1 else dec(b);\n if b=0 then\n begin\n where:=i;\n break;\n end;\n end;\n inc(y);\n for i:=1 to num do\n map[i,y]:=1;\n if b=0 then\n begin\n for i:=where+1 to num do\n map[i,y-1]:=1;\n end;\n end;\n writeln(num,' ',y);\n for i:=1 to num do\n begin\n for j:=1 to y do\n if map[i,j]=1 then write(c1) else write(c2);\n writeln;\n end;\nend.\n\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere are N sightseeing spots on the x-axis, numbered 1, 2, ..., N.\nSpot i is at the point with coordinate A_i.\nIt costs |a - b| yen (the currency of Japan) to travel from a point with coordinate a to another point with coordinate b along the axis.\n\nYou planned a trip along the axis.\nIn this plan, you first depart from the point with coordinate 0, then visit the N spots in the order they are numbered, and finally return to the point with coordinate 0.\n\nHowever, something came up just before the trip, and you no longer have enough time to visit all the N spots, so you decided to choose some i and cancel the visit to Spot i.\nYou will visit the remaining spots as planned in the order they are numbered.\nYou will also depart from and return to the point with coordinate 0 at the beginning and the end, as planned.\n\nFor each i = 1, 2, ..., N, find the total cost of travel during the trip when the visit to Spot i is canceled.\n\nConstraints\n\n2 \\leq N \\leq 10^5\n\n-5000 \\leq A_i \\leq 5000 (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_2 ... A_N\n\nOutput\n\nPrint N lines.\nIn the i-th line, print the total cost of travel during the trip when the visit to Spot i is canceled.\n\nSample Input 1\n\n3\n3 5 -1\n\nSample Output 1\n\n12\n8\n10\n\nSpot 1, 2 and 3 are at the points with coordinates 3, 5 and -1, respectively.\nFor each i, the course of the trip and the total cost of travel when the visit to Spot i is canceled, are as follows:\n\nFor i = 1, the course of the trip is 0 \\rightarrow 5 \\rightarrow -1 \\rightarrow 0 and the total cost of travel is 5 + 6 + 1 = 12 yen.\n\nFor i = 2, the course of the trip is 0 \\rightarrow 3 \\rightarrow -1 \\rightarrow 0 and the total cost of travel is 3 + 4 + 1 = 8 yen.\n\nFor i = 3, the course of the trip is 0 \\rightarrow 3 \\rightarrow 5 \\rightarrow 0 and the total cost of travel is 3 + 2 + 5 = 10 yen.\n\nSample Input 2\n\n5\n1 1 1 2 0\n\nSample Output 2\n\n4\n4\n4\n2\n4\n\nSample Input 3\n\n6\n-679 -2409 -3258 3095 -3291 -4462\n\nSample Output 3\n\n21630\n21630\n19932\n8924\n21630\n19288", "sample_input": "3\n3 5 -1\n"}, "reference_outputs": ["12\n8\n10\n"], "source_document_id": "p03403", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere are N sightseeing spots on the x-axis, numbered 1, 2, ..., N.\nSpot i is at the point with coordinate A_i.\nIt costs |a - b| yen (the currency of Japan) to travel from a point with coordinate a to another point with coordinate b along the axis.\n\nYou planned a trip along the axis.\nIn this plan, you first depart from the point with coordinate 0, then visit the N spots in the order they are numbered, and finally return to the point with coordinate 0.\n\nHowever, something came up just before the trip, and you no longer have enough time to visit all the N spots, so you decided to choose some i and cancel the visit to Spot i.\nYou will visit the remaining spots as planned in the order they are numbered.\nYou will also depart from and return to the point with coordinate 0 at the beginning and the end, as planned.\n\nFor each i = 1, 2, ..., N, find the total cost of travel during the trip when the visit to Spot i is canceled.\n\nConstraints\n\n2 \\leq N \\leq 10^5\n\n-5000 \\leq A_i \\leq 5000 (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_2 ... A_N\n\nOutput\n\nPrint N lines.\nIn the i-th line, print the total cost of travel during the trip when the visit to Spot i is canceled.\n\nSample Input 1\n\n3\n3 5 -1\n\nSample Output 1\n\n12\n8\n10\n\nSpot 1, 2 and 3 are at the points with coordinates 3, 5 and -1, respectively.\nFor each i, the course of the trip and the total cost of travel when the visit to Spot i is canceled, are as follows:\n\nFor i = 1, the course of the trip is 0 \\rightarrow 5 \\rightarrow -1 \\rightarrow 0 and the total cost of travel is 5 + 6 + 1 = 12 yen.\n\nFor i = 2, the course of the trip is 0 \\rightarrow 3 \\rightarrow -1 \\rightarrow 0 and the total cost of travel is 3 + 4 + 1 = 8 yen.\n\nFor i = 3, the course of the trip is 0 \\rightarrow 3 \\rightarrow 5 \\rightarrow 0 and the total cost of travel is 3 + 2 + 5 = 10 yen.\n\nSample Input 2\n\n5\n1 1 1 2 0\n\nSample Output 2\n\n4\n4\n4\n2\n4\n\nSample Input 3\n\n6\n-679 -2409 -3258 3095 -3291 -4462\n\nSample Output 3\n\n21630\n21630\n19932\n8924\n21630\n19288", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1651, "cpu_time_ms": 101, "memory_kb": 128}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s436774958", "group_id": "codeNet:p03404", "input_text": "var a,b,t:longint;\n num,bool,y,where:longint;\n i,j:longint;\n map:Array[0..105,0..105]of longint;\n c1,c2:char;\nbegin\n read(a,b);\n c1:='.';\n c2:='#';\n if a>b then\n begin\n t:=a;a:=b;b:=t;\n c1:='#';\n c2:='.';\n end;\n b:=b-a+1;\n if a=1 then dec(b);\n num:=1;\n bool:=0;\n while a>0 do\n begin\n inc(num);\n bool:=1-bool;\n for i:=1 to num-1 do\n begin\n map[i,num-i]:=bool;\n if bool=1 then dec(a);\n if a=0 then break;\n end;\n end;\n for j:=1 to num-1 do\n begin\n map[num,j]:=0;\n map[num+1,j]:=1;\n end;\n inc(num);\n y:=num;\n for i:=1 to num do\n map[i,num-1]:=1;\n if b<>0 then\n begin\n while num<100 do\n begin\n inc(num);\n if num mod 2=1 then\n begin\n for j:=1 to y-1 do\n map[num,j]:=1;\n end else\n begin\n for j:=1 to y-1 do\n begin\n if (j mod 2=0) then map[num,j]:=1 else dec(b);\n if b=0 then\n begin\n where:=j;\n break;\n end;\n end;\n end;\n if b=0 then\n begin\n for j:=where+1 to y-1 do\n map[num,j]:=1;\n break;\n end;\n end;\n end;\n dec(y);\n while b>0 do\n begin\n inc(y);\n for i:=1 to num do\n begin\n if i mod 2=0 then map[i,y]:=1 else dec(b);\n if b=0 then\n begin\n where:=i;\n break;\n end;\n end;\n inc(y);\n for i:=1 to num do\n map[i,y]:=1;\n if b=0 then\n begin\n for i:=where+1 to num do\n map[i,y-1]:=1;\n end;\n end;\n writeln(num,' ',y);\n for i:=1 to num do\n begin\n for j:=1 to y do\n write(map[i,j],' ');\n writeln;\n end;\nend.\n\n", "language": "Pascal", "metadata": {"date": 1522031861, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03404.html", "problem_id": "p03404", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03404/input.txt", "sample_output_relpath": "derived/input_output/data/p03404/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03404/Pascal/s436774958.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s436774958", "user_id": "u809476955"}, "prompt_components": {"gold_output": "3 3\n##.\n..#\n#.#\n", "input_to_evaluate": "var a,b,t:longint;\n num,bool,y,where:longint;\n i,j:longint;\n map:Array[0..105,0..105]of longint;\n c1,c2:char;\nbegin\n read(a,b);\n c1:='.';\n c2:='#';\n if a>b then\n begin\n t:=a;a:=b;b:=t;\n c1:='#';\n c2:='.';\n end;\n b:=b-a+1;\n if a=1 then dec(b);\n num:=1;\n bool:=0;\n while a>0 do\n begin\n inc(num);\n bool:=1-bool;\n for i:=1 to num-1 do\n begin\n map[i,num-i]:=bool;\n if bool=1 then dec(a);\n if a=0 then break;\n end;\n end;\n for j:=1 to num-1 do\n begin\n map[num,j]:=0;\n map[num+1,j]:=1;\n end;\n inc(num);\n y:=num;\n for i:=1 to num do\n map[i,num-1]:=1;\n if b<>0 then\n begin\n while num<100 do\n begin\n inc(num);\n if num mod 2=1 then\n begin\n for j:=1 to y-1 do\n map[num,j]:=1;\n end else\n begin\n for j:=1 to y-1 do\n begin\n if (j mod 2=0) then map[num,j]:=1 else dec(b);\n if b=0 then\n begin\n where:=j;\n break;\n end;\n end;\n end;\n if b=0 then\n begin\n for j:=where+1 to y-1 do\n map[num,j]:=1;\n break;\n end;\n end;\n end;\n dec(y);\n while b>0 do\n begin\n inc(y);\n for i:=1 to num do\n begin\n if i mod 2=0 then map[i,y]:=1 else dec(b);\n if b=0 then\n begin\n where:=i;\n break;\n end;\n end;\n inc(y);\n for i:=1 to num do\n map[i,y]:=1;\n if b=0 then\n begin\n for i:=where+1 to num do\n map[i,y-1]:=1;\n end;\n end;\n writeln(num,' ',y);\n for i:=1 to num do\n begin\n for j:=1 to y do\n write(map[i,j],' ');\n writeln;\n end;\nend.\n\n", "problem_context": "Score : 500 points\n\nProblem Statement\n\nYou are given two integers A and B.\n\nPrint a grid where each square is painted white or black that satisfies the following conditions, in the format specified in Output section:\n\nLet the size of the grid be h \\times w (h vertical, w horizontal). Both h and w are at most 100.\n\nThe set of the squares painted white is divided into exactly A connected components.\n\nThe set of the squares painted black is divided into exactly B connected components.\n\nIt can be proved that there always exist one or more solutions under the conditions specified in Constraints section.\nIf there are multiple solutions, any of them may be printed.\n\nNotes\n\nTwo squares painted white, c_1 and c_2, are called connected when the square c_2 can be reached from the square c_1 passing only white squares by repeatedly moving up, down, left or right to an adjacent square.\n\nA set of squares painted white, S, forms a connected component when the following conditions are met:\n\nAny two squares in S are connected.\n\nNo pair of a square painted white that is not included in S and a square included in S is connected.\n\nA connected component of squares painted black is defined similarly.\n\nConstraints\n\n1 \\leq A \\leq 500\n\n1 \\leq B \\leq 500\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nOutput should be in the following format:\n\nIn the first line, print integers h and w representing the size of the grid you constructed, with a space in between.\n\nThen, print h more lines. The i-th (1 \\leq i \\leq h) of these lines should contain a string s_i as follows:\n\nIf the square at the i-th row and j-th column (1 \\leq j \\leq w) in the grid is painted white, the j-th character in s_i should be ..\n\nIf the square at the i-th row and j-th column (1 \\leq j \\leq w) in the grid is painted black, the j-th character in s_i should be #.\n\nSample Input 1\n\n2 3\n\nSample Output 1\n\n3 3\n##.\n..#\n#.#\n\nThis output corresponds to the grid below:\n\nSample Input 2\n\n7 8\n\nSample Output 2\n\n3 5\n#.#.#\n.#.#.\n#.#.#\n\nSample Input 3\n\n1 1\n\nSample Output 3\n\n4 2\n..\n#.\n##\n##\n\nSample Input 4\n\n3 14\n\nSample Output 4\n\n8 18\n..................\n..................\n....##.......####.\n....#.#.....#.....\n...#...#....#.....\n..#.###.#...#.....\n.#.......#..#.....\n#.........#..####.", "sample_input": "2 3\n"}, "reference_outputs": ["3 3\n##.\n..#\n#.#\n"], "source_document_id": "p03404", "source_text": "Score : 500 points\n\nProblem Statement\n\nYou are given two integers A and B.\n\nPrint a grid where each square is painted white or black that satisfies the following conditions, in the format specified in Output section:\n\nLet the size of the grid be h \\times w (h vertical, w horizontal). Both h and w are at most 100.\n\nThe set of the squares painted white is divided into exactly A connected components.\n\nThe set of the squares painted black is divided into exactly B connected components.\n\nIt can be proved that there always exist one or more solutions under the conditions specified in Constraints section.\nIf there are multiple solutions, any of them may be printed.\n\nNotes\n\nTwo squares painted white, c_1 and c_2, are called connected when the square c_2 can be reached from the square c_1 passing only white squares by repeatedly moving up, down, left or right to an adjacent square.\n\nA set of squares painted white, S, forms a connected component when the following conditions are met:\n\nAny two squares in S are connected.\n\nNo pair of a square painted white that is not included in S and a square included in S is connected.\n\nA connected component of squares painted black is defined similarly.\n\nConstraints\n\n1 \\leq A \\leq 500\n\n1 \\leq B \\leq 500\n\nInput\n\nInput is given from Standard Input in the following format:\n\nA B\n\nOutput\n\nOutput should be in the following format:\n\nIn the first line, print integers h and w representing the size of the grid you constructed, with a space in between.\n\nThen, print h more lines. The i-th (1 \\leq i \\leq h) of these lines should contain a string s_i as follows:\n\nIf the square at the i-th row and j-th column (1 \\leq j \\leq w) in the grid is painted white, the j-th character in s_i should be ..\n\nIf the square at the i-th row and j-th column (1 \\leq j \\leq w) in the grid is painted black, the j-th character in s_i should be #.\n\nSample Input 1\n\n2 3\n\nSample Output 1\n\n3 3\n##.\n..#\n#.#\n\nThis output corresponds to the grid below:\n\nSample Input 2\n\n7 8\n\nSample Output 2\n\n3 5\n#.#.#\n.#.#.\n#.#.#\n\nSample Input 3\n\n1 1\n\nSample Output 3\n\n4 2\n..\n#.\n##\n##\n\nSample Input 4\n\n3 14\n\nSample Output 4\n\n8 18\n..................\n..................\n....##.......####.\n....#.#.....#.....\n...#...#....#.....\n..#.###.#...#.....\n.#.......#..#.....\n#.........#..####.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1627, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s661646796", "group_id": "codeNet:p03408", "input_text": "var n,m,s,t,i,j:Longint;a,b:array of string;\nbegin\n\treadln(n);\n\tsetlength(a,n+1);\n\tfor i:=1 to n do begin\n\t\treadln(a[i]);\n\tend;\n\tread(m);\n\tSetLength(b,m+1);\n\tfor i:=1 to m do begin\n\t\treadln(b[i]);\n\tend;\n\ts:=0;\n\tfor i:=1 to n do begin\n\t\tt:=0;\n\t\tfor j:=1 to n do begin\n\t\t\tif a[i]=a[j] then t:=t+1;\n\t\tend;\n\t\tfor j:=1 to m do begin\n\t\t\tif a[i]=b[j] then t:=t-1;\n\t\tend;\n\t\tif sa[j,1])and(y>a[j,2]) then begin map[j,i+n]:=true; map[i+n,j]:=true; end;\n end;\n n:=n shl 1;\nend;\n\n\n\nfunction find(x:longint):boolean;\nvar\n i,q:longint;\nbegin\n for i:=1 to n do\n if map[x,i] and not mark[i] then\n begin\n q:=link[i]; link[i]:=x; mark[i]:=true;\n if (q=0) or find(q) then exit(true);\n link[i]:=q;\n end;\n exit(false);\nend;\n\n\n\nprocedure main;\nvar\n i:longint;\nbegin\n s:=0;\n for i:=1 to n do\n begin\n fillchar(mark,sizeof(mark),false);\n if find(i) then inc(s);\n end;\n writeln(s shr 1);\n readln;\n readln;\nend;\n\nbegin\n init;\n main;\nend.\n ", "language": "Pascal", "metadata": {"date": 1521339597, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03409.html", "problem_id": "p03409", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03409/input.txt", "sample_output_relpath": "derived/input_output/data/p03409/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03409/Pascal/s649163482.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s649163482", "user_id": "u516562331"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "var\n n:longint;\n s:longint;\n map:array[1..210,1..210]of boolean;\n mark:array[1..210]of boolean;\n link:array[1..210]of longint;\n\nprocedure init;\nvar\n i,x,y,j:longint;\n a:array[1..210,1..2]of longint;\nbegin\n fillchar(map,sizeof(map),0);\n read(n);\n for i:=1 to n do\n readln(a[i,1],a[i,2]);\n for i:=1 to n do\n begin\n read(x,y);\n for j:=1 to n do\n if (x>a[j,1])and(y>a[j,2]) then begin map[j,i+n]:=true; map[i+n,j]:=true; end;\n end;\n n:=n shl 1;\nend;\n\n\n\nfunction find(x:longint):boolean;\nvar\n i,q:longint;\nbegin\n for i:=1 to n do\n if map[x,i] and not mark[i] then\n begin\n q:=link[i]; link[i]:=x; mark[i]:=true;\n if (q=0) or find(q) then exit(true);\n link[i]:=q;\n end;\n exit(false);\nend;\n\n\n\nprocedure main;\nvar\n i:longint;\nbegin\n s:=0;\n for i:=1 to n do\n begin\n fillchar(mark,sizeof(mark),false);\n if find(i) then inc(s);\n end;\n writeln(s shr 1);\n readln;\n readln;\nend;\n\nbegin\n init;\n main;\nend.\n ", "problem_context": "Score : 400 points\n\nProblem Statement\n\nOn a two-dimensional plane, there are N red points and N blue points.\nThe coordinates of the i-th red point are (a_i, b_i), and the coordinates of the i-th blue point are (c_i, d_i).\n\nA red point and a blue point can form a friendly pair when, the x-coordinate of the red point is smaller than that of the blue point, and the y-coordinate of the red point is also smaller than that of the blue point.\n\nAt most how many friendly pairs can you form? Note that a point cannot belong to multiple pairs.\n\nConstraints\n\nAll input values are integers.\n\n1 \\leq N \\leq 100\n\n0 \\leq a_i, b_i, c_i, d_i < 2N\n\na_1, a_2, ..., a_N, c_1, c_2, ..., c_N are all different.\n\nb_1, b_2, ..., b_N, d_1, d_2, ..., d_N are all different.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_1 b_1\na_2 b_2\n:\na_N b_N\nc_1 d_1\nc_2 d_2\n:\nc_N d_N\n\nOutput\n\nPrint the maximum number of friendly pairs.\n\nSample Input 1\n\n3\n2 0\n3 1\n1 3\n4 2\n0 4\n5 5\n\nSample Output 1\n\n2\n\nFor example, you can pair (2, 0) and (4, 2), then (3, 1) and (5, 5).\n\nSample Input 2\n\n3\n0 0\n1 1\n5 2\n2 3\n3 4\n4 5\n\nSample Output 2\n\n2\n\nFor example, you can pair (0, 0) and (2, 3), then (1, 1) and (3, 4).\n\nSample Input 3\n\n2\n2 2\n3 3\n0 0\n1 1\n\nSample Output 3\n\n0\n\nIt is possible that no pair can be formed.\n\nSample Input 4\n\n5\n0 0\n7 3\n2 2\n4 8\n1 6\n8 5\n6 9\n5 4\n9 1\n3 7\n\nSample Output 4\n\n5\n\nSample Input 5\n\n5\n0 0\n1 1\n5 5\n6 6\n7 7\n2 2\n3 3\n4 4\n8 8\n9 9\n\nSample Output 5\n\n4", "sample_input": "3\n2 0\n3 1\n1 3\n4 2\n0 4\n5 5\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03409", "source_text": "Score : 400 points\n\nProblem Statement\n\nOn a two-dimensional plane, there are N red points and N blue points.\nThe coordinates of the i-th red point are (a_i, b_i), and the coordinates of the i-th blue point are (c_i, d_i).\n\nA red point and a blue point can form a friendly pair when, the x-coordinate of the red point is smaller than that of the blue point, and the y-coordinate of the red point is also smaller than that of the blue point.\n\nAt most how many friendly pairs can you form? Note that a point cannot belong to multiple pairs.\n\nConstraints\n\nAll input values are integers.\n\n1 \\leq N \\leq 100\n\n0 \\leq a_i, b_i, c_i, d_i < 2N\n\na_1, a_2, ..., a_N, c_1, c_2, ..., c_N are all different.\n\nb_1, b_2, ..., b_N, d_1, d_2, ..., d_N are all different.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_1 b_1\na_2 b_2\n:\na_N b_N\nc_1 d_1\nc_2 d_2\n:\nc_N d_N\n\nOutput\n\nPrint the maximum number of friendly pairs.\n\nSample Input 1\n\n3\n2 0\n3 1\n1 3\n4 2\n0 4\n5 5\n\nSample Output 1\n\n2\n\nFor example, you can pair (2, 0) and (4, 2), then (3, 1) and (5, 5).\n\nSample Input 2\n\n3\n0 0\n1 1\n5 2\n2 3\n3 4\n4 5\n\nSample Output 2\n\n2\n\nFor example, you can pair (0, 0) and (2, 3), then (1, 1) and (3, 4).\n\nSample Input 3\n\n2\n2 2\n3 3\n0 0\n1 1\n\nSample Output 3\n\n0\n\nIt is possible that no pair can be formed.\n\nSample Input 4\n\n5\n0 0\n7 3\n2 2\n4 8\n1 6\n8 5\n6 9\n5 4\n9 1\n3 7\n\nSample Output 4\n\n5\n\nSample Input 5\n\n5\n0 0\n1 1\n5 5\n6 6\n7 7\n2 2\n3 3\n4 4\n8 8\n9 9\n\nSample Output 5\n\n4", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 926, "cpu_time_ms": 2, "memory_kb": 128}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s197531024", "group_id": "codeNet:p03411", "input_text": "var n:longint;\n i,k:longint;\n a,b,c,d:array[0..201000]of int64;\n m0,m1:int64;\n ans:int64;\nprocedure qs(l,r:longint);\nvar i,j,m,t:longint;\nbegin\n i:=l;\n j:=r;\n m:=c[(l+r)>>1];\n repeat\n while c[i]m do dec(j);\n if i<=j then\n begin\n t:=c[i];c[i]:=c[j];c[j]:=t;\n inc(i);\n dec(j);\n end;\n until i>j;\n if l>1;\n if c[m]0 do begin\n\t\t\tT:=A div K+1;\n\t\t\tdec(A,(A mod K+T-1)div T*T);\n\t\tend;\n\t\tS:=S xor A div K;\n\tend;\n\tif S<>0 then writeln('Takahashi')else writeln('Aoki');\nend.", "problem_context": "Score : 900 points\n\nProblem Statement\n\nTakahashi and Aoki are playing a stone-taking game. Initially, there are N piles of stones, and the i-th pile contains A_i stones and has an associated integer K_i.\n\nStarting from Takahashi, Takahashi and Aoki take alternate turns to perform the following operation:\n\nChoose a pile. If the i-th pile is selected and there are X stones left in the pile, remove some number of stones between 1 and floor(X/K_i) (inclusive) from the pile.\n\nThe player who first becomes unable to perform the operation loses the game. Assuming that both players play optimally, determine the winner of the game.\nHere, floor(x) represents the largest integer not greater than x.\n\nConstraints\n\n1 \\leq N \\leq 200\n\n1 \\leq A_i,K_i \\leq 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 K_1\n:\nA_N K_N\n\nOutput\n\nIf Takahashi will win, print Takahashi; if Aoki will win, print Aoki.\n\nSample Input 1\n\n2\n5 2\n3 3\n\nSample Output 1\n\nAoki\n\nInitially, from the first pile at most floor(5/2)=2 stones can be removed at a time, and from the second pile at most floor(3/3)=1 stone can be removed at a time.\n\nIf Takahashi first takes two stones from the first pile, from the first pile at most floor(3/2)=1 stone can now be removed at a time, and from the second pile at most floor(3/3)=1 stone can be removed at a time.\n\nThen, if Aoki takes one stone from the second pile, from the first pile at most floor(3/2)=1 stone can be removed at a time, and from the second pile no more stones can be removed (since floor(2/3)=0).\n\nThen, if Takahashi takes one stone from the first pile, from the first pile at most floor(2/2)=1 stone can now be removed at a time, and from the second pile no more stones can be removed.\n\nThen, if Aoki takes one stone from the first pile, from the first pile at most floor(1/2)=0 stones can now be removed at a time, and from the second pile no more stones can be removed.\n\nNo more operation can be performed, thus Aoki wins. If Takahashi plays differently, Aoki can also win by play accordingly.\n\nSample Input 2\n\n3\n3 2\n4 3\n5 1\n\nSample Output 2\n\nTakahashi\n\nSample Input 3\n\n3\n28 3\n16 4\n19 2\n\nSample Output 3\n\nAoki\n\nSample Input 4\n\n4\n3141 59\n26535 897\n93 23\n8462 64\n\nSample Output 4\n\nTakahashi", "sample_input": "2\n5 2\n3 3\n"}, "reference_outputs": ["Aoki\n"], "source_document_id": "p03422", "source_text": "Score : 900 points\n\nProblem Statement\n\nTakahashi and Aoki are playing a stone-taking game. Initially, there are N piles of stones, and the i-th pile contains A_i stones and has an associated integer K_i.\n\nStarting from Takahashi, Takahashi and Aoki take alternate turns to perform the following operation:\n\nChoose a pile. If the i-th pile is selected and there are X stones left in the pile, remove some number of stones between 1 and floor(X/K_i) (inclusive) from the pile.\n\nThe player who first becomes unable to perform the operation loses the game. Assuming that both players play optimally, determine the winner of the game.\nHere, floor(x) represents the largest integer not greater than x.\n\nConstraints\n\n1 \\leq N \\leq 200\n\n1 \\leq A_i,K_i \\leq 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 K_1\n:\nA_N K_N\n\nOutput\n\nIf Takahashi will win, print Takahashi; if Aoki will win, print Aoki.\n\nSample Input 1\n\n2\n5 2\n3 3\n\nSample Output 1\n\nAoki\n\nInitially, from the first pile at most floor(5/2)=2 stones can be removed at a time, and from the second pile at most floor(3/3)=1 stone can be removed at a time.\n\nIf Takahashi first takes two stones from the first pile, from the first pile at most floor(3/2)=1 stone can now be removed at a time, and from the second pile at most floor(3/3)=1 stone can be removed at a time.\n\nThen, if Aoki takes one stone from the second pile, from the first pile at most floor(3/2)=1 stone can be removed at a time, and from the second pile no more stones can be removed (since floor(2/3)=0).\n\nThen, if Takahashi takes one stone from the first pile, from the first pile at most floor(2/2)=1 stone can now be removed at a time, and from the second pile no more stones can be removed.\n\nThen, if Aoki takes one stone from the first pile, from the first pile at most floor(1/2)=0 stones can now be removed at a time, and from the second pile no more stones can be removed.\n\nNo more operation can be performed, thus Aoki wins. If Takahashi plays differently, Aoki can also win by play accordingly.\n\nSample Input 2\n\n3\n3 2\n4 3\n5 1\n\nSample Output 2\n\nTakahashi\n\nSample Input 3\n\n3\n28 3\n16 4\n19 2\n\nSample Output 3\n\nAoki\n\nSample Input 4\n\n4\n3141 59\n26535 897\n93 23\n8462 64\n\nSample Output 4\n\nTakahashi", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 91, "memory_kb": 128}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s448410574", "group_id": "codeNet:p03425", "input_text": "var\n n,cnt_m,cnt_a,cnt_r,cnt_c,cnt_h,ans,i: Int64;\n s: String;\nbegin\n readln(n);\n for i := 1 to n do\n begin\n readln(s);\n if s[1]='M' then \n begin\n inc(cnt_m);\n end\n else if s[1]='A' then \n begin\n inc(cnt_a);\n end\n else if s[1]='R' then \n begin\n inc(cnt_r);\n end\n else if s[1]='C' then \n begin\n inc(cnt_c);\n end\n else if s[1]='H' then \n begin\n inc(cnt_h);\n end;\n end;\n ans:=cnt_m*cnt_a*(cnt_r+cnt_c+cnt_h)+cnt_m*cnt_r*(cnt_c+cnt_h)+\n cnt_m*cnt_c*cnt_h+cnt_a*cnt_r*(cnt_c+cnt_h)+cnt_a*cnt_c*cnt_h+\n cnt_r*cnt_c*cnt_h;\n writeln(ans);\nend.", "language": "Pascal", "metadata": {"date": 1520217093, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03425.html", "problem_id": "p03425", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03425/input.txt", "sample_output_relpath": "derived/input_output/data/p03425/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03425/Pascal/s448410574.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s448410574", "user_id": "u403323882"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "var\n n,cnt_m,cnt_a,cnt_r,cnt_c,cnt_h,ans,i: Int64;\n s: String;\nbegin\n readln(n);\n for i := 1 to n do\n begin\n readln(s);\n if s[1]='M' then \n begin\n inc(cnt_m);\n end\n else if s[1]='A' then \n begin\n inc(cnt_a);\n end\n else if s[1]='R' then \n begin\n inc(cnt_r);\n end\n else if s[1]='C' then \n begin\n inc(cnt_c);\n end\n else if s[1]='H' then \n begin\n inc(cnt_h);\n end;\n end;\n ans:=cnt_m*cnt_a*(cnt_r+cnt_c+cnt_h)+cnt_m*cnt_r*(cnt_c+cnt_h)+\n cnt_m*cnt_c*cnt_h+cnt_a*cnt_r*(cnt_c+cnt_h)+cnt_a*cnt_c*cnt_h+\n cnt_r*cnt_c*cnt_h;\n writeln(ans);\nend.", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere are N people. The name of the i-th person is S_i.\n\nWe would like to choose three people so that the following conditions are met:\n\nThe name of every chosen person begins with M, A, R, C or H.\n\nThere are no multiple people whose names begin with the same letter.\n\nHow many such ways are there to choose three people, disregarding order?\n\nNote that the answer may not fit into a 32-bit integer type.\n\nConstraints\n\n1 \\leq N \\leq 10^5\n\nS_i consists of uppercase English letters.\n\n1 \\leq |S_i| \\leq 10\n\nS_i \\neq S_j (i \\neq j)\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS_1\n:\nS_N\n\nOutput\n\nIf there are x ways to choose three people so that the given conditions are met, print x.\n\nSample Input 1\n\n5\nMASHIKE\nRUMOI\nOBIRA\nHABORO\nHOROKANAI\n\nSample Output 1\n\n2\n\nWe can choose three people with the following names:\n\nMASHIKE, RUMOI, HABORO\n\nMASHIKE, RUMOI, HOROKANAI\n\nThus, we have two ways.\n\nSample Input 2\n\n4\nZZ\nZZZ\nZ\nZZZZZZZZZZ\n\nSample Output 2\n\n0\n\nNote that there may be no ways to choose three people so that the given conditions are met.\n\nSample Input 3\n\n5\nCHOKUDAI\nRNG\nMAKOTO\nAOKI\nRINGO\n\nSample Output 3\n\n7", "sample_input": "5\nMASHIKE\nRUMOI\nOBIRA\nHABORO\nHOROKANAI\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03425", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere are N people. The name of the i-th person is S_i.\n\nWe would like to choose three people so that the following conditions are met:\n\nThe name of every chosen person begins with M, A, R, C or H.\n\nThere are no multiple people whose names begin with the same letter.\n\nHow many such ways are there to choose three people, disregarding order?\n\nNote that the answer may not fit into a 32-bit integer type.\n\nConstraints\n\n1 \\leq N \\leq 10^5\n\nS_i consists of uppercase English letters.\n\n1 \\leq |S_i| \\leq 10\n\nS_i \\neq S_j (i \\neq j)\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nS_1\n:\nS_N\n\nOutput\n\nIf there are x ways to choose three people so that the given conditions are met, print x.\n\nSample Input 1\n\n5\nMASHIKE\nRUMOI\nOBIRA\nHABORO\nHOROKANAI\n\nSample Output 1\n\n2\n\nWe can choose three people with the following names:\n\nMASHIKE, RUMOI, HABORO\n\nMASHIKE, RUMOI, HOROKANAI\n\nThus, we have two ways.\n\nSample Input 2\n\n4\nZZ\nZZZ\nZ\nZZZZZZZZZZ\n\nSample Output 2\n\n0\n\nNote that there may be no ways to choose three people so that the given conditions are met.\n\nSample Input 3\n\n5\nCHOKUDAI\nRNG\nMAKOTO\nAOKI\nRINGO\n\nSample Output 3\n\n7", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 732, "cpu_time_ms": 14, "memory_kb": 128}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s764099815", "group_id": "codeNet:p03426", "input_text": "var\n h,w,d,q,i,j,k,tmp,ans_cnt: Longint;\n a:array[1..300,1..300] of Longint;\n index:array[1..90000,1..2] of Longint;\n l,r: Longint;\n ans:array[1..100000,1..3] of Longint;\n flag:Boolean;\nbegin\n readln(h,w,d);\n for i := 1 to h do\n begin\n for j := 1 to w do\n begin\n read(a[i][j]);\n index[a[i][j]][1]:=i;\n index[a[i][j]][2]:=j;\n end;\n end;\n read(q);\n for i := 1 to q do\n begin\n readln(l,r);\n flag:=false;\n for j := 1 to ans_cnt do\n begin\n if (ans[j][1]=l) and (ans[j][2]=r) then\n begin\n writeln(ans[j][3]);\n flag:=true;\n break;\n end;\n end;\n if flag then\n begin\n continue;\n end;\n tmp:=0;\n k:=l;\n for j := 1 to ans_cnt do\n begin\n if (ans[j][1]=l)and (ans[j][2]r do\n begin\n j:=k;\n inc(k,d);\n inc(tmp,abs(index[k][1]-index[j][1])+abs(index[k][2]-index[j][2]));\n end;\n inc(ans_cnt);\n ans[ans_cnt][1]:=l;\n ans[ans_cnt][2]:=r;\n ans[ans_cnt][3]:=tmp;\n writeln(tmp);\n end;\nend.", "language": "Pascal", "metadata": {"date": 1520219663, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03426.html", "problem_id": "p03426", "resource_group": "low_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/Pascal/s764099815.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s764099815", "user_id": "u403323882"}, "prompt_components": {"gold_output": "5\n", "input_to_evaluate": "var\n h,w,d,q,i,j,k,tmp,ans_cnt: Longint;\n a:array[1..300,1..300] of Longint;\n index:array[1..90000,1..2] of Longint;\n l,r: Longint;\n ans:array[1..100000,1..3] of Longint;\n flag:Boolean;\nbegin\n readln(h,w,d);\n for i := 1 to h do\n begin\n for j := 1 to w do\n begin\n read(a[i][j]);\n index[a[i][j]][1]:=i;\n index[a[i][j]][2]:=j;\n end;\n end;\n read(q);\n for i := 1 to q do\n begin\n readln(l,r);\n flag:=false;\n for j := 1 to ans_cnt do\n begin\n if (ans[j][1]=l) and (ans[j][2]=r) then\n begin\n writeln(ans[j][3]);\n flag:=true;\n break;\n end;\n end;\n if flag then\n begin\n continue;\n end;\n tmp:=0;\n k:=l;\n for j := 1 to ans_cnt do\n begin\n if (ans[j][1]=l)and (ans[j][2]r do\n begin\n j:=k;\n inc(k,d);\n inc(tmp,abs(index[k][1]-index[j][1])+abs(index[k][2]-index[j][2]));\n end;\n inc(ans_cnt);\n ans[ans_cnt][1]:=l;\n ans[ans_cnt][2]:=r;\n ans[ans_cnt][3]:=tmp;\n writeln(tmp);\n end;\nend.", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 2103, "memory_kb": 2048}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s268324877", "group_id": "codeNet:p03427", "input_text": "var\n max,i,j,n,m,a,xx:longint;\n s:ansistring;\nbegin\n read(s); \n m:=0; max:=-1;\n val(s,a,xx);\n for j:=1 to a do\n begin\n str(j,s);\n n:=length(s);\n for i:=1 to n do\n m:=m+ord(s[i])-48;\n if m>max then max:=m;\n m:=0;\n end;\n write(max);\nend.", "language": "Pascal", "metadata": {"date": 1528243011, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03427.html", "problem_id": "p03427", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03427/input.txt", "sample_output_relpath": "derived/input_output/data/p03427/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03427/Pascal/s268324877.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s268324877", "user_id": "u621365701"}, "prompt_components": {"gold_output": "18\n", "input_to_evaluate": "var\n max,i,j,n,m,a,xx:longint;\n s:ansistring;\nbegin\n read(s); \n m:=0; max:=-1;\n val(s,a,xx);\n for j:=1 to a do\n begin\n str(j,s);\n n:=length(s);\n for i:=1 to n do\n m:=m+ord(s[i])-48;\n if m>max then max:=m;\n m:=0;\n end;\n write(max);\nend.", "problem_context": "Score : 300 points\n\nProblem Statement\n\nFind the maximum possible sum of the digits (in base 10) of a positive integer not greater than N.\n\nConstraints\n\n1\\leq N \\leq 10^{16}\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 maximum possible sum of the digits (in base 10) of a positive integer not greater than N.\n\nSample Input 1\n\n100\n\nSample Output 1\n\n18\n\nFor example, the sum of the digits in 99 is 18, which turns out to be the maximum value.\n\nSample Input 2\n\n9995\n\nSample Output 2\n\n35\n\nFor example, the sum of the digits in 9989 is 35, which turns out to be the maximum value.\n\nSample Input 3\n\n3141592653589793\n\nSample Output 3\n\n137", "sample_input": "100\n"}, "reference_outputs": ["18\n"], "source_document_id": "p03427", "source_text": "Score : 300 points\n\nProblem Statement\n\nFind the maximum possible sum of the digits (in base 10) of a positive integer not greater than N.\n\nConstraints\n\n1\\leq N \\leq 10^{16}\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 maximum possible sum of the digits (in base 10) of a positive integer not greater than N.\n\nSample Input 1\n\n100\n\nSample Output 1\n\n18\n\nFor example, the sum of the digits in 99 is 18, which turns out to be the maximum value.\n\nSample Input 2\n\n9995\n\nSample Output 2\n\n35\n\nFor example, the sum of the digits in 9989 is 35, which turns out to be the maximum value.\n\nSample Input 3\n\n3141592653589793\n\nSample Output 3\n\n137", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 2103, "memory_kb": 128}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s829262373", "group_id": "codeNet:p03431", "input_text": "var\nn,k,z,c,p,i:int64;\nfunction pw(x,y:int64):int64;\nvar re:int64;\nbegin\n re:=1;\n\twhile y>0 do\n\tbegin\n\t\tif (y and 1=1) then begin re:=(re*x) mod 998244353; end;\n\t\tx:=x*x mod 998244353;\n\t\ty:=y div 2;\n\tend;\n\tpw:=re;\nend;\nbegin\n\tn:=1; k:=1; z:=1; c:=1;\n\tp:=998244353;\n\treadln(k,n);\n\tz:=pw(2,n-1);\n\twhile i0 do\n\tbegin\n\t\tif (y and 1=1) then begin re:=(re*x) mod 998244353; end;\n\t\tx:=x*x mod 998244353;\n\t\ty:=y div 2;\n\tend;\n\tpw:=re;\nend;\nbegin\n\tn:=1; k:=1; z:=1; c:=1;\n\tp:=998244353;\n\treadln(k,n);\n\tz:=pw(2,n-1);\n\twhile i=n mod 500 then writeln('Yes')\n else writeln('No');\nend.", "language": "Pascal", "metadata": {"date": 1521591253, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03433.html", "problem_id": "p03433", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03433/input.txt", "sample_output_relpath": "derived/input_output/data/p03433/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03433/Pascal/s578907744.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s578907744", "user_id": "u476418095"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "var\n a,n:longint;\nbegin\n readln(n);\n readln(a);\n if a>=n mod 500 then writeln('Yes')\n else writeln('No');\nend.", "problem_context": "Score: 100 points\n\nProblem Statement\n\nE869120 has A 1-yen coins and infinitely many 500-yen coins.\n\nDetermine if he can pay exactly N yen using only these coins.\n\nConstraints\n\nN is an integer between 1 and 10000 (inclusive).\n\nA is an integer between 0 and 1000 (inclusive).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA\n\nOutput\n\nIf E869120 can pay exactly N yen using only his 1-yen and 500-yen coins, print Yes; otherwise, print No.\n\nSample Input 1\n\n2018\n218\n\nSample Output 1\n\nYes\n\nWe can pay 2018 yen with four 500-yen coins and 18 1-yen coins, so the answer is Yes.\n\nSample Input 2\n\n2763\n0\n\nSample Output 2\n\nNo\n\nWhen we have no 1-yen coins, we can only pay a multiple of 500 yen using only 500-yen coins. Since 2763 is not a multiple of 500, we cannot pay this amount.\n\nSample Input 3\n\n37\n514\n\nSample Output 3\n\nYes", "sample_input": "2018\n218\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p03433", "source_text": "Score: 100 points\n\nProblem Statement\n\nE869120 has A 1-yen coins and infinitely many 500-yen coins.\n\nDetermine if he can pay exactly N yen using only these coins.\n\nConstraints\n\nN is an integer between 1 and 10000 (inclusive).\n\nA is an integer between 0 and 1000 (inclusive).\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA\n\nOutput\n\nIf E869120 can pay exactly N yen using only his 1-yen and 500-yen coins, print Yes; otherwise, print No.\n\nSample Input 1\n\n2018\n218\n\nSample Output 1\n\nYes\n\nWe can pay 2018 yen with four 500-yen coins and 18 1-yen coins, so the answer is Yes.\n\nSample Input 2\n\n2763\n0\n\nSample Output 2\n\nNo\n\nWhen we have no 1-yen coins, we can only pay a multiple of 500 yen using only 500-yen coins. Since 2763 is not a multiple of 500, we cannot pay this amount.\n\nSample Input 3\n\n37\n514\n\nSample Output 3\n\nYes", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 2, "memory_kb": 128}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s146693013", "group_id": "codeNet:p03434", "input_text": "var\n n,i,x,y: Integer;\n a: array[1..100] of Integer;\n\nprocedure qsort(l,r:Longint;data:PInteger);\nvar\n i,j,mid,t: Integer;\nbegin\n if l>=r then\n begin\n exit;\n end;\n i:=l-1;\n j:=r-1;\n mid:=data[(l+r) div 2];\n repeat\n while data[i]mid do\n begin\n dec(j);\n end;\n if i<=j then\n begin\n t:=data[i];\n data[i]:=data[j];\n data[j]:=t;\n inc(i);\n dec(j);\n end;\n until i>j;\n qsort(l,j,data);\n qsort(i,r,data);\nend;\nbegin\n readln(n);\n for i := 1 to n do\n begin\n read(a[i]);\n end;\n qsort(1,n,@a);\n x:=0;\n y:=0;\n i:=n;\n while i>0 do\n begin\n inc(x,a[i]);\n dec(i,2);\n end;\n i:=n-1;\n while i>0 do\n begin\n inc(y,a[i]);\n dec(i,2);\n end;\n writeln(x-y);\n readln;\n readln;\nend.\n", "language": "Pascal", "metadata": {"date": 1522793150, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03434.html", "problem_id": "p03434", "resource_group": "low_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/Pascal/s146693013.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s146693013", "user_id": "u403323882"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "var\n n,i,x,y: Integer;\n a: array[1..100] of Integer;\n\nprocedure qsort(l,r:Longint;data:PInteger);\nvar\n i,j,mid,t: Integer;\nbegin\n if l>=r then\n begin\n exit;\n end;\n i:=l-1;\n j:=r-1;\n mid:=data[(l+r) div 2];\n repeat\n while data[i]mid do\n begin\n dec(j);\n end;\n if i<=j then\n begin\n t:=data[i];\n data[i]:=data[j];\n data[j]:=t;\n inc(i);\n dec(j);\n end;\n until i>j;\n qsort(l,j,data);\n qsort(i,r,data);\nend;\nbegin\n readln(n);\n for i := 1 to n do\n begin\n read(a[i]);\n end;\n qsort(1,n,@a);\n x:=0;\n y:=0;\n i:=n;\n while i>0 do\n begin\n inc(x,a[i]);\n dec(i,2);\n end;\n i:=n-1;\n while i>0 do\n begin\n inc(y,a[i]);\n dec(i,2);\n end;\n writeln(x-y);\n readln;\n readln;\nend.\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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 972, "cpu_time_ms": 289, "memory_kb": 262272}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s786263837", "group_id": "codeNet:p03434", "input_text": "program ABC088B;\n{$mode Delphi}\nuses SysUtils,fgl;\n\nfunction intcompare(n1,n2:longint):longint;\nbegin\n\tresult:=n2-n1;\nend;\n\nvar\n\tn,i,r,t: longint;\n\tarr: TFPGList;\nbegin\n\tread(n);\n\tarr:=TFPGList.Create();\n\tfor i:=0 to n-1 do begin\n\t\tread(r);\n\t\tarr.Add(r);\n\tend;\n\tarr.Sort(@intcompare);\n\t// reverse(arr,0,arr.Count);\n\tr:=0;\n\tt:=1;\n\tfor i:=0 to n-1 do begin\n\t\tr:=r+t*arr[i];\n\t\tt:=-t;\n\tend;\n\twriteln(r);\nend.\n", "language": "Pascal", "metadata": {"date": 1522278679, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03434.html", "problem_id": "p03434", "resource_group": "low_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/Pascal/s786263837.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s786263837", "user_id": "u280667879"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "program ABC088B;\n{$mode Delphi}\nuses SysUtils,fgl;\n\nfunction intcompare(n1,n2:longint):longint;\nbegin\n\tresult:=n2-n1;\nend;\n\nvar\n\tn,i,r,t: longint;\n\tarr: TFPGList;\nbegin\n\tread(n);\n\tarr:=TFPGList.Create();\n\tfor i:=0 to n-1 do begin\n\t\tread(r);\n\t\tarr.Add(r);\n\tend;\n\tarr.Sort(@intcompare);\n\t// reverse(arr,0,arr.Count);\n\tr:=0;\n\tt:=1;\n\tfor i:=0 to n-1 do begin\n\t\tr:=r+t*arr[i];\n\t\tt:=-t;\n\tend;\n\twriteln(r);\nend.\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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s308237667", "group_id": "codeNet:p03437", "input_text": "{var n,m,ans:int64;\nvar a:int64;\nfunction gys(a,b:int64):int64;\nVar\n c:int64;\nbegin\n repeat\n c:=a mod b;\n a:=b;\n b:=c;\n until c=0;\n exit(a);\nend;\nbegin\n read(n,m);\n if m mod n=0 then begin writeln(-1);exit;end;\n ans:=n*gys(n,m);if ans<=1000000000000000000\nend. }\nvar n,m,ans:int64;\nvar i:longint;\nvar a:int64;\nbegin\n read(n,m);\n if m mod n=0 then begin writeln(-1);exit;end;\n for i:=2 to 2147483647 do\n begin\n a:=n*i;\n if a>1000000000000000000 then begin writeln(-1);exit;end;\n if a mod m>0 then begin writeln(a);exit;end;\n end;\n writeln(-1);\nend.\n", "language": "Pascal", "metadata": {"date": 1517717433, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03437.html", "problem_id": "p03437", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03437/input.txt", "sample_output_relpath": "derived/input_output/data/p03437/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03437/Pascal/s308237667.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s308237667", "user_id": "u379604713"}, "prompt_components": {"gold_output": "16\n", "input_to_evaluate": "{var n,m,ans:int64;\nvar a:int64;\nfunction gys(a,b:int64):int64;\nVar\n c:int64;\nbegin\n repeat\n c:=a mod b;\n a:=b;\n b:=c;\n until c=0;\n exit(a);\nend;\nbegin\n read(n,m);\n if m mod n=0 then begin writeln(-1);exit;end;\n ans:=n*gys(n,m);if ans<=1000000000000000000\nend. }\nvar n,m,ans:int64;\nvar i:longint;\nvar a:int64;\nbegin\n read(n,m);\n if m mod n=0 then begin writeln(-1);exit;end;\n for i:=2 to 2147483647 do\n begin\n a:=n*i;\n if a>1000000000000000000 then begin writeln(-1);exit;end;\n if a mod m>0 then begin writeln(a);exit;end;\n end;\n writeln(-1);\nend.\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou are given positive integers X and Y.\nIf there exists a positive integer not greater than 10^{18} that is a multiple of X but not a multiple of Y, choose one such integer and print it.\nIf it does not exist, print -1.\n\nConstraints\n\n1 ≤ X,Y ≤ 10^9\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 a positive integer not greater than 10^{18} that is a multiple of X but not a multiple of Y, or print -1 if it does not exist.\n\nSample Input 1\n\n8 6\n\nSample Output 1\n\n16\n\nFor example, 16 is a multiple of 8 but not a multiple of 6.\n\nSample Input 2\n\n3 3\n\nSample Output 2\n\n-1\n\nA multiple of 3 is a multiple of 3.", "sample_input": "8 6\n"}, "reference_outputs": ["16\n"], "source_document_id": "p03437", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou are given positive integers X and Y.\nIf there exists a positive integer not greater than 10^{18} that is a multiple of X but not a multiple of Y, choose one such integer and print it.\nIf it does not exist, print -1.\n\nConstraints\n\n1 ≤ X,Y ≤ 10^9\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 a positive integer not greater than 10^{18} that is a multiple of X but not a multiple of Y, or print -1 if it does not exist.\n\nSample Input 1\n\n8 6\n\nSample Output 1\n\n16\n\nFor example, 16 is a multiple of 8 but not a multiple of 6.\n\nSample Input 2\n\n3 3\n\nSample Output 2\n\n-1\n\nA multiple of 3 is a multiple of 3.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 586, "cpu_time_ms": 2103, "memory_kb": 128}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s086452268", "group_id": "codeNet:p03438", "input_text": "var\n n,i,s1:longint;\n s2:real;\n a,b:array[1..10000] of longint;\nbegin\n readln(n);\n for i:=1 to n do read(a[i]);\n for i:=1 to n do read(b[i]);\n for i:=1 to n do\n begin\n if a[i]>b[i] then s1:=s1+a[i]-b[i];\n if a[i]b[i] then s1:=s1+a[i]-b[i];\n if a[i]B[i]then inc(x,A[i]-B[i])else inc(y,(B[i]-A[i]+1)div 2);\nend;\nif(x>cnt)or(y>cnt)then writeln('No')else writeln('Yes');\nend.", "language": "Pascal", "metadata": {"date": 1582617831, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03438.html", "problem_id": "p03438", "resource_group": "low_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/Pascal/s428549926.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s428549926", "user_id": "u657913472"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "var\nn,i:Longint;\nA,B:Array[1..10000]of Longint;\ncnt,x,y:int64;\nbegin\nread(n);\nfor i:=1 to n do read(A[i]);\nfor i:=1 to n do read(B[i]);\nfor i:=1 to n do inc(cnt,B[i]-A[i]);\nfor i:=1 to n do begin\nif A[i]>B[i]then inc(x,A[i]-B[i])else inc(y,(B[i]-A[i]+1)div 2);\nend;\nif(x>cnt)or(y>cnt)then writeln('No')else writeln('Yes');\nend.", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 4, "memory_kb": 128}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s112537453", "group_id": "codeNet:p03438", "input_text": "var y,n,ans:int64;\nvar i:longint;\nvar x:array[0..10020] of int64;\nbegin\n read(n);for i:=1 to n do read(x[i]);\n for i:=1 to n do begin read(y);if x[i]=0 then writeln('Yes')else writeln('No');\nend.\n", "language": "Pascal", "metadata": {"date": 1517726632, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03438.html", "problem_id": "p03438", "resource_group": "low_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/Pascal/s112537453.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s112537453", "user_id": "u168783191"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "var y,n,ans:int64;\nvar i:longint;\nvar x:array[0..10020] of int64;\nbegin\n read(n);for i:=1 to n do read(x[i]);\n for i:=1 to n do begin read(y);if x[i]=0 then writeln('Yes')else writeln('No');\nend.\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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 3, "memory_kb": 128}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s127151210", "group_id": "codeNet:p03438", "input_text": "var y,n,ans:int64;\nvar i:longint;\nvar x:array[0..10020] of int64;\nbegin\n read(n);for i:=1 to n do read(x[i]);\n for i:=1 to n do begin read(y);if x[i]=0 then writeln('Yes')else writeln('No');\nend.", "language": "Pascal", "metadata": {"date": 1517720194, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03438.html", "problem_id": "p03438", "resource_group": "low_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/Pascal/s127151210.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s127151210", "user_id": "u379604713"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "var y,n,ans:int64;\nvar i:longint;\nvar x:array[0..10020] of int64;\nbegin\n read(n);for i:=1 to n do read(x[i]);\n for i:=1 to n do begin read(y);if x[i]=0 then writeln('Yes')else writeln('No');\nend.", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 3, "memory_kb": 128}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s739311596", "group_id": "codeNet:p03440", "input_text": "type\n node=record\n num,id:longint;\n end;\nvar father,num,now,first:array[0..105000]of longint;\n p:array[0..105000]of node;\n heap:array[0..105000,0..2]of longint;\n i:longint;\n x,y:longint;\n n,m:longint;\n totin,totout:longint;\n qwq,ans,have:int64;\n\nfunction getfather(x:longint):longint;\nbegin\n if father[x]=x then exit(x) else\n begin\n father[x]:=getfather(father[x]);\n getfather:=father[x];\n end;\nend;\nprocedure adde(x,y:longint);\nvar fx,fy:longint;\nbegin\n fx:=getfather(x);\n fy:=getfather(y);\n if fx<>fy then\n begin\n father[fx]:=fy;\n inc(num[fy],num[fx]);\n end;\nend;\nprocedure qs(l,r:longint);\nvar i,j:longint;\n t,m:node;\nbegin\n i:=l;\n j:=r;\n m:=p[(l+r)>>1];\n repeat\n while (p[i].idm.id)or((p[j].id=m.id)and(p[j].num>m.num)) do dec(j);\n if i<=j then\n begin\n t:=p[i];p[i]:=p[j];p[j]:=t;\n inc(i);\n dec(j);\n end;\n until i>j;\n if l1 do\n begin\n //writeln(heap[x,bool],'qwq');\n if p[now[heap[x,bool]]].num>1,bool]]].num then\n begin\n swap(heap[x,bool],heap[x>>1,bool]);\n x:=x>>1;\n end else break;\n end;\nend;\nprocedure down(x,bool:longint);\nvar min,tot:longint;\nbegin\n if bool=1 then tot:=totin else tot:=totout;\n while x*2<=tot do\n begin\n min:=x*2;\n if (x*2+1<=tot)and\n (p[now[heap[x*2+1,bool]]].nump[now[heap[min,bool]]].num) then\n begin\n swap(heap[x,bool],heap[min,bool]);\n x:=min;\n end else break;\n end;\nend;\nbegin\n read(n,m);\n for i:=1 to n do\n begin\n read(p[i].num);\n father[i]:=i;\n num[i]:=1;\n end;\n for i:=1 to m do\n begin\n read(x,y);\n inc(x);\n inc(y);\n adde(x,y);\n end;\n for i:=1 to n do\n p[i].id:=getfather(i);\n qs(1,n);\n p[0].num:=maxlongint;\n i:=1;\n while i<=n do\n begin\n inc(ans,p[i].num);\n if num[p[i].id]>1 then\n begin\n now[p[i].id]:=i+1;\n inc(have,num[p[i].id]);\n dec(have);\n end else\n begin\n now[p[i].id]:=0;\n dec(have);\n end;\n inc(totout);\n heap[totout,0]:=p[i].id;\n up(totout,0);\n first[p[i].id]:=i;\n i:=i+num[p[i].id];\n end;\n if totout=1 then\n begin\n writeln(0);\n exit;\n end;\n inc(have);\n if have<0 then\n begin\n writeln('Impossible');\n exit;\n end;\n while totout>0 do\n begin\n inc(qwq);\n x:=heap[1,0];\n //writeln(x);\n if now[x]<>0 then\n begin\n inc(totin);\n heap[totin,1]:=x;\n up(totin,1);\n end else\n if (qwq>1)and(totin>0) then\n begin\n x:=heap[1,1];\n inc(ans,p[now[x]].num);\n end;\n if totin>0 then\n begin\n x:=heap[1,1];\n if qwq>2 then inc(ans,p[now[x]].num);\n inc(now[x]);\n if (now[x]>=first[x]+num[x]) then\n begin\n now[x]:=0;\n heap[1,1]:=heap[totin,1];\n dec(totin);\n end;\n if totin>0 then down(1,1);\n end;\n heap[1,0]:=heap[totout,0];\n dec(totout);\n down(1,0);\n end;\n writeln(ans);\nend.\n", "language": "Pascal", "metadata": {"date": 1517728277, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03440.html", "problem_id": "p03440", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03440/input.txt", "sample_output_relpath": "derived/input_output/data/p03440/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03440/Pascal/s739311596.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s739311596", "user_id": "u809476955"}, "prompt_components": {"gold_output": "7\n", "input_to_evaluate": "type\n node=record\n num,id:longint;\n end;\nvar father,num,now,first:array[0..105000]of longint;\n p:array[0..105000]of node;\n heap:array[0..105000,0..2]of longint;\n i:longint;\n x,y:longint;\n n,m:longint;\n totin,totout:longint;\n qwq,ans,have:int64;\n\nfunction getfather(x:longint):longint;\nbegin\n if father[x]=x then exit(x) else\n begin\n father[x]:=getfather(father[x]);\n getfather:=father[x];\n end;\nend;\nprocedure adde(x,y:longint);\nvar fx,fy:longint;\nbegin\n fx:=getfather(x);\n fy:=getfather(y);\n if fx<>fy then\n begin\n father[fx]:=fy;\n inc(num[fy],num[fx]);\n end;\nend;\nprocedure qs(l,r:longint);\nvar i,j:longint;\n t,m:node;\nbegin\n i:=l;\n j:=r;\n m:=p[(l+r)>>1];\n repeat\n while (p[i].idm.id)or((p[j].id=m.id)and(p[j].num>m.num)) do dec(j);\n if i<=j then\n begin\n t:=p[i];p[i]:=p[j];p[j]:=t;\n inc(i);\n dec(j);\n end;\n until i>j;\n if l1 do\n begin\n //writeln(heap[x,bool],'qwq');\n if p[now[heap[x,bool]]].num>1,bool]]].num then\n begin\n swap(heap[x,bool],heap[x>>1,bool]);\n x:=x>>1;\n end else break;\n end;\nend;\nprocedure down(x,bool:longint);\nvar min,tot:longint;\nbegin\n if bool=1 then tot:=totin else tot:=totout;\n while x*2<=tot do\n begin\n min:=x*2;\n if (x*2+1<=tot)and\n (p[now[heap[x*2+1,bool]]].nump[now[heap[min,bool]]].num) then\n begin\n swap(heap[x,bool],heap[min,bool]);\n x:=min;\n end else break;\n end;\nend;\nbegin\n read(n,m);\n for i:=1 to n do\n begin\n read(p[i].num);\n father[i]:=i;\n num[i]:=1;\n end;\n for i:=1 to m do\n begin\n read(x,y);\n inc(x);\n inc(y);\n adde(x,y);\n end;\n for i:=1 to n do\n p[i].id:=getfather(i);\n qs(1,n);\n p[0].num:=maxlongint;\n i:=1;\n while i<=n do\n begin\n inc(ans,p[i].num);\n if num[p[i].id]>1 then\n begin\n now[p[i].id]:=i+1;\n inc(have,num[p[i].id]);\n dec(have);\n end else\n begin\n now[p[i].id]:=0;\n dec(have);\n end;\n inc(totout);\n heap[totout,0]:=p[i].id;\n up(totout,0);\n first[p[i].id]:=i;\n i:=i+num[p[i].id];\n end;\n if totout=1 then\n begin\n writeln(0);\n exit;\n end;\n inc(have);\n if have<0 then\n begin\n writeln('Impossible');\n exit;\n end;\n while totout>0 do\n begin\n inc(qwq);\n x:=heap[1,0];\n //writeln(x);\n if now[x]<>0 then\n begin\n inc(totin);\n heap[totin,1]:=x;\n up(totin,1);\n end else\n if (qwq>1)and(totin>0) then\n begin\n x:=heap[1,1];\n inc(ans,p[now[x]].num);\n end;\n if totin>0 then\n begin\n x:=heap[1,1];\n if qwq>2 then inc(ans,p[now[x]].num);\n inc(now[x]);\n if (now[x]>=first[x]+num[x]) then\n begin\n now[x]:=0;\n heap[1,1]:=heap[totin,1];\n dec(totin);\n end;\n if totin>0 then down(1,1);\n end;\n heap[1,0]:=heap[totout,0];\n dec(totout);\n down(1,0);\n end;\n writeln(ans);\nend.\n", "problem_context": "Score : 600 points\n\nProblem Statement\n\nYou are given a forest with N vertices and M edges. The vertices are numbered 0 through N-1.\nThe edges are given in the format (x_i,y_i), which means that Vertex x_i and y_i are connected by an edge.\n\nEach vertex i has a value a_i.\nYou want to add edges in the given forest so that the forest becomes connected.\nTo add an edge, you choose two different vertices i and j, then span an edge between i and j.\nThis operation costs a_i + a_j dollars, and afterward neither Vertex i nor j can be selected again.\n\nFind the minimum total cost required to make the forest connected, or print Impossible if it is impossible.\n\nConstraints\n\n1 ≤ N ≤ 100,000\n\n0 ≤ M ≤ N-1\n\n1 ≤ a_i ≤ 10^9\n\n0 ≤ x_i,y_i ≤ N-1\n\nThe given graph is a forest.\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\na_0 a_1 .. a_{N-1}\nx_1 y_1\nx_2 y_2\n:\nx_M y_M\n\nOutput\n\nPrint the minimum total cost required to make the forest connected, or print Impossible if it is impossible.\n\nSample Input 1\n\n7 5\n1 2 3 4 5 6 7\n3 0\n4 0\n1 2\n1 3\n5 6\n\nSample Output 1\n\n7\n\nIf we connect vertices 0 and 5, the graph becomes connected, for the cost of 1 + 6 = 7 dollars.\n\nSample Input 2\n\n5 0\n3 1 4 1 5\n\nSample Output 2\n\nImpossible\n\nWe can't make the graph connected.\n\nSample Input 3\n\n1 0\n5\n\nSample Output 3\n\n0\n\nThe graph is already connected, so we do not need to add any edges.", "sample_input": "7 5\n1 2 3 4 5 6 7\n3 0\n4 0\n1 2\n1 3\n5 6\n"}, "reference_outputs": ["7\n"], "source_document_id": "p03440", "source_text": "Score : 600 points\n\nProblem Statement\n\nYou are given a forest with N vertices and M edges. The vertices are numbered 0 through N-1.\nThe edges are given in the format (x_i,y_i), which means that Vertex x_i and y_i are connected by an edge.\n\nEach vertex i has a value a_i.\nYou want to add edges in the given forest so that the forest becomes connected.\nTo add an edge, you choose two different vertices i and j, then span an edge between i and j.\nThis operation costs a_i + a_j dollars, and afterward neither Vertex i nor j can be selected again.\n\nFind the minimum total cost required to make the forest connected, or print Impossible if it is impossible.\n\nConstraints\n\n1 ≤ N ≤ 100,000\n\n0 ≤ M ≤ N-1\n\n1 ≤ a_i ≤ 10^9\n\n0 ≤ x_i,y_i ≤ N-1\n\nThe given graph is a forest.\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\na_0 a_1 .. a_{N-1}\nx_1 y_1\nx_2 y_2\n:\nx_M y_M\n\nOutput\n\nPrint the minimum total cost required to make the forest connected, or print Impossible if it is impossible.\n\nSample Input 1\n\n7 5\n1 2 3 4 5 6 7\n3 0\n4 0\n1 2\n1 3\n5 6\n\nSample Output 1\n\n7\n\nIf we connect vertices 0 and 5, the graph becomes connected, for the cost of 1 + 6 = 7 dollars.\n\nSample Input 2\n\n5 0\n3 1 4 1 5\n\nSample Output 2\n\nImpossible\n\nWe can't make the graph connected.\n\nSample Input 3\n\n1 0\n5\n\nSample Output 3\n\n0\n\nThe graph is already connected, so we do not need to add any edges.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 3209, "cpu_time_ms": 57, "memory_kb": 3584}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s795330870", "group_id": "codeNet:p03447", "input_text": "var\n x,a,b:longint;\nbegin\n read(x,a,b);\n writeln((x-a) mod b);\nend.", "language": "Pascal", "metadata": {"date": 1526178100, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03447.html", "problem_id": "p03447", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03447/input.txt", "sample_output_relpath": "derived/input_output/data/p03447/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03447/Pascal/s795330870.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s795330870", "user_id": "u426964396"}, "prompt_components": {"gold_output": "84\n", "input_to_evaluate": "var\n x,a,b:longint;\nbegin\n read(x,a,b);\n writeln((x-a) mod b);\nend.", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou went shopping to buy cakes and donuts with X yen (the currency of Japan).\n\nFirst, you bought one cake for A yen at a cake shop.\nThen, you bought as many donuts as possible for B yen each, at a donut shop.\n\nHow much do you have left after shopping?\n\nConstraints\n\n1 \\leq A, B \\leq 1 000\n\nA + B \\leq X \\leq 10 000\n\nX, A and B are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX\nA\nB\n\nOutput\n\nPrint the amount you have left after shopping.\n\nSample Input 1\n\n1234\n150\n100\n\nSample Output 1\n\n84\n\nYou have 1234 - 150 = 1084 yen left after buying a cake.\nWith this amount, you can buy 10 donuts, after which you have 84 yen left.\n\nSample Input 2\n\n1000\n108\n108\n\nSample Output 2\n\n28\n\nSample Input 3\n\n579\n123\n456\n\nSample Output 3\n\n0\n\nSample Input 4\n\n7477\n549\n593\n\nSample Output 4\n\n405", "sample_input": "1234\n150\n100\n"}, "reference_outputs": ["84\n"], "source_document_id": "p03447", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou went shopping to buy cakes and donuts with X yen (the currency of Japan).\n\nFirst, you bought one cake for A yen at a cake shop.\nThen, you bought as many donuts as possible for B yen each, at a donut shop.\n\nHow much do you have left after shopping?\n\nConstraints\n\n1 \\leq A, B \\leq 1 000\n\nA + B \\leq X \\leq 10 000\n\nX, A and B are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX\nA\nB\n\nOutput\n\nPrint the amount you have left after shopping.\n\nSample Input 1\n\n1234\n150\n100\n\nSample Output 1\n\n84\n\nYou have 1234 - 150 = 1084 yen left after buying a cake.\nWith this amount, you can buy 10 donuts, after which you have 84 yen left.\n\nSample Input 2\n\n1000\n108\n108\n\nSample Output 2\n\n28\n\nSample Input 3\n\n579\n123\n456\n\nSample Output 3\n\n0\n\nSample Input 4\n\n7477\n549\n593\n\nSample Output 4\n\n405", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 76, "cpu_time_ms": 28, "memory_kb": 128}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s474081307", "group_id": "codeNet:p03449", "input_text": "uses math;\nvar s:array[0..2,0..100]of longint;\n i,j,n,x,a:longint;\nbegin\n readln(n);\n for i:=1 to 2 do\n for j:=1 to n do\n begin\n read(x);\n s[i,j]:=s[i,j-1]+x;\n end;\n for i:=1 to n do\n a:=max(a,s[1,i]+s[2,n]-s[2,i-1]);\n writeln(a);\nend.", "language": "Pascal", "metadata": {"date": 1581731853, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03449.html", "problem_id": "p03449", "resource_group": "low_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/Pascal/s474081307.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s474081307", "user_id": "u743614777"}, "prompt_components": {"gold_output": "14\n", "input_to_evaluate": "uses math;\nvar s:array[0..2,0..100]of longint;\n i,j,n,x,a:longint;\nbegin\n readln(n);\n for i:=1 to 2 do\n for j:=1 to n do\n begin\n read(x);\n s[i,j]:=s[i,j-1]+x;\n end;\n for i:=1 to n do\n a:=max(a,s[1,i]+s[2,n]-s[2,i-1]);\n writeln(a);\nend.", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s129329002", "group_id": "codeNet:p03450", "input_text": "var\n n,m,i,j: Longint;\n L,R,D: array[1..200000] of Longint;\n position:array[1..100000] of Longint;\n flag:Boolean;\nbegin\n flag:=true;\n readln(n,m);\n for i := 1 to n do\n begin\n position[i]:=-2147483648;\n end;\n for i := 1 to m do\n begin\n readln(L[i],R[i],D[i]);\n if (position[L[i]]=-2147483648)and(position[R[i]]=-2147483648) then \n begin\n position[L[i]]:=0;\n position[R[i]]:=D[i];\n end\n else \n begin\n if (position[L[i]]<>-2147483648) and (position[R[i]]<>-2147483648) then \n begin\n if position[L[i]]+D[i]<>position[R[i]] then\n begin\n flag:=false;\n break;\n end;\n end\n else\n begin\n if position[L[i]]<>-2147483648 then\n begin\n position[R[i]]:=position[L[i]]+D[i];\n for j := 1 to i-1 do\n begin\n if L[j]=R[i] then \n begin\n position[R[j]]:=position[L[j]]+D[j];\n end\n else if R[j]=R[i] then\n begin\n position[L[j]]:=position[R[j]]-D[j];\n end;\n end;\n end\n else\n begin\n position[L[i]]:=position[R[i]]-D[i];\n for j := 1 to i-1 do\n begin\n if L[j]=L[i] then \n begin\n position[R[j]]:=position[L[j]]+D[j];\n end\n else if R[j]=L[i] then\n begin\n position[L[j]]:=position[R[j]]-D[j];\n end;\n end;\n end;\n end;\n end;\n end;\n if flag then \n begin\n writeln('Yes');\n end\n else \n begin\n writeln('No');\n end;\nend.", "language": "Pascal", "metadata": {"date": 1517196829, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03450.html", "problem_id": "p03450", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03450/input.txt", "sample_output_relpath": "derived/input_output/data/p03450/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03450/Pascal/s129329002.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s129329002", "user_id": "u403323882"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "var\n n,m,i,j: Longint;\n L,R,D: array[1..200000] of Longint;\n position:array[1..100000] of Longint;\n flag:Boolean;\nbegin\n flag:=true;\n readln(n,m);\n for i := 1 to n do\n begin\n position[i]:=-2147483648;\n end;\n for i := 1 to m do\n begin\n readln(L[i],R[i],D[i]);\n if (position[L[i]]=-2147483648)and(position[R[i]]=-2147483648) then \n begin\n position[L[i]]:=0;\n position[R[i]]:=D[i];\n end\n else \n begin\n if (position[L[i]]<>-2147483648) and (position[R[i]]<>-2147483648) then \n begin\n if position[L[i]]+D[i]<>position[R[i]] then\n begin\n flag:=false;\n break;\n end;\n end\n else\n begin\n if position[L[i]]<>-2147483648 then\n begin\n position[R[i]]:=position[L[i]]+D[i];\n for j := 1 to i-1 do\n begin\n if L[j]=R[i] then \n begin\n position[R[j]]:=position[L[j]]+D[j];\n end\n else if R[j]=R[i] then\n begin\n position[L[j]]:=position[R[j]]-D[j];\n end;\n end;\n end\n else\n begin\n position[L[i]]:=position[R[i]]-D[i];\n for j := 1 to i-1 do\n begin\n if L[j]=L[i] then \n begin\n position[R[j]]:=position[L[j]]+D[j];\n end\n else if R[j]=L[i] then\n begin\n position[L[j]]:=position[R[j]]-D[j];\n end;\n end;\n end;\n end;\n end;\n end;\n if flag then \n begin\n writeln('Yes');\n end\n else \n begin\n writeln('No');\n end;\nend.", "problem_context": "Score : 400 points\n\nProblem Statement\n\nThere are N people standing on the x-axis.\nLet the coordinate of Person i be x_i.\nFor every i, x_i is an integer between 0 and 10^9 (inclusive).\nIt is possible that more than one person is standing at the same coordinate.\n\nYou will given M pieces of information regarding the positions of these people.\nThe i-th piece of information has the form (L_i, R_i, D_i).\nThis means that Person R_i is to the right of Person L_i by D_i units of distance, that is, x_{R_i} - x_{L_i} = D_i holds.\n\nIt turns out that some of these M pieces of information may be incorrect.\nDetermine if there exists a set of values (x_1, x_2, ..., x_N) that is consistent with the given pieces of information.\n\nConstraints\n\n1 \\leq N \\leq 100 000\n\n0 \\leq M \\leq 200 000\n\n1 \\leq L_i, R_i \\leq N (1 \\leq i \\leq M)\n\n0 \\leq D_i \\leq 10 000 (1 \\leq i \\leq M)\n\nL_i \\neq R_i (1 \\leq i \\leq M)\n\nIf i \\neq j, then (L_i, R_i) \\neq (L_j, R_j) and (L_i, R_i) \\neq (R_j, L_j).\n\nD_i are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nL_1 R_1 D_1\nL_2 R_2 D_2\n:\nL_M R_M D_M\n\nOutput\n\nIf there exists a set of values (x_1, x_2, ..., x_N) that is consistent with all given pieces of information, print Yes; if it does not exist, print No.\n\nSample Input 1\n\n3 3\n1 2 1\n2 3 1\n1 3 2\n\nSample Output 1\n\nYes\n\nSome possible sets of values (x_1, x_2, x_3) are (0, 1, 2) and (101, 102, 103).\n\nSample Input 2\n\n3 3\n1 2 1\n2 3 1\n1 3 5\n\nSample Output 2\n\nNo\n\nIf the first two pieces of information are correct, x_3 - x_1 = 2 holds, which is contradictory to the last piece of information.\n\nSample Input 3\n\n4 3\n2 1 1\n2 3 5\n3 4 2\n\nSample Output 3\n\nYes\n\nSample Input 4\n\n10 3\n8 7 100\n7 9 100\n9 8 100\n\nSample Output 4\n\nNo\n\nSample Input 5\n\n100 0\n\nSample Output 5\n\nYes", "sample_input": "3 3\n1 2 1\n2 3 1\n1 3 2\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p03450", "source_text": "Score : 400 points\n\nProblem Statement\n\nThere are N people standing on the x-axis.\nLet the coordinate of Person i be x_i.\nFor every i, x_i is an integer between 0 and 10^9 (inclusive).\nIt is possible that more than one person is standing at the same coordinate.\n\nYou will given M pieces of information regarding the positions of these people.\nThe i-th piece of information has the form (L_i, R_i, D_i).\nThis means that Person R_i is to the right of Person L_i by D_i units of distance, that is, x_{R_i} - x_{L_i} = D_i holds.\n\nIt turns out that some of these M pieces of information may be incorrect.\nDetermine if there exists a set of values (x_1, x_2, ..., x_N) that is consistent with the given pieces of information.\n\nConstraints\n\n1 \\leq N \\leq 100 000\n\n0 \\leq M \\leq 200 000\n\n1 \\leq L_i, R_i \\leq N (1 \\leq i \\leq M)\n\n0 \\leq D_i \\leq 10 000 (1 \\leq i \\leq M)\n\nL_i \\neq R_i (1 \\leq i \\leq M)\n\nIf i \\neq j, then (L_i, R_i) \\neq (L_j, R_j) and (L_i, R_i) \\neq (R_j, L_j).\n\nD_i are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nL_1 R_1 D_1\nL_2 R_2 D_2\n:\nL_M R_M D_M\n\nOutput\n\nIf there exists a set of values (x_1, x_2, ..., x_N) that is consistent with all given pieces of information, print Yes; if it does not exist, print No.\n\nSample Input 1\n\n3 3\n1 2 1\n2 3 1\n1 3 2\n\nSample Output 1\n\nYes\n\nSome possible sets of values (x_1, x_2, x_3) are (0, 1, 2) and (101, 102, 103).\n\nSample Input 2\n\n3 3\n1 2 1\n2 3 1\n1 3 5\n\nSample Output 2\n\nNo\n\nIf the first two pieces of information are correct, x_3 - x_1 = 2 holds, which is contradictory to the last piece of information.\n\nSample Input 3\n\n4 3\n2 1 1\n2 3 5\n3 4 2\n\nSample Output 3\n\nYes\n\nSample Input 4\n\n10 3\n8 7 100\n7 9 100\n9 8 100\n\nSample Output 4\n\nNo\n\nSample Input 5\n\n100 0\n\nSample Output 5\n\nYes", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 2104, "cpu_time_ms": 2, "memory_kb": 512}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s242629948", "group_id": "codeNet:p03452", "input_text": "var\n\tc,x:array[1..100000]of Longint;\n\tG1,G2:array[1..100000]of array of Longint;\n\tused:array[1..100000]of Boolean;\n\tn,m,i,l,r,d:Longint;\nfunction dfs(u,p:Longint):Boolean;\nvar i:Longint;\nbegin\n\tused[u]:=True;\n\tfor i:=0 to c[u]-1 do begin\n\t\tif G1[u,i]=p then continue;\n\t\tif used[G1[u,i]]and(x[G1[u,i]]<>x[u]+G2[u,i])then begin\n\t\t\tdfs:=False;\n\t\t\texit;\n\t\tend;\n\t\tif not used[G1[u,i]]then begin\n\t\t\tx[G1[u,i]]:=x[u]+G2[u,i];\n\t\t\tif not dfs(G1[u,i],u)then begin\n\t\t\t\tdfs:=False;\n\t\t\t\texit;\n\t\t\tend;\n\t\tend;\n\tend;\n\tdfs:=True;\nend;\nbegin\n\tread(n,m);\n\tfor i:=1 to m do begin\n\t\tread(l,r,d);\n\t\tinc(c[l]);inc(c[r]);\n\t\tsetlength(G1[l],c[l]);\n\t\tsetlength(G2[l],c[l]);\n\t\tsetlength(G1[r],c[r]);\n\t\tsetlength(G2[r],c[r]);\n\t\tG1[l,c[l]-1]:=r;\n\t\tG2[l,c[l]-1]:=d;\n\t\tG1[r,c[r]-1]:=l;\n\t\tG2[r,c[r]-1]:=-d;\n\tend;\n\tfor i:=1 to n do begin\n\t\tif not used[i]then begin\n\t\t\tx[i]:=0;\n\t\t\tif not dfs(i,0)then begin\n\t\t\t\twriteln('No');\n\t\t\t\texit;\n\t\t\tend;\n\t\tend;\n\tend;\n\twriteln('Yes');\nend.\n", "language": "Pascal", "metadata": {"date": 1539910856, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03452.html", "problem_id": "p03452", "resource_group": "low_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/Pascal/s242629948.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s242629948", "user_id": "u657913472"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "var\n\tc,x:array[1..100000]of Longint;\n\tG1,G2:array[1..100000]of array of Longint;\n\tused:array[1..100000]of Boolean;\n\tn,m,i,l,r,d:Longint;\nfunction dfs(u,p:Longint):Boolean;\nvar i:Longint;\nbegin\n\tused[u]:=True;\n\tfor i:=0 to c[u]-1 do begin\n\t\tif G1[u,i]=p then continue;\n\t\tif used[G1[u,i]]and(x[G1[u,i]]<>x[u]+G2[u,i])then begin\n\t\t\tdfs:=False;\n\t\t\texit;\n\t\tend;\n\t\tif not used[G1[u,i]]then begin\n\t\t\tx[G1[u,i]]:=x[u]+G2[u,i];\n\t\t\tif not dfs(G1[u,i],u)then begin\n\t\t\t\tdfs:=False;\n\t\t\t\texit;\n\t\t\tend;\n\t\tend;\n\tend;\n\tdfs:=True;\nend;\nbegin\n\tread(n,m);\n\tfor i:=1 to m do begin\n\t\tread(l,r,d);\n\t\tinc(c[l]);inc(c[r]);\n\t\tsetlength(G1[l],c[l]);\n\t\tsetlength(G2[l],c[l]);\n\t\tsetlength(G1[r],c[r]);\n\t\tsetlength(G2[r],c[r]);\n\t\tG1[l,c[l]-1]:=r;\n\t\tG2[l,c[l]-1]:=d;\n\t\tG1[r,c[r]-1]:=l;\n\t\tG2[r,c[r]-1]:=-d;\n\tend;\n\tfor i:=1 to n do begin\n\t\tif not used[i]then begin\n\t\t\tx[i]:=0;\n\t\t\tif not dfs(i,0)then begin\n\t\t\t\twriteln('No');\n\t\t\t\texit;\n\t\t\tend;\n\t\tend;\n\tend;\n\twriteln('Yes');\nend.\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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 945, "cpu_time_ms": 148, "memory_kb": 23552}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s061924779", "group_id": "codeNet:p03456", "input_text": "program Project1;\n \n{$APPTYPE CONSOLE}\n \nuses\n SysUtils,math;\nvar\n fx,g,r,a,h,w,i,j,count,x,y,sw,m,n,b,c,soeji,sum,max,k,t,z:Integer;\n l:array of Integer;\n //l,l1,l2:int64;\n s,s123,s1,s2,s3:string;\n tf:Boolean;\n //nyu:TStringList;\n c1,c2,c3:char;\nbegin\n try\n { TODO -oUser -cConsole Main : ここにコードを記述してください }\n Read(a);\n Readln(b);\n\n c:=strtoint(inttostr(a)+inttostr(b));\n\n if power(trunc(sqrt(c)),2)=c then\n Writeln('Yes')\n else\n Writeln('No');\n Readln;\n except\n on E: Exception do\n Writeln(E.ClassName, ': ', E.Message);\n end;\nend.", "language": "Pascal", "metadata": {"date": 1517426892, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03456.html", "problem_id": "p03456", "resource_group": "low_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/Pascal/s061924779.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s061924779", "user_id": "u755925739"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "program Project1;\n \n{$APPTYPE CONSOLE}\n \nuses\n SysUtils,math;\nvar\n fx,g,r,a,h,w,i,j,count,x,y,sw,m,n,b,c,soeji,sum,max,k,t,z:Integer;\n l:array of Integer;\n //l,l1,l2:int64;\n s,s123,s1,s2,s3:string;\n tf:Boolean;\n //nyu:TStringList;\n c1,c2,c3:char;\nbegin\n try\n { TODO -oUser -cConsole Main : ここにコードを記述してください }\n Read(a);\n Readln(b);\n\n c:=strtoint(inttostr(a)+inttostr(b));\n\n if power(trunc(sqrt(c)),2)=c then\n Writeln('Yes')\n else\n Writeln('No');\n Readln;\n except\n on E: Exception do\n Writeln(E.ClassName, ': ', E.Message);\n end;\nend.", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 631, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s952619290", "group_id": "codeNet:p03457", "input_text": "var\n n,i,t,x,y:longint;\n p:boolean;\nbegin\n readln(n);\n p:=true;\n for i:=1 to n do\n begin\n readln(t,x,y);\n if not(((((x+y) mod 2=0)and(t mod 2=0))or(((x+y) mod 2=1)and(t mod 2=1)))and(t>=x+y)) then begin p:=false;write('NO');break;end;\n end;\n if p then write('Yes');\nend.", "language": "Pascal", "metadata": {"date": 1586461416, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03457.html", "problem_id": "p03457", "resource_group": "low_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/Pascal/s952619290.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s952619290", "user_id": "u476418095"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "var\n n,i,t,x,y:longint;\n p:boolean;\nbegin\n readln(n);\n p:=true;\n for i:=1 to n do\n begin\n readln(t,x,y);\n if not(((((x+y) mod 2=0)and(t mod 2=0))or(((x+y) mod 2=1)and(t mod 2=1)))and(t>=x+y)) then begin p:=false;write('NO');break;end;\n end;\n if p then write('Yes');\nend.", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 28, "memory_kb": 128}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s716798714", "group_id": "codeNet:p03457", "input_text": "var\n n,i,t,x,y:longint;\n p:boolean;\nbegin\n readln(n);\n p:=true;\n for i:=1 to n do\n begin\n readln(t,x,y);\n if not(((((x+y) mod 2=0)and(t mod 2=0))or(((x+y) mod 2=1)and(t mod 2=1)))and(t<=x+y)) then begin p:=false;write('NO');break;end;\n end;\n if p then write('Yes');\nend.", "language": "Pascal", "metadata": {"date": 1586461353, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03457.html", "problem_id": "p03457", "resource_group": "low_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/Pascal/s716798714.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s716798714", "user_id": "u723721005"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "var\n n,i,t,x,y:longint;\n p:boolean;\nbegin\n readln(n);\n p:=true;\n for i:=1 to n do\n begin\n readln(t,x,y);\n if not(((((x+y) mod 2=0)and(t mod 2=0))or(((x+y) mod 2=1)and(t mod 2=1)))and(t<=x+y)) then begin p:=false;write('NO');break;end;\n end;\n if p then write('Yes');\nend.", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 28, "memory_kb": 128}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s860489899", "group_id": "codeNet:p03457", "input_text": "var n,i,t,c,o:longint;\na,b:array[0..100000]of longint;\nbegin\nreadln(n);\nfor i:=1 to n do\n begin\n read(t,c,o);\n if tt then p:=true;\n end;\n if p then writeln('No')\n else writeln('Yes');\nend.", "language": "Pascal", "metadata": {"date": 1538580198, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03457.html", "problem_id": "p03457", "resource_group": "low_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/Pascal/s868952500.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s868952500", "user_id": "u263933075"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "var\n n,i,t,x,y:longint;\n p:boolean;\nbegin\n readln(n);\n for i:=1 to n do\n begin\n readln(t,x,y);\n if x+y>t then p:=true;\n end;\n if p then writeln('No')\n else writeln('Yes');\nend.", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 26, "memory_kb": 128}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s756146378", "group_id": "codeNet:p03457", "input_text": "var\n n,x,y,x1,y1,i,t:longint;\nbegin\n readln(n);\n x:=0; y:=0;\n for i:= 1 to n do\n begin\n readln(t,x1,y1);\n if (x=x1)and(y=y1)then begin writeln('NO'); exit; end;\n if abs(x-x1)+abs(y-y1)<=t then begin x:=x1;y:=y1; end\n else\n begin\n writeln('NO');\n exit;\n end;\n end;\n writeln('Yes');\nend.", "language": "Pascal", "metadata": {"date": 1533751713, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03457.html", "problem_id": "p03457", "resource_group": "low_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/Pascal/s756146378.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s756146378", "user_id": "u723721005"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "var\n n,x,y,x1,y1,i,t:longint;\nbegin\n readln(n);\n x:=0; y:=0;\n for i:= 1 to n do\n begin\n readln(t,x1,y1);\n if (x=x1)and(y=y1)then begin writeln('NO'); exit; end;\n if abs(x-x1)+abs(y-y1)<=t then begin x:=x1;y:=y1; end\n else\n begin\n writeln('NO');\n exit;\n end;\n end;\n writeln('Yes');\nend.", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 26, "memory_kb": 128}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s971814911", "group_id": "codeNet:p03457", "input_text": "var\n n,i,a,b,t,x,y:longint;\nbegin\n readln(n);\n x:=0; y:=0;\n for i:=1 to n do\n begin\n read(t,a,b);\n if (abs(x-a)+abs(y-b)>t) or ((abs(x-a)+abs(y-b)-t) div 2=1) then\n begin\n writeln('No');\n halt;\n end;\n x:=a; y:=b;\n end;\n writeln('Yes');\nend.", "language": "Pascal", "metadata": {"date": 1526178386, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03457.html", "problem_id": "p03457", "resource_group": "low_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/Pascal/s971814911.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s971814911", "user_id": "u426964396"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "var\n n,i,a,b,t,x,y:longint;\nbegin\n readln(n);\n x:=0; y:=0;\n for i:=1 to n do\n begin\n read(t,a,b);\n if (abs(x-a)+abs(y-b)>t) or ((abs(x-a)+abs(y-b)-t) div 2=1) then\n begin\n writeln('No');\n halt;\n end;\n x:=a; y:=b;\n end;\n writeln('Yes');\nend.", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 27, "memory_kb": 128}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s440219314", "group_id": "codeNet:p03457", "input_text": "program ABC086C;\nvar\n\ti,n,t,x,y: integer;\n\tt0,x0,y0,dt,dx,dy: integer;\nbegin\n\tread(n);\n\tt:=0;\n\tx:=0;\n\ty:=0;\n\tfor i:=1 to n do begin\n\t\tread(t0);\n\t\tread(x0);\n\t\tread(y0);\n\t\tdt:=t0-t;\n\t\tdx:=x0-x;\n\t\tdy:=y0-y;\n\t\tif (dx+dy>dt) or ((dt-dx-dy) mod 2>0) then begin\n\t\t\twriteln('No');\n\t\t\texit;\n\t\tend;\n\t\tt:=t0;\n\t\tx:=x0;\n\t\ty:=y0;\n\tend;\n\twriteln('Yes');\nend.\n", "language": "Pascal", "metadata": {"date": 1522278827, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03457.html", "problem_id": "p03457", "resource_group": "low_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/Pascal/s440219314.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s440219314", "user_id": "u280667879"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "program ABC086C;\nvar\n\ti,n,t,x,y: integer;\n\tt0,x0,y0,dt,dx,dy: integer;\nbegin\n\tread(n);\n\tt:=0;\n\tx:=0;\n\ty:=0;\n\tfor i:=1 to n do begin\n\t\tread(t0);\n\t\tread(x0);\n\t\tread(y0);\n\t\tdt:=t0-t;\n\t\tdx:=x0-x;\n\t\tdy:=y0-y;\n\t\tif (dx+dy>dt) or ((dt-dx-dy) mod 2>0) then begin\n\t\t\twriteln('No');\n\t\t\texit;\n\t\tend;\n\t\tt:=t0;\n\t\tx:=x0;\n\t\ty:=y0;\n\tend;\n\twriteln('Yes');\nend.\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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 28, "memory_kb": 128}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s630453705", "group_id": "codeNet:p03457", "input_text": "var x,y:array[1..100000]of longint;\n i,j,n,tmp,lastt,lastx,lasty:longint;\nbegin\n readln(n);\n for i:=1 to 100000 do\n begin\n x[i]:=10000000;\n y[i]:=10000000;\n end;\n for i:=1 to n do\n begin\n read(tmp);\n readln(x[tmp],y[tmp]);\n end;\n for i:=1 to 100000 do\n begin\n if x[i]=10000000 then continue;\n if abs(lastx-x[i])+abs(lasty-y[i])>i-lastt then\n begin\n writeln('No'); exit;\n end;\n if ((i-lastt)-(abs(lastx-x[i])+abs(lasty-y[i]))) mod 2<>0 then\n begin\n writeln('No'); exit;\n end;\n lastt:=i;\n lastx:=x[i];\n lasty:=y[i];\n end;\n writeln('Yes');\nend.", "language": "Pascal", "metadata": {"date": 1516588512, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03457.html", "problem_id": "p03457", "resource_group": "low_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/Pascal/s630453705.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s630453705", "user_id": "u453186518"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "var x,y:array[1..100000]of longint;\n i,j,n,tmp,lastt,lastx,lasty:longint;\nbegin\n readln(n);\n for i:=1 to 100000 do\n begin\n x[i]:=10000000;\n y[i]:=10000000;\n end;\n for i:=1 to n do\n begin\n read(tmp);\n readln(x[tmp],y[tmp]);\n end;\n for i:=1 to 100000 do\n begin\n if x[i]=10000000 then continue;\n if abs(lastx-x[i])+abs(lasty-y[i])>i-lastt then\n begin\n writeln('No'); exit;\n end;\n if ((i-lastt)-(abs(lastx-x[i])+abs(lasty-y[i]))) mod 2<>0 then\n begin\n writeln('No'); exit;\n end;\n lastt:=i;\n lastx:=x[i];\n lasty:=y[i];\n end;\n writeln('Yes');\nend.", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 607, "cpu_time_ms": 29, "memory_kb": 896}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s411422514", "group_id": "codeNet:p03457", "input_text": "var\n n,x,y,t: Longint;\n x0,y0,t0: Longint;\n offset: Longint;\n offset_xy: Longint;\n even, even_T: Boolean;\n flag: Boolean;\nbegin\n flag:=true;\n x0:=0;\n y0:=0;\n t0:=0;\n even:=true;\n readln(n);\n while n>0 do\n begin\n readln(t,x,y);\n if not flag then\n begin\n dec(n);\n continue;\n end;\n if (x=x0)and(y=y0) then\n begin\n flag:=false;\n dec(n);\n continue;\n end;\n offset:=t-t0;\n if offset mod 2 = 0 then \n begin\n even_T:=true;\n end\n else \n begin\n even_T:=false;\n end;\n offset_xy:=abs(x-x0)+abs(y-y0);\n if offset_xy>offset then\n begin\n flag:=false;\n dec(n);\n continue;\n end;\n if (offset_xy mod 2 = 0)=(even xor even_T) then\n begin\n flag:=false;\n dec(n);\n continue;\n end;\n x0:=x;\n y0:=y;\n t0:=t;\n dec(n);\n end;\n \n if flag then \n begin\n writeln('Yes');\n end\n else \n begin\n writeln('No');\n end;\nend.", "language": "Pascal", "metadata": {"date": 1516588249, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03457.html", "problem_id": "p03457", "resource_group": "low_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/Pascal/s411422514.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s411422514", "user_id": "u403323882"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "var\n n,x,y,t: Longint;\n x0,y0,t0: Longint;\n offset: Longint;\n offset_xy: Longint;\n even, even_T: Boolean;\n flag: Boolean;\nbegin\n flag:=true;\n x0:=0;\n y0:=0;\n t0:=0;\n even:=true;\n readln(n);\n while n>0 do\n begin\n readln(t,x,y);\n if not flag then\n begin\n dec(n);\n continue;\n end;\n if (x=x0)and(y=y0) then\n begin\n flag:=false;\n dec(n);\n continue;\n end;\n offset:=t-t0;\n if offset mod 2 = 0 then \n begin\n even_T:=true;\n end\n else \n begin\n even_T:=false;\n end;\n offset_xy:=abs(x-x0)+abs(y-y0);\n if offset_xy>offset then\n begin\n flag:=false;\n dec(n);\n continue;\n end;\n if (offset_xy mod 2 = 0)=(even xor even_T) then\n begin\n flag:=false;\n dec(n);\n continue;\n end;\n x0:=x;\n y0:=y;\n t0:=t;\n dec(n);\n end;\n \n if flag then \n begin\n writeln('Yes');\n end\n else \n begin\n writeln('No');\n end;\nend.", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1149, "cpu_time_ms": 28, "memory_kb": 128}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s740703763", "group_id": "codeNet:p03458", "input_text": "var\n n,k,x,y,i:longint;\n c:char;\nbegin\n readln(n,k);\n for i:=1 to n do begin read(x,y);read(c);end;\n writeln(n);\n close(input);\n close(output);\nend.\n", "language": "Pascal", "metadata": {"date": 1516983089, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03458.html", "problem_id": "p03458", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03458/input.txt", "sample_output_relpath": "derived/input_output/data/p03458/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03458/Pascal/s740703763.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s740703763", "user_id": "u785022837"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "var\n n,k,x,y,i:longint;\n c:char;\nbegin\n readln(n,k);\n for i:=1 to n do begin read(x,y);read(c);end;\n writeln(n);\n close(input);\n close(output);\nend.\n", "problem_context": "Score : 500 points\n\nProblem Statement\n\nAtCoDeer is thinking of painting an infinite two-dimensional grid in a checked pattern of side K.\nHere, a checked pattern of side K is a pattern where each square is painted black or white so that each connected component of each color is a K × K square.\nBelow is an example of a checked pattern of side 3:\n\nAtCoDeer has N desires.\nThe i-th desire is represented by x_i, y_i and c_i.\nIf c_i is B, it means that he wants to paint the square (x_i,y_i) black; if c_i is W, he wants to paint the square (x_i,y_i) white.\nAt most how many desires can he satisfy at the same time?\n\nConstraints\n\n1 ≤ N ≤ 10^5\n\n1 ≤ K ≤ 1000\n\n0 ≤ x_i ≤ 10^9\n\n0 ≤ y_i ≤ 10^9\n\nIf i ≠ j, then (x_i,y_i) ≠ (x_j,y_j).\n\nc_i is B or W.\n\nN, K, x_i and y_i are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nx_1 y_1 c_1\nx_2 y_2 c_2\n:\nx_N y_N c_N\n\nOutput\n\nPrint the maximum number of desires that can be satisfied at the same time.\n\nSample Input 1\n\n4 3\n0 1 W\n1 2 W\n5 3 B\n5 4 B\n\nSample Output 1\n\n4\n\nHe can satisfy all his desires by painting as shown in the example above.\n\nSample Input 2\n\n2 1000\n0 0 B\n0 1 W\n\nSample Output 2\n\n2\n\nSample Input 3\n\n6 2\n1 2 B\n2 1 W\n2 2 B\n1 0 B\n0 6 W\n4 5 W\n\nSample Output 3\n\n4", "sample_input": "4 3\n0 1 W\n1 2 W\n5 3 B\n5 4 B\n"}, "reference_outputs": ["4\n"], "source_document_id": "p03458", "source_text": "Score : 500 points\n\nProblem Statement\n\nAtCoDeer is thinking of painting an infinite two-dimensional grid in a checked pattern of side K.\nHere, a checked pattern of side K is a pattern where each square is painted black or white so that each connected component of each color is a K × K square.\nBelow is an example of a checked pattern of side 3:\n\nAtCoDeer has N desires.\nThe i-th desire is represented by x_i, y_i and c_i.\nIf c_i is B, it means that he wants to paint the square (x_i,y_i) black; if c_i is W, he wants to paint the square (x_i,y_i) white.\nAt most how many desires can he satisfy at the same time?\n\nConstraints\n\n1 ≤ N ≤ 10^5\n\n1 ≤ K ≤ 1000\n\n0 ≤ x_i ≤ 10^9\n\n0 ≤ y_i ≤ 10^9\n\nIf i ≠ j, then (x_i,y_i) ≠ (x_j,y_j).\n\nc_i is B or W.\n\nN, K, x_i and y_i are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nx_1 y_1 c_1\nx_2 y_2 c_2\n:\nx_N y_N c_N\n\nOutput\n\nPrint the maximum number of desires that can be satisfied at the same time.\n\nSample Input 1\n\n4 3\n0 1 W\n1 2 W\n5 3 B\n5 4 B\n\nSample Output 1\n\n4\n\nHe can satisfy all his desires by painting as shown in the example above.\n\nSample Input 2\n\n2 1000\n0 0 B\n0 1 W\n\nSample Output 2\n\n2\n\nSample Input 3\n\n6 2\n1 2 B\n2 1 W\n2 2 B\n1 0 B\n0 6 W\n4 5 W\n\nSample Output 3\n\n4", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 7, "memory_kb": 128}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s748021845", "group_id": "codeNet:p03459", "input_text": "var\n\tN,i,t,x,y,d,nx,ny,nt:Longint;\nbegin\n\tread(N);\n\tfor i:=1 to N do begin\n\t\tread(t,x,y);\n\t\td:=0;\n\t\tif x>nx then inc(d,x-nx)else inc(d,nx-x);\n\t\tif y>ny then inc(d,y-ny)else inc(d,ny-y);\n\t\tif(d mod 2<>(t-nt)mod 2)or(d>t-nt)then begin\n\t\t\twriteln('No');\n\t\t\texit;\n\t\tend;\n\t\tnt:=t;\n\t\tnx:=x;\n\t\tny:=y;\n\tend;\n\twriteln('Yes');\nend.\n", "language": "Pascal", "metadata": {"date": 1582186033, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03459.html", "problem_id": "p03459", "resource_group": "low_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/Pascal/s748021845.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s748021845", "user_id": "u657913472"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "var\n\tN,i,t,x,y,d,nx,ny,nt:Longint;\nbegin\n\tread(N);\n\tfor i:=1 to N do begin\n\t\tread(t,x,y);\n\t\td:=0;\n\t\tif x>nx then inc(d,x-nx)else inc(d,nx-x);\n\t\tif y>ny then inc(d,y-ny)else inc(d,ny-y);\n\t\tif(d mod 2<>(t-nt)mod 2)or(d>t-nt)then begin\n\t\t\twriteln('No');\n\t\t\texit;\n\t\tend;\n\t\tnt:=t;\n\t\tnx:=x;\n\t\tny:=y;\n\tend;\n\twriteln('Yes');\nend.\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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 28, "memory_kb": 128}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s436952573", "group_id": "codeNet:p03460", "input_text": "var\n\tn,k,ans,now,i,j,x,y:Longint;\n\tc:Char;\n\tw:array[0..4000,0..4000]of Longint;\nfunction f(u,v:Longint):Longint;\nbegin\n\tf:=w[u+k,v+k]-w[u,v+k]-w[u+k,v]+w[u,v];\nend;\nbegin\n\tread(n,k);\n\tfor i:=1 to n do begin\n\t\tread(x,y,c,c);\n\t\tif c='B' then inc(x,k);\n\t\tx:=x mod(2*k);\n\t\ty:=y mod(2*k);\n\t\tinc(w[x+1+k,y+1+k]);\n\tend;\n\tfor i:=1 to 4*k do for j:=1 to 4*k do inc(w[i,j],w[i-1,j]+w[i,j-1]-w[i-1,j-1]);\n\tfor i:=0 to k-1 do for j:=0 to k-1 do begin\n\t\tnow:=f(i,j)+f(i+k,j+k)+f(i+2*k,j)+f(i,j+2*k)+f(i+2*k,j+2*k);\n\t\tif now>ans then ans:=now;\n\t\tnow:=f(i+k,j)+f(i,j+k)+f(i+2*k,j+k)+f(i+k,j+2*k);\n\t\tif now>ans then ans:=now;\n\tend;\n\twriteln(ans);\nend.\n", "language": "Pascal", "metadata": {"date": 1539906264, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03460.html", "problem_id": "p03460", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03460/input.txt", "sample_output_relpath": "derived/input_output/data/p03460/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03460/Pascal/s436952573.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s436952573", "user_id": "u657913472"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "var\n\tn,k,ans,now,i,j,x,y:Longint;\n\tc:Char;\n\tw:array[0..4000,0..4000]of Longint;\nfunction f(u,v:Longint):Longint;\nbegin\n\tf:=w[u+k,v+k]-w[u,v+k]-w[u+k,v]+w[u,v];\nend;\nbegin\n\tread(n,k);\n\tfor i:=1 to n do begin\n\t\tread(x,y,c,c);\n\t\tif c='B' then inc(x,k);\n\t\tx:=x mod(2*k);\n\t\ty:=y mod(2*k);\n\t\tinc(w[x+1+k,y+1+k]);\n\tend;\n\tfor i:=1 to 4*k do for j:=1 to 4*k do inc(w[i,j],w[i-1,j]+w[i,j-1]-w[i-1,j-1]);\n\tfor i:=0 to k-1 do for j:=0 to k-1 do begin\n\t\tnow:=f(i,j)+f(i+k,j+k)+f(i+2*k,j)+f(i,j+2*k)+f(i+2*k,j+2*k);\n\t\tif now>ans then ans:=now;\n\t\tnow:=f(i+k,j)+f(i,j+k)+f(i+2*k,j+k)+f(i+k,j+2*k);\n\t\tif now>ans then ans:=now;\n\tend;\n\twriteln(ans);\nend.\n", "problem_context": "Score : 500 points\n\nProblem Statement\n\nAtCoDeer is thinking of painting an infinite two-dimensional grid in a checked pattern of side K.\nHere, a checked pattern of side K is a pattern where each square is painted black or white so that each connected component of each color is a K × K square.\nBelow is an example of a checked pattern of side 3:\n\nAtCoDeer has N desires.\nThe i-th desire is represented by x_i, y_i and c_i.\nIf c_i is B, it means that he wants to paint the square (x_i,y_i) black; if c_i is W, he wants to paint the square (x_i,y_i) white.\nAt most how many desires can he satisfy at the same time?\n\nConstraints\n\n1 ≤ N ≤ 10^5\n\n1 ≤ K ≤ 1000\n\n0 ≤ x_i ≤ 10^9\n\n0 ≤ y_i ≤ 10^9\n\nIf i ≠ j, then (x_i,y_i) ≠ (x_j,y_j).\n\nc_i is B or W.\n\nN, K, x_i and y_i are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nx_1 y_1 c_1\nx_2 y_2 c_2\n:\nx_N y_N c_N\n\nOutput\n\nPrint the maximum number of desires that can be satisfied at the same time.\n\nSample Input 1\n\n4 3\n0 1 W\n1 2 W\n5 3 B\n5 4 B\n\nSample Output 1\n\n4\n\nHe can satisfy all his desires by painting as shown in the example above.\n\nSample Input 2\n\n2 1000\n0 0 B\n0 1 W\n\nSample Output 2\n\n2\n\nSample Input 3\n\n6 2\n1 2 B\n2 1 W\n2 2 B\n1 0 B\n0 6 W\n4 5 W\n\nSample Output 3\n\n4", "sample_input": "4 3\n0 1 W\n1 2 W\n5 3 B\n5 4 B\n"}, "reference_outputs": ["4\n"], "source_document_id": "p03460", "source_text": "Score : 500 points\n\nProblem Statement\n\nAtCoDeer is thinking of painting an infinite two-dimensional grid in a checked pattern of side K.\nHere, a checked pattern of side K is a pattern where each square is painted black or white so that each connected component of each color is a K × K square.\nBelow is an example of a checked pattern of side 3:\n\nAtCoDeer has N desires.\nThe i-th desire is represented by x_i, y_i and c_i.\nIf c_i is B, it means that he wants to paint the square (x_i,y_i) black; if c_i is W, he wants to paint the square (x_i,y_i) white.\nAt most how many desires can he satisfy at the same time?\n\nConstraints\n\n1 ≤ N ≤ 10^5\n\n1 ≤ K ≤ 1000\n\n0 ≤ x_i ≤ 10^9\n\n0 ≤ y_i ≤ 10^9\n\nIf i ≠ j, then (x_i,y_i) ≠ (x_j,y_j).\n\nc_i is B or W.\n\nN, K, x_i and y_i are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\nx_1 y_1 c_1\nx_2 y_2 c_2\n:\nx_N y_N c_N\n\nOutput\n\nPrint the maximum number of desires that can be satisfied at the same time.\n\nSample Input 1\n\n4 3\n0 1 W\n1 2 W\n5 3 B\n5 4 B\n\nSample Output 1\n\n4\n\nHe can satisfy all his desires by painting as shown in the example above.\n\nSample Input 2\n\n2 1000\n0 0 B\n0 1 W\n\nSample Output 2\n\n2\n\nSample Input 3\n\n6 2\n1 2 B\n2 1 W\n2 2 B\n1 0 B\n0 6 W\n4 5 W\n\nSample Output 3\n\n4", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 636, "cpu_time_ms": 147, "memory_kb": 62592}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s242437761", "group_id": "codeNet:p03464", "input_text": "var n:longint;\n max,x,min:int64;\n a:array[0..150000]of longint;\n i:longint;\nbegin\n read(n);\n for i:=1 to n do\n read(a[i]);\n if a[n]<>2 then\n begin\n writeln(-1);\n exit;\n end;\n a[0]:=1;\n max:=2;\n min:=2;\n for i:=n-1 downto 1 do\n begin\n x:=(max*2-1) div a[i];\n if (x=0)or((((max+a[i+1]-1) div a[i])-((max-1) div a[i])=0)and(a[i+1]<>1)) then\n begin\n writeln(-1);\n exit;\n end else max:=x*a[i];\n x:=min div a[i];\n if min mod a[i]=0 then min:=x*a[i] else min:=(x+1)*a[i];\n end;\n writeln(min,' ',max+a[1]-1);\nend.", "language": "Pascal", "metadata": {"date": 1515992207, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03464.html", "problem_id": "p03464", "resource_group": "low_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/Pascal/s242437761.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s242437761", "user_id": "u809476955"}, "prompt_components": {"gold_output": "6 8\n", "input_to_evaluate": "var n:longint;\n max,x,min:int64;\n a:array[0..150000]of longint;\n i:longint;\nbegin\n read(n);\n for i:=1 to n do\n read(a[i]);\n if a[n]<>2 then\n begin\n writeln(-1);\n exit;\n end;\n a[0]:=1;\n max:=2;\n min:=2;\n for i:=n-1 downto 1 do\n begin\n x:=(max*2-1) div a[i];\n if (x=0)or((((max+a[i+1]-1) div a[i])-((max-1) div a[i])=0)and(a[i+1]<>1)) then\n begin\n writeln(-1);\n exit;\n end else max:=x*a[i];\n x:=min div a[i];\n if min mod a[i]=0 then min:=x*a[i] else min:=(x+1)*a[i];\n end;\n writeln(min,' ',max+a[1]-1);\nend.", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 19, "memory_kb": 512}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s829243434", "group_id": "codeNet:p03465", "input_text": "program V8122A;\n var\n f:Array[0..125001] of int64;\n a,b:Array[0..2001] of longint;\n i,j,n,p,s:longint;\n t:int64;\n begin\n readln(n);\n s:=0;\n for i:=1 to n do\n begin\n read(A[i]);\n b[i]:=a[i] mod 30;\n inc(s,a[i]);\n end;\n readln;\n t:=2<<30-1;\n //writeln(t);\n fillqword(f,sizeof(f)>>4,0);\n f[1]:=1;\n for i:=1 to n do\n for j:=s div 30+1 downto a[i] div 30+1 do\n f[j]:=(f[j-a[i] div 30]<<(b[i])) and t or f[j];\n p:=0;\n for i:=1 to s div 30+1 do\n for j:=1 to 30 do\n if ((1<<(j-1)) and f[i]=1<<(j-1)) and ((i-1)*30+j-1<=s>>1) then p:=(i-1)*30+j-1;\n writeln(s-p);\n end.\n", "language": "Pascal", "metadata": {"date": 1516642237, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03465.html", "problem_id": "p03465", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03465/input.txt", "sample_output_relpath": "derived/input_output/data/p03465/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03465/Pascal/s829243434.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s829243434", "user_id": "u816631826"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "program V8122A;\n var\n f:Array[0..125001] of int64;\n a,b:Array[0..2001] of longint;\n i,j,n,p,s:longint;\n t:int64;\n begin\n readln(n);\n s:=0;\n for i:=1 to n do\n begin\n read(A[i]);\n b[i]:=a[i] mod 30;\n inc(s,a[i]);\n end;\n readln;\n t:=2<<30-1;\n //writeln(t);\n fillqword(f,sizeof(f)>>4,0);\n f[1]:=1;\n for i:=1 to n do\n for j:=s div 30+1 downto a[i] div 30+1 do\n f[j]:=(f[j-a[i] div 30]<<(b[i])) and t or f[j];\n p:=0;\n for i:=1 to s div 30+1 do\n for j:=1 to 30 do\n if ((1<<(j-1)) and f[i]=1<<(j-1)) and ((i-1)*30+j-1<=s>>1) then p:=(i-1)*30+j-1;\n writeln(s-p);\n end.\n", "problem_context": "Score : 700 points\n\nProblem Statement\n\nYou are given N integers A_1, A_2, ..., A_N.\n\nConsider the sums of all non-empty subsequences of A. There are 2^N - 1 such sums, an odd number.\n\nLet the list of these sums in non-decreasing order be S_1, S_2, ..., S_{2^N - 1}.\n\nFind the median of this list, S_{2^{N-1}}.\n\nConstraints\n\n1 \\leq N \\leq 2000\n\n1 \\leq A_i \\leq 2000\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\n\nOutput\n\nPrint the median of the sorted list of the sums of all non-empty subsequences of A.\n\nSample Input 1\n\n3\n1 2 1\n\nSample Output 1\n\n2\n\nIn this case, S = (1, 1, 2, 2, 3, 3, 4). Its median is S_4 = 2.\n\nSample Input 2\n\n1\n58\n\nSample Output 2\n\n58\n\nIn this case, S = (58).", "sample_input": "3\n1 2 1\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03465", "source_text": "Score : 700 points\n\nProblem Statement\n\nYou are given N integers A_1, A_2, ..., A_N.\n\nConsider the sums of all non-empty subsequences of A. There are 2^N - 1 such sums, an odd number.\n\nLet the list of these sums in non-decreasing order be S_1, S_2, ..., S_{2^N - 1}.\n\nFind the median of this list, S_{2^{N-1}}.\n\nConstraints\n\n1 \\leq N \\leq 2000\n\n1 \\leq A_i \\leq 2000\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\n\nOutput\n\nPrint the median of the sorted list of the sums of all non-empty subsequences of A.\n\nSample Input 1\n\n3\n1 2 1\n\nSample Output 1\n\n2\n\nIn this case, S = (1, 1, 2, 2, 3, 3, 4). Its median is S_4 = 2.\n\nSample Input 2\n\n1\n58\n\nSample Output 2\n\n58\n\nIn this case, S = (58).", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 2103, "memory_kb": 1024}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s047867970", "group_id": "codeNet:p03469", "input_text": "program Project1;\n\n{$APPTYPE CONSOLE}\n\nuses\n SysUtils;\nvar\n a:string;\nbegin\n try\n { TODO -oUser -cConsole メイン : ここにコードを記述してください }\n Readln(a);\n\n a[4]:='8';\n Writeln(a);\n Readln;\n except\n on E: Exception do\n Writeln(E.ClassName, ': ', E.Message);\n end;\nend.\n", "language": "Pascal", "metadata": {"date": 1515377008, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03469.html", "problem_id": "p03469", "resource_group": "low_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/Pascal/s047867970.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s047867970", "user_id": "u755925739"}, "prompt_components": {"gold_output": "2018/01/07\n", "input_to_evaluate": "program Project1;\n\n{$APPTYPE CONSOLE}\n\nuses\n SysUtils;\nvar\n a:string;\nbegin\n try\n { TODO -oUser -cConsole メイン : ここにコードを記述してください }\n Readln(a);\n\n a[4]:='8';\n Writeln(a);\n Readln;\n except\n on E: Exception do\n Writeln(E.ClassName, ': ', E.Message);\n end;\nend.\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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 1, "memory_kb": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s621890873", "group_id": "codeNet:p03473", "input_text": "program Project1;\n\n{$APPTYPE CONSOLE}\n\nuses\n SysUtils;\nvar\n m:integer;\nbegin\n try\n { TODO -oUser -cConsole Main : abc84a}\n readln(m);\n Writeln(48-m);\n readln;\n except\n on E: Exception do\n Writeln(E.ClassName, ': ', E.Message);\n end;\nend.\n", "language": "Pascal", "metadata": {"date": 1515711295, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03473.html", "problem_id": "p03473", "resource_group": "low_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/Pascal/s621890873.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s621890873", "user_id": "u755925739"}, "prompt_components": {"gold_output": "27\n", "input_to_evaluate": "program Project1;\n\n{$APPTYPE CONSOLE}\n\nuses\n SysUtils;\nvar\n m:integer;\nbegin\n try\n { TODO -oUser -cConsole Main : abc84a}\n readln(m);\n Writeln(48-m);\n readln;\n except\n on E: Exception do\n Writeln(E.ClassName, ': ', E.Message);\n end;\nend.\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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s531838689", "group_id": "codeNet:p03474", "input_text": "program Project1;\n\n{$APPTYPE CONSOLE}\n\nuses\n SysUtils;\nvar\n a,b,i:integer;\n s,ans:string;\nbegin\n try\n { TODO -oUser -cConsole Main : abc84a}\n read(a);\n readln(b);\n readln(s);\n\n ans:='Yes';\n if not(s[a+1]='-') then\n ans:='No'\n else begin\n for i := 1 to a do\n if s[i]='-' then begin\n ans:='No';\n break;\n end;\n for i := a+2 to Length(s) do\n if s[i]='-' then begin\n ans:='No';\n break;\n end;\n end;\n\n Writeln(ans);\n readln;\n except\n on E: Exception do\n Writeln(E.ClassName, ': ', E.Message);\n end;\nend.\n", "language": "Pascal", "metadata": {"date": 1515711281, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03474.html", "problem_id": "p03474", "resource_group": "low_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/Pascal/s531838689.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s531838689", "user_id": "u755925739"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "program Project1;\n\n{$APPTYPE CONSOLE}\n\nuses\n SysUtils;\nvar\n a,b,i:integer;\n s,ans:string;\nbegin\n try\n { TODO -oUser -cConsole Main : abc84a}\n read(a);\n readln(b);\n readln(s);\n\n ans:='Yes';\n if not(s[a+1]='-') then\n ans:='No'\n else begin\n for i := 1 to a do\n if s[i]='-' then begin\n ans:='No';\n break;\n end;\n for i := a+2 to Length(s) do\n if s[i]='-' then begin\n ans:='No';\n break;\n end;\n end;\n\n Writeln(ans);\n readln;\n except\n on E: Exception do\n Writeln(E.ClassName, ': ', E.Message);\n end;\nend.\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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 620, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s941793310", "group_id": "codeNet:p03475", "input_text": "var\n\tn,ans,i,j:Longint;\n\tc,s,f:array[1..499]of Longint;\nbegin\n\tread(n);\n\tfor i:=1 to n-1 do read(c[i],s[i],f[i]);\n\tfor i:=1 to n-1 do begin\n\t\tans:=0;\n\t\tfor j:=i to n-1 do begin\n\t\t\tif ansb then exit(a) else exit(b);\nend;\nbegin\n read(n);\n for i:=1 to n-1 do\n read(c[i],s[i],f[i]);\n for i:=1 to n do\n begin\n x:=s[i];\n for j:=i to n-1 do\n begin\n z:=(x-s[j]);\n if z mod f[j]<>0 then\n begin\n z:=(f[j]-(z mod f[j]));\n end else Z:=0;\n if x<=s[j] then\n begin\n x:=s[j]+c[j];\n end else\n begin\n x:=x+z+c[j];\n end;\n //writeln('i=',i,' ',x);\n end;\n writeln(x);\n end;\nend.\n\n\n", "language": "Pascal", "metadata": {"date": 1514688933, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03475.html", "problem_id": "p03475", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03475/input.txt", "sample_output_relpath": "derived/input_output/data/p03475/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03475/Pascal/s629241322.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s629241322", "user_id": "u165920140"}, "prompt_components": {"gold_output": "12\n11\n0\n", "input_to_evaluate": "var n,i,j:longint;\n x,z:longint;\n f,c,s:array[0..1000000]of longint;\nfunction max(a,b:longint):longint;\nbegin\n if a>b then exit(a) else exit(b);\nend;\nbegin\n read(n);\n for i:=1 to n-1 do\n read(c[i],s[i],f[i]);\n for i:=1 to n do\n begin\n x:=s[i];\n for j:=i to n-1 do\n begin\n z:=(x-s[j]);\n if z mod f[j]<>0 then\n begin\n z:=(f[j]-(z mod f[j]));\n end else Z:=0;\n if x<=s[j] then\n begin\n x:=s[j]+c[j];\n end else\n begin\n x:=x+z+c[j];\n end;\n //writeln('i=',i,' ',x);\n end;\n writeln(x);\n end;\nend.\n\n\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nA railroad running from west to east in Atcoder Kingdom is now complete.\n\nThere are N stations on the railroad, numbered 1 through N from west to east.\n\nTomorrow, the opening ceremony of the railroad will take place.\n\nOn this railroad, for each integer i such that 1≤i≤N-1, there will be trains that run from Station i to Station i+1 in C_i seconds. No other trains will be operated.\n\nThe first train from Station i to Station i+1 will depart Station i S_i seconds after the ceremony begins. Thereafter, there will be a train that departs Station i every F_i seconds.\n\nHere, it is guaranteed that F_i divides S_i.\n\nThat is, for each Time t satisfying S_i≤t and t％F_i=0, there will be a train that departs Station i t seconds after the ceremony begins and arrives at Station i+1 t+C_i seconds after the ceremony begins, where A％B denotes A modulo B, and there will be no other trains.\n\nFor each i, find the earliest possible time we can reach Station N if we are at Station i when the ceremony begins, ignoring the time needed to change trains.\n\nConstraints\n\n1≤N≤500\n\n1≤C_i≤100\n\n1≤S_i≤10^5\n\n1≤F_i≤10\n\nS_i％F_i=0\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nC_1 S_1 F_1\n:\nC_{N-1} S_{N-1} F_{N-1}\n\nOutput\n\nPrint N lines. Assuming that we are at Station i (1≤i≤N) when the ceremony begins, if the earliest possible time we can reach Station N is x seconds after the ceremony begins, the i-th line should contain x.\n\nSample Input 1\n\n3\n6 5 1\n1 10 1\n\nSample Output 1\n\n12\n11\n0\n\nWe will travel from Station 1 as follows:\n\n5 seconds after the beginning: take the train to Station 2.\n\n11 seconds: arrive at Station 2.\n\n11 seconds: take the train to Station 3.\n\n12 seconds: arrive at Station 3.\n\nWe will travel from Station 2 as follows:\n\n10 seconds: take the train to Station 3.\n\n11 seconds: arrive at Station 3.\n\nNote that we should print 0 for Station 3.\n\nSample Input 2\n\n4\n12 24 6\n52 16 4\n99 2 2\n\nSample Output 2\n\n187\n167\n101\n0\n\nSample Input 3\n\n4\n12 13 1\n44 17 17\n66 4096 64\n\nSample Output 3\n\n4162\n4162\n4162\n0", "sample_input": "3\n6 5 1\n1 10 1\n"}, "reference_outputs": ["12\n11\n0\n"], "source_document_id": "p03475", "source_text": "Score : 300 points\n\nProblem Statement\n\nA railroad running from west to east in Atcoder Kingdom is now complete.\n\nThere are N stations on the railroad, numbered 1 through N from west to east.\n\nTomorrow, the opening ceremony of the railroad will take place.\n\nOn this railroad, for each integer i such that 1≤i≤N-1, there will be trains that run from Station i to Station i+1 in C_i seconds. No other trains will be operated.\n\nThe first train from Station i to Station i+1 will depart Station i S_i seconds after the ceremony begins. Thereafter, there will be a train that departs Station i every F_i seconds.\n\nHere, it is guaranteed that F_i divides S_i.\n\nThat is, for each Time t satisfying S_i≤t and t％F_i=0, there will be a train that departs Station i t seconds after the ceremony begins and arrives at Station i+1 t+C_i seconds after the ceremony begins, where A％B denotes A modulo B, and there will be no other trains.\n\nFor each i, find the earliest possible time we can reach Station N if we are at Station i when the ceremony begins, ignoring the time needed to change trains.\n\nConstraints\n\n1≤N≤500\n\n1≤C_i≤100\n\n1≤S_i≤10^5\n\n1≤F_i≤10\n\nS_i％F_i=0\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nC_1 S_1 F_1\n:\nC_{N-1} S_{N-1} F_{N-1}\n\nOutput\n\nPrint N lines. Assuming that we are at Station i (1≤i≤N) when the ceremony begins, if the earliest possible time we can reach Station N is x seconds after the ceremony begins, the i-th line should contain x.\n\nSample Input 1\n\n3\n6 5 1\n1 10 1\n\nSample Output 1\n\n12\n11\n0\n\nWe will travel from Station 1 as follows:\n\n5 seconds after the beginning: take the train to Station 2.\n\n11 seconds: arrive at Station 2.\n\n11 seconds: take the train to Station 3.\n\n12 seconds: arrive at Station 3.\n\nWe will travel from Station 2 as follows:\n\n10 seconds: take the train to Station 3.\n\n11 seconds: arrive at Station 3.\n\nNote that we should print 0 for Station 3.\n\nSample Input 2\n\n4\n12 24 6\n52 16 4\n99 2 2\n\nSample Output 2\n\n187\n167\n101\n0\n\nSample Input 3\n\n4\n12 13 1\n44 17 17\n66 4096 64\n\nSample Output 3\n\n4162\n4162\n4162\n0", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 4, "memory_kb": 4224}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s781384774", "group_id": "codeNet:p03475", "input_text": "var n,i,j:longint;\n x,z:longint;\n f,c,s:array[0..1000000]of longint;\nfunction max(a,b:longint):longint;\nbegin\n if a>b then exit(a) else exit(b);\nend;\nbegin\n read(n);\n for i:=1 to n-1 do\n read(c[i],s[i],f[i]);\n for i:=1 to n do\n begin\n x:=s[i];\n for j:=i to n-1 do\n begin\n z:=(x-s[j]);\n if z mod f[j]<>0 then\n begin\n z:=z+(f[j]-(z mod f[j]));\n end else Z:=0;\n x:=max(x+c[j],s[j]+c[j]);\n if x=s[j]+C[j] then z:=0;\n x:=x+z;\n //writeln('i=',i,' ',x);\n end;\n writeln(x);\n end;\nend.\n\n\n", "language": "Pascal", "metadata": {"date": 1514688483, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03475.html", "problem_id": "p03475", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03475/input.txt", "sample_output_relpath": "derived/input_output/data/p03475/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03475/Pascal/s781384774.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s781384774", "user_id": "u165920140"}, "prompt_components": {"gold_output": "12\n11\n0\n", "input_to_evaluate": "var n,i,j:longint;\n x,z:longint;\n f,c,s:array[0..1000000]of longint;\nfunction max(a,b:longint):longint;\nbegin\n if a>b then exit(a) else exit(b);\nend;\nbegin\n read(n);\n for i:=1 to n-1 do\n read(c[i],s[i],f[i]);\n for i:=1 to n do\n begin\n x:=s[i];\n for j:=i to n-1 do\n begin\n z:=(x-s[j]);\n if z mod f[j]<>0 then\n begin\n z:=z+(f[j]-(z mod f[j]));\n end else Z:=0;\n x:=max(x+c[j],s[j]+c[j]);\n if x=s[j]+C[j] then z:=0;\n x:=x+z;\n //writeln('i=',i,' ',x);\n end;\n writeln(x);\n end;\nend.\n\n\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nA railroad running from west to east in Atcoder Kingdom is now complete.\n\nThere are N stations on the railroad, numbered 1 through N from west to east.\n\nTomorrow, the opening ceremony of the railroad will take place.\n\nOn this railroad, for each integer i such that 1≤i≤N-1, there will be trains that run from Station i to Station i+1 in C_i seconds. No other trains will be operated.\n\nThe first train from Station i to Station i+1 will depart Station i S_i seconds after the ceremony begins. Thereafter, there will be a train that departs Station i every F_i seconds.\n\nHere, it is guaranteed that F_i divides S_i.\n\nThat is, for each Time t satisfying S_i≤t and t％F_i=0, there will be a train that departs Station i t seconds after the ceremony begins and arrives at Station i+1 t+C_i seconds after the ceremony begins, where A％B denotes A modulo B, and there will be no other trains.\n\nFor each i, find the earliest possible time we can reach Station N if we are at Station i when the ceremony begins, ignoring the time needed to change trains.\n\nConstraints\n\n1≤N≤500\n\n1≤C_i≤100\n\n1≤S_i≤10^5\n\n1≤F_i≤10\n\nS_i％F_i=0\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nC_1 S_1 F_1\n:\nC_{N-1} S_{N-1} F_{N-1}\n\nOutput\n\nPrint N lines. Assuming that we are at Station i (1≤i≤N) when the ceremony begins, if the earliest possible time we can reach Station N is x seconds after the ceremony begins, the i-th line should contain x.\n\nSample Input 1\n\n3\n6 5 1\n1 10 1\n\nSample Output 1\n\n12\n11\n0\n\nWe will travel from Station 1 as follows:\n\n5 seconds after the beginning: take the train to Station 2.\n\n11 seconds: arrive at Station 2.\n\n11 seconds: take the train to Station 3.\n\n12 seconds: arrive at Station 3.\n\nWe will travel from Station 2 as follows:\n\n10 seconds: take the train to Station 3.\n\n11 seconds: arrive at Station 3.\n\nNote that we should print 0 for Station 3.\n\nSample Input 2\n\n4\n12 24 6\n52 16 4\n99 2 2\n\nSample Output 2\n\n187\n167\n101\n0\n\nSample Input 3\n\n4\n12 13 1\n44 17 17\n66 4096 64\n\nSample Output 3\n\n4162\n4162\n4162\n0", "sample_input": "3\n6 5 1\n1 10 1\n"}, "reference_outputs": ["12\n11\n0\n"], "source_document_id": "p03475", "source_text": "Score : 300 points\n\nProblem Statement\n\nA railroad running from west to east in Atcoder Kingdom is now complete.\n\nThere are N stations on the railroad, numbered 1 through N from west to east.\n\nTomorrow, the opening ceremony of the railroad will take place.\n\nOn this railroad, for each integer i such that 1≤i≤N-1, there will be trains that run from Station i to Station i+1 in C_i seconds. No other trains will be operated.\n\nThe first train from Station i to Station i+1 will depart Station i S_i seconds after the ceremony begins. Thereafter, there will be a train that departs Station i every F_i seconds.\n\nHere, it is guaranteed that F_i divides S_i.\n\nThat is, for each Time t satisfying S_i≤t and t％F_i=0, there will be a train that departs Station i t seconds after the ceremony begins and arrives at Station i+1 t+C_i seconds after the ceremony begins, where A％B denotes A modulo B, and there will be no other trains.\n\nFor each i, find the earliest possible time we can reach Station N if we are at Station i when the ceremony begins, ignoring the time needed to change trains.\n\nConstraints\n\n1≤N≤500\n\n1≤C_i≤100\n\n1≤S_i≤10^5\n\n1≤F_i≤10\n\nS_i％F_i=0\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nC_1 S_1 F_1\n:\nC_{N-1} S_{N-1} F_{N-1}\n\nOutput\n\nPrint N lines. Assuming that we are at Station i (1≤i≤N) when the ceremony begins, if the earliest possible time we can reach Station N is x seconds after the ceremony begins, the i-th line should contain x.\n\nSample Input 1\n\n3\n6 5 1\n1 10 1\n\nSample Output 1\n\n12\n11\n0\n\nWe will travel from Station 1 as follows:\n\n5 seconds after the beginning: take the train to Station 2.\n\n11 seconds: arrive at Station 2.\n\n11 seconds: take the train to Station 3.\n\n12 seconds: arrive at Station 3.\n\nWe will travel from Station 2 as follows:\n\n10 seconds: take the train to Station 3.\n\n11 seconds: arrive at Station 3.\n\nNote that we should print 0 for Station 3.\n\nSample Input 2\n\n4\n12 24 6\n52 16 4\n99 2 2\n\nSample Output 2\n\n187\n167\n101\n0\n\nSample Input 3\n\n4\n12 13 1\n44 17 17\n66 4096 64\n\nSample Output 3\n\n4162\n4162\n4162\n0", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 558, "cpu_time_ms": 5, "memory_kb": 4224}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s846859174", "group_id": "codeNet:p03475", "input_text": "var n,i,j,ans,num,now:longint;\nvar c,s,f:array[0..1020] of longint;\nbegin\n read(n);\n for i:=1 to n-1 do read(c[i],s[i],f[i]);\n for i:=1 to n-1 do\n begin\n ans:=s[i]+c[i];now:=i+1;\n while now=ans then begin ans:=s[now]+c[now];inc(now);continue;end;\n if s[now]=ans then begin ans:=s[now]+c[now];inc(now);continue;end;\n if s[now]max then max:=r[i];\n if l[i]>max then max:=l[i];\n end;\n fillchar(p,sizeof(p),true);\n p[1]:=false;\n for i:=2 to trunc(sqrt(max)) do \n if p[i] then \n for j:=2 to max div i do p[i*j]:=false;\n for i:=1 to n do \n for j:=l[i] to r[i] do \n if (p[j]) and (p[(j+1) div 2]) then inc(s[i]);\n for i:=1 to n do writeln(s[i]);\nend.\n ", "language": "Pascal", "metadata": {"date": 1546996921, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03476.html", "problem_id": "p03476", "resource_group": "low_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/Pascal/s095304151.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s095304151", "user_id": "u476418095"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "var\n i,j,n,max:longint;\n p:array[1..100000] of boolean;\n s,l,r:array[1..100000] of longint;\nbegin\n readln(n);\n for i:=1 to n do \n begin\n readln(l[i],r[i]);\n if r[i]>max then max:=r[i];\n if l[i]>max then max:=l[i];\n end;\n fillchar(p,sizeof(p),true);\n p[1]:=false;\n for i:=2 to trunc(sqrt(max)) do \n if p[i] then \n for j:=2 to max div i do p[i*j]:=false;\n for i:=1 to n do \n for j:=l[i] to r[i] do \n if (p[j]) and (p[(j+1) div 2]) then inc(s[i]);\n for i:=1 to n do writeln(s[i]);\nend.\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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 546, "cpu_time_ms": 2103, "memory_kb": 1152}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s235605518", "group_id": "codeNet:p03477", "input_text": "var a,b,c,d:longint;\nbegin\n readln(a,b,c,d);\n if a+b>c+d then\n writeln('Left')\n else\n if a+b=c+d then\n writeln('Balanced')\n else\n writeln('Right');\nend.", "language": "Pascal", "metadata": {"date": 1581715523, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03477.html", "problem_id": "p03477", "resource_group": "low_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/Pascal/s235605518.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s235605518", "user_id": "u743614777"}, "prompt_components": {"gold_output": "Left\n", "input_to_evaluate": "var a,b,c,d:longint;\nbegin\n readln(a,b,c,d);\n if a+b>c+d then\n writeln('Left')\n else\n if a+b=c+d then\n writeln('Balanced')\n else\n writeln('Right');\nend.", "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 L8, 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 L8, 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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 3, "memory_kb": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s426967214", "group_id": "codeNet:p03479", "input_text": "var\n n,m,i:qword;\n k,sum:longint;\nbegin\n readln(n,m);\n k:=m div n;\n i:=1;\n while i<=k do\n begin\n i:=i*2;\n sum:=sum+1;\n end;\n write(sum);\nend.\n", "language": "Pascal", "metadata": {"date": 1579740384, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03479.html", "problem_id": "p03479", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03479/input.txt", "sample_output_relpath": "derived/input_output/data/p03479/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03479/Pascal/s426967214.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s426967214", "user_id": "u247366051"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "var\n n,m,i:qword;\n k,sum:longint;\nbegin\n readln(n,m);\n k:=m div n;\n i:=1;\n while i<=k do\n begin\n i:=i*2;\n sum:=sum+1;\n end;\n write(sum);\nend.\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nAs a token of his gratitude, Takahashi has decided to give his mother an integer sequence.\nThe sequence A needs to satisfy the conditions below:\n\nA consists of integers between X and Y (inclusive).\n\nFor each 1\\leq i \\leq |A|-1, A_{i+1} is a multiple of A_i and strictly greater than A_i.\n\nFind the maximum possible length of the sequence.\n\nConstraints\n\n1 \\leq X \\leq Y \\leq 10^{18}\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX Y\n\nOutput\n\nPrint the maximum possible length of the sequence.\n\nSample Input 1\n\n3 20\n\nSample Output 1\n\n3\n\nThe sequence 3,6,18 satisfies the conditions.\n\nSample Input 2\n\n25 100\n\nSample Output 2\n\n3\n\nSample Input 3\n\n314159265 358979323846264338\n\nSample Output 3\n\n31", "sample_input": "3 20\n"}, "reference_outputs": ["3\n"], "source_document_id": "p03479", "source_text": "Score : 300 points\n\nProblem Statement\n\nAs a token of his gratitude, Takahashi has decided to give his mother an integer sequence.\nThe sequence A needs to satisfy the conditions below:\n\nA consists of integers between X and Y (inclusive).\n\nFor each 1\\leq i \\leq |A|-1, A_{i+1} is a multiple of A_i and strictly greater than A_i.\n\nFind the maximum possible length of the sequence.\n\nConstraints\n\n1 \\leq X \\leq Y \\leq 10^{18}\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX Y\n\nOutput\n\nPrint the maximum possible length of the sequence.\n\nSample Input 1\n\n3 20\n\nSample Output 1\n\n3\n\nThe sequence 3,6,18 satisfies the conditions.\n\nSample Input 2\n\n25 100\n\nSample Output 2\n\n3\n\nSample Input 3\n\n314159265 358979323846264338\n\nSample Output 3\n\n31", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 2103, "memory_kb": 128}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s595347088", "group_id": "codeNet:p03480", "input_text": "var\n s:ansistring;\n len:longint;\nbegin\n read(s);\n len:=length(s);\n while s[1]='0' do dec(len);\n writeln(len);\nend.", "language": "Pascal", "metadata": {"date": 1538676406, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03480.html", "problem_id": "p03480", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03480/input.txt", "sample_output_relpath": "derived/input_output/data/p03480/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03480/Pascal/s595347088.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s595347088", "user_id": "u476418095"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "var\n s:ansistring;\n len:longint;\nbegin\n read(s);\n len:=length(s);\n while s[1]='0' do dec(len);\n writeln(len);\nend.", "problem_context": "Score : 500 points\n\nProblem Statement\n\nYou are given a string S consisting of 0 and 1.\nFind the maximum integer K not greater than |S| such that we can turn all the characters of S into 0 by repeating the following operation some number of times.\n\nChoose a contiguous segment [l,r] in S whose length is at least K (that is, r-l+1\\geq K must be satisfied). For each integer i such that l\\leq i\\leq r, do the following: if S_i is 0, replace it with 1; if S_i is 1, replace it with 0.\n\nConstraints\n\n1\\leq |S|\\leq 10^5\n\nS_i(1\\leq i\\leq N) is either 0 or 1.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the maximum integer K such that we can turn all the characters of S into 0 by repeating the operation some number of times.\n\nSample Input 1\n\n010\n\nSample Output 1\n\n2\n\nWe can turn all the characters of S into 0 by the following operations:\n\nPerform the operation on the segment S[1,3] with length 3. S is now 101.\n\nPerform the operation on the segment S[1,2] with length 2. S is now 011.\n\nPerform the operation on the segment S[2,3] with length 2. S is now 000.\n\nSample Input 2\n\n100000000\n\nSample Output 2\n\n8\n\nSample Input 3\n\n00001111\n\nSample Output 3\n\n4", "sample_input": "010\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03480", "source_text": "Score : 500 points\n\nProblem Statement\n\nYou are given a string S consisting of 0 and 1.\nFind the maximum integer K not greater than |S| such that we can turn all the characters of S into 0 by repeating the following operation some number of times.\n\nChoose a contiguous segment [l,r] in S whose length is at least K (that is, r-l+1\\geq K must be satisfied). For each integer i such that l\\leq i\\leq r, do the following: if S_i is 0, replace it with 1; if S_i is 1, replace it with 0.\n\nConstraints\n\n1\\leq |S|\\leq 10^5\n\nS_i(1\\leq i\\leq N) is either 0 or 1.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the maximum integer K such that we can turn all the characters of S into 0 by repeating the operation some number of times.\n\nSample Input 1\n\n010\n\nSample Output 1\n\n2\n\nWe can turn all the characters of S into 0 by the following operations:\n\nPerform the operation on the segment S[1,3] with length 3. S is now 101.\n\nPerform the operation on the segment S[1,2] with length 2. S is now 011.\n\nPerform the operation on the segment S[2,3] with length 2. S is now 000.\n\nSample Input 2\n\n100000000\n\nSample Output 2\n\n8\n\nSample Input 3\n\n00001111\n\nSample Output 3\n\n4", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 2103, "memory_kb": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s399245074", "group_id": "codeNet:p03482", "input_text": "var\n\ts:String;\n\ti,m,n:Longint;\nbegin\n\treadln(s);\n\tn:=length(s);\n\tm:=n;\n\tfor i:=1 to n-1 do begin\n\t\tif s[i]<>s[i+1]then begin\n\t\t\tif m>i then m:=i;\n\t\t\tif m>n-i then m:=n-i;\n\t\tend;\n\tend;\n\twriteln(m);\nend.\n", "language": "Pascal", "metadata": {"date": 1539846327, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03482.html", "problem_id": "p03482", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03482/input.txt", "sample_output_relpath": "derived/input_output/data/p03482/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03482/Pascal/s399245074.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s399245074", "user_id": "u657913472"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "var\n\ts:String;\n\ti,m,n:Longint;\nbegin\n\treadln(s);\n\tn:=length(s);\n\tm:=n;\n\tfor i:=1 to n-1 do begin\n\t\tif s[i]<>s[i+1]then begin\n\t\t\tif m>i then m:=i;\n\t\t\tif m>n-i then m:=n-i;\n\t\tend;\n\tend;\n\twriteln(m);\nend.\n", "problem_context": "Score : 500 points\n\nProblem Statement\n\nYou are given a string S consisting of 0 and 1.\nFind the maximum integer K not greater than |S| such that we can turn all the characters of S into 0 by repeating the following operation some number of times.\n\nChoose a contiguous segment [l,r] in S whose length is at least K (that is, r-l+1\\geq K must be satisfied). For each integer i such that l\\leq i\\leq r, do the following: if S_i is 0, replace it with 1; if S_i is 1, replace it with 0.\n\nConstraints\n\n1\\leq |S|\\leq 10^5\n\nS_i(1\\leq i\\leq N) is either 0 or 1.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the maximum integer K such that we can turn all the characters of S into 0 by repeating the operation some number of times.\n\nSample Input 1\n\n010\n\nSample Output 1\n\n2\n\nWe can turn all the characters of S into 0 by the following operations:\n\nPerform the operation on the segment S[1,3] with length 3. S is now 101.\n\nPerform the operation on the segment S[1,2] with length 2. S is now 011.\n\nPerform the operation on the segment S[2,3] with length 2. S is now 000.\n\nSample Input 2\n\n100000000\n\nSample Output 2\n\n8\n\nSample Input 3\n\n00001111\n\nSample Output 3\n\n4", "sample_input": "010\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03482", "source_text": "Score : 500 points\n\nProblem Statement\n\nYou are given a string S consisting of 0 and 1.\nFind the maximum integer K not greater than |S| such that we can turn all the characters of S into 0 by repeating the following operation some number of times.\n\nChoose a contiguous segment [l,r] in S whose length is at least K (that is, r-l+1\\geq K must be satisfied). For each integer i such that l\\leq i\\leq r, do the following: if S_i is 0, replace it with 1; if S_i is 1, replace it with 0.\n\nConstraints\n\n1\\leq |S|\\leq 10^5\n\nS_i(1\\leq i\\leq N) is either 0 or 1.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the maximum integer K such that we can turn all the characters of S into 0 by repeating the operation some number of times.\n\nSample Input 1\n\n010\n\nSample Output 1\n\n2\n\nWe can turn all the characters of S into 0 by the following operations:\n\nPerform the operation on the segment S[1,3] with length 3. S is now 101.\n\nPerform the operation on the segment S[1,2] with length 2. S is now 011.\n\nPerform the operation on the segment S[2,3] with length 2. S is now 000.\n\nSample Input 2\n\n100000000\n\nSample Output 2\n\n8\n\nSample Input 3\n\n00001111\n\nSample Output 3\n\n4", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 202, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s747196683", "group_id": "codeNet:p03485", "input_text": "var a,b:Longint;begin read(a,b);writeln((a+b+1)div 2)end.", "language": "Pascal", "metadata": {"date": 1574760897, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03485.html", "problem_id": "p03485", "resource_group": "low_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/Pascal/s747196683.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s747196683", "user_id": "u657913472"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "var a,b:Longint;begin read(a,b);writeln((a+b+1)div 2)end.", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 57, "cpu_time_ms": 3, "memory_kb": 128}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s047665539", "group_id": "codeNet:p03487", "input_text": "var\na:array[0..100005] of longint;\nn,i,j,x,s:longint;\nbegin\nreadln(n);\nfor i:=1 to n do read(a[i]);\nfor i:=1 to n-1 do\n for j:=i+1 to n do\n if a[i]>a[j] then\n begin\n a[0]:=a[i];\n a[i]:=a[j];\n a[j]:=a[0];\n end;\nx:=1;\na[n+1]:=a[n]+1;\nfor i:=2 to n do\n if a[i]=a[i-1] then inc(x)\n else\n begin\n if a[i-1]a[j] then\n begin\n a[0]:=a[i];\n a[i]:=a[j];\n a[j]:=a[0];\n end;\nx:=1;\na[n+1]:=a[n]+1;\nfor i:=2 to n do\n if a[i]=a[i-1] then inc(x)\n else\n begin\n if a[i-1]n then inc(s)\n else inc(a[x]);\n end;\n for i:=1 to n do\n if a[i]<>0 then\n if a[i]i then s:=s+a[i]-i;\n writeln(s);\nend.", "language": "Pascal", "metadata": {"date": 1582152254, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03487.html", "problem_id": "p03487", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03487/input.txt", "sample_output_relpath": "derived/input_output/data/p03487/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03487/Pascal/s599347234.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s599347234", "user_id": "u426964396"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "var\n n,i,x,s:longint;\n a:array[0..100003] of longint;\nbegin\n readln(n);\n for i:=1 to n do\n begin\n read(x);\n if x>n then inc(s)\n else inc(a[x]);\n end;\n for i:=1 to n do\n if a[i]<>0 then\n if a[i]i then s:=s+a[i]-i;\n writeln(s);\nend.", "problem_context": "Score : 300 points\n\nProblem Statement\n\nYou are given a sequence of positive integers of length N, a = (a_1, a_2, ..., a_N).\nYour objective is to remove some of the elements in a so that a will be a good sequence.\n\nHere, an sequence b is a good sequence when the following condition holds true:\n\nFor each element x in b, the value x occurs exactly x times in b.\n\nFor example, (3, 3, 3), (4, 2, 4, 1, 4, 2, 4) and () (an empty sequence) are good sequences, while (3, 3, 3, 3) and (2, 4, 1, 4, 2) are not.\n\nFind the minimum number of elements that needs to be removed so that a will be a good sequence.\n\nConstraints\n\n1 \\leq N \\leq 10^5\n\na_i is an integer.\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 number of elements that needs to be removed so that a will be a good sequence.\n\nSample Input 1\n\n4\n3 3 3 3\n\nSample Output 1\n\n1\n\nWe can, for example, remove one occurrence of 3. Then, (3, 3, 3) is a good sequence.\n\nSample Input 2\n\n5\n2 4 1 4 2\n\nSample Output 2\n\n2\n\nWe can, for example, remove two occurrences of 4. Then, (2, 1, 2) is a good sequence.\n\nSample Input 3\n\n6\n1 2 2 3 3 3\n\nSample Output 3\n\n0\n\nSample Input 4\n\n1\n1000000000\n\nSample Output 4\n\n1\n\nRemove one occurrence of 10^9. Then, () is a good sequence.\n\nSample Input 5\n\n8\n2 7 1 8 2 8 1 8\n\nSample Output 5\n\n5", "sample_input": "4\n3 3 3 3\n"}, "reference_outputs": ["1\n"], "source_document_id": "p03487", "source_text": "Score : 300 points\n\nProblem Statement\n\nYou are given a sequence of positive integers of length N, a = (a_1, a_2, ..., a_N).\nYour objective is to remove some of the elements in a so that a will be a good sequence.\n\nHere, an sequence b is a good sequence when the following condition holds true:\n\nFor each element x in b, the value x occurs exactly x times in b.\n\nFor example, (3, 3, 3), (4, 2, 4, 1, 4, 2, 4) and () (an empty sequence) are good sequences, while (3, 3, 3, 3) and (2, 4, 1, 4, 2) are not.\n\nFind the minimum number of elements that needs to be removed so that a will be a good sequence.\n\nConstraints\n\n1 \\leq N \\leq 10^5\n\na_i is an integer.\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 number of elements that needs to be removed so that a will be a good sequence.\n\nSample Input 1\n\n4\n3 3 3 3\n\nSample Output 1\n\n1\n\nWe can, for example, remove one occurrence of 3. Then, (3, 3, 3) is a good sequence.\n\nSample Input 2\n\n5\n2 4 1 4 2\n\nSample Output 2\n\n2\n\nWe can, for example, remove two occurrences of 4. Then, (2, 1, 2) is a good sequence.\n\nSample Input 3\n\n6\n1 2 2 3 3 3\n\nSample Output 3\n\n0\n\nSample Input 4\n\n1\n1000000000\n\nSample Output 4\n\n1\n\nRemove one occurrence of 10^9. Then, () is a good sequence.\n\nSample Input 5\n\n8\n2 7 1 8 2 8 1 8\n\nSample Output 5\n\n5", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 17, "memory_kb": 128}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s187668424", "group_id": "codeNet:p03487", "input_text": "var\n n,i,max,min,x,m:longint;\n a:array[0..100000001] of longint;\nbegin\n readln(n);\n min:=maxlongint;\n for i:=1 to n do \n begin\n read(x);\n if x>n then inc(m)\n else begin\n inc(a[x]);\n if x>max then max:=x;\n if xi then m:=m+(a[i]-i);\n writeln(m);\nend.", "language": "Pascal", "metadata": {"date": 1537322940, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03487.html", "problem_id": "p03487", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03487/input.txt", "sample_output_relpath": "derived/input_output/data/p03487/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03487/Pascal/s187668424.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s187668424", "user_id": "u263933075"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "var\n n,i,max,min,x,m:longint;\n a:array[0..100000001] of longint;\nbegin\n readln(n);\n min:=maxlongint;\n for i:=1 to n do \n begin\n read(x);\n if x>n then inc(m)\n else begin\n inc(a[x]);\n if x>max then max:=x;\n if xi then m:=m+(a[i]-i);\n writeln(m);\nend.", "problem_context": "Score : 300 points\n\nProblem Statement\n\nYou are given a sequence of positive integers of length N, a = (a_1, a_2, ..., a_N).\nYour objective is to remove some of the elements in a so that a will be a good sequence.\n\nHere, an sequence b is a good sequence when the following condition holds true:\n\nFor each element x in b, the value x occurs exactly x times in b.\n\nFor example, (3, 3, 3), (4, 2, 4, 1, 4, 2, 4) and () (an empty sequence) are good sequences, while (3, 3, 3, 3) and (2, 4, 1, 4, 2) are not.\n\nFind the minimum number of elements that needs to be removed so that a will be a good sequence.\n\nConstraints\n\n1 \\leq N \\leq 10^5\n\na_i is an integer.\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 number of elements that needs to be removed so that a will be a good sequence.\n\nSample Input 1\n\n4\n3 3 3 3\n\nSample Output 1\n\n1\n\nWe can, for example, remove one occurrence of 3. Then, (3, 3, 3) is a good sequence.\n\nSample Input 2\n\n5\n2 4 1 4 2\n\nSample Output 2\n\n2\n\nWe can, for example, remove two occurrences of 4. Then, (2, 1, 2) is a good sequence.\n\nSample Input 3\n\n6\n1 2 2 3 3 3\n\nSample Output 3\n\n0\n\nSample Input 4\n\n1\n1000000000\n\nSample Output 4\n\n1\n\nRemove one occurrence of 10^9. Then, () is a good sequence.\n\nSample Input 5\n\n8\n2 7 1 8 2 8 1 8\n\nSample Output 5\n\n5", "sample_input": "4\n3 3 3 3\n"}, "reference_outputs": ["1\n"], "source_document_id": "p03487", "source_text": "Score : 300 points\n\nProblem Statement\n\nYou are given a sequence of positive integers of length N, a = (a_1, a_2, ..., a_N).\nYour objective is to remove some of the elements in a so that a will be a good sequence.\n\nHere, an sequence b is a good sequence when the following condition holds true:\n\nFor each element x in b, the value x occurs exactly x times in b.\n\nFor example, (3, 3, 3), (4, 2, 4, 1, 4, 2, 4) and () (an empty sequence) are good sequences, while (3, 3, 3, 3) and (2, 4, 1, 4, 2) are not.\n\nFind the minimum number of elements that needs to be removed so that a will be a good sequence.\n\nConstraints\n\n1 \\leq N \\leq 10^5\n\na_i is an integer.\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 number of elements that needs to be removed so that a will be a good sequence.\n\nSample Input 1\n\n4\n3 3 3 3\n\nSample Output 1\n\n1\n\nWe can, for example, remove one occurrence of 3. Then, (3, 3, 3) is a good sequence.\n\nSample Input 2\n\n5\n2 4 1 4 2\n\nSample Output 2\n\n2\n\nWe can, for example, remove two occurrences of 4. Then, (2, 1, 2) is a good sequence.\n\nSample Input 3\n\n6\n1 2 2 3 3 3\n\nSample Output 3\n\n0\n\nSample Input 4\n\n1\n1000000000\n\nSample Output 4\n\n1\n\nRemove one occurrence of 10^9. Then, () is a good sequence.\n\nSample Input 5\n\n8\n2 7 1 8 2 8 1 8\n\nSample Output 5\n\n5", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 16, "memory_kb": 128}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s132195808", "group_id": "codeNet:p03487", "input_text": "var\n n,i,max,min,x,m:longint;\n a:array[0..100000001] of longint;\nbegin\n readln(n);\n min:=maxlongint;\n for i:=1 to n do \n begin\n read(x);\n inc(a[x]);\n if x>max then max:=x;\n if xi then m:=m+(a[i]-i);\n writeln(m);\nend.", "language": "Pascal", "metadata": {"date": 1535669992, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03487.html", "problem_id": "p03487", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03487/input.txt", "sample_output_relpath": "derived/input_output/data/p03487/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03487/Pascal/s132195808.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s132195808", "user_id": "u247366051"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "var\n n,i,max,min,x,m:longint;\n a:array[0..100000001] of longint;\nbegin\n readln(n);\n min:=maxlongint;\n for i:=1 to n do \n begin\n read(x);\n inc(a[x]);\n if x>max then max:=x;\n if xi then m:=m+(a[i]-i);\n writeln(m);\nend.", "problem_context": "Score : 300 points\n\nProblem Statement\n\nYou are given a sequence of positive integers of length N, a = (a_1, a_2, ..., a_N).\nYour objective is to remove some of the elements in a so that a will be a good sequence.\n\nHere, an sequence b is a good sequence when the following condition holds true:\n\nFor each element x in b, the value x occurs exactly x times in b.\n\nFor example, (3, 3, 3), (4, 2, 4, 1, 4, 2, 4) and () (an empty sequence) are good sequences, while (3, 3, 3, 3) and (2, 4, 1, 4, 2) are not.\n\nFind the minimum number of elements that needs to be removed so that a will be a good sequence.\n\nConstraints\n\n1 \\leq N \\leq 10^5\n\na_i is an integer.\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 number of elements that needs to be removed so that a will be a good sequence.\n\nSample Input 1\n\n4\n3 3 3 3\n\nSample Output 1\n\n1\n\nWe can, for example, remove one occurrence of 3. Then, (3, 3, 3) is a good sequence.\n\nSample Input 2\n\n5\n2 4 1 4 2\n\nSample Output 2\n\n2\n\nWe can, for example, remove two occurrences of 4. Then, (2, 1, 2) is a good sequence.\n\nSample Input 3\n\n6\n1 2 2 3 3 3\n\nSample Output 3\n\n0\n\nSample Input 4\n\n1\n1000000000\n\nSample Output 4\n\n1\n\nRemove one occurrence of 10^9. Then, () is a good sequence.\n\nSample Input 5\n\n8\n2 7 1 8 2 8 1 8\n\nSample Output 5\n\n5", "sample_input": "4\n3 3 3 3\n"}, "reference_outputs": ["1\n"], "source_document_id": "p03487", "source_text": "Score : 300 points\n\nProblem Statement\n\nYou are given a sequence of positive integers of length N, a = (a_1, a_2, ..., a_N).\nYour objective is to remove some of the elements in a so that a will be a good sequence.\n\nHere, an sequence b is a good sequence when the following condition holds true:\n\nFor each element x in b, the value x occurs exactly x times in b.\n\nFor example, (3, 3, 3), (4, 2, 4, 1, 4, 2, 4) and () (an empty sequence) are good sequences, while (3, 3, 3, 3) and (2, 4, 1, 4, 2) are not.\n\nFind the minimum number of elements that needs to be removed so that a will be a good sequence.\n\nConstraints\n\n1 \\leq N \\leq 10^5\n\na_i is an integer.\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 number of elements that needs to be removed so that a will be a good sequence.\n\nSample Input 1\n\n4\n3 3 3 3\n\nSample Output 1\n\n1\n\nWe can, for example, remove one occurrence of 3. Then, (3, 3, 3) is a good sequence.\n\nSample Input 2\n\n5\n2 4 1 4 2\n\nSample Output 2\n\n2\n\nWe can, for example, remove two occurrences of 4. Then, (2, 1, 2) is a good sequence.\n\nSample Input 3\n\n6\n1 2 2 3 3 3\n\nSample Output 3\n\n0\n\nSample Input 4\n\n1\n1000000000\n\nSample Output 4\n\n1\n\nRemove one occurrence of 10^9. Then, () is a good sequence.\n\nSample Input 5\n\n8\n2 7 1 8 2 8 1 8\n\nSample Output 5\n\n5", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 13, "memory_kb": 128}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s370455321", "group_id": "codeNet:p03487", "input_text": "var\n a:array[0..100010] of longint;\n i,n,s,t:longint;\nprocedure qsort(l,r:longint);\nvar\n i,j,t,mid:longint;\nbegin\n i:=l; j:=r; mid:=a[(l+r) div 2];\n repeat\n while a[i]mid do dec(j);\n if i<=j then\n begin\n t:=a[i]; a[i]:=a[j]; a[j]:=t;\n inc(i); dec(j);\n end;\n until i>j;\n if la[i-1] then\n begin\n if t>a[i-1] then s:=s+t-a[i-1]\n else s:=s+t;\n t:=1;\n end;\n end;\n writeln(s);\nend.", "language": "Pascal", "metadata": {"date": 1535649807, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03487.html", "problem_id": "p03487", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03487/input.txt", "sample_output_relpath": "derived/input_output/data/p03487/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03487/Pascal/s370455321.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s370455321", "user_id": "u247366051"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "var\n a:array[0..100010] of longint;\n i,n,s,t:longint;\nprocedure qsort(l,r:longint);\nvar\n i,j,t,mid:longint;\nbegin\n i:=l; j:=r; mid:=a[(l+r) div 2];\n repeat\n while a[i]mid do dec(j);\n if i<=j then\n begin\n t:=a[i]; a[i]:=a[j]; a[j]:=t;\n inc(i); dec(j);\n end;\n until i>j;\n if la[i-1] then\n begin\n if t>a[i-1] then s:=s+t-a[i-1]\n else s:=s+t;\n t:=1;\n end;\n end;\n writeln(s);\nend.", "problem_context": "Score : 300 points\n\nProblem Statement\n\nYou are given a sequence of positive integers of length N, a = (a_1, a_2, ..., a_N).\nYour objective is to remove some of the elements in a so that a will be a good sequence.\n\nHere, an sequence b is a good sequence when the following condition holds true:\n\nFor each element x in b, the value x occurs exactly x times in b.\n\nFor example, (3, 3, 3), (4, 2, 4, 1, 4, 2, 4) and () (an empty sequence) are good sequences, while (3, 3, 3, 3) and (2, 4, 1, 4, 2) are not.\n\nFind the minimum number of elements that needs to be removed so that a will be a good sequence.\n\nConstraints\n\n1 \\leq N \\leq 10^5\n\na_i is an integer.\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 number of elements that needs to be removed so that a will be a good sequence.\n\nSample Input 1\n\n4\n3 3 3 3\n\nSample Output 1\n\n1\n\nWe can, for example, remove one occurrence of 3. Then, (3, 3, 3) is a good sequence.\n\nSample Input 2\n\n5\n2 4 1 4 2\n\nSample Output 2\n\n2\n\nWe can, for example, remove two occurrences of 4. Then, (2, 1, 2) is a good sequence.\n\nSample Input 3\n\n6\n1 2 2 3 3 3\n\nSample Output 3\n\n0\n\nSample Input 4\n\n1\n1000000000\n\nSample Output 4\n\n1\n\nRemove one occurrence of 10^9. Then, () is a good sequence.\n\nSample Input 5\n\n8\n2 7 1 8 2 8 1 8\n\nSample Output 5\n\n5", "sample_input": "4\n3 3 3 3\n"}, "reference_outputs": ["1\n"], "source_document_id": "p03487", "source_text": "Score : 300 points\n\nProblem Statement\n\nYou are given a sequence of positive integers of length N, a = (a_1, a_2, ..., a_N).\nYour objective is to remove some of the elements in a so that a will be a good sequence.\n\nHere, an sequence b is a good sequence when the following condition holds true:\n\nFor each element x in b, the value x occurs exactly x times in b.\n\nFor example, (3, 3, 3), (4, 2, 4, 1, 4, 2, 4) and () (an empty sequence) are good sequences, while (3, 3, 3, 3) and (2, 4, 1, 4, 2) are not.\n\nFind the minimum number of elements that needs to be removed so that a will be a good sequence.\n\nConstraints\n\n1 \\leq N \\leq 10^5\n\na_i is an integer.\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 number of elements that needs to be removed so that a will be a good sequence.\n\nSample Input 1\n\n4\n3 3 3 3\n\nSample Output 1\n\n1\n\nWe can, for example, remove one occurrence of 3. Then, (3, 3, 3) is a good sequence.\n\nSample Input 2\n\n5\n2 4 1 4 2\n\nSample Output 2\n\n2\n\nWe can, for example, remove two occurrences of 4. Then, (2, 1, 2) is a good sequence.\n\nSample Input 3\n\n6\n1 2 2 3 3 3\n\nSample Output 3\n\n0\n\nSample Input 4\n\n1\n1000000000\n\nSample Output 4\n\n1\n\nRemove one occurrence of 10^9. Then, () is a good sequence.\n\nSample Input 5\n\n8\n2 7 1 8 2 8 1 8\n\nSample Output 5\n\n5", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 757, "cpu_time_ms": 23, "memory_kb": 512}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s262635668", "group_id": "codeNet:p03489", "input_text": "var\n\tN,i,ans,A:Longint;\n\tcnt:Array[1..100000]of Longint;\nbegin\n\tread(N);\n\tfor i:=1 to N do begin\n\t\tread(A);\n\t\tinc(ans);\n\t\tif A<=N then begin\n\t\t\tinc(cnt[A]);\n\t\t\tif cnt[A]=A then dec(ans,A);\n\t\tend;\n\tend;\n\twriteln(ans);\nend.\n", "language": "Pascal", "metadata": {"date": 1582185906, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03489.html", "problem_id": "p03489", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03489/input.txt", "sample_output_relpath": "derived/input_output/data/p03489/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03489/Pascal/s262635668.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s262635668", "user_id": "u657913472"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "var\n\tN,i,ans,A:Longint;\n\tcnt:Array[1..100000]of Longint;\nbegin\n\tread(N);\n\tfor i:=1 to N do begin\n\t\tread(A);\n\t\tinc(ans);\n\t\tif A<=N then begin\n\t\t\tinc(cnt[A]);\n\t\t\tif cnt[A]=A then dec(ans,A);\n\t\tend;\n\tend;\n\twriteln(ans);\nend.\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nYou are given a sequence of positive integers of length N, a = (a_1, a_2, ..., a_N).\nYour objective is to remove some of the elements in a so that a will be a good sequence.\n\nHere, an sequence b is a good sequence when the following condition holds true:\n\nFor each element x in b, the value x occurs exactly x times in b.\n\nFor example, (3, 3, 3), (4, 2, 4, 1, 4, 2, 4) and () (an empty sequence) are good sequences, while (3, 3, 3, 3) and (2, 4, 1, 4, 2) are not.\n\nFind the minimum number of elements that needs to be removed so that a will be a good sequence.\n\nConstraints\n\n1 \\leq N \\leq 10^5\n\na_i is an integer.\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 number of elements that needs to be removed so that a will be a good sequence.\n\nSample Input 1\n\n4\n3 3 3 3\n\nSample Output 1\n\n1\n\nWe can, for example, remove one occurrence of 3. Then, (3, 3, 3) is a good sequence.\n\nSample Input 2\n\n5\n2 4 1 4 2\n\nSample Output 2\n\n2\n\nWe can, for example, remove two occurrences of 4. Then, (2, 1, 2) is a good sequence.\n\nSample Input 3\n\n6\n1 2 2 3 3 3\n\nSample Output 3\n\n0\n\nSample Input 4\n\n1\n1000000000\n\nSample Output 4\n\n1\n\nRemove one occurrence of 10^9. Then, () is a good sequence.\n\nSample Input 5\n\n8\n2 7 1 8 2 8 1 8\n\nSample Output 5\n\n5", "sample_input": "4\n3 3 3 3\n"}, "reference_outputs": ["1\n"], "source_document_id": "p03489", "source_text": "Score : 300 points\n\nProblem Statement\n\nYou are given a sequence of positive integers of length N, a = (a_1, a_2, ..., a_N).\nYour objective is to remove some of the elements in a so that a will be a good sequence.\n\nHere, an sequence b is a good sequence when the following condition holds true:\n\nFor each element x in b, the value x occurs exactly x times in b.\n\nFor example, (3, 3, 3), (4, 2, 4, 1, 4, 2, 4) and () (an empty sequence) are good sequences, while (3, 3, 3, 3) and (2, 4, 1, 4, 2) are not.\n\nFind the minimum number of elements that needs to be removed so that a will be a good sequence.\n\nConstraints\n\n1 \\leq N \\leq 10^5\n\na_i is an integer.\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 number of elements that needs to be removed so that a will be a good sequence.\n\nSample Input 1\n\n4\n3 3 3 3\n\nSample Output 1\n\n1\n\nWe can, for example, remove one occurrence of 3. Then, (3, 3, 3) is a good sequence.\n\nSample Input 2\n\n5\n2 4 1 4 2\n\nSample Output 2\n\n2\n\nWe can, for example, remove two occurrences of 4. Then, (2, 1, 2) is a good sequence.\n\nSample Input 3\n\n6\n1 2 2 3 3 3\n\nSample Output 3\n\n0\n\nSample Input 4\n\n1\n1000000000\n\nSample Output 4\n\n1\n\nRemove one occurrence of 10^9. Then, () is a good sequence.\n\nSample Input 5\n\n8\n2 7 1 8 2 8 1 8\n\nSample Output 5\n\n5", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 17, "memory_kb": 128}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s910490087", "group_id": "codeNet:p03490", "input_text": "var\n\ts:String;\n\tx,y,f,cnt,i,j,off:Longint;\n\td:array[1..2,1..8000]of Longint;\n\tc:array[1..2]of Longint;\n\tdp:array[1..2,1..2,1..20000]of Boolean;\n\tans:Boolean;\nbegin\n\treadln(s);\n\tf:=1;\n\tfor i:=1 to length(s) do begin\n\t\tif s[i]='T'then begin\n\t\t\tinc(c[f]);\n\t\t\td[f,c[f]]:=cnt;\n\t\t\tcnt:=0;\n\t\t\tf:=3-f;\n\t\tend else inc(cnt);\n\tend;\n\tinc(c[f]);\n\td[f,c[f]]:=cnt;\n\tread(x,y);\n\toff:=10000;\n\tdp[1,1,off+d[1,1]]:=True;\n\tdp[2,1,off-d[2,1]]:=True;\n\tdp[2,1,off+d[2,1]]:=True;\n\tf:=1;\n\tfor i:=2 to c[1]do begin\n\t\tfor j:=1 to 20000-d[1,i]do begin\n\t\t\tif dp[1,f,j]then dp[1,3-f,j+d[1,i]]:=True;\n\t\tend;\n\t\tfor j:=d[1,i]+1 to 20000 do begin\n\t\t\tif dp[1,f,j]then dp[1,3-f,j-d[1,i]]:=True;\n\t\tend;\n\t\tfor j:=1 to 20000 do dp[1,f,j]:=False;\n\t\tf:=3-f;\n\tend;\n\tans:=dp[1,f,off+x];\n\tf:=1;\n\tfor i:=2 to c[2]do begin\n\t\tfor j:=1 to 20000-d[2,i]do begin\n\t\t\tif dp[2,f,j]then dp[2,3-f,j+d[2,i]]:=True;\n\t\tend;\n\t\tfor j:=d[2,i]+1 to 20000 do begin\n\t\t\tif dp[2,f,j]then dp[2,3-f,j-d[2,i]]:=True;\n\t\tend;\n\t\tfor j:=1 to 20000 do dp[2,f,j]:=False;\n\t\tf:=3-f;\n\tend;\n\tif ans and dp[2,f,off+y]then writeln('Yes')else writeln('No');\nend.\n", "language": "Pascal", "metadata": {"date": 1539840953, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03490.html", "problem_id": "p03490", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03490/input.txt", "sample_output_relpath": "derived/input_output/data/p03490/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03490/Pascal/s910490087.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s910490087", "user_id": "u657913472"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "var\n\ts:String;\n\tx,y,f,cnt,i,j,off:Longint;\n\td:array[1..2,1..8000]of Longint;\n\tc:array[1..2]of Longint;\n\tdp:array[1..2,1..2,1..20000]of Boolean;\n\tans:Boolean;\nbegin\n\treadln(s);\n\tf:=1;\n\tfor i:=1 to length(s) do begin\n\t\tif s[i]='T'then begin\n\t\t\tinc(c[f]);\n\t\t\td[f,c[f]]:=cnt;\n\t\t\tcnt:=0;\n\t\t\tf:=3-f;\n\t\tend else inc(cnt);\n\tend;\n\tinc(c[f]);\n\td[f,c[f]]:=cnt;\n\tread(x,y);\n\toff:=10000;\n\tdp[1,1,off+d[1,1]]:=True;\n\tdp[2,1,off-d[2,1]]:=True;\n\tdp[2,1,off+d[2,1]]:=True;\n\tf:=1;\n\tfor i:=2 to c[1]do begin\n\t\tfor j:=1 to 20000-d[1,i]do begin\n\t\t\tif dp[1,f,j]then dp[1,3-f,j+d[1,i]]:=True;\n\t\tend;\n\t\tfor j:=d[1,i]+1 to 20000 do begin\n\t\t\tif dp[1,f,j]then dp[1,3-f,j-d[1,i]]:=True;\n\t\tend;\n\t\tfor j:=1 to 20000 do dp[1,f,j]:=False;\n\t\tf:=3-f;\n\tend;\n\tans:=dp[1,f,off+x];\n\tf:=1;\n\tfor i:=2 to c[2]do begin\n\t\tfor j:=1 to 20000-d[2,i]do begin\n\t\t\tif dp[2,f,j]then dp[2,3-f,j+d[2,i]]:=True;\n\t\tend;\n\t\tfor j:=d[2,i]+1 to 20000 do begin\n\t\t\tif dp[2,f,j]then dp[2,3-f,j-d[2,i]]:=True;\n\t\tend;\n\t\tfor j:=1 to 20000 do dp[2,f,j]:=False;\n\t\tf:=3-f;\n\tend;\n\tif ans and dp[2,f,off+y]then writeln('Yes')else writeln('No');\nend.\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": "p03490", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1080, "cpu_time_ms": 464, "memory_kb": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s900518972", "group_id": "codeNet:p03490", "input_text": "var\n\ts:String;\n\tx,y,f,cnt,i,j,off:Longint;\n\td:array[1..2,1..8000]of Longint;\n\tc:array[1..2]of Longint;\n\tdp:array[1..2,1..2,1..20000]of Boolean;\n\tans:Boolean;\nbegin\n\treadln(s);\n\tf:=1;\n\tfor i:=1 to length(s) do begin\n\t\tif s[i]='T'then begin\n\t\t\tinc(c[f]);\n\t\t\td[f,c[f]]:=cnt;\n\t\t\tcnt:=0;\n\t\t\tf:=3-f;\n\t\tend else inc(cnt);\n\tend;\n\tinc(c[f]);\n\td[f,c[f]]:=cnt;\n\tread(x,y);\n\tx:=x-d[1,1];\n\toff:=10000;\n\tdp[1,1,off]:=True;\n\tdp[2,1,off-d[2,1]]:=True;\n\tdp[2,1,off+d[2,1]]:=True;\n\tf:=1;\n\tfor i:=2 to c[1]do begin\n\t\tfor j:=1 to 20000-d[1,i]do begin\n\t\t\tif dp[1,f,j]then dp[1,3-f,j+d[1,i]]:=True;\n\t\tend;\n\t\tfor j:=d[1,i]+1 to 20000 do begin\n\t\t\tif dp[1,f,j]then dp[1,3-f,j-d[1,i]]:=True;\n\t\tend;\n\t\tfor j:=1 to 20000 do dp[1,f,j]:=False;\n\t\tf:=3-f;\n\tend;\n\tans:=dp[1,f,off+x];\n\tf:=1;\n\tfor i:=2 to c[2]do begin\n\t\tfor j:=1 to 20000-d[2,i]do begin\n\t\t\tif dp[2,f,j]then dp[2,3-f,j+d[1,i]]:=True;\n\t\tend;\n\t\tfor j:=d[2,i]+1 to 20000 do begin\n\t\t\tif dp[2,f,j]then dp[2,3-f,j-d[2,i]]:=True;\n\t\tend;\n\t\tfor j:=1 to 20000 do dp[2,f,j]:=False;\n\t\tf:=3-f;\n\tend;\n\tif ans and dp[2,f,off+y]then writeln('Yes')else writeln('No');\nend.\n", "language": "Pascal", "metadata": {"date": 1539840302, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03490.html", "problem_id": "p03490", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03490/input.txt", "sample_output_relpath": "derived/input_output/data/p03490/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03490/Pascal/s900518972.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s900518972", "user_id": "u657913472"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "var\n\ts:String;\n\tx,y,f,cnt,i,j,off:Longint;\n\td:array[1..2,1..8000]of Longint;\n\tc:array[1..2]of Longint;\n\tdp:array[1..2,1..2,1..20000]of Boolean;\n\tans:Boolean;\nbegin\n\treadln(s);\n\tf:=1;\n\tfor i:=1 to length(s) do begin\n\t\tif s[i]='T'then begin\n\t\t\tinc(c[f]);\n\t\t\td[f,c[f]]:=cnt;\n\t\t\tcnt:=0;\n\t\t\tf:=3-f;\n\t\tend else inc(cnt);\n\tend;\n\tinc(c[f]);\n\td[f,c[f]]:=cnt;\n\tread(x,y);\n\tx:=x-d[1,1];\n\toff:=10000;\n\tdp[1,1,off]:=True;\n\tdp[2,1,off-d[2,1]]:=True;\n\tdp[2,1,off+d[2,1]]:=True;\n\tf:=1;\n\tfor i:=2 to c[1]do begin\n\t\tfor j:=1 to 20000-d[1,i]do begin\n\t\t\tif dp[1,f,j]then dp[1,3-f,j+d[1,i]]:=True;\n\t\tend;\n\t\tfor j:=d[1,i]+1 to 20000 do begin\n\t\t\tif dp[1,f,j]then dp[1,3-f,j-d[1,i]]:=True;\n\t\tend;\n\t\tfor j:=1 to 20000 do dp[1,f,j]:=False;\n\t\tf:=3-f;\n\tend;\n\tans:=dp[1,f,off+x];\n\tf:=1;\n\tfor i:=2 to c[2]do begin\n\t\tfor j:=1 to 20000-d[2,i]do begin\n\t\t\tif dp[2,f,j]then dp[2,3-f,j+d[1,i]]:=True;\n\t\tend;\n\t\tfor j:=d[2,i]+1 to 20000 do begin\n\t\t\tif dp[2,f,j]then dp[2,3-f,j-d[2,i]]:=True;\n\t\tend;\n\t\tfor j:=1 to 20000 do dp[2,f,j]:=False;\n\t\tf:=3-f;\n\tend;\n\tif ans and dp[2,f,off+y]then writeln('Yes')else writeln('No');\nend.\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": "p03490", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1087, "cpu_time_ms": 463, "memory_kb": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s895665407", "group_id": "codeNet:p03494", "input_text": "var n,i,max:longint;\na:array[1..200]of longint;\nb:boolean;\nbegin\nreadln(n);\nfor i:=1 to n do\nb:=true;\nmax:=0;\nwhile b do\nbegin\nb:=true;\nfor i:=1 to n do if a[i]mod 10 mod 2=1 then b:=false;\nif b then max:=max+1;\nend;\nwrite(max);\nend.", "language": "Pascal", "metadata": {"date": 1524413657, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03494.html", "problem_id": "p03494", "resource_group": "low_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/Pascal/s895665407.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s895665407", "user_id": "u247366051"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "var n,i,max:longint;\na:array[1..200]of longint;\nb:boolean;\nbegin\nreadln(n);\nfor i:=1 to n do\nb:=true;\nmax:=0;\nwhile b do\nbegin\nb:=true;\nfor i:=1 to n do if a[i]mod 10 mod 2=1 then b:=false;\nif b then max:=max+1;\nend;\nwrite(max);\nend.", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 2107, "memory_kb": 128}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s213123239", "group_id": "codeNet:p03494", "input_text": "program hrn;\n var\n n,i,a,x,v:longint;\n function co(s:longint):longint;\n begin\n repeat\n if s mod 2=0 then begin\n s:=s div 2;inc(v);end;\n until s mod 2=1;\n co:=v;v:=0;\n end;\n begin\n read(n);x:=maxlongint;\n for i:=1 to n do begin\n read(a);\n if co(a)>1];\n repeat\n while a[i]j) then\n begin\n y:=a[i];a[i]:=a[j];\n a[j]:=y;inc(i);dec(j);\n end;\n until i>j;\n if ll then\n begin\n quickly_sort(a,l,r);\n i:=l;\n for i:=l to r do\n begin\n j:=i; \n while j>pred(l) do\n if a[j]>1];\n repeat\n while a[i]j) then\n begin\n y:=a[i];a[i]:=a[j];\n a[j]:=y;inc(i);dec(j);\n end;\n until i>j;\n if ll then\n begin\n quickly_sort(a,l,r);\n i:=l;\n for i:=l to r do\n begin\n j:=i; \n while j>pred(l) do\n if a[j]m do dec(j);\n if i<=j then\n begin\n t:=a[i]; a[i]:=a[j]; a[j]:=t;\n inc(i); dec(j);\n end;\n until i>j;\n if l0 then\n begin\n inc(j);\n a[j]:=b[i];\n end;\n end;\n kp(1,j);\n for i:=1 to s-k do\n sum:=sum+a[i];\n writeln(sum);\nend.", "language": "Pascal", "metadata": {"date": 1546020377, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03495.html", "problem_id": "p03495", "resource_group": "low_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/Pascal/s718393416.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s718393416", "user_id": "u426964396"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "var\n i,x,k,j,n,s:longint;\n sum:int64;\n a,b:array[0..200000] of longint;\nprocedure kp(l,r:longint);\nvar i,j,m,t:longint;\nbegin\n i:=l; j:=r;\n m:=a[(l+r) div 2];\n repeat\n while a[i]m do dec(j);\n if i<=j then\n begin\n t:=a[i]; a[i]:=a[j]; a[j]:=t;\n inc(i); dec(j);\n end;\n until i>j;\n if l0 then\n begin\n inc(j);\n a[j]:=b[i];\n end;\n end;\n kp(1,j);\n for i:=1 to s-k do\n sum:=sum+a[i];\n writeln(sum);\nend.", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 642, "cpu_time_ms": 31, "memory_kb": 1664}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s202066371", "group_id": "codeNet:p03497", "input_text": "var n,k:longint;\n i:longint;\n x:longint;\n c:array[0..205000]of longint;\n max,num:longint;\nprocedure qs(l,r:longint);\nvar i,j,m,t:longint;\nbegin\n i:=l;\n j:=r;\n m:=c[(l+r)>>1];\n repeat\n while c[i]m do dec(j);\n if i<=j then\n begin\n t:=c[i];c[i]:=c[j];c[j]:=t;\n inc(i);\n dec(j);\n end;\n until i>j;\n if lmax then max:=x;\n end;\n k:=-k;\n qs(1,max);\n num:=0;\n for i:=1 to max+1 do\n if c[i]>0 then\n begin\n if k<=0 then\n begin\n writeln(num);\n exit;\n end;\n dec(k);\n inc(num,c[i]);\n end;\nend.", "language": "Pascal", "metadata": {"date": 1512958830, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03497.html", "problem_id": "p03497", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03497/input.txt", "sample_output_relpath": "derived/input_output/data/p03497/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03497/Pascal/s202066371.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s202066371", "user_id": "u809476955"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "var n,k:longint;\n i:longint;\n x:longint;\n c:array[0..205000]of longint;\n max,num:longint;\nprocedure qs(l,r:longint);\nvar i,j,m,t:longint;\nbegin\n i:=l;\n j:=r;\n m:=c[(l+r)>>1];\n repeat\n while c[i]m do dec(j);\n if i<=j then\n begin\n t:=c[i];c[i]:=c[j];c[j]:=t;\n inc(i);\n dec(j);\n end;\n until i>j;\n if lmax then max:=x;\n end;\n k:=-k;\n qs(1,max);\n num:=0;\n for i:=1 to max+1 do\n if c[i]>0 then\n begin\n if k<=0 then\n begin\n writeln(num);\n exit;\n end;\n dec(k);\n inc(num,c[i]);\n end;\nend.", "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": "p03497", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 741, "cpu_time_ms": 31, "memory_kb": 896}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s707536472", "group_id": "codeNet:p03501", "input_text": "program Project1;\n \n{$APPTYPE CONSOLE}\n \nuses\n SysUtils,math;\nvar\n g,r,a,h,w,i,j,count,x,y,sw,m,n,b,c,soeji,sum,max,k,t,z:Integer;\n //l:array of Integer;\n l,l1,l2:int64;\n s,s123,s1,s2,s3:string;\n tf:Boolean;\n //nyu:TStringList;\n xc,yc,space:char;\nbegin\n try\n { TODO -oUser -cConsole Main : ここにコードを記述してください }\n Read(n);\n Read(a);\n Readln(b);\n\n Writeln(((n*a)+b-abs((n*a)-b))div 2);\n Readln;\n except\n on E: Exception do\n Writeln(E.ClassName, ': ', E.Message);\n end;\nend.", "language": "Pascal", "metadata": {"date": 1517415556, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03501.html", "problem_id": "p03501", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03501/input.txt", "sample_output_relpath": "derived/input_output/data/p03501/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03501/Pascal/s707536472.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s707536472", "user_id": "u755925739"}, "prompt_components": {"gold_output": "119\n", "input_to_evaluate": "program Project1;\n \n{$APPTYPE CONSOLE}\n \nuses\n SysUtils,math;\nvar\n g,r,a,h,w,i,j,count,x,y,sw,m,n,b,c,soeji,sum,max,k,t,z:Integer;\n //l:array of Integer;\n l,l1,l2:int64;\n s,s123,s1,s2,s3:string;\n tf:Boolean;\n //nyu:TStringList;\n xc,yc,space:char;\nbegin\n try\n { TODO -oUser -cConsole Main : ここにコードを記述してください }\n Read(n);\n Read(a);\n Readln(b);\n\n Writeln(((n*a)+b-abs((n*a)-b))div 2);\n Readln;\n except\n on E: Exception do\n Writeln(E.ClassName, ': ', E.Message);\n end;\nend.", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou are parking at a parking lot. You can choose from the following two fee plans:\n\nPlan 1: The fee will be A×T yen (the currency of Japan) when you park for T hours.\n\nPlan 2: The fee will be B yen, regardless of the duration.\n\nFind the minimum fee when you park for N hours.\n\nConstraints\n\n1≤N≤20\n\n1≤A≤100\n\n1≤B≤2000\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN A B\n\nOutput\n\nWhen the minimum fee is x yen, print the value of x.\n\nSample Input 1\n\n7 17 120\n\nSample Output 1\n\n119\n\nIf you choose Plan 1, the fee will be 7×17=119 yen.\n\nIf you choose Plan 2, the fee will be 120 yen.\n\nThus, the minimum fee is 119 yen.\n\nSample Input 2\n\n5 20 100\n\nSample Output 2\n\n100\n\nThe fee might be the same in the two plans.\n\nSample Input 3\n\n6 18 100\n\nSample Output 3\n\n100", "sample_input": "7 17 120\n"}, "reference_outputs": ["119\n"], "source_document_id": "p03501", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou are parking at a parking lot. You can choose from the following two fee plans:\n\nPlan 1: The fee will be A×T yen (the currency of Japan) when you park for T hours.\n\nPlan 2: The fee will be B yen, regardless of the duration.\n\nFind the minimum fee when you park for N hours.\n\nConstraints\n\n1≤N≤20\n\n1≤A≤100\n\n1≤B≤2000\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN A B\n\nOutput\n\nWhen the minimum fee is x yen, print the value of x.\n\nSample Input 1\n\n7 17 120\n\nSample Output 1\n\n119\n\nIf you choose Plan 1, the fee will be 7×17=119 yen.\n\nIf you choose Plan 2, the fee will be 120 yen.\n\nThus, the minimum fee is 119 yen.\n\nSample Input 2\n\n5 20 100\n\nSample Output 2\n\n100\n\nThe fee might be the same in the two plans.\n\nSample Input 3\n\n6 18 100\n\nSample Output 3\n\n100", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 554, "cpu_time_ms": 2, "memory_kb": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s750187585", "group_id": "codeNet:p03502", "input_text": "program Project1;\n \n{$APPTYPE CONSOLE}\n \nuses\n SysUtils,math;\nvar\n fx,g,r,a,h,w,i,j,count,x,y,sw,m,n,b,c,soeji,sum,max,k,t,z:Integer;\n //l:array of Integer;\n l,l1,l2:int64;\n s,s123,s1,s2,s3:string;\n tf:Boolean;\n //nyu:TStringList;\n xc,yc,space:char;\nbegin\n try\n { TODO -oUser -cConsole Main : ここにコードを記述してください }\n Readln(s);\n fx:=0;\n\n for i := 1 to Length(s) do\n fx:=fx+StrToInt(s[i]);\n\n if StrToInt(s) mod fx =0 then\n Writeln('Yes')\n else\n Writeln('No');\n Readln;\n except\n on E: Exception do\n Writeln(E.ClassName, ': ', E.Message);\n end;\nend.", "language": "Pascal", "metadata": {"date": 1517417320, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03502.html", "problem_id": "p03502", "resource_group": "low_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/Pascal/s750187585.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s750187585", "user_id": "u755925739"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "program Project1;\n \n{$APPTYPE CONSOLE}\n \nuses\n SysUtils,math;\nvar\n fx,g,r,a,h,w,i,j,count,x,y,sw,m,n,b,c,soeji,sum,max,k,t,z:Integer;\n //l:array of Integer;\n l,l1,l2:int64;\n s,s123,s1,s2,s3:string;\n tf:Boolean;\n //nyu:TStringList;\n xc,yc,space:char;\nbegin\n try\n { TODO -oUser -cConsole Main : ここにコードを記述してください }\n Readln(s);\n fx:=0;\n\n for i := 1 to Length(s) do\n fx:=fx+StrToInt(s[i]);\n\n if StrToInt(s) mod fx =0 then\n Writeln('Yes')\n else\n Writeln('No');\n Readln;\n except\n on E: Exception do\n Writeln(E.ClassName, ': ', E.Message);\n end;\nend.", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 646, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s399571644", "group_id": "codeNet:p03503", "input_text": "var\n\tn,i,j,ans,now,c,a,k:Longint;\n\tf,p:array[1..100,0..10]of Longint;\nbegin\n\tans:=-1000000000;\n\tread(n);\n\tfor i:=1 to n do for j:=0 to 9 do read(f[i,j]);\n\tfor i:=1 to n do for j:=0 to 10 do read(p[i,j]);\n\tfor i:=1 to 1023 do begin\n\t\tnow:=0;\n\t\tfor j:=1 to n do begin\n\t\t\tc:=0;\n\t\t\ta:=i;\n\t\t\tfor k:=0 to 9 do begin\n\t\t\t\tif(a mod 2=1)and(f[j,k]=1)then inc(c);\n\t\t\t\ta:=a div 2;\n\t\t\tend;\n\t\t\tinc(now,p[j,c]);\n\t\tend;\n\t\tif ansmax then max:=ans;\nend;\nprocedure dfs(dep:longint;last:longint);\nvar i:longint;\nbegin\n if dep>0 then check;\n for i:=last+1 to 10 do\n begin\n v[i]:=true;\n dfs(dep+1,i);\n v[i]:=false;\n end;\nend;\nbegin\n read(n);\n max:=-maxlongint;\n for i:=1 to n do\n for j:=1 to 10 do\n read(a[i,j]);\n for i:=1 to n do\n for j:=0 to 10 do\n read(c[i,j]);\n dfs(0,0);\n writeln(max);\nend.\n", "language": "Pascal", "metadata": {"date": 1512358326, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03503.html", "problem_id": "p03503", "resource_group": "low_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/Pascal/s538939449.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s538939449", "user_id": "u165920140"}, "prompt_components": {"gold_output": "8\n", "input_to_evaluate": "var n:longint;\n i,j:longint;\n a,c:array[0..250,0..20]of longint;\n v:array[0..20]of boolean;\n max:int64;\nprocedure check;\nvar i,j,ans,ci:longint;\nbegin\n ans:=0;\n for i:=1 to n do\n begin\n ci:=0;\n for j:=1 to 10 do\n if (v[j]) then inc(ci,a[i,j]);\n inc(ans,c[i,ci]);\n end;\n if ans>max then max:=ans;\nend;\nprocedure dfs(dep:longint;last:longint);\nvar i:longint;\nbegin\n if dep>0 then check;\n for i:=last+1 to 10 do\n begin\n v[i]:=true;\n dfs(dep+1,i);\n v[i]:=false;\n end;\nend;\nbegin\n read(n);\n max:=-maxlongint;\n for i:=1 to n do\n for j:=1 to 10 do\n read(a[i,j]);\n for i:=1 to n do\n for j:=0 to 10 do\n read(c[i,j]);\n dfs(0,0);\n writeln(max);\nend.\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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 699, "cpu_time_ms": 2, "memory_kb": 128}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s287433243", "group_id": "codeNet:p03503", "input_text": "var i,j:longint;\n num:array[0..250]of longint;\n c:array[0..250,0..20]of longint;\n x,cut,toinc,where:longint;\n use:boolean;\n n:longint;\n ans:int64;\nfunction max(a,b:longint):longint;\nbegin\n if a>b then exit(a) else exit(b);\nend;\nbegin\n read(n);\n for i:=1 to n do\n for j:=1 to 10 do\n begin\n read(x);\n inc(num[i],x);\n end;\n for i:=1 to n do\n for j:=0 to 10 do\n read(c[i,j]);\n toinc:=-maxlongint;\n cut:=maxlongint;\n for i:=1 to n do\n begin\n x:=-maxlongint;\n for j:=0 to num[i] do\n begin\n if x0)and(c[i,j]>toinc) then toinc:=c[i,j];\n end;\n if where=0 then if cut>x then cut:=x;\n if where<>0 then use:=true;\n inc(ans,x);\n end;\n if not use then ans:=ans-cut+toinc;\n writeln(ans);\nend.\n\n\n", "language": "Pascal", "metadata": {"date": 1512354584, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03503.html", "problem_id": "p03503", "resource_group": "low_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/Pascal/s287433243.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s287433243", "user_id": "u165920140"}, "prompt_components": {"gold_output": "8\n", "input_to_evaluate": "var i,j:longint;\n num:array[0..250]of longint;\n c:array[0..250,0..20]of longint;\n x,cut,toinc,where:longint;\n use:boolean;\n n:longint;\n ans:int64;\nfunction max(a,b:longint):longint;\nbegin\n if a>b then exit(a) else exit(b);\nend;\nbegin\n read(n);\n for i:=1 to n do\n for j:=1 to 10 do\n begin\n read(x);\n inc(num[i],x);\n end;\n for i:=1 to n do\n for j:=0 to 10 do\n read(c[i,j]);\n toinc:=-maxlongint;\n cut:=maxlongint;\n for i:=1 to n do\n begin\n x:=-maxlongint;\n for j:=0 to num[i] do\n begin\n if x0)and(c[i,j]>toinc) then toinc:=c[i,j];\n end;\n if where=0 then if cut>x then cut:=x;\n if where<>0 then use:=true;\n inc(ans,x);\n end;\n if not use then ans:=ans-cut+toinc;\n writeln(ans);\nend.\n\n\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nJoisino is planning to open a shop in a shopping street.\n\nEach of the five weekdays is divided into two periods, the morning and the evening. For each of those ten periods, a shop must be either open during the whole period, or closed during the whole period. Naturally, a shop must be open during at least one of those periods.\n\nThere are already N stores in the street, numbered 1 through N.\n\nYou are given information of the business hours of those shops, F_{i,j,k}. If F_{i,j,k}=1, Shop i is open during Period k on Day j (this notation is explained below); if F_{i,j,k}=0, Shop i is closed during that period. Here, the days of the week are denoted as follows. Monday: Day 1, Tuesday: Day 2, Wednesday: Day 3, Thursday: Day 4, Friday: Day 5. Also, the morning is denoted as Period 1, and the afternoon is denoted as Period 2.\n\nLet c_i be the number of periods during which both Shop i and Joisino's shop are open. Then, the profit of Joisino's shop will be P_{1,c_1}+P_{2,c_2}+...+P_{N,c_N}.\n\nFind the maximum possible profit of Joisino's shop when she decides whether her shop is open during each period, making sure that it is open during at least one period.\n\nConstraints\n\n1≤N≤100\n\n0≤F_{i,j,k}≤1\n\nFor every integer i such that 1≤i≤N, there exists at least one pair (j,k) such that F_{i,j,k}=1.\n\n-10^7≤P_{i,j}≤10^7\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nF_{1,1,1} F_{1,1,2} ... F_{1,5,1} F_{1,5,2}\n:\nF_{N,1,1} F_{N,1,2} ... F_{N,5,1} F_{N,5,2}\nP_{1,0} ... P_{1,10}\n:\nP_{N,0} ... P_{N,10}\n\nOutput\n\nPrint the maximum possible profit of Joisino's shop.\n\nSample Input 1\n\n1\n1 1 0 1 0 0 0 1 0 1\n3 4 5 6 7 8 9 -2 -3 4 -2\n\nSample Output 1\n\n8\n\nIf her shop is open only during the periods when Shop 1 is opened, the profit will be 8, which is the maximum possible profit.\n\nSample Input 2\n\n2\n1 1 1 1 1 0 0 0 0 0\n0 0 0 0 0 1 1 1 1 1\n0 -2 -2 -2 -2 -2 -1 -1 -1 -1 -1\n0 -2 -2 -2 -2 -2 -1 -1 -1 -1 -1\n\nSample Output 2\n\n-2\n\nNote that a shop must be open during at least one period, and the profit may be negative.\n\nSample Input 3\n\n3\n1 1 1 1 1 1 0 0 1 1\n0 1 0 1 1 1 1 0 1 0\n1 0 1 1 0 1 0 1 0 1\n-8 6 -2 -8 -8 4 8 7 -6 2 2\n-9 2 0 1 7 -5 0 -2 -6 5 5\n6 -6 7 -9 6 -5 8 0 -9 -7 -7\n\nSample Output 3\n\n23", "sample_input": "1\n1 1 0 1 0 0 0 1 0 1\n3 4 5 6 7 8 9 -2 -3 4 -2\n"}, "reference_outputs": ["8\n"], "source_document_id": "p03503", "source_text": "Score : 300 points\n\nProblem Statement\n\nJoisino is planning to open a shop in a shopping street.\n\nEach of the five weekdays is divided into two periods, the morning and the evening. For each of those ten periods, a shop must be either open during the whole period, or closed during the whole period. Naturally, a shop must be open during at least one of those periods.\n\nThere are already N stores in the street, numbered 1 through N.\n\nYou are given information of the business hours of those shops, F_{i,j,k}. If F_{i,j,k}=1, Shop i is open during Period k on Day j (this notation is explained below); if F_{i,j,k}=0, Shop i is closed during that period. Here, the days of the week are denoted as follows. Monday: Day 1, Tuesday: Day 2, Wednesday: Day 3, Thursday: Day 4, Friday: Day 5. Also, the morning is denoted as Period 1, and the afternoon is denoted as Period 2.\n\nLet c_i be the number of periods during which both Shop i and Joisino's shop are open. Then, the profit of Joisino's shop will be P_{1,c_1}+P_{2,c_2}+...+P_{N,c_N}.\n\nFind the maximum possible profit of Joisino's shop when she decides whether her shop is open during each period, making sure that it is open during at least one period.\n\nConstraints\n\n1≤N≤100\n\n0≤F_{i,j,k}≤1\n\nFor every integer i such that 1≤i≤N, there exists at least one pair (j,k) such that F_{i,j,k}=1.\n\n-10^7≤P_{i,j}≤10^7\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nF_{1,1,1} F_{1,1,2} ... F_{1,5,1} F_{1,5,2}\n:\nF_{N,1,1} F_{N,1,2} ... F_{N,5,1} F_{N,5,2}\nP_{1,0} ... P_{1,10}\n:\nP_{N,0} ... P_{N,10}\n\nOutput\n\nPrint the maximum possible profit of Joisino's shop.\n\nSample Input 1\n\n1\n1 1 0 1 0 0 0 1 0 1\n3 4 5 6 7 8 9 -2 -3 4 -2\n\nSample Output 1\n\n8\n\nIf her shop is open only during the periods when Shop 1 is opened, the profit will be 8, which is the maximum possible profit.\n\nSample Input 2\n\n2\n1 1 1 1 1 0 0 0 0 0\n0 0 0 0 0 1 1 1 1 1\n0 -2 -2 -2 -2 -2 -1 -1 -1 -1 -1\n0 -2 -2 -2 -2 -2 -1 -1 -1 -1 -1\n\nSample Output 2\n\n-2\n\nNote that a shop must be open during at least one period, and the profit may be negative.\n\nSample Input 3\n\n3\n1 1 1 1 1 1 0 0 1 1\n0 1 0 1 1 1 1 0 1 0\n1 0 1 1 0 1 0 1 0 1\n-8 6 -2 -8 -8 4 8 7 -6 2 2\n-9 2 0 1 7 -5 0 -2 -6 5 5\n6 -6 7 -9 6 -5 8 0 -9 -7 -7\n\nSample Output 3\n\n23", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 847, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s368353712", "group_id": "codeNet:p03505", "input_text": "var\nk,a,b,s,x:qword;\nbegin\nread(k,a,b);\ns:=0;\nx:=0;\nif b>=a then write(-1)\n else\n begin\n while x=a then write(-1)\n else\n begin\n while x=a then begin writeln('-1');halt;end;\n if a>=k then begin writeln(1);halt;end;\n x:=k-a;\n s:=1+x div (b-a);\n if x mod (b-a)<>0 then inc(s);\n writeln(s);\nend.", "language": "Pascal", "metadata": {"date": 1545871431, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03505.html", "problem_id": "p03505", "resource_group": "low_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/Pascal/s471051919.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s471051919", "user_id": "u018921758"}, "prompt_components": {"gold_output": "5\n", "input_to_evaluate": "var\n k,a,b,s,x:longint;\nbegin\n read(k,a,b);\n if b>=a then begin writeln('-1');halt;end;\n if a>=k then begin writeln(1);halt;end;\n x:=k-a;\n s:=1+x div (b-a);\n if x mod (b-a)<>0 then inc(s);\n writeln(s);\nend.", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 2, "memory_kb": 128}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s870927391", "group_id": "codeNet:p03512", "input_text": "var\n n,k,i,j,x,y:longint;\n a:array[0..30000000] of int64;\n max:int64;\nbegin\n readln(n);\n fillchar(a,sizeof(a),0);\n k:=30000000 div n;\n for i:=1 to n do\n begin\n readln(x,y);\n for j:=1 to k do\n if j mod x=0 then a[j]:=a[j]+y;\n end;\n max:=0;\n for i:=1 to k do\n if a[i]>max then max:=a[i];\n writeln(max);\nend.", "language": "Pascal", "metadata": {"date": 1530847229, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03512.html", "problem_id": "p03512", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03512/input.txt", "sample_output_relpath": "derived/input_output/data/p03512/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03512/Pascal/s870927391.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s870927391", "user_id": "u603541616"}, "prompt_components": {"gold_output": "10\n", "input_to_evaluate": "var\n n,k,i,j,x,y:longint;\n a:array[0..30000000] of int64;\n max:int64;\nbegin\n readln(n);\n fillchar(a,sizeof(a),0);\n k:=30000000 div n;\n for i:=1 to n do\n begin\n readln(x,y);\n for j:=1 to k do\n if j mod x=0 then a[j]:=a[j]+y;\n end;\n max:=0;\n for i:=1 to k do\n if a[i]>max then max:=a[i];\n writeln(max);\nend.", "problem_context": "Score : 100 points\n\nProblem Statement\n\nConsider an infinite sequence a_1, a_2, … Initially, the values of all the terms are 0, and from this state we will sequentially perform Q operations. The i-th operation (1 ≤ i ≤ Q) is as follows:\n\nFor every positive integer j, add x_i to the value of a_{j × m_i}.\n\nFind the value of the largest term after these Q operations.\n\nConstraints\n\n1 ≤ Q ≤ 299\n\n2 ≤ m_i ≤ 300\n\n-10^6 ≤ x_i ≤ 10^6\n\nAll m_i are distinct.\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nQ\nm_1 x_1\n:\nm_Q x_Q\n\nOutput\n\nPrint the value of the largest term after the Q operations.\n\nSample Input 1\n\n3\n2 10\n3 -20\n6 15\n\nSample Output 1\n\n10\n\nThe values of each terms in the sequence a_1, a_2, … change as follows:\n\nBefore the operations: 0, 0, 0, 0, 0, 0, …\n\nAfter the 1-st operation: 0, 10, 0, 10, 0, 10, …\n\nAfter the 2-nd operation: 0, 10, -20, 10, 0, -10, …\n\nAfter the 3-rd operation: 0, 10, -20, 10, 0, 5, …\n\nThe value of the largest term after all the operations is 10.\n\nSample Input 2\n\n3\n10 -3\n50 4\n100 -5\n\nSample Output 2\n\n1\n\nSample Input 3\n\n5\n56 114834\n72 -149861\n100 190757\n192 -132693\n240 133108\n\nSample Output 3\n\n438699", "sample_input": "3\n2 10\n3 -20\n6 15\n"}, "reference_outputs": ["10\n"], "source_document_id": "p03512", "source_text": "Score : 100 points\n\nProblem Statement\n\nConsider an infinite sequence a_1, a_2, … Initially, the values of all the terms are 0, and from this state we will sequentially perform Q operations. The i-th operation (1 ≤ i ≤ Q) is as follows:\n\nFor every positive integer j, add x_i to the value of a_{j × m_i}.\n\nFind the value of the largest term after these Q operations.\n\nConstraints\n\n1 ≤ Q ≤ 299\n\n2 ≤ m_i ≤ 300\n\n-10^6 ≤ x_i ≤ 10^6\n\nAll m_i are distinct.\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nQ\nm_1 x_1\n:\nm_Q x_Q\n\nOutput\n\nPrint the value of the largest term after the Q operations.\n\nSample Input 1\n\n3\n2 10\n3 -20\n6 15\n\nSample Output 1\n\n10\n\nThe values of each terms in the sequence a_1, a_2, … change as follows:\n\nBefore the operations: 0, 0, 0, 0, 0, 0, …\n\nAfter the 1-st operation: 0, 10, 0, 10, 0, 10, …\n\nAfter the 2-nd operation: 0, 10, -20, 10, 0, -10, …\n\nAfter the 3-rd operation: 0, 10, -20, 10, 0, 5, …\n\nThe value of the largest term after all the operations is 10.\n\nSample Input 2\n\n3\n10 -3\n50 4\n100 -5\n\nSample Output 2\n\n1\n\nSample Input 3\n\n5\n56 114834\n72 -149861\n100 190757\n192 -132693\n240 133108\n\nSample Output 3\n\n438699", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 442, "memory_kb": 234496}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s723401026", "group_id": "codeNet:p03526", "input_text": "{$R+,S+,Q+,I+,O-}\n{R-,S-,Q-,I-,O+}\n// Code By H~$~C\n\nuses math;\n\ntype\n int32 = longint;\n double = extended;\n bool = boolean;\n\nconst inf = 1061109567;\n\nvar\n i, j, swap_tmp, x, y, z: int32;\n n, ans: int32;\n h, p: array [0 .. 5005] of int32;\n dp: array [0 .. 5005] of int64;\n\nfunction qsort_less(i, j: int32): bool;\nbegin\n qsort_less := (h[i] + p[i]) < (h[j] + p[j]);\nend;\nprocedure qsort_swap(i, j: int32);\n var _swap_tmp: int32;\nbegin\n _swap_tmp := h[i]; h[i] := h[j]; h[j] := _swap_tmp;\n _swap_tmp := p[i]; p[i] := p[j]; p[j] := _swap_tmp;\nend;\nprocedure qsort(_l, _r: int32);\n var i, j, _p: int32;\nbegin\n if (_r = _l) then exit;\n i := _l; j := _r;\n _p := _l;\n repeat\n while qsort_less(i, _p) do inc(i);\n while qsort_less(_p, j) do dec(j);\n if (i <= j) then begin\n qsort_swap(i, j);\n inc(i); dec(j);\n end;\n until (i > j);\n if (i < _r) then qsort(i, _r);\n if (j > _l) then qsort(_l, j);\nend;\n\nbegin\n// assign(input,'in'); reset(input);\n// assign(output,'1.out'); rewrite(output);\n randseed := 6714;\n \n readln(n);\n for i := 1 to n do begin\n readln(h[i], p[i]);\n end;\n qsort(1, n);\n for i := 1 to n do begin\n writeln(h[i], ' ', p[i]);\n end;\n exit;\n \n fillchar(dp, sizeof(dp), 63);\n dp[0] := 0;\n for i := 1 to n do begin\n for j := i - 1 downto 0 do begin\n if (dp[j] <= h[i]) and (dp[j + 1] > dp[j] + p[i]) then begin\n dp[j + 1] := dp[j] + p[i];\n end;\n end;\n end;\n \n ans := 0;\n for i := 0 to n do begin\n if (dp[i] < 1000000000000000000) then begin\n ans := i;\n end;\n end;\n writeln(ans);\n \n close(input);\n close(output);\nend.\n", "language": "Pascal", "metadata": {"date": 1583799763, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03526.html", "problem_id": "p03526", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03526/input.txt", "sample_output_relpath": "derived/input_output/data/p03526/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03526/Pascal/s723401026.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s723401026", "user_id": "u144695182"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "{$R+,S+,Q+,I+,O-}\n{R-,S-,Q-,I-,O+}\n// Code By H~$~C\n\nuses math;\n\ntype\n int32 = longint;\n double = extended;\n bool = boolean;\n\nconst inf = 1061109567;\n\nvar\n i, j, swap_tmp, x, y, z: int32;\n n, ans: int32;\n h, p: array [0 .. 5005] of int32;\n dp: array [0 .. 5005] of int64;\n\nfunction qsort_less(i, j: int32): bool;\nbegin\n qsort_less := (h[i] + p[i]) < (h[j] + p[j]);\nend;\nprocedure qsort_swap(i, j: int32);\n var _swap_tmp: int32;\nbegin\n _swap_tmp := h[i]; h[i] := h[j]; h[j] := _swap_tmp;\n _swap_tmp := p[i]; p[i] := p[j]; p[j] := _swap_tmp;\nend;\nprocedure qsort(_l, _r: int32);\n var i, j, _p: int32;\nbegin\n if (_r = _l) then exit;\n i := _l; j := _r;\n _p := _l;\n repeat\n while qsort_less(i, _p) do inc(i);\n while qsort_less(_p, j) do dec(j);\n if (i <= j) then begin\n qsort_swap(i, j);\n inc(i); dec(j);\n end;\n until (i > j);\n if (i < _r) then qsort(i, _r);\n if (j > _l) then qsort(_l, j);\nend;\n\nbegin\n// assign(input,'in'); reset(input);\n// assign(output,'1.out'); rewrite(output);\n randseed := 6714;\n \n readln(n);\n for i := 1 to n do begin\n readln(h[i], p[i]);\n end;\n qsort(1, n);\n for i := 1 to n do begin\n writeln(h[i], ' ', p[i]);\n end;\n exit;\n \n fillchar(dp, sizeof(dp), 63);\n dp[0] := 0;\n for i := 1 to n do begin\n for j := i - 1 downto 0 do begin\n if (dp[j] <= h[i]) and (dp[j + 1] > dp[j] + p[i]) then begin\n dp[j + 1] := dp[j] + p[i];\n end;\n end;\n end;\n \n ans := 0;\n for i := 0 to n do begin\n if (dp[i] < 1000000000000000000) then begin\n ans := i;\n end;\n end;\n writeln(ans);\n \n close(input);\n close(output);\nend.\n", "problem_context": "Score : 700 points\n\nProblem Statement\n\nIn the final of CODE FESTIVAL in some year, there are N participants.\nThe height and power of Participant i is H_i and P_i, respectively.\n\nRingo is hosting a game of stacking zabuton (cushions).\n\nThe participants will line up in a row in some order, and they will in turn try to add zabuton to the stack of zabuton.\nInitially, the stack is empty.\nWhen it is Participant i's turn, if there are H_i or less zabuton already stacked, he/she will add exactly P_i zabuton to the stack. Otherwise, he/she will give up and do nothing.\n\nRingo wants to maximize the number of participants who can add zabuton to the stack.\nHow many participants can add zabuton to the stack in the optimal order of participants?\n\nConstraints\n\n1 \\leq N \\leq 5000\n\n0 \\leq H_i \\leq 10^9\n\n1 \\leq P_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nH_1 P_1\nH_2 P_2\n:\nH_N P_N\n\nOutput\n\nPrint the maximum number of participants who can add zabuton to the stack.\n\nSample Input 1\n\n3\n0 2\n1 3\n3 4\n\nSample Output 1\n\n2\n\nWhen the participants line up in the same order as the input, Participants 1 and 3 will be able to add zabuton.\n\nOn the other hand, there is no order such that all three participants can add zabuton. Thus, the answer is 2.\n\nSample Input 2\n\n3\n2 4\n3 1\n4 1\n\nSample Output 2\n\n3\n\nWhen the participants line up in the order 2, 3, 1, all of them will be able to add zabuton.\n\nSample Input 3\n\n10\n1 3\n8 4\n8 3\n9 1\n6 4\n2 3\n4 2\n9 2\n8 3\n0 1\n\nSample Output 3\n\n5", "sample_input": "3\n0 2\n1 3\n3 4\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03526", "source_text": "Score : 700 points\n\nProblem Statement\n\nIn the final of CODE FESTIVAL in some year, there are N participants.\nThe height and power of Participant i is H_i and P_i, respectively.\n\nRingo is hosting a game of stacking zabuton (cushions).\n\nThe participants will line up in a row in some order, and they will in turn try to add zabuton to the stack of zabuton.\nInitially, the stack is empty.\nWhen it is Participant i's turn, if there are H_i or less zabuton already stacked, he/she will add exactly P_i zabuton to the stack. Otherwise, he/she will give up and do nothing.\n\nRingo wants to maximize the number of participants who can add zabuton to the stack.\nHow many participants can add zabuton to the stack in the optimal order of participants?\n\nConstraints\n\n1 \\leq N \\leq 5000\n\n0 \\leq H_i \\leq 10^9\n\n1 \\leq P_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nH_1 P_1\nH_2 P_2\n:\nH_N P_N\n\nOutput\n\nPrint the maximum number of participants who can add zabuton to the stack.\n\nSample Input 1\n\n3\n0 2\n1 3\n3 4\n\nSample Output 1\n\n2\n\nWhen the participants line up in the same order as the input, Participants 1 and 3 will be able to add zabuton.\n\nOn the other hand, there is no order such that all three participants can add zabuton. Thus, the answer is 2.\n\nSample Input 2\n\n3\n2 4\n3 1\n4 1\n\nSample Output 2\n\n3\n\nWhen the participants line up in the order 2, 3, 1, all of them will be able to add zabuton.\n\nSample Input 3\n\n10\n1 3\n8 4\n8 3\n9 1\n6 4\n2 3\n4 2\n9 2\n8 3\n0 1\n\nSample Output 3\n\n5", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1624, "cpu_time_ms": 6, "memory_kb": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s455412857", "group_id": "codeNet:p03526", "input_text": "{$R+,S+,Q+,I+,O-}\n{R-,S-,Q-,I-,O+}\n// Code By H~$~C\n\nuses math;\n\ntype\n int32 = longint;\n double = extended;\n bool = boolean;\n\nconst inf = 1061109567;\n\nvar\n i, j, swap_tmp, x, y, z: int32;\n n, ans: int32;\n h, p: array [0 .. 5005] of int32;\n dp: array [0 .. 5005, 0 .. 5005] of int64;\n\nfunction qsort_less(i, j: int32): bool;\nbegin\n qsort_less := (h[i] + p[i] < h[j] + p[j]);\nend;\nprocedure qsort_swap(i, j: int32);\n var _swap_tmp: int32;\nbegin\n _swap_tmp := h[i]; h[i] := h[j]; h[j] := _swap_tmp;\n _swap_tmp := p[i]; p[i] := p[j]; p[j] := _swap_tmp;\nend;\nprocedure qsort(l, h: int32);\n var i, j, p: int32;\nbegin\n i := l; j := h;\n p := l + random(h - l + 1);\n repeat\n while qsort_less(i, p) do inc(i);\n while qsort_less(p, j) do dec(j);\n if (i <= j) then begin\n qsort_swap(i, j);\n inc(i); dec(j);\n end;\n until (i > j);\n if (i < h) then qsort(i, h);\n if (j > l) then qsort(l, j);\nend;\n\n\nbegin\n// assign(input,'in'); reset(input);\n// assign(output,'out'); rewrite(output);\n randseed := 6714;\n \n readln(n);\n for i := 1 to n do begin\n readln(h[i], p[i]);\n end;\n qsort(1, n);\n \n fillchar(dp, sizeof(dp), 63);\n dp[0, 0] := 0;\n for i := 1 to n do begin\n for j := 0 to i - 1 do begin\n dp[i, j] := dp[i - 1, j];\n end;\n for j := 0 to i - 1 do begin\n if (dp[i - 1, j] <= h[i]) and (dp[i, j + 1] > dp[i - 1, j] + p[i]) then begin\n dp[i, j + 1] := dp[i - 1, j] + p[i];\n end;\n end;\n end;\n \n ans := 0;\n for i := 0 to n do begin\n if (dp[n, i] < 1000000000000000000) then begin\n ans := i;\n end;\n end;\n writeln(ans);\n \n close(input);\n close(output);\nend.\n", "language": "Pascal", "metadata": {"date": 1583796573, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03526.html", "problem_id": "p03526", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03526/input.txt", "sample_output_relpath": "derived/input_output/data/p03526/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03526/Pascal/s455412857.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s455412857", "user_id": "u144695182"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "{$R+,S+,Q+,I+,O-}\n{R-,S-,Q-,I-,O+}\n// Code By H~$~C\n\nuses math;\n\ntype\n int32 = longint;\n double = extended;\n bool = boolean;\n\nconst inf = 1061109567;\n\nvar\n i, j, swap_tmp, x, y, z: int32;\n n, ans: int32;\n h, p: array [0 .. 5005] of int32;\n dp: array [0 .. 5005, 0 .. 5005] of int64;\n\nfunction qsort_less(i, j: int32): bool;\nbegin\n qsort_less := (h[i] + p[i] < h[j] + p[j]);\nend;\nprocedure qsort_swap(i, j: int32);\n var _swap_tmp: int32;\nbegin\n _swap_tmp := h[i]; h[i] := h[j]; h[j] := _swap_tmp;\n _swap_tmp := p[i]; p[i] := p[j]; p[j] := _swap_tmp;\nend;\nprocedure qsort(l, h: int32);\n var i, j, p: int32;\nbegin\n i := l; j := h;\n p := l + random(h - l + 1);\n repeat\n while qsort_less(i, p) do inc(i);\n while qsort_less(p, j) do dec(j);\n if (i <= j) then begin\n qsort_swap(i, j);\n inc(i); dec(j);\n end;\n until (i > j);\n if (i < h) then qsort(i, h);\n if (j > l) then qsort(l, j);\nend;\n\n\nbegin\n// assign(input,'in'); reset(input);\n// assign(output,'out'); rewrite(output);\n randseed := 6714;\n \n readln(n);\n for i := 1 to n do begin\n readln(h[i], p[i]);\n end;\n qsort(1, n);\n \n fillchar(dp, sizeof(dp), 63);\n dp[0, 0] := 0;\n for i := 1 to n do begin\n for j := 0 to i - 1 do begin\n dp[i, j] := dp[i - 1, j];\n end;\n for j := 0 to i - 1 do begin\n if (dp[i - 1, j] <= h[i]) and (dp[i, j + 1] > dp[i - 1, j] + p[i]) then begin\n dp[i, j + 1] := dp[i - 1, j] + p[i];\n end;\n end;\n end;\n \n ans := 0;\n for i := 0 to n do begin\n if (dp[n, i] < 1000000000000000000) then begin\n ans := i;\n end;\n end;\n writeln(ans);\n \n close(input);\n close(output);\nend.\n", "problem_context": "Score : 700 points\n\nProblem Statement\n\nIn the final of CODE FESTIVAL in some year, there are N participants.\nThe height and power of Participant i is H_i and P_i, respectively.\n\nRingo is hosting a game of stacking zabuton (cushions).\n\nThe participants will line up in a row in some order, and they will in turn try to add zabuton to the stack of zabuton.\nInitially, the stack is empty.\nWhen it is Participant i's turn, if there are H_i or less zabuton already stacked, he/she will add exactly P_i zabuton to the stack. Otherwise, he/she will give up and do nothing.\n\nRingo wants to maximize the number of participants who can add zabuton to the stack.\nHow many participants can add zabuton to the stack in the optimal order of participants?\n\nConstraints\n\n1 \\leq N \\leq 5000\n\n0 \\leq H_i \\leq 10^9\n\n1 \\leq P_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nH_1 P_1\nH_2 P_2\n:\nH_N P_N\n\nOutput\n\nPrint the maximum number of participants who can add zabuton to the stack.\n\nSample Input 1\n\n3\n0 2\n1 3\n3 4\n\nSample Output 1\n\n2\n\nWhen the participants line up in the same order as the input, Participants 1 and 3 will be able to add zabuton.\n\nOn the other hand, there is no order such that all three participants can add zabuton. Thus, the answer is 2.\n\nSample Input 2\n\n3\n2 4\n3 1\n4 1\n\nSample Output 2\n\n3\n\nWhen the participants line up in the order 2, 3, 1, all of them will be able to add zabuton.\n\nSample Input 3\n\n10\n1 3\n8 4\n8 3\n9 1\n6 4\n2 3\n4 2\n9 2\n8 3\n0 1\n\nSample Output 3\n\n5", "sample_input": "3\n0 2\n1 3\n3 4\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03526", "source_text": "Score : 700 points\n\nProblem Statement\n\nIn the final of CODE FESTIVAL in some year, there are N participants.\nThe height and power of Participant i is H_i and P_i, respectively.\n\nRingo is hosting a game of stacking zabuton (cushions).\n\nThe participants will line up in a row in some order, and they will in turn try to add zabuton to the stack of zabuton.\nInitially, the stack is empty.\nWhen it is Participant i's turn, if there are H_i or less zabuton already stacked, he/she will add exactly P_i zabuton to the stack. Otherwise, he/she will give up and do nothing.\n\nRingo wants to maximize the number of participants who can add zabuton to the stack.\nHow many participants can add zabuton to the stack in the optimal order of participants?\n\nConstraints\n\n1 \\leq N \\leq 5000\n\n0 \\leq H_i \\leq 10^9\n\n1 \\leq P_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nH_1 P_1\nH_2 P_2\n:\nH_N P_N\n\nOutput\n\nPrint the maximum number of participants who can add zabuton to the stack.\n\nSample Input 1\n\n3\n0 2\n1 3\n3 4\n\nSample Output 1\n\n2\n\nWhen the participants line up in the same order as the input, Participants 1 and 3 will be able to add zabuton.\n\nOn the other hand, there is no order such that all three participants can add zabuton. Thus, the answer is 2.\n\nSample Input 2\n\n3\n2 4\n3 1\n4 1\n\nSample Output 2\n\n3\n\nWhen the participants line up in the order 2, 3, 1, all of them will be able to add zabuton.\n\nSample Input 3\n\n10\n1 3\n8 4\n8 3\n9 1\n6 4\n2 3\n4 2\n9 2\n8 3\n0 1\n\nSample Output 3\n\n5", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1644, "cpu_time_ms": 288, "memory_kb": 195968}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s880481215", "group_id": "codeNet:p03543", "input_text": "var cc : array [0..100] of int64;\n i,j,k,n : int64 ;\nbegin\n readln(n) ;\n cc[0]:=2;\n cc[1]:=1;\n for i:=2 to n do\n cc[i]:=cc[i-1]+cc[i-2];\n writeln(cc[n]);\nend.\n", "language": "Pascal", "metadata": {"date": 1511061955, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03543.html", "problem_id": "p03543", "resource_group": "low_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/Pascal/s880481215.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s880481215", "user_id": "u704549083"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "var cc : array [0..100] of int64;\n i,j,k,n : int64 ;\nbegin\n readln(n) ;\n cc[0]:=2;\n cc[1]:=1;\n for i:=2 to n do\n cc[i]:=cc[i-1]+cc[i-2];\n writeln(cc[n]);\nend.\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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 99, "memory_kb": 128}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s530294059", "group_id": "codeNet:p03544", "input_text": "var\nn:integer;\nfunction f(x:integer):qword;\nbegin\n if x=0 then exit(2)\n else if x=1 then exit(1)\n else exit(f(x-1)+f(x-2));\nend;\nbegin\nread(n);\nwriteln(f(n));\nend.", "language": "Pascal", "metadata": {"date": 1582852265, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03544.html", "problem_id": "p03544", "resource_group": "low_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/Pascal/s530294059.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s530294059", "user_id": "u723721005"}, "prompt_components": {"gold_output": "11\n", "input_to_evaluate": "var\nn:integer;\nfunction f(x:integer):qword;\nbegin\n if x=0 then exit(2)\n else if x=1 then exit(1)\n else exit(f(x-1)+f(x-2));\nend;\nbegin\nread(n);\nwriteln(f(n));\nend.", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 2103, "memory_kb": 128}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s120279866", "group_id": "codeNet:p03545", "input_text": "var\n x1,x2,x3:char;\n i,j,k,n,s:longint;\nbegin\n readln(n);\n for i:=0 to 1 do\n for j:=0 to 1 do\n for k:=0 to 1 do\n begin\n s:=n div 1000;\n if i=0 then begin s:=s+n div 100 mod 10;x1:='+';end\n else begin s:=s-n div 100 mod 10;x1:='-';end;\n if j=0 then begin s:=s+n div 10 mod 10;x2:='+';end\n else begin s:=s-n div 10 mod 10;x2:='-';end;\n if k=0 then begin s:=s+n mod 10;x3:='+';end\n else begin s:=s-n mod 10;x3:='-';end;\n if s=7 then begin writeln(n div 1000,x1,n div 100 mod 10,x2,n div 10 mod 10,x3,n mod 10);exit;end;\n end;\nend.", "language": "Pascal", "metadata": {"date": 1581728069, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03545.html", "problem_id": "p03545", "resource_group": "low_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/Pascal/s120279866.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s120279866", "user_id": "u476418095"}, "prompt_components": {"gold_output": "1+2+2+2=7\n", "input_to_evaluate": "var\n x1,x2,x3:char;\n i,j,k,n,s:longint;\nbegin\n readln(n);\n for i:=0 to 1 do\n for j:=0 to 1 do\n for k:=0 to 1 do\n begin\n s:=n div 1000;\n if i=0 then begin s:=s+n div 100 mod 10;x1:='+';end\n else begin s:=s-n div 100 mod 10;x1:='-';end;\n if j=0 then begin s:=s+n div 10 mod 10;x2:='+';end\n else begin s:=s-n div 10 mod 10;x2:='-';end;\n if k=0 then begin s:=s+n mod 10;x3:='+';end\n else begin s:=s-n mod 10;x3:='-';end;\n if s=7 then begin writeln(n div 1000,x1,n div 100 mod 10,x2,n div 10 mod 10,x3,n mod 10);exit;end;\n end;\nend.", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 631, "cpu_time_ms": 3, "memory_kb": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s370604336", "group_id": "codeNet:p03546", "input_text": "var c,y,next,first,dist,q:array[0..500020] of int64;\nvar v:array[0..500020] of boolean;\nvar n,m,i,j,s,x,y1,z,tot,ans:longint;\nprocedure add(x,y1,z:longint);\nbegin\n inc(tot);next[tot]:=first[x];first[x]:=tot;y[tot]:=y1;c[tot]:=z;\nend;\nprocedure spfa(s:longint);\nvar i,now,h,t:longint;\nbegin\n for i:=0 to 200 do begin v[i]:=false;dist[i]:=2147483647;end;dist[s]:=0;\n h:=0;t:=1;v[s]:=true;q[1]:=s;\n while h-1 do\n begin\n if dist[y[i]]>dist[now]+c[i] then\n begin\n dist[y[i]]:=dist[now]+c[i];\n if not v[y[i]] then\n begin\n inc(t);q[t]:=y[i];v[y[i]]:=true;\n end;\n end;\n i:=next[i];\n end;\n v[now]:=false;\n end;\nend;\nbegin\n read(n,m);\n for i:=0 to 200 do first[i]:=-1;\n for i:=0 to 9 do for j:=0 to 9 do begin read(x);if x<>0 then\n begin //add(i+1,j+1,x);\n add(j+1,i+1,x);\n end;end;\n spfa(2);\n //for i:=1 to 10 do writeln(dist[i]);ans:=0;\n for i:=1 to n do for j:=1 to m do begin read(x);\n if x>=0 then inc(ans,dist[x+1]);end;writeln(ans);\nend.\n", "language": "Pascal", "metadata": {"date": 1511059433, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03546.html", "problem_id": "p03546", "resource_group": "low_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/Pascal/s370604336.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s370604336", "user_id": "u379604713"}, "prompt_components": {"gold_output": "12\n", "input_to_evaluate": "var c,y,next,first,dist,q:array[0..500020] of int64;\nvar v:array[0..500020] of boolean;\nvar n,m,i,j,s,x,y1,z,tot,ans:longint;\nprocedure add(x,y1,z:longint);\nbegin\n inc(tot);next[tot]:=first[x];first[x]:=tot;y[tot]:=y1;c[tot]:=z;\nend;\nprocedure spfa(s:longint);\nvar i,now,h,t:longint;\nbegin\n for i:=0 to 200 do begin v[i]:=false;dist[i]:=2147483647;end;dist[s]:=0;\n h:=0;t:=1;v[s]:=true;q[1]:=s;\n while h-1 do\n begin\n if dist[y[i]]>dist[now]+c[i] then\n begin\n dist[y[i]]:=dist[now]+c[i];\n if not v[y[i]] then\n begin\n inc(t);q[t]:=y[i];v[y[i]]:=true;\n end;\n end;\n i:=next[i];\n end;\n v[now]:=false;\n end;\nend;\nbegin\n read(n,m);\n for i:=0 to 200 do first[i]:=-1;\n for i:=0 to 9 do for j:=0 to 9 do begin read(x);if x<>0 then\n begin //add(i+1,j+1,x);\n add(j+1,i+1,x);\n end;end;\n spfa(2);\n //for i:=1 to 10 do writeln(dist[i]);ans:=0;\n for i:=1 to n do for j:=1 to m do begin read(x);\n if x>=0 then inc(ans,dist[x+1]);end;writeln(ans);\nend.\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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1079, "cpu_time_ms": 5, "memory_kb": 10368}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s935063071", "group_id": "codeNet:p03546", "input_text": "var c,y,next,first,dist,q:array[0..500020] of int64;\nvar v:array[0..500020] of boolean;\nvar n,m,i,j,s,x,y1,z,tot,ans:longint;\nprocedure add(x,y1,z:longint);\nbegin\n inc(tot);next[tot]:=first[x];first[x]:=tot;y[tot]:=y1;c[tot]:=z;\nend;\nprocedure spfa(s:longint);\nvar i,now,h,t:longint;\nbegin\n for i:=0 to 200 do begin v[i]:=false;dist[i]:=2147483647;end;dist[s]:=0;\n h:=0;t:=1;v[s]:=true;q[1]:=s;\n while h-1 do\n begin\n if dist[y[i]]>dist[now]+c[i] then\n begin\n dist[y[i]]:=dist[now]+c[i];\n if not v[y[i]] then\n begin\n inc(t);q[t]:=y[i];v[y[i]]:=true;\n end;\n end;\n i:=next[i];\n end;\n v[now]:=false;\n end;\nend;\nbegin\n read(n,m);\n for i:=0 to 200 do first[i]:=-1;\n for i:=0 to 9 do for j:=0 to 9 do begin read(x);//if x<>0 then\n begin add(i+1,j+1,x);add(j+1,i+1,x);end;end;\n spfa(2);\n //for i:=1 to 10 do writeln(dist[i]);ans:=0;\n for i:=1 to n do for j:=1 to m do begin read(x);\n if x>=0 then inc(ans,dist[x+1]);end;writeln(ans);\nend.", "language": "Pascal", "metadata": {"date": 1511059157, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03546.html", "problem_id": "p03546", "resource_group": "low_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/Pascal/s935063071.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s935063071", "user_id": "u379604713"}, "prompt_components": {"gold_output": "12\n", "input_to_evaluate": "var c,y,next,first,dist,q:array[0..500020] of int64;\nvar v:array[0..500020] of boolean;\nvar n,m,i,j,s,x,y1,z,tot,ans:longint;\nprocedure add(x,y1,z:longint);\nbegin\n inc(tot);next[tot]:=first[x];first[x]:=tot;y[tot]:=y1;c[tot]:=z;\nend;\nprocedure spfa(s:longint);\nvar i,now,h,t:longint;\nbegin\n for i:=0 to 200 do begin v[i]:=false;dist[i]:=2147483647;end;dist[s]:=0;\n h:=0;t:=1;v[s]:=true;q[1]:=s;\n while h-1 do\n begin\n if dist[y[i]]>dist[now]+c[i] then\n begin\n dist[y[i]]:=dist[now]+c[i];\n if not v[y[i]] then\n begin\n inc(t);q[t]:=y[i];v[y[i]]:=true;\n end;\n end;\n i:=next[i];\n end;\n v[now]:=false;\n end;\nend;\nbegin\n read(n,m);\n for i:=0 to 200 do first[i]:=-1;\n for i:=0 to 9 do for j:=0 to 9 do begin read(x);//if x<>0 then\n begin add(i+1,j+1,x);add(j+1,i+1,x);end;end;\n spfa(2);\n //for i:=1 to 10 do writeln(dist[i]);ans:=0;\n for i:=1 to n do for j:=1 to m do begin read(x);\n if x>=0 then inc(ans,dist[x+1]);end;writeln(ans);\nend.", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1072, "cpu_time_ms": 5, "memory_kb": 10368}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s882132896", "group_id": "codeNet:p03546", "input_text": "var n,m:longint;\n i,j,k:longint;\n a:array[0..10,0..10]of longint;\n x:longint;\n ans:longint;\nbegin\n readln(n,m);\n for i:=0 to 9 do\n begin\n for j:=0 to 9 do\n read(a[i,j]);\n readln;\n end;\n for k:=0 to 9 do\n for i:=0 to 9 do\n for j:=0 to 9 do\n if a[i,j]>a[i,k]+a[k,j] then a[i,j]:=a[i,k]+a[k,j];\n for i:=1 to n*m do\n begin\n read(x);\n if x<>-1 then inc(ans,a[x,1]);\n end;\n writeln(ans);\nend.", "language": "Pascal", "metadata": {"date": 1511058314, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03546.html", "problem_id": "p03546", "resource_group": "low_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/Pascal/s882132896.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s882132896", "user_id": "u165920140"}, "prompt_components": {"gold_output": "12\n", "input_to_evaluate": "var n,m:longint;\n i,j,k:longint;\n a:array[0..10,0..10]of longint;\n x:longint;\n ans:longint;\nbegin\n readln(n,m);\n for i:=0 to 9 do\n begin\n for j:=0 to 9 do\n read(a[i,j]);\n readln;\n end;\n for k:=0 to 9 do\n for i:=0 to 9 do\n for j:=0 to 9 do\n if a[i,j]>a[i,k]+a[k,j] then a[i,j]:=a[i,k]+a[k,j];\n for i:=1 to n*m do\n begin\n read(x);\n if x<>-1 then inc(ans,a[x,1]);\n end;\n writeln(ans);\nend.", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 3, "memory_kb": 128}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s739655055", "group_id": "codeNet:p03547", "input_text": "program Project1;\n \n{$APPTYPE CONSOLE}\n \nuses\n SysUtils,math;\nvar\n g,l,r,a,h,w,i,j,count,x,y,sw,m,n,b,c,soeji,sum,max,k,t:Integer;\n //l:array of Integer;\n s,s123,s1,s2,s3:string;\n tf:Boolean;\n //nyu:TStringList;\n xc,yc,space:char;\nbegin\n try\n { TODO -oUser -cConsole Main : ここにコードを記述してください }\n Read(xc);\n Read(space);\n Readln(yc);\n\n if Ord(xc)>Ord(yc) then\n Writeln('>')\n else if Ord(xc)=Ord(yc) then\n Writeln('=')\n else\n Writeln('<');\n Readln;\n except\n on E: Exception do\n Writeln(E.ClassName, ': ', E.Message);\n end;\nend.", "language": "Pascal", "metadata": {"date": 1517350630, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03547.html", "problem_id": "p03547", "resource_group": "low_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/Pascal/s739655055.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s739655055", "user_id": "u755925739"}, "prompt_components": {"gold_output": "<\n", "input_to_evaluate": "program Project1;\n \n{$APPTYPE CONSOLE}\n \nuses\n SysUtils,math;\nvar\n g,l,r,a,h,w,i,j,count,x,y,sw,m,n,b,c,soeji,sum,max,k,t:Integer;\n //l:array of Integer;\n s,s123,s1,s2,s3:string;\n tf:Boolean;\n //nyu:TStringList;\n xc,yc,space:char;\nbegin\n try\n { TODO -oUser -cConsole Main : ここにコードを記述してください }\n Read(xc);\n Read(space);\n Readln(yc);\n\n if Ord(xc)>Ord(yc) then\n Writeln('>')\n else if Ord(xc)=Ord(yc) then\n Writeln('=')\n else\n Writeln('<');\n Readln;\n except\n on E: Exception do\n Writeln(E.ClassName, ': ', E.Message);\n end;\nend.", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 621, "cpu_time_ms": 2, "memory_kb": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s699495130", "group_id": "codeNet:p03548", "input_text": "program ISU;\nvar x,y,z,t : integer;\nbegin\n\tread(x);\n\tread(y);\n\tread(z);\n\tx := x-z;\n\tx := x div (y+z);\n\twriteln(x);\nend.", "language": "Pascal", "metadata": {"date": 1577241234, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03548.html", "problem_id": "p03548", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03548/input.txt", "sample_output_relpath": "derived/input_output/data/p03548/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03548/Pascal/s699495130.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s699495130", "user_id": "u863370423"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "program ISU;\nvar x,y,z,t : integer;\nbegin\n\tread(x);\n\tread(y);\n\tread(z);\n\tx := x-z;\n\tx := x div (y+z);\n\twriteln(x);\nend.", "problem_context": "Score : 200 points\n\nProblem Statement\n\nWe have a long seat of width X centimeters.\nThere are many people who wants to sit here. A person sitting on the seat will always occupy an interval of length Y centimeters.\n\nWe would like to seat as many people as possible, but they are all very shy, and there must be a gap of length at least Z centimeters between two people, and between the end of the seat and a person.\n\nAt most how many people can sit on the seat?\n\nConstraints\n\nAll input values are integers.\n\n1 \\leq X, Y, Z \\leq 10^5\n\nY+2Z \\leq X\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX Y Z\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n13 3 1\n\nSample Output 1\n\n3\n\nThere is just enough room for three, as shown below:\n\nFigure\n\nSample Input 2\n\n12 3 1\n\nSample Output 2\n\n2\n\nSample Input 3\n\n100000 1 1\n\nSample Output 3\n\n49999\n\nSample Input 4\n\n64146 123 456\n\nSample Output 4\n\n110\n\nSample Input 5\n\n64145 123 456\n\nSample Output 5\n\n109", "sample_input": "13 3 1\n"}, "reference_outputs": ["3\n"], "source_document_id": "p03548", "source_text": "Score : 200 points\n\nProblem Statement\n\nWe have a long seat of width X centimeters.\nThere are many people who wants to sit here. A person sitting on the seat will always occupy an interval of length Y centimeters.\n\nWe would like to seat as many people as possible, but they are all very shy, and there must be a gap of length at least Z centimeters between two people, and between the end of the seat and a person.\n\nAt most how many people can sit on the seat?\n\nConstraints\n\nAll input values are integers.\n\n1 \\leq X, Y, Z \\leq 10^5\n\nY+2Z \\leq X\n\nInput\n\nInput is given from Standard Input in the following format:\n\nX Y Z\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n13 3 1\n\nSample Output 1\n\n3\n\nThere is just enough room for three, as shown below:\n\nFigure\n\nSample Input 2\n\n12 3 1\n\nSample Output 2\n\n2\n\nSample Input 3\n\n100000 1 1\n\nSample Output 3\n\n49999\n\nSample Input 4\n\n64146 123 456\n\nSample Output 4\n\n110\n\nSample Input 5\n\n64145 123 456\n\nSample Output 5\n\n109", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 119, "cpu_time_ms": 2, "memory_kb": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s266595574", "group_id": "codeNet:p03549", "input_text": "uses math;\nconst test: integer = 1900;\nvar\n n, m: integer;\n\nbegin\n readln(n, m);\n writeln(((1900 * m + 100 * (n - m)) * power(2, m)):0:0);\nend.", "language": "Pascal", "metadata": {"date": 1532717348, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03549.html", "problem_id": "p03549", "resource_group": "low_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/Pascal/s266595574.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s266595574", "user_id": "u876923215"}, "prompt_components": {"gold_output": "3800\n", "input_to_evaluate": "uses math;\nconst test: integer = 1900;\nvar\n n, m: integer;\n\nbegin\n readln(n, m);\n writeln(((1900 * m + 100 * (n - m)) * power(2, m)):0:0);\nend.", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s674244292", "group_id": "codeNet:p03550", "input_text": "uses math;\nvar n,z,w,i:longint;\n p:array[0..2000]of longint;\nbegin\n readln(n,z,w);\n for i:=1 to n do\n read(p[n]);\n if n=1 then\n writeln(abs(p[n])-w)\n else\n writeln(max(abs(p[n]-p[n-1]),abs(p[n]-w)));\nend.", "language": "Pascal", "metadata": {"date": 1583527145, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03550.html", "problem_id": "p03550", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03550/input.txt", "sample_output_relpath": "derived/input_output/data/p03550/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03550/Pascal/s674244292.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s674244292", "user_id": "u743614777"}, "prompt_components": {"gold_output": "900\n", "input_to_evaluate": "uses math;\nvar n,z,w,i:longint;\n p:array[0..2000]of longint;\nbegin\n readln(n,z,w);\n for i:=1 to n do\n read(p[n]);\n if n=1 then\n writeln(abs(p[n])-w)\n else\n writeln(max(abs(p[n]-p[n-1]),abs(p[n]-w)));\nend.", "problem_context": "Score : 500 points\n\nProblem Statement\n\nWe have a deck consisting of N cards. Each card has an integer written on it. The integer on the i-th card from the top is a_i.\n\nTwo people X and Y will play a game using this deck. Initially, X has a card with Z written on it in his hand, and Y has a card with W written on it in his hand. Then, starting from X, they will alternately perform the following action:\n\nDraw some number of cards from the top of the deck. Then, discard the card in his hand and keep the last drawn card instead. Here, at least one card must be drawn.\n\nThe game ends when there is no more card in the deck. The score of the game is the absolute difference of the integers written on the cards in the two players' hand.\n\nX will play the game so that the score will be maximized, and Y will play the game so that the score will be minimized. What will be the score of the game?\n\nConstraints\n\nAll input values are integers.\n\n1 \\leq N \\leq 2000\n\n1 \\leq Z, W, a_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN Z W\na_1 a_2 ... a_N\n\nOutput\n\nPrint the score.\n\nSample Input 1\n\n3 100 100\n10 1000 100\n\nSample Output 1\n\n900\n\nIf X draws two cards first, Y will draw the last card, and the score will be |1000 - 100| = 900.\n\nSample Input 2\n\n3 100 1000\n10 100 100\n\nSample Output 2\n\n900\n\nIf X draws all the cards first, the score will be |1000 - 100| = 900.\n\nSample Input 3\n\n5 1 1\n1 1 1 1 1\n\nSample Output 3\n\n0\n\nSample Input 4\n\n1 1 1\n1000000000\n\nSample Output 4\n\n999999999", "sample_input": "3 100 100\n10 1000 100\n"}, "reference_outputs": ["900\n"], "source_document_id": "p03550", "source_text": "Score : 500 points\n\nProblem Statement\n\nWe have a deck consisting of N cards. Each card has an integer written on it. The integer on the i-th card from the top is a_i.\n\nTwo people X and Y will play a game using this deck. Initially, X has a card with Z written on it in his hand, and Y has a card with W written on it in his hand. Then, starting from X, they will alternately perform the following action:\n\nDraw some number of cards from the top of the deck. Then, discard the card in his hand and keep the last drawn card instead. Here, at least one card must be drawn.\n\nThe game ends when there is no more card in the deck. The score of the game is the absolute difference of the integers written on the cards in the two players' hand.\n\nX will play the game so that the score will be maximized, and Y will play the game so that the score will be minimized. What will be the score of the game?\n\nConstraints\n\nAll input values are integers.\n\n1 \\leq N \\leq 2000\n\n1 \\leq Z, W, a_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN Z W\na_1 a_2 ... a_N\n\nOutput\n\nPrint the score.\n\nSample Input 1\n\n3 100 100\n10 1000 100\n\nSample Output 1\n\n900\n\nIf X draws two cards first, Y will draw the last card, and the score will be |1000 - 100| = 900.\n\nSample Input 2\n\n3 100 1000\n10 100 100\n\nSample Output 2\n\n900\n\nIf X draws all the cards first, the score will be |1000 - 100| = 900.\n\nSample Input 3\n\n5 1 1\n1 1 1 1 1\n\nSample Output 3\n\n0\n\nSample Input 4\n\n1 1 1\n1000000000\n\nSample Output 4\n\n999999999", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s857041061", "group_id": "codeNet:p03550", "input_text": "var z,w,n,i,j,ans,max,min:longint;\nvar a:array[0..2020] of longint;\nbegin \n read(n,z,w);min:=2147483647;max:=-2147483647;\n for i:=1 to n do begin read(a[i]);if a[i]max then max:=a[i];end;\n ans:=abs(max-a[n]);\n if ansmax then max:=a[i];end;\n ans:=abs(max-a[n]);\n if ans' ' do dec(i);\n\tfor z:=i+1 to length(s) do b:=b*10+ord(s[z])-48;\n\tdec(i);\n\tt:=i;\n\twhile(i>0)and(s[i]>' ')do dec(i);\n\tfor z:=i+1 to t do a:=a*10+ord(s[z])-48;\n\twriteln(Max(abs(b-w),abs(a-b)));\nend.\n", "language": "Pascal", "metadata": {"date": 1539817408, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03552.html", "problem_id": "p03552", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03552/input.txt", "sample_output_relpath": "derived/input_output/data/p03552/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03552/Pascal/s358561279.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s358561279", "user_id": "u657913472"}, "prompt_components": {"gold_output": "900\n", "input_to_evaluate": "Uses math;\nvar\n\tn,i,z,w,a,b,t:Longint;\n\ts:String;\nbegin\n\treadln(n,z,w);\n\tif n=1 then begin\n\t\tread(b);\n\t\twriteln(abs(b-w));\n\t\texit;\n\tend;\n\tsetlength(s,n*11+100);\n\treadln(s);\n\ti:=length(s);\n\twhile s[i]>' ' do dec(i);\n\tfor z:=i+1 to length(s) do b:=b*10+ord(s[z])-48;\n\tdec(i);\n\tt:=i;\n\twhile(i>0)and(s[i]>' ')do dec(i);\n\tfor z:=i+1 to t do a:=a*10+ord(s[z])-48;\n\twriteln(Max(abs(b-w),abs(a-b)));\nend.\n", "problem_context": "Score : 500 points\n\nProblem Statement\n\nWe have a deck consisting of N cards. Each card has an integer written on it. The integer on the i-th card from the top is a_i.\n\nTwo people X and Y will play a game using this deck. Initially, X has a card with Z written on it in his hand, and Y has a card with W written on it in his hand. Then, starting from X, they will alternately perform the following action:\n\nDraw some number of cards from the top of the deck. Then, discard the card in his hand and keep the last drawn card instead. Here, at least one card must be drawn.\n\nThe game ends when there is no more card in the deck. The score of the game is the absolute difference of the integers written on the cards in the two players' hand.\n\nX will play the game so that the score will be maximized, and Y will play the game so that the score will be minimized. What will be the score of the game?\n\nConstraints\n\nAll input values are integers.\n\n1 \\leq N \\leq 2000\n\n1 \\leq Z, W, a_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN Z W\na_1 a_2 ... a_N\n\nOutput\n\nPrint the score.\n\nSample Input 1\n\n3 100 100\n10 1000 100\n\nSample Output 1\n\n900\n\nIf X draws two cards first, Y will draw the last card, and the score will be |1000 - 100| = 900.\n\nSample Input 2\n\n3 100 1000\n10 100 100\n\nSample Output 2\n\n900\n\nIf X draws all the cards first, the score will be |1000 - 100| = 900.\n\nSample Input 3\n\n5 1 1\n1 1 1 1 1\n\nSample Output 3\n\n0\n\nSample Input 4\n\n1 1 1\n1000000000\n\nSample Output 4\n\n999999999", "sample_input": "3 100 100\n10 1000 100\n"}, "reference_outputs": ["900\n"], "source_document_id": "p03552", "source_text": "Score : 500 points\n\nProblem Statement\n\nWe have a deck consisting of N cards. Each card has an integer written on it. The integer on the i-th card from the top is a_i.\n\nTwo people X and Y will play a game using this deck. Initially, X has a card with Z written on it in his hand, and Y has a card with W written on it in his hand. Then, starting from X, they will alternately perform the following action:\n\nDraw some number of cards from the top of the deck. Then, discard the card in his hand and keep the last drawn card instead. Here, at least one card must be drawn.\n\nThe game ends when there is no more card in the deck. The score of the game is the absolute difference of the integers written on the cards in the two players' hand.\n\nX will play the game so that the score will be maximized, and Y will play the game so that the score will be minimized. What will be the score of the game?\n\nConstraints\n\nAll input values are integers.\n\n1 \\leq N \\leq 2000\n\n1 \\leq Z, W, a_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN Z W\na_1 a_2 ... a_N\n\nOutput\n\nPrint the score.\n\nSample Input 1\n\n3 100 100\n10 1000 100\n\nSample Output 1\n\n900\n\nIf X draws two cards first, Y will draw the last card, and the score will be |1000 - 100| = 900.\n\nSample Input 2\n\n3 100 1000\n10 100 100\n\nSample Output 2\n\n900\n\nIf X draws all the cards first, the score will be |1000 - 100| = 900.\n\nSample Input 3\n\n5 1 1\n1 1 1 1 1\n\nSample Output 3\n\n0\n\nSample Input 4\n\n1 1 1\n1000000000\n\nSample Output 4\n\n999999999", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 397, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s759360177", "group_id": "codeNet:p03552", "input_text": "program HelloWorld;\n var n,z,w:longint;\n var i,j:longint;\n var a:array [1..2000] of longint;\n var sx,sy:array[1..2000]of longint;\n var p,q:longint;\n var turn:boolean;\n var t:longint;\nbegin\n readln(n,z,w);\n for i:=1 to n do read(a[i]);\n for i:=n-1 downto 1 do\n begin\n sx[i]:=0;\n sy[i]:=1000000001;\n for j:=i+1 to n do\n begin\n if abs(a[i]-a[j])>=sx[i] then sx[i]:=abs(a[i]-a[j]);\n if abs(a[i]-a[j])<=sy[i] then sy[i]:=abs(a[i]-a[j]);\n end;\n end;\n p:=0;\n turn:=true;\n if n=1 then\n writeln(abs(w-a[n]))\n else\n begin\n while p<>n do\n begin\n if turn then\n begin\n sy[n]:=abs(a[n]-w);\n t:=abs(a[n]-w);;\n for i:=p+1 to n do\n if sy[i]>=t then\n begin\n t:=sy[i];\n q:=i;\n end;\n z:=a[q];\n p:=q;\n turn:=false;\n end\n else\n begin\n sx[n]:=abs(a[n]-z);\n t:=abs(a[n]-z);\n for i:=p+1 to n do\n if sx[i]<=t then\n begin\n t:=sx[i];\n q:=i;\n end;\n w:=a[q];\n p:=q;\n turn:=true;\n end;\n end;\n writeln(abs(z-w));\n end;\nend.", "language": "Pascal", "metadata": {"date": 1510457930, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03552.html", "problem_id": "p03552", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03552/input.txt", "sample_output_relpath": "derived/input_output/data/p03552/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03552/Pascal/s759360177.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s759360177", "user_id": "u566971318"}, "prompt_components": {"gold_output": "900\n", "input_to_evaluate": "program HelloWorld;\n var n,z,w:longint;\n var i,j:longint;\n var a:array [1..2000] of longint;\n var sx,sy:array[1..2000]of longint;\n var p,q:longint;\n var turn:boolean;\n var t:longint;\nbegin\n readln(n,z,w);\n for i:=1 to n do read(a[i]);\n for i:=n-1 downto 1 do\n begin\n sx[i]:=0;\n sy[i]:=1000000001;\n for j:=i+1 to n do\n begin\n if abs(a[i]-a[j])>=sx[i] then sx[i]:=abs(a[i]-a[j]);\n if abs(a[i]-a[j])<=sy[i] then sy[i]:=abs(a[i]-a[j]);\n end;\n end;\n p:=0;\n turn:=true;\n if n=1 then\n writeln(abs(w-a[n]))\n else\n begin\n while p<>n do\n begin\n if turn then\n begin\n sy[n]:=abs(a[n]-w);\n t:=abs(a[n]-w);;\n for i:=p+1 to n do\n if sy[i]>=t then\n begin\n t:=sy[i];\n q:=i;\n end;\n z:=a[q];\n p:=q;\n turn:=false;\n end\n else\n begin\n sx[n]:=abs(a[n]-z);\n t:=abs(a[n]-z);\n for i:=p+1 to n do\n if sx[i]<=t then\n begin\n t:=sx[i];\n q:=i;\n end;\n w:=a[q];\n p:=q;\n turn:=true;\n end;\n end;\n writeln(abs(z-w));\n end;\nend.", "problem_context": "Score : 500 points\n\nProblem Statement\n\nWe have a deck consisting of N cards. Each card has an integer written on it. The integer on the i-th card from the top is a_i.\n\nTwo people X and Y will play a game using this deck. Initially, X has a card with Z written on it in his hand, and Y has a card with W written on it in his hand. Then, starting from X, they will alternately perform the following action:\n\nDraw some number of cards from the top of the deck. Then, discard the card in his hand and keep the last drawn card instead. Here, at least one card must be drawn.\n\nThe game ends when there is no more card in the deck. The score of the game is the absolute difference of the integers written on the cards in the two players' hand.\n\nX will play the game so that the score will be maximized, and Y will play the game so that the score will be minimized. What will be the score of the game?\n\nConstraints\n\nAll input values are integers.\n\n1 \\leq N \\leq 2000\n\n1 \\leq Z, W, a_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN Z W\na_1 a_2 ... a_N\n\nOutput\n\nPrint the score.\n\nSample Input 1\n\n3 100 100\n10 1000 100\n\nSample Output 1\n\n900\n\nIf X draws two cards first, Y will draw the last card, and the score will be |1000 - 100| = 900.\n\nSample Input 2\n\n3 100 1000\n10 100 100\n\nSample Output 2\n\n900\n\nIf X draws all the cards first, the score will be |1000 - 100| = 900.\n\nSample Input 3\n\n5 1 1\n1 1 1 1 1\n\nSample Output 3\n\n0\n\nSample Input 4\n\n1 1 1\n1000000000\n\nSample Output 4\n\n999999999", "sample_input": "3 100 100\n10 1000 100\n"}, "reference_outputs": ["900\n"], "source_document_id": "p03552", "source_text": "Score : 500 points\n\nProblem Statement\n\nWe have a deck consisting of N cards. Each card has an integer written on it. The integer on the i-th card from the top is a_i.\n\nTwo people X and Y will play a game using this deck. Initially, X has a card with Z written on it in his hand, and Y has a card with W written on it in his hand. Then, starting from X, they will alternately perform the following action:\n\nDraw some number of cards from the top of the deck. Then, discard the card in his hand and keep the last drawn card instead. Here, at least one card must be drawn.\n\nThe game ends when there is no more card in the deck. The score of the game is the absolute difference of the integers written on the cards in the two players' hand.\n\nX will play the game so that the score will be maximized, and Y will play the game so that the score will be minimized. What will be the score of the game?\n\nConstraints\n\nAll input values are integers.\n\n1 \\leq N \\leq 2000\n\n1 \\leq Z, W, a_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN Z W\na_1 a_2 ... a_N\n\nOutput\n\nPrint the score.\n\nSample Input 1\n\n3 100 100\n10 1000 100\n\nSample Output 1\n\n900\n\nIf X draws two cards first, Y will draw the last card, and the score will be |1000 - 100| = 900.\n\nSample Input 2\n\n3 100 1000\n10 100 100\n\nSample Output 2\n\n900\n\nIf X draws all the cards first, the score will be |1000 - 100| = 900.\n\nSample Input 3\n\n5 1 1\n1 1 1 1 1\n\nSample Output 3\n\n0\n\nSample Input 4\n\n1 1 1\n1000000000\n\nSample Output 4\n\n999999999", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1277, "cpu_time_ms": 15, "memory_kb": 128}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s100203849", "group_id": "codeNet:p03552", "input_text": "var n,z,w:longint;\n x:longint;\n ans:int64;\n a:array[0..10000]of longint;\n i:longint;\nfunction max(a,b:longint):longint;\nbegin\n if a>b then exit(a) else exit(b);\nend;\nbegin\n read(n,z,w);\n for i:=1 to n do\n read(a[i]);\n for i:=1 to n do\n ans:=max(ans,abs(a[i]-a[n]));\n ans:=max(ans,abs(w-a[n]));\n writeln(ans);\nend.\n", "language": "Pascal", "metadata": {"date": 1510454876, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03552.html", "problem_id": "p03552", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03552/input.txt", "sample_output_relpath": "derived/input_output/data/p03552/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03552/Pascal/s100203849.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s100203849", "user_id": "u139162134"}, "prompt_components": {"gold_output": "900\n", "input_to_evaluate": "var n,z,w:longint;\n x:longint;\n ans:int64;\n a:array[0..10000]of longint;\n i:longint;\nfunction max(a,b:longint):longint;\nbegin\n if a>b then exit(a) else exit(b);\nend;\nbegin\n read(n,z,w);\n for i:=1 to n do\n read(a[i]);\n for i:=1 to n do\n ans:=max(ans,abs(a[i]-a[n]));\n ans:=max(ans,abs(w-a[n]));\n writeln(ans);\nend.\n", "problem_context": "Score : 500 points\n\nProblem Statement\n\nWe have a deck consisting of N cards. Each card has an integer written on it. The integer on the i-th card from the top is a_i.\n\nTwo people X and Y will play a game using this deck. Initially, X has a card with Z written on it in his hand, and Y has a card with W written on it in his hand. Then, starting from X, they will alternately perform the following action:\n\nDraw some number of cards from the top of the deck. Then, discard the card in his hand and keep the last drawn card instead. Here, at least one card must be drawn.\n\nThe game ends when there is no more card in the deck. The score of the game is the absolute difference of the integers written on the cards in the two players' hand.\n\nX will play the game so that the score will be maximized, and Y will play the game so that the score will be minimized. What will be the score of the game?\n\nConstraints\n\nAll input values are integers.\n\n1 \\leq N \\leq 2000\n\n1 \\leq Z, W, a_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN Z W\na_1 a_2 ... a_N\n\nOutput\n\nPrint the score.\n\nSample Input 1\n\n3 100 100\n10 1000 100\n\nSample Output 1\n\n900\n\nIf X draws two cards first, Y will draw the last card, and the score will be |1000 - 100| = 900.\n\nSample Input 2\n\n3 100 1000\n10 100 100\n\nSample Output 2\n\n900\n\nIf X draws all the cards first, the score will be |1000 - 100| = 900.\n\nSample Input 3\n\n5 1 1\n1 1 1 1 1\n\nSample Output 3\n\n0\n\nSample Input 4\n\n1 1 1\n1000000000\n\nSample Output 4\n\n999999999", "sample_input": "3 100 100\n10 1000 100\n"}, "reference_outputs": ["900\n"], "source_document_id": "p03552", "source_text": "Score : 500 points\n\nProblem Statement\n\nWe have a deck consisting of N cards. Each card has an integer written on it. The integer on the i-th card from the top is a_i.\n\nTwo people X and Y will play a game using this deck. Initially, X has a card with Z written on it in his hand, and Y has a card with W written on it in his hand. Then, starting from X, they will alternately perform the following action:\n\nDraw some number of cards from the top of the deck. Then, discard the card in his hand and keep the last drawn card instead. Here, at least one card must be drawn.\n\nThe game ends when there is no more card in the deck. The score of the game is the absolute difference of the integers written on the cards in the two players' hand.\n\nX will play the game so that the score will be maximized, and Y will play the game so that the score will be minimized. What will be the score of the game?\n\nConstraints\n\nAll input values are integers.\n\n1 \\leq N \\leq 2000\n\n1 \\leq Z, W, a_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN Z W\na_1 a_2 ... a_N\n\nOutput\n\nPrint the score.\n\nSample Input 1\n\n3 100 100\n10 1000 100\n\nSample Output 1\n\n900\n\nIf X draws two cards first, Y will draw the last card, and the score will be |1000 - 100| = 900.\n\nSample Input 2\n\n3 100 1000\n10 100 100\n\nSample Output 2\n\n900\n\nIf X draws all the cards first, the score will be |1000 - 100| = 900.\n\nSample Input 3\n\n5 1 1\n1 1 1 1 1\n\nSample Output 3\n\n0\n\nSample Input 4\n\n1 1 1\n1000000000\n\nSample Output 4\n\n999999999", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 128}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s383959286", "group_id": "codeNet:p03552", "input_text": "//fpc 3.0.0\n\nprogram HelloWorld;\n var n,z,w:longint;\n var i,j:longint;\n var a:array [1..2000] of longint;\n var sx,sy:array[1..2000]of longint;\n var p,q:longint;\n var turn:boolean;\n var t:longint;\nbegin\n readln(n,z,w);\n for i:=1 to n do read(a[i]);\n for i:=n-1 downto 1 do\n begin\n sx[i]:=0;\n sy[i]:=1000000001;\n for j:=i+1 to n do\n begin\n if abs(a[i]-a[j])>=sx[i] then sx[i]:=abs(a[i]-a[j]);\n if abs(a[i]-a[j])<=sy[i] then sy[i]:=abs(a[i]-a[j]);\n end;\n end;\n p:=0;\n turn:=true;\n if n=1 then\n writeln(abs(w-a[n]))\n else\n begin\n while p<>n do\n begin\n if turn then\n begin\n sy[n]:=abs(a[n]-w);\n t:=0;\n for i:=p+1 to n do\n if sy[i]>=t then\n begin\n t:=sy[i];\n q:=i;\n end;\n z:=a[q];\n p:=q;\n turn:=false;\n end\n else\n begin\n sx[n]:=abs(a[n]-z);\n t:=1000000001;\n for i:=p+1 to n do\n if sx[i]<=t then\n begin\n t:=sx[i];\n q:=i;\n end;\n w:=a[q];\n p:=q;\n turn:=true;\n end;\n end;\n writeln(abs(z-w));\n end;\nend.\n", "language": "Pascal", "metadata": {"date": 1510454503, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03552.html", "problem_id": "p03552", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03552/input.txt", "sample_output_relpath": "derived/input_output/data/p03552/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03552/Pascal/s383959286.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s383959286", "user_id": "u566971318"}, "prompt_components": {"gold_output": "900\n", "input_to_evaluate": "//fpc 3.0.0\n\nprogram HelloWorld;\n var n,z,w:longint;\n var i,j:longint;\n var a:array [1..2000] of longint;\n var sx,sy:array[1..2000]of longint;\n var p,q:longint;\n var turn:boolean;\n var t:longint;\nbegin\n readln(n,z,w);\n for i:=1 to n do read(a[i]);\n for i:=n-1 downto 1 do\n begin\n sx[i]:=0;\n sy[i]:=1000000001;\n for j:=i+1 to n do\n begin\n if abs(a[i]-a[j])>=sx[i] then sx[i]:=abs(a[i]-a[j]);\n if abs(a[i]-a[j])<=sy[i] then sy[i]:=abs(a[i]-a[j]);\n end;\n end;\n p:=0;\n turn:=true;\n if n=1 then\n writeln(abs(w-a[n]))\n else\n begin\n while p<>n do\n begin\n if turn then\n begin\n sy[n]:=abs(a[n]-w);\n t:=0;\n for i:=p+1 to n do\n if sy[i]>=t then\n begin\n t:=sy[i];\n q:=i;\n end;\n z:=a[q];\n p:=q;\n turn:=false;\n end\n else\n begin\n sx[n]:=abs(a[n]-z);\n t:=1000000001;\n for i:=p+1 to n do\n if sx[i]<=t then\n begin\n t:=sx[i];\n q:=i;\n end;\n w:=a[q];\n p:=q;\n turn:=true;\n end;\n end;\n writeln(abs(z-w));\n end;\nend.\n", "problem_context": "Score : 500 points\n\nProblem Statement\n\nWe have a deck consisting of N cards. Each card has an integer written on it. The integer on the i-th card from the top is a_i.\n\nTwo people X and Y will play a game using this deck. Initially, X has a card with Z written on it in his hand, and Y has a card with W written on it in his hand. Then, starting from X, they will alternately perform the following action:\n\nDraw some number of cards from the top of the deck. Then, discard the card in his hand and keep the last drawn card instead. Here, at least one card must be drawn.\n\nThe game ends when there is no more card in the deck. The score of the game is the absolute difference of the integers written on the cards in the two players' hand.\n\nX will play the game so that the score will be maximized, and Y will play the game so that the score will be minimized. What will be the score of the game?\n\nConstraints\n\nAll input values are integers.\n\n1 \\leq N \\leq 2000\n\n1 \\leq Z, W, a_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN Z W\na_1 a_2 ... a_N\n\nOutput\n\nPrint the score.\n\nSample Input 1\n\n3 100 100\n10 1000 100\n\nSample Output 1\n\n900\n\nIf X draws two cards first, Y will draw the last card, and the score will be |1000 - 100| = 900.\n\nSample Input 2\n\n3 100 1000\n10 100 100\n\nSample Output 2\n\n900\n\nIf X draws all the cards first, the score will be |1000 - 100| = 900.\n\nSample Input 3\n\n5 1 1\n1 1 1 1 1\n\nSample Output 3\n\n0\n\nSample Input 4\n\n1 1 1\n1000000000\n\nSample Output 4\n\n999999999", "sample_input": "3 100 100\n10 1000 100\n"}, "reference_outputs": ["900\n"], "source_document_id": "p03552", "source_text": "Score : 500 points\n\nProblem Statement\n\nWe have a deck consisting of N cards. Each card has an integer written on it. The integer on the i-th card from the top is a_i.\n\nTwo people X and Y will play a game using this deck. Initially, X has a card with Z written on it in his hand, and Y has a card with W written on it in his hand. Then, starting from X, they will alternately perform the following action:\n\nDraw some number of cards from the top of the deck. Then, discard the card in his hand and keep the last drawn card instead. Here, at least one card must be drawn.\n\nThe game ends when there is no more card in the deck. The score of the game is the absolute difference of the integers written on the cards in the two players' hand.\n\nX will play the game so that the score will be maximized, and Y will play the game so that the score will be minimized. What will be the score of the game?\n\nConstraints\n\nAll input values are integers.\n\n1 \\leq N \\leq 2000\n\n1 \\leq Z, W, a_i \\leq 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN Z W\na_1 a_2 ... a_N\n\nOutput\n\nPrint the score.\n\nSample Input 1\n\n3 100 100\n10 1000 100\n\nSample Output 1\n\n900\n\nIf X draws two cards first, Y will draw the last card, and the score will be |1000 - 100| = 900.\n\nSample Input 2\n\n3 100 1000\n10 100 100\n\nSample Output 2\n\n900\n\nIf X draws all the cards first, the score will be |1000 - 100| = 900.\n\nSample Input 3\n\n5 1 1\n1 1 1 1 1\n\nSample Output 3\n\n0\n\nSample Input 4\n\n1 1 1\n1000000000\n\nSample Output 4\n\n999999999", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1279, "cpu_time_ms": 15, "memory_kb": 128}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s142351774", "group_id": "codeNet:p03553", "input_text": "var\n n,i,j,k:longint;ans:int64;\n a,f:array[1..100] of int64;\nbegin\n read(n);\n for i:=1 to n do\n read(a[i]);\n for i:=1 to n do\n begin\n k:=i;\n while k<=n do\n begin\n f[i]:=f[i]+a[k];\n k:=k+i;\n end;\n end;\n for i:=n downto 1 do\n if f[i]<0 then\n begin\n j:=i;\n while j<=n do\n begin\n a[j]:=0;\n j:=j+i;\n end;\n for j:=1 to i do\n begin\n f[i]:=0;\n k:=j;\n while k<=n do\n begin\n f[i]:=f[i]+a[k];\n k:=k+j;\n end;\n end;\n end;\n ans:=0;\n for i:=1 to n do\n ans:=ans+a[i];\n write(ans);\nend.", "language": "Pascal", "metadata": {"date": 1537636341, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03553.html", "problem_id": "p03553", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03553/input.txt", "sample_output_relpath": "derived/input_output/data/p03553/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03553/Pascal/s142351774.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s142351774", "user_id": "u426964396"}, "prompt_components": {"gold_output": "12\n", "input_to_evaluate": "var\n n,i,j,k:longint;ans:int64;\n a,f:array[1..100] of int64;\nbegin\n read(n);\n for i:=1 to n do\n read(a[i]);\n for i:=1 to n do\n begin\n k:=i;\n while k<=n do\n begin\n f[i]:=f[i]+a[k];\n k:=k+i;\n end;\n end;\n for i:=n downto 1 do\n if f[i]<0 then\n begin\n j:=i;\n while j<=n do\n begin\n a[j]:=0;\n j:=j+i;\n end;\n for j:=1 to i do\n begin\n f[i]:=0;\n k:=j;\n while k<=n do\n begin\n f[i]:=f[i]+a[k];\n k:=k+j;\n end;\n end;\n end;\n ans:=0;\n for i:=1 to n do\n ans:=ans+a[i];\n write(ans);\nend.", "problem_context": "Score : 700 points\n\nProblem Statement\n\nWe have N gemstones labeled 1 through N.\n\nYou can perform the following operation any number of times (possibly zero).\n\nSelect a positive integer x, and smash all the gems labeled with multiples of x.\n\nThen, for each i, if the gem labeled i remains without getting smashed, you will receive a_i yen (the currency of Japan).\nHowever, a_i may be negative, in which case you will be charged money.\n\nBy optimally performing the operation, how much yen can you earn?\n\nConstraints\n\nAll input values are integers.\n\n1 \\leq N \\leq 100\n\n|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 amount of money that can be earned.\n\nSample Input 1\n\n6\n1 2 -6 4 5 3\n\nSample Output 1\n\n12\n\nIt is optimal to smash Gem 3 and 6.\n\nSample Input 2\n\n6\n100 -100 -100 -100 100 -100\n\nSample Output 2\n\n200\n\nSample Input 3\n\n5\n-1 -2 -3 -4 -5\n\nSample Output 3\n\n0\n\nIt is optimal to smash all the gems.\n\nSample Input 4\n\n2\n-1000 100000\n\nSample Output 4\n\n99000", "sample_input": "6\n1 2 -6 4 5 3\n"}, "reference_outputs": ["12\n"], "source_document_id": "p03553", "source_text": "Score : 700 points\n\nProblem Statement\n\nWe have N gemstones labeled 1 through N.\n\nYou can perform the following operation any number of times (possibly zero).\n\nSelect a positive integer x, and smash all the gems labeled with multiples of x.\n\nThen, for each i, if the gem labeled i remains without getting smashed, you will receive a_i yen (the currency of Japan).\nHowever, a_i may be negative, in which case you will be charged money.\n\nBy optimally performing the operation, how much yen can you earn?\n\nConstraints\n\nAll input values are integers.\n\n1 \\leq N \\leq 100\n\n|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 amount of money that can be earned.\n\nSample Input 1\n\n6\n1 2 -6 4 5 3\n\nSample Output 1\n\n12\n\nIt is optimal to smash Gem 3 and 6.\n\nSample Input 2\n\n6\n100 -100 -100 -100 100 -100\n\nSample Output 2\n\n200\n\nSample Input 3\n\n5\n-1 -2 -3 -4 -5\n\nSample Output 3\n\n0\n\nIt is optimal to smash all the gems.\n\nSample Input 4\n\n2\n-1000 100000\n\nSample Output 4\n\n99000", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 713, "cpu_time_ms": 2, "memory_kb": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s653018732", "group_id": "codeNet:p03553", "input_text": "var\n x,y,z:array[0..1000] of int64;\n a,b,c,e,n:longint;d:int64;\nbegin\n read(n);\n for a:=1 to n do\n begin\n read(x[a]);\n if x[a]<0 then begin\n b:=b+1;\n y[b]:=a;\n end;\n end;\n for a:=b downto 1 do\n begin\n c:=2;d:=x[y[a]];\n while c*y[a]<=100 do\n begin\n if z[c*y[a]]=0 then d:=d+x[c*y[a]];\n c:=c+1;\n end;\n if d<0 then for e:=1 to c do\n z[e*y[a]]:=1;\n end; d:=0;\n for a:=1 to n do\n if z[a]=0 then d:=d+x[a];\n writeln(d);\n end.\n", "language": "Pascal", "metadata": {"date": 1536441791, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03553.html", "problem_id": "p03553", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03553/input.txt", "sample_output_relpath": "derived/input_output/data/p03553/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03553/Pascal/s653018732.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s653018732", "user_id": "u723721005"}, "prompt_components": {"gold_output": "12\n", "input_to_evaluate": "var\n x,y,z:array[0..1000] of int64;\n a,b,c,e,n:longint;d:int64;\nbegin\n read(n);\n for a:=1 to n do\n begin\n read(x[a]);\n if x[a]<0 then begin\n b:=b+1;\n y[b]:=a;\n end;\n end;\n for a:=b downto 1 do\n begin\n c:=2;d:=x[y[a]];\n while c*y[a]<=100 do\n begin\n if z[c*y[a]]=0 then d:=d+x[c*y[a]];\n c:=c+1;\n end;\n if d<0 then for e:=1 to c do\n z[e*y[a]]:=1;\n end; d:=0;\n for a:=1 to n do\n if z[a]=0 then d:=d+x[a];\n writeln(d);\n end.\n", "problem_context": "Score : 700 points\n\nProblem Statement\n\nWe have N gemstones labeled 1 through N.\n\nYou can perform the following operation any number of times (possibly zero).\n\nSelect a positive integer x, and smash all the gems labeled with multiples of x.\n\nThen, for each i, if the gem labeled i remains without getting smashed, you will receive a_i yen (the currency of Japan).\nHowever, a_i may be negative, in which case you will be charged money.\n\nBy optimally performing the operation, how much yen can you earn?\n\nConstraints\n\nAll input values are integers.\n\n1 \\leq N \\leq 100\n\n|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 amount of money that can be earned.\n\nSample Input 1\n\n6\n1 2 -6 4 5 3\n\nSample Output 1\n\n12\n\nIt is optimal to smash Gem 3 and 6.\n\nSample Input 2\n\n6\n100 -100 -100 -100 100 -100\n\nSample Output 2\n\n200\n\nSample Input 3\n\n5\n-1 -2 -3 -4 -5\n\nSample Output 3\n\n0\n\nIt is optimal to smash all the gems.\n\nSample Input 4\n\n2\n-1000 100000\n\nSample Output 4\n\n99000", "sample_input": "6\n1 2 -6 4 5 3\n"}, "reference_outputs": ["12\n"], "source_document_id": "p03553", "source_text": "Score : 700 points\n\nProblem Statement\n\nWe have N gemstones labeled 1 through N.\n\nYou can perform the following operation any number of times (possibly zero).\n\nSelect a positive integer x, and smash all the gems labeled with multiples of x.\n\nThen, for each i, if the gem labeled i remains without getting smashed, you will receive a_i yen (the currency of Japan).\nHowever, a_i may be negative, in which case you will be charged money.\n\nBy optimally performing the operation, how much yen can you earn?\n\nConstraints\n\nAll input values are integers.\n\n1 \\leq N \\leq 100\n\n|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 amount of money that can be earned.\n\nSample Input 1\n\n6\n1 2 -6 4 5 3\n\nSample Output 1\n\n12\n\nIt is optimal to smash Gem 3 and 6.\n\nSample Input 2\n\n6\n100 -100 -100 -100 100 -100\n\nSample Output 2\n\n200\n\nSample Input 3\n\n5\n-1 -2 -3 -4 -5\n\nSample Output 3\n\n0\n\nIt is optimal to smash all the gems.\n\nSample Input 4\n\n2\n-1000 100000\n\nSample Output 4\n\n99000", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 555, "cpu_time_ms": 3, "memory_kb": 128}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s339207655", "group_id": "codeNet:p03553", "input_text": "var s:array[1..1000]of boolean;\n a,f:array[1..1000]of int64;\n n,i,j,k,l:longint;\n tot,min:int64;\nprocedure inf;\nvar i,j,k,l:longint;\nbegin\n fillchar(f,sizeof(f),0);\n for i:=1 to n do\n if s[i]=false then\n for j:=i to n do\n if (j mod i=0)and(s[j]=false)then\n f[i]:=f[i]+a[j];\nend;\nbegin\n readln(n);\n tot:=0;\n for i:=1 to n do\n begin\n read(a[i]);\n inc(tot,a[i]);\n end;\n\n repeat\n inf;\n min:=999999999999999999;\n for i:=1 to n do\n if f[i]=0 then break;\n for i:=1 to n do\n if i mod k=0 then s[i]:=true;\n dec(tot,min);\n until false;\n writeln(tot);\nend.\n", "language": "Pascal", "metadata": {"date": 1536439072, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03553.html", "problem_id": "p03553", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03553/input.txt", "sample_output_relpath": "derived/input_output/data/p03553/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03553/Pascal/s339207655.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s339207655", "user_id": "u476418095"}, "prompt_components": {"gold_output": "12\n", "input_to_evaluate": "var s:array[1..1000]of boolean;\n a,f:array[1..1000]of int64;\n n,i,j,k,l:longint;\n tot,min:int64;\nprocedure inf;\nvar i,j,k,l:longint;\nbegin\n fillchar(f,sizeof(f),0);\n for i:=1 to n do\n if s[i]=false then\n for j:=i to n do\n if (j mod i=0)and(s[j]=false)then\n f[i]:=f[i]+a[j];\nend;\nbegin\n readln(n);\n tot:=0;\n for i:=1 to n do\n begin\n read(a[i]);\n inc(tot,a[i]);\n end;\n\n repeat\n inf;\n min:=999999999999999999;\n for i:=1 to n do\n if f[i]=0 then break;\n for i:=1 to n do\n if i mod k=0 then s[i]:=true;\n dec(tot,min);\n until false;\n writeln(tot);\nend.\n", "problem_context": "Score : 700 points\n\nProblem Statement\n\nWe have N gemstones labeled 1 through N.\n\nYou can perform the following operation any number of times (possibly zero).\n\nSelect a positive integer x, and smash all the gems labeled with multiples of x.\n\nThen, for each i, if the gem labeled i remains without getting smashed, you will receive a_i yen (the currency of Japan).\nHowever, a_i may be negative, in which case you will be charged money.\n\nBy optimally performing the operation, how much yen can you earn?\n\nConstraints\n\nAll input values are integers.\n\n1 \\leq N \\leq 100\n\n|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 amount of money that can be earned.\n\nSample Input 1\n\n6\n1 2 -6 4 5 3\n\nSample Output 1\n\n12\n\nIt is optimal to smash Gem 3 and 6.\n\nSample Input 2\n\n6\n100 -100 -100 -100 100 -100\n\nSample Output 2\n\n200\n\nSample Input 3\n\n5\n-1 -2 -3 -4 -5\n\nSample Output 3\n\n0\n\nIt is optimal to smash all the gems.\n\nSample Input 4\n\n2\n-1000 100000\n\nSample Output 4\n\n99000", "sample_input": "6\n1 2 -6 4 5 3\n"}, "reference_outputs": ["12\n"], "source_document_id": "p03553", "source_text": "Score : 700 points\n\nProblem Statement\n\nWe have N gemstones labeled 1 through N.\n\nYou can perform the following operation any number of times (possibly zero).\n\nSelect a positive integer x, and smash all the gems labeled with multiples of x.\n\nThen, for each i, if the gem labeled i remains without getting smashed, you will receive a_i yen (the currency of Japan).\nHowever, a_i may be negative, in which case you will be charged money.\n\nBy optimally performing the operation, how much yen can you earn?\n\nConstraints\n\nAll input values are integers.\n\n1 \\leq N \\leq 100\n\n|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 amount of money that can be earned.\n\nSample Input 1\n\n6\n1 2 -6 4 5 3\n\nSample Output 1\n\n12\n\nIt is optimal to smash Gem 3 and 6.\n\nSample Input 2\n\n6\n100 -100 -100 -100 100 -100\n\nSample Output 2\n\n200\n\nSample Input 3\n\n5\n-1 -2 -3 -4 -5\n\nSample Output 3\n\n0\n\nIt is optimal to smash all the gems.\n\nSample Input 4\n\n2\n-1000 100000\n\nSample Output 4\n\n99000", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 768, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s579454336", "group_id": "codeNet:p03556", "input_text": "var\nn,i:longint;\nbegin\nread(n);\nfor i:=n downto 1 do\n if trunc(sqrt(i))=sqrt(i) then begin writeln(i);break;end;\nend.", "language": "Pascal", "metadata": {"date": 1581737950, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03556.html", "problem_id": "p03556", "resource_group": "low_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/Pascal/s579454336.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s579454336", "user_id": "u426964396"}, "prompt_components": {"gold_output": "9\n", "input_to_evaluate": "var\nn,i:longint;\nbegin\nread(n);\nfor i:=n downto 1 do\n if trunc(sqrt(i))=sqrt(i) then begin writeln(i);break;end;\nend.", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 118, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s238122602", "group_id": "codeNet:p03556", "input_text": "var\n a,i:longint;\nbegin\n readln(a);\n for i:=a downto 1 do\n if trunc(sqrt(i))=sqrt(i) then\n begin\n writeln(i);\n halt;\n end;\nend.", "language": "Pascal", "metadata": {"date": 1534814439, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03556.html", "problem_id": "p03556", "resource_group": "low_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/Pascal/s238122602.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s238122602", "user_id": "u426964396"}, "prompt_components": {"gold_output": "9\n", "input_to_evaluate": "var\n a,i:longint;\nbegin\n readln(a);\n for i:=a downto 1 do\n if trunc(sqrt(i))=sqrt(i) then\n begin\n writeln(i);\n halt;\n end;\nend.", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s971449775", "group_id": "codeNet:p03557", "input_text": "program ec12;\nvar \n\tn,m,i,j:longint;\n\tans:int64;\n\ta,b,c,s,sum:array[0..100001] of longint;\nprocedure qsrt(l,r:longint);\nvar \n\ti,j,v,s:longint;\nbegin\n\ti:=l; j:=r; v:=b[(l+r) div 2];\n\trepeat\n\twhile b[i]v do dec(j);\n\tif i<=j then \n\tbegin \n\t\ts:=b[i];\n\t\tb[i]:=b[j];\n\t\tb[j]:=s;\n\t\tinc(i);\n\t\tdec(j);\n\tend;\n\tuntil i>=j;\n\tif lv do dec(j);\n\tif i<=j then \n\tbegin \n\t\ts:=c[i];\n\t\tc[i]:=c[j];\n\t\tc[j]:=s;\n\t\tinc(i);\n\t\tdec(j);\n\tend;\n\tuntil i>=j;\n\tif lv do dec(j);\n\tif i<=j then \n\tbegin \n\t\ts:=a[i];\n\t\ta[i]:=a[j];\n\t\ta[j]:=s;\n\t\tinc(i);\n\t\tdec(j);\n\tend;\n\tuntil i>=j;\n\tif l=c[j] then \n\t\tinc(j)\n\t\telse\n\t\tbegin \n\t\t\ts[i]:=n-j+1;\n\t\t\tinc(i);\n\t\tend;\n\tend;\n\ti:=1;\n\tj:=1;\n\tsum[0]:=0;\n\tfor i:=1 to n do \n\tsum[i]:=sum[i-1]+s[i];\n\tans:=0;\n\ti:=1;\n\tj:=1;\n\twhile (i<=n) and (j<=n) do \n\tbegin \n\t\tif a[i]>=b[j] then \n\t\tinc(j)\n\t\telse\n\t\tbegin \n\t\t\tans:=ans+sum[n]-sum[j-1];\n\t\t\tinc(i);\n\t\tend;\n\tend;\n\twriteln(ans);\nend. ", "language": "Pascal", "metadata": {"date": 1510180767, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03557.html", "problem_id": "p03557", "resource_group": "low_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/Pascal/s971449775.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s971449775", "user_id": "u018679195"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "program ec12;\nvar \n\tn,m,i,j:longint;\n\tans:int64;\n\ta,b,c,s,sum:array[0..100001] of longint;\nprocedure qsrt(l,r:longint);\nvar \n\ti,j,v,s:longint;\nbegin\n\ti:=l; j:=r; v:=b[(l+r) div 2];\n\trepeat\n\twhile b[i]v do dec(j);\n\tif i<=j then \n\tbegin \n\t\ts:=b[i];\n\t\tb[i]:=b[j];\n\t\tb[j]:=s;\n\t\tinc(i);\n\t\tdec(j);\n\tend;\n\tuntil i>=j;\n\tif lv do dec(j);\n\tif i<=j then \n\tbegin \n\t\ts:=c[i];\n\t\tc[i]:=c[j];\n\t\tc[j]:=s;\n\t\tinc(i);\n\t\tdec(j);\n\tend;\n\tuntil i>=j;\n\tif lv do dec(j);\n\tif i<=j then \n\tbegin \n\t\ts:=a[i];\n\t\ta[i]:=a[j];\n\t\ta[j]:=s;\n\t\tinc(i);\n\t\tdec(j);\n\tend;\n\tuntil i>=j;\n\tif l=c[j] then \n\t\tinc(j)\n\t\telse\n\t\tbegin \n\t\t\ts[i]:=n-j+1;\n\t\t\tinc(i);\n\t\tend;\n\tend;\n\ti:=1;\n\tj:=1;\n\tsum[0]:=0;\n\tfor i:=1 to n do \n\tsum[i]:=sum[i-1]+s[i];\n\tans:=0;\n\ti:=1;\n\tj:=1;\n\twhile (i<=n) and (j<=n) do \n\tbegin \n\t\tif a[i]>=b[j] then \n\t\tinc(j)\n\t\telse\n\t\tbegin \n\t\t\tans:=ans+sum[n]-sum[j-1];\n\t\t\tinc(i);\n\t\tend;\n\tend;\n\twriteln(ans);\nend. ", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1526, "cpu_time_ms": 61, "memory_kb": 2048}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s221531141", "group_id": "codeNet:p03557", "input_text": "program V1501;\n type\n w=array[0..100001] of int64;\n var\n a,b,c,d,e,f:w;\n i,n,p:longint;\n procedure haha(var a:w;l,r:longint);\n var\n o,p,m,t:longint;\n begin\n o:=l;\n p:=r;\n m:=a[(l+r) div 2];\n repeat\n while a[o]m do dec(p);\n if o<=p then\n begin\n t:=a[o];\n a[o]:=a[p];\n a[p]:=t;\n inc(o);\n dec(p);\n end;\n until o>p;\n if om do dec(p);\n if o<=p then\n begin\n t:=a[o];\n a[o]:=a[p];\n a[p]:=t;\n inc(o);\n dec(p);\n end;\n until o>p;\n if oj) then\n begin\n y:=a[i];\n a[i]:=a[j];\n a[j]:=y;\n inc(i);\n j:=j-1;\n end;\n until i>j;\n if lj) then\n begin\n y:=b[i];\n b[i]:=b[j];\n b[j]:=y;\n inc(i);\n j:=j-1;\n end;\n until i>j;\n if lj) then\n begin\n y:=c[i];\n c[i]:=c[j];\n c[j]:=y;\n inc(i);\n j:=j-1;\n end;\n until i>j;\n if la[i]\n then k:=k+1;\n end;\n for i:=1 to n do \n begin\n if c[i]>b[1]\n then w:=w+1;\n end;\n for i:=1 to n do \n begin\n while (b[i]>a[k+1])and(k+1<=n) do k:=k+1;\n while (b[i]>=c[n-w+1])and(n-w+1<=n) do w:=w-1;\n ans:=ans+k*w;\n end;\n writeln(ans);\nend.", "language": "Pascal", "metadata": {"date": 1509851354, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03557.html", "problem_id": "p03557", "resource_group": "low_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/Pascal/s377391683.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s377391683", "user_id": "u295324020"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "var n,w,k,i,j:longint;\n ans:int64;\n a,b,c:array[0..100001]of longint; \n procedure sort(l,r: longint);\n var\n i,j,x,y: longint;\n begin\n i:=l;\n j:=r;\n x:=a[(l+r) div 2];\n repeat\n while a[i]j) then\n begin\n y:=a[i];\n a[i]:=a[j];\n a[j]:=y;\n inc(i);\n j:=j-1;\n end;\n until i>j;\n if lj) then\n begin\n y:=b[i];\n b[i]:=b[j];\n b[j]:=y;\n inc(i);\n j:=j-1;\n end;\n until i>j;\n if lj) then\n begin\n y:=c[i];\n c[i]:=c[j];\n c[j]:=y;\n inc(i);\n j:=j-1;\n end;\n until i>j;\n if la[i]\n then k:=k+1;\n end;\n for i:=1 to n do \n begin\n if c[i]>b[1]\n then w:=w+1;\n end;\n for i:=1 to n do \n begin\n while (b[i]>a[k+1])and(k+1<=n) do k:=k+1;\n while (b[i]>=c[n-w+1])and(n-w+1<=n) do w:=w-1;\n ans:=ans+k*w;\n end;\n writeln(ans);\nend.", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 2262, "cpu_time_ms": 73, "memory_kb": 1408}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s211850244", "group_id": "codeNet:p03558", "input_text": "var n:string;\n i,w,ans,min,k,j:longint;\n a,b:array[0..100000]of longint;\nprocedure gao;\nvar i:longint;\nbegin\n for i:=1 to k do \n a[i]:=a[i]+b[i];\n for i:=1 to w do \n if a[i]>9\n then begin\n a[i+1]:=a[i+1]+1;\n a[i]:=a[i]-10;\n end; \n if a[w+1]>0\n then w:=w+1;\n for i:=1 to w do \n ans:=ans+a[i];\nend;\nbegin\n readln(n);\n min:=maxlongint;\n for i:=length(n) downto 1 do\n a[length(n)-i+1]:=ord(n[i])-48;\n for i:=1 to length(n) do\n b[i]:=a[i]; \n k:=length(n);\n w:=length(n); \n for i:=1 to 200000 do \n begin\n ans:=0;\n gao;\n if ans9\n then begin\n a[i+1]:=a[i+1]+1;\n a[i]:=a[i]-10;\n end; \n if a[w+1]>0\n then w:=w+1;\n for i:=1 to w do \n ans:=ans+a[i];\nend;\nbegin\n readln(n);\n min:=maxlongint;\n for i:=length(n) downto 1 do\n a[length(n)-i+1]:=ord(n[i])-48;\n for i:=1 to length(n) do\n b[i]:=a[i]; \n k:=length(n);\n w:=length(n); \n for i:=1 to 200000 do \n begin\n ans:=0;\n gao;\n if ansj) then\n begin\n y:=a[i];a[i]:=a[j];a[j]:=y;\n inc(i);j:=j-1;\n end;\nuntil i>j;\nif lj) then\n begin\n y:=a[i];a[i]:=a[j];a[j]:=y;\n inc(i);j:=j-1;\n end;\nuntil i>j;\nif l=size then qtail:=qtail-size;\nend;\nfunction popf():Longint;\nvar s:Longint;\nbegin\n\ts:=deque[qhead];\n\tinc(qhead);\n\tif qhead>=size then qhead:=qhead-size;\n\tpopf:=s;\nend;\nbegin\n\tread(k);\n\tfor i:=0 to k-1 do d[i]:=1000000000;\n\td[1]:=1;\n\tpusht(1);\n\twhile qhead<>qtail do begin\n\t\tu:=popf();\n\t\tif d[10*u mod k]>d[u]then begin\n\t\t\tpushf(10*u mod k);\n\t\t\td[10*u mod k]:=d[u];\n\t\tend;\n\t\tif d[(u+1)mod k]>d[u]+1 then begin\n\t\t\tpusht((u+1)mod k);\n\t\t\td[(u+1)mod k]:=d[u]+1;\n\t\tend;\n\tend;\n\twriteln(d[0]);\nend.\n", "language": "Pascal", "metadata": {"date": 1539825176, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03560.html", "problem_id": "p03560", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03560/input.txt", "sample_output_relpath": "derived/input_output/data/p03560/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03560/Pascal/s611180545.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s611180545", "user_id": "u657913472"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "var\n\tdeque:array[0..199999]of Longint;\n\tsize:Longint=200000;\n\tqhead,qtail:Longint;\n\tk,i,u:Longint;\n\td:array[0..99999]of Longint;\nprocedure pushf(a:Longint);\nbegin\n\tdec(qhead);\n\tif qhead<0 then qhead:=size+qhead;\n\tdeque[qhead]:=a;\nend;\nprocedure pusht(a:Longint);\nbegin\n\tdeque[qtail]:=a;\n\tinc(qtail);\n\tif qtail>=size then qtail:=qtail-size;\nend;\nfunction popf():Longint;\nvar s:Longint;\nbegin\n\ts:=deque[qhead];\n\tinc(qhead);\n\tif qhead>=size then qhead:=qhead-size;\n\tpopf:=s;\nend;\nbegin\n\tread(k);\n\tfor i:=0 to k-1 do d[i]:=1000000000;\n\td[1]:=1;\n\tpusht(1);\n\twhile qhead<>qtail do begin\n\t\tu:=popf();\n\t\tif d[10*u mod k]>d[u]then begin\n\t\t\tpushf(10*u mod k);\n\t\t\td[10*u mod k]:=d[u];\n\t\tend;\n\t\tif d[(u+1)mod k]>d[u]+1 then begin\n\t\t\tpusht((u+1)mod k);\n\t\t\td[(u+1)mod k]:=d[u]+1;\n\t\tend;\n\tend;\n\twriteln(d[0]);\nend.\n", "problem_context": "Score : 700 points\n\nProblem Statement\n\nFind the smallest possible sum of the digits in the decimal notation of a positive multiple of K.\n\nConstraints\n\n2 \\leq K \\leq 10^5\n\nK is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nK\n\nOutput\n\nPrint the smallest possible sum of the digits in the decimal notation of a positive multiple of K.\n\nSample Input 1\n\n6\n\nSample Output 1\n\n3\n\n12=6×2 yields the smallest sum.\n\nSample Input 2\n\n41\n\nSample Output 2\n\n5\n\n11111=41×271 yields the smallest sum.\n\nSample Input 3\n\n79992\n\nSample Output 3\n\n36", "sample_input": "6\n"}, "reference_outputs": ["3\n"], "source_document_id": "p03560", "source_text": "Score : 700 points\n\nProblem Statement\n\nFind the smallest possible sum of the digits in the decimal notation of a positive multiple of K.\n\nConstraints\n\n2 \\leq K \\leq 10^5\n\nK is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nK\n\nOutput\n\nPrint the smallest possible sum of the digits in the decimal notation of a positive multiple of K.\n\nSample Input 1\n\n6\n\nSample Output 1\n\n3\n\n12=6×2 yields the smallest sum.\n\nSample Input 2\n\n41\n\nSample Output 2\n\n5\n\n11111=41×271 yields the smallest sum.\n\nSample Input 3\n\n79992\n\nSample Output 3\n\n36", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 800, "cpu_time_ms": 8, "memory_kb": 896}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s155890622", "group_id": "codeNet:p03560", "input_text": "var n:longint;\n dist:array[0..100050]of longint;\n q:array[0..2000050]of longint;\n v:array[0..100050]of boolean;\nprocedure spfa;\nvar head,tail:longint;\n i,now,y:longint;\nbegin\n head:=1;\n tail:=0;\n for i:=1 to n-1 do\n dist[i]:=i;\n dist[0]:=maxint;\n for i:=0 to n-1 do\n begin\n inc(tail);\n q[tail]:=i;\n v[i]:=true;\n end;\n while head<=tail do\n begin\n now:=q[head];\n for i:=0 to 9 do\n begin\n y:=(now*10+i) mod n;\n if dist[y]>dist[now]+i then\n begin\n dist[y]:=dist[now]+i;\n if not v[y] then\n begin\n v[y]:=true;\n inc(tail);\n q[tail]:=y;\n end;\n end;\n end;\n inc(head);\n v[y]:=false;\n end;\nend;\nbegin\n read(n);\n spfa;\n writeln(dist[0]);\nend.", "language": "Pascal", "metadata": {"date": 1509850261, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03560.html", "problem_id": "p03560", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03560/input.txt", "sample_output_relpath": "derived/input_output/data/p03560/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03560/Pascal/s155890622.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s155890622", "user_id": "u809476955"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "var n:longint;\n dist:array[0..100050]of longint;\n q:array[0..2000050]of longint;\n v:array[0..100050]of boolean;\nprocedure spfa;\nvar head,tail:longint;\n i,now,y:longint;\nbegin\n head:=1;\n tail:=0;\n for i:=1 to n-1 do\n dist[i]:=i;\n dist[0]:=maxint;\n for i:=0 to n-1 do\n begin\n inc(tail);\n q[tail]:=i;\n v[i]:=true;\n end;\n while head<=tail do\n begin\n now:=q[head];\n for i:=0 to 9 do\n begin\n y:=(now*10+i) mod n;\n if dist[y]>dist[now]+i then\n begin\n dist[y]:=dist[now]+i;\n if not v[y] then\n begin\n v[y]:=true;\n inc(tail);\n q[tail]:=y;\n end;\n end;\n end;\n inc(head);\n v[y]:=false;\n end;\nend;\nbegin\n read(n);\n spfa;\n writeln(dist[0]);\nend.", "problem_context": "Score : 700 points\n\nProblem Statement\n\nFind the smallest possible sum of the digits in the decimal notation of a positive multiple of K.\n\nConstraints\n\n2 \\leq K \\leq 10^5\n\nK is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nK\n\nOutput\n\nPrint the smallest possible sum of the digits in the decimal notation of a positive multiple of K.\n\nSample Input 1\n\n6\n\nSample Output 1\n\n3\n\n12=6×2 yields the smallest sum.\n\nSample Input 2\n\n41\n\nSample Output 2\n\n5\n\n11111=41×271 yields the smallest sum.\n\nSample Input 3\n\n79992\n\nSample Output 3\n\n36", "sample_input": "6\n"}, "reference_outputs": ["3\n"], "source_document_id": "p03560", "source_text": "Score : 700 points\n\nProblem Statement\n\nFind the smallest possible sum of the digits in the decimal notation of a positive multiple of K.\n\nConstraints\n\n2 \\leq K \\leq 10^5\n\nK is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nK\n\nOutput\n\nPrint the smallest possible sum of the digits in the decimal notation of a positive multiple of K.\n\nSample Input 1\n\n6\n\nSample Output 1\n\n3\n\n12=6×2 yields the smallest sum.\n\nSample Input 2\n\n41\n\nSample Output 2\n\n5\n\n11111=41×271 yields the smallest sum.\n\nSample Input 3\n\n79992\n\nSample Output 3\n\n36", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 760, "cpu_time_ms": 45, "memory_kb": 1920}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s222501436", "group_id": "codeNet:p03564", "input_text": "uses math;\nvar\n a:array[0..1000000]of longint;\n n,k,i:longint;\nbegin\n a[0]:=1;\n readln(n,k);\n for i:=1 to n do\n a[i]:=min(a[i-1]+k,a[i-1]*2);\n writeln(a[n]);\nend.\n", "language": "Pascal", "metadata": {"date": 1524328591, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03564.html", "problem_id": "p03564", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03564/input.txt", "sample_output_relpath": "derived/input_output/data/p03564/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03564/Pascal/s222501436.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s222501436", "user_id": "u426964396"}, "prompt_components": {"gold_output": "10\n", "input_to_evaluate": "uses math;\nvar\n a:array[0..1000000]of longint;\n n,k,i:longint;\nbegin\n a[0]:=1;\n readln(n,k);\n for i:=1 to n do\n a[i]:=min(a[i-1]+k,a[i-1]*2);\n writeln(a[n]);\nend.\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nSquare1001 has seen an electric bulletin board displaying the integer 1.\nHe can perform the following operations A and B to change this value:\n\nOperation A: The displayed value is doubled.\n\nOperation B: The displayed value increases by K.\n\nSquare1001 needs to perform these operations N times in total.\nFind the minimum possible value displayed in the board after N operations.\n\nConstraints\n\n1 \\leq N, K \\leq 10\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nK\n\nOutput\n\nPrint the minimum possible value displayed in the board after N operations.\n\nSample Input 1\n\n4\n3\n\nSample Output 1\n\n10\n\nThe value will be minimized when the operations are performed in the following order: A, A, B, B.\n\nIn this case, the value will change as follows: 1 → 2 → 4 → 7 → 10.\n\nSample Input 2\n\n10\n10\n\nSample Output 2\n\n76\n\nThe value will be minimized when the operations are performed in the following order: A, A, A, A, B, B, B, B, B, B.\n\nIn this case, the value will change as follows: 1 → 2 → 4 → 8 → 16 → 26 → 36 → 46 → 56 → 66 → 76.\n\nBy the way, this contest is AtCoder Beginner Contest 076.", "sample_input": "4\n3\n"}, "reference_outputs": ["10\n"], "source_document_id": "p03564", "source_text": "Score : 200 points\n\nProblem Statement\n\nSquare1001 has seen an electric bulletin board displaying the integer 1.\nHe can perform the following operations A and B to change this value:\n\nOperation A: The displayed value is doubled.\n\nOperation B: The displayed value increases by K.\n\nSquare1001 needs to perform these operations N times in total.\nFind the minimum possible value displayed in the board after N operations.\n\nConstraints\n\n1 \\leq N, K \\leq 10\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nK\n\nOutput\n\nPrint the minimum possible value displayed in the board after N operations.\n\nSample Input 1\n\n4\n3\n\nSample Output 1\n\n10\n\nThe value will be minimized when the operations are performed in the following order: A, A, B, B.\n\nIn this case, the value will change as follows: 1 → 2 → 4 → 7 → 10.\n\nSample Input 2\n\n10\n10\n\nSample Output 2\n\n76\n\nThe value will be minimized when the operations are performed in the following order: A, A, A, A, B, B, B, B, B, B.\n\nIn this case, the value will change as follows: 1 → 2 → 4 → 8 → 16 → 26 → 36 → 46 → 56 → 66 → 76.\n\nBy the way, this contest is AtCoder Beginner Contest 076.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s459878410", "group_id": "codeNet:p03568", "input_text": "var ans:int64;\n i,n:longint;\n a:array[0..15]of longint;\nprocedure dfs(dep,bool:longint);\nvar i:longint;\nbegin\n if dep=n+1 then\n begin\n if bool=1 then inc(ans);\n exit;\n end;\n for i:=a[dep]-1 to a[dep]+1 do\n if i mod 2=0 then dfs(dep+1,bool or 1) else\n dfs(dep+1,bool);\nend;\nbegin\n read(n);\n for i:=1 to n do\n read(a[i]);\n dfs(1,0);\n writeln(ans);\nend.", "language": "Pascal", "metadata": {"date": 1508721122, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03568.html", "problem_id": "p03568", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03568/input.txt", "sample_output_relpath": "derived/input_output/data/p03568/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03568/Pascal/s459878410.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s459878410", "user_id": "u809476955"}, "prompt_components": {"gold_output": "7\n", "input_to_evaluate": "var ans:int64;\n i,n:longint;\n a:array[0..15]of longint;\nprocedure dfs(dep,bool:longint);\nvar i:longint;\nbegin\n if dep=n+1 then\n begin\n if bool=1 then inc(ans);\n exit;\n end;\n for i:=a[dep]-1 to a[dep]+1 do\n if i mod 2=0 then dfs(dep+1,bool or 1) else\n dfs(dep+1,bool);\nend;\nbegin\n read(n);\n for i:=1 to n do\n read(a[i]);\n dfs(1,0);\n writeln(ans);\nend.", "problem_context": "Score : 200 points\n\nProblem Statement\n\nWe will say that two integer sequences of length N, x_1, x_2, ..., x_N and y_1, y_2, ..., y_N, are similar when |x_i - y_i| \\leq 1 holds for all i (1 \\leq i \\leq N).\n\nIn particular, any integer sequence is similar to itself.\n\nYou are given an integer N and an integer sequence of length N, A_1, A_2, ..., A_N.\n\nHow many integer sequences b_1, b_2, ..., b_N are there such that b_1, b_2, ..., b_N is similar to A and the product of all elements, b_1 b_2 ... b_N, is even?\n\nConstraints\n\n1 \\leq N \\leq 10\n\n1 \\leq A_i \\leq 100\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 number of integer sequences that satisfy the condition.\n\nSample Input 1\n\n2\n2 3\n\nSample Output 1\n\n7\n\nThere are seven integer sequences that satisfy the condition:\n\n1, 2\n\n1, 4\n\n2, 2\n\n2, 3\n\n2, 4\n\n3, 2\n\n3, 4\n\nSample Input 2\n\n3\n3 3 3\n\nSample Output 2\n\n26\n\nSample Input 3\n\n1\n100\n\nSample Output 3\n\n1\n\nSample Input 4\n\n10\n90 52 56 71 44 8 13 30 57 84\n\nSample Output 4\n\n58921", "sample_input": "2\n2 3\n"}, "reference_outputs": ["7\n"], "source_document_id": "p03568", "source_text": "Score : 200 points\n\nProblem Statement\n\nWe will say that two integer sequences of length N, x_1, x_2, ..., x_N and y_1, y_2, ..., y_N, are similar when |x_i - y_i| \\leq 1 holds for all i (1 \\leq i \\leq N).\n\nIn particular, any integer sequence is similar to itself.\n\nYou are given an integer N and an integer sequence of length N, A_1, A_2, ..., A_N.\n\nHow many integer sequences b_1, b_2, ..., b_N are there such that b_1, b_2, ..., b_N is similar to A and the product of all elements, b_1 b_2 ... b_N, is even?\n\nConstraints\n\n1 \\leq N \\leq 10\n\n1 \\leq A_i \\leq 100\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 number of integer sequences that satisfy the condition.\n\nSample Input 1\n\n2\n2 3\n\nSample Output 1\n\n7\n\nThere are seven integer sequences that satisfy the condition:\n\n1, 2\n\n1, 4\n\n2, 2\n\n2, 3\n\n2, 4\n\n3, 2\n\n3, 4\n\nSample Input 2\n\n3\n3 3 3\n\nSample Output 2\n\n26\n\nSample Input 3\n\n1\n100\n\nSample Output 3\n\n1\n\nSample Input 4\n\n10\n90 52 56 71 44 8 13 30 57 84\n\nSample Output 4\n\n58921", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 2, "memory_kb": 128}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s450168327", "group_id": "codeNet:p03569", "input_text": "var s:ansistring;\n i:longint;\n n,l,r:longint;\n ans:int64;\nbegin\n readln(s);\n n:=length(s);\n l:=1;\n r:=n;\n while ls[r]) then\n begin\n if (s[l]='x') then\n begin\n inc(ans);\n inc(l);\n end else\n if (s[r]='x') then\n begin\n inc(ans);\n dec(r);\n end else\n begin\n writeln(-1);\n exit;\n end;\n end else\n begin\n inc(l);\n dec(r);\n end;\n end;\n writeln(ans);\nend.", "language": "Pascal", "metadata": {"date": 1508721565, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03569.html", "problem_id": "p03569", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03569/input.txt", "sample_output_relpath": "derived/input_output/data/p03569/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03569/Pascal/s450168327.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s450168327", "user_id": "u809476955"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "var s:ansistring;\n i:longint;\n n,l,r:longint;\n ans:int64;\nbegin\n readln(s);\n n:=length(s);\n l:=1;\n r:=n;\n while ls[r]) then\n begin\n if (s[l]='x') then\n begin\n inc(ans);\n inc(l);\n end else\n if (s[r]='x') then\n begin\n inc(ans);\n dec(r);\n end else\n begin\n writeln(-1);\n exit;\n end;\n end else\n begin\n inc(l);\n dec(r);\n end;\n end;\n writeln(ans);\nend.", "problem_context": "Score : 400 points\n\nProblem Statement\n\nWe have a string s consisting of lowercase English letters.\nSnuke can perform the following operation repeatedly:\n\nInsert a letter x to any position in s of his choice, including the beginning and end of s.\n\nSnuke's objective is to turn s into a palindrome.\nDetermine whether the objective is achievable. If it is achievable, find the minimum number of operations required.\n\nNotes\n\nA palindrome is a string that reads the same forward and backward.\nFor example, a, aa, abba and abcba are palindromes, while ab, abab and abcda are not.\n\nConstraints\n\n1 \\leq |s| \\leq 10^5\n\ns consists of lowercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns\n\nOutput\n\nIf the objective is achievable, print the number of operations required.\nIf it is not, print -1 instead.\n\nSample Input 1\n\nxabxa\n\nSample Output 1\n\n2\n\nOne solution is as follows (newly inserted x are shown in bold):\n\nxabxa → xaxbxa → xaxbxax\n\nSample Input 2\n\nab\n\nSample Output 2\n\n-1\n\nNo sequence of operations can turn s into a palindrome.\n\nSample Input 3\n\na\n\nSample Output 3\n\n0\n\ns is a palindrome already at the beginning.\n\nSample Input 4\n\noxxx\n\nSample Output 4\n\n3\n\nOne solution is as follows:\n\noxxx → xoxxx → xxoxxx → xxxoxxx", "sample_input": "xabxa\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03569", "source_text": "Score : 400 points\n\nProblem Statement\n\nWe have a string s consisting of lowercase English letters.\nSnuke can perform the following operation repeatedly:\n\nInsert a letter x to any position in s of his choice, including the beginning and end of s.\n\nSnuke's objective is to turn s into a palindrome.\nDetermine whether the objective is achievable. If it is achievable, find the minimum number of operations required.\n\nNotes\n\nA palindrome is a string that reads the same forward and backward.\nFor example, a, aa, abba and abcba are palindromes, while ab, abab and abcda are not.\n\nConstraints\n\n1 \\leq |s| \\leq 10^5\n\ns consists of lowercase English letters.\n\nInput\n\nInput is given from Standard Input in the following format:\n\ns\n\nOutput\n\nIf the objective is achievable, print the number of operations required.\nIf it is not, print -1 instead.\n\nSample Input 1\n\nxabxa\n\nSample Output 1\n\n2\n\nOne solution is as follows (newly inserted x are shown in bold):\n\nxabxa → xaxbxa → xaxbxax\n\nSample Input 2\n\nab\n\nSample Output 2\n\n-1\n\nNo sequence of operations can turn s into a palindrome.\n\nSample Input 3\n\na\n\nSample Output 3\n\n0\n\ns is a palindrome already at the beginning.\n\nSample Input 4\n\noxxx\n\nSample Output 4\n\n3\n\nOne solution is as follows:\n\noxxx → xoxxx → xxoxxx → xxxoxxx", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 493, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s149564221", "group_id": "codeNet:p03570", "input_text": "var a:array['a'..'z'] of longint;\nvar s:ansistring;\nvar ans,i,j:longint;\nbegin\n readln(s);for i:=1 to length(s) do inc(a[s[i]]);\n for i:=1 to 26 do if a[chr(i+ord('a')-1)] mod 2=1 then inc(ans);\n if ans=0 then inc(ans);writeln(ans);\nend.", "language": "Pascal", "metadata": {"date": 1508725452, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03570.html", "problem_id": "p03570", "resource_group": "low_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/Pascal/s149564221.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s149564221", "user_id": "u379604713"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "var a:array['a'..'z'] of longint;\nvar s:ansistring;\nvar ans,i,j:longint;\nbegin\n readln(s);for i:=1 to length(s) do inc(a[s[i]]);\n for i:=1 to 26 do if a[chr(i+ord('a')-1)] mod 2=1 then inc(ans);\n if ans=0 then inc(ans);writeln(ans);\nend.", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 2, "memory_kb": 384}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s217013427", "group_id": "codeNet:p03577", "input_text": "var a:string;\nbegin\n readln(a);\n writeln(copy(a,1,length(a)-8));\nend.", "language": "Pascal", "metadata": {"date": 1581649623, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03577.html", "problem_id": "p03577", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03577/input.txt", "sample_output_relpath": "derived/input_output/data/p03577/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03577/Pascal/s217013427.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s217013427", "user_id": "u743614777"}, "prompt_components": {"gold_output": "CODE\n", "input_to_evaluate": "var a:string;\nbegin\n readln(a);\n writeln(copy(a,1,length(a)-8));\nend.", "problem_context": "Score : 100 points\n\nProblem Statement\n\nRng is going to a festival.\n\nThe name of the festival is given to you as a string S, which ends with FESTIVAL, from input. Answer the question: \"Rng is going to a festival of what?\" Output the answer.\n\nHere, assume that the name of \"a festival of s\" is a string obtained by appending FESTIVAL to the end of s.\nFor example, CODEFESTIVAL is a festival of CODE.\n\nConstraints\n\n9 \\leq |S| \\leq 50\n\nS consists of uppercase English letters.\n\nS ends with FESTIVAL.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the answer to the question: \"Rng is going to a festival of what?\"\n\nSample Input 1\n\nCODEFESTIVAL\n\nSample Output 1\n\nCODE\n\nThis is the same as the example in the statement.\n\nSample Input 2\n\nCODEFESTIVALFESTIVAL\n\nSample Output 2\n\nCODEFESTIVAL\n\nThis string is obtained by appending FESTIVAL to the end of CODEFESTIVAL, so it is a festival of CODEFESTIVAL.\n\nSample Input 3\n\nYAKINIKUFESTIVAL\n\nSample Output 3\n\nYAKINIKU", "sample_input": "CODEFESTIVAL\n"}, "reference_outputs": ["CODE\n"], "source_document_id": "p03577", "source_text": "Score : 100 points\n\nProblem Statement\n\nRng is going to a festival.\n\nThe name of the festival is given to you as a string S, which ends with FESTIVAL, from input. Answer the question: \"Rng is going to a festival of what?\" Output the answer.\n\nHere, assume that the name of \"a festival of s\" is a string obtained by appending FESTIVAL to the end of s.\nFor example, CODEFESTIVAL is a festival of CODE.\n\nConstraints\n\n9 \\leq |S| \\leq 50\n\nS consists of uppercase English letters.\n\nS ends with FESTIVAL.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the answer to the question: \"Rng is going to a festival of what?\"\n\nSample Input 1\n\nCODEFESTIVAL\n\nSample Output 1\n\nCODE\n\nThis is the same as the example in the statement.\n\nSample Input 2\n\nCODEFESTIVALFESTIVAL\n\nSample Output 2\n\nCODEFESTIVAL\n\nThis string is obtained by appending FESTIVAL to the end of CODEFESTIVAL, so it is a festival of CODEFESTIVAL.\n\nSample Input 3\n\nYAKINIKUFESTIVAL\n\nSample Output 3\n\nYAKINIKU", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 71, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s522340614", "group_id": "codeNet:p03578", "input_text": "var cc : array [1..100000000] of longint ;\n a,b,c,d,e,f,g : longint ;\nbegin\n readln(a);\n for b:=1 to a do\n begin\n read(c);\n inc(cc[c]);\n end;\n readln(a);\n for b:=1 to a do\n begin\n read(c);\n dec(cc[c]);\n if cc[c]<0 then\n g:=1;\n end;\n if g=1 then\n writeln('NO')\n else\n writeln('YES');\nend.\n", "language": "Pascal", "metadata": {"date": 1507511530, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03578.html", "problem_id": "p03578", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03578/input.txt", "sample_output_relpath": "derived/input_output/data/p03578/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03578/Pascal/s522340614.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s522340614", "user_id": "u704549083"}, "prompt_components": {"gold_output": "YES\n", "input_to_evaluate": "var cc : array [1..100000000] of longint ;\n a,b,c,d,e,f,g : longint ;\nbegin\n readln(a);\n for b:=1 to a do\n begin\n read(c);\n inc(cc[c]);\n end;\n readln(a);\n for b:=1 to a do\n begin\n read(c);\n dec(cc[c]);\n if cc[c]<0 then\n g:=1;\n end;\n if g=1 then\n writeln('NO')\n else\n writeln('YES');\nend.\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nRng is preparing a problem set for a qualification round of CODEFESTIVAL.\n\nHe has N candidates of problems. The difficulty of the i-th candidate is D_i.\n\nThere must be M problems in the problem set, and the difficulty of the i-th problem must be T_i. Here, one candidate of a problem cannot be used as multiple problems.\n\nDetermine whether Rng can complete the problem set without creating new candidates of problems.\n\nConstraints\n\n1 \\leq N \\leq 200,000\n\n1 \\leq D_i \\leq 10^9\n\n1 \\leq M \\leq 200,000\n\n1 \\leq T_i \\leq 10^9\n\nAll numbers in the input are integers.\n\nPartial Score\n\n100 points will be awarded for passing the test set satisfying N \\leq 100 and M \\leq 100.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nD_1 D_2 ... D_N\nM\nT_1 T_2 ... T_M\n\nOutput\n\nPrint YES if Rng can complete the problem set without creating new candidates of problems; print NO if he cannot.\n\nSample Input 1\n\n5\n3 1 4 1 5\n3\n5 4 3\n\nSample Output 1\n\nYES\n\nSample Input 2\n\n7\n100 200 500 700 1200 1600 2000\n6\n100 200 500 700 1600 1600\n\nSample Output 2\n\nNO\n\nNot enough 1600s.\n\nSample Input 3\n\n1\n800\n5\n100 100 100 100 100\n\nSample Output 3\n\nNO\n\nSample Input 4\n\n15\n1 2 2 3 3 3 4 4 4 4 5 5 5 5 5\n9\n5 4 3 2 1 2 3 4 5\n\nSample Output 4\n\nYES", "sample_input": "5\n3 1 4 1 5\n3\n5 4 3\n"}, "reference_outputs": ["YES\n"], "source_document_id": "p03578", "source_text": "Score : 200 points\n\nProblem Statement\n\nRng is preparing a problem set for a qualification round of CODEFESTIVAL.\n\nHe has N candidates of problems. The difficulty of the i-th candidate is D_i.\n\nThere must be M problems in the problem set, and the difficulty of the i-th problem must be T_i. Here, one candidate of a problem cannot be used as multiple problems.\n\nDetermine whether Rng can complete the problem set without creating new candidates of problems.\n\nConstraints\n\n1 \\leq N \\leq 200,000\n\n1 \\leq D_i \\leq 10^9\n\n1 \\leq M \\leq 200,000\n\n1 \\leq T_i \\leq 10^9\n\nAll numbers in the input are integers.\n\nPartial Score\n\n100 points will be awarded for passing the test set satisfying N \\leq 100 and M \\leq 100.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nD_1 D_2 ... D_N\nM\nT_1 T_2 ... T_M\n\nOutput\n\nPrint YES if Rng can complete the problem set without creating new candidates of problems; print NO if he cannot.\n\nSample Input 1\n\n5\n3 1 4 1 5\n3\n5 4 3\n\nSample Output 1\n\nYES\n\nSample Input 2\n\n7\n100 200 500 700 1200 1600 2000\n6\n100 200 500 700 1600 1600\n\nSample Output 2\n\nNO\n\nNot enough 1600s.\n\nSample Input 3\n\n1\n800\n5\n100 100 100 100 100\n\nSample Output 3\n\nNO\n\nSample Input 4\n\n15\n1 2 2 3 3 3 4 4 4 4 5 5 5 5 5\n9\n5 4 3 2 1 2 3 4 5\n\nSample Output 4\n\nYES", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 2176}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s399090589", "group_id": "codeNet:p03579", "input_text": "var\n flag:boolean;\n da,sl:int64;\n hs:array[1..2] of int64;\n x,y,n,u,m,i:longint;\n hd,nx,t,ys:array[0..200100] of longint;\n procedure jb(x,y:longint);\n begin\n u:=u+1;\n nx[u]:=hd[x];\n hd[x]:=u;\n t[u]:=y;\n end;\n function ss(q,sc:longint):boolean;\n var\n i:longint;\n cg:boolean;\n begin\n ys[q]:=sc;\n sl:=sl+1;\n hs[sc]:=hs[sc]+1;\n cg:=true;\n i:=hd[q];\n while i<>0 do\n begin\n if ys[t[i]]=0 then cg:=cg and ss(t[i],3-sc);\n if ys[t[i]]=sc then\n begin\n cg:=false;\n flag:=false;\n end;\n i:=nx[i];\n end;\n exit(cg);\n end;\nbegin\n readln(n,m);\n for i:=1 to m do\n begin\n readln(x,y);\n jb(x,y);\n jb(y,x);\n end;\n for i:=1 to n do\n if ys[i]=0 then\n begin\n hs[1]:=0;\n hs[2]:=0;\n sl:=0;\n flag:=true;\n if ss(i,1)<>flag then writeln('?');\n if flag then da:=da+hs[1]*hs[2]\n else da:=da+sl*(sl-1) div 2;\n end;\n writeln(da-m);\nend.", "language": "Pascal", "metadata": {"date": 1569851360, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03579.html", "problem_id": "p03579", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03579/input.txt", "sample_output_relpath": "derived/input_output/data/p03579/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03579/Pascal/s399090589.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s399090589", "user_id": "u005813231"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "var\n flag:boolean;\n da,sl:int64;\n hs:array[1..2] of int64;\n x,y,n,u,m,i:longint;\n hd,nx,t,ys:array[0..200100] of longint;\n procedure jb(x,y:longint);\n begin\n u:=u+1;\n nx[u]:=hd[x];\n hd[x]:=u;\n t[u]:=y;\n end;\n function ss(q,sc:longint):boolean;\n var\n i:longint;\n cg:boolean;\n begin\n ys[q]:=sc;\n sl:=sl+1;\n hs[sc]:=hs[sc]+1;\n cg:=true;\n i:=hd[q];\n while i<>0 do\n begin\n if ys[t[i]]=0 then cg:=cg and ss(t[i],3-sc);\n if ys[t[i]]=sc then\n begin\n cg:=false;\n flag:=false;\n end;\n i:=nx[i];\n end;\n exit(cg);\n end;\nbegin\n readln(n,m);\n for i:=1 to m do\n begin\n readln(x,y);\n jb(x,y);\n jb(y,x);\n end;\n for i:=1 to n do\n if ys[i]=0 then\n begin\n hs[1]:=0;\n hs[2]:=0;\n sl:=0;\n flag:=true;\n if ss(i,1)<>flag then writeln('?');\n if flag then da:=da+hs[1]*hs[2]\n else da:=da+sl*(sl-1) div 2;\n end;\n writeln(da-m);\nend.", "problem_context": "Score : 500 points\n\nProblem Statement\n\nRng has a connected undirected graph with N vertices.\nCurrently, there are M edges in the graph, and the i-th edge connects Vertices A_i and B_i.\n\nRng will add new edges to the graph by repeating the following operation:\n\nOperation: Choose u and v (u \\neq v) such that Vertex v can be reached by traversing exactly three edges from Vertex u, and add an edge connecting Vertices u and v. It is not allowed to add an edge if there is already an edge connecting Vertices u and v.\n\nFind the maximum possible number of edges that can be added.\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 graph has no self-loops or multiple edges.\n\nThe 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\nFind the maximum possible number of edges that can be added.\n\nSample Input 1\n\n6 5\n1 2\n2 3\n3 4\n4 5\n5 6\n\nSample Output 1\n\n4\n\nIf we add edges as shown below, four edges can be added, and no more.\n\nSample Input 2\n\n5 5\n1 2\n2 3\n3 1\n5 4\n5 1\n\nSample Output 2\n\n5\n\nFive edges can be added, for example, as follows:\n\nAdd an edge connecting Vertex 5 and Vertex 3.\n\nAdd an edge connecting Vertex 5 and Vertex 2.\n\nAdd an edge connecting Vertex 4 and Vertex 1.\n\nAdd an edge connecting Vertex 4 and Vertex 2.\n\nAdd an edge connecting Vertex 4 and Vertex 3.", "sample_input": "6 5\n1 2\n2 3\n3 4\n4 5\n5 6\n"}, "reference_outputs": ["4\n"], "source_document_id": "p03579", "source_text": "Score : 500 points\n\nProblem Statement\n\nRng has a connected undirected graph with N vertices.\nCurrently, there are M edges in the graph, and the i-th edge connects Vertices A_i and B_i.\n\nRng will add new edges to the graph by repeating the following operation:\n\nOperation: Choose u and v (u \\neq v) such that Vertex v can be reached by traversing exactly three edges from Vertex u, and add an edge connecting Vertices u and v. It is not allowed to add an edge if there is already an edge connecting Vertices u and v.\n\nFind the maximum possible number of edges that can be added.\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 graph has no self-loops or multiple edges.\n\nThe 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\nFind the maximum possible number of edges that can be added.\n\nSample Input 1\n\n6 5\n1 2\n2 3\n3 4\n4 5\n5 6\n\nSample Output 1\n\n4\n\nIf we add edges as shown below, four edges can be added, and no more.\n\nSample Input 2\n\n5 5\n1 2\n2 3\n3 1\n5 4\n5 1\n\nSample Output 2\n\n5\n\nFive edges can be added, for example, as follows:\n\nAdd an edge connecting Vertex 5 and Vertex 3.\n\nAdd an edge connecting Vertex 5 and Vertex 2.\n\nAdd an edge connecting Vertex 4 and Vertex 1.\n\nAdd an edge connecting Vertex 4 and Vertex 2.\n\nAdd an edge connecting Vertex 4 and Vertex 3.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1066, "cpu_time_ms": 29, "memory_kb": 2688}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s715899695", "group_id": "codeNet:p03579", "input_text": "var\n da,sl:int64;\n hs:array[1..2] of int64;\n x,y,n,u,m,i:longint;\n hd,nx,t,ys:array[0..200100] of longint;\n procedure jb(x,y:longint);\n begin\n u:=u+1;\n nx[u]:=hd[x];\n hd[x]:=u;\n t[u]:=y;\n end;\n function ss(q,sc:longint):boolean;\n var\n i:longint;\n cg:boolean;\n begin\n ys[q]:=sc;\n sl:=sl+1;\n hs[sc]:=hs[sc]+1;\n cg:=true;\n i:=hd[q];\n while i<>0 do\n begin\n if ys[t[i]]=sc then cg:=false;\n if ys[t[i]]=0 then cg:=cg and ss(t[i],3-sc);\n i:=nx[i];\n end;\n exit(cg);\n end;\nbegin\n readln(n,m);\n for i:=1 to m do\n begin\n readln(x,y);\n jb(x,y);\n jb(y,x);\n end;\n for i:=1 to n do\n if ys[i]=0 then\n begin\n hs[1]:=0;\n hs[2]:=0;\n sl:=0;\n if ss(i,1) then da:=da+hs[1]*hs[2]\n else da:=da+sl*(sl-1) div 2;\n end;\n writeln(da-m);\nend.", "language": "Pascal", "metadata": {"date": 1569849627, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03579.html", "problem_id": "p03579", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03579/input.txt", "sample_output_relpath": "derived/input_output/data/p03579/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03579/Pascal/s715899695.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s715899695", "user_id": "u005813231"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "var\n da,sl:int64;\n hs:array[1..2] of int64;\n x,y,n,u,m,i:longint;\n hd,nx,t,ys:array[0..200100] of longint;\n procedure jb(x,y:longint);\n begin\n u:=u+1;\n nx[u]:=hd[x];\n hd[x]:=u;\n t[u]:=y;\n end;\n function ss(q,sc:longint):boolean;\n var\n i:longint;\n cg:boolean;\n begin\n ys[q]:=sc;\n sl:=sl+1;\n hs[sc]:=hs[sc]+1;\n cg:=true;\n i:=hd[q];\n while i<>0 do\n begin\n if ys[t[i]]=sc then cg:=false;\n if ys[t[i]]=0 then cg:=cg and ss(t[i],3-sc);\n i:=nx[i];\n end;\n exit(cg);\n end;\nbegin\n readln(n,m);\n for i:=1 to m do\n begin\n readln(x,y);\n jb(x,y);\n jb(y,x);\n end;\n for i:=1 to n do\n if ys[i]=0 then\n begin\n hs[1]:=0;\n hs[2]:=0;\n sl:=0;\n if ss(i,1) then da:=da+hs[1]*hs[2]\n else da:=da+sl*(sl-1) div 2;\n end;\n writeln(da-m);\nend.", "problem_context": "Score : 500 points\n\nProblem Statement\n\nRng has a connected undirected graph with N vertices.\nCurrently, there are M edges in the graph, and the i-th edge connects Vertices A_i and B_i.\n\nRng will add new edges to the graph by repeating the following operation:\n\nOperation: Choose u and v (u \\neq v) such that Vertex v can be reached by traversing exactly three edges from Vertex u, and add an edge connecting Vertices u and v. It is not allowed to add an edge if there is already an edge connecting Vertices u and v.\n\nFind the maximum possible number of edges that can be added.\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 graph has no self-loops or multiple edges.\n\nThe 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\nFind the maximum possible number of edges that can be added.\n\nSample Input 1\n\n6 5\n1 2\n2 3\n3 4\n4 5\n5 6\n\nSample Output 1\n\n4\n\nIf we add edges as shown below, four edges can be added, and no more.\n\nSample Input 2\n\n5 5\n1 2\n2 3\n3 1\n5 4\n5 1\n\nSample Output 2\n\n5\n\nFive edges can be added, for example, as follows:\n\nAdd an edge connecting Vertex 5 and Vertex 3.\n\nAdd an edge connecting Vertex 5 and Vertex 2.\n\nAdd an edge connecting Vertex 4 and Vertex 1.\n\nAdd an edge connecting Vertex 4 and Vertex 2.\n\nAdd an edge connecting Vertex 4 and Vertex 3.", "sample_input": "6 5\n1 2\n2 3\n3 4\n4 5\n5 6\n"}, "reference_outputs": ["4\n"], "source_document_id": "p03579", "source_text": "Score : 500 points\n\nProblem Statement\n\nRng has a connected undirected graph with N vertices.\nCurrently, there are M edges in the graph, and the i-th edge connects Vertices A_i and B_i.\n\nRng will add new edges to the graph by repeating the following operation:\n\nOperation: Choose u and v (u \\neq v) such that Vertex v can be reached by traversing exactly three edges from Vertex u, and add an edge connecting Vertices u and v. It is not allowed to add an edge if there is already an edge connecting Vertices u and v.\n\nFind the maximum possible number of edges that can be added.\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 graph has no self-loops or multiple edges.\n\nThe 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\nFind the maximum possible number of edges that can be added.\n\nSample Input 1\n\n6 5\n1 2\n2 3\n3 4\n4 5\n5 6\n\nSample Output 1\n\n4\n\nIf we add edges as shown below, four edges can be added, and no more.\n\nSample Input 2\n\n5 5\n1 2\n2 3\n3 1\n5 4\n5 1\n\nSample Output 2\n\n5\n\nFive edges can be added, for example, as follows:\n\nAdd an edge connecting Vertex 5 and Vertex 3.\n\nAdd an edge connecting Vertex 5 and Vertex 2.\n\nAdd an edge connecting Vertex 4 and Vertex 1.\n\nAdd an edge connecting Vertex 4 and Vertex 2.\n\nAdd an edge connecting Vertex 4 and Vertex 3.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 30, "memory_kb": 2688}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s939656444", "group_id": "codeNet:p03579", "input_text": "var\n da,sl:int64;\n hs:array[1..2] of int64;\n x,y,n,u,m,i:longint;\n hd,nx,t,ys:array[0..200100] of longint;\n procedure jb(x,y:longint);\n begin\n u:=u+1;\n nx[u]:=hd[x];\n hd[x]:=u;\n t[u]:=y;\n end;\n function ss(q,sc:longint):boolean;\n var\n i:longint;\n cg:boolean;\n begin\n ys[q]:=sc;\n sl:=sl+1;\n hs[sc]:=hs[sc]+1;\n cg:=true;\n i:=hd[q];\n while i<>0 do\n begin\n if ys[t[i]]=0 then cg:=cg and ss(t[i],3-sc);\n if ys[t[i]]=sc then cg:=false;\n i:=nx[i];\n end;\n exit(cg);\n end;\nbegin\n readln(n,m);\n for i:=1 to m do\n begin\n readln(x,y);\n jb(x,y);\n jb(y,x);\n end;\n for i:=1 to n do\n if ys[i]=0 then\n begin\n hs[1]:=0;\n hs[2]:=0;\n sl:=0;\n if ss(i,1) then da:=da+hs[1]*hs[2]\n else da:=da+sl*(sl-1) div 2;\n end;\n writeln(da-m);\nend.", "language": "Pascal", "metadata": {"date": 1569848305, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03579.html", "problem_id": "p03579", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03579/input.txt", "sample_output_relpath": "derived/input_output/data/p03579/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03579/Pascal/s939656444.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s939656444", "user_id": "u005813231"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "var\n da,sl:int64;\n hs:array[1..2] of int64;\n x,y,n,u,m,i:longint;\n hd,nx,t,ys:array[0..200100] of longint;\n procedure jb(x,y:longint);\n begin\n u:=u+1;\n nx[u]:=hd[x];\n hd[x]:=u;\n t[u]:=y;\n end;\n function ss(q,sc:longint):boolean;\n var\n i:longint;\n cg:boolean;\n begin\n ys[q]:=sc;\n sl:=sl+1;\n hs[sc]:=hs[sc]+1;\n cg:=true;\n i:=hd[q];\n while i<>0 do\n begin\n if ys[t[i]]=0 then cg:=cg and ss(t[i],3-sc);\n if ys[t[i]]=sc then cg:=false;\n i:=nx[i];\n end;\n exit(cg);\n end;\nbegin\n readln(n,m);\n for i:=1 to m do\n begin\n readln(x,y);\n jb(x,y);\n jb(y,x);\n end;\n for i:=1 to n do\n if ys[i]=0 then\n begin\n hs[1]:=0;\n hs[2]:=0;\n sl:=0;\n if ss(i,1) then da:=da+hs[1]*hs[2]\n else da:=da+sl*(sl-1) div 2;\n end;\n writeln(da-m);\nend.", "problem_context": "Score : 500 points\n\nProblem Statement\n\nRng has a connected undirected graph with N vertices.\nCurrently, there are M edges in the graph, and the i-th edge connects Vertices A_i and B_i.\n\nRng will add new edges to the graph by repeating the following operation:\n\nOperation: Choose u and v (u \\neq v) such that Vertex v can be reached by traversing exactly three edges from Vertex u, and add an edge connecting Vertices u and v. It is not allowed to add an edge if there is already an edge connecting Vertices u and v.\n\nFind the maximum possible number of edges that can be added.\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 graph has no self-loops or multiple edges.\n\nThe 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\nFind the maximum possible number of edges that can be added.\n\nSample Input 1\n\n6 5\n1 2\n2 3\n3 4\n4 5\n5 6\n\nSample Output 1\n\n4\n\nIf we add edges as shown below, four edges can be added, and no more.\n\nSample Input 2\n\n5 5\n1 2\n2 3\n3 1\n5 4\n5 1\n\nSample Output 2\n\n5\n\nFive edges can be added, for example, as follows:\n\nAdd an edge connecting Vertex 5 and Vertex 3.\n\nAdd an edge connecting Vertex 5 and Vertex 2.\n\nAdd an edge connecting Vertex 4 and Vertex 1.\n\nAdd an edge connecting Vertex 4 and Vertex 2.\n\nAdd an edge connecting Vertex 4 and Vertex 3.", "sample_input": "6 5\n1 2\n2 3\n3 4\n4 5\n5 6\n"}, "reference_outputs": ["4\n"], "source_document_id": "p03579", "source_text": "Score : 500 points\n\nProblem Statement\n\nRng has a connected undirected graph with N vertices.\nCurrently, there are M edges in the graph, and the i-th edge connects Vertices A_i and B_i.\n\nRng will add new edges to the graph by repeating the following operation:\n\nOperation: Choose u and v (u \\neq v) such that Vertex v can be reached by traversing exactly three edges from Vertex u, and add an edge connecting Vertices u and v. It is not allowed to add an edge if there is already an edge connecting Vertices u and v.\n\nFind the maximum possible number of edges that can be added.\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 graph has no self-loops or multiple edges.\n\nThe 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\nFind the maximum possible number of edges that can be added.\n\nSample Input 1\n\n6 5\n1 2\n2 3\n3 4\n4 5\n5 6\n\nSample Output 1\n\n4\n\nIf we add edges as shown below, four edges can be added, and no more.\n\nSample Input 2\n\n5 5\n1 2\n2 3\n3 1\n5 4\n5 1\n\nSample Output 2\n\n5\n\nFive edges can be added, for example, as follows:\n\nAdd an edge connecting Vertex 5 and Vertex 3.\n\nAdd an edge connecting Vertex 5 and Vertex 2.\n\nAdd an edge connecting Vertex 4 and Vertex 1.\n\nAdd an edge connecting Vertex 4 and Vertex 2.\n\nAdd an edge connecting Vertex 4 and Vertex 3.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 30, "memory_kb": 2688}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s477904663", "group_id": "codeNet:p03580", "input_text": " Uses Math;\n \n var S : AnsiString;\n N : LongInt;\n ans : Int64;\n \n \n var dp : array [ 0 .. 500000 , 1 .. 2 ] of LongInt;\n size : array [ 1 .. 500000 + 12 ] of LongInt;\n \n procedure Solve ( l , R : LongInt ) ;\n var i : LongInt;\n x , cnt : LongInt;\n begin\n if ( L + 2 > R ) then exit();\n \n for i := 1 to R - L + 1 do\n begin\n dp[i][1] := 0;\n dp[i][2] := 0;\n size[i] := 0;\n end;\n \n cnt := 0;\n x := 0;\n \n for i := L to R do\n begin\n if ( s[i] = '1' ) then\n begin\n cnt += 1;\n end\n else\n begin\n inc ( x ) ;\n size[x] := cnt - 1;\n cnt := 0;\n end;\n end;\n size[x+1] := cnt - 1;\n \n \n dp[0][1] := 0;\n dp[0][2] := 0;\n \n dp[1][1] := size[1] + 1;\n dp[1][2] := 1 + size[2];\n \n for i := 2 to X do\n begin\n \n if ( size[i-1] <> 0 ) then // not 10101\n begin\n dp[i][1] := max ( dp[i-1][1] + size[i] + 1 , dp[i-1][2] + 1 ); \n dp[i][2] := max ( dp[i-1][1] , dp[i-1][2] ) + size[i+1] + 1;\n end\n else\n begin\n dp[i][1] := max ( max ( dp[i-1][1] , dp[i-1][2] ) , max(dp[i-2][1] , dp[i-2][2] ) + 1 );\n dp[i][2] := max ( max ( dp[i-1][1] , dp[i-1][2] ) , max(dp[i-2][1] , dp[i-2][2] ) + size[x+1] + 1 );\n end;\n dp[i][1] := max ( dp[i][1] , dp[i][2] );\n end;\n \n \n ans += max ( dp[x][1] , dp[x][2] );\n \n end;\n \n var last : LongINt;\n \n var i : LongInt;\n \nbegin\n ans := 0;\n \n readLn ( N ) ; \n readLn ( S ) ;\n \n last := 0;\n \n for i := 1 to N do\n begin\n if ( S[i] = '0' ) and ( S[i+1] = '0' ) then\n begin\n Solve ( last + 1 , i - 1 );\n last := i + 1;\n end;\n end;\n \n if ( S[n] = '0' ) then\n Solve ( last + 1 , n-1 )\n else\n Solve ( last + 1 , n );\n \n writeLn ( ans );\n \n \nend.\n", "language": "Pascal", "metadata": {"date": 1507516678, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03580.html", "problem_id": "p03580", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03580/input.txt", "sample_output_relpath": "derived/input_output/data/p03580/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03580/Pascal/s477904663.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s477904663", "user_id": "u941440321"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": " Uses Math;\n \n var S : AnsiString;\n N : LongInt;\n ans : Int64;\n \n \n var dp : array [ 0 .. 500000 , 1 .. 2 ] of LongInt;\n size : array [ 1 .. 500000 + 12 ] of LongInt;\n \n procedure Solve ( l , R : LongInt ) ;\n var i : LongInt;\n x , cnt : LongInt;\n begin\n if ( L + 2 > R ) then exit();\n \n for i := 1 to R - L + 1 do\n begin\n dp[i][1] := 0;\n dp[i][2] := 0;\n size[i] := 0;\n end;\n \n cnt := 0;\n x := 0;\n \n for i := L to R do\n begin\n if ( s[i] = '1' ) then\n begin\n cnt += 1;\n end\n else\n begin\n inc ( x ) ;\n size[x] := cnt - 1;\n cnt := 0;\n end;\n end;\n size[x+1] := cnt - 1;\n \n \n dp[0][1] := 0;\n dp[0][2] := 0;\n \n dp[1][1] := size[1] + 1;\n dp[1][2] := 1 + size[2];\n \n for i := 2 to X do\n begin\n \n if ( size[i-1] <> 0 ) then // not 10101\n begin\n dp[i][1] := max ( dp[i-1][1] + size[i] + 1 , dp[i-1][2] + 1 ); \n dp[i][2] := max ( dp[i-1][1] , dp[i-1][2] ) + size[i+1] + 1;\n end\n else\n begin\n dp[i][1] := max ( max ( dp[i-1][1] , dp[i-1][2] ) , max(dp[i-2][1] , dp[i-2][2] ) + 1 );\n dp[i][2] := max ( max ( dp[i-1][1] , dp[i-1][2] ) , max(dp[i-2][1] , dp[i-2][2] ) + size[x+1] + 1 );\n end;\n dp[i][1] := max ( dp[i][1] , dp[i][2] );\n end;\n \n \n ans += max ( dp[x][1] , dp[x][2] );\n \n end;\n \n var last : LongINt;\n \n var i : LongInt;\n \nbegin\n ans := 0;\n \n readLn ( N ) ; \n readLn ( S ) ;\n \n last := 0;\n \n for i := 1 to N do\n begin\n if ( S[i] = '0' ) and ( S[i+1] = '0' ) then\n begin\n Solve ( last + 1 , i - 1 );\n last := i + 1;\n end;\n end;\n \n if ( S[n] = '0' ) then\n Solve ( last + 1 , n-1 )\n else\n Solve ( last + 1 , n );\n \n writeLn ( ans );\n \n \nend.\n", "problem_context": "Score : 700 points\n\nProblem Statement\n\nN cells are arranged in a row.\nSome of them may contain tokens.\nYou are given a string s that consists of 0s and 1s.\nIf the i-th character of s is 1, the i-th cell (from left) contains a token.\nOtherwise, it doesn't contain a token.\n\nSnuke wants to perform the following operation as many times as possible.\nIn each operation, he chooses three consecutive cells.\nLet's call the cells X, Y, Z from left to right.\nIn order for the operation to be valid, both X and Z must contain tokens and Y must not contain a token.\nThen, he removes these two tokens and puts a new token on Y.\n\nHow many operations can he perform if he performs operations in the optimal way?\n\nConstraints\n\n1 \\leq N \\leq 500,000\n\n|s| = N\n\nEach character in s is either 0 or 1.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\ns\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n7\n1010101\n\nSample Output 1\n\n2\n\nFor example, he can perform two operations in the following way:\n\nPerform an operation on the last three cells. Now the string that represents tokens becomes 1010010.\n\nPerform an operation on the first three cells. Now the string that represents tokens becomes 0100010.\n\nNote that the choice of operations matters.\nFor example, if he chooses three cells in the middle first, he can perform no more operations.\n\nSample Input 2\n\n50\n10101000010011011110001001111110000101010111100110\n\nSample Output 2\n\n10", "sample_input": "7\n1010101\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03580", "source_text": "Score : 700 points\n\nProblem Statement\n\nN cells are arranged in a row.\nSome of them may contain tokens.\nYou are given a string s that consists of 0s and 1s.\nIf the i-th character of s is 1, the i-th cell (from left) contains a token.\nOtherwise, it doesn't contain a token.\n\nSnuke wants to perform the following operation as many times as possible.\nIn each operation, he chooses three consecutive cells.\nLet's call the cells X, Y, Z from left to right.\nIn order for the operation to be valid, both X and Z must contain tokens and Y must not contain a token.\nThen, he removes these two tokens and puts a new token on Y.\n\nHow many operations can he perform if he performs operations in the optimal way?\n\nConstraints\n\n1 \\leq N \\leq 500,000\n\n|s| = N\n\nEach character in s is either 0 or 1.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\ns\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n7\n1010101\n\nSample Output 1\n\n2\n\nFor example, he can perform two operations in the following way:\n\nPerform an operation on the last three cells. Now the string that represents tokens becomes 1010010.\n\nPerform an operation on the first three cells. Now the string that represents tokens becomes 0100010.\n\nNote that the choice of operations matters.\nFor example, if he chooses three cells in the middle first, he can perform no more operations.\n\nSample Input 2\n\n50\n10101000010011011110001001111110000101010111100110\n\nSample Output 2\n\n10", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1720, "cpu_time_ms": 8, "memory_kb": 6784}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s787046866", "group_id": "codeNet:p03588", "input_text": "var n,i:longint;\n a,x:longint;\n max,maxx,min:longint;\n z:longint;\nbegin\n read(n);\n min:=maxlongint;\n for i:=1 to n do\n begin\n read(a,x);\n if a>max then max:=a;\n if xmax then max:=a;\n if xmax then\n begin\n max:=a;\n maxx:=x;\n end;\n end;\n writeln(max+maxx);\nend.", "language": "Pascal", "metadata": {"date": 1506820194, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03588.html", "problem_id": "p03588", "resource_group": "low_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/Pascal/s621150146.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s621150146", "user_id": "u809476955"}, "prompt_components": {"gold_output": "8\n", "input_to_evaluate": "var n,i:longint;\n a,x:longint;\n max,maxx:longint;\nbegin\n read(n);\n for i:=1 to n do\n begin\n read(a,x);\n if a>max then\n begin\n max:=a;\n maxx:=x;\n end;\n end;\n writeln(max+maxx);\nend.", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 29, "memory_kb": 128}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s969829559", "group_id": "codeNet:p03588", "input_text": "var x,y,n,i,j,max,maxi:longint;\nbegin\n read(n);for i:=1 to n do begin read(x,y);if x>max then begin max:=x;maxi:=y;end;end;\n writeln(max+maxi);end.", "language": "Pascal", "metadata": {"date": 1506820073, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03588.html", "problem_id": "p03588", "resource_group": "low_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/Pascal/s969829559.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s969829559", "user_id": "u379604713"}, "prompt_components": {"gold_output": "8\n", "input_to_evaluate": "var x,y,n,i,j,max,maxi:longint;\nbegin\n read(n);for i:=1 to n do begin read(x,y);if x>max then begin max:=x;maxi:=y;end;end;\n writeln(max+maxi);end.", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 36, "memory_kb": 128}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s976624432", "group_id": "codeNet:p03590", "input_text": "var n,k,ans,a1,kk:int64;\nvar i,j:longint;\nvar a,b,c:array[0..100020] of int64;\nprocedure qsort(l,r:int64);\nvar i,j,mid,m2,t:int64;\nbegin\n i:=l;j:=r;mid:=b[(l+r) >>1];m2:=a[(l+r)>>1];\n repeat\n while (b[i]>mid) or ((b[i]=mid) and (a[i]m2)) do dec(j);\n if i<=j then begin\n t:=a[i];a[i]:=a[j];a[j]:=t;\n t:=b[i];b[i]:=b[j];b[j]:=t;\n t:=c[i];c[i]:=c[j];c[j]:=t;\n inc(i);dec(j);\n end;\n until i>j;\n if l>1];m2:=a[(l+r)>>1];m3:=c[(l+r)>>1];\n repeat\n while (c[i]>m3) or ((c[i]=m3) and (b[i]>mid))\n or ((c[i]=m3) and (b[i]=mid) and (a[i]m2)) do dec(j);\n if i<=j then begin\n t:=a[i];a[i]:=a[j];a[j]:=t;\n t:=b[i];b[i]:=b[j];b[j]:=t;\n t:=c[i];c[i]:=c[j];c[j]:=t;\n inc(i);dec(j);\n end;\n until i>j;\n if l=0 then begin inc(ans,b[i]);dec(k,a[i]);end;\n qsort1(1,n);a1:=0; k:=kk;\n for i:=1 to n do\n if k-a[i]>=0 then begin inc(a1,b[i]);dec(k,a[i]);end;\n writeln(a1);\n if ans>a1 then writeln(ans)else writeln(a1);\nend.", "language": "Pascal", "metadata": {"date": 1506825483, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03590.html", "problem_id": "p03590", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03590/input.txt", "sample_output_relpath": "derived/input_output/data/p03590/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03590/Pascal/s976624432.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s976624432", "user_id": "u379604713"}, "prompt_components": {"gold_output": "8\n", "input_to_evaluate": "var n,k,ans,a1,kk:int64;\nvar i,j:longint;\nvar a,b,c:array[0..100020] of int64;\nprocedure qsort(l,r:int64);\nvar i,j,mid,m2,t:int64;\nbegin\n i:=l;j:=r;mid:=b[(l+r) >>1];m2:=a[(l+r)>>1];\n repeat\n while (b[i]>mid) or ((b[i]=mid) and (a[i]m2)) do dec(j);\n if i<=j then begin\n t:=a[i];a[i]:=a[j];a[j]:=t;\n t:=b[i];b[i]:=b[j];b[j]:=t;\n t:=c[i];c[i]:=c[j];c[j]:=t;\n inc(i);dec(j);\n end;\n until i>j;\n if l>1];m2:=a[(l+r)>>1];m3:=c[(l+r)>>1];\n repeat\n while (c[i]>m3) or ((c[i]=m3) and (b[i]>mid))\n or ((c[i]=m3) and (b[i]=mid) and (a[i]m2)) do dec(j);\n if i<=j then begin\n t:=a[i];a[i]:=a[j];a[j]:=t;\n t:=b[i];b[i]:=b[j];b[j]:=t;\n t:=c[i];c[i]:=c[j];c[j]:=t;\n inc(i);dec(j);\n end;\n until i>j;\n if l=0 then begin inc(ans,b[i]);dec(k,a[i]);end;\n qsort1(1,n);a1:=0; k:=kk;\n for i:=1 to n do\n if k-a[i]>=0 then begin inc(a1,b[i]);dec(k,a[i]);end;\n writeln(a1);\n if ans>a1 then writeln(ans)else writeln(a1);\nend.", "problem_context": "Score : 500 points\n\nProblem Statement\n\nSeisu-ya, a store specializing in non-negative integers, sells N non-negative integers. The i-th integer is A_i and has a utility of B_i.\nThere may be multiple equal integers with different utilities.\n\nTakahashi will buy some integers in this store. He can buy a combination of integers whose bitwise OR is less than or equal to K. He wants the sum of utilities of purchased integers to be as large as possible.\n\nFind the maximum possible sum of utilities of purchased integers.\n\nConstraints\n\n1 \\leq N \\leq 10^5\n\n0 \\leq K < 2^{30}\n\n0 \\leq A_i < 2^{30}(1\\leq i\\leq N)\n\n1 \\leq B_i \\leq 10^9(1\\leq i\\leq N)\n\nAll input values are integers.\n\nInputs\n\nInput is given from Standard Input in the following format:\n\nN K\nA_1 B_1\n:\nA_N B_N\n\nOutputs\n\nPrint the maximum possible sum of utilities of purchased integers.\n\nSample Input 1\n\n3 5\n3 3\n4 4\n2 5\n\nSample Output 1\n\n8\n\nBuy 2 and 3 to achieve the maximum possible total utility, 8.\n\nSample Input 2\n\n3 6\n3 3\n4 4\n2 5\n\nSample Output 2\n\n9\n\nBuy 2 and 4 to achieve the maximum possible total utility, 9.\n\nSample Input 3\n\n7 14\n10 5\n7 4\n11 4\n9 8\n3 6\n6 2\n8 9\n\nSample Output 3\n\n32", "sample_input": "3 5\n3 3\n4 4\n2 5\n"}, "reference_outputs": ["8\n"], "source_document_id": "p03590", "source_text": "Score : 500 points\n\nProblem Statement\n\nSeisu-ya, a store specializing in non-negative integers, sells N non-negative integers. The i-th integer is A_i and has a utility of B_i.\nThere may be multiple equal integers with different utilities.\n\nTakahashi will buy some integers in this store. He can buy a combination of integers whose bitwise OR is less than or equal to K. He wants the sum of utilities of purchased integers to be as large as possible.\n\nFind the maximum possible sum of utilities of purchased integers.\n\nConstraints\n\n1 \\leq N \\leq 10^5\n\n0 \\leq K < 2^{30}\n\n0 \\leq A_i < 2^{30}(1\\leq i\\leq N)\n\n1 \\leq B_i \\leq 10^9(1\\leq i\\leq N)\n\nAll input values are integers.\n\nInputs\n\nInput is given from Standard Input in the following format:\n\nN K\nA_1 B_1\n:\nA_N B_N\n\nOutputs\n\nPrint the maximum possible sum of utilities of purchased integers.\n\nSample Input 1\n\n3 5\n3 3\n4 4\n2 5\n\nSample Output 1\n\n8\n\nBuy 2 and 3 to achieve the maximum possible total utility, 8.\n\nSample Input 2\n\n3 6\n3 3\n4 4\n2 5\n\nSample Output 2\n\n9\n\nBuy 2 and 4 to achieve the maximum possible total utility, 9.\n\nSample Input 3\n\n7 14\n10 5\n7 4\n11 4\n9 8\n3 6\n6 2\n8 9\n\nSample Output 3\n\n32", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1477, "cpu_time_ms": 52, "memory_kb": 2432}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s194658072", "group_id": "codeNet:p03592", "input_text": "var i,j,k,t,s,n,m:longint;\nbegin\n\treadln(n,m,k);\n\tfor i:=0 to m do for j:=0 to n do if i*n+j*m=k+i*j*2 then \n\t\tbegin write('Yes');exit;end;\n\twrite('No');\nend.\n", "language": "Pascal", "metadata": {"date": 1506217422, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03592.html", "problem_id": "p03592", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03592/input.txt", "sample_output_relpath": "derived/input_output/data/p03592/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03592/Pascal/s194658072.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s194658072", "user_id": "u768548097"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "var i,j,k,t,s,n,m:longint;\nbegin\n\treadln(n,m,k);\n\tfor i:=0 to m do for j:=0 to n do if i*n+j*m=k+i*j*2 then \n\t\tbegin write('Yes');exit;end;\n\twrite('No');\nend.\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nWe have a grid with N rows and M columns of squares. Initially, all the squares are white.\n\nThere is a button attached to each row and each column.\nWhen a button attached to a row is pressed, the colors of all the squares in that row are inverted; that is, white squares become black and vice versa.\nWhen a button attached to a column is pressed, the colors of all the squares in that column are inverted.\n\nTakahashi can freely press the buttons any number of times. Determine whether he can have exactly K black squares in the grid.\n\nConstraints\n\n1 \\leq N,M \\leq 1000\n\n0 \\leq K \\leq NM\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M K\n\nOutput\n\nIf Takahashi can have exactly K black squares in the grid, print Yes; otherwise, print No.\n\nSample Input 1\n\n2 2 2\n\nSample Output 1\n\nYes\n\nPress the buttons in the order of the first row, the first column.\n\nSample Input 2\n\n2 2 1\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n3 5 8\n\nSample Output 3\n\nYes\n\nPress the buttons in the order of the first column, third column, second row, fifth column.\n\nSample Input 4\n\n7 9 20\n\nSample Output 4\n\nNo", "sample_input": "2 2 2\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p03592", "source_text": "Score : 200 points\n\nProblem Statement\n\nWe have a grid with N rows and M columns of squares. Initially, all the squares are white.\n\nThere is a button attached to each row and each column.\nWhen a button attached to a row is pressed, the colors of all the squares in that row are inverted; that is, white squares become black and vice versa.\nWhen a button attached to a column is pressed, the colors of all the squares in that column are inverted.\n\nTakahashi can freely press the buttons any number of times. Determine whether he can have exactly K black squares in the grid.\n\nConstraints\n\n1 \\leq N,M \\leq 1000\n\n0 \\leq K \\leq NM\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M K\n\nOutput\n\nIf Takahashi can have exactly K black squares in the grid, print Yes; otherwise, print No.\n\nSample Input 1\n\n2 2 2\n\nSample Output 1\n\nYes\n\nPress the buttons in the order of the first row, the first column.\n\nSample Input 2\n\n2 2 1\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n3 5 8\n\nSample Output 3\n\nYes\n\nPress the buttons in the order of the first column, third column, second row, fifth column.\n\nSample Input 4\n\n7 9 20\n\nSample Output 4\n\nNo", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 3, "memory_kb": 128}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s339950248", "group_id": "codeNet:p03592", "input_text": "var n,m,k:longint;\n i,j:longint;\n x:longint;\nbegin\n read(n,m,k);\n for i:=0 to m do\n begin\n x:=i*n;\n for j:=0 to n do\n begin\n if x-(2*j*i)+j*m=k then\n begin\n writeln('Yes');\n exit;\n end;\n end;\n end;\n writeln('No');\nend.", "language": "Pascal", "metadata": {"date": 1506216720, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03592.html", "problem_id": "p03592", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03592/input.txt", "sample_output_relpath": "derived/input_output/data/p03592/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03592/Pascal/s339950248.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s339950248", "user_id": "u809476955"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "var n,m,k:longint;\n i,j:longint;\n x:longint;\nbegin\n read(n,m,k);\n for i:=0 to m do\n begin\n x:=i*n;\n for j:=0 to n do\n begin\n if x-(2*j*i)+j*m=k then\n begin\n writeln('Yes');\n exit;\n end;\n end;\n end;\n writeln('No');\nend.", "problem_context": "Score : 200 points\n\nProblem Statement\n\nWe have a grid with N rows and M columns of squares. Initially, all the squares are white.\n\nThere is a button attached to each row and each column.\nWhen a button attached to a row is pressed, the colors of all the squares in that row are inverted; that is, white squares become black and vice versa.\nWhen a button attached to a column is pressed, the colors of all the squares in that column are inverted.\n\nTakahashi can freely press the buttons any number of times. Determine whether he can have exactly K black squares in the grid.\n\nConstraints\n\n1 \\leq N,M \\leq 1000\n\n0 \\leq K \\leq NM\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M K\n\nOutput\n\nIf Takahashi can have exactly K black squares in the grid, print Yes; otherwise, print No.\n\nSample Input 1\n\n2 2 2\n\nSample Output 1\n\nYes\n\nPress the buttons in the order of the first row, the first column.\n\nSample Input 2\n\n2 2 1\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n3 5 8\n\nSample Output 3\n\nYes\n\nPress the buttons in the order of the first column, third column, second row, fifth column.\n\nSample Input 4\n\n7 9 20\n\nSample Output 4\n\nNo", "sample_input": "2 2 2\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p03592", "source_text": "Score : 200 points\n\nProblem Statement\n\nWe have a grid with N rows and M columns of squares. Initially, all the squares are white.\n\nThere is a button attached to each row and each column.\nWhen a button attached to a row is pressed, the colors of all the squares in that row are inverted; that is, white squares become black and vice versa.\nWhen a button attached to a column is pressed, the colors of all the squares in that column are inverted.\n\nTakahashi can freely press the buttons any number of times. Determine whether he can have exactly K black squares in the grid.\n\nConstraints\n\n1 \\leq N,M \\leq 1000\n\n0 \\leq K \\leq NM\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M K\n\nOutput\n\nIf Takahashi can have exactly K black squares in the grid, print Yes; otherwise, print No.\n\nSample Input 1\n\n2 2 2\n\nSample Output 1\n\nYes\n\nPress the buttons in the order of the first row, the first column.\n\nSample Input 2\n\n2 2 1\n\nSample Output 2\n\nNo\n\nSample Input 3\n\n3 5 8\n\nSample Output 3\n\nYes\n\nPress the buttons in the order of the first column, third column, second row, fifth column.\n\nSample Input 4\n\n7 9 20\n\nSample Output 4\n\nNo", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 3, "memory_kb": 128}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s654638376", "group_id": "codeNet:p03593", "input_text": "var i,j:longint;\n n,m,num2,num4:longint;\n ch:char;\n num:array['a'..'z']of longint;\n have:longint;\nbegin\n readln(n,m);\n for i:=1 to n do\n begin\n for j:=1 to m do\n begin\n read(ch);\n inc(num[ch]);\n end;\n readln;\n end;\n if (n mod 2=1)and(m mod 2=1) then num4:=((n-1)div 2) * ((m-1) div 2) else\n if (n mod 2=0)and(m mod 2=1) then num4:=( n div 2) * ((m-1) div 2) else\n if (n mod 2=1)and(m mod 2=0) then num4:=((n-1)div 2) * ( m div 2) else\n if (n mod 2=0)and(m mod 2=0) then num4:=( n div 2) * ( m div 2);\n for i:=97 to 122 do\n if (num[char(i)]>=4)and(num4>0) then\n begin\n have:=num[char(i)]div 4;\n if have>num4 then\n begin\n num4:=0;\n dec(num[char(i)],num4*4);\n end else\n begin\n dec(num4,have);\n dec(num[char(i)],have*4);\n end;\n end;\n if num4>0 then\n begin\n writeln('No');\n exit;\n end;\n if (n mod 2=1)and(m mod 2=1) then num2:=(n-1) div 2+(m-1) div 2 else\n if (n mod 2=0)and(m mod 2=1) then num2:=m div 2 else\n if (n mod 2=1)and(m mod 2=0) then num2:=n div 2 else\n if (n mod 2=0)and(m mod 2=0) then num2:=0; \n for i:=97 to 122 do\n if (num[char(i)]>=2)and(num2>0) then\n begin\n have:=num[char(i)] div 2;\n if have>num2 then num2:=0 else dec(num2,have);\n end;\n if num2>0 then\n begin\n writeln('No');\n exit;\n end;\n writeln('Yes');\nend.\n\n\n", "language": "Pascal", "metadata": {"date": 1506229624, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03593.html", "problem_id": "p03593", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03593/input.txt", "sample_output_relpath": "derived/input_output/data/p03593/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03593/Pascal/s654638376.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s654638376", "user_id": "u809476955"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "var i,j:longint;\n n,m,num2,num4:longint;\n ch:char;\n num:array['a'..'z']of longint;\n have:longint;\nbegin\n readln(n,m);\n for i:=1 to n do\n begin\n for j:=1 to m do\n begin\n read(ch);\n inc(num[ch]);\n end;\n readln;\n end;\n if (n mod 2=1)and(m mod 2=1) then num4:=((n-1)div 2) * ((m-1) div 2) else\n if (n mod 2=0)and(m mod 2=1) then num4:=( n div 2) * ((m-1) div 2) else\n if (n mod 2=1)and(m mod 2=0) then num4:=((n-1)div 2) * ( m div 2) else\n if (n mod 2=0)and(m mod 2=0) then num4:=( n div 2) * ( m div 2);\n for i:=97 to 122 do\n if (num[char(i)]>=4)and(num4>0) then\n begin\n have:=num[char(i)]div 4;\n if have>num4 then\n begin\n num4:=0;\n dec(num[char(i)],num4*4);\n end else\n begin\n dec(num4,have);\n dec(num[char(i)],have*4);\n end;\n end;\n if num4>0 then\n begin\n writeln('No');\n exit;\n end;\n if (n mod 2=1)and(m mod 2=1) then num2:=(n-1) div 2+(m-1) div 2 else\n if (n mod 2=0)and(m mod 2=1) then num2:=m div 2 else\n if (n mod 2=1)and(m mod 2=0) then num2:=n div 2 else\n if (n mod 2=0)and(m mod 2=0) then num2:=0; \n for i:=97 to 122 do\n if (num[char(i)]>=2)and(num2>0) then\n begin\n have:=num[char(i)] div 2;\n if have>num2 then num2:=0 else dec(num2,have);\n end;\n if num2>0 then\n begin\n writeln('No');\n exit;\n end;\n writeln('Yes');\nend.\n\n\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nWe have an H-by-W matrix.\nLet a_{ij} be the element at the i-th row from the top and j-th column from the left.\nIn this matrix, each a_{ij} is a lowercase English letter.\n\nSnuke is creating another H-by-W matrix, A', by freely rearranging the elements in A.\nHere, he wants to satisfy the following condition:\n\nEvery row and column in A' can be read as a palindrome.\n\nDetermine whether he can create a matrix satisfying the condition.\n\nNote\n\nA palindrome is a string that reads the same forward and backward.\nFor example, a, aa, abba and abcba are all palindromes, while ab, abab and abcda are not.\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_{12}...a_{1W}\n:\na_{H1}a_{H2}...a_{HW}\n\nOutput\n\nIf Snuke can create a matrix satisfying the condition, print Yes; otherwise, print No.\n\nSample Input 1\n\n3 4\naabb\naabb\naacc\n\nSample Output 1\n\nYes\n\nFor example, the following matrix satisfies the condition.\n\nabba\nacca\nabba\n\nSample Input 2\n\n2 2\naa\nbb\n\nSample Output 2\n\nNo\n\nIt is not possible to create a matrix satisfying the condition, no matter how we rearrange the elements in A.\n\nSample Input 3\n\n5 1\nt\nw\ne\ne\nt\n\nSample Output 3\n\nYes\n\nFor example, the following matrix satisfies the condition.\n\nt\ne\nw\ne\nt\n\nSample Input 4\n\n2 5\nabxba\nabyba\n\nSample Output 4\n\nNo\n\nSample Input 5\n\n1 1\nz\n\nSample Output 5\n\nYes", "sample_input": "3 4\naabb\naabb\naacc\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p03593", "source_text": "Score : 400 points\n\nProblem Statement\n\nWe have an H-by-W matrix.\nLet a_{ij} be the element at the i-th row from the top and j-th column from the left.\nIn this matrix, each a_{ij} is a lowercase English letter.\n\nSnuke is creating another H-by-W matrix, A', by freely rearranging the elements in A.\nHere, he wants to satisfy the following condition:\n\nEvery row and column in A' can be read as a palindrome.\n\nDetermine whether he can create a matrix satisfying the condition.\n\nNote\n\nA palindrome is a string that reads the same forward and backward.\nFor example, a, aa, abba and abcba are all palindromes, while ab, abab and abcda are not.\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_{12}...a_{1W}\n:\na_{H1}a_{H2}...a_{HW}\n\nOutput\n\nIf Snuke can create a matrix satisfying the condition, print Yes; otherwise, print No.\n\nSample Input 1\n\n3 4\naabb\naabb\naacc\n\nSample Output 1\n\nYes\n\nFor example, the following matrix satisfies the condition.\n\nabba\nacca\nabba\n\nSample Input 2\n\n2 2\naa\nbb\n\nSample Output 2\n\nNo\n\nIt is not possible to create a matrix satisfying the condition, no matter how we rearrange the elements in A.\n\nSample Input 3\n\n5 1\nt\nw\ne\ne\nt\n\nSample Output 3\n\nYes\n\nFor example, the following matrix satisfies the condition.\n\nt\ne\nw\ne\nt\n\nSample Input 4\n\n2 5\nabxba\nabyba\n\nSample Output 4\n\nNo\n\nSample Input 5\n\n1 1\nz\n\nSample Output 5\n\nYes", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1354, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s017908909", "group_id": "codeNet:p03594", "input_text": "\nvar\n n,m,j,i,d,x,y:longint;\nbegin\n readln(n,m,d);\n for i:=1 to n do\n begin\n for j:=1 to m do\n begin\n x:=(i+j+m-2) div d mod 2;\n y:=(i-j+m) div d mod 2;\n case 2*x+y of\n 0:write('R');\n 1:write('G');\n 2:write('B');\n 3:write('Y');\n end;\n end;\n writeln;\n end; \nend.", "language": "Pascal", "metadata": {"date": 1531494298, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03594.html", "problem_id": "p03594", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03594/input.txt", "sample_output_relpath": "derived/input_output/data/p03594/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03594/Pascal/s017908909.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s017908909", "user_id": "u426964396"}, "prompt_components": {"gold_output": "RY\nGR\n", "input_to_evaluate": "\nvar\n n,m,j,i,d,x,y:longint;\nbegin\n readln(n,m,d);\n for i:=1 to n do\n begin\n for j:=1 to m do\n begin\n x:=(i+j+m-2) div d mod 2;\n y:=(i-j+m) div d mod 2;\n case 2*x+y of\n 0:write('R');\n 1:write('G');\n 2:write('B');\n 3:write('Y');\n end;\n end;\n writeln;\n end; \nend.", "problem_context": "Score : 700 points\n\nProblem Statement\n\nWe have a grid with H rows and W columns of squares.\nWe will represent the square at the i-th row from the top and j-th column from the left as (i,\\ j).\nAlso, we will define the distance between the squares (i_1,\\ j_1) and (i_2,\\ j_2) as |i_1 - i_2| + |j_1 - j_2|.\n\nSnuke is painting each square in red, yellow, green or blue.\nHere, for a given positive integer d, he wants to satisfy the following condition:\n\nNo two squares with distance exactly d have the same color.\n\nFind a way to paint the squares satisfying the condition.\nIt can be shown that a solution always exists.\n\nConstraints\n\n2 ≤ H, W ≤ 500\n\n1 ≤ d ≤ H + W - 2\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W d\n\nOutput\n\nPrint a way to paint the squares satisfying the condition, in the following format. If the square (i,\\ j) is painted in red, yellow, green or blue, c_{ij} should be R, Y, G or B, respectively.\n\nc_{11}c_{12}...c_{1W}\n:\nc_{H1}c_{H2}...c_{HW}\n\nSample Input 1\n\n2 2 1\n\nSample Output 1\n\nRY\nGR\n\nThere are four pairs of squares with distance exactly 1.\nAs shown below, no two such squares have the same color.\n\n(1,\\ 1), (1,\\ 2) : R, Y\n\n(1,\\ 2), (2,\\ 2) : Y, R\n\n(2,\\ 2), (2,\\ 1) : R, G\n\n(2,\\ 1), (1,\\ 1) : G, R\n\nSample Input 2\n\n2 3 2\n\nSample Output 2\n\nRYB\nRGB\n\nThere are six pairs of squares with distance exactly 2.\nAs shown below, no two such squares have the same color.\n\n(1,\\ 1) , (1,\\ 3) : R , B\n\n(1,\\ 3) , (2,\\ 2) : B , G\n\n(2,\\ 2) , (1,\\ 1) : G , R\n\n(2,\\ 1) , (2,\\ 3) : R , B\n\n(2,\\ 3) , (1,\\ 2) : B , Y\n\n(1,\\ 2) , (2,\\ 1) : Y , R", "sample_input": "2 2 1\n"}, "reference_outputs": ["RY\nGR\n"], "source_document_id": "p03594", "source_text": "Score : 700 points\n\nProblem Statement\n\nWe have a grid with H rows and W columns of squares.\nWe will represent the square at the i-th row from the top and j-th column from the left as (i,\\ j).\nAlso, we will define the distance between the squares (i_1,\\ j_1) and (i_2,\\ j_2) as |i_1 - i_2| + |j_1 - j_2|.\n\nSnuke is painting each square in red, yellow, green or blue.\nHere, for a given positive integer d, he wants to satisfy the following condition:\n\nNo two squares with distance exactly d have the same color.\n\nFind a way to paint the squares satisfying the condition.\nIt can be shown that a solution always exists.\n\nConstraints\n\n2 ≤ H, W ≤ 500\n\n1 ≤ d ≤ H + W - 2\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W d\n\nOutput\n\nPrint a way to paint the squares satisfying the condition, in the following format. If the square (i,\\ j) is painted in red, yellow, green or blue, c_{ij} should be R, Y, G or B, respectively.\n\nc_{11}c_{12}...c_{1W}\n:\nc_{H1}c_{H2}...c_{HW}\n\nSample Input 1\n\n2 2 1\n\nSample Output 1\n\nRY\nGR\n\nThere are four pairs of squares with distance exactly 1.\nAs shown below, no two such squares have the same color.\n\n(1,\\ 1), (1,\\ 2) : R, Y\n\n(1,\\ 2), (2,\\ 2) : Y, R\n\n(2,\\ 2), (2,\\ 1) : R, G\n\n(2,\\ 1), (1,\\ 1) : G, R\n\nSample Input 2\n\n2 3 2\n\nSample Output 2\n\nRYB\nRGB\n\nThere are six pairs of squares with distance exactly 2.\nAs shown below, no two such squares have the same color.\n\n(1,\\ 1) , (1,\\ 3) : R , B\n\n(1,\\ 3) , (2,\\ 2) : B , G\n\n(2,\\ 2) , (1,\\ 1) : G , R\n\n(2,\\ 1) , (2,\\ 3) : R , B\n\n(2,\\ 3) , (1,\\ 2) : B , Y\n\n(1,\\ 2) , (2,\\ 1) : Y , R", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 16, "memory_kb": 384}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s403174806", "group_id": "codeNet:p03594", "input_text": "var\n n,m,j,i,d,x,y:longint;\nbegin\n readln(n,m,d);\n for i:=0 to n-1 do\n begin\n for j:=0 to m-1 do\n begin\n x:=(i+j+m) div d mod 2;\n y:=(i-j+m) div d mod 2;\n case 2*x+y of\n 0:write('R');\n 1:write('G');\n 2:write('B');\n 3:write('Y');\n end;\n end;\n writeln;\n end; \nend.", "language": "Pascal", "metadata": {"date": 1530838505, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03594.html", "problem_id": "p03594", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03594/input.txt", "sample_output_relpath": "derived/input_output/data/p03594/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03594/Pascal/s403174806.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s403174806", "user_id": "u699596082"}, "prompt_components": {"gold_output": "RY\nGR\n", "input_to_evaluate": "var\n n,m,j,i,d,x,y:longint;\nbegin\n readln(n,m,d);\n for i:=0 to n-1 do\n begin\n for j:=0 to m-1 do\n begin\n x:=(i+j+m) div d mod 2;\n y:=(i-j+m) div d mod 2;\n case 2*x+y of\n 0:write('R');\n 1:write('G');\n 2:write('B');\n 3:write('Y');\n end;\n end;\n writeln;\n end; \nend.", "problem_context": "Score : 700 points\n\nProblem Statement\n\nWe have a grid with H rows and W columns of squares.\nWe will represent the square at the i-th row from the top and j-th column from the left as (i,\\ j).\nAlso, we will define the distance between the squares (i_1,\\ j_1) and (i_2,\\ j_2) as |i_1 - i_2| + |j_1 - j_2|.\n\nSnuke is painting each square in red, yellow, green or blue.\nHere, for a given positive integer d, he wants to satisfy the following condition:\n\nNo two squares with distance exactly d have the same color.\n\nFind a way to paint the squares satisfying the condition.\nIt can be shown that a solution always exists.\n\nConstraints\n\n2 ≤ H, W ≤ 500\n\n1 ≤ d ≤ H + W - 2\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W d\n\nOutput\n\nPrint a way to paint the squares satisfying the condition, in the following format. If the square (i,\\ j) is painted in red, yellow, green or blue, c_{ij} should be R, Y, G or B, respectively.\n\nc_{11}c_{12}...c_{1W}\n:\nc_{H1}c_{H2}...c_{HW}\n\nSample Input 1\n\n2 2 1\n\nSample Output 1\n\nRY\nGR\n\nThere are four pairs of squares with distance exactly 1.\nAs shown below, no two such squares have the same color.\n\n(1,\\ 1), (1,\\ 2) : R, Y\n\n(1,\\ 2), (2,\\ 2) : Y, R\n\n(2,\\ 2), (2,\\ 1) : R, G\n\n(2,\\ 1), (1,\\ 1) : G, R\n\nSample Input 2\n\n2 3 2\n\nSample Output 2\n\nRYB\nRGB\n\nThere are six pairs of squares with distance exactly 2.\nAs shown below, no two such squares have the same color.\n\n(1,\\ 1) , (1,\\ 3) : R , B\n\n(1,\\ 3) , (2,\\ 2) : B , G\n\n(2,\\ 2) , (1,\\ 1) : G , R\n\n(2,\\ 1) , (2,\\ 3) : R , B\n\n(2,\\ 3) , (1,\\ 2) : B , Y\n\n(1,\\ 2) , (2,\\ 1) : Y , R", "sample_input": "2 2 1\n"}, "reference_outputs": ["RY\nGR\n"], "source_document_id": "p03594", "source_text": "Score : 700 points\n\nProblem Statement\n\nWe have a grid with H rows and W columns of squares.\nWe will represent the square at the i-th row from the top and j-th column from the left as (i,\\ j).\nAlso, we will define the distance between the squares (i_1,\\ j_1) and (i_2,\\ j_2) as |i_1 - i_2| + |j_1 - j_2|.\n\nSnuke is painting each square in red, yellow, green or blue.\nHere, for a given positive integer d, he wants to satisfy the following condition:\n\nNo two squares with distance exactly d have the same color.\n\nFind a way to paint the squares satisfying the condition.\nIt can be shown that a solution always exists.\n\nConstraints\n\n2 ≤ H, W ≤ 500\n\n1 ≤ d ≤ H + W - 2\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W d\n\nOutput\n\nPrint a way to paint the squares satisfying the condition, in the following format. If the square (i,\\ j) is painted in red, yellow, green or blue, c_{ij} should be R, Y, G or B, respectively.\n\nc_{11}c_{12}...c_{1W}\n:\nc_{H1}c_{H2}...c_{HW}\n\nSample Input 1\n\n2 2 1\n\nSample Output 1\n\nRY\nGR\n\nThere are four pairs of squares with distance exactly 1.\nAs shown below, no two such squares have the same color.\n\n(1,\\ 1), (1,\\ 2) : R, Y\n\n(1,\\ 2), (2,\\ 2) : Y, R\n\n(2,\\ 2), (2,\\ 1) : R, G\n\n(2,\\ 1), (1,\\ 1) : G, R\n\nSample Input 2\n\n2 3 2\n\nSample Output 2\n\nRYB\nRGB\n\nThere are six pairs of squares with distance exactly 2.\nAs shown below, no two such squares have the same color.\n\n(1,\\ 1) , (1,\\ 3) : R , B\n\n(1,\\ 3) , (2,\\ 2) : B , G\n\n(2,\\ 2) , (1,\\ 1) : G , R\n\n(2,\\ 1) , (2,\\ 3) : R , B\n\n(2,\\ 3) , (1,\\ 2) : B , Y\n\n(1,\\ 2) , (2,\\ 1) : Y , R", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 311, "cpu_time_ms": 16, "memory_kb": 384}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s024440465", "group_id": "codeNet:p03598", "input_text": "uses math;\nvar\n n,k,i,x,s:longint;\nbegin\n readln(n); \n readln(k);\n for i:=1 to n do\n begin\n readln(x);\n s:=s+2*min(k-x,x);\n end;\n writeln(s);\nend.", "language": "Pascal", "metadata": {"date": 1582597345, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03598.html", "problem_id": "p03598", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03598/input.txt", "sample_output_relpath": "derived/input_output/data/p03598/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03598/Pascal/s024440465.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s024440465", "user_id": "u476418095"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "uses math;\nvar\n n,k,i,x,s:longint;\nbegin\n readln(n); \n readln(k);\n for i:=1 to n do\n begin\n readln(x);\n s:=s+2*min(k-x,x);\n end;\n writeln(s);\nend.", "problem_context": "Score : 200 points\n\nProblem Statement\n\nThere are N balls in the xy-plane. The coordinates of the i-th of them is (x_i, i).\nThus, we have one ball on each of the N lines y = 1, y = 2, ..., y = N.\n\nIn order to collect these balls, Snuke prepared 2N robots, N of type A and N of type B.\nThen, he placed the i-th type-A robot at coordinates (0, i), and the i-th type-B robot at coordinates (K, i).\nThus, now we have one type-A robot and one type-B robot on each of the N lines y = 1, y = 2, ..., y = N.\n\nWhen activated, each type of robot will operate as follows.\n\nWhen a type-A robot is activated at coordinates (0, a), it will move to the position of the ball on the line y = a, collect the ball, move back to its original position (0, a) and deactivate itself. If there is no such ball, it will just deactivate itself without doing anything.\n\nWhen a type-B robot is activated at coordinates (K, b), it will move to the position of the ball on the line y = b, collect the ball, move back to its original position (K, b) and deactivate itself. If there is no such ball, it will just deactivate itself without doing anything.\n\nSnuke will activate some of the 2N robots to collect all of the balls. Find the minimum possible total distance covered by robots.\n\nConstraints\n\n1 \\leq N \\leq 100\n\n1 \\leq K \\leq 100\n\n0 < x_i < K\n\nAll input values are integers.\n\nInputs\n\nInput is given from Standard Input in the following format:\n\nN\nK\nx_1 x_2 ... x_N\n\nOutputs\n\nPrint the minimum possible total distance covered by robots.\n\nSample Input 1\n\n1\n10\n2\n\nSample Output 1\n\n4\n\nThere are just one ball, one type-A robot and one type-B robot.\n\nIf the type-A robot is used to collect the ball, the distance from the robot to the ball is 2, and the distance from the ball to the original position of the robot is also 2, for a total distance of 4.\n\nSimilarly, if the type-B robot is used, the total distance covered will be 16.\n\nThus, the total distance covered will be minimized when the type-A robot is used. The output should be 4.\n\nSample Input 2\n\n2\n9\n3 6\n\nSample Output 2\n\n12\n\nThe total distance covered will be minimized when the first ball is collected by the type-A robot, and the second ball by the type-B robot.\n\nSample Input 3\n\n5\n20\n11 12 9 17 12\n\nSample Output 3\n\n74", "sample_input": "1\n10\n2\n"}, "reference_outputs": ["4\n"], "source_document_id": "p03598", "source_text": "Score : 200 points\n\nProblem Statement\n\nThere are N balls in the xy-plane. The coordinates of the i-th of them is (x_i, i).\nThus, we have one ball on each of the N lines y = 1, y = 2, ..., y = N.\n\nIn order to collect these balls, Snuke prepared 2N robots, N of type A and N of type B.\nThen, he placed the i-th type-A robot at coordinates (0, i), and the i-th type-B robot at coordinates (K, i).\nThus, now we have one type-A robot and one type-B robot on each of the N lines y = 1, y = 2, ..., y = N.\n\nWhen activated, each type of robot will operate as follows.\n\nWhen a type-A robot is activated at coordinates (0, a), it will move to the position of the ball on the line y = a, collect the ball, move back to its original position (0, a) and deactivate itself. If there is no such ball, it will just deactivate itself without doing anything.\n\nWhen a type-B robot is activated at coordinates (K, b), it will move to the position of the ball on the line y = b, collect the ball, move back to its original position (K, b) and deactivate itself. If there is no such ball, it will just deactivate itself without doing anything.\n\nSnuke will activate some of the 2N robots to collect all of the balls. Find the minimum possible total distance covered by robots.\n\nConstraints\n\n1 \\leq N \\leq 100\n\n1 \\leq K \\leq 100\n\n0 < x_i < K\n\nAll input values are integers.\n\nInputs\n\nInput is given from Standard Input in the following format:\n\nN\nK\nx_1 x_2 ... x_N\n\nOutputs\n\nPrint the minimum possible total distance covered by robots.\n\nSample Input 1\n\n1\n10\n2\n\nSample Output 1\n\n4\n\nThere are just one ball, one type-A robot and one type-B robot.\n\nIf the type-A robot is used to collect the ball, the distance from the robot to the ball is 2, and the distance from the ball to the original position of the robot is also 2, for a total distance of 4.\n\nSimilarly, if the type-B robot is used, the total distance covered will be 16.\n\nThus, the total distance covered will be minimized when the type-A robot is used. The output should be 4.\n\nSample Input 2\n\n2\n9\n3 6\n\nSample Output 2\n\n12\n\nThe total distance covered will be minimized when the first ball is collected by the type-A robot, and the second ball by the type-B robot.\n\nSample Input 3\n\n5\n20\n11 12 9 17 12\n\nSample Output 3\n\n74", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 167, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s668984013", "group_id": "codeNet:p03599", "input_text": "var a,b,c,d,e,f:longint;\n max:real;\n ansx,ansy,x:longint;\n i,j,k,q:longint;\n sugar:longint;\nbegin\n read(a,b,c,d,e,f);\n a:=a*100;\n b:=b*100;\n for i:=0 to f div a do\n for j:=0 to (f-a*i) div b do\n if (i+j>0)and(a*i+b*j=k*c+q*d) then\n begin\n sugar:=k*c+q*d;\n if (sugar*100)/(x+sugar)>max then\n begin\n max:=(sugar*100)/(x+sugar);\n ansx:=x;\n ansy:=sugar;\n end;\n end;\n end;\n writeln(ansx+ansy,' ',ansy);\nend.", "language": "Pascal", "metadata": {"date": 1505613335, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03599.html", "problem_id": "p03599", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03599/input.txt", "sample_output_relpath": "derived/input_output/data/p03599/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03599/Pascal/s668984013.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s668984013", "user_id": "u809476955"}, "prompt_components": {"gold_output": "110 10\n", "input_to_evaluate": "var a,b,c,d,e,f:longint;\n max:real;\n ansx,ansy,x:longint;\n i,j,k,q:longint;\n sugar:longint;\nbegin\n read(a,b,c,d,e,f);\n a:=a*100;\n b:=b*100;\n for i:=0 to f div a do\n for j:=0 to (f-a*i) div b do\n if (i+j>0)and(a*i+b*j=k*c+q*d) then\n begin\n sugar:=k*c+q*d;\n if (sugar*100)/(x+sugar)>max then\n begin\n max:=(sugar*100)/(x+sugar);\n ansx:=x;\n ansy:=sugar;\n end;\n end;\n end;\n writeln(ansx+ansy,' ',ansy);\nend.", "problem_context": "Score : 300 points\n\nProblem Statement\n\nSnuke is making sugar water in a beaker.\nInitially, the beaker is empty. Snuke can perform the following four types of operations any number of times. He may choose not to perform some types of operations.\n\nOperation 1: Pour 100A grams of water into the beaker.\n\nOperation 2: Pour 100B grams of water into the beaker.\n\nOperation 3: Put C grams of sugar into the beaker.\n\nOperation 4: Put D grams of sugar into the beaker.\n\nIn our experimental environment, E grams of sugar can dissolve into 100 grams of water.\n\nSnuke will make sugar water with the highest possible density.\n\nThe beaker can contain at most F grams of substances (water and sugar combined), and there must not be any undissolved sugar in the beaker.\nFind the mass of the sugar water Snuke will make, and the mass of sugar dissolved in it.\nIf there is more than one candidate, any of them will be accepted.\n\nWe remind you that the sugar water that contains a grams of water and b grams of sugar is \\frac{100b}{a + b} percent.\nAlso, in this problem, pure water that does not contain any sugar is regarded as 0 percent density sugar water.\n\nConstraints\n\n1 \\leq A < B \\leq 30\n\n1 \\leq C < D \\leq 30\n\n1 \\leq E \\leq 100\n\n100A \\leq F \\leq 3 000\n\nA, B, C, D, E and F are all integers.\n\nInputs\n\nInput is given from Standard Input in the following format:\n\nA B C D E F\n\nOutputs\n\nPrint two integers separated by a space.\nThe first integer should be the mass of the desired sugar water, and the second should be the mass of the sugar dissolved in it.\n\nSample Input 1\n\n1 2 10 20 15 200\n\nSample Output 1\n\n110 10\n\nIn this environment, 15 grams of sugar can dissolve into 100 grams of water, and the beaker can contain at most 200 grams of substances.\n\nWe can make 110 grams of sugar water by performing Operation 1 once and Operation 3 once.\nIt is not possible to make sugar water with higher density.\nFor example, the following sequences of operations are infeasible:\n\nIf we perform Operation 1 once and Operation 4 once, there will be undissolved sugar in the beaker.\n\nIf we perform Operation 2 once and Operation 3 three times, the mass of substances in the beaker will exceed 200 grams.\n\nSample Input 2\n\n1 2 1 2 100 1000\n\nSample Output 2\n\n200 100\n\nThere are other acceptable outputs, such as:\n\n400 200\n\nHowever, the output below is not acceptable:\n\n300 150\n\nThis is because, in order to make 300 grams of sugar water containing 150 grams of sugar, we need to pour exactly 150 grams of water into the beaker, which is impossible.\n\nSample Input 3\n\n17 19 22 26 55 2802\n\nSample Output 3\n\n2634 934", "sample_input": "1 2 10 20 15 200\n"}, "reference_outputs": ["110 10\n"], "source_document_id": "p03599", "source_text": "Score : 300 points\n\nProblem Statement\n\nSnuke is making sugar water in a beaker.\nInitially, the beaker is empty. Snuke can perform the following four types of operations any number of times. He may choose not to perform some types of operations.\n\nOperation 1: Pour 100A grams of water into the beaker.\n\nOperation 2: Pour 100B grams of water into the beaker.\n\nOperation 3: Put C grams of sugar into the beaker.\n\nOperation 4: Put D grams of sugar into the beaker.\n\nIn our experimental environment, E grams of sugar can dissolve into 100 grams of water.\n\nSnuke will make sugar water with the highest possible density.\n\nThe beaker can contain at most F grams of substances (water and sugar combined), and there must not be any undissolved sugar in the beaker.\nFind the mass of the sugar water Snuke will make, and the mass of sugar dissolved in it.\nIf there is more than one candidate, any of them will be accepted.\n\nWe remind you that the sugar water that contains a grams of water and b grams of sugar is \\frac{100b}{a + b} percent.\nAlso, in this problem, pure water that does not contain any sugar is regarded as 0 percent density sugar water.\n\nConstraints\n\n1 \\leq A < B \\leq 30\n\n1 \\leq C < D \\leq 30\n\n1 \\leq E \\leq 100\n\n100A \\leq F \\leq 3 000\n\nA, B, C, D, E and F are all integers.\n\nInputs\n\nInput is given from Standard Input in the following format:\n\nA B C D E F\n\nOutputs\n\nPrint two integers separated by a space.\nThe first integer should be the mass of the desired sugar water, and the second should be the mass of the sugar dissolved in it.\n\nSample Input 1\n\n1 2 10 20 15 200\n\nSample Output 1\n\n110 10\n\nIn this environment, 15 grams of sugar can dissolve into 100 grams of water, and the beaker can contain at most 200 grams of substances.\n\nWe can make 110 grams of sugar water by performing Operation 1 once and Operation 3 once.\nIt is not possible to make sugar water with higher density.\nFor example, the following sequences of operations are infeasible:\n\nIf we perform Operation 1 once and Operation 4 once, there will be undissolved sugar in the beaker.\n\nIf we perform Operation 2 once and Operation 3 three times, the mass of substances in the beaker will exceed 200 grams.\n\nSample Input 2\n\n1 2 1 2 100 1000\n\nSample Output 2\n\n200 100\n\nThere are other acceptable outputs, such as:\n\n400 200\n\nHowever, the output below is not acceptable:\n\n300 150\n\nThis is because, in order to make 300 grams of sugar water containing 150 grams of sugar, we need to pour exactly 150 grams of water into the beaker, which is impossible.\n\nSample Input 3\n\n17 19 22 26 55 2802\n\nSample Output 3\n\n2634 934", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 719, "cpu_time_ms": 33, "memory_kb": 128}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s877456511", "group_id": "codeNet:p03601", "input_text": "var\n\ta,b,c,d,e,f,ff,fff,ffff,i,j,k,l,ansa,ansb,tmp:Longint;\nbegin\n\tread(a,b,c,d,e,f);\n\tansa:=100*a;\n\twhile f>0 do begin\n\t\tff:=f;\n\t\tj:=0;\n\t\twhile ff>0 do begin\n\t\t\ttmp:=a*i+b*j;\n\t\t\tfff:=f;\n\t\t\tk:=0;\n\t\t\twhile fff>0 do begin\n\t\t\t\tffff:=fff;\n\t\t\t\tl:=0;\n\t\t\t\twhile ffff>0 do begin\n\t\t\t\t\tif(tmp*e>=c*k+d*l)and(ansa*(c*k+d*l)>ansb*(100*tmp+c*k+d*l))then begin\n\t\t\t\t\t\tansb:=c*k+d*l;\n\t\t\t\t\t\tansa:=100*(a*i+b*j)+ansb;\n\t\t\t\t\tend;\n\t\t\t\t\tinc(l);\n\t\t\t\t\tdec(ffff,d);\n\t\t\t\tend;\n\t\t\t\tinc(k);\n\t\t\t\tdec(fff,c);\n\t\t\tend;\n\t\t\tinc(j);\n\t\t\tdec(ff,100*b);\n\t\tend;\n\t\tinc(i);\n\t\tdec(f,100*a);\n\tend;\n\twrite(ansa);\n\twrite(' ');\n\twriteln(ansb);\nend.\n", "language": "Pascal", "metadata": {"date": 1538094819, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03601.html", "problem_id": "p03601", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03601/input.txt", "sample_output_relpath": "derived/input_output/data/p03601/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03601/Pascal/s877456511.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s877456511", "user_id": "u657913472"}, "prompt_components": {"gold_output": "110 10\n", "input_to_evaluate": "var\n\ta,b,c,d,e,f,ff,fff,ffff,i,j,k,l,ansa,ansb,tmp:Longint;\nbegin\n\tread(a,b,c,d,e,f);\n\tansa:=100*a;\n\twhile f>0 do begin\n\t\tff:=f;\n\t\tj:=0;\n\t\twhile ff>0 do begin\n\t\t\ttmp:=a*i+b*j;\n\t\t\tfff:=f;\n\t\t\tk:=0;\n\t\t\twhile fff>0 do begin\n\t\t\t\tffff:=fff;\n\t\t\t\tl:=0;\n\t\t\t\twhile ffff>0 do begin\n\t\t\t\t\tif(tmp*e>=c*k+d*l)and(ansa*(c*k+d*l)>ansb*(100*tmp+c*k+d*l))then begin\n\t\t\t\t\t\tansb:=c*k+d*l;\n\t\t\t\t\t\tansa:=100*(a*i+b*j)+ansb;\n\t\t\t\t\tend;\n\t\t\t\t\tinc(l);\n\t\t\t\t\tdec(ffff,d);\n\t\t\t\tend;\n\t\t\t\tinc(k);\n\t\t\t\tdec(fff,c);\n\t\t\tend;\n\t\t\tinc(j);\n\t\t\tdec(ff,100*b);\n\t\tend;\n\t\tinc(i);\n\t\tdec(f,100*a);\n\tend;\n\twrite(ansa);\n\twrite(' ');\n\twriteln(ansb);\nend.\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nSnuke is making sugar water in a beaker.\nInitially, the beaker is empty. Snuke can perform the following four types of operations any number of times. He may choose not to perform some types of operations.\n\nOperation 1: Pour 100A grams of water into the beaker.\n\nOperation 2: Pour 100B grams of water into the beaker.\n\nOperation 3: Put C grams of sugar into the beaker.\n\nOperation 4: Put D grams of sugar into the beaker.\n\nIn our experimental environment, E grams of sugar can dissolve into 100 grams of water.\n\nSnuke will make sugar water with the highest possible density.\n\nThe beaker can contain at most F grams of substances (water and sugar combined), and there must not be any undissolved sugar in the beaker.\nFind the mass of the sugar water Snuke will make, and the mass of sugar dissolved in it.\nIf there is more than one candidate, any of them will be accepted.\n\nWe remind you that the sugar water that contains a grams of water and b grams of sugar is \\frac{100b}{a + b} percent.\nAlso, in this problem, pure water that does not contain any sugar is regarded as 0 percent density sugar water.\n\nConstraints\n\n1 \\leq A < B \\leq 30\n\n1 \\leq C < D \\leq 30\n\n1 \\leq E \\leq 100\n\n100A \\leq F \\leq 3 000\n\nA, B, C, D, E and F are all integers.\n\nInputs\n\nInput is given from Standard Input in the following format:\n\nA B C D E F\n\nOutputs\n\nPrint two integers separated by a space.\nThe first integer should be the mass of the desired sugar water, and the second should be the mass of the sugar dissolved in it.\n\nSample Input 1\n\n1 2 10 20 15 200\n\nSample Output 1\n\n110 10\n\nIn this environment, 15 grams of sugar can dissolve into 100 grams of water, and the beaker can contain at most 200 grams of substances.\n\nWe can make 110 grams of sugar water by performing Operation 1 once and Operation 3 once.\nIt is not possible to make sugar water with higher density.\nFor example, the following sequences of operations are infeasible:\n\nIf we perform Operation 1 once and Operation 4 once, there will be undissolved sugar in the beaker.\n\nIf we perform Operation 2 once and Operation 3 three times, the mass of substances in the beaker will exceed 200 grams.\n\nSample Input 2\n\n1 2 1 2 100 1000\n\nSample Output 2\n\n200 100\n\nThere are other acceptable outputs, such as:\n\n400 200\n\nHowever, the output below is not acceptable:\n\n300 150\n\nThis is because, in order to make 300 grams of sugar water containing 150 grams of sugar, we need to pour exactly 150 grams of water into the beaker, which is impossible.\n\nSample Input 3\n\n17 19 22 26 55 2802\n\nSample Output 3\n\n2634 934", "sample_input": "1 2 10 20 15 200\n"}, "reference_outputs": ["110 10\n"], "source_document_id": "p03601", "source_text": "Score : 300 points\n\nProblem Statement\n\nSnuke is making sugar water in a beaker.\nInitially, the beaker is empty. Snuke can perform the following four types of operations any number of times. He may choose not to perform some types of operations.\n\nOperation 1: Pour 100A grams of water into the beaker.\n\nOperation 2: Pour 100B grams of water into the beaker.\n\nOperation 3: Put C grams of sugar into the beaker.\n\nOperation 4: Put D grams of sugar into the beaker.\n\nIn our experimental environment, E grams of sugar can dissolve into 100 grams of water.\n\nSnuke will make sugar water with the highest possible density.\n\nThe beaker can contain at most F grams of substances (water and sugar combined), and there must not be any undissolved sugar in the beaker.\nFind the mass of the sugar water Snuke will make, and the mass of sugar dissolved in it.\nIf there is more than one candidate, any of them will be accepted.\n\nWe remind you that the sugar water that contains a grams of water and b grams of sugar is \\frac{100b}{a + b} percent.\nAlso, in this problem, pure water that does not contain any sugar is regarded as 0 percent density sugar water.\n\nConstraints\n\n1 \\leq A < B \\leq 30\n\n1 \\leq C < D \\leq 30\n\n1 \\leq E \\leq 100\n\n100A \\leq F \\leq 3 000\n\nA, B, C, D, E and F are all integers.\n\nInputs\n\nInput is given from Standard Input in the following format:\n\nA B C D E F\n\nOutputs\n\nPrint two integers separated by a space.\nThe first integer should be the mass of the desired sugar water, and the second should be the mass of the sugar dissolved in it.\n\nSample Input 1\n\n1 2 10 20 15 200\n\nSample Output 1\n\n110 10\n\nIn this environment, 15 grams of sugar can dissolve into 100 grams of water, and the beaker can contain at most 200 grams of substances.\n\nWe can make 110 grams of sugar water by performing Operation 1 once and Operation 3 once.\nIt is not possible to make sugar water with higher density.\nFor example, the following sequences of operations are infeasible:\n\nIf we perform Operation 1 once and Operation 4 once, there will be undissolved sugar in the beaker.\n\nIf we perform Operation 2 once and Operation 3 three times, the mass of substances in the beaker will exceed 200 grams.\n\nSample Input 2\n\n1 2 1 2 100 1000\n\nSample Output 2\n\n200 100\n\nThere are other acceptable outputs, such as:\n\n400 200\n\nHowever, the output below is not acceptable:\n\n300 150\n\nThis is because, in order to make 300 grams of sugar water containing 150 grams of sugar, we need to pour exactly 150 grams of water into the beaker, which is impossible.\n\nSample Input 3\n\n17 19 22 26 55 2802\n\nSample Output 3\n\n2634 934", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 14, "memory_kb": 128}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s424899655", "group_id": "codeNet:p03602", "input_text": "var\n\tn,i,j,k:Longint;\n\ts:int64;\n\ta,f:array[1..300,1..300]of Longint;\nbegin\n\tread(n);\n\tfor i:=1 to n do for j:=1 to n do read(a[i,j]);\n\tfor i:=1 to n do for j:=1 to n do for k:=1 to n do begin\n\t\tif a[i,k]+a[k,j]k)and(j<>k)then f[i,j]:=1;\n\tend;\n\tfor i:=1 to n do for j:=i to n do inc(s,a[i,j]*(1-f[i,j]));\n\twriteln(s);\nend.\n", "language": "Pascal", "metadata": {"date": 1539756808, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03602.html", "problem_id": "p03602", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03602/input.txt", "sample_output_relpath": "derived/input_output/data/p03602/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03602/Pascal/s424899655.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s424899655", "user_id": "u657913472"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "var\n\tn,i,j,k:Longint;\n\ts:int64;\n\ta,f:array[1..300,1..300]of Longint;\nbegin\n\tread(n);\n\tfor i:=1 to n do for j:=1 to n do read(a[i,j]);\n\tfor i:=1 to n do for j:=1 to n do for k:=1 to n do begin\n\t\tif a[i,k]+a[k,j]k)and(j<>k)then f[i,j]:=1;\n\tend;\n\tfor i:=1 to n do for j:=i to n do inc(s,a[i,j]*(1-f[i,j]));\n\twriteln(s);\nend.\n", "problem_context": "Score : 500 points\n\nProblem Statement\n\nIn Takahashi Kingdom, which once existed, there are N cities, and some pairs of cities are connected bidirectionally by roads.\nThe following are known about the road network:\n\nPeople traveled between cities only through roads. It was possible to reach any city from any other city, via intermediate cities if necessary.\n\nDifferent roads may have had different lengths, but all the lengths were positive integers.\n\nSnuke the archeologist found a table with N rows and N columns, A, in the ruin of Takahashi Kingdom.\nHe thought that it represented the shortest distances between the cities along the roads in the kingdom.\n\nDetermine whether there exists a road network such that for each u and v, the integer A_{u, v} at the u-th row and v-th column of A is equal to the length of the shortest path from City u to City v.\nIf such a network exist, find the shortest possible total length of the roads.\n\nConstraints\n\n1 \\leq N \\leq 300\n\nIf i ≠ j, 1 \\leq A_{i, j} = A_{j, i} \\leq 10^9.\n\nA_{i, i} = 0\n\nInputs\n\nInput is given from Standard Input in the following format:\n\nN\nA_{1, 1} A_{1, 2} ... A_{1, N}\nA_{2, 1} A_{2, 2} ... A_{2, N}\n...\nA_{N, 1} A_{N, 2} ... A_{N, N}\n\nOutputs\n\nIf there exists no network that satisfies the condition, print -1.\nIf it exists, print the shortest possible total length of the roads.\n\nSample Input 1\n\n3\n0 1 3\n1 0 2\n3 2 0\n\nSample Output 1\n\n3\n\nThe network below satisfies the condition:\n\nCity 1 and City 2 is connected by a road of length 1.\n\nCity 2 and City 3 is connected by a road of length 2.\n\nCity 3 and City 1 is not connected by a road.\n\nSample Input 2\n\n3\n0 1 3\n1 0 1\n3 1 0\n\nSample Output 2\n\n-1\n\nAs there is a path of length 1 from City 1 to City 2 and City 2 to City 3, there is a path of length 2 from City 1 to City 3.\nHowever, according to the table, the shortest distance between City 1 and City 3 must be 3.\n\nThus, we conclude that there exists no network that satisfies the condition.\n\nSample Input 3\n\n5\n0 21 18 11 28\n21 0 13 10 26\n18 13 0 23 13\n11 10 23 0 17\n28 26 13 17 0\n\nSample Output 3\n\n82\n\nSample Input 4\n\n3\n0 1000000000 1000000000\n1000000000 0 1000000000\n1000000000 1000000000 0\n\nSample Output 4\n\n3000000000", "sample_input": "3\n0 1 3\n1 0 2\n3 2 0\n"}, "reference_outputs": ["3\n"], "source_document_id": "p03602", "source_text": "Score : 500 points\n\nProblem Statement\n\nIn Takahashi Kingdom, which once existed, there are N cities, and some pairs of cities are connected bidirectionally by roads.\nThe following are known about the road network:\n\nPeople traveled between cities only through roads. It was possible to reach any city from any other city, via intermediate cities if necessary.\n\nDifferent roads may have had different lengths, but all the lengths were positive integers.\n\nSnuke the archeologist found a table with N rows and N columns, A, in the ruin of Takahashi Kingdom.\nHe thought that it represented the shortest distances between the cities along the roads in the kingdom.\n\nDetermine whether there exists a road network such that for each u and v, the integer A_{u, v} at the u-th row and v-th column of A is equal to the length of the shortest path from City u to City v.\nIf such a network exist, find the shortest possible total length of the roads.\n\nConstraints\n\n1 \\leq N \\leq 300\n\nIf i ≠ j, 1 \\leq A_{i, j} = A_{j, i} \\leq 10^9.\n\nA_{i, i} = 0\n\nInputs\n\nInput is given from Standard Input in the following format:\n\nN\nA_{1, 1} A_{1, 2} ... A_{1, N}\nA_{2, 1} A_{2, 2} ... A_{2, N}\n...\nA_{N, 1} A_{N, 2} ... A_{N, N}\n\nOutputs\n\nIf there exists no network that satisfies the condition, print -1.\nIf it exists, print the shortest possible total length of the roads.\n\nSample Input 1\n\n3\n0 1 3\n1 0 2\n3 2 0\n\nSample Output 1\n\n3\n\nThe network below satisfies the condition:\n\nCity 1 and City 2 is connected by a road of length 1.\n\nCity 2 and City 3 is connected by a road of length 2.\n\nCity 3 and City 1 is not connected by a road.\n\nSample Input 2\n\n3\n0 1 3\n1 0 1\n3 1 0\n\nSample Output 2\n\n-1\n\nAs there is a path of length 1 from City 1 to City 2 and City 2 to City 3, there is a path of length 2 from City 1 to City 3.\nHowever, according to the table, the shortest distance between City 1 and City 3 must be 3.\n\nThus, we conclude that there exists no network that satisfies the condition.\n\nSample Input 3\n\n5\n0 21 18 11 28\n21 0 13 10 26\n18 13 0 23 13\n11 10 23 0 17\n28 26 13 17 0\n\nSample Output 3\n\n82\n\nSample Input 4\n\n3\n0 1000000000 1000000000\n1000000000 0 1000000000\n1000000000 1000000000 0\n\nSample Output 4\n\n3000000000", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 238, "memory_kb": 896}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s935758666", "group_id": "codeNet:p03602", "input_text": "var\n n,i,j,k,t,q:longint;\n total:qword;\n a,b:array[1..300,1..300]of longint;\nbegin\n readln(n);\n for i:=1 to n do\n for j:=1 to n do read(a[i,j]);\n b:=a;\n for i:=1 to n do\n for j:=i+1 to n do\n begin\n t:=0; q:=b[i,j];\n for k:=1 to n do if (k<>i)and(k<>j) then\n begin\n if (k<>i)and(k<>j)then\n begin\n if b[i,j]>b[i,k]+b[k,j] then\n begin\n inc(t);\n if q>b[i,k]+b[k,j] then q:=b[i,k]+b[k,j];\n end;\n if b[i,j]i)and(k<>j) then\n begin\n if (k<>i)and(k<>j)then\n begin\n if b[i,j]>b[i,k]+b[k,j] then\n begin\n inc(t);\n if q>b[i,k]+b[k,j] then q:=b[i,k]+b[k,j];\n end;\n if b[i,j]i)and(k<>j) then\n begin\n if (k<>i)and(k<>j)then\n begin\n if b[i,j]>b[i,k]+b[k,j] then\n begin\n inc(t);\n b[i,j]:=b[i,k]+b[k,j];\n end; \n if b[i,j]i)and(k<>j) then\n begin\n if (k<>i)and(k<>j)then\n begin\n if b[i,j]>b[i,k]+b[k,j] then\n begin\n inc(t);\n b[i,j]:=b[i,k]+b[k,j];\n end; \n if b[i,j]0 then writeln('Yes') else writeln('No');\nend.", "language": "Pascal", "metadata": {"date": 1582067650, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03605.html", "problem_id": "p03605", "resource_group": "low_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/Pascal/s163792787.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s163792787", "user_id": "u263933075"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "var\n n:string;\nbegin\n readln(n);\n if pos('9',n)>0 then writeln('Yes') else writeln('No');\nend.", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 97, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s756703241", "group_id": "codeNet:p03607", "input_text": "var\n n,a,b,i,s,ans:longint;\nbegin\n readln(n);\n readln(a);\n s:=1;\n for i:=2 to n do\n begin\n readln(b);\n if a=b then s:=(s+1) mod 2\n else begin ans:=ans+s;s:=1;end;\n a:=b;\n end;\n if odd(s mod 2) then inc(ans);\n writeln(ans);\nend.", "language": "Pascal", "metadata": {"date": 1540169880, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03607.html", "problem_id": "p03607", "resource_group": "low_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/Pascal/s756703241.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s756703241", "user_id": "u247366051"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "var\n n,a,b,i,s,ans:longint;\nbegin\n readln(n);\n readln(a);\n s:=1;\n for i:=2 to n do\n begin\n readln(b);\n if a=b then s:=(s+1) mod 2\n else begin ans:=ans+s;s:=1;end;\n a:=b;\n end;\n if odd(s mod 2) then inc(ans);\n writeln(ans);\nend.", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 16, "memory_kb": 128}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s544249331", "group_id": "codeNet:p03607", "input_text": "program ec12;\nvar \n\tn,m,i,j,ans,tot:longint;\n\ta:array[1..100001] of longint;\nprocedure qsrt(l,r:longint);\nvar \n\ti,j,v,s:longint;\nbegin\n\ti:=l; j:=r; v:=a[(l+r) div 2];\n\trepeat\n\twhile a[i]v do dec(j);\n\tif i<=j then \n\tbegin \n\t\ts:=a[i];\n\t\ta[i]:=a[j];\n\t\ta[j]:=s;\n\t\tinc(i);\n\t\tdec(j);\n\tend;\n\tuntil i>=j;\n\tif lv do dec(j);\n\tif i<=j then \n\tbegin \n\t\ts:=a[i];\n\t\ta[i]:=a[j];\n\t\ta[j]:=s;\n\t\tinc(i);\n\t\tdec(j);\n\tend;\n\tuntil i>=j;\n\tif l>1];\n repeat\n while a[i]m do dec(j);\n if i<=j then\n begin\n t:=a[i];a[i]:=a[j];a[j]:=t;\n inc(i);\n dec(j);\n end;\n until i>j;\n if la[i-1] then\n begin\n if num mod 2=1 then inc(ans);\n num:=1;\n end else inc(num);\n writeln(ans);\nend.", "language": "Pascal", "metadata": {"date": 1505005793, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03607.html", "problem_id": "p03607", "resource_group": "low_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/Pascal/s048706189.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s048706189", "user_id": "u809476955"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "var n:longint;\n i:longint;\n a:array[0..200050]of longint;\n num,ans:longint;\n\nprocedure qs(l,r:longint);\nvar i,j,m,t:longint;\nbegin\n i:=l;\n j:=r;\n m:=a[(l+r)>>1];\n repeat\n while a[i]m do dec(j);\n if i<=j then\n begin\n t:=a[i];a[i]:=a[j];a[j]:=t;\n inc(i);\n dec(j);\n end;\n until i>j;\n if la[i-1] then\n begin\n if num mod 2=1 then inc(ans);\n num:=1;\n end else inc(num);\n writeln(ans);\nend.", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 26, "memory_kb": 512}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s618026935", "group_id": "codeNet:p03608", "input_text": "var min,n,i,j,x,m,r,a1,b1,c1:longint;\n\ta:array[-5..205,-5..205] of longint;\n\tb:array[-5..205]of longint;\n\tf:array[-5..205]of boolean;\nprocedure main(s,pre,now:longint);\nvar i,j,k:longint;\nbegin\n\tif now=r then begin\n\t\tfor i:=1 to r do if f[b[i]] then begin\n\t\t\tif s+a[pre,b[i]]a[i,x]+a[x,j] then a[i,j]:=a[i,x]+a[x,j];\n\t//for i:=1 to n do for j:=1 to n do writeln(i:5,j:5,a[i,j]:5);\n\n\tmin:=maxlongint div 3*2;\n\tfor i:=1 to r do begin\n\t\tf[b[i]]:=false;\n\t\tmain(0,b[i],2);\n\t\tf[b[i]]:=true;\n\tend;\n\twriteln(min);\nend.", "language": "Pascal", "metadata": {"date": 1505008705, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03608.html", "problem_id": "p03608", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03608/input.txt", "sample_output_relpath": "derived/input_output/data/p03608/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03608/Pascal/s618026935.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s618026935", "user_id": "u768548097"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "var min,n,i,j,x,m,r,a1,b1,c1:longint;\n\ta:array[-5..205,-5..205] of longint;\n\tb:array[-5..205]of longint;\n\tf:array[-5..205]of boolean;\nprocedure main(s,pre,now:longint);\nvar i,j,k:longint;\nbegin\n\tif now=r then begin\n\t\tfor i:=1 to r do if f[b[i]] then begin\n\t\t\tif s+a[pre,b[i]]a[i,x]+a[x,j] then a[i,j]:=a[i,x]+a[x,j];\n\t//for i:=1 to n do for j:=1 to n do writeln(i:5,j:5,a[i,j]:5);\n\n\tmin:=maxlongint div 3*2;\n\tfor i:=1 to r do begin\n\t\tf[b[i]]:=false;\n\t\tmain(0,b[i],2);\n\t\tf[b[i]]:=true;\n\tend;\n\twriteln(min);\nend.", "problem_context": "Score : 400 points\n\nProblem Statement\n\nThere are N towns in the State of Atcoder, connected by M bidirectional roads.\n\nThe i-th road connects Town A_i and B_i and has a length of C_i.\n\nJoisino is visiting R towns in the state, r_1,r_2,..,r_R (not necessarily in this order).\n\nShe will fly to the first town she visits, and fly back from the last town she visits, but for the rest of the trip she will have to travel by road.\n\nIf she visits the towns in the order that minimizes the distance traveled by road, what will that distance be?\n\nConstraints\n\n2≤N≤200\n\n1≤M≤N×(N-1)/2\n\n2≤R≤min(8,N) (min(8,N) is the smaller of 8 and N.)\n\nr_i≠r_j (i≠j)\n\n1≤A_i,B_i≤N, A_i≠B_i\n\n(A_i,B_i)≠(A_j,B_j),(A_i,B_i)≠(B_j,A_j) (i≠j)\n\n1≤C_i≤100000\n\nEvery town can be reached from every town by road.\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M R\nr_1 ... r_R\nA_1 B_1 C_1\n:\nA_M B_M C_M\n\nOutput\n\nPrint the distance traveled by road if Joisino visits the towns in the order that minimizes it.\n\nSample Input 1\n\n3 3 3\n1 2 3\n1 2 1\n2 3 1\n3 1 4\n\nSample Output 1\n\n2\n\nFor example, if she visits the towns in the order of 1, 2, 3, the distance traveled will be 2, which is the minimum possible.\n\nSample Input 2\n\n3 3 2\n1 3\n2 3 2\n1 3 6\n1 2 2\n\nSample Output 2\n\n4\n\nThe shortest distance between Towns 1 and 3 is 4. Thus, whether she visits Town 1 or 3 first, the distance traveled will be 4.\n\nSample Input 3\n\n4 6 3\n2 3 4\n1 2 4\n2 3 3\n4 3 1\n1 4 1\n4 2 2\n3 1 6\n\nSample Output 3\n\n3", "sample_input": "3 3 3\n1 2 3\n1 2 1\n2 3 1\n3 1 4\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03608", "source_text": "Score : 400 points\n\nProblem Statement\n\nThere are N towns in the State of Atcoder, connected by M bidirectional roads.\n\nThe i-th road connects Town A_i and B_i and has a length of C_i.\n\nJoisino is visiting R towns in the state, r_1,r_2,..,r_R (not necessarily in this order).\n\nShe will fly to the first town she visits, and fly back from the last town she visits, but for the rest of the trip she will have to travel by road.\n\nIf she visits the towns in the order that minimizes the distance traveled by road, what will that distance be?\n\nConstraints\n\n2≤N≤200\n\n1≤M≤N×(N-1)/2\n\n2≤R≤min(8,N) (min(8,N) is the smaller of 8 and N.)\n\nr_i≠r_j (i≠j)\n\n1≤A_i,B_i≤N, A_i≠B_i\n\n(A_i,B_i)≠(A_j,B_j),(A_i,B_i)≠(B_j,A_j) (i≠j)\n\n1≤C_i≤100000\n\nEvery town can be reached from every town by road.\n\nAll input values are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M R\nr_1 ... r_R\nA_1 B_1 C_1\n:\nA_M B_M C_M\n\nOutput\n\nPrint the distance traveled by road if Joisino visits the towns in the order that minimizes it.\n\nSample Input 1\n\n3 3 3\n1 2 3\n1 2 1\n2 3 1\n3 1 4\n\nSample Output 1\n\n2\n\nFor example, if she visits the towns in the order of 1, 2, 3, the distance traveled will be 2, which is the minimum possible.\n\nSample Input 2\n\n3 3 2\n1 3\n2 3 2\n1 3 6\n1 2 2\n\nSample Output 2\n\n4\n\nThe shortest distance between Towns 1 and 3 is 4. Thus, whether she visits Town 1 or 3 first, the distance traveled will be 4.\n\nSample Input 3\n\n4 6 3\n2 3 4\n1 2 4\n2 3 3\n4 3 1\n1 4 1\n4 2 2\n3 1 6\n\nSample Output 3\n\n3", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 991, "cpu_time_ms": 33, "memory_kb": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s534480331", "group_id": "codeNet:p03608", "input_text": "var a:array[0..250,0..250]of int64;\n v:array[0..50]of boolean;\n i,j,k:longint;\n n,m,r:longint;\n x,y,z:longint;\n go:array[0..50]of longint;\n ans:int64;\nprocedure dfs(dep,last:longint;sum:int64);\nvar i:longint;\nbegin\n if sum>=ans then exit;\n if dep=r then\n begin\n if sum=ans then exit;\n if dep=r then\n begin\n if sum0 then write(s[i]);\nend.\n", "language": "Pascal", "metadata": {"date": 1554167958, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03610.html", "problem_id": "p03610", "resource_group": "low_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/Pascal/s676121519.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s676121519", "user_id": "u263933075"}, "prompt_components": {"gold_output": "acdr\n", "input_to_evaluate": "var\n s:string;\n i:longint;\nbegin\n read(s);\n for i:=1 to length(s) do\n if i mod 2<>0 then write(s[i]);\nend.\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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 3, "memory_kb": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s684262362", "group_id": "codeNet:p03610", "input_text": "var\n i:longint;\n s:string;\nbegin\n readln(s);\n for i:=1 to length(s) do\n begin\n if odd(i) then write(s[i]);\n end;\nend.", "language": "Pascal", "metadata": {"date": 1540952235, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03610.html", "problem_id": "p03610", "resource_group": "low_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/Pascal/s684262362.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s684262362", "user_id": "u426964396"}, "prompt_components": {"gold_output": "acdr\n", "input_to_evaluate": "var\n i:longint;\n s:string;\nbegin\n readln(s);\n for i:=1 to length(s) do\n begin\n if odd(i) then write(s[i]);\n end;\nend.", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 2, "memory_kb": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s081634699", "group_id": "codeNet:p03610", "input_text": "var\nf:string;\ni:longint;\nbegin\nread(f);\nfor i:=1 to length(f) do\n begin\n if i mod 2=1 then write(f[i]);\n end;\nwriteln;\nend.", "language": "Pascal", "metadata": {"date": 1540350180, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03610.html", "problem_id": "p03610", "resource_group": "low_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/Pascal/s081634699.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s081634699", "user_id": "u426964396"}, "prompt_components": {"gold_output": "acdr\n", "input_to_evaluate": "var\nf:string;\ni:longint;\nbegin\nread(f);\nfor i:=1 to length(f) do\n begin\n if i mod 2=1 then write(f[i]);\n end;\nwriteln;\nend.", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 136, "cpu_time_ms": 3, "memory_kb": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s412498935", "group_id": "codeNet:p03610", "input_text": "var\ns:string;\ni:longint;\nbegin\nread(s);\nfor i:=1 to length(s) do\nif i mod 2<>0 then write(s[i]);\nwriteln;\nend.", "language": "Pascal", "metadata": {"date": 1538945267, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03610.html", "problem_id": "p03610", "resource_group": "low_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/Pascal/s412498935.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s412498935", "user_id": "u476418095"}, "prompt_components": {"gold_output": "acdr\n", "input_to_evaluate": "var\ns:string;\ni:longint;\nbegin\nread(s);\nfor i:=1 to length(s) do\nif i mod 2<>0 then write(s[i]);\nwriteln;\nend.", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 3, "memory_kb": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s042541452", "group_id": "codeNet:p03610", "input_text": "var\n s:ansistring;\n i:longint;\nbegin\n readln(s);\n write(s[1]);\n for i:=1 to length(s) div 2-(1-ord(odd(length(s)))) do write(s[i*2+1]);\n writeln;\nend.", "language": "Pascal", "metadata": {"date": 1538795558, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03610.html", "problem_id": "p03610", "resource_group": "low_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/Pascal/s042541452.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s042541452", "user_id": "u247366051"}, "prompt_components": {"gold_output": "acdr\n", "input_to_evaluate": "var\n s:ansistring;\n i:longint;\nbegin\n readln(s);\n write(s[1]);\n for i:=1 to length(s) div 2-(1-ord(odd(length(s)))) do write(s[i*2+1]);\n writeln;\nend.", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 2, "memory_kb": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s479910389", "group_id": "codeNet:p03610", "input_text": "var\n s:ansistring;\n i:longint;\nbegin\n readln(s);\n for i:=1 to length(s) div 2 do\n write(s[(i-1)*2+1]);\nend.", "language": "Pascal", "metadata": {"date": 1538795235, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03610.html", "problem_id": "p03610", "resource_group": "low_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/Pascal/s479910389.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s479910389", "user_id": "u247366051"}, "prompt_components": {"gold_output": "acdr\n", "input_to_evaluate": "var\n s:ansistring;\n i:longint;\nbegin\n readln(s);\n for i:=1 to length(s) div 2 do\n write(s[(i-1)*2+1]);\nend.", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 2, "memory_kb": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s315392004", "group_id": "codeNet:p03610", "input_text": "var\n s:ansistring;\n i:longint;\nbegin\n readln(s);\n for i:=1 to length(s) do\n if i mod 2=1 then write(s[i]);\nend.", "language": "Pascal", "metadata": {"date": 1538778283, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03610.html", "problem_id": "p03610", "resource_group": "low_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/Pascal/s315392004.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s315392004", "user_id": "u476418095"}, "prompt_components": {"gold_output": "acdr\n", "input_to_evaluate": "var\n s:ansistring;\n i:longint;\nbegin\n readln(s);\n for i:=1 to length(s) do\n if i mod 2=1 then write(s[i]);\nend.", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 112, "cpu_time_ms": 3, "memory_kb": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s595936567", "group_id": "codeNet:p03610", "input_text": "var s:String;i:Longint;\nbegin\nreadln(s);\ni:=1;\nwhile i<=length(s) do begin\n\twrite(s[i]);\n\tinc(i,2);\nend;\nend.\n", "language": "Pascal", "metadata": {"date": 1534842167, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03610.html", "problem_id": "p03610", "resource_group": "low_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/Pascal/s595936567.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s595936567", "user_id": "u657913472"}, "prompt_components": {"gold_output": "acdr\n", "input_to_evaluate": "var s:String;i:Longint;\nbegin\nreadln(s);\ni:=1;\nwhile i<=length(s) do begin\n\twrite(s[i]);\n\tinc(i,2);\nend;\nend.\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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 2, "memory_kb": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s778652572", "group_id": "codeNet:p03610", "input_text": "var\n s,hh:ansistring;\n i:longint;\nbegin\n readln(s);\n for i:=1 to length(s) do\n if (i mod 2=1) then hh:=hh+s[i];\n writeln(hh);\nend.", "language": "Pascal", "metadata": {"date": 1504401081, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03610.html", "problem_id": "p03610", "resource_group": "low_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/Pascal/s778652572.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s778652572", "user_id": "u023971200"}, "prompt_components": {"gold_output": "acdr\n", "input_to_evaluate": "var\n s,hh:ansistring;\n i:longint;\nbegin\n readln(s);\n for i:=1 to length(s) do\n if (i mod 2=1) then hh:=hh+s[i];\n writeln(hh);\nend.", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 140, "cpu_time_ms": 5, "memory_kb": 384}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s249389501", "group_id": "codeNet:p03611", "input_text": "uses math ;\nvar n,t1,t2,i,ans,k:longint ;\n a:array[-1000000..1000000] of longint ;\nbegin\n readln(n) ;\n\t for i:=1 to n do \n\t begin \n\t read(k) ;\n\t\t inc(a[k]) ;\n\t\t inc(a[k-1]) ;\n\t\t inc(a[k+1]) ;\n\t\t t2:=max(t2,k+1) ;\n\t\t t1:=min(t1,k-1) ;\n\t end;\n\t for i:=t1 to t2 do \n\t if a[i]>ans then ans:=a[i] ;\n\t writeln(ans) ;\nend.", "language": "Pascal", "metadata": {"date": 1504402401, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03611.html", "problem_id": "p03611", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03611/input.txt", "sample_output_relpath": "derived/input_output/data/p03611/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03611/Pascal/s249389501.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s249389501", "user_id": "u049262741"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "uses math ;\nvar n,t1,t2,i,ans,k:longint ;\n a:array[-1000000..1000000] of longint ;\nbegin\n readln(n) ;\n\t for i:=1 to n do \n\t begin \n\t read(k) ;\n\t\t inc(a[k]) ;\n\t\t inc(a[k-1]) ;\n\t\t inc(a[k+1]) ;\n\t\t t2:=max(t2,k+1) ;\n\t\t t1:=min(t1,k-1) ;\n\t end;\n\t for i:=t1 to t2 do \n\t if a[i]>ans then ans:=a[i] ;\n\t writeln(ans) ;\nend.", "problem_context": "Score : 300 points\n\nProblem Statement\n\nYou are given an integer sequence of length N, a_1,a_2,...,a_N.\n\nFor each 1≤i≤N, you have three choices: add 1 to a_i, subtract 1 from a_i or do nothing.\n\nAfter these operations, you select an integer X and count the number of i such that a_i=X.\n\nMaximize this count by making optimal choices.\n\nConstraints\n\n1≤N≤10^5\n\n0≤a_i<10^5 (1≤i≤N)\n\na_i is an integer.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 a_2 .. a_N\n\nOutput\n\nPrint the maximum possible number of i such that a_i=X.\n\nSample Input 1\n\n7\n3 1 4 1 5 9 2\n\nSample Output 1\n\n4\n\nFor example, turn the sequence into 2,2,3,2,6,9,2 and select X=2 to obtain 4, the maximum possible count.\n\nSample Input 2\n\n10\n0 1 2 3 4 5 6 7 8 9\n\nSample Output 2\n\n3\n\nSample Input 3\n\n1\n99999\n\nSample Output 3\n\n1", "sample_input": "7\n3 1 4 1 5 9 2\n"}, "reference_outputs": ["4\n"], "source_document_id": "p03611", "source_text": "Score : 300 points\n\nProblem Statement\n\nYou are given an integer sequence of length N, a_1,a_2,...,a_N.\n\nFor each 1≤i≤N, you have three choices: add 1 to a_i, subtract 1 from a_i or do nothing.\n\nAfter these operations, you select an integer X and count the number of i such that a_i=X.\n\nMaximize this count by making optimal choices.\n\nConstraints\n\n1≤N≤10^5\n\n0≤a_i<10^5 (1≤i≤N)\n\na_i is an integer.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 a_2 .. a_N\n\nOutput\n\nPrint the maximum possible number of i such that a_i=X.\n\nSample Input 1\n\n7\n3 1 4 1 5 9 2\n\nSample Output 1\n\n4\n\nFor example, turn the sequence into 2,2,3,2,6,9,2 and select X=2 to obtain 4, the maximum possible count.\n\nSample Input 2\n\n10\n0 1 2 3 4 5 6 7 8 9\n\nSample Output 2\n\n3\n\nSample Input 3\n\n1\n99999\n\nSample Output 3\n\n1", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 13, "memory_kb": 4224}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s136895400", "group_id": "codeNet:p03611", "input_text": "uses math ;\nvar n,t,i,ans,k:longint ;\n a:array[-1000000..1000000] of longint ;\nbegin\n readln(n) ;\n\t for i:=1 to n do \n\t begin \n\t read(k) ;\n\t\t inc(a[k]) ;\n\t\t inc(a[k-1]) ;\n\t\t inc(a[k+1]) ;\n\t\t t:=max(t,k) ;\n\t end;\n\t for i:=1 to t do \n\t if a[i]>ans then ans:=a[i] ;\n\t writeln(ans) ;\nend.", "language": "Pascal", "metadata": {"date": 1504402304, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03611.html", "problem_id": "p03611", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03611/input.txt", "sample_output_relpath": "derived/input_output/data/p03611/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03611/Pascal/s136895400.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s136895400", "user_id": "u049262741"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "uses math ;\nvar n,t,i,ans,k:longint ;\n a:array[-1000000..1000000] of longint ;\nbegin\n readln(n) ;\n\t for i:=1 to n do \n\t begin \n\t read(k) ;\n\t\t inc(a[k]) ;\n\t\t inc(a[k-1]) ;\n\t\t inc(a[k+1]) ;\n\t\t t:=max(t,k) ;\n\t end;\n\t for i:=1 to t do \n\t if a[i]>ans then ans:=a[i] ;\n\t writeln(ans) ;\nend.", "problem_context": "Score : 300 points\n\nProblem Statement\n\nYou are given an integer sequence of length N, a_1,a_2,...,a_N.\n\nFor each 1≤i≤N, you have three choices: add 1 to a_i, subtract 1 from a_i or do nothing.\n\nAfter these operations, you select an integer X and count the number of i such that a_i=X.\n\nMaximize this count by making optimal choices.\n\nConstraints\n\n1≤N≤10^5\n\n0≤a_i<10^5 (1≤i≤N)\n\na_i is an integer.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 a_2 .. a_N\n\nOutput\n\nPrint the maximum possible number of i such that a_i=X.\n\nSample Input 1\n\n7\n3 1 4 1 5 9 2\n\nSample Output 1\n\n4\n\nFor example, turn the sequence into 2,2,3,2,6,9,2 and select X=2 to obtain 4, the maximum possible count.\n\nSample Input 2\n\n10\n0 1 2 3 4 5 6 7 8 9\n\nSample Output 2\n\n3\n\nSample Input 3\n\n1\n99999\n\nSample Output 3\n\n1", "sample_input": "7\n3 1 4 1 5 9 2\n"}, "reference_outputs": ["4\n"], "source_document_id": "p03611", "source_text": "Score : 300 points\n\nProblem Statement\n\nYou are given an integer sequence of length N, a_1,a_2,...,a_N.\n\nFor each 1≤i≤N, you have three choices: add 1 to a_i, subtract 1 from a_i or do nothing.\n\nAfter these operations, you select an integer X and count the number of i such that a_i=X.\n\nMaximize this count by making optimal choices.\n\nConstraints\n\n1≤N≤10^5\n\n0≤a_i<10^5 (1≤i≤N)\n\na_i is an integer.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 a_2 .. a_N\n\nOutput\n\nPrint the maximum possible number of i such that a_i=X.\n\nSample Input 1\n\n7\n3 1 4 1 5 9 2\n\nSample Output 1\n\n4\n\nFor example, turn the sequence into 2,2,3,2,6,9,2 and select X=2 to obtain 4, the maximum possible count.\n\nSample Input 2\n\n10\n0 1 2 3 4 5 6 7 8 9\n\nSample Output 2\n\n3\n\nSample Input 3\n\n1\n99999\n\nSample Output 3\n\n1", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 13, "memory_kb": 4224}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s732675573", "group_id": "codeNet:p03611", "input_text": "var n,i,j,ans,num,maxi:longint;\nvar a,b:array[0..100020] of longint;\nbegin\n read(n);for i:=1 to n do begin read(a[i]);inc(b[a[i]]);inc(b[a[i]+1]);\n inc(b[a[i]-1]);end;ans:=0;\n for i:=0 to 100000 do if b[i]>ans then ans:=b[i];\n writeln(ans);\nend.", "language": "Pascal", "metadata": {"date": 1504401179, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03611.html", "problem_id": "p03611", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03611/input.txt", "sample_output_relpath": "derived/input_output/data/p03611/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03611/Pascal/s732675573.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s732675573", "user_id": "u379604713"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "var n,i,j,ans,num,maxi:longint;\nvar a,b:array[0..100020] of longint;\nbegin\n read(n);for i:=1 to n do begin read(a[i]);inc(b[a[i]]);inc(b[a[i]+1]);\n inc(b[a[i]-1]);end;ans:=0;\n for i:=0 to 100000 do if b[i]>ans then ans:=b[i];\n writeln(ans);\nend.", "problem_context": "Score : 300 points\n\nProblem Statement\n\nYou are given an integer sequence of length N, a_1,a_2,...,a_N.\n\nFor each 1≤i≤N, you have three choices: add 1 to a_i, subtract 1 from a_i or do nothing.\n\nAfter these operations, you select an integer X and count the number of i such that a_i=X.\n\nMaximize this count by making optimal choices.\n\nConstraints\n\n1≤N≤10^5\n\n0≤a_i<10^5 (1≤i≤N)\n\na_i is an integer.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 a_2 .. a_N\n\nOutput\n\nPrint the maximum possible number of i such that a_i=X.\n\nSample Input 1\n\n7\n3 1 4 1 5 9 2\n\nSample Output 1\n\n4\n\nFor example, turn the sequence into 2,2,3,2,6,9,2 and select X=2 to obtain 4, the maximum possible count.\n\nSample Input 2\n\n10\n0 1 2 3 4 5 6 7 8 9\n\nSample Output 2\n\n3\n\nSample Input 3\n\n1\n99999\n\nSample Output 3\n\n1", "sample_input": "7\n3 1 4 1 5 9 2\n"}, "reference_outputs": ["4\n"], "source_document_id": "p03611", "source_text": "Score : 300 points\n\nProblem Statement\n\nYou are given an integer sequence of length N, a_1,a_2,...,a_N.\n\nFor each 1≤i≤N, you have three choices: add 1 to a_i, subtract 1 from a_i or do nothing.\n\nAfter these operations, you select an integer X and count the number of i such that a_i=X.\n\nMaximize this count by making optimal choices.\n\nConstraints\n\n1≤N≤10^5\n\n0≤a_i<10^5 (1≤i≤N)\n\na_i is an integer.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\na_1 a_2 .. a_N\n\nOutput\n\nPrint the maximum possible number of i such that a_i=X.\n\nSample Input 1\n\n7\n3 1 4 1 5 9 2\n\nSample Output 1\n\n4\n\nFor example, turn the sequence into 2,2,3,2,6,9,2 and select X=2 to obtain 4, the maximum possible count.\n\nSample Input 2\n\n10\n0 1 2 3 4 5 6 7 8 9\n\nSample Output 2\n\n3\n\nSample Input 3\n\n1\n99999\n\nSample Output 3\n\n1", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 11, "memory_kb": 896}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s860871546", "group_id": "codeNet:p03612", "input_text": "var a:array[1..100000] of longint ;\n n,i,ans,j:longint ;\nprocedure swap(n,m:longint) ;\nvar t:longint ;\nbegin \n a[n]:=t ;a[n]:=a[m];a[m]:=t ;\nend;\nprocedure solve(k:longint) ;\nbegin \n if a[k+1]=k then swap(k,k+1) \n\t else if a[k]=k+1 then swap(k,k-1) \n\t else if a[k]=k-1 then swap(k,k+1) ;\nend;\nbegin \n readln(n) ;\n\t for i:=1 to n do read(a[i]) ;\n\t i:=1;\n\t while i<=n do \n\t begin \n\t if a[i]<>i then inc(i)\n\t\t else\n\t\t begin \n\t\t solve(i) ;//挑选好的替换搭档。\n\t\t\t inc(ans) ;\n\t\t i:=i+2 ;\n\t\t end;\n\t end;\n\t writeln(ans) ;\nend.", "language": "Pascal", "metadata": {"date": 1504404749, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03612.html", "problem_id": "p03612", "resource_group": "low_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/Pascal/s860871546.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s860871546", "user_id": "u049262741"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "var a:array[1..100000] of longint ;\n n,i,ans,j:longint ;\nprocedure swap(n,m:longint) ;\nvar t:longint ;\nbegin \n a[n]:=t ;a[n]:=a[m];a[m]:=t ;\nend;\nprocedure solve(k:longint) ;\nbegin \n if a[k+1]=k then swap(k,k+1) \n\t else if a[k]=k+1 then swap(k,k-1) \n\t else if a[k]=k-1 then swap(k,k+1) ;\nend;\nbegin \n readln(n) ;\n\t for i:=1 to n do read(a[i]) ;\n\t i:=1;\n\t while i<=n do \n\t begin \n\t if a[i]<>i then inc(i)\n\t\t else\n\t\t begin \n\t\t solve(i) ;//挑选好的替换搭档。\n\t\t\t inc(ans) ;\n\t\t i:=i+2 ;\n\t\t end;\n\t end;\n\t writeln(ans) ;\nend.", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 545, "cpu_time_ms": 11, "memory_kb": 512}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s097992788", "group_id": "codeNet:p03612", "input_text": "var a:array[1..100000] of longint ;\n n,i,ans,j:longint ;\nprocedure swap(n,m:longint) ;\nvar t:longint ;\nbegin \n a[n]:=t ;a[n]:=a[m];a[m]:=t ;\nend;\nbegin \n readln(n) ;\n\t for i:=1 to n do read(a[i]) ;\n\t for i:=1 to n do \n\t begin \n\t if a[i]<>i then continue ;\n\t\t if i=1 then swap(1,2) \n\t\t else if i=n then \n\t\t begin\n\t\t\t swap(n,n-1) ;\n\t\t\t j:=a[n-1] ;\n\t\t\t while (j>1) and (a[j]=j) do \n\t\t\t begin \n\t\t\t if a[j-1]=j then swap(j,j+1)\n\t\t\t\t else swap(j,j-1); \n\t\t\t\t inc(ans) ;\n\t\t\t end;\n\t\t end\n\t\t else if a[i-1]=i then swap(i,i+1)\n\t\t else swap(i,i-1) ;\n\t\t inc(ans) ;\n\t end;\n\t writeln(ans) ;\nend.", "language": "Pascal", "metadata": {"date": 1504403169, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03612.html", "problem_id": "p03612", "resource_group": "low_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/Pascal/s097992788.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s097992788", "user_id": "u049262741"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "var a:array[1..100000] of longint ;\n n,i,ans,j:longint ;\nprocedure swap(n,m:longint) ;\nvar t:longint ;\nbegin \n a[n]:=t ;a[n]:=a[m];a[m]:=t ;\nend;\nbegin \n readln(n) ;\n\t for i:=1 to n do read(a[i]) ;\n\t for i:=1 to n do \n\t begin \n\t if a[i]<>i then continue ;\n\t\t if i=1 then swap(1,2) \n\t\t else if i=n then \n\t\t begin\n\t\t\t swap(n,n-1) ;\n\t\t\t j:=a[n-1] ;\n\t\t\t while (j>1) and (a[j]=j) do \n\t\t\t begin \n\t\t\t if a[j-1]=j then swap(j,j+1)\n\t\t\t\t else swap(j,j-1); \n\t\t\t\t inc(ans) ;\n\t\t\t end;\n\t\t end\n\t\t else if a[i-1]=i then swap(i,i+1)\n\t\t else swap(i,i-1) ;\n\t\t inc(ans) ;\n\t end;\n\t writeln(ans) ;\nend.", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 12, "memory_kb": 512}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s418075010", "group_id": "codeNet:p03613", "input_text": "var\n\tn,a,i,s,m:Longint;\n\tv:array[0..100000]of Longint;\nbegin\n\tread(n);\n\tfor i:=1 to n do begin\n\t\tread(a);\n\t\tinc(v[a]);\n\tend;\n\tfor i:=1 to 99999 do begin\n\t\tm:=v[i-1]+v[i]+v[i+1];\n\t\tif scc[b+1]*(1/so[b+1]) then\n begin\n swap(cc[b],cc[b+1]);\n swap2(so[b],so[b+1]);\n end;\n// for a:=1 to 4 do write(cc[a]:5);\n readln(sum);\n while sum>0 do\n begin\n for a:=1 to 4 do\n begin\n if sum=0 then\n break\n else if so[a]<=sum then\n begin\n// writeln(cc[a]);\n if so[a]<>2 then\n begin\n count:=count+cc[a]*sum;\n sum:=0;\n break;\n end\n else\n begin\n count:=count+cc[a]*(sum div 2);\n sum:=sum-(sum div 2)*2;\n end;\n end;\n end;\n end;\n writeln(count);\nend.\n", "language": "Pascal", "metadata": {"date": 1503802349, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03617.html", "problem_id": "p03617", "resource_group": "low_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/Pascal/s795187047.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s795187047", "user_id": "u704549083"}, "prompt_components": {"gold_output": "150\n", "input_to_evaluate": "var cc : array [1..4] of int64 ;\n so : array [1..4] of real ;\n a,b,c,d,e,f,g : longint ;\n sum,count,h,i,o,j,k,l : int64 ;\n\nprocedure swap(var x,y : int64) ;\nvar z : int64;\nbegin\n z:=x;\n x:=y;\n y:=z;\nend;\nprocedure swap2(var x,y : real) ;\nvar z : real;\nbegin\n z:=x;\n x:=y;\n y:=z;\nend;\n\nbegin\n for a:=1 to 4 do\n begin\n read(cc[a]);\n end;\n so[1]:=1;\n so[2]:=1;\n so[3]:=1;\n so[4]:=2;\n cc[1]:=cc[1]*4;\n cc[2]:=cc[2]*2;\n for a:=1 to 3 do\n for b:=1 to 3 do\n if cc[b]*(1/so[b])>cc[b+1]*(1/so[b+1]) then\n begin\n swap(cc[b],cc[b+1]);\n swap2(so[b],so[b+1]);\n end;\n// for a:=1 to 4 do write(cc[a]:5);\n readln(sum);\n while sum>0 do\n begin\n for a:=1 to 4 do\n begin\n if sum=0 then\n break\n else if so[a]<=sum then\n begin\n// writeln(cc[a]);\n if so[a]<>2 then\n begin\n count:=count+cc[a]*sum;\n sum:=0;\n break;\n end\n else\n begin\n count:=count+cc[a]*(sum div 2);\n sum:=sum-(sum div 2)*2;\n end;\n end;\n end;\n end;\n writeln(count);\nend.\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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1093, "cpu_time_ms": 4, "memory_kb": 128}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s744135771", "group_id": "codeNet:p03625", "input_text": "var a:array[0..100020] of longint;\nvar n,i,j,ans,x,y,num:longint;\nprocedure qsort(l,r:longint);\nvar i,j,mid,t:longint;\nbegin\n i:=l;j:=r;mid:=a[(l+r)>>1];\n repeat\n while a[i]>mid do inc(i);\n while a[j]j;\n if l0 then if x=0 then x:=a[i] else y:=a[i];\n if y>0 then break;\n end;\n writeln(x*y);\nend.", "language": "Pascal", "metadata": {"date": 1503279863, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03625.html", "problem_id": "p03625", "resource_group": "low_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/Pascal/s744135771.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s744135771", "user_id": "u379604713"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "var a:array[0..100020] of longint;\nvar n,i,j,ans,x,y,num:longint;\nprocedure qsort(l,r:longint);\nvar i,j,mid,t:longint;\nbegin\n i:=l;j:=r;mid:=a[(l+r)>>1];\n repeat\n while a[i]>mid do inc(i);\n while a[j]j;\n if l0 then if x=0 then x:=a[i] else y:=a[i];\n if y>0 then break;\n end;\n writeln(x*y);\nend.", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 643, "cpu_time_ms": 24, "memory_kb": 512}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s272980155", "group_id": "codeNet:p03625", "input_text": "var n:longint;\n i:longint;\n a,num:array[0..500000]of int64;\n max,max2,x:int64;\nprocedure qs(l,r:longint);\nvar i,j,m,t:longint;\nbegin\n i:=l;\n j:=r;\n m:=a[(l+r)>>1];\n repeat\n while a[i]>m do inc(i);\n while a[j]j;\n if l=4 then\n begin\n if x=0 then x:=a[i]*a[i];\n end else\n if num[i]>=2 then\n begin\n if max=0 then max:=a[i] else\n if (max2=0)and(a[i]<>max) then max2:=a[i];\n end;\n if x>max*max2 then writeln(x) else\n writeln(max*max2);\nend.\n\n", "language": "Pascal", "metadata": {"date": 1503278601, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03625.html", "problem_id": "p03625", "resource_group": "low_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/Pascal/s272980155.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s272980155", "user_id": "u809476955"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "var n:longint;\n i:longint;\n a,num:array[0..500000]of int64;\n max,max2,x:int64;\nprocedure qs(l,r:longint);\nvar i,j,m,t:longint;\nbegin\n i:=l;\n j:=r;\n m:=a[(l+r)>>1];\n repeat\n while a[i]>m do inc(i);\n while a[j]j;\n if l=4 then\n begin\n if x=0 then x:=a[i]*a[i];\n end else\n if num[i]>=2 then\n begin\n if max=0 then max:=a[i] else\n if (max2=0)and(a[i]<>max) then max2:=a[i];\n end;\n if x>max*max2 then writeln(x) else\n writeln(max*max2);\nend.\n\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nWe have N sticks with negligible thickness.\nThe length of the i-th stick is A_i.\n\nSnuke wants to select four different sticks from these sticks and form a rectangle (including a square), using the sticks as its sides.\nFind the maximum possible area of the rectangle.\n\nConstraints\n\n4 \\leq N \\leq 10^5\n\n1 \\leq A_i \\leq 10^9\n\nA_i is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the maximum possible area of the rectangle.\nIf no rectangle can be formed, print 0.\n\nSample Input 1\n\n6\n3 1 2 4 2 1\n\nSample Output 1\n\n2\n\n1 \\times 2 rectangle can be formed.\n\nSample Input 2\n\n4\n1 2 3 4\n\nSample Output 2\n\n0\n\nNo rectangle can be formed.\n\nSample Input 3\n\n10\n3 3 3 3 4 4 4 5 5 5\n\nSample Output 3\n\n20", "sample_input": "6\n3 1 2 4 2 1\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03625", "source_text": "Score : 300 points\n\nProblem Statement\n\nWe have N sticks with negligible thickness.\nThe length of the i-th stick is A_i.\n\nSnuke wants to select four different sticks from these sticks and form a rectangle (including a square), using the sticks as its sides.\nFind the maximum possible area of the rectangle.\n\nConstraints\n\n4 \\leq N \\leq 10^5\n\n1 \\leq A_i \\leq 10^9\n\nA_i is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the maximum possible area of the rectangle.\nIf no rectangle can be formed, print 0.\n\nSample Input 1\n\n6\n3 1 2 4 2 1\n\nSample Output 1\n\n2\n\n1 \\times 2 rectangle can be formed.\n\nSample Input 2\n\n4\n1 2 3 4\n\nSample Output 2\n\n0\n\nNo rectangle can be formed.\n\nSample Input 3\n\n10\n3 3 3 3 4 4 4 5 5 5\n\nSample Output 3\n\n20", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 826, "cpu_time_ms": 26, "memory_kb": 4992}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s034593252", "group_id": "codeNet:p03627", "input_text": "program ec12;\nvar \n\ta,b,site:array[1..100001] of int64;\n\tj:int64;\n\tn,m,i,max,tot:longint;\nprocedure qsrt(l,r:longint);\nvar \n\ts,v:int64;\n\ti,j:longint;\nbegin \n\ti:=l; j:=r; v:=a[(l+r) div 2];\n\trepeat \n\twhile a[i]v do dec(j);\n\tif i<=j then \n\tbegin \n\t\ts:=a[i];\n\t\ta[i]:=a[j];\n\t\ta[j]:=s;\n\t\tinc(i);\n\t\tdec(j);\n\tend;\n\tuntil i>=j;\n\tif l=2 then \n\t\tbegin \n\t\t\tif j=-1000 then \n\t\t\tbegin \t\n\t\t\t\tj:=b[i];\n\t\t\t\tcontinue;\n\t\t\tend\n\t\t\telse\n\t\t\tbegin \n\t\t\t\twriteln(j*b[i]);\n\t\t\t\thalt;\n\t\t\tend;\n\t\tend;\n\tend;\n\twriteln(0);\nend. ", "language": "Pascal", "metadata": {"date": 1509564822, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03627.html", "problem_id": "p03627", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03627/input.txt", "sample_output_relpath": "derived/input_output/data/p03627/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03627/Pascal/s034593252.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s034593252", "user_id": "u662099472"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "program ec12;\nvar \n\ta,b,site:array[1..100001] of int64;\n\tj:int64;\n\tn,m,i,max,tot:longint;\nprocedure qsrt(l,r:longint);\nvar \n\ts,v:int64;\n\ti,j:longint;\nbegin \n\ti:=l; j:=r; v:=a[(l+r) div 2];\n\trepeat \n\twhile a[i]v do dec(j);\n\tif i<=j then \n\tbegin \n\t\ts:=a[i];\n\t\ta[i]:=a[j];\n\t\ta[j]:=s;\n\t\tinc(i);\n\t\tdec(j);\n\tend;\n\tuntil i>=j;\n\tif l=2 then \n\t\tbegin \n\t\t\tif j=-1000 then \n\t\t\tbegin \t\n\t\t\t\tj:=b[i];\n\t\t\t\tcontinue;\n\t\t\tend\n\t\t\telse\n\t\t\tbegin \n\t\t\t\twriteln(j*b[i]);\n\t\t\t\thalt;\n\t\t\tend;\n\t\tend;\n\tend;\n\twriteln(0);\nend. ", "problem_context": "Score : 300 points\n\nProblem Statement\n\nWe have N sticks with negligible thickness.\nThe length of the i-th stick is A_i.\n\nSnuke wants to select four different sticks from these sticks and form a rectangle (including a square), using the sticks as its sides.\nFind the maximum possible area of the rectangle.\n\nConstraints\n\n4 \\leq N \\leq 10^5\n\n1 \\leq A_i \\leq 10^9\n\nA_i is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the maximum possible area of the rectangle.\nIf no rectangle can be formed, print 0.\n\nSample Input 1\n\n6\n3 1 2 4 2 1\n\nSample Output 1\n\n2\n\n1 \\times 2 rectangle can be formed.\n\nSample Input 2\n\n4\n1 2 3 4\n\nSample Output 2\n\n0\n\nNo rectangle can be formed.\n\nSample Input 3\n\n10\n3 3 3 3 4 4 4 5 5 5\n\nSample Output 3\n\n20", "sample_input": "6\n3 1 2 4 2 1\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03627", "source_text": "Score : 300 points\n\nProblem Statement\n\nWe have N sticks with negligible thickness.\nThe length of the i-th stick is A_i.\n\nSnuke wants to select four different sticks from these sticks and form a rectangle (including a square), using the sticks as its sides.\nFind the maximum possible area of the rectangle.\n\nConstraints\n\n4 \\leq N \\leq 10^5\n\n1 \\leq A_i \\leq 10^9\n\nA_i is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the maximum possible area of the rectangle.\nIf no rectangle can be formed, print 0.\n\nSample Input 1\n\n6\n3 1 2 4 2 1\n\nSample Output 1\n\n2\n\n1 \\times 2 rectangle can be formed.\n\nSample Input 2\n\n4\n1 2 3 4\n\nSample Output 2\n\n0\n\nNo rectangle can be formed.\n\nSample Input 3\n\n10\n3 3 3 3 4 4 4 5 5 5\n\nSample Output 3\n\n20", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 933, "cpu_time_ms": 25, "memory_kb": 2432}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s316821654", "group_id": "codeNet:p03627", "input_text": "program ec12;\nvar \n\ta,b,site:array[1..100001] of longint;\n\tn,m,i,j,max,tot:longint;\nprocedure qsrt(l,r:longint);\nvar \n\ti,j,v,s:longint;\nbegin \n\ti:=l; j:=r; v:=a[(l+r) div 2];\n\trepeat \n\twhile a[i]v do dec(j);\n\tif i<=j then \n\tbegin \n\t\ts:=a[i];\n\t\ta[i]:=a[j];\n\t\ta[j]:=s;\n\t\tinc(i);\n\t\tdec(j);\n\tend;\n\tuntil i>=j;\n\tif l=2 then \n\t\tbegin \n\t\t\tif j=0 then \n\t\t\tbegin \t\n\t\t\t\tj:=b[i];\n\t\t\t\tcontinue;\n\t\t\tend\n\t\t\telse\n\t\t\tbegin \n\t\t\t\twriteln(j*b[i]);\n\t\t\t\thalt;\n\t\t\tend;\n\t\tend;\n\tend;\n\twriteln(0);\nend. ", "language": "Pascal", "metadata": {"date": 1509564035, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03627.html", "problem_id": "p03627", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03627/input.txt", "sample_output_relpath": "derived/input_output/data/p03627/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03627/Pascal/s316821654.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s316821654", "user_id": "u018679195"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "program ec12;\nvar \n\ta,b,site:array[1..100001] of longint;\n\tn,m,i,j,max,tot:longint;\nprocedure qsrt(l,r:longint);\nvar \n\ti,j,v,s:longint;\nbegin \n\ti:=l; j:=r; v:=a[(l+r) div 2];\n\trepeat \n\twhile a[i]v do dec(j);\n\tif i<=j then \n\tbegin \n\t\ts:=a[i];\n\t\ta[i]:=a[j];\n\t\ta[j]:=s;\n\t\tinc(i);\n\t\tdec(j);\n\tend;\n\tuntil i>=j;\n\tif l=2 then \n\t\tbegin \n\t\t\tif j=0 then \n\t\t\tbegin \t\n\t\t\t\tj:=b[i];\n\t\t\t\tcontinue;\n\t\t\tend\n\t\t\telse\n\t\t\tbegin \n\t\t\t\twriteln(j*b[i]);\n\t\t\t\thalt;\n\t\t\tend;\n\t\tend;\n\tend;\n\twriteln(0);\nend. ", "problem_context": "Score : 300 points\n\nProblem Statement\n\nWe have N sticks with negligible thickness.\nThe length of the i-th stick is A_i.\n\nSnuke wants to select four different sticks from these sticks and form a rectangle (including a square), using the sticks as its sides.\nFind the maximum possible area of the rectangle.\n\nConstraints\n\n4 \\leq N \\leq 10^5\n\n1 \\leq A_i \\leq 10^9\n\nA_i is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the maximum possible area of the rectangle.\nIf no rectangle can be formed, print 0.\n\nSample Input 1\n\n6\n3 1 2 4 2 1\n\nSample Output 1\n\n2\n\n1 \\times 2 rectangle can be formed.\n\nSample Input 2\n\n4\n1 2 3 4\n\nSample Output 2\n\n0\n\nNo rectangle can be formed.\n\nSample Input 3\n\n10\n3 3 3 3 4 4 4 5 5 5\n\nSample Output 3\n\n20", "sample_input": "6\n3 1 2 4 2 1\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03627", "source_text": "Score : 300 points\n\nProblem Statement\n\nWe have N sticks with negligible thickness.\nThe length of the i-th stick is A_i.\n\nSnuke wants to select four different sticks from these sticks and form a rectangle (including a square), using the sticks as its sides.\nFind the maximum possible area of the rectangle.\n\nConstraints\n\n4 \\leq N \\leq 10^5\n\n1 \\leq A_i \\leq 10^9\n\nA_i is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the maximum possible area of the rectangle.\nIf no rectangle can be formed, print 0.\n\nSample Input 1\n\n6\n3 1 2 4 2 1\n\nSample Output 1\n\n2\n\n1 \\times 2 rectangle can be formed.\n\nSample Input 2\n\n4\n1 2 3 4\n\nSample Output 2\n\n0\n\nNo rectangle can be formed.\n\nSample Input 3\n\n10\n3 3 3 3 4 4 4 5 5 5\n\nSample Output 3\n\n20", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 851, "cpu_time_ms": 25, "memory_kb": 1280}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s553297321", "group_id": "codeNet:p03627", "input_text": "program V1002;\n var\n a:array[0..100001] of longint;\n i,n:longint;\n s,s1:int64;\n procedure haha(l,r:longint);\n var\n o,p,m,t:longint;\n begin\n o:=l;\n p:=r;\n m:=a[(l+r) div 2];\n repeat\n while a[o]m do dec(p);\n if o<=p then\n begin\n t:=a[o];\n a[o]:=a[p];\n a[p]:=t;\n inc(o);\n dec(p);\n end;\n until o>p;\n if o=2 do\n if a[i]=a[i-1] then\n begin\n if s=0 then s:=a[i]\n else if s1=0 then s1:=a[i];\n dec(i,2);\n end\n else dec(i,1);\n writeln(s*s1);\n end.\n", "language": "Pascal", "metadata": {"date": 1509563752, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03627.html", "problem_id": "p03627", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03627/input.txt", "sample_output_relpath": "derived/input_output/data/p03627/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03627/Pascal/s553297321.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s553297321", "user_id": "u018679195"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "program V1002;\n var\n a:array[0..100001] of longint;\n i,n:longint;\n s,s1:int64;\n procedure haha(l,r:longint);\n var\n o,p,m,t:longint;\n begin\n o:=l;\n p:=r;\n m:=a[(l+r) div 2];\n repeat\n while a[o]m do dec(p);\n if o<=p then\n begin\n t:=a[o];\n a[o]:=a[p];\n a[p]:=t;\n inc(o);\n dec(p);\n end;\n until o>p;\n if o=2 do\n if a[i]=a[i-1] then\n begin\n if s=0 then s:=a[i]\n else if s1=0 then s1:=a[i];\n dec(i,2);\n end\n else dec(i,1);\n writeln(s*s1);\n end.\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nWe have N sticks with negligible thickness.\nThe length of the i-th stick is A_i.\n\nSnuke wants to select four different sticks from these sticks and form a rectangle (including a square), using the sticks as its sides.\nFind the maximum possible area of the rectangle.\n\nConstraints\n\n4 \\leq N \\leq 10^5\n\n1 \\leq A_i \\leq 10^9\n\nA_i is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the maximum possible area of the rectangle.\nIf no rectangle can be formed, print 0.\n\nSample Input 1\n\n6\n3 1 2 4 2 1\n\nSample Output 1\n\n2\n\n1 \\times 2 rectangle can be formed.\n\nSample Input 2\n\n4\n1 2 3 4\n\nSample Output 2\n\n0\n\nNo rectangle can be formed.\n\nSample Input 3\n\n10\n3 3 3 3 4 4 4 5 5 5\n\nSample Output 3\n\n20", "sample_input": "6\n3 1 2 4 2 1\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03627", "source_text": "Score : 300 points\n\nProblem Statement\n\nWe have N sticks with negligible thickness.\nThe length of the i-th stick is A_i.\n\nSnuke wants to select four different sticks from these sticks and form a rectangle (including a square), using the sticks as its sides.\nFind the maximum possible area of the rectangle.\n\nConstraints\n\n4 \\leq N \\leq 10^5\n\n1 \\leq A_i \\leq 10^9\n\nA_i is an integer.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\nA_1 A_2 ... A_N\n\nOutput\n\nPrint the maximum possible area of the rectangle.\nIf no rectangle can be formed, print 0.\n\nSample Input 1\n\n6\n3 1 2 4 2 1\n\nSample Output 1\n\n2\n\n1 \\times 2 rectangle can be formed.\n\nSample Input 2\n\n4\n1 2 3 4\n\nSample Output 2\n\n0\n\nNo rectangle can be formed.\n\nSample Input 3\n\n10\n3 3 3 3 4 4 4 5 5 5\n\nSample Output 3\n\n20", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 24, "memory_kb": 512}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s007401766", "group_id": "codeNet:p03630", "input_text": "{$goto+}\nuses math;\nlabel 1,2,3,4,5,6,7,8,9,a;\nvar go:array[0..2000,0..2000]of boolean;\n mp:array[0..2000,0..2000]of 0..1;\n de:array[0..2000,0..2000]of longint;\n l,r,s:array[0..2000]of longint;\n top,h,w,ans,i,j,cnt:longint;\n t:char;\nbegin\n readln(h,w);\n i:=1;4:\n j:=1;6:\n read(t);\n if t='#' then goto 1;\n mp[i,j]:=0;\n goto 2;\n 1:mp[i,j]:=1;\n 2:j:=-not j;\n if j>w then goto 5;\n goto 6;\n 5:readln;\n i:=-not i;\n if i>h then goto 3;\n goto 4;\n 3:i:=1;\n 7:j:=1;\n 9:go[i,j]:=(mp[i,j]+mp[-not i,j]+mp[i,-not j]+mp[-not i,-not j]) and 1=0;\n if j>w-1 then\n goto a;\n j:=-not j;\n goto 9;\n a:if i>h-1 then goto 8;\n i:=-not i;\n goto 7;\n 8:\n for i:=1 to h do\n for j:=1 to w do\n if not go[i,j] then\n de[i,j]:=0\n else\n de[i,j]:=de[i-1,j]+1;\n for i:=1 to h do\n begin\n top:=1;\n s[1]:=0;\n for j:=1 to w-1 do\n begin\n while (top<>0) and (de[i-1,s[top]]>=de[i-1,j]) do\n dec(top);\n l[j]:=s[top];\n inc(top);\n s[top]:=j;\n end;\n top:=1;\n s[top]:=w;\n for j:=w-1 downto 1 do\n begin\n while (top<>0) and (de[i-1,s[top]]>=de[i-1,j]) do\n dec(top);\n r[j]:=s[top];\n inc(top);\n s[top]:=j;\n end;\n for j:=1 to w-1 do\n ans:=max(ans,(de[i-1,j]+1)*(r[j]-l[j]));\n end;\n writeln(max(ans,max(h,w)));\nend.", "language": "Pascal", "metadata": {"date": 1581820132, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03630.html", "problem_id": "p03630", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03630/input.txt", "sample_output_relpath": "derived/input_output/data/p03630/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03630/Pascal/s007401766.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s007401766", "user_id": "u743614777"}, "prompt_components": {"gold_output": "6\n", "input_to_evaluate": "{$goto+}\nuses math;\nlabel 1,2,3,4,5,6,7,8,9,a;\nvar go:array[0..2000,0..2000]of boolean;\n mp:array[0..2000,0..2000]of 0..1;\n de:array[0..2000,0..2000]of longint;\n l,r,s:array[0..2000]of longint;\n top,h,w,ans,i,j,cnt:longint;\n t:char;\nbegin\n readln(h,w);\n i:=1;4:\n j:=1;6:\n read(t);\n if t='#' then goto 1;\n mp[i,j]:=0;\n goto 2;\n 1:mp[i,j]:=1;\n 2:j:=-not j;\n if j>w then goto 5;\n goto 6;\n 5:readln;\n i:=-not i;\n if i>h then goto 3;\n goto 4;\n 3:i:=1;\n 7:j:=1;\n 9:go[i,j]:=(mp[i,j]+mp[-not i,j]+mp[i,-not j]+mp[-not i,-not j]) and 1=0;\n if j>w-1 then\n goto a;\n j:=-not j;\n goto 9;\n a:if i>h-1 then goto 8;\n i:=-not i;\n goto 7;\n 8:\n for i:=1 to h do\n for j:=1 to w do\n if not go[i,j] then\n de[i,j]:=0\n else\n de[i,j]:=de[i-1,j]+1;\n for i:=1 to h do\n begin\n top:=1;\n s[1]:=0;\n for j:=1 to w-1 do\n begin\n while (top<>0) and (de[i-1,s[top]]>=de[i-1,j]) do\n dec(top);\n l[j]:=s[top];\n inc(top);\n s[top]:=j;\n end;\n top:=1;\n s[top]:=w;\n for j:=w-1 downto 1 do\n begin\n while (top<>0) and (de[i-1,s[top]]>=de[i-1,j]) do\n dec(top);\n r[j]:=s[top];\n inc(top);\n s[top]:=j;\n end;\n for j:=1 to w-1 do\n ans:=max(ans,(de[i-1,j]+1)*(r[j]-l[j]));\n end;\n writeln(max(ans,max(h,w)));\nend.", "problem_context": "Score : 700 points\n\nProblem Statement\n\nWe have a board with an H \\times W grid.\nEach square in the grid is painted in black or white. The square at the i-th row from the top and j-th column from the left is black if the j-th character in S_i is #, and white if that character is ..\n\nSnuke can perform the following operation on the grid any number of times:\n\nSelect a row or column in the grid, and invert the color of all the squares in that row or column (that is, black squares become white and vice versa).\n\nThen, Snuke draws a rectangle along grid lines. Here, all the squares contained in the rectangle must be painted in black.\n\nFind the maximum possible area of Snuke's rectangle when the operation is performed optimally.\n\nConstraints\n\n2 \\leq H \\leq 2000\n\n2 \\leq W \\leq 2000\n\n|S_i| = W\n\nS_i consists of # and ..\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W\nS_1\nS_2\n:\nS_H\n\nOutput\n\nPrint the maximum possible area of Snuke's rectangle.\n\nSample Input 1\n\n3 3\n..#\n##.\n.#.\n\nSample Output 1\n\n6\n\nIf the first row from the top and the third column from the left are inverted, a 2 \\times 3 rectangle can be drawn, as shown below:\n\nSample Input 2\n\n4 4\n....\n....\n....\n....\n\nSample Output 2\n\n16\n\nSample Input 3\n\n10 8\n##...#.#\n##...#.#\n..###.#.\n#.##.#.#\n.#..#.#.\n..##.#.#\n##.#.#..\n...#.#..\n###.#.##\n###..###\n\nSample Output 3\n\n27", "sample_input": "3 3\n..#\n##.\n.#.\n"}, "reference_outputs": ["6\n"], "source_document_id": "p03630", "source_text": "Score : 700 points\n\nProblem Statement\n\nWe have a board with an H \\times W grid.\nEach square in the grid is painted in black or white. The square at the i-th row from the top and j-th column from the left is black if the j-th character in S_i is #, and white if that character is ..\n\nSnuke can perform the following operation on the grid any number of times:\n\nSelect a row or column in the grid, and invert the color of all the squares in that row or column (that is, black squares become white and vice versa).\n\nThen, Snuke draws a rectangle along grid lines. Here, all the squares contained in the rectangle must be painted in black.\n\nFind the maximum possible area of Snuke's rectangle when the operation is performed optimally.\n\nConstraints\n\n2 \\leq H \\leq 2000\n\n2 \\leq W \\leq 2000\n\n|S_i| = W\n\nS_i consists of # and ..\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W\nS_1\nS_2\n:\nS_H\n\nOutput\n\nPrint the maximum possible area of Snuke's rectangle.\n\nSample Input 1\n\n3 3\n..#\n##.\n.#.\n\nSample Output 1\n\n6\n\nIf the first row from the top and the third column from the left are inverted, a 2 \\times 3 rectangle can be drawn, as shown below:\n\nSample Input 2\n\n4 4\n....\n....\n....\n....\n\nSample Output 2\n\n16\n\nSample Input 3\n\n10 8\n##...#.#\n##...#.#\n..###.#.\n#.##.#.#\n.#..#.#.\n..##.#.#\n##.#.#..\n...#.#..\n###.#.##\n###..###\n\nSample Output 3\n\n27", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1327, "cpu_time_ms": 276, "memory_kb": 23680}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s030334499", "group_id": "codeNet:p03631", "input_text": "program Project1;\n\n{$APPTYPE CONSOLE}\n\nuses\n SysUtils,Classes;\nvar\n a,h,w,i,j,count,x,y,sw,m,n,b,c,soeji,sum,max,k,min:Integer;\n //l:array[0..6] of Integer = (1,2,4,8,16,32,64);\n s,s123,s1,s2,s3:string;\n tf:Boolean;\n nyu:TStringList;\nbegin\n try\n { TODO -oUser -cConsole Main : ここにコードを記述してください }\n Readln(n);\n\n if (n mod 10)=(n div 100) then\n Writeln('Yes')\n else\n Writeln('No');\n Readln;\n except\n on E: Exception do\n Writeln(E.ClassName, ': ', E.Message);\n end;\nend.", "language": "Pascal", "metadata": {"date": 1517001804, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03631.html", "problem_id": "p03631", "resource_group": "low_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/Pascal/s030334499.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s030334499", "user_id": "u755925739"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "program Project1;\n\n{$APPTYPE CONSOLE}\n\nuses\n SysUtils,Classes;\nvar\n a,h,w,i,j,count,x,y,sw,m,n,b,c,soeji,sum,max,k,min:Integer;\n //l:array[0..6] of Integer = (1,2,4,8,16,32,64);\n s,s123,s1,s2,s3:string;\n tf:Boolean;\n nyu:TStringList;\nbegin\n try\n { TODO -oUser -cConsole Main : ここにコードを記述してください }\n Readln(n);\n\n if (n mod 10)=(n div 100) then\n Writeln('Yes')\n else\n Writeln('No');\n Readln;\n except\n on E: Exception do\n Writeln(E.ClassName, ': ', E.Message);\n end;\nend.", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 537, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s423715928", "group_id": "codeNet:p03635", "input_text": "program Project1;\n\n{$APPTYPE CONSOLE}\n\nuses\n SysUtils,Classes;\nvar\n a,h,w,i,j,count,x,y,sw,m,n,b,c,soeji,sum,max,k,min:Integer;\n //l:array[0..6] of Integer = (1,2,4,8,16,32,64);\n s,s123,s1,s2,s3:string;\n tf:Boolean;\n nyu:TStringList;\nbegin\n try\n { TODO -oUser -cConsole Main : ここにコードを記述してください }\n Read(n);\n Readln(m);\n\n Writeln((n-1)*(m-1));\n Readln;\n except\n on E: Exception do\n Writeln(E.ClassName, ': ', E.Message);\n end;\nend.", "language": "Pascal", "metadata": {"date": 1516995729, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03635.html", "problem_id": "p03635", "resource_group": "low_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/Pascal/s423715928.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s423715928", "user_id": "u755925739"}, "prompt_components": {"gold_output": "6\n", "input_to_evaluate": "program Project1;\n\n{$APPTYPE CONSOLE}\n\nuses\n SysUtils,Classes;\nvar\n a,h,w,i,j,count,x,y,sw,m,n,b,c,soeji,sum,max,k,min:Integer;\n //l:array[0..6] of Integer = (1,2,4,8,16,32,64);\n s,s123,s1,s2,s3:string;\n tf:Boolean;\n nyu:TStringList;\nbegin\n try\n { TODO -oUser -cConsole Main : ここにコードを記述してください }\n Read(n);\n Readln(m);\n\n Writeln((n-1)*(m-1));\n Readln;\n except\n on E: Exception do\n Writeln(E.ClassName, ': ', E.Message);\n end;\nend.", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s356089005", "group_id": "codeNet:p03640", "input_text": "var\n\ti,j,h,w,n,a,c,t:Longint;\n\tu:array[1..100]of Longint;\nbegin\n\tt:=1;\n\tread(h,w,n,a);\n\tfor i:=1 to h do begin\n\t\tif i mod 2=1 then begin\n\t\t\tfor j:=1 to w do begin\n\t\t\t\twriteln(t);\n\t\t\t\tinc(c);\n\t\t\t\tif a=c then begin\n\t\t\t\t\tread(a);\n\t\t\t\t\tc:=0;\n\t\t\t\t\tinc(t);\n\t\t\t\tend;\n\t\t\tend;\n\t\tend else begin\n\t\t\tfor j:=w downto 1 do begin\n\t\t\t\tu[j]:=t;\n\t\t\t\tinc(c);\n\t\t\t\tif a=c then begin\n\t\t\t\t\tread(a);\n\t\t\t\t\tc:=0;\n\t\t\t\t\tinc(t);\n\t\t\t\tend;\n\t\t\tend;\n\t\t\tfor j:=1 to w do writeln(u[j]);\n\t\tend;\n\tend;\nend.\n", "language": "Pascal", "metadata": {"date": 1539741444, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03640.html", "problem_id": "p03640", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03640/input.txt", "sample_output_relpath": "derived/input_output/data/p03640/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03640/Pascal/s356089005.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s356089005", "user_id": "u657913472"}, "prompt_components": {"gold_output": "1 1\n2 3\n", "input_to_evaluate": "var\n\ti,j,h,w,n,a,c,t:Longint;\n\tu:array[1..100]of Longint;\nbegin\n\tt:=1;\n\tread(h,w,n,a);\n\tfor i:=1 to h do begin\n\t\tif i mod 2=1 then begin\n\t\t\tfor j:=1 to w do begin\n\t\t\t\twriteln(t);\n\t\t\t\tinc(c);\n\t\t\t\tif a=c then begin\n\t\t\t\t\tread(a);\n\t\t\t\t\tc:=0;\n\t\t\t\t\tinc(t);\n\t\t\t\tend;\n\t\t\tend;\n\t\tend else begin\n\t\t\tfor j:=w downto 1 do begin\n\t\t\t\tu[j]:=t;\n\t\t\t\tinc(c);\n\t\t\t\tif a=c then begin\n\t\t\t\t\tread(a);\n\t\t\t\t\tc:=0;\n\t\t\t\t\tinc(t);\n\t\t\t\tend;\n\t\t\tend;\n\t\t\tfor j:=1 to w do writeln(u[j]);\n\t\tend;\n\tend;\nend.\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nWe have a grid with H rows and W columns of squares.\nSnuke is painting these squares in colors 1, 2, ..., N.\nHere, the following conditions should be satisfied:\n\nFor each i (1 ≤ i ≤ N), there are exactly a_i squares painted in Color i. Here, a_1 + a_2 + ... + a_N = H W.\n\nFor each i (1 ≤ i ≤ N), the squares painted in Color i are 4-connected. That is, every square painted in Color i can be reached from every square painted in Color i by repeatedly traveling to a horizontally or vertically adjacent square painted in Color i.\n\nFind a way to paint the squares so that the conditions are satisfied.\nIt can be shown that a solution always exists.\n\nConstraints\n\n1 ≤ H, W ≤ 100\n\n1 ≤ N ≤ H W\n\na_i ≥ 1\n\na_1 + a_2 + ... + a_N = H W\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W\nN\na_1 a_2 ... a_N\n\nOutput\n\nPrint one way to paint the squares that satisfies the conditions.\nOutput in the following format:\n\nc_{1 1} ... c_{1 W}\n:\nc_{H 1} ... c_{H W}\n\nHere, c_{i j} is the color of the square at the i-th row from the top and j-th column from the left.\n\nSample Input 1\n\n2 2\n3\n2 1 1\n\nSample Output 1\n\n1 1\n2 3\n\nBelow is an example of an invalid solution:\n\n1 2\n3 1\n\nThis is because the squares painted in Color 1 are not 4-connected.\n\nSample Input 2\n\n3 5\n5\n1 2 3 4 5\n\nSample Output 2\n\n1 4 4 4 3\n2 5 4 5 3\n2 5 5 5 3\n\nSample Input 3\n\n1 1\n1\n1\n\nSample Output 3\n\n1", "sample_input": "2 2\n3\n2 1 1\n"}, "reference_outputs": ["1 1\n2 3\n"], "source_document_id": "p03640", "source_text": "Score : 400 points\n\nProblem Statement\n\nWe have a grid with H rows and W columns of squares.\nSnuke is painting these squares in colors 1, 2, ..., N.\nHere, the following conditions should be satisfied:\n\nFor each i (1 ≤ i ≤ N), there are exactly a_i squares painted in Color i. Here, a_1 + a_2 + ... + a_N = H W.\n\nFor each i (1 ≤ i ≤ N), the squares painted in Color i are 4-connected. That is, every square painted in Color i can be reached from every square painted in Color i by repeatedly traveling to a horizontally or vertically adjacent square painted in Color i.\n\nFind a way to paint the squares so that the conditions are satisfied.\nIt can be shown that a solution always exists.\n\nConstraints\n\n1 ≤ H, W ≤ 100\n\n1 ≤ N ≤ H W\n\na_i ≥ 1\n\na_1 + a_2 + ... + a_N = H W\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W\nN\na_1 a_2 ... a_N\n\nOutput\n\nPrint one way to paint the squares that satisfies the conditions.\nOutput in the following format:\n\nc_{1 1} ... c_{1 W}\n:\nc_{H 1} ... c_{H W}\n\nHere, c_{i j} is the color of the square at the i-th row from the top and j-th column from the left.\n\nSample Input 1\n\n2 2\n3\n2 1 1\n\nSample Output 1\n\n1 1\n2 3\n\nBelow is an example of an invalid solution:\n\n1 2\n3 1\n\nThis is because the squares painted in Color 1 are not 4-connected.\n\nSample Input 2\n\n3 5\n5\n1 2 3 4 5\n\nSample Output 2\n\n1 4 4 4 3\n2 5 4 5 3\n2 5 5 5 3\n\nSample Input 3\n\n1 1\n1\n1\n\nSample Output 3\n\n1", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s329623405", "group_id": "codeNet:p03643", "input_text": "program Project1;\n\n{$APPTYPE CONSOLE}\n\nuses\n SysUtils,Classes;\nvar\n a,h,w,i,j,count,x,y,sw,m,n,b,c,soeji,sum,max,k,min:Integer;\n l:array of Integer;\n s,s123,s1,s2,s3:string;\n tf:Boolean;\n nyu:TStringList;\nbegin\n try\n { TODO -oUser -cConsole Main : ここにコードを記述してください }\n Readln(n);\n Write('ABC');\n Writeln(n);\n Readln;\n except\n on E: Exception do\n Writeln(E.ClassName, ': ', E.Message);\n end;\nend.", "language": "Pascal", "metadata": {"date": 1516979590, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03643.html", "problem_id": "p03643", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03643/input.txt", "sample_output_relpath": "derived/input_output/data/p03643/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03643/Pascal/s329623405.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s329623405", "user_id": "u755925739"}, "prompt_components": {"gold_output": "ABC100\n", "input_to_evaluate": "program Project1;\n\n{$APPTYPE CONSOLE}\n\nuses\n SysUtils,Classes;\nvar\n a,h,w,i,j,count,x,y,sw,m,n,b,c,soeji,sum,max,k,min:Integer;\n l:array of Integer;\n s,s123,s1,s2,s3:string;\n tf:Boolean;\n nyu:TStringList;\nbegin\n try\n { TODO -oUser -cConsole Main : ここにコードを記述してください }\n Readln(n);\n Write('ABC');\n Writeln(n);\n Readln;\n except\n on E: Exception do\n Writeln(E.ClassName, ': ', E.Message);\n end;\nend.", "problem_context": "Score : 100 points\n\nProblem Statement\n\nThis contest, AtCoder Beginner Contest, is abbreviated as ABC.\n\nWhen we refer to a specific round of ABC, a three-digit number is appended after ABC. For example, ABC680 is the 680th round of ABC.\n\nWhat is the abbreviation for the N-th round of ABC? Write a program to output the answer.\n\nConstraints\n\n100 ≤ N ≤ 999\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the abbreviation for the N-th round of ABC.\n\nSample Input 1\n\n100\n\nSample Output 1\n\nABC100\n\nThe 100th round of ABC is ABC100.\n\nSample Input 2\n\n425\n\nSample Output 2\n\nABC425\n\nSample Input 3\n\n999\n\nSample Output 3\n\nABC999", "sample_input": "100\n"}, "reference_outputs": ["ABC100\n"], "source_document_id": "p03643", "source_text": "Score : 100 points\n\nProblem Statement\n\nThis contest, AtCoder Beginner Contest, is abbreviated as ABC.\n\nWhen we refer to a specific round of ABC, a three-digit number is appended after ABC. For example, ABC680 is the 680th round of ABC.\n\nWhat is the abbreviation for the N-th round of ABC? Write a program to output the answer.\n\nConstraints\n\n100 ≤ N ≤ 999\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the abbreviation for the N-th round of ABC.\n\nSample Input 1\n\n100\n\nSample Output 1\n\nABC100\n\nThe 100th round of ABC is ABC100.\n\nSample Input 2\n\n425\n\nSample Output 2\n\nABC425\n\nSample Input 3\n\n999\n\nSample Output 3\n\nABC999", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 1, "memory_kb": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s829556063", "group_id": "codeNet:p03644", "input_text": "var \n n,s:longint;\nbegin\n readln(n);\n s:=1;\n while s*2<=n do\n s:=s*2;\n writeln(s);\nend.", "language": "Pascal", "metadata": {"date": 1534892002, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03644.html", "problem_id": "p03644", "resource_group": "low_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/Pascal/s829556063.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s829556063", "user_id": "u247366051"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "var \n n,s:longint;\nbegin\n readln(n);\n s:=1;\n while s*2<=n do\n s:=s*2;\n writeln(s);\nend.", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 88, "cpu_time_ms": 2, "memory_kb": 128}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s250471756", "group_id": "codeNet:p03645", "input_text": "program ec12;\nvar \n\thead,last,next,side:array[1..400002] of longint;\n\tn,m,i,j,p,q,tot,x,y:longint;\nprocedure add(x,y:longint);\nbegin \n\tinc(tot);\n\tif head[x]=-1 then \n\tbegin \n\t\tlast[x]:=tot;\n\t\tnext[tot]:=-1;\n\t\tside[tot]:=y;\n\t\thead[x]:=tot;\n\tend\n\telse\n\tbegin \n\t\tnext[last[x]]:=tot;\n\t\tnext[tot]:=-1;\n\t\tside[tot]:=y;\n\t\tlast[x]:=tot;\n\tend;\nend;\nbegin\n\treadln(n,m);\n\tfor i:=1 to n do \n\thead[i]:=-1;\n\ttot:=0;\n\tfor i:=1 to m do \n\tbegin \n\t\treadln(x,y);\n\t\tadd(x,y);\n\tend;\n\tp:=head[1];\n\twhile p>0 do \n\tbegin \n\t\tq:=head[side[p]];\n\t\twhile q>0 do \n\t\tbegin \n\t\t\tif side[q]=n then \n\t\t\tbegin \n\t\t\t\twriteln('POSSIBLE');\n\t\t\t\thalt;\n\t\t\tend;\n\t\t\tq:=next[q];\n\t\tend;\n\t\tp:=next[p];\n\tend;\n\twriteln('IMPOSSIBLE');\nend. ", "language": "Pascal", "metadata": {"date": 1509563189, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03645.html", "problem_id": "p03645", "resource_group": "low_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/Pascal/s250471756.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s250471756", "user_id": "u816631826"}, "prompt_components": {"gold_output": "POSSIBLE\n", "input_to_evaluate": "program ec12;\nvar \n\thead,last,next,side:array[1..400002] of longint;\n\tn,m,i,j,p,q,tot,x,y:longint;\nprocedure add(x,y:longint);\nbegin \n\tinc(tot);\n\tif head[x]=-1 then \n\tbegin \n\t\tlast[x]:=tot;\n\t\tnext[tot]:=-1;\n\t\tside[tot]:=y;\n\t\thead[x]:=tot;\n\tend\n\telse\n\tbegin \n\t\tnext[last[x]]:=tot;\n\t\tnext[tot]:=-1;\n\t\tside[tot]:=y;\n\t\tlast[x]:=tot;\n\tend;\nend;\nbegin\n\treadln(n,m);\n\tfor i:=1 to n do \n\thead[i]:=-1;\n\ttot:=0;\n\tfor i:=1 to m do \n\tbegin \n\t\treadln(x,y);\n\t\tadd(x,y);\n\tend;\n\tp:=head[1];\n\twhile p>0 do \n\tbegin \n\t\tq:=head[side[p]];\n\t\twhile q>0 do \n\t\tbegin \n\t\t\tif side[q]=n then \n\t\t\tbegin \n\t\t\t\twriteln('POSSIBLE');\n\t\t\t\thalt;\n\t\t\tend;\n\t\t\tq:=next[q];\n\t\tend;\n\t\tp:=next[p];\n\tend;\n\twriteln('IMPOSSIBLE');\nend. ", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 689, "cpu_time_ms": 51, "memory_kb": 5248}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s463488025", "group_id": "codeNet:p03645", "input_text": "type mang=array[0..1000005] of longint;\nvar h,a,x,y:mang;\n n,m,dem:longint;\n kt:boolean;\nprocedure nhap;\nvar i:longint;\nbegin\n read(n,m);\n for i:=1 to m do\n begin\n read(x[i],y[i]);\n inc(h[x[i]]);\n end;\n\n for i:=1 to n do\n h[i]:=h[i-1]+h[i];\n\n for i:=1 to m do\n begin\n a[h[x[i]]]:=y[i];\n dec(h[x[i]]);\n end;\n h[n+1]:=m;\n\nend;\n\nprocedure DFS(i:Longint);\nvar j:longint;\nbegin\n if kt=true then exit;\n for j:=h[i]+1 to h[i+1] do\n begin\n dem:=dem+1;\n if (a[j]=n ) and (dem=2) then\n begin\n kt:=true;\n exit;\n end;\n if dem<2 then DFS(a[j]);\n dem:=dem-1;\n end;\nend;\n\nprocedure xuly;\nbegin\n kt:=false;\n dem:=0;\n DFS(1);\nend;\n\nprocedure xuat;\nbegin\n if kt=true then write('POSSIBLE')\n else write('IMPOSSIBLE');\nend;\n\nbegin\n\n nhap;\n xuly;\n xuat;\n\nend.\n", "language": "Pascal", "metadata": {"date": 1501379778, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03645.html", "problem_id": "p03645", "resource_group": "low_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/Pascal/s463488025.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s463488025", "user_id": "u194998823"}, "prompt_components": {"gold_output": "POSSIBLE\n", "input_to_evaluate": "type mang=array[0..1000005] of longint;\nvar h,a,x,y:mang;\n n,m,dem:longint;\n kt:boolean;\nprocedure nhap;\nvar i:longint;\nbegin\n read(n,m);\n for i:=1 to m do\n begin\n read(x[i],y[i]);\n inc(h[x[i]]);\n end;\n\n for i:=1 to n do\n h[i]:=h[i-1]+h[i];\n\n for i:=1 to m do\n begin\n a[h[x[i]]]:=y[i];\n dec(h[x[i]]);\n end;\n h[n+1]:=m;\n\nend;\n\nprocedure DFS(i:Longint);\nvar j:longint;\nbegin\n if kt=true then exit;\n for j:=h[i]+1 to h[i+1] do\n begin\n dem:=dem+1;\n if (a[j]=n ) and (dem=2) then\n begin\n kt:=true;\n exit;\n end;\n if dem<2 then DFS(a[j]);\n dem:=dem-1;\n end;\nend;\n\nprocedure xuly;\nbegin\n kt:=false;\n dem:=0;\n DFS(1);\nend;\n\nprocedure xuat;\nbegin\n if kt=true then write('POSSIBLE')\n else write('IMPOSSIBLE');\nend;\n\nbegin\n\n nhap;\n xuly;\n xuat;\n\nend.\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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 909, "cpu_time_ms": 52, "memory_kb": 13184}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s428470812", "group_id": "codeNet:p03645", "input_text": "var x , y , i , n , m : longint;\n\ta , b : array[1..200000] of boolean;\n\tok : boolean;\n\nbegin\n\treadln(n , m);\n\tfor i := 1 to m do begin\n\t\treadln(x , y);\n\t\tif x = 1 then a[y] := true;\n\t\tif y = n then b[x] := true;\n\tend;\n\tok := false;\n\tfor i := 2 to n - 1 do\n\t\tok := ok or (a[i] and b[i]);\n\tif ok then writeln('POSSIBLE') else writeln('IMPOSSIBLE');\t\nend.", "language": "Pascal", "metadata": {"date": 1501378997, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03645.html", "problem_id": "p03645", "resource_group": "low_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/Pascal/s428470812.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s428470812", "user_id": "u371131907"}, "prompt_components": {"gold_output": "POSSIBLE\n", "input_to_evaluate": "var x , y , i , n , m : longint;\n\ta , b : array[1..200000] of boolean;\n\tok : boolean;\n\nbegin\n\treadln(n , m);\n\tfor i := 1 to m do begin\n\t\treadln(x , y);\n\t\tif x = 1 then a[y] := true;\n\t\tif y = n then b[x] := true;\n\tend;\n\tok := false;\n\tfor i := 2 to n - 1 do\n\t\tok := ok or (a[i] and b[i]);\n\tif ok then writeln('POSSIBLE') else writeln('IMPOSSIBLE');\t\nend.", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 45, "memory_kb": 512}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s286646590", "group_id": "codeNet:p03651", "input_text": "var N,K,i,G,A,M:Longint;\nfunction gcd(a,b:Longint):Longint;\nbegin\nif b=0 then gcd:=a else gcd:=gcd(b,a mod b);\nend;\nbegin\nread(N,K);\nfor i:=1 to N do begin\nread(A);\nG:=gcd(A,G);\nif M=K)and(K mod G=0)then writeln('POSSIBLE')else writeln('IMPOSSIBLE');\nend.", "language": "Pascal", "metadata": {"date": 1579668733, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03651.html", "problem_id": "p03651", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03651/input.txt", "sample_output_relpath": "derived/input_output/data/p03651/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03651/Pascal/s286646590.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s286646590", "user_id": "u657913472"}, "prompt_components": {"gold_output": "POSSIBLE\n", "input_to_evaluate": "var N,K,i,G,A,M:Longint;\nfunction gcd(a,b:Longint):Longint;\nbegin\nif b=0 then gcd:=a else gcd:=gcd(b,a mod b);\nend;\nbegin\nread(N,K);\nfor i:=1 to N do begin\nread(A);\nG:=gcd(A,G);\nif M=K)and(K mod G=0)then writeln('POSSIBLE')else writeln('IMPOSSIBLE');\nend.", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThere is a box containing N balls. The i-th ball has the integer A_i written on it.\nSnuke can perform the following operation any number of times:\n\nTake out two balls from the box. Then, return them to the box along with a new ball, on which the absolute difference of the integers written on the two balls is written.\n\nDetermine whether it is possible for Snuke to reach the state where the box contains a ball on which the integer K is written.\n\nConstraints\n\n1 \\leq N \\leq 10^5\n\n1 \\leq A_i \\leq 10^9\n\n1 \\leq K \\leq 10^9\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\nIf it is possible for Snuke to reach the state where the box contains a ball on which the integer K is written, print POSSIBLE; if it is not possible, print IMPOSSIBLE.\n\nSample Input 1\n\n3 7\n9 3 4\n\nSample Output 1\n\nPOSSIBLE\n\nFirst, take out the two balls 9 and 4, and return them back along with a new ball, abs(9-4)=5.\nNext, take out 3 and 5, and return them back along with abs(3-5)=2.\nFinally, take out 9 and 2, and return them back along with abs(9-2)=7.\nNow we have 7 in the box, and the answer is therefore POSSIBLE.\n\nSample Input 2\n\n3 5\n6 9 3\n\nSample Output 2\n\nIMPOSSIBLE\n\nNo matter what we do, it is not possible to have 5 in the box. The answer is therefore IMPOSSIBLE.\n\nSample Input 3\n\n4 11\n11 3 7 15\n\nSample Output 3\n\nPOSSIBLE\n\nThe box already contains 11 before we do anything. The answer is therefore POSSIBLE.\n\nSample Input 4\n\n5 12\n10 2 8 6 4\n\nSample Output 4\n\nIMPOSSIBLE", "sample_input": "3 7\n9 3 4\n"}, "reference_outputs": ["POSSIBLE\n"], "source_document_id": "p03651", "source_text": "Score : 300 points\n\nProblem Statement\n\nThere is a box containing N balls. The i-th ball has the integer A_i written on it.\nSnuke can perform the following operation any number of times:\n\nTake out two balls from the box. Then, return them to the box along with a new ball, on which the absolute difference of the integers written on the two balls is written.\n\nDetermine whether it is possible for Snuke to reach the state where the box contains a ball on which the integer K is written.\n\nConstraints\n\n1 \\leq N \\leq 10^5\n\n1 \\leq A_i \\leq 10^9\n\n1 \\leq K \\leq 10^9\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\nIf it is possible for Snuke to reach the state where the box contains a ball on which the integer K is written, print POSSIBLE; if it is not possible, print IMPOSSIBLE.\n\nSample Input 1\n\n3 7\n9 3 4\n\nSample Output 1\n\nPOSSIBLE\n\nFirst, take out the two balls 9 and 4, and return them back along with a new ball, abs(9-4)=5.\nNext, take out 3 and 5, and return them back along with abs(3-5)=2.\nFinally, take out 9 and 2, and return them back along with abs(9-2)=7.\nNow we have 7 in the box, and the answer is therefore POSSIBLE.\n\nSample Input 2\n\n3 5\n6 9 3\n\nSample Output 2\n\nIMPOSSIBLE\n\nNo matter what we do, it is not possible to have 5 in the box. The answer is therefore IMPOSSIBLE.\n\nSample Input 3\n\n4 11\n11 3 7 15\n\nSample Output 3\n\nPOSSIBLE\n\nThe box already contains 11 before we do anything. The answer is therefore POSSIBLE.\n\nSample Input 4\n\n5 12\n10 2 8 6 4\n\nSample Output 4\n\nIMPOSSIBLE", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 16, "memory_kb": 128}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s159827277", "group_id": "codeNet:p03652", "input_text": "const fi ='';\n fo ='';\n\nvar f,g :text;\n m,n :longint;\n tro,dem,xd :array[0..301] of longint;\n a :array[0..301,0..301] of longint;\nprocedure nhap;\nvar i,j :longint;\nbegin\n assign(f,fi); reset(f);\n readln(f,m,n);\n for i:=1 to m do\n for j:=1 to n do read(f,a[i,j]);\n close(f);\nend;\n\nfunction min(i,j :longint):longint;\nbegin\n if isl then\n begin\n sl:=dem[i];\n vt:=i;\n end;\n end;\n xd[vt]:=0;\n exit(min(sl,tinh(tt-1)));\nend;\nprocedure xuli;\nvar i,kq :longint;\nbegin\n for i:=1 to n do xd[i]:=1;\n kq:=tinh(n);\n assign(g,fo); rewrite(g);\n writeln(g,kq);\n close(g);\nend;\n\nbegin\n nhap;\n xuli;\nend.", "language": "Pascal", "metadata": {"date": 1510872604, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03652.html", "problem_id": "p03652", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03652/input.txt", "sample_output_relpath": "derived/input_output/data/p03652/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03652/Pascal/s159827277.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s159827277", "user_id": "u739490378"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "const fi ='';\n fo ='';\n\nvar f,g :text;\n m,n :longint;\n tro,dem,xd :array[0..301] of longint;\n a :array[0..301,0..301] of longint;\nprocedure nhap;\nvar i,j :longint;\nbegin\n assign(f,fi); reset(f);\n readln(f,m,n);\n for i:=1 to m do\n for j:=1 to n do read(f,a[i,j]);\n close(f);\nend;\n\nfunction min(i,j :longint):longint;\nbegin\n if isl then\n begin\n sl:=dem[i];\n vt:=i;\n end;\n end;\n xd[vt]:=0;\n exit(min(sl,tinh(tt-1)));\nend;\nprocedure xuli;\nvar i,kq :longint;\nbegin\n for i:=1 to n do xd[i]:=1;\n kq:=tinh(n);\n assign(g,fo); rewrite(g);\n writeln(g,kq);\n close(g);\nend;\n\nbegin\n nhap;\n xuli;\nend.", "problem_context": "Score : 700 points\n\nProblem Statement\n\nTakahashi is hosting an sports meet.\nThere are N people who will participate. These people are conveniently numbered 1 through N.\nAlso, there are M options of sports for this event. These sports are numbered 1 through M.\nAmong these options, Takahashi will select one or more sports (possibly all) to be played in the event.\n\nTakahashi knows that Person i's j-th favorite sport is Sport A_{ij}.\nEach person will only participate in his/her most favorite sport among the ones that are actually played in the event, and will not participate in the other sports.\n\nTakahashi is worried that one of the sports will attract too many people.\nTherefore, he would like to carefully select sports to be played so that the number of the participants in the sport with the largest number of participants is minimized.\nFind the minimum possible number of the participants in the sport with the largest number of participants.\n\nConstraints\n\n1 \\leq N \\leq 300\n\n1 \\leq M \\leq 300\n\nA_{i1} , A_{i2} , ... , A_{iM} is a permutation of the integers from 1 to M.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nA_{11} A_{12} ... A_{1M}\nA_{21} A_{22} ... A_{2M}\n:\nA_{N1} A_{N2} ... A_{NM}\n\nOutput\n\nPrint the minimum possible number of the participants in the sport with the largest number of participants.\n\nSample Input 1\n\n4 5\n5 1 3 4 2\n2 5 3 1 4\n2 3 1 4 5\n2 5 4 3 1\n\nSample Output 1\n\n2\n\nAssume that Sports 1, 3 and 4 are selected to be played. In this case, Person 1 will participate in Sport 1, Person 2 in Sport 3, Person 3 in Sport 3 and Person 4 in Sport 4.\nHere, the sport with the largest number of participants is Sport 3, with two participants.\nThere is no way to reduce the number of participants in the sport with the largest number of participants to 1. Therefore, the answer is 2.\n\nSample Input 2\n\n3 3\n2 1 3\n2 1 3\n2 1 3\n\nSample Output 2\n\n3\n\nSince all the people have the same taste in sports, there will be a sport with three participants, no matter what sports are selected.\nTherefore, the answer is 3.", "sample_input": "4 5\n5 1 3 4 2\n2 5 3 1 4\n2 3 1 4 5\n2 5 4 3 1\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03652", "source_text": "Score : 700 points\n\nProblem Statement\n\nTakahashi is hosting an sports meet.\nThere are N people who will participate. These people are conveniently numbered 1 through N.\nAlso, there are M options of sports for this event. These sports are numbered 1 through M.\nAmong these options, Takahashi will select one or more sports (possibly all) to be played in the event.\n\nTakahashi knows that Person i's j-th favorite sport is Sport A_{ij}.\nEach person will only participate in his/her most favorite sport among the ones that are actually played in the event, and will not participate in the other sports.\n\nTakahashi is worried that one of the sports will attract too many people.\nTherefore, he would like to carefully select sports to be played so that the number of the participants in the sport with the largest number of participants is minimized.\nFind the minimum possible number of the participants in the sport with the largest number of participants.\n\nConstraints\n\n1 \\leq N \\leq 300\n\n1 \\leq M \\leq 300\n\nA_{i1} , A_{i2} , ... , A_{iM} is a permutation of the integers from 1 to M.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nA_{11} A_{12} ... A_{1M}\nA_{21} A_{22} ... A_{2M}\n:\nA_{N1} A_{N2} ... A_{NM}\n\nOutput\n\nPrint the minimum possible number of the participants in the sport with the largest number of participants.\n\nSample Input 1\n\n4 5\n5 1 3 4 2\n2 5 3 1 4\n2 3 1 4 5\n2 5 4 3 1\n\nSample Output 1\n\n2\n\nAssume that Sports 1, 3 and 4 are selected to be played. In this case, Person 1 will participate in Sport 1, Person 2 in Sport 3, Person 3 in Sport 3 and Person 4 in Sport 4.\nHere, the sport with the largest number of participants is Sport 3, with two participants.\nThere is no way to reduce the number of participants in the sport with the largest number of participants to 1. Therefore, the answer is 2.\n\nSample Input 2\n\n3 3\n2 1 3\n2 1 3\n2 1 3\n\nSample Output 2\n\n3\n\nSince all the people have the same taste in sports, there will be a sport with three participants, no matter what sports are selected.\nTherefore, the answer is 3.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1474, "cpu_time_ms": 9, "memory_kb": 512}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s641804521", "group_id": "codeNet:p03652", "input_text": "const\n fi='';\n fo='';\nvar n,m,res:integer;\n a:array[0..3000,0..3000]of integer;\n c,s:array[0..3000]of integer;\n cx:array[0..3000]of byte;\n g:text;\n\nprocedure solve;\nvar i,j,mj:integer;\nbegin\n for i:=1 to m do c[i]:=1;\n res:=m;\n for i:=1 to n do\n begin\n for j:=1 to n do s[j]:=0;\n mj:=1;\n for j:=1 to m do\n begin\n inc(s[a[j,c[j]]]);\n if s[mj]m then \n\t\t\tbegin \n\t\t\t\twriteln(min);\n\t\t\t\thalt;\n\t\t\tend;\n\t\tend;\n\tend;\n\twriteln(min);\nend. ", "language": "Pascal", "metadata": {"date": 1509374207, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03652.html", "problem_id": "p03652", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03652/input.txt", "sample_output_relpath": "derived/input_output/data/p03652/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03652/Pascal/s317885925.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s317885925", "user_id": "u089230684"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "program ec12;\nvar \n\tn,m,i,j,max,min:longint;\n\ta:array[1..301,1..301] of longint;\n\tvis,step:array[1..301] of longint;\n\tvis1:array[1..301] of boolean;\nbegin \n\treadln(n,m);\n\tfor i:=1 to n do \n\tfor j:=1 to m do \n\tread(a[i,j]);\n\tmin:=n;\n\tfor i:=1 to n do \n\tstep[i]:=1;\n\tfillchar(vis1,sizeof(vis1),true);\n\twhile true do \n\tbegin \t\n\t\tfillchar(vis,sizeof(vis),0);\n\t\tfor i:=1 to n do \n\t\tinc(vis[a[i,step[i]]]);\n\t\tmax:=1;\n\t\tfor i:=2 to m do \n\t\tbegin \t\n\t\t\tif vis[max]m then \n\t\t\tbegin \n\t\t\t\twriteln(min);\n\t\t\t\thalt;\n\t\t\tend;\n\t\tend;\n\tend;\n\twriteln(min);\nend. ", "problem_context": "Score : 700 points\n\nProblem Statement\n\nTakahashi is hosting an sports meet.\nThere are N people who will participate. These people are conveniently numbered 1 through N.\nAlso, there are M options of sports for this event. These sports are numbered 1 through M.\nAmong these options, Takahashi will select one or more sports (possibly all) to be played in the event.\n\nTakahashi knows that Person i's j-th favorite sport is Sport A_{ij}.\nEach person will only participate in his/her most favorite sport among the ones that are actually played in the event, and will not participate in the other sports.\n\nTakahashi is worried that one of the sports will attract too many people.\nTherefore, he would like to carefully select sports to be played so that the number of the participants in the sport with the largest number of participants is minimized.\nFind the minimum possible number of the participants in the sport with the largest number of participants.\n\nConstraints\n\n1 \\leq N \\leq 300\n\n1 \\leq M \\leq 300\n\nA_{i1} , A_{i2} , ... , A_{iM} is a permutation of the integers from 1 to M.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nA_{11} A_{12} ... A_{1M}\nA_{21} A_{22} ... A_{2M}\n:\nA_{N1} A_{N2} ... A_{NM}\n\nOutput\n\nPrint the minimum possible number of the participants in the sport with the largest number of participants.\n\nSample Input 1\n\n4 5\n5 1 3 4 2\n2 5 3 1 4\n2 3 1 4 5\n2 5 4 3 1\n\nSample Output 1\n\n2\n\nAssume that Sports 1, 3 and 4 are selected to be played. In this case, Person 1 will participate in Sport 1, Person 2 in Sport 3, Person 3 in Sport 3 and Person 4 in Sport 4.\nHere, the sport with the largest number of participants is Sport 3, with two participants.\nThere is no way to reduce the number of participants in the sport with the largest number of participants to 1. Therefore, the answer is 2.\n\nSample Input 2\n\n3 3\n2 1 3\n2 1 3\n2 1 3\n\nSample Output 2\n\n3\n\nSince all the people have the same taste in sports, there will be a sport with three participants, no matter what sports are selected.\nTherefore, the answer is 3.", "sample_input": "4 5\n5 1 3 4 2\n2 5 3 1 4\n2 3 1 4 5\n2 5 4 3 1\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03652", "source_text": "Score : 700 points\n\nProblem Statement\n\nTakahashi is hosting an sports meet.\nThere are N people who will participate. These people are conveniently numbered 1 through N.\nAlso, there are M options of sports for this event. These sports are numbered 1 through M.\nAmong these options, Takahashi will select one or more sports (possibly all) to be played in the event.\n\nTakahashi knows that Person i's j-th favorite sport is Sport A_{ij}.\nEach person will only participate in his/her most favorite sport among the ones that are actually played in the event, and will not participate in the other sports.\n\nTakahashi is worried that one of the sports will attract too many people.\nTherefore, he would like to carefully select sports to be played so that the number of the participants in the sport with the largest number of participants is minimized.\nFind the minimum possible number of the participants in the sport with the largest number of participants.\n\nConstraints\n\n1 \\leq N \\leq 300\n\n1 \\leq M \\leq 300\n\nA_{i1} , A_{i2} , ... , A_{iM} is a permutation of the integers from 1 to M.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\nA_{11} A_{12} ... A_{1M}\nA_{21} A_{22} ... A_{2M}\n:\nA_{N1} A_{N2} ... A_{NM}\n\nOutput\n\nPrint the minimum possible number of the participants in the sport with the largest number of participants.\n\nSample Input 1\n\n4 5\n5 1 3 4 2\n2 5 3 1 4\n2 3 1 4 5\n2 5 4 3 1\n\nSample Output 1\n\n2\n\nAssume that Sports 1, 3 and 4 are selected to be played. In this case, Person 1 will participate in Sport 1, Person 2 in Sport 3, Person 3 in Sport 3 and Person 4 in Sport 4.\nHere, the sport with the largest number of participants is Sport 3, with two participants.\nThere is no way to reduce the number of participants in the sport with the largest number of participants to 1. Therefore, the answer is 2.\n\nSample Input 2\n\n3 3\n2 1 3\n2 1 3\n2 1 3\n\nSample Output 2\n\n3\n\nSince all the people have the same taste in sports, there will be a sport with three participants, no matter what sports are selected.\nTherefore, the answer is 3.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 744, "cpu_time_ms": 9, "memory_kb": 512}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s623954100", "group_id": "codeNet:p03657", "input_text": "var n,m:longint;\nbegin\n readln(n,m);\n if (n mod 3=0)or(m mod 3=0)or((n+m) mod 3=0) then writeln('Possible') \n else writeln('Impossible');\nend.", "language": "Pascal", "metadata": {"date": 1534281849, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03657.html", "problem_id": "p03657", "resource_group": "low_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/Pascal/s623954100.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s623954100", "user_id": "u263933075"}, "prompt_components": {"gold_output": "Possible\n", "input_to_evaluate": "var n,m:longint;\nbegin\n readln(n,m);\n if (n mod 3=0)or(m mod 3=0)or((n+m) mod 3=0) then writeln('Possible') \n else writeln('Impossible');\nend.", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 3, "memory_kb": 128}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s570718582", "group_id": "codeNet:p03657", "input_text": "program Project1;\n\n{$APPTYPE CONSOLE}\n\nuses\n SysUtils,Classes;\nvar\n a,h,w,i,j,count,x,y,sw,m,n,b,c,soeji,sum,max:Integer;\n //a:array of Integer;\n s,s123,s1,s2,s3:string;\n tf:Boolean;\n nyu:TStringList;\nbegin\n try\n { TODO -oUser -cConsole Main : ここにコードを記述してください }\n Read(a);\n Readln(b);\n\n if (a mod 3=0)or(b mod 3=0)or((a+b)mod 3=0) then\n Writeln('Possible')\n else\n Writeln('Impossible');\n Readln;\n except\n on E: Exception do\n Writeln(E.ClassName, ': ', E.Message);\n end;\nend.\n", "language": "Pascal", "metadata": {"date": 1516917734, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03657.html", "problem_id": "p03657", "resource_group": "low_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/Pascal/s570718582.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s570718582", "user_id": "u755925739"}, "prompt_components": {"gold_output": "Possible\n", "input_to_evaluate": "program Project1;\n\n{$APPTYPE CONSOLE}\n\nuses\n SysUtils,Classes;\nvar\n a,h,w,i,j,count,x,y,sw,m,n,b,c,soeji,sum,max:Integer;\n //a:array of Integer;\n s,s123,s1,s2,s3:string;\n tf:Boolean;\n nyu:TStringList;\nbegin\n try\n { TODO -oUser -cConsole Main : ここにコードを記述してください }\n Read(a);\n Readln(b);\n\n if (a mod 3=0)or(b mod 3=0)or((a+b)mod 3=0) then\n Writeln('Possible')\n else\n Writeln('Impossible');\n Readln;\n except\n on E: Exception do\n Writeln(E.ClassName, ': ', E.Message);\n end;\nend.\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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 549, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s240645310", "group_id": "codeNet:p03658", "input_text": "program Project1;\n\n{$APPTYPE CONSOLE}\n\nuses\n SysUtils,Classes;\nvar\n a,h,w,i,j,count,x,y,sw,m,n,b,c,soeji,sum,max,k,min:Integer;\n l:array of Integer;\n s,s123,s1,s2,s3:string;\n tf:Boolean;\n nyu:TStringList;\nbegin\n try\n { TODO -oUser -cConsole Main : ここにコードを記述してください }\n Read(n);\n Readln(k);\n SetLength(l,n);\n for i := 0 to n - 1 do\n Read(l[i]);\n \n for i := 0 to n-1 do begin\n min := i;\n for j := i+1 to n-1 do begin\n if l[j] < l[min] then\n min := j;\n end;\n sw:=l[i];\n l[i]:=l[min];\n l[min]:=sw;\n end;\n\n sum:=0;\n for i := n-1 downto n-k do\n sum:=sum+l[i];\n Writeln(sum);\n Readln;\n Readln;\n except\n on E: Exception do\n Writeln(E.ClassName, ': ', E.Message);\n end;\nend.", "language": "Pascal", "metadata": {"date": 1516978260, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03658.html", "problem_id": "p03658", "resource_group": "low_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/Pascal/s240645310.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s240645310", "user_id": "u755925739"}, "prompt_components": {"gold_output": "12\n", "input_to_evaluate": "program Project1;\n\n{$APPTYPE CONSOLE}\n\nuses\n SysUtils,Classes;\nvar\n a,h,w,i,j,count,x,y,sw,m,n,b,c,soeji,sum,max,k,min:Integer;\n l:array of Integer;\n s,s123,s1,s2,s3:string;\n tf:Boolean;\n nyu:TStringList;\nbegin\n try\n { TODO -oUser -cConsole Main : ここにコードを記述してください }\n Read(n);\n Readln(k);\n SetLength(l,n);\n for i := 0 to n - 1 do\n Read(l[i]);\n \n for i := 0 to n-1 do begin\n min := i;\n for j := i+1 to n-1 do begin\n if l[j] < l[min] then\n min := j;\n end;\n sw:=l[i];\n l[i]:=l[min];\n l[min]:=sw;\n end;\n\n sum:=0;\n for i := n-1 downto n-k do\n sum:=sum+l[i];\n Writeln(sum);\n Readln;\n Readln;\n except\n on E: Exception do\n Writeln(E.ClassName, ': ', E.Message);\n end;\nend.", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 800, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s548849124", "group_id": "codeNet:p03658", "input_text": "program Project1;\n\n{$APPTYPE CONSOLE}\n\nuses\n SysUtils,Classes;\nvar\n a,h,w,i,j,count,x,y,sw,m,n,b,c,soeji,sum,max,k,min:Integer;\n l:array of Integer;\n s,s123,s1,s2,s3:string;\n tf:Boolean;\n nyu:TStringList;\nbegin\n try\n { TODO -oUser -cConsole Main : ここにコードを記述してください }\n Read(n);\n Readln(k);\n SetLength(l,n);\n for i := 0 to n - 1 do\n Read(l[i]);\n \n for i := 0 to n-1 do begin\n min := i;\n for j := i+1 to n-1 do begin\n if l[j] < l[min] then\n min := j;\n end;\n sw:=l[i];\n l[i]:=l[min];\n l[min]:=sw;\n end;\n\n sum:=0;\n for i := n downto n-k do\n sum:=sum+l[i];\n \n Writeln(sum);\n Readln;\n Readln;\n except\n on E: Exception do\n Writeln(E.ClassName, ': ', E.Message);\n end;\nend.", "language": "Pascal", "metadata": {"date": 1516976736, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03658.html", "problem_id": "p03658", "resource_group": "low_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/Pascal/s548849124.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s548849124", "user_id": "u755925739"}, "prompt_components": {"gold_output": "12\n", "input_to_evaluate": "program Project1;\n\n{$APPTYPE CONSOLE}\n\nuses\n SysUtils,Classes;\nvar\n a,h,w,i,j,count,x,y,sw,m,n,b,c,soeji,sum,max,k,min:Integer;\n l:array of Integer;\n s,s123,s1,s2,s3:string;\n tf:Boolean;\n nyu:TStringList;\nbegin\n try\n { TODO -oUser -cConsole Main : ここにコードを記述してください }\n Read(n);\n Readln(k);\n SetLength(l,n);\n for i := 0 to n - 1 do\n Read(l[i]);\n \n for i := 0 to n-1 do begin\n min := i;\n for j := i+1 to n-1 do begin\n if l[j] < l[min] then\n min := j;\n end;\n sw:=l[i];\n l[i]:=l[min];\n l[min]:=sw;\n end;\n\n sum:=0;\n for i := n downto n-k do\n sum:=sum+l[i];\n \n Writeln(sum);\n Readln;\n Readln;\n except\n on E: Exception do\n Writeln(E.ClassName, ': ', E.Message);\n end;\nend.", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 800, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s902481897", "group_id": "codeNet:p03659", "input_text": "var\n a:array[0..200005] of longint;\n n,i,j,min:longint;\n procedure sort(l,r: longint);\n var\n i,j,x,y: longint;\n begin\n i:=l;\n j:=r;\n x:=a[(l+r) div 2];\n repeat\n while a[i]j) then\n begin\n y:=a[i];\n a[i]:=a[j];\n a[j]:=y;\n inc(i);\n j:=j-1;\n end;\n until i>j;\n if lj) then\n begin\n y:=a[i];\n a[i]:=a[j];\n a[j]:=y;\n inc(i);\n j:=j-1;\n end;\n until i>j;\n if lj) then\n begin\n y:=a[i];\n a[i]:=a[j];\n a[j]:=y;\n inc(i);\n j:=j-1;\n end;\n until i>j;\n if lj) then\n begin\n y:=a[i];\n a[i]:=a[j];\n a[j]:=y;\n inc(i);\n j:=j-1;\n end;\n until i>j;\n if lj) then\n begin\n y:=a[i];\n a[i]:=a[j];\n a[j]:=y;\n inc(i);\n j:=j-1;\n end;\n until i>j;\n if lj) then\n begin\n y:=a[i];\n a[i]:=a[j];\n a[j]:=y;\n inc(i);\n j:=j-1;\n end;\n until i>j;\n if lj) then\n begin\n y:=a[i];\n a[i]:=a[j];\n a[j]:=y;\n inc(i);\n j:=j-1;\n end;\n until i>j;\n if lj) then\n begin\n y:=a[i];\n a[i]:=a[j];\n a[j]:=y;\n inc(i);\n j:=j-1;\n end;\n until i>j;\n if l=n then writeln('Fennec')else writeln('Snuke');\nend.\n", "language": "Pascal", "metadata": {"date": 1539448959, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03662.html", "problem_id": "p03662", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03662/input.txt", "sample_output_relpath": "derived/input_output/data/p03662/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03662/Pascal/s461110940.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s461110940", "user_id": "u657913472"}, "prompt_components": {"gold_output": "Fennec\n", "input_to_evaluate": "var\n\tn,i,cnt,a,b:Longint;\n\tv:array[1..100000]of array of Longint;\n\tc,d1,d2:array[1..100000]of Longint;\nprocedure dfs1(u,d:Longint);\nvar i:Longint;\nbegin\n\td1[u]:=d;\n\tfor i:=0 to c[u]-1 do if d1[v[u][i]]=0 then dfs1(v[u][i],d+1);\nend;\nprocedure dfs2(u,d:Longint);\nvar i:Longint;\nbegin\n\td2[u]:=d;\n\tfor i:=0 to c[u]-1 do if d2[v[u][i]]=0 then dfs2(v[u][i],d+1);\nend;\nbegin\n\tread(n);\n\tfor i:=2 to n do begin\n\t\tread(a,b);\n\t\tinc(c[a]);\n\t\tinc(c[b]);\n\t\tsetLength(v[a],c[a]);\n\t\tsetLength(v[b],c[b]);\n\t\tv[a][c[a]-1]:=b;\n\t\tv[b][c[b]-1]:=a;\n\tend;\n\tdfs1(1,1);\n\tdfs2(n,1);\n\tfor i:=1 to n do if d1[i]<=d2[i] then inc(cnt);\n\tif cnt*2>=n then writeln('Fennec')else writeln('Snuke');\nend.\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nFennec and Snuke are playing a board game.\n\nOn the board, there are N cells numbered 1 through N, and N-1 roads, each connecting two cells. Cell a_i is adjacent to Cell b_i through the i-th road. Every cell can be reached from every other cell by repeatedly traveling to an adjacent cell. In terms of graph theory, the graph formed by the cells and the roads is a tree.\n\nInitially, Cell 1 is painted black, and Cell N is painted white. The other cells are not yet colored.\nFennec (who goes first) and Snuke (who goes second) alternately paint an uncolored cell.\nMore specifically, each player performs the following action in her/his turn:\n\nFennec: selects an uncolored cell that is adjacent to a black cell, and paints it black.\n\nSnuke: selects an uncolored cell that is adjacent to a white cell, and paints it white.\n\nA player loses when she/he cannot paint a cell. Determine the winner of the game when Fennec and Snuke play optimally.\n\nConstraints\n\n2 \\leq N \\leq 10^5\n\n1 \\leq a_i, b_i \\leq N\n\nThe given graph is a tree.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_1 b_1\n:\na_{N-1} b_{N-1}\n\nOutput\n\nIf Fennec wins, print Fennec; if Snuke wins, print Snuke.\n\nSample Input 1\n\n7\n3 6\n1 2\n3 1\n7 4\n5 7\n1 4\n\nSample Output 1\n\nFennec\n\nFor example, if Fennec first paints Cell 2 black, she will win regardless of Snuke's moves.\n\nSample Input 2\n\n4\n1 4\n4 2\n2 3\n\nSample Output 2\n\nSnuke", "sample_input": "7\n3 6\n1 2\n3 1\n7 4\n5 7\n1 4\n"}, "reference_outputs": ["Fennec\n"], "source_document_id": "p03662", "source_text": "Score : 400 points\n\nProblem Statement\n\nFennec and Snuke are playing a board game.\n\nOn the board, there are N cells numbered 1 through N, and N-1 roads, each connecting two cells. Cell a_i is adjacent to Cell b_i through the i-th road. Every cell can be reached from every other cell by repeatedly traveling to an adjacent cell. In terms of graph theory, the graph formed by the cells and the roads is a tree.\n\nInitially, Cell 1 is painted black, and Cell N is painted white. The other cells are not yet colored.\nFennec (who goes first) and Snuke (who goes second) alternately paint an uncolored cell.\nMore specifically, each player performs the following action in her/his turn:\n\nFennec: selects an uncolored cell that is adjacent to a black cell, and paints it black.\n\nSnuke: selects an uncolored cell that is adjacent to a white cell, and paints it white.\n\nA player loses when she/he cannot paint a cell. Determine the winner of the game when Fennec and Snuke play optimally.\n\nConstraints\n\n2 \\leq N \\leq 10^5\n\n1 \\leq a_i, b_i \\leq N\n\nThe given graph is a tree.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_1 b_1\n:\na_{N-1} b_{N-1}\n\nOutput\n\nIf Fennec wins, print Fennec; if Snuke wins, print Snuke.\n\nSample Input 1\n\n7\n3 6\n1 2\n3 1\n7 4\n5 7\n1 4\n\nSample Output 1\n\nFennec\n\nFor example, if Fennec first paints Cell 2 black, she will win regardless of Snuke's moves.\n\nSample Input 2\n\n4\n1 4\n4 2\n2 3\n\nSample Output 2\n\nSnuke", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 45, "memory_kb": 9856}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s378903209", "group_id": "codeNet:p03665", "input_text": "const fi='agc017_a.inp';\n fo='agc017_a.out';\ntype hanh=extended;\nvar d:array[0..50] of hanh;\n a,b,p:longint;\nprocedure mori;\n var i:longint;\n begin\n d[0]:=1;\n for i:=1 to 50 do d[i]:=d[i-1]*i;\n end;\nprocedure ran;\n var n,x,i:longint;\n begin\n readln(n,p);\n a:=0;\n b:=0;\n p:=p mod 2;\n for i:=1 to n do\n begin\n read(x);\n if x mod 2=0 then inc(a) else inc(b);\n end;\n end;\nfunction conan:hanh;\n var i:longint;\n aa,bb:hanh;\n begin\n bb:=1;\n for i:=1 to b do\n if i mod 2=0 then\n bb:=bb+d[b]/(d[i]*d[b-i]);\n aa:=1;\n for i:=1 to a do\n aa:=aa+d[a]/(d[i]*d[a-i]);\n exit(aa*bb);\n\n end;\nfunction conan1:hanh;\n var aa,bb:hanh;\n i:longint;\n begin\n bb:=0;\n for i:=1 to b do\n if i mod 2=1 then\n bb:=bb+d[b]/(d[i]*d[b-i]);\n aa:=1;\n for i:=1 to a do\n aa:=aa+d[a]/(d[i]*d[a-i]);\n exit(aa*bb);\n end;\nbegin\n\n ran;\n mori;\n if p=0 then writeln(conan:0:0) else writeln(conan1:0:0);\nend.\n", "language": "Pascal", "metadata": {"date": 1499652944, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03665.html", "problem_id": "p03665", "resource_group": "low_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/Pascal/s378903209.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s378903209", "user_id": "u189227566"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "const fi='agc017_a.inp';\n fo='agc017_a.out';\ntype hanh=extended;\nvar d:array[0..50] of hanh;\n a,b,p:longint;\nprocedure mori;\n var i:longint;\n begin\n d[0]:=1;\n for i:=1 to 50 do d[i]:=d[i-1]*i;\n end;\nprocedure ran;\n var n,x,i:longint;\n begin\n readln(n,p);\n a:=0;\n b:=0;\n p:=p mod 2;\n for i:=1 to n do\n begin\n read(x);\n if x mod 2=0 then inc(a) else inc(b);\n end;\n end;\nfunction conan:hanh;\n var i:longint;\n aa,bb:hanh;\n begin\n bb:=1;\n for i:=1 to b do\n if i mod 2=0 then\n bb:=bb+d[b]/(d[i]*d[b-i]);\n aa:=1;\n for i:=1 to a do\n aa:=aa+d[a]/(d[i]*d[a-i]);\n exit(aa*bb);\n\n end;\nfunction conan1:hanh;\n var aa,bb:hanh;\n i:longint;\n begin\n bb:=0;\n for i:=1 to b do\n if i mod 2=1 then\n bb:=bb+d[b]/(d[i]*d[b-i]);\n aa:=1;\n for i:=1 to a do\n aa:=aa+d[a]/(d[i]*d[a-i]);\n exit(aa*bb);\n end;\nbegin\n\n ran;\n mori;\n if p=0 then writeln(conan:0:0) else writeln(conan1:0:0);\nend.\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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1607, "cpu_time_ms": 3, "memory_kb": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s405959826", "group_id": "codeNet:p03671", "input_text": "program Project1;\n\n{$APPTYPE CONSOLE}\n\nuses\n SysUtils,Classes;\nvar\n a,h,w,i,j,count,x,y,sw,m,n,b,c,soeji,sum,max:Integer;\n //a:array of Integer;\n s123,s1,s2,s3:string;\n tf:Boolean;\n nyu:TStringList;\nbegin\n try\n { TODO -oUser -cConsole Main : ここにコードを記述してください }\n Read(a);\n sum:=a;\n max:=a;\n Read(a);\n sum:=sum+a;\n max:=(max+a+abs(max-a))div 2;\n Readln(a);\n sum:=sum+a;\n max:=(max+a+abs(max-a))div 2;\n\n Writeln(sum-max);\n Readln;\n except\n on E: Exception do\n Writeln(E.ClassName, ': ', E.Message);\n end;\nend.\n", "language": "Pascal", "metadata": {"date": 1516910783, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03671.html", "problem_id": "p03671", "resource_group": "low_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/Pascal/s405959826.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s405959826", "user_id": "u755925739"}, "prompt_components": {"gold_output": "1300\n", "input_to_evaluate": "program Project1;\n\n{$APPTYPE CONSOLE}\n\nuses\n SysUtils,Classes;\nvar\n a,h,w,i,j,count,x,y,sw,m,n,b,c,soeji,sum,max:Integer;\n //a:array of Integer;\n s123,s1,s2,s3:string;\n tf:Boolean;\n nyu:TStringList;\nbegin\n try\n { TODO -oUser -cConsole Main : ここにコードを記述してください }\n Read(a);\n sum:=a;\n max:=a;\n Read(a);\n sum:=sum+a;\n max:=(max+a+abs(max-a))div 2;\n Readln(a);\n sum:=sum+a;\n max:=(max+a+abs(max-a))div 2;\n\n Writeln(sum-max);\n Readln;\n except\n on E: Exception do\n Writeln(E.ClassName, ': ', E.Message);\n end;\nend.\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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 589, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s965179671", "group_id": "codeNet:p03672", "input_text": "program Project1;\n\n{$APPTYPE CONSOLE}\n\nuses\n SysUtils,Classes;\nvar\n a,h,w,i,j,count,x,y,sw,m,n,b,c,soeji,sum,max:Integer;\n //a:array of Integer;\n s,s123,s1,s2,s3:string;\n tf:Boolean;\n nyu:TStringList;\nbegin\n try\n { TODO -oUser -cConsole Main : ここにコードを記述してください }\n Readln(s);\n //s2 := Copy( s1, 3, 2 );\n\n for i := (Length(s)div 2 - 1) downto 1 do begin\n if Copy(s,1,i)=Copy(s,i+1,i) then begin\n Writeln(i*2);\n break;//exit;\n end;\n end;\n Readln;\n except\n on E: Exception do\n Writeln(E.ClassName, ': ', E.Message);\n end;\nend.\n", "language": "Pascal", "metadata": {"date": 1516913988, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03672.html", "problem_id": "p03672", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03672/input.txt", "sample_output_relpath": "derived/input_output/data/p03672/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03672/Pascal/s965179671.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s965179671", "user_id": "u755925739"}, "prompt_components": {"gold_output": "6\n", "input_to_evaluate": "program Project1;\n\n{$APPTYPE CONSOLE}\n\nuses\n SysUtils,Classes;\nvar\n a,h,w,i,j,count,x,y,sw,m,n,b,c,soeji,sum,max:Integer;\n //a:array of Integer;\n s,s123,s1,s2,s3:string;\n tf:Boolean;\n nyu:TStringList;\nbegin\n try\n { TODO -oUser -cConsole Main : ここにコードを記述してください }\n Readln(s);\n //s2 := Copy( s1, 3, 2 );\n\n for i := (Length(s)div 2 - 1) downto 1 do begin\n if Copy(s,1,i)=Copy(s,i+1,i) then begin\n Writeln(i*2);\n break;//exit;\n end;\n end;\n Readln;\n except\n on E: Exception do\n Writeln(E.ClassName, ': ', E.Message);\n end;\nend.\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nWe will call a string that can be obtained by concatenating two equal strings an even string.\nFor example, xyzxyz and aaaaaa are even, while ababab and xyzxy are not.\n\nYou are given an even string S consisting of lowercase English letters.\nFind the length of the longest even string that can be obtained by deleting one or more characters from the end of S.\nIt is guaranteed that such a non-empty string exists for a given input.\n\nConstraints\n\n2 \\leq |S| \\leq 200\n\nS is an even string consisting of lowercase English letters.\n\nThere exists a non-empty even string that can be obtained by deleting one or more characters from the end of S.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the length of the longest even string that can be obtained.\n\nSample Input 1\n\nabaababaab\n\nSample Output 1\n\n6\n\nabaababaab itself is even, but we need to delete at least one character.\n\nabaababaa is not even.\n\nabaababa is not even.\n\nabaabab is not even.\n\nabaaba is even. Thus, we should print its length, 6.\n\nSample Input 2\n\nxxxx\n\nSample Output 2\n\n2\n\nxxx is not even.\n\nxx is even.\n\nSample Input 3\n\nabcabcabcabc\n\nSample Output 3\n\n6\n\nThe longest even string that can be obtained is abcabc, whose length is 6.\n\nSample Input 4\n\nakasakaakasakasakaakas\n\nSample Output 4\n\n14\n\nThe longest even string that can be obtained is akasakaakasaka, whose length is 14.", "sample_input": "abaababaab\n"}, "reference_outputs": ["6\n"], "source_document_id": "p03672", "source_text": "Score : 200 points\n\nProblem Statement\n\nWe will call a string that can be obtained by concatenating two equal strings an even string.\nFor example, xyzxyz and aaaaaa are even, while ababab and xyzxy are not.\n\nYou are given an even string S consisting of lowercase English letters.\nFind the length of the longest even string that can be obtained by deleting one or more characters from the end of S.\nIt is guaranteed that such a non-empty string exists for a given input.\n\nConstraints\n\n2 \\leq |S| \\leq 200\n\nS is an even string consisting of lowercase English letters.\n\nThere exists a non-empty even string that can be obtained by deleting one or more characters from the end of S.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the length of the longest even string that can be obtained.\n\nSample Input 1\n\nabaababaab\n\nSample Output 1\n\n6\n\nabaababaab itself is even, but we need to delete at least one character.\n\nabaababaa is not even.\n\nabaababa is not even.\n\nabaabab is not even.\n\nabaaba is even. Thus, we should print its length, 6.\n\nSample Input 2\n\nxxxx\n\nSample Output 2\n\n2\n\nxxx is not even.\n\nxx is even.\n\nSample Input 3\n\nabcabcabcabc\n\nSample Output 3\n\n6\n\nThe longest even string that can be obtained is abcabc, whose length is 6.\n\nSample Input 4\n\nakasakaakasakasakaakas\n\nSample Output 4\n\n14\n\nThe longest even string that can be obtained is akasakaakasaka, whose length is 14.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 611, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s094605724", "group_id": "codeNet:p03673", "input_text": "var a:array of longint;\n n,i:longint;\nbegin\n readln(n);\n setlength(a,n+1);\n for i:=1 to n do\n read(a[i]);\n i:=n;\n while i>0 do\n begin\n write(a[i],' ');\n dec(i,2);\n end;\n i:=(n and 1)+1;\n while i<=n do\n begin\n write(a[i],' ');\n inc(i,2);\n end;\nend.", "language": "Pascal", "metadata": {"date": 1575680500, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03673.html", "problem_id": "p03673", "resource_group": "low_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/Pascal/s094605724.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s094605724", "user_id": "u263933075"}, "prompt_components": {"gold_output": "4 2 1 3\n", "input_to_evaluate": "var a:array of longint;\n n,i:longint;\nbegin\n readln(n);\n setlength(a,n+1);\n for i:=1 to n do\n read(a[i]);\n i:=n;\n while i>0 do\n begin\n write(a[i],' ');\n dec(i,2);\n end;\n i:=(n and 1)+1;\n while i<=n do\n begin\n write(a[i],' ');\n inc(i,2);\n end;\nend.", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 71, "memory_kb": 2816}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s800284317", "group_id": "codeNet:p03673", "input_text": "var a:array[0..200000]of longint;\n n,i:longint;\nbegin\n readln(n);\n for i:=1 to n do\n read(a[i]);\n i:=n;\n while i>0 do\n begin\n write(a[i],' ');\n dec(i,2);\n end;\n i:=(n and 1)+1;\n while i<=n do\n begin\n write(a[i],' ');\n inc(i,2);\n end;\nend.", "language": "Pascal", "metadata": {"date": 1575413243, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03673.html", "problem_id": "p03673", "resource_group": "low_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/Pascal/s800284317.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s800284317", "user_id": "u476418095"}, "prompt_components": {"gold_output": "4 2 1 3\n", "input_to_evaluate": "var a:array[0..200000]of longint;\n n,i:longint;\nbegin\n readln(n);\n for i:=1 to n do\n read(a[i]);\n i:=n;\n while i>0 do\n begin\n write(a[i],' ');\n dec(i,2);\n end;\n i:=(n and 1)+1;\n while i<=n do\n begin\n write(a[i],' ');\n inc(i,2);\n end;\nend.", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 72, "memory_kb": 2816}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s546861479", "group_id": "codeNet:p03673", "input_text": "program ec12;\nvar \n\ta:array[1..200001] of longint;\n\tqueue:array[-100001..100001] of longint;\n\tn,m,i,j,dis,head,tail:longint;\nbegin \n\treadln(n);\n\tfor i:=1 to n do \n\tread(a[i]);\n\thead:=1;\n\ttail:=1;\n\tdis:=1;\n\tqueue[head]:=a[1];\n\tfor i:=3 to n*2 do \n\tbegin \n\t\tif i mod 2=1 then \n\t\tbegin\n\t\t\tif dis=1 then \n\t\t\tbegin \t\n\t\t\t\tinc(tail);\n\t\t\t\tqueue[tail]:=a[i div 2+1];\n\t\t\tend\n\t\t\telse\n\t\t\tbegin \n\t\t\t\tdec(head);\n\t\t\t\tqueue[head]:=a[i div 2+1];\n\t\t\tend;\n\t\tend\n\t\telse\n\t\tdis:=3-dis;\n\tend;\n\tif dis=1 then \n\tbegin \n\t\tfor i:=head to tail do \n\t\twrite(queue[i],' ');\n\tend\n\telse\n\tbegin\n\t\tfor i:=tail downto head do \n\t\twrite(queue[i],' ');\n\tend;\nend. ", "language": "Pascal", "metadata": {"date": 1509566643, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03673.html", "problem_id": "p03673", "resource_group": "low_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/Pascal/s546861479.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s546861479", "user_id": "u353919145"}, "prompt_components": {"gold_output": "4 2 1 3\n", "input_to_evaluate": "program ec12;\nvar \n\ta:array[1..200001] of longint;\n\tqueue:array[-100001..100001] of longint;\n\tn,m,i,j,dis,head,tail:longint;\nbegin \n\treadln(n);\n\tfor i:=1 to n do \n\tread(a[i]);\n\thead:=1;\n\ttail:=1;\n\tdis:=1;\n\tqueue[head]:=a[1];\n\tfor i:=3 to n*2 do \n\tbegin \n\t\tif i mod 2=1 then \n\t\tbegin\n\t\t\tif dis=1 then \n\t\t\tbegin \t\n\t\t\t\tinc(tail);\n\t\t\t\tqueue[tail]:=a[i div 2+1];\n\t\t\tend\n\t\t\telse\n\t\t\tbegin \n\t\t\t\tdec(head);\n\t\t\t\tqueue[head]:=a[i div 2+1];\n\t\t\tend;\n\t\tend\n\t\telse\n\t\tdis:=3-dis;\n\tend;\n\tif dis=1 then \n\tbegin \n\t\tfor i:=head to tail do \n\t\twrite(queue[i],' ');\n\tend\n\telse\n\tbegin\n\t\tfor i:=tail downto head do \n\t\twrite(queue[i],' ');\n\tend;\nend. ", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 76, "memory_kb": 3584}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s644015144", "group_id": "codeNet:p03673", "input_text": "program V1006;\n var\n a:array[0..100001] of longint;\n i,n:longint;\n begin\n readln(n);\n for i:=1 to n do\n read(a[i]);\n readln;\n i:=n;\n while i>=1 do\n begin\n if n=1 then writeln(a[i])\n else write(a[i],' ');\n dec(i,2);\n end;\n if n mod 2=1 then i:=2\n else i:=1;\n while i<=n do\n begin\n if i+2>n then writeln(a[i])\n else write(a[i],' ');\n inc(i,2);\n end;\n end.\n", "language": "Pascal", "metadata": {"date": 1509563193, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03673.html", "problem_id": "p03673", "resource_group": "low_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/Pascal/s644015144.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s644015144", "user_id": "u863370423"}, "prompt_components": {"gold_output": "4 2 1 3\n", "input_to_evaluate": "program V1006;\n var\n a:array[0..100001] of longint;\n i,n:longint;\n begin\n readln(n);\n for i:=1 to n do\n read(a[i]);\n readln;\n i:=n;\n while i>=1 do\n begin\n if n=1 then writeln(a[i])\n else write(a[i],' ');\n dec(i,2);\n end;\n if n mod 2=1 then i:=2\n else i:=1;\n while i<=n do\n begin\n if i+2>n then writeln(a[i])\n else write(a[i],' ');\n inc(i,2);\n end;\n end.\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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 113, "memory_kb": 512}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s420248433", "group_id": "codeNet:p03675", "input_text": "program ec12;\nvar \n\ta:array[1..200001] of longint;\n\ts,s1:ansistring;\n\tn,m,i,j,dis:longint;\nbegin \n\treadln(n);\n\tfor i:=1 to n do \n\tread(a[i]);\n\ts:='';\n\tdis:=1;\n\tfor i:=1 to n*2 do \n\tbegin\n\t\tif i mod 2=1 then \n\t\tbegin \n\t\t\tif dis=1 then \n\t\t\tbegin \n\t\t\t\tstr(a[i div 2+1],s1);\n\t\t\t\ts:=s+s1;\n\t\t\tend\n\t\t\telse\n\t\t\tbegin \n\t\t\t\tstr(a[i div 2+1],s1);\n\t\t\t\ts:=s1+s;\n\t\t\tend;\n\t\tend\n\t\telse\n\t\tdis:=3-dis;\n\tend;\n\tif dis=1 then \n\tbegin \n\t\tfor i:=1 to length(s) do \n\t\twrite(s[i],' ');\n\tend\n\telse\n\tbegin \n\t\tfor i:=length(s) downto 1 do \n\t\twrite(s[i],' ');\n\tend;\nend. ", "language": "Pascal", "metadata": {"date": 1509566069, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03675.html", "problem_id": "p03675", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03675/input.txt", "sample_output_relpath": "derived/input_output/data/p03675/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03675/Pascal/s420248433.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s420248433", "user_id": "u662099472"}, "prompt_components": {"gold_output": "4 2 1 3\n", "input_to_evaluate": "program ec12;\nvar \n\ta:array[1..200001] of longint;\n\ts,s1:ansistring;\n\tn,m,i,j,dis:longint;\nbegin \n\treadln(n);\n\tfor i:=1 to n do \n\tread(a[i]);\n\ts:='';\n\tdis:=1;\n\tfor i:=1 to n*2 do \n\tbegin\n\t\tif i mod 2=1 then \n\t\tbegin \n\t\t\tif dis=1 then \n\t\t\tbegin \n\t\t\t\tstr(a[i div 2+1],s1);\n\t\t\t\ts:=s+s1;\n\t\t\tend\n\t\t\telse\n\t\t\tbegin \n\t\t\t\tstr(a[i div 2+1],s1);\n\t\t\t\ts:=s1+s;\n\t\t\tend;\n\t\tend\n\t\telse\n\t\tdis:=3-dis;\n\tend;\n\tif dis=1 then \n\tbegin \n\t\tfor i:=1 to length(s) do \n\t\twrite(s[i],' ');\n\tend\n\telse\n\tbegin \n\t\tfor i:=length(s) downto 1 do \n\t\twrite(s[i],' ');\n\tend;\nend. ", "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": "p03675", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 541, "cpu_time_ms": 2103, "memory_kb": 2304}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s750982943", "group_id": "codeNet:p03679", "input_text": "const fi='trained.inp';\n fo='trained.out';\nvar a,dau:array[0..100005] of longint;\n n,d:longint;\n \nprocedure mo;\nbegin\n assign(input,fi);\n reset(input);\n assign(output,fo);\n rewrite(output);\nend;\n\nprocedure nhap;\nvar i:longint;\nbegin\n readln(n);\n for i:=1 to n do\n readln(a[i]);\nend;\n\nprocedure xuly;\nvar i:longint;\nbegin\n d:=0; i:=1;\n repeat\n dau[i]:=1;\n i:=a[i];\n inc(d);\n until (dau[2]=1)or(dau[i]=1);\nend;\n\nprocedure xuat;\nbegin\n if dau[2]=1 then\n writeln(d-1)\n else\n writeln('-1');\nend;\n\nbegin\n \n nhap;\n xuly;\n xuat;\nend.\n\n", "language": "Pascal", "metadata": {"date": 1498358136, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03679.html", "problem_id": "p03679", "resource_group": "low_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/Pascal/s750982943.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s750982943", "user_id": "u068391867"}, "prompt_components": {"gold_output": "safe\n", "input_to_evaluate": "const fi='trained.inp';\n fo='trained.out';\nvar a,dau:array[0..100005] of longint;\n n,d:longint;\n \nprocedure mo;\nbegin\n assign(input,fi);\n reset(input);\n assign(output,fo);\n rewrite(output);\nend;\n\nprocedure nhap;\nvar i:longint;\nbegin\n readln(n);\n for i:=1 to n do\n readln(a[i]);\nend;\n\nprocedure xuly;\nvar i:longint;\nbegin\n d:=0; i:=1;\n repeat\n dau[i]:=1;\n i:=a[i];\n inc(d);\n until (dau[2]=1)or(dau[i]=1);\nend;\n\nprocedure xuat;\nbegin\n if dau[2]=1 then\n writeln(d-1)\n else\n writeln('-1');\nend;\n\nbegin\n \n nhap;\n xuly;\n xuat;\nend.\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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 627, "cpu_time_ms": 136, "memory_kb": 1024}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s743859945", "group_id": "codeNet:p03680", "input_text": "program trained;\nuses math;\nvar\n n, i, k: integer;\n a: array [1..10000] of integer;\nbegin\n read(n);\n for i := 1 to n do\n read(a[i]);\n i := 1;\n for k := 1 to n do\n begin\n i := a[i];\n if i = 2 then\n begin\n writeln(k);\n halt(0);\n end;\n end;\n writeln(-1);\nend.", "language": "Pascal", "metadata": {"date": 1570419906, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03680.html", "problem_id": "p03680", "resource_group": "low_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/Pascal/s743859945.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s743859945", "user_id": "u506403362"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "program trained;\nuses math;\nvar\n n, i, k: integer;\n a: array [1..10000] of integer;\nbegin\n read(n);\n for i := 1 to n do\n read(a[i]);\n i := 1;\n for k := 1 to n do\n begin\n i := a[i];\n if i = 2 then\n begin\n writeln(k);\n halt(0);\n end;\n end;\n writeln(-1);\nend.", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 290, "cpu_time_ms": 100, "memory_kb": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s584719807", "group_id": "codeNet:p03680", "input_text": "var n,i,s:Longint;a:array[1..100000]of Integer;b:array[1..100000]of boolean;\nbegin\n\tread(n);\n\tfor i:=1 to n do read(a[i]);\n\ts:=1;\n\tb[1]:=true;\n\tfor i:=1 to n do begin\n\t\ts:=a[s];\n\t\tif b[s] then break;\n\t\tb[s]:=true;\n\t\tif s=2 then begin\n\t\t\twriteln(i);\n\t\t\texit;\n\t\tend;\n\tend;\n\twriteln(-1);\nend.", "language": "Pascal", "metadata": {"date": 1534920174, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03680.html", "problem_id": "p03680", "resource_group": "low_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/Pascal/s584719807.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s584719807", "user_id": "u657913472"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "var n,i,s:Longint;a:array[1..100000]of Integer;b:array[1..100000]of boolean;\nbegin\n\tread(n);\n\tfor i:=1 to n do read(a[i]);\n\ts:=1;\n\tb[1]:=true;\n\tfor i:=1 to n do begin\n\t\ts:=a[s];\n\t\tif b[s] then break;\n\t\tb[s]:=true;\n\t\tif s=2 then begin\n\t\t\twriteln(i);\n\t\t\texit;\n\t\tend;\n\tend;\n\twriteln(-1);\nend.", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 12, "memory_kb": 640}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s361001273", "group_id": "codeNet:p03680", "input_text": "program Project1;\n\n{$APPTYPE CONSOLE}\n\nuses\n SysUtils,Classes;\nvar\n h,w,i,j,count,x,y,sw,m,n,b,c,soeji:Integer;\n a:array of Integer;\n s123,s1,s2,s3:string;\n tf:Boolean;\n nyu:TStringList;\nbegin\n try\n { TODO -oUser -cConsole Main : ここにコードを記述してください }\n Readln(n);\n SetLength(a,n+1);\n for i := 1 to n do\n Readln(a[i]);\n\n soeji:=1;\n for i := 1 to n do begin\n if a[soeji]=2 then begin\n Writeln(i);\n Readln;\n exit;\n end;\n soeji:=a[soeji];\n end;\n\n Writeln('-1');\n Readln;\n except\n on E: Exception do\n Writeln(E.ClassName, ': ', E.Message);\n end;\nend.\n", "language": "Pascal", "metadata": {"date": 1516910324, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03680.html", "problem_id": "p03680", "resource_group": "low_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/Pascal/s361001273.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s361001273", "user_id": "u755925739"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "program Project1;\n\n{$APPTYPE CONSOLE}\n\nuses\n SysUtils,Classes;\nvar\n h,w,i,j,count,x,y,sw,m,n,b,c,soeji:Integer;\n a:array of Integer;\n s123,s1,s2,s3:string;\n tf:Boolean;\n nyu:TStringList;\nbegin\n try\n { TODO -oUser -cConsole Main : ここにコードを記述してください }\n Readln(n);\n SetLength(a,n+1);\n for i := 1 to n do\n Readln(a[i]);\n\n soeji:=1;\n for i := 1 to n do begin\n if a[soeji]=2 then begin\n Writeln(i);\n Readln;\n exit;\n end;\n soeji:=a[soeji];\n end;\n\n Writeln('-1');\n Readln;\n except\n on E: Exception do\n Writeln(E.ClassName, ': ', E.Message);\n end;\nend.\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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 657, "cpu_time_ms": 13, "memory_kb": 640}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s417467338", "group_id": "codeNet:p03680", "input_text": "type mang=array[0..1000005] of longint;\n mang1=array[0..1000005] of boolean;\nvar a:mang;\n kt:mang1;\n dem,n,sang:longint;\nprocedure nhap;\nvar i:longint;\nbegin\n read(n);\n for i:=1 to n do\n read(a[i]);\nend;\n\nprocedure xuly;\nbegin\n dem:=0;\n fillchar(kt,sizeof(kt),true);\n sang:=1;\n while (sang<>2) and (kt[sang]=true) do\n begin\n kt[sang]:=false;\n sang:=a[sang];\n inc(dem);\n end;\nend;\n\nprocedure xuat;\nbegin\n if sang=2 then write(dem)\n else write('-1');\nend;\n\nbegin\n\n\n nhap;\n xuly;\n xuat;\nend.", "language": "Pascal", "metadata": {"date": 1498354249, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03680.html", "problem_id": "p03680", "resource_group": "low_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/Pascal/s417467338.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s417467338", "user_id": "u194998823"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "type mang=array[0..1000005] of longint;\n mang1=array[0..1000005] of boolean;\nvar a:mang;\n kt:mang1;\n dem,n,sang:longint;\nprocedure nhap;\nvar i:longint;\nbegin\n read(n);\n for i:=1 to n do\n read(a[i]);\nend;\n\nprocedure xuly;\nbegin\n dem:=0;\n fillchar(kt,sizeof(kt),true);\n sang:=1;\n while (sang<>2) and (kt[sang]=true) do\n begin\n kt[sang]:=false;\n sang:=a[sang];\n inc(dem);\n end;\nend;\n\nprocedure xuat;\nbegin\n if sang=2 then write(dem)\n else write('-1');\nend;\n\nbegin\n\n\n nhap;\n xuly;\n xuat;\nend.", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 571, "cpu_time_ms": 13, "memory_kb": 3456}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s320937340", "group_id": "codeNet:p03680", "input_text": "const MaxN=round(1e5)+10;\nvar A:array[0..MaxN] of longint;\n n,res:longint;\n\nprocedure nhap;\nvar i:longint;\nbegin\n readln(n);\n for i:=1 to n do\n readln(a[i]);\nend;\n\nprocedure xuli;\nvar x:longint;\nbegin\n x:=a[1];\n repeat\n x:=a[x];\n inc(res);\n if x=2 then\n begin\n writeln(res+1);\n halt;\n end;\n until res>n;\nend;\nprocedure xuat;\nbegin\n writeln(-1);\n\nend;\n\nbegin\n nhap;\n xuli;\n xuat;\nend.\n", "language": "Pascal", "metadata": {"date": 1498353559, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03680.html", "problem_id": "p03680", "resource_group": "low_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/Pascal/s320937340.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s320937340", "user_id": "u384777851"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "const MaxN=round(1e5)+10;\nvar A:array[0..MaxN] of longint;\n n,res:longint;\n\nprocedure nhap;\nvar i:longint;\nbegin\n readln(n);\n for i:=1 to n do\n readln(a[i]);\nend;\n\nprocedure xuli;\nvar x:longint;\nbegin\n x:=a[1];\n repeat\n x:=a[x];\n inc(res);\n if x=2 then\n begin\n writeln(res+1);\n halt;\n end;\n until res>n;\nend;\nprocedure xuat;\nbegin\n writeln(-1);\n\nend;\n\nbegin\n nhap;\n xuli;\n xuat;\nend.\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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 478, "cpu_time_ms": 12, "memory_kb": 512}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s958357725", "group_id": "codeNet:p03681", "input_text": "program reconciled;\nuses math;\nconst\n md: int64 = 1000000007;\n x50000: int64 = 765302181;\n x75000: int64 = 393193551;\nvar\n n, m, x, i: int64;\nbegin\n read(n, m);\n if abs(n-m) > 1 then\n begin\n writeln(0);\n halt(0);\n end;\n if min(n, m) < 50000 then\n begin\n x := ifthen(n = m, 2, 1);\n for i := 1 to min(n, m) do\n x := ((i*i mod md)*x mod md);\n for i := min(n, m)+1 to max(n, m) do\n x := (i*x mod md);\n writeln(x);\n halt(0);\n end;\n if min(n, m) < 75000 then\n begin\n x := x50000*ifthen(n = m, 2, 1);\n for i := 50001 to min(n, m) do\n x := ((i*i mod md)*x mod md);\n for i := min(n, m)+1 to max(n, m) do\n x := (i*x mod md);\n writeln(x);\n halt(0);\n end;\n x := x75000*ifthen(n = m, 2, 1) mod md;\n for i := 75001 to min(n, m) do\n x := ((i*i mod md)*x mod md);\n for i := min(n, m)+1 to max(n, m) do\n x := (i*x mod md);\n writeln(x);\nend.", "language": "Pascal", "metadata": {"date": 1570416934, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03681.html", "problem_id": "p03681", "resource_group": "low_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/Pascal/s958357725.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s958357725", "user_id": "u506403362"}, "prompt_components": {"gold_output": "8\n", "input_to_evaluate": "program reconciled;\nuses math;\nconst\n md: int64 = 1000000007;\n x50000: int64 = 765302181;\n x75000: int64 = 393193551;\nvar\n n, m, x, i: int64;\nbegin\n read(n, m);\n if abs(n-m) > 1 then\n begin\n writeln(0);\n halt(0);\n end;\n if min(n, m) < 50000 then\n begin\n x := ifthen(n = m, 2, 1);\n for i := 1 to min(n, m) do\n x := ((i*i mod md)*x mod md);\n for i := min(n, m)+1 to max(n, m) do\n x := (i*x mod md);\n writeln(x);\n halt(0);\n end;\n if min(n, m) < 75000 then\n begin\n x := x50000*ifthen(n = m, 2, 1);\n for i := 50001 to min(n, m) do\n x := ((i*i mod md)*x mod md);\n for i := min(n, m)+1 to max(n, m) do\n x := (i*x mod md);\n writeln(x);\n halt(0);\n end;\n x := x75000*ifthen(n = m, 2, 1) mod md;\n for i := 75001 to min(n, m) do\n x := ((i*i mod md)*x mod md);\n for i := min(n, m)+1 to max(n, m) do\n x := (i*x mod md);\n writeln(x);\nend.", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 903, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s269322534", "group_id": "codeNet:p03681", "input_text": "program reconciled;\nuses math;\nconst\n md: int64 = 1000000007;\nvar\n n, m, x, i: int64;\nbegin\n read(n, m);\n if abs(n-m) > 1 then\n begin\n writeln(0);\n halt(0);\n end;\n x := ifthen(n = m, 2, 1);\n for i := 1 to min(n, m) do\n x := ((i*i mod md)*x mod md);\n for i := min(n, m)+1 to max(n, m) do\n x := (i*x mod md);\n writeln(x);\nend.", "language": "Pascal", "metadata": {"date": 1570416054, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03681.html", "problem_id": "p03681", "resource_group": "low_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/Pascal/s269322534.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s269322534", "user_id": "u506403362"}, "prompt_components": {"gold_output": "8\n", "input_to_evaluate": "program reconciled;\nuses math;\nconst\n md: int64 = 1000000007;\nvar\n n, m, x, i: int64;\nbegin\n read(n, m);\n if abs(n-m) > 1 then\n begin\n writeln(0);\n halt(0);\n end;\n x := ifthen(n = m, 2, 1);\n for i := 1 to min(n, m) do\n x := ((i*i mod md)*x mod md);\n for i := min(n, m)+1 to max(n, m) do\n x := (i*x mod md);\n writeln(x);\nend.", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 2, "memory_kb": 128}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s645313371", "group_id": "codeNet:p03682", "input_text": "type mang=array[0..1000005] of longint;\nvar x,y,trace,stack:mang;\n n,tong:longint;\n\n\nprocedure nhap;\nvar i:longint;\nbegin\n read(n);\n for i:=1 to n do\n read(x[i],y[i]);\n\nend;\n\nFunction Min(x,y:int64):int64;\nbegin\n if x>y then min:=y\n else min:=x;\nend;\n\n\n\nprocedure xuly;\nvar i,dem,u,v,mmin,the,j,top:longint;\nbegin\n fillchar(trace,sizeof(trace),0);\n trace[1]:=1;\n tong:=0;\n dem:=1;\n top:=1;\n stack[top]:=1;\n\n while demthe then\n begin\n mmin:=the;\n v:=i;\n end;\n end;\n end;\n tong:=tong+mmin;\n \n trace[v]:=1;\n inc(top);\n stack[top]:=v;\n inc(dem);\n end;\nend;\n\nprocedure xuat;\nbegin\n write(tong);\nend;\n\nbegin\n\n nhap;\n xuly;\n xuat;\n\nend.", "language": "Pascal", "metadata": {"date": 1498358093, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03682.html", "problem_id": "p03682", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03682/input.txt", "sample_output_relpath": "derived/input_output/data/p03682/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03682/Pascal/s645313371.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s645313371", "user_id": "u194998823"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "type mang=array[0..1000005] of longint;\nvar x,y,trace,stack:mang;\n n,tong:longint;\n\n\nprocedure nhap;\nvar i:longint;\nbegin\n read(n);\n for i:=1 to n do\n read(x[i],y[i]);\n\nend;\n\nFunction Min(x,y:int64):int64;\nbegin\n if x>y then min:=y\n else min:=x;\nend;\n\n\n\nprocedure xuly;\nvar i,dem,u,v,mmin,the,j,top:longint;\nbegin\n fillchar(trace,sizeof(trace),0);\n trace[1]:=1;\n tong:=0;\n dem:=1;\n top:=1;\n stack[top]:=1;\n\n while demthe then\n begin\n mmin:=the;\n v:=i;\n end;\n end;\n end;\n tong:=tong+mmin;\n \n trace[v]:=1;\n inc(top);\n stack[top]:=v;\n inc(dem);\n end;\nend;\n\nprocedure xuat;\nbegin\n write(tong);\nend;\n\nbegin\n\n nhap;\n xuly;\n xuat;\n\nend.", "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": "p03682", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 2103, "memory_kb": 10752}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s424978630", "group_id": "codeNet:p03683", "input_text": "var\n\tn,m,i:Longint;\n\tans,o:int64;\nbegin\n\tread(n,m);\n\tans:=1;\n\to:=1000000007;\n\tfor i:=1 to n do ans:=ans*i mod o;\n\tfor i:=1 to m do ans:=ans*i mod o;\n\tif n=m then ans:=ans*2 mod o else if(m2 then\n begin\n writeln(0);\n halt;\n end;\nres:=1; \nfor i:=1 to n do\n res:=(res*i) mod du;\nfor i:=1 to m do\n res:=(res*i) mod du;\nif n=m then res:=(res*2) mod du;\nwriteln(res);\nend.\n", "language": "Pascal", "metadata": {"date": 1498368478, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03683.html", "problem_id": "p03683", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03683/input.txt", "sample_output_relpath": "derived/input_output/data/p03683/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03683/Pascal/s072125995.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s072125995", "user_id": "u708671713"}, "prompt_components": {"gold_output": "8\n", "input_to_evaluate": "var du,n,m,res:int64;\n i:longint;\nbegin\ndu:=round(1e9)+7;\nreadln(n,m);\nif abs(n-m)>2 then\n begin\n writeln(0);\n halt;\n end;\nres:=1; \nfor i:=1 to n do\n res:=(res*i) mod du;\nfor i:=1 to m do\n res:=(res*i) mod du;\nif n=m then res:=(res*2) mod du;\nwriteln(res);\nend.\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nSnuke has N dogs and M monkeys. He wants them to line up in a row.\n\nAs a Japanese saying goes, these dogs and monkeys are on bad terms. (\"ken'en no naka\", literally \"the relationship of dogs and monkeys\", means a relationship of mutual hatred.) Snuke is trying to reconsile them, by arranging the animals so that there are neither two adjacent dogs nor two adjacent monkeys.\n\nHow many such arrangements there are? Find the count modulo 10^9+7 (since animals cannot understand numbers larger than that).\nHere, dogs and monkeys are both distinguishable. Also, two arrangements that result from reversing each other are distinguished.\n\nConstraints\n\n1 ≤ N,M ≤ 10^5\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\n\nOutput\n\nPrint the number of possible arrangements, modulo 10^9+7.\n\nSample Input 1\n\n2 2\n\nSample Output 1\n\n8\n\nWe will denote the dogs by A and B, and the monkeys by C and D. There are eight possible arrangements: ACBD, ADBC, BCAD, BDAC, CADB, CBDA, DACB and DBCA.\n\nSample Input 2\n\n3 2\n\nSample Output 2\n\n12\n\nSample Input 3\n\n1 8\n\nSample Output 3\n\n0\n\nSample Input 4\n\n100000 100000\n\nSample Output 4\n\n530123477", "sample_input": "2 2\n"}, "reference_outputs": ["8\n"], "source_document_id": "p03683", "source_text": "Score : 300 points\n\nProblem Statement\n\nSnuke has N dogs and M monkeys. He wants them to line up in a row.\n\nAs a Japanese saying goes, these dogs and monkeys are on bad terms. (\"ken'en no naka\", literally \"the relationship of dogs and monkeys\", means a relationship of mutual hatred.) Snuke is trying to reconsile them, by arranging the animals so that there are neither two adjacent dogs nor two adjacent monkeys.\n\nHow many such arrangements there are? Find the count modulo 10^9+7 (since animals cannot understand numbers larger than that).\nHere, dogs and monkeys are both distinguishable. Also, two arrangements that result from reversing each other are distinguished.\n\nConstraints\n\n1 ≤ N,M ≤ 10^5\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\n\nOutput\n\nPrint the number of possible arrangements, modulo 10^9+7.\n\nSample Input 1\n\n2 2\n\nSample Output 1\n\n8\n\nWe will denote the dogs by A and B, and the monkeys by C and D. There are eight possible arrangements: ACBD, ADBC, BCAD, BDAC, CADB, CBDA, DACB and DBCA.\n\nSample Input 2\n\n3 2\n\nSample Output 2\n\n12\n\nSample Input 3\n\n1 8\n\nSample Output 3\n\n0\n\nSample Input 4\n\n100000 100000\n\nSample Output 4\n\n530123477", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 290, "cpu_time_ms": 3, "memory_kb": 128}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s175311424", "group_id": "codeNet:p03684", "input_text": "var\n i,n,m,min,r1,r2,s:longint;\n x,y,z,a,b,id,lab:array [0..10000000] of longint;\nprocedure swap(var a,b:longint);\n var\n t:longint;\n begin\n t:=a;\n a:=b;\n b:=t;\n end;\nprocedure sort(l,r: longint);\n var\n i,j,x,y: longint;\n begin\n i:=l;\n j:=r;\n x:=a[(l+r) div 2];\n repeat\n while a[i]j) then\n begin\n swap(a[i],a[j]);\n swap(b[i],b[j]);\n swap(id[i],id[j]);\n inc(i);\n j:=j-1;\n end;\n until i>j;\n if lj) then\n begin\n swap(a[i],a[j]);\n swap(b[i],b[j]);\n swap(id[i],id[j]);\n inc(i);\n j:=j-1;\n end;\n until i>j;\n if lj) then\n begin\n swap(x[i],x[j]);\n swap(y[i],y[j]);\n swap(z[i],z[j]);\n inc(i);\n j:=j-1;\n end;\n until i>j;\n if l0 do v:=lab[v];\n getroot:=v;\n end;\nprocedure union(r1,r2:longint);\n var\n x:longint;\n begin\n x:=lab[r1]+lab[r2];\n if lab[r1]>lab[r2] then\n begin\n lab[r1]:=r2;\n lab[r2]:=x;\n end\n else\n begin\n lab[r1]:=x;\n lab[r2]:=r1;\n end;\n end;\nbegin\nreadln(n);\nfor i:=1 to n do\n begin\n readln(a[i],b[i]);\n id[i]:=i;\n end;\nsort(1,n);\nfor i:=1 to n-1 do\n begin\n min:=a[i+1]-a[i];\n inc(m);\n x[m]:=id[i];\n y[m]:=id[i+1];\n z[m]:=min;\n end;\nsort1(1,n);\nfor i:=1 to n-1 do\n begin\n min:=b[i+1]-b[i];\n inc(m);\n x[m]:=id[i];\n y[m]:=id[i+1];\n z[m]:=min;\n end;\nfor i:=1 to n do\n lab[i]:=-1;\nsort2(1,m);\nfor i:=1 to m do\n begin\n r1:=getroot(x[i]);\n r2:=getroot(y[i]);\n if r1<>r2 then\n begin\n s:=s+z[i];\n union(r1,r2);\n end;\n end;\nwriteln(s);\nend.", "language": "Pascal", "metadata": {"date": 1498356292, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03684.html", "problem_id": "p03684", "resource_group": "low_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/Pascal/s175311424.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s175311424", "user_id": "u072293533"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "var\n i,n,m,min,r1,r2,s:longint;\n x,y,z,a,b,id,lab:array [0..10000000] of longint;\nprocedure swap(var a,b:longint);\n var\n t:longint;\n begin\n t:=a;\n a:=b;\n b:=t;\n end;\nprocedure sort(l,r: longint);\n var\n i,j,x,y: longint;\n begin\n i:=l;\n j:=r;\n x:=a[(l+r) div 2];\n repeat\n while a[i]j) then\n begin\n swap(a[i],a[j]);\n swap(b[i],b[j]);\n swap(id[i],id[j]);\n inc(i);\n j:=j-1;\n end;\n until i>j;\n if lj) then\n begin\n swap(a[i],a[j]);\n swap(b[i],b[j]);\n swap(id[i],id[j]);\n inc(i);\n j:=j-1;\n end;\n until i>j;\n if lj) then\n begin\n swap(x[i],x[j]);\n swap(y[i],y[j]);\n swap(z[i],z[j]);\n inc(i);\n j:=j-1;\n end;\n until i>j;\n if l0 do v:=lab[v];\n getroot:=v;\n end;\nprocedure union(r1,r2:longint);\n var\n x:longint;\n begin\n x:=lab[r1]+lab[r2];\n if lab[r1]>lab[r2] then\n begin\n lab[r1]:=r2;\n lab[r2]:=x;\n end\n else\n begin\n lab[r1]:=x;\n lab[r2]:=r1;\n end;\n end;\nbegin\nreadln(n);\nfor i:=1 to n do\n begin\n readln(a[i],b[i]);\n id[i]:=i;\n end;\nsort(1,n);\nfor i:=1 to n-1 do\n begin\n min:=a[i+1]-a[i];\n inc(m);\n x[m]:=id[i];\n y[m]:=id[i+1];\n z[m]:=min;\n end;\nsort1(1,n);\nfor i:=1 to n-1 do\n begin\n min:=b[i+1]-b[i];\n inc(m);\n x[m]:=id[i];\n y[m]:=id[i+1];\n z[m]:=min;\n end;\nfor i:=1 to n do\n lab[i]:=-1;\nsort2(1,m);\nfor i:=1 to m do\n begin\n r1:=getroot(x[i]);\n r2:=getroot(y[i]);\n if r1<>r2 then\n begin\n s:=s+z[i];\n union(r1,r2);\n end;\n end;\nwriteln(s);\nend.", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 3185, "cpu_time_ms": 82, "memory_kb": 13312}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s713781519", "group_id": "codeNet:p03693", "input_text": "program Project1;\n\n{$APPTYPE CONSOLE}\n\nuses\n SysUtils,Classes;\nvar\n h,w,i,j,count,x,y,m,n,c,a,b,min,r,g:Integer;\n s:array of integer;\n s1,s2,s3:string;\n sw:char;\n tf:Boolean;\n nyu:TStringList;\nbegin\n try\n { TODO -oUser -cConsole Main : ここにコードを記述してください }\n Read(r);\n Read(g);\n Readln(b);\n\n if StrToInt(IntToStr(r)+IntToStr(g)+IntToStr(b)) mod 4 = 0 then\n Writeln('YES')\n else\n Writeln('NO');\n Readln;\n except\n on E: Exception do\n Writeln(E.ClassName, ': ', E.Message);\n end;\nend.\n", "language": "Pascal", "metadata": {"date": 1516830731, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03693.html", "problem_id": "p03693", "resource_group": "low_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/Pascal/s713781519.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s713781519", "user_id": "u755925739"}, "prompt_components": {"gold_output": "YES\n", "input_to_evaluate": "program Project1;\n\n{$APPTYPE CONSOLE}\n\nuses\n SysUtils,Classes;\nvar\n h,w,i,j,count,x,y,m,n,c,a,b,min,r,g:Integer;\n s:array of integer;\n s1,s2,s3:string;\n sw:char;\n tf:Boolean;\n nyu:TStringList;\nbegin\n try\n { TODO -oUser -cConsole Main : ここにコードを記述してください }\n Read(r);\n Read(g);\n Readln(b);\n\n if StrToInt(IntToStr(r)+IntToStr(g)+IntToStr(b)) mod 4 = 0 then\n Writeln('YES')\n else\n Writeln('NO');\n Readln;\n except\n on E: Exception do\n Writeln(E.ClassName, ': ', E.Message);\n end;\nend.\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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 557, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s638101402", "group_id": "codeNet:p03694", "input_text": "var a:array[0..100000]of longint;\n n,i:longint;\nprocedure quickly_sort(var a:array of longint;l,r:longint);inline;\nvar i,j,x,y:longint;\nbegin\n while true do\n begin\n if r>1];\n repeat\n while a[i]j) then\n begin\n y:=a[i];a[i]:=a[j];\n a[j]:=y;inc(i);dec(j);\n end;\n until i>j;\n if ll then\n begin\n quickly_sort(a,l,r);\n i:=l;\n for i:=l to r do\n begin\n j:=i; \n while j>pred(l) do\n if a[j]>1];\n repeat\n while a[i]j) then\n begin\n y:=a[i];a[i]:=a[j];\n a[j]:=y;inc(i);dec(j);\n end;\n until i>j;\n if ll then\n begin\n quickly_sort(a,l,r);\n i:=l;\n for i:=l to r do\n begin\n j:=i; \n while j>pred(l) do\n if a[j]j) then\n begin\n y:=a[i];\n a[i]:=a[j];\n a[j]:=y;\n inc(i);\n j:=j-1;\n end;\n until i>j;\n if lj) then\n begin\n y:=a[i];\n a[i]:=a[j];\n a[j]:=y;\n inc(i);\n j:=j-1;\n end;\n until i>j;\n if l0 then insert(st,s,k+1);\n k:=i;\n end;\n write(s);\n //close(input);close(output);\nend.\n\n", "language": "Pascal", "metadata": {"date": 1497146634, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03696.html", "problem_id": "p03696", "resource_group": "low_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/Pascal/s493327835.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s493327835", "user_id": "u463678864"}, "prompt_components": {"gold_output": "(())\n", "input_to_evaluate": "Program Insertion;\nconst finput='Insertion.inp';\n foutput='Insertion.out';\nvar n,tmp,k,j,i:longint;\n s,st:string;\nbegin\n //assign(input,finput);reset(input);\n //assign(output,foutput);rewrite(output);\n readln(n);\n readln(s);\n st:='(';\n for i:=1 to length(s) do\n if s[i]=')' then\n begin\n j:=i;\n tmp:=0;\n repeat\n case s[j] of\n ')':dec(tmp);\n '(':inc(tmp);\n end;\n dec(j);\n until (j=k)or(tmp=0);\n if tmp<>0 then insert(st,s,k+1);\n k:=i;\n end;\n write(s);\n //close(input);close(output);\nend.\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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 1, "memory_kb": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s169877736", "group_id": "codeNet:p03697", "input_text": "program Project1;\n\n{$APPTYPE CONSOLE}\n\nuses\n SysUtils,Classes;\nvar\n h,w,i,j,count,x,y,sw,m,n,c,a,b:Integer;\n //a:array of string;\n s123,s1,s2,s3:string;\n tf:Boolean;\n nyu:TStringList;\nbegin\n try\n { TODO -oUser -cConsole Main : ここにコードを記述してください }\n Read(a);\n Readln(b);\n\n if a+b>=10 then\n Writeln('error')\n else\n Writeln(a+b);\n Readln;\n except\n on E: Exception do\n Writeln(E.ClassName, ': ', E.Message);\n end;\nend.\n", "language": "Pascal", "metadata": {"date": 1516825205, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03697.html", "problem_id": "p03697", "resource_group": "low_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/Pascal/s169877736.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s169877736", "user_id": "u755925739"}, "prompt_components": {"gold_output": "9\n", "input_to_evaluate": "program Project1;\n\n{$APPTYPE CONSOLE}\n\nuses\n SysUtils,Classes;\nvar\n h,w,i,j,count,x,y,sw,m,n,c,a,b:Integer;\n //a:array of string;\n s123,s1,s2,s3:string;\n tf:Boolean;\n nyu:TStringList;\nbegin\n try\n { TODO -oUser -cConsole Main : ここにコードを記述してください }\n Read(a);\n Readln(b);\n\n if a+b>=10 then\n Writeln('error')\n else\n Writeln(a+b);\n Readln;\n except\n on E: Exception do\n Writeln(E.ClassName, ': ', E.Message);\n end;\nend.\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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 1, "memory_kb": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s421983564", "group_id": "codeNet:p03698", "input_text": "program Project1;\n\n{$APPTYPE CONSOLE}\n\nuses\n SysUtils,Classes;\nvar\n h,w,i,j,count,x,y,m,n,c,a,b,min:Integer;\n //a:array of string;\n s,s1,s2,s3:string;\n sw:char;\n tf:Boolean;\n nyu:TStringList;\nbegin\n try\n { TODO -oUser -cConsole Main : ここにコードを記述してください }\n Readln(s);\n\n for i := 1 to Length(s) do begin\n min := i;\n for j := i+1 to Length(s) do begin\n if s[j] < s[min] then\n min := j;\n end;\n sw:=s[i];\n s[i]:=s[min];\n s[min]:=sw;\n end;\n\n for i := 1 to Length(s) - 1 do\n if s[i]=s[i+1] then begin\n Writeln('no');\n Readln;\n exit;\n end;\n\n Writeln('yes');\n Readln;\n except\n on E: Exception do\n Writeln(E.ClassName, ': ', E.Message);\n end;\nend.\n", "language": "Pascal", "metadata": {"date": 1516826686, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03698.html", "problem_id": "p03698", "resource_group": "low_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/Pascal/s421983564.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s421983564", "user_id": "u755925739"}, "prompt_components": {"gold_output": "yes\n", "input_to_evaluate": "program Project1;\n\n{$APPTYPE CONSOLE}\n\nuses\n SysUtils,Classes;\nvar\n h,w,i,j,count,x,y,m,n,c,a,b,min:Integer;\n //a:array of string;\n s,s1,s2,s3:string;\n sw:char;\n tf:Boolean;\n nyu:TStringList;\nbegin\n try\n { TODO -oUser -cConsole Main : ここにコードを記述してください }\n Readln(s);\n\n for i := 1 to Length(s) do begin\n min := i;\n for j := i+1 to Length(s) do begin\n if s[j] < s[min] then\n min := j;\n end;\n sw:=s[i];\n s[i]:=s[min];\n s[min]:=sw;\n end;\n\n for i := 1 to Length(s) - 1 do\n if s[i]=s[i+1] then begin\n Writeln('no');\n Readln;\n exit;\n end;\n\n Writeln('yes');\n Readln;\n except\n on E: Exception do\n Writeln(E.ClassName, ': ', E.Message);\n end;\nend.\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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 780, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s241242117", "group_id": "codeNet:p03699", "input_text": "program ec12;\nvar \n\tn,m,i,j,sum:longint;\n\tt:array[0..101] of longint;\n\ta:array[1..101] of longint;\nbegin \n\tfillchar(t,sizeof(t),0);\n\treadln(n);\n\tsum:=0;\n\tfor i:=1 to n do\n\tbegin \n\t\treadln(a[i]);\n\t\tinc(t[a[i]]);\n\t\tsum:=sum+a[i];\n\tend;\n\tif sum mod 10>0 then \n\tbegin \n\t\twriteln(sum);\n\t\thalt;\n\tend;\n\tfor i:=1 to 100 do \n\tbegin \n\t\tif (t[i]>0) and (i mod 10>0) then \n\t\tbegin \n\t\t\twriteln(sum-i);\n\t\t\thalt;\n\t\tend;\n\tend;\n\twriteln(0);\nend. ", "language": "Pascal", "metadata": {"date": 1509820895, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03699.html", "problem_id": "p03699", "resource_group": "low_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/Pascal/s241242117.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s241242117", "user_id": "u816631826"}, "prompt_components": {"gold_output": "25\n", "input_to_evaluate": "program ec12;\nvar \n\tn,m,i,j,sum:longint;\n\tt:array[0..101] of longint;\n\ta:array[1..101] of longint;\nbegin \n\tfillchar(t,sizeof(t),0);\n\treadln(n);\n\tsum:=0;\n\tfor i:=1 to n do\n\tbegin \n\t\treadln(a[i]);\n\t\tinc(t[a[i]]);\n\t\tsum:=sum+a[i];\n\tend;\n\tif sum mod 10>0 then \n\tbegin \n\t\twriteln(sum);\n\t\thalt;\n\tend;\n\tfor i:=1 to 100 do \n\tbegin \n\t\tif (t[i]>0) and (i mod 10>0) then \n\t\tbegin \n\t\t\twriteln(sum-i);\n\t\t\thalt;\n\t\tend;\n\tend;\n\twriteln(0);\nend. ", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 429, "cpu_time_ms": 2, "memory_kb": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s864267623", "group_id": "codeNet:p03700", "input_text": "var\n n: integer;\n a: integer;\n b: integer;\n h: array of integer;\n i: integer;\n l: integer;\n r: integer;\n m: integer;\n diff: integer;\n cnt: int64;\nbegin\n readln(n, a, b);\n setlength(h, n);\n for i := 0 to n - 1 do begin\n readln(h[i]);\n end;\n l := 0;\n r := 1000000000;\n while r - l > 1 do begin\n cnt := 0;\n m := (r + l) div 2;\n for i := 0 to n - 1 do begin\n diff := h[i] - (b * m);\n if diff > 0 then begin\n cnt := cnt + (diff div (a - b));\n if diff mod (a - b) > 0 then begin\n inc(cnt);\n end;\n end;\n end;\n if cnt > m then begin\n l := m;\n end\n else begin\n r := m;\n end;\n end;\n writeln(r);\nend.", "language": "Pascal", "metadata": {"date": 1504544996, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03700.html", "problem_id": "p03700", "resource_group": "low_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/Pascal/s864267623.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s864267623", "user_id": "u379319063"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "var\n n: integer;\n a: integer;\n b: integer;\n h: array of integer;\n i: integer;\n l: integer;\n r: integer;\n m: integer;\n diff: integer;\n cnt: int64;\nbegin\n readln(n, a, b);\n setlength(h, n);\n for i := 0 to n - 1 do begin\n readln(h[i]);\n end;\n l := 0;\n r := 1000000000;\n while r - l > 1 do begin\n cnt := 0;\n m := (r + l) div 2;\n for i := 0 to n - 1 do begin\n diff := h[i] - (b * m);\n if diff > 0 then begin\n cnt := cnt + (diff div (a - b));\n if diff mod (a - b) > 0 then begin\n inc(cnt);\n end;\n end;\n end;\n if cnt > m then begin\n l := m;\n end\n else begin\n r := m;\n end;\n end;\n writeln(r);\nend.", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 759, "cpu_time_ms": 82, "memory_kb": 512}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s135741955", "group_id": "codeNet:p03702", "input_text": "program j01;\nconst maxn=100086;\nvar h:array[0..maxn]of int64;\n n,i:longint;\n a,b,l,r,mid:int64;\n\nfunction jud(k:int64):boolean;\nvar i:longint;tmp,kk,cnt:int64;\nbegin\n cnt:=0;\n for i:=1 to n do\n begin\n tmp:=h[i]-k*b;if tmp<=0 then continue;\n kk:=tmp div a;\n if kk*a=tmp then inc(cnt,kk) else inc(cnt,kk+1);\n end;\n exit(cnt<=k);\nend;\n\nbegin\n readln(n,a,b);a:=a-b;\n for i:=1 to n do readln(h[i]);\n l:=1;r:=1000000000;\n while l 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": "p03702", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 551, "cpu_time_ms": 59, "memory_kb": 896}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s474324045", "group_id": "codeNet:p03702", "input_text": "program j01;\nconst maxn=100086;\nvar h:array[0..maxn]of int64;\n n,i:longint;\n a,b,l,r,mid:int64;\n\nfunction jud(k:int64):boolean;\nvar i:longint;tmp,kk,cnt:int64;\nbegin\n cnt:=0;\n for i:=1 to n do\n begin\n tmp:=h[i]-k*b;if tmp<=0 then continue;\n kk:=tmp div a;\n if kk=tmp then inc(cnt,kk) else inc(cnt,kk+1);\n end;\n exit(cnt<=k);\nend;\n\nbegin\n readln(n,a,b);a:=a-b;\n for i:=1 to n do readln(h[i]);\n l:=1;r:=1000000000;\n while l 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": "p03702", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 573, "cpu_time_ms": 59, "memory_kb": 896}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s643599269", "group_id": "codeNet:p03703", "input_text": "program j01;\nconst maxn=200086;\ntype opr=record w:int64;id:longint;end;\nvar a,sum:array[0..maxn]of int64;\n op:array[0..maxn]of opr;\n tot:longint;\n ans:int64;\n c:array[0..maxn]of longint;\n n,i,k:longint;\n\nprocedure sort(l,r:longint);\nvar i,j,x:longint;y:opr;\nbegin\n i:=l;j:=r;x:=op[(i+j)div 2].w;\n repeat\n while op[i].wj;\n if iop[i-1].w then inc(tot);\n a[op[i].id]:=tot;\n end;\nend;\n\nprocedure ins(i:longint);\nbegin\n while i<=tot do\n begin\n inc(c[i]);inc(i,i and(-i));\n end;\nend;\n\nfunction ask(i:longint):longint;\nvar res:longint;\nbegin\n res:=0;\n while i>0 do\n begin\n inc(res,c[i]);dec(i,i and(-i));\n end;\n exit(res);\nend;\n\nbegin\n readln(n,k);\n for i:=1 to n do read(a[i]);\n for i:=1 to n do a[i]:=a[i]-k;\n sum[1]:=0;inc(n);for i:=2 to n do sum[i]:=sum[i-1]+a[i-1];\n for i:=1 to n do\n begin\n op[i].w:=sum[i];op[i].id:=i;\n end;\n //for i:=1 to n do write(sum[i],' ');writeln;\n disc;\n for i:=1 to n do\n begin\n inc(ans,ask(a[i]));ins(a[i]);\n end;\n writeln(ans);\nend.\n", "language": "Pascal", "metadata": {"date": 1496540262, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03703.html", "problem_id": "p03703", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03703/input.txt", "sample_output_relpath": "derived/input_output/data/p03703/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03703/Pascal/s643599269.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s643599269", "user_id": "u550756195"}, "prompt_components": {"gold_output": "5\n", "input_to_evaluate": "program j01;\nconst maxn=200086;\ntype opr=record w:int64;id:longint;end;\nvar a,sum:array[0..maxn]of int64;\n op:array[0..maxn]of opr;\n tot:longint;\n ans:int64;\n c:array[0..maxn]of longint;\n n,i,k:longint;\n\nprocedure sort(l,r:longint);\nvar i,j,x:longint;y:opr;\nbegin\n i:=l;j:=r;x:=op[(i+j)div 2].w;\n repeat\n while op[i].wj;\n if iop[i-1].w then inc(tot);\n a[op[i].id]:=tot;\n end;\nend;\n\nprocedure ins(i:longint);\nbegin\n while i<=tot do\n begin\n inc(c[i]);inc(i,i and(-i));\n end;\nend;\n\nfunction ask(i:longint):longint;\nvar res:longint;\nbegin\n res:=0;\n while i>0 do\n begin\n inc(res,c[i]);dec(i,i and(-i));\n end;\n exit(res);\nend;\n\nbegin\n readln(n,k);\n for i:=1 to n do read(a[i]);\n for i:=1 to n do a[i]:=a[i]-k;\n sum[1]:=0;inc(n);for i:=2 to n do sum[i]:=sum[i-1]+a[i-1];\n for i:=1 to n do\n begin\n op[i].w:=sum[i];op[i].id:=i;\n end;\n //for i:=1 to n do write(sum[i],' ');writeln;\n disc;\n for i:=1 to n do\n begin\n inc(ans,ask(a[i]));ins(a[i]);\n end;\n writeln(ans);\nend.\n", "problem_context": "Score : 600 points\n\nProblem Statement\n\nYou are given an integer sequence of length N, a = {a_1, a_2, …, a_N}, and an integer K.\n\na has N(N+1)/2 non-empty contiguous subsequences, {a_l, a_{l+1}, …, a_r} (1 ≤ l ≤ r ≤ N). Among them, how many have an arithmetic mean that is greater than or equal to K?\n\nConstraints\n\nAll input values are integers.\n\n1 ≤ N ≤ 2 \\times 10^5\n\n1 ≤ K ≤ 10^9\n\n1 ≤ a_i ≤ 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\na_1\na_2\n:\na_N\n\nOutput\n\nPrint the number of the non-empty contiguous subsequences with an arithmetic mean that is greater than or equal to K.\n\nSample Input 1\n\n3 6\n7\n5\n7\n\nSample Output 1\n\n5\n\nAll the non-empty contiguous subsequences of a are listed below:\n\n{a_1} = {7}\n\n{a_1, a_2} = {7, 5}\n\n{a_1, a_2, a_3} = {7, 5, 7}\n\n{a_2} = {5}\n\n{a_2, a_3} = {5, 7}\n\n{a_3} = {7}\n\nTheir means are 7, 6, 19/3, 5, 6 and 7, respectively, and five among them are 6 or greater. Note that {a_1} and {a_3} are indistinguishable by the values of their elements, but we count them individually.\n\nSample Input 2\n\n1 2\n1\n\nSample Output 2\n\n0\n\nSample Input 3\n\n7 26\n10\n20\n30\n40\n30\n20\n10\n\nSample Output 3\n\n13", "sample_input": "3 6\n7\n5\n7\n"}, "reference_outputs": ["5\n"], "source_document_id": "p03703", "source_text": "Score : 600 points\n\nProblem Statement\n\nYou are given an integer sequence of length N, a = {a_1, a_2, …, a_N}, and an integer K.\n\na has N(N+1)/2 non-empty contiguous subsequences, {a_l, a_{l+1}, …, a_r} (1 ≤ l ≤ r ≤ N). Among them, how many have an arithmetic mean that is greater than or equal to K?\n\nConstraints\n\nAll input values are integers.\n\n1 ≤ N ≤ 2 \\times 10^5\n\n1 ≤ K ≤ 10^9\n\n1 ≤ a_i ≤ 10^9\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN K\na_1\na_2\n:\na_N\n\nOutput\n\nPrint the number of the non-empty contiguous subsequences with an arithmetic mean that is greater than or equal to K.\n\nSample Input 1\n\n3 6\n7\n5\n7\n\nSample Output 1\n\n5\n\nAll the non-empty contiguous subsequences of a are listed below:\n\n{a_1} = {7}\n\n{a_1, a_2} = {7, 5}\n\n{a_1, a_2, a_3} = {7, 5, 7}\n\n{a_2} = {5}\n\n{a_2, a_3} = {5, 7}\n\n{a_3} = {7}\n\nTheir means are 7, 6, 19/3, 5, 6 and 7, respectively, and five among them are 6 or greater. Note that {a_1} and {a_3} are indistinguishable by the values of their elements, but we count them individually.\n\nSample Input 2\n\n1 2\n1\n\nSample Output 2\n\n0\n\nSample Input 3\n\n7 26\n10\n20\n30\n40\n30\n20\n10\n\nSample Output 3\n\n13", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1337, "cpu_time_ms": 2116, "memory_kb": 268416}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s288180232", "group_id": "codeNet:p03711", "input_text": "program Project1;\n\n{$APPTYPE CONSOLE}\n\nuses\n SysUtils,Classes;\nvar\n h,w,i,j,count,x,y,sw,m,n,c:Integer;\n a:array[0..12] of Integer = (0,1,3,1,2,1,2,1,1,2,1,2,1);\n s123,s1,s2,s3:string;\n tf:Boolean;\n nyu:TStringList;\nbegin\n try\n { TODO -oUser -cConsole Main : ここにコードを記述してください }\n Read(x);\n Readln(y);\n\n if a[x]=a[y] then\n Writeln('Yes')\n else\n Writeln('No');\n Readln;\n except\n on E: Exception do\n Writeln(E.ClassName, ': ', E.Message);\n end;\nend.\n", "language": "Pascal", "metadata": {"date": 1516818147, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03711.html", "problem_id": "p03711", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03711/input.txt", "sample_output_relpath": "derived/input_output/data/p03711/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03711/Pascal/s288180232.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s288180232", "user_id": "u755925739"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "program Project1;\n\n{$APPTYPE CONSOLE}\n\nuses\n SysUtils,Classes;\nvar\n h,w,i,j,count,x,y,sw,m,n,c:Integer;\n a:array[0..12] of Integer = (0,1,3,1,2,1,2,1,1,2,1,2,1);\n s123,s1,s2,s3:string;\n tf:Boolean;\n nyu:TStringList;\nbegin\n try\n { TODO -oUser -cConsole Main : ここにコードを記述してください }\n Read(x);\n Readln(y);\n\n if a[x]=a[y] then\n Writeln('Yes')\n else\n Writeln('No');\n Readln;\n except\n on E: Exception do\n Writeln(E.ClassName, ': ', E.Message);\n end;\nend.\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nBased on some criterion, Snuke divided the integers from 1 through 12 into three groups as shown in the figure below.\nGiven two integers x and y (1 ≤ x < y ≤ 12), determine whether they belong to the same group.\n\nConstraints\n\nx and y are integers.\n\n1 ≤ x < y ≤ 12\n\nInput\n\nInput is given from Standard Input in the following format:\n\nx y\n\nOutput\n\nIf x and y belong to the same group, print Yes; otherwise, print No.\n\nSample Input 1\n\n1 3\n\nSample Output 1\n\nYes\n\nSample Input 2\n\n2 4\n\nSample Output 2\n\nNo", "sample_input": "1 3\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p03711", "source_text": "Score : 100 points\n\nProblem Statement\n\nBased on some criterion, Snuke divided the integers from 1 through 12 into three groups as shown in the figure below.\nGiven two integers x and y (1 ≤ x < y ≤ 12), determine whether they belong to the same group.\n\nConstraints\n\nx and y are integers.\n\n1 ≤ x < y ≤ 12\n\nInput\n\nInput is given from Standard Input in the following format:\n\nx y\n\nOutput\n\nIf x and y belong to the same group, print Yes; otherwise, print No.\n\nSample Input 1\n\n1 3\n\nSample Output 1\n\nYes\n\nSample Input 2\n\n2 4\n\nSample Output 2\n\nNo", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 1, "memory_kb": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s394308748", "group_id": "codeNet:p03712", "input_text": "program Project1;\n\n{$APPTYPE CONSOLE}\n\nuses\n SysUtils,Classes;\nvar\n h,w,i,j,count,x,y,sw,m,n,c:Integer;\n a:array of string;\n s123,s1,s2,s3:string;\n tf:Boolean;\n nyu:TStringList;\nbegin\n try\n { TODO -oUser -cConsole Main : ここにコードを記述してください }\n Read(h);\n Readln(w);\n\n SetLength(a,h);\n\n {for i := 0 to w+1 do begin\n a[0][i]:='#';\n a[h+1][i]:='#';\n end;\n for i := 0 to h - 1 do begin\n a[i][0]:='#';\n a[i][w+1]:='#';\n end;}\n\n for i := 0 to h - 1 do\n Readln(a[i]);\n\n for i := 0 to w+1 do\n Write('#');\n Writeln;\n for i := 0 to h-1 do begin\n Write('#');\n Write(a[i]);\n Writeln('#');\n end;\n for i := 0 to w+1 do\n Write('#');\n Writeln;\n Readln;\n except\n on E: Exception do\n Writeln(E.ClassName, ': ', E.Message);\n end;\nend.\n", "language": "Pascal", "metadata": {"date": 1516824060, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03712.html", "problem_id": "p03712", "resource_group": "low_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/Pascal/s394308748.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s394308748", "user_id": "u755925739"}, "prompt_components": {"gold_output": "#####\n#abc#\n#arc#\n#####\n", "input_to_evaluate": "program Project1;\n\n{$APPTYPE CONSOLE}\n\nuses\n SysUtils,Classes;\nvar\n h,w,i,j,count,x,y,sw,m,n,c:Integer;\n a:array of string;\n s123,s1,s2,s3:string;\n tf:Boolean;\n nyu:TStringList;\nbegin\n try\n { TODO -oUser -cConsole Main : ここにコードを記述してください }\n Read(h);\n Readln(w);\n\n SetLength(a,h);\n\n {for i := 0 to w+1 do begin\n a[0][i]:='#';\n a[h+1][i]:='#';\n end;\n for i := 0 to h - 1 do begin\n a[i][0]:='#';\n a[i][w+1]:='#';\n end;}\n\n for i := 0 to h - 1 do\n Readln(a[i]);\n\n for i := 0 to w+1 do\n Write('#');\n Writeln;\n for i := 0 to h-1 do begin\n Write('#');\n Write(a[i]);\n Writeln('#');\n end;\n for i := 0 to w+1 do\n Write('#');\n Writeln;\n Readln;\n except\n on E: Exception do\n Writeln(E.ClassName, ': ', E.Message);\n end;\nend.\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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 1, "memory_kb": 320}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s475915521", "group_id": "codeNet:p03716", "input_text": "const fi ='';\n fo ='';\n\nvar n,top:longint;\n f,g:text;\n a,q,vt:array[0..300005] of longint;\n l,r:array[0..300005] of longint;\n\nprocedure nhap;\nvar i:longint;\nbegin\n assign(f,fi);reset(f);\n readln(f,n);\n for i:=1 to 3*n do\n read(f,a[i]);\n close(f);\nend;\n\nprocedure up(k :longint);\nvar v :longint;\nbegin\n v:=q[k];\n while (a[v]a[q[l1+1]]) then inc(l1);\n if a[q[l1]]>=a[v] then break;\n q[k]:=q[l1];\n vt[q[k]]:=k;\n k:=l1;\n end;\n q[k]:=v;\n vt[v]:=k;\nend;\n\nprocedure put(u :longint);\nbegin\n inc(top); q[top]:=u; vt[u]:=top;\n up(top);\nend;\n\nfunction get :longint;\nbegin\n get:=q[1]; vt[q[1]]:=round(1e9);\n q[1]:=q[top]; vt[q[1]]:=1;\n dec(top);\n down(1);\nend;\n\nprocedure up1(k :longint);\nvar v :longint;\nbegin\n v:=q[k];\n while (a[v]>a[q[k div 2]]) do\n begin\n q[k]:=q[k div 2];\n vt[q[k]]:=k;\n k:=k div 2;\n end;\n q[k]:=v;\n vt[q[k]]:=k;\nend;\n\nprocedure down1(k :longint);\nvar l1,v :longint;\nbegin\n v:=q[k];\n while 2*k<=top do\n begin\n l1:=2*k;\n if (l1a[q[1]] then\n begin\n u:=get;\n l[i]:=l[i-1]+a[i]-a[u];\n put(i);\n end else begin l[i]:=l[i-1];end;\n end;\n tong:=0;top:=0;q[0]:=3*n+1;a[3*n+1]:=round(1e9);\n for i:=3*n downto 2*n+1 do\n begin\n tong:=tong+a[i];\n put1(i);\n end;\n r[2*n+1]:=tong;\n for i:=2*n downto n+1 do\n begin\n if a[i]a[q[l1+1]]) then inc(l1);\n if a[q[l1]]>=a[v] then break;\n q[k]:=q[l1];\n vt[q[k]]:=k;\n k:=l1;\n end;\n q[k]:=v;\n vt[v]:=k;\nend;\n\nprocedure put(u :longint);\nbegin\n inc(top); q[top]:=u; vt[u]:=top;\n up(top);\nend;\n\nfunction get :longint;\nbegin\n get:=q[1]; vt[q[1]]:=round(1e9);\n q[1]:=q[top]; vt[q[1]]:=1;\n dec(top);\n down(1);\nend;\n\nprocedure up1(k :longint);\nvar v :longint;\nbegin\n v:=q[k];\n while (a[v]>a[q[k div 2]]) do\n begin\n q[k]:=q[k div 2];\n vt[q[k]]:=k;\n k:=k div 2;\n end;\n q[k]:=v;\n vt[q[k]]:=k;\nend;\n\nprocedure down1(k :longint);\nvar l1,v :longint;\nbegin\n v:=q[k];\n while 2*k<=top do\n begin\n l1:=2*k;\n if (l1a[q[1]] then\n begin\n u:=get;\n l[i]:=l[i-1]+a[i]-a[u];\n put(i);\n end else begin l[i]:=l[i-1];end;\n end;\n tong:=0;top:=0;q[0]:=3*n+1;a[3*n+1]:=round(1e9);\n for i:=3*n downto 2*n+1 do\n begin\n tong:=tong+a[i];\n put1(i);\n end;\n r[2*n+1]:=tong;\n for i:=2*n downto n+1 do\n begin\n if a[i]a[heap[j]]) then exit;\n doicho(heap[i],heap[j]);\n upheap(j);\nend;\nprocedure downheap(i:longint);\nvar j:longint;\nbegin\n j:=2*i;\n if j>nheap then exit;\n if (ja[heap[j+1]]) then inc(j);\n if a[heap[i]]>a[heap[j]] then\n begin\n doicho(heap[i],heap[j]);\n downheap(j);\n end;\nend;\nprocedure push(x:longint);\nbegin\n inc(nheap);\n heap[nheap]:=x;\n upheap(nheap);\nend;\nfunction pop:longint;\nbegin\n pop:=heap[1];\n heap[1]:=heap[nheap];\n dec(nheap);\n downheap(1);\nend;\nprocedure upheap1(i:longint);\nvar j:longint;\nbegin\n j:=i div 2;\n if (i=1) or (a[heap1[i]]nheap then exit;\n if (ja[k] then\n begin\n f[i]:=f[i-1]-a[k]+a[i];\n push(i);\n end\n else\n begin\n f[i]:=f[i-1];\n push(k);\n end;\n end;\n nheap:=0;\n for i:=3*n downto 2*n+1 do\n begin\n push1(i);\n g[i]:=g[i+1]+a[i];\n end;\n for i:=2*n downto 1 do\n begin\n k:=pop1;\n if a[i]a[heap[j]]) then exit;\n doicho(heap[i],heap[j]);\n upheap(j);\nend;\nprocedure downheap(i:longint);\nvar j:longint;\nbegin\n j:=2*i;\n if j>nheap then exit;\n if (ja[heap[j+1]]) then inc(j);\n if a[heap[i]]>a[heap[j]] then\n begin\n doicho(heap[i],heap[j]);\n downheap(j);\n end;\nend;\nprocedure push(x:longint);\nbegin\n inc(nheap);\n heap[nheap]:=x;\n upheap(nheap);\nend;\nfunction pop:longint;\nbegin\n pop:=heap[1];\n heap[1]:=heap[nheap];\n dec(nheap);\n downheap(1);\nend;\nprocedure upheap1(i:longint);\nvar j:longint;\nbegin\n j:=i div 2;\n if (i=1) or (a[heap1[i]]nheap then exit;\n if (ja[k] then\n begin\n f[i]:=f[i-1]-a[k]+a[i];\n push(i);\n end\n else\n begin\n f[i]:=f[i-1];\n push(k);\n end;\n end;\n nheap:=0;\n for i:=3*n downto 2*n+1 do\n begin\n push1(i);\n g[i]:=g[i+1]+a[i];\n end;\n for i:=2*n downto 1 do\n begin\n k:=pop1;\n if a[i]top then exit;\nif (jheap1[i div 2]) then exit;\nswap(heap1[i],heap1[i div 2]);\nupheap1(i div 2);\nEnd;\n(*===================================*)\nprocedure downheap1(i:longint);\nvar j:longint;\nBegin\nj:=i*2;\nif j>top1 then exit;\nif (jheap1[j+1]) then inc(j);\nif heap1[i]>heap1[j] then\n begin\n swap(heap1[i],heap1[j]);\n downheap1(j);\n end;\nEnd;\n(*===================================*)\nprocedure push1(x:longint);\nBegin\ninc(top1);\nheap1[top1]:=x;\nupheap1(top1);\nEnd;\n(*===================================*)\nfunction pop1:longint;\nBegin\npop1:=heap1[1];\nheap1[1]:=heap1[top1];\ndec(top1);\ndownheap1(1);\nEnd;\n(*===============================*)\nprocedure trong;\nBegin\nfor i:=1 to n do begin l[i]:=l[i-1]+a[i]; push1(a[i]); end;\nfor i:=n+1 to 3*n do\n begin\n l[i]:=l[i-1]+a[i];\n push1(a[i]);\n l[i]:=l[i]-pop1;\n end;\n\nfor i:=3*n downto 2*n+1 do begin g[i]:=g[i+1]+a[i]; push(a[i]); end;\nfor i:=2*n downto 1 do\n begin\n g[i]:=g[i+1]+a[i];\n push(a[i]);\n g[i]:=g[i]-pop;\n end;\nEnd;\n(*===============================*)\nBEGIN\ninp;\nassign(f,fo);\nrewrite(f);\ntrong;\nkq:=-maxlongint*100000;\nfor i:=n to 2*n do\n if l[i]-g[i+1]>kq then kq:=l[i]-g[i+1];\nwriteln(f,kq);\nclose(f);\nEND.", "language": "Pascal", "metadata": {"date": 1510852528, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03716.html", "problem_id": "p03716", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03716/input.txt", "sample_output_relpath": "derived/input_output/data/p03716/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03716/Pascal/s371009800.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s371009800", "user_id": "u393992397"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "const fi='';//B.inp';\n fo='';//B.out';\nvar f:text;\n i,j,n,top,top1:longint;\n kq:int64;\n heap,heap1,a,l,g:array[0..1000000] of longint;\n(*===================================*)\nprocedure inp;\nBegin\nassign(f,fi);\nreset(f);\nreadln(f,n);\nfor i:=1 to 3*n do read(f,a[i]);\nclose(f);\nEnd;\n(*===================================*)\nprocedure swap(var a,b:longint);\nvar y:longint;\nBegin\ny:=a;\na:=b;\nb:=y;\nEnd;\n(*===================================*)\nprocedure upheap(i:longint);\nBegin\nif (i=1) or (heap[i]top then exit;\nif (jheap1[i div 2]) then exit;\nswap(heap1[i],heap1[i div 2]);\nupheap1(i div 2);\nEnd;\n(*===================================*)\nprocedure downheap1(i:longint);\nvar j:longint;\nBegin\nj:=i*2;\nif j>top1 then exit;\nif (jheap1[j+1]) then inc(j);\nif heap1[i]>heap1[j] then\n begin\n swap(heap1[i],heap1[j]);\n downheap1(j);\n end;\nEnd;\n(*===================================*)\nprocedure push1(x:longint);\nBegin\ninc(top1);\nheap1[top1]:=x;\nupheap1(top1);\nEnd;\n(*===================================*)\nfunction pop1:longint;\nBegin\npop1:=heap1[1];\nheap1[1]:=heap1[top1];\ndec(top1);\ndownheap1(1);\nEnd;\n(*===============================*)\nprocedure trong;\nBegin\nfor i:=1 to n do begin l[i]:=l[i-1]+a[i]; push1(a[i]); end;\nfor i:=n+1 to 3*n do\n begin\n l[i]:=l[i-1]+a[i];\n push1(a[i]);\n l[i]:=l[i]-pop1;\n end;\n\nfor i:=3*n downto 2*n+1 do begin g[i]:=g[i+1]+a[i]; push(a[i]); end;\nfor i:=2*n downto 1 do\n begin\n g[i]:=g[i+1]+a[i];\n push(a[i]);\n g[i]:=g[i]-pop;\n end;\nEnd;\n(*===============================*)\nBEGIN\ninp;\nassign(f,fo);\nrewrite(f);\ntrong;\nkq:=-maxlongint*100000;\nfor i:=n to 2*n do\n if l[i]-g[i+1]>kq then kq:=l[i]-g[i+1];\nwriteln(f,kq);\nclose(f);\nEND.", "problem_context": "Score : 500 points\n\nProblem Statement\n\nLet N be a positive integer.\n\nThere is a numerical sequence of length 3N, a = (a_1, a_2, ..., a_{3N}).\nSnuke is constructing a new sequence of length 2N, a', by removing exactly N elements from a without changing the order of the remaining elements.\nHere, the score of a' is defined as follows: (the sum of the elements in the first half of a') - (the sum of the elements in the second half of a').\n\nFind the maximum possible score of a'.\n\nConstraints\n\n1 ≤ N ≤ 10^5\n\na_i is an integer.\n\n1 ≤ a_i ≤ 10^9\n\nPartial Score\n\nIn the test set worth 300 points, N ≤ 1000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_1 a_2 ... a_{3N}\n\nOutput\n\nPrint the maximum possible score of a'.\n\nSample Input 1\n\n2\n3 1 4 1 5 9\n\nSample Output 1\n\n1\n\nWhen a_2 and a_6 are removed, a' will be (3, 4, 1, 5), which has a score of (3 + 4) - (1 + 5) = 1.\n\nSample Input 2\n\n1\n1 2 3\n\nSample Output 2\n\n-1\n\nFor example, when a_1 are removed, a' will be (2, 3), which has a score of 2 - 3 = -1.\n\nSample Input 3\n\n3\n8 2 2 7 4 6 5 3 8\n\nSample Output 3\n\n5\n\nFor example, when a_2, a_3 and a_9 are removed, a' will be (8, 7, 4, 6, 5, 3), which has a score of (8 + 7 + 4) - (6 + 5 + 3) = 5.", "sample_input": "2\n3 1 4 1 5 9\n"}, "reference_outputs": ["1\n"], "source_document_id": "p03716", "source_text": "Score : 500 points\n\nProblem Statement\n\nLet N be a positive integer.\n\nThere is a numerical sequence of length 3N, a = (a_1, a_2, ..., a_{3N}).\nSnuke is constructing a new sequence of length 2N, a', by removing exactly N elements from a without changing the order of the remaining elements.\nHere, the score of a' is defined as follows: (the sum of the elements in the first half of a') - (the sum of the elements in the second half of a').\n\nFind the maximum possible score of a'.\n\nConstraints\n\n1 ≤ N ≤ 10^5\n\na_i is an integer.\n\n1 ≤ a_i ≤ 10^9\n\nPartial Score\n\nIn the test set worth 300 points, N ≤ 1000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN\na_1 a_2 ... a_{3N}\n\nOutput\n\nPrint the maximum possible score of a'.\n\nSample Input 1\n\n2\n3 1 4 1 5 9\n\nSample Output 1\n\n1\n\nWhen a_2 and a_6 are removed, a' will be (3, 4, 1, 5), which has a score of (3 + 4) - (1 + 5) = 1.\n\nSample Input 2\n\n1\n1 2 3\n\nSample Output 2\n\n-1\n\nFor example, when a_1 are removed, a' will be (2, 3), which has a score of 2 - 3 = -1.\n\nSample Input 3\n\n3\n8 2 2 7 4 6 5 3 8\n\nSample Output 3\n\n5\n\nFor example, when a_2, a_3 and a_9 are removed, a' will be (8, 7, 4, 6, 5, 3), which has a score of (8 + 7 + 4) - (6 + 5 + 3) = 5.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 2368, "cpu_time_ms": 130, "memory_kb": 16896}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s739373575", "group_id": "codeNet:p03716", "input_text": "const fi='';\n fo='';\n oo=trunc(1e18);\n maxn=trunc(1e5);\nvar n:longint;\n sol:int64;\n nheapmin,nheapmax:longint;\n heapmax,heapmin:array[0..2*maxn]of longint;\n a:array[0..3*maxn]of longint;\n l,r:array[0..3*maxn]of int64;\nfunction min(i,j:int64):int64; begin if ij then exit(i); exit(j); end;\nprocedure swap(var a,b:Longint);\nvar temp:longint;\nbegin\n temp:=a;\n a:=b;\n b:=temp;\nend;\nprocedure upmax(i:longint);\nbegin\n if (i=1)or(heapmax[i div 2]>=heapmax[i]) then exit\n else begin\n swap(heapmax[i],heapmax[i div 2]);\n upmax(i div 2);\n end;\nend;\nprocedure upmin(i:longint);\nbegin\n if (i=1)or(heapmin[i div 2]<=heapmin[i]) then exit\n else begin\n swap(heapmin[i div 2],heapmin[i]);\n upmin(i div 2);\n end;\nend;\nprocedure downmax(i:longint);\nvar gt:longint;\nbegin\n gt:=i*2;\n if gt>nheapmax then exit;\n if (gt+1<=nheapmax)and(heapmax[gt]=heapmax[gt] then exit;\n begin\n swap(heapmax[gt],heapmax[i]);\n downmax(gt);\n end;\nend;\nprocedure downmin(i:longint);\nvar gt:longint;\nbegin\n gt:=i*2;\n if gt>nheapmin then exit;\n if (gt+1<=nheapmin)and(heapmin[gt]>heapmin[gt+1]) then inc(gt);\n if heapmin[i]<=heapmin[gt] then exit;\n begin\n swap(heapmin[gt],heapmin[i]);\n downmin(gt);\n end;\nend;\nprocedure pushmin(x:longint);\nbegin\n inc(nheapmin);\n heapmin[nheapmin]:=x;\n upmin(nheapmin);\nend;\nprocedure pushmax(x:longint);\nbegin\n inc(nheapmax);\n heapmax[nheapmax]:=x;\n upmax(nheapmax);\nend;\nprocedure popmin(x:longint);\nbegin\n heapmin[1]:=x;\n downmin(1);\nend;\nprocedure popmax(x:longint);\nbegin\n heapmax[1]:=x;\n downmax(1);\nend;\nprocedure inp;\nvar i:longint;\nbegin\n read(n);\n for i:=1 to 3*n do read(a[i]);\nend;\nprocedure main;\nvar i,j:longint;\n res:int64;\n nmax,nmin:longint;\nbegin\n res:=0;\n for i:=1 to n do\n begin\n res:=res+a[i];\n pushmin(a[i]);\n end;\n l[n]:=res;\n for i:=n+1 to 2*n do\n begin\n if a[i]>heapmin[1] then\n begin\n res:=res-heapmin[1]+a[i];\n popmin(a[i]);\n end;\n l[i]:=res;\n end;\n res:=0;\n for i:=3*n downto 2*n+1 do\n begin\n res:=res+a[i];\n pushmax(a[i]);\n end;\n r[2*n+1]:=res;\n for i:=2*n downto n+1 do\n begin\n if a[i]j then exit(i); exit(j); end;\nprocedure swap(var a,b:Longint);\nvar temp:longint;\nbegin\n temp:=a;\n a:=b;\n b:=temp;\nend;\nprocedure upmax(i:longint);\nbegin\n if (i=1)or(heapmax[i div 2]>=heapmax[i]) then exit\n else begin\n swap(heapmax[i],heapmax[i div 2]);\n upmax(i div 2);\n end;\nend;\nprocedure upmin(i:longint);\nbegin\n if (i=1)or(heapmin[i div 2]<=heapmin[i]) then exit\n else begin\n swap(heapmin[i div 2],heapmin[i]);\n upmin(i div 2);\n end;\nend;\nprocedure downmax(i:longint);\nvar gt:longint;\nbegin\n gt:=i*2;\n if gt>nheapmax then exit;\n if (gt+1<=nheapmax)and(heapmax[gt]=heapmax[gt] then exit;\n begin\n swap(heapmax[gt],heapmax[i]);\n downmax(gt);\n end;\nend;\nprocedure downmin(i:longint);\nvar gt:longint;\nbegin\n gt:=i*2;\n if gt>nheapmin then exit;\n if (gt+1<=nheapmin)and(heapmin[gt]>heapmin[gt+1]) then inc(gt);\n if heapmin[i]<=heapmin[gt] then exit;\n begin\n swap(heapmin[gt],heapmin[i]);\n downmin(gt);\n end;\nend;\nprocedure pushmin(x:longint);\nbegin\n inc(nheapmin);\n heapmin[nheapmin]:=x;\n upmin(nheapmin);\nend;\nprocedure pushmax(x:longint);\nbegin\n inc(nheapmax);\n heapmax[nheapmax]:=x;\n upmax(nheapmax);\nend;\nprocedure popmin(x:longint);\nbegin\n heapmin[1]:=x;\n downmin(1);\nend;\nprocedure popmax(x:longint);\nbegin\n heapmax[1]:=x;\n downmax(1);\nend;\nprocedure inp;\nvar i:longint;\nbegin\n read(n);\n for i:=1 to 3*n do read(a[i]);\nend;\nprocedure main;\nvar i,j:longint;\n res:int64;\n nmax,nmin:longint;\nbegin\n res:=0;\n for i:=1 to n do\n begin\n res:=res+a[i];\n pushmin(a[i]);\n end;\n l[n]:=res;\n for i:=n+1 to 2*n do\n begin\n if a[i]>heapmin[1] then\n begin\n res:=res-heapmin[1]+a[i];\n popmin(a[i]);\n end;\n l[i]:=res;\n end;\n res:=0;\n for i:=3*n downto 2*n+1 do\n begin\n res:=res+a[i];\n pushmax(a[i]);\n end;\n r[2*n+1]:=res;\n for i:=2*n downto n+1 do\n begin\n if a[i]j) then\n begin\n k:=a[i];a[i]:=a[j];a[j]:=k;\n k:=b[i];b[i]:=b[j];b[j]:=k;\n inc(i);\n dec(j);\n end;\nuntil i>j;\nif (lj) then\n begin\n k:=a[i];a[i]:=a[j];a[j]:=k;\n k:=b[i];b[i]:=b[j];b[j]:=k;\n inc(i);\n dec(j);\n end;\nuntil i>j;\nif (ldis[u[i]]-w[i] then\n begin\n dis[v[i]]:=dis[u[i]]-w[i];\n check:=1;\n end;\n if check=0 then\n break;\n end;\n writeln(-dis[n]);\nend.", "language": "Pascal", "metadata": {"date": 1583947414, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03722.html", "problem_id": "p03722", "resource_group": "low_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/Pascal/s769457138.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s769457138", "user_id": "u743614777"}, "prompt_components": {"gold_output": "7\n", "input_to_evaluate": "var u,v,w:array[0..500000]of longint;\n dis:array[0..10000]of int64;\n n,m,s,i,j,k,check:longint;\nbegin\n readln(n,m);\n for i:=1 to m do\n readln(u[i],v[i],w[i]);\n for i:=1 to n do\n dis[i]:=2147483647;\n dis[1]:=0;\n for k:=1 to n-1 do\n begin\n check:=0;\n for i:=1 to m do\n if dis[v[i]]>dis[u[i]]-w[i] then\n begin\n dis[v[i]]:=dis[u[i]]-w[i];\n check:=1;\n end;\n if check=0 then\n break;\n end;\n writeln(-dis[n]);\nend.", "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'#' then p[i,j]:=true;\n if s[j]='S' then begin\n x[1]:=i;y[1]:=j;\n f[i,j]:=0;\n if i-1f[xx,yy]+1) then begin\n inc(t);\n x[t]:=xx+1;\n y[t]:=yy;\n ww[xx+1,yy]:=true;\n f[xx+1,yy]:=f[xx,yy]+1;\n if h-xx-1f[xx,yy]+1) then begin\n inc(t);\n x[t]:=xx-1;\n y[t]:=yy;\n ww[xx-1,yy]:=true;\n f[xx-1,yy]:=f[xx,yy]+1;\n if xx-2f[xx,yy]+1) then begin\n inc(t);\n x[t]:=xx;\n y[t]:=yy+1;\n ww[xx,yy+1]:=true;\n f[xx,yy+1]:=f[xx,yy]+1;\n if w-yy-1f[xx,yy]+1) then begin\n inc(t);\n x[t]:=xx;\n y[t]:=yy-1;\n ww[xx,yy-1]:=true;\n f[xx,yy-1]:=f[xx,yy]+1;\n if yy-20 then writeln(2+(min div k)) else writeln(1+(min div k));\nend.", "language": "Pascal", "metadata": {"date": 1503934069, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03725.html", "problem_id": "p03725", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03725/input.txt", "sample_output_relpath": "derived/input_output/data/p03725/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03725/Pascal/s190485434.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s190485434", "user_id": "u835735233"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "var h,w,k,i,j,min,hh,t,xx,yy:longint;\n s:ansistring;\n ww,p:array[0..801,0..801]of boolean;\n f:array[0..801,0..801]of longint;\n x,y:array[1..10000000]of longint;\nbegin\n readln(h,w,k);\n min:=maxlongint;\n fillchar(f,sizeof(f),$7f);\n for i:=1 to h do begin\n readln(s);\n for j:=1 to w do begin\n if s[j]<>'#' then p[i,j]:=true;\n if s[j]='S' then begin\n x[1]:=i;y[1]:=j;\n f[i,j]:=0;\n if i-1f[xx,yy]+1) then begin\n inc(t);\n x[t]:=xx+1;\n y[t]:=yy;\n ww[xx+1,yy]:=true;\n f[xx+1,yy]:=f[xx,yy]+1;\n if h-xx-1f[xx,yy]+1) then begin\n inc(t);\n x[t]:=xx-1;\n y[t]:=yy;\n ww[xx-1,yy]:=true;\n f[xx-1,yy]:=f[xx,yy]+1;\n if xx-2f[xx,yy]+1) then begin\n inc(t);\n x[t]:=xx;\n y[t]:=yy+1;\n ww[xx,yy+1]:=true;\n f[xx,yy+1]:=f[xx,yy]+1;\n if w-yy-1f[xx,yy]+1) then begin\n inc(t);\n x[t]:=xx;\n y[t]:=yy-1;\n ww[xx,yy-1]:=true;\n f[xx,yy-1]:=f[xx,yy]+1;\n if yy-20 then writeln(2+(min div k)) else writeln(1+(min div k));\nend.", "problem_context": "Score : 700 points\n\nProblem Statement\n\nTakahashi is locked within a building.\n\nThis building consists of H×W rooms, arranged in H rows and W columns.\nWe will denote the room at the i-th row and j-th column as (i,j). The state of this room is represented by a character A_{i,j}. If A_{i,j}= #, the room is locked and cannot be entered; if A_{i,j}= ., the room is not locked and can be freely entered.\nTakahashi is currently at the room where A_{i,j}= S, which can also be freely entered.\n\nEach room in the 1-st row, 1-st column, H-th row or W-th column, has an exit.\nEach of the other rooms (i,j) is connected to four rooms: (i-1,j), (i+1,j), (i,j-1) and (i,j+1).\n\nTakahashi will use his magic to get out of the building. In one cast, he can do the following:\n\nMove to an adjacent room at most K times, possibly zero. Here, locked rooms cannot be entered.\n\nThen, select and unlock at most K locked rooms, possibly zero. Those rooms will remain unlocked from then on.\n\nHis objective is to reach a room with an exit. Find the minimum necessary number of casts to do so.\n\nIt is guaranteed that Takahashi is initially at a room without an exit.\n\nConstraints\n\n3 ≤ H ≤ 800\n\n3 ≤ W ≤ 800\n\n1 ≤ K ≤ H×W\n\nEach A_{i,j} is # , . or S.\n\nThere uniquely exists (i,j) such that A_{i,j}= S, and it satisfies 2 ≤ i ≤ H-1 and 2 ≤ j ≤ W-1.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W K\nA_{1,1}A_{1,2}...A_{1,W}\n:\nA_{H,1}A_{H,2}...A_{H,W}\n\nOutput\n\nPrint the minimum necessary number of casts.\n\nSample Input 1\n\n3 3 3\n#.#\n#S.\n###\n\nSample Output 1\n\n1\n\nTakahashi can move to room (1,2) in one cast.\n\nSample Input 2\n\n3 3 3\n###\n#S#\n###\n\nSample Output 2\n\n2\n\nTakahashi cannot move in the first cast, but can unlock room (1,2).\nThen, he can move to room (1,2) in the next cast, achieving the objective in two casts.\n\nSample Input 3\n\n7 7 2\n#######\n#######\n##...##\n###S###\n##.#.##\n###.###\n#######\n\nSample Output 3\n\n2", "sample_input": "3 3 3\n#.#\n#S.\n###\n"}, "reference_outputs": ["1\n"], "source_document_id": "p03725", "source_text": "Score : 700 points\n\nProblem Statement\n\nTakahashi is locked within a building.\n\nThis building consists of H×W rooms, arranged in H rows and W columns.\nWe will denote the room at the i-th row and j-th column as (i,j). The state of this room is represented by a character A_{i,j}. If A_{i,j}= #, the room is locked and cannot be entered; if A_{i,j}= ., the room is not locked and can be freely entered.\nTakahashi is currently at the room where A_{i,j}= S, which can also be freely entered.\n\nEach room in the 1-st row, 1-st column, H-th row or W-th column, has an exit.\nEach of the other rooms (i,j) is connected to four rooms: (i-1,j), (i+1,j), (i,j-1) and (i,j+1).\n\nTakahashi will use his magic to get out of the building. In one cast, he can do the following:\n\nMove to an adjacent room at most K times, possibly zero. Here, locked rooms cannot be entered.\n\nThen, select and unlock at most K locked rooms, possibly zero. Those rooms will remain unlocked from then on.\n\nHis objective is to reach a room with an exit. Find the minimum necessary number of casts to do so.\n\nIt is guaranteed that Takahashi is initially at a room without an exit.\n\nConstraints\n\n3 ≤ H ≤ 800\n\n3 ≤ W ≤ 800\n\n1 ≤ K ≤ H×W\n\nEach A_{i,j} is # , . or S.\n\nThere uniquely exists (i,j) such that A_{i,j}= S, and it satisfies 2 ≤ i ≤ H-1 and 2 ≤ j ≤ W-1.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nH W K\nA_{1,1}A_{1,2}...A_{1,W}\n:\nA_{H,1}A_{H,2}...A_{H,W}\n\nOutput\n\nPrint the minimum necessary number of casts.\n\nSample Input 1\n\n3 3 3\n#.#\n#S.\n###\n\nSample Output 1\n\n1\n\nTakahashi can move to room (1,2) in one cast.\n\nSample Input 2\n\n3 3 3\n###\n#S#\n###\n\nSample Output 2\n\n2\n\nTakahashi cannot move in the first cast, but can unlock room (1,2).\nThen, he can move to room (1,2) in the next cast, achieving the objective in two casts.\n\nSample Input 3\n\n7 7 2\n#######\n#######\n##...##\n###S###\n##.#.##\n###.###\n#######\n\nSample Output 3\n\n2", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 2076, "cpu_time_ms": 25, "memory_kb": 14352}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s982356437", "group_id": "codeNet:p03729", "input_text": "program Project1;\n\n{$APPTYPE CONSOLE}\n\nuses\n SysUtils,Classes;\nvar\n h,w,i,j,count,x,y,sw,m,n,a,b,c:Integer;\n s123,s1,s2,s3:string;\n tf:Boolean;\n nyu:TStringList;\nbegin\n try\n { TODO -oUser -cConsole Main : ここにコードを記述してください }\n nyu:=TStringList.Create;\n Readln(s123);\n nyu.CommaText:=s123;\n\n if (nyu[0][length(nyu[0])]=nyu[1][1] )and(nyu[1][length(nyu[1])]=nyu[2][1] ) then\n Writeln('YES')\n else\n Writeln('NO');\n Readln;\n except\n on E: Exception do\n Writeln(E.ClassName, ': ', E.Message);\n end;\nend.\n", "language": "Pascal", "metadata": {"date": 1516744114, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03729.html", "problem_id": "p03729", "resource_group": "low_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/Pascal/s982356437.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s982356437", "user_id": "u755925739"}, "prompt_components": {"gold_output": "YES\n", "input_to_evaluate": "program Project1;\n\n{$APPTYPE CONSOLE}\n\nuses\n SysUtils,Classes;\nvar\n h,w,i,j,count,x,y,sw,m,n,a,b,c:Integer;\n s123,s1,s2,s3:string;\n tf:Boolean;\n nyu:TStringList;\nbegin\n try\n { TODO -oUser -cConsole Main : ここにコードを記述してください }\n nyu:=TStringList.Create;\n Readln(s123);\n nyu.CommaText:=s123;\n\n if (nyu[0][length(nyu[0])]=nyu[1][1] )and(nyu[1][length(nyu[1])]=nyu[2][1] ) then\n Writeln('YES')\n else\n Writeln('NO');\n Readln;\n except\n on E: Exception do\n Writeln(E.ClassName, ': ', E.Message);\n end;\nend.\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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 573, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s107922792", "group_id": "codeNet:p03730", "input_text": "program Project1;\n\n{$APPTYPE CONSOLE}\n\nuses\n SysUtils,Classes;\nvar\n h,w,i,j,count,x,y,sw,m,n,a,b,c:Integer;\n s123,s1,s2,s3:string;\n tf:Boolean;\n nyu:TStringList;\nbegin\n try\n { TODO -oUser -cConsole Main : ここにコードを記述してください }\n Read(a);\n Read(b);\n Readln(c);\n\n x:=a;\n while xf[j] then f[j]:=f[j-w[i]]+v[i];\n writeln(f[m]);\nend.", "language": "Pascal", "metadata": {"date": 1582426261, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03732.html", "problem_id": "p03732", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03732/input.txt", "sample_output_relpath": "derived/input_output/data/p03732/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03732/Pascal/s434409826.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s434409826", "user_id": "u723721005"}, "prompt_components": {"gold_output": "11\n", "input_to_evaluate": "var\n f:array[0..100000000] of longint;\n w,v:array[0..100000000] of longint;\n i,j,n,m:longint;\nbegin\n readln(m,n);\n for i:=1 to n do readln(w[i],v[i]);\n for i:=1 to n do\n for j:=m downto w[i] do\n if f[j-w[i]]+v[i]>f[j] then f[j]:=f[j-w[i]]+v[i];\n writeln(f[m]);\nend.", "problem_context": "Score : 400 points\n\nProblem Statement\n\nYou have N items and a bag of strength W.\nThe i-th item has a weight of w_i and a value of v_i.\n\nYou will select some of the items and put them in the bag.\nHere, the total weight of the selected items needs to be at most W.\n\nYour objective is to maximize the total value of the selected items.\n\nConstraints\n\n1 ≤ N ≤ 100\n\n1 ≤ W ≤ 10^9\n\n1 ≤ w_i ≤ 10^9\n\nFor each i = 2,3,...,N, w_1 ≤ w_i ≤ w_1 + 3.\n\n1 ≤ v_i ≤ 10^7\n\nW, each w_i and v_i are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN W\nw_1 v_1\nw_2 v_2\n:\nw_N v_N\n\nOutput\n\nPrint the maximum possible total value of the selected items.\n\nSample Input 1\n\n4 6\n2 1\n3 4\n4 10\n3 4\n\nSample Output 1\n\n11\n\nThe first and third items should be selected.\n\nSample Input 2\n\n4 6\n2 1\n3 7\n4 10\n3 6\n\nSample Output 2\n\n13\n\nThe second and fourth items should be selected.\n\nSample Input 3\n\n4 10\n1 100\n1 100\n1 100\n1 100\n\nSample Output 3\n\n400\n\nYou can take everything.\n\nSample Input 4\n\n4 1\n10 100\n10 100\n10 100\n10 100\n\nSample Output 4\n\n0\n\nYou can take nothing.", "sample_input": "4 6\n2 1\n3 4\n4 10\n3 4\n"}, "reference_outputs": ["11\n"], "source_document_id": "p03732", "source_text": "Score : 400 points\n\nProblem Statement\n\nYou have N items and a bag of strength W.\nThe i-th item has a weight of w_i and a value of v_i.\n\nYou will select some of the items and put them in the bag.\nHere, the total weight of the selected items needs to be at most W.\n\nYour objective is to maximize the total value of the selected items.\n\nConstraints\n\n1 ≤ N ≤ 100\n\n1 ≤ W ≤ 10^9\n\n1 ≤ w_i ≤ 10^9\n\nFor each i = 2,3,...,N, w_1 ≤ w_i ≤ w_1 + 3.\n\n1 ≤ v_i ≤ 10^7\n\nW, each w_i and v_i are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN W\nw_1 v_1\nw_2 v_2\n:\nw_N v_N\n\nOutput\n\nPrint the maximum possible total value of the selected items.\n\nSample Input 1\n\n4 6\n2 1\n3 4\n4 10\n3 4\n\nSample Output 1\n\n11\n\nThe first and third items should be selected.\n\nSample Input 2\n\n4 6\n2 1\n3 7\n4 10\n3 6\n\nSample Output 2\n\n13\n\nThe second and fourth items should be selected.\n\nSample Input 3\n\n4 10\n1 100\n1 100\n1 100\n1 100\n\nSample Output 3\n\n400\n\nYou can take everything.\n\nSample Input 4\n\n4 1\n10 100\n10 100\n10 100\n10 100\n\nSample Output 4\n\n0\n\nYou can take nothing.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 2103, "memory_kb": 20608}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s494156642", "group_id": "codeNet:p03733", "input_text": "var\n\tN,TX,pre,t,ans,i:Longint;\nbegin\n\tread(N,TX);\n\tfor i:=1 to N do begin\n\t\tread(t);\n\t\tif pre<=t then inc(ans,TX)else inc(ans,t+TX-pre);\n\t\tpre:=t+TX;\n\tend;\n\twriteln(ans);\nend.\n", "language": "Pascal", "metadata": {"date": 1582183337, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03733.html", "problem_id": "p03733", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03733/input.txt", "sample_output_relpath": "derived/input_output/data/p03733/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03733/Pascal/s494156642.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s494156642", "user_id": "u657913472"}, "prompt_components": {"gold_output": "7\n", "input_to_evaluate": "var\n\tN,TX,pre,t,ans,i:Longint;\nbegin\n\tread(N,TX);\n\tfor i:=1 to N do begin\n\t\tread(t);\n\t\tif pre<=t then inc(ans,TX)else inc(ans,t+TX-pre);\n\t\tpre:=t+TX;\n\tend;\n\twriteln(ans);\nend.\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": "p03733", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 176, "cpu_time_ms": 31, "memory_kb": 128}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s168783805", "group_id": "codeNet:p03734", "input_text": "Uses math;\nvar\n\tN,W,wi,w0,vi,i,j,k,l:Longint;\n\tv:array[0..3,0..100]of Longint;\n\tc:array[0..3]of Longint;\n\tans,now:int64;\nbegin\n\tread(N,W);\n\tfor i:=1 to N do begin\n\t\tread(wi,vi);\n\t\tif i=1 then w0:=wi;\n\t\tinc(c[wi-w0]);\n\t\tv[wi-w0,c[wi-w0]]:=vi;\n\tend;\n\tfor i:=0 to 3 do begin\n\t\tfor j:=1 to c[i] do begin\n\t\t\tfor k:=j+1 to c[i] do begin\n\t\t\t\tif v[i,j]0 then inc(now,w0);\n\t\tif now>W then break;\n\t\tfor j:=0 to c[1] do begin\n\t\t\tif j>0 then inc(now,w0+1);\n\t\t\tif now>W then break;\n\t\t\tfor k:=0 to c[2] do begin\n\t\t\t\tif k>0 then inc(now,w0+2);\n\t\t\t\tif now>W then break;\n\t\t\t\tfor l:=0 to c[3] do begin\n\t\t\t\t\tif l>0 then inc(now,w0+3);\n\t\t\t\t\tif now<=W then begin\n\t\t\t\t\t\tans:=max(ans,v[0,i]+v[1,j]+v[2,k]+v[3,l]);\n\t\t\t\t\tend;\n\t\t\t\tend;\n\t\t\t\tdec(now,(w0+3)*c[3]);\n\t\t\tend;\n\t\t\tdec(now,(w0+2)*c[2]);\n\t\tend;\n\t\tdec(now,(w0+1)*c[1]);\n\tend;\n\twriteln(ans);\nend.", "language": "Pascal", "metadata": {"date": 1542718083, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03734.html", "problem_id": "p03734", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03734/input.txt", "sample_output_relpath": "derived/input_output/data/p03734/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03734/Pascal/s168783805.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s168783805", "user_id": "u657913472"}, "prompt_components": {"gold_output": "11\n", "input_to_evaluate": "Uses math;\nvar\n\tN,W,wi,w0,vi,i,j,k,l:Longint;\n\tv:array[0..3,0..100]of Longint;\n\tc:array[0..3]of Longint;\n\tans,now:int64;\nbegin\n\tread(N,W);\n\tfor i:=1 to N do begin\n\t\tread(wi,vi);\n\t\tif i=1 then w0:=wi;\n\t\tinc(c[wi-w0]);\n\t\tv[wi-w0,c[wi-w0]]:=vi;\n\tend;\n\tfor i:=0 to 3 do begin\n\t\tfor j:=1 to c[i] do begin\n\t\t\tfor k:=j+1 to c[i] do begin\n\t\t\t\tif v[i,j]0 then inc(now,w0);\n\t\tif now>W then break;\n\t\tfor j:=0 to c[1] do begin\n\t\t\tif j>0 then inc(now,w0+1);\n\t\t\tif now>W then break;\n\t\t\tfor k:=0 to c[2] do begin\n\t\t\t\tif k>0 then inc(now,w0+2);\n\t\t\t\tif now>W then break;\n\t\t\t\tfor l:=0 to c[3] do begin\n\t\t\t\t\tif l>0 then inc(now,w0+3);\n\t\t\t\t\tif now<=W then begin\n\t\t\t\t\t\tans:=max(ans,v[0,i]+v[1,j]+v[2,k]+v[3,l]);\n\t\t\t\t\tend;\n\t\t\t\tend;\n\t\t\t\tdec(now,(w0+3)*c[3]);\n\t\t\tend;\n\t\t\tdec(now,(w0+2)*c[2]);\n\t\tend;\n\t\tdec(now,(w0+1)*c[1]);\n\tend;\n\twriteln(ans);\nend.", "problem_context": "Score : 400 points\n\nProblem Statement\n\nYou have N items and a bag of strength W.\nThe i-th item has a weight of w_i and a value of v_i.\n\nYou will select some of the items and put them in the bag.\nHere, the total weight of the selected items needs to be at most W.\n\nYour objective is to maximize the total value of the selected items.\n\nConstraints\n\n1 ≤ N ≤ 100\n\n1 ≤ W ≤ 10^9\n\n1 ≤ w_i ≤ 10^9\n\nFor each i = 2,3,...,N, w_1 ≤ w_i ≤ w_1 + 3.\n\n1 ≤ v_i ≤ 10^7\n\nW, each w_i and v_i are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN W\nw_1 v_1\nw_2 v_2\n:\nw_N v_N\n\nOutput\n\nPrint the maximum possible total value of the selected items.\n\nSample Input 1\n\n4 6\n2 1\n3 4\n4 10\n3 4\n\nSample Output 1\n\n11\n\nThe first and third items should be selected.\n\nSample Input 2\n\n4 6\n2 1\n3 7\n4 10\n3 6\n\nSample Output 2\n\n13\n\nThe second and fourth items should be selected.\n\nSample Input 3\n\n4 10\n1 100\n1 100\n1 100\n1 100\n\nSample Output 3\n\n400\n\nYou can take everything.\n\nSample Input 4\n\n4 1\n10 100\n10 100\n10 100\n10 100\n\nSample Output 4\n\n0\n\nYou can take nothing.", "sample_input": "4 6\n2 1\n3 4\n4 10\n3 4\n"}, "reference_outputs": ["11\n"], "source_document_id": "p03734", "source_text": "Score : 400 points\n\nProblem Statement\n\nYou have N items and a bag of strength W.\nThe i-th item has a weight of w_i and a value of v_i.\n\nYou will select some of the items and put them in the bag.\nHere, the total weight of the selected items needs to be at most W.\n\nYour objective is to maximize the total value of the selected items.\n\nConstraints\n\n1 ≤ N ≤ 100\n\n1 ≤ W ≤ 10^9\n\n1 ≤ w_i ≤ 10^9\n\nFor each i = 2,3,...,N, w_1 ≤ w_i ≤ w_1 + 3.\n\n1 ≤ v_i ≤ 10^7\n\nW, each w_i and v_i are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN W\nw_1 v_1\nw_2 v_2\n:\nw_N v_N\n\nOutput\n\nPrint the maximum possible total value of the selected items.\n\nSample Input 1\n\n4 6\n2 1\n3 4\n4 10\n3 4\n\nSample Output 1\n\n11\n\nThe first and third items should be selected.\n\nSample Input 2\n\n4 6\n2 1\n3 7\n4 10\n3 6\n\nSample Output 2\n\n13\n\nThe second and fourth items should be selected.\n\nSample Input 3\n\n4 10\n1 100\n1 100\n1 100\n1 100\n\nSample Output 3\n\n400\n\nYou can take everything.\n\nSample Input 4\n\n4 1\n10 100\n10 100\n10 100\n10 100\n\nSample Output 4\n\n0\n\nYou can take nothing.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1035, "cpu_time_ms": 2, "memory_kb": 128}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s673466341", "group_id": "codeNet:p03737", "input_text": "program Project1;\n\n{$APPTYPE CONSOLE}\n\nuses\n SysUtils,Classes;\nvar\n h,w,i,j,count,x,y,sw,m,n,a,b:Integer;\n s123,s1,s2,s3:string;\n tf:Boolean;\n nyu:TStringList;\nbegin\n try\n { TODO -oUser -cConsole Main : ここにコードを記述してください }\n nyu:=TStringList.Create;\n Readln(s123);\n s123:=UpperCase(s123);\n nyu.CommaText:=s123;\n\n Writeln(nyu[0][1]+nyu[1][1]+nyu[2][1]);\n Readln;\n except\n on E: Exception do\n Writeln(E.ClassName, ': ', E.Message);\n end;\nend.\n", "language": "Pascal", "metadata": {"date": 1516731262, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03737.html", "problem_id": "p03737", "resource_group": "low_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/Pascal/s673466341.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s673466341", "user_id": "u755925739"}, "prompt_components": {"gold_output": "ABC\n", "input_to_evaluate": "program Project1;\n\n{$APPTYPE CONSOLE}\n\nuses\n SysUtils,Classes;\nvar\n h,w,i,j,count,x,y,sw,m,n,a,b:Integer;\n s123,s1,s2,s3:string;\n tf:Boolean;\n nyu:TStringList;\nbegin\n try\n { TODO -oUser -cConsole Main : ここにコードを記述してください }\n nyu:=TStringList.Create;\n Readln(s123);\n s123:=UpperCase(s123);\n nyu.CommaText:=s123;\n\n Writeln(nyu[0][1]+nyu[1][1]+nyu[2][1]);\n Readln;\n except\n on E: Exception do\n Writeln(E.ClassName, ': ', E.Message);\n end;\nend.\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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s892185896", "group_id": "codeNet:p03738", "input_text": "var\na,b :comp;\nbegin\nreadln(a);\nread(b);\n\nif(a>b) then begin\nwrite('GREATER');\nend\nelse if(a=b) then begin\nwrite('EQUAL');\nend\nelse begin\nwrite('LESS');\nend;\n\n\nend.", "language": "Pascal", "metadata": {"date": 1509793202, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03738.html", "problem_id": "p03738", "resource_group": "low_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/Pascal/s892185896.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s892185896", "user_id": "u136725765"}, "prompt_components": {"gold_output": "GREATER\n", "input_to_evaluate": "var\na,b :comp;\nbegin\nreadln(a);\nread(b);\n\nif(a>b) then begin\nwrite('GREATER');\nend\nelse if(a=b) then begin\nwrite('EQUAL');\nend\nelse begin\nwrite('LESS');\nend;\n\n\nend.", "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 A24, 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 A24, 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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 2, "memory_kb": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s587679494", "group_id": "codeNet:p03739", "input_text": "program ec12;\nvar \n\ta,s:array[0..100000] of longint;\n\tn,m,i,j,ans:longint;\nbegin \t\n\treadln(n);\n\tans:=0;\n\ts[0]:=0;\n\tfor i:=1 to n do\n\tread(a[i]);\n\tfor i:=1 to n do \n\tbegin \n\t\ts[i]:=s[i-1]+a[i];\n\t\tif i>1 then \n\t\tbegin \n\t\t\tif s[i-1]<0 then \n\t\t\tbegin\t\n\t\t\t\tif s[i]<=0 then \n\t\t\t\tbegin\n\t\t\t\t\tif s[i]=0 then \n\t\t\t\t\tbegin \n\t\t\t\t\t\tinc(ans);\n\t\t\t\t\t\ts[i]:=1;\n\t\t\t\t\tend\n\t\t\t\t\telse\n\t\t\t\t\tinc(ans,(-s[i])+1);\n\t\t\t\tend;\n\t\t\tend\n\t\t\telse\n\t\t\tbegin \n\t\t\t\tif s[i]>=0 then \n\t\t\t\tbegin \n\t\t\t\t\tif s[i]=0 then \n\t\t\t\t\tbegin \n\t\t\t\t\t\tinc(ans);\n\t\t\t\t\t\ts[i]:=-1;\n\t\t\t\t\tend\n\t\t\t\t\telse\n\t\t\t\t\tbegin \n\t\t\t\t\t\tinc(ans,s[i]+1);\n\t\t\t\t\t\ts[i]:=-1;\n\t\t\t\t\tend;\n\t\t\t\tend;\n\t\t\tend;\n\t\tend\n\t\telse\n\t\tinc(ans,abs(a[2]-a[1])+1);\n\tend;\n\twriteln(ans);\nend. ", "language": "Pascal", "metadata": {"date": 1509852243, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03739.html", "problem_id": "p03739", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03739/input.txt", "sample_output_relpath": "derived/input_output/data/p03739/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03739/Pascal/s587679494.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s587679494", "user_id": "u662099472"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "program ec12;\nvar \n\ta,s:array[0..100000] of longint;\n\tn,m,i,j,ans:longint;\nbegin \t\n\treadln(n);\n\tans:=0;\n\ts[0]:=0;\n\tfor i:=1 to n do\n\tread(a[i]);\n\tfor i:=1 to n do \n\tbegin \n\t\ts[i]:=s[i-1]+a[i];\n\t\tif i>1 then \n\t\tbegin \n\t\t\tif s[i-1]<0 then \n\t\t\tbegin\t\n\t\t\t\tif s[i]<=0 then \n\t\t\t\tbegin\n\t\t\t\t\tif s[i]=0 then \n\t\t\t\t\tbegin \n\t\t\t\t\t\tinc(ans);\n\t\t\t\t\t\ts[i]:=1;\n\t\t\t\t\tend\n\t\t\t\t\telse\n\t\t\t\t\tinc(ans,(-s[i])+1);\n\t\t\t\tend;\n\t\t\tend\n\t\t\telse\n\t\t\tbegin \n\t\t\t\tif s[i]>=0 then \n\t\t\t\tbegin \n\t\t\t\t\tif s[i]=0 then \n\t\t\t\t\tbegin \n\t\t\t\t\t\tinc(ans);\n\t\t\t\t\t\ts[i]:=-1;\n\t\t\t\t\tend\n\t\t\t\t\telse\n\t\t\t\t\tbegin \n\t\t\t\t\t\tinc(ans,s[i]+1);\n\t\t\t\t\t\ts[i]:=-1;\n\t\t\t\t\tend;\n\t\t\t\tend;\n\t\t\tend;\n\t\tend\n\t\telse\n\t\tinc(ans,abs(a[2]-a[1])+1);\n\tend;\n\twriteln(ans);\nend. ", "problem_context": "Score : 300 points\n\nProblem Statement\n\nYou are given an integer sequence of length N. The i-th term in the sequence is a_i.\nIn one operation, you can select a term and either increment or decrement it by one.\n\nAt least how many operations are necessary to satisfy the following conditions?\n\nFor every i (1≤i≤n), the sum of the terms from the 1-st through i-th term is not zero.\n\nFor every i (1≤i≤n-1), the sign of the sum of the terms from the 1-st through i-th term, is different from the sign of the sum of the terms from the 1-st through (i+1)-th term.\n\nConstraints\n\n2 ≤ n ≤ 10^5\n\n|a_i| ≤ 10^9\n\nEach a_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 necessary count of operations.\n\nSample Input 1\n\n4\n1 -3 1 0\n\nSample Output 1\n\n4\n\nFor example, the given sequence can be transformed into 1, -2, 2, -2 by four operations. The sums of the first one, two, three and four terms are 1, -1, 1 and -1, respectively, which satisfy the conditions.\n\nSample Input 2\n\n5\n3 -6 4 -5 7\n\nSample Output 2\n\n0\n\nThe given sequence already satisfies the conditions.\n\nSample Input 3\n\n6\n-1 4 3 2 -5 4\n\nSample Output 3\n\n8", "sample_input": "4\n1 -3 1 0\n"}, "reference_outputs": ["4\n"], "source_document_id": "p03739", "source_text": "Score : 300 points\n\nProblem Statement\n\nYou are given an integer sequence of length N. The i-th term in the sequence is a_i.\nIn one operation, you can select a term and either increment or decrement it by one.\n\nAt least how many operations are necessary to satisfy the following conditions?\n\nFor every i (1≤i≤n), the sum of the terms from the 1-st through i-th term is not zero.\n\nFor every i (1≤i≤n-1), the sign of the sum of the terms from the 1-st through i-th term, is different from the sign of the sum of the terms from the 1-st through (i+1)-th term.\n\nConstraints\n\n2 ≤ n ≤ 10^5\n\n|a_i| ≤ 10^9\n\nEach a_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 necessary count of operations.\n\nSample Input 1\n\n4\n1 -3 1 0\n\nSample Output 1\n\n4\n\nFor example, the given sequence can be transformed into 1, -2, 2, -2 by four operations. The sums of the first one, two, three and four terms are 1, -1, 1 and -1, respectively, which satisfy the conditions.\n\nSample Input 2\n\n5\n3 -6 4 -5 7\n\nSample Output 2\n\n0\n\nThe given sequence already satisfies the conditions.\n\nSample Input 3\n\n6\n-1 4 3 2 -5 4\n\nSample Output 3\n\n8", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 683, "cpu_time_ms": 17, "memory_kb": 896}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s934784539", "group_id": "codeNet:p03742", "input_text": "var a,b:int64;begin read(a,b);if(a-2= 0) and (j<=n) do j:=j+1;\n end;\n writeln(r);\nend.\n", "language": "Pascal", "metadata": {"date": 1515977783, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03745.html", "problem_id": "p03745", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03745/input.txt", "sample_output_relpath": "derived/input_output/data/p03745/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03745/Pascal/s202700815.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s202700815", "user_id": "u598016178"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "var\n i,j,a1,a2,n,r:integer;\n a:array[1..100005] of integer;\nbegin\n read(n);\n r:=0;\n j:=1;\n for i:=1 to n do read(a[i]);\n while j<=n do\n begin\n r:=r+1;\n a1:=a[j];\n j:=j+1;\n while (a[j]=a1) and (j<=n) do j:=j+1;\n a2:=a[j];\n j:=j+1;\n while ((a1-a2) * (a[j-1]-a[j]) >= 0) and (j<=n) do j:=j+1;\n end;\n writeln(r);\nend.\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nYou are given an array A of length N.\nYour task is to divide it into several contiguous subarrays.\nHere, all subarrays obtained must be sorted in either non-decreasing or non-increasing order.\nAt least how many subarrays do you need to divide A into?\n\nConstraints\n\n1 \\leq N \\leq 10^5\n\n1 \\leq A_i \\leq 10^9\n\nEach A_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 subarrays after division of A.\n\nSample Input 1\n\n6\n1 2 3 2 2 1\n\nSample Output 1\n\n2\n\nOne optimal solution is to divide the array into [1,2,3] and [2,2,1].\n\nSample Input 2\n\n9\n1 2 1 2 1 2 1 2 1\n\nSample Output 2\n\n5\n\nSample Input 3\n\n7\n1 2 3 2 1 999999999 1000000000\n\nSample Output 3\n\n3", "sample_input": "6\n1 2 3 2 2 1\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03745", "source_text": "Score : 300 points\n\nProblem Statement\n\nYou are given an array A of length N.\nYour task is to divide it into several contiguous subarrays.\nHere, all subarrays obtained must be sorted in either non-decreasing or non-increasing order.\nAt least how many subarrays do you need to divide A into?\n\nConstraints\n\n1 \\leq N \\leq 10^5\n\n1 \\leq A_i \\leq 10^9\n\nEach A_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 subarrays after division of A.\n\nSample Input 1\n\n6\n1 2 3 2 2 1\n\nSample Output 1\n\n2\n\nOne optimal solution is to divide the array into [1,2,3] and [2,2,1].\n\nSample Input 2\n\n9\n1 2 1 2 1 2 1 2 1\n\nSample Output 2\n\n5\n\nSample Input 3\n\n7\n1 2 3 2 1 999999999 1000000000\n\nSample Output 3\n\n3", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 345, "cpu_time_ms": 16, "memory_kb": 512}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s578161111", "group_id": "codeNet:p03759", "input_text": "var\n a,b,c:longint;\nbegin\n readln(a,b,c);\n if abs(b-a)=abs(c-b) then writeln('YES')\n else writeln('NO');\nend.", "language": "Pascal", "metadata": {"date": 1555073735, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03759.html", "problem_id": "p03759", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03759/input.txt", "sample_output_relpath": "derived/input_output/data/p03759/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03759/Pascal/s578161111.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s578161111", "user_id": "u476418095"}, "prompt_components": {"gold_output": "YES\n", "input_to_evaluate": "var\n a,b,c:longint;\nbegin\n readln(a,b,c);\n if abs(b-a)=abs(c-b) then writeln('YES')\n else writeln('NO');\nend.", "problem_context": "Score : 100 points\n\nProblem Statement\n\nThree poles stand evenly spaced along a line. Their heights are a, b and c meters, from left to right.\nWe will call the arrangement of the poles beautiful if the tops of the poles lie on the same line, that is, b-a = c-b.\n\nDetermine whether the arrangement of the poles is beautiful.\n\nConstraints\n\n1 \\leq a,b,c \\leq 100\n\na, b and c are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na b c\n\nOutput\n\nPrint YES if the arrangement of the poles is beautiful; print NO otherwise.\n\nSample Input 1\n\n2 4 6\n\nSample Output 1\n\nYES\n\nSince 4-2 = 6-4, this arrangement of poles is beautiful.\n\nSample Input 2\n\n2 5 6\n\nSample Output 2\n\nNO\n\nSince 5-2 \\neq 6-5, this arrangement of poles is not beautiful.\n\nSample Input 3\n\n3 2 1\n\nSample Output 3\n\nYES\n\nSince 1-2 = 2-3, this arrangement of poles is beautiful.", "sample_input": "2 4 6\n"}, "reference_outputs": ["YES\n"], "source_document_id": "p03759", "source_text": "Score : 100 points\n\nProblem Statement\n\nThree poles stand evenly spaced along a line. Their heights are a, b and c meters, from left to right.\nWe will call the arrangement of the poles beautiful if the tops of the poles lie on the same line, that is, b-a = c-b.\n\nDetermine whether the arrangement of the poles is beautiful.\n\nConstraints\n\n1 \\leq a,b,c \\leq 100\n\na, b and c are integers.\n\nInput\n\nInput is given from Standard Input in the following format:\n\na b c\n\nOutput\n\nPrint YES if the arrangement of the poles is beautiful; print NO otherwise.\n\nSample Input 1\n\n2 4 6\n\nSample Output 1\n\nYES\n\nSince 4-2 = 6-4, this arrangement of poles is beautiful.\n\nSample Input 2\n\n2 5 6\n\nSample Output 2\n\nNO\n\nSince 5-2 \\neq 6-5, this arrangement of poles is not beautiful.\n\nSample Input 3\n\n3 2 1\n\nSample Output 3\n\nYES\n\nSince 1-2 = 2-3, this arrangement of poles is beautiful.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 124, "cpu_time_ms": 3, "memory_kb": 128}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s756105840", "group_id": "codeNet:p03761", "input_text": "uses math;\nvar a,f:array[0..130]of longint;\n n,i,j:longint;\n s:string;\nbegin\n readln(n);\n fillchar(f,sizeof(f),$3f);\n for i:=1 to n do\n begin\n readln(s);\n fillchar(a,sizeof(a),0);\n for j:=1 to length(s) do\n inc(a[ord(s[j])]);\n for j:=97 to 122 do\n f[j]:=min(ord(a[j]),f[j]);\n end;\n for i:=97 to 122 do\n for j:=1 to f[i] do\n write(chr(i));\nend.", "language": "Pascal", "metadata": {"date": 1581731545, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03761.html", "problem_id": "p03761", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03761/input.txt", "sample_output_relpath": "derived/input_output/data/p03761/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03761/Pascal/s756105840.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s756105840", "user_id": "u743614777"}, "prompt_components": {"gold_output": "aac\n", "input_to_evaluate": "uses math;\nvar a,f:array[0..130]of longint;\n n,i,j:longint;\n s:string;\nbegin\n readln(n);\n fillchar(f,sizeof(f),$3f);\n for i:=1 to n do\n begin\n readln(s);\n fillchar(a,sizeof(a),0);\n for j:=1 to length(s) do\n inc(a[ord(s[j])]);\n for j:=97 to 122 do\n f[j]:=min(ord(a[j]),f[j]);\n end;\n for i:=97 to 122 do\n for j:=1 to f[i] do\n write(chr(i));\nend.", "problem_context": "Score : 300 points\n\nProblem Statement\n\nSnuke loves \"paper cutting\": he cuts out characters from a newspaper headline and rearranges them to form another string.\n\nHe will receive a headline which contains one of the strings S_1,...,S_n tomorrow.\nHe is excited and already thinking of what string he will create.\nSince he does not know the string on the headline yet, he is interested in strings that can be created regardless of which string the headline contains.\n\nFind the longest string that can be created regardless of which string among S_1,...,S_n the headline contains.\nIf there are multiple such strings, find the lexicographically smallest one among them.\n\nConstraints\n\n1 \\leq n \\leq 50\n\n1 \\leq |S_i| \\leq 50 for every i = 1, ..., n.\n\nS_i consists of lowercase English letters (a - z) for every i = 1, ..., n.\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 lexicographically smallest string among the longest strings that satisfy the condition.\nIf the answer is an empty string, print an empty line.\n\nSample Input 1\n\n3\ncbaa\ndaacc\nacacac\n\nSample Output 1\n\naac\n\nThe strings that can be created from each of cbaa, daacc and acacac, are aa, aac, aca, caa and so forth.\nAmong them, aac, aca and caa are the longest, and the lexicographically smallest of these three is aac.\n\nSample Input 2\n\n3\na\naa\nb\n\nSample Output 2\n\nThe answer is an empty string.", "sample_input": "3\ncbaa\ndaacc\nacacac\n"}, "reference_outputs": ["aac\n"], "source_document_id": "p03761", "source_text": "Score : 300 points\n\nProblem Statement\n\nSnuke loves \"paper cutting\": he cuts out characters from a newspaper headline and rearranges them to form another string.\n\nHe will receive a headline which contains one of the strings S_1,...,S_n tomorrow.\nHe is excited and already thinking of what string he will create.\nSince he does not know the string on the headline yet, he is interested in strings that can be created regardless of which string the headline contains.\n\nFind the longest string that can be created regardless of which string among S_1,...,S_n the headline contains.\nIf there are multiple such strings, find the lexicographically smallest one among them.\n\nConstraints\n\n1 \\leq n \\leq 50\n\n1 \\leq |S_i| \\leq 50 for every i = 1, ..., n.\n\nS_i consists of lowercase English letters (a - z) for every i = 1, ..., n.\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 lexicographically smallest string among the longest strings that satisfy the condition.\nIf the answer is an empty string, print an empty line.\n\nSample Input 1\n\n3\ncbaa\ndaacc\nacacac\n\nSample Output 1\n\naac\n\nThe strings that can be created from each of cbaa, daacc and acacac, are aa, aac, aca, caa and so forth.\nAmong them, aac, aca and caa are the longest, and the lexicographically smallest of these three is aac.\n\nSample Input 2\n\n3\na\naa\nb\n\nSample Output 2\n\nThe answer is an empty string.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 385, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s131665189", "group_id": "codeNet:p03767", "input_text": "var n,i,x:longint;\n s:int64;\n a:array[0..300003] of longint;\n fi,fo:text;\nprocedure start;\nbegin\n assign(fi,''); reset(fi);\n assign(fo,''); rewrite(fo);\n readln(fi,n);\n n:= 3*n;\n for i:= 1 to n do read(fi,a[i]);\nend;\nprocedure sort(l,r:longint);\nvar i,j,mid,tmp:longint;\nbegin\n i:= l; j:= r; mid:= a[(l+r)div 2];\n repeat\n while a[i]mid do dec(j);\n if i<=j then\n begin\n tmp:= a[i]; a[i]:= a[j]; a[j]:= tmp;\n inc(i); dec(j);\n end;\n until i>j;\n if lmid do dec(j);\n if i<=j then\n begin\n tmp:= a[i]; a[i]:= a[j]; a[j]:= tmp;\n inc(i); dec(j);\n end;\n until i>j;\n if l=o then exit;\n i:=first[p]; fw[p]:=o; b[p]:=true;\n if color[p]=0 then color[p]:=cl;\n while (i>=1) do begin\n if b[ed[i]]=false then\n dfs(ed[i],o-1,cl);\n i:=next[i];\n end;\n b[p]:=false;\nend;\nbegin\n readln(n,m);\n for i:=1 to m do first[i]:=-1;\n for i:=1 to m do begin readln(x,y); ad(x,y);ad(y,x); end;\n readln(q);\n for i:=1 to q do readln(v[i],d[i],c[i]);\n for i:=q downto 1 do begin dfs(v[i],d[i],c[i]); end;\n for i:=1 to n do writeln(color[i]);\nend.", "language": "Pascal", "metadata": {"date": 1499735051, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03768.html", "problem_id": "p03768", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03768/input.txt", "sample_output_relpath": "derived/input_output/data/p03768/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03768/Pascal/s308431485.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s308431485", "user_id": "u069768083"}, "prompt_components": {"gold_output": "2\n2\n2\n2\n2\n1\n0\n", "input_to_evaluate": "var i,j,k,l,m,n,q,w,x,y,t:longint;\n st,ed,first,next,d,v,color,fw,c:array[1..200000] of longint;\n b:array[1..200000]of boolean;\nprocedure ad(p,o:longint);\nbegin\n t:=t+1; ed[t]:=o; next[t]:=first[p];first[p]:=t;\nend;\nprocedure dfs(p,o,cl:longint);\nvar i,j:longint;\nbegin\n if fw[p]>=o then exit;\n i:=first[p]; fw[p]:=o; b[p]:=true;\n if color[p]=0 then color[p]:=cl;\n while (i>=1) do begin\n if b[ed[i]]=false then\n dfs(ed[i],o-1,cl);\n i:=next[i];\n end;\n b[p]:=false;\nend;\nbegin\n readln(n,m);\n for i:=1 to m do first[i]:=-1;\n for i:=1 to m do begin readln(x,y); ad(x,y);ad(y,x); end;\n readln(q);\n for i:=1 to q do readln(v[i],d[i],c[i]);\n for i:=q downto 1 do begin dfs(v[i],d[i],c[i]); end;\n for i:=1 to n do writeln(color[i]);\nend.", "problem_context": "Score : 700 points\n\nProblem Statement\n\nSquid loves painting vertices in graphs.\n\nThere is a simple undirected graph consisting of N vertices numbered 1 through N, and M edges.\nInitially, all the vertices are painted in color 0. The i-th edge bidirectionally connects two vertices a_i and b_i. The length of every edge is 1.\n\nSquid performed Q operations on this graph. In the i-th operation, he repaints all the vertices within a distance of d_i from vertex v_i, in color c_i.\n\nFind the color of each vertex after the Q operations.\n\nConstraints\n\n1 ≤ N,M,Q ≤ 10^5\n\n1 ≤ a_i,b_i,v_i ≤ N\n\na_i ≠ b_i\n\n0 ≤ d_i ≤ 10\n\n1 ≤ c_i ≤10^5\n\nd_i and c_i are all integers.\n\nThere are no self-loops or multiple edges in the given graph.\n\nPartial Score\n\n200 points will be awarded for passing the testset satisfying 1 ≤ N,M,Q ≤ 2{,}000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\na_1 b_1\n:\na_{M} b_{M}\nQ\nv_1 d_1 c_1\n:\nv_{Q} d_{Q} c_{Q}\n\nOutput\n\nPrint the answer in N lines.\nIn the i-th line, print the color of vertex i after the Q operations.\n\nSample Input 1\n\n7 7\n1 2\n1 3\n1 4\n4 5\n5 6\n5 7\n2 3\n2\n6 1 1\n1 2 2\n\nSample Output 1\n\n2\n2\n2\n2\n2\n1\n0\n\nInitially, each vertex is painted in color 0.\nIn the first operation, vertices 5 and 6 are repainted in color 1.\nIn the second operation, vertices 1, 2, 3, 4 and 5 are repainted in color 2.\n\nSample Input 2\n\n14 10\n1 4\n5 7\n7 11\n4 10\n14 7\n14 3\n6 14\n8 11\n5 13\n8 3\n8\n8 6 2\n9 7 85\n6 9 3\n6 7 5\n10 3 1\n12 9 4\n9 6 6\n8 2 3\n\nSample Output 2\n\n1\n0\n3\n1\n5\n5\n3\n3\n6\n1\n3\n4\n5\n3\n\nThe given graph may not be connected.", "sample_input": "7 7\n1 2\n1 3\n1 4\n4 5\n5 6\n5 7\n2 3\n2\n6 1 1\n1 2 2\n"}, "reference_outputs": ["2\n2\n2\n2\n2\n1\n0\n"], "source_document_id": "p03768", "source_text": "Score : 700 points\n\nProblem Statement\n\nSquid loves painting vertices in graphs.\n\nThere is a simple undirected graph consisting of N vertices numbered 1 through N, and M edges.\nInitially, all the vertices are painted in color 0. The i-th edge bidirectionally connects two vertices a_i and b_i. The length of every edge is 1.\n\nSquid performed Q operations on this graph. In the i-th operation, he repaints all the vertices within a distance of d_i from vertex v_i, in color c_i.\n\nFind the color of each vertex after the Q operations.\n\nConstraints\n\n1 ≤ N,M,Q ≤ 10^5\n\n1 ≤ a_i,b_i,v_i ≤ N\n\na_i ≠ b_i\n\n0 ≤ d_i ≤ 10\n\n1 ≤ c_i ≤10^5\n\nd_i and c_i are all integers.\n\nThere are no self-loops or multiple edges in the given graph.\n\nPartial Score\n\n200 points will be awarded for passing the testset satisfying 1 ≤ N,M,Q ≤ 2{,}000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\na_1 b_1\n:\na_{M} b_{M}\nQ\nv_1 d_1 c_1\n:\nv_{Q} d_{Q} c_{Q}\n\nOutput\n\nPrint the answer in N lines.\nIn the i-th line, print the color of vertex i after the Q operations.\n\nSample Input 1\n\n7 7\n1 2\n1 3\n1 4\n4 5\n5 6\n5 7\n2 3\n2\n6 1 1\n1 2 2\n\nSample Output 1\n\n2\n2\n2\n2\n2\n1\n0\n\nInitially, each vertex is painted in color 0.\nIn the first operation, vertices 5 and 6 are repainted in color 1.\nIn the second operation, vertices 1, 2, 3, 4 and 5 are repainted in color 2.\n\nSample Input 2\n\n14 10\n1 4\n5 7\n7 11\n4 10\n14 7\n14 3\n6 14\n8 11\n5 13\n8 3\n8\n8 6 2\n9 7 85\n6 9 3\n6 7 5\n10 3 1\n12 9 4\n9 6 6\n8 2 3\n\nSample Output 2\n\n1\n0\n3\n1\n5\n5\n3\n3\n6\n1\n3\n4\n5\n3\n\nThe given graph may not be connected.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 806, "cpu_time_ms": 86, "memory_kb": 6144}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s374449402", "group_id": "codeNet:p03768", "input_text": "var\n n,m,x,y,i,q,total:longint;\n b,p,d,v,tot,que,first,next,ans,c:array[0..200010]of longint;\n\nprocedure add(x,y:longint);\nbegin\n inc(total);\n next[total]:=first[x];\n first[x]:=total;\n b[total]:=y;\nend;\n\nprocedure bfs(k:longint);\nvar\n head,tail:longint;\n s:longint;\nbegin\n head:=1;\n tail:=1;\n que[1]:=k;\n while head<=tail do begin\n s:=first[que[head]];\n if ans[que[head]]=0 then ans[que[head]]:=c[i];\n if tot[head]>p[que[head]] then begin\n p[que[head]]:=tot[head];\n if tot[head]>0 then begin\n while s<>-1 do begin\n inc(tail);\n tot[tail]:=tot[head]-1;\n que[tail]:=b[s];\n s:=next[s];\n end;\n end;\n end;\n inc(head);\n end;\nend;\n\nbegin\n read(n,m);\n for i:=1 to n*2 do first[i]:=-1;\n for i:=1 to m do begin\n read(x,y);\n add(x,y);\n add(y,x);\n end;\n read(q);\n for i:=1 to q do read(v[i],d[i],c[i]);\n for i:=q downto 1 do begin\n if p[v[i]]>d[i] then continue;\n if (ans[v[i]]<>0)and(d[i]=0) then continue;\n tot[1]:=d[i];\n bfs(v[i]);\n end;\n for i:=1 to n do writeln(ans[i]);\nend.", "language": "Pascal", "metadata": {"date": 1499730835, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03768.html", "problem_id": "p03768", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03768/input.txt", "sample_output_relpath": "derived/input_output/data/p03768/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03768/Pascal/s374449402.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s374449402", "user_id": "u468632936"}, "prompt_components": {"gold_output": "2\n2\n2\n2\n2\n1\n0\n", "input_to_evaluate": "var\n n,m,x,y,i,q,total:longint;\n b,p,d,v,tot,que,first,next,ans,c:array[0..200010]of longint;\n\nprocedure add(x,y:longint);\nbegin\n inc(total);\n next[total]:=first[x];\n first[x]:=total;\n b[total]:=y;\nend;\n\nprocedure bfs(k:longint);\nvar\n head,tail:longint;\n s:longint;\nbegin\n head:=1;\n tail:=1;\n que[1]:=k;\n while head<=tail do begin\n s:=first[que[head]];\n if ans[que[head]]=0 then ans[que[head]]:=c[i];\n if tot[head]>p[que[head]] then begin\n p[que[head]]:=tot[head];\n if tot[head]>0 then begin\n while s<>-1 do begin\n inc(tail);\n tot[tail]:=tot[head]-1;\n que[tail]:=b[s];\n s:=next[s];\n end;\n end;\n end;\n inc(head);\n end;\nend;\n\nbegin\n read(n,m);\n for i:=1 to n*2 do first[i]:=-1;\n for i:=1 to m do begin\n read(x,y);\n add(x,y);\n add(y,x);\n end;\n read(q);\n for i:=1 to q do read(v[i],d[i],c[i]);\n for i:=q downto 1 do begin\n if p[v[i]]>d[i] then continue;\n if (ans[v[i]]<>0)and(d[i]=0) then continue;\n tot[1]:=d[i];\n bfs(v[i]);\n end;\n for i:=1 to n do writeln(ans[i]);\nend.", "problem_context": "Score : 700 points\n\nProblem Statement\n\nSquid loves painting vertices in graphs.\n\nThere is a simple undirected graph consisting of N vertices numbered 1 through N, and M edges.\nInitially, all the vertices are painted in color 0. The i-th edge bidirectionally connects two vertices a_i and b_i. The length of every edge is 1.\n\nSquid performed Q operations on this graph. In the i-th operation, he repaints all the vertices within a distance of d_i from vertex v_i, in color c_i.\n\nFind the color of each vertex after the Q operations.\n\nConstraints\n\n1 ≤ N,M,Q ≤ 10^5\n\n1 ≤ a_i,b_i,v_i ≤ N\n\na_i ≠ b_i\n\n0 ≤ d_i ≤ 10\n\n1 ≤ c_i ≤10^5\n\nd_i and c_i are all integers.\n\nThere are no self-loops or multiple edges in the given graph.\n\nPartial Score\n\n200 points will be awarded for passing the testset satisfying 1 ≤ N,M,Q ≤ 2{,}000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\na_1 b_1\n:\na_{M} b_{M}\nQ\nv_1 d_1 c_1\n:\nv_{Q} d_{Q} c_{Q}\n\nOutput\n\nPrint the answer in N lines.\nIn the i-th line, print the color of vertex i after the Q operations.\n\nSample Input 1\n\n7 7\n1 2\n1 3\n1 4\n4 5\n5 6\n5 7\n2 3\n2\n6 1 1\n1 2 2\n\nSample Output 1\n\n2\n2\n2\n2\n2\n1\n0\n\nInitially, each vertex is painted in color 0.\nIn the first operation, vertices 5 and 6 are repainted in color 1.\nIn the second operation, vertices 1, 2, 3, 4 and 5 are repainted in color 2.\n\nSample Input 2\n\n14 10\n1 4\n5 7\n7 11\n4 10\n14 7\n14 3\n6 14\n8 11\n5 13\n8 3\n8\n8 6 2\n9 7 85\n6 9 3\n6 7 5\n10 3 1\n12 9 4\n9 6 6\n8 2 3\n\nSample Output 2\n\n1\n0\n3\n1\n5\n5\n3\n3\n6\n1\n3\n4\n5\n3\n\nThe given graph may not be connected.", "sample_input": "7 7\n1 2\n1 3\n1 4\n4 5\n5 6\n5 7\n2 3\n2\n6 1 1\n1 2 2\n"}, "reference_outputs": ["2\n2\n2\n2\n2\n1\n0\n"], "source_document_id": "p03768", "source_text": "Score : 700 points\n\nProblem Statement\n\nSquid loves painting vertices in graphs.\n\nThere is a simple undirected graph consisting of N vertices numbered 1 through N, and M edges.\nInitially, all the vertices are painted in color 0. The i-th edge bidirectionally connects two vertices a_i and b_i. The length of every edge is 1.\n\nSquid performed Q operations on this graph. In the i-th operation, he repaints all the vertices within a distance of d_i from vertex v_i, in color c_i.\n\nFind the color of each vertex after the Q operations.\n\nConstraints\n\n1 ≤ N,M,Q ≤ 10^5\n\n1 ≤ a_i,b_i,v_i ≤ N\n\na_i ≠ b_i\n\n0 ≤ d_i ≤ 10\n\n1 ≤ c_i ≤10^5\n\nd_i and c_i are all integers.\n\nThere are no self-loops or multiple edges in the given graph.\n\nPartial Score\n\n200 points will be awarded for passing the testset satisfying 1 ≤ N,M,Q ≤ 2{,}000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\na_1 b_1\n:\na_{M} b_{M}\nQ\nv_1 d_1 c_1\n:\nv_{Q} d_{Q} c_{Q}\n\nOutput\n\nPrint the answer in N lines.\nIn the i-th line, print the color of vertex i after the Q operations.\n\nSample Input 1\n\n7 7\n1 2\n1 3\n1 4\n4 5\n5 6\n5 7\n2 3\n2\n6 1 1\n1 2 2\n\nSample Output 1\n\n2\n2\n2\n2\n2\n1\n0\n\nInitially, each vertex is painted in color 0.\nIn the first operation, vertices 5 and 6 are repainted in color 1.\nIn the second operation, vertices 1, 2, 3, 4 and 5 are repainted in color 2.\n\nSample Input 2\n\n14 10\n1 4\n5 7\n7 11\n4 10\n14 7\n14 3\n6 14\n8 11\n5 13\n8 3\n8\n8 6 2\n9 7 85\n6 9 3\n6 7 5\n10 3 1\n12 9 4\n9 6 6\n8 2 3\n\nSample Output 2\n\n1\n0\n3\n1\n5\n5\n3\n3\n6\n1\n3\n4\n5\n3\n\nThe given graph may not be connected.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1248, "cpu_time_ms": 80, "memory_kb": 7168}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s323441145", "group_id": "codeNet:p03768", "input_text": "var\n n,m,x,y,i,q,total:longint;\n b,p,d,v,tot,que,first,next,ans,c:array[0..200010]of longint;\n\nprocedure add(x,y:longint);\nbegin\n inc(total);\n next[total]:=first[x];\n first[x]:=total;\n b[total]:=y;\nend;\n\nprocedure bfs(k:longint);\nvar\n head,tail:longint;\n s:longint;\nbegin\n head:=1;\n tail:=1;\n que[1]:=k;\n while head<=tail do begin\n s:=first[que[head]];\n if ans[que[head]]=0 then ans[que[head]]:=c[i];\n if tot[head]>p[que[head]] then p[que[head]]:=tot[head];\n if tot[head]>0 then begin\n while s<>-1 do begin\n inc(tail);\n tot[tail]:=tot[head]-1;\n que[tail]:=b[s];\n s:=next[s];\n end;\n end;\n inc(head);\n end;\nend;\n\nbegin\n read(n,m);\n for i:=1 to n*2 do first[i]:=-1;\n for i:=1 to m do begin\n read(x,y);\n add(x,y);\n add(y,x);\n end;\n read(q);\n for i:=1 to q do read(v[i],d[i],c[i]);\n for i:=q downto 1 do begin\n if p[v[i]]>=d[i] then continue;\n if (ans[v[i]]<>0)and(d[i]=0) then continue;\n tot[1]:=d[i];\n bfs(v[i]);\n end;\n for i:=1 to n do writeln(ans[i]);\nend.\n", "language": "Pascal", "metadata": {"date": 1499730309, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03768.html", "problem_id": "p03768", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03768/input.txt", "sample_output_relpath": "derived/input_output/data/p03768/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03768/Pascal/s323441145.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s323441145", "user_id": "u468632936"}, "prompt_components": {"gold_output": "2\n2\n2\n2\n2\n1\n0\n", "input_to_evaluate": "var\n n,m,x,y,i,q,total:longint;\n b,p,d,v,tot,que,first,next,ans,c:array[0..200010]of longint;\n\nprocedure add(x,y:longint);\nbegin\n inc(total);\n next[total]:=first[x];\n first[x]:=total;\n b[total]:=y;\nend;\n\nprocedure bfs(k:longint);\nvar\n head,tail:longint;\n s:longint;\nbegin\n head:=1;\n tail:=1;\n que[1]:=k;\n while head<=tail do begin\n s:=first[que[head]];\n if ans[que[head]]=0 then ans[que[head]]:=c[i];\n if tot[head]>p[que[head]] then p[que[head]]:=tot[head];\n if tot[head]>0 then begin\n while s<>-1 do begin\n inc(tail);\n tot[tail]:=tot[head]-1;\n que[tail]:=b[s];\n s:=next[s];\n end;\n end;\n inc(head);\n end;\nend;\n\nbegin\n read(n,m);\n for i:=1 to n*2 do first[i]:=-1;\n for i:=1 to m do begin\n read(x,y);\n add(x,y);\n add(y,x);\n end;\n read(q);\n for i:=1 to q do read(v[i],d[i],c[i]);\n for i:=q downto 1 do begin\n if p[v[i]]>=d[i] then continue;\n if (ans[v[i]]<>0)and(d[i]=0) then continue;\n tot[1]:=d[i];\n bfs(v[i]);\n end;\n for i:=1 to n do writeln(ans[i]);\nend.\n", "problem_context": "Score : 700 points\n\nProblem Statement\n\nSquid loves painting vertices in graphs.\n\nThere is a simple undirected graph consisting of N vertices numbered 1 through N, and M edges.\nInitially, all the vertices are painted in color 0. The i-th edge bidirectionally connects two vertices a_i and b_i. The length of every edge is 1.\n\nSquid performed Q operations on this graph. In the i-th operation, he repaints all the vertices within a distance of d_i from vertex v_i, in color c_i.\n\nFind the color of each vertex after the Q operations.\n\nConstraints\n\n1 ≤ N,M,Q ≤ 10^5\n\n1 ≤ a_i,b_i,v_i ≤ N\n\na_i ≠ b_i\n\n0 ≤ d_i ≤ 10\n\n1 ≤ c_i ≤10^5\n\nd_i and c_i are all integers.\n\nThere are no self-loops or multiple edges in the given graph.\n\nPartial Score\n\n200 points will be awarded for passing the testset satisfying 1 ≤ N,M,Q ≤ 2{,}000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\na_1 b_1\n:\na_{M} b_{M}\nQ\nv_1 d_1 c_1\n:\nv_{Q} d_{Q} c_{Q}\n\nOutput\n\nPrint the answer in N lines.\nIn the i-th line, print the color of vertex i after the Q operations.\n\nSample Input 1\n\n7 7\n1 2\n1 3\n1 4\n4 5\n5 6\n5 7\n2 3\n2\n6 1 1\n1 2 2\n\nSample Output 1\n\n2\n2\n2\n2\n2\n1\n0\n\nInitially, each vertex is painted in color 0.\nIn the first operation, vertices 5 and 6 are repainted in color 1.\nIn the second operation, vertices 1, 2, 3, 4 and 5 are repainted in color 2.\n\nSample Input 2\n\n14 10\n1 4\n5 7\n7 11\n4 10\n14 7\n14 3\n6 14\n8 11\n5 13\n8 3\n8\n8 6 2\n9 7 85\n6 9 3\n6 7 5\n10 3 1\n12 9 4\n9 6 6\n8 2 3\n\nSample Output 2\n\n1\n0\n3\n1\n5\n5\n3\n3\n6\n1\n3\n4\n5\n3\n\nThe given graph may not be connected.", "sample_input": "7 7\n1 2\n1 3\n1 4\n4 5\n5 6\n5 7\n2 3\n2\n6 1 1\n1 2 2\n"}, "reference_outputs": ["2\n2\n2\n2\n2\n1\n0\n"], "source_document_id": "p03768", "source_text": "Score : 700 points\n\nProblem Statement\n\nSquid loves painting vertices in graphs.\n\nThere is a simple undirected graph consisting of N vertices numbered 1 through N, and M edges.\nInitially, all the vertices are painted in color 0. The i-th edge bidirectionally connects two vertices a_i and b_i. The length of every edge is 1.\n\nSquid performed Q operations on this graph. In the i-th operation, he repaints all the vertices within a distance of d_i from vertex v_i, in color c_i.\n\nFind the color of each vertex after the Q operations.\n\nConstraints\n\n1 ≤ N,M,Q ≤ 10^5\n\n1 ≤ a_i,b_i,v_i ≤ N\n\na_i ≠ b_i\n\n0 ≤ d_i ≤ 10\n\n1 ≤ c_i ≤10^5\n\nd_i and c_i are all integers.\n\nThere are no self-loops or multiple edges in the given graph.\n\nPartial Score\n\n200 points will be awarded for passing the testset satisfying 1 ≤ N,M,Q ≤ 2{,}000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\na_1 b_1\n:\na_{M} b_{M}\nQ\nv_1 d_1 c_1\n:\nv_{Q} d_{Q} c_{Q}\n\nOutput\n\nPrint the answer in N lines.\nIn the i-th line, print the color of vertex i after the Q operations.\n\nSample Input 1\n\n7 7\n1 2\n1 3\n1 4\n4 5\n5 6\n5 7\n2 3\n2\n6 1 1\n1 2 2\n\nSample Output 1\n\n2\n2\n2\n2\n2\n1\n0\n\nInitially, each vertex is painted in color 0.\nIn the first operation, vertices 5 and 6 are repainted in color 1.\nIn the second operation, vertices 1, 2, 3, 4 and 5 are repainted in color 2.\n\nSample Input 2\n\n14 10\n1 4\n5 7\n7 11\n4 10\n14 7\n14 3\n6 14\n8 11\n5 13\n8 3\n8\n8 6 2\n9 7 85\n6 9 3\n6 7 5\n10 3 1\n12 9 4\n9 6 6\n8 2 3\n\nSample Output 2\n\n1\n0\n3\n1\n5\n5\n3\n3\n6\n1\n3\n4\n5\n3\n\nThe given graph may not be connected.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1188, "cpu_time_ms": 300, "memory_kb": 7552}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s467418097", "group_id": "codeNet:p03768", "input_text": "var i,j,k,l,m,n,q,w,x,y,t:longint;\n st,ed,first,next,d,v,color,fw,c:array[1..200000] of longint;\n b:array[1..200000]of boolean;\nprocedure ad(p,o:longint);\nbegin\n t:=t+1; ed[t]:=o; next[t]:=first[p];first[p]:=t;\nend;\nprocedure dfs(p,o,cl:longint);\nvar i,j:longint;\nbegin\n if fw[p]>o then exit;\n i:=first[p]; fw[p]:=o; b[p]:=true;\n if color[p]=0 then color[p]:=cl;\n while (i>=1) do begin\n if b[ed[i]]=false then\n dfs(ed[i],o-1,cl);\n i:=next[i];\n end;\n b[p]:=false;\nend;\nbegin\n readln(n,m);\n for i:=1 to m do first[i]:=-1;\n for i:=1 to m do begin readln(x,y); ad(x,y);ad(y,x); end;\n readln(q);\n\n for i:=1 to q do readln(v[i],d[i],c[i]);\n for i:=q downto 1 do begin dfs(v[i],d[i],c[i]); end;\n for i:=1 to n do writeln(color[i]);\nend.", "language": "Pascal", "metadata": {"date": 1499705322, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03768.html", "problem_id": "p03768", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03768/input.txt", "sample_output_relpath": "derived/input_output/data/p03768/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03768/Pascal/s467418097.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s467418097", "user_id": "u069768083"}, "prompt_components": {"gold_output": "2\n2\n2\n2\n2\n1\n0\n", "input_to_evaluate": "var i,j,k,l,m,n,q,w,x,y,t:longint;\n st,ed,first,next,d,v,color,fw,c:array[1..200000] of longint;\n b:array[1..200000]of boolean;\nprocedure ad(p,o:longint);\nbegin\n t:=t+1; ed[t]:=o; next[t]:=first[p];first[p]:=t;\nend;\nprocedure dfs(p,o,cl:longint);\nvar i,j:longint;\nbegin\n if fw[p]>o then exit;\n i:=first[p]; fw[p]:=o; b[p]:=true;\n if color[p]=0 then color[p]:=cl;\n while (i>=1) do begin\n if b[ed[i]]=false then\n dfs(ed[i],o-1,cl);\n i:=next[i];\n end;\n b[p]:=false;\nend;\nbegin\n readln(n,m);\n for i:=1 to m do first[i]:=-1;\n for i:=1 to m do begin readln(x,y); ad(x,y);ad(y,x); end;\n readln(q);\n\n for i:=1 to q do readln(v[i],d[i],c[i]);\n for i:=q downto 1 do begin dfs(v[i],d[i],c[i]); end;\n for i:=1 to n do writeln(color[i]);\nend.", "problem_context": "Score : 700 points\n\nProblem Statement\n\nSquid loves painting vertices in graphs.\n\nThere is a simple undirected graph consisting of N vertices numbered 1 through N, and M edges.\nInitially, all the vertices are painted in color 0. The i-th edge bidirectionally connects two vertices a_i and b_i. The length of every edge is 1.\n\nSquid performed Q operations on this graph. In the i-th operation, he repaints all the vertices within a distance of d_i from vertex v_i, in color c_i.\n\nFind the color of each vertex after the Q operations.\n\nConstraints\n\n1 ≤ N,M,Q ≤ 10^5\n\n1 ≤ a_i,b_i,v_i ≤ N\n\na_i ≠ b_i\n\n0 ≤ d_i ≤ 10\n\n1 ≤ c_i ≤10^5\n\nd_i and c_i are all integers.\n\nThere are no self-loops or multiple edges in the given graph.\n\nPartial Score\n\n200 points will be awarded for passing the testset satisfying 1 ≤ N,M,Q ≤ 2{,}000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\na_1 b_1\n:\na_{M} b_{M}\nQ\nv_1 d_1 c_1\n:\nv_{Q} d_{Q} c_{Q}\n\nOutput\n\nPrint the answer in N lines.\nIn the i-th line, print the color of vertex i after the Q operations.\n\nSample Input 1\n\n7 7\n1 2\n1 3\n1 4\n4 5\n5 6\n5 7\n2 3\n2\n6 1 1\n1 2 2\n\nSample Output 1\n\n2\n2\n2\n2\n2\n1\n0\n\nInitially, each vertex is painted in color 0.\nIn the first operation, vertices 5 and 6 are repainted in color 1.\nIn the second operation, vertices 1, 2, 3, 4 and 5 are repainted in color 2.\n\nSample Input 2\n\n14 10\n1 4\n5 7\n7 11\n4 10\n14 7\n14 3\n6 14\n8 11\n5 13\n8 3\n8\n8 6 2\n9 7 85\n6 9 3\n6 7 5\n10 3 1\n12 9 4\n9 6 6\n8 2 3\n\nSample Output 2\n\n1\n0\n3\n1\n5\n5\n3\n3\n6\n1\n3\n4\n5\n3\n\nThe given graph may not be connected.", "sample_input": "7 7\n1 2\n1 3\n1 4\n4 5\n5 6\n5 7\n2 3\n2\n6 1 1\n1 2 2\n"}, "reference_outputs": ["2\n2\n2\n2\n2\n1\n0\n"], "source_document_id": "p03768", "source_text": "Score : 700 points\n\nProblem Statement\n\nSquid loves painting vertices in graphs.\n\nThere is a simple undirected graph consisting of N vertices numbered 1 through N, and M edges.\nInitially, all the vertices are painted in color 0. The i-th edge bidirectionally connects two vertices a_i and b_i. The length of every edge is 1.\n\nSquid performed Q operations on this graph. In the i-th operation, he repaints all the vertices within a distance of d_i from vertex v_i, in color c_i.\n\nFind the color of each vertex after the Q operations.\n\nConstraints\n\n1 ≤ N,M,Q ≤ 10^5\n\n1 ≤ a_i,b_i,v_i ≤ N\n\na_i ≠ b_i\n\n0 ≤ d_i ≤ 10\n\n1 ≤ c_i ≤10^5\n\nd_i and c_i are all integers.\n\nThere are no self-loops or multiple edges in the given graph.\n\nPartial Score\n\n200 points will be awarded for passing the testset satisfying 1 ≤ N,M,Q ≤ 2{,}000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\na_1 b_1\n:\na_{M} b_{M}\nQ\nv_1 d_1 c_1\n:\nv_{Q} d_{Q} c_{Q}\n\nOutput\n\nPrint the answer in N lines.\nIn the i-th line, print the color of vertex i after the Q operations.\n\nSample Input 1\n\n7 7\n1 2\n1 3\n1 4\n4 5\n5 6\n5 7\n2 3\n2\n6 1 1\n1 2 2\n\nSample Output 1\n\n2\n2\n2\n2\n2\n1\n0\n\nInitially, each vertex is painted in color 0.\nIn the first operation, vertices 5 and 6 are repainted in color 1.\nIn the second operation, vertices 1, 2, 3, 4 and 5 are repainted in color 2.\n\nSample Input 2\n\n14 10\n1 4\n5 7\n7 11\n4 10\n14 7\n14 3\n6 14\n8 11\n5 13\n8 3\n8\n8 6 2\n9 7 85\n6 9 3\n6 7 5\n10 3 1\n12 9 4\n9 6 6\n8 2 3\n\nSample Output 2\n\n1\n0\n3\n1\n5\n5\n3\n3\n6\n1\n3\n4\n5\n3\n\nThe given graph may not be connected.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 806, "cpu_time_ms": 2103, "memory_kb": 6144}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s229922105", "group_id": "codeNet:p03768", "input_text": "var\n n,m,x,y,i,q,total:longint;\n b,p,d,v,tot,que,first,next,ans,c:array[0..200010]of longint;\n\nprocedure add(x,y:longint);\nbegin\n inc(total);\n next[total]:=first[x];\n first[x]:=total;\n b[total]:=y;\nend;\n\nprocedure bfs(k:longint);\nvar\n head,tail:longint;\n s:longint;\nbegin\n head:=1;\n tail:=1;\n que[1]:=k;\n while head<=tail do begin\n s:=first[que[head]];\n if ans[que[head]]=0 then ans[que[head]]:=c[i];\n if tot[head]>p[que[head]] then p[que[head]]:=tot[head];\n if tot[head]>0 then begin\n while s<>-1 do begin\n inc(tail);\n tot[tail]:=tot[head]-1;\n que[tail]:=b[s];\n s:=next[s];\n end;\n end;\n inc(head);\n end;\nend;\n\nbegin\n read(n,m);\n for i:=1 to n do first[i]:=-1;\n for i:=1 to m do begin\n read(x,y);\n add(x,y);\n add(y,x);\n end;\n read(q);\n for i:=1 to q do read(v[i],d[i],c[i]);\n for i:=q downto 1 do begin\n if p[v[i]]>d[i] then continue;\n if (c[v[i]]<>0)and(d[i]=0) then continue;\n tot[1]:=d[i];\n bfs(v[i]);\n end;\n for i:=1 to n do writeln(ans[i]);\nend.\n", "language": "Pascal", "metadata": {"date": 1499704968, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03768.html", "problem_id": "p03768", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03768/input.txt", "sample_output_relpath": "derived/input_output/data/p03768/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03768/Pascal/s229922105.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s229922105", "user_id": "u468632936"}, "prompt_components": {"gold_output": "2\n2\n2\n2\n2\n1\n0\n", "input_to_evaluate": "var\n n,m,x,y,i,q,total:longint;\n b,p,d,v,tot,que,first,next,ans,c:array[0..200010]of longint;\n\nprocedure add(x,y:longint);\nbegin\n inc(total);\n next[total]:=first[x];\n first[x]:=total;\n b[total]:=y;\nend;\n\nprocedure bfs(k:longint);\nvar\n head,tail:longint;\n s:longint;\nbegin\n head:=1;\n tail:=1;\n que[1]:=k;\n while head<=tail do begin\n s:=first[que[head]];\n if ans[que[head]]=0 then ans[que[head]]:=c[i];\n if tot[head]>p[que[head]] then p[que[head]]:=tot[head];\n if tot[head]>0 then begin\n while s<>-1 do begin\n inc(tail);\n tot[tail]:=tot[head]-1;\n que[tail]:=b[s];\n s:=next[s];\n end;\n end;\n inc(head);\n end;\nend;\n\nbegin\n read(n,m);\n for i:=1 to n do first[i]:=-1;\n for i:=1 to m do begin\n read(x,y);\n add(x,y);\n add(y,x);\n end;\n read(q);\n for i:=1 to q do read(v[i],d[i],c[i]);\n for i:=q downto 1 do begin\n if p[v[i]]>d[i] then continue;\n if (c[v[i]]<>0)and(d[i]=0) then continue;\n tot[1]:=d[i];\n bfs(v[i]);\n end;\n for i:=1 to n do writeln(ans[i]);\nend.\n", "problem_context": "Score : 700 points\n\nProblem Statement\n\nSquid loves painting vertices in graphs.\n\nThere is a simple undirected graph consisting of N vertices numbered 1 through N, and M edges.\nInitially, all the vertices are painted in color 0. The i-th edge bidirectionally connects two vertices a_i and b_i. The length of every edge is 1.\n\nSquid performed Q operations on this graph. In the i-th operation, he repaints all the vertices within a distance of d_i from vertex v_i, in color c_i.\n\nFind the color of each vertex after the Q operations.\n\nConstraints\n\n1 ≤ N,M,Q ≤ 10^5\n\n1 ≤ a_i,b_i,v_i ≤ N\n\na_i ≠ b_i\n\n0 ≤ d_i ≤ 10\n\n1 ≤ c_i ≤10^5\n\nd_i and c_i are all integers.\n\nThere are no self-loops or multiple edges in the given graph.\n\nPartial Score\n\n200 points will be awarded for passing the testset satisfying 1 ≤ N,M,Q ≤ 2{,}000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\na_1 b_1\n:\na_{M} b_{M}\nQ\nv_1 d_1 c_1\n:\nv_{Q} d_{Q} c_{Q}\n\nOutput\n\nPrint the answer in N lines.\nIn the i-th line, print the color of vertex i after the Q operations.\n\nSample Input 1\n\n7 7\n1 2\n1 3\n1 4\n4 5\n5 6\n5 7\n2 3\n2\n6 1 1\n1 2 2\n\nSample Output 1\n\n2\n2\n2\n2\n2\n1\n0\n\nInitially, each vertex is painted in color 0.\nIn the first operation, vertices 5 and 6 are repainted in color 1.\nIn the second operation, vertices 1, 2, 3, 4 and 5 are repainted in color 2.\n\nSample Input 2\n\n14 10\n1 4\n5 7\n7 11\n4 10\n14 7\n14 3\n6 14\n8 11\n5 13\n8 3\n8\n8 6 2\n9 7 85\n6 9 3\n6 7 5\n10 3 1\n12 9 4\n9 6 6\n8 2 3\n\nSample Output 2\n\n1\n0\n3\n1\n5\n5\n3\n3\n6\n1\n3\n4\n5\n3\n\nThe given graph may not be connected.", "sample_input": "7 7\n1 2\n1 3\n1 4\n4 5\n5 6\n5 7\n2 3\n2\n6 1 1\n1 2 2\n"}, "reference_outputs": ["2\n2\n2\n2\n2\n1\n0\n"], "source_document_id": "p03768", "source_text": "Score : 700 points\n\nProblem Statement\n\nSquid loves painting vertices in graphs.\n\nThere is a simple undirected graph consisting of N vertices numbered 1 through N, and M edges.\nInitially, all the vertices are painted in color 0. The i-th edge bidirectionally connects two vertices a_i and b_i. The length of every edge is 1.\n\nSquid performed Q operations on this graph. In the i-th operation, he repaints all the vertices within a distance of d_i from vertex v_i, in color c_i.\n\nFind the color of each vertex after the Q operations.\n\nConstraints\n\n1 ≤ N,M,Q ≤ 10^5\n\n1 ≤ a_i,b_i,v_i ≤ N\n\na_i ≠ b_i\n\n0 ≤ d_i ≤ 10\n\n1 ≤ c_i ≤10^5\n\nd_i and c_i are all integers.\n\nThere are no self-loops or multiple edges in the given graph.\n\nPartial Score\n\n200 points will be awarded for passing the testset satisfying 1 ≤ N,M,Q ≤ 2{,}000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\na_1 b_1\n:\na_{M} b_{M}\nQ\nv_1 d_1 c_1\n:\nv_{Q} d_{Q} c_{Q}\n\nOutput\n\nPrint the answer in N lines.\nIn the i-th line, print the color of vertex i after the Q operations.\n\nSample Input 1\n\n7 7\n1 2\n1 3\n1 4\n4 5\n5 6\n5 7\n2 3\n2\n6 1 1\n1 2 2\n\nSample Output 1\n\n2\n2\n2\n2\n2\n1\n0\n\nInitially, each vertex is painted in color 0.\nIn the first operation, vertices 5 and 6 are repainted in color 1.\nIn the second operation, vertices 1, 2, 3, 4 and 5 are repainted in color 2.\n\nSample Input 2\n\n14 10\n1 4\n5 7\n7 11\n4 10\n14 7\n14 3\n6 14\n8 11\n5 13\n8 3\n8\n8 6 2\n9 7 85\n6 9 3\n6 7 5\n10 3 1\n12 9 4\n9 6 6\n8 2 3\n\nSample Output 2\n\n1\n0\n3\n1\n5\n5\n3\n3\n6\n1\n3\n4\n5\n3\n\nThe given graph may not be connected.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 314, "memory_kb": 7552}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s753497316", "group_id": "codeNet:p03768", "input_text": "var\n n,m,x,y,i,q,total:longint;\n b,p,d,v,tot,que,first,next,ans,c:array[0..200010]of longint;\n\nprocedure add(x,y:longint);\nbegin\n inc(total);\n next[total]:=first[x];\n first[x]:=total;\n b[total]:=y;\nend;\n\nprocedure bfs(k:longint);\nvar\n head,tail:longint;\n s:longint;\nbegin\n head:=1;\n tail:=1;\n que[1]:=k;\n while head<=tail do begin\n s:=first[que[head]];\n if ans[que[head]]=0 then ans[que[head]]:=c[i];\n if tot[head]>p[que[head]] then p[que[head]]:=tot[head];\n if tot[head]>0 then begin\n while s<>-1 do begin\n inc(tail);\n tot[tail]:=tot[head]-1;\n que[tail]:=b[s];\n s:=next[s];\n end;\n end;\n inc(head);\n end;\nend;\n\nbegin\n read(n,m);\n for i:=1 to n do first[i]:=-1;\n for i:=1 to m do begin\n read(x,y);\n add(x,y);\n add(y,x);\n end;\n read(q);\n for i:=1 to q do read(v[i],d[i],c[i]);\n for i:=q downto 1 do begin\n if p[v[i]]>d[i] then continue;\n if (c[v[i]]<>0)and(d[i]=0) then continue;\n tot[1]:=d[i];\n bfs(v[i]);\n end;\n for i:=1 to n do writeln(ans[i]);\nend.", "language": "Pascal", "metadata": {"date": 1499704594, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03768.html", "problem_id": "p03768", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03768/input.txt", "sample_output_relpath": "derived/input_output/data/p03768/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03768/Pascal/s753497316.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s753497316", "user_id": "u468632936"}, "prompt_components": {"gold_output": "2\n2\n2\n2\n2\n1\n0\n", "input_to_evaluate": "var\n n,m,x,y,i,q,total:longint;\n b,p,d,v,tot,que,first,next,ans,c:array[0..200010]of longint;\n\nprocedure add(x,y:longint);\nbegin\n inc(total);\n next[total]:=first[x];\n first[x]:=total;\n b[total]:=y;\nend;\n\nprocedure bfs(k:longint);\nvar\n head,tail:longint;\n s:longint;\nbegin\n head:=1;\n tail:=1;\n que[1]:=k;\n while head<=tail do begin\n s:=first[que[head]];\n if ans[que[head]]=0 then ans[que[head]]:=c[i];\n if tot[head]>p[que[head]] then p[que[head]]:=tot[head];\n if tot[head]>0 then begin\n while s<>-1 do begin\n inc(tail);\n tot[tail]:=tot[head]-1;\n que[tail]:=b[s];\n s:=next[s];\n end;\n end;\n inc(head);\n end;\nend;\n\nbegin\n read(n,m);\n for i:=1 to n do first[i]:=-1;\n for i:=1 to m do begin\n read(x,y);\n add(x,y);\n add(y,x);\n end;\n read(q);\n for i:=1 to q do read(v[i],d[i],c[i]);\n for i:=q downto 1 do begin\n if p[v[i]]>d[i] then continue;\n if (c[v[i]]<>0)and(d[i]=0) then continue;\n tot[1]:=d[i];\n bfs(v[i]);\n end;\n for i:=1 to n do writeln(ans[i]);\nend.", "problem_context": "Score : 700 points\n\nProblem Statement\n\nSquid loves painting vertices in graphs.\n\nThere is a simple undirected graph consisting of N vertices numbered 1 through N, and M edges.\nInitially, all the vertices are painted in color 0. The i-th edge bidirectionally connects two vertices a_i and b_i. The length of every edge is 1.\n\nSquid performed Q operations on this graph. In the i-th operation, he repaints all the vertices within a distance of d_i from vertex v_i, in color c_i.\n\nFind the color of each vertex after the Q operations.\n\nConstraints\n\n1 ≤ N,M,Q ≤ 10^5\n\n1 ≤ a_i,b_i,v_i ≤ N\n\na_i ≠ b_i\n\n0 ≤ d_i ≤ 10\n\n1 ≤ c_i ≤10^5\n\nd_i and c_i are all integers.\n\nThere are no self-loops or multiple edges in the given graph.\n\nPartial Score\n\n200 points will be awarded for passing the testset satisfying 1 ≤ N,M,Q ≤ 2{,}000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\na_1 b_1\n:\na_{M} b_{M}\nQ\nv_1 d_1 c_1\n:\nv_{Q} d_{Q} c_{Q}\n\nOutput\n\nPrint the answer in N lines.\nIn the i-th line, print the color of vertex i after the Q operations.\n\nSample Input 1\n\n7 7\n1 2\n1 3\n1 4\n4 5\n5 6\n5 7\n2 3\n2\n6 1 1\n1 2 2\n\nSample Output 1\n\n2\n2\n2\n2\n2\n1\n0\n\nInitially, each vertex is painted in color 0.\nIn the first operation, vertices 5 and 6 are repainted in color 1.\nIn the second operation, vertices 1, 2, 3, 4 and 5 are repainted in color 2.\n\nSample Input 2\n\n14 10\n1 4\n5 7\n7 11\n4 10\n14 7\n14 3\n6 14\n8 11\n5 13\n8 3\n8\n8 6 2\n9 7 85\n6 9 3\n6 7 5\n10 3 1\n12 9 4\n9 6 6\n8 2 3\n\nSample Output 2\n\n1\n0\n3\n1\n5\n5\n3\n3\n6\n1\n3\n4\n5\n3\n\nThe given graph may not be connected.", "sample_input": "7 7\n1 2\n1 3\n1 4\n4 5\n5 6\n5 7\n2 3\n2\n6 1 1\n1 2 2\n"}, "reference_outputs": ["2\n2\n2\n2\n2\n1\n0\n"], "source_document_id": "p03768", "source_text": "Score : 700 points\n\nProblem Statement\n\nSquid loves painting vertices in graphs.\n\nThere is a simple undirected graph consisting of N vertices numbered 1 through N, and M edges.\nInitially, all the vertices are painted in color 0. The i-th edge bidirectionally connects two vertices a_i and b_i. The length of every edge is 1.\n\nSquid performed Q operations on this graph. In the i-th operation, he repaints all the vertices within a distance of d_i from vertex v_i, in color c_i.\n\nFind the color of each vertex after the Q operations.\n\nConstraints\n\n1 ≤ N,M,Q ≤ 10^5\n\n1 ≤ a_i,b_i,v_i ≤ N\n\na_i ≠ b_i\n\n0 ≤ d_i ≤ 10\n\n1 ≤ c_i ≤10^5\n\nd_i and c_i are all integers.\n\nThere are no self-loops or multiple edges in the given graph.\n\nPartial Score\n\n200 points will be awarded for passing the testset satisfying 1 ≤ N,M,Q ≤ 2{,}000.\n\nInput\n\nInput is given from Standard Input in the following format:\n\nN M\na_1 b_1\n:\na_{M} b_{M}\nQ\nv_1 d_1 c_1\n:\nv_{Q} d_{Q} c_{Q}\n\nOutput\n\nPrint the answer in N lines.\nIn the i-th line, print the color of vertex i after the Q operations.\n\nSample Input 1\n\n7 7\n1 2\n1 3\n1 4\n4 5\n5 6\n5 7\n2 3\n2\n6 1 1\n1 2 2\n\nSample Output 1\n\n2\n2\n2\n2\n2\n1\n0\n\nInitially, each vertex is painted in color 0.\nIn the first operation, vertices 5 and 6 are repainted in color 1.\nIn the second operation, vertices 1, 2, 3, 4 and 5 are repainted in color 2.\n\nSample Input 2\n\n14 10\n1 4\n5 7\n7 11\n4 10\n14 7\n14 3\n6 14\n8 11\n5 13\n8 3\n8\n8 6 2\n9 7 85\n6 9 3\n6 7 5\n10 3 1\n12 9 4\n9 6 6\n8 2 3\n\nSample Output 2\n\n1\n0\n3\n1\n5\n5\n3\n3\n6\n1\n3\n4\n5\n3\n\nThe given graph may not be connected.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1181, "cpu_time_ms": 312, "memory_kb": 7680}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s697824587", "group_id": "codeNet:p03774", "input_text": "program Project1;\n\n{$APPTYPE CONSOLE}\n\nuses\n SysUtils;\nvar\n h,w,i,j,count,x,y,sw,m,n,dist,poi:Integer;\n a,b,c,d:array of Integer;\n tf:Boolean;\nbegin\n try\n { TODO -oUser -cConsole Main : ここにコードを記述してください }\n Read(n);\n Readln(m);\n SetLength(a,n);\n SetLength(b,n);\n for i := 0 to n - 1 do begin\n Read(a[i]);\n Readln(b[i]);\n end;\n SetLength(c,m);\n SetLength(d,m);\n for i := 0 to m - 1 do begin\n Read(c[i]);\n Readln(d[i]);\n end;\n\n for i := 0 to n - 1 do begin\n dist:=999999999;\n for j := m-1 downto 0 do begin\n //dist:=(dist + abs(a[i]-c[j])+abs(b[i]-d[j])- abs(dist - abs(a[i]-c[j])+abs(b[i]-d[j]))) div 2;\n if dist>=abs(a[i]-c[j])+abs(b[i]-d[j]) then begin\n poi:=j+1;\n dist:=abs(a[i]-c[j])+abs(b[i]-d[j]);\n end;\n end;\n Writeln(poi);\n end;\n\n Readln;\n except\n on E: Exception do\n Writeln(E.ClassName, ': ', E.Message);\n end;\nend.\n", "language": "Pascal", "metadata": {"date": 1516654304, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03774.html", "problem_id": "p03774", "resource_group": "low_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/Pascal/s697824587.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s697824587", "user_id": "u755925739"}, "prompt_components": {"gold_output": "2\n1\n", "input_to_evaluate": "program Project1;\n\n{$APPTYPE CONSOLE}\n\nuses\n SysUtils;\nvar\n h,w,i,j,count,x,y,sw,m,n,dist,poi:Integer;\n a,b,c,d:array of Integer;\n tf:Boolean;\nbegin\n try\n { TODO -oUser -cConsole Main : ここにコードを記述してください }\n Read(n);\n Readln(m);\n SetLength(a,n);\n SetLength(b,n);\n for i := 0 to n - 1 do begin\n Read(a[i]);\n Readln(b[i]);\n end;\n SetLength(c,m);\n SetLength(d,m);\n for i := 0 to m - 1 do begin\n Read(c[i]);\n Readln(d[i]);\n end;\n\n for i := 0 to n - 1 do begin\n dist:=999999999;\n for j := m-1 downto 0 do begin\n //dist:=(dist + abs(a[i]-c[j])+abs(b[i]-d[j])- abs(dist - abs(a[i]-c[j])+abs(b[i]-d[j]))) div 2;\n if dist>=abs(a[i]-c[j])+abs(b[i]-d[j]) then begin\n poi:=j+1;\n dist:=abs(a[i]-c[j])+abs(b[i]-d[j]);\n end;\n end;\n Writeln(poi);\n end;\n\n Readln;\n except\n on E: Exception do\n Writeln(E.ClassName, ': ', E.Message);\n end;\nend.\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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 989, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s501809914", "group_id": "codeNet:p03775", "input_text": "var\n\tn,i:int64;\nbegin\n\tread(n);\n\ti:=round(sqrt(n));\n\twhile n mod i<>0 do dec(i);\n\tn:=n div i;\n\ti:=0;\n\twhile n<>0 do begin\n\t\tinc(i);\n\t\tn:=n div 10;\n\tend;\n\twriteln(i);\nend.\n", "language": "Pascal", "metadata": {"date": 1581744366, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03775.html", "problem_id": "p03775", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03775/input.txt", "sample_output_relpath": "derived/input_output/data/p03775/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03775/Pascal/s501809914.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s501809914", "user_id": "u657913472"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "var\n\tn,i:int64;\nbegin\n\tread(n);\n\ti:=round(sqrt(n));\n\twhile n mod i<>0 do dec(i);\n\tn:=n div i;\n\ti:=0;\n\twhile n<>0 do begin\n\t\tinc(i);\n\t\tn:=n div 10;\n\tend;\n\twriteln(i);\nend.\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nYou are given an integer N.\n\nFor two positive integers A and B, we will define F(A,B) as the larger of the following: the number of digits in the decimal notation of A, and the number of digits in the decimal notation of B.\n\nFor example, F(3,11) = 2 since 3 has one digit and 11 has two digits.\n\nFind the minimum value of F(A,B) as (A,B) ranges over all pairs of positive integers such that N = A \\times B.\n\nConstraints\n\n1 \\leq N \\leq 10^{10}\n\nN is an integer.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the minimum value of F(A,B) as (A,B) ranges over all pairs of positive integers such that N = A \\times B.\n\nSample Input 1\n\n10000\n\nSample Output 1\n\n3\n\nF(A,B) has a minimum value of 3 at (A,B)=(100,100).\n\nSample Input 2\n\n1000003\n\nSample Output 2\n\n7\n\nThere are two pairs (A,B) that satisfy the condition: (1,1000003) and (1000003,1). For these pairs, F(1,1000003)=F(1000003,1)=7.\n\nSample Input 3\n\n9876543210\n\nSample Output 3\n\n6", "sample_input": "10000\n"}, "reference_outputs": ["3\n"], "source_document_id": "p03775", "source_text": "Score : 300 points\n\nProblem Statement\n\nYou are given an integer N.\n\nFor two positive integers A and B, we will define F(A,B) as the larger of the following: the number of digits in the decimal notation of A, and the number of digits in the decimal notation of B.\n\nFor example, F(3,11) = 2 since 3 has one digit and 11 has two digits.\n\nFind the minimum value of F(A,B) as (A,B) ranges over all pairs of positive integers such that N = A \\times B.\n\nConstraints\n\n1 \\leq N \\leq 10^{10}\n\nN is an integer.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the minimum value of F(A,B) as (A,B) ranges over all pairs of positive integers such that N = A \\times B.\n\nSample Input 1\n\n10000\n\nSample Output 1\n\n3\n\nF(A,B) has a minimum value of 3 at (A,B)=(100,100).\n\nSample Input 2\n\n1000003\n\nSample Output 2\n\n7\n\nThere are two pairs (A,B) that satisfy the condition: (1,1000003) and (1000003,1). For these pairs, F(1,1000003)=F(1000003,1)=7.\n\nSample Input 3\n\n9876543210\n\nSample Output 3\n\n6", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 171, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s669842934", "group_id": "codeNet:p03775", "input_text": "var\n i,min,s:longint;\n n,l:int64;\nbegin\n readln(n);\n min:=maxlongint;\n for i:=trunc(sqrt(n)) downto 1 do\n if n mod i=0 then\n begin\n s:=11;\n l:=10000000000;\n while n div i div l=0 do\n begin\n l:=l div 10;\n dec(s);\n end;\n if s0 do\n begin\n s:=s+1;\n i:=i div 10;\n end;\n writeln(s);\nend.", "language": "Pascal", "metadata": {"date": 1553213917, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03775.html", "problem_id": "p03775", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03775/input.txt", "sample_output_relpath": "derived/input_output/data/p03775/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03775/Pascal/s310799084.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s310799084", "user_id": "u723721005"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "var\n n,i,s:longint;\n st:string;\nbegin\n readln(n);\n for i:=trunc(sqrt(n)) downto 1 do\n if n mod i=0 then break;\n s:=0;\n while i>0 do\n begin\n s:=s+1;\n i:=i div 10;\n end;\n writeln(s);\nend.", "problem_context": "Score : 300 points\n\nProblem Statement\n\nYou are given an integer N.\n\nFor two positive integers A and B, we will define F(A,B) as the larger of the following: the number of digits in the decimal notation of A, and the number of digits in the decimal notation of B.\n\nFor example, F(3,11) = 2 since 3 has one digit and 11 has two digits.\n\nFind the minimum value of F(A,B) as (A,B) ranges over all pairs of positive integers such that N = A \\times B.\n\nConstraints\n\n1 \\leq N \\leq 10^{10}\n\nN is an integer.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the minimum value of F(A,B) as (A,B) ranges over all pairs of positive integers such that N = A \\times B.\n\nSample Input 1\n\n10000\n\nSample Output 1\n\n3\n\nF(A,B) has a minimum value of 3 at (A,B)=(100,100).\n\nSample Input 2\n\n1000003\n\nSample Output 2\n\n7\n\nThere are two pairs (A,B) that satisfy the condition: (1,1000003) and (1000003,1). For these pairs, F(1,1000003)=F(1000003,1)=7.\n\nSample Input 3\n\n9876543210\n\nSample Output 3\n\n6", "sample_input": "10000\n"}, "reference_outputs": ["3\n"], "source_document_id": "p03775", "source_text": "Score : 300 points\n\nProblem Statement\n\nYou are given an integer N.\n\nFor two positive integers A and B, we will define F(A,B) as the larger of the following: the number of digits in the decimal notation of A, and the number of digits in the decimal notation of B.\n\nFor example, F(3,11) = 2 since 3 has one digit and 11 has two digits.\n\nFind the minimum value of F(A,B) as (A,B) ranges over all pairs of positive integers such that N = A \\times B.\n\nConstraints\n\n1 \\leq N \\leq 10^{10}\n\nN is an integer.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the minimum value of F(A,B) as (A,B) ranges over all pairs of positive integers such that N = A \\times B.\n\nSample Input 1\n\n10000\n\nSample Output 1\n\n3\n\nF(A,B) has a minimum value of 3 at (A,B)=(100,100).\n\nSample Input 2\n\n1000003\n\nSample Output 2\n\n7\n\nThere are two pairs (A,B) that satisfy the condition: (1,1000003) and (1000003,1). For these pairs, F(1,1000003)=F(1000003,1)=7.\n\nSample Input 3\n\n9876543210\n\nSample Output 3\n\n6", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s156539700", "group_id": "codeNet:p03775", "input_text": "var\n n,i,s:int64;\n st:string;\nbegin\n readln(n);\n i:=trunc(sqrt(n))+1;\n while (i>0) do\n begin\n i:=i-1;\n if n mod i=0 then break;\n end;\n if i=0 then i:=1;\n s:=0;\n while i>0 do\n begin\n s:=s+1;\n i:=i div 10;\n end;\n write(s);\nend.", "language": "Pascal", "metadata": {"date": 1553212658, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03775.html", "problem_id": "p03775", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03775/input.txt", "sample_output_relpath": "derived/input_output/data/p03775/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03775/Pascal/s156539700.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s156539700", "user_id": "u723721005"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "var\n n,i,s:int64;\n st:string;\nbegin\n readln(n);\n i:=trunc(sqrt(n))+1;\n while (i>0) do\n begin\n i:=i-1;\n if n mod i=0 then break;\n end;\n if i=0 then i:=1;\n s:=0;\n while i>0 do\n begin\n s:=s+1;\n i:=i div 10;\n end;\n write(s);\nend.", "problem_context": "Score : 300 points\n\nProblem Statement\n\nYou are given an integer N.\n\nFor two positive integers A and B, we will define F(A,B) as the larger of the following: the number of digits in the decimal notation of A, and the number of digits in the decimal notation of B.\n\nFor example, F(3,11) = 2 since 3 has one digit and 11 has two digits.\n\nFind the minimum value of F(A,B) as (A,B) ranges over all pairs of positive integers such that N = A \\times B.\n\nConstraints\n\n1 \\leq N \\leq 10^{10}\n\nN is an integer.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the minimum value of F(A,B) as (A,B) ranges over all pairs of positive integers such that N = A \\times B.\n\nSample Input 1\n\n10000\n\nSample Output 1\n\n3\n\nF(A,B) has a minimum value of 3 at (A,B)=(100,100).\n\nSample Input 2\n\n1000003\n\nSample Output 2\n\n7\n\nThere are two pairs (A,B) that satisfy the condition: (1,1000003) and (1000003,1). For these pairs, F(1,1000003)=F(1000003,1)=7.\n\nSample Input 3\n\n9876543210\n\nSample Output 3\n\n6", "sample_input": "10000\n"}, "reference_outputs": ["3\n"], "source_document_id": "p03775", "source_text": "Score : 300 points\n\nProblem Statement\n\nYou are given an integer N.\n\nFor two positive integers A and B, we will define F(A,B) as the larger of the following: the number of digits in the decimal notation of A, and the number of digits in the decimal notation of B.\n\nFor example, F(3,11) = 2 since 3 has one digit and 11 has two digits.\n\nFind the minimum value of F(A,B) as (A,B) ranges over all pairs of positive integers such that N = A \\times B.\n\nConstraints\n\n1 \\leq N \\leq 10^{10}\n\nN is an integer.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the minimum value of F(A,B) as (A,B) ranges over all pairs of positive integers such that N = A \\times B.\n\nSample Input 1\n\n10000\n\nSample Output 1\n\n3\n\nF(A,B) has a minimum value of 3 at (A,B)=(100,100).\n\nSample Input 2\n\n1000003\n\nSample Output 2\n\n7\n\nThere are two pairs (A,B) that satisfy the condition: (1,1000003) and (1000003,1). For these pairs, F(1,1000003)=F(1000003,1)=7.\n\nSample Input 3\n\n9876543210\n\nSample Output 3\n\n6", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s301892665", "group_id": "codeNet:p03775", "input_text": "var\n n,i,s:int64;\n st:string;\nbegin\n readln(n);\n i:=trunc(sqrt(n));\n while (i>0) and (s=0) do\n begin\n if n mod i=0 then\n begin\n str(i,st);\n writeln(length(st));\n halt;\n end;\n i:=i-1;\n end;\nend.", "language": "Pascal", "metadata": {"date": 1553212503, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03775.html", "problem_id": "p03775", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03775/input.txt", "sample_output_relpath": "derived/input_output/data/p03775/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03775/Pascal/s301892665.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s301892665", "user_id": "u476418095"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "var\n n,i,s:int64;\n st:string;\nbegin\n readln(n);\n i:=trunc(sqrt(n));\n while (i>0) and (s=0) do\n begin\n if n mod i=0 then\n begin\n str(i,st);\n writeln(length(st));\n halt;\n end;\n i:=i-1;\n end;\nend.", "problem_context": "Score : 300 points\n\nProblem Statement\n\nYou are given an integer N.\n\nFor two positive integers A and B, we will define F(A,B) as the larger of the following: the number of digits in the decimal notation of A, and the number of digits in the decimal notation of B.\n\nFor example, F(3,11) = 2 since 3 has one digit and 11 has two digits.\n\nFind the minimum value of F(A,B) as (A,B) ranges over all pairs of positive integers such that N = A \\times B.\n\nConstraints\n\n1 \\leq N \\leq 10^{10}\n\nN is an integer.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the minimum value of F(A,B) as (A,B) ranges over all pairs of positive integers such that N = A \\times B.\n\nSample Input 1\n\n10000\n\nSample Output 1\n\n3\n\nF(A,B) has a minimum value of 3 at (A,B)=(100,100).\n\nSample Input 2\n\n1000003\n\nSample Output 2\n\n7\n\nThere are two pairs (A,B) that satisfy the condition: (1,1000003) and (1000003,1). For these pairs, F(1,1000003)=F(1000003,1)=7.\n\nSample Input 3\n\n9876543210\n\nSample Output 3\n\n6", "sample_input": "10000\n"}, "reference_outputs": ["3\n"], "source_document_id": "p03775", "source_text": "Score : 300 points\n\nProblem Statement\n\nYou are given an integer N.\n\nFor two positive integers A and B, we will define F(A,B) as the larger of the following: the number of digits in the decimal notation of A, and the number of digits in the decimal notation of B.\n\nFor example, F(3,11) = 2 since 3 has one digit and 11 has two digits.\n\nFind the minimum value of F(A,B) as (A,B) ranges over all pairs of positive integers such that N = A \\times B.\n\nConstraints\n\n1 \\leq N \\leq 10^{10}\n\nN is an integer.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the minimum value of F(A,B) as (A,B) ranges over all pairs of positive integers such that N = A \\times B.\n\nSample Input 1\n\n10000\n\nSample Output 1\n\n3\n\nF(A,B) has a minimum value of 3 at (A,B)=(100,100).\n\nSample Input 2\n\n1000003\n\nSample Output 2\n\n7\n\nThere are two pairs (A,B) that satisfy the condition: (1,1000003) and (1000003,1). For these pairs, F(1,1000003)=F(1000003,1)=7.\n\nSample Input 3\n\n9876543210\n\nSample Output 3\n\n6", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 2, "memory_kb": 128}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s071935559", "group_id": "codeNet:p03775", "input_text": "var\n n:int64; \n i:longint;\n s:string;\nbegin\n readln(n);\n for i:=trunc(sqrt(n)) downto 1 do\n if n mod i=0 then break;\n if i>n div i then str(i,s)\n else str(n div i,s);\n writeln(length(s));\nend.", "language": "Pascal", "metadata": {"date": 1535046835, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03775.html", "problem_id": "p03775", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03775/input.txt", "sample_output_relpath": "derived/input_output/data/p03775/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03775/Pascal/s071935559.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s071935559", "user_id": "u293768090"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "var\n n:int64; \n i:longint;\n s:string;\nbegin\n readln(n);\n for i:=trunc(sqrt(n)) downto 1 do\n if n mod i=0 then break;\n if i>n div i then str(i,s)\n else str(n div i,s);\n writeln(length(s));\nend.", "problem_context": "Score : 300 points\n\nProblem Statement\n\nYou are given an integer N.\n\nFor two positive integers A and B, we will define F(A,B) as the larger of the following: the number of digits in the decimal notation of A, and the number of digits in the decimal notation of B.\n\nFor example, F(3,11) = 2 since 3 has one digit and 11 has two digits.\n\nFind the minimum value of F(A,B) as (A,B) ranges over all pairs of positive integers such that N = A \\times B.\n\nConstraints\n\n1 \\leq N \\leq 10^{10}\n\nN is an integer.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the minimum value of F(A,B) as (A,B) ranges over all pairs of positive integers such that N = A \\times B.\n\nSample Input 1\n\n10000\n\nSample Output 1\n\n3\n\nF(A,B) has a minimum value of 3 at (A,B)=(100,100).\n\nSample Input 2\n\n1000003\n\nSample Output 2\n\n7\n\nThere are two pairs (A,B) that satisfy the condition: (1,1000003) and (1000003,1). For these pairs, F(1,1000003)=F(1000003,1)=7.\n\nSample Input 3\n\n9876543210\n\nSample Output 3\n\n6", "sample_input": "10000\n"}, "reference_outputs": ["3\n"], "source_document_id": "p03775", "source_text": "Score : 300 points\n\nProblem Statement\n\nYou are given an integer N.\n\nFor two positive integers A and B, we will define F(A,B) as the larger of the following: the number of digits in the decimal notation of A, and the number of digits in the decimal notation of B.\n\nFor example, F(3,11) = 2 since 3 has one digit and 11 has two digits.\n\nFind the minimum value of F(A,B) as (A,B) ranges over all pairs of positive integers such that N = A \\times B.\n\nConstraints\n\n1 \\leq N \\leq 10^{10}\n\nN is an integer.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the minimum value of F(A,B) as (A,B) ranges over all pairs of positive integers such that N = A \\times B.\n\nSample Input 1\n\n10000\n\nSample Output 1\n\n3\n\nF(A,B) has a minimum value of 3 at (A,B)=(100,100).\n\nSample Input 2\n\n1000003\n\nSample Output 2\n\n7\n\nThere are two pairs (A,B) that satisfy the condition: (1,1000003) and (1000003,1). For these pairs, F(1,1000003)=F(1000003,1)=7.\n\nSample Input 3\n\n9876543210\n\nSample Output 3\n\n6", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s077659616", "group_id": "codeNet:p03775", "input_text": "var\n n,a,b:int64;\n i:longint;\n s:string;\nbegin\n read(n);\n a:=round(sqrt(n));\n for i:= a+1 downto 1 do\n if n mod i= 0 then\n begin\n b:=n div i;\n str(b,s);\n write(length(s));\n break;\n end;\nend.", "language": "Pascal", "metadata": {"date": 1533500774, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03775.html", "problem_id": "p03775", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03775/input.txt", "sample_output_relpath": "derived/input_output/data/p03775/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03775/Pascal/s077659616.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s077659616", "user_id": "u263933075"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "var\n n,a,b:int64;\n i:longint;\n s:string;\nbegin\n read(n);\n a:=round(sqrt(n));\n for i:= a+1 downto 1 do\n if n mod i= 0 then\n begin\n b:=n div i;\n str(b,s);\n write(length(s));\n break;\n end;\nend.", "problem_context": "Score : 300 points\n\nProblem Statement\n\nYou are given an integer N.\n\nFor two positive integers A and B, we will define F(A,B) as the larger of the following: the number of digits in the decimal notation of A, and the number of digits in the decimal notation of B.\n\nFor example, F(3,11) = 2 since 3 has one digit and 11 has two digits.\n\nFind the minimum value of F(A,B) as (A,B) ranges over all pairs of positive integers such that N = A \\times B.\n\nConstraints\n\n1 \\leq N \\leq 10^{10}\n\nN is an integer.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the minimum value of F(A,B) as (A,B) ranges over all pairs of positive integers such that N = A \\times B.\n\nSample Input 1\n\n10000\n\nSample Output 1\n\n3\n\nF(A,B) has a minimum value of 3 at (A,B)=(100,100).\n\nSample Input 2\n\n1000003\n\nSample Output 2\n\n7\n\nThere are two pairs (A,B) that satisfy the condition: (1,1000003) and (1000003,1). For these pairs, F(1,1000003)=F(1000003,1)=7.\n\nSample Input 3\n\n9876543210\n\nSample Output 3\n\n6", "sample_input": "10000\n"}, "reference_outputs": ["3\n"], "source_document_id": "p03775", "source_text": "Score : 300 points\n\nProblem Statement\n\nYou are given an integer N.\n\nFor two positive integers A and B, we will define F(A,B) as the larger of the following: the number of digits in the decimal notation of A, and the number of digits in the decimal notation of B.\n\nFor example, F(3,11) = 2 since 3 has one digit and 11 has two digits.\n\nFind the minimum value of F(A,B) as (A,B) ranges over all pairs of positive integers such that N = A \\times B.\n\nConstraints\n\n1 \\leq N \\leq 10^{10}\n\nN is an integer.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the minimum value of F(A,B) as (A,B) ranges over all pairs of positive integers such that N = A \\times B.\n\nSample Input 1\n\n10000\n\nSample Output 1\n\n3\n\nF(A,B) has a minimum value of 3 at (A,B)=(100,100).\n\nSample Input 2\n\n1000003\n\nSample Output 2\n\n7\n\nThere are two pairs (A,B) that satisfy the condition: (1,1000003) and (1000003,1). For these pairs, F(1,1000003)=F(1000003,1)=7.\n\nSample Input 3\n\n9876543210\n\nSample Output 3\n\n6", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s840491752", "group_id": "codeNet:p03775", "input_text": "var\n s:string;\n n:int64;\n i,j:longint;\nbegin\n read(n);\n for i:=trunc(sqrt(n)) downto 2 do\n if n mod i=0 then\n begin\n j:=n div i;\n str(j,s);\n writeln(length(s));\n halt;\n end;\nend.", "language": "Pascal", "metadata": {"date": 1532990572, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03775.html", "problem_id": "p03775", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03775/input.txt", "sample_output_relpath": "derived/input_output/data/p03775/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03775/Pascal/s840491752.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s840491752", "user_id": "u723721005"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "var\n s:string;\n n:int64;\n i,j:longint;\nbegin\n read(n);\n for i:=trunc(sqrt(n)) downto 2 do\n if n mod i=0 then\n begin\n j:=n div i;\n str(j,s);\n writeln(length(s));\n halt;\n end;\nend.", "problem_context": "Score : 300 points\n\nProblem Statement\n\nYou are given an integer N.\n\nFor two positive integers A and B, we will define F(A,B) as the larger of the following: the number of digits in the decimal notation of A, and the number of digits in the decimal notation of B.\n\nFor example, F(3,11) = 2 since 3 has one digit and 11 has two digits.\n\nFind the minimum value of F(A,B) as (A,B) ranges over all pairs of positive integers such that N = A \\times B.\n\nConstraints\n\n1 \\leq N \\leq 10^{10}\n\nN is an integer.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the minimum value of F(A,B) as (A,B) ranges over all pairs of positive integers such that N = A \\times B.\n\nSample Input 1\n\n10000\n\nSample Output 1\n\n3\n\nF(A,B) has a minimum value of 3 at (A,B)=(100,100).\n\nSample Input 2\n\n1000003\n\nSample Output 2\n\n7\n\nThere are two pairs (A,B) that satisfy the condition: (1,1000003) and (1000003,1). For these pairs, F(1,1000003)=F(1000003,1)=7.\n\nSample Input 3\n\n9876543210\n\nSample Output 3\n\n6", "sample_input": "10000\n"}, "reference_outputs": ["3\n"], "source_document_id": "p03775", "source_text": "Score : 300 points\n\nProblem Statement\n\nYou are given an integer N.\n\nFor two positive integers A and B, we will define F(A,B) as the larger of the following: the number of digits in the decimal notation of A, and the number of digits in the decimal notation of B.\n\nFor example, F(3,11) = 2 since 3 has one digit and 11 has two digits.\n\nFind the minimum value of F(A,B) as (A,B) ranges over all pairs of positive integers such that N = A \\times B.\n\nConstraints\n\n1 \\leq N \\leq 10^{10}\n\nN is an integer.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\n\nOutput\n\nPrint the minimum value of F(A,B) as (A,B) ranges over all pairs of positive integers such that N = A \\times B.\n\nSample Input 1\n\n10000\n\nSample Output 1\n\n3\n\nF(A,B) has a minimum value of 3 at (A,B)=(100,100).\n\nSample Input 2\n\n1000003\n\nSample Output 2\n\n7\n\nThere are two pairs (A,B) that satisfy the condition: (1,1000003) and (1000003,1). For these pairs, F(1,1000003)=F(1000003,1)=7.\n\nSample Input 3\n\n9876543210\n\nSample Output 3\n\n6", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s781757878", "group_id": "codeNet:p03775", "input_text": "program dolphin; \n\nvar n,i,d,s: qword;\n min,c : byte;\n\n\nbegin \n\nread(n);\ns:=n;\nc:=0;\nwhile s<>0 do begin\n c:=c+1;\n s:=s div 10;\n\n end;\nmin:=c;\nfor i:=2 to n div 2 do begin\n c:=0;\n if n mod i=0 then begin if n div i>i then s:=n div i else s:=i;\n while s<>0 do begin\n c:=c+1;\n s:=s div 10;\n\n end;\n\n if min0 do begin\n c:=c+1;\n s:=s div 10;\n\n end;\nmin:=c;\nfor i:=2 to n div 2 do begin\n c:=0;\n if n mod i=0 then begin if n div i>i then s:=n div i else s:=i;\n while s<>0 do begin\n c:=c+1;\n s:=s div 10;\n\n end;\n\n if min0) do\n begin\n inc(ans);now:=now div 10;\n end;\n exit(ans);\nend;\nbegin\n readln(n);\n ans:=20;\n for i:=1 to trunc(sqrt(n)) do\n if (n mod i=0) then\n begin\n\t t:=max(tryit(i),tryit(n div i));\n\t if (t0) do\n begin\n inc(ans);now:=now div 10;\n end;\n exit(ans);\nend;\nbegin\n readln(n);\n ans:=20;\n for i:=1 to trunc(sqrt(n)) do\n if (n mod i=0) then\n begin\n\t t:=max(tryit(i),tryit(n div i));\n\t if (tm) do inc(i);\n\twhile (v[j]j);\n if (ilx) then qsort(lx,j);\nend;\nfunction gcd(a,b:longint):longint;\nbegin\n if (b=0) then exit(a);\n exit(gcd(b,a mod b));\nend;\nfunction calc(i,j:longint):int64;\nvar ans:int64;\n t:array[0..100] of longint;\n ii,jj,tt,g:longint;\nbegin\n for ii:=1 to j do\n\tt[ii]:=i-j+ii;\n for ii:=1 to j do\n begin\n tt:=ii;\n for jj:=1 to j do\n\tbegin\n\t g:=gcd(t[jj],tt);\n\t tt:=tt div g;\n\t t[jj]:=t[jj] div g;\n\tend;\n end;\n ans:=1;\n for ii:=1 to j do\n\tans:=int64(ans*t[ii]);\n exit(ans);\nend;\nbegin\n randomize;\n readln(n,a,b);\n for i:=1 to n do\n\tread(v[i]);\n qsort(1,n);\n sum:=0;\n for i:=1 to a do\n\tsum:=sum+v[i];\n ans:=sum/a;\n writeln(ans:0:6);\n tot1:=0;tot2:=0;\n for i:=1 to n do\n\tif (v[i]=v[a]) then inc(tot1);\n left:=1;\n while (left<=n) and (v[left]<>v[a]) do inc(left);\n dec(left);\n a:=a-left;b:=b-left;\n anss:=0;\nif (left=0) then\nbegin\n for i:=a to b do\n anss:=anss+calc(tot1,i);\nend else anss:=calc(tot1,a);\n writeln(anss);\nend.\n ", "language": "Pascal", "metadata": {"date": 1490577612, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03776.html", "problem_id": "p03776", "resource_group": "low_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/Pascal/s016584674.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s016584674", "user_id": "u331121156"}, "prompt_components": {"gold_output": "4.500000\n1\n", "input_to_evaluate": "var n,i,j,a,b,tot1,tot2,left:longint;\n v:array[0..57] of int64;\n\tans:real;\n\tsum,anss:int64;\nprocedure qsort(lx,rx:longint);\nvar i,j:longint;\n m,t:int64;\nbegin\n i:=lx;j:=rx;m:=v[random(rx-lx+1)+lx];\n repeat\n while (v[i]>m) do inc(i);\n\twhile (v[j]j);\n if (ilx) then qsort(lx,j);\nend;\nfunction gcd(a,b:longint):longint;\nbegin\n if (b=0) then exit(a);\n exit(gcd(b,a mod b));\nend;\nfunction calc(i,j:longint):int64;\nvar ans:int64;\n t:array[0..100] of longint;\n ii,jj,tt,g:longint;\nbegin\n for ii:=1 to j do\n\tt[ii]:=i-j+ii;\n for ii:=1 to j do\n begin\n tt:=ii;\n for jj:=1 to j do\n\tbegin\n\t g:=gcd(t[jj],tt);\n\t tt:=tt div g;\n\t t[jj]:=t[jj] div g;\n\tend;\n end;\n ans:=1;\n for ii:=1 to j do\n\tans:=int64(ans*t[ii]);\n exit(ans);\nend;\nbegin\n randomize;\n readln(n,a,b);\n for i:=1 to n do\n\tread(v[i]);\n qsort(1,n);\n sum:=0;\n for i:=1 to a do\n\tsum:=sum+v[i];\n ans:=sum/a;\n writeln(ans:0:6);\n tot1:=0;tot2:=0;\n for i:=1 to n do\n\tif (v[i]=v[a]) then inc(tot1);\n left:=1;\n while (left<=n) and (v[left]<>v[a]) do inc(left);\n dec(left);\n a:=a-left;b:=b-left;\n anss:=0;\nif (left=0) then\nbegin\n for i:=a to b do\n anss:=anss+calc(tot1,i);\nend else anss:=calc(tot1,a);\n writeln(anss);\nend.\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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1347, "cpu_time_ms": 2, "memory_kb": 128}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s144573999", "group_id": "codeNet:p03777", "input_text": "program Project1;\n\n{$APPTYPE CONSOLE}\n\nuses\n SysUtils;\nvar\n a:string;\nbegin\n try\n { TODO -oUser -cConsole メイン : ここにコードを記述してください }\n Readln(a);\n\n if (a[1] = a[3]) then\n Writeln('H')\n else\n Writeln('D');\n Readln;\n except\n on E: Exception do\n Writeln(E.ClassName, ': ', E.Message);\n end;\nend.\n", "language": "Pascal", "metadata": {"date": 1515180979, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03777.html", "problem_id": "p03777", "resource_group": "low_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/Pascal/s144573999.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s144573999", "user_id": "u755925739"}, "prompt_components": {"gold_output": "H\n", "input_to_evaluate": "program Project1;\n\n{$APPTYPE CONSOLE}\n\nuses\n SysUtils;\nvar\n a:string;\nbegin\n try\n { TODO -oUser -cConsole メイン : ここにコードを記述してください }\n Readln(a);\n\n if (a[1] = a[3]) then\n Writeln('H')\n else\n Writeln('D');\n Readln;\n except\n on E: Exception do\n Writeln(E.ClassName, ': ', E.Message);\n end;\nend.\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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s571048477", "group_id": "codeNet:p03782", "input_text": "var\n\tdp1:array[0..5000]of Boolean;\n\tdp2:array[0..5000,0..5000]of int64;\n\tsum:array[0..5001]of int64;\n\tn,k,i,j,id,cnt:Longint;\n\tflag:Boolean;\n\ta:array[1..5000]of Longint;\nbegin\n\tread(n,k);\n\tfor i:=1 to n do read(a[i]);\n\tdp2[n][0]:=1;\n\tfor i:=n downto 1 do begin\n\t\tfor j:=0 to k do dp2[i-1][j]:=dp2[i][j];\n\t\tfor j:=0 to k-a[i] do inc(dp2[i-1][j+a[i]],dp2[i][j]);\n\tend;\n\tdp1[0]:=true;\n\tfor i:=1 to n do begin\n\t\tsum[0]:=0;\n\t\tfor j:=0 to k do sum[j+1]:=sum[j]+dp2[i][j];\n\t\tflag:=false;\n\t\tfor j:=0 to k do if dp1[j]then begin\n\t\t\tid:=k-a[i]-j;\n\t\t\tif id<0 then id:=0;\n\t\t\tif sum[k-j]-sum[id]>0 then begin\n\t\t\t\tflag:=true;\n\t\t\t\tbreak;\n\t\t\tend;\n\t\tend;\n\t\tif not flag then inc(cnt);\n\t\tfor j:=k downto a[i] do dp1[j]:=dp1[j]or dp1[j-a[i]];\n\tend;\n\twriteln(cnt);\nend.", "language": "Pascal", "metadata": {"date": 1539173594, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03782.html", "problem_id": "p03782", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03782/input.txt", "sample_output_relpath": "derived/input_output/data/p03782/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03782/Pascal/s571048477.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s571048477", "user_id": "u657913472"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "var\n\tdp1:array[0..5000]of Boolean;\n\tdp2:array[0..5000,0..5000]of int64;\n\tsum:array[0..5001]of int64;\n\tn,k,i,j,id,cnt:Longint;\n\tflag:Boolean;\n\ta:array[1..5000]of Longint;\nbegin\n\tread(n,k);\n\tfor i:=1 to n do read(a[i]);\n\tdp2[n][0]:=1;\n\tfor i:=n downto 1 do begin\n\t\tfor j:=0 to k do dp2[i-1][j]:=dp2[i][j];\n\t\tfor j:=0 to k-a[i] do inc(dp2[i-1][j+a[i]],dp2[i][j]);\n\tend;\n\tdp1[0]:=true;\n\tfor i:=1 to n do begin\n\t\tsum[0]:=0;\n\t\tfor j:=0 to k do sum[j+1]:=sum[j]+dp2[i][j];\n\t\tflag:=false;\n\t\tfor j:=0 to k do if dp1[j]then begin\n\t\t\tid:=k-a[i]-j;\n\t\t\tif id<0 then id:=0;\n\t\t\tif sum[k-j]-sum[id]>0 then begin\n\t\t\t\tflag:=true;\n\t\t\t\tbreak;\n\t\t\tend;\n\t\tend;\n\t\tif not flag then inc(cnt);\n\t\tfor j:=k downto a[i] do dp1[j]:=dp1[j]or dp1[j-a[i]];\n\tend;\n\twriteln(cnt);\nend.", "problem_context": "Score : 600 points\n\nProblem Statement\n\nAtCoDeer the deer has N cards with positive integers written on them. The number on the i-th card (1≤i≤N) is a_i.\nBecause he loves big numbers, he calls a subset of the cards good when the sum of the numbers written on the cards in the subset, is K or greater.\n\nThen, for each card i, he judges whether it is unnecessary or not, as follows:\n\nIf, for any good subset of the cards containing card i, the set that can be obtained by eliminating card i from the subset is also good, card i is unnecessary.\n\nOtherwise, card i is NOT unnecessary.\n\nFind the number of the unnecessary cards. Here, he judges each card independently, and he does not throw away cards that turn out to be unnecessary.\n\nConstraints\n\nAll input values are integers.\n\n1≤N≤5000\n\n1≤K≤5000\n\n1≤a_i≤10^9 (1≤i≤N)\n\nPartial Score\n\n300 points will be awarded for passing the test set satisfying N,K≤400.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN K\na_1 a_2 ... a_N\n\nOutput\n\nPrint the number of the unnecessary cards.\n\nSample Input 1\n\n3 6\n1 4 3\n\nSample Output 1\n\n1\n\nThere are two good sets: {2,3} and {1,2,3}.\n\nCard 1 is only contained in {1,2,3}, and this set without card 1, {2,3}, is also good. Thus, card 1 is unnecessary.\n\nFor card 2, a good set {2,3} without card 2, {3}, is not good. Thus, card 2 is NOT unnecessary.\n\nNeither is card 3 for a similar reason, hence the answer is 1.\n\nSample Input 2\n\n5 400\n3 1 4 1 5\n\nSample Output 2\n\n5\n\nIn this case, there is no good set. Therefore, all the cards are unnecessary.\n\nSample Input 3\n\n6 20\n10 4 3 10 25 2\n\nSample Output 3\n\n3", "sample_input": "3 6\n1 4 3\n"}, "reference_outputs": ["1\n"], "source_document_id": "p03782", "source_text": "Score : 600 points\n\nProblem Statement\n\nAtCoDeer the deer has N cards with positive integers written on them. The number on the i-th card (1≤i≤N) is a_i.\nBecause he loves big numbers, he calls a subset of the cards good when the sum of the numbers written on the cards in the subset, is K or greater.\n\nThen, for each card i, he judges whether it is unnecessary or not, as follows:\n\nIf, for any good subset of the cards containing card i, the set that can be obtained by eliminating card i from the subset is also good, card i is unnecessary.\n\nOtherwise, card i is NOT unnecessary.\n\nFind the number of the unnecessary cards. Here, he judges each card independently, and he does not throw away cards that turn out to be unnecessary.\n\nConstraints\n\nAll input values are integers.\n\n1≤N≤5000\n\n1≤K≤5000\n\n1≤a_i≤10^9 (1≤i≤N)\n\nPartial Score\n\n300 points will be awarded for passing the test set satisfying N,K≤400.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN K\na_1 a_2 ... a_N\n\nOutput\n\nPrint the number of the unnecessary cards.\n\nSample Input 1\n\n3 6\n1 4 3\n\nSample Output 1\n\n1\n\nThere are two good sets: {2,3} and {1,2,3}.\n\nCard 1 is only contained in {1,2,3}, and this set without card 1, {2,3}, is also good. Thus, card 1 is unnecessary.\n\nFor card 2, a good set {2,3} without card 2, {3}, is not good. Thus, card 2 is NOT unnecessary.\n\nNeither is card 3 for a similar reason, hence the answer is 1.\n\nSample Input 2\n\n5 400\n3 1 4 1 5\n\nSample Output 2\n\n5\n\nIn this case, there is no good set. Therefore, all the cards are unnecessary.\n\nSample Input 3\n\n6 20\n10 4 3 10 25 2\n\nSample Output 3\n\n3", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 748, "cpu_time_ms": 370, "memory_kb": 195456}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s299525850", "group_id": "codeNet:p03782", "input_text": "var\n\tdp1:array[0..5000]of Boolean;\n\tdp2:array[0..5000,0..5000]of Longint;\n\tsum:array[0..5001]of int64;\n\tn,k,i,j,id,cnt:Longint;\n\tflag:Boolean;\n\ta:array[1..5000]of Longint;\nbegin\n\tread(n,k);\n\tfor i:=1 to n do read(a[i]);\n\tdp2[n][0]:=1;\n\tfor i:=n downto 1 do begin\n\t\tfor j:=0 to k do dp2[i-1][j]:=dp2[i][j];\n\t\tfor j:=0 to k-a[i] do inc(dp2[i-1][j+a[i]],dp2[i][j]);\n\tend;\n\tdp1[0]:=true;\n\tfor i:=1 to n do begin\n\t\tsum[0]:=0;\n\t\tfor j:=0 to k do sum[j+1]:=sum[j]+dp2[i][j];\n\t\tflag:=false;\n\t\tfor j:=0 to k do if dp1[j]then begin\n\t\t\tid:=k-a[i]-j;\n\t\t\tif id<0 then id:=0;\n\t\t\tif sum[k-j]-sum[id]>0 then begin\n\t\t\t\tflag:=true;\n\t\t\t\tbreak;\n\t\t\tend;\n\t\tend;\n\t\tif not flag then inc(cnt);\n\t\tfor j:=k downto a[i] do dp1[j]:=dp1[j]or dp1[j-a[i]];\n\tend;\n\twriteln(cnt);\nend.", "language": "Pascal", "metadata": {"date": 1539173518, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03782.html", "problem_id": "p03782", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03782/input.txt", "sample_output_relpath": "derived/input_output/data/p03782/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03782/Pascal/s299525850.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s299525850", "user_id": "u657913472"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "var\n\tdp1:array[0..5000]of Boolean;\n\tdp2:array[0..5000,0..5000]of Longint;\n\tsum:array[0..5001]of int64;\n\tn,k,i,j,id,cnt:Longint;\n\tflag:Boolean;\n\ta:array[1..5000]of Longint;\nbegin\n\tread(n,k);\n\tfor i:=1 to n do read(a[i]);\n\tdp2[n][0]:=1;\n\tfor i:=n downto 1 do begin\n\t\tfor j:=0 to k do dp2[i-1][j]:=dp2[i][j];\n\t\tfor j:=0 to k-a[i] do inc(dp2[i-1][j+a[i]],dp2[i][j]);\n\tend;\n\tdp1[0]:=true;\n\tfor i:=1 to n do begin\n\t\tsum[0]:=0;\n\t\tfor j:=0 to k do sum[j+1]:=sum[j]+dp2[i][j];\n\t\tflag:=false;\n\t\tfor j:=0 to k do if dp1[j]then begin\n\t\t\tid:=k-a[i]-j;\n\t\t\tif id<0 then id:=0;\n\t\t\tif sum[k-j]-sum[id]>0 then begin\n\t\t\t\tflag:=true;\n\t\t\t\tbreak;\n\t\t\tend;\n\t\tend;\n\t\tif not flag then inc(cnt);\n\t\tfor j:=k downto a[i] do dp1[j]:=dp1[j]or dp1[j-a[i]];\n\tend;\n\twriteln(cnt);\nend.", "problem_context": "Score : 600 points\n\nProblem Statement\n\nAtCoDeer the deer has N cards with positive integers written on them. The number on the i-th card (1≤i≤N) is a_i.\nBecause he loves big numbers, he calls a subset of the cards good when the sum of the numbers written on the cards in the subset, is K or greater.\n\nThen, for each card i, he judges whether it is unnecessary or not, as follows:\n\nIf, for any good subset of the cards containing card i, the set that can be obtained by eliminating card i from the subset is also good, card i is unnecessary.\n\nOtherwise, card i is NOT unnecessary.\n\nFind the number of the unnecessary cards. Here, he judges each card independently, and he does not throw away cards that turn out to be unnecessary.\n\nConstraints\n\nAll input values are integers.\n\n1≤N≤5000\n\n1≤K≤5000\n\n1≤a_i≤10^9 (1≤i≤N)\n\nPartial Score\n\n300 points will be awarded for passing the test set satisfying N,K≤400.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN K\na_1 a_2 ... a_N\n\nOutput\n\nPrint the number of the unnecessary cards.\n\nSample Input 1\n\n3 6\n1 4 3\n\nSample Output 1\n\n1\n\nThere are two good sets: {2,3} and {1,2,3}.\n\nCard 1 is only contained in {1,2,3}, and this set without card 1, {2,3}, is also good. Thus, card 1 is unnecessary.\n\nFor card 2, a good set {2,3} without card 2, {3}, is not good. Thus, card 2 is NOT unnecessary.\n\nNeither is card 3 for a similar reason, hence the answer is 1.\n\nSample Input 2\n\n5 400\n3 1 4 1 5\n\nSample Output 2\n\n5\n\nIn this case, there is no good set. Therefore, all the cards are unnecessary.\n\nSample Input 3\n\n6 20\n10 4 3 10 25 2\n\nSample Output 3\n\n3", "sample_input": "3 6\n1 4 3\n"}, "reference_outputs": ["1\n"], "source_document_id": "p03782", "source_text": "Score : 600 points\n\nProblem Statement\n\nAtCoDeer the deer has N cards with positive integers written on them. The number on the i-th card (1≤i≤N) is a_i.\nBecause he loves big numbers, he calls a subset of the cards good when the sum of the numbers written on the cards in the subset, is K or greater.\n\nThen, for each card i, he judges whether it is unnecessary or not, as follows:\n\nIf, for any good subset of the cards containing card i, the set that can be obtained by eliminating card i from the subset is also good, card i is unnecessary.\n\nOtherwise, card i is NOT unnecessary.\n\nFind the number of the unnecessary cards. Here, he judges each card independently, and he does not throw away cards that turn out to be unnecessary.\n\nConstraints\n\nAll input values are integers.\n\n1≤N≤5000\n\n1≤K≤5000\n\n1≤a_i≤10^9 (1≤i≤N)\n\nPartial Score\n\n300 points will be awarded for passing the test set satisfying N,K≤400.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN K\na_1 a_2 ... a_N\n\nOutput\n\nPrint the number of the unnecessary cards.\n\nSample Input 1\n\n3 6\n1 4 3\n\nSample Output 1\n\n1\n\nThere are two good sets: {2,3} and {1,2,3}.\n\nCard 1 is only contained in {1,2,3}, and this set without card 1, {2,3}, is also good. Thus, card 1 is unnecessary.\n\nFor card 2, a good set {2,3} without card 2, {3}, is not good. Thus, card 2 is NOT unnecessary.\n\nNeither is card 3 for a similar reason, hence the answer is 1.\n\nSample Input 2\n\n5 400\n3 1 4 1 5\n\nSample Output 2\n\n5\n\nIn this case, there is no good set. Therefore, all the cards are unnecessary.\n\nSample Input 3\n\n6 20\n10 4 3 10 25 2\n\nSample Output 3\n\n3", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 750, "cpu_time_ms": 347, "memory_kb": 97920}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s759293161", "group_id": "codeNet:p03785", "input_text": "program j01;\nvar t:array[0..100086]of longint;\n n,x,k,r,l,i,ans,tmp,c:longint;\n\nprocedure qsort(l,r:longint);\nvar i,j,x,y:longint;\nbegin\n i:=l;j:=r;x:=t[(i+j)div 2];\n repeat\n while t[i]j;\n if ik do\n begin\n inc(ans);tmp:=c;\n while (l<=i-1)and(tmp>0) do\n begin\n inc(l);dec(tmp);\n end;\n end;\n end;\n writeln(ans);\nend.\n", "language": "Pascal", "metadata": {"date": 1489367776, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03785.html", "problem_id": "p03785", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03785/input.txt", "sample_output_relpath": "derived/input_output/data/p03785/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03785/Pascal/s759293161.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s759293161", "user_id": "u978960267"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "program j01;\nvar t:array[0..100086]of longint;\n n,x,k,r,l,i,ans,tmp,c:longint;\n\nprocedure qsort(l,r:longint);\nvar i,j,x,y:longint;\nbegin\n i:=l;j:=r;x:=t[(i+j)div 2];\n repeat\n while t[i]j;\n if ik do\n begin\n inc(ans);tmp:=c;\n while (l<=i-1)and(tmp>0) do\n begin\n inc(l);dec(tmp);\n end;\n end;\n end;\n writeln(ans);\nend.\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nEvery day, N passengers arrive at Takahashi Airport.\nThe i-th passenger arrives at time T_i.\n\nEvery passenger arrived at Takahashi airport travels to the city by bus. Each bus can accommodate up to C passengers.\nNaturally, a passenger cannot take a bus that departs earlier than the airplane arrives at the airport.\nAlso, a passenger will get angry if he/she is still unable to take a bus K units of time after the arrival of the airplane.\nFor that reason, it is necessary to arrange buses so that the i-th passenger can take a bus departing at time between T_i and T_i + K (inclusive).\n\nWhen setting the departure times for buses under this condition, find the minimum required number of buses.\nHere, the departure time for each bus does not need to be an integer, and there may be multiple buses that depart at the same time.\n\nConstraints\n\n2 \\leq N \\leq 100000\n\n1 \\leq C \\leq 10^9\n\n1 \\leq K \\leq 10^9\n\n1 \\leq T_i \\leq 10^9\n\nC, K and T_i are integers.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN C K\nT_1\nT_2\n:\nT_N\n\nOutput\n\nPrint the minimum required number of buses.\n\nSample Input 1\n\n5 3 5\n1\n2\n3\n6\n12\n\nSample Output 1\n\n3\n\nFor example, the following three buses are enough:\n\nA bus departing at time 4.5, that carries the passengers arriving at time 2 and 3.\n\nA bus departing at time 6, that carries the passengers arriving at time 1 and 6.\n\nA bus departing at time 12, that carries the passenger arriving at time 12.\n\nSample Input 2\n\n6 3 3\n7\n6\n2\n8\n10\n6\n\nSample Output 2\n\n3", "sample_input": "5 3 5\n1\n2\n3\n6\n12\n"}, "reference_outputs": ["3\n"], "source_document_id": "p03785", "source_text": "Score : 300 points\n\nProblem Statement\n\nEvery day, N passengers arrive at Takahashi Airport.\nThe i-th passenger arrives at time T_i.\n\nEvery passenger arrived at Takahashi airport travels to the city by bus. Each bus can accommodate up to C passengers.\nNaturally, a passenger cannot take a bus that departs earlier than the airplane arrives at the airport.\nAlso, a passenger will get angry if he/she is still unable to take a bus K units of time after the arrival of the airplane.\nFor that reason, it is necessary to arrange buses so that the i-th passenger can take a bus departing at time between T_i and T_i + K (inclusive).\n\nWhen setting the departure times for buses under this condition, find the minimum required number of buses.\nHere, the departure time for each bus does not need to be an integer, and there may be multiple buses that depart at the same time.\n\nConstraints\n\n2 \\leq N \\leq 100000\n\n1 \\leq C \\leq 10^9\n\n1 \\leq K \\leq 10^9\n\n1 \\leq T_i \\leq 10^9\n\nC, K and T_i are integers.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN C K\nT_1\nT_2\n:\nT_N\n\nOutput\n\nPrint the minimum required number of buses.\n\nSample Input 1\n\n5 3 5\n1\n2\n3\n6\n12\n\nSample Output 1\n\n3\n\nFor example, the following three buses are enough:\n\nA bus departing at time 4.5, that carries the passengers arriving at time 2 and 3.\n\nA bus departing at time 6, that carries the passengers arriving at time 1 and 6.\n\nA bus departing at time 12, that carries the passenger arriving at time 12.\n\nSample Input 2\n\n6 3 3\n7\n6\n2\n8\n10\n6\n\nSample Output 2\n\n3", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 24, "memory_kb": 512}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s257524461", "group_id": "codeNet:p03786", "input_text": "program j01;\nvar a,sum:array[0..100086]of int64;\n n,i:longint;\n\nprocedure qsort(l,r:longint);\nvar i,j,x,y:int64;\nbegin\n i:=l;j:=r;x:=a[(i+j)div 2];\n repeat\n while a[i]j;\n if i=a[2]) then\n writeln(n)\n else writeln(n-i);\nend.", "language": "Pascal", "metadata": {"date": 1489369029, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03786.html", "problem_id": "p03786", "resource_group": "low_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/Pascal/s257524461.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s257524461", "user_id": "u550756195"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "program j01;\nvar a,sum:array[0..100086]of int64;\n n,i:longint;\n\nprocedure qsort(l,r:longint);\nvar i,j,x,y:int64;\nbegin\n i:=l;j:=r;x:=a[(i+j)div 2];\n repeat\n while a[i]j;\n if i=a[2]) then\n writeln(n)\n else writeln(n-i);\nend.", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 622, "cpu_time_ms": 25, "memory_kb": 1664}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s546725893", "group_id": "codeNet:p03786", "input_text": "program j01;\nvar a,sum:array[0..100086]of longint;\n n,i:longint;\n\nprocedure qsort(l,r:longint);\nvar i,j,x,y:longint;\nbegin\n i:=l;j:=r;x:=a[(i+j)div 2];\n repeat\n while a[i]j;\n if ij;\n if idd2))or((ans[n]=1)and(dd=dd2)) then exit; \n if ch=ans[n] then\n begin\n for i:=1 to n do\n if ans[i]=0 then write('S') else write('W');\n halt;\n end;\nend;\n\nbegin\n readln(n);readln(s);\n ans[1]:=0;ans[2]:=0;\n check;\n ans[1]:=0;ans[2]:=1;\n check;\n ans[1]:=1;ans[2]:=0;\n check;\n ans[1]:=1;ans[2]:=1;\n check;\n writeln(-1);\nend.\n\n", "language": "Pascal", "metadata": {"date": 1487470931, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03800.html", "problem_id": "p03800", "resource_group": "low_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/Pascal/s342884965.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s342884965", "user_id": "u550756195"}, "prompt_components": {"gold_output": "SSSWWS\n", "input_to_evaluate": "program j01;\nvar s:ansistring;\n ans:array[0..100086]of longint;\n c:array[0..1]of char;\n flag:boolean;\n i,n:longint;\n\nprocedure check;\nvar i:longint;dd,dd2:longint;ch:longint;\nbegin\n dd:=ord(s[1]='o');\n if ((dd=1)and(ans[1]=0))or((dd=0)and(ans[1]=1)) then\n ch:=ans[2] else ch:=1-ans[2];\n for i:=2 to n-1 do\n begin\n dd:=ord(s[i]='o');\n if((dd=1)and(ans[i]=0))or((dd=0)and(ans[i]=1)) then\n ans[i+1]:=ans[i-1] else ans[i+1]:=1-ans[i-1];\n end;\n dd:=ord(s[n]='o');\n dd2:=ord(ans[n-1]=ans[1]);\n if((ans[n]=0)and(dd<>dd2))or((ans[n]=1)and(dd=dd2)) then exit; \n if ch=ans[n] then\n begin\n for i:=1 to n do\n if ans[i]=0 then write('S') else write('W');\n halt;\n end;\nend;\n\nbegin\n readln(n);readln(s);\n ans[1]:=0;ans[2]:=0;\n check;\n ans[1]:=0;ans[2]:=1;\n check;\n ans[1]:=1;ans[2]:=0;\n check;\n ans[1]:=1;ans[2]:=1;\n check;\n writeln(-1);\nend.\n\n", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 887, "cpu_time_ms": 6, "memory_kb": 768}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s619365610", "group_id": "codeNet:p03801", "input_text": "program project1;\ntype la=record\n sum,dist,le:longint;\n end;\nvar a:array[1..100000,0..1] of longint;\n layer:array[1..100000] of la;\n ans:array[1..100000]of longint;\n n,i,t,m,k,sum,min:longint;\n\nprocedure qs(l,r:longint);//假设被排序的数组是a,且快排后按升序排列）\nvar i,j,m,t,c:longint;\nbegin\n i:=l;\n j:=r;//(l（left）,r（right）表示快排的左右区间)\n m:=a[(l+r) div 2,1];//注意：本句不能写成：m:=(l+r)div2;\n repeat\n while a[i,1]>m do inc(i);\n while a[j,1]'互换;\n if i<=j then\n begin\n t:=a[i,1];\n a[i,1]:=a[j,1];\n a[j,1]:=t;\n c:=a[i,0];\n a[i,0]:= a[j,0];\n a[j,0]:= c;\n inc(i);\n dec(j);\n end;\n until i>j;\n if lm do inc(i);\n while a[j,1]'互换;\n if i<=j then\n begin\n t:=a[i,1];\n a[i,1]:=a[j,1];\n a[j,1]:=t;\n c:=a[i,0];\n a[i,0]:= a[j,0];\n a[j,0]:= c;\n inc(i);\n dec(j);\n end;\n until i>j;\n if lb.w then exit(a.w>b.w) else exit(a.id>b.id);\nend;\n\nprocedure sort(l,r:longint);\nvar i,j:longint;x,y:xx;\nbegin\n i:=l;j:=r;x:=a[(i+j)div 2];\n repeat\n while cmp(a[i],x) do inc(i);\n while cmp(x,a[j]) do dec(j);\n if i<=j then\n begin\n y:=a[i];a[i]:=a[j];a[j]:=y;\n inc(i);dec(j);\n end;\n until i>j;\n if ib.w then exit(a.w>b.w) else exit(a.id>b.id);\nend;\n\nprocedure sort(l,r:longint);\nvar i,j:longint;x,y:xx;\nbegin\n i:=l;j:=r;x:=a[(i+j)div 2];\n repeat\n while cmp(a[i],x) do inc(i);\n while cmp(x,a[j]) do dec(j);\n if i<=j then\n begin\n y:=a[i];a[i]:=a[j];a[j]:=y;\n inc(i);dec(j);\n end;\n until i>j;\n if ia[j+y-1][i+x-1] then begin\n tf:=true;\n break;\n end;\n if (x=m)and(y=m) then begin\n Writeln('Yes');\n Readln;\n exit;\n end;\n end;\n if tf then begin\n tf:=false;\n break;\n end;\n end;\n\n Writeln('No');\n Readln;\n except\n on E: Exception do\n Writeln(E.ClassName, ': ', E.Message);\n end;\nend.\n", "language": "Pascal", "metadata": {"date": 1516401065, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03804.html", "problem_id": "p03804", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03804/input.txt", "sample_output_relpath": "derived/input_output/data/p03804/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03804/Pascal/s935902938.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s935902938", "user_id": "u755925739"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "program Project1;\n\n{$APPTYPE CONSOLE}\n\nuses\n SysUtils;\nvar\n h,w,i,j,count,x,y,sw,m,n:Integer;\n a,b:array of string;\n tf:Boolean;\nbegin\n try\n { TODO -oUser -cConsole Main : ここにコードを記述してください }\n Read(n);\n Readln(m);\n SetLength(a,n+1);\n SetLength(b,m+1);\n\n for i := 1 to n do\n Readln(a[i]);\n for i := 1 to m do\n Readln(b[i]);\n\n tf:=false;\n for j := 1 to n-m+1 do\n for i := 1 to n-m+1 do\n for y := 1 to m do begin\n for x := 1 to m do begin\n if b[y][x]<>a[j+y-1][i+x-1] then begin\n tf:=true;\n break;\n end;\n if (x=m)and(y=m) then begin\n Writeln('Yes');\n Readln;\n exit;\n end;\n end;\n if tf then begin\n tf:=false;\n break;\n end;\n end;\n\n Writeln('No');\n Readln;\n except\n on E: Exception do\n Writeln(E.ClassName, ': ', E.Message);\n end;\nend.\n", "problem_context": "Score : 200 points\n\nProblem Statement\n\nYou are given an image A composed of N rows and N columns of pixels, and a template image B composed of M rows and M columns of pixels.\n\nA pixel is the smallest element of an image, and in this problem it is a square of size 1×1.\n\nAlso, the given images are binary images, and the color of each pixel is either white or black.\n\nIn the input, every pixel is represented by a character: . corresponds to a white pixel, and # corresponds to a black pixel.\n\nThe image A is given as N strings A_1,...,A_N.\n\nThe j-th character in the string A_i corresponds to the pixel at the i-th row and j-th column of the image A (1≦i,j≦N).\n\nSimilarly, the template image B is given as M strings B_1,...,B_M.\n\nThe j-th character in the string B_i corresponds to the pixel at the i-th row and j-th column of the template image B (1≦i,j≦M).\n\nDetermine whether the template image B is contained in the image A when only parallel shifts can be applied to the images.\n\nConstraints\n\n1≦M≦N≦50\n\nA_i is a string of length N consisting of # and ..\n\nB_i is a string of length M consisting of # and ..\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN M\nA_1\nA_2\n:\nA_N\nB_1\nB_2\n:\nB_M\n\nOutput\n\nPrint Yes if the template image B is contained in the image A. Print No otherwise.\n\nSample Input 1\n\n3 2\n#.#\n.#.\n#.#\n#.\n.#\n\nSample Output 1\n\nYes\n\nThe template image B is identical to the upper-left 2 × 2 subimage and the lower-right 2 × 2 subimage of A. Thus, the output should be Yes.\n\nSample Input 2\n\n4 1\n....\n....\n....\n....\n#\n\nSample Output 2\n\nNo\n\nThe template image B, composed of a black pixel, is not contained in the image A composed of white pixels.", "sample_input": "3 2\n#.#\n.#.\n#.#\n#.\n.#\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p03804", "source_text": "Score : 200 points\n\nProblem Statement\n\nYou are given an image A composed of N rows and N columns of pixels, and a template image B composed of M rows and M columns of pixels.\n\nA pixel is the smallest element of an image, and in this problem it is a square of size 1×1.\n\nAlso, the given images are binary images, and the color of each pixel is either white or black.\n\nIn the input, every pixel is represented by a character: . corresponds to a white pixel, and # corresponds to a black pixel.\n\nThe image A is given as N strings A_1,...,A_N.\n\nThe j-th character in the string A_i corresponds to the pixel at the i-th row and j-th column of the image A (1≦i,j≦N).\n\nSimilarly, the template image B is given as M strings B_1,...,B_M.\n\nThe j-th character in the string B_i corresponds to the pixel at the i-th row and j-th column of the template image B (1≦i,j≦M).\n\nDetermine whether the template image B is contained in the image A when only parallel shifts can be applied to the images.\n\nConstraints\n\n1≦M≦N≦50\n\nA_i is a string of length N consisting of # and ..\n\nB_i is a string of length M consisting of # and ..\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN M\nA_1\nA_2\n:\nA_N\nB_1\nB_2\n:\nB_M\n\nOutput\n\nPrint Yes if the template image B is contained in the image A. Print No otherwise.\n\nSample Input 1\n\n3 2\n#.#\n.#.\n#.#\n#.\n.#\n\nSample Output 1\n\nYes\n\nThe template image B is identical to the upper-left 2 × 2 subimage and the lower-right 2 × 2 subimage of A. Thus, the output should be Yes.\n\nSample Input 2\n\n4 1\n....\n....\n....\n....\n#\n\nSample Output 2\n\nNo\n\nThe template image B, composed of a black pixel, is not contained in the image A composed of white pixels.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1002, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s191052003", "group_id": "codeNet:p03805", "input_text": "var\n\tn,m,i,a,b:Longint;\n\tused:array[1..8]of Boolean;\n\tG:array[1..8,1..8]of Boolean;\nfunction f(u,cnt:Longint):Longint;\nvar i,ret:Longint;\nbegin\n\tif cnt=n then begin\n\t\tf:=1;\n\t\texit;\n\tend;\n\tret:=0;\n\tfor i:=1 to n do begin\n\t\tif G[u,i]and not used[i]then begin\n\t\t\tused[i]:=True;\n\t\t\tinc(ret,f(i,cnt+1));\n\t\t\tused[i]:=False;\n\t\tend;\n\tend;\n\tf:=ret;\nend;\nbegin\n\tread(n,m);\n\tif(n=8)and(m=28)then begin\n\t\twriteln('5040');\n\t\texit;\n\tend;\n\tif(n=8)and(m=27)then begin\n\t\twriteln('5600');\n\t\texit;\n\tend;\n\tfor i:=1 to m do begin\n\t\tread(a,b);\n\t\tif b<>1 then begin\n\t\t\tG[a,b]:=True;\n\t\tend;\n\t\tif a<>1 then begin\n\t\t\tG[b,a]:=True;\n\t\tend;\n\tend;\n\tused[1]:=True;\n\twriteln(f(1,1));\nend.", "language": "Pascal", "metadata": {"date": 1541922476, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03805.html", "problem_id": "p03805", "resource_group": "low_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/Pascal/s191052003.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s191052003", "user_id": "u657913472"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "var\n\tn,m,i,a,b:Longint;\n\tused:array[1..8]of Boolean;\n\tG:array[1..8,1..8]of Boolean;\nfunction f(u,cnt:Longint):Longint;\nvar i,ret:Longint;\nbegin\n\tif cnt=n then begin\n\t\tf:=1;\n\t\texit;\n\tend;\n\tret:=0;\n\tfor i:=1 to n do begin\n\t\tif G[u,i]and not used[i]then begin\n\t\t\tused[i]:=True;\n\t\t\tinc(ret,f(i,cnt+1));\n\t\t\tused[i]:=False;\n\t\tend;\n\tend;\n\tf:=ret;\nend;\nbegin\n\tread(n,m);\n\tif(n=8)and(m=28)then begin\n\t\twriteln('5040');\n\t\texit;\n\tend;\n\tif(n=8)and(m=27)then begin\n\t\twriteln('5600');\n\t\texit;\n\tend;\n\tfor i:=1 to m do begin\n\t\tread(a,b);\n\t\tif b<>1 then begin\n\t\t\tG[a,b]:=True;\n\t\tend;\n\t\tif a<>1 then begin\n\t\t\tG[b,a]:=True;\n\t\tend;\n\tend;\n\tused[1]:=True;\n\twriteln(f(1,1));\nend.", "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≤i1 then begin\n\t\t\tG[a,b]:=True;\n\t\tend;\n\t\tif a<>1 then begin\n\t\t\tG[b,a]:=True;\n\t\tend;\n\tend;\n\tused[1]:=True;\n\twriteln(f(1,1));\nend.", "language": "Pascal", "metadata": {"date": 1541922332, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03805.html", "problem_id": "p03805", "resource_group": "low_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/Pascal/s026777552.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s026777552", "user_id": "u657913472"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "var\n\tn,m,i,a,b:Longint;\n\tused:array[1..8]of Boolean;\n\tG:array[1..8,1..8]of Boolean;\nfunction f(u,cnt:Longint):Longint;\nvar i,ret:Longint;\nbegin\n\tif cnt=n then begin\n\t\tf:=1;\n\t\texit;\n\tend;\n\tret:=0;\n\tfor i:=1 to n do begin\n\t\tif G[u,i]and not used[i]then begin\n\t\t\tused[i]:=True;\n\t\t\tinc(ret,f(i,cnt+1));\n\t\t\tused[i]:=False;\n\t\tend;\n\tend;\n\tf:=ret;\nend;\nbegin\n\tread(n,m);\n\tfor i:=1 to m do begin\n\t\tread(a,b);\n\t\tif b<>1 then begin\n\t\t\tG[a,b]:=True;\n\t\tend;\n\t\tif a<>1 then begin\n\t\t\tG[b,a]:=True;\n\t\tend;\n\tend;\n\tused[1]:=True;\n\twriteln(f(1,1));\nend.", "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≤i0 then begin\n\t\t\tmp:=min(mp+x,100);\n\t\t\tfor j:=mp-x downto 0 do p[j+x]:=min(p[j+x],p[j]+c);\n\t\tend else if x<0 then begin\n\t\t\tmm:=min(mm-x,100);\n\t\t\tfor j:=mm+x downto 0 do m[j-x]:=min(m[j-x],m[j]+c);\n\t\tend else ans:=min(ans,c);\n\tend;\n\tfor i:=1 to 100 do ans:=min(ans,p[i]+m[i]);\n\tif ans<10000 then writeln(ans)else writeln(-1);\nend.", "language": "Pascal", "metadata": {"date": 1541924340, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03806.html", "problem_id": "p03806", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03806/input.txt", "sample_output_relpath": "derived/input_output/data/p03806/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03806/Pascal/s505191446.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s505191446", "user_id": "u657913472"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "uses math;\nvar\n\tans,n,Ma,Mb,i,j,a,b,c,x,mp,mm:Longint;\n\tp,m:array[0..100]of Longint;\nbegin\n\tread(n,Ma,Mb);\n\tans:=10000;\n\tfor i:=1 to 100 do begin\n\t\tp[i]:=ans;\n\t\tm[i]:=ans;\n\tend;\n\tfor i:=1 to n do begin\n\t\tread(a,b,c);\n\t\tx:=Ma*b-Mb*a;\n\t\tif x>0 then begin\n\t\t\tmp:=min(mp+x,100);\n\t\t\tfor j:=mp-x downto 0 do p[j+x]:=min(p[j+x],p[j]+c);\n\t\tend else if x<0 then begin\n\t\t\tmm:=min(mm-x,100);\n\t\t\tfor j:=mm+x downto 0 do m[j-x]:=min(m[j-x],m[j]+c);\n\t\tend else ans:=min(ans,c);\n\tend;\n\tfor i:=1 to 100 do ans:=min(ans,p[i]+m[i]);\n\tif ans<10000 then writeln(ans)else writeln(-1);\nend.", "problem_context": "Score : 400 points\n\nProblem Statement\n\nDolphin is planning to generate a small amount of a certain chemical substance C.\n\nIn order to generate the substance C, he must prepare a solution which is a mixture of two substances A and B in the ratio of M_a:M_b.\n\nHe does not have any stock of chemicals, however, so he will purchase some chemicals at a local pharmacy.\n\nThe pharmacy sells N kinds of chemicals. For each kind of chemical, there is exactly one package of that chemical in stock.\n\nThe package of chemical i contains a_i grams of the substance A and b_i grams of the substance B, and is sold for c_i yen (the currency of Japan).\n\nDolphin will purchase some of these packages. For some reason, he must use all contents of the purchased packages to generate the substance C.\n\nFind the minimum amount of money required to generate the substance C.\n\nIf it is not possible to generate the substance C by purchasing any combination of packages at the pharmacy, report that fact.\n\nConstraints\n\n1≦N≦40\n\n1≦a_i,b_i≦10\n\n1≦c_i≦100\n\n1≦M_a,M_b≦10\n\ngcd(M_a,M_b)=1\n\na_i, b_i, c_i, M_a and M_b are integers.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN M_a M_b\na_1 b_1 c_1\na_2 b_2 c_2\n:\na_N b_N c_N\n\nOutput\n\nPrint the minimum amount of money required to generate the substance C. If it is not possible to generate the substance C, print -1 instead.\n\nSample Input 1\n\n3 1 1\n1 2 1\n2 1 2\n3 3 10\n\nSample Output 1\n\n3\n\nThe amount of money spent will be minimized by purchasing the packages of chemicals 1 and 2.\n\nIn this case, the mixture of the purchased chemicals will contain 3 grams of the substance A and 3 grams of the substance B, which are in the desired ratio: 3:3=1:1.\n\nThe total price of these packages is 3 yen.\n\nSample Input 2\n\n1 1 10\n10 10 10\n\nSample Output 2\n\n-1\n\nThe ratio 1:10 of the two substances A and B cannot be satisfied by purchasing any combination of the packages. Thus, the output should be -1.", "sample_input": "3 1 1\n1 2 1\n2 1 2\n3 3 10\n"}, "reference_outputs": ["3\n"], "source_document_id": "p03806", "source_text": "Score : 400 points\n\nProblem Statement\n\nDolphin is planning to generate a small amount of a certain chemical substance C.\n\nIn order to generate the substance C, he must prepare a solution which is a mixture of two substances A and B in the ratio of M_a:M_b.\n\nHe does not have any stock of chemicals, however, so he will purchase some chemicals at a local pharmacy.\n\nThe pharmacy sells N kinds of chemicals. For each kind of chemical, there is exactly one package of that chemical in stock.\n\nThe package of chemical i contains a_i grams of the substance A and b_i grams of the substance B, and is sold for c_i yen (the currency of Japan).\n\nDolphin will purchase some of these packages. For some reason, he must use all contents of the purchased packages to generate the substance C.\n\nFind the minimum amount of money required to generate the substance C.\n\nIf it is not possible to generate the substance C by purchasing any combination of packages at the pharmacy, report that fact.\n\nConstraints\n\n1≦N≦40\n\n1≦a_i,b_i≦10\n\n1≦c_i≦100\n\n1≦M_a,M_b≦10\n\ngcd(M_a,M_b)=1\n\na_i, b_i, c_i, M_a and M_b are integers.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN M_a M_b\na_1 b_1 c_1\na_2 b_2 c_2\n:\na_N b_N c_N\n\nOutput\n\nPrint the minimum amount of money required to generate the substance C. If it is not possible to generate the substance C, print -1 instead.\n\nSample Input 1\n\n3 1 1\n1 2 1\n2 1 2\n3 3 10\n\nSample Output 1\n\n3\n\nThe amount of money spent will be minimized by purchasing the packages of chemicals 1 and 2.\n\nIn this case, the mixture of the purchased chemicals will contain 3 grams of the substance A and 3 grams of the substance B, which are in the desired ratio: 3:3=1:1.\n\nThe total price of these packages is 3 yen.\n\nSample Input 2\n\n1 1 10\n10 10 10\n\nSample Output 2\n\n-1\n\nThe ratio 1:10 of the two substances A and B cannot be satisfied by purchasing any combination of the packages. Thus, the output should be -1.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 568, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s821058481", "group_id": "codeNet:p03806", "input_text": "uses math;\nvar\n\tans,n,Ma,Mb,i,j,a,b,c,x,mp,mm:Longint;\n\tp,m:array[0..200]of Longint;\nbegin\n\tread(n,Ma,Mb);\n\tans:=10000;\n\tfor i:=1 to 200 do begin\n\t\tp[i]:=ans;\n\t\tm[i]:=ans;\n\tend;\n\tfor i:=1 to n do begin\n\t\tread(a,b,c);\n\t\tx:=Ma*b-Mb*a;\n\t\tif x>0 then begin\n\t\t\tmp:=min(mp+x,200);\n\t\t\tfor j:=mp-x downto 0 do p[j+x]:=min(p[j+x],p[j]+c);\n\t\tend else if x<0 then begin\n\t\t\tmm:=min(mm-x,200);\n\t\t\tfor j:=mm+x downto 0 do m[j-x]:=min(m[j-x],m[j]+c);\n\t\tend else ans:=min(ans,c);\n\tend;\n\tfor i:=1 to 150 do ans:=min(ans,p[i]+m[i]);\n\tif ans<10000 then writeln(ans)else writeln(-1);\nend.", "language": "Pascal", "metadata": {"date": 1541924255, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03806.html", "problem_id": "p03806", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03806/input.txt", "sample_output_relpath": "derived/input_output/data/p03806/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03806/Pascal/s821058481.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s821058481", "user_id": "u657913472"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "uses math;\nvar\n\tans,n,Ma,Mb,i,j,a,b,c,x,mp,mm:Longint;\n\tp,m:array[0..200]of Longint;\nbegin\n\tread(n,Ma,Mb);\n\tans:=10000;\n\tfor i:=1 to 200 do begin\n\t\tp[i]:=ans;\n\t\tm[i]:=ans;\n\tend;\n\tfor i:=1 to n do begin\n\t\tread(a,b,c);\n\t\tx:=Ma*b-Mb*a;\n\t\tif x>0 then begin\n\t\t\tmp:=min(mp+x,200);\n\t\t\tfor j:=mp-x downto 0 do p[j+x]:=min(p[j+x],p[j]+c);\n\t\tend else if x<0 then begin\n\t\t\tmm:=min(mm-x,200);\n\t\t\tfor j:=mm+x downto 0 do m[j-x]:=min(m[j-x],m[j]+c);\n\t\tend else ans:=min(ans,c);\n\tend;\n\tfor i:=1 to 150 do ans:=min(ans,p[i]+m[i]);\n\tif ans<10000 then writeln(ans)else writeln(-1);\nend.", "problem_context": "Score : 400 points\n\nProblem Statement\n\nDolphin is planning to generate a small amount of a certain chemical substance C.\n\nIn order to generate the substance C, he must prepare a solution which is a mixture of two substances A and B in the ratio of M_a:M_b.\n\nHe does not have any stock of chemicals, however, so he will purchase some chemicals at a local pharmacy.\n\nThe pharmacy sells N kinds of chemicals. For each kind of chemical, there is exactly one package of that chemical in stock.\n\nThe package of chemical i contains a_i grams of the substance A and b_i grams of the substance B, and is sold for c_i yen (the currency of Japan).\n\nDolphin will purchase some of these packages. For some reason, he must use all contents of the purchased packages to generate the substance C.\n\nFind the minimum amount of money required to generate the substance C.\n\nIf it is not possible to generate the substance C by purchasing any combination of packages at the pharmacy, report that fact.\n\nConstraints\n\n1≦N≦40\n\n1≦a_i,b_i≦10\n\n1≦c_i≦100\n\n1≦M_a,M_b≦10\n\ngcd(M_a,M_b)=1\n\na_i, b_i, c_i, M_a and M_b are integers.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN M_a M_b\na_1 b_1 c_1\na_2 b_2 c_2\n:\na_N b_N c_N\n\nOutput\n\nPrint the minimum amount of money required to generate the substance C. If it is not possible to generate the substance C, print -1 instead.\n\nSample Input 1\n\n3 1 1\n1 2 1\n2 1 2\n3 3 10\n\nSample Output 1\n\n3\n\nThe amount of money spent will be minimized by purchasing the packages of chemicals 1 and 2.\n\nIn this case, the mixture of the purchased chemicals will contain 3 grams of the substance A and 3 grams of the substance B, which are in the desired ratio: 3:3=1:1.\n\nThe total price of these packages is 3 yen.\n\nSample Input 2\n\n1 1 10\n10 10 10\n\nSample Output 2\n\n-1\n\nThe ratio 1:10 of the two substances A and B cannot be satisfied by purchasing any combination of the packages. Thus, the output should be -1.", "sample_input": "3 1 1\n1 2 1\n2 1 2\n3 3 10\n"}, "reference_outputs": ["3\n"], "source_document_id": "p03806", "source_text": "Score : 400 points\n\nProblem Statement\n\nDolphin is planning to generate a small amount of a certain chemical substance C.\n\nIn order to generate the substance C, he must prepare a solution which is a mixture of two substances A and B in the ratio of M_a:M_b.\n\nHe does not have any stock of chemicals, however, so he will purchase some chemicals at a local pharmacy.\n\nThe pharmacy sells N kinds of chemicals. For each kind of chemical, there is exactly one package of that chemical in stock.\n\nThe package of chemical i contains a_i grams of the substance A and b_i grams of the substance B, and is sold for c_i yen (the currency of Japan).\n\nDolphin will purchase some of these packages. For some reason, he must use all contents of the purchased packages to generate the substance C.\n\nFind the minimum amount of money required to generate the substance C.\n\nIf it is not possible to generate the substance C by purchasing any combination of packages at the pharmacy, report that fact.\n\nConstraints\n\n1≦N≦40\n\n1≦a_i,b_i≦10\n\n1≦c_i≦100\n\n1≦M_a,M_b≦10\n\ngcd(M_a,M_b)=1\n\na_i, b_i, c_i, M_a and M_b are integers.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN M_a M_b\na_1 b_1 c_1\na_2 b_2 c_2\n:\na_N b_N c_N\n\nOutput\n\nPrint the minimum amount of money required to generate the substance C. If it is not possible to generate the substance C, print -1 instead.\n\nSample Input 1\n\n3 1 1\n1 2 1\n2 1 2\n3 3 10\n\nSample Output 1\n\n3\n\nThe amount of money spent will be minimized by purchasing the packages of chemicals 1 and 2.\n\nIn this case, the mixture of the purchased chemicals will contain 3 grams of the substance A and 3 grams of the substance B, which are in the desired ratio: 3:3=1:1.\n\nThe total price of these packages is 3 yen.\n\nSample Input 2\n\n1 1 10\n10 10 10\n\nSample Output 2\n\n-1\n\nThe ratio 1:10 of the two substances A and B cannot be satisfied by purchasing any combination of the packages. Thus, the output should be -1.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 568, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s559674231", "group_id": "codeNet:p03806", "input_text": "uses math;\nvar\n\tans,n,Ma,Mb,i,j,a,b,c,x,mp,mm:Longint;\n\tp,m:array[0..300]of Longint;\nbegin\n\tread(n,Ma,Mb);\n\tans:=10000;\n\tfor i:=1 to 300 do begin\n\t\tp[i]:=ans;\n\t\tm[i]:=ans;\n\tend;\n\tfor i:=1 to n do begin\n\t\tread(a,b,c);\n\t\tx:=Ma*b-Mb*a;\n\t\tif x>0 then begin\n\t\t\tfor j:=mp downto 0 do p[j+x]:=min(p[j+x],p[j]+c);\n\t\t\tmp:=min(mp+x,300);\n\t\tend else if x<0 then begin\n\t\t\tfor j:=mm downto 0 do m[j-x]:=min(m[j-x],m[j]+c);\n\t\t\tmm:=min(mm-x,300);\n\t\tend else ans:=min(ans,c);\n\tend;\n\tfor i:=1 to 200 do ans:=min(ans,p[i]+m[i]);\n\tif ans<10000 then writeln(ans)else writeln(-1);\nend.", "language": "Pascal", "metadata": {"date": 1541923863, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03806.html", "problem_id": "p03806", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03806/input.txt", "sample_output_relpath": "derived/input_output/data/p03806/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03806/Pascal/s559674231.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s559674231", "user_id": "u657913472"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "uses math;\nvar\n\tans,n,Ma,Mb,i,j,a,b,c,x,mp,mm:Longint;\n\tp,m:array[0..300]of Longint;\nbegin\n\tread(n,Ma,Mb);\n\tans:=10000;\n\tfor i:=1 to 300 do begin\n\t\tp[i]:=ans;\n\t\tm[i]:=ans;\n\tend;\n\tfor i:=1 to n do begin\n\t\tread(a,b,c);\n\t\tx:=Ma*b-Mb*a;\n\t\tif x>0 then begin\n\t\t\tfor j:=mp downto 0 do p[j+x]:=min(p[j+x],p[j]+c);\n\t\t\tmp:=min(mp+x,300);\n\t\tend else if x<0 then begin\n\t\t\tfor j:=mm downto 0 do m[j-x]:=min(m[j-x],m[j]+c);\n\t\t\tmm:=min(mm-x,300);\n\t\tend else ans:=min(ans,c);\n\tend;\n\tfor i:=1 to 200 do ans:=min(ans,p[i]+m[i]);\n\tif ans<10000 then writeln(ans)else writeln(-1);\nend.", "problem_context": "Score : 400 points\n\nProblem Statement\n\nDolphin is planning to generate a small amount of a certain chemical substance C.\n\nIn order to generate the substance C, he must prepare a solution which is a mixture of two substances A and B in the ratio of M_a:M_b.\n\nHe does not have any stock of chemicals, however, so he will purchase some chemicals at a local pharmacy.\n\nThe pharmacy sells N kinds of chemicals. For each kind of chemical, there is exactly one package of that chemical in stock.\n\nThe package of chemical i contains a_i grams of the substance A and b_i grams of the substance B, and is sold for c_i yen (the currency of Japan).\n\nDolphin will purchase some of these packages. For some reason, he must use all contents of the purchased packages to generate the substance C.\n\nFind the minimum amount of money required to generate the substance C.\n\nIf it is not possible to generate the substance C by purchasing any combination of packages at the pharmacy, report that fact.\n\nConstraints\n\n1≦N≦40\n\n1≦a_i,b_i≦10\n\n1≦c_i≦100\n\n1≦M_a,M_b≦10\n\ngcd(M_a,M_b)=1\n\na_i, b_i, c_i, M_a and M_b are integers.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN M_a M_b\na_1 b_1 c_1\na_2 b_2 c_2\n:\na_N b_N c_N\n\nOutput\n\nPrint the minimum amount of money required to generate the substance C. If it is not possible to generate the substance C, print -1 instead.\n\nSample Input 1\n\n3 1 1\n1 2 1\n2 1 2\n3 3 10\n\nSample Output 1\n\n3\n\nThe amount of money spent will be minimized by purchasing the packages of chemicals 1 and 2.\n\nIn this case, the mixture of the purchased chemicals will contain 3 grams of the substance A and 3 grams of the substance B, which are in the desired ratio: 3:3=1:1.\n\nThe total price of these packages is 3 yen.\n\nSample Input 2\n\n1 1 10\n10 10 10\n\nSample Output 2\n\n-1\n\nThe ratio 1:10 of the two substances A and B cannot be satisfied by purchasing any combination of the packages. Thus, the output should be -1.", "sample_input": "3 1 1\n1 2 1\n2 1 2\n3 3 10\n"}, "reference_outputs": ["3\n"], "source_document_id": "p03806", "source_text": "Score : 400 points\n\nProblem Statement\n\nDolphin is planning to generate a small amount of a certain chemical substance C.\n\nIn order to generate the substance C, he must prepare a solution which is a mixture of two substances A and B in the ratio of M_a:M_b.\n\nHe does not have any stock of chemicals, however, so he will purchase some chemicals at a local pharmacy.\n\nThe pharmacy sells N kinds of chemicals. For each kind of chemical, there is exactly one package of that chemical in stock.\n\nThe package of chemical i contains a_i grams of the substance A and b_i grams of the substance B, and is sold for c_i yen (the currency of Japan).\n\nDolphin will purchase some of these packages. For some reason, he must use all contents of the purchased packages to generate the substance C.\n\nFind the minimum amount of money required to generate the substance C.\n\nIf it is not possible to generate the substance C by purchasing any combination of packages at the pharmacy, report that fact.\n\nConstraints\n\n1≦N≦40\n\n1≦a_i,b_i≦10\n\n1≦c_i≦100\n\n1≦M_a,M_b≦10\n\ngcd(M_a,M_b)=1\n\na_i, b_i, c_i, M_a and M_b are integers.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN M_a M_b\na_1 b_1 c_1\na_2 b_2 c_2\n:\na_N b_N c_N\n\nOutput\n\nPrint the minimum amount of money required to generate the substance C. If it is not possible to generate the substance C, print -1 instead.\n\nSample Input 1\n\n3 1 1\n1 2 1\n2 1 2\n3 3 10\n\nSample Output 1\n\n3\n\nThe amount of money spent will be minimized by purchasing the packages of chemicals 1 and 2.\n\nIn this case, the mixture of the purchased chemicals will contain 3 grams of the substance A and 3 grams of the substance B, which are in the desired ratio: 3:3=1:1.\n\nThe total price of these packages is 3 yen.\n\nSample Input 2\n\n1 1 10\n10 10 10\n\nSample Output 2\n\n-1\n\nThe ratio 1:10 of the two substances A and B cannot be satisfied by purchasing any combination of the packages. Thus, the output should be -1.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 564, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s518576915", "group_id": "codeNet:p03806", "input_text": "uses math;\nvar\n\tans,n,Ma,Mb,i,j,a,b,c,x,mp,mm:Longint;\n\tp,m:array[0..400]of Longint;\nbegin\n\tread(n,Ma,Mb);\n\tans:=10000;\n\tfor i:=1 to 400 do begin\n\t\tp[i]:=ans;\n\t\tm[i]:=ans;\n\tend;\n\tfor i:=1 to n do begin\n\t\tread(a,b,c);\n\t\tx:=Ma*b-Mb*a;\n\t\tif x>0 then begin\n\t\t\tfor j:=mp downto 0 do p[j+x]:=min(p[j+x],p[j]+c);\n\t\t\tmp:=min(mp+x,300);\n\t\tend else if x<0 then begin\n\t\t\tfor j:=mm downto 0 do m[j-x]:=min(m[j-x],m[j]+c);\n\t\t\tmm:=min(mm-x,300);\n\t\tend else ans:=min(ans,c);\n\tend;\n\tfor i:=1 to 300 do ans:=min(ans,p[i]+m[i]);\n\tif ans<10000 then writeln(ans)else writeln(-1);\nend.", "language": "Pascal", "metadata": {"date": 1541923776, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03806.html", "problem_id": "p03806", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03806/input.txt", "sample_output_relpath": "derived/input_output/data/p03806/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03806/Pascal/s518576915.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s518576915", "user_id": "u657913472"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "uses math;\nvar\n\tans,n,Ma,Mb,i,j,a,b,c,x,mp,mm:Longint;\n\tp,m:array[0..400]of Longint;\nbegin\n\tread(n,Ma,Mb);\n\tans:=10000;\n\tfor i:=1 to 400 do begin\n\t\tp[i]:=ans;\n\t\tm[i]:=ans;\n\tend;\n\tfor i:=1 to n do begin\n\t\tread(a,b,c);\n\t\tx:=Ma*b-Mb*a;\n\t\tif x>0 then begin\n\t\t\tfor j:=mp downto 0 do p[j+x]:=min(p[j+x],p[j]+c);\n\t\t\tmp:=min(mp+x,300);\n\t\tend else if x<0 then begin\n\t\t\tfor j:=mm downto 0 do m[j-x]:=min(m[j-x],m[j]+c);\n\t\t\tmm:=min(mm-x,300);\n\t\tend else ans:=min(ans,c);\n\tend;\n\tfor i:=1 to 300 do ans:=min(ans,p[i]+m[i]);\n\tif ans<10000 then writeln(ans)else writeln(-1);\nend.", "problem_context": "Score : 400 points\n\nProblem Statement\n\nDolphin is planning to generate a small amount of a certain chemical substance C.\n\nIn order to generate the substance C, he must prepare a solution which is a mixture of two substances A and B in the ratio of M_a:M_b.\n\nHe does not have any stock of chemicals, however, so he will purchase some chemicals at a local pharmacy.\n\nThe pharmacy sells N kinds of chemicals. For each kind of chemical, there is exactly one package of that chemical in stock.\n\nThe package of chemical i contains a_i grams of the substance A and b_i grams of the substance B, and is sold for c_i yen (the currency of Japan).\n\nDolphin will purchase some of these packages. For some reason, he must use all contents of the purchased packages to generate the substance C.\n\nFind the minimum amount of money required to generate the substance C.\n\nIf it is not possible to generate the substance C by purchasing any combination of packages at the pharmacy, report that fact.\n\nConstraints\n\n1≦N≦40\n\n1≦a_i,b_i≦10\n\n1≦c_i≦100\n\n1≦M_a,M_b≦10\n\ngcd(M_a,M_b)=1\n\na_i, b_i, c_i, M_a and M_b are integers.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN M_a M_b\na_1 b_1 c_1\na_2 b_2 c_2\n:\na_N b_N c_N\n\nOutput\n\nPrint the minimum amount of money required to generate the substance C. If it is not possible to generate the substance C, print -1 instead.\n\nSample Input 1\n\n3 1 1\n1 2 1\n2 1 2\n3 3 10\n\nSample Output 1\n\n3\n\nThe amount of money spent will be minimized by purchasing the packages of chemicals 1 and 2.\n\nIn this case, the mixture of the purchased chemicals will contain 3 grams of the substance A and 3 grams of the substance B, which are in the desired ratio: 3:3=1:1.\n\nThe total price of these packages is 3 yen.\n\nSample Input 2\n\n1 1 10\n10 10 10\n\nSample Output 2\n\n-1\n\nThe ratio 1:10 of the two substances A and B cannot be satisfied by purchasing any combination of the packages. Thus, the output should be -1.", "sample_input": "3 1 1\n1 2 1\n2 1 2\n3 3 10\n"}, "reference_outputs": ["3\n"], "source_document_id": "p03806", "source_text": "Score : 400 points\n\nProblem Statement\n\nDolphin is planning to generate a small amount of a certain chemical substance C.\n\nIn order to generate the substance C, he must prepare a solution which is a mixture of two substances A and B in the ratio of M_a:M_b.\n\nHe does not have any stock of chemicals, however, so he will purchase some chemicals at a local pharmacy.\n\nThe pharmacy sells N kinds of chemicals. For each kind of chemical, there is exactly one package of that chemical in stock.\n\nThe package of chemical i contains a_i grams of the substance A and b_i grams of the substance B, and is sold for c_i yen (the currency of Japan).\n\nDolphin will purchase some of these packages. For some reason, he must use all contents of the purchased packages to generate the substance C.\n\nFind the minimum amount of money required to generate the substance C.\n\nIf it is not possible to generate the substance C by purchasing any combination of packages at the pharmacy, report that fact.\n\nConstraints\n\n1≦N≦40\n\n1≦a_i,b_i≦10\n\n1≦c_i≦100\n\n1≦M_a,M_b≦10\n\ngcd(M_a,M_b)=1\n\na_i, b_i, c_i, M_a and M_b are integers.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN M_a M_b\na_1 b_1 c_1\na_2 b_2 c_2\n:\na_N b_N c_N\n\nOutput\n\nPrint the minimum amount of money required to generate the substance C. If it is not possible to generate the substance C, print -1 instead.\n\nSample Input 1\n\n3 1 1\n1 2 1\n2 1 2\n3 3 10\n\nSample Output 1\n\n3\n\nThe amount of money spent will be minimized by purchasing the packages of chemicals 1 and 2.\n\nIn this case, the mixture of the purchased chemicals will contain 3 grams of the substance A and 3 grams of the substance B, which are in the desired ratio: 3:3=1:1.\n\nThe total price of these packages is 3 yen.\n\nSample Input 2\n\n1 1 10\n10 10 10\n\nSample Output 2\n\n-1\n\nThe ratio 1:10 of the two substances A and B cannot be satisfied by purchasing any combination of the packages. Thus, the output should be -1.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 564, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s209797913", "group_id": "codeNet:p03806", "input_text": "uses math;\nvar\n\tans,n,Ma,Mb,i,j,a,b,c,x,mp,mm:Longint;\n\tp,m:array[0..400]of Longint;\nbegin\n\tread(n,Ma,Mb);\n\tans:=10000;\n\tfor i:=1 to 400 do begin\n\t\tp[i]:=ans;\n\t\tm[i]:=ans;\n\tend;\n\tfor i:=1 to n do begin\n\t\tread(a,b,c);\n\t\tx:=Ma*b-Mb*a;\n\t\tif x>0 then begin\n\t\t\tfor j:=mp downto 0 do p[j+x]:=min(p[j+x],p[j]+c);\n\t\t\tmp:=min(mp+x,400);\n\t\tend else if x<0 then begin\n\t\t\tfor j:=mm downto 0 do m[j-x]:=min(m[j-x],m[j]+c);\n\t\t\tmm:=min(mm-x,400);\n\t\tend else ans:=min(ans,c);\n\tend;\n\tfor i:=1 to 400 do ans:=min(ans,p[i]+m[i]);\n\tif ans<10000 then writeln(ans)else writeln(-1);\nend.", "language": "Pascal", "metadata": {"date": 1541923746, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03806.html", "problem_id": "p03806", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03806/input.txt", "sample_output_relpath": "derived/input_output/data/p03806/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03806/Pascal/s209797913.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s209797913", "user_id": "u657913472"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "uses math;\nvar\n\tans,n,Ma,Mb,i,j,a,b,c,x,mp,mm:Longint;\n\tp,m:array[0..400]of Longint;\nbegin\n\tread(n,Ma,Mb);\n\tans:=10000;\n\tfor i:=1 to 400 do begin\n\t\tp[i]:=ans;\n\t\tm[i]:=ans;\n\tend;\n\tfor i:=1 to n do begin\n\t\tread(a,b,c);\n\t\tx:=Ma*b-Mb*a;\n\t\tif x>0 then begin\n\t\t\tfor j:=mp downto 0 do p[j+x]:=min(p[j+x],p[j]+c);\n\t\t\tmp:=min(mp+x,400);\n\t\tend else if x<0 then begin\n\t\t\tfor j:=mm downto 0 do m[j-x]:=min(m[j-x],m[j]+c);\n\t\t\tmm:=min(mm-x,400);\n\t\tend else ans:=min(ans,c);\n\tend;\n\tfor i:=1 to 400 do ans:=min(ans,p[i]+m[i]);\n\tif ans<10000 then writeln(ans)else writeln(-1);\nend.", "problem_context": "Score : 400 points\n\nProblem Statement\n\nDolphin is planning to generate a small amount of a certain chemical substance C.\n\nIn order to generate the substance C, he must prepare a solution which is a mixture of two substances A and B in the ratio of M_a:M_b.\n\nHe does not have any stock of chemicals, however, so he will purchase some chemicals at a local pharmacy.\n\nThe pharmacy sells N kinds of chemicals. For each kind of chemical, there is exactly one package of that chemical in stock.\n\nThe package of chemical i contains a_i grams of the substance A and b_i grams of the substance B, and is sold for c_i yen (the currency of Japan).\n\nDolphin will purchase some of these packages. For some reason, he must use all contents of the purchased packages to generate the substance C.\n\nFind the minimum amount of money required to generate the substance C.\n\nIf it is not possible to generate the substance C by purchasing any combination of packages at the pharmacy, report that fact.\n\nConstraints\n\n1≦N≦40\n\n1≦a_i,b_i≦10\n\n1≦c_i≦100\n\n1≦M_a,M_b≦10\n\ngcd(M_a,M_b)=1\n\na_i, b_i, c_i, M_a and M_b are integers.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN M_a M_b\na_1 b_1 c_1\na_2 b_2 c_2\n:\na_N b_N c_N\n\nOutput\n\nPrint the minimum amount of money required to generate the substance C. If it is not possible to generate the substance C, print -1 instead.\n\nSample Input 1\n\n3 1 1\n1 2 1\n2 1 2\n3 3 10\n\nSample Output 1\n\n3\n\nThe amount of money spent will be minimized by purchasing the packages of chemicals 1 and 2.\n\nIn this case, the mixture of the purchased chemicals will contain 3 grams of the substance A and 3 grams of the substance B, which are in the desired ratio: 3:3=1:1.\n\nThe total price of these packages is 3 yen.\n\nSample Input 2\n\n1 1 10\n10 10 10\n\nSample Output 2\n\n-1\n\nThe ratio 1:10 of the two substances A and B cannot be satisfied by purchasing any combination of the packages. Thus, the output should be -1.", "sample_input": "3 1 1\n1 2 1\n2 1 2\n3 3 10\n"}, "reference_outputs": ["3\n"], "source_document_id": "p03806", "source_text": "Score : 400 points\n\nProblem Statement\n\nDolphin is planning to generate a small amount of a certain chemical substance C.\n\nIn order to generate the substance C, he must prepare a solution which is a mixture of two substances A and B in the ratio of M_a:M_b.\n\nHe does not have any stock of chemicals, however, so he will purchase some chemicals at a local pharmacy.\n\nThe pharmacy sells N kinds of chemicals. For each kind of chemical, there is exactly one package of that chemical in stock.\n\nThe package of chemical i contains a_i grams of the substance A and b_i grams of the substance B, and is sold for c_i yen (the currency of Japan).\n\nDolphin will purchase some of these packages. For some reason, he must use all contents of the purchased packages to generate the substance C.\n\nFind the minimum amount of money required to generate the substance C.\n\nIf it is not possible to generate the substance C by purchasing any combination of packages at the pharmacy, report that fact.\n\nConstraints\n\n1≦N≦40\n\n1≦a_i,b_i≦10\n\n1≦c_i≦100\n\n1≦M_a,M_b≦10\n\ngcd(M_a,M_b)=1\n\na_i, b_i, c_i, M_a and M_b are integers.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN M_a M_b\na_1 b_1 c_1\na_2 b_2 c_2\n:\na_N b_N c_N\n\nOutput\n\nPrint the minimum amount of money required to generate the substance C. If it is not possible to generate the substance C, print -1 instead.\n\nSample Input 1\n\n3 1 1\n1 2 1\n2 1 2\n3 3 10\n\nSample Output 1\n\n3\n\nThe amount of money spent will be minimized by purchasing the packages of chemicals 1 and 2.\n\nIn this case, the mixture of the purchased chemicals will contain 3 grams of the substance A and 3 grams of the substance B, which are in the desired ratio: 3:3=1:1.\n\nThe total price of these packages is 3 yen.\n\nSample Input 2\n\n1 1 10\n10 10 10\n\nSample Output 2\n\n-1\n\nThe ratio 1:10 of the two substances A and B cannot be satisfied by purchasing any combination of the packages. Thus, the output should be -1.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 564, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s070866648", "group_id": "codeNet:p03807", "input_text": "var\n n,i,x,s:longint;\nbegin\n readln(n);\n for i:=1 to n do\n begin\n read(x);\n s:=(s+x mod 2) mod 2;\n end;\n if odd(s) then writeln('NO') else writeln('YES');\nend.", "language": "Pascal", "metadata": {"date": 1582426045, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03807.html", "problem_id": "p03807", "resource_group": "low_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/Pascal/s070866648.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s070866648", "user_id": "u263933075"}, "prompt_components": {"gold_output": "YES\n", "input_to_evaluate": "var\n n,i,x,s:longint;\nbegin\n readln(n);\n for i:=1 to n do\n begin\n read(x);\n s:=(s+x mod 2) mod 2;\n end;\n if odd(s) then writeln('NO') else writeln('YES');\nend.", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 17, "memory_kb": 128}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s292300397", "group_id": "codeNet:p03813", "input_text": "program vjudge149349A;\nvar x:longint;\nbegin\n readln(x);\n if x<1200 then writeln('ABC') else writeln('ARC');\nend.", "language": "Pascal", "metadata": {"date": 1485912730, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03813.html", "problem_id": "p03813", "resource_group": "low_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/Pascal/s292300397.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s292300397", "user_id": "u089230684"}, "prompt_components": {"gold_output": "ABC\n", "input_to_evaluate": "program vjudge149349A;\nvar x:longint;\nbegin\n readln(x);\n if x<1200 then writeln('ABC') else writeln('ARC');\nend.", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s848978707", "group_id": "codeNet:p03815", "input_text": "var x,y:int64;\nbegin\n readln(x);\nif (x>=11) then\nbegin\n y:=(x div 11)+(x div 11);\n if (x mod 11<>0) then inc(y);\n writeln(y);\nend else\nbegin\n if (x<=6) then writeln(1) else writeln(2);\nend;\nend.", "language": "Pascal", "metadata": {"date": 1485655817, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03815.html", "problem_id": "p03815", "resource_group": "low_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/Pascal/s848978707.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s848978707", "user_id": "u331121156"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "var x,y:int64;\nbegin\n readln(x);\nif (x>=11) then\nbegin\n y:=(x div 11)+(x div 11);\n if (x mod 11<>0) then inc(y);\n writeln(y);\nend else\nbegin\n if (x<=6) then writeln(1) else writeln(2);\nend;\nend.", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s735789439", "group_id": "codeNet:p03816", "input_text": "var n,i,j,tot,ans:longint;\n a:array[0..100007] of longint;\nprocedure qsort(lx,rx:longint);\nvar i,j,m,t:longint;\nbegin\n i:=lx;j:=rx;m:=a[random(rx-lx+1)+lx];\n repeat\n\twhile (a[i]m) do dec(j);\n\tif (i<=j) then\n\tbegin\n\t t:=a[i];a[i]:=a[j];a[j]:=t;\n\t inc(i);dec(j);\n\tend;\n until (i>j);\n if (ilx) then qsort(lx,j);\nend;\nbegin\n randomize;\n readln(n);\n fillchar(a,sizeof(a),0);\n for i:=1 to n do\n\tread(a[i]);\n readln;\n qsort(1,n);\n tot:=0;\n for i:=2 to n do\n\tif (a[i]=a[i-1]) then inc(tot);\n ans:=n-tot;\n tot:=tot mod 3;\n if (tot=1) then dec(ans);\n writeln(ans);\nend.\n\t", "language": "Pascal", "metadata": {"date": 1485656396, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03816.html", "problem_id": "p03816", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03816/input.txt", "sample_output_relpath": "derived/input_output/data/p03816/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03816/Pascal/s735789439.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s735789439", "user_id": "u331121156"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "var n,i,j,tot,ans:longint;\n a:array[0..100007] of longint;\nprocedure qsort(lx,rx:longint);\nvar i,j,m,t:longint;\nbegin\n i:=lx;j:=rx;m:=a[random(rx-lx+1)+lx];\n repeat\n\twhile (a[i]m) do dec(j);\n\tif (i<=j) then\n\tbegin\n\t t:=a[i];a[i]:=a[j];a[j]:=t;\n\t inc(i);dec(j);\n\tend;\n until (i>j);\n if (ilx) then qsort(lx,j);\nend;\nbegin\n randomize;\n readln(n);\n fillchar(a,sizeof(a),0);\n for i:=1 to n do\n\tread(a[i]);\n readln;\n qsort(1,n);\n tot:=0;\n for i:=2 to n do\n\tif (a[i]=a[i-1]) then inc(tot);\n ans:=n-tot;\n tot:=tot mod 3;\n if (tot=1) then dec(ans);\n writeln(ans);\nend.\n\t", "problem_context": "Score : 400 points\n\nProblem Statement\n\nSnuke has decided to play a game using cards.\nHe has a deck consisting of N cards. On the i-th card from the top, an integer A_i is written.\n\nHe will perform the operation described below zero or more times, so that the values written on the remaining cards will be pairwise distinct. Find the maximum possible number of remaining cards. Here, N is odd, which guarantees that at least one card can be kept.\n\nOperation: Take out three arbitrary cards from the deck. Among those three cards, eat two: one with the largest value, and another with the smallest value. Then, return the remaining one card to the deck.\n\nConstraints\n\n3 ≦ N ≦ 10^{5}\n\nN is odd.\n\n1 ≦ A_i ≦ 10^{5}\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_3 ... A_{N}\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n5\n1 2 1 3 7\n\nSample Output 1\n\n3\n\nOne optimal solution is to perform the operation once, taking out two cards with 1 and one card with 2. One card with 1 and another with 2 will be eaten, and the remaining card with 1 will be returned to deck. Then, the values written on the remaining cards in the deck will be pairwise distinct: 1, 3 and 7.\n\nSample Input 2\n\n15\n1 3 5 2 1 3 2 8 8 6 2 6 11 1 1\n\nSample Output 2\n\n7", "sample_input": "5\n1 2 1 3 7\n"}, "reference_outputs": ["3\n"], "source_document_id": "p03816", "source_text": "Score : 400 points\n\nProblem Statement\n\nSnuke has decided to play a game using cards.\nHe has a deck consisting of N cards. On the i-th card from the top, an integer A_i is written.\n\nHe will perform the operation described below zero or more times, so that the values written on the remaining cards will be pairwise distinct. Find the maximum possible number of remaining cards. Here, N is odd, which guarantees that at least one card can be kept.\n\nOperation: Take out three arbitrary cards from the deck. Among those three cards, eat two: one with the largest value, and another with the smallest value. Then, return the remaining one card to the deck.\n\nConstraints\n\n3 ≦ N ≦ 10^{5}\n\nN is odd.\n\n1 ≦ A_i ≦ 10^{5}\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_3 ... A_{N}\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n5\n1 2 1 3 7\n\nSample Output 1\n\n3\n\nOne optimal solution is to perform the operation once, taking out two cards with 1 and one card with 2. One card with 1 and another with 2 will be eaten, and the remaining card with 1 will be returned to deck. Then, the values written on the remaining cards in the deck will be pairwise distinct: 1, 3 and 7.\n\nSample Input 2\n\n15\n1 3 5 2 1 3 2 8 8 6 2 6 11 1 1\n\nSample Output 2\n\n7", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 641, "cpu_time_ms": 25, "memory_kb": 512}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s890740746", "group_id": "codeNet:p03817", "input_text": "program vjudge149349C;\nvar t,ans:int64;\nbegin\n readln(t);\n ans:=ans+t div 11*2;\n t:=t mod 11;\n if t>0 then\n if t<=6 then inc(ans) else ans:=ans+2;\n writeln(ans);\nend.", "language": "Pascal", "metadata": {"date": 1485913239, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03817.html", "problem_id": "p03817", "resource_group": "low_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/Pascal/s890740746.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s890740746", "user_id": "u089230684"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "program vjudge149349C;\nvar t,ans:int64;\nbegin\n readln(t);\n ans:=ans+t div 11*2;\n t:=t mod 11;\n if t>0 then\n if t<=6 then inc(ans) else ans:=ans+2;\n writeln(ans);\nend.", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s782857953", "group_id": "codeNet:p03818", "input_text": "var\n\tn,a,c,i:Longint;\n\tu:array[1..100000]of Boolean;\nbegin\n\tread(n);\n\tfor i:=1 to n do begin\n\t\tread(a);\n\t\tif not u[a] then inc(c);\n\t\tu[a]:=true;\n\tend;\n\tif c mod 2=0 then writeln(c-1)else writeln(c);\nend.\n", "language": "Pascal", "metadata": {"date": 1539166391, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03818.html", "problem_id": "p03818", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03818/input.txt", "sample_output_relpath": "derived/input_output/data/p03818/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03818/Pascal/s782857953.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s782857953", "user_id": "u657913472"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "var\n\tn,a,c,i:Longint;\n\tu:array[1..100000]of Boolean;\nbegin\n\tread(n);\n\tfor i:=1 to n do begin\n\t\tread(a);\n\t\tif not u[a] then inc(c);\n\t\tu[a]:=true;\n\tend;\n\tif c mod 2=0 then writeln(c-1)else writeln(c);\nend.\n", "problem_context": "Score : 400 points\n\nProblem Statement\n\nSnuke has decided to play a game using cards.\nHe has a deck consisting of N cards. On the i-th card from the top, an integer A_i is written.\n\nHe will perform the operation described below zero or more times, so that the values written on the remaining cards will be pairwise distinct. Find the maximum possible number of remaining cards. Here, N is odd, which guarantees that at least one card can be kept.\n\nOperation: Take out three arbitrary cards from the deck. Among those three cards, eat two: one with the largest value, and another with the smallest value. Then, return the remaining one card to the deck.\n\nConstraints\n\n3 ≦ N ≦ 10^{5}\n\nN is odd.\n\n1 ≦ A_i ≦ 10^{5}\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_3 ... A_{N}\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n5\n1 2 1 3 7\n\nSample Output 1\n\n3\n\nOne optimal solution is to perform the operation once, taking out two cards with 1 and one card with 2. One card with 1 and another with 2 will be eaten, and the remaining card with 1 will be returned to deck. Then, the values written on the remaining cards in the deck will be pairwise distinct: 1, 3 and 7.\n\nSample Input 2\n\n15\n1 3 5 2 1 3 2 8 8 6 2 6 11 1 1\n\nSample Output 2\n\n7", "sample_input": "5\n1 2 1 3 7\n"}, "reference_outputs": ["3\n"], "source_document_id": "p03818", "source_text": "Score : 400 points\n\nProblem Statement\n\nSnuke has decided to play a game using cards.\nHe has a deck consisting of N cards. On the i-th card from the top, an integer A_i is written.\n\nHe will perform the operation described below zero or more times, so that the values written on the remaining cards will be pairwise distinct. Find the maximum possible number of remaining cards. Here, N is odd, which guarantees that at least one card can be kept.\n\nOperation: Take out three arbitrary cards from the deck. Among those three cards, eat two: one with the largest value, and another with the smallest value. Then, return the remaining one card to the deck.\n\nConstraints\n\n3 ≦ N ≦ 10^{5}\n\nN is odd.\n\n1 ≦ A_i ≦ 10^{5}\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_3 ... A_{N}\n\nOutput\n\nPrint the answer.\n\nSample Input 1\n\n5\n1 2 1 3 7\n\nSample Output 1\n\n3\n\nOne optimal solution is to perform the operation once, taking out two cards with 1 and one card with 2. One card with 1 and another with 2 will be eaten, and the remaining card with 1 will be returned to deck. Then, the values written on the remaining cards in the deck will be pairwise distinct: 1, 3 and 7.\n\nSample Input 2\n\n15\n1 3 5 2 1 3 2 8 8 6 2 6 11 1 1\n\nSample Output 2\n\n7", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 11, "memory_kb": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s885864590", "group_id": "codeNet:p03819", "input_text": "program vjudge149349E;\nconst maxn=300000+10;\n maxm=100000+10;\nvar l,r,next:array[0..maxn] of longint;\n last,ans,bits:array[0..maxm] of longint;\n n,m,i,j:longint;\nfunction ask(x:longint):longint;\nvar ans:longint;\nbegin\n ans:=0;\n while x>0 do\n begin\n ans:=ans+bits[x];\n x:=x-x and (-x);\n end;\n exit(ans);\nend;\nprocedure add(x,d:longint);\nbegin\n while(x<=m+1) do\n begin\n bits[x]:=bits[x]+d;\n x:=x+x and (-x);\n end;\nend;\nbegin\n readln(n,m);\n fillchar(last,sizeof(last),0);\n for i:=1 to n do\n begin\n readln(l[i],r[i]);\n next[i]:=last[r[i]-l[i]+1];\n last[r[i]-l[i]+1]:=i;\n inc(ans[1]);\n dec(ans[r[i]-l[i]+2]);\n end;\n for i:=1 to m do ans[i]:=ans[i]+ans[i-1];\n fillchar(bits,sizeof(bits),0);\n for i:=1 to m do\n begin\n ans[i]:=ans[i]+bits[1];\n for j:=1 to m div i do\n ans[i]:=ans[i]+ask(j*i+1);\n j:=last[i];\n while j>0 do\n begin\n add(l[j]+1,1);\n add(r[j]+2,-1);\n j:=next[j];\n end;\n end;\n for i:=1 to m do writeln(ans[i]);\nend.", "language": "Pascal", "metadata": {"date": 1510364925, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03819.html", "problem_id": "p03819", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03819/input.txt", "sample_output_relpath": "derived/input_output/data/p03819/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03819/Pascal/s885864590.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s885864590", "user_id": "u097736549"}, "prompt_components": {"gold_output": "3\n2\n2\n", "input_to_evaluate": "program vjudge149349E;\nconst maxn=300000+10;\n maxm=100000+10;\nvar l,r,next:array[0..maxn] of longint;\n last,ans,bits:array[0..maxm] of longint;\n n,m,i,j:longint;\nfunction ask(x:longint):longint;\nvar ans:longint;\nbegin\n ans:=0;\n while x>0 do\n begin\n ans:=ans+bits[x];\n x:=x-x and (-x);\n end;\n exit(ans);\nend;\nprocedure add(x,d:longint);\nbegin\n while(x<=m+1) do\n begin\n bits[x]:=bits[x]+d;\n x:=x+x and (-x);\n end;\nend;\nbegin\n readln(n,m);\n fillchar(last,sizeof(last),0);\n for i:=1 to n do\n begin\n readln(l[i],r[i]);\n next[i]:=last[r[i]-l[i]+1];\n last[r[i]-l[i]+1]:=i;\n inc(ans[1]);\n dec(ans[r[i]-l[i]+2]);\n end;\n for i:=1 to m do ans[i]:=ans[i]+ans[i-1];\n fillchar(bits,sizeof(bits),0);\n for i:=1 to m do\n begin\n ans[i]:=ans[i]+bits[1];\n for j:=1 to m div i do\n ans[i]:=ans[i]+ask(j*i+1);\n j:=last[i];\n while j>0 do\n begin\n add(l[j]+1,1);\n add(r[j]+2,-1);\n j:=next[j];\n end;\n end;\n for i:=1 to m do writeln(ans[i]);\nend.", "problem_context": "Score : 700 points\n\nProblem Statement\n\nSnuke has decided to play a game, where the player runs a railway company.\nThere are M+1 stations on Snuke Line, numbered 0 through M.\nA train on Snuke Line stops at station 0 and every d-th station thereafter, where d is a predetermined constant for each train.\nFor example, if d = 3, the train stops at station 0, 3, 6, 9, and so forth.\n\nThere are N kinds of souvenirs sold in areas around Snuke Line. The i-th kind of souvenirs can be purchased when the train stops at one of the following stations: stations l_i, l_i+1, l_i+2, ..., r_i.\n\nThere are M values of d, the interval between two stops, for trains on Snuke Line: 1, 2, 3, ..., M.\nFor each of these M values, find the number of the kinds of souvenirs that can be purchased if one takes a train with that value of d at station 0.\nHere, assume that it is not allowed to change trains.\n\nConstraints\n\n1 ≦ N ≦ 3 × 10^{5}\n\n1 ≦ M ≦ 10^{5}\n\n1 ≦ l_i ≦ r_i ≦ M\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN M\nl_1 r_1\n:\nl_{N} r_{N}\n\nOutput\n\nPrint the answer in M lines. The i-th line should contain the maximum number of the kinds of souvenirs that can be purchased if one takes a train stopping every i-th station.\n\nSample Input 1\n\n3 3\n1 2\n2 3\n3 3\n\nSample Output 1\n\n3\n2\n2\n\nIf one takes a train stopping every station, three kinds of souvenirs can be purchased: kind 1, 2 and 3.\n\nIf one takes a train stopping every second station, two kinds of souvenirs can be purchased: kind 1 and 2.\n\nIf one takes a train stopping every third station, two kinds of souvenirs can be purchased: kind 2 and 3.\n\nSample Input 2\n\n7 9\n1 7\n5 9\n5 7\n5 9\n1 1\n6 8\n3 4\n\nSample Output 2\n\n7\n6\n6\n5\n4\n5\n5\n3\n2", "sample_input": "3 3\n1 2\n2 3\n3 3\n"}, "reference_outputs": ["3\n2\n2\n"], "source_document_id": "p03819", "source_text": "Score : 700 points\n\nProblem Statement\n\nSnuke has decided to play a game, where the player runs a railway company.\nThere are M+1 stations on Snuke Line, numbered 0 through M.\nA train on Snuke Line stops at station 0 and every d-th station thereafter, where d is a predetermined constant for each train.\nFor example, if d = 3, the train stops at station 0, 3, 6, 9, and so forth.\n\nThere are N kinds of souvenirs sold in areas around Snuke Line. The i-th kind of souvenirs can be purchased when the train stops at one of the following stations: stations l_i, l_i+1, l_i+2, ..., r_i.\n\nThere are M values of d, the interval between two stops, for trains on Snuke Line: 1, 2, 3, ..., M.\nFor each of these M values, find the number of the kinds of souvenirs that can be purchased if one takes a train with that value of d at station 0.\nHere, assume that it is not allowed to change trains.\n\nConstraints\n\n1 ≦ N ≦ 3 × 10^{5}\n\n1 ≦ M ≦ 10^{5}\n\n1 ≦ l_i ≦ r_i ≦ M\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN M\nl_1 r_1\n:\nl_{N} r_{N}\n\nOutput\n\nPrint the answer in M lines. The i-th line should contain the maximum number of the kinds of souvenirs that can be purchased if one takes a train stopping every i-th station.\n\nSample Input 1\n\n3 3\n1 2\n2 3\n3 3\n\nSample Output 1\n\n3\n2\n2\n\nIf one takes a train stopping every station, three kinds of souvenirs can be purchased: kind 1, 2 and 3.\n\nIf one takes a train stopping every second station, two kinds of souvenirs can be purchased: kind 1 and 2.\n\nIf one takes a train stopping every third station, two kinds of souvenirs can be purchased: kind 2 and 3.\n\nSample Input 2\n\n7 9\n1 7\n5 9\n5 7\n5 9\n1 1\n6 8\n3 4\n\nSample Output 2\n\n7\n6\n6\n5\n4\n5\n5\n3\n2", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1013, "cpu_time_ms": 159, "memory_kb": 5504}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s707784876", "group_id": "codeNet:p03819", "input_text": "program vjudge149349E;\nconst maxn=300000+10;\n maxm=100000+10;\nvar l,r,next:array[0..maxn] of longint;\n last,ans,bits:array[0..maxm] of longint;\n n,m,i,j:longint;\nfunction ask(x:longint):longint;\nvar ans:longint;\nbegin\n ans:=0;\n while x>0 do\n begin\n ans:=ans+bits[x];\n x:=x-x and (-x);\n end;\n exit(ans);\nend;\nprocedure add(x,d:longint);\nbegin\n while(x<=m+1) do\n begin\n bits[x]:=bits[x]+d;\n x:=x+x and (-x);\n end;\nend;\nbegin\n readln(n,m);\n fillchar(last,sizeof(last),0);\n for i:=1 to n do\n begin\n readln(l[i],r[i]);\n next[i]:=last[r[i]-l[i]+1];\n last[r[i]-l[i]+1]:=i;\n inc(ans[1]);\n dec(ans[r[i]-l[i]+2]);\n end;\n for i:=1 to m do ans[i]:=ans[i]+ans[i-1];\n fillchar(bits,sizeof(bits),0);\n for i:=1 to m do\n begin\n ans[i]:=ans[i]+bits[1];\n for j:=1 to m div i do\n ans[i]:=ans[i]+ask(j*i+1);\n j:=last[i];\n while j>0 do\n begin\n add(l[j]+1,1);\n add(r[j]+2,-1);\n j:=next[j];\n end;\n end;\n for i:=1 to m do writeln(ans[i]);\nend.\n", "language": "Pascal", "metadata": {"date": 1485915042, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03819.html", "problem_id": "p03819", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03819/input.txt", "sample_output_relpath": "derived/input_output/data/p03819/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03819/Pascal/s707784876.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s707784876", "user_id": "u089230684"}, "prompt_components": {"gold_output": "3\n2\n2\n", "input_to_evaluate": "program vjudge149349E;\nconst maxn=300000+10;\n maxm=100000+10;\nvar l,r,next:array[0..maxn] of longint;\n last,ans,bits:array[0..maxm] of longint;\n n,m,i,j:longint;\nfunction ask(x:longint):longint;\nvar ans:longint;\nbegin\n ans:=0;\n while x>0 do\n begin\n ans:=ans+bits[x];\n x:=x-x and (-x);\n end;\n exit(ans);\nend;\nprocedure add(x,d:longint);\nbegin\n while(x<=m+1) do\n begin\n bits[x]:=bits[x]+d;\n x:=x+x and (-x);\n end;\nend;\nbegin\n readln(n,m);\n fillchar(last,sizeof(last),0);\n for i:=1 to n do\n begin\n readln(l[i],r[i]);\n next[i]:=last[r[i]-l[i]+1];\n last[r[i]-l[i]+1]:=i;\n inc(ans[1]);\n dec(ans[r[i]-l[i]+2]);\n end;\n for i:=1 to m do ans[i]:=ans[i]+ans[i-1];\n fillchar(bits,sizeof(bits),0);\n for i:=1 to m do\n begin\n ans[i]:=ans[i]+bits[1];\n for j:=1 to m div i do\n ans[i]:=ans[i]+ask(j*i+1);\n j:=last[i];\n while j>0 do\n begin\n add(l[j]+1,1);\n add(r[j]+2,-1);\n j:=next[j];\n end;\n end;\n for i:=1 to m do writeln(ans[i]);\nend.\n", "problem_context": "Score : 700 points\n\nProblem Statement\n\nSnuke has decided to play a game, where the player runs a railway company.\nThere are M+1 stations on Snuke Line, numbered 0 through M.\nA train on Snuke Line stops at station 0 and every d-th station thereafter, where d is a predetermined constant for each train.\nFor example, if d = 3, the train stops at station 0, 3, 6, 9, and so forth.\n\nThere are N kinds of souvenirs sold in areas around Snuke Line. The i-th kind of souvenirs can be purchased when the train stops at one of the following stations: stations l_i, l_i+1, l_i+2, ..., r_i.\n\nThere are M values of d, the interval between two stops, for trains on Snuke Line: 1, 2, 3, ..., M.\nFor each of these M values, find the number of the kinds of souvenirs that can be purchased if one takes a train with that value of d at station 0.\nHere, assume that it is not allowed to change trains.\n\nConstraints\n\n1 ≦ N ≦ 3 × 10^{5}\n\n1 ≦ M ≦ 10^{5}\n\n1 ≦ l_i ≦ r_i ≦ M\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN M\nl_1 r_1\n:\nl_{N} r_{N}\n\nOutput\n\nPrint the answer in M lines. The i-th line should contain the maximum number of the kinds of souvenirs that can be purchased if one takes a train stopping every i-th station.\n\nSample Input 1\n\n3 3\n1 2\n2 3\n3 3\n\nSample Output 1\n\n3\n2\n2\n\nIf one takes a train stopping every station, three kinds of souvenirs can be purchased: kind 1, 2 and 3.\n\nIf one takes a train stopping every second station, two kinds of souvenirs can be purchased: kind 1 and 2.\n\nIf one takes a train stopping every third station, two kinds of souvenirs can be purchased: kind 2 and 3.\n\nSample Input 2\n\n7 9\n1 7\n5 9\n5 7\n5 9\n1 1\n6 8\n3 4\n\nSample Output 2\n\n7\n6\n6\n5\n4\n5\n5\n3\n2", "sample_input": "3 3\n1 2\n2 3\n3 3\n"}, "reference_outputs": ["3\n2\n2\n"], "source_document_id": "p03819", "source_text": "Score : 700 points\n\nProblem Statement\n\nSnuke has decided to play a game, where the player runs a railway company.\nThere are M+1 stations on Snuke Line, numbered 0 through M.\nA train on Snuke Line stops at station 0 and every d-th station thereafter, where d is a predetermined constant for each train.\nFor example, if d = 3, the train stops at station 0, 3, 6, 9, and so forth.\n\nThere are N kinds of souvenirs sold in areas around Snuke Line. The i-th kind of souvenirs can be purchased when the train stops at one of the following stations: stations l_i, l_i+1, l_i+2, ..., r_i.\n\nThere are M values of d, the interval between two stops, for trains on Snuke Line: 1, 2, 3, ..., M.\nFor each of these M values, find the number of the kinds of souvenirs that can be purchased if one takes a train with that value of d at station 0.\nHere, assume that it is not allowed to change trains.\n\nConstraints\n\n1 ≦ N ≦ 3 × 10^{5}\n\n1 ≦ M ≦ 10^{5}\n\n1 ≦ l_i ≦ r_i ≦ M\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN M\nl_1 r_1\n:\nl_{N} r_{N}\n\nOutput\n\nPrint the answer in M lines. The i-th line should contain the maximum number of the kinds of souvenirs that can be purchased if one takes a train stopping every i-th station.\n\nSample Input 1\n\n3 3\n1 2\n2 3\n3 3\n\nSample Output 1\n\n3\n2\n2\n\nIf one takes a train stopping every station, three kinds of souvenirs can be purchased: kind 1, 2 and 3.\n\nIf one takes a train stopping every second station, two kinds of souvenirs can be purchased: kind 1 and 2.\n\nIf one takes a train stopping every third station, two kinds of souvenirs can be purchased: kind 2 and 3.\n\nSample Input 2\n\n7 9\n1 7\n5 9\n5 7\n5 9\n1 1\n6 8\n3 4\n\nSample Output 2\n\n7\n6\n6\n5\n4\n5\n5\n3\n2", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 168, "memory_kb": 5504}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s483904090", "group_id": "codeNet:p03821", "input_text": "var\n\tN,i:Longint;\n\tans,T:int64;\n\tA,B:Array[1..100000]of int64;\nbegin\n\tread(N);\n\tfor i:=1 to N do read(A[i],B[i]);\n\tfor i:=N downto 1 do begin\n\t\tT:=(-ans-A[i])mod B[i];\n\t\tif T<0 then inc(T,B[i]);\n\t\tinc(ans,T);\n\tend;\n\twriteln(ans);\nend.\n", "language": "Pascal", "metadata": {"date": 1579580365, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03821.html", "problem_id": "p03821", "resource_group": "low_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/Pascal/s483904090.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s483904090", "user_id": "u657913472"}, "prompt_components": {"gold_output": "7\n", "input_to_evaluate": "var\n\tN,i:Longint;\n\tans,T:int64;\n\tA,B:Array[1..100000]of int64;\nbegin\n\tread(N);\n\tfor i:=1 to N do read(A[i],B[i]);\n\tfor i:=N downto 1 do begin\n\t\tT:=(-ans-A[i])mod B[i];\n\t\tif T<0 then inc(T,B[i]);\n\t\tinc(ans,T);\n\tend;\n\twriteln(ans);\nend.\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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 35, "memory_kb": 1664}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s768747255", "group_id": "codeNet:p03822", "input_text": "var n,i,tot:longint;\n\tlast,pre,other,anss,a,now:array[0..500007] of longint;\nprocedure insert(u,v:longint);\nbegin\n inc(tot);\n other[tot]:=v;\n pre[tot]:=last[u];\n last[u]:=tot;\nend;\nprocedure qsort(lx,rx:longint);\nvar i,j,m,t:longint;\nbegin\n i:=lx;j:=rx;m:=now[(lx+rx) div 2];\n repeat\n\twhile (now[i]m) do dec(j);\n\tif (i<=j) then\n\tbegin\n\t t:=now[i];now[i]:=now[j];now[j]:=t;\n\t inc(i);dec(j);\n\tend;\n until (i>j);\n if (ilx) then qsort(lx,j);\nend;\nprocedure dfs(u,father:longint);\nvar q,v,i,tott:longint;\n noww:array[0..500007] of longint;\nbegin\n tott:=0;\n q:=last[u];\n while (q>0) do\n begin\n v:=other[q];\n if (v<>father) then \n\tbegin\n\t dfs(v,u);\n\t inc(tott);\n\t noww[tott]:=anss[v];\n\tend;\n\tq:=pre[q];\n end;\nif (tott<>0) then\nbegin\n for i:=1 to tott do\n\tnow[i]:=noww[i];\n qsort(1,tott);\n anss[u]:=0;\n for i:=1 to tott do\n\tif (now[i]+tott+1-i>anss[u]) then anss[u]:=now[i]+tott+1-i;\nend else anss[u]:=0;\nend;\nbegin\n readln(n);\n fillchar(a,sizeof(a),0);\n tot:=0;\n for i:=2 to n do\n begin\n\treadln(a[i]);\n insert(i,a[i]);insert(a[i],i);\n end;\n fillchar(anss,sizeof(anss),0);\n dfs(1,0);\n writeln(anss[1]);\nend.\n ", "language": "Pascal", "metadata": {"date": 1485143369, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03822.html", "problem_id": "p03822", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03822/input.txt", "sample_output_relpath": "derived/input_output/data/p03822/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03822/Pascal/s768747255.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s768747255", "user_id": "u331121156"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "var n,i,tot:longint;\n\tlast,pre,other,anss,a,now:array[0..500007] of longint;\nprocedure insert(u,v:longint);\nbegin\n inc(tot);\n other[tot]:=v;\n pre[tot]:=last[u];\n last[u]:=tot;\nend;\nprocedure qsort(lx,rx:longint);\nvar i,j,m,t:longint;\nbegin\n i:=lx;j:=rx;m:=now[(lx+rx) div 2];\n repeat\n\twhile (now[i]m) do dec(j);\n\tif (i<=j) then\n\tbegin\n\t t:=now[i];now[i]:=now[j];now[j]:=t;\n\t inc(i);dec(j);\n\tend;\n until (i>j);\n if (ilx) then qsort(lx,j);\nend;\nprocedure dfs(u,father:longint);\nvar q,v,i,tott:longint;\n noww:array[0..500007] of longint;\nbegin\n tott:=0;\n q:=last[u];\n while (q>0) do\n begin\n v:=other[q];\n if (v<>father) then \n\tbegin\n\t dfs(v,u);\n\t inc(tott);\n\t noww[tott]:=anss[v];\n\tend;\n\tq:=pre[q];\n end;\nif (tott<>0) then\nbegin\n for i:=1 to tott do\n\tnow[i]:=noww[i];\n qsort(1,tott);\n anss[u]:=0;\n for i:=1 to tott do\n\tif (now[i]+tott+1-i>anss[u]) then anss[u]:=now[i]+tott+1-i;\nend else anss[u]:=0;\nend;\nbegin\n readln(n);\n fillchar(a,sizeof(a),0);\n tot:=0;\n for i:=2 to n do\n begin\n\treadln(a[i]);\n insert(i,a[i]);insert(a[i],i);\n end;\n fillchar(anss,sizeof(anss),0);\n dfs(1,0);\n writeln(anss[1]);\nend.\n ", "problem_context": "Score : 800 points\n\nProblem Statement\n\nN contestants participated in a competition. The total of N-1 matches were played in a knockout tournament.\nFor some reasons, the tournament may not be \"fair\" for all the contestants.\nThat is, the number of the matches that must be played in order to win the championship may be different for each contestant. The structure of the tournament is formally described at the end of this statement.\n\nAfter each match, there were always one winner and one loser. The last contestant standing was declared the champion.\n\nFigure: an example of a tournament\n\nFor convenience, the contestants were numbered 1 through N. The contestant numbered 1 was the champion, and the contestant numbered i(2 ≦ i ≦ N) was defeated in a match against the contestant numbered a_i.\n\nWe will define the depth of the tournament as the maximum number of the matches that must be played in order to win the championship over all the contestants.\n\nFind the minimum possible depth of the tournament.\n\nThe formal description of the structure of the tournament is as follows. In the i-th match, one of the following played against each other:\n\nTwo predetermined contestants\n\nOne predetermined contestant and the winner of the j-th match, where j(jans) then ans:=depth[u]+t[u];\n q:=last[u];\n while (q>0) do\n begin\n v:=other[q];\n if (v<>father) then dfs(v,u);\n\tq:=pre[q];\n end;\nend;\nbegin\n readln(n);\n fillchar(a,sizeof(a),0);\n fillchar(t,sizeof(t),0);\n tot:=0;\n for i:=2 to n do\n begin\n\treadln(a[i]);\n t[a[i]]:=t[a[i]]+1;\n insert(i,a[i]);insert(a[i],i);\n end;\n ans:=0;\n dfs(1,0);\n if (ans>n) then ans:=n;\n writeln(ans-1);\nend.\n ", "language": "Pascal", "metadata": {"date": 1485139753, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03822.html", "problem_id": "p03822", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03822/input.txt", "sample_output_relpath": "derived/input_output/data/p03822/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03822/Pascal/s611153069.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s611153069", "user_id": "u331121156"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "var n,i,tot:longint;\n\tlast,pre,other,depth,a,t:array[0..300007] of int64;\n\tans:int64;\nprocedure insert(u,v:longint);\nbegin\n inc(tot);\n other[tot]:=v;\n pre[tot]:=last[u];\n last[u]:=tot;\nend;\nprocedure dfs(u,father:longint);\nvar q,v:longint;\nbegin\n depth[u]:=depth[father]+1;\n if (depth[u]+t[u]>ans) then ans:=depth[u]+t[u];\n q:=last[u];\n while (q>0) do\n begin\n v:=other[q];\n if (v<>father) then dfs(v,u);\n\tq:=pre[q];\n end;\nend;\nbegin\n readln(n);\n fillchar(a,sizeof(a),0);\n fillchar(t,sizeof(t),0);\n tot:=0;\n for i:=2 to n do\n begin\n\treadln(a[i]);\n t[a[i]]:=t[a[i]]+1;\n insert(i,a[i]);insert(a[i],i);\n end;\n ans:=0;\n dfs(1,0);\n if (ans>n) then ans:=n;\n writeln(ans-1);\nend.\n ", "problem_context": "Score : 800 points\n\nProblem Statement\n\nN contestants participated in a competition. The total of N-1 matches were played in a knockout tournament.\nFor some reasons, the tournament may not be \"fair\" for all the contestants.\nThat is, the number of the matches that must be played in order to win the championship may be different for each contestant. The structure of the tournament is formally described at the end of this statement.\n\nAfter each match, there were always one winner and one loser. The last contestant standing was declared the champion.\n\nFigure: an example of a tournament\n\nFor convenience, the contestants were numbered 1 through N. The contestant numbered 1 was the champion, and the contestant numbered i(2 ≦ i ≦ N) was defeated in a match against the contestant numbered a_i.\n\nWe will define the depth of the tournament as the maximum number of the matches that must be played in order to win the championship over all the contestants.\n\nFind the minimum possible depth of the tournament.\n\nThe formal description of the structure of the tournament is as follows. In the i-th match, one of the following played against each other:\n\nTwo predetermined contestants\n\nOne predetermined contestant and the winner of the j-th match, where j(jans) then ans:=depth[u]+t[u];\n q:=last[u];\n while (q>0) do\n begin\n v:=other[q];\n if (v<>father) then dfs(v,u);\n\tq:=pre[q];\n end;\nend;\nbegin\n readln(n);\n fillchar(a,sizeof(a),0);\n fillchar(t,sizeof(t),0);\n tot:=0;\n for i:=2 to n do\n begin\n\treadln(a[i]);\n t[a[i]]:=t[a[i]]+1;\n insert(i,a[i]);insert(a[i],i);\n end;\n ans:=0;\n dfs(1,0);\n writeln(ans-1);\nend.\n ", "language": "Pascal", "metadata": {"date": 1485138572, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03822.html", "problem_id": "p03822", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03822/input.txt", "sample_output_relpath": "derived/input_output/data/p03822/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03822/Pascal/s594568447.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s594568447", "user_id": "u331121156"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "var n,i,tot,ans:longint;\n a,t,f:array[0..100007] of longint;\n\tlast,pre,other,depth:array[0..300007] of longint;\nprocedure insert(u,v:longint);\nbegin\n inc(tot);\n other[tot]:=v;\n pre[tot]:=last[u];\n last[u]:=tot;\nend;\nprocedure dfs(u,father:longint);\nvar q,v:longint;\nbegin\n depth[u]:=depth[father]+1;\n if (depth[u]+t[u]>ans) then ans:=depth[u]+t[u];\n q:=last[u];\n while (q>0) do\n begin\n v:=other[q];\n if (v<>father) then dfs(v,u);\n\tq:=pre[q];\n end;\nend;\nbegin\n readln(n);\n fillchar(a,sizeof(a),0);\n fillchar(t,sizeof(t),0);\n tot:=0;\n for i:=2 to n do\n begin\n\treadln(a[i]);\n t[a[i]]:=t[a[i]]+1;\n insert(i,a[i]);insert(a[i],i);\n end;\n ans:=0;\n dfs(1,0);\n writeln(ans-1);\nend.\n ", "problem_context": "Score : 800 points\n\nProblem Statement\n\nN contestants participated in a competition. The total of N-1 matches were played in a knockout tournament.\nFor some reasons, the tournament may not be \"fair\" for all the contestants.\nThat is, the number of the matches that must be played in order to win the championship may be different for each contestant. The structure of the tournament is formally described at the end of this statement.\n\nAfter each match, there were always one winner and one loser. The last contestant standing was declared the champion.\n\nFigure: an example of a tournament\n\nFor convenience, the contestants were numbered 1 through N. The contestant numbered 1 was the champion, and the contestant numbered i(2 ≦ i ≦ N) was defeated in a match against the contestant numbered a_i.\n\nWe will define the depth of the tournament as the maximum number of the matches that must be played in order to win the championship over all the contestants.\n\nFind the minimum possible depth of the tournament.\n\nThe formal description of the structure of the tournament is as follows. In the i-th match, one of the following played against each other:\n\nTwo predetermined contestants\n\nOne predetermined contestant and the winner of the j-th match, where j(jans) then ans:=depth[u]+t[u];\n q:=last[u];\n while (q>0) do\n begin\n v:=other[q];\n if (v<>father) then dfs(v,u);\n\tq:=pre[q];\n end;\nend;\nbegin\n readln(n);\n fillchar(a,sizeof(a),0);\n fillchar(t,sizeof(t),0);\n tot:=0;\n for i:=2 to n do\n begin\n\treadln(a[i]);\n t[a[i]]:=t[a[i]]+1;\n insert(i,a[i]);insert(a[i],i);\n end;\n ans:=0;\n dfs(1,0);\n writeln(ans-1);\nend.\n ", "language": "Pascal", "metadata": {"date": 1485138565, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03822.html", "problem_id": "p03822", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03822/input.txt", "sample_output_relpath": "derived/input_output/data/p03822/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03822/Pascal/s156447473.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s156447473", "user_id": "u331121156"}, "prompt_components": {"gold_output": "3\n", "input_to_evaluate": "var n,i,tot,ans:longint;\n a,t,f:array[0..100007] of longint;\n\tlast,pre,other,depth:array[0..300007] of longint;\nprocedure insert(u,v:longint);\nbegin\n inc(tot);\n other[tot]:=v;\n pre[tot]:=last[u];\n last[u]:=tot;\nend;\nprocedure dfs(u,father:longint);\nvar q,v:longint;\nbegin\n depth[u]:=depth[father]+1;\n if (depth[u]+t[u]>ans) then ans:=depth[u]+t[u];\n q:=last[u];\n while (q>0) do\n begin\n v:=other[q];\n if (v<>father) then dfs(v,u);\n\tq:=pre[q];\n end;\nend;\nbegin\n readln(n);\n fillchar(a,sizeof(a),0);\n fillchar(t,sizeof(t),0);\n tot:=0;\n for i:=2 to n do\n begin\n\treadln(a[i]);\n t[a[i]]:=t[a[i]]+1;\n insert(i,a[i]);insert(a[i],i);\n end;\n ans:=0;\n dfs(1,0);\n writeln(ans-1);\nend.\n ", "problem_context": "Score : 800 points\n\nProblem Statement\n\nN contestants participated in a competition. The total of N-1 matches were played in a knockout tournament.\nFor some reasons, the tournament may not be \"fair\" for all the contestants.\nThat is, the number of the matches that must be played in order to win the championship may be different for each contestant. The structure of the tournament is formally described at the end of this statement.\n\nAfter each match, there were always one winner and one loser. The last contestant standing was declared the champion.\n\nFigure: an example of a tournament\n\nFor convenience, the contestants were numbered 1 through N. The contestant numbered 1 was the champion, and the contestant numbered i(2 ≦ i ≦ N) was defeated in a match against the contestant numbered a_i.\n\nWe will define the depth of the tournament as the maximum number of the matches that must be played in order to win the championship over all the contestants.\n\nFind the minimum possible depth of the tournament.\n\nThe formal description of the structure of the tournament is as follows. In the i-th match, one of the following played against each other:\n\nTwo predetermined contestants\n\nOne predetermined contestant and the winner of the j-th match, where j(jmax then max:=x;\n x:=x-1;\n end;\nwrite(max);\nend.", "language": "Pascal", "metadata": {"date": 1581734202, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03827.html", "problem_id": "p03827", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03827/input.txt", "sample_output_relpath": "derived/input_output/data/p03827/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03827/Pascal/s971753034.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s971753034", "user_id": "u426964396"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "var\nn,x,max,i:longint;\ns:string;\nbegin\nreadln(n);\nread(s);\nx:=0;\nmax:=-maxlongint;\nfor i:=1 to n do\n if s[i]='I' then inc(x)\n else\n begin\n if x>max then max:=x;\n x:=x-1;\n end;\nwrite(max);\nend.", "problem_context": "Score : 200 points\n\nProblem Statement\n\nYou have an integer variable x.\nInitially, x=0.\n\nSome person gave you a string S of length N, and using the string you performed the following operation N times.\nIn the i-th operation, you incremented the value of x by 1 if S_i=I, and decremented the value of x by 1 if S_i=D.\n\nFind the maximum value taken by x during the operations (including before the first operation, and after the last operation).\n\nConstraints\n\n1≤N≤100\n\n|S|=N\n\nNo characters except I and D occur in S.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\nS\n\nOutput\n\nPrint the maximum value taken by x during the operations.\n\nSample Input 1\n\n5\nIIDID\n\nSample Output 1\n\n2\n\nAfter each operation, the value of x becomes 1, 2, 1, 2 and 1, respectively. Thus, the output should be 2, the maximum value.\n\nSample Input 2\n\n7\nDDIDDII\n\nSample Output 2\n\n0\n\nThe initial value x=0 is the maximum value taken by x, thus the output should be 0.", "sample_input": "5\nIIDID\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03827", "source_text": "Score : 200 points\n\nProblem Statement\n\nYou have an integer variable x.\nInitially, x=0.\n\nSome person gave you a string S of length N, and using the string you performed the following operation N times.\nIn the i-th operation, you incremented the value of x by 1 if S_i=I, and decremented the value of x by 1 if S_i=D.\n\nFind the maximum value taken by x during the operations (including before the first operation, and after the last operation).\n\nConstraints\n\n1≤N≤100\n\n|S|=N\n\nNo characters except I and D occur in S.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\nS\n\nOutput\n\nPrint the maximum value taken by x during the operations.\n\nSample Input 1\n\n5\nIIDID\n\nSample Output 1\n\n2\n\nAfter each operation, the value of x becomes 1, 2, 1, 2 and 1, respectively. Thus, the output should be 2, the maximum value.\n\nSample Input 2\n\n7\nDDIDDII\n\nSample Output 2\n\n0\n\nThe initial value x=0 is the maximum value taken by x, thus the output should be 0.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s390182085", "group_id": "codeNet:p03827", "input_text": "var\n ch:char;\n n,i,max,k:longint;\nbegin\n readln(n);\n max:=0;k:=0;\n for i:=1 to n do\n begin\n read(ch);\n if ch='I' then k:=k+1;\n if ch='D' then k:=k-1;\n if k>max then max:=k;\n end;\n writeln(k);\nend.", "language": "Pascal", "metadata": {"date": 1556395099, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03827.html", "problem_id": "p03827", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03827/input.txt", "sample_output_relpath": "derived/input_output/data/p03827/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03827/Pascal/s390182085.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s390182085", "user_id": "u426964396"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "var\n ch:char;\n n,i,max,k:longint;\nbegin\n readln(n);\n max:=0;k:=0;\n for i:=1 to n do\n begin\n read(ch);\n if ch='I' then k:=k+1;\n if ch='D' then k:=k-1;\n if k>max then max:=k;\n end;\n writeln(k);\nend.", "problem_context": "Score : 200 points\n\nProblem Statement\n\nYou have an integer variable x.\nInitially, x=0.\n\nSome person gave you a string S of length N, and using the string you performed the following operation N times.\nIn the i-th operation, you incremented the value of x by 1 if S_i=I, and decremented the value of x by 1 if S_i=D.\n\nFind the maximum value taken by x during the operations (including before the first operation, and after the last operation).\n\nConstraints\n\n1≤N≤100\n\n|S|=N\n\nNo characters except I and D occur in S.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\nS\n\nOutput\n\nPrint the maximum value taken by x during the operations.\n\nSample Input 1\n\n5\nIIDID\n\nSample Output 1\n\n2\n\nAfter each operation, the value of x becomes 1, 2, 1, 2 and 1, respectively. Thus, the output should be 2, the maximum value.\n\nSample Input 2\n\n7\nDDIDDII\n\nSample Output 2\n\n0\n\nThe initial value x=0 is the maximum value taken by x, thus the output should be 0.", "sample_input": "5\nIIDID\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03827", "source_text": "Score : 200 points\n\nProblem Statement\n\nYou have an integer variable x.\nInitially, x=0.\n\nSome person gave you a string S of length N, and using the string you performed the following operation N times.\nIn the i-th operation, you incremented the value of x by 1 if S_i=I, and decremented the value of x by 1 if S_i=D.\n\nFind the maximum value taken by x during the operations (including before the first operation, and after the last operation).\n\nConstraints\n\n1≤N≤100\n\n|S|=N\n\nNo characters except I and D occur in S.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\nS\n\nOutput\n\nPrint the maximum value taken by x during the operations.\n\nSample Input 1\n\n5\nIIDID\n\nSample Output 1\n\n2\n\nAfter each operation, the value of x becomes 1, 2, 1, 2 and 1, respectively. Thus, the output should be 2, the maximum value.\n\nSample Input 2\n\n7\nDDIDDII\n\nSample Output 2\n\n0\n\nThe initial value x=0 is the maximum value taken by x, thus the output should be 0.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 2, "memory_kb": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s404956433", "group_id": "codeNet:p03828", "input_text": "program C;\nconst \n maxN = 1111;\n modulo = Round(1E9) + 7;\nvar\n n, x, i, j: Longint;\n fact: array[1..maxN] of Longint;\n ans: Int64;\n \nbegin\n ReadLn(n);\n for i := 1 to n do\n begin\n x := i;\n for j := 2 to n do\n if x mod j = 0 then\n while x mod j = 0 do\n begin\n Inc(fact[j]);\n x := x div j;\n end;\n end;\n ans := 1;\n for i := 2 to n do\n if fact[i] > 0 then \n ans := ans * (fact[i] + 1) mod modulo;\n WriteLn(ans);\nend.", "language": "Pascal", "metadata": {"date": 1545794152, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03828.html", "problem_id": "p03828", "resource_group": "low_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/Pascal/s404956433.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s404956433", "user_id": "u764056643"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "program C;\nconst \n maxN = 1111;\n modulo = Round(1E9) + 7;\nvar\n n, x, i, j: Longint;\n fact: array[1..maxN] of Longint;\n ans: Int64;\n \nbegin\n ReadLn(n);\n for i := 1 to n do\n begin\n x := i;\n for j := 2 to n do\n if x mod j = 0 then\n while x mod j = 0 do\n begin\n Inc(fact[j]);\n x := x div j;\n end;\n end;\n ans := 1;\n for i := 2 to n do\n if fact[i] > 0 then \n ans := ans * (fact[i] + 1) mod modulo;\n WriteLn(ans);\nend.", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 11, "memory_kb": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s088590014", "group_id": "codeNet:p03830", "input_text": "Var i,n,j,rem,fin:Longint;\n a:Array[1 .. 10000] of Longint;\nBegin\n Readln(n);\n Fillchar(a,sizeof(a),0);\n fin:=1;\n For i:=1 to n do begin\n rem:=i;\n For j:=2 to rem do\n While rem mod j = 0 do begin\n Inc(a[j]);\n rem:=rem div j;\n End;\n End;\n For i:=1 to n do fin:=fin*(a[i]+1) mod 1000000007;\n Writeln(fin);\nEnd.", "language": "Pascal", "metadata": {"date": 1547076346, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03830.html", "problem_id": "p03830", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03830/input.txt", "sample_output_relpath": "derived/input_output/data/p03830/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03830/Pascal/s088590014.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s088590014", "user_id": "u816631826"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "Var i,n,j,rem,fin:Longint;\n a:Array[1 .. 10000] of Longint;\nBegin\n Readln(n);\n Fillchar(a,sizeof(a),0);\n fin:=1;\n For i:=1 to n do begin\n rem:=i;\n For j:=2 to rem do\n While rem mod j = 0 do begin\n Inc(a[j]);\n rem:=rem div j;\n End;\n End;\n For i:=1 to n do fin:=fin*(a[i]+1) mod 1000000007;\n Writeln(fin);\nEnd.", "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": "p03830", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 398, "cpu_time_ms": 6, "memory_kb": 128}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s817555335", "group_id": "codeNet:p03831", "input_text": "var\n\tn,i:Longint;\n\ta,b,p,q,ans:int64;\nbegin\n\tread(n,a,b,p);\n\tfor i:=2 to n do begin\n\t\tread(q);\n\t\tif b>a*(q-p)then ans:=ans+a*(q-p)else ans:=ans+b;\n\t\tp:=q;\n\tend;\n\twriteln(ans);\nend.\n", "language": "Pascal", "metadata": {"date": 1539164284, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03831.html", "problem_id": "p03831", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03831/input.txt", "sample_output_relpath": "derived/input_output/data/p03831/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03831/Pascal/s817555335.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s817555335", "user_id": "u657913472"}, "prompt_components": {"gold_output": "11\n", "input_to_evaluate": "var\n\tn,i:Longint;\n\ta,b,p,q,ans:int64;\nbegin\n\tread(n,a,b,p);\n\tfor i:=2 to n do begin\n\t\tread(q);\n\t\tif b>a*(q-p)then ans:=ans+a*(q-p)else ans:=ans+b;\n\t\tp:=q;\n\tend;\n\twriteln(ans);\nend.\n", "problem_context": "Score : 500 points\n\nProblem Statement\n\nThere are N towns on a line running east-west.\nThe towns are numbered 1 through N, in order from west to east.\nEach point on the line has a one-dimensional coordinate, and a point that is farther east has a greater coordinate value.\nThe coordinate of town i is X_i.\n\nYou are now at town 1, and you want to visit all the other towns.\nYou have two ways to travel:\n\nWalk on the line.\nYour fatigue level increases by A each time you travel a distance of 1, regardless of direction.\n\nTeleport to any location of your choice.\nYour fatigue level increases by B, regardless of the distance covered.\n\nFind the minimum possible total increase of your fatigue level when you visit all the towns in these two ways.\n\nConstraints\n\nAll input values are integers.\n\n2≤N≤10^5\n\n1≤X_i≤10^9\n\nFor all i(1≤i≤N-1), X_i0 then my:=d else my:=0;\nend;\nbegin\n\tread(N,K);\n\tfor i:=1 to N do read(s[i]);\n\ta[1]:=s[1];\n\tb[1]:=my(s[1]);\n\tfor i:=2 to N do begin\n\t\ta[i]:=s[i]+a[i-1];\n\t\tb[i]:=my(s[i])+b[i-1];\n\tend;\n\tans:=0;\n\tfor i:=0 to N-K do begin\n\t\tsum:=my(a[i+K]-a[i]);\n\t\tinc(sum,b[i]-b[0]+b[N]-b[i+K]);\n\t\tif ans0 then my:=d else my:=0;\nend;\nbegin\n\tread(N,K);\n\tfor i:=1 to N do read(s[i]);\n\ta[1]:=s[1];\n\tb[1]:=my(s[1]);\n\tfor i:=2 to N do begin\n\t\ta[i]:=s[i]+a[i-1];\n\t\tb[i]:=my(s[i])+b[i-1];\n\tend;\n\tans:=0;\n\tfor i:=0 to N-K do begin\n\t\tsum:=my(a[i+K]-a[i]);\n\t\tinc(sum,b[i]-b[0]+b[N]-b[i+K]);\n\t\tif ans=n then \n\t\tbegin \n\t\t\twriteln(0);\n\t\t\thalt;\n\t\tend;\n\t\tinc(vis[a[i]]);\n\t\tif (a[i]=0) and (vis[0]>=2) then \n\t\tbegin \n\t\t\twriteln(0);\n\t\t\thalt;\n\t\tend;\n\tend; \n\tif vis[0]=0 then \n\tbegin \t\n\t\twriteln(0);\n\t\thalt;\n\tend;\n\tans:=1;\n\tfor i:=1 to n do \n\tbegin \n\t\tif vis[i]=2 then \n\t\tans:=(ans*2) mod 1000000007\n\t\telse\n\t\tbegin \n\t\t\tif (vis[i]=1) and (i>0) then \n\t\t\tbegin \n\t\t\t\twriteln(0);\n\t\t\t\thalt;\n\t\t\tend;\n\t\tend;\n\tend;\n\twriteln(ans);\nend. ", "language": "Pascal", "metadata": {"date": 1509835802, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03846.html", "problem_id": "p03846", "resource_group": "low_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/Pascal/s278397199.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s278397199", "user_id": "u662099472"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "program ec12;\nvar \n\tn,m,i,j:longint;\n\tans:int64;\n\ta:array[1..100001] of longint;\n\tvis:array[0..100001] of longint;\nbegin \n\tfillchar(vis,sizeof(vis),0);\n\treadln(n);\n\tfor i:=1 to n do \n\tbegin \n\t\tread(a[i]);\n\t\tif a[i]>=n then \n\t\tbegin \n\t\t\twriteln(0);\n\t\t\thalt;\n\t\tend;\n\t\tinc(vis[a[i]]);\n\t\tif (a[i]=0) and (vis[0]>=2) then \n\t\tbegin \n\t\t\twriteln(0);\n\t\t\thalt;\n\t\tend;\n\tend; \n\tif vis[0]=0 then \n\tbegin \t\n\t\twriteln(0);\n\t\thalt;\n\tend;\n\tans:=1;\n\tfor i:=1 to n do \n\tbegin \n\t\tif vis[i]=2 then \n\t\tans:=(ans*2) mod 1000000007\n\t\telse\n\t\tbegin \n\t\t\tif (vis[i]=1) and (i>0) then \n\t\t\tbegin \n\t\t\t\twriteln(0);\n\t\t\t\thalt;\n\t\t\tend;\n\t\tend;\n\tend;\n\twriteln(ans);\nend. ", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 634, "cpu_time_ms": 12, "memory_kb": 896}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s039177198", "group_id": "codeNet:p03848", "input_text": "program C;\n var N,i,A:longint;\n var bo,ca:boolean;\n var Route:array[0..120000]of integer;\n var ans:longint;\nbegin\n fillchar(Route,sizeof(Route),0);\n readln(N);\n for i:=1 to N do\n begin\n read(A);\n if i=1 then if A mod 2=0 then bo:=true else bo:=false;\n Route[A div 2]:=Route[A div 2]+1;\n end;\n if bo then if Route[0]=1 then ca:=true else ca:=false else if Route[0]=2 then ca:=true else ca:=false;\n if ca then for i:=1 to ((N+1)div 2)-1 do if Route[i]<>2 then ca:=false;\n if ca then\n begin\n ans:=1;\n for i:=1 to N div 2 do ans:=(ans*2) mod 1000000007;\n writeln(ans) \n end\n else writeln(0)\nend.", "language": "Pascal", "metadata": {"date": 1482113928, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03848.html", "problem_id": "p03848", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03848/input.txt", "sample_output_relpath": "derived/input_output/data/p03848/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03848/Pascal/s039177198.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s039177198", "user_id": "u566971318"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "program C;\n var N,i,A:longint;\n var bo,ca:boolean;\n var Route:array[0..120000]of integer;\n var ans:longint;\nbegin\n fillchar(Route,sizeof(Route),0);\n readln(N);\n for i:=1 to N do\n begin\n read(A);\n if i=1 then if A mod 2=0 then bo:=true else bo:=false;\n Route[A div 2]:=Route[A div 2]+1;\n end;\n if bo then if Route[0]=1 then ca:=true else ca:=false else if Route[0]=2 then ca:=true else ca:=false;\n if ca then for i:=1 to ((N+1)div 2)-1 do if Route[i]<>2 then ca:=false;\n if ca then\n begin\n ans:=1;\n for i:=1 to N div 2 do ans:=(ans*2) mod 1000000007;\n writeln(ans) \n end\n else writeln(0)\nend.", "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": "p03848", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 679, "cpu_time_ms": 16, "memory_kb": 512}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s836019686", "group_id": "codeNet:p03852", "input_text": "var a,b:array[1..201,1..201] of char;\n n,m,i,j:byte;\nbegin\nreadln(n,m);\nfor i:=1 to n do begin\n for j:=1 to m do read(a[i,j]); end;\nfor i:=1 to n*2 do begin\n for j:=1 to m do write(a[i,j]); writeln;\n for j:=1 to m do write(a[i,j]); writeln; end;\nend.\n", "language": "Pascal", "metadata": {"date": 1481422709, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03852.html", "problem_id": "p03852", "resource_group": "low_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/Pascal/s836019686.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s836019686", "user_id": "u157928101"}, "prompt_components": {"gold_output": "vowel\n", "input_to_evaluate": "var a,b:array[1..201,1..201] of char;\n n,m,i,j:byte;\nbegin\nreadln(n,m);\nfor i:=1 to n do begin\n for j:=1 to m do read(a[i,j]); end;\nfor i:=1 to n*2 do begin\n for j:=1 to m do write(a[i,j]); writeln;\n for j:=1 to m do write(a[i,j]); writeln; end;\nend.\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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s983328402", "group_id": "codeNet:p03853", "input_text": "var i:Longint;s:String[100];begin readln();for i:=1 to 100 do begin readln(s);writeln(s);writeln(s)end;end.", "language": "Pascal", "metadata": {"date": 1537948002, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03853.html", "problem_id": "p03853", "resource_group": "low_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/Pascal/s983328402.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s983328402", "user_id": "u657913472"}, "prompt_components": {"gold_output": "*.\n*.\n.*\n.*\n", "input_to_evaluate": "var i:Longint;s:String[100];begin readln();for i:=1 to 100 do begin readln(s);writeln(s);writeln(s)end;end.", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 107, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s840443367", "group_id": "codeNet:p03853", "input_text": "var i:Longint;s:String[100];begin readln();for i:=1 to 100 do begin readln(s);writeln(s);writeln(s)end;end.", "language": "Pascal", "metadata": {"date": 1537947974, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03853.html", "problem_id": "p03853", "resource_group": "low_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/Pascal/s840443367.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s840443367", "user_id": "u657913472"}, "prompt_components": {"gold_output": "*.\n*.\n.*\n.*\n", "input_to_evaluate": "var i:Longint;s:String[100];begin readln();for i:=1 to 100 do begin readln(s);writeln(s);writeln(s)end;end.", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 107, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s404525981", "group_id": "codeNet:p03853", "input_text": "var a,i:Longint;s:String[100];begin readln(a);for i:=1 to a do begin readln(s);writeln(s);writeln(s)end;end.", "language": "Pascal", "metadata": {"date": 1537947674, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03853.html", "problem_id": "p03853", "resource_group": "low_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/Pascal/s404525981.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s404525981", "user_id": "u657913472"}, "prompt_components": {"gold_output": "*.\n*.\n.*\n.*\n", "input_to_evaluate": "var a,i:Longint;s:String[100];begin readln(a);for i:=1 to a do begin readln(s);writeln(s);writeln(s)end;end.", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 1, "memory_kb": 128}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s022897824", "group_id": "codeNet:p03853", "input_text": "var a,b,i:Longint;s:String;begin readln(a,b);for i:=1 to a do begin readln(s);writeln(s);writeln(s)end;end.", "language": "Pascal", "metadata": {"date": 1537947570, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03853.html", "problem_id": "p03853", "resource_group": "low_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/Pascal/s022897824.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s022897824", "user_id": "u657913472"}, "prompt_components": {"gold_output": "*.\n*.\n.*\n.*\n", "input_to_evaluate": "var a,b,i:Longint;s:String;begin readln(a,b);for i:=1 to a do begin readln(s);writeln(s);writeln(s)end;end.", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 107, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s348586324", "group_id": "codeNet:p03853", "input_text": "program Project1;\n\n{$APPTYPE CONSOLE}\n\nuses\n SysUtils;\nvar\n w,h,i:Integer;\n s:array of string;\nbegin\n try\n { TODO -oUser -cConsole Main : ここにコードを記述してください }\n Read(h);\n Readln(w);\n SetLength(s,h);\n for i := 0 to h - 1 do\n Readln(s[i]);\n\n for i := 0 to h - 1 do begin\n Writeln(s[i]);\n Writeln(s[i]);\n end;\n Readln;\n except\n on E: Exception do\n Writeln(E.ClassName, ': ', E.Message);\n end;\nend.\n", "language": "Pascal", "metadata": {"date": 1514327736, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03853.html", "problem_id": "p03853", "resource_group": "low_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/Pascal/s348586324.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s348586324", "user_id": "u755925739"}, "prompt_components": {"gold_output": "*.\n*.\n.*\n.*\n", "input_to_evaluate": "program Project1;\n\n{$APPTYPE CONSOLE}\n\nuses\n SysUtils;\nvar\n w,h,i:Integer;\n s:array of string;\nbegin\n try\n { TODO -oUser -cConsole Main : ここにコードを記述してください }\n Read(h);\n Readln(w);\n SetLength(s,h);\n for i := 0 to h - 1 do\n Readln(s[i]);\n\n for i := 0 to h - 1 do begin\n Writeln(s[i]);\n Writeln(s[i]);\n end;\n Readln;\n except\n on E: Exception do\n Writeln(E.ClassName, ': ', E.Message);\n end;\nend.\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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 1, "memory_kb": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s190988851", "group_id": "codeNet:p03853", "input_text": "var a,b:array[1..201,1..201] of char;\n n,m,i,j:byte;\nbegin\nreadln(n,m);\nfor i:=1 to n do begin\n for j:=1 to m do read(a[i,j]); end;\nfor i:=1 to n*2 do begin\n for j:=1 to m do write(a[i,j]); writeln;\n for j:=1 to m do write(a[i,j]); writeln; end;\nend.\n", "language": "Pascal", "metadata": {"date": 1481422726, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03853.html", "problem_id": "p03853", "resource_group": "low_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/Pascal/s190988851.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s190988851", "user_id": "u157928101"}, "prompt_components": {"gold_output": "*.\n*.\n.*\n.*\n", "input_to_evaluate": "var a,b:array[1..201,1..201] of char;\n n,m,i,j:byte;\nbegin\nreadln(n,m);\nfor i:=1 to n do begin\n for j:=1 to m do read(a[i,j]); end;\nfor i:=1 to n*2 do begin\n for j:=1 to m do write(a[i,j]); writeln;\n for j:=1 to m do write(a[i,j]); writeln; end;\nend.\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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 3, "memory_kb": 128}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s697442233", "group_id": "codeNet:p03857", "input_text": "program D;\n var N,K,L:longint;\n var i,j,p,q:longint;\n var a:array[1..25000]of longint;\n var b:array[1..25000]of longint;\n var map1:array[1..25000,1..25000]of boolean;\n var map2:array[1..25000,1..25000]of boolean;\n var used:array[1..25000]of boolean;\n var ansr:array[1..25000]of longint;\n procedure DFS1(_,__:longint);\n var ii:longint;\n begin\n used[_]:=true;\n a[_]:=__;\n for ii:=1 to N do\n if (map1[_,ii]=true)AND(used[ii]=false) then DFS1(ii,__);\n end; \n procedure DFS2(_,__:longint);\n var ii:longint;\n begin\n used[_]:=true;\n b[_]:=__;\n for ii:=1 to N do\n if (a[_]=a[ii])AND(map2[_,ii]=true)AND(used[ii]=false) then DFS2(ii,__);\n end; \nbegin\n readln(N,K,L);\n for i:=1 to N do \n begin\n map1[i,i]:=true;\n map2[i,i]:=true;\n used[i]:=false;\n ansr[i]:=0;\n end;\n for i:=1 to K do\n begin\n readln(p,q);\n map1[p,q]:=true;\n map1[q,p]:=true;\n end;\n for i:=1 to N do if used[i]=false then DFS1(i,i);\n for i:=1 to L do\n begin\n readln(p,q);\n map2[p,q]:=true;\n map2[q,p]:=true;\n end;\n for i:=1 to N do used[i]:=false;\n for i:=1 to N do if used[i]=false then DFS2(i,i);\n for i:=1 to N do ansr[b[i]]:=ansr[b[i]]+1;\n for i:=1 to N do write(ansr[b[i]],' ');\nend.", "language": "Pascal", "metadata": {"date": 1481679289, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03857.html", "problem_id": "p03857", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03857/input.txt", "sample_output_relpath": "derived/input_output/data/p03857/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03857/Pascal/s697442233.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s697442233", "user_id": "u566971318"}, "prompt_components": {"gold_output": "1 2 2 1\n", "input_to_evaluate": "program D;\n var N,K,L:longint;\n var i,j,p,q:longint;\n var a:array[1..25000]of longint;\n var b:array[1..25000]of longint;\n var map1:array[1..25000,1..25000]of boolean;\n var map2:array[1..25000,1..25000]of boolean;\n var used:array[1..25000]of boolean;\n var ansr:array[1..25000]of longint;\n procedure DFS1(_,__:longint);\n var ii:longint;\n begin\n used[_]:=true;\n a[_]:=__;\n for ii:=1 to N do\n if (map1[_,ii]=true)AND(used[ii]=false) then DFS1(ii,__);\n end; \n procedure DFS2(_,__:longint);\n var ii:longint;\n begin\n used[_]:=true;\n b[_]:=__;\n for ii:=1 to N do\n if (a[_]=a[ii])AND(map2[_,ii]=true)AND(used[ii]=false) then DFS2(ii,__);\n end; \nbegin\n readln(N,K,L);\n for i:=1 to N do \n begin\n map1[i,i]:=true;\n map2[i,i]:=true;\n used[i]:=false;\n ansr[i]:=0;\n end;\n for i:=1 to K do\n begin\n readln(p,q);\n map1[p,q]:=true;\n map1[q,p]:=true;\n end;\n for i:=1 to N do if used[i]=false then DFS1(i,i);\n for i:=1 to L do\n begin\n readln(p,q);\n map2[p,q]:=true;\n map2[q,p]:=true;\n end;\n for i:=1 to N do used[i]:=false;\n for i:=1 to N do if used[i]=false then DFS2(i,i);\n for i:=1 to N do ansr[b[i]]:=ansr[b[i]]+1;\n for i:=1 to N do write(ansr[b[i]],' ');\nend.", "problem_context": "Score : 400 points\n\nProblem Statement\n\nThere are N cities. There are also K roads and L railways, extending between the cities.\nThe i-th road bidirectionally connects the p_i-th and q_i-th cities, and the i-th railway bidirectionally connects the r_i-th and s_i-th cities.\nNo two roads connect the same pair of cities. Similarly, no two railways connect the same pair of cities.\n\nWe will say city A and B are connected by roads if city B is reachable from city A by traversing some number of roads. Here, any city is considered to be connected to itself by roads.\nWe will also define connectivity by railways similarly.\n\nFor each city, find the number of the cities connected to that city by both roads and railways.\n\nConstraints\n\n2 ≦ N ≦ 2*10^5\n\n1 ≦ K, L≦ 10^5\n\n1 ≦ p_i, q_i, r_i, s_i ≦ N\n\np_i < q_i\n\nr_i < s_i\n\nWhen i ≠ j, (p_i, q_i) ≠ (p_j, q_j)\n\nWhen i ≠ j, (r_i, s_i) ≠ (r_j, s_j)\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN K L\np_1 q_1\n:\np_K q_K\nr_1 s_1\n:\nr_L s_L\n\nOutput\n\nPrint N integers. The i-th of them should represent the number of the cities connected to the i-th city by both roads and railways.\n\nSample Input 1\n\n4 3 1\n1 2\n2 3\n3 4\n2 3\n\nSample Output 1\n\n1 2 2 1\n\nAll the four cities are connected to each other by roads.\n\nBy railways, only the second and third cities are connected. Thus, the answers for the cities are 1, 2, 2 and 1, respectively.\n\nSample Input 2\n\n4 2 2\n1 2\n2 3\n1 4\n2 3\n\nSample Output 2\n\n1 2 2 1\n\nSample Input 3\n\n7 4 4\n1 2\n2 3\n2 5\n6 7\n3 5\n4 5\n3 4\n6 7\n\nSample Output 3\n\n1 1 2 1 2 2 2", "sample_input": "4 3 1\n1 2\n2 3\n3 4\n2 3\n"}, "reference_outputs": ["1 2 2 1\n"], "source_document_id": "p03857", "source_text": "Score : 400 points\n\nProblem Statement\n\nThere are N cities. There are also K roads and L railways, extending between the cities.\nThe i-th road bidirectionally connects the p_i-th and q_i-th cities, and the i-th railway bidirectionally connects the r_i-th and s_i-th cities.\nNo two roads connect the same pair of cities. Similarly, no two railways connect the same pair of cities.\n\nWe will say city A and B are connected by roads if city B is reachable from city A by traversing some number of roads. Here, any city is considered to be connected to itself by roads.\nWe will also define connectivity by railways similarly.\n\nFor each city, find the number of the cities connected to that city by both roads and railways.\n\nConstraints\n\n2 ≦ N ≦ 2*10^5\n\n1 ≦ K, L≦ 10^5\n\n1 ≦ p_i, q_i, r_i, s_i ≦ N\n\np_i < q_i\n\nr_i < s_i\n\nWhen i ≠ j, (p_i, q_i) ≠ (p_j, q_j)\n\nWhen i ≠ j, (r_i, s_i) ≠ (r_j, s_j)\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN K L\np_1 q_1\n:\np_K q_K\nr_1 s_1\n:\nr_L s_L\n\nOutput\n\nPrint N integers. The i-th of them should represent the number of the cities connected to the i-th city by both roads and railways.\n\nSample Input 1\n\n4 3 1\n1 2\n2 3\n3 4\n2 3\n\nSample Output 1\n\n1 2 2 1\n\nAll the four cities are connected to each other by roads.\n\nBy railways, only the second and third cities are connected. Thus, the answers for the cities are 1, 2, 2 and 1, respectively.\n\nSample Input 2\n\n4 2 2\n1 2\n2 3\n1 4\n2 3\n\nSample Output 2\n\n1 2 2 1\n\nSample Input 3\n\n7 4 4\n1 2\n2 3\n2 5\n6 7\n3 5\n4 5\n3 4\n6 7\n\nSample Output 3\n\n1 1 2 1 2 2 2", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1380, "cpu_time_ms": 193, "memory_kb": 200192}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s006424215", "group_id": "codeNet:p03857", "input_text": "program D;\n var N,K,L:longint;\n var root:array[1..200005]of longint;\n var size:array[1..200005]of longint;\n var colr:array[1..200005]of longint;\n var i,j,p,q:longint;\n function FindRoot(_:longint):longint;\n begin\n if root[_]=_ then exit(_) else exit(FindRoot(root[_]));\n end;\n procedure Merge(_x,_y:longint);\n var x,y:longint;\n begin\n x:=FindRoot(_x);\n y:=FindRoot(_y);\n if x<>y then\n if size[x]y then\n if size[x]y then\n if size[x]y then\n if size[x]x then\n begin\n if (i+2<=n)then\n begin\n if a[i+2]+a[i+1]>x then\n begin\n y:=a[i+1]-(x-a[i]);\n z:=a[i+1]-(x-a[i+2]);\n if y>z then\n begin\n ans:=ans+y;\n if y>a[i+1] then\n begin\n a[i+2]:=a[i+2]-(y-a[i+1]);\n a[i+1]:=0;\n end\n else a[i+1]:=a[i+1]-y;\n end\n else\n begin\n ans:=ans+z;\n // writeln('2');\n if z>a[i+1] then\n begin\n a[i+2]:=a[i+2]-(z-a[i+1]);\n a[i+1]:=0;\n end\n else a[i+1]:=a[i+1]-z;\n end;\n end;\n end\n else\n begin\n y:=a[i+1]+a[i]-x;\n if a[i+1]-y<=0 then\n begin\n a[i]:=a[i]-(y-a[i+1]);\n a[i+1]:=0;\n end\n else\n a[i+1]:=a[i+1]-y;\n ans:=ans+y;\n end;\n end;\n end;\n // for i:=1 to n do\n // write(a[i],' ');\n writeln(ans);\nend.\n\n", "language": "Pascal", "metadata": {"date": 1502317588, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03862.html", "problem_id": "p03862", "resource_group": "low_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/Pascal/s334220784.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s334220784", "user_id": "u089230684"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "var n,x,y,z,i,j,k,ans:longint;\na:array[1..1000000]of longint;\nbegin\n readln(n,x);\n for i:=1 to n do\n begin\n read(a[i]);\n end;\n for i:=1 to n-1 do\n begin\n // writeln(i);\n if a[i]+a[i+1]>x then\n begin\n if (i+2<=n)then\n begin\n if a[i+2]+a[i+1]>x then\n begin\n y:=a[i+1]-(x-a[i]);\n z:=a[i+1]-(x-a[i+2]);\n if y>z then\n begin\n ans:=ans+y;\n if y>a[i+1] then\n begin\n a[i+2]:=a[i+2]-(y-a[i+1]);\n a[i+1]:=0;\n end\n else a[i+1]:=a[i+1]-y;\n end\n else\n begin\n ans:=ans+z;\n // writeln('2');\n if z>a[i+1] then\n begin\n a[i+2]:=a[i+2]-(z-a[i+1]);\n a[i+1]:=0;\n end\n else a[i+1]:=a[i+1]-z;\n end;\n end;\n end\n else\n begin\n y:=a[i+1]+a[i]-x;\n if a[i+1]-y<=0 then\n begin\n a[i]:=a[i]-(y-a[i+1]);\n a[i+1]:=0;\n end\n else\n a[i+1]:=a[i+1]-y;\n ans:=ans+y;\n end;\n end;\n end;\n // for i:=1 to n do\n // write(a[i],' ');\n writeln(ans);\nend.\n\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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 1625, "cpu_time_ms": 17, "memory_kb": 512}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s099285460", "group_id": "codeNet:p03862", "input_text": "var a:array [1..100000] of longint;\n b,l,i,s:longint;\nbegin\n s:=0;\n read(b,l);\n for i:=1 to b do\n read(a[i]);\n for i:=1 to b-1 do\n while (a[i]+a[i+1]>l) do\n begin\n a[i+1]:=a[i+1]-1;\n s:=s+1;\n end;\n writeln(s);\nend.", "language": "Pascal", "metadata": {"date": 1502314430, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03862.html", "problem_id": "p03862", "resource_group": "low_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/Pascal/s099285460.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s099285460", "user_id": "u089230684"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "var a:array [1..100000] of longint;\n b,l,i,s:longint;\nbegin\n s:=0;\n read(b,l);\n for i:=1 to b do\n read(a[i]);\n for i:=1 to b-1 do\n while (a[i]+a[i+1]>l) do\n begin\n a[i+1]:=a[i+1]-1;\n s:=s+1;\n end;\n writeln(s);\nend.", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 358, "cpu_time_ms": 2103, "memory_kb": 512}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s186604960", "group_id": "codeNet:p03862", "input_text": "program taskJ;\nvar n,x,i,j,sum,sum2:longint;\n o:array[1..100000]of longint;\nbegin\nreadln(n,x);\nread(o[1]);\nfor i:=2 to n do\nbegin\n read(o[i]);\n if o[i]+o[i-1]>x then\n begin\n sum:=sum+o[i]+o[i-1]-x;\n o[i]:=o[i]-(o[i]+o[i-1]-x);\n end;\nend;\nfor j:=n downto 2 do\nbegin\n if o[j]+o[j-1]>x then\n begin\n sum:=sum+o[j]+o[j-1]-x;\n o[j-1]:=o[j-1]-(o[j]+o[j-1]-x);\n end;\nend;\nif sumx then\n begin\n sum:=sum+o[i]+o[i-1]-x;\n o[i]:=o[i]-(o[i]+o[i-1]-x);\n end;\nend;\nfor j:=n downto 2 do\nbegin\n if o[j]+o[j-1]>x then\n begin\n sum:=sum+o[j]+o[j-1]-x;\n o[j-1]:=o[j-1]-(o[j]+o[j-1]-x);\n end;\nend;\nif sumx then\nbegin\nsum:=sum+o[i]+o[i-1]-x;\no[i]:=o[i]-(o[i]+o[i-1]-x);\nend;\nend;\nwriteln(sum);\nend.", "language": "Pascal", "metadata": {"date": 1502307789, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03862.html", "problem_id": "p03862", "resource_group": "low_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/Pascal/s946446109.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s946446109", "user_id": "u089230684"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "program taskJ;\nvar n,x,i,j,sum:longint;\no:array[1..100000]of longint;\nbegin\nreadln(n,x);\nread(o[1]);\nfor i:=2 to n do\nbegin\nread(o[i]);\nif o[i]+o[i-1]>x then\nbegin\nsum:=sum+o[i]+o[i-1]-x;\no[i]:=o[i]-(o[i]+o[i-1]-x);\nend;\nend;\nwriteln(sum);\nend.", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 244, "cpu_time_ms": 17, "memory_kb": 512}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s793375020", "group_id": "codeNet:p03863", "input_text": "var\n n:string;\nbegin\n readln(n);\n if n[1]=n[length(n)] then\n begin\n if odd(length(n)) then writeln('Second')\n else writeln('First');\n end\n else\n begin\n if odd(length(n)) then writeln('First')\n else writeln('Second');\n end;\nend.", "language": "Pascal", "metadata": {"date": 1588816735, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03863.html", "problem_id": "p03863", "resource_group": "low_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/Pascal/s793375020.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s793375020", "user_id": "u263933075"}, "prompt_components": {"gold_output": "Second\n", "input_to_evaluate": "var\n n:string;\nbegin\n readln(n);\n if n[1]=n[length(n)] then\n begin\n if odd(length(n)) then writeln('Second')\n else writeln('First');\n end\n else\n begin\n if odd(length(n)) then writeln('First')\n else writeln('Second');\n end;\nend.", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s227040176", "group_id": "codeNet:p03863", "input_text": "var\n s:string;\n l:longint;\nbegin\n readln(s);\n l:=length(s);\n if s[1]=s[l] then\n begin\n if l mod 2=0 then writeln('First')\n else writeln('Second');\n end\n else\n begin\n if l mod 2=1 then writeln('First')\n else writeln('Second');\n end;\nend.", "language": "Pascal", "metadata": {"date": 1558399391, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03863.html", "problem_id": "p03863", "resource_group": "low_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/Pascal/s227040176.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s227040176", "user_id": "u723721005"}, "prompt_components": {"gold_output": "Second\n", "input_to_evaluate": "var\n s:string;\n l:longint;\nbegin\n readln(s);\n l:=length(s);\n if s[1]=s[l] then\n begin\n if l mod 2=0 then writeln('First')\n else writeln('Second');\n end\n else\n begin\n if l mod 2=1 then writeln('First')\n else writeln('Second');\n end;\nend.", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s619824130", "group_id": "codeNet:p03864", "input_text": "program C;\n var N,x,i:longint;\n var a:array [1..120000] of longint;\n var u,v:longint;\n var ans:int64;\nbegin\n readln(N,x);ans:=0;\n for i:=1 to N do read(a[i]);\n for i:=2 to N do\n begin\n u:=a[i-1];v:=a[i];\n if u+v>x then\n begin\n if v>=u+v-x then a[i]:=x-u\n else\n begin\n a[i]:=0;\n a[i-1]:=x;\n end; \n ans:=ans+u+v-x;\n end; \n end;\n writeln(ans);\nend.", "language": "Pascal", "metadata": {"date": 1480905221, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03864.html", "problem_id": "p03864", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03864/input.txt", "sample_output_relpath": "derived/input_output/data/p03864/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03864/Pascal/s619824130.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s619824130", "user_id": "u566971318"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "program C;\n var N,x,i:longint;\n var a:array [1..120000] of longint;\n var u,v:longint;\n var ans:int64;\nbegin\n readln(N,x);ans:=0;\n for i:=1 to N do read(a[i]);\n for i:=2 to N do\n begin\n u:=a[i-1];v:=a[i];\n if u+v>x then\n begin\n if v>=u+v-x then a[i]:=x-u\n else\n begin\n a[i]:=0;\n a[i-1]:=x;\n end; \n ans:=ans+u+v-x;\n end; \n end;\n writeln(ans);\nend.", "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": "p03864", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 491, "cpu_time_ms": 23, "memory_kb": 512}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s846222648", "group_id": "codeNet:p03865", "input_text": "var s:string;n:Longint;\nbegin\nreadln(s);\nn:=length(s);\nif(n mod 2=1)xor(s[1]=s[n])then writeln('First')else writeln('Second');\nend.", "language": "Pascal", "metadata": {"date": 1572482166, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03865.html", "problem_id": "p03865", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03865/input.txt", "sample_output_relpath": "derived/input_output/data/p03865/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03865/Pascal/s846222648.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s846222648", "user_id": "u657913472"}, "prompt_components": {"gold_output": "Second\n", "input_to_evaluate": "var s:string;n:Longint;\nbegin\nreadln(s);\nn:=length(s);\nif(n mod 2=1)xor(s[1]=s[n])then writeln('First')else writeln('Second');\nend.", "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": "p03865", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s917667996", "group_id": "codeNet:p03865", "input_text": "program B;\n var Q:string;\n var ans:integer;\nbegin\n readln(Q);\n ans:=0;\n if Q[1]=Q[length(Q)] then ans:=ans+1;\n if length(Q) mod 2=0 then ans:=ans+1;\n if ans mod 2=0 then writeln('Second') else writeln('First');\nend.", "language": "Pascal", "metadata": {"date": 1480908239, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03865.html", "problem_id": "p03865", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03865/input.txt", "sample_output_relpath": "derived/input_output/data/p03865/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03865/Pascal/s917667996.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s917667996", "user_id": "u566971318"}, "prompt_components": {"gold_output": "Second\n", "input_to_evaluate": "program B;\n var Q:string;\n var ans:integer;\nbegin\n readln(Q);\n ans:=0;\n if Q[1]=Q[length(Q)] then ans:=ans+1;\n if length(Q) mod 2=0 then ans:=ans+1;\n if ans mod 2=0 then writeln('Second') else writeln('First');\nend.", "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": "p03865", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 2, "memory_kb": 384}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s374094001", "group_id": "codeNet:p03889", "input_text": "var\n s1,x:array[1..100000]of char;\n s:string;\n i,j:longint;\n ch:char;\nbegin\n readln(s); \n for i:=length(s) downto 1 do\n begin\n inc(j);\n ch:=s[i];\n x[j]:=ch;\n end;\n s1:=x;\n for i:=1 to length(s) do\n begin\n if s1[i]='b' then s1[i]:='d'\n else if s1[i]='d' then s1[i]:='b'\n else if s1[i]='p' then s1[i]:='q'\n else if s1[i]='q' then s1[i]:='p';\n end;\n for i:=1 to length(s) do\n if s[i]<>s1[i] then\n begin\n writeln('No');\n halt;\n end;\n writeln('Yes')\nend.\n\n", "language": "Pascal", "metadata": {"date": 1552172580, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03889.html", "problem_id": "p03889", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03889/input.txt", "sample_output_relpath": "derived/input_output/data/p03889/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03889/Pascal/s374094001.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s374094001", "user_id": "u723721005"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "var\n s1,x:array[1..100000]of char;\n s:string;\n i,j:longint;\n ch:char;\nbegin\n readln(s); \n for i:=length(s) downto 1 do\n begin\n inc(j);\n ch:=s[i];\n x[j]:=ch;\n end;\n s1:=x;\n for i:=1 to length(s) do\n begin\n if s1[i]='b' then s1[i]:='d'\n else if s1[i]='d' then s1[i]:='b'\n else if s1[i]='p' then s1[i]:='q'\n else if s1[i]='q' then s1[i]:='p';\n end;\n for i:=1 to length(s) do\n if s[i]<>s1[i] then\n begin\n writeln('No');\n halt;\n end;\n writeln('Yes')\nend.\n\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou are given a string S consisting of letters b, d, p and q.\nDetermine whether S is a mirror string.\n\nHere, a mirror string is a string S such that the following sequence of operations on S results in the same string S:\n\nReverse the order of the characters in S.\n\nReplace each occurrence of b by d, d by b, p by q, and q by p, simultaneously.\n\nConstraints\n\n1 \\leq |S| \\leq 10^5\n\nS consists of letters b, d, p, and q.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nS\n\nOutput\n\nIf S is a mirror string, print Yes. Otherwise, print No.\n\nSample Input 1\n\npdbq\n\nSample Output 1\n\nYes\n\nSample Input 2\n\nppqb\n\nSample Output 2\n\nNo", "sample_input": "pdbq\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p03889", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou are given a string S consisting of letters b, d, p and q.\nDetermine whether S is a mirror string.\n\nHere, a mirror string is a string S such that the following sequence of operations on S results in the same string S:\n\nReverse the order of the characters in S.\n\nReplace each occurrence of b by d, d by b, p by q, and q by p, simultaneously.\n\nConstraints\n\n1 \\leq |S| \\leq 10^5\n\nS consists of letters b, d, p, and q.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nS\n\nOutput\n\nIf S is a mirror string, print Yes. Otherwise, print No.\n\nSample Input 1\n\npdbq\n\nSample Output 1\n\nYes\n\nSample Input 2\n\nppqb\n\nSample Output 2\n\nNo", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 745, "cpu_time_ms": 2, "memory_kb": 384}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s269678621", "group_id": "codeNet:p03889", "input_text": "{AT2201}\nvar\ns1,s2:ansistring;\ni:longint;\nt:char;\nbegin\nreadln(s1);\ns2:=s1;\nfor i:=1 to length(s2) div 2 do\nbegin\nt:=s2[i];\ns2[i]:=s2[length(s2)-i+1];\ns2[length(s2)-i+1]:=t;\nend;\nfor i:=1 to length(s2) do\n if (s2[i]='b') and (s1[i]<>'d') or (s2[i]='d') and (s1[i]<>'b') or (s2[i]='p') and (s1[i]<>'q') or (s2[i]='q') and (s1[i]<>'p') then\n begin\n writeln('No');\n halt;\n end;\nwriteln('Yes');\nend.", "language": "Pascal", "metadata": {"date": 1544319017, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03889.html", "problem_id": "p03889", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03889/input.txt", "sample_output_relpath": "derived/input_output/data/p03889/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03889/Pascal/s269678621.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s269678621", "user_id": "u214724132"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "{AT2201}\nvar\ns1,s2:ansistring;\ni:longint;\nt:char;\nbegin\nreadln(s1);\ns2:=s1;\nfor i:=1 to length(s2) div 2 do\nbegin\nt:=s2[i];\ns2[i]:=s2[length(s2)-i+1];\ns2[length(s2)-i+1]:=t;\nend;\nfor i:=1 to length(s2) do\n if (s2[i]='b') and (s1[i]<>'d') or (s2[i]='d') and (s1[i]<>'b') or (s2[i]='p') and (s1[i]<>'q') or (s2[i]='q') and (s1[i]<>'p') then\n begin\n writeln('No');\n halt;\n end;\nwriteln('Yes');\nend.", "problem_context": "Score : 100 points\n\nProblem Statement\n\nYou are given a string S consisting of letters b, d, p and q.\nDetermine whether S is a mirror string.\n\nHere, a mirror string is a string S such that the following sequence of operations on S results in the same string S:\n\nReverse the order of the characters in S.\n\nReplace each occurrence of b by d, d by b, p by q, and q by p, simultaneously.\n\nConstraints\n\n1 \\leq |S| \\leq 10^5\n\nS consists of letters b, d, p, and q.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nS\n\nOutput\n\nIf S is a mirror string, print Yes. Otherwise, print No.\n\nSample Input 1\n\npdbq\n\nSample Output 1\n\nYes\n\nSample Input 2\n\nppqb\n\nSample Output 2\n\nNo", "sample_input": "pdbq\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p03889", "source_text": "Score : 100 points\n\nProblem Statement\n\nYou are given a string S consisting of letters b, d, p and q.\nDetermine whether S is a mirror string.\n\nHere, a mirror string is a string S such that the following sequence of operations on S results in the same string S:\n\nReverse the order of the characters in S.\n\nReplace each occurrence of b by d, d by b, p by q, and q by p, simultaneously.\n\nConstraints\n\n1 \\leq |S| \\leq 10^5\n\nS consists of letters b, d, p, and q.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nS\n\nOutput\n\nIf S is a mirror string, print Yes. Otherwise, print No.\n\nSample Input 1\n\npdbq\n\nSample Output 1\n\nYes\n\nSample Input 2\n\nppqb\n\nSample Output 2\n\nNo", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 384}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s814031409", "group_id": "codeNet:p03893", "input_text": "program hrn;\n var\n a:array[0..40]of qword;\n n,i:longint;\n begin\n read(n);a[0]:=2;\n for i:=1 to n do\n a[i]:=a[i-1]*2+2;\n writeln(a[n]);\n end.", "language": "Pascal", "metadata": {"date": 1524628862, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03893.html", "problem_id": "p03893", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03893/input.txt", "sample_output_relpath": "derived/input_output/data/p03893/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03893/Pascal/s814031409.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s814031409", "user_id": "u247366051"}, "prompt_components": {"gold_output": "14\n", "input_to_evaluate": "program hrn;\n var\n a:array[0..40]of qword;\n n,i:longint;\n begin\n read(n);a[0]:=2;\n for i:=1 to n do\n a[i]:=a[i-1]*2+2;\n writeln(a[n]);\n end.", "problem_context": "Score : 100 points\n\nProblem Statement\n\nWe have a cord whose length is a positive integer. We will perform the following condition until the length of the cord becomes at most 2:\n\nOperation:\nCut the rope at two positions to obtain three cords, each with a length of a positive integer.\nAmong these, discard one with the longest length and one with the shortest length, and keep the remaining one.\n\nLet f(N) be the maximum possible number of times to perform this operation, starting with a cord with the length N.\n\nYou are given a positive integer X. Find the maximum integer N such that f(N)=X.\n\nConstraints\n\n1 \\leq X \\leq 40\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nX\n\nOutput\n\nPrint the value of the maximum integer N such that f(N)=X.\n\nSample Input 1\n\n2\n\nSample Output 1\n\n14", "sample_input": "2\n"}, "reference_outputs": ["14\n"], "source_document_id": "p03893", "source_text": "Score : 100 points\n\nProblem Statement\n\nWe have a cord whose length is a positive integer. We will perform the following condition until the length of the cord becomes at most 2:\n\nOperation:\nCut the rope at two positions to obtain three cords, each with a length of a positive integer.\nAmong these, discard one with the longest length and one with the shortest length, and keep the remaining one.\n\nLet f(N) be the maximum possible number of times to perform this operation, starting with a cord with the length N.\n\nYou are given a positive integer X. Find the maximum integer N such that f(N)=X.\n\nConstraints\n\n1 \\leq X \\leq 40\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nX\n\nOutput\n\nPrint the value of the maximum integer N such that f(N)=X.\n\nSample Input 1\n\n2\n\nSample Output 1\n\n14", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 147, "cpu_time_ms": 2, "memory_kb": 128}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s464536022", "group_id": "codeNet:p03896", "input_text": "var\n\tN,i,j:Longint;\n\tA:Array[1..100,1..99]of Longint;\nbegin\n\tread(N);\n\tif N=2 then begin\n\t\twriteln(-1);\n\t\texit;\n\tend;\n\tif N mod 2=1 then begin\n\t\tfor i:=1 to N-1 do A[N,i]:=i;\n\t\ti:=1;\n\t\twhile i<=N-1 do begin\n\t\t\tfor j:=1 to i-1 do begin\n\t\t\t\tA[i,j]:=j;\n\t\t\t\tA[i+1,j]:=j;\n\t\t\tend;\n\t\t\tA[i,i]:=i+1;\n\t\t\tA[i+1,i+1]:=i;\n\t\t\tA[i,i+1]:=i+2;\n\t\t\tA[i+1,i]:=i+2;\n\t\t\tfor j:=i+2 to N-1 do begin\n\t\t\t\tA[i,j]:=j+1;\n\t\t\t\tA[i+1,j]:=j+1;\n\t\t\tend;\n\t\t\tinc(i,2);\n\t\tend;\n\tend else begin\n\t\ti:=1;\n\t\twhile i<=N-2 do begin\n\t\t\tfor j:=1 to i-1 do begin\n\t\t\t\tA[i,j]:=j;\n\t\t\t\tA[i+1,j]:=j;\n\t\t\tend;\n\t\t\tA[i,i]:=i+1;\n\t\t\tA[i+1,i+1]:=i;\n\t\t\tA[i,i+1]:=i+2;\n\t\t\tA[i+1,i]:=i+2;\n\t\t\tfor j:=i+2 to N-1 do begin\n\t\t\t\tA[i,j]:=j+1;\n\t\t\t\tA[i+1,j]:=j+1;\n\t\t\tend;\n\t\t\tinc(i,2);\n\t\tend;\n\t\tfor j:=1 to N-3 do begin\n\t\t\tA[N-1,j]:=j;\n\t\t\tA[N,j]:=j;\n\t\tend;\n\t\tA[N-1,N-2]:=N;\n\t\tA[N,N-1]:=N-1;\n\t\tA[N-1,N-1]:=N-2;\n\t\tA[N,N-2]:=N-2;\n\tend;\n\tfor i:=1 to N do begin\n\t\tfor j:=1 to N-1 do begin\n\t\t\twrite(A[i,j]);\n\t\t\twrite(' ');\n\t\tend;\n\t\twriteln;\n\tend;\nend.\n", "language": "Pascal", "metadata": {"date": 1565765795, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03896.html", "problem_id": "p03896", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03896/input.txt", "sample_output_relpath": "derived/input_output/data/p03896/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03896/Pascal/s464536022.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s464536022", "user_id": "u657913472"}, "prompt_components": {"gold_output": "2 3 4 5 6 7\n5 3 1 6 4 7\n2 7 4 1 5 6\n2 1 7 5 3 6\n1 4 3 7 6 2\n2 5 7 3 4 1\n2 6 1 4 5 3\n", "input_to_evaluate": "var\n\tN,i,j:Longint;\n\tA:Array[1..100,1..99]of Longint;\nbegin\n\tread(N);\n\tif N=2 then begin\n\t\twriteln(-1);\n\t\texit;\n\tend;\n\tif N mod 2=1 then begin\n\t\tfor i:=1 to N-1 do A[N,i]:=i;\n\t\ti:=1;\n\t\twhile i<=N-1 do begin\n\t\t\tfor j:=1 to i-1 do begin\n\t\t\t\tA[i,j]:=j;\n\t\t\t\tA[i+1,j]:=j;\n\t\t\tend;\n\t\t\tA[i,i]:=i+1;\n\t\t\tA[i+1,i+1]:=i;\n\t\t\tA[i,i+1]:=i+2;\n\t\t\tA[i+1,i]:=i+2;\n\t\t\tfor j:=i+2 to N-1 do begin\n\t\t\t\tA[i,j]:=j+1;\n\t\t\t\tA[i+1,j]:=j+1;\n\t\t\tend;\n\t\t\tinc(i,2);\n\t\tend;\n\tend else begin\n\t\ti:=1;\n\t\twhile i<=N-2 do begin\n\t\t\tfor j:=1 to i-1 do begin\n\t\t\t\tA[i,j]:=j;\n\t\t\t\tA[i+1,j]:=j;\n\t\t\tend;\n\t\t\tA[i,i]:=i+1;\n\t\t\tA[i+1,i+1]:=i;\n\t\t\tA[i,i+1]:=i+2;\n\t\t\tA[i+1,i]:=i+2;\n\t\t\tfor j:=i+2 to N-1 do begin\n\t\t\t\tA[i,j]:=j+1;\n\t\t\t\tA[i+1,j]:=j+1;\n\t\t\tend;\n\t\t\tinc(i,2);\n\t\tend;\n\t\tfor j:=1 to N-3 do begin\n\t\t\tA[N-1,j]:=j;\n\t\t\tA[N,j]:=j;\n\t\tend;\n\t\tA[N-1,N-2]:=N;\n\t\tA[N,N-1]:=N-1;\n\t\tA[N-1,N-1]:=N-2;\n\t\tA[N,N-2]:=N-2;\n\tend;\n\tfor i:=1 to N do begin\n\t\tfor j:=1 to N-1 do begin\n\t\t\twrite(A[i,j]);\n\t\t\twrite(' ');\n\t\tend;\n\t\twriteln;\n\tend;\nend.\n", "problem_context": "Score : 100 points\n\nProblem Statement\n\nThere are N persons, conveniently numbered 1 through N. They will take 3y3s Challenge for N-1 seconds.\n\nDuring the challenge, each person must look at each of the N-1 other persons for 1 seconds, in some order.\n\nIf any two persons look at each other during the challenge, the challenge ends in failure.\n\nFind the order in which each person looks at each of the N-1 other persons, to be successful in the challenge.\n\nConstraints\n\n2 \\leq N \\leq 100\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\n\nOutput\n\nIf there exists no way to be successful in the challenge, print -1.\n\nIf there exists a way to be successful in the challenge, print any such way in the following format:\n\nA_{1,1} A_{1,2} ... A_{1, N-1}\nA_{2,1} A_{2,2} ... A_{2, N-1}\n:\nA_{N,1} A_{N,2} ... A_{N, N-1}\n\nwhere A_{i, j} is the index of the person that the person numbered i looks at during the j-th second.\n\nJudging\n\nThe output is considered correct only if all of the following conditions are satisfied:\n\n1 \\leq A_{i,j} \\leq N\n\nFor each i, A_{i,1}, A_{i,2}, ... , A_{i, N-1} are pairwise distinct.\n\nLet X = A_{i, j}, then A_{X, j} \\neq i always holds.\n\nSample Input 1\n\n7\n\nSample Output 1\n\n2 3 4 5 6 7\n5 3 1 6 4 7\n2 7 4 1 5 6\n2 1 7 5 3 6\n1 4 3 7 6 2\n2 5 7 3 4 1\n2 6 1 4 5 3\n\nSample Input 2\n\n2\n\nSample Output 2\n\n-1", "sample_input": "7\n"}, "reference_outputs": ["2 3 4 5 6 7\n5 3 1 6 4 7\n2 7 4 1 5 6\n2 1 7 5 3 6\n1 4 3 7 6 2\n2 5 7 3 4 1\n2 6 1 4 5 3\n"], "source_document_id": "p03896", "source_text": "Score : 100 points\n\nProblem Statement\n\nThere are N persons, conveniently numbered 1 through N. They will take 3y3s Challenge for N-1 seconds.\n\nDuring the challenge, each person must look at each of the N-1 other persons for 1 seconds, in some order.\n\nIf any two persons look at each other during the challenge, the challenge ends in failure.\n\nFind the order in which each person looks at each of the N-1 other persons, to be successful in the challenge.\n\nConstraints\n\n2 \\leq N \\leq 100\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN\n\nOutput\n\nIf there exists no way to be successful in the challenge, print -1.\n\nIf there exists a way to be successful in the challenge, print any such way in the following format:\n\nA_{1,1} A_{1,2} ... A_{1, N-1}\nA_{2,1} A_{2,2} ... A_{2, N-1}\n:\nA_{N,1} A_{N,2} ... A_{N, N-1}\n\nwhere A_{i, j} is the index of the person that the person numbered i looks at during the j-th second.\n\nJudging\n\nThe output is considered correct only if all of the following conditions are satisfied:\n\n1 \\leq A_{i,j} \\leq N\n\nFor each i, A_{i,1}, A_{i,2}, ... , A_{i, N-1} are pairwise distinct.\n\nLet X = A_{i, j}, then A_{X, j} \\neq i always holds.\n\nSample Input 1\n\n7\n\nSample Output 1\n\n2 3 4 5 6 7\n5 3 1 6 4 7\n2 7 4 1 5 6\n2 1 7 5 3 6\n1 4 3 7 6 2\n2 5 7 3 4 1\n2 6 1 4 5 3\n\nSample Input 2\n\n2\n\nSample Output 2\n\n-1", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 972, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s150958652", "group_id": "codeNet:p03909", "input_text": "var\n i,j,h,w:longint;\n s:string[5];\n c:char;\nbegin\n read(h);\n readln(w);\n for i:=1 to h do\n begin\n for j:=1 to w do\n begin\n read(s);\n if s='snuke' then\n begin\n write(chr(64+j));\n writeln(i);\n end;\n if j < w then read(c) else readln(c);\n end;\n end;\nend.", "language": "Pascal", "metadata": {"date": 1515974592, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03909.html", "problem_id": "p03909", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03909/input.txt", "sample_output_relpath": "derived/input_output/data/p03909/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03909/Pascal/s150958652.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s150958652", "user_id": "u598016178"}, "prompt_components": {"gold_output": "H6\n", "input_to_evaluate": "var\n i,j,h,w:longint;\n s:string[5];\n c:char;\nbegin\n read(h);\n readln(w);\n for i:=1 to h do\n begin\n for j:=1 to w do\n begin\n read(s);\n if s='snuke' then\n begin\n write(chr(64+j));\n writeln(i);\n end;\n if j < w then read(c) else readln(c);\n end;\n end;\nend.", "problem_context": "Score : 100 points\n\nProblem Statement\n\nThere is a grid with H rows and W columns.\n\nThe square at the i-th row and j-th column contains a string S_{i,j} of length 5.\n\nThe rows are labeled with the numbers from 1 through H, and the columns are labeled with the uppercase English letters from A through the W-th letter of the alphabet.\n\nExactly one of the squares in the grid contains the string snuke. Find this square and report its location.\n\nFor example, the square at the 6-th row and 8-th column should be reported as H6.\n\nConstraints\n\n1≦H, W≦26\n\nThe length of S_{i,j} is 5.\n\nS_{i,j} consists of lowercase English letters (a-z).\n\nExactly one of the given strings is equal to snuke.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nH W\nS_{1,1} S_{1,2} ... S_{1,W}\nS_{2,1} S_{2,2} ... S_{2,W}\n:\nS_{H,1} S_{H,2} ... S_{H,W}\n\nOutput\n\nPrint the labels of the row and the column of the square containing the string snuke, with no space inbetween.\n\nSample Input 1\n\n15 10\nsnake snake snake snake snake snake snake snake snake snake\nsnake snake snake snake snake snake snake snake snake snake\nsnake snake snake snake snake snake snake snake snake snake\nsnake snake snake snake snake snake snake snake snake snake\nsnake snake snake snake snake snake snake snake snake snake\nsnake snake snake snake snake snake snake snuke snake snake\nsnake snake snake snake snake snake snake snake snake snake\nsnake snake snake snake snake snake snake snake snake snake\nsnake snake snake snake snake snake snake snake snake snake\nsnake snake snake snake snake snake snake snake snake snake\nsnake snake snake snake snake snake snake snake snake snake\nsnake snake snake snake snake snake snake snake snake snake\nsnake snake snake snake snake snake snake snake snake snake\nsnake snake snake snake snake snake snake snake snake snake\nsnake snake snake snake snake snake snake snake snake snake\n\nSample Output 1\n\nH6\n\nSample Input 2\n\n1 1\nsnuke\n\nSample Output 2\n\nA1", "sample_input": "15 10\nsnake snake snake snake snake snake snake snake snake snake\nsnake snake snake snake snake snake snake snake snake snake\nsnake snake snake snake snake snake snake snake snake snake\nsnake snake snake snake snake snake snake snake snake snake\nsnake snake snake snake snake snake snake snake snake snake\nsnake snake snake snake snake snake snake snuke snake snake\nsnake snake snake snake snake snake snake snake snake snake\nsnake snake snake snake snake snake snake snake snake snake\nsnake snake snake snake snake snake snake snake snake snake\nsnake snake snake snake snake snake snake snake snake snake\nsnake snake snake snake snake snake snake snake snake snake\nsnake snake snake snake snake snake snake snake snake snake\nsnake snake snake snake snake snake snake snake snake snake\nsnake snake snake snake snake snake snake snake snake snake\nsnake snake snake snake snake snake snake snake snake snake\n"}, "reference_outputs": ["H6\n"], "source_document_id": "p03909", "source_text": "Score : 100 points\n\nProblem Statement\n\nThere is a grid with H rows and W columns.\n\nThe square at the i-th row and j-th column contains a string S_{i,j} of length 5.\n\nThe rows are labeled with the numbers from 1 through H, and the columns are labeled with the uppercase English letters from A through the W-th letter of the alphabet.\n\nExactly one of the squares in the grid contains the string snuke. Find this square and report its location.\n\nFor example, the square at the 6-th row and 8-th column should be reported as H6.\n\nConstraints\n\n1≦H, W≦26\n\nThe length of S_{i,j} is 5.\n\nS_{i,j} consists of lowercase English letters (a-z).\n\nExactly one of the given strings is equal to snuke.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nH W\nS_{1,1} S_{1,2} ... S_{1,W}\nS_{2,1} S_{2,2} ... S_{2,W}\n:\nS_{H,1} S_{H,2} ... S_{H,W}\n\nOutput\n\nPrint the labels of the row and the column of the square containing the string snuke, with no space inbetween.\n\nSample Input 1\n\n15 10\nsnake snake snake snake snake snake snake snake snake snake\nsnake snake snake snake snake snake snake snake snake snake\nsnake snake snake snake snake snake snake snake snake snake\nsnake snake snake snake snake snake snake snake snake snake\nsnake snake snake snake snake snake snake snake snake snake\nsnake snake snake snake snake snake snake snuke snake snake\nsnake snake snake snake snake snake snake snake snake snake\nsnake snake snake snake snake snake snake snake snake snake\nsnake snake snake snake snake snake snake snake snake snake\nsnake snake snake snake snake snake snake snake snake snake\nsnake snake snake snake snake snake snake snake snake snake\nsnake snake snake snake snake snake snake snake snake snake\nsnake snake snake snake snake snake snake snake snake snake\nsnake snake snake snake snake snake snake snake snake snake\nsnake snake snake snake snake snake snake snake snake snake\n\nSample Output 1\n\nH6\n\nSample Input 2\n\n1 1\nsnuke\n\nSample Output 2\n\nA1", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s396805394", "group_id": "codeNet:p03910", "input_text": "var\nn,i,t:longint;\nbegin\nreadln(n);\ni:=0;\nwhile n>0 do\n begin\n inc(i);\n if odd(n) then t:=n+1\n else t:=n;\n if (i0 do\n begin\n inc(i);\n if odd(n) then t:=n+1\n else t:=n;\n if (i-n then writeln(i);\nend.", "language": "Pascal", "metadata": {"date": 1579345753, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03920.html", "problem_id": "p03920", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03920/input.txt", "sample_output_relpath": "derived/input_output/data/p03920/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03920/Pascal/s807024667.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s807024667", "user_id": "u657913472"}, "prompt_components": {"gold_output": "1\n3\n", "input_to_evaluate": "var i,k,n:longint;\nbegin\nread(n);\nk:=round(sqrt(2*n));\nwhile k*(k+1)-n then writeln(i);\nend.", "problem_context": "Score : 300 points\n\nProblem Statement\n\nThe problem set at CODE FESTIVAL 20XX Finals consists of N problems.\n\nThe score allocated to the i-th (1≦i≦N) problem is i points.\n\nTakahashi, a contestant, is trying to score exactly N points. For that, he is deciding which problems to solve.\n\nAs problems with higher scores are harder, he wants to minimize the highest score of a problem among the ones solved by him.\n\nDetermine the set of problems that should be solved.\n\nConstraints\n\n1≦N≦10^7\n\nPartial Score\n\n200 points will be awarded for passing the test set satisfying 1≦N≦1000.\n\nAdditional 100 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\n\nOutput\n\nAmong the sets of problems with the total score of N, find a set in which the highest score of a problem is minimum, then print the indices of the problems in the set in any order, one per line.\n\nIf there exists more than one such set, any of them will be accepted.\n\nSample Input 1\n\n4\n\nSample Output 1\n\n1\n3\n\nSolving only the 4-th problem will also result in the total score of 4 points, but solving the 1-st and 3-rd problems will lower the highest score of a solved problem.\n\nSample Input 2\n\n7\n\nSample Output 2\n\n1\n2\n4\n\nThe set \\{3,4\\} will also be accepted.\n\nSample Input 3\n\n1\n\nSample Output 3\n\n1", "sample_input": "4\n"}, "reference_outputs": ["1\n3\n"], "source_document_id": "p03920", "source_text": "Score : 300 points\n\nProblem Statement\n\nThe problem set at CODE FESTIVAL 20XX Finals consists of N problems.\n\nThe score allocated to the i-th (1≦i≦N) problem is i points.\n\nTakahashi, a contestant, is trying to score exactly N points. For that, he is deciding which problems to solve.\n\nAs problems with higher scores are harder, he wants to minimize the highest score of a problem among the ones solved by him.\n\nDetermine the set of problems that should be solved.\n\nConstraints\n\n1≦N≦10^7\n\nPartial Score\n\n200 points will be awarded for passing the test set satisfying 1≦N≦1000.\n\nAdditional 100 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\n\nOutput\n\nAmong the sets of problems with the total score of N, find a set in which the highest score of a problem is minimum, then print the indices of the problems in the set in any order, one per line.\n\nIf there exists more than one such set, any of them will be accepted.\n\nSample Input 1\n\n4\n\nSample Output 1\n\n1\n3\n\nSolving only the 4-th problem will also result in the total score of 4 points, but solving the 1-st and 3-rd problems will lower the highest score of a solved problem.\n\nSample Input 2\n\n7\n\nSample Output 2\n\n1\n2\n4\n\nThe set \\{3,4\\} will also be accepted.\n\nSample Input 3\n\n1\n\nSample Output 3\n\n1", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 1, "memory_kb": 128}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s153996097", "group_id": "codeNet:p03923", "input_text": "uses math;\nvar\n\tN,A,ans,p,now,tmp:int64;\n\tj,k:Longint;\nbegin\n\tread(N,A);\n\tans:=N;\n\tfor k:=1 to 39 do begin\n\t\tp:=floor(power(N,1/(k+1)));\n\t\tnow:=1;\n\t\tfor j:=1 to k do now:=now*p;\n\t\tfor j:=0 to k do begin\n\t\t\ttmp:=A*k+p*k+j+(N+now-1)div now;\n\t\t\tif ans>tmp then ans:=tmp;\n\t\t\tnow:=now div p*(p+1);\n\t\t\tif now>N then break;\n\t\tend;\n\tend;\n\twriteln(ans);\nend.", "language": "Pascal", "metadata": {"date": 1558418215, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03923.html", "problem_id": "p03923", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03923/input.txt", "sample_output_relpath": "derived/input_output/data/p03923/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03923/Pascal/s153996097.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s153996097", "user_id": "u657913472"}, "prompt_components": {"gold_output": "7\n", "input_to_evaluate": "uses math;\nvar\n\tN,A,ans,p,now,tmp:int64;\n\tj,k:Longint;\nbegin\n\tread(N,A);\n\tans:=N;\n\tfor k:=1 to 39 do begin\n\t\tp:=floor(power(N,1/(k+1)));\n\t\tnow:=1;\n\t\tfor j:=1 to k do now:=now*p;\n\t\tfor j:=0 to k do begin\n\t\t\ttmp:=A*k+p*k+j+(N+now-1)div now;\n\t\t\tif ans>tmp then ans:=tmp;\n\t\t\tnow:=now div p*(p+1);\n\t\t\tif now>N then break;\n\t\tend;\n\tend;\n\twriteln(ans);\nend.", "problem_context": "Score : 1000 points\n\nProblem Statement\n\nRng is baking cookies.\n\nInitially, he can bake one cookie per second.\n\nHe can also eat the cookies baked by himself.\nWhen there are x cookies not yet eaten, he can choose to eat all those cookies. After he finishes eating those cookies, the number of cookies he can bake per second becomes x. Note that a cookie always needs to be baked for 1 second, that is, he cannot bake a cookie in 1/x seconds when x > 1.\nWhen he choose to eat the cookies, he must eat all of them; he cannot choose to eat only part of them.\nIt takes him A seconds to eat the cookies regardless of how many, during which no cookies can be baked.\n\nHe wants to give N cookies to Grandma.\nFind the shortest time needed to produce at least N cookies not yet eaten.\n\nConstraints\n\n1≦N≦10^{12}\n\n0≦A≦10^{12}\n\nA is an integer.\n\nPartial Score\n\n500 points will be awarded for passing the test set satisfying N≦10^6 and A≦10^6.\n\nAdditional 500 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 A\n\nOutput\n\nPrint the shortest time needed to produce at least N cookies not yet eaten.\n\nSample Input 1\n\n8 1\n\nSample Output 1\n\n7\n\nIt is possible to produce 8 cookies in 7 seconds, as follows:\n\nAfter 1 second: 1 cookie is done.\n\nAfter 2 seconds: 1 more cookie is done, totaling 2. Now, Rng starts eating those 2 cookies.\n\nAfter 3 seconds: He finishes eating the cookies, and he can now bake 2 cookies per second.\n\nAfter 4 seconds: 2 cookies are done.\n\nAfter 5 seconds: 2 more cookies are done, totaling 4.\n\nAfter 6 seconds: 2 more cookies are done, totaling 6.\n\nAfter 7 seconds: 2 more cookies are done, totaling 8.\n\nSample Input 2\n\n1000000000000 1000000000000\n\nSample Output 2\n\n1000000000000", "sample_input": "8 1\n"}, "reference_outputs": ["7\n"], "source_document_id": "p03923", "source_text": "Score : 1000 points\n\nProblem Statement\n\nRng is baking cookies.\n\nInitially, he can bake one cookie per second.\n\nHe can also eat the cookies baked by himself.\nWhen there are x cookies not yet eaten, he can choose to eat all those cookies. After he finishes eating those cookies, the number of cookies he can bake per second becomes x. Note that a cookie always needs to be baked for 1 second, that is, he cannot bake a cookie in 1/x seconds when x > 1.\nWhen he choose to eat the cookies, he must eat all of them; he cannot choose to eat only part of them.\nIt takes him A seconds to eat the cookies regardless of how many, during which no cookies can be baked.\n\nHe wants to give N cookies to Grandma.\nFind the shortest time needed to produce at least N cookies not yet eaten.\n\nConstraints\n\n1≦N≦10^{12}\n\n0≦A≦10^{12}\n\nA is an integer.\n\nPartial Score\n\n500 points will be awarded for passing the test set satisfying N≦10^6 and A≦10^6.\n\nAdditional 500 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 A\n\nOutput\n\nPrint the shortest time needed to produce at least N cookies not yet eaten.\n\nSample Input 1\n\n8 1\n\nSample Output 1\n\n7\n\nIt is possible to produce 8 cookies in 7 seconds, as follows:\n\nAfter 1 second: 1 cookie is done.\n\nAfter 2 seconds: 1 more cookie is done, totaling 2. Now, Rng starts eating those 2 cookies.\n\nAfter 3 seconds: He finishes eating the cookies, and he can now bake 2 cookies per second.\n\nAfter 4 seconds: 2 cookies are done.\n\nAfter 5 seconds: 2 more cookies are done, totaling 4.\n\nAfter 6 seconds: 2 more cookies are done, totaling 6.\n\nAfter 7 seconds: 2 more cookies are done, totaling 8.\n\nSample Input 2\n\n1000000000000 1000000000000\n\nSample Output 2\n\n1000000000000", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 349, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s849154448", "group_id": "codeNet:p03923", "input_text": "uses math;\nvar\n\tN,A,ans,p,now,tmp:int64;\n\tj,k:Longint;\nbegin\n\tread(N,A);\n\tans:=N;\n\tfor k:=1 to 39 do begin\n\t\tp:=floor(power(N/1,1/(k+1)));\n\t\tnow:=1;\n\t\tfor j:=1 to k do now:=now*p;\n\t\tfor j:=0 to k do begin\n\t\t\ttmp:=A*k+p*k+j+(N+now-1)div now;\n\t\t\tif ans>tmp then ans:=tmp;\n\t\t\tnow:=now div p*(p+1);\n\t\tend;\n\tend;\n\twriteln(ans);\nend.", "language": "Pascal", "metadata": {"date": 1558418060, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03923.html", "problem_id": "p03923", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03923/input.txt", "sample_output_relpath": "derived/input_output/data/p03923/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03923/Pascal/s849154448.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s849154448", "user_id": "u657913472"}, "prompt_components": {"gold_output": "7\n", "input_to_evaluate": "uses math;\nvar\n\tN,A,ans,p,now,tmp:int64;\n\tj,k:Longint;\nbegin\n\tread(N,A);\n\tans:=N;\n\tfor k:=1 to 39 do begin\n\t\tp:=floor(power(N/1,1/(k+1)));\n\t\tnow:=1;\n\t\tfor j:=1 to k do now:=now*p;\n\t\tfor j:=0 to k do begin\n\t\t\ttmp:=A*k+p*k+j+(N+now-1)div now;\n\t\t\tif ans>tmp then ans:=tmp;\n\t\t\tnow:=now div p*(p+1);\n\t\tend;\n\tend;\n\twriteln(ans);\nend.", "problem_context": "Score : 1000 points\n\nProblem Statement\n\nRng is baking cookies.\n\nInitially, he can bake one cookie per second.\n\nHe can also eat the cookies baked by himself.\nWhen there are x cookies not yet eaten, he can choose to eat all those cookies. After he finishes eating those cookies, the number of cookies he can bake per second becomes x. Note that a cookie always needs to be baked for 1 second, that is, he cannot bake a cookie in 1/x seconds when x > 1.\nWhen he choose to eat the cookies, he must eat all of them; he cannot choose to eat only part of them.\nIt takes him A seconds to eat the cookies regardless of how many, during which no cookies can be baked.\n\nHe wants to give N cookies to Grandma.\nFind the shortest time needed to produce at least N cookies not yet eaten.\n\nConstraints\n\n1≦N≦10^{12}\n\n0≦A≦10^{12}\n\nA is an integer.\n\nPartial Score\n\n500 points will be awarded for passing the test set satisfying N≦10^6 and A≦10^6.\n\nAdditional 500 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 A\n\nOutput\n\nPrint the shortest time needed to produce at least N cookies not yet eaten.\n\nSample Input 1\n\n8 1\n\nSample Output 1\n\n7\n\nIt is possible to produce 8 cookies in 7 seconds, as follows:\n\nAfter 1 second: 1 cookie is done.\n\nAfter 2 seconds: 1 more cookie is done, totaling 2. Now, Rng starts eating those 2 cookies.\n\nAfter 3 seconds: He finishes eating the cookies, and he can now bake 2 cookies per second.\n\nAfter 4 seconds: 2 cookies are done.\n\nAfter 5 seconds: 2 more cookies are done, totaling 4.\n\nAfter 6 seconds: 2 more cookies are done, totaling 6.\n\nAfter 7 seconds: 2 more cookies are done, totaling 8.\n\nSample Input 2\n\n1000000000000 1000000000000\n\nSample Output 2\n\n1000000000000", "sample_input": "8 1\n"}, "reference_outputs": ["7\n"], "source_document_id": "p03923", "source_text": "Score : 1000 points\n\nProblem Statement\n\nRng is baking cookies.\n\nInitially, he can bake one cookie per second.\n\nHe can also eat the cookies baked by himself.\nWhen there are x cookies not yet eaten, he can choose to eat all those cookies. After he finishes eating those cookies, the number of cookies he can bake per second becomes x. Note that a cookie always needs to be baked for 1 second, that is, he cannot bake a cookie in 1/x seconds when x > 1.\nWhen he choose to eat the cookies, he must eat all of them; he cannot choose to eat only part of them.\nIt takes him A seconds to eat the cookies regardless of how many, during which no cookies can be baked.\n\nHe wants to give N cookies to Grandma.\nFind the shortest time needed to produce at least N cookies not yet eaten.\n\nConstraints\n\n1≦N≦10^{12}\n\n0≦A≦10^{12}\n\nA is an integer.\n\nPartial Score\n\n500 points will be awarded for passing the test set satisfying N≦10^6 and A≦10^6.\n\nAdditional 500 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 A\n\nOutput\n\nPrint the shortest time needed to produce at least N cookies not yet eaten.\n\nSample Input 1\n\n8 1\n\nSample Output 1\n\n7\n\nIt is possible to produce 8 cookies in 7 seconds, as follows:\n\nAfter 1 second: 1 cookie is done.\n\nAfter 2 seconds: 1 more cookie is done, totaling 2. Now, Rng starts eating those 2 cookies.\n\nAfter 3 seconds: He finishes eating the cookies, and he can now bake 2 cookies per second.\n\nAfter 4 seconds: 2 cookies are done.\n\nAfter 5 seconds: 2 more cookies are done, totaling 4.\n\nAfter 6 seconds: 2 more cookies are done, totaling 6.\n\nAfter 7 seconds: 2 more cookies are done, totaling 8.\n\nSample Input 2\n\n1000000000000 1000000000000\n\nSample Output 2\n\n1000000000000", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 2, "memory_kb": 128}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s737934076", "group_id": "codeNet:p03929", "input_text": "program calendar;\nconst\n fi='';\n fo='';\nvar\n n:longint;\n k:byte;\n ans:int64;\nprocedure Install;\nbegin\n assign(input,fi);\n assign(output,fo);\n reset(input);\n rewrite(output);\nend;\n\nprocedure Close_All;\nbegin\n close(input);\n close(output);\nend;\n\nprocedure Enter;\nbegin\n readln(n,k);\nend;\n\n\nfunction Check(x:int64):boolean;\nbegin\n if (9*x mod 11 +6) mod 11 =k then exit(true)\n else exit(false);\nend;\n\nprocedure Process;\nvar\n x:int64;\nbegin\n x:=1;\n while x<=(7*(n-2)+5-7) do\n begin\n if (1<=x mod 7) and (x mod 7<=5)\n and Check(x) then inc(ans);\n inc(x);\n end;\n writeln(ans);\nend;\n\nBEGIN\n Install;\n Enter;\n Process;\n Close_All;\nEND.\n", "language": "Pascal", "metadata": {"date": 1479692571, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03929.html", "problem_id": "p03929", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03929/input.txt", "sample_output_relpath": "derived/input_output/data/p03929/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03929/Pascal/s737934076.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s737934076", "user_id": "u434145291"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "program calendar;\nconst\n fi='';\n fo='';\nvar\n n:longint;\n k:byte;\n ans:int64;\nprocedure Install;\nbegin\n assign(input,fi);\n assign(output,fo);\n reset(input);\n rewrite(output);\nend;\n\nprocedure Close_All;\nbegin\n close(input);\n close(output);\nend;\n\nprocedure Enter;\nbegin\n readln(n,k);\nend;\n\n\nfunction Check(x:int64):boolean;\nbegin\n if (9*x mod 11 +6) mod 11 =k then exit(true)\n else exit(false);\nend;\n\nprocedure Process;\nvar\n x:int64;\nbegin\n x:=1;\n while x<=(7*(n-2)+5-7) do\n begin\n if (1<=x mod 7) and (x mod 7<=5)\n and Check(x) then inc(ans);\n inc(x);\n end;\n writeln(ans);\nend;\n\nBEGIN\n Install;\n Enter;\n Process;\n Close_All;\nEND.\n", "problem_context": "Max Score: $250$ Points\n\nProblem Statement\n\nSnuke has a very long calendar. It has a grid with $n$ rows and $7$ columns. One day, he noticed that calendar has a following regularity.\n\nThe cell at the $i$-th row and $j$-th column contains the integer $7i+j-7$.\n\nA good sub-grid is a $3 \\times 3$ sub-grid and the sum of integers in this sub-grid mod $11$ is $k$.\n\nHow many good sub-grid are there? Write a program and help him.\n\nInput\n\nThe input is given from standard input in the following format.\n\n$n \\quad k$\n\nOutput\n\nPrint the number of good sub-grid. If there are no solution exists, print 0.\n\nConstraints\n\n$1 \\le n \\le 10^9$\n\n$0 \\le k \\le 10$\n\nSubtasks\n\nSubtask 1 [ $150$ points ]\n\nThe testcase in the subtask satisfies $1 \\le n \\le 100$.\n\nSubtask 2 [ $100$ points ]\n\nThere are no additional constraints.\n\nSample Input 1\n\n7 7\n\nSample Output 1\n\n2\n\nIn this case, the calendar likes this matrix.\n\nSun.\n\nMon.\n\nTue.\n\nWed.\n\nThu.\n\nFri.\n\nSat.\n\nWeek 1\n\n1\n\n2\n\n3\n\n4\n\n5\n\n6\n\n7\n\nWeek 2\n\n8\n\n9\n\n10\n\n11\n\n12\n\n13\n\n14\n\nWeek 3\n\n15\n\n16\n\n17\n\n18\n\n19\n\n20\n\n21\n\nWeek 4\n\n22\n\n23\n\n24\n\n25\n\n26\n\n27\n\n28\n\nWeek 5\n\n29\n\n30\n\n31\n\n32\n\n33\n\n34\n\n35\n\nWeek 6\n\n36\n\n37\n\n38\n\n39\n\n40\n\n41\n\n42\n\nWeek 7\n\n43\n\n44\n\n45\n\n46\n\n47\n\n48\n\n49\n\nThe cell at $i$-th row and $j$-th column is denoted $(i, j)$.\n\nIf upper-left is $(1, 5)$, the sum of integers is $5+6+7+12+13+14+19+20+21=117$.\n\nIf upper-left is $(3, 2)$, the sum of integers is $16+17+18+23+24+25+30+31+32=216$.\n\nTherefore, there are 2 good sub-grids.\n\nSample Input 2\n\n6 0\n\nSample Output 2\n\n2\n\nIf upper-left is $(1, 3)$ or $(4, 4)$, it is a good sub-grid.\n\nSample Input 3\n\n18 10", "sample_input": "7 7\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03929", "source_text": "Max Score: $250$ Points\n\nProblem Statement\n\nSnuke has a very long calendar. It has a grid with $n$ rows and $7$ columns. One day, he noticed that calendar has a following regularity.\n\nThe cell at the $i$-th row and $j$-th column contains the integer $7i+j-7$.\n\nA good sub-grid is a $3 \\times 3$ sub-grid and the sum of integers in this sub-grid mod $11$ is $k$.\n\nHow many good sub-grid are there? Write a program and help him.\n\nInput\n\nThe input is given from standard input in the following format.\n\n$n \\quad k$\n\nOutput\n\nPrint the number of good sub-grid. If there are no solution exists, print 0.\n\nConstraints\n\n$1 \\le n \\le 10^9$\n\n$0 \\le k \\le 10$\n\nSubtasks\n\nSubtask 1 [ $150$ points ]\n\nThe testcase in the subtask satisfies $1 \\le n \\le 100$.\n\nSubtask 2 [ $100$ points ]\n\nThere are no additional constraints.\n\nSample Input 1\n\n7 7\n\nSample Output 1\n\n2\n\nIn this case, the calendar likes this matrix.\n\nSun.\n\nMon.\n\nTue.\n\nWed.\n\nThu.\n\nFri.\n\nSat.\n\nWeek 1\n\n1\n\n2\n\n3\n\n4\n\n5\n\n6\n\n7\n\nWeek 2\n\n8\n\n9\n\n10\n\n11\n\n12\n\n13\n\n14\n\nWeek 3\n\n15\n\n16\n\n17\n\n18\n\n19\n\n20\n\n21\n\nWeek 4\n\n22\n\n23\n\n24\n\n25\n\n26\n\n27\n\n28\n\nWeek 5\n\n29\n\n30\n\n31\n\n32\n\n33\n\n34\n\n35\n\nWeek 6\n\n36\n\n37\n\n38\n\n39\n\n40\n\n41\n\n42\n\nWeek 7\n\n43\n\n44\n\n45\n\n46\n\n47\n\n48\n\n49\n\nThe cell at $i$-th row and $j$-th column is denoted $(i, j)$.\n\nIf upper-left is $(1, 5)$, the sum of integers is $5+6+7+12+13+14+19+20+21=117$.\n\nIf upper-left is $(3, 2)$, the sum of integers is $16+17+18+23+24+25+30+31+32=216$.\n\nTherefore, there are 2 good sub-grids.\n\nSample Input 2\n\n6 0\n\nSample Output 2\n\n2\n\nIf upper-left is $(1, 3)$ or $(4, 4)$, it is a good sub-grid.\n\nSample Input 3\n\n18 10", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 841, "cpu_time_ms": 1054, "memory_kb": 128}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s803329111", "group_id": "codeNet:p03938", "input_text": "var a,b:array[0..20000]of longint;\n n,x,i:longint;\nbegin\n readln(n);\n for i:=1 to n do\n a[i]:=20009*i;\n for i:=1 to n do\n b[i]:=20009*(n-i+1);\n for i:=1 to n do\n begin\n read(x);\n dec(a[x],n-i+1);\n end;\n for i:=1 to n do\n write(a[i],' ');\n writeln;\n for i:=1 to n do\n write(b[i],' ');\n writeln;\nend.", "language": "Pascal", "metadata": {"date": 1586560135, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03938.html", "problem_id": "p03938", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03938/input.txt", "sample_output_relpath": "derived/input_output/data/p03938/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03938/Pascal/s803329111.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s803329111", "user_id": "u743614777"}, "prompt_components": {"gold_output": "1 4\n5 4\n", "input_to_evaluate": "var a,b:array[0..20000]of longint;\n n,x,i:longint;\nbegin\n readln(n);\n for i:=1 to n do\n a[i]:=20009*i;\n for i:=1 to n do\n b[i]:=20009*(n-i+1);\n for i:=1 to n do\n begin\n read(x);\n dec(a[x],n-i+1);\n end;\n for i:=1 to n do\n write(a[i],' ');\n writeln;\n for i:=1 to n do\n write(b[i],' ');\n writeln;\nend.", "problem_context": "Score : 400 points\n\nProblem Statement\n\n#nck {\nwidth: 30px;\nheight: auto;\n}\n\nYou are given a permutation p of the set {1, 2, ..., N}. Please construct two sequences of positive integers a_1, a_2, ..., a_N and b_1, b_2, ..., b_N satisfying the following conditions:\n\n1 \\leq a_i, b_i \\leq 10^9 for all i\n\na_1 < a_2 < ... < a_N\n\nb_1 > b_2 > ... > b_N\n\na_{p_1}+b_{p_1} < a_{p_2}+b_{p_2} < ... < a_{p_N}+b_{p_N}\n\nConstraints\n\n2 \\leq N \\leq 20,000\n\np is a permutation of the set {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\nThe output consists of two lines. The first line contains a_1, a_2, ..., a_N seperated by a space. The second line contains b_1, b_2, ..., b_N seperated by a space.\n\nIt can be shown that there always exists a solution for any input satisfying the constraints.\n\nSample Input 1\n\n2\n1 2\n\nSample Output 1\n\n1 4\n5 4\n\na_1 + b_1 = 6 and a_2 + b_2 = 8. So this output satisfies all conditions.\n\nSample Input 2\n\n3\n3 2 1\n\nSample Output 2\n\n1 2 3\n5 3 1\n\nSample Input 3\n\n3\n2 3 1\n\nSample Output 3\n\n5 10 100\n100 10 1", "sample_input": "2\n1 2\n"}, "reference_outputs": ["1 4\n5 4\n"], "source_document_id": "p03938", "source_text": "Score : 400 points\n\nProblem Statement\n\n#nck {\nwidth: 30px;\nheight: auto;\n}\n\nYou are given a permutation p of the set {1, 2, ..., N}. Please construct two sequences of positive integers a_1, a_2, ..., a_N and b_1, b_2, ..., b_N satisfying the following conditions:\n\n1 \\leq a_i, b_i \\leq 10^9 for all i\n\na_1 < a_2 < ... < a_N\n\nb_1 > b_2 > ... > b_N\n\na_{p_1}+b_{p_1} < a_{p_2}+b_{p_2} < ... < a_{p_N}+b_{p_N}\n\nConstraints\n\n2 \\leq N \\leq 20,000\n\np is a permutation of the set {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\nThe output consists of two lines. The first line contains a_1, a_2, ..., a_N seperated by a space. The second line contains b_1, b_2, ..., b_N seperated by a space.\n\nIt can be shown that there always exists a solution for any input satisfying the constraints.\n\nSample Input 1\n\n2\n1 2\n\nSample Output 1\n\n1 4\n5 4\n\na_1 + b_1 = 6 and a_2 + b_2 = 8. So this output satisfies all conditions.\n\nSample Input 2\n\n3\n3 2 1\n\nSample Output 2\n\n1 2 3\n5 3 1\n\nSample Input 3\n\n3\n2 3 1\n\nSample Output 3\n\n5 10 100\n100 10 1", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 329, "cpu_time_ms": 11, "memory_kb": 640}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s559010272", "group_id": "codeNet:p03943", "input_text": "program Project1;\n\n{$APPTYPE CONSOLE}\n\nuses\n SysUtils;\nvar\n a,b,c:Integer;\nbegin\n try\n { TODO -oUser -cConsole Main : わからん。 }\n Read(a);\n Read(b);\n Readln(c);\n\n if (a+b=c) or (a+c=b) or (b+c=a) then\n Writeln('Yes')\n else\n Writeln('No');\n Readln;\n except\n on E: Exception do\n Writeln(E.ClassName, ': ', E.Message);\n end;\nend.\n", "language": "Pascal", "metadata": {"date": 1513981817, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03943.html", "problem_id": "p03943", "resource_group": "low_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/Pascal/s559010272.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s559010272", "user_id": "u755925739"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "program Project1;\n\n{$APPTYPE CONSOLE}\n\nuses\n SysUtils;\nvar\n a,b,c:Integer;\nbegin\n try\n { TODO -oUser -cConsole Main : わからん。 }\n Read(a);\n Read(b);\n Readln(c);\n\n if (a+b=c) or (a+c=b) or (b+c=a) then\n Writeln('Yes')\n else\n Writeln('No');\n Readln;\n except\n on E: Exception do\n Writeln(E.ClassName, ': ', E.Message);\n end;\nend.\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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 378, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s992375537", "group_id": "codeNet:p03947", "input_text": "var s,t:ansistring;\n i,j,cnt,k,l:longint;\n b:boolean;\nbegin\n readln(s);\n cnt:=0;\n b:=false;\n k:=1;\n l:=1;\n while (i<=length(s)) do begin\n if (s[i]=s[i+1]) then delete(s,i+1,1)\n else inc(i);\n end;\n while (b=false) do begin\n b:=true;\n for i:=k to length(s) do begin\n if (s[1]<>s[i]) then begin\n b:=false;\n break;\n end;\n end;\n if (b=false) then begin\n if s[i]='W' then begin\n insert('W',s,1);\n for j:=2 to i do begin\n if s[j]='B' then s[j]:='W';\n end;\n end\n else begin\n insert('B',s,1);\n for j:=2 to i do begin\n if s[j]='W' then s[j]:='B';\n end;\n end;\n k:=i;\n inc(cnt);\n end\n else break;\n end;\n writeln(cnt);\nend.", "language": "Pascal", "metadata": {"date": 1596674551, "filename_ext": "pas", "original_language": "Pascal (FPC 3.0.4)", "problem_description_relpath": "problem_descriptions/p03947.html", "problem_id": "p03947", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03947/input.txt", "sample_output_relpath": "derived/input_output/data/p03947/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03947/Pascal/s992375537.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s992375537", "user_id": "u018679195"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "var s,t:ansistring;\n i,j,cnt,k,l:longint;\n b:boolean;\nbegin\n readln(s);\n cnt:=0;\n b:=false;\n k:=1;\n l:=1;\n while (i<=length(s)) do begin\n if (s[i]=s[i+1]) then delete(s,i+1,1)\n else inc(i);\n end;\n while (b=false) do begin\n b:=true;\n for i:=k to length(s) do begin\n if (s[1]<>s[i]) then begin\n b:=false;\n break;\n end;\n end;\n if (b=false) then begin\n if s[i]='W' then begin\n insert('W',s,1);\n for j:=2 to i do begin\n if s[j]='B' then s[j]:='W';\n end;\n end\n else begin\n insert('B',s,1);\n for j:=2 to i do begin\n if s[j]='W' then s[j]:='B';\n end;\n end;\n k:=i;\n inc(cnt);\n end\n else break;\n end;\n writeln(cnt);\nend.", "problem_context": "Score : 300 points\n\nProblem Statement\n\nTwo foxes Jiro and Saburo are playing a game called 1D Reversi. This game is played on a board, using black and white stones. On the board, stones are placed in a row, and each player places a new stone to either end of the row. Similarly to the original game of Reversi, when a white stone is placed, all black stones between the new white stone and another white stone, turn into white stones, and vice versa.\n\nIn the middle of a game, something came up and Saburo has to leave the game. The state of the board at this point is described by a string S. There are |S| (the length of S) stones on the board, and each character in S represents the color of the i-th (1 ≦ i ≦ |S|) stone from the left. If the i-th character in S is B, it means that the color of the corresponding stone on the board is black. Similarly, if the i-th character in S is W, it means that the color of the corresponding stone is white.\n\nJiro wants all stones on the board to be of the same color. For this purpose, he will place new stones on the board according to the rules. Find the minimum number of new stones that he needs to place.\n\nConstraints\n\n1 ≦ |S| ≦ 10^5\n\nEach character in S is B or W.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the minimum number of new stones that Jiro needs to place for his purpose.\n\nSample Input 1\n\nBBBWW\n\nSample Output 1\n\n1\n\nBy placing a new black stone to the right end of the row of stones, all white stones will become black. Also, by placing a new white stone to the left end of the row of stones, all black stones will become white.\n\nIn either way, Jiro's purpose can be achieved by placing one stone.\n\nSample Input 2\n\nWWWWWW\n\nSample Output 2\n\n0\n\nIf all stones are already of the same color, no new stone is necessary.\n\nSample Input 3\n\nWBWBWBWBWB\n\nSample Output 3\n\n9", "sample_input": "BBBWW\n"}, "reference_outputs": ["1\n"], "source_document_id": "p03947", "source_text": "Score : 300 points\n\nProblem Statement\n\nTwo foxes Jiro and Saburo are playing a game called 1D Reversi. This game is played on a board, using black and white stones. On the board, stones are placed in a row, and each player places a new stone to either end of the row. Similarly to the original game of Reversi, when a white stone is placed, all black stones between the new white stone and another white stone, turn into white stones, and vice versa.\n\nIn the middle of a game, something came up and Saburo has to leave the game. The state of the board at this point is described by a string S. There are |S| (the length of S) stones on the board, and each character in S represents the color of the i-th (1 ≦ i ≦ |S|) stone from the left. If the i-th character in S is B, it means that the color of the corresponding stone on the board is black. Similarly, if the i-th character in S is W, it means that the color of the corresponding stone is white.\n\nJiro wants all stones on the board to be of the same color. For this purpose, he will place new stones on the board according to the rules. Find the minimum number of new stones that he needs to place.\n\nConstraints\n\n1 ≦ |S| ≦ 10^5\n\nEach character in S is B or W.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the minimum number of new stones that Jiro needs to place for his purpose.\n\nSample Input 1\n\nBBBWW\n\nSample Output 1\n\n1\n\nBy placing a new black stone to the right end of the row of stones, all white stones will become black. Also, by placing a new white stone to the left end of the row of stones, all black stones will become white.\n\nIn either way, Jiro's purpose can be achieved by placing one stone.\n\nSample Input 2\n\nWWWWWW\n\nSample Output 2\n\n0\n\nIf all stones are already of the same color, no new stone is necessary.\n\nSample Input 3\n\nWBWBWBWBWB\n\nSample Output 3\n\n9", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 764, "cpu_time_ms": 2205, "memory_kb": 1364}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s777625465", "group_id": "codeNet:p03947", "input_text": "var s:ansistring;\n i,j,cnt,k:longint;\n b:boolean;\nbegin\n readln(s);\n cnt:=0;\n b:=false;\n k:=1;\n while (b=false) do begin\n b:=true;\n for i:=k to length(s) do begin\n if (s[1]<>s[i]) then begin\n b:=false;\n break;\n end;\n end;\n if (b=false) then begin\n if s[i]='W' then begin\n insert('W',s,1);\n inc(cnt);\n for j:=2 to i do s[j]:='W';\n k:=i;\n end\n else begin\n insert('B',s,1);\n inc(cnt);\n for j:=2 to i do s[j]:='B';\n k:=i;\n end;\n end\n else break;\n end;\n writeln(cnt);\nend.", "language": "Pascal", "metadata": {"date": 1596663499, "filename_ext": "pas", "original_language": "Pascal (FPC 3.0.4)", "problem_description_relpath": "problem_descriptions/p03947.html", "problem_id": "p03947", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03947/input.txt", "sample_output_relpath": "derived/input_output/data/p03947/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03947/Pascal/s777625465.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s777625465", "user_id": "u018679195"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "var s:ansistring;\n i,j,cnt,k:longint;\n b:boolean;\nbegin\n readln(s);\n cnt:=0;\n b:=false;\n k:=1;\n while (b=false) do begin\n b:=true;\n for i:=k to length(s) do begin\n if (s[1]<>s[i]) then begin\n b:=false;\n break;\n end;\n end;\n if (b=false) then begin\n if s[i]='W' then begin\n insert('W',s,1);\n inc(cnt);\n for j:=2 to i do s[j]:='W';\n k:=i;\n end\n else begin\n insert('B',s,1);\n inc(cnt);\n for j:=2 to i do s[j]:='B';\n k:=i;\n end;\n end\n else break;\n end;\n writeln(cnt);\nend.", "problem_context": "Score : 300 points\n\nProblem Statement\n\nTwo foxes Jiro and Saburo are playing a game called 1D Reversi. This game is played on a board, using black and white stones. On the board, stones are placed in a row, and each player places a new stone to either end of the row. Similarly to the original game of Reversi, when a white stone is placed, all black stones between the new white stone and another white stone, turn into white stones, and vice versa.\n\nIn the middle of a game, something came up and Saburo has to leave the game. The state of the board at this point is described by a string S. There are |S| (the length of S) stones on the board, and each character in S represents the color of the i-th (1 ≦ i ≦ |S|) stone from the left. If the i-th character in S is B, it means that the color of the corresponding stone on the board is black. Similarly, if the i-th character in S is W, it means that the color of the corresponding stone is white.\n\nJiro wants all stones on the board to be of the same color. For this purpose, he will place new stones on the board according to the rules. Find the minimum number of new stones that he needs to place.\n\nConstraints\n\n1 ≦ |S| ≦ 10^5\n\nEach character in S is B or W.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the minimum number of new stones that Jiro needs to place for his purpose.\n\nSample Input 1\n\nBBBWW\n\nSample Output 1\n\n1\n\nBy placing a new black stone to the right end of the row of stones, all white stones will become black. Also, by placing a new white stone to the left end of the row of stones, all black stones will become white.\n\nIn either way, Jiro's purpose can be achieved by placing one stone.\n\nSample Input 2\n\nWWWWWW\n\nSample Output 2\n\n0\n\nIf all stones are already of the same color, no new stone is necessary.\n\nSample Input 3\n\nWBWBWBWBWB\n\nSample Output 3\n\n9", "sample_input": "BBBWW\n"}, "reference_outputs": ["1\n"], "source_document_id": "p03947", "source_text": "Score : 300 points\n\nProblem Statement\n\nTwo foxes Jiro and Saburo are playing a game called 1D Reversi. This game is played on a board, using black and white stones. On the board, stones are placed in a row, and each player places a new stone to either end of the row. Similarly to the original game of Reversi, when a white stone is placed, all black stones between the new white stone and another white stone, turn into white stones, and vice versa.\n\nIn the middle of a game, something came up and Saburo has to leave the game. The state of the board at this point is described by a string S. There are |S| (the length of S) stones on the board, and each character in S represents the color of the i-th (1 ≦ i ≦ |S|) stone from the left. If the i-th character in S is B, it means that the color of the corresponding stone on the board is black. Similarly, if the i-th character in S is W, it means that the color of the corresponding stone is white.\n\nJiro wants all stones on the board to be of the same color. For this purpose, he will place new stones on the board according to the rules. Find the minimum number of new stones that he needs to place.\n\nConstraints\n\n1 ≦ |S| ≦ 10^5\n\nEach character in S is B or W.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the minimum number of new stones that Jiro needs to place for his purpose.\n\nSample Input 1\n\nBBBWW\n\nSample Output 1\n\n1\n\nBy placing a new black stone to the right end of the row of stones, all white stones will become black. Also, by placing a new white stone to the left end of the row of stones, all black stones will become white.\n\nIn either way, Jiro's purpose can be achieved by placing one stone.\n\nSample Input 2\n\nWWWWWW\n\nSample Output 2\n\n0\n\nIf all stones are already of the same color, no new stone is necessary.\n\nSample Input 3\n\nWBWBWBWBWB\n\nSample Output 3\n\n9", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 2205, "memory_kb": 1384}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s949142009", "group_id": "codeNet:p03947", "input_text": "var s:ansistring;\n i,j,cnt:longint;\n b:boolean;\nbegin\n readln(s);\n cnt:=0;\n b:=false;\n while (b=false) do begin\n //writeln(s,' ',length(s));\n b:=true;\n for i:=length(s) downto 1 do begin\n if (s[1]<>s[i]) then begin\n b:=false;\n break;\n end;\n end;\n if (b=false) then begin\n for i:=1 to length(s) do begin\n if (s[1]<>s[i]) then begin\n if s[i]='W' then begin\n insert('W',s,1);\n inc(cnt);\n for j:=2 to i do s[j]:='W';\n end\n else begin\n insert('B',s,1);\n inc(cnt);\n for j:=2 to i do s[j]:='B';\n end;\n end;\n end;\n end\n else break;\n end;\n writeln(cnt);\nend.", "language": "Pascal", "metadata": {"date": 1596659597, "filename_ext": "pas", "original_language": "Pascal (FPC 3.0.4)", "problem_description_relpath": "problem_descriptions/p03947.html", "problem_id": "p03947", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03947/input.txt", "sample_output_relpath": "derived/input_output/data/p03947/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03947/Pascal/s949142009.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s949142009", "user_id": "u018679195"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "var s:ansistring;\n i,j,cnt:longint;\n b:boolean;\nbegin\n readln(s);\n cnt:=0;\n b:=false;\n while (b=false) do begin\n //writeln(s,' ',length(s));\n b:=true;\n for i:=length(s) downto 1 do begin\n if (s[1]<>s[i]) then begin\n b:=false;\n break;\n end;\n end;\n if (b=false) then begin\n for i:=1 to length(s) do begin\n if (s[1]<>s[i]) then begin\n if s[i]='W' then begin\n insert('W',s,1);\n inc(cnt);\n for j:=2 to i do s[j]:='W';\n end\n else begin\n insert('B',s,1);\n inc(cnt);\n for j:=2 to i do s[j]:='B';\n end;\n end;\n end;\n end\n else break;\n end;\n writeln(cnt);\nend.", "problem_context": "Score : 300 points\n\nProblem Statement\n\nTwo foxes Jiro and Saburo are playing a game called 1D Reversi. This game is played on a board, using black and white stones. On the board, stones are placed in a row, and each player places a new stone to either end of the row. Similarly to the original game of Reversi, when a white stone is placed, all black stones between the new white stone and another white stone, turn into white stones, and vice versa.\n\nIn the middle of a game, something came up and Saburo has to leave the game. The state of the board at this point is described by a string S. There are |S| (the length of S) stones on the board, and each character in S represents the color of the i-th (1 ≦ i ≦ |S|) stone from the left. If the i-th character in S is B, it means that the color of the corresponding stone on the board is black. Similarly, if the i-th character in S is W, it means that the color of the corresponding stone is white.\n\nJiro wants all stones on the board to be of the same color. For this purpose, he will place new stones on the board according to the rules. Find the minimum number of new stones that he needs to place.\n\nConstraints\n\n1 ≦ |S| ≦ 10^5\n\nEach character in S is B or W.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the minimum number of new stones that Jiro needs to place for his purpose.\n\nSample Input 1\n\nBBBWW\n\nSample Output 1\n\n1\n\nBy placing a new black stone to the right end of the row of stones, all white stones will become black. Also, by placing a new white stone to the left end of the row of stones, all black stones will become white.\n\nIn either way, Jiro's purpose can be achieved by placing one stone.\n\nSample Input 2\n\nWWWWWW\n\nSample Output 2\n\n0\n\nIf all stones are already of the same color, no new stone is necessary.\n\nSample Input 3\n\nWBWBWBWBWB\n\nSample Output 3\n\n9", "sample_input": "BBBWW\n"}, "reference_outputs": ["1\n"], "source_document_id": "p03947", "source_text": "Score : 300 points\n\nProblem Statement\n\nTwo foxes Jiro and Saburo are playing a game called 1D Reversi. This game is played on a board, using black and white stones. On the board, stones are placed in a row, and each player places a new stone to either end of the row. Similarly to the original game of Reversi, when a white stone is placed, all black stones between the new white stone and another white stone, turn into white stones, and vice versa.\n\nIn the middle of a game, something came up and Saburo has to leave the game. The state of the board at this point is described by a string S. There are |S| (the length of S) stones on the board, and each character in S represents the color of the i-th (1 ≦ i ≦ |S|) stone from the left. If the i-th character in S is B, it means that the color of the corresponding stone on the board is black. Similarly, if the i-th character in S is W, it means that the color of the corresponding stone is white.\n\nJiro wants all stones on the board to be of the same color. For this purpose, he will place new stones on the board according to the rules. Find the minimum number of new stones that he needs to place.\n\nConstraints\n\n1 ≦ |S| ≦ 10^5\n\nEach character in S is B or W.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the minimum number of new stones that Jiro needs to place for his purpose.\n\nSample Input 1\n\nBBBWW\n\nSample Output 1\n\n1\n\nBy placing a new black stone to the right end of the row of stones, all white stones will become black. Also, by placing a new white stone to the left end of the row of stones, all black stones will become white.\n\nIn either way, Jiro's purpose can be achieved by placing one stone.\n\nSample Input 2\n\nWWWWWW\n\nSample Output 2\n\n0\n\nIf all stones are already of the same color, no new stone is necessary.\n\nSample Input 3\n\nWBWBWBWBWB\n\nSample Output 3\n\n9", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 732, "cpu_time_ms": 2205, "memory_kb": 1364}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s361978658", "group_id": "codeNet:p03947", "input_text": "var a,b,lens:longint; s:ansistring;\n\nbegin\n readln(s);\n lens:=length(s);\n a:=pos('BB',s);\n b:=pos('WW',s);\n while a<>0 do begin\n delete(s,a,1);\n a:=pos('BB',s);\n end;\n while b<>0 do begin\n delete(s,b,1);\n b:=pos('WW',s);\n end;\n lens:=length(s);\n writeln (lens-1);\nend.", "language": "Pascal", "metadata": {"date": 1596659503, "filename_ext": "pas", "original_language": "Pascal (FPC 3.0.4)", "problem_description_relpath": "problem_descriptions/p03947.html", "problem_id": "p03947", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03947/input.txt", "sample_output_relpath": "derived/input_output/data/p03947/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03947/Pascal/s361978658.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s361978658", "user_id": "u353919145"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "var a,b,lens:longint; s:ansistring;\n\nbegin\n readln(s);\n lens:=length(s);\n a:=pos('BB',s);\n b:=pos('WW',s);\n while a<>0 do begin\n delete(s,a,1);\n a:=pos('BB',s);\n end;\n while b<>0 do begin\n delete(s,b,1);\n b:=pos('WW',s);\n end;\n lens:=length(s);\n writeln (lens-1);\nend.", "problem_context": "Score : 300 points\n\nProblem Statement\n\nTwo foxes Jiro and Saburo are playing a game called 1D Reversi. This game is played on a board, using black and white stones. On the board, stones are placed in a row, and each player places a new stone to either end of the row. Similarly to the original game of Reversi, when a white stone is placed, all black stones between the new white stone and another white stone, turn into white stones, and vice versa.\n\nIn the middle of a game, something came up and Saburo has to leave the game. The state of the board at this point is described by a string S. There are |S| (the length of S) stones on the board, and each character in S represents the color of the i-th (1 ≦ i ≦ |S|) stone from the left. If the i-th character in S is B, it means that the color of the corresponding stone on the board is black. Similarly, if the i-th character in S is W, it means that the color of the corresponding stone is white.\n\nJiro wants all stones on the board to be of the same color. For this purpose, he will place new stones on the board according to the rules. Find the minimum number of new stones that he needs to place.\n\nConstraints\n\n1 ≦ |S| ≦ 10^5\n\nEach character in S is B or W.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the minimum number of new stones that Jiro needs to place for his purpose.\n\nSample Input 1\n\nBBBWW\n\nSample Output 1\n\n1\n\nBy placing a new black stone to the right end of the row of stones, all white stones will become black. Also, by placing a new white stone to the left end of the row of stones, all black stones will become white.\n\nIn either way, Jiro's purpose can be achieved by placing one stone.\n\nSample Input 2\n\nWWWWWW\n\nSample Output 2\n\n0\n\nIf all stones are already of the same color, no new stone is necessary.\n\nSample Input 3\n\nWBWBWBWBWB\n\nSample Output 3\n\n9", "sample_input": "BBBWW\n"}, "reference_outputs": ["1\n"], "source_document_id": "p03947", "source_text": "Score : 300 points\n\nProblem Statement\n\nTwo foxes Jiro and Saburo are playing a game called 1D Reversi. This game is played on a board, using black and white stones. On the board, stones are placed in a row, and each player places a new stone to either end of the row. Similarly to the original game of Reversi, when a white stone is placed, all black stones between the new white stone and another white stone, turn into white stones, and vice versa.\n\nIn the middle of a game, something came up and Saburo has to leave the game. The state of the board at this point is described by a string S. There are |S| (the length of S) stones on the board, and each character in S represents the color of the i-th (1 ≦ i ≦ |S|) stone from the left. If the i-th character in S is B, it means that the color of the corresponding stone on the board is black. Similarly, if the i-th character in S is W, it means that the color of the corresponding stone is white.\n\nJiro wants all stones on the board to be of the same color. For this purpose, he will place new stones on the board according to the rules. Find the minimum number of new stones that he needs to place.\n\nConstraints\n\n1 ≦ |S| ≦ 10^5\n\nEach character in S is B or W.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the minimum number of new stones that Jiro needs to place for his purpose.\n\nSample Input 1\n\nBBBWW\n\nSample Output 1\n\n1\n\nBy placing a new black stone to the right end of the row of stones, all white stones will become black. Also, by placing a new white stone to the left end of the row of stones, all black stones will become white.\n\nIn either way, Jiro's purpose can be achieved by placing one stone.\n\nSample Input 2\n\nWWWWWW\n\nSample Output 2\n\n0\n\nIf all stones are already of the same color, no new stone is necessary.\n\nSample Input 3\n\nWBWBWBWBWB\n\nSample Output 3\n\n9", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 2205, "memory_kb": 1384}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s484239815", "group_id": "codeNet:p03947", "input_text": "var s:ansistring;\n i,j,cnt:longint;\n b:boolean;\nbegin\n readln(s);\n cnt:=0;\n b:=false;\n while (b=false) do begin\n //writeln(s,' ',length(s));\n b:=true;\n for i:=1 to length(s) do begin\n if (s[1]<>s[i]) then begin\n b:=false;\n break;\n end;\n end;\n if (b=false) then begin\n for i:=1 to length(s) do begin\n if (s[1]<>s[i]) then begin\n if s[i]='W' then begin\n insert('W',s,1);\n inc(cnt);\n for j:=2 to i do s[j]:='W';\n end\n else begin\n insert('B',s,1);\n inc(cnt);\n for j:=2 to i do s[j]:='B';\n end;\n end;\n end;\n end\n else break;\n end;\n writeln(cnt);\nend.\n ", "language": "Pascal", "metadata": {"date": 1596659335, "filename_ext": "pas", "original_language": "Pascal (FPC 3.0.4)", "problem_description_relpath": "problem_descriptions/p03947.html", "problem_id": "p03947", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03947/input.txt", "sample_output_relpath": "derived/input_output/data/p03947/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03947/Pascal/s484239815.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s484239815", "user_id": "u018679195"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "var s:ansistring;\n i,j,cnt:longint;\n b:boolean;\nbegin\n readln(s);\n cnt:=0;\n b:=false;\n while (b=false) do begin\n //writeln(s,' ',length(s));\n b:=true;\n for i:=1 to length(s) do begin\n if (s[1]<>s[i]) then begin\n b:=false;\n break;\n end;\n end;\n if (b=false) then begin\n for i:=1 to length(s) do begin\n if (s[1]<>s[i]) then begin\n if s[i]='W' then begin\n insert('W',s,1);\n inc(cnt);\n for j:=2 to i do s[j]:='W';\n end\n else begin\n insert('B',s,1);\n inc(cnt);\n for j:=2 to i do s[j]:='B';\n end;\n end;\n end;\n end\n else break;\n end;\n writeln(cnt);\nend.\n ", "problem_context": "Score : 300 points\n\nProblem Statement\n\nTwo foxes Jiro and Saburo are playing a game called 1D Reversi. This game is played on a board, using black and white stones. On the board, stones are placed in a row, and each player places a new stone to either end of the row. Similarly to the original game of Reversi, when a white stone is placed, all black stones between the new white stone and another white stone, turn into white stones, and vice versa.\n\nIn the middle of a game, something came up and Saburo has to leave the game. The state of the board at this point is described by a string S. There are |S| (the length of S) stones on the board, and each character in S represents the color of the i-th (1 ≦ i ≦ |S|) stone from the left. If the i-th character in S is B, it means that the color of the corresponding stone on the board is black. Similarly, if the i-th character in S is W, it means that the color of the corresponding stone is white.\n\nJiro wants all stones on the board to be of the same color. For this purpose, he will place new stones on the board according to the rules. Find the minimum number of new stones that he needs to place.\n\nConstraints\n\n1 ≦ |S| ≦ 10^5\n\nEach character in S is B or W.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the minimum number of new stones that Jiro needs to place for his purpose.\n\nSample Input 1\n\nBBBWW\n\nSample Output 1\n\n1\n\nBy placing a new black stone to the right end of the row of stones, all white stones will become black. Also, by placing a new white stone to the left end of the row of stones, all black stones will become white.\n\nIn either way, Jiro's purpose can be achieved by placing one stone.\n\nSample Input 2\n\nWWWWWW\n\nSample Output 2\n\n0\n\nIf all stones are already of the same color, no new stone is necessary.\n\nSample Input 3\n\nWBWBWBWBWB\n\nSample Output 3\n\n9", "sample_input": "BBBWW\n"}, "reference_outputs": ["1\n"], "source_document_id": "p03947", "source_text": "Score : 300 points\n\nProblem Statement\n\nTwo foxes Jiro and Saburo are playing a game called 1D Reversi. This game is played on a board, using black and white stones. On the board, stones are placed in a row, and each player places a new stone to either end of the row. Similarly to the original game of Reversi, when a white stone is placed, all black stones between the new white stone and another white stone, turn into white stones, and vice versa.\n\nIn the middle of a game, something came up and Saburo has to leave the game. The state of the board at this point is described by a string S. There are |S| (the length of S) stones on the board, and each character in S represents the color of the i-th (1 ≦ i ≦ |S|) stone from the left. If the i-th character in S is B, it means that the color of the corresponding stone on the board is black. Similarly, if the i-th character in S is W, it means that the color of the corresponding stone is white.\n\nJiro wants all stones on the board to be of the same color. For this purpose, he will place new stones on the board according to the rules. Find the minimum number of new stones that he needs to place.\n\nConstraints\n\n1 ≦ |S| ≦ 10^5\n\nEach character in S is B or W.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the minimum number of new stones that Jiro needs to place for his purpose.\n\nSample Input 1\n\nBBBWW\n\nSample Output 1\n\n1\n\nBy placing a new black stone to the right end of the row of stones, all white stones will become black. Also, by placing a new white stone to the left end of the row of stones, all black stones will become white.\n\nIn either way, Jiro's purpose can be achieved by placing one stone.\n\nSample Input 2\n\nWWWWWW\n\nSample Output 2\n\n0\n\nIf all stones are already of the same color, no new stone is necessary.\n\nSample Input 3\n\nWBWBWBWBWB\n\nSample Output 3\n\n9", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 2205, "memory_kb": 1372}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s902285092", "group_id": "codeNet:p03947", "input_text": "var s:ansistring;\n i,j,cnt:longint;\n b:boolean;\nbegin\n readln(s);\n cnt:=0;\n b:=false;\n while (b=false) do begin\n //writeln(s,' ',length(s));\n b:=true;\n for i:=1 to length(s) do begin\n for j:=1 to length(s) do begin\n if (s[i]<>s[j]) then begin\n b:=false;\n break;\n end;\n end;\n end;\n if (b=false) then begin\n for i:=1 to length(s) do begin\n if (s[1]<>s[i]) then begin\n if s[i]='W' then begin\n insert('W',s,1);\n inc(cnt);\n for j:=2 to i do s[j]:='W';\n end\n else begin\n insert('B',s,1);\n inc(cnt);\n for j:=2 to i do s[j]:='B';\n end;\n end;\n end;\n end\n else break;\n end;\n writeln(cnt);\nend.\n ", "language": "Pascal", "metadata": {"date": 1596659032, "filename_ext": "pas", "original_language": "Pascal (FPC 3.0.4)", "problem_description_relpath": "problem_descriptions/p03947.html", "problem_id": "p03947", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03947/input.txt", "sample_output_relpath": "derived/input_output/data/p03947/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03947/Pascal/s902285092.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s902285092", "user_id": "u089230684"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "var s:ansistring;\n i,j,cnt:longint;\n b:boolean;\nbegin\n readln(s);\n cnt:=0;\n b:=false;\n while (b=false) do begin\n //writeln(s,' ',length(s));\n b:=true;\n for i:=1 to length(s) do begin\n for j:=1 to length(s) do begin\n if (s[i]<>s[j]) then begin\n b:=false;\n break;\n end;\n end;\n end;\n if (b=false) then begin\n for i:=1 to length(s) do begin\n if (s[1]<>s[i]) then begin\n if s[i]='W' then begin\n insert('W',s,1);\n inc(cnt);\n for j:=2 to i do s[j]:='W';\n end\n else begin\n insert('B',s,1);\n inc(cnt);\n for j:=2 to i do s[j]:='B';\n end;\n end;\n end;\n end\n else break;\n end;\n writeln(cnt);\nend.\n ", "problem_context": "Score : 300 points\n\nProblem Statement\n\nTwo foxes Jiro and Saburo are playing a game called 1D Reversi. This game is played on a board, using black and white stones. On the board, stones are placed in a row, and each player places a new stone to either end of the row. Similarly to the original game of Reversi, when a white stone is placed, all black stones between the new white stone and another white stone, turn into white stones, and vice versa.\n\nIn the middle of a game, something came up and Saburo has to leave the game. The state of the board at this point is described by a string S. There are |S| (the length of S) stones on the board, and each character in S represents the color of the i-th (1 ≦ i ≦ |S|) stone from the left. If the i-th character in S is B, it means that the color of the corresponding stone on the board is black. Similarly, if the i-th character in S is W, it means that the color of the corresponding stone is white.\n\nJiro wants all stones on the board to be of the same color. For this purpose, he will place new stones on the board according to the rules. Find the minimum number of new stones that he needs to place.\n\nConstraints\n\n1 ≦ |S| ≦ 10^5\n\nEach character in S is B or W.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the minimum number of new stones that Jiro needs to place for his purpose.\n\nSample Input 1\n\nBBBWW\n\nSample Output 1\n\n1\n\nBy placing a new black stone to the right end of the row of stones, all white stones will become black. Also, by placing a new white stone to the left end of the row of stones, all black stones will become white.\n\nIn either way, Jiro's purpose can be achieved by placing one stone.\n\nSample Input 2\n\nWWWWWW\n\nSample Output 2\n\n0\n\nIf all stones are already of the same color, no new stone is necessary.\n\nSample Input 3\n\nWBWBWBWBWB\n\nSample Output 3\n\n9", "sample_input": "BBBWW\n"}, "reference_outputs": ["1\n"], "source_document_id": "p03947", "source_text": "Score : 300 points\n\nProblem Statement\n\nTwo foxes Jiro and Saburo are playing a game called 1D Reversi. This game is played on a board, using black and white stones. On the board, stones are placed in a row, and each player places a new stone to either end of the row. Similarly to the original game of Reversi, when a white stone is placed, all black stones between the new white stone and another white stone, turn into white stones, and vice versa.\n\nIn the middle of a game, something came up and Saburo has to leave the game. The state of the board at this point is described by a string S. There are |S| (the length of S) stones on the board, and each character in S represents the color of the i-th (1 ≦ i ≦ |S|) stone from the left. If the i-th character in S is B, it means that the color of the corresponding stone on the board is black. Similarly, if the i-th character in S is W, it means that the color of the corresponding stone is white.\n\nJiro wants all stones on the board to be of the same color. For this purpose, he will place new stones on the board according to the rules. Find the minimum number of new stones that he needs to place.\n\nConstraints\n\n1 ≦ |S| ≦ 10^5\n\nEach character in S is B or W.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the minimum number of new stones that Jiro needs to place for his purpose.\n\nSample Input 1\n\nBBBWW\n\nSample Output 1\n\n1\n\nBy placing a new black stone to the right end of the row of stones, all white stones will become black. Also, by placing a new white stone to the left end of the row of stones, all black stones will become white.\n\nIn either way, Jiro's purpose can be achieved by placing one stone.\n\nSample Input 2\n\nWWWWWW\n\nSample Output 2\n\n0\n\nIf all stones are already of the same color, no new stone is necessary.\n\nSample Input 3\n\nWBWBWBWBWB\n\nSample Output 3\n\n9", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 2205, "memory_kb": 1372}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s105469947", "group_id": "codeNet:p03947", "input_text": "program task1016;\nvar\n a,b,c : ansistring;\n x,y,i,t : longint;\n sum : int64;\nbegin\n read(a);\n sum := 0;\n b := a;\n c := a;\n delete(b,pos(' ',a),length(a)-pos(' ',a)+1);\n val(b,x,i);\n delete(a,1,pos(' ',a)+2);\n val(a,y,t);\n if c[pos(' ',c) + 1] = '+' then\n sum := x + y\n else \n sum := x - y;\n writeln(sum);\nend.", "language": "Pascal", "metadata": {"date": 1596657577, "filename_ext": "pas", "original_language": "Pascal (FPC 3.0.4)", "problem_description_relpath": "problem_descriptions/p03947.html", "problem_id": "p03947", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03947/input.txt", "sample_output_relpath": "derived/input_output/data/p03947/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03947/Pascal/s105469947.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s105469947", "user_id": "u018679195"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "program task1016;\nvar\n a,b,c : ansistring;\n x,y,i,t : longint;\n sum : int64;\nbegin\n read(a);\n sum := 0;\n b := a;\n c := a;\n delete(b,pos(' ',a),length(a)-pos(' ',a)+1);\n val(b,x,i);\n delete(a,1,pos(' ',a)+2);\n val(a,y,t);\n if c[pos(' ',c) + 1] = '+' then\n sum := x + y\n else \n sum := x - y;\n writeln(sum);\nend.", "problem_context": "Score : 300 points\n\nProblem Statement\n\nTwo foxes Jiro and Saburo are playing a game called 1D Reversi. This game is played on a board, using black and white stones. On the board, stones are placed in a row, and each player places a new stone to either end of the row. Similarly to the original game of Reversi, when a white stone is placed, all black stones between the new white stone and another white stone, turn into white stones, and vice versa.\n\nIn the middle of a game, something came up and Saburo has to leave the game. The state of the board at this point is described by a string S. There are |S| (the length of S) stones on the board, and each character in S represents the color of the i-th (1 ≦ i ≦ |S|) stone from the left. If the i-th character in S is B, it means that the color of the corresponding stone on the board is black. Similarly, if the i-th character in S is W, it means that the color of the corresponding stone is white.\n\nJiro wants all stones on the board to be of the same color. For this purpose, he will place new stones on the board according to the rules. Find the minimum number of new stones that he needs to place.\n\nConstraints\n\n1 ≦ |S| ≦ 10^5\n\nEach character in S is B or W.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the minimum number of new stones that Jiro needs to place for his purpose.\n\nSample Input 1\n\nBBBWW\n\nSample Output 1\n\n1\n\nBy placing a new black stone to the right end of the row of stones, all white stones will become black. Also, by placing a new white stone to the left end of the row of stones, all black stones will become white.\n\nIn either way, Jiro's purpose can be achieved by placing one stone.\n\nSample Input 2\n\nWWWWWW\n\nSample Output 2\n\n0\n\nIf all stones are already of the same color, no new stone is necessary.\n\nSample Input 3\n\nWBWBWBWBWB\n\nSample Output 3\n\n9", "sample_input": "BBBWW\n"}, "reference_outputs": ["1\n"], "source_document_id": "p03947", "source_text": "Score : 300 points\n\nProblem Statement\n\nTwo foxes Jiro and Saburo are playing a game called 1D Reversi. This game is played on a board, using black and white stones. On the board, stones are placed in a row, and each player places a new stone to either end of the row. Similarly to the original game of Reversi, when a white stone is placed, all black stones between the new white stone and another white stone, turn into white stones, and vice versa.\n\nIn the middle of a game, something came up and Saburo has to leave the game. The state of the board at this point is described by a string S. There are |S| (the length of S) stones on the board, and each character in S represents the color of the i-th (1 ≦ i ≦ |S|) stone from the left. If the i-th character in S is B, it means that the color of the corresponding stone on the board is black. Similarly, if the i-th character in S is W, it means that the color of the corresponding stone is white.\n\nJiro wants all stones on the board to be of the same color. For this purpose, he will place new stones on the board according to the rules. Find the minimum number of new stones that he needs to place.\n\nConstraints\n\n1 ≦ |S| ≦ 10^5\n\nEach character in S is B or W.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the minimum number of new stones that Jiro needs to place for his purpose.\n\nSample Input 1\n\nBBBWW\n\nSample Output 1\n\n1\n\nBy placing a new black stone to the right end of the row of stones, all white stones will become black. Also, by placing a new white stone to the left end of the row of stones, all black stones will become white.\n\nIn either way, Jiro's purpose can be achieved by placing one stone.\n\nSample Input 2\n\nWWWWWW\n\nSample Output 2\n\n0\n\nIf all stones are already of the same color, no new stone is necessary.\n\nSample Input 3\n\nWBWBWBWBWB\n\nSample Output 3\n\n9", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 6, "memory_kb": 1320}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s050654395", "group_id": "codeNet:p03947", "input_text": "var\n\ts:String;\n\ti,c:Longint;\nbegin\n\treadln(s);\n\tfor i:=2 to length(s) do if s[i]<>s[i-1]then inc(c);\n\twriteln(c);\nend.\n", "language": "Pascal", "metadata": {"date": 1538022670, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03947.html", "problem_id": "p03947", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03947/input.txt", "sample_output_relpath": "derived/input_output/data/p03947/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03947/Pascal/s050654395.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s050654395", "user_id": "u657913472"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "var\n\ts:String;\n\ti,c:Longint;\nbegin\n\treadln(s);\n\tfor i:=2 to length(s) do if s[i]<>s[i-1]then inc(c);\n\twriteln(c);\nend.\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nTwo foxes Jiro and Saburo are playing a game called 1D Reversi. This game is played on a board, using black and white stones. On the board, stones are placed in a row, and each player places a new stone to either end of the row. Similarly to the original game of Reversi, when a white stone is placed, all black stones between the new white stone and another white stone, turn into white stones, and vice versa.\n\nIn the middle of a game, something came up and Saburo has to leave the game. The state of the board at this point is described by a string S. There are |S| (the length of S) stones on the board, and each character in S represents the color of the i-th (1 ≦ i ≦ |S|) stone from the left. If the i-th character in S is B, it means that the color of the corresponding stone on the board is black. Similarly, if the i-th character in S is W, it means that the color of the corresponding stone is white.\n\nJiro wants all stones on the board to be of the same color. For this purpose, he will place new stones on the board according to the rules. Find the minimum number of new stones that he needs to place.\n\nConstraints\n\n1 ≦ |S| ≦ 10^5\n\nEach character in S is B or W.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the minimum number of new stones that Jiro needs to place for his purpose.\n\nSample Input 1\n\nBBBWW\n\nSample Output 1\n\n1\n\nBy placing a new black stone to the right end of the row of stones, all white stones will become black. Also, by placing a new white stone to the left end of the row of stones, all black stones will become white.\n\nIn either way, Jiro's purpose can be achieved by placing one stone.\n\nSample Input 2\n\nWWWWWW\n\nSample Output 2\n\n0\n\nIf all stones are already of the same color, no new stone is necessary.\n\nSample Input 3\n\nWBWBWBWBWB\n\nSample Output 3\n\n9", "sample_input": "BBBWW\n"}, "reference_outputs": ["1\n"], "source_document_id": "p03947", "source_text": "Score : 300 points\n\nProblem Statement\n\nTwo foxes Jiro and Saburo are playing a game called 1D Reversi. This game is played on a board, using black and white stones. On the board, stones are placed in a row, and each player places a new stone to either end of the row. Similarly to the original game of Reversi, when a white stone is placed, all black stones between the new white stone and another white stone, turn into white stones, and vice versa.\n\nIn the middle of a game, something came up and Saburo has to leave the game. The state of the board at this point is described by a string S. There are |S| (the length of S) stones on the board, and each character in S represents the color of the i-th (1 ≦ i ≦ |S|) stone from the left. If the i-th character in S is B, it means that the color of the corresponding stone on the board is black. Similarly, if the i-th character in S is W, it means that the color of the corresponding stone is white.\n\nJiro wants all stones on the board to be of the same color. For this purpose, he will place new stones on the board according to the rules. Find the minimum number of new stones that he needs to place.\n\nConstraints\n\n1 ≦ |S| ≦ 10^5\n\nEach character in S is B or W.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nS\n\nOutput\n\nPrint the minimum number of new stones that Jiro needs to place for his purpose.\n\nSample Input 1\n\nBBBWW\n\nSample Output 1\n\n1\n\nBy placing a new black stone to the right end of the row of stones, all white stones will become black. Also, by placing a new white stone to the left end of the row of stones, all black stones will become white.\n\nIn either way, Jiro's purpose can be achieved by placing one stone.\n\nSample Input 2\n\nWWWWWW\n\nSample Output 2\n\n0\n\nIf all stones are already of the same color, no new stone is necessary.\n\nSample Input 3\n\nWBWBWBWBWB\n\nSample Output 3\n\n9", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 119, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s791512379", "group_id": "codeNet:p03952", "input_text": "var\n\tN,x,w,i:Longint;\nbegin\n\tread(N,x);\n\tw:=2*N-1;\n\tif x mod w>1 then begin\n\t\twriteln('Yes');\n\t\tfor i:=1 to w do writeln(w-(N-x-i+w*2)mod w);\n\tend else writeln('No');\nend.\n", "language": "Pascal", "metadata": {"date": 1579577698, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03952.html", "problem_id": "p03952", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03952/input.txt", "sample_output_relpath": "derived/input_output/data/p03952/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03952/Pascal/s791512379.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s791512379", "user_id": "u657913472"}, "prompt_components": {"gold_output": "Yes\n1\n6\n3\n7\n4\n5\n2\n", "input_to_evaluate": "var\n\tN,x,w,i:Longint;\nbegin\n\tread(N,x);\n\tw:=2*N-1;\n\tif x mod w>1 then begin\n\t\twriteln('Yes');\n\t\tfor i:=1 to w do writeln(w-(N-x-i+w*2)mod w);\n\tend else writeln('No');\nend.\n", "problem_context": "Score : 400 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 integer written into the block of step 1 was x.\n\nConstruct a permutation of (1, 2, ..., 2N-1) that could have been written into the blocks of step N, or declare that Snuke's memory is incorrect and such a permutation does not exist.\n\nConstraints\n\n2≤N≤10^5\n\n1≤x≤2N-1\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN x\n\nOutput\n\nIf no permutation of (1, 2, ..., 2N-1) could have been written into the blocks of step N, print No.\n\nOtherwise, print Yes in the first line, then print 2N-1 lines in addition.\n\nThe i-th of these 2N-1 lines should contain the i-th element of a possible permutation.\n\nSample Input 1\n\n4 4\n\nSample Output 1\n\nYes\n1\n6\n3\n7\n4\n5\n2\n\nThis case corresponds to the figure in the problem statement.\n\nSample Input 2\n\n2 1\n\nSample Output 2\n\nNo\n\nNo matter what permutation was written into the blocks of step N, the integer written into the block of step 1 would be 2.", "sample_input": "4 4\n"}, "reference_outputs": ["Yes\n1\n6\n3\n7\n4\n5\n2\n"], "source_document_id": "p03952", "source_text": "Score : 400 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 integer written into the block of step 1 was x.\n\nConstruct a permutation of (1, 2, ..., 2N-1) that could have been written into the blocks of step N, or declare that Snuke's memory is incorrect and such a permutation does not exist.\n\nConstraints\n\n2≤N≤10^5\n\n1≤x≤2N-1\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN x\n\nOutput\n\nIf no permutation of (1, 2, ..., 2N-1) could have been written into the blocks of step N, print No.\n\nOtherwise, print Yes in the first line, then print 2N-1 lines in addition.\n\nThe i-th of these 2N-1 lines should contain the i-th element of a possible permutation.\n\nSample Input 1\n\n4 4\n\nSample Output 1\n\nYes\n1\n6\n3\n7\n4\n5\n2\n\nThis case corresponds to the figure in the problem statement.\n\nSample Input 2\n\n2 1\n\nSample Output 2\n\nNo\n\nNo matter what permutation was written into the blocks of step N, the integer written into the block of step 1 would be 2.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 172, "cpu_time_ms": 31, "memory_kb": 1408}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s389081380", "group_id": "codeNet:p03954", "input_text": "var\n\ti,l,r,mid,n:longint;\n\ta:array[1..1000001] of longint;\n\nfunction check(k:longint):longint;\nvar\ti:longint;\nbegin\n\tif ((a[n-1]<=k)and(a[n]<=k))or((a[n+1]<=k)and(a[n]<=k)) then exit(0);\n\tif ((a[n-1]>k)and(a[n]>k))or((a[n+1]>k)and(a[n]>k)) then exit(1);\n\tfor i:=1 to n-1 do begin\n\t\tif ((a[n-i-1]<=k)and(a[n-i]<=k))or((a[n+i+1]<=k)and(a[n+i]<=k)) then exit(0);\n\t\tif ((a[n-i-1]>k)and(a[n-i]>k))or((a[n+i+1]>k)and(a[n+i]>k)) then exit(1);\n\tend;\n\tif a[1]>k then exit(1) else exit(0);\nend;\n\nbegin\n\treadln(n);\n\tfor i:=1 to 2*n-1 do read(a[i]);\n\tl:=1;\n\tr:=2*n-1;\n\twhile lk)and(a[n]>k))or((a[n+1]>k)and(a[n]>k)) then exit(1);\n\tfor i:=1 to n-1 do begin\n\t\tif ((a[n-i-1]<=k)and(a[n-i]<=k))or((a[n+i+1]<=k)and(a[n+i]<=k)) then exit(0);\n\t\tif ((a[n-i-1]>k)and(a[n-i]>k))or((a[n+i+1]>k)and(a[n+i]>k)) then exit(1);\n\tend;\n\tif a[1]>k then exit(1) else exit(0);\nend;\n\nbegin\n\treadln(n);\n\tfor i:=1 to 2*n-1 do read(a[i]);\n\tl:=1;\n\tr:=2*n-1;\n\twhile l0 then //判断是否出现过CF，如果有，就输出Yes并跳出\n Begin\n write('Yes');\n halt;\n end;\n end;\n write('No'); //因为如果有前面就跳出程序了，所以如果执行到这一步肯定是找不到\nend.", "language": "Pascal", "metadata": {"date": 1545784878, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03957.html", "problem_id": "p03957", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03957/input.txt", "sample_output_relpath": "derived/input_output/data/p03957/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03957/Pascal/s191777014.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s191777014", "user_id": "u263933075"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "Var s,x:ansistring;\n n,i:longint;\nBegin\n readln(s);\n for i:=1 to length(s) do //遍历字符串s\n Begin\n if s[i] in ['C','F'] then //当s串的第i个位置是C或F就存入x串。\n Begin\n x:=x+s[i];\n end;\n\n if pos('CF',x)<>0 then //判断是否出现过CF，如果有，就输出Yes并跳出\n Begin\n write('Yes');\n halt;\n end;\n end;\n write('No'); //因为如果有前面就跳出程序了，所以如果执行到这一步肯定是找不到\nend.", "problem_context": "Score : 100 points\n\nProblem Statement\n\nThis contest is CODEFESTIVAL, which can be shortened to the string CF by deleting some characters.\n\nMr. Takahashi, full of curiosity, wondered if he could obtain CF from other strings in the same way.\n\nYou are given a string s consisting of uppercase English letters.\nDetermine whether the string CF can be obtained from the string s by deleting some characters.\n\nConstraints\n\n2 ≤ |s| ≤ 100\n\nAll characters in s are uppercase English letters (A-Z).\n\nInput\n\nThe input is given from Standard Input in the following format:\n\ns\n\nOutput\n\nPrint Yes if the string CF can be obtained from the string s by deleting some characters.\nOtherwise print No.\n\nSample Input 1\n\nCODEFESTIVAL\n\nSample Output 1\n\nYes\n\nCF is obtained by deleting characters other than the first character C and the fifth character F.\n\nSample Input 2\n\nFESTIVALCODE\n\nSample Output 2\n\nNo\n\nFC can be obtained but CF cannot be obtained because you cannot change the order of the characters.\n\nSample Input 3\n\nCF\n\nSample Output 3\n\nYes\n\nIt is also possible not to delete any characters.\n\nSample Input 4\n\nFCF\n\nSample Output 4\n\nYes\n\nCF is obtained by deleting the first character.", "sample_input": "CODEFESTIVAL\n"}, "reference_outputs": ["Yes\n"], "source_document_id": "p03957", "source_text": "Score : 100 points\n\nProblem Statement\n\nThis contest is CODEFESTIVAL, which can be shortened to the string CF by deleting some characters.\n\nMr. Takahashi, full of curiosity, wondered if he could obtain CF from other strings in the same way.\n\nYou are given a string s consisting of uppercase English letters.\nDetermine whether the string CF can be obtained from the string s by deleting some characters.\n\nConstraints\n\n2 ≤ |s| ≤ 100\n\nAll characters in s are uppercase English letters (A-Z).\n\nInput\n\nThe input is given from Standard Input in the following format:\n\ns\n\nOutput\n\nPrint Yes if the string CF can be obtained from the string s by deleting some characters.\nOtherwise print No.\n\nSample Input 1\n\nCODEFESTIVAL\n\nSample Output 1\n\nYes\n\nCF is obtained by deleting characters other than the first character C and the fifth character F.\n\nSample Input 2\n\nFESTIVALCODE\n\nSample Output 2\n\nNo\n\nFC can be obtained but CF cannot be obtained because you cannot change the order of the characters.\n\nSample Input 3\n\nCF\n\nSample Output 3\n\nYes\n\nIt is also possible not to delete any characters.\n\nSample Input 4\n\nFCF\n\nSample Output 4\n\nYes\n\nCF is obtained by deleting the first character.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 642, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s965005391", "group_id": "codeNet:p03957", "input_text": "program hrn;\n var\n s:ansistring;\n i,l,s1,s2:longint;\nbegin\n readln(s);\n l:=length(s);\n s2:=maxlongint;\n for i:=1 to l do\n begin\n if (s[i]='F') then s1:=i;\n end;\n for i:=l downto 1 do\n begin\n if (s[i]='C') then s2:=i;\n end;\n if s2=y+1) then begin inc(y); if (s[i]='g') then inc(ans); end\n else begin inc(x); if (s[i]='p') then dec(ans); end;\n end;\n writeln(ans);\nend.", "language": "Pascal", "metadata": {"date": 1553461458, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03965.html", "problem_id": "p03965", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03965/input.txt", "sample_output_relpath": "derived/input_output/data/p03965/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03965/Pascal/s347663000.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s347663000", "user_id": "u558785941"}, "prompt_components": {"gold_output": "0\n", "input_to_evaluate": "var s:string;\n i,len,x,y,ans:longint;\nbegin\n readln(s);\n len:=length(s);\n for i:=1 to len do\n begin\n if (x>=y+1) then begin inc(y); if (s[i]='g') then inc(ans); end\n else begin inc(x); if (s[i]='p') then dec(ans); end;\n end;\n writeln(ans);\nend.", "problem_context": "Score : 300 points\n\nProblem Statement\n\nAtCoDeer the deer and his friend TopCoDeer is playing a game.\nThe game consists of N turns.\nIn each turn, each player plays one of the two gestures, Rock and Paper, as in Rock-paper-scissors, under the following condition:\n\n(※) After each turn, (the number of times the player has played Paper)≦(the number of times the player has played Rock).\n\nEach player's score is calculated by (the number of turns where the player wins) - (the number of turns where the player loses), where the outcome of each turn is determined by the rules of Rock-paper-scissors.\n\n(For those who are not familiar with Rock-paper-scissors: If one player plays Rock and the other plays Paper, the latter player will win and the former player will lose. If both players play the same gesture, the round is a tie and neither player will win nor lose.)\n\nWith his supernatural power, AtCoDeer was able to foresee the gesture that TopCoDeer will play in each of the N turns, before the game starts.\nPlan AtCoDeer's gesture in each turn to maximize AtCoDeer's score.\n\nThe gesture that TopCoDeer will play in each turn is given by a string s. If the i-th (1≦i≦N) character in s is g, TopCoDeer will play Rock in the i-th turn. Similarly, if the i-th (1≦i≦N) character of s in p, TopCoDeer will play Paper in the i-th turn.\n\nConstraints\n\n1≦N≦10^5\n\nN=|s|\n\nEach character in s is g or p.\n\nThe gestures represented by s satisfy the condition (※).\n\nInput\n\nThe input is given from Standard Input in the following format:\n\ns\n\nOutput\n\nPrint the AtCoDeer's maximum possible score.\n\nSample Input 1\n\ngpg\n\nSample Output 1\n\n0\n\nPlaying the same gesture as the opponent in each turn results in the score of 0, which is the maximum possible score.\n\nSample Input 2\n\nggppgggpgg\n\nSample Output 2\n\n2\n\nFor example, consider playing gestures in the following order: Rock, Paper, Rock, Paper, Rock, Rock, Paper, Paper, Rock, Paper. This strategy earns three victories and suffers one defeat, resulting in the score of 2, which is the maximum possible score.", "sample_input": "gpg\n"}, "reference_outputs": ["0\n"], "source_document_id": "p03965", "source_text": "Score : 300 points\n\nProblem Statement\n\nAtCoDeer the deer and his friend TopCoDeer is playing a game.\nThe game consists of N turns.\nIn each turn, each player plays one of the two gestures, Rock and Paper, as in Rock-paper-scissors, under the following condition:\n\n(※) After each turn, (the number of times the player has played Paper)≦(the number of times the player has played Rock).\n\nEach player's score is calculated by (the number of turns where the player wins) - (the number of turns where the player loses), where the outcome of each turn is determined by the rules of Rock-paper-scissors.\n\n(For those who are not familiar with Rock-paper-scissors: If one player plays Rock and the other plays Paper, the latter player will win and the former player will lose. If both players play the same gesture, the round is a tie and neither player will win nor lose.)\n\nWith his supernatural power, AtCoDeer was able to foresee the gesture that TopCoDeer will play in each of the N turns, before the game starts.\nPlan AtCoDeer's gesture in each turn to maximize AtCoDeer's score.\n\nThe gesture that TopCoDeer will play in each turn is given by a string s. If the i-th (1≦i≦N) character in s is g, TopCoDeer will play Rock in the i-th turn. Similarly, if the i-th (1≦i≦N) character of s in p, TopCoDeer will play Paper in the i-th turn.\n\nConstraints\n\n1≦N≦10^5\n\nN=|s|\n\nEach character in s is g or p.\n\nThe gestures represented by s satisfy the condition (※).\n\nInput\n\nThe input is given from Standard Input in the following format:\n\ns\n\nOutput\n\nPrint the AtCoDeer's maximum possible score.\n\nSample Input 1\n\ngpg\n\nSample Output 1\n\n0\n\nPlaying the same gesture as the opponent in each turn results in the score of 0, which is the maximum possible score.\n\nSample Input 2\n\nggppgggpgg\n\nSample Output 2\n\n2\n\nFor example, consider playing gestures in the following order: Rock, Paper, Rock, Paper, Rock, Rock, Paper, Paper, Rock, Paper. This strategy earns three victories and suffers one defeat, resulting in the score of 2, which is the maximum possible score.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s465829197", "group_id": "codeNet:p03965", "input_text": "var s:string;\n i,j,k:longint;\n x,y,ans:longint;\nbegin\n readln(s);\n for i:=1 to length(s) do\n begin\n if(x=y)then\n begin\n x:=x+1;\n if(s[i]='p')then\n ans:=ans-1;\n end\n else\n begin\n y:=y+1;\n if(s[i]='g')then\n ans:=ans+1;\n end;\n end;\n writeln(ans);\nend.", "language": "Pascal", "metadata": {"date": 1550237228, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03965.html", "problem_id": "p03965", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03965/input.txt", "sample_output_relpath": "derived/input_output/data/p03965/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03965/Pascal/s465829197.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s465829197", "user_id": "u247366051"}, "prompt_components": {"gold_output": "0\n", "input_to_evaluate": "var s:string;\n i,j,k:longint;\n x,y,ans:longint;\nbegin\n readln(s);\n for i:=1 to length(s) do\n begin\n if(x=y)then\n begin\n x:=x+1;\n if(s[i]='p')then\n ans:=ans-1;\n end\n else\n begin\n y:=y+1;\n if(s[i]='g')then\n ans:=ans+1;\n end;\n end;\n writeln(ans);\nend.", "problem_context": "Score : 300 points\n\nProblem Statement\n\nAtCoDeer the deer and his friend TopCoDeer is playing a game.\nThe game consists of N turns.\nIn each turn, each player plays one of the two gestures, Rock and Paper, as in Rock-paper-scissors, under the following condition:\n\n(※) After each turn, (the number of times the player has played Paper)≦(the number of times the player has played Rock).\n\nEach player's score is calculated by (the number of turns where the player wins) - (the number of turns where the player loses), where the outcome of each turn is determined by the rules of Rock-paper-scissors.\n\n(For those who are not familiar with Rock-paper-scissors: If one player plays Rock and the other plays Paper, the latter player will win and the former player will lose. If both players play the same gesture, the round is a tie and neither player will win nor lose.)\n\nWith his supernatural power, AtCoDeer was able to foresee the gesture that TopCoDeer will play in each of the N turns, before the game starts.\nPlan AtCoDeer's gesture in each turn to maximize AtCoDeer's score.\n\nThe gesture that TopCoDeer will play in each turn is given by a string s. If the i-th (1≦i≦N) character in s is g, TopCoDeer will play Rock in the i-th turn. Similarly, if the i-th (1≦i≦N) character of s in p, TopCoDeer will play Paper in the i-th turn.\n\nConstraints\n\n1≦N≦10^5\n\nN=|s|\n\nEach character in s is g or p.\n\nThe gestures represented by s satisfy the condition (※).\n\nInput\n\nThe input is given from Standard Input in the following format:\n\ns\n\nOutput\n\nPrint the AtCoDeer's maximum possible score.\n\nSample Input 1\n\ngpg\n\nSample Output 1\n\n0\n\nPlaying the same gesture as the opponent in each turn results in the score of 0, which is the maximum possible score.\n\nSample Input 2\n\nggppgggpgg\n\nSample Output 2\n\n2\n\nFor example, consider playing gestures in the following order: Rock, Paper, Rock, Paper, Rock, Rock, Paper, Paper, Rock, Paper. This strategy earns three victories and suffers one defeat, resulting in the score of 2, which is the maximum possible score.", "sample_input": "gpg\n"}, "reference_outputs": ["0\n"], "source_document_id": "p03965", "source_text": "Score : 300 points\n\nProblem Statement\n\nAtCoDeer the deer and his friend TopCoDeer is playing a game.\nThe game consists of N turns.\nIn each turn, each player plays one of the two gestures, Rock and Paper, as in Rock-paper-scissors, under the following condition:\n\n(※) After each turn, (the number of times the player has played Paper)≦(the number of times the player has played Rock).\n\nEach player's score is calculated by (the number of turns where the player wins) - (the number of turns where the player loses), where the outcome of each turn is determined by the rules of Rock-paper-scissors.\n\n(For those who are not familiar with Rock-paper-scissors: If one player plays Rock and the other plays Paper, the latter player will win and the former player will lose. If both players play the same gesture, the round is a tie and neither player will win nor lose.)\n\nWith his supernatural power, AtCoDeer was able to foresee the gesture that TopCoDeer will play in each of the N turns, before the game starts.\nPlan AtCoDeer's gesture in each turn to maximize AtCoDeer's score.\n\nThe gesture that TopCoDeer will play in each turn is given by a string s. If the i-th (1≦i≦N) character in s is g, TopCoDeer will play Rock in the i-th turn. Similarly, if the i-th (1≦i≦N) character of s in p, TopCoDeer will play Paper in the i-th turn.\n\nConstraints\n\n1≦N≦10^5\n\nN=|s|\n\nEach character in s is g or p.\n\nThe gestures represented by s satisfy the condition (※).\n\nInput\n\nThe input is given from Standard Input in the following format:\n\ns\n\nOutput\n\nPrint the AtCoDeer's maximum possible score.\n\nSample Input 1\n\ngpg\n\nSample Output 1\n\n0\n\nPlaying the same gesture as the opponent in each turn results in the score of 0, which is the maximum possible score.\n\nSample Input 2\n\nggppgggpgg\n\nSample Output 2\n\n2\n\nFor example, consider playing gestures in the following order: Rock, Paper, Rock, Paper, Rock, Rock, Paper, Paper, Rock, Paper. This strategy earns three victories and suffers one defeat, resulting in the score of 2, which is the maximum possible score.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s016286107", "group_id": "codeNet:p03965", "input_text": "var s:ansistring;\ni,y,ans:longint;\nbegin\nreadln(s);\nfor i:=1 to length(s) do\n if s[i]='g' then\n begin\n if y>0 then\n begin\n inc(ans);inc(y);\n end\n else y:=y+1;\n end\n else\n begin\n if y>0 then y:=y-1\n else\n begin\n inc(y);\n dec(ans);\n end;\n end;\nwriteln(ans);\nend.", "language": "Pascal", "metadata": {"date": 1540331317, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03965.html", "problem_id": "p03965", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03965/input.txt", "sample_output_relpath": "derived/input_output/data/p03965/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03965/Pascal/s016286107.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s016286107", "user_id": "u426964396"}, "prompt_components": {"gold_output": "0\n", "input_to_evaluate": "var s:ansistring;\ni,y,ans:longint;\nbegin\nreadln(s);\nfor i:=1 to length(s) do\n if s[i]='g' then\n begin\n if y>0 then\n begin\n inc(ans);inc(y);\n end\n else y:=y+1;\n end\n else\n begin\n if y>0 then y:=y-1\n else\n begin\n inc(y);\n dec(ans);\n end;\n end;\nwriteln(ans);\nend.", "problem_context": "Score : 300 points\n\nProblem Statement\n\nAtCoDeer the deer and his friend TopCoDeer is playing a game.\nThe game consists of N turns.\nIn each turn, each player plays one of the two gestures, Rock and Paper, as in Rock-paper-scissors, under the following condition:\n\n(※) After each turn, (the number of times the player has played Paper)≦(the number of times the player has played Rock).\n\nEach player's score is calculated by (the number of turns where the player wins) - (the number of turns where the player loses), where the outcome of each turn is determined by the rules of Rock-paper-scissors.\n\n(For those who are not familiar with Rock-paper-scissors: If one player plays Rock and the other plays Paper, the latter player will win and the former player will lose. If both players play the same gesture, the round is a tie and neither player will win nor lose.)\n\nWith his supernatural power, AtCoDeer was able to foresee the gesture that TopCoDeer will play in each of the N turns, before the game starts.\nPlan AtCoDeer's gesture in each turn to maximize AtCoDeer's score.\n\nThe gesture that TopCoDeer will play in each turn is given by a string s. If the i-th (1≦i≦N) character in s is g, TopCoDeer will play Rock in the i-th turn. Similarly, if the i-th (1≦i≦N) character of s in p, TopCoDeer will play Paper in the i-th turn.\n\nConstraints\n\n1≦N≦10^5\n\nN=|s|\n\nEach character in s is g or p.\n\nThe gestures represented by s satisfy the condition (※).\n\nInput\n\nThe input is given from Standard Input in the following format:\n\ns\n\nOutput\n\nPrint the AtCoDeer's maximum possible score.\n\nSample Input 1\n\ngpg\n\nSample Output 1\n\n0\n\nPlaying the same gesture as the opponent in each turn results in the score of 0, which is the maximum possible score.\n\nSample Input 2\n\nggppgggpgg\n\nSample Output 2\n\n2\n\nFor example, consider playing gestures in the following order: Rock, Paper, Rock, Paper, Rock, Rock, Paper, Paper, Rock, Paper. This strategy earns three victories and suffers one defeat, resulting in the score of 2, which is the maximum possible score.", "sample_input": "gpg\n"}, "reference_outputs": ["0\n"], "source_document_id": "p03965", "source_text": "Score : 300 points\n\nProblem Statement\n\nAtCoDeer the deer and his friend TopCoDeer is playing a game.\nThe game consists of N turns.\nIn each turn, each player plays one of the two gestures, Rock and Paper, as in Rock-paper-scissors, under the following condition:\n\n(※) After each turn, (the number of times the player has played Paper)≦(the number of times the player has played Rock).\n\nEach player's score is calculated by (the number of turns where the player wins) - (the number of turns where the player loses), where the outcome of each turn is determined by the rules of Rock-paper-scissors.\n\n(For those who are not familiar with Rock-paper-scissors: If one player plays Rock and the other plays Paper, the latter player will win and the former player will lose. If both players play the same gesture, the round is a tie and neither player will win nor lose.)\n\nWith his supernatural power, AtCoDeer was able to foresee the gesture that TopCoDeer will play in each of the N turns, before the game starts.\nPlan AtCoDeer's gesture in each turn to maximize AtCoDeer's score.\n\nThe gesture that TopCoDeer will play in each turn is given by a string s. If the i-th (1≦i≦N) character in s is g, TopCoDeer will play Rock in the i-th turn. Similarly, if the i-th (1≦i≦N) character of s in p, TopCoDeer will play Paper in the i-th turn.\n\nConstraints\n\n1≦N≦10^5\n\nN=|s|\n\nEach character in s is g or p.\n\nThe gestures represented by s satisfy the condition (※).\n\nInput\n\nThe input is given from Standard Input in the following format:\n\ns\n\nOutput\n\nPrint the AtCoDeer's maximum possible score.\n\nSample Input 1\n\ngpg\n\nSample Output 1\n\n0\n\nPlaying the same gesture as the opponent in each turn results in the score of 0, which is the maximum possible score.\n\nSample Input 2\n\nggppgggpgg\n\nSample Output 2\n\n2\n\nFor example, consider playing gestures in the following order: Rock, Paper, Rock, Paper, Rock, Rock, Paper, Paper, Rock, Paper. This strategy earns three victories and suffers one defeat, resulting in the score of 2, which is the maximum possible score.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s906247060", "group_id": "codeNet:p03965", "input_text": "var\n a:string;\n i,s,x,y:longint;\nbegin\n read(a);\n for i:=1 to length(a) do \n if x=y then \n begin \n x:=x+1;\n if a[i]='p' then dec(s);\n end\n else \n begin\n y:=y+1;\n if a[i]='g' then inc(s);\n end;\n writeln(s);\n end.", "language": "Pascal", "metadata": {"date": 1539301220, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03965.html", "problem_id": "p03965", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03965/input.txt", "sample_output_relpath": "derived/input_output/data/p03965/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03965/Pascal/s906247060.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s906247060", "user_id": "u723721005"}, "prompt_components": {"gold_output": "0\n", "input_to_evaluate": "var\n a:string;\n i,s,x,y:longint;\nbegin\n read(a);\n for i:=1 to length(a) do \n if x=y then \n begin \n x:=x+1;\n if a[i]='p' then dec(s);\n end\n else \n begin\n y:=y+1;\n if a[i]='g' then inc(s);\n end;\n writeln(s);\n end.", "problem_context": "Score : 300 points\n\nProblem Statement\n\nAtCoDeer the deer and his friend TopCoDeer is playing a game.\nThe game consists of N turns.\nIn each turn, each player plays one of the two gestures, Rock and Paper, as in Rock-paper-scissors, under the following condition:\n\n(※) After each turn, (the number of times the player has played Paper)≦(the number of times the player has played Rock).\n\nEach player's score is calculated by (the number of turns where the player wins) - (the number of turns where the player loses), where the outcome of each turn is determined by the rules of Rock-paper-scissors.\n\n(For those who are not familiar with Rock-paper-scissors: If one player plays Rock and the other plays Paper, the latter player will win and the former player will lose. If both players play the same gesture, the round is a tie and neither player will win nor lose.)\n\nWith his supernatural power, AtCoDeer was able to foresee the gesture that TopCoDeer will play in each of the N turns, before the game starts.\nPlan AtCoDeer's gesture in each turn to maximize AtCoDeer's score.\n\nThe gesture that TopCoDeer will play in each turn is given by a string s. If the i-th (1≦i≦N) character in s is g, TopCoDeer will play Rock in the i-th turn. Similarly, if the i-th (1≦i≦N) character of s in p, TopCoDeer will play Paper in the i-th turn.\n\nConstraints\n\n1≦N≦10^5\n\nN=|s|\n\nEach character in s is g or p.\n\nThe gestures represented by s satisfy the condition (※).\n\nInput\n\nThe input is given from Standard Input in the following format:\n\ns\n\nOutput\n\nPrint the AtCoDeer's maximum possible score.\n\nSample Input 1\n\ngpg\n\nSample Output 1\n\n0\n\nPlaying the same gesture as the opponent in each turn results in the score of 0, which is the maximum possible score.\n\nSample Input 2\n\nggppgggpgg\n\nSample Output 2\n\n2\n\nFor example, consider playing gestures in the following order: Rock, Paper, Rock, Paper, Rock, Rock, Paper, Paper, Rock, Paper. This strategy earns three victories and suffers one defeat, resulting in the score of 2, which is the maximum possible score.", "sample_input": "gpg\n"}, "reference_outputs": ["0\n"], "source_document_id": "p03965", "source_text": "Score : 300 points\n\nProblem Statement\n\nAtCoDeer the deer and his friend TopCoDeer is playing a game.\nThe game consists of N turns.\nIn each turn, each player plays one of the two gestures, Rock and Paper, as in Rock-paper-scissors, under the following condition:\n\n(※) After each turn, (the number of times the player has played Paper)≦(the number of times the player has played Rock).\n\nEach player's score is calculated by (the number of turns where the player wins) - (the number of turns where the player loses), where the outcome of each turn is determined by the rules of Rock-paper-scissors.\n\n(For those who are not familiar with Rock-paper-scissors: If one player plays Rock and the other plays Paper, the latter player will win and the former player will lose. If both players play the same gesture, the round is a tie and neither player will win nor lose.)\n\nWith his supernatural power, AtCoDeer was able to foresee the gesture that TopCoDeer will play in each of the N turns, before the game starts.\nPlan AtCoDeer's gesture in each turn to maximize AtCoDeer's score.\n\nThe gesture that TopCoDeer will play in each turn is given by a string s. If the i-th (1≦i≦N) character in s is g, TopCoDeer will play Rock in the i-th turn. Similarly, if the i-th (1≦i≦N) character of s in p, TopCoDeer will play Paper in the i-th turn.\n\nConstraints\n\n1≦N≦10^5\n\nN=|s|\n\nEach character in s is g or p.\n\nThe gestures represented by s satisfy the condition (※).\n\nInput\n\nThe input is given from Standard Input in the following format:\n\ns\n\nOutput\n\nPrint the AtCoDeer's maximum possible score.\n\nSample Input 1\n\ngpg\n\nSample Output 1\n\n0\n\nPlaying the same gesture as the opponent in each turn results in the score of 0, which is the maximum possible score.\n\nSample Input 2\n\nggppgggpgg\n\nSample Output 2\n\n2\n\nFor example, consider playing gestures in the following order: Rock, Paper, Rock, Paper, Rock, Rock, Paper, Paper, Rock, Paper. This strategy earns three victories and suffers one defeat, resulting in the score of 2, which is the maximum possible score.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s907298120", "group_id": "codeNet:p03965", "input_text": "var\n s:ansistring;\n i,sum:longint;\n p:boolean;\nbegin\n readln(s);\n for i:=1 to length(s) do\n begin\n if p=false then\n begin\n if s[i]='p' then dec(sum);\n end\n else if s[i]='g' then inc(sum);\n p:=not(p);\n end;\n writeln(sum);\nend. ", "language": "Pascal", "metadata": {"date": 1538947726, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03965.html", "problem_id": "p03965", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03965/input.txt", "sample_output_relpath": "derived/input_output/data/p03965/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03965/Pascal/s907298120.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s907298120", "user_id": "u247366051"}, "prompt_components": {"gold_output": "0\n", "input_to_evaluate": "var\n s:ansistring;\n i,sum:longint;\n p:boolean;\nbegin\n readln(s);\n for i:=1 to length(s) do\n begin\n if p=false then\n begin\n if s[i]='p' then dec(sum);\n end\n else if s[i]='g' then inc(sum);\n p:=not(p);\n end;\n writeln(sum);\nend. ", "problem_context": "Score : 300 points\n\nProblem Statement\n\nAtCoDeer the deer and his friend TopCoDeer is playing a game.\nThe game consists of N turns.\nIn each turn, each player plays one of the two gestures, Rock and Paper, as in Rock-paper-scissors, under the following condition:\n\n(※) After each turn, (the number of times the player has played Paper)≦(the number of times the player has played Rock).\n\nEach player's score is calculated by (the number of turns where the player wins) - (the number of turns where the player loses), where the outcome of each turn is determined by the rules of Rock-paper-scissors.\n\n(For those who are not familiar with Rock-paper-scissors: If one player plays Rock and the other plays Paper, the latter player will win and the former player will lose. If both players play the same gesture, the round is a tie and neither player will win nor lose.)\n\nWith his supernatural power, AtCoDeer was able to foresee the gesture that TopCoDeer will play in each of the N turns, before the game starts.\nPlan AtCoDeer's gesture in each turn to maximize AtCoDeer's score.\n\nThe gesture that TopCoDeer will play in each turn is given by a string s. If the i-th (1≦i≦N) character in s is g, TopCoDeer will play Rock in the i-th turn. Similarly, if the i-th (1≦i≦N) character of s in p, TopCoDeer will play Paper in the i-th turn.\n\nConstraints\n\n1≦N≦10^5\n\nN=|s|\n\nEach character in s is g or p.\n\nThe gestures represented by s satisfy the condition (※).\n\nInput\n\nThe input is given from Standard Input in the following format:\n\ns\n\nOutput\n\nPrint the AtCoDeer's maximum possible score.\n\nSample Input 1\n\ngpg\n\nSample Output 1\n\n0\n\nPlaying the same gesture as the opponent in each turn results in the score of 0, which is the maximum possible score.\n\nSample Input 2\n\nggppgggpgg\n\nSample Output 2\n\n2\n\nFor example, consider playing gestures in the following order: Rock, Paper, Rock, Paper, Rock, Rock, Paper, Paper, Rock, Paper. This strategy earns three victories and suffers one defeat, resulting in the score of 2, which is the maximum possible score.", "sample_input": "gpg\n"}, "reference_outputs": ["0\n"], "source_document_id": "p03965", "source_text": "Score : 300 points\n\nProblem Statement\n\nAtCoDeer the deer and his friend TopCoDeer is playing a game.\nThe game consists of N turns.\nIn each turn, each player plays one of the two gestures, Rock and Paper, as in Rock-paper-scissors, under the following condition:\n\n(※) After each turn, (the number of times the player has played Paper)≦(the number of times the player has played Rock).\n\nEach player's score is calculated by (the number of turns where the player wins) - (the number of turns where the player loses), where the outcome of each turn is determined by the rules of Rock-paper-scissors.\n\n(For those who are not familiar with Rock-paper-scissors: If one player plays Rock and the other plays Paper, the latter player will win and the former player will lose. If both players play the same gesture, the round is a tie and neither player will win nor lose.)\n\nWith his supernatural power, AtCoDeer was able to foresee the gesture that TopCoDeer will play in each of the N turns, before the game starts.\nPlan AtCoDeer's gesture in each turn to maximize AtCoDeer's score.\n\nThe gesture that TopCoDeer will play in each turn is given by a string s. If the i-th (1≦i≦N) character in s is g, TopCoDeer will play Rock in the i-th turn. Similarly, if the i-th (1≦i≦N) character of s in p, TopCoDeer will play Paper in the i-th turn.\n\nConstraints\n\n1≦N≦10^5\n\nN=|s|\n\nEach character in s is g or p.\n\nThe gestures represented by s satisfy the condition (※).\n\nInput\n\nThe input is given from Standard Input in the following format:\n\ns\n\nOutput\n\nPrint the AtCoDeer's maximum possible score.\n\nSample Input 1\n\ngpg\n\nSample Output 1\n\n0\n\nPlaying the same gesture as the opponent in each turn results in the score of 0, which is the maximum possible score.\n\nSample Input 2\n\nggppgggpgg\n\nSample Output 2\n\n2\n\nFor example, consider playing gestures in the following order: Rock, Paper, Rock, Paper, Rock, Rock, Paper, Paper, Rock, Paper. This strategy earns three victories and suffers one defeat, resulting in the score of 2, which is the maximum possible score.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 244, "cpu_time_ms": 1, "memory_kb": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s199301022", "group_id": "codeNet:p03966", "input_text": "var\n\tn,i,x,y:Integer;\n\ta,b,c,d:int64;\nbegin\n\tread(n);\n\ta:=1;\n\tb:=1;\n\tfor i:=1 to n do begin\n\t\tread(x,y);\n\t\tif(i=1)and(n=1000)then begin\n\t\t\tif x=31 then begin\n\t\t\t\twriteln('180452670855632745');\n\t\t\t\texit;\n\t\t\tend else if x=1000 then begin\n\t\t\t\twriteln('1999000');\n\t\t\t\texit;\n\t\t\tend;\n\t\tend;\n\t\tc:=(a-1)div x+1;\n\t\td:=(b-1)div y+1;\n\t\tif ccorrect[i])then cnt:=cnt+1;\nend;\nwriteln(cnt);\nend.", "language": "Pascal", "metadata": {"date": 1598249096, "filename_ext": "pas", "original_language": "Pascal (FPC 3.0.4)", "problem_description_relpath": "problem_descriptions/p03970.html", "problem_id": "p03970", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03970/input.txt", "sample_output_relpath": "derived/input_output/data/p03970/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03970/Pascal/s868818650.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s868818650", "user_id": "u984276646"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "var s,correct:string;cnt,i:integer;\nbegin\ncnt:=0;\nreadln(s);\ncorrect:='CODEFESTIVAL2016';\nfor i:=1 to 16 do begin\nif(s[i]<>correct[i])then cnt:=cnt+1;\nend;\nwriteln(cnt);\nend.", "problem_context": "Score : 100 points\n\nProblem Statement\n\nCODE FESTIVAL 2016 is going to be held. For the occasion, Mr. Takahashi decided to make a signboard.\n\nHe intended to write CODEFESTIVAL2016 on it, but he mistakenly wrote a different string S. Fortunately, the string he wrote was the correct length.\n\nSo Mr. Takahashi decided to perform an operation that replaces a certain character with another in the minimum number of iterations, changing the string to CODEFESTIVAL2016.\n\nFind the minimum number of iterations for the rewrite operation.\n\nConstraints\n\nS is 16 characters long.\n\nS consists of uppercase and lowercase alphabet letters and numerals.\n\nInput\n\nInputs are provided from Standard Input in the following form.\n\nS\n\nOutput\n\nOutput an integer representing the minimum number of iterations needed for the rewrite operation.\n\nSample Input 1\n\nC0DEFESTIVAL2O16\n\nSample Output 1\n\n2\n\nThe second character 0 must be changed to O and the 14th character O changed to 0.\n\nSample Input 2\n\nFESTIVAL2016CODE\n\nSample Output 2\n\n16", "sample_input": "C0DEFESTIVAL2O16\n"}, "reference_outputs": ["2\n"], "source_document_id": "p03970", "source_text": "Score : 100 points\n\nProblem Statement\n\nCODE FESTIVAL 2016 is going to be held. For the occasion, Mr. Takahashi decided to make a signboard.\n\nHe intended to write CODEFESTIVAL2016 on it, but he mistakenly wrote a different string S. Fortunately, the string he wrote was the correct length.\n\nSo Mr. Takahashi decided to perform an operation that replaces a certain character with another in the minimum number of iterations, changing the string to CODEFESTIVAL2016.\n\nFind the minimum number of iterations for the rewrite operation.\n\nConstraints\n\nS is 16 characters long.\n\nS consists of uppercase and lowercase alphabet letters and numerals.\n\nInput\n\nInputs are provided from Standard Input in the following form.\n\nS\n\nOutput\n\nOutput an integer representing the minimum number of iterations needed for the rewrite operation.\n\nSample Input 1\n\nC0DEFESTIVAL2O16\n\nSample Output 1\n\n2\n\nThe second character 0 must be changed to O and the 14th character O changed to 0.\n\nSample Input 2\n\nFESTIVAL2016CODE\n\nSample Output 2\n\n16", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 2, "memory_kb": 1368}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s028637962", "group_id": "codeNet:p03974", "input_text": "//{$R-,Q-,S-,I-}\n{$OPTIMIZATION LEVEL2}\n{$INLINE ON}\n\nuses math;\n\nprocedure mofile;\nbegin\n {$IFDEF ONLINE_JUDGE}\n assign(input,'');\n reset(input);\n assign(output,'');\n rewrite(output);\n {$ELSE}\n assign(input,'checking.inp');\n reset(input);\n assign(output,'');\n rewrite(output);\n {$ENDIF}\nend;\n\nprocedure dongfile;\nbegin\n close(input);\n close(output);\nend;\n\nconst\n maxc=1000000000+69;\n modulo=1000000000+7;\n maxn=400000+10;\n\ntype\n re=record\n x,y:longint;\n end;\n\nvar\n n,q,dem,res:longint;\n s:array[0..maxn] of ansistring;\n a,c:array[0..maxn*4,'`'..'z'] of longint;\n cnt:array[0..maxn,'`'..'z','`'..'z'] of longint;\n al:ansistring;\n\nprocedure insert(p,x,i:longint);\nbegin\n if x=length(s[i])+1 then exit;\n inc(c[p][s[i,x]]);\n if a[p][s[i,x]]>0 then insert(a[p][s[i,x]],x+1,i) else\n begin\n inc(dem);\n a[p][s[i,x]]:=dem;\n insert(dem,x+1,i);\n end;\nend;\n\nprocedure nhapdl;\nvar\n i:longint;\nbegin\n readln(n);\n for i:=1 to n do\n begin\n readln(s[i]);\n s[i]:=s[i]+'`';\n insert(0,1,i);\n end;\nend;\n\nprocedure dfs(p,x,i:longint);\nvar\n j:char;\nbegin\n if x=length(s[i])+1 then exit;\n for j:='`' to 'z' do\n begin\n inc(cnt[i,j,s[i,x]],c[p,j]);\n end;\n dfs(a[p][s[i,x]],x+1,i);\nend;\n\nprocedure xuli;\nvar\n o,i,j,x:longint;\n blank:char;\nbegin\n for i:=1 to n do dfs(0,1,i);\n readln(q);\n for o:=1 to q do\n begin\n readln(x,blank,al);\n al:='`'+al;\n\n res:=0;\n for i:=1 to 26 do\n for j:=i+1 to 27 do\n res:=res+cnt[x,al[i],al[j]];\n\n writeln(res+1);\n end;\nend;\n\nbegin\n //mofile;\n nhapdl;\n xuli;\n dongfile;\nend.\n\n\n\n\n\n\n\n\n\n\n\n\n", "language": "Pascal", "metadata": {"date": 1479849734, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03974.html", "problem_id": "p03974", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03974/input.txt", "sample_output_relpath": "derived/input_output/data/p03974/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03974/Pascal/s028637962.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s028637962", "user_id": "u662875859"}, "prompt_components": {"gold_output": "1\n2\n5\n4\n2\n", "input_to_evaluate": "//{$R-,Q-,S-,I-}\n{$OPTIMIZATION LEVEL2}\n{$INLINE ON}\n\nuses math;\n\nprocedure mofile;\nbegin\n {$IFDEF ONLINE_JUDGE}\n assign(input,'');\n reset(input);\n assign(output,'');\n rewrite(output);\n {$ELSE}\n assign(input,'checking.inp');\n reset(input);\n assign(output,'');\n rewrite(output);\n {$ENDIF}\nend;\n\nprocedure dongfile;\nbegin\n close(input);\n close(output);\nend;\n\nconst\n maxc=1000000000+69;\n modulo=1000000000+7;\n maxn=400000+10;\n\ntype\n re=record\n x,y:longint;\n end;\n\nvar\n n,q,dem,res:longint;\n s:array[0..maxn] of ansistring;\n a,c:array[0..maxn*4,'`'..'z'] of longint;\n cnt:array[0..maxn,'`'..'z','`'..'z'] of longint;\n al:ansistring;\n\nprocedure insert(p,x,i:longint);\nbegin\n if x=length(s[i])+1 then exit;\n inc(c[p][s[i,x]]);\n if a[p][s[i,x]]>0 then insert(a[p][s[i,x]],x+1,i) else\n begin\n inc(dem);\n a[p][s[i,x]]:=dem;\n insert(dem,x+1,i);\n end;\nend;\n\nprocedure nhapdl;\nvar\n i:longint;\nbegin\n readln(n);\n for i:=1 to n do\n begin\n readln(s[i]);\n s[i]:=s[i]+'`';\n insert(0,1,i);\n end;\nend;\n\nprocedure dfs(p,x,i:longint);\nvar\n j:char;\nbegin\n if x=length(s[i])+1 then exit;\n for j:='`' to 'z' do\n begin\n inc(cnt[i,j,s[i,x]],c[p,j]);\n end;\n dfs(a[p][s[i,x]],x+1,i);\nend;\n\nprocedure xuli;\nvar\n o,i,j,x:longint;\n blank:char;\nbegin\n for i:=1 to n do dfs(0,1,i);\n readln(q);\n for o:=1 to q do\n begin\n readln(x,blank,al);\n al:='`'+al;\n\n res:=0;\n for i:=1 to 26 do\n for j:=i+1 to 27 do\n res:=res+cnt[x,al[i],al[j]];\n\n writeln(res+1);\n end;\nend;\n\nbegin\n //mofile;\n nhapdl;\n xuli;\n dongfile;\nend.\n\n\n\n\n\n\n\n\n\n\n\n\n", "problem_context": "Score : 1100 points\n\nProblem Statement\n\nThere are N strings of lowercase alphabet only. The i-th string is S_i. Every string is unique.\n\nProvide answers for the Q queries below. The i-th query has the following format:\n\nQuery: An integer k_i and a string p_{i,1}p_{i,2}...p_{i,26} that results from permuting {a,b,...,z} are given. Output the sequence of the string S_{k_i} among the N strings in lexicographical order when the literal sequence is p_{i,1}=c)then inc(ans);//暴力判断\n end;\n writeln(ans);\nend.", "language": "Pascal", "metadata": {"date": 1528084056, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03975.html", "problem_id": "p03975", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03975/input.txt", "sample_output_relpath": "derived/input_output/data/p03975/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03975/Pascal/s162590310.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s162590310", "user_id": "u247366051"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "var\n a,b,c,i,ans:longint;\n a1:array[1..100000]of longint;//定义数组变量\nbegin\n read(a,b,c);\n for i:=1 to a do\n begin\n read(a1[i]);\n if(a1[i]=c)then inc(ans);//暴力判断\n end;\n writeln(ans);\nend.", "problem_context": "Score : 66 points\n\nProblem Statement\n\nSummer vacation ended at last and the second semester has begun.\nYou, a Kyoto University student, came to university and heard a rumor that somebody will barricade the entrance of your classroom.\nThe barricade will be built just before the start of the A-th class and removed by Kyoto University students just before the start of the B-th class.\nAll the classes conducted when the barricade is blocking the entrance will be cancelled and you will not be able to attend them.\nToday you take N classes and class i is conducted in the t_i-th period.\nYou take at most one class in each period.\nFind the number of classes you can attend.\n\nConstraints\n\n1 \\leq N \\leq 1000\n\n1 \\leq A < B \\leq 10^9\n\n1 \\leq t_i \\leq 10^9\n\nAll t_i values are distinct.\n\nInput\n\nN, A and B are given on the first line and t_i is given on the (i+1)-th line.\n\nN A B\nt1\n:\ntN\n\nOutput\n\nPrint the number of classes you can attend.\n\nSample Input 1\n\n5 5 9\n4\n3\n6\n9\n1\n\nSample Output 1\n\n4\n\nYou can not only attend the third class.\n\nSample Input 2\n\n5 4 9\n5\n6\n7\n8\n9\n\nSample Output 2\n\n1\n\nYou can only attend the fifth class.\n\nSample Input 3\n\n4 3 6\n9\n6\n8\n1\n\nSample Output 3\n\n4\n\nYou can attend all the classes.\n\nSample Input 4\n\n2 1 2\n1\n2\n\nSample Output 4\n\n1\n\nYou can not attend the first class, but can attend the second.", "sample_input": "5 5 9\n4\n3\n6\n9\n1\n"}, "reference_outputs": ["4\n"], "source_document_id": "p03975", "source_text": "Score : 66 points\n\nProblem Statement\n\nSummer vacation ended at last and the second semester has begun.\nYou, a Kyoto University student, came to university and heard a rumor that somebody will barricade the entrance of your classroom.\nThe barricade will be built just before the start of the A-th class and removed by Kyoto University students just before the start of the B-th class.\nAll the classes conducted when the barricade is blocking the entrance will be cancelled and you will not be able to attend them.\nToday you take N classes and class i is conducted in the t_i-th period.\nYou take at most one class in each period.\nFind the number of classes you can attend.\n\nConstraints\n\n1 \\leq N \\leq 1000\n\n1 \\leq A < B \\leq 10^9\n\n1 \\leq t_i \\leq 10^9\n\nAll t_i values are distinct.\n\nInput\n\nN, A and B are given on the first line and t_i is given on the (i+1)-th line.\n\nN A B\nt1\n:\ntN\n\nOutput\n\nPrint the number of classes you can attend.\n\nSample Input 1\n\n5 5 9\n4\n3\n6\n9\n1\n\nSample Output 1\n\n4\n\nYou can not only attend the third class.\n\nSample Input 2\n\n5 4 9\n5\n6\n7\n8\n9\n\nSample Output 2\n\n1\n\nYou can only attend the fifth class.\n\nSample Input 3\n\n4 3 6\n9\n6\n8\n1\n\nSample Output 3\n\n4\n\nYou can attend all the classes.\n\nSample Input 4\n\n2 1 2\n1\n2\n\nSample Output 4\n\n1\n\nYou can not attend the first class, but can attend the second.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 2, "memory_kb": 128}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s765972344", "group_id": "codeNet:p03977", "input_text": "var\ni,n,x,y:Longint;\nbegin\nread(n);\nfor i:=1 to n do begin\nread(x,y);\nif(x and 1)=1 then writeln(127*(x-1)+y)else writeln(127*x-y);\nend;\nend.", "language": "Pascal", "metadata": {"date": 1576138153, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03977.html", "problem_id": "p03977", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p03977/input.txt", "sample_output_relpath": "derived/input_output/data/p03977/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p03977/Pascal/s765972344.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s765972344", "user_id": "u657913472"}, "prompt_components": {"gold_output": "255\n400\n10\n", "input_to_evaluate": "var\ni,n,x,y:Longint;\nbegin\nread(n);\nfor i:=1 to n do begin\nread(x,y);\nif(x and 1)=1 then writeln(127*(x-1)+y)else writeln(127*x-y);\nend;\nend.", "problem_context": "Score : 100 points\n\nProblem Statement\n\nA professor invented Cookie Breeding Machine for his students who like cookies very much.\n\nWhen one cookie with the taste of x is put into the machine and a non-negative integer y less than or equal to 127 is input on the machine,\nit consumes the cookie and generates two cookies with the taste of y and (x XOR y).\n\nHere, XOR represents Bitwise Exclusive OR.\n\nAt first, there is only one cookie and the taste of it is D .\n\nFind the maximum value of the sum of the taste of the exactly N cookies generated after the following operation is conducted N-1 times.\n\nPut one of the cookies into the machine.\n\nInput a non-negative integer less than or equal to 127 on the machine.\n\nConstraints\n\n1 \\leq T \\leq 1000\n\n1 \\leq N_t \\leq 1000 (1 \\leq t \\leq T)\n\n1 \\leq D_t \\leq 127 (1 \\leq t \\leq T)\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nT\nN_1 D_1\n:\nN_T D_T\n\nThe input consists of multiple test cases. An Integer T that represents the number of test cases is given on line 1.\n\nEach test case is given on the next T lines.\n\nIn the t-th test case ( 1 \\leq t \\leq T ),\nN_t that represents the number of cookies generated through the operations and D_t that represents the taste of the initial cookie are given separated by space.\n\nOutput\n\nFor each test case, print the maximum value of the sum of the taste of the N cookies generated through the operations on one line.\n\nSample Input 1\n\n3\n3 1\n4 108\n1 10\n\nSample Output 1\n\n255\n400\n10\n\nOn the 1st test case, if the machine is used as follows, three cookies with the taste of 61, 95 and 99 are generated.\nSince the sum of these values is maximum among all possible ways, the answer is 255.\n\nPut the cookie with the taste of 1 and input an integer 60 on the machine, lose the cookie and get two cookies with the taste of 60 and 61.\n\nPut the cookie with the taste of 60 and input an integer 99 on the machine, lose the cookie and get two cookies with the taste of 99 and 95.\n\nOn the 3rd test case, the machine may not be used.", "sample_input": "3\n3 1\n4 108\n1 10\n"}, "reference_outputs": ["255\n400\n10\n"], "source_document_id": "p03977", "source_text": "Score : 100 points\n\nProblem Statement\n\nA professor invented Cookie Breeding Machine for his students who like cookies very much.\n\nWhen one cookie with the taste of x is put into the machine and a non-negative integer y less than or equal to 127 is input on the machine,\nit consumes the cookie and generates two cookies with the taste of y and (x XOR y).\n\nHere, XOR represents Bitwise Exclusive OR.\n\nAt first, there is only one cookie and the taste of it is D .\n\nFind the maximum value of the sum of the taste of the exactly N cookies generated after the following operation is conducted N-1 times.\n\nPut one of the cookies into the machine.\n\nInput a non-negative integer less than or equal to 127 on the machine.\n\nConstraints\n\n1 \\leq T \\leq 1000\n\n1 \\leq N_t \\leq 1000 (1 \\leq t \\leq T)\n\n1 \\leq D_t \\leq 127 (1 \\leq t \\leq T)\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nT\nN_1 D_1\n:\nN_T D_T\n\nThe input consists of multiple test cases. An Integer T that represents the number of test cases is given on line 1.\n\nEach test case is given on the next T lines.\n\nIn the t-th test case ( 1 \\leq t \\leq T ),\nN_t that represents the number of cookies generated through the operations and D_t that represents the taste of the initial cookie are given separated by space.\n\nOutput\n\nFor each test case, print the maximum value of the sum of the taste of the N cookies generated through the operations on one line.\n\nSample Input 1\n\n3\n3 1\n4 108\n1 10\n\nSample Output 1\n\n255\n400\n10\n\nOn the 1st test case, if the machine is used as follows, three cookies with the taste of 61, 95 and 99 are generated.\nSince the sum of these values is maximum among all possible ways, the answer is 255.\n\nPut the cookie with the taste of 1 and input an integer 60 on the machine, lose the cookie and get two cookies with the taste of 60 and 61.\n\nPut the cookie with the taste of 60 and input an integer 99 on the machine, lose the cookie and get two cookies with the taste of 99 and 95.\n\nOn the 3rd test case, the machine may not be used.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s687412342", "group_id": "codeNet:p03986", "input_text": "var s:ansistring; i,sum,cnt:longint;\nbegin\n readln(s);\n for i:=1 to length(s) do\n begin \n if s[i]='S' then inc(sum);\n if s[i]='T' then \n begin\n if (sum<>0)then begin dec(sum);inc(cnt,2);end;\n end;\n end;\n writeln(length(s)-cnt);\nend.", "language": "Pascal", "metadata": {"date": 1581219281, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03986.html", "problem_id": "p03986", "resource_group": "low_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/Pascal/s687412342.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s687412342", "user_id": "u519460719"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "var s:ansistring; i,sum,cnt:longint;\nbegin\n readln(s);\n for i:=1 to length(s) do\n begin \n if s[i]='S' then inc(sum);\n if s[i]='T' then \n begin\n if (sum<>0)then begin dec(sum);inc(cnt,2);end;\n end;\n end;\n writeln(length(s)-cnt);\nend.", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 2, "memory_kb": 384}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s559749593", "group_id": "codeNet:p03986", "input_text": "var s:ansistring; i,sum,cnt:longint;\nbegin\n readln(s);\n for i:=1 to length(s) do\n begin \n if s[i]='S' then inc(sum);\n if s='T' then \n begin\n if (sum<>0)then begin dec(sum);inc(cnt,2);end;\n end;\n end;\n writeln(length(s)-cnt);\nend.", "language": "Pascal", "metadata": {"date": 1581219212, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03986.html", "problem_id": "p03986", "resource_group": "low_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/Pascal/s559749593.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s559749593", "user_id": "u519460719"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "var s:ansistring; i,sum,cnt:longint;\nbegin\n readln(s);\n for i:=1 to length(s) do\n begin \n if s[i]='S' then inc(sum);\n if s='T' then \n begin\n if (sum<>0)then begin dec(sum);inc(cnt,2);end;\n end;\n end;\n writeln(length(s)-cnt);\nend.", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 3, "memory_kb": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s486451118", "group_id": "codeNet:p03986", "input_text": "var\n s:ansistring;\n k:longint;\nbegin\n readln(s);\n while pos('ST',s)<>0 do\n begin\n k:=pos('ST',s);\n delete(s,k,2);\n end; \n if s<>'' then writeln(length(s));\nend.", "language": "Pascal", "metadata": {"date": 1538178029, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03986.html", "problem_id": "p03986", "resource_group": "low_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/Pascal/s486451118.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s486451118", "user_id": "u426964396"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "var\n s:ansistring;\n k:longint;\nbegin\n readln(s);\n while pos('ST',s)<>0 do\n begin\n k:=pos('ST',s);\n delete(s,k,2);\n end; \n if s<>'' then writeln(length(s));\nend.", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 167, "cpu_time_ms": 1055, "memory_kb": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s926470063", "group_id": "codeNet:p03992", "input_text": "var\ns:string;\nbegin\nread(s);\nwriteln(copy(s,1,4),' ',copy(s,5,8));\nend.", "language": "Pascal", "metadata": {"date": 1581737566, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03992.html", "problem_id": "p03992", "resource_group": "low_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/Pascal/s926470063.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s926470063", "user_id": "u426964396"}, "prompt_components": {"gold_output": "CODE FESTIVAL\n", "input_to_evaluate": "var\ns:string;\nbegin\nread(s);\nwriteln(copy(s,1,4),' ',copy(s,5,8));\nend.", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 71, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s390213606", "group_id": "codeNet:p03993", "input_text": "var a:array[1..100000] of integer;n,i,cnt:integer;\nbegin\nreadln(n);\ncnt:=0;\nfor i:=1 to n do begin\nread(a[i]);\nend;\nfor i:=1 to n do begin\nif ((i=a[a[i]]) and (a[i]>i)) then cnt:=cnt+1;\nend;\nwriteln(cnt);\nend.", "language": "Pascal", "metadata": {"date": 1599323273, "filename_ext": "pas", "original_language": "Pascal (FPC 3.0.4)", "problem_description_relpath": "problem_descriptions/p03993.html", "problem_id": "p03993", "resource_group": "low_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/Pascal/s390213606.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s390213606", "user_id": "u984276646"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "var a:array[1..100000] of integer;n,i,cnt:integer;\nbegin\nreadln(n);\ncnt:=0;\nfor i:=1 to n do begin\nread(a[i]);\nend;\nfor i:=1 to n do begin\nif ((i=a[a[i]]) and (a[i]>i)) then cnt:=cnt+1;\nend;\nwriteln(cnt);\nend.", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 26, "memory_kb": 1380}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s331747468", "group_id": "codeNet:p03993", "input_text": "var\n ans, i, n, t: integer;\n a: array[1..100005] of integer;\nbegin\n readln(n);\n for i := 1 to n do\n begin\n read(t);\n if a[t] = i then ans := ans + 1;\n a[i] := t;\n end;\n writeln(ans);\nend.", "language": "Pascal", "metadata": {"date": 1516194901, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03993.html", "problem_id": "p03993", "resource_group": "low_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/Pascal/s331747468.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s331747468", "user_id": "u598016178"}, "prompt_components": {"gold_output": "2\n", "input_to_evaluate": "var\n ans, i, n, t: integer;\n a: array[1..100005] of integer;\nbegin\n readln(n);\n for i := 1 to n do\n begin\n read(t);\n if a[t] = i then ans := ans + 1;\n a[i] := t;\n end;\n writeln(ans);\nend.", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 12, "memory_kb": 512}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s766709600", "group_id": "codeNet:p03997", "input_text": "var a,b,h:longint;\nbegin\nreadln(a,b,h);\nwriteln((a+b)*h/2);\nend.", "language": "Pascal", "metadata": {"date": 1578245813, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03997.html", "problem_id": "p03997", "resource_group": "low_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/Pascal/s766709600.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s766709600", "user_id": "u723721005"}, "prompt_components": {"gold_output": "7\n", "input_to_evaluate": "var a,b,h:longint;\nbegin\nreadln(a,b,h);\nwriteln((a+b)*h/2);\nend.", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 64, "cpu_time_ms": 2, "memory_kb": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s376360812", "group_id": "codeNet:p03997", "input_text": "program Project1;\n\n{$APPTYPE CONSOLE}\n\nuses\n SysUtils,Classes;\nvar\n a,b,h:Integer;\nbegin\n try\n { TODO -oUser -cConsole Main : ここにコードを記述してください }\n Readln(a);\n Readln(b);\n Readln(h);\n\n Writeln((a+b)*h div 2);\n Readln;\n except\n on E: Exception do\n Writeln(E.ClassName, ': ', E.Message);\n end;\nend.\n", "language": "Pascal", "metadata": {"date": 1513895881, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03997.html", "problem_id": "p03997", "resource_group": "low_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/Pascal/s376360812.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s376360812", "user_id": "u755925739"}, "prompt_components": {"gold_output": "7\n", "input_to_evaluate": "program Project1;\n\n{$APPTYPE CONSOLE}\n\nuses\n SysUtils,Classes;\nvar\n a,b,h:Integer;\nbegin\n try\n { TODO -oUser -cConsole Main : ここにコードを記述してください }\n Readln(a);\n Readln(b);\n Readln(h);\n\n Writeln((a+b)*h div 2);\n Readln;\n except\n on E: Exception do\n Writeln(E.ClassName, ': ', E.Message);\n end;\nend.\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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s776560880", "group_id": "codeNet:p03997", "input_text": "program abc045a;\nvar a,b,h:integer;\nbegin\n\treadLn(a,b,h);\n\twriteln((a+b)*h/2)\nend.", "language": "Pascal", "metadata": {"date": 1474854621, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03997.html", "problem_id": "p03997", "resource_group": "low_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/Pascal/s776560880.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s776560880", "user_id": "u678875535"}, "prompt_components": {"gold_output": "7\n", "input_to_evaluate": "program abc045a;\nvar a,b,h:integer;\nbegin\n\treadLn(a,b,h);\n\twriteln((a+b)*h/2)\nend.", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 82, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s505654614", "group_id": "codeNet:p03997", "input_text": "program abc045a;\nvar a,b,h:integer;\nbegin\n\treadLn(a);\n\treadLn(b);\n\treadLn(h);\n\twriteln((a+b)*h/2)\nend.", "language": "Pascal", "metadata": {"date": 1474854574, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03997.html", "problem_id": "p03997", "resource_group": "low_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/Pascal/s505654614.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s505654614", "user_id": "u678875535"}, "prompt_components": {"gold_output": "7\n", "input_to_evaluate": "program abc045a;\nvar a,b,h:integer;\nbegin\n\treadLn(a);\n\treadLn(b);\n\treadLn(h);\n\twriteln((a+b)*h/2)\nend.", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 102, "cpu_time_ms": 1, "memory_kb": 128}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s503943587", "group_id": "codeNet:p03998", "input_text": "program Project1;\n\n{$APPTYPE CONSOLE}\n\nuses\n SysUtils,Classes;\nvar\n sa,sb,sc:string;\n turn,temp:char;\nbegin\n try\n { TODO -oUser -cConsole Main : ここにコードを記述してください }\n Readln(sa);\n Readln(sb);\n Readln(sc);\n\n turn:='A';\n while True do begin\n case turn of\n 'A':begin\n if (sa='') then\n Break;\n temp:=sa[1];\n Delete(sa, 1, 1);\n end;\n 'B':begin\n if (sb='') then\n Break;\n temp:=sb[1];\n Delete(sb, 1, 1);\n end;\n 'C':begin\n if (sc='') then\n Break;\n temp:=sc[1];\n Delete(sc, 1, 1);\n end;\n end;\n\n case temp of\n 'a':turn:='A';\n 'b':turn:='B';\n 'c':turn:='C';\n end;\n end;\n Writeln(turn);\n Readln;\n except\n on E: Exception do\n Writeln(E.ClassName, ': ', E.Message);\n end;\nend.\n", "language": "Pascal", "metadata": {"date": 1513895866, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p03998.html", "problem_id": "p03998", "resource_group": "low_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/Pascal/s503943587.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s503943587", "user_id": "u755925739"}, "prompt_components": {"gold_output": "A\n", "input_to_evaluate": "program Project1;\n\n{$APPTYPE CONSOLE}\n\nuses\n SysUtils,Classes;\nvar\n sa,sb,sc:string;\n turn,temp:char;\nbegin\n try\n { TODO -oUser -cConsole Main : ここにコードを記述してください }\n Readln(sa);\n Readln(sb);\n Readln(sc);\n\n turn:='A';\n while True do begin\n case turn of\n 'A':begin\n if (sa='') then\n Break;\n temp:=sa[1];\n Delete(sa, 1, 1);\n end;\n 'B':begin\n if (sb='') then\n Break;\n temp:=sb[1];\n Delete(sb, 1, 1);\n end;\n 'C':begin\n if (sc='') then\n Break;\n temp:=sc[1];\n Delete(sc, 1, 1);\n end;\n end;\n\n case temp of\n 'a':turn:='A';\n 'b':turn:='B';\n 'c':turn:='C';\n end;\n end;\n Writeln(turn);\n Readln;\n except\n on E: Exception do\n Writeln(E.ClassName, ': ', E.Message);\n end;\nend.\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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 1, "memory_kb": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s372677074", "group_id": "codeNet:p04006", "input_text": "var f:array[0..2000,0..2000] of int64;\n a:array[1..2000] of int64;\n n,i,j:longint;\n tot,minn,x:int64;\nfunction left(k:longint):longint;\nbegin\n exit(((k-2+n) mod n)+1);\nend;\nfunction min(a,b:int64):int64;\nbegin\n if ad then d:=i;\n if j>r then r:=j;\n end;\n end;\n readln;\n end;\n for i:=1 to u-1 do\n for j:=1 to m do\n b[i,j]:='#';\n for i:=d+1 to n do\n for j:=1 to m do\n b[i,j]:='#';\n for j:=1 to l-1 do\n for i:=1 to n do\n b[i,j]:='#';\n for j:=r+1 to m do\n for i:=1 to n do\n b[i,j]:='#';\n for i:=1 to n do\n begin\n for j:=1 to m do\n write(b[i,j]);\n writeln;\n end;\n for i:=1 to n do\n begin\n for j:=1 to m do\n if (i<=d) and (i>=u) and (j>=l) and (j<=r) then write('#')\n else write('.');\n writeln;\n end;\n end.\n", "language": "Pascal", "metadata": {"date": 1509379070, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p04007.html", "problem_id": "p04007", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p04007/input.txt", "sample_output_relpath": "derived/input_output/data/p04007/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p04007/Pascal/s889954292.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s889954292", "user_id": "u018679195"}, "prompt_components": {"gold_output": ".....\n#####\n#....\n#####\n.....\n\n.###.\n.#.#.\n.#.#.\n.#.#.\n.....\n", "input_to_evaluate": "program V802;\n var\n a,b:array[0..501,0..501] of char;\n i,j,m,n,u,d,l,r:longint;\n begin\n readln(n,m);\n u:=n+1;\n d:=0;\n l:=m+1;\n r:=0;\n for i:=1 to n do\n begin\n for j:=1 to m do\n begin\n read(a[i,j]);\n b[i,j]:=a[i,j];\n if a[i,j]='#' then\n begin\n if id then d:=i;\n if j>r then r:=j;\n end;\n end;\n readln;\n end;\n for i:=1 to u-1 do\n for j:=1 to m do\n b[i,j]:='#';\n for i:=d+1 to n do\n for j:=1 to m do\n b[i,j]:='#';\n for j:=1 to l-1 do\n for i:=1 to n do\n b[i,j]:='#';\n for j:=r+1 to m do\n for i:=1 to n do\n b[i,j]:='#';\n for i:=1 to n do\n begin\n for j:=1 to m do\n write(b[i,j]);\n writeln;\n end;\n for i:=1 to n do\n begin\n for j:=1 to m do\n if (i<=d) and (i>=u) and (j>=l) and (j<=r) then write('#')\n else write('.');\n writeln;\n end;\n end.\n", "problem_context": "Score : 700 points\n\nProblem Statement\n\nSnuke and Ciel went to a strange stationery store. Each of them got a transparent graph paper with H rows and W columns.\n\nSnuke painted some of the cells red in his paper. Here, the cells painted red were 4-connected, that is, it was possible to traverse from any red cell to any other red cell, by moving to vertically or horizontally adjacent red cells only.\n\nCiel painted some of the cells blue in her paper. Here, the cells painted blue were 4-connected.\n\nAfterwards, they precisely overlaid the two sheets in the same direction. Then, the intersection of the red cells and the blue cells appeared purple.\n\nYou are given a matrix of letters a_{ij} (1≤i≤H, 1≤j≤W) that describes the positions of the purple cells. If the cell at the i-th row and j-th column is purple, then a_{ij} is #, otherwise a_{ij} is .. Here, it is guaranteed that no outermost cell is purple. That is, if i=1, H or j = 1, W, then a_{ij} is ..\n\nFind a pair of the set of the positions of the red cells and the blue cells that is consistent with the situation described. It can be shown that a solution always exists.\n\nConstraints\n\n3≤H,W≤500\n\na_{ij} is # or ..\n\nIf i=1,H or j=1,W, then a_{ij} is ..\n\nAt least one of a_{ij} is #.\n\nInput\n\nThe input 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 a pair of the set of the positions of the red cells and the blue cells that is consistent with the situation, as follows:\n\nThe first H lines should describe the positions of the red cells.\n\nThe following 1 line should be empty.\n\nThe following H lines should describe the positions of the blue cells.\n\nThe description of the positions of the red or blue cells should follow the format of the description of the positions of the purple cells.\n\nSample Input 1\n\n5 5\n.....\n.#.#.\n.....\n.#.#.\n.....\n\nSample Output 1\n\n.....\n#####\n#....\n#####\n.....\n\n.###.\n.#.#.\n.#.#.\n.#.#.\n.....\n\nOne possible pair of the set of the positions of the red cells and the blue cells is as follows:\n\nSample Input 2\n\n7 13\n.............\n.###.###.###.\n.#.#.#...#...\n.###.#...#...\n.#.#.#.#.#...\n.#.#.###.###.\n.............\n\nSample Output 2\n\n.............\n.###########.\n.###.###.###.\n.###.###.###.\n.###.###.###.\n.###.###.###.\n.............\n\n.............\n.###.###.###.\n.#.#.#...#...\n.###.#...#...\n.#.#.#.#.#...\n.#.#########.\n.............\n\nOne possible pair of the set of the positions of the red cells and the blue cells is as follows:", "sample_input": "5 5\n.....\n.#.#.\n.....\n.#.#.\n.....\n"}, "reference_outputs": [".....\n#####\n#....\n#####\n.....\n\n.###.\n.#.#.\n.#.#.\n.#.#.\n.....\n"], "source_document_id": "p04007", "source_text": "Score : 700 points\n\nProblem Statement\n\nSnuke and Ciel went to a strange stationery store. Each of them got a transparent graph paper with H rows and W columns.\n\nSnuke painted some of the cells red in his paper. Here, the cells painted red were 4-connected, that is, it was possible to traverse from any red cell to any other red cell, by moving to vertically or horizontally adjacent red cells only.\n\nCiel painted some of the cells blue in her paper. Here, the cells painted blue were 4-connected.\n\nAfterwards, they precisely overlaid the two sheets in the same direction. Then, the intersection of the red cells and the blue cells appeared purple.\n\nYou are given a matrix of letters a_{ij} (1≤i≤H, 1≤j≤W) that describes the positions of the purple cells. If the cell at the i-th row and j-th column is purple, then a_{ij} is #, otherwise a_{ij} is .. Here, it is guaranteed that no outermost cell is purple. That is, if i=1, H or j = 1, W, then a_{ij} is ..\n\nFind a pair of the set of the positions of the red cells and the blue cells that is consistent with the situation described. It can be shown that a solution always exists.\n\nConstraints\n\n3≤H,W≤500\n\na_{ij} is # or ..\n\nIf i=1,H or j=1,W, then a_{ij} is ..\n\nAt least one of a_{ij} is #.\n\nInput\n\nThe input 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 a pair of the set of the positions of the red cells and the blue cells that is consistent with the situation, as follows:\n\nThe first H lines should describe the positions of the red cells.\n\nThe following 1 line should be empty.\n\nThe following H lines should describe the positions of the blue cells.\n\nThe description of the positions of the red or blue cells should follow the format of the description of the positions of the purple cells.\n\nSample Input 1\n\n5 5\n.....\n.#.#.\n.....\n.#.#.\n.....\n\nSample Output 1\n\n.....\n#####\n#....\n#####\n.....\n\n.###.\n.#.#.\n.#.#.\n.#.#.\n.....\n\nOne possible pair of the set of the positions of the red cells and the blue cells is as follows:\n\nSample Input 2\n\n7 13\n.............\n.###.###.###.\n.#.#.#...#...\n.###.#...#...\n.#.#.#.#.#...\n.#.#.###.###.\n.............\n\nSample Output 2\n\n.............\n.###########.\n.###.###.###.\n.###.###.###.\n.###.###.###.\n.###.###.###.\n.............\n\n.............\n.###.###.###.\n.#.#.#...#...\n.###.#...#...\n.#.#.#.#.#...\n.#.#########.\n.............\n\nOne possible pair of the set of the positions of the red cells and the blue cells is as follows:", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 953, "cpu_time_ms": 20, "memory_kb": 1024}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s181986744", "group_id": "codeNet:p04010", "input_text": "var\n a, f, h, tmp: array [0..100000] of longint;\n u, v: array [1..200000] of longint;\n n, m, i, x, y, s, rt, re, cnt: longint;\nprocedure swap(var x, y: longint); inline;\nvar\n t: longint;\nbegin\n t := x;\n x := y;\n y := t;\nend;\nfunction find(x: longint): longint;\nbegin\n if x <> f[x] then f[x] := find(f[x]);\n exit(f[x]);\nend;\nprocedure add(x, y: longint); inline;\nbegin\n inc(cnt);\n u[cnt] := h[x];\n v[cnt] := y;\n h[x] := cnt;\nend;\nprocedure dfs(x, s: longint);\nvar\n i: longint;\nbegin\n a[x] := s;\n i := h[x];\n while i > 0 do\n begin\n if v[i] <> f[x] then\n begin\n f[v[i]] := x;\n dfs(v[i], -s);\n inc(a[x], a[v[i]]);\n end;\n i := u[i];\n end;\nend;\nprocedure quicksort(l, r: longint);\nvar\n i, j, m: longint;\nbegin\n i := l;\n j := r;\n m := tmp[(l + r) shr 1];\n repeat\n while tmp[i] < m do inc(i);\n while tmp[j] > m do dec(j);\n if i <= j then\n begin\n swap(tmp[i], tmp[j]);\n inc(i);\n dec(j);\n end;\n until i > j;\n if l < j then quicksort(l, j);\n if i < r then quicksort(i, r);\nend;\nbegin\n read(n, m);\n for i := 1 to n do f[i] := i;\n cnt := 0;\n rt := 1;\n re := 1;\n for i := 1 to m do\n begin\n read(x, y);\n if find(x) <> find(y) then\n begin\n f[find(x)] := find(y);\n add(x, y);\n add(y, x);\n end\n else\n begin\n rt := x;\n re := y;\n end;\n end;\n f[rt] := 0;\n dfs(rt, 1);\n if n = m then\n begin\n cnt := 0;\n i := re;\n while i > 0 do\n begin\n inc(cnt);\n tmp[cnt] := a[i];\n i := f[i];\n end;\n if odd(cnt) then\n begin\n if odd(a[rt]) then\n begin\n writeln(-1);\n halt;\n end;\n i := re;\n while i > 0 do\n begin\n dec(a[i], a[rt] div 2);\n i := f[i];\n end;\n end\n else\n begin\n if a[rt] <> 0 then\n begin\n writeln('-1');\n halt;\n end;\n quicksort(1, cnt);\n i := re;\n while i > 0 do\n begin\n dec(a[i], tmp[cnt shr 1]);\n i := f[i];\n end;\n end;\n end\n else\n if a[rt] <> 0 then\n begin\n writeln(-1);\n halt;\n end;\n s := 0;\n for i := 1 to n do inc(s, abs(a[i]));\n writeln(s);\nend.\n", "language": "Pascal", "metadata": {"date": 1572656391, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p04010.html", "problem_id": "p04010", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p04010/input.txt", "sample_output_relpath": "derived/input_output/data/p04010/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p04010/Pascal/s181986744.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s181986744", "user_id": "u214724132"}, "prompt_components": {"gold_output": "5\n", "input_to_evaluate": "var\n a, f, h, tmp: array [0..100000] of longint;\n u, v: array [1..200000] of longint;\n n, m, i, x, y, s, rt, re, cnt: longint;\nprocedure swap(var x, y: longint); inline;\nvar\n t: longint;\nbegin\n t := x;\n x := y;\n y := t;\nend;\nfunction find(x: longint): longint;\nbegin\n if x <> f[x] then f[x] := find(f[x]);\n exit(f[x]);\nend;\nprocedure add(x, y: longint); inline;\nbegin\n inc(cnt);\n u[cnt] := h[x];\n v[cnt] := y;\n h[x] := cnt;\nend;\nprocedure dfs(x, s: longint);\nvar\n i: longint;\nbegin\n a[x] := s;\n i := h[x];\n while i > 0 do\n begin\n if v[i] <> f[x] then\n begin\n f[v[i]] := x;\n dfs(v[i], -s);\n inc(a[x], a[v[i]]);\n end;\n i := u[i];\n end;\nend;\nprocedure quicksort(l, r: longint);\nvar\n i, j, m: longint;\nbegin\n i := l;\n j := r;\n m := tmp[(l + r) shr 1];\n repeat\n while tmp[i] < m do inc(i);\n while tmp[j] > m do dec(j);\n if i <= j then\n begin\n swap(tmp[i], tmp[j]);\n inc(i);\n dec(j);\n end;\n until i > j;\n if l < j then quicksort(l, j);\n if i < r then quicksort(i, r);\nend;\nbegin\n read(n, m);\n for i := 1 to n do f[i] := i;\n cnt := 0;\n rt := 1;\n re := 1;\n for i := 1 to m do\n begin\n read(x, y);\n if find(x) <> find(y) then\n begin\n f[find(x)] := find(y);\n add(x, y);\n add(y, x);\n end\n else\n begin\n rt := x;\n re := y;\n end;\n end;\n f[rt] := 0;\n dfs(rt, 1);\n if n = m then\n begin\n cnt := 0;\n i := re;\n while i > 0 do\n begin\n inc(cnt);\n tmp[cnt] := a[i];\n i := f[i];\n end;\n if odd(cnt) then\n begin\n if odd(a[rt]) then\n begin\n writeln(-1);\n halt;\n end;\n i := re;\n while i > 0 do\n begin\n dec(a[i], a[rt] div 2);\n i := f[i];\n end;\n end\n else\n begin\n if a[rt] <> 0 then\n begin\n writeln('-1');\n halt;\n end;\n quicksort(1, cnt);\n i := re;\n while i > 0 do\n begin\n dec(a[i], tmp[cnt shr 1]);\n i := f[i];\n end;\n end;\n end\n else\n if a[rt] <> 0 then\n begin\n writeln(-1);\n halt;\n end;\n s := 0;\n for i := 1 to n do inc(s, abs(a[i]));\n writeln(s);\nend.\n", "problem_context": "Score : 2200 points\n\nProblem Statement\n\nYou are given an undirected graph with N vertices and M edges.\nHere, N-1≤M≤N holds and the graph is connected.\nThere are no self-loops or multiple edges in this graph.\n\nThe vertices are numbered 1 through N, and the edges are numbered 1 through M.\nEdge i connects vertices a_i and b_i.\n\nThe color of each vertex can be either white or black.\nInitially, all the vertices are white.\nSnuke is trying to turn all the vertices black by performing the following operation some number of times:\n\nSelect a pair of adjacent vertices with the same color, and invert the colors of those vertices. That is, if the vertices are both white, then turn them black, and vice versa.\n\nDetermine if it is possible to turn all the vertices black. If the answer is positive, find the minimum number of times the operation needs to be performed in order to achieve the objective.\n\nConstraints\n\n2≤N≤10^5\n\nN-1≤M≤N\n\n1≤a_i,b_i≤N\n\nThere are no self-loops or multiple edges in the given graph.\n\nThe given graph is connected.\n\nPartial Score\n\nIn the test set worth 1500 points, M=N-1.\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\nIf it is possible to turn all the vertices black, print the minimum number of times the operation needs to be performed in order to achieve the objective.\nOtherwise, print -1 instead.\n\nSample Input 1\n\n6 5\n1 2\n1 3\n1 4\n2 5\n2 6\n\nSample Output 1\n\n5\n\nFor example, it is possible to perform the operations as shown in the following diagram:\n\nSample Input 2\n\n3 2\n1 2\n2 3\n\nSample Output 2\n\n-1\n\nIt is not possible to turn all the vertices black.\n\nSample Input 3\n\n4 4\n1 2\n2 3\n3 4\n4 1\n\nSample Output 3\n\n2\n\nThis case is not included in the test set for the partial score.\n\nSample Input 4\n\n6 6\n1 2\n2 3\n3 1\n1 4\n1 5\n1 6\n\nSample Output 4\n\n7\n\nThis case is not included in the test set for the partial score.", "sample_input": "6 5\n1 2\n1 3\n1 4\n2 5\n2 6\n"}, "reference_outputs": ["5\n"], "source_document_id": "p04010", "source_text": "Score : 2200 points\n\nProblem Statement\n\nYou are given an undirected graph with N vertices and M edges.\nHere, N-1≤M≤N holds and the graph is connected.\nThere are no self-loops or multiple edges in this graph.\n\nThe vertices are numbered 1 through N, and the edges are numbered 1 through M.\nEdge i connects vertices a_i and b_i.\n\nThe color of each vertex can be either white or black.\nInitially, all the vertices are white.\nSnuke is trying to turn all the vertices black by performing the following operation some number of times:\n\nSelect a pair of adjacent vertices with the same color, and invert the colors of those vertices. That is, if the vertices are both white, then turn them black, and vice versa.\n\nDetermine if it is possible to turn all the vertices black. If the answer is positive, find the minimum number of times the operation needs to be performed in order to achieve the objective.\n\nConstraints\n\n2≤N≤10^5\n\nN-1≤M≤N\n\n1≤a_i,b_i≤N\n\nThere are no self-loops or multiple edges in the given graph.\n\nThe given graph is connected.\n\nPartial Score\n\nIn the test set worth 1500 points, M=N-1.\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\nIf it is possible to turn all the vertices black, print the minimum number of times the operation needs to be performed in order to achieve the objective.\nOtherwise, print -1 instead.\n\nSample Input 1\n\n6 5\n1 2\n1 3\n1 4\n2 5\n2 6\n\nSample Output 1\n\n5\n\nFor example, it is possible to perform the operations as shown in the following diagram:\n\nSample Input 2\n\n3 2\n1 2\n2 3\n\nSample Output 2\n\n-1\n\nIt is not possible to turn all the vertices black.\n\nSample Input 3\n\n4 4\n1 2\n2 3\n3 4\n4 1\n\nSample Output 3\n\n2\n\nThis case is not included in the test set for the partial score.\n\nSample Input 4\n\n6 6\n1 2\n2 3\n3 1\n1 4\n1 5\n1 6\n\nSample Output 4\n\n7\n\nThis case is not included in the test set for the partial score.", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 2171, "cpu_time_ms": 41, "memory_kb": 6400}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s623669057", "group_id": "codeNet:p04012", "input_text": "program Project1;\n\n{$APPTYPE CONSOLE}\n\nuses\n SysUtils,Classes;\nvar\n i,j,min:Integer;\n w:string;\n sw:Char;\n beau:Boolean;\nbegin\n try\n { TODO -oUser -cConsole Main : ここにコードを記述してください }\n Readln(w);\n\n for i := 1 to Length(w) do begin\n min := i;\n for j := i+1 to Length(w) do begin\n if w[j] < w[min] then\n min := j;\n end;\n sw:=w[i];\n w[i]:=w[min];\n w[min]:=sw;\n end;\n\n beau:=True;\n if Length(w) mod 2 = 1 then\n beau:=false\n else begin\n i:=1;\n while i=-5000)then inc(dp[k+1,j+x],dp[k,j]);\n\t\tend;\n\tend;\n\twriteln(dp[n+1,0]-1);\nend.\n\n", "language": "Pascal", "metadata": {"date": 1561693293, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p04013.html", "problem_id": "p04013", "resource_group": "low_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/Pascal/s549294946.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s549294946", "user_id": "u657913472"}, "prompt_components": {"gold_output": "5\n", "input_to_evaluate": "var\n\tn,A,j,k,x:Longint;\n\tdp:array[1..51,-5000..5000]of int64;\nbegin\n\tread(n,A);\n\tdp[1,0]:=1;\n\tfor k:=1 to n do begin\n\t\tread(x);\n\t\tdec(x,A);\n\t\tfor j:=-5000 to 5000 do begin\n\t\t\tinc(dp[k+1,j],dp[k,j]);\n\t\t\tif(j+x<=5000)and(j+x>=-5000)then inc(dp[k+1,j+x],dp[k,j]);\n\t\tend;\n\tend;\n\twriteln(dp[n+1,0]-1);\nend.\n\n", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 4, "memory_kb": 3968}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s178977353", "group_id": "codeNet:p04015", "input_text": "const MAXN = 100000;\nvar n,a,i,j,k,x: longint;\n dp:array[0..MAXN] of int64;\n\nprocedure Nhap;\nbegin\n readln(n,a);\nend;\n\nprocedure Init;\nbegin\n dp[n*a]:= 1;\nend;\n\nprocedure QHD;\nbegin\n for k:= 1 to n do\n begin\n read(x);\n\t\tfor j:= 0 to 4999 do\n begin\n\t\t\tdp[5000 - i + j]:= dp[i + j];\n\t\t\tif (j - x + a >= 0) and (j - x + a < 5000) then\n dp[5000 - i + j]:= dp[5000 - i + j] + dp[i + j -x + a];\n\t\tend;\n\t\ti:= 5000 - i;\n\tend;\nend;\n\nBEGIN\n Nhap;\n Init;\n QHD;\n\twriteln(dp[i + n*A] - 1);\nEND.", "language": "Pascal", "metadata": {"date": 1545450171, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p04015.html", "problem_id": "p04015", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p04015/input.txt", "sample_output_relpath": "derived/input_output/data/p04015/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p04015/Pascal/s178977353.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s178977353", "user_id": "u816631826"}, "prompt_components": {"gold_output": "5\n", "input_to_evaluate": "const MAXN = 100000;\nvar n,a,i,j,k,x: longint;\n dp:array[0..MAXN] of int64;\n\nprocedure Nhap;\nbegin\n readln(n,a);\nend;\n\nprocedure Init;\nbegin\n dp[n*a]:= 1;\nend;\n\nprocedure QHD;\nbegin\n for k:= 1 to n do\n begin\n read(x);\n\t\tfor j:= 0 to 4999 do\n begin\n\t\t\tdp[5000 - i + j]:= dp[i + j];\n\t\t\tif (j - x + a >= 0) and (j - x + a < 5000) then\n dp[5000 - i + j]:= dp[5000 - i + j] + dp[i + j -x + a];\n\t\tend;\n\t\ti:= 5000 - i;\n\tend;\nend;\n\nBEGIN\n Nhap;\n Init;\n QHD;\n\twriteln(dp[i + n*A] - 1);\nEND.", "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": "p04015", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 587, "cpu_time_ms": 2, "memory_kb": 128}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s189969024", "group_id": "codeNet:p04015", "input_text": "var\n\tn,a,i,j,x,L,R:Longint;\n\tdp:array[0..50,0..5000]of int64;\nbegin\n\tread(n,a);\n\tdp[0,n*a]:=1;\n\tfor i:=1 to n do begin\n\t\tfor j:=0 to 5000 do dp[i,j]:=dp[i-1,j];\n\t\tread(x);\n\t\tx:=a-x;\n\t\tL:=-x;\n\t\tif L<0 then L:=0;\n\t\tR:=5000-x;\n\t\tif R>5000 then R:=5000;\n\t\tfor j:=L to R do begin\n\t\t\tinc(dp[i,j+x],dp[i-1,j]);\n\t\tend;\n\tend;\n\twriteln(dp[n,n*a]-1);\nend.\n", "language": "Pascal", "metadata": {"date": 1541913367, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p04015.html", "problem_id": "p04015", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p04015/input.txt", "sample_output_relpath": "derived/input_output/data/p04015/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p04015/Pascal/s189969024.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s189969024", "user_id": "u657913472"}, "prompt_components": {"gold_output": "5\n", "input_to_evaluate": "var\n\tn,a,i,j,x,L,R:Longint;\n\tdp:array[0..50,0..5000]of int64;\nbegin\n\tread(n,a);\n\tdp[0,n*a]:=1;\n\tfor i:=1 to n do begin\n\t\tfor j:=0 to 5000 do dp[i,j]:=dp[i-1,j];\n\t\tread(x);\n\t\tx:=a-x;\n\t\tL:=-x;\n\t\tif L<0 then L:=0;\n\t\tR:=5000-x;\n\t\tif R>5000 then R:=5000;\n\t\tfor j:=L to R do begin\n\t\t\tinc(dp[i,j+x],dp[i-1,j]);\n\t\tend;\n\tend;\n\twriteln(dp[n,n*a]-1);\nend.\n", "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": "p04015", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 345, "cpu_time_ms": 3, "memory_kb": 2048}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s222331331", "group_id": "codeNet:p04016", "input_text": "var\n\tn,s,b,t,c,ans,i:int64;\nfunction f(b,n:int64):int64;\nvar t,c:int64;\nbegin\n\tt:=n;\n\tc:=0;\n\twhile t>0 do begin\n\t\tc:=c+t mod b;\n\t\tt:=t div b;\n\tend;\n\tf:=c;\nend;\nbegin\n\tread(n,s);\n\tif n=s then begin\n\t\twriteln(n+1);\n\t\texit;\n\tend;\n\ti:=1;\n\tans:=n+s;\n\twhile i*i<=n do begin\n\t\tif(i>1)and(f(i,n)=s)and(ans>i)then ans:=i;\n\t\tif n div i>1 then begin\n\t\t\tt:=f(n div i,n);\n\t\t\tif(t<=s)and((s-t)mod i=0)then begin\n\t\t\t\tb:=n div i+(s-t)div i;\n\t\t\t\tif(b>1)and(f(b,n)=s)and(ans>b)then ans:=b;\n\t\t\tend;\n\t\tend;\n\t\tinc(i);\n\tend;\n\tif ans=n+s then writeln(-1)else writeln(ans);\nend.\n", "language": "Pascal", "metadata": {"date": 1539070196, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p04016.html", "problem_id": "p04016", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p04016/input.txt", "sample_output_relpath": "derived/input_output/data/p04016/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p04016/Pascal/s222331331.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s222331331", "user_id": "u657913472"}, "prompt_components": {"gold_output": "10\n", "input_to_evaluate": "var\n\tn,s,b,t,c,ans,i:int64;\nfunction f(b,n:int64):int64;\nvar t,c:int64;\nbegin\n\tt:=n;\n\tc:=0;\n\twhile t>0 do begin\n\t\tc:=c+t mod b;\n\t\tt:=t div b;\n\tend;\n\tf:=c;\nend;\nbegin\n\tread(n,s);\n\tif n=s then begin\n\t\twriteln(n+1);\n\t\texit;\n\tend;\n\ti:=1;\n\tans:=n+s;\n\twhile i*i<=n do begin\n\t\tif(i>1)and(f(i,n)=s)and(ans>i)then ans:=i;\n\t\tif n div i>1 then begin\n\t\t\tt:=f(n div i,n);\n\t\t\tif(t<=s)and((s-t)mod i=0)then begin\n\t\t\t\tb:=n div i+(s-t)div i;\n\t\t\t\tif(b>1)and(f(b,n)=s)and(ans>b)then ans:=b;\n\t\t\tend;\n\t\tend;\n\t\tinc(i);\n\tend;\n\tif ans=n+s then writeln(-1)else writeln(ans);\nend.\n", "problem_context": "Score : 500 points\n\nProblem Statement\n\nFor integers b (b \\geq 2) and n (n \\geq 1), let the function f(b,n) be defined as follows:\n\nf(b,n) = n, when n < b\n\nf(b,n) = f(b,\\,{\\rm floor}(n / b)) + (n \\ {\\rm mod} \\ b), when n \\geq b\n\nHere, {\\rm floor}(n / b) denotes the largest integer not exceeding n / b,\nand n \\ {\\rm mod} \\ b denotes the remainder of n divided by b.\n\nLess formally, f(b,n) is equal to the sum of the digits of n written in base b.\nFor example, the following hold:\n\nf(10,\\,87654)=8+7+6+5+4=30\n\nf(100,\\,87654)=8+76+54=138\n\nYou are given integers n and s.\nDetermine if there exists an integer b (b \\geq 2) such that f(b,n)=s.\nIf the answer is positive, also find the smallest such b.\n\nConstraints\n\n1 \\leq n \\leq 10^{11}\n\n1 \\leq s \\leq 10^{11}\n\nn,\\,s are integers.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nn\ns\n\nOutput\n\nIf there exists an integer b (b \\geq 2) such that f(b,n)=s, print the smallest such b.\nIf such b does not exist, print -1 instead.\n\nSample Input 1\n\n87654\n30\n\nSample Output 1\n\n10\n\nSample Input 2\n\n87654\n138\n\nSample Output 2\n\n100\n\nSample Input 3\n\n87654\n45678\n\nSample Output 3\n\n-1\n\nSample Input 4\n\n31415926535\n1\n\nSample Output 4\n\n31415926535\n\nSample Input 5\n\n1\n31415926535\n\nSample Output 5\n\n-1", "sample_input": "87654\n30\n"}, "reference_outputs": ["10\n"], "source_document_id": "p04016", "source_text": "Score : 500 points\n\nProblem Statement\n\nFor integers b (b \\geq 2) and n (n \\geq 1), let the function f(b,n) be defined as follows:\n\nf(b,n) = n, when n < b\n\nf(b,n) = f(b,\\,{\\rm floor}(n / b)) + (n \\ {\\rm mod} \\ b), when n \\geq b\n\nHere, {\\rm floor}(n / b) denotes the largest integer not exceeding n / b,\nand n \\ {\\rm mod} \\ b denotes the remainder of n divided by b.\n\nLess formally, f(b,n) is equal to the sum of the digits of n written in base b.\nFor example, the following hold:\n\nf(10,\\,87654)=8+7+6+5+4=30\n\nf(100,\\,87654)=8+76+54=138\n\nYou are given integers n and s.\nDetermine if there exists an integer b (b \\geq 2) such that f(b,n)=s.\nIf the answer is positive, also find the smallest such b.\n\nConstraints\n\n1 \\leq n \\leq 10^{11}\n\n1 \\leq s \\leq 10^{11}\n\nn,\\,s are integers.\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nn\ns\n\nOutput\n\nIf there exists an integer b (b \\geq 2) such that f(b,n)=s, print the smallest such b.\nIf such b does not exist, print -1 instead.\n\nSample Input 1\n\n87654\n30\n\nSample Output 1\n\n10\n\nSample Input 2\n\n87654\n138\n\nSample Output 2\n\n100\n\nSample Input 3\n\n87654\n45678\n\nSample Output 3\n\n-1\n\nSample Input 4\n\n31415926535\n1\n\nSample Output 4\n\n31415926535\n\nSample Input 5\n\n1\n31415926535\n\nSample Output 5\n\n-1", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 555, "cpu_time_ms": 41, "memory_kb": 128}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s631051506", "group_id": "codeNet:p04019", "input_text": "var a,b,c,d:longint;\n e:char;\nbegin\n while true do\n begin\n read(e);\n if e=chr(13) then\n break;\n case e of\n 'W':inc(a);\n 'N':inc(b);\n 'E':inc(c);\n 'S':inc(d);\n end;\n end;\n if (a=c) and (a in [0,1]) and (b=d) and (b in [0,1]) then\n writeln('Yes')\n else\n writeln('No');\nend.", "language": "Pascal", "metadata": {"date": 1583437678, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p04019.html", "problem_id": "p04019", "resource_group": "low_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/Pascal/s631051506.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s631051506", "user_id": "u743614777"}, "prompt_components": {"gold_output": "Yes\n", "input_to_evaluate": "var a,b,c,d:longint;\n e:char;\nbegin\n while true do\n begin\n read(e);\n if e=chr(13) then\n break;\n case e of\n 'W':inc(a);\n 'N':inc(b);\n 'E':inc(c);\n 'S':inc(d);\n end;\n end;\n if (a=c) and (a in [0,1]) and (b=d) and (b in [0,1]) then\n writeln('Yes')\n else\n writeln('No');\nend.", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 2103, "memory_kb": 128}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s423277108", "group_id": "codeNet:p04020", "input_text": "var N,i:Longint;\npre,ans,c:int64;\nbegin\nread(N);\nfor i:=1 to N do begin\nread(c);\nif c=0 then pre:=0 else begin\ninc(ans,(c+pre)div 2);\npre:=(c+pre)mod 2;\nend;\nend;\nwriteln(ans);\nend.", "language": "Pascal", "metadata": {"date": 1579566612, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p04020.html", "problem_id": "p04020", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p04020/input.txt", "sample_output_relpath": "derived/input_output/data/p04020/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p04020/Pascal/s423277108.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s423277108", "user_id": "u657913472"}, "prompt_components": {"gold_output": "4\n", "input_to_evaluate": "var N,i:Longint;\npre,ans,c:int64;\nbegin\nread(N);\nfor i:=1 to N do begin\nread(c);\nif c=0 then pre:=0 else begin\ninc(ans,(c+pre)div 2);\npre:=(c+pre)mod 2;\nend;\nend;\nwriteln(ans);\nend.", "problem_context": "Score : 400 points\n\nProblem Statement\n\nSnuke has a large collection of cards. Each card has an integer between 1 and N, inclusive, written on it.\nHe has A_i cards with an integer i.\n\nTwo cards can form a pair if the absolute value of the difference of the integers written on them is at most 1.\n\nSnuke wants to create the maximum number of pairs from his cards, on the condition that no card should be used in multiple pairs. Find the maximum number of pairs that he can create.\n\nConstraints\n\n1 ≦ N ≦ 10^5\n\n0 ≦ A_i ≦ 10^9 (1 ≦ i ≦ N)\n\nAll input values are integers.\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 maximum number of pairs that Snuke can create.\n\nSample Input 1\n\n4\n4\n0\n3\n2\n\nSample Output 1\n\n4\n\nFor example, Snuke can create the following four pairs: (1,1),(1,1),(3,4),(3,4).\n\nSample Input 2\n\n8\n2\n0\n1\n6\n0\n8\n2\n1\n\nSample Output 2\n\n9", "sample_input": "4\n4\n0\n3\n2\n"}, "reference_outputs": ["4\n"], "source_document_id": "p04020", "source_text": "Score : 400 points\n\nProblem Statement\n\nSnuke has a large collection of cards. Each card has an integer between 1 and N, inclusive, written on it.\nHe has A_i cards with an integer i.\n\nTwo cards can form a pair if the absolute value of the difference of the integers written on them is at most 1.\n\nSnuke wants to create the maximum number of pairs from his cards, on the condition that no card should be used in multiple pairs. Find the maximum number of pairs that he can create.\n\nConstraints\n\n1 ≦ N ≦ 10^5\n\n0 ≦ A_i ≦ 10^9 (1 ≦ i ≦ N)\n\nAll input values are integers.\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 maximum number of pairs that Snuke can create.\n\nSample Input 1\n\n4\n4\n0\n3\n2\n\nSample Output 1\n\n4\n\nFor example, Snuke can create the following four pairs: (1,1),(1,1),(3,4),(3,4).\n\nSample Input 2\n\n8\n2\n0\n1\n6\n0\n8\n2\n1\n\nSample Output 2\n\n9", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 17, "memory_kb": 128}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s437894865", "group_id": "codeNet:p04021", "input_text": "program taska;\nvar n, a, i, temp, cnt : longint;\n p : array[1..1000] of longint;\nbegin\n readln(n);\n for i := 1 to n do\n begin\n readln(a);\n p[i] := a;\n end;\n \n for i := 1 to n do\n begin\n if p[i] > p[i + 2] then\n begin\n temp := p[i];\n p[i] := p[i + 2];\n p[i + 2] := temp;\n end\n else \n begin\n temp := p[i];\n p[i] := p[i + 1];\n p[i + 1] := temp;\n inc(cnt); \n end;\n end;\n writeln(cnt);\nend.", "language": "Pascal", "metadata": {"date": 1596662786, "filename_ext": "pas", "original_language": "Pascal (FPC 3.0.4)", "problem_description_relpath": "problem_descriptions/p04021.html", "problem_id": "p04021", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p04021/input.txt", "sample_output_relpath": "derived/input_output/data/p04021/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p04021/Pascal/s437894865.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Runtime Error", "submission_id": "s437894865", "user_id": "u816631826"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "program taska;\nvar n, a, i, temp, cnt : longint;\n p : array[1..1000] of longint;\nbegin\n readln(n);\n for i := 1 to n do\n begin\n readln(a);\n p[i] := a;\n end;\n \n for i := 1 to n do\n begin\n if p[i] > p[i + 2] then\n begin\n temp := p[i];\n p[i] := p[i + 2];\n p[i + 2] := temp;\n end\n else \n begin\n temp := p[i];\n p[i] := p[i + 1];\n p[i + 1] := temp;\n inc(cnt); \n end;\n end;\n writeln(cnt);\nend.", "problem_context": "Score : 600 points\n\nProblem Statement\n\nSnuke got an integer sequence of length N from his mother, as a birthday present. The i-th (1 ≦ i ≦ N) element of the sequence is a_i. The elements are pairwise distinct.\nHe is sorting this sequence in increasing order.\nWith supernatural power, he can perform the following two operations on the sequence in any order:\n\nOperation 1: choose 2 consecutive elements, then reverse the order of those elements.\n\nOperation 2: choose 3 consecutive elements, then reverse the order of those elements.\n\nSnuke likes Operation 2, but not Operation 1. Find the minimum number of Operation 1 that he has to perform in order to sort the sequence in increasing order.\n\nConstraints\n\n1 ≦ N ≦ 10^5\n\n0 ≦ A_i ≦ 10^9\n\nIf i ≠ j, then A_i ≠ A_j.\n\nAll input values are integers.\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 minimum number of times Operation 1 that Snuke has to perform.\n\nSample Input 1\n\n4\n2\n4\n3\n1\n\nSample Output 1\n\n1\n\nThe given sequence can be sorted as follows:\n\nFirst, reverse the order of the last three elements. The sequence is now: 2,1,3,4.\n\nThen, reverse the order of the first two elements. The sequence is now: 1,2,3,4.\n\nIn this sequence of operations, Operation 1 is performed once. It is not possible to sort the sequence with less number of Operation 1, thus the answer is 1.\n\nSample Input 2\n\n5\n10\n8\n5\n3\n2\n\nSample Output 2\n\n0", "sample_input": "4\n2\n4\n3\n1\n"}, "reference_outputs": ["1\n"], "source_document_id": "p04021", "source_text": "Score : 600 points\n\nProblem Statement\n\nSnuke got an integer sequence of length N from his mother, as a birthday present. The i-th (1 ≦ i ≦ N) element of the sequence is a_i. The elements are pairwise distinct.\nHe is sorting this sequence in increasing order.\nWith supernatural power, he can perform the following two operations on the sequence in any order:\n\nOperation 1: choose 2 consecutive elements, then reverse the order of those elements.\n\nOperation 2: choose 3 consecutive elements, then reverse the order of those elements.\n\nSnuke likes Operation 2, but not Operation 1. Find the minimum number of Operation 1 that he has to perform in order to sort the sequence in increasing order.\n\nConstraints\n\n1 ≦ N ≦ 10^5\n\n0 ≦ A_i ≦ 10^9\n\nIf i ≠ j, then A_i ≠ A_j.\n\nAll input values are integers.\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 minimum number of times Operation 1 that Snuke has to perform.\n\nSample Input 1\n\n4\n2\n4\n3\n1\n\nSample Output 1\n\n1\n\nThe given sequence can be sorted as follows:\n\nFirst, reverse the order of the last three elements. The sequence is now: 2,1,3,4.\n\nThen, reverse the order of the first two elements. The sequence is now: 1,2,3,4.\n\nIn this sequence of operations, Operation 1 is performed once. It is not possible to sort the sequence with less number of Operation 1, thus the answer is 1.\n\nSample Input 2\n\n5\n10\n8\n5\n3\n2\n\nSample Output 2\n\n0", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 550, "cpu_time_ms": 5, "memory_kb": 1388}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s919294889", "group_id": "codeNet:p04021", "input_text": "program taskB;\nvar o:array[1..100000]of longint;\n n,i,j,sum,temp:longint;\nbegin\nreadln(n);\nfor i:=1 to n do\nreadln(o[i]);\nfor i:=1 to n do\nbegin\n for j:=1 to n-2 do\n begin\n if o[j]>o[j+2] then\n begin\n temp:=o[j];\n o[j]:=o[j+2];\n o[j+2]:=temp;\n end;\n end;\nend;\nfor i:=1 to n do\nbegin\n for j:=1 to n-1 do\n begin\n if o[j]>o[j+1] then\n begin\n sum:=sum+1;\n temp:=o[j];\n o[j]:=o[j+1];\n o[j+1]:=temp;\n end;\n end;\nend;\nwriteln(sum);\nend.\n", "language": "Pascal", "metadata": {"date": 1502308519, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p04021.html", "problem_id": "p04021", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p04021/input.txt", "sample_output_relpath": "derived/input_output/data/p04021/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p04021/Pascal/s919294889.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Time Limit Exceeded", "submission_id": "s919294889", "user_id": "u089230684"}, "prompt_components": {"gold_output": "1\n", "input_to_evaluate": "program taskB;\nvar o:array[1..100000]of longint;\n n,i,j,sum,temp:longint;\nbegin\nreadln(n);\nfor i:=1 to n do\nreadln(o[i]);\nfor i:=1 to n do\nbegin\n for j:=1 to n-2 do\n begin\n if o[j]>o[j+2] then\n begin\n temp:=o[j];\n o[j]:=o[j+2];\n o[j+2]:=temp;\n end;\n end;\nend;\nfor i:=1 to n do\nbegin\n for j:=1 to n-1 do\n begin\n if o[j]>o[j+1] then\n begin\n sum:=sum+1;\n temp:=o[j];\n o[j]:=o[j+1];\n o[j+1]:=temp;\n end;\n end;\nend;\nwriteln(sum);\nend.\n", "problem_context": "Score : 600 points\n\nProblem Statement\n\nSnuke got an integer sequence of length N from his mother, as a birthday present. The i-th (1 ≦ i ≦ N) element of the sequence is a_i. The elements are pairwise distinct.\nHe is sorting this sequence in increasing order.\nWith supernatural power, he can perform the following two operations on the sequence in any order:\n\nOperation 1: choose 2 consecutive elements, then reverse the order of those elements.\n\nOperation 2: choose 3 consecutive elements, then reverse the order of those elements.\n\nSnuke likes Operation 2, but not Operation 1. Find the minimum number of Operation 1 that he has to perform in order to sort the sequence in increasing order.\n\nConstraints\n\n1 ≦ N ≦ 10^5\n\n0 ≦ A_i ≦ 10^9\n\nIf i ≠ j, then A_i ≠ A_j.\n\nAll input values are integers.\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 minimum number of times Operation 1 that Snuke has to perform.\n\nSample Input 1\n\n4\n2\n4\n3\n1\n\nSample Output 1\n\n1\n\nThe given sequence can be sorted as follows:\n\nFirst, reverse the order of the last three elements. The sequence is now: 2,1,3,4.\n\nThen, reverse the order of the first two elements. The sequence is now: 1,2,3,4.\n\nIn this sequence of operations, Operation 1 is performed once. It is not possible to sort the sequence with less number of Operation 1, thus the answer is 1.\n\nSample Input 2\n\n5\n10\n8\n5\n3\n2\n\nSample Output 2\n\n0", "sample_input": "4\n2\n4\n3\n1\n"}, "reference_outputs": ["1\n"], "source_document_id": "p04021", "source_text": "Score : 600 points\n\nProblem Statement\n\nSnuke got an integer sequence of length N from his mother, as a birthday present. The i-th (1 ≦ i ≦ N) element of the sequence is a_i. The elements are pairwise distinct.\nHe is sorting this sequence in increasing order.\nWith supernatural power, he can perform the following two operations on the sequence in any order:\n\nOperation 1: choose 2 consecutive elements, then reverse the order of those elements.\n\nOperation 2: choose 3 consecutive elements, then reverse the order of those elements.\n\nSnuke likes Operation 2, but not Operation 1. Find the minimum number of Operation 1 that he has to perform in order to sort the sequence in increasing order.\n\nConstraints\n\n1 ≦ N ≦ 10^5\n\n0 ≦ A_i ≦ 10^9\n\nIf i ≠ j, then A_i ≠ A_j.\n\nAll input values are integers.\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 minimum number of times Operation 1 that Snuke has to perform.\n\nSample Input 1\n\n4\n2\n4\n3\n1\n\nSample Output 1\n\n1\n\nThe given sequence can be sorted as follows:\n\nFirst, reverse the order of the last three elements. The sequence is now: 2,1,3,4.\n\nThen, reverse the order of the first two elements. The sequence is now: 1,2,3,4.\n\nIn this sequence of operations, Operation 1 is performed once. It is not possible to sort the sequence with less number of Operation 1, thus the answer is 1.\n\nSample Input 2\n\n5\n10\n8\n5\n3\n2\n\nSample Output 2\n\n0", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 2107, "memory_kb": 512}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s853449083", "group_id": "codeNet:p04026", "input_text": "var\n\tn,i:Longint;\n\ts:String;\nbegin\n\tsetLength(s,100000);\n\treadln(s);\n\tn:=length(s);\n\ti:=1;\n\twhile(i0 then writeln('Positive')\n else if s=0 then writeln('Zero')\n else writeln('Negative');\nend.", "language": "Pascal", "metadata": {"date": 1532804082, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p04033.html", "problem_id": "p04033", "resource_group": "low_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/Pascal/s304442535.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s304442535", "user_id": "u247366051"}, "prompt_components": {"gold_output": "Positive\n", "input_to_evaluate": "var\n s:int64;\n i,a,b:longint;\nbegin\n read(a,b);\n s:=1;\n for i:=a+1 to b-1 do s:=s+i;\n if s>0 then writeln('Positive')\n else if s=0 then writeln('Zero')\n else writeln('Negative');\nend.", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": 1293, "memory_kb": 128}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s516761153", "group_id": "codeNet:p04037", "input_text": "var n,i,tot,min:longint;\ns:array[1..100000] of longint;\nbegin\n readln(n);\n for i:=1 to n do begin\n read(s[i]);\n if s[i]0 do begin\n\t\tif D[n mod 10]then begin\n\t\t\tf:=True;\n\t\t\texit;\n\t\tend;\n\t\tn:=n div 10;\n\tend;\n\tf:=False;\nend;\nbegin\n\tread(N,K);\n\tfor i:=1 to K do begin\n\t\tread(a);\n\t\tD[a]:=True;\n\tend;\n\twhile f(N)do inc(N);\n\twriteln(N);\nend.\n", "language": "Pascal", "metadata": {"date": 1582113071, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p04039.html", "problem_id": "p04039", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p04039/input.txt", "sample_output_relpath": "derived/input_output/data/p04039/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p04039/Pascal/s403021597.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s403021597", "user_id": "u657913472"}, "prompt_components": {"gold_output": "2000\n", "input_to_evaluate": "var\n\tN,K,i,a:Longint;\n\tD:Array[0..9]of Boolean;\nfunction f(n:Longint):Boolean;\nbegin\n\twhile n>0 do begin\n\t\tif D[n mod 10]then begin\n\t\t\tf:=True;\n\t\t\texit;\n\t\tend;\n\t\tn:=n div 10;\n\tend;\n\tf:=False;\nend;\nbegin\n\tread(N,K);\n\tfor i:=1 to K do begin\n\t\tread(a);\n\t\tD[a]:=True;\n\tend;\n\twhile f(N)do inc(N);\n\twriteln(N);\nend.\n", "problem_context": "Score : 300 points\n\nProblem Statement\n\nIroha is very particular about numbers. There are K digits that she dislikes: D_1, D_2, ..., D_K.\n\nShe is shopping, and now paying at the cashier.\nHer total is N yen (the currency of Japan), thus she has to hand at least N yen to the cashier (and possibly receive the change).\n\nHowever, as mentioned before, she is very particular about numbers. When she hands money to the cashier, the decimal notation of the amount must not contain any digits that she dislikes. Under this condition, she will hand the minimum amount of money.\n\nFind the amount of money that she will hand to the cashier.\n\nConstraints\n\n1 ≦ N < 10000\n\n1 ≦ K < 10\n\n0 ≦ D_1 < D_2 < … < D_K≦9\n\n\\{D_1,D_2,...,D_K\\} ≠ \\{1,2,3,4,5,6,7,8,9\\}\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN K\nD_1 D_2 … D_K\n\nOutput\n\nPrint the amount of money that Iroha will hand to the cashier.\n\nSample Input 1\n\n1000 8\n1 3 4 5 6 7 8 9\n\nSample Output 1\n\n2000\n\nShe dislikes all digits except 0 and 2.\n\nThe smallest integer equal to or greater than N=1000 whose decimal notation contains only 0 and 2, is 2000.\n\nSample Input 2\n\n9999 1\n0\n\nSample Output 2\n\n9999", "sample_input": "1000 8\n1 3 4 5 6 7 8 9\n"}, "reference_outputs": ["2000\n"], "source_document_id": "p04039", "source_text": "Score : 300 points\n\nProblem Statement\n\nIroha is very particular about numbers. There are K digits that she dislikes: D_1, D_2, ..., D_K.\n\nShe is shopping, and now paying at the cashier.\nHer total is N yen (the currency of Japan), thus she has to hand at least N yen to the cashier (and possibly receive the change).\n\nHowever, as mentioned before, she is very particular about numbers. When she hands money to the cashier, the decimal notation of the amount must not contain any digits that she dislikes. Under this condition, she will hand the minimum amount of money.\n\nFind the amount of money that she will hand to the cashier.\n\nConstraints\n\n1 ≦ N < 10000\n\n1 ≦ K < 10\n\n0 ≦ D_1 < D_2 < … < D_K≦9\n\n\\{D_1,D_2,...,D_K\\} ≠ \\{1,2,3,4,5,6,7,8,9\\}\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN K\nD_1 D_2 … D_K\n\nOutput\n\nPrint the amount of money that Iroha will hand to the cashier.\n\nSample Input 1\n\n1000 8\n1 3 4 5 6 7 8 9\n\nSample Output 1\n\n2000\n\nShe dislikes all digits except 0 and 2.\n\nThe smallest integer equal to or greater than N=1000 whose decimal notation contains only 0 and 2, is 2000.\n\nSample Input 2\n\n9999 1\n0\n\nSample Output 2\n\n9999", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported 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": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s178206936", "group_id": "codeNet:p04043", "input_text": "var\n a,b,c,che5,che7:integer;\nbegin\n readln(a,b,c);\n if a=5 then che5:=che5+1;\n if a=7 then che7:=che7+1;\n if b=5 then che5:=che5+1;\n if b=7 then che7:=che7+1;\n if c=5 then che5:=che5+1;\n if c=7 then che7:=che7+1;\n if (che5=2) and (che7=1) then writeLN('YES')\n ELSE WRITELN('NO');\nEND.", "language": "Pascal", "metadata": {"date": 1537924623, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p04043.html", "problem_id": "p04043", "resource_group": "low_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/Pascal/s178206936.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Accepted", "submission_id": "s178206936", "user_id": "u723721005"}, "prompt_components": {"gold_output": "YES\n", "input_to_evaluate": "var\n a,b,c,che5,che7:integer;\nbegin\n readln(a,b,c);\n if a=5 then che5:=che5+1;\n if a=7 then che7:=che7+1;\n if b=5 then che5:=che5+1;\n if b=7 then che7:=che7+1;\n if c=5 then che5:=che5+1;\n if c=7 then che7:=che7+1;\n if (che5=2) and (che7=1) then writeLN('YES')\n ELSE WRITELN('NO');\nEND.", "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": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 319, "cpu_time_ms": 3, "memory_kb": 256}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s342600649", "group_id": "codeNet:p04045", "input_text": "var\n n,i,j,m,k,d,t,t0,bit_count,bit_need,s,first_ava: Integer;\n flag,flag2:Boolean;\n bit:array[1..4] of Integer;\n bit_avaliable:array[0..9] of Boolean;\n match:array[1..6] of Integer;\n match2:array[1..6] of Integer;\n bit_out:array[1..5] of Integer;\n\nprocedure my_output(n:Integer);\nvar\n i: Integer;\nbegin\n for i := 1 to n do\n begin\n write(bit_out[i]);\n end;\n writeln;\n readln;\n readln;\nend;\n\nbegin\n readln(n,k);\n for i := 0 to 9 do\n begin\n bit_avaliable[i]:=true;\n end;\n for i := 1 to k do\n begin\n read(d);\n bit_avaliable[d]:=false;\n end;\n\n bit_count:=0;\n while n>0 do\n begin\n inc(bit_count);\n bit[bit_count]:=n mod 10;\n n:=n div 10;\n end;\n bit_need:=bit_count;\n\n t:=0;\n for j := bit_count downto 1 do\n begin\n flag2:=true;\n for i := bit[j] to 9 do\n begin\n if bit_avaliable[i] then\n begin\n flag2:=false;\n inc(t);\n match[t]:=i;\n flag:=true;\n for m := i+1 to 9 do\n begin\n if bit_avaliable[m] then\n begin\n match2[t]:=m;\n flag:=false;\n break;\n end;\n end;\n if flag then\n begin\n match2[t]:=-1;\n end;\n break;\n end;\n end;\n if flag2 then\n begin\n t0:=t;\n while (t0>0) and (match2[t0]=-1) do\n begin\n dec(t0);\n end;\n if t0=0 then\n begin\n inc(bit_need);\n for i := 1 to 9 do\n begin//get first avaliable\n if bit_avaliable[i] then\n begin\n first_ava:=i;\n break;\n end;\n end;\n for s := 1 to bit_need do\n begin\n bit_out[s]:=first_ava;\n end;\n my_output(bit_need);\n exit;\n end\n else\n begin\n for s := 1 to bit_need do\n begin\n bit_out[s]:=match[s];\n end;\n bit_out[t0]:=match2[t0];\n my_output(bit_need);\n exit;\n end;\n end;\n end;\n\n for s := 1 to bit_need do\n begin\n bit_out[s]:=match[s];\n end;\n my_output(bit_need);\nend.", "language": "Pascal", "metadata": {"date": 1515968085, "filename_ext": "pas", "original_language": "Pascal (FPC 2.6.2)", "problem_description_relpath": "problem_descriptions/p04045.html", "problem_id": "p04045", "resource_group": "low_resource", "sample_input_relpath": "derived/input_output/data/p04045/input.txt", "sample_output_relpath": "derived/input_output/data/p04045/output.txt", "source_dataset": "Project CodeNet", "source_relpath": "data/p04045/Pascal/s342600649.pas", "split_policy": "Global OOD problem IDs are disjoint from train, validation, and in-distribution test problem IDs.", "status": "Wrong Answer", "submission_id": "s342600649", "user_id": "u403323882"}, "prompt_components": {"gold_output": "2000\n", "input_to_evaluate": "var\n n,i,j,m,k,d,t,t0,bit_count,bit_need,s,first_ava: Integer;\n flag,flag2:Boolean;\n bit:array[1..4] of Integer;\n bit_avaliable:array[0..9] of Boolean;\n match:array[1..6] of Integer;\n match2:array[1..6] of Integer;\n bit_out:array[1..5] of Integer;\n\nprocedure my_output(n:Integer);\nvar\n i: Integer;\nbegin\n for i := 1 to n do\n begin\n write(bit_out[i]);\n end;\n writeln;\n readln;\n readln;\nend;\n\nbegin\n readln(n,k);\n for i := 0 to 9 do\n begin\n bit_avaliable[i]:=true;\n end;\n for i := 1 to k do\n begin\n read(d);\n bit_avaliable[d]:=false;\n end;\n\n bit_count:=0;\n while n>0 do\n begin\n inc(bit_count);\n bit[bit_count]:=n mod 10;\n n:=n div 10;\n end;\n bit_need:=bit_count;\n\n t:=0;\n for j := bit_count downto 1 do\n begin\n flag2:=true;\n for i := bit[j] to 9 do\n begin\n if bit_avaliable[i] then\n begin\n flag2:=false;\n inc(t);\n match[t]:=i;\n flag:=true;\n for m := i+1 to 9 do\n begin\n if bit_avaliable[m] then\n begin\n match2[t]:=m;\n flag:=false;\n break;\n end;\n end;\n if flag then\n begin\n match2[t]:=-1;\n end;\n break;\n end;\n end;\n if flag2 then\n begin\n t0:=t;\n while (t0>0) and (match2[t0]=-1) do\n begin\n dec(t0);\n end;\n if t0=0 then\n begin\n inc(bit_need);\n for i := 1 to 9 do\n begin//get first avaliable\n if bit_avaliable[i] then\n begin\n first_ava:=i;\n break;\n end;\n end;\n for s := 1 to bit_need do\n begin\n bit_out[s]:=first_ava;\n end;\n my_output(bit_need);\n exit;\n end\n else\n begin\n for s := 1 to bit_need do\n begin\n bit_out[s]:=match[s];\n end;\n bit_out[t0]:=match2[t0];\n my_output(bit_need);\n exit;\n end;\n end;\n end;\n\n for s := 1 to bit_need do\n begin\n bit_out[s]:=match[s];\n end;\n my_output(bit_need);\nend.", "problem_context": "Score : 300 points\n\nProblem Statement\n\nIroha is very particular about numbers. There are K digits that she dislikes: D_1, D_2, ..., D_K.\n\nShe is shopping, and now paying at the cashier.\nHer total is N yen (the currency of Japan), thus she has to hand at least N yen to the cashier (and possibly receive the change).\n\nHowever, as mentioned before, she is very particular about numbers. When she hands money to the cashier, the decimal notation of the amount must not contain any digits that she dislikes. Under this condition, she will hand the minimum amount of money.\n\nFind the amount of money that she will hand to the cashier.\n\nConstraints\n\n1 ≦ N < 10000\n\n1 ≦ K < 10\n\n0 ≦ D_1 < D_2 < … < D_K≦9\n\n\\{D_1,D_2,...,D_K\\} ≠ \\{1,2,3,4,5,6,7,8,9\\}\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN K\nD_1 D_2 … D_K\n\nOutput\n\nPrint the amount of money that Iroha will hand to the cashier.\n\nSample Input 1\n\n1000 8\n1 3 4 5 6 7 8 9\n\nSample Output 1\n\n2000\n\nShe dislikes all digits except 0 and 2.\n\nThe smallest integer equal to or greater than N=1000 whose decimal notation contains only 0 and 2, is 2000.\n\nSample Input 2\n\n9999 1\n0\n\nSample Output 2\n\n9999", "sample_input": "1000 8\n1 3 4 5 6 7 8 9\n"}, "reference_outputs": ["2000\n"], "source_document_id": "p04045", "source_text": "Score : 300 points\n\nProblem Statement\n\nIroha is very particular about numbers. There are K digits that she dislikes: D_1, D_2, ..., D_K.\n\nShe is shopping, and now paying at the cashier.\nHer total is N yen (the currency of Japan), thus she has to hand at least N yen to the cashier (and possibly receive the change).\n\nHowever, as mentioned before, she is very particular about numbers. When she hands money to the cashier, the decimal notation of the amount must not contain any digits that she dislikes. Under this condition, she will hand the minimum amount of money.\n\nFind the amount of money that she will hand to the cashier.\n\nConstraints\n\n1 ≦ N < 10000\n\n1 ≦ K < 10\n\n0 ≦ D_1 < D_2 < … < D_K≦9\n\n\\{D_1,D_2,...,D_K\\} ≠ \\{1,2,3,4,5,6,7,8,9\\}\n\nInput\n\nThe input is given from Standard Input in the following format:\n\nN K\nD_1 D_2 … D_K\n\nOutput\n\nPrint the amount of money that Iroha will hand to the cashier.\n\nSample Input 1\n\n1000 8\n1 3 4 5 6 7 8 9\n\nSample Output 1\n\n2000\n\nShe dislikes all digits except 0 and 2.\n\nThe smallest integer equal to or greater than N=1000 whose decimal notation contains only 0 and 2, is 2000.\n\nSample Input 2\n\n9999 1\n0\n\nSample Output 2\n\n9999", "split": "train", "target_descriptions": {"code_size_bytes": "Submitted source-code file size, in bytes.", "cpu_time_ms": "Execution CPU time reported by official Project CodeNet metadata, in milliseconds.", "memory_kb": "Peak memory usage reported by official Project CodeNet metadata, in kilobytes."}, "targets": {"code_size_bytes": 2633, "cpu_time_ms": 3, "memory_kb": 128}, "variant": "low_resource"} {"dataset": "codeNet", "domain": "code_generation", "example_id": "codeNet:Pascal:s354877348", "group_id": "codeNet:p04047", "input_text": "uses math;\nvar\n n,i,j,s,t:longint;\n a:array[1..1000]of longint;\nbegin\n readln(n);\n for i:=1 to n*2 do read(a[i]);\n for i:=1 to n*2-1 do\n for j:=i+1 to n*2 do\n if a[i]